2006-10-11 16:20:57 +08:00
|
|
|
/*
|
2007-05-09 13:51:49 +08:00
|
|
|
* linux/fs/jbd2/recovery.c
|
2006-10-11 16:20:57 +08:00
|
|
|
*
|
|
|
|
* Written by Stephen C. Tweedie <sct@redhat.com>, 1999
|
|
|
|
*
|
|
|
|
* Copyright 1999-2000 Red Hat Software --- All Rights Reserved
|
|
|
|
*
|
|
|
|
* This file is part of the Linux kernel and is made available under
|
|
|
|
* the terms of the GNU General Public License, version 2, or at your
|
|
|
|
* option, any later version, incorporated herein by reference.
|
|
|
|
*
|
|
|
|
* Journal recovery routines for the generic filesystem journaling code;
|
|
|
|
* part of the ext2fs journaling system.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __KERNEL__
|
|
|
|
#include "jfs_user.h"
|
|
|
|
#else
|
|
|
|
#include <linux/time.h>
|
|
|
|
#include <linux/fs.h>
|
2006-10-11 16:20:59 +08:00
|
|
|
#include <linux/jbd2.h>
|
2006-10-11 16:20:57 +08:00
|
|
|
#include <linux/errno.h>
|
2008-01-29 12:58:27 +08:00
|
|
|
#include <linux/crc32.h>
|
2012-03-14 10:22:54 +08:00
|
|
|
#include <linux/blkdev.h>
|
2006-10-11 16:20:57 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Maintain information about the progress of the recovery job, so that
|
|
|
|
* the different passes can carry information between them.
|
|
|
|
*/
|
|
|
|
struct recovery_info
|
|
|
|
{
|
|
|
|
tid_t start_transaction;
|
|
|
|
tid_t end_transaction;
|
|
|
|
|
|
|
|
int nr_replays;
|
|
|
|
int nr_revokes;
|
|
|
|
int nr_revoke_hits;
|
|
|
|
};
|
|
|
|
|
|
|
|
enum passtype {PASS_SCAN, PASS_REVOKE, PASS_REPLAY};
|
|
|
|
static int do_one_pass(journal_t *journal,
|
|
|
|
struct recovery_info *info, enum passtype pass);
|
|
|
|
static int scan_revoke_records(journal_t *, struct buffer_head *,
|
|
|
|
tid_t, struct recovery_info *);
|
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
|
|
|
|
|
|
|
/* Release readahead buffers after use */
|
|
|
|
static void journal_brelse_array(struct buffer_head *b[], int n)
|
|
|
|
{
|
|
|
|
while (--n >= 0)
|
|
|
|
brelse (b[n]);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* When reading from the journal, we are going through the block device
|
|
|
|
* layer directly and so there is no readahead being done for us. We
|
|
|
|
* need to implement any readahead ourselves if we want it to happen at
|
|
|
|
* all. Recovery is basically one long sequential read, so make sure we
|
|
|
|
* do the IO in reasonably large chunks.
|
|
|
|
*
|
|
|
|
* This is not so critical that we need to be enormously clever about
|
|
|
|
* the readahead size, though. 128K is a purely arbitrary, good-enough
|
|
|
|
* fixed value.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define MAXBUF 8
|
|
|
|
static int do_readahead(journal_t *journal, unsigned int start)
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
unsigned int max, nbufs, next;
|
2006-10-11 16:21:13 +08:00
|
|
|
unsigned long long blocknr;
|
2006-10-11 16:20:57 +08:00
|
|
|
struct buffer_head *bh;
|
|
|
|
|
|
|
|
struct buffer_head * bufs[MAXBUF];
|
|
|
|
|
|
|
|
/* Do up to 128K of readahead */
|
|
|
|
max = start + (128 * 1024 / journal->j_blocksize);
|
|
|
|
if (max > journal->j_maxlen)
|
|
|
|
max = journal->j_maxlen;
|
|
|
|
|
|
|
|
/* Do the readahead itself. We'll submit MAXBUF buffer_heads at
|
|
|
|
* a time to the block device IO layer. */
|
|
|
|
|
|
|
|
nbufs = 0;
|
|
|
|
|
|
|
|
for (next = start; next < max; next++) {
|
2006-10-11 16:20:59 +08:00
|
|
|
err = jbd2_journal_bmap(journal, next, &blocknr);
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
if (err) {
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR "JBD2: bad block at offset %u\n",
|
2006-10-11 16:20:57 +08:00
|
|
|
next);
|
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
|
|
|
|
bh = __getblk(journal->j_dev, blocknr, journal->j_blocksize);
|
|
|
|
if (!bh) {
|
|
|
|
err = -ENOMEM;
|
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!buffer_uptodate(bh) && !buffer_locked(bh)) {
|
|
|
|
bufs[nbufs++] = bh;
|
|
|
|
if (nbufs == MAXBUF) {
|
|
|
|
ll_rw_block(READ, nbufs, bufs);
|
|
|
|
journal_brelse_array(bufs, nbufs);
|
|
|
|
nbufs = 0;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
brelse(bh);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nbufs)
|
|
|
|
ll_rw_block(READ, nbufs, bufs);
|
|
|
|
err = 0;
|
|
|
|
|
|
|
|
failed:
|
|
|
|
if (nbufs)
|
|
|
|
journal_brelse_array(bufs, nbufs);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* __KERNEL__ */
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Read a block from the journal
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int jread(struct buffer_head **bhp, journal_t *journal,
|
|
|
|
unsigned int offset)
|
|
|
|
{
|
|
|
|
int err;
|
2006-10-11 16:21:13 +08:00
|
|
|
unsigned long long blocknr;
|
2006-10-11 16:20:57 +08:00
|
|
|
struct buffer_head *bh;
|
|
|
|
|
|
|
|
*bhp = NULL;
|
|
|
|
|
|
|
|
if (offset >= journal->j_maxlen) {
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR "JBD2: corrupted journal superblock\n");
|
2006-10-11 16:20:57 +08:00
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
2006-10-11 16:20:59 +08:00
|
|
|
err = jbd2_journal_bmap(journal, offset, &blocknr);
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
if (err) {
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR "JBD2: bad block at offset %u\n",
|
2006-10-11 16:20:57 +08:00
|
|
|
offset);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
bh = __getblk(journal->j_dev, blocknr, journal->j_blocksize);
|
|
|
|
if (!bh)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
if (!buffer_uptodate(bh)) {
|
|
|
|
/* If this is a brand new buffer, start readahead.
|
|
|
|
Otherwise, we assume we are already reading it. */
|
|
|
|
if (!buffer_req(bh))
|
|
|
|
do_readahead(journal, offset);
|
|
|
|
wait_on_buffer(bh);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!buffer_uptodate(bh)) {
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR "JBD2: Failed to read block at offset %u\n",
|
2006-10-11 16:20:57 +08:00
|
|
|
offset);
|
|
|
|
brelse(bh);
|
|
|
|
return -EIO;
|
|
|
|
}
|
|
|
|
|
|
|
|
*bhp = bh;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-27 20:10:22 +08:00
|
|
|
static int jbd2_descr_block_csum_verify(journal_t *j,
|
|
|
|
void *buf)
|
|
|
|
{
|
|
|
|
struct jbd2_journal_block_tail *tail;
|
2013-08-29 02:59:58 +08:00
|
|
|
__be32 provided;
|
|
|
|
__u32 calculated;
|
2012-05-27 20:10:22 +08:00
|
|
|
|
2014-08-28 06:40:07 +08:00
|
|
|
if (!jbd2_journal_has_csum_v2or3(j))
|
2012-05-27 20:10:22 +08:00
|
|
|
return 1;
|
|
|
|
|
|
|
|
tail = (struct jbd2_journal_block_tail *)(buf + j->j_blocksize -
|
|
|
|
sizeof(struct jbd2_journal_block_tail));
|
|
|
|
provided = tail->t_checksum;
|
|
|
|
tail->t_checksum = 0;
|
|
|
|
calculated = jbd2_chksum(j, j->j_csum_seed, buf, j->j_blocksize);
|
|
|
|
tail->t_checksum = provided;
|
|
|
|
|
2013-08-29 02:59:58 +08:00
|
|
|
return provided == cpu_to_be32(calculated);
|
2012-05-27 20:10:22 +08:00
|
|
|
}
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Count the number of in-use tags in a journal descriptor block.
|
|
|
|
*/
|
|
|
|
|
2006-10-11 16:21:08 +08:00
|
|
|
static int count_tags(journal_t *journal, struct buffer_head *bh)
|
2006-10-11 16:20:57 +08:00
|
|
|
{
|
|
|
|
char * tagp;
|
|
|
|
journal_block_tag_t * tag;
|
2006-10-11 16:21:08 +08:00
|
|
|
int nr = 0, size = journal->j_blocksize;
|
|
|
|
int tag_bytes = journal_tag_bytes(journal);
|
2006-10-11 16:20:57 +08:00
|
|
|
|
2014-08-28 06:40:07 +08:00
|
|
|
if (jbd2_journal_has_csum_v2or3(journal))
|
2012-05-27 20:10:22 +08:00
|
|
|
size -= sizeof(struct jbd2_journal_block_tail);
|
|
|
|
|
2006-10-11 16:20:57 +08:00
|
|
|
tagp = &bh->b_data[sizeof(journal_header_t)];
|
|
|
|
|
2006-10-11 16:21:08 +08:00
|
|
|
while ((tagp - bh->b_data + tag_bytes) <= size) {
|
2006-10-11 16:20:57 +08:00
|
|
|
tag = (journal_block_tag_t *) tagp;
|
|
|
|
|
|
|
|
nr++;
|
2006-10-11 16:21:08 +08:00
|
|
|
tagp += tag_bytes;
|
2012-05-23 10:43:41 +08:00
|
|
|
if (!(tag->t_flags & cpu_to_be16(JBD2_FLAG_SAME_UUID)))
|
2006-10-11 16:20:57 +08:00
|
|
|
tagp += 16;
|
|
|
|
|
2012-05-23 10:43:41 +08:00
|
|
|
if (tag->t_flags & cpu_to_be16(JBD2_FLAG_LAST_TAG))
|
2006-10-11 16:20:57 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return nr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Make sure we wrap around the log correctly! */
|
|
|
|
#define wrap(journal, var) \
|
|
|
|
do { \
|
|
|
|
if (var >= (journal)->j_last) \
|
|
|
|
var -= ((journal)->j_last - (journal)->j_first); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
/**
|
2006-10-11 16:20:59 +08:00
|
|
|
* jbd2_journal_recover - recovers a on-disk journal
|
2006-10-11 16:20:57 +08:00
|
|
|
* @journal: the journal to recover
|
|
|
|
*
|
|
|
|
* The primary function for recovering the log contents when mounting a
|
|
|
|
* journaled device.
|
|
|
|
*
|
|
|
|
* Recovery is done in three passes. In the first pass, we look for the
|
|
|
|
* end of the log. In the second, we assemble the list of revoke
|
|
|
|
* blocks. In the third and final pass, we replay any un-revoked blocks
|
|
|
|
* in the log.
|
|
|
|
*/
|
2006-10-11 16:20:59 +08:00
|
|
|
int jbd2_journal_recover(journal_t *journal)
|
2006-10-11 16:20:57 +08:00
|
|
|
{
|
2008-10-11 08:29:13 +08:00
|
|
|
int err, err2;
|
2006-10-11 16:20:57 +08:00
|
|
|
journal_superblock_t * sb;
|
|
|
|
|
|
|
|
struct recovery_info info;
|
|
|
|
|
|
|
|
memset(&info, 0, sizeof(info));
|
|
|
|
sb = journal->j_superblock;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The journal superblock's s_start field (the current log head)
|
|
|
|
* is always zero if, and only if, the journal was cleanly
|
|
|
|
* unmounted.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (!sb->s_start) {
|
|
|
|
jbd_debug(1, "No recovery required, last transaction %d\n",
|
|
|
|
be32_to_cpu(sb->s_sequence));
|
|
|
|
journal->j_transaction_sequence = be32_to_cpu(sb->s_sequence) + 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
err = do_one_pass(journal, &info, PASS_SCAN);
|
|
|
|
if (!err)
|
|
|
|
err = do_one_pass(journal, &info, PASS_REVOKE);
|
|
|
|
if (!err)
|
|
|
|
err = do_one_pass(journal, &info, PASS_REPLAY);
|
|
|
|
|
2011-11-02 07:09:18 +08:00
|
|
|
jbd_debug(1, "JBD2: recovery, exit status %d, "
|
2006-10-11 16:20:57 +08:00
|
|
|
"recovered transactions %u to %u\n",
|
|
|
|
err, info.start_transaction, info.end_transaction);
|
2011-11-02 07:09:18 +08:00
|
|
|
jbd_debug(1, "JBD2: Replayed %d and revoked %d/%d blocks\n",
|
2006-10-11 16:20:57 +08:00
|
|
|
info.nr_replays, info.nr_revoke_hits, info.nr_revokes);
|
|
|
|
|
|
|
|
/* Restart the log at the next transaction ID, thus invalidating
|
|
|
|
* any existing commit records in the log. */
|
|
|
|
journal->j_transaction_sequence = ++info.end_transaction;
|
|
|
|
|
2006-10-11 16:20:59 +08:00
|
|
|
jbd2_journal_clear_revoke(journal);
|
2008-10-11 08:29:13 +08:00
|
|
|
err2 = sync_blockdev(journal->j_fs_dev);
|
|
|
|
if (!err)
|
|
|
|
err = err2;
|
2012-03-14 10:22:54 +08:00
|
|
|
/* Make sure all replayed data is on permanent storage */
|
2012-08-17 21:56:17 +08:00
|
|
|
if (journal->j_flags & JBD2_BARRIER) {
|
|
|
|
err2 = blkdev_issue_flush(journal->j_fs_dev, GFP_KERNEL, NULL);
|
|
|
|
if (!err)
|
|
|
|
err = err2;
|
|
|
|
}
|
2006-10-11 16:20:57 +08:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2006-10-11 16:20:59 +08:00
|
|
|
* jbd2_journal_skip_recovery - Start journal and wipe exiting records
|
2006-10-11 16:20:57 +08:00
|
|
|
* @journal: journal to startup
|
|
|
|
*
|
|
|
|
* Locate any valid recovery information from the journal and set up the
|
|
|
|
* journal structures in memory to ignore it (presumably because the
|
|
|
|
* caller has evidence that it is out of date).
|
|
|
|
* This function does'nt appear to be exorted..
|
|
|
|
*
|
|
|
|
* We perform one pass over the journal to allow us to tell the user how
|
|
|
|
* much recovery information is being erased, and to let us initialise
|
|
|
|
* the journal transaction sequence numbers to the next unused ID.
|
|
|
|
*/
|
2006-10-11 16:20:59 +08:00
|
|
|
int jbd2_journal_skip_recovery(journal_t *journal)
|
2006-10-11 16:20:57 +08:00
|
|
|
{
|
|
|
|
int err;
|
|
|
|
|
|
|
|
struct recovery_info info;
|
|
|
|
|
|
|
|
memset (&info, 0, sizeof(info));
|
|
|
|
|
|
|
|
err = do_one_pass(journal, &info, PASS_SCAN);
|
|
|
|
|
|
|
|
if (err) {
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR "JBD2: error %d scanning journal\n", err);
|
2006-10-11 16:20:57 +08:00
|
|
|
++journal->j_transaction_sequence;
|
|
|
|
} else {
|
2007-07-18 20:57:06 +08:00
|
|
|
#ifdef CONFIG_JBD2_DEBUG
|
2010-06-15 01:28:03 +08:00
|
|
|
int dropped = info.end_transaction -
|
|
|
|
be32_to_cpu(journal->j_superblock->s_sequence);
|
fix ext4/JBD2 build warnings
Looking at the current linus-git tree jbd_debug() define in
include/linux/jbd2.h
extern u8 journal_enable_debug;
#define jbd_debug(n, f, a...) \
do { \
if ((n) <= journal_enable_debug) { \
printk (KERN_DEBUG "(%s, %d): %s: ", \
__FILE__, __LINE__, __FUNCTION__); \
printk (f, ## a); \
} \
} while (0)
> fs/ext4/inode.c: In function âext4_write_inodeâ:
> fs/ext4/inode.c:2906: warning: comparison is always true due to limited
> range of data type
>
> fs/jbd2/recovery.c: In function âjbd2_journal_recoverâ:
> fs/jbd2/recovery.c:254: warning: comparison is always true due to
> limited range of data type
> fs/jbd2/recovery.c:257: warning: comparison is always true due to
> limited range of data type
>
> fs/jbd2/recovery.c: In function âjbd2_journal_skip_recoveryâ:
> fs/jbd2/recovery.c:301: warning: comparison is always true due to
> limited range of data type
>
Noticed all warnings are occurs when the debug level is 0. Then found
the "jbd2: Move jbd2-debug file to debugfs" patch
http://git.kernel.org/?p=linux/kernel/git/torvalds/linux-2.6.git;a=commit;h=0f49d5d019afa4e94253bfc92f0daca3badb990b
changed the jbd2_journal_enable_debug from int type to u8, makes the
jbd_debug comparision is always true when the debugging level is 0. Thus
the compile warning occurs.
Thought about changing the jbd2_journal_enable_debug data type back to
int, but can't, because the jbd2-debug is moved to debug fs, where
calling debugfs_create_u8() to create the debugfs entry needs the value
to be u8 type.
Even if we changed the data type back to int, the code is still buggy,
kernel should not print jbd2 debug message if the
jbd2_journal_enable_debug is set to 0. But this is not the case.
The fix is change the level of debugging to 1. The same should fixed in
ext3/JBD, but currently ext3 jbd-debug via /proc fs is broken, so we
probably should fix it all together.
Signed-off-by: Mingming Cao <cmm@us.ibm.com>
Cc: Jeff Garzik <jeff@garzik.org>
Cc: Theodore Tso <tytso@mit.edu>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-07-19 16:48:35 +08:00
|
|
|
jbd_debug(1,
|
2011-11-02 07:09:18 +08:00
|
|
|
"JBD2: ignoring %d transaction%s from the journal.\n",
|
2006-10-11 16:20:57 +08:00
|
|
|
dropped, (dropped == 1) ? "" : "s");
|
2010-12-19 02:36:33 +08:00
|
|
|
#endif
|
2006-10-11 16:20:57 +08:00
|
|
|
journal->j_transaction_sequence = ++info.end_transaction;
|
|
|
|
}
|
|
|
|
|
|
|
|
journal->j_tail = 0;
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2014-08-28 06:40:07 +08:00
|
|
|
static inline unsigned long long read_tag_block(journal_t *journal,
|
|
|
|
journal_block_tag_t *tag)
|
2006-10-11 16:21:08 +08:00
|
|
|
{
|
2006-10-11 16:21:13 +08:00
|
|
|
unsigned long long block = be32_to_cpu(tag->t_blocknr);
|
2014-08-28 06:40:07 +08:00
|
|
|
if (JBD2_HAS_INCOMPAT_FEATURE(journal, JBD2_FEATURE_INCOMPAT_64BIT))
|
2006-10-11 16:21:08 +08:00
|
|
|
block |= (u64)be32_to_cpu(tag->t_blocknr_high) << 32;
|
|
|
|
return block;
|
|
|
|
}
|
|
|
|
|
2008-01-29 12:58:27 +08:00
|
|
|
/*
|
|
|
|
* calc_chksums calculates the checksums for the blocks described in the
|
|
|
|
* descriptor block.
|
|
|
|
*/
|
|
|
|
static int calc_chksums(journal_t *journal, struct buffer_head *bh,
|
|
|
|
unsigned long *next_log_block, __u32 *crc32_sum)
|
|
|
|
{
|
|
|
|
int i, num_blks, err;
|
|
|
|
unsigned long io_block;
|
|
|
|
struct buffer_head *obh;
|
|
|
|
|
|
|
|
num_blks = count_tags(journal, bh);
|
|
|
|
/* Calculate checksum of the descriptor block. */
|
|
|
|
*crc32_sum = crc32_be(*crc32_sum, (void *)bh->b_data, bh->b_size);
|
|
|
|
|
|
|
|
for (i = 0; i < num_blks; i++) {
|
|
|
|
io_block = (*next_log_block)++;
|
|
|
|
wrap(journal, *next_log_block);
|
|
|
|
err = jread(&obh, journal, io_block);
|
|
|
|
if (err) {
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR "JBD2: IO error %d recovering block "
|
2008-01-29 12:58:27 +08:00
|
|
|
"%lu in log\n", err, io_block);
|
|
|
|
return 1;
|
|
|
|
} else {
|
|
|
|
*crc32_sum = crc32_be(*crc32_sum, (void *)obh->b_data,
|
|
|
|
obh->b_size);
|
|
|
|
}
|
2008-05-26 22:28:09 +08:00
|
|
|
put_bh(obh);
|
2008-01-29 12:58:27 +08:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-27 20:10:25 +08:00
|
|
|
static int jbd2_commit_block_csum_verify(journal_t *j, void *buf)
|
|
|
|
{
|
|
|
|
struct commit_header *h;
|
2013-08-29 02:59:58 +08:00
|
|
|
__be32 provided;
|
|
|
|
__u32 calculated;
|
2012-05-27 20:10:25 +08:00
|
|
|
|
2014-08-28 06:40:07 +08:00
|
|
|
if (!jbd2_journal_has_csum_v2or3(j))
|
2012-05-27 20:10:25 +08:00
|
|
|
return 1;
|
|
|
|
|
|
|
|
h = buf;
|
|
|
|
provided = h->h_chksum[0];
|
|
|
|
h->h_chksum[0] = 0;
|
|
|
|
calculated = jbd2_chksum(j, j->j_csum_seed, buf, j->j_blocksize);
|
|
|
|
h->h_chksum[0] = provided;
|
|
|
|
|
2013-08-29 02:59:58 +08:00
|
|
|
return provided == cpu_to_be32(calculated);
|
2012-05-27 20:10:25 +08:00
|
|
|
}
|
|
|
|
|
2012-05-27 20:12:12 +08:00
|
|
|
static int jbd2_block_tag_csum_verify(journal_t *j, journal_block_tag_t *tag,
|
|
|
|
void *buf, __u32 sequence)
|
|
|
|
{
|
2014-08-28 06:40:07 +08:00
|
|
|
journal_block_tag3_t *tag3 = (journal_block_tag3_t *)tag;
|
2013-05-28 19:31:59 +08:00
|
|
|
__u32 csum32;
|
2013-08-29 02:59:58 +08:00
|
|
|
__be32 seq;
|
2012-05-27 20:12:12 +08:00
|
|
|
|
2014-08-28 06:40:07 +08:00
|
|
|
if (!jbd2_journal_has_csum_v2or3(j))
|
2012-05-27 20:12:12 +08:00
|
|
|
return 1;
|
|
|
|
|
2013-08-29 02:59:58 +08:00
|
|
|
seq = cpu_to_be32(sequence);
|
|
|
|
csum32 = jbd2_chksum(j, j->j_csum_seed, (__u8 *)&seq, sizeof(seq));
|
2013-05-28 19:31:59 +08:00
|
|
|
csum32 = jbd2_chksum(j, csum32, buf, j->j_blocksize);
|
2012-05-27 20:12:12 +08:00
|
|
|
|
2014-08-28 06:40:07 +08:00
|
|
|
if (JBD2_HAS_INCOMPAT_FEATURE(j, JBD2_FEATURE_INCOMPAT_CSUM_V3))
|
|
|
|
return tag3->t_checksum == cpu_to_be32(csum32);
|
|
|
|
else
|
|
|
|
return tag->t_checksum == cpu_to_be16(csum32);
|
2012-05-27 20:12:12 +08:00
|
|
|
}
|
|
|
|
|
2006-10-11 16:20:57 +08:00
|
|
|
static int do_one_pass(journal_t *journal,
|
|
|
|
struct recovery_info *info, enum passtype pass)
|
|
|
|
{
|
|
|
|
unsigned int first_commit_ID, next_commit_ID;
|
|
|
|
unsigned long next_log_block;
|
|
|
|
int err, success = 0;
|
|
|
|
journal_superblock_t * sb;
|
|
|
|
journal_header_t * tmp;
|
|
|
|
struct buffer_head * bh;
|
|
|
|
unsigned int sequence;
|
|
|
|
int blocktype;
|
2006-10-11 16:21:08 +08:00
|
|
|
int tag_bytes = journal_tag_bytes(journal);
|
2008-01-29 12:58:27 +08:00
|
|
|
__u32 crc32_sum = ~0; /* Transactional Checksums */
|
2012-05-27 20:10:22 +08:00
|
|
|
int descr_csum_size = 0;
|
2014-08-28 06:40:05 +08:00
|
|
|
int block_error = 0;
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* First thing is to establish what we expect to find in the log
|
|
|
|
* (in terms of transaction IDs), and where (in terms of log
|
|
|
|
* block offsets): query the superblock.
|
|
|
|
*/
|
|
|
|
|
|
|
|
sb = journal->j_superblock;
|
|
|
|
next_commit_ID = be32_to_cpu(sb->s_sequence);
|
|
|
|
next_log_block = be32_to_cpu(sb->s_start);
|
|
|
|
|
|
|
|
first_commit_ID = next_commit_ID;
|
|
|
|
if (pass == PASS_SCAN)
|
|
|
|
info->start_transaction = first_commit_ID;
|
|
|
|
|
|
|
|
jbd_debug(1, "Starting recovery pass %d\n", pass);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now we walk through the log, transaction by transaction,
|
|
|
|
* making sure that each transaction has a commit block in the
|
|
|
|
* expected place. Each complete transaction gets replayed back
|
|
|
|
* into the main filesystem.
|
|
|
|
*/
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
int flags;
|
|
|
|
char * tagp;
|
|
|
|
journal_block_tag_t * tag;
|
|
|
|
struct buffer_head * obh;
|
|
|
|
struct buffer_head * nbh;
|
|
|
|
|
2008-02-06 17:40:11 +08:00
|
|
|
cond_resched();
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
/* If we already know where to stop the log traversal,
|
|
|
|
* check right now that we haven't gone past the end of
|
|
|
|
* the log. */
|
|
|
|
|
|
|
|
if (pass != PASS_SCAN)
|
|
|
|
if (tid_geq(next_commit_ID, info->end_transaction))
|
|
|
|
break;
|
|
|
|
|
|
|
|
jbd_debug(2, "Scanning for sequence ID %u at %lu/%lu\n",
|
|
|
|
next_commit_ID, next_log_block, journal->j_last);
|
|
|
|
|
|
|
|
/* Skip over each chunk of the transaction looking
|
|
|
|
* either the next descriptor block or the final commit
|
|
|
|
* record. */
|
|
|
|
|
2011-11-02 07:09:18 +08:00
|
|
|
jbd_debug(3, "JBD2: checking block %ld\n", next_log_block);
|
2006-10-11 16:20:57 +08:00
|
|
|
err = jread(&bh, journal, next_log_block);
|
|
|
|
if (err)
|
|
|
|
goto failed;
|
|
|
|
|
|
|
|
next_log_block++;
|
|
|
|
wrap(journal, next_log_block);
|
|
|
|
|
|
|
|
/* What kind of buffer is it?
|
|
|
|
*
|
|
|
|
* If it is a descriptor block, check that it has the
|
|
|
|
* expected sequence number. Otherwise, we're all done
|
|
|
|
* here. */
|
|
|
|
|
|
|
|
tmp = (journal_header_t *)bh->b_data;
|
|
|
|
|
2006-10-11 16:20:59 +08:00
|
|
|
if (tmp->h_magic != cpu_to_be32(JBD2_MAGIC_NUMBER)) {
|
2006-10-11 16:20:57 +08:00
|
|
|
brelse(bh);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
blocktype = be32_to_cpu(tmp->h_blocktype);
|
|
|
|
sequence = be32_to_cpu(tmp->h_sequence);
|
|
|
|
jbd_debug(3, "Found magic %d, sequence %d\n",
|
|
|
|
blocktype, sequence);
|
|
|
|
|
|
|
|
if (sequence != next_commit_ID) {
|
|
|
|
brelse(bh);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* OK, we have a valid descriptor block which matches
|
|
|
|
* all of the sequence number checks. What are we going
|
|
|
|
* to do with it? That depends on the pass... */
|
|
|
|
|
|
|
|
switch(blocktype) {
|
2006-10-11 16:20:59 +08:00
|
|
|
case JBD2_DESCRIPTOR_BLOCK:
|
2012-05-27 20:10:22 +08:00
|
|
|
/* Verify checksum first */
|
2014-08-28 06:40:07 +08:00
|
|
|
if (jbd2_journal_has_csum_v2or3(journal))
|
2012-05-27 20:10:22 +08:00
|
|
|
descr_csum_size =
|
|
|
|
sizeof(struct jbd2_journal_block_tail);
|
|
|
|
if (descr_csum_size > 0 &&
|
|
|
|
!jbd2_descr_block_csum_verify(journal,
|
|
|
|
bh->b_data)) {
|
|
|
|
err = -EIO;
|
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
|
2006-10-11 16:20:57 +08:00
|
|
|
/* If it is a valid descriptor block, replay it
|
2008-01-29 12:58:27 +08:00
|
|
|
* in pass REPLAY; if journal_checksums enabled, then
|
|
|
|
* calculate checksums in PASS_SCAN, otherwise,
|
|
|
|
* just skip over the blocks it describes. */
|
2006-10-11 16:20:57 +08:00
|
|
|
if (pass != PASS_REPLAY) {
|
2008-01-29 12:58:27 +08:00
|
|
|
if (pass == PASS_SCAN &&
|
|
|
|
JBD2_HAS_COMPAT_FEATURE(journal,
|
|
|
|
JBD2_FEATURE_COMPAT_CHECKSUM) &&
|
|
|
|
!info->end_transaction) {
|
|
|
|
if (calc_chksums(journal, bh,
|
|
|
|
&next_log_block,
|
|
|
|
&crc32_sum)) {
|
|
|
|
put_bh(bh);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
put_bh(bh);
|
|
|
|
continue;
|
|
|
|
}
|
2006-10-11 16:21:08 +08:00
|
|
|
next_log_block += count_tags(journal, bh);
|
2006-10-11 16:20:57 +08:00
|
|
|
wrap(journal, next_log_block);
|
2008-01-29 12:58:27 +08:00
|
|
|
put_bh(bh);
|
2006-10-11 16:20:57 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* A descriptor block: we can now write all of
|
|
|
|
* the data blocks. Yay, useful work is finally
|
|
|
|
* getting done here! */
|
|
|
|
|
|
|
|
tagp = &bh->b_data[sizeof(journal_header_t)];
|
2006-10-11 16:21:08 +08:00
|
|
|
while ((tagp - bh->b_data + tag_bytes)
|
2012-05-27 20:10:22 +08:00
|
|
|
<= journal->j_blocksize - descr_csum_size) {
|
2006-10-11 16:20:57 +08:00
|
|
|
unsigned long io_block;
|
|
|
|
|
|
|
|
tag = (journal_block_tag_t *) tagp;
|
2012-05-23 10:43:41 +08:00
|
|
|
flags = be16_to_cpu(tag->t_flags);
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
io_block = next_log_block++;
|
|
|
|
wrap(journal, next_log_block);
|
|
|
|
err = jread(&obh, journal, io_block);
|
|
|
|
if (err) {
|
|
|
|
/* Recover what we can, but
|
|
|
|
* report failure at the end. */
|
|
|
|
success = err;
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR
|
|
|
|
"JBD2: IO error %d recovering "
|
2006-10-11 16:20:57 +08:00
|
|
|
"block %ld in log\n",
|
|
|
|
err, io_block);
|
|
|
|
} else {
|
2006-10-11 16:21:13 +08:00
|
|
|
unsigned long long blocknr;
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
J_ASSERT(obh != NULL);
|
2014-08-28 06:40:07 +08:00
|
|
|
blocknr = read_tag_block(journal,
|
2006-10-11 16:21:08 +08:00
|
|
|
tag);
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
/* If the block has been
|
|
|
|
* revoked, then we're all done
|
|
|
|
* here. */
|
2006-10-11 16:20:59 +08:00
|
|
|
if (jbd2_journal_test_revoke
|
2006-10-11 16:20:57 +08:00
|
|
|
(journal, blocknr,
|
|
|
|
next_commit_ID)) {
|
|
|
|
brelse(obh);
|
|
|
|
++info->nr_revoke_hits;
|
|
|
|
goto skip_write;
|
|
|
|
}
|
|
|
|
|
2012-05-27 20:12:12 +08:00
|
|
|
/* Look for block corruption */
|
|
|
|
if (!jbd2_block_tag_csum_verify(
|
|
|
|
journal, tag, obh->b_data,
|
|
|
|
be32_to_cpu(tmp->h_sequence))) {
|
|
|
|
brelse(obh);
|
|
|
|
success = -EIO;
|
2013-12-09 10:14:59 +08:00
|
|
|
printk(KERN_ERR "JBD2: Invalid "
|
2012-05-27 20:12:12 +08:00
|
|
|
"checksum recovering "
|
|
|
|
"block %llu in log\n",
|
|
|
|
blocknr);
|
2014-08-28 06:40:05 +08:00
|
|
|
block_error = 1;
|
|
|
|
goto skip_write;
|
2012-05-27 20:12:12 +08:00
|
|
|
}
|
|
|
|
|
2006-10-11 16:20:57 +08:00
|
|
|
/* Find a buffer for the new
|
|
|
|
* data being restored */
|
|
|
|
nbh = __getblk(journal->j_fs_dev,
|
|
|
|
blocknr,
|
|
|
|
journal->j_blocksize);
|
|
|
|
if (nbh == NULL) {
|
|
|
|
printk(KERN_ERR
|
2011-11-02 07:09:18 +08:00
|
|
|
"JBD2: Out of memory "
|
2006-10-11 16:20:57 +08:00
|
|
|
"during recovery.\n");
|
|
|
|
err = -ENOMEM;
|
|
|
|
brelse(bh);
|
|
|
|
brelse(obh);
|
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
|
|
|
|
lock_buffer(nbh);
|
|
|
|
memcpy(nbh->b_data, obh->b_data,
|
|
|
|
journal->j_blocksize);
|
2006-10-11 16:20:59 +08:00
|
|
|
if (flags & JBD2_FLAG_ESCAPE) {
|
2008-03-20 08:00:54 +08:00
|
|
|
*((__be32 *)nbh->b_data) =
|
2006-10-11 16:20:59 +08:00
|
|
|
cpu_to_be32(JBD2_MAGIC_NUMBER);
|
2006-10-11 16:20:57 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
BUFFER_TRACE(nbh, "marking dirty");
|
|
|
|
set_buffer_uptodate(nbh);
|
|
|
|
mark_buffer_dirty(nbh);
|
|
|
|
BUFFER_TRACE(nbh, "marking uptodate");
|
|
|
|
++info->nr_replays;
|
|
|
|
/* ll_rw_block(WRITE, 1, &nbh); */
|
|
|
|
unlock_buffer(nbh);
|
|
|
|
brelse(obh);
|
|
|
|
brelse(nbh);
|
|
|
|
}
|
|
|
|
|
|
|
|
skip_write:
|
2006-10-11 16:21:08 +08:00
|
|
|
tagp += tag_bytes;
|
2006-10-11 16:20:59 +08:00
|
|
|
if (!(flags & JBD2_FLAG_SAME_UUID))
|
2006-10-11 16:20:57 +08:00
|
|
|
tagp += 16;
|
|
|
|
|
2006-10-11 16:20:59 +08:00
|
|
|
if (flags & JBD2_FLAG_LAST_TAG)
|
2006-10-11 16:20:57 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
brelse(bh);
|
|
|
|
continue;
|
|
|
|
|
2006-10-11 16:20:59 +08:00
|
|
|
case JBD2_COMMIT_BLOCK:
|
2008-01-29 12:58:27 +08:00
|
|
|
/* How to differentiate between interrupted commit
|
|
|
|
* and journal corruption ?
|
|
|
|
*
|
|
|
|
* {nth transaction}
|
|
|
|
* Checksum Verification Failed
|
|
|
|
* |
|
|
|
|
* ____________________
|
|
|
|
* | |
|
|
|
|
* async_commit sync_commit
|
|
|
|
* | |
|
|
|
|
* | GO TO NEXT "Journal Corruption"
|
|
|
|
* | TRANSACTION
|
|
|
|
* |
|
|
|
|
* {(n+1)th transanction}
|
|
|
|
* |
|
|
|
|
* _______|______________
|
|
|
|
* | |
|
|
|
|
* Commit block found Commit block not found
|
|
|
|
* | |
|
|
|
|
* "Journal Corruption" |
|
|
|
|
* _____________|_________
|
|
|
|
* | |
|
|
|
|
* nth trans corrupt OR nth trans
|
|
|
|
* and (n+1)th interrupted interrupted
|
|
|
|
* before commit block
|
|
|
|
* could reach the disk.
|
|
|
|
* (Cannot find the difference in above
|
|
|
|
* mentioned conditions. Hence assume
|
|
|
|
* "Interrupted Commit".)
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Found an expected commit block: if checksums
|
|
|
|
* are present verify them in PASS_SCAN; else not
|
|
|
|
* much to do other than move on to the next sequence
|
2006-10-11 16:20:57 +08:00
|
|
|
* number. */
|
2008-01-29 12:58:27 +08:00
|
|
|
if (pass == PASS_SCAN &&
|
|
|
|
JBD2_HAS_COMPAT_FEATURE(journal,
|
|
|
|
JBD2_FEATURE_COMPAT_CHECKSUM)) {
|
|
|
|
int chksum_err, chksum_seen;
|
|
|
|
struct commit_header *cbh =
|
|
|
|
(struct commit_header *)bh->b_data;
|
|
|
|
unsigned found_chksum =
|
|
|
|
be32_to_cpu(cbh->h_chksum[0]);
|
|
|
|
|
|
|
|
chksum_err = chksum_seen = 0;
|
|
|
|
|
|
|
|
if (info->end_transaction) {
|
2008-06-07 05:50:40 +08:00
|
|
|
journal->j_failed_commit =
|
|
|
|
info->end_transaction;
|
2008-01-29 12:58:27 +08:00
|
|
|
brelse(bh);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (crc32_sum == found_chksum &&
|
|
|
|
cbh->h_chksum_type == JBD2_CRC32_CHKSUM &&
|
|
|
|
cbh->h_chksum_size ==
|
|
|
|
JBD2_CRC32_CHKSUM_SIZE)
|
|
|
|
chksum_seen = 1;
|
|
|
|
else if (!(cbh->h_chksum_type == 0 &&
|
|
|
|
cbh->h_chksum_size == 0 &&
|
|
|
|
found_chksum == 0 &&
|
|
|
|
!chksum_seen))
|
|
|
|
/*
|
|
|
|
* If fs is mounted using an old kernel and then
|
|
|
|
* kernel with journal_chksum is used then we
|
|
|
|
* get a situation where the journal flag has
|
|
|
|
* checksum flag set but checksums are not
|
|
|
|
* present i.e chksum = 0, in the individual
|
|
|
|
* commit blocks.
|
|
|
|
* Hence to avoid checksum failures, in this
|
|
|
|
* situation, this extra check is added.
|
|
|
|
*/
|
|
|
|
chksum_err = 1;
|
|
|
|
|
|
|
|
if (chksum_err) {
|
|
|
|
info->end_transaction = next_commit_ID;
|
|
|
|
|
2008-02-05 23:56:15 +08:00
|
|
|
if (!JBD2_HAS_INCOMPAT_FEATURE(journal,
|
2008-01-29 12:58:27 +08:00
|
|
|
JBD2_FEATURE_INCOMPAT_ASYNC_COMMIT)){
|
2008-06-07 05:50:40 +08:00
|
|
|
journal->j_failed_commit =
|
|
|
|
next_commit_ID;
|
2008-01-29 12:58:27 +08:00
|
|
|
brelse(bh);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
crc32_sum = ~0;
|
|
|
|
}
|
2012-05-27 20:10:25 +08:00
|
|
|
if (pass == PASS_SCAN &&
|
|
|
|
!jbd2_commit_block_csum_verify(journal,
|
|
|
|
bh->b_data)) {
|
|
|
|
info->end_transaction = next_commit_ID;
|
|
|
|
|
|
|
|
if (!JBD2_HAS_INCOMPAT_FEATURE(journal,
|
|
|
|
JBD2_FEATURE_INCOMPAT_ASYNC_COMMIT)) {
|
|
|
|
journal->j_failed_commit =
|
|
|
|
next_commit_ID;
|
|
|
|
brelse(bh);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-10-11 16:20:57 +08:00
|
|
|
brelse(bh);
|
|
|
|
next_commit_ID++;
|
|
|
|
continue;
|
|
|
|
|
2006-10-11 16:20:59 +08:00
|
|
|
case JBD2_REVOKE_BLOCK:
|
2006-10-11 16:20:57 +08:00
|
|
|
/* If we aren't in the REVOKE pass, then we can
|
|
|
|
* just skip over this block. */
|
|
|
|
if (pass != PASS_REVOKE) {
|
|
|
|
brelse(bh);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
err = scan_revoke_records(journal, bh,
|
|
|
|
next_commit_ID, info);
|
|
|
|
brelse(bh);
|
|
|
|
if (err)
|
|
|
|
goto failed;
|
|
|
|
continue;
|
|
|
|
|
|
|
|
default:
|
|
|
|
jbd_debug(3, "Unrecognised magic %d, end of scan.\n",
|
|
|
|
blocktype);
|
|
|
|
brelse(bh);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
/*
|
|
|
|
* We broke out of the log scan loop: either we came to the
|
|
|
|
* known end of the log or we found an unexpected block in the
|
|
|
|
* log. If the latter happened, then we know that the "current"
|
|
|
|
* transaction marks the end of the valid log.
|
|
|
|
*/
|
|
|
|
|
2008-01-29 12:58:27 +08:00
|
|
|
if (pass == PASS_SCAN) {
|
|
|
|
if (!info->end_transaction)
|
|
|
|
info->end_transaction = next_commit_ID;
|
|
|
|
} else {
|
2006-10-11 16:20:57 +08:00
|
|
|
/* It's really bad news if different passes end up at
|
|
|
|
* different places (but possible due to IO errors). */
|
|
|
|
if (info->end_transaction != next_commit_ID) {
|
2011-11-02 07:09:18 +08:00
|
|
|
printk(KERN_ERR "JBD2: recovery pass %d ended at "
|
2006-10-11 16:20:57 +08:00
|
|
|
"transaction %u, expected %u\n",
|
|
|
|
pass, next_commit_ID, info->end_transaction);
|
|
|
|
if (!success)
|
|
|
|
success = -EIO;
|
|
|
|
}
|
|
|
|
}
|
2014-08-28 06:40:05 +08:00
|
|
|
if (block_error && success == 0)
|
|
|
|
success = -EIO;
|
2006-10-11 16:20:57 +08:00
|
|
|
return success;
|
|
|
|
|
|
|
|
failed:
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2012-05-27 20:08:24 +08:00
|
|
|
static int jbd2_revoke_block_csum_verify(journal_t *j,
|
|
|
|
void *buf)
|
|
|
|
{
|
|
|
|
struct jbd2_journal_revoke_tail *tail;
|
2013-08-29 02:59:58 +08:00
|
|
|
__be32 provided;
|
|
|
|
__u32 calculated;
|
2012-05-27 20:08:24 +08:00
|
|
|
|
2014-08-28 06:40:07 +08:00
|
|
|
if (!jbd2_journal_has_csum_v2or3(j))
|
2012-05-27 20:08:24 +08:00
|
|
|
return 1;
|
|
|
|
|
|
|
|
tail = (struct jbd2_journal_revoke_tail *)(buf + j->j_blocksize -
|
|
|
|
sizeof(struct jbd2_journal_revoke_tail));
|
|
|
|
provided = tail->r_checksum;
|
|
|
|
tail->r_checksum = 0;
|
|
|
|
calculated = jbd2_chksum(j, j->j_csum_seed, buf, j->j_blocksize);
|
|
|
|
tail->r_checksum = provided;
|
|
|
|
|
2013-08-29 02:59:58 +08:00
|
|
|
return provided == cpu_to_be32(calculated);
|
2012-05-27 20:08:24 +08:00
|
|
|
}
|
2006-10-11 16:20:57 +08:00
|
|
|
|
|
|
|
/* Scan a revoke record, marking all blocks mentioned as revoked. */
|
|
|
|
|
|
|
|
static int scan_revoke_records(journal_t *journal, struct buffer_head *bh,
|
|
|
|
tid_t sequence, struct recovery_info *info)
|
|
|
|
{
|
2006-10-11 16:20:59 +08:00
|
|
|
jbd2_journal_revoke_header_t *header;
|
2006-10-11 16:20:57 +08:00
|
|
|
int offset, max;
|
2006-10-11 16:21:08 +08:00
|
|
|
int record_len = 4;
|
2006-10-11 16:20:57 +08:00
|
|
|
|
2006-10-11 16:20:59 +08:00
|
|
|
header = (jbd2_journal_revoke_header_t *) bh->b_data;
|
|
|
|
offset = sizeof(jbd2_journal_revoke_header_t);
|
2006-10-11 16:20:57 +08:00
|
|
|
max = be32_to_cpu(header->r_count);
|
|
|
|
|
2012-05-27 20:08:24 +08:00
|
|
|
if (!jbd2_revoke_block_csum_verify(journal, header))
|
|
|
|
return -EINVAL;
|
|
|
|
|
2006-10-11 16:21:08 +08:00
|
|
|
if (JBD2_HAS_INCOMPAT_FEATURE(journal, JBD2_FEATURE_INCOMPAT_64BIT))
|
|
|
|
record_len = 8;
|
|
|
|
|
|
|
|
while (offset + record_len <= max) {
|
2006-10-11 16:21:13 +08:00
|
|
|
unsigned long long blocknr;
|
2006-10-11 16:20:57 +08:00
|
|
|
int err;
|
|
|
|
|
2006-10-11 16:21:08 +08:00
|
|
|
if (record_len == 4)
|
|
|
|
blocknr = be32_to_cpu(* ((__be32 *) (bh->b_data+offset)));
|
|
|
|
else
|
|
|
|
blocknr = be64_to_cpu(* ((__be64 *) (bh->b_data+offset)));
|
|
|
|
offset += record_len;
|
2006-10-11 16:20:59 +08:00
|
|
|
err = jbd2_journal_set_revoke(journal, blocknr, sequence);
|
2006-10-11 16:20:57 +08:00
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
++info->nr_revokes;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|