1 // SPDX-License-Identifier: GPL-2.0-only <<
2 /* 1 /*
3 * Copyright (C) Sistina Software, Inc. 1997- 2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
4 * Copyright (C) 2004-2006 Red Hat, Inc. All 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.
5 */ 8 */
6 9
7 #include <linux/sched.h> 10 #include <linux/sched.h>
8 #include <linux/slab.h> 11 #include <linux/slab.h>
9 #include <linux/spinlock.h> 12 #include <linux/spinlock.h>
10 #include <linux/completion.h> 13 #include <linux/completion.h>
11 #include <linux/buffer_head.h> 14 #include <linux/buffer_head.h>
12 #include <linux/mempool.h> 15 #include <linux/mempool.h>
13 #include <linux/gfs2_ondisk.h> 16 #include <linux/gfs2_ondisk.h>
14 #include <linux/bio.h> 17 #include <linux/bio.h>
15 #include <linux/fs.h> 18 #include <linux/fs.h>
16 #include <linux/list_sort.h> 19 #include <linux/list_sort.h>
17 #include <linux/blkdev.h> <<
18 20
19 #include "bmap.h" <<
20 #include "dir.h" <<
21 #include "gfs2.h" 21 #include "gfs2.h"
22 #include "incore.h" 22 #include "incore.h"
23 #include "inode.h" 23 #include "inode.h"
24 #include "glock.h" 24 #include "glock.h"
25 #include "glops.h" <<
26 #include "log.h" 25 #include "log.h"
27 #include "lops.h" 26 #include "lops.h"
28 #include "meta_io.h" 27 #include "meta_io.h"
29 #include "recovery.h" 28 #include "recovery.h"
30 #include "rgrp.h" 29 #include "rgrp.h"
31 #include "trans.h" 30 #include "trans.h"
32 #include "util.h" 31 #include "util.h"
33 #include "trace_gfs2.h" 32 #include "trace_gfs2.h"
34 33
35 /** 34 /**
36 * gfs2_pin - Pin a buffer in memory 35 * gfs2_pin - Pin a buffer in memory
37 * @sdp: The superblock 36 * @sdp: The superblock
38 * @bh: The buffer to be pinned 37 * @bh: The buffer to be pinned
39 * 38 *
40 * The log lock must be held when calling this 39 * The log lock must be held when calling this function
41 */ 40 */
42 void gfs2_pin(struct gfs2_sbd *sdp, struct buf 41 void gfs2_pin(struct gfs2_sbd *sdp, struct buffer_head *bh)
43 { 42 {
44 struct gfs2_bufdata *bd; 43 struct gfs2_bufdata *bd;
45 44
46 BUG_ON(!current->journal_info); 45 BUG_ON(!current->journal_info);
47 46
48 clear_buffer_dirty(bh); 47 clear_buffer_dirty(bh);
49 if (test_set_buffer_pinned(bh)) 48 if (test_set_buffer_pinned(bh))
50 gfs2_assert_withdraw(sdp, 0); 49 gfs2_assert_withdraw(sdp, 0);
51 if (!buffer_uptodate(bh)) 50 if (!buffer_uptodate(bh))
52 gfs2_io_error_bh_wd(sdp, bh); !! 51 gfs2_io_error_bh(sdp, bh);
53 bd = bh->b_private; 52 bd = bh->b_private;
54 /* If this buffer is in the AIL and it 53 /* If this buffer is in the AIL and it has already been written
55 * to in-place disk block, remove it f 54 * to in-place disk block, remove it from the AIL.
56 */ 55 */
57 spin_lock(&sdp->sd_ail_lock); 56 spin_lock(&sdp->sd_ail_lock);
58 if (bd->bd_tr) 57 if (bd->bd_tr)
59 list_move(&bd->bd_ail_st_list, 58 list_move(&bd->bd_ail_st_list, &bd->bd_tr->tr_ail2_list);
60 spin_unlock(&sdp->sd_ail_lock); 59 spin_unlock(&sdp->sd_ail_lock);
61 get_bh(bh); 60 get_bh(bh);
62 atomic_inc(&sdp->sd_log_pinned); 61 atomic_inc(&sdp->sd_log_pinned);
63 trace_gfs2_pin(bd, 1); 62 trace_gfs2_pin(bd, 1);
64 } 63 }
65 64
66 static bool buffer_is_rgrp(const struct gfs2_b 65 static bool buffer_is_rgrp(const struct gfs2_bufdata *bd)
67 { 66 {
68 return bd->bd_gl->gl_name.ln_type == L 67 return bd->bd_gl->gl_name.ln_type == LM_TYPE_RGRP;
69 } 68 }
70 69
71 static void maybe_release_space(struct gfs2_bu 70 static void maybe_release_space(struct gfs2_bufdata *bd)
72 { 71 {
73 struct gfs2_glock *gl = bd->bd_gl; 72 struct gfs2_glock *gl = bd->bd_gl;
74 struct gfs2_sbd *sdp = gl->gl_name.ln_ 73 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
75 struct gfs2_rgrpd *rgd = gfs2_glock2rg 74 struct gfs2_rgrpd *rgd = gfs2_glock2rgrp(gl);
76 unsigned int index = bd->bd_bh->b_bloc 75 unsigned int index = bd->bd_bh->b_blocknr - gl->gl_name.ln_number;
77 struct gfs2_bitmap *bi = rgd->rd_bits 76 struct gfs2_bitmap *bi = rgd->rd_bits + index;
78 77
79 rgrp_lock_local(rgd); <<
80 if (bi->bi_clone == NULL) 78 if (bi->bi_clone == NULL)
81 goto out; !! 79 return;
82 if (sdp->sd_args.ar_discard) 80 if (sdp->sd_args.ar_discard)
83 gfs2_rgrp_send_discards(sdp, r 81 gfs2_rgrp_send_discards(sdp, rgd->rd_data0, bd->bd_bh, bi, 1, NULL);
84 memcpy(bi->bi_clone + bi->bi_offset, 82 memcpy(bi->bi_clone + bi->bi_offset,
85 bd->bd_bh->b_data + bi->bi_offs !! 83 bd->bd_bh->b_data + bi->bi_offset, bi->bi_len);
86 clear_bit(GBF_FULL, &bi->bi_flags); 84 clear_bit(GBF_FULL, &bi->bi_flags);
87 rgd->rd_free_clone = rgd->rd_free; 85 rgd->rd_free_clone = rgd->rd_free;
88 BUG_ON(rgd->rd_free_clone < rgd->rd_re <<
89 rgd->rd_extfail_pt = rgd->rd_free; 86 rgd->rd_extfail_pt = rgd->rd_free;
90 <<
91 out: <<
92 rgrp_unlock_local(rgd); <<
93 } 87 }
94 88
95 /** 89 /**
96 * gfs2_unpin - Unpin a buffer 90 * gfs2_unpin - Unpin a buffer
97 * @sdp: the filesystem the buffer belongs to 91 * @sdp: the filesystem the buffer belongs to
98 * @bh: The buffer to unpin 92 * @bh: The buffer to unpin
99 * @tr: The system transaction being flushed !! 93 * @ai:
>> 94 * @flags: The inode dirty flags
>> 95 *
100 */ 96 */
101 97
102 static void gfs2_unpin(struct gfs2_sbd *sdp, s 98 static void gfs2_unpin(struct gfs2_sbd *sdp, struct buffer_head *bh,
103 struct gfs2_trans *tr) 99 struct gfs2_trans *tr)
104 { 100 {
105 struct gfs2_bufdata *bd = bh->b_privat 101 struct gfs2_bufdata *bd = bh->b_private;
106 102
107 BUG_ON(!buffer_uptodate(bh)); 103 BUG_ON(!buffer_uptodate(bh));
108 BUG_ON(!buffer_pinned(bh)); 104 BUG_ON(!buffer_pinned(bh));
109 105
110 lock_buffer(bh); 106 lock_buffer(bh);
111 mark_buffer_dirty(bh); 107 mark_buffer_dirty(bh);
112 clear_buffer_pinned(bh); 108 clear_buffer_pinned(bh);
113 109
114 if (buffer_is_rgrp(bd)) 110 if (buffer_is_rgrp(bd))
115 maybe_release_space(bd); 111 maybe_release_space(bd);
116 112
117 spin_lock(&sdp->sd_ail_lock); 113 spin_lock(&sdp->sd_ail_lock);
118 if (bd->bd_tr) { 114 if (bd->bd_tr) {
119 list_del(&bd->bd_ail_st_list); 115 list_del(&bd->bd_ail_st_list);
120 brelse(bh); 116 brelse(bh);
121 } else { 117 } else {
122 struct gfs2_glock *gl = bd->bd 118 struct gfs2_glock *gl = bd->bd_gl;
123 list_add(&bd->bd_ail_gl_list, 119 list_add(&bd->bd_ail_gl_list, &gl->gl_ail_list);
124 atomic_inc(&gl->gl_ail_count); 120 atomic_inc(&gl->gl_ail_count);
125 } 121 }
126 bd->bd_tr = tr; 122 bd->bd_tr = tr;
127 list_add(&bd->bd_ail_st_list, &tr->tr_ 123 list_add(&bd->bd_ail_st_list, &tr->tr_ail1_list);
128 spin_unlock(&sdp->sd_ail_lock); 124 spin_unlock(&sdp->sd_ail_lock);
129 125
130 clear_bit(GLF_LFLUSH, &bd->bd_gl->gl_f 126 clear_bit(GLF_LFLUSH, &bd->bd_gl->gl_flags);
131 trace_gfs2_pin(bd, 0); 127 trace_gfs2_pin(bd, 0);
132 unlock_buffer(bh); 128 unlock_buffer(bh);
133 atomic_dec(&sdp->sd_log_pinned); 129 atomic_dec(&sdp->sd_log_pinned);
134 } 130 }
135 131
136 void gfs2_log_incr_head(struct gfs2_sbd *sdp) !! 132 static void gfs2_log_incr_head(struct gfs2_sbd *sdp)
137 { 133 {
138 BUG_ON((sdp->sd_log_flush_head == sdp- 134 BUG_ON((sdp->sd_log_flush_head == sdp->sd_log_tail) &&
139 (sdp->sd_log_flush_head != sdp- 135 (sdp->sd_log_flush_head != sdp->sd_log_head));
140 136
141 if (++sdp->sd_log_flush_head == sdp->s 137 if (++sdp->sd_log_flush_head == sdp->sd_jdesc->jd_blocks)
142 sdp->sd_log_flush_head = 0; 138 sdp->sd_log_flush_head = 0;
143 } 139 }
144 140
145 u64 gfs2_log_bmap(struct gfs2_jdesc *jd, unsig !! 141 static u64 gfs2_log_bmap(struct gfs2_sbd *sdp)
146 { 142 {
>> 143 unsigned int lbn = sdp->sd_log_flush_head;
147 struct gfs2_journal_extent *je; 144 struct gfs2_journal_extent *je;
>> 145 u64 block;
148 146
149 list_for_each_entry(je, &jd->extent_li !! 147 list_for_each_entry(je, &sdp->sd_jdesc->extent_list, list) {
150 if (lblock >= je->lblock && lb !! 148 if ((lbn >= je->lblock) && (lbn < (je->lblock + je->blocks))) {
151 return je->dblock + lb !! 149 block = je->dblock + lbn - je->lblock;
>> 150 gfs2_log_incr_head(sdp);
>> 151 return block;
>> 152 }
152 } 153 }
153 154
154 return -1; 155 return -1;
155 } 156 }
156 157
157 /** 158 /**
158 * gfs2_end_log_write_bh - end log write of pa 159 * gfs2_end_log_write_bh - end log write of pagecache data with buffers
159 * @sdp: The superblock 160 * @sdp: The superblock
160 * @bvec: The bio_vec 161 * @bvec: The bio_vec
161 * @error: The i/o status 162 * @error: The i/o status
162 * 163 *
163 * This finds the relevant buffers and unlocks !! 164 * This finds the relavent buffers and unlocks then and sets the
164 * error flag according to the status of the i 165 * error flag according to the status of the i/o request. This is
165 * used when the log is writing data which has 166 * used when the log is writing data which has an in-place version
166 * that is pinned in the pagecache. 167 * that is pinned in the pagecache.
167 */ 168 */
168 169
169 static void gfs2_end_log_write_bh(struct gfs2_ !! 170 static void gfs2_end_log_write_bh(struct gfs2_sbd *sdp, struct bio_vec *bvec,
170 struct bio_v <<
171 blk_status_t 171 blk_status_t error)
172 { 172 {
173 struct buffer_head *bh, *next; 173 struct buffer_head *bh, *next;
174 struct page *page = bvec->bv_page; 174 struct page *page = bvec->bv_page;
175 unsigned size; 175 unsigned size;
176 176
177 bh = page_buffers(page); 177 bh = page_buffers(page);
178 size = bvec->bv_len; 178 size = bvec->bv_len;
179 while (bh_offset(bh) < bvec->bv_offset 179 while (bh_offset(bh) < bvec->bv_offset)
180 bh = bh->b_this_page; 180 bh = bh->b_this_page;
181 do { 181 do {
182 if (error) 182 if (error)
183 mark_buffer_write_io_e 183 mark_buffer_write_io_error(bh);
184 unlock_buffer(bh); 184 unlock_buffer(bh);
185 next = bh->b_this_page; 185 next = bh->b_this_page;
186 size -= bh->b_size; 186 size -= bh->b_size;
187 brelse(bh); 187 brelse(bh);
188 bh = next; 188 bh = next;
189 } while(bh && size); 189 } while(bh && size);
190 } 190 }
191 191
192 /** 192 /**
193 * gfs2_end_log_write - end of i/o to the log 193 * gfs2_end_log_write - end of i/o to the log
194 * @bio: The bio 194 * @bio: The bio
>> 195 * @error: Status of i/o request
195 * 196 *
196 * Each bio_vec contains either data from the 197 * Each bio_vec contains either data from the pagecache or data
197 * relating to the log itself. Here we iterate 198 * relating to the log itself. Here we iterate over the bio_vec
198 * array, processing both kinds of data. 199 * array, processing both kinds of data.
199 * 200 *
200 */ 201 */
201 202
202 static void gfs2_end_log_write(struct bio *bio 203 static void gfs2_end_log_write(struct bio *bio)
203 { 204 {
204 struct gfs2_sbd *sdp = bio->bi_private 205 struct gfs2_sbd *sdp = bio->bi_private;
205 struct bio_vec *bvec; 206 struct bio_vec *bvec;
206 struct page *page; 207 struct page *page;
207 struct bvec_iter_all iter_all; !! 208 int i;
208 209
209 if (bio->bi_status) { 210 if (bio->bi_status) {
210 if (!cmpxchg(&sdp->sd_log_erro !! 211 fs_err(sdp, "Error %d writing to journal, jid=%u\n",
211 fs_err(sdp, "Error %d !! 212 bio->bi_status, sdp->sd_jdesc->jd_jid);
212 bio->bi_status, <<
213 gfs2_withdraw_delayed(sdp); <<
214 /* prevent more writes to the <<
215 clear_bit(SDF_JOURNAL_LIVE, &s <<
216 wake_up(&sdp->sd_logd_waitq); 213 wake_up(&sdp->sd_logd_waitq);
217 } 214 }
218 215
219 bio_for_each_segment_all(bvec, bio, it !! 216 bio_for_each_segment_all(bvec, bio, i) {
220 page = bvec->bv_page; 217 page = bvec->bv_page;
221 if (page_has_buffers(page)) 218 if (page_has_buffers(page))
222 gfs2_end_log_write_bh( 219 gfs2_end_log_write_bh(sdp, bvec, bio->bi_status);
223 else 220 else
224 mempool_free(page, gfs 221 mempool_free(page, gfs2_page_pool);
225 } 222 }
226 223
227 bio_put(bio); 224 bio_put(bio);
228 if (atomic_dec_and_test(&sdp->sd_log_i 225 if (atomic_dec_and_test(&sdp->sd_log_in_flight))
229 wake_up(&sdp->sd_log_flush_wai 226 wake_up(&sdp->sd_log_flush_wait);
230 } 227 }
231 228
232 /** 229 /**
233 * gfs2_log_submit_bio - Submit any pending lo !! 230 * gfs2_log_flush_bio - Submit any pending log bio
234 * @biop: Address of the bio pointer !! 231 * @sdp: The superblock
235 * @opf: REQ_OP | op_flags !! 232 * @op: REQ_OP
>> 233 * @op_flags: req_flag_bits
236 * 234 *
237 * Submit any pending part-built or full bio t 235 * Submit any pending part-built or full bio to the block device. If
238 * there is no pending bio, then this is a no- 236 * there is no pending bio, then this is a no-op.
239 */ 237 */
240 238
241 void gfs2_log_submit_bio(struct bio **biop, bl !! 239 void gfs2_log_flush_bio(struct gfs2_sbd *sdp, int op, int op_flags)
242 { 240 {
243 struct bio *bio = *biop; !! 241 if (sdp->sd_log_bio) {
244 if (bio) { <<
245 struct gfs2_sbd *sdp = bio->bi <<
246 atomic_inc(&sdp->sd_log_in_fli 242 atomic_inc(&sdp->sd_log_in_flight);
247 bio->bi_opf = opf; !! 243 bio_set_op_attrs(sdp->sd_log_bio, op, op_flags);
248 submit_bio(bio); !! 244 submit_bio(sdp->sd_log_bio);
249 *biop = NULL; !! 245 sdp->sd_log_bio = NULL;
250 } 246 }
251 } 247 }
252 248
253 /** 249 /**
254 * gfs2_log_alloc_bio - Allocate a bio !! 250 * gfs2_log_alloc_bio - Allocate a new bio for log writing
255 * @sdp: The super block !! 251 * @sdp: The superblock
256 * @blkno: The device block number we want to !! 252 * @blkno: The next device block number we want to write to
257 * @end_io: The bi_end_io callback <<
258 * 253 *
259 * Allocate a new bio, initialize it with the !! 254 * This should never be called when there is a cached bio in the
>> 255 * super block. When it returns, there will be a cached bio in the
>> 256 * super block which will have as many bio_vecs as the device is
>> 257 * happy to handle.
260 * 258 *
261 * Returns: The newly allocated bio !! 259 * Returns: Newly allocated bio
262 */ 260 */
263 261
264 static struct bio *gfs2_log_alloc_bio(struct g !! 262 static struct bio *gfs2_log_alloc_bio(struct gfs2_sbd *sdp, u64 blkno)
265 bio_end_ <<
266 { 263 {
267 struct super_block *sb = sdp->sd_vfs; 264 struct super_block *sb = sdp->sd_vfs;
268 struct bio *bio = bio_alloc(sb->s_bdev !! 265 struct bio *bio;
269 266
270 bio->bi_iter.bi_sector = blkno << sdp- !! 267 BUG_ON(sdp->sd_log_bio);
271 bio->bi_end_io = end_io; !! 268
>> 269 bio = bio_alloc(GFP_NOIO, BIO_MAX_PAGES);
>> 270 bio->bi_iter.bi_sector = blkno * (sb->s_blocksize >> 9);
>> 271 bio_set_dev(bio, sb->s_bdev);
>> 272 bio->bi_end_io = gfs2_end_log_write;
272 bio->bi_private = sdp; 273 bio->bi_private = sdp;
273 274
>> 275 sdp->sd_log_bio = bio;
>> 276
274 return bio; 277 return bio;
275 } 278 }
276 279
277 /** 280 /**
278 * gfs2_log_get_bio - Get cached log bio, or a 281 * gfs2_log_get_bio - Get cached log bio, or allocate a new one
279 * @sdp: The super block !! 282 * @sdp: The superblock
280 * @blkno: The device block number we want to 283 * @blkno: The device block number we want to write to
281 * @biop: The bio to get or allocate <<
282 * @op: REQ_OP <<
283 * @end_io: The bi_end_io callback <<
284 * @flush: Always flush the current bio and al <<
285 * 284 *
286 * If there is a cached bio, then if the next 285 * If there is a cached bio, then if the next block number is sequential
287 * with the previous one, return it, otherwise 286 * with the previous one, return it, otherwise flush the bio to the
288 * device. If there is no cached bio, or we ju !! 287 * device. If there is not a cached bio, or we just flushed it, then
289 * allocate a new one. 288 * allocate a new one.
290 * 289 *
291 * Returns: The bio to use for log writes 290 * Returns: The bio to use for log writes
292 */ 291 */
293 292
294 static struct bio *gfs2_log_get_bio(struct gfs !! 293 static struct bio *gfs2_log_get_bio(struct gfs2_sbd *sdp, u64 blkno)
295 struct bio <<
296 bio_end_io <<
297 { 294 {
298 struct bio *bio = *biop; !! 295 struct bio *bio = sdp->sd_log_bio;
>> 296 u64 nblk;
299 297
300 if (bio) { 298 if (bio) {
301 u64 nblk; <<
302 <<
303 nblk = bio_end_sector(bio); 299 nblk = bio_end_sector(bio);
304 nblk >>= sdp->sd_fsb2bb_shift; 300 nblk >>= sdp->sd_fsb2bb_shift;
305 if (blkno == nblk && !flush) !! 301 if (blkno == nblk)
306 return bio; 302 return bio;
307 gfs2_log_submit_bio(biop, op); !! 303 gfs2_log_flush_bio(sdp, REQ_OP_WRITE, 0);
308 } 304 }
309 305
310 *biop = gfs2_log_alloc_bio(sdp, blkno, !! 306 return gfs2_log_alloc_bio(sdp, blkno);
311 return *biop; <<
312 } 307 }
313 308
>> 309
314 /** 310 /**
315 * gfs2_log_write - write to log 311 * gfs2_log_write - write to log
316 * @sdp: the filesystem 312 * @sdp: the filesystem
317 * @jd: The journal descriptor <<
318 * @page: the page to write 313 * @page: the page to write
319 * @size: the size of the data to write 314 * @size: the size of the data to write
320 * @offset: the offset within the page 315 * @offset: the offset within the page
321 * @blkno: block number of the log entry <<
322 * 316 *
323 * Try and add the page segment to the current 317 * Try and add the page segment to the current bio. If that fails,
324 * submit the current bio to the device and cr 318 * submit the current bio to the device and create a new one, and
325 * then add the page segment to that. 319 * then add the page segment to that.
326 */ 320 */
327 321
328 void gfs2_log_write(struct gfs2_sbd *sdp, stru !! 322 static void gfs2_log_write(struct gfs2_sbd *sdp, struct page *page,
329 struct page *page, unsigne !! 323 unsigned size, unsigned offset)
330 u64 blkno) <<
331 { 324 {
>> 325 u64 blkno = gfs2_log_bmap(sdp);
332 struct bio *bio; 326 struct bio *bio;
333 int ret; 327 int ret;
334 328
335 bio = gfs2_log_get_bio(sdp, blkno, &jd !! 329 bio = gfs2_log_get_bio(sdp, blkno);
336 gfs2_end_log_wr <<
337 ret = bio_add_page(bio, page, size, of 330 ret = bio_add_page(bio, page, size, offset);
338 if (ret == 0) { 331 if (ret == 0) {
339 bio = gfs2_log_get_bio(sdp, bl !! 332 gfs2_log_flush_bio(sdp, REQ_OP_WRITE, 0);
340 REQ_OP_ !! 333 bio = gfs2_log_alloc_bio(sdp, blkno);
341 ret = bio_add_page(bio, page, 334 ret = bio_add_page(bio, page, size, offset);
342 WARN_ON(ret == 0); 335 WARN_ON(ret == 0);
343 } 336 }
344 } 337 }
345 338
346 /** 339 /**
347 * gfs2_log_write_bh - write a buffer's conten 340 * gfs2_log_write_bh - write a buffer's content to the log
348 * @sdp: The super block 341 * @sdp: The super block
349 * @bh: The buffer pointing to the in-place lo 342 * @bh: The buffer pointing to the in-place location
350 * 343 *
351 * This writes the content of the buffer to th 344 * This writes the content of the buffer to the next available location
352 * in the log. The buffer will be unlocked onc 345 * in the log. The buffer will be unlocked once the i/o to the log has
353 * completed. 346 * completed.
354 */ 347 */
355 348
356 static void gfs2_log_write_bh(struct gfs2_sbd 349 static void gfs2_log_write_bh(struct gfs2_sbd *sdp, struct buffer_head *bh)
357 { 350 {
358 u64 dblock; !! 351 gfs2_log_write(sdp, bh->b_page, bh->b_size, bh_offset(bh));
359 <<
360 dblock = gfs2_log_bmap(sdp->sd_jdesc, <<
361 gfs2_log_incr_head(sdp); <<
362 gfs2_log_write(sdp, sdp->sd_jdesc, bh- <<
363 bh_offset(bh), dblock); <<
364 } 352 }
365 353
366 /** 354 /**
367 * gfs2_log_write_page - write one block store 355 * gfs2_log_write_page - write one block stored in a page, into the log
368 * @sdp: The superblock 356 * @sdp: The superblock
369 * @page: The struct page 357 * @page: The struct page
370 * 358 *
371 * This writes the first block-sized part of t 359 * This writes the first block-sized part of the page into the log. Note
372 * that the page must have been allocated from 360 * that the page must have been allocated from the gfs2_page_pool mempool
373 * and that after this has been called, owners 361 * and that after this has been called, ownership has been transferred and
374 * the page may be freed at any time. 362 * the page may be freed at any time.
375 */ 363 */
376 364
377 static void gfs2_log_write_page(struct gfs2_sb !! 365 void gfs2_log_write_page(struct gfs2_sbd *sdp, struct page *page)
378 { 366 {
379 struct super_block *sb = sdp->sd_vfs; 367 struct super_block *sb = sdp->sd_vfs;
380 u64 dblock; !! 368 gfs2_log_write(sdp, page, sb->s_blocksize, 0);
381 <<
382 dblock = gfs2_log_bmap(sdp->sd_jdesc, <<
383 gfs2_log_incr_head(sdp); <<
384 gfs2_log_write(sdp, sdp->sd_jdesc, pag <<
385 } <<
386 <<
387 /** <<
388 * gfs2_end_log_read - end I/O callback for re <<
389 * @bio: The bio <<
390 * <<
391 * Simply unlock the pages in the bio. The mai <<
392 * process them in order as necessary. <<
393 */ <<
394 static void gfs2_end_log_read(struct bio *bio) <<
395 { <<
396 int error = blk_status_to_errno(bio->b <<
397 struct folio_iter fi; <<
398 <<
399 bio_for_each_folio_all(fi, bio) { <<
400 /* We're abusing wb_err to get <<
401 filemap_set_wb_err(fi.folio->m <<
402 folio_end_read(fi.folio, !erro <<
403 } <<
404 <<
405 bio_put(bio); <<
406 } <<
407 <<
408 /** <<
409 * gfs2_jhead_pg_srch - Look for the journal h <<
410 * @jd: The journal descriptor <<
411 * @head: The journal head to start from <<
412 * @page: The page to look in <<
413 * <<
414 * Returns: 1 if found, 0 otherwise. <<
415 */ <<
416 <<
417 static bool gfs2_jhead_pg_srch(struct gfs2_jde <<
418 struct gfs2_log_ <<
419 struct page *pag <<
420 { <<
421 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_ <<
422 struct gfs2_log_header_host lh; <<
423 void *kaddr; <<
424 unsigned int offset; <<
425 bool ret = false; <<
426 <<
427 kaddr = kmap_local_page(page); <<
428 for (offset = 0; offset < PAGE_SIZE; o <<
429 if (!__get_log_header(sdp, kad <<
430 if (lh.lh_sequence >= <<
431 *head = lh; <<
432 else { <<
433 ret = true; <<
434 break; <<
435 } <<
436 } <<
437 } <<
438 kunmap_local(kaddr); <<
439 return ret; <<
440 } <<
441 <<
442 /** <<
443 * gfs2_jhead_process_page - Search/cleanup a <<
444 * @jd: The journal descriptor <<
445 * @index: Index of the page to look into <<
446 * @head: The journal head to start from <<
447 * @done: If set, perform only cleanup, else s <<
448 * <<
449 * Find the folio with 'index' in the journal' <<
450 * the journal head if requested (cleanup == f <<
451 * folio so the page cache can reclaim it. We <<
452 * reference on this folio twice, first when w <<
453 * to obtain the folio to add it to the bio an <<
454 * filemap_get_folio() here to get the folio t <<
455 * completed. <<
456 * This function is also used to free up a fol <<
457 * used. Maybe we added it to a bio, but not s <<
458 * submitted the I/O, but we already found the <<
459 * our references to the folio. <<
460 */ <<
461 <<
462 static void gfs2_jhead_process_page(struct gfs <<
463 struct gfs <<
464 bool *done <<
465 { <<
466 struct folio *folio; <<
467 <<
468 folio = filemap_get_folio(jd->jd_inode <<
469 <<
470 folio_wait_locked(folio); <<
471 if (!folio_test_uptodate(folio)) <<
472 *done = true; <<
473 <<
474 if (!*done) <<
475 *done = gfs2_jhead_pg_srch(jd, <<
476 <<
477 /* filemap_get_folio() and the earlier <<
478 folio_put_refs(folio, 2); <<
479 } <<
480 <<
481 static struct bio *gfs2_chain_bio(struct bio * <<
482 { <<
483 struct bio *new; <<
484 <<
485 new = bio_alloc(prev->bi_bdev, nr_iove <<
486 bio_clone_blkg_association(new, prev); <<
487 new->bi_iter.bi_sector = bio_end_secto <<
488 bio_chain(new, prev); <<
489 submit_bio(prev); <<
490 return new; <<
491 } <<
492 <<
493 /** <<
494 * gfs2_find_jhead - find the head of a log <<
495 * @jd: The journal descriptor <<
496 * @head: The log descriptor for the head of t <<
497 * @keep_cache: If set inode pages will not be <<
498 * <<
499 * Do a search of a journal by reading it in l <<
500 * the valid log entry with the highest sequen <<
501 * <<
502 * Returns: 0 on success, errno otherwise <<
503 */ <<
504 int gfs2_find_jhead(struct gfs2_jdesc *jd, str <<
505 bool keep_cache) <<
506 { <<
507 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_ <<
508 struct address_space *mapping = jd->jd <<
509 unsigned int block = 0, blocks_submitt <<
510 unsigned int bsize = sdp->sd_sb.sb_bsi <<
511 unsigned int bsize_shift = sdp->sd_sb. <<
512 unsigned int shift = PAGE_SHIFT - bsiz <<
513 unsigned int max_blocks = 2 * 1024 * 1 <<
514 struct gfs2_journal_extent *je; <<
515 int sz, ret = 0; <<
516 struct bio *bio = NULL; <<
517 struct page *page = NULL; <<
518 bool done = false; <<
519 errseq_t since; <<
520 <<
521 memset(head, 0, sizeof(*head)); <<
522 if (list_empty(&jd->extent_list)) <<
523 gfs2_map_journal_extents(sdp, <<
524 <<
525 since = filemap_sample_wb_err(mapping) <<
526 list_for_each_entry(je, &jd->extent_li <<
527 u64 dblock = je->dblock; <<
528 <<
529 for (; block < je->lblock + je <<
530 if (!page) { <<
531 page = grab_ca <<
532 if (!page) { <<
533 ret = <<
534 done = <<
535 goto o <<
536 } <<
537 off = 0; <<
538 } <<
539 <<
540 if (bio && (off || blo <<
541 sector_t secto <<
542 <<
543 if (bio_end_se <<
544 sz = b <<
545 if (sz <<
546 <<
547 } <<
548 if (off) { <<
549 unsign <<
550 <<
551 <<
552 bio = <<
553 goto a <<
554 } <<
555 } <<
556 <<
557 if (bio) { <<
558 blocks_submitt <<
559 submit_bio(bio <<
560 } <<
561 <<
562 bio = gfs2_log_alloc_b <<
563 bio->bi_opf = REQ_OP_R <<
564 add_block_to_new_bio: <<
565 sz = bio_add_page(bio, <<
566 BUG_ON(sz != bsize); <<
567 block_added: <<
568 off += bsize; <<
569 if (off == PAGE_SIZE) <<
570 page = NULL; <<
571 if (blocks_submitted < <<
572 /* Keep at lea <<
573 continue; <<
574 } <<
575 <<
576 gfs2_jhead_process_pag <<
577 blocks_read += PAGE_SI <<
578 if (done) <<
579 goto out; /* <<
580 } <<
581 } <<
582 <<
583 out: <<
584 if (bio) <<
585 submit_bio(bio); <<
586 while (blocks_read < block) { <<
587 gfs2_jhead_process_page(jd, bl <<
588 blocks_read += PAGE_SIZE >> bs <<
589 } <<
590 <<
591 if (!ret) <<
592 ret = filemap_check_wb_err(map <<
593 <<
594 if (!keep_cache) <<
595 truncate_inode_pages(mapping, <<
596 <<
597 return ret; <<
598 } 369 }
599 370
600 static struct page *gfs2_get_log_desc(struct g 371 static struct page *gfs2_get_log_desc(struct gfs2_sbd *sdp, u32 ld_type,
601 u32 ld_l 372 u32 ld_length, u32 ld_data1)
602 { 373 {
603 struct page *page = mempool_alloc(gfs2 374 struct page *page = mempool_alloc(gfs2_page_pool, GFP_NOIO);
604 struct gfs2_log_descriptor *ld = page_ 375 struct gfs2_log_descriptor *ld = page_address(page);
605 clear_page(ld); 376 clear_page(ld);
606 ld->ld_header.mh_magic = cpu_to_be32(G 377 ld->ld_header.mh_magic = cpu_to_be32(GFS2_MAGIC);
607 ld->ld_header.mh_type = cpu_to_be32(GF 378 ld->ld_header.mh_type = cpu_to_be32(GFS2_METATYPE_LD);
608 ld->ld_header.mh_format = cpu_to_be32( 379 ld->ld_header.mh_format = cpu_to_be32(GFS2_FORMAT_LD);
609 ld->ld_type = cpu_to_be32(ld_type); 380 ld->ld_type = cpu_to_be32(ld_type);
610 ld->ld_length = cpu_to_be32(ld_length) 381 ld->ld_length = cpu_to_be32(ld_length);
611 ld->ld_data1 = cpu_to_be32(ld_data1); 382 ld->ld_data1 = cpu_to_be32(ld_data1);
612 ld->ld_data2 = 0; 383 ld->ld_data2 = 0;
613 return page; 384 return page;
614 } 385 }
615 386
616 static void gfs2_check_magic(struct buffer_hea 387 static void gfs2_check_magic(struct buffer_head *bh)
617 { 388 {
618 void *kaddr; 389 void *kaddr;
619 __be32 *ptr; 390 __be32 *ptr;
620 391
621 clear_buffer_escaped(bh); 392 clear_buffer_escaped(bh);
622 kaddr = kmap_local_page(bh->b_page); !! 393 kaddr = kmap_atomic(bh->b_page);
623 ptr = kaddr + bh_offset(bh); 394 ptr = kaddr + bh_offset(bh);
624 if (*ptr == cpu_to_be32(GFS2_MAGIC)) 395 if (*ptr == cpu_to_be32(GFS2_MAGIC))
625 set_buffer_escaped(bh); 396 set_buffer_escaped(bh);
626 kunmap_local(kaddr); !! 397 kunmap_atomic(kaddr);
627 } 398 }
628 399
629 static int blocknr_cmp(void *priv, const struc !! 400 static int blocknr_cmp(void *priv, struct list_head *a, struct list_head *b)
630 const struct list_head <<
631 { 401 {
632 struct gfs2_bufdata *bda, *bdb; 402 struct gfs2_bufdata *bda, *bdb;
633 403
634 bda = list_entry(a, struct gfs2_bufdat 404 bda = list_entry(a, struct gfs2_bufdata, bd_list);
635 bdb = list_entry(b, struct gfs2_bufdat 405 bdb = list_entry(b, struct gfs2_bufdata, bd_list);
636 406
637 if (bda->bd_bh->b_blocknr < bdb->bd_bh 407 if (bda->bd_bh->b_blocknr < bdb->bd_bh->b_blocknr)
638 return -1; 408 return -1;
639 if (bda->bd_bh->b_blocknr > bdb->bd_bh 409 if (bda->bd_bh->b_blocknr > bdb->bd_bh->b_blocknr)
640 return 1; 410 return 1;
641 return 0; 411 return 0;
642 } 412 }
643 413
644 static void gfs2_before_commit(struct gfs2_sbd 414 static void gfs2_before_commit(struct gfs2_sbd *sdp, unsigned int limit,
645 unsigned int t 415 unsigned int total, struct list_head *blist,
646 bool is_databu 416 bool is_databuf)
647 { 417 {
648 struct gfs2_log_descriptor *ld; 418 struct gfs2_log_descriptor *ld;
649 struct gfs2_bufdata *bd1 = NULL, *bd2; 419 struct gfs2_bufdata *bd1 = NULL, *bd2;
650 struct page *page; 420 struct page *page;
651 unsigned int num; 421 unsigned int num;
652 unsigned n; 422 unsigned n;
653 __be64 *ptr; 423 __be64 *ptr;
654 424
655 gfs2_log_lock(sdp); 425 gfs2_log_lock(sdp);
656 list_sort(NULL, blist, blocknr_cmp); 426 list_sort(NULL, blist, blocknr_cmp);
657 bd1 = bd2 = list_prepare_entry(bd1, bl 427 bd1 = bd2 = list_prepare_entry(bd1, blist, bd_list);
658 while(total) { 428 while(total) {
659 num = total; 429 num = total;
660 if (total > limit) 430 if (total > limit)
661 num = limit; 431 num = limit;
662 gfs2_log_unlock(sdp); 432 gfs2_log_unlock(sdp);
663 page = gfs2_get_log_desc(sdp, 433 page = gfs2_get_log_desc(sdp,
664 is_da 434 is_databuf ? GFS2_LOG_DESC_JDATA :
665 GFS2_ 435 GFS2_LOG_DESC_METADATA, num + 1, num);
666 ld = page_address(page); 436 ld = page_address(page);
667 gfs2_log_lock(sdp); 437 gfs2_log_lock(sdp);
668 ptr = (__be64 *)(ld + 1); 438 ptr = (__be64 *)(ld + 1);
669 439
670 n = 0; 440 n = 0;
671 list_for_each_entry_continue(b 441 list_for_each_entry_continue(bd1, blist, bd_list) {
672 *ptr++ = cpu_to_be64(b 442 *ptr++ = cpu_to_be64(bd1->bd_bh->b_blocknr);
673 if (is_databuf) { 443 if (is_databuf) {
674 gfs2_check_mag 444 gfs2_check_magic(bd1->bd_bh);
675 *ptr++ = cpu_t 445 *ptr++ = cpu_to_be64(buffer_escaped(bd1->bd_bh) ? 1 : 0);
676 } 446 }
677 if (++n >= num) 447 if (++n >= num)
678 break; 448 break;
679 } 449 }
680 450
681 gfs2_log_unlock(sdp); 451 gfs2_log_unlock(sdp);
682 gfs2_log_write_page(sdp, page) 452 gfs2_log_write_page(sdp, page);
683 gfs2_log_lock(sdp); 453 gfs2_log_lock(sdp);
684 454
685 n = 0; 455 n = 0;
686 list_for_each_entry_continue(b 456 list_for_each_entry_continue(bd2, blist, bd_list) {
687 get_bh(bd2->bd_bh); 457 get_bh(bd2->bd_bh);
688 gfs2_log_unlock(sdp); 458 gfs2_log_unlock(sdp);
689 lock_buffer(bd2->bd_bh 459 lock_buffer(bd2->bd_bh);
690 460
691 if (buffer_escaped(bd2 461 if (buffer_escaped(bd2->bd_bh)) {
692 void *p; !! 462 void *kaddr;
693 <<
694 page = mempool 463 page = mempool_alloc(gfs2_page_pool, GFP_NOIO);
695 p = page_addre !! 464 ptr = page_address(page);
696 memcpy_from_pa !! 465 kaddr = kmap_atomic(bd2->bd_bh->b_page);
697 *(__be32 *)p = !! 466 memcpy(ptr, kaddr + bh_offset(bd2->bd_bh),
>> 467 bd2->bd_bh->b_size);
>> 468 kunmap_atomic(kaddr);
>> 469 *(__be32 *)ptr = 0;
698 clear_buffer_e 470 clear_buffer_escaped(bd2->bd_bh);
699 unlock_buffer( 471 unlock_buffer(bd2->bd_bh);
700 brelse(bd2->bd 472 brelse(bd2->bd_bh);
701 gfs2_log_write 473 gfs2_log_write_page(sdp, page);
702 } else { 474 } else {
703 gfs2_log_write 475 gfs2_log_write_bh(sdp, bd2->bd_bh);
704 } 476 }
705 gfs2_log_lock(sdp); 477 gfs2_log_lock(sdp);
706 if (++n >= num) 478 if (++n >= num)
707 break; 479 break;
708 } 480 }
709 481
710 BUG_ON(total < num); 482 BUG_ON(total < num);
711 total -= num; 483 total -= num;
712 } 484 }
713 gfs2_log_unlock(sdp); 485 gfs2_log_unlock(sdp);
714 } 486 }
715 487
716 static void buf_lo_before_commit(struct gfs2_s 488 static void buf_lo_before_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
717 { 489 {
718 unsigned int limit = buf_limit(sdp); / 490 unsigned int limit = buf_limit(sdp); /* 503 for 4k blocks */
719 unsigned int nbuf; 491 unsigned int nbuf;
720 if (tr == NULL) 492 if (tr == NULL)
721 return; 493 return;
722 nbuf = tr->tr_num_buf_new - tr->tr_num 494 nbuf = tr->tr_num_buf_new - tr->tr_num_buf_rm;
723 gfs2_before_commit(sdp, limit, nbuf, & 495 gfs2_before_commit(sdp, limit, nbuf, &tr->tr_buf, 0);
724 } 496 }
725 497
726 static void buf_lo_after_commit(struct gfs2_sb 498 static void buf_lo_after_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
727 { 499 {
728 struct list_head *head; 500 struct list_head *head;
729 struct gfs2_bufdata *bd; 501 struct gfs2_bufdata *bd;
730 502
731 if (tr == NULL) 503 if (tr == NULL)
732 return; 504 return;
733 505
734 head = &tr->tr_buf; 506 head = &tr->tr_buf;
735 while (!list_empty(head)) { 507 while (!list_empty(head)) {
736 bd = list_first_entry(head, st !! 508 bd = list_entry(head->next, struct gfs2_bufdata, bd_list);
737 list_del_init(&bd->bd_list); 509 list_del_init(&bd->bd_list);
738 gfs2_unpin(sdp, bd->bd_bh, tr) 510 gfs2_unpin(sdp, bd->bd_bh, tr);
739 } 511 }
740 } 512 }
741 513
742 static void buf_lo_before_scan(struct gfs2_jde 514 static void buf_lo_before_scan(struct gfs2_jdesc *jd,
743 struct gfs2_log 515 struct gfs2_log_header_host *head, int pass)
744 { 516 {
745 if (pass != 0) 517 if (pass != 0)
746 return; 518 return;
747 519
748 jd->jd_found_blocks = 0; 520 jd->jd_found_blocks = 0;
749 jd->jd_replayed_blocks = 0; 521 jd->jd_replayed_blocks = 0;
750 } 522 }
751 523
752 #define obsolete_rgrp_replay \ !! 524 static int buf_lo_scan_elements(struct gfs2_jdesc *jd, unsigned int start,
753 "Replaying 0x%llx from jid=%d/0x%llx but we al <<
754 #define obsolete_rgrp_replay2 \ <<
755 "busy:%d, pinned:%d rg_gen:0x%llx, j_gen:0x%ll <<
756 <<
757 static void obsolete_rgrp(struct gfs2_jdesc *j <<
758 u64 blkno) <<
759 { <<
760 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_ <<
761 struct gfs2_rgrpd *rgd; <<
762 struct gfs2_rgrp *jrgd = (struct gfs2_ <<
763 <<
764 rgd = gfs2_blk2rgrpd(sdp, blkno, false <<
765 if (rgd && rgd->rd_addr == blkno && <<
766 rgd->rd_bits && rgd->rd_bits->bi_b <<
767 fs_info(sdp, obsolete_rgrp_rep <<
768 jd->jd_jid, bh_log->b_ <<
769 fs_info(sdp, obsolete_rgrp_rep <<
770 buffer_busy(rgd->rd_bi <<
771 buffer_pinned(rgd->rd_ <<
772 rgd->rd_igeneration, <<
773 be64_to_cpu(jrgd->rg_i <<
774 gfs2_dump_glock(NULL, rgd->rd_ <<
775 } <<
776 } <<
777 <<
778 static int buf_lo_scan_elements(struct gfs2_jd <<
779 struct gfs2_lo 525 struct gfs2_log_descriptor *ld, __be64 *ptr,
780 int pass) 526 int pass)
781 { 527 {
782 struct gfs2_inode *ip = GFS2_I(jd->jd_ 528 struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
783 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_ 529 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
784 struct gfs2_glock *gl = ip->i_gl; 530 struct gfs2_glock *gl = ip->i_gl;
785 unsigned int blks = be32_to_cpu(ld->ld 531 unsigned int blks = be32_to_cpu(ld->ld_data1);
786 struct buffer_head *bh_log, *bh_ip; 532 struct buffer_head *bh_log, *bh_ip;
787 u64 blkno; 533 u64 blkno;
788 int error = 0; 534 int error = 0;
789 535
790 if (pass != 1 || be32_to_cpu(ld->ld_ty 536 if (pass != 1 || be32_to_cpu(ld->ld_type) != GFS2_LOG_DESC_METADATA)
791 return 0; 537 return 0;
792 538
793 gfs2_replay_incr_blk(jd, &start); 539 gfs2_replay_incr_blk(jd, &start);
794 540
795 for (; blks; gfs2_replay_incr_blk(jd, 541 for (; blks; gfs2_replay_incr_blk(jd, &start), blks--) {
796 blkno = be64_to_cpu(*ptr++); 542 blkno = be64_to_cpu(*ptr++);
797 543
798 jd->jd_found_blocks++; 544 jd->jd_found_blocks++;
799 545
800 if (gfs2_revoke_check(jd, blkn 546 if (gfs2_revoke_check(jd, blkno, start))
801 continue; 547 continue;
802 548
803 error = gfs2_replay_read_block 549 error = gfs2_replay_read_block(jd, start, &bh_log);
804 if (error) 550 if (error)
805 return error; 551 return error;
806 552
807 bh_ip = gfs2_meta_new(gl, blkn 553 bh_ip = gfs2_meta_new(gl, blkno);
808 memcpy(bh_ip->b_data, bh_log-> 554 memcpy(bh_ip->b_data, bh_log->b_data, bh_log->b_size);
809 555
810 if (gfs2_meta_check(sdp, bh_ip 556 if (gfs2_meta_check(sdp, bh_ip))
811 error = -EIO; 557 error = -EIO;
812 else { !! 558 else
813 struct gfs2_meta_heade <<
814 (struct gfs2_m <<
815 <<
816 if (mh->mh_type == cpu <<
817 obsolete_rgrp( <<
818 <<
819 mark_buffer_dirty(bh_i 559 mark_buffer_dirty(bh_ip);
820 } !! 560
821 brelse(bh_log); 561 brelse(bh_log);
822 brelse(bh_ip); 562 brelse(bh_ip);
823 563
824 if (error) 564 if (error)
825 break; 565 break;
826 566
827 jd->jd_replayed_blocks++; 567 jd->jd_replayed_blocks++;
828 } 568 }
829 569
830 return error; 570 return error;
831 } 571 }
832 572
>> 573 /**
>> 574 * gfs2_meta_sync - Sync all buffers associated with a glock
>> 575 * @gl: The glock
>> 576 *
>> 577 */
>> 578
>> 579 static void gfs2_meta_sync(struct gfs2_glock *gl)
>> 580 {
>> 581 struct address_space *mapping = gfs2_glock2aspace(gl);
>> 582 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
>> 583 int error;
>> 584
>> 585 if (mapping == NULL)
>> 586 mapping = &sdp->sd_aspace;
>> 587
>> 588 filemap_fdatawrite(mapping);
>> 589 error = filemap_fdatawait(mapping);
>> 590
>> 591 if (error)
>> 592 gfs2_io_error(gl->gl_name.ln_sbd);
>> 593 }
>> 594
833 static void buf_lo_after_scan(struct gfs2_jdes 595 static void buf_lo_after_scan(struct gfs2_jdesc *jd, int error, int pass)
834 { 596 {
835 struct gfs2_inode *ip = GFS2_I(jd->jd_ 597 struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
836 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_ 598 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
837 599
838 if (error) { 600 if (error) {
839 gfs2_inode_metasync(ip->i_gl); !! 601 gfs2_meta_sync(ip->i_gl);
840 return; 602 return;
841 } 603 }
842 if (pass != 1) 604 if (pass != 1)
843 return; 605 return;
844 606
845 gfs2_inode_metasync(ip->i_gl); !! 607 gfs2_meta_sync(ip->i_gl);
846 608
847 fs_info(sdp, "jid=%u: Replayed %u of % 609 fs_info(sdp, "jid=%u: Replayed %u of %u blocks\n",
848 jd->jd_jid, jd->jd_replayed_bl 610 jd->jd_jid, jd->jd_replayed_blocks, jd->jd_found_blocks);
849 } 611 }
850 612
851 static void revoke_lo_before_commit(struct gfs 613 static void revoke_lo_before_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
852 { 614 {
853 struct gfs2_meta_header *mh; 615 struct gfs2_meta_header *mh;
854 unsigned int offset; 616 unsigned int offset;
855 struct list_head *head = &sdp->sd_log_ !! 617 struct list_head *head = &sdp->sd_log_le_revoke;
856 struct gfs2_bufdata *bd; 618 struct gfs2_bufdata *bd;
857 struct page *page; 619 struct page *page;
858 unsigned int length; 620 unsigned int length;
859 621
860 gfs2_flush_revokes(sdp); !! 622 gfs2_write_revokes(sdp);
861 if (!sdp->sd_log_num_revoke) 623 if (!sdp->sd_log_num_revoke)
862 return; 624 return;
863 625
864 length = gfs2_struct2blk(sdp, sdp->sd_ !! 626 length = gfs2_struct2blk(sdp, sdp->sd_log_num_revoke, sizeof(u64));
865 page = gfs2_get_log_desc(sdp, GFS2_LOG 627 page = gfs2_get_log_desc(sdp, GFS2_LOG_DESC_REVOKE, length, sdp->sd_log_num_revoke);
866 offset = sizeof(struct gfs2_log_descri 628 offset = sizeof(struct gfs2_log_descriptor);
867 629
868 list_for_each_entry(bd, head, bd_list) 630 list_for_each_entry(bd, head, bd_list) {
869 sdp->sd_log_num_revoke--; 631 sdp->sd_log_num_revoke--;
870 632
871 if (offset + sizeof(u64) > sdp 633 if (offset + sizeof(u64) > sdp->sd_sb.sb_bsize) {
>> 634
872 gfs2_log_write_page(sd 635 gfs2_log_write_page(sdp, page);
873 page = mempool_alloc(g 636 page = mempool_alloc(gfs2_page_pool, GFP_NOIO);
874 mh = page_address(page 637 mh = page_address(page);
875 clear_page(mh); 638 clear_page(mh);
876 mh->mh_magic = cpu_to_ 639 mh->mh_magic = cpu_to_be32(GFS2_MAGIC);
877 mh->mh_type = cpu_to_b 640 mh->mh_type = cpu_to_be32(GFS2_METATYPE_LB);
878 mh->mh_format = cpu_to 641 mh->mh_format = cpu_to_be32(GFS2_FORMAT_LB);
879 offset = sizeof(struct 642 offset = sizeof(struct gfs2_meta_header);
880 } 643 }
881 644
882 *(__be64 *)(page_address(page) 645 *(__be64 *)(page_address(page) + offset) = cpu_to_be64(bd->bd_blkno);
883 offset += sizeof(u64); 646 offset += sizeof(u64);
884 } 647 }
885 gfs2_assert_withdraw(sdp, !sdp->sd_log 648 gfs2_assert_withdraw(sdp, !sdp->sd_log_num_revoke);
886 649
887 gfs2_log_write_page(sdp, page); 650 gfs2_log_write_page(sdp, page);
888 } 651 }
889 652
890 void gfs2_drain_revokes(struct gfs2_sbd *sdp) !! 653 static void revoke_lo_after_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
891 { 654 {
892 struct list_head *head = &sdp->sd_log_ !! 655 struct list_head *head = &sdp->sd_log_le_revoke;
893 struct gfs2_bufdata *bd; 656 struct gfs2_bufdata *bd;
894 struct gfs2_glock *gl; 657 struct gfs2_glock *gl;
895 658
896 while (!list_empty(head)) { 659 while (!list_empty(head)) {
897 bd = list_first_entry(head, st !! 660 bd = list_entry(head->next, struct gfs2_bufdata, bd_list);
898 list_del_init(&bd->bd_list); 661 list_del_init(&bd->bd_list);
899 gl = bd->bd_gl; 662 gl = bd->bd_gl;
900 gfs2_glock_remove_revoke(gl); !! 663 atomic_dec(&gl->gl_revokes);
>> 664 clear_bit(GLF_LFLUSH, &gl->gl_flags);
901 kmem_cache_free(gfs2_bufdata_c 665 kmem_cache_free(gfs2_bufdata_cachep, bd);
902 } 666 }
903 } 667 }
904 668
905 static void revoke_lo_after_commit(struct gfs2 <<
906 { <<
907 gfs2_drain_revokes(sdp); <<
908 } <<
909 <<
910 static void revoke_lo_before_scan(struct gfs2_ 669 static void revoke_lo_before_scan(struct gfs2_jdesc *jd,
911 struct gfs2_ 670 struct gfs2_log_header_host *head, int pass)
912 { 671 {
913 if (pass != 0) 672 if (pass != 0)
914 return; 673 return;
915 674
916 jd->jd_found_revokes = 0; 675 jd->jd_found_revokes = 0;
917 jd->jd_replay_tail = head->lh_tail; 676 jd->jd_replay_tail = head->lh_tail;
918 } 677 }
919 678
920 static int revoke_lo_scan_elements(struct gfs2 !! 679 static int revoke_lo_scan_elements(struct gfs2_jdesc *jd, unsigned int start,
921 struct gfs2 680 struct gfs2_log_descriptor *ld, __be64 *ptr,
922 int pass) 681 int pass)
923 { 682 {
924 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_ 683 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
925 unsigned int blks = be32_to_cpu(ld->ld 684 unsigned int blks = be32_to_cpu(ld->ld_length);
926 unsigned int revokes = be32_to_cpu(ld- 685 unsigned int revokes = be32_to_cpu(ld->ld_data1);
927 struct buffer_head *bh; 686 struct buffer_head *bh;
928 unsigned int offset; 687 unsigned int offset;
929 u64 blkno; 688 u64 blkno;
930 int first = 1; 689 int first = 1;
931 int error; 690 int error;
932 691
933 if (pass != 0 || be32_to_cpu(ld->ld_ty 692 if (pass != 0 || be32_to_cpu(ld->ld_type) != GFS2_LOG_DESC_REVOKE)
934 return 0; 693 return 0;
935 694
936 offset = sizeof(struct gfs2_log_descri 695 offset = sizeof(struct gfs2_log_descriptor);
937 696
938 for (; blks; gfs2_replay_incr_blk(jd, 697 for (; blks; gfs2_replay_incr_blk(jd, &start), blks--) {
939 error = gfs2_replay_read_block 698 error = gfs2_replay_read_block(jd, start, &bh);
940 if (error) 699 if (error)
941 return error; 700 return error;
942 701
943 if (!first) 702 if (!first)
944 gfs2_metatype_check(sd 703 gfs2_metatype_check(sdp, bh, GFS2_METATYPE_LB);
945 704
946 while (offset + sizeof(u64) <= 705 while (offset + sizeof(u64) <= sdp->sd_sb.sb_bsize) {
947 blkno = be64_to_cpu(*( 706 blkno = be64_to_cpu(*(__be64 *)(bh->b_data + offset));
948 707
949 error = gfs2_revoke_ad 708 error = gfs2_revoke_add(jd, blkno, start);
950 if (error < 0) { 709 if (error < 0) {
951 brelse(bh); 710 brelse(bh);
952 return error; 711 return error;
953 } 712 }
954 else if (error) 713 else if (error)
955 jd->jd_found_r 714 jd->jd_found_revokes++;
956 715
957 if (!--revokes) 716 if (!--revokes)
958 break; 717 break;
959 offset += sizeof(u64); 718 offset += sizeof(u64);
960 } 719 }
961 720
962 brelse(bh); 721 brelse(bh);
963 offset = sizeof(struct gfs2_me 722 offset = sizeof(struct gfs2_meta_header);
964 first = 0; 723 first = 0;
965 } 724 }
966 725
967 return 0; 726 return 0;
968 } 727 }
969 728
970 static void revoke_lo_after_scan(struct gfs2_j 729 static void revoke_lo_after_scan(struct gfs2_jdesc *jd, int error, int pass)
971 { 730 {
972 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_ 731 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
973 732
974 if (error) { 733 if (error) {
975 gfs2_revoke_clean(jd); 734 gfs2_revoke_clean(jd);
976 return; 735 return;
977 } 736 }
978 if (pass != 1) 737 if (pass != 1)
979 return; 738 return;
980 739
981 fs_info(sdp, "jid=%u: Found %u revoke 740 fs_info(sdp, "jid=%u: Found %u revoke tags\n",
982 jd->jd_jid, jd->jd_found_revok 741 jd->jd_jid, jd->jd_found_revokes);
983 742
984 gfs2_revoke_clean(jd); 743 gfs2_revoke_clean(jd);
985 } 744 }
986 745
987 /** 746 /**
988 * databuf_lo_before_commit - Scan the data bu 747 * databuf_lo_before_commit - Scan the data buffers, writing as we go
989 * @sdp: The filesystem !! 748 *
990 * @tr: The system transaction being flushed <<
991 */ 749 */
992 750
993 static void databuf_lo_before_commit(struct gf 751 static void databuf_lo_before_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
994 { 752 {
995 unsigned int limit = databuf_limit(sdp 753 unsigned int limit = databuf_limit(sdp);
996 unsigned int nbuf; 754 unsigned int nbuf;
997 if (tr == NULL) 755 if (tr == NULL)
998 return; 756 return;
999 nbuf = tr->tr_num_databuf_new - tr->tr 757 nbuf = tr->tr_num_databuf_new - tr->tr_num_databuf_rm;
1000 gfs2_before_commit(sdp, limit, nbuf, 758 gfs2_before_commit(sdp, limit, nbuf, &tr->tr_databuf, 1);
1001 } 759 }
1002 760
1003 static int databuf_lo_scan_elements(struct gf !! 761 static int databuf_lo_scan_elements(struct gfs2_jdesc *jd, unsigned int start,
1004 struct gf 762 struct gfs2_log_descriptor *ld,
1005 __be64 *p 763 __be64 *ptr, int pass)
1006 { 764 {
1007 struct gfs2_inode *ip = GFS2_I(jd->jd 765 struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
1008 struct gfs2_glock *gl = ip->i_gl; 766 struct gfs2_glock *gl = ip->i_gl;
1009 unsigned int blks = be32_to_cpu(ld->l 767 unsigned int blks = be32_to_cpu(ld->ld_data1);
1010 struct buffer_head *bh_log, *bh_ip; 768 struct buffer_head *bh_log, *bh_ip;
1011 u64 blkno; 769 u64 blkno;
1012 u64 esc; 770 u64 esc;
1013 int error = 0; 771 int error = 0;
1014 772
1015 if (pass != 1 || be32_to_cpu(ld->ld_t 773 if (pass != 1 || be32_to_cpu(ld->ld_type) != GFS2_LOG_DESC_JDATA)
1016 return 0; 774 return 0;
1017 775
1018 gfs2_replay_incr_blk(jd, &start); 776 gfs2_replay_incr_blk(jd, &start);
1019 for (; blks; gfs2_replay_incr_blk(jd, 777 for (; blks; gfs2_replay_incr_blk(jd, &start), blks--) {
1020 blkno = be64_to_cpu(*ptr++); 778 blkno = be64_to_cpu(*ptr++);
1021 esc = be64_to_cpu(*ptr++); 779 esc = be64_to_cpu(*ptr++);
1022 780
1023 jd->jd_found_blocks++; 781 jd->jd_found_blocks++;
1024 782
1025 if (gfs2_revoke_check(jd, blk 783 if (gfs2_revoke_check(jd, blkno, start))
1026 continue; 784 continue;
1027 785
1028 error = gfs2_replay_read_bloc 786 error = gfs2_replay_read_block(jd, start, &bh_log);
1029 if (error) 787 if (error)
1030 return error; 788 return error;
1031 789
1032 bh_ip = gfs2_meta_new(gl, blk 790 bh_ip = gfs2_meta_new(gl, blkno);
1033 memcpy(bh_ip->b_data, bh_log- 791 memcpy(bh_ip->b_data, bh_log->b_data, bh_log->b_size);
1034 792
1035 /* Unescape */ 793 /* Unescape */
1036 if (esc) { 794 if (esc) {
1037 __be32 *eptr = (__be3 795 __be32 *eptr = (__be32 *)bh_ip->b_data;
1038 *eptr = cpu_to_be32(G 796 *eptr = cpu_to_be32(GFS2_MAGIC);
1039 } 797 }
1040 mark_buffer_dirty(bh_ip); 798 mark_buffer_dirty(bh_ip);
1041 799
1042 brelse(bh_log); 800 brelse(bh_log);
1043 brelse(bh_ip); 801 brelse(bh_ip);
1044 802
1045 jd->jd_replayed_blocks++; 803 jd->jd_replayed_blocks++;
1046 } 804 }
1047 805
1048 return error; 806 return error;
1049 } 807 }
1050 808
1051 /* FIXME: sort out accounting for log blocks 809 /* FIXME: sort out accounting for log blocks etc. */
1052 810
1053 static void databuf_lo_after_scan(struct gfs2 811 static void databuf_lo_after_scan(struct gfs2_jdesc *jd, int error, int pass)
1054 { 812 {
1055 struct gfs2_inode *ip = GFS2_I(jd->jd 813 struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
1056 struct gfs2_sbd *sdp = GFS2_SB(jd->jd 814 struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
1057 815
1058 if (error) { 816 if (error) {
1059 gfs2_inode_metasync(ip->i_gl) !! 817 gfs2_meta_sync(ip->i_gl);
1060 return; 818 return;
1061 } 819 }
1062 if (pass != 1) 820 if (pass != 1)
1063 return; 821 return;
1064 822
1065 /* data sync? */ 823 /* data sync? */
1066 gfs2_inode_metasync(ip->i_gl); !! 824 gfs2_meta_sync(ip->i_gl);
1067 825
1068 fs_info(sdp, "jid=%u: Replayed %u of 826 fs_info(sdp, "jid=%u: Replayed %u of %u data blocks\n",
1069 jd->jd_jid, jd->jd_replayed_b 827 jd->jd_jid, jd->jd_replayed_blocks, jd->jd_found_blocks);
1070 } 828 }
1071 829
1072 static void databuf_lo_after_commit(struct gf 830 static void databuf_lo_after_commit(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
1073 { 831 {
1074 struct list_head *head; 832 struct list_head *head;
1075 struct gfs2_bufdata *bd; 833 struct gfs2_bufdata *bd;
1076 834
1077 if (tr == NULL) 835 if (tr == NULL)
1078 return; 836 return;
1079 837
1080 head = &tr->tr_databuf; 838 head = &tr->tr_databuf;
1081 while (!list_empty(head)) { 839 while (!list_empty(head)) {
1082 bd = list_first_entry(head, s !! 840 bd = list_entry(head->next, struct gfs2_bufdata, bd_list);
1083 list_del_init(&bd->bd_list); 841 list_del_init(&bd->bd_list);
1084 gfs2_unpin(sdp, bd->bd_bh, tr 842 gfs2_unpin(sdp, bd->bd_bh, tr);
1085 } 843 }
1086 } 844 }
1087 845
1088 846
1089 static const struct gfs2_log_operations gfs2_ !! 847 const struct gfs2_log_operations gfs2_buf_lops = {
1090 .lo_before_commit = buf_lo_before_com 848 .lo_before_commit = buf_lo_before_commit,
1091 .lo_after_commit = buf_lo_after_commi 849 .lo_after_commit = buf_lo_after_commit,
1092 .lo_before_scan = buf_lo_before_scan, 850 .lo_before_scan = buf_lo_before_scan,
1093 .lo_scan_elements = buf_lo_scan_eleme 851 .lo_scan_elements = buf_lo_scan_elements,
1094 .lo_after_scan = buf_lo_after_scan, 852 .lo_after_scan = buf_lo_after_scan,
1095 .lo_name = "buf", 853 .lo_name = "buf",
1096 }; 854 };
1097 855
1098 static const struct gfs2_log_operations gfs2_ !! 856 const struct gfs2_log_operations gfs2_revoke_lops = {
1099 .lo_before_commit = revoke_lo_before_ 857 .lo_before_commit = revoke_lo_before_commit,
1100 .lo_after_commit = revoke_lo_after_co 858 .lo_after_commit = revoke_lo_after_commit,
1101 .lo_before_scan = revoke_lo_before_sc 859 .lo_before_scan = revoke_lo_before_scan,
1102 .lo_scan_elements = revoke_lo_scan_el 860 .lo_scan_elements = revoke_lo_scan_elements,
1103 .lo_after_scan = revoke_lo_after_scan 861 .lo_after_scan = revoke_lo_after_scan,
1104 .lo_name = "revoke", 862 .lo_name = "revoke",
1105 }; 863 };
1106 864
1107 static const struct gfs2_log_operations gfs2_ !! 865 const struct gfs2_log_operations gfs2_databuf_lops = {
1108 .lo_before_commit = databuf_lo_before 866 .lo_before_commit = databuf_lo_before_commit,
1109 .lo_after_commit = databuf_lo_after_c 867 .lo_after_commit = databuf_lo_after_commit,
1110 .lo_scan_elements = databuf_lo_scan_e 868 .lo_scan_elements = databuf_lo_scan_elements,
1111 .lo_after_scan = databuf_lo_after_sca 869 .lo_after_scan = databuf_lo_after_scan,
1112 .lo_name = "databuf", 870 .lo_name = "databuf",
1113 }; 871 };
1114 872
1115 const struct gfs2_log_operations *gfs2_log_op 873 const struct gfs2_log_operations *gfs2_log_ops[] = {
1116 &gfs2_databuf_lops, 874 &gfs2_databuf_lops,
1117 &gfs2_buf_lops, 875 &gfs2_buf_lops,
1118 &gfs2_revoke_lops, 876 &gfs2_revoke_lops,
1119 NULL, 877 NULL,
1120 }; 878 };
1121 879
1122 880
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.