2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
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.
10 #include <linux/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/completion.h>
13 #include <linux/buffer_head.h>
14 #include <linux/gfs2_ondisk.h>
15 #include <linux/crc32.h>
16 #include <linux/lm_interface.h>
30 int gfs2_replay_read_block(struct gfs2_jdesc
*jd
, unsigned int blk
,
31 struct buffer_head
**bh
)
33 struct gfs2_inode
*ip
= GFS2_I(jd
->jd_inode
);
34 struct gfs2_glock
*gl
= ip
->i_gl
;
40 error
= gfs2_extent_map(&ip
->i_inode
, blk
, &new, &dblock
, &extlen
);
44 gfs2_consist_inode(ip
);
48 *bh
= gfs2_meta_ra(gl
, dblock
, extlen
);
53 int gfs2_revoke_add(struct gfs2_sbd
*sdp
, u64 blkno
, unsigned int where
)
55 struct list_head
*head
= &sdp
->sd_revoke_list
;
56 struct gfs2_revoke_replay
*rr
;
59 list_for_each_entry(rr
, head
, rr_list
) {
60 if (rr
->rr_blkno
== blkno
) {
71 rr
= kmalloc(sizeof(struct gfs2_revoke_replay
), GFP_NOFS
);
77 list_add(&rr
->rr_list
, head
);
82 int gfs2_revoke_check(struct gfs2_sbd
*sdp
, u64 blkno
, unsigned int where
)
84 struct gfs2_revoke_replay
*rr
;
85 int wrap
, a
, b
, revoke
;
88 list_for_each_entry(rr
, &sdp
->sd_revoke_list
, rr_list
) {
89 if (rr
->rr_blkno
== blkno
) {
98 wrap
= (rr
->rr_where
< sdp
->sd_replay_tail
);
99 a
= (sdp
->sd_replay_tail
< where
);
100 b
= (where
< rr
->rr_where
);
101 revoke
= (wrap
) ? (a
|| b
) : (a
&& b
);
106 void gfs2_revoke_clean(struct gfs2_sbd
*sdp
)
108 struct list_head
*head
= &sdp
->sd_revoke_list
;
109 struct gfs2_revoke_replay
*rr
;
111 while (!list_empty(head
)) {
112 rr
= list_entry(head
->next
, struct gfs2_revoke_replay
, rr_list
);
113 list_del(&rr
->rr_list
);
118 static int gfs2_log_header_in(struct gfs2_log_header_host
*lh
, const void *buf
)
120 const struct gfs2_log_header
*str
= buf
;
122 if (str
->lh_header
.mh_magic
!= cpu_to_be32(GFS2_MAGIC
) ||
123 str
->lh_header
.mh_type
!= cpu_to_be32(GFS2_METATYPE_LH
))
126 lh
->lh_sequence
= be64_to_cpu(str
->lh_sequence
);
127 lh
->lh_flags
= be32_to_cpu(str
->lh_flags
);
128 lh
->lh_tail
= be32_to_cpu(str
->lh_tail
);
129 lh
->lh_blkno
= be32_to_cpu(str
->lh_blkno
);
130 lh
->lh_hash
= be32_to_cpu(str
->lh_hash
);
135 * get_log_header - read the log header for a given segment
137 * @blk: the block to look at
138 * @lh: the log header to return
140 * Read the log header for a given segement in a given journal. Do a few
141 * sanity checks on it.
143 * Returns: 0 on success,
144 * 1 if the header was invalid or incomplete,
148 static int get_log_header(struct gfs2_jdesc
*jd
, unsigned int blk
,
149 struct gfs2_log_header_host
*head
)
151 struct buffer_head
*bh
;
152 struct gfs2_log_header_host
uninitialized_var(lh
);
153 const u32 nothing
= 0;
157 error
= gfs2_replay_read_block(jd
, blk
, &bh
);
161 hash
= crc32_le((u32
)~0, bh
->b_data
, sizeof(struct gfs2_log_header
) -
163 hash
= crc32_le(hash
, (unsigned char const *)¬hing
, sizeof(nothing
));
165 error
= gfs2_log_header_in(&lh
, bh
->b_data
);
168 if (error
|| lh
.lh_blkno
!= blk
|| lh
.lh_hash
!= hash
)
177 * find_good_lh - find a good log header
179 * @blk: the segment to start searching from
180 * @lh: the log header to fill in
181 * @forward: if true search forward in the log, else search backward
183 * Call get_log_header() to get a log header for a segment, but if the
184 * segment is bad, either scan forward or backward until we find a good one.
189 static int find_good_lh(struct gfs2_jdesc
*jd
, unsigned int *blk
,
190 struct gfs2_log_header_host
*head
)
192 unsigned int orig_blk
= *blk
;
196 error
= get_log_header(jd
, *blk
, head
);
200 if (++*blk
== jd
->jd_blocks
)
203 if (*blk
== orig_blk
) {
204 gfs2_consist_inode(GFS2_I(jd
->jd_inode
));
211 * jhead_scan - make sure we've found the head of the log
213 * @head: this is filled in with the log descriptor of the head
215 * At this point, seg and lh should be either the head of the log or just
216 * before. Scan forward until we find the head.
221 static int jhead_scan(struct gfs2_jdesc
*jd
, struct gfs2_log_header_host
*head
)
223 unsigned int blk
= head
->lh_blkno
;
224 struct gfs2_log_header_host lh
;
228 if (++blk
== jd
->jd_blocks
)
231 error
= get_log_header(jd
, blk
, &lh
);
237 if (lh
.lh_sequence
== head
->lh_sequence
) {
238 gfs2_consist_inode(GFS2_I(jd
->jd_inode
));
241 if (lh
.lh_sequence
< head
->lh_sequence
)
251 * gfs2_find_jhead - find the head of a log
253 * @head: the log descriptor for the head of the log is returned here
255 * Do a binary search of a journal and find the valid log entry with the
256 * highest sequence number. (i.e. the log head)
261 int gfs2_find_jhead(struct gfs2_jdesc
*jd
, struct gfs2_log_header_host
*head
)
263 struct gfs2_log_header_host lh_1
, lh_m
;
264 u32 blk_1
, blk_2
, blk_m
;
268 blk_2
= jd
->jd_blocks
- 1;
271 blk_m
= (blk_1
+ blk_2
) / 2;
273 error
= find_good_lh(jd
, &blk_1
, &lh_1
);
277 error
= find_good_lh(jd
, &blk_m
, &lh_m
);
281 if (blk_1
== blk_m
|| blk_m
== blk_2
)
284 if (lh_1
.lh_sequence
<= lh_m
.lh_sequence
)
290 error
= jhead_scan(jd
, &lh_1
);
300 * foreach_descriptor - go through the active part of the log
302 * @start: the first log header in the active region
303 * @end: the last log header (don't process the contents of this entry))
305 * Call a given function once for every log descriptor in the active
306 * portion of the log.
311 static int foreach_descriptor(struct gfs2_jdesc
*jd
, unsigned int start
,
312 unsigned int end
, int pass
)
314 struct gfs2_sbd
*sdp
= GFS2_SB(jd
->jd_inode
);
315 struct buffer_head
*bh
;
316 struct gfs2_log_descriptor
*ld
;
320 unsigned int offset
= sizeof(struct gfs2_log_descriptor
);
321 offset
+= sizeof(__be64
) - 1;
322 offset
&= ~(sizeof(__be64
) - 1);
324 while (start
!= end
) {
325 error
= gfs2_replay_read_block(jd
, start
, &bh
);
328 if (gfs2_meta_check(sdp
, bh
)) {
332 ld
= (struct gfs2_log_descriptor
*)bh
->b_data
;
333 length
= be32_to_cpu(ld
->ld_length
);
335 if (be32_to_cpu(ld
->ld_header
.mh_type
) == GFS2_METATYPE_LH
) {
336 struct gfs2_log_header_host lh
;
337 error
= get_log_header(jd
, start
, &lh
);
339 gfs2_replay_incr_blk(sdp
, &start
);
344 gfs2_consist_inode(GFS2_I(jd
->jd_inode
));
349 } else if (gfs2_metatype_check(sdp
, bh
, GFS2_METATYPE_LD
)) {
353 ptr
= (__be64
*)(bh
->b_data
+ offset
);
354 error
= lops_scan_elements(jd
, start
, ld
, ptr
, pass
);
361 gfs2_replay_incr_blk(sdp
, &start
);
370 * clean_journal - mark a dirty journal as being clean
371 * @sdp: the filesystem
373 * @gl: the journal's glock
374 * @head: the head journal to start from
379 static int clean_journal(struct gfs2_jdesc
*jd
, struct gfs2_log_header_host
*head
)
381 struct gfs2_inode
*ip
= GFS2_I(jd
->jd_inode
);
382 struct gfs2_sbd
*sdp
= GFS2_SB(jd
->jd_inode
);
384 struct gfs2_log_header
*lh
;
386 struct buffer_head
*bh
;
388 struct buffer_head bh_map
= { .b_state
= 0, .b_blocknr
= 0 };
390 lblock
= head
->lh_blkno
;
391 gfs2_replay_incr_blk(sdp
, &lblock
);
392 bh_map
.b_size
= 1 << ip
->i_inode
.i_blkbits
;
393 error
= gfs2_block_map(&ip
->i_inode
, lblock
, &bh_map
, 0);
396 if (!bh_map
.b_blocknr
) {
397 gfs2_consist_inode(ip
);
401 bh
= sb_getblk(sdp
->sd_vfs
, bh_map
.b_blocknr
);
403 memset(bh
->b_data
, 0, bh
->b_size
);
404 set_buffer_uptodate(bh
);
405 clear_buffer_dirty(bh
);
408 lh
= (struct gfs2_log_header
*)bh
->b_data
;
409 memset(lh
, 0, sizeof(struct gfs2_log_header
));
410 lh
->lh_header
.mh_magic
= cpu_to_be32(GFS2_MAGIC
);
411 lh
->lh_header
.mh_type
= cpu_to_be32(GFS2_METATYPE_LH
);
412 lh
->lh_header
.mh_format
= cpu_to_be32(GFS2_FORMAT_LH
);
413 lh
->lh_sequence
= cpu_to_be64(head
->lh_sequence
+ 1);
414 lh
->lh_flags
= cpu_to_be32(GFS2_LOG_HEAD_UNMOUNT
);
415 lh
->lh_blkno
= cpu_to_be32(lblock
);
416 hash
= gfs2_disk_hash((const char *)lh
, sizeof(struct gfs2_log_header
));
417 lh
->lh_hash
= cpu_to_be32(hash
);
419 set_buffer_dirty(bh
);
420 if (sync_dirty_buffer(bh
))
421 gfs2_io_error_bh(sdp
, bh
);
428 static void gfs2_lm_recovery_done(struct gfs2_sbd
*sdp
, unsigned int jid
,
429 unsigned int message
)
431 if (likely(!test_bit(SDF_SHUTDOWN
, &sdp
->sd_flags
)))
432 sdp
->sd_lockstruct
.ls_ops
->lm_recovery_done(
433 sdp
->sd_lockstruct
.ls_lockspace
, jid
, message
);
438 * gfs2_recover_journal - recovery a given journal
439 * @jd: the struct gfs2_jdesc describing the journal
441 * Acquire the journal's lock, check to see if the journal is clean, and
442 * do recovery if necessary.
447 int gfs2_recover_journal(struct gfs2_jdesc
*jd
)
449 struct gfs2_inode
*ip
= GFS2_I(jd
->jd_inode
);
450 struct gfs2_sbd
*sdp
= GFS2_SB(jd
->jd_inode
);
451 struct gfs2_log_header_host head
;
452 struct gfs2_holder j_gh
, ji_gh
, t_gh
;
458 if (jd
->jd_jid
!= sdp
->sd_lockstruct
.ls_jid
) {
459 fs_info(sdp
, "jid=%u: Trying to acquire journal lock...\n",
462 /* Acquire the journal lock so we can do recovery */
464 error
= gfs2_glock_nq_num(sdp
, jd
->jd_jid
, &gfs2_journal_glops
,
466 LM_FLAG_NOEXP
| LM_FLAG_TRY
| GL_NOCACHE
,
473 fs_info(sdp
, "jid=%u: Busy\n", jd
->jd_jid
);
480 error
= gfs2_glock_nq_init(ip
->i_gl
, LM_ST_SHARED
,
481 LM_FLAG_NOEXP
| GL_NOCACHE
, &ji_gh
);
485 fs_info(sdp
, "jid=%u, already locked for use\n", jd
->jd_jid
);
488 fs_info(sdp
, "jid=%u: Looking at journal...\n", jd
->jd_jid
);
490 error
= gfs2_jdesc_check(jd
);
492 goto fail_gunlock_ji
;
494 error
= gfs2_find_jhead(jd
, &head
);
496 goto fail_gunlock_ji
;
498 if (!(head
.lh_flags
& GFS2_LOG_HEAD_UNMOUNT
)) {
499 fs_info(sdp
, "jid=%u: Acquiring the transaction lock...\n",
504 /* Acquire a shared hold on the transaction lock */
506 error
= gfs2_glock_nq_init(sdp
->sd_trans_gl
, LM_ST_SHARED
,
507 LM_FLAG_NOEXP
| LM_FLAG_PRIORITY
|
508 GL_NOCANCEL
| GL_NOCACHE
, &t_gh
);
510 goto fail_gunlock_ji
;
512 if (test_bit(SDF_JOURNAL_CHECKED
, &sdp
->sd_flags
)) {
513 if (!test_bit(SDF_JOURNAL_LIVE
, &sdp
->sd_flags
))
516 if (sdp
->sd_vfs
->s_flags
& MS_RDONLY
) {
517 /* check if device itself is read-only */
518 ro
= bdev_read_only(sdp
->sd_vfs
->s_bdev
);
520 fs_info(sdp
, "recovery required on "
521 "read-only filesystem.\n");
522 fs_info(sdp
, "write access will be "
523 "enabled during recovery.\n");
529 fs_warn(sdp
, "jid=%u: Can't replay: read-only block "
530 "device\n", jd
->jd_jid
);
532 goto fail_gunlock_tr
;
535 fs_info(sdp
, "jid=%u: Replaying journal...\n", jd
->jd_jid
);
537 for (pass
= 0; pass
< 2; pass
++) {
538 lops_before_scan(jd
, &head
, pass
);
539 error
= foreach_descriptor(jd
, head
.lh_tail
,
540 head
.lh_blkno
, pass
);
541 lops_after_scan(jd
, error
, pass
);
543 goto fail_gunlock_tr
;
546 error
= clean_journal(jd
, &head
);
548 goto fail_gunlock_tr
;
550 gfs2_glock_dq_uninit(&t_gh
);
551 t
= DIV_ROUND_UP(jiffies
- t
, HZ
);
552 fs_info(sdp
, "jid=%u: Journal replayed in %lus\n",
556 if (jd
->jd_jid
!= sdp
->sd_lockstruct
.ls_jid
)
557 gfs2_glock_dq_uninit(&ji_gh
);
559 gfs2_lm_recovery_done(sdp
, jd
->jd_jid
, LM_RD_SUCCESS
);
561 if (jd
->jd_jid
!= sdp
->sd_lockstruct
.ls_jid
)
562 gfs2_glock_dq_uninit(&j_gh
);
564 fs_info(sdp
, "jid=%u: Done\n", jd
->jd_jid
);
568 gfs2_glock_dq_uninit(&t_gh
);
570 if (jd
->jd_jid
!= sdp
->sd_lockstruct
.ls_jid
) {
571 gfs2_glock_dq_uninit(&ji_gh
);
573 gfs2_glock_dq_uninit(&j_gh
);
576 fs_info(sdp
, "jid=%u: %s\n", jd
->jd_jid
, (error
) ? "Failed" : "Done");
579 gfs2_lm_recovery_done(sdp
, jd
->jd_jid
, LM_RD_GAVEUP
);
584 * gfs2_check_journals - Recover any dirty journals
585 * @sdp: the filesystem
589 void gfs2_check_journals(struct gfs2_sbd
*sdp
)
591 struct gfs2_jdesc
*jd
;
594 jd
= gfs2_jdesc_find_dirty(sdp
);
598 if (jd
!= sdp
->sd_jdesc
)
599 gfs2_recover_journal(jd
);