2006-01-17 00:50:04 +08:00
|
|
|
/*
|
|
|
|
* Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
|
2006-05-19 03:09:15 +08:00
|
|
|
* Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
|
2006-01-17 00:50:04 +08:00
|
|
|
*
|
|
|
|
* This copyrighted material is made available to anyone wishing to use,
|
|
|
|
* modify, copy, or redistribute it subject to the terms and conditions
|
2006-09-01 23:05:15 +08:00
|
|
|
* of the GNU General Public License version 2.
|
2006-01-17 00:50:04 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/completion.h>
|
|
|
|
#include <linux/buffer_head.h>
|
2006-02-28 06:23:27 +08:00
|
|
|
#include <linux/gfs2_ondisk.h>
|
2006-03-29 03:14:04 +08:00
|
|
|
#include <linux/crc32.h>
|
2006-09-19 13:56:29 +08:00
|
|
|
#include <linux/lm_interface.h>
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
#include "gfs2.h"
|
2006-02-28 06:23:27 +08:00
|
|
|
#include "incore.h"
|
2006-01-17 00:50:04 +08:00
|
|
|
#include "bmap.h"
|
|
|
|
#include "glock.h"
|
|
|
|
#include "glops.h"
|
|
|
|
#include "lm.h"
|
|
|
|
#include "lops.h"
|
|
|
|
#include "meta_io.h"
|
|
|
|
#include "recovery.h"
|
|
|
|
#include "super.h"
|
2006-02-28 06:23:27 +08:00
|
|
|
#include "util.h"
|
2006-03-29 03:14:04 +08:00
|
|
|
#include "dir.h"
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
int gfs2_replay_read_block(struct gfs2_jdesc *jd, unsigned int blk,
|
|
|
|
struct buffer_head **bh)
|
|
|
|
{
|
2006-06-15 03:32:57 +08:00
|
|
|
struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
|
2006-02-28 06:23:27 +08:00
|
|
|
struct gfs2_glock *gl = ip->i_gl;
|
2006-01-17 00:50:04 +08:00
|
|
|
int new = 0;
|
2006-09-05 00:49:07 +08:00
|
|
|
u64 dblock;
|
|
|
|
u32 extlen;
|
2006-01-17 00:50:04 +08:00
|
|
|
int error;
|
|
|
|
|
2006-06-15 03:32:57 +08:00
|
|
|
error = gfs2_extent_map(&ip->i_inode, blk, &new, &dblock, &extlen);
|
2006-01-17 00:50:04 +08:00
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
if (!dblock) {
|
2006-02-28 06:23:27 +08:00
|
|
|
gfs2_consist_inode(ip);
|
2006-01-17 00:50:04 +08:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
2006-09-22 05:05:23 +08:00
|
|
|
*bh = gfs2_meta_ra(gl, dblock, extlen);
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2006-09-05 00:49:07 +08:00
|
|
|
int gfs2_revoke_add(struct gfs2_sbd *sdp, u64 blkno, unsigned int where)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
|
|
|
struct list_head *head = &sdp->sd_revoke_list;
|
|
|
|
struct gfs2_revoke_replay *rr;
|
|
|
|
int found = 0;
|
|
|
|
|
|
|
|
list_for_each_entry(rr, head, rr_list) {
|
|
|
|
if (rr->rr_blkno == blkno) {
|
|
|
|
found = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (found) {
|
|
|
|
rr->rr_where = where;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
rr = kmalloc(sizeof(struct gfs2_revoke_replay), GFP_KERNEL);
|
|
|
|
if (!rr)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
rr->rr_blkno = blkno;
|
|
|
|
rr->rr_where = where;
|
|
|
|
list_add(&rr->rr_list, head);
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2006-09-05 00:49:07 +08:00
|
|
|
int gfs2_revoke_check(struct gfs2_sbd *sdp, u64 blkno, unsigned int where)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
|
|
|
struct gfs2_revoke_replay *rr;
|
|
|
|
int wrap, a, b, revoke;
|
|
|
|
int found = 0;
|
|
|
|
|
|
|
|
list_for_each_entry(rr, &sdp->sd_revoke_list, rr_list) {
|
|
|
|
if (rr->rr_blkno == blkno) {
|
|
|
|
found = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!found)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
wrap = (rr->rr_where < sdp->sd_replay_tail);
|
|
|
|
a = (sdp->sd_replay_tail < where);
|
|
|
|
b = (where < rr->rr_where);
|
|
|
|
revoke = (wrap) ? (a || b) : (a && b);
|
|
|
|
|
|
|
|
return revoke;
|
|
|
|
}
|
|
|
|
|
|
|
|
void gfs2_revoke_clean(struct gfs2_sbd *sdp)
|
|
|
|
{
|
|
|
|
struct list_head *head = &sdp->sd_revoke_list;
|
|
|
|
struct gfs2_revoke_replay *rr;
|
|
|
|
|
|
|
|
while (!list_empty(head)) {
|
|
|
|
rr = list_entry(head->next, struct gfs2_revoke_replay, rr_list);
|
|
|
|
list_del(&rr->rr_list);
|
|
|
|
kfree(rr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-01 21:11:58 +08:00
|
|
|
static int gfs2_log_header_in(struct gfs2_log_header_host *lh, const void *buf)
|
|
|
|
{
|
|
|
|
const struct gfs2_log_header *str = buf;
|
|
|
|
|
|
|
|
if (str->lh_header.mh_magic != cpu_to_be32(GFS2_MAGIC) ||
|
|
|
|
str->lh_header.mh_type != cpu_to_be32(GFS2_METATYPE_LH))
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
lh->lh_sequence = be64_to_cpu(str->lh_sequence);
|
|
|
|
lh->lh_flags = be32_to_cpu(str->lh_flags);
|
|
|
|
lh->lh_tail = be32_to_cpu(str->lh_tail);
|
|
|
|
lh->lh_blkno = be32_to_cpu(str->lh_blkno);
|
|
|
|
lh->lh_hash = be32_to_cpu(str->lh_hash);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-01-17 00:50:04 +08:00
|
|
|
/**
|
|
|
|
* get_log_header - read the log header for a given segment
|
|
|
|
* @jd: the journal
|
|
|
|
* @blk: the block to look at
|
|
|
|
* @lh: the log header to return
|
|
|
|
*
|
|
|
|
* Read the log header for a given segement in a given journal. Do a few
|
|
|
|
* sanity checks on it.
|
|
|
|
*
|
|
|
|
* Returns: 0 on success,
|
|
|
|
* 1 if the header was invalid or incomplete,
|
|
|
|
* errno on error
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int get_log_header(struct gfs2_jdesc *jd, unsigned int blk,
|
2006-10-14 09:47:13 +08:00
|
|
|
struct gfs2_log_header_host *head)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
|
|
|
struct buffer_head *bh;
|
2006-10-14 09:47:13 +08:00
|
|
|
struct gfs2_log_header_host lh;
|
2006-12-06 02:34:17 +08:00
|
|
|
const u32 nothing = 0;
|
2006-09-05 00:49:07 +08:00
|
|
|
u32 hash;
|
2006-01-17 00:50:04 +08:00
|
|
|
int error;
|
|
|
|
|
|
|
|
error = gfs2_replay_read_block(jd, blk, &bh);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
2006-11-01 03:44:50 +08:00
|
|
|
hash = crc32_le((u32)~0, bh->b_data, sizeof(struct gfs2_log_header) -
|
|
|
|
sizeof(u32));
|
|
|
|
hash = crc32_le(hash, (unsigned char const *)¬hing, sizeof(nothing));
|
|
|
|
hash ^= (u32)~0;
|
2007-06-01 21:11:58 +08:00
|
|
|
error = gfs2_log_header_in(&lh, bh->b_data);
|
2006-01-17 00:50:04 +08:00
|
|
|
brelse(bh);
|
|
|
|
|
2007-06-01 21:11:58 +08:00
|
|
|
if (error || lh.lh_blkno != blk || lh.lh_hash != hash)
|
2006-01-17 00:50:04 +08:00
|
|
|
return 1;
|
|
|
|
|
|
|
|
*head = lh;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* find_good_lh - find a good log header
|
|
|
|
* @jd: the journal
|
|
|
|
* @blk: the segment to start searching from
|
|
|
|
* @lh: the log header to fill in
|
|
|
|
* @forward: if true search forward in the log, else search backward
|
|
|
|
*
|
|
|
|
* Call get_log_header() to get a log header for a segment, but if the
|
|
|
|
* segment is bad, either scan forward or backward until we find a good one.
|
|
|
|
*
|
|
|
|
* Returns: errno
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int find_good_lh(struct gfs2_jdesc *jd, unsigned int *blk,
|
2006-10-14 09:47:13 +08:00
|
|
|
struct gfs2_log_header_host *head)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
|
|
|
unsigned int orig_blk = *blk;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
error = get_log_header(jd, *blk, head);
|
|
|
|
if (error <= 0)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
if (++*blk == jd->jd_blocks)
|
|
|
|
*blk = 0;
|
|
|
|
|
|
|
|
if (*blk == orig_blk) {
|
2006-06-15 03:32:57 +08:00
|
|
|
gfs2_consist_inode(GFS2_I(jd->jd_inode));
|
2006-01-17 00:50:04 +08:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* jhead_scan - make sure we've found the head of the log
|
|
|
|
* @jd: the journal
|
|
|
|
* @head: this is filled in with the log descriptor of the head
|
|
|
|
*
|
|
|
|
* At this point, seg and lh should be either the head of the log or just
|
|
|
|
* before. Scan forward until we find the head.
|
|
|
|
*
|
|
|
|
* Returns: errno
|
|
|
|
*/
|
|
|
|
|
2006-10-14 09:47:13 +08:00
|
|
|
static int jhead_scan(struct gfs2_jdesc *jd, struct gfs2_log_header_host *head)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
|
|
|
unsigned int blk = head->lh_blkno;
|
2006-10-14 09:47:13 +08:00
|
|
|
struct gfs2_log_header_host lh;
|
2006-01-17 00:50:04 +08:00
|
|
|
int error;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
if (++blk == jd->jd_blocks)
|
|
|
|
blk = 0;
|
|
|
|
|
|
|
|
error = get_log_header(jd, blk, &lh);
|
|
|
|
if (error < 0)
|
|
|
|
return error;
|
|
|
|
if (error == 1)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (lh.lh_sequence == head->lh_sequence) {
|
2006-06-15 03:32:57 +08:00
|
|
|
gfs2_consist_inode(GFS2_I(jd->jd_inode));
|
2006-01-17 00:50:04 +08:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
if (lh.lh_sequence < head->lh_sequence)
|
|
|
|
break;
|
|
|
|
|
|
|
|
*head = lh;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* gfs2_find_jhead - find the head of a log
|
|
|
|
* @jd: the journal
|
|
|
|
* @head: the log descriptor for the head of the log is returned here
|
|
|
|
*
|
|
|
|
* Do a binary search of a journal and find the valid log entry with the
|
|
|
|
* highest sequence number. (i.e. the log head)
|
|
|
|
*
|
|
|
|
* Returns: errno
|
|
|
|
*/
|
|
|
|
|
2006-10-14 09:47:13 +08:00
|
|
|
int gfs2_find_jhead(struct gfs2_jdesc *jd, struct gfs2_log_header_host *head)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
2006-10-14 09:47:13 +08:00
|
|
|
struct gfs2_log_header_host lh_1, lh_m;
|
2006-09-05 00:49:07 +08:00
|
|
|
u32 blk_1, blk_2, blk_m;
|
2006-01-17 00:50:04 +08:00
|
|
|
int error;
|
|
|
|
|
|
|
|
blk_1 = 0;
|
|
|
|
blk_2 = jd->jd_blocks - 1;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
blk_m = (blk_1 + blk_2) / 2;
|
|
|
|
|
|
|
|
error = find_good_lh(jd, &blk_1, &lh_1);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
error = find_good_lh(jd, &blk_m, &lh_m);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
if (blk_1 == blk_m || blk_m == blk_2)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (lh_1.lh_sequence <= lh_m.lh_sequence)
|
|
|
|
blk_1 = blk_m;
|
|
|
|
else
|
|
|
|
blk_2 = blk_m;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = jhead_scan(jd, &lh_1);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
*head = lh_1;
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* foreach_descriptor - go through the active part of the log
|
|
|
|
* @jd: the journal
|
|
|
|
* @start: the first log header in the active region
|
|
|
|
* @end: the last log header (don't process the contents of this entry))
|
|
|
|
*
|
|
|
|
* Call a given function once for every log descriptor in the active
|
|
|
|
* portion of the log.
|
|
|
|
*
|
|
|
|
* Returns: errno
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int foreach_descriptor(struct gfs2_jdesc *jd, unsigned int start,
|
|
|
|
unsigned int end, int pass)
|
|
|
|
{
|
2006-06-15 03:32:57 +08:00
|
|
|
struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
|
2006-01-17 00:50:04 +08:00
|
|
|
struct buffer_head *bh;
|
|
|
|
struct gfs2_log_descriptor *ld;
|
|
|
|
int error = 0;
|
|
|
|
u32 length;
|
|
|
|
__be64 *ptr;
|
|
|
|
unsigned int offset = sizeof(struct gfs2_log_descriptor);
|
2006-09-06 02:41:30 +08:00
|
|
|
offset += sizeof(__be64) - 1;
|
|
|
|
offset &= ~(sizeof(__be64) - 1);
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
while (start != end) {
|
|
|
|
error = gfs2_replay_read_block(jd, start, &bh);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
if (gfs2_meta_check(sdp, bh)) {
|
|
|
|
brelse(bh);
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
ld = (struct gfs2_log_descriptor *)bh->b_data;
|
|
|
|
length = be32_to_cpu(ld->ld_length);
|
|
|
|
|
2006-03-31 04:46:23 +08:00
|
|
|
if (be32_to_cpu(ld->ld_header.mh_type) == GFS2_METATYPE_LH) {
|
2006-10-14 09:47:13 +08:00
|
|
|
struct gfs2_log_header_host lh;
|
2006-01-17 00:50:04 +08:00
|
|
|
error = get_log_header(jd, start, &lh);
|
|
|
|
if (!error) {
|
|
|
|
gfs2_replay_incr_blk(sdp, &start);
|
2006-08-11 00:08:40 +08:00
|
|
|
brelse(bh);
|
2006-01-17 00:50:04 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (error == 1) {
|
2006-06-15 03:32:57 +08:00
|
|
|
gfs2_consist_inode(GFS2_I(jd->jd_inode));
|
2006-01-17 00:50:04 +08:00
|
|
|
error = -EIO;
|
|
|
|
}
|
|
|
|
brelse(bh);
|
|
|
|
return error;
|
|
|
|
} else if (gfs2_metatype_check(sdp, bh, GFS2_METATYPE_LD)) {
|
|
|
|
brelse(bh);
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
ptr = (__be64 *)(bh->b_data + offset);
|
|
|
|
error = lops_scan_elements(jd, start, ld, ptr, pass);
|
|
|
|
if (error) {
|
|
|
|
brelse(bh);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (length--)
|
|
|
|
gfs2_replay_incr_blk(sdp, &start);
|
|
|
|
|
|
|
|
brelse(bh);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* clean_journal - mark a dirty journal as being clean
|
|
|
|
* @sdp: the filesystem
|
|
|
|
* @jd: the journal
|
|
|
|
* @gl: the journal's glock
|
|
|
|
* @head: the head journal to start from
|
|
|
|
*
|
|
|
|
* Returns: errno
|
|
|
|
*/
|
|
|
|
|
2006-10-14 09:47:13 +08:00
|
|
|
static int clean_journal(struct gfs2_jdesc *jd, struct gfs2_log_header_host *head)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
2006-06-15 03:32:57 +08:00
|
|
|
struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
|
|
|
|
struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
|
2006-01-17 00:50:04 +08:00
|
|
|
unsigned int lblock;
|
|
|
|
struct gfs2_log_header *lh;
|
2006-09-05 00:49:07 +08:00
|
|
|
u32 hash;
|
2006-01-17 00:50:04 +08:00
|
|
|
struct buffer_head *bh;
|
|
|
|
int error;
|
2006-10-14 05:25:45 +08:00
|
|
|
struct buffer_head bh_map = { .b_state = 0, .b_blocknr = 0 };
|
2006-05-06 04:59:11 +08:00
|
|
|
|
2006-01-17 00:50:04 +08:00
|
|
|
lblock = head->lh_blkno;
|
|
|
|
gfs2_replay_incr_blk(sdp, &lblock);
|
2006-10-14 05:25:45 +08:00
|
|
|
bh_map.b_size = 1 << ip->i_inode.i_blkbits;
|
|
|
|
error = gfs2_block_map(&ip->i_inode, lblock, 0, &bh_map);
|
2006-01-17 00:50:04 +08:00
|
|
|
if (error)
|
|
|
|
return error;
|
2006-09-19 05:18:23 +08:00
|
|
|
if (!bh_map.b_blocknr) {
|
2006-01-17 00:50:04 +08:00
|
|
|
gfs2_consist_inode(ip);
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
2006-09-19 05:18:23 +08:00
|
|
|
bh = sb_getblk(sdp->sd_vfs, bh_map.b_blocknr);
|
2006-01-17 00:50:04 +08:00
|
|
|
lock_buffer(bh);
|
|
|
|
memset(bh->b_data, 0, bh->b_size);
|
|
|
|
set_buffer_uptodate(bh);
|
|
|
|
clear_buffer_dirty(bh);
|
|
|
|
unlock_buffer(bh);
|
|
|
|
|
|
|
|
lh = (struct gfs2_log_header *)bh->b_data;
|
|
|
|
memset(lh, 0, sizeof(struct gfs2_log_header));
|
|
|
|
lh->lh_header.mh_magic = cpu_to_be32(GFS2_MAGIC);
|
2006-08-11 00:08:40 +08:00
|
|
|
lh->lh_header.mh_type = cpu_to_be32(GFS2_METATYPE_LH);
|
2006-03-31 04:46:23 +08:00
|
|
|
lh->lh_header.mh_format = cpu_to_be32(GFS2_FORMAT_LH);
|
2006-01-17 00:50:04 +08:00
|
|
|
lh->lh_sequence = cpu_to_be64(head->lh_sequence + 1);
|
|
|
|
lh->lh_flags = cpu_to_be32(GFS2_LOG_HEAD_UNMOUNT);
|
|
|
|
lh->lh_blkno = cpu_to_be32(lblock);
|
|
|
|
hash = gfs2_disk_hash((const char *)lh, sizeof(struct gfs2_log_header));
|
|
|
|
lh->lh_hash = cpu_to_be32(hash);
|
|
|
|
|
|
|
|
set_buffer_dirty(bh);
|
|
|
|
if (sync_dirty_buffer(bh))
|
|
|
|
gfs2_io_error_bh(sdp, bh);
|
|
|
|
brelse(bh);
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* gfs2_recover_journal - recovery a given journal
|
|
|
|
* @jd: the struct gfs2_jdesc describing the journal
|
|
|
|
*
|
|
|
|
* Acquire the journal's lock, check to see if the journal is clean, and
|
|
|
|
* do recovery if necessary.
|
|
|
|
*
|
|
|
|
* Returns: errno
|
|
|
|
*/
|
|
|
|
|
2006-04-21 05:03:48 +08:00
|
|
|
int gfs2_recover_journal(struct gfs2_jdesc *jd)
|
2006-01-17 00:50:04 +08:00
|
|
|
{
|
2006-06-15 03:32:57 +08:00
|
|
|
struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
|
|
|
|
struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
|
2006-10-14 09:47:13 +08:00
|
|
|
struct gfs2_log_header_host head;
|
2006-01-17 00:50:04 +08:00
|
|
|
struct gfs2_holder j_gh, ji_gh, t_gh;
|
|
|
|
unsigned long t;
|
|
|
|
int ro = 0;
|
|
|
|
unsigned int pass;
|
|
|
|
int error;
|
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
if (jd->jd_jid != sdp->sd_lockstruct.ls_jid) {
|
|
|
|
fs_info(sdp, "jid=%u: Trying to acquire journal lock...\n",
|
|
|
|
jd->jd_jid);
|
2006-01-17 00:50:04 +08:00
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
/* Aquire the journal lock so we can do recovery */
|
2006-01-17 00:50:04 +08:00
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
error = gfs2_glock_nq_num(sdp, jd->jd_jid, &gfs2_journal_glops,
|
|
|
|
LM_ST_EXCLUSIVE,
|
|
|
|
LM_FLAG_NOEXP | LM_FLAG_TRY | GL_NOCACHE,
|
|
|
|
&j_gh);
|
|
|
|
switch (error) {
|
|
|
|
case 0:
|
|
|
|
break;
|
2006-09-25 21:26:04 +08:00
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
case GLR_TRYFAILED:
|
|
|
|
fs_info(sdp, "jid=%u: Busy\n", jd->jd_jid);
|
|
|
|
error = 0;
|
2006-09-25 21:26:04 +08:00
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
default:
|
|
|
|
goto fail;
|
|
|
|
};
|
2006-01-17 00:50:04 +08:00
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
error = gfs2_glock_nq_init(ip->i_gl, LM_ST_SHARED,
|
2007-08-09 06:08:14 +08:00
|
|
|
LM_FLAG_NOEXP | GL_NOCACHE, &ji_gh);
|
2006-04-27 01:21:55 +08:00
|
|
|
if (error)
|
|
|
|
goto fail_gunlock_j;
|
|
|
|
} else {
|
|
|
|
fs_info(sdp, "jid=%u, already locked for use\n", jd->jd_jid);
|
|
|
|
}
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
fs_info(sdp, "jid=%u: Looking at journal...\n", jd->jd_jid);
|
|
|
|
|
|
|
|
error = gfs2_jdesc_check(jd);
|
|
|
|
if (error)
|
|
|
|
goto fail_gunlock_ji;
|
|
|
|
|
|
|
|
error = gfs2_find_jhead(jd, &head);
|
|
|
|
if (error)
|
|
|
|
goto fail_gunlock_ji;
|
|
|
|
|
|
|
|
if (!(head.lh_flags & GFS2_LOG_HEAD_UNMOUNT)) {
|
|
|
|
fs_info(sdp, "jid=%u: Acquiring the transaction lock...\n",
|
|
|
|
jd->jd_jid);
|
|
|
|
|
|
|
|
t = jiffies;
|
|
|
|
|
|
|
|
/* Acquire a shared hold on the transaction lock */
|
|
|
|
|
2006-08-05 03:41:22 +08:00
|
|
|
error = gfs2_glock_nq_init(sdp->sd_trans_gl, LM_ST_SHARED,
|
2006-04-27 01:21:55 +08:00
|
|
|
LM_FLAG_NOEXP | LM_FLAG_PRIORITY |
|
2006-08-05 03:41:22 +08:00
|
|
|
GL_NOCANCEL | GL_NOCACHE, &t_gh);
|
2006-01-17 00:50:04 +08:00
|
|
|
if (error)
|
|
|
|
goto fail_gunlock_ji;
|
|
|
|
|
|
|
|
if (test_bit(SDF_JOURNAL_CHECKED, &sdp->sd_flags)) {
|
|
|
|
if (!test_bit(SDF_JOURNAL_LIVE, &sdp->sd_flags))
|
|
|
|
ro = 1;
|
|
|
|
} else {
|
|
|
|
if (sdp->sd_vfs->s_flags & MS_RDONLY)
|
|
|
|
ro = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ro) {
|
|
|
|
fs_warn(sdp, "jid=%u: Can't replay: read-only FS\n",
|
|
|
|
jd->jd_jid);
|
|
|
|
error = -EROFS;
|
|
|
|
goto fail_gunlock_tr;
|
|
|
|
}
|
|
|
|
|
|
|
|
fs_info(sdp, "jid=%u: Replaying journal...\n", jd->jd_jid);
|
|
|
|
|
|
|
|
for (pass = 0; pass < 2; pass++) {
|
|
|
|
lops_before_scan(jd, &head, pass);
|
|
|
|
error = foreach_descriptor(jd, head.lh_tail,
|
|
|
|
head.lh_blkno, pass);
|
|
|
|
lops_after_scan(jd, error, pass);
|
|
|
|
if (error)
|
|
|
|
goto fail_gunlock_tr;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = clean_journal(jd, &head);
|
|
|
|
if (error)
|
|
|
|
goto fail_gunlock_tr;
|
|
|
|
|
|
|
|
gfs2_glock_dq_uninit(&t_gh);
|
2006-02-28 06:23:27 +08:00
|
|
|
t = DIV_ROUND_UP(jiffies - t, HZ);
|
2006-01-17 00:50:04 +08:00
|
|
|
fs_info(sdp, "jid=%u: Journal replayed in %lus\n",
|
|
|
|
jd->jd_jid, t);
|
|
|
|
}
|
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
if (jd->jd_jid != sdp->sd_lockstruct.ls_jid)
|
|
|
|
gfs2_glock_dq_uninit(&ji_gh);
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
gfs2_lm_recovery_done(sdp, jd->jd_jid, LM_RD_SUCCESS);
|
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
if (jd->jd_jid != sdp->sd_lockstruct.ls_jid)
|
|
|
|
gfs2_glock_dq_uninit(&j_gh);
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
fs_info(sdp, "jid=%u: Done\n", jd->jd_jid);
|
|
|
|
return 0;
|
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
fail_gunlock_tr:
|
2006-01-17 00:50:04 +08:00
|
|
|
gfs2_glock_dq_uninit(&t_gh);
|
2006-04-27 01:21:55 +08:00
|
|
|
fail_gunlock_ji:
|
|
|
|
if (jd->jd_jid != sdp->sd_lockstruct.ls_jid) {
|
|
|
|
gfs2_glock_dq_uninit(&ji_gh);
|
|
|
|
fail_gunlock_j:
|
|
|
|
gfs2_glock_dq_uninit(&j_gh);
|
|
|
|
}
|
2006-01-17 00:50:04 +08:00
|
|
|
|
|
|
|
fs_info(sdp, "jid=%u: %s\n", jd->jd_jid, (error) ? "Failed" : "Done");
|
|
|
|
|
2006-04-27 01:21:55 +08:00
|
|
|
fail:
|
2006-01-17 00:50:04 +08:00
|
|
|
gfs2_lm_recovery_done(sdp, jd->jd_jid, LM_RD_GAVEUP);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* gfs2_check_journals - Recover any dirty journals
|
|
|
|
* @sdp: the filesystem
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
void gfs2_check_journals(struct gfs2_sbd *sdp)
|
|
|
|
{
|
|
|
|
struct gfs2_jdesc *jd;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
jd = gfs2_jdesc_find_dirty(sdp);
|
|
|
|
if (!jd)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (jd != sdp->sd_jdesc)
|
2006-04-21 05:03:48 +08:00
|
|
|
gfs2_recover_journal(jd);
|
2006-01-17 00:50:04 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|