2022-05-13 20:16:34 +08:00
|
|
|
/*
|
|
|
|
* e2fsck.c - superblock checks
|
|
|
|
*
|
|
|
|
* Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o.
|
|
|
|
*
|
|
|
|
* %Begin-Header%
|
|
|
|
* This file may be redistributed under the terms of the GNU Public
|
|
|
|
* License.
|
|
|
|
* %End-Header%
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
#ifdef HAVE_ERRNO_H
|
|
|
|
#include <errno.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef EXT2_SKIP_UUID
|
|
|
|
#include "uuid/uuid.h"
|
|
|
|
#endif
|
|
|
|
#include "e2fsck.h"
|
|
|
|
#include "problem.h"
|
|
|
|
|
|
|
|
#define MIN_CHECK 1
|
|
|
|
#define MAX_CHECK 2
|
|
|
|
#define LOG2_CHECK 4
|
|
|
|
|
|
|
|
static int check_super_value(e2fsck_t ctx, const char *descr,
|
|
|
|
unsigned long value, int flags,
|
|
|
|
unsigned long min_val, unsigned long max_val)
|
|
|
|
{
|
|
|
|
struct problem_context pctx;
|
|
|
|
|
|
|
|
if ((flags & MIN_CHECK && value < min_val) ||
|
|
|
|
(flags & MAX_CHECK && value > max_val) ||
|
|
|
|
(flags & LOG2_CHECK && (value & (value - 1)) != 0)) {
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.num = value;
|
|
|
|
pctx.str = descr;
|
|
|
|
fix_problem(ctx, PR_0_MISC_CORRUPT_SUPER, &pctx);
|
|
|
|
ctx->flags |= E2F_FLAG_ABORT;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int check_super_value64(e2fsck_t ctx, const char *descr,
|
|
|
|
__u64 value, int flags,
|
|
|
|
__u64 min_val, __u64 max_val)
|
|
|
|
{
|
|
|
|
struct problem_context pctx;
|
|
|
|
|
|
|
|
if ((flags & MIN_CHECK && value < min_val) ||
|
|
|
|
(flags & MAX_CHECK && value > max_val) ||
|
|
|
|
(flags & LOG2_CHECK && (value & (value - 1)) != 0)) {
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.num = value;
|
|
|
|
pctx.str = descr;
|
|
|
|
fix_problem(ctx, PR_0_MISC_CORRUPT_SUPER, &pctx);
|
|
|
|
ctx->flags |= E2F_FLAG_ABORT;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* helper function to release an inode
|
|
|
|
*/
|
|
|
|
struct process_block_struct {
|
|
|
|
e2fsck_t ctx;
|
|
|
|
char *buf;
|
|
|
|
struct problem_context *pctx;
|
|
|
|
int truncating;
|
|
|
|
int truncate_offset;
|
|
|
|
e2_blkcnt_t truncate_block;
|
|
|
|
int truncated_blocks;
|
|
|
|
int abort;
|
|
|
|
errcode_t errcode;
|
|
|
|
blk64_t last_cluster;
|
|
|
|
struct ext2_inode_large *inode;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int release_inode_block(ext2_filsys fs,
|
|
|
|
blk64_t *block_nr,
|
|
|
|
e2_blkcnt_t blockcnt,
|
|
|
|
blk64_t ref_blk EXT2FS_ATTR((unused)),
|
|
|
|
int ref_offset EXT2FS_ATTR((unused)),
|
|
|
|
void *priv_data)
|
|
|
|
{
|
|
|
|
struct process_block_struct *pb;
|
|
|
|
e2fsck_t ctx;
|
|
|
|
struct problem_context *pctx;
|
|
|
|
blk64_t blk = *block_nr;
|
|
|
|
blk64_t cluster = EXT2FS_B2C(fs, *block_nr);
|
|
|
|
int retval = 0;
|
|
|
|
|
|
|
|
pb = (struct process_block_struct *) priv_data;
|
|
|
|
ctx = pb->ctx;
|
|
|
|
pctx = pb->pctx;
|
|
|
|
|
|
|
|
pctx->blk = blk;
|
|
|
|
pctx->blkcount = blockcnt;
|
|
|
|
|
|
|
|
if (blk == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (pb->last_cluster == cluster)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
pb->last_cluster = cluster;
|
|
|
|
|
|
|
|
if ((blk < fs->super->s_first_data_block) ||
|
|
|
|
(blk >= ext2fs_blocks_count(fs->super))) {
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_ILLEGAL_BLOCK_NUM, pctx);
|
|
|
|
return_abort:
|
|
|
|
pb->abort = 1;
|
|
|
|
return BLOCK_ABORT;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!ext2fs_test_block_bitmap2(fs->block_map, blk)) {
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_ALREADY_CLEARED_BLOCK, pctx);
|
|
|
|
goto return_abort;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we are deleting an orphan, then we leave the fields alone.
|
|
|
|
* If we are truncating an orphan, then update the inode fields
|
|
|
|
* and clean up any partial block data.
|
|
|
|
*/
|
|
|
|
if (pb->truncating) {
|
|
|
|
/*
|
|
|
|
* We only remove indirect blocks if they are
|
|
|
|
* completely empty.
|
|
|
|
*/
|
|
|
|
if (blockcnt < 0) {
|
|
|
|
int i, limit;
|
|
|
|
blk_t *bp;
|
|
|
|
|
|
|
|
pb->errcode = io_channel_read_blk64(fs->io, blk, 1,
|
|
|
|
pb->buf);
|
|
|
|
if (pb->errcode)
|
|
|
|
goto return_abort;
|
|
|
|
|
|
|
|
limit = fs->blocksize >> 2;
|
|
|
|
for (i = 0, bp = (blk_t *) pb->buf;
|
|
|
|
i < limit; i++, bp++)
|
|
|
|
if (*bp)
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* We don't remove direct blocks until we've reached
|
|
|
|
* the truncation block.
|
|
|
|
*/
|
|
|
|
if (blockcnt >= 0 && blockcnt < pb->truncate_block)
|
|
|
|
return 0;
|
|
|
|
/*
|
|
|
|
* If part of the last block needs truncating, we do
|
|
|
|
* it here.
|
|
|
|
*/
|
|
|
|
if ((blockcnt == pb->truncate_block) && pb->truncate_offset) {
|
|
|
|
pb->errcode = io_channel_read_blk64(fs->io, blk, 1,
|
|
|
|
pb->buf);
|
|
|
|
if (pb->errcode)
|
|
|
|
goto return_abort;
|
|
|
|
memset(pb->buf + pb->truncate_offset, 0,
|
|
|
|
fs->blocksize - pb->truncate_offset);
|
|
|
|
pb->errcode = io_channel_write_blk64(fs->io, blk, 1,
|
|
|
|
pb->buf);
|
|
|
|
if (pb->errcode)
|
|
|
|
goto return_abort;
|
|
|
|
}
|
|
|
|
pb->truncated_blocks++;
|
|
|
|
*block_nr = 0;
|
|
|
|
retval |= BLOCK_CHANGED;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ctx->qctx)
|
|
|
|
quota_data_sub(ctx->qctx, pb->inode, 0, ctx->fs->blocksize);
|
|
|
|
ext2fs_block_alloc_stats2(fs, blk, -1);
|
|
|
|
ctx->free_blocks++;
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function releases an inode. Returns 1 if an inconsistency was
|
|
|
|
* found. If the inode has a link count, then it is being truncated and
|
|
|
|
* not deleted.
|
|
|
|
*/
|
|
|
|
static int release_inode_blocks(e2fsck_t ctx, ext2_ino_t ino,
|
|
|
|
struct ext2_inode_large *inode, char *block_buf,
|
|
|
|
struct problem_context *pctx)
|
|
|
|
{
|
|
|
|
struct process_block_struct pb;
|
|
|
|
ext2_filsys fs = ctx->fs;
|
|
|
|
blk64_t blk;
|
|
|
|
errcode_t retval;
|
|
|
|
__u32 count;
|
|
|
|
|
|
|
|
if (!ext2fs_inode_has_valid_blocks2(fs, EXT2_INODE(inode)))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
pb.buf = block_buf + 3 * ctx->fs->blocksize;
|
|
|
|
pb.ctx = ctx;
|
|
|
|
pb.abort = 0;
|
|
|
|
pb.errcode = 0;
|
|
|
|
pb.pctx = pctx;
|
|
|
|
pb.last_cluster = 0;
|
|
|
|
pb.inode = inode;
|
|
|
|
if (inode->i_links_count) {
|
|
|
|
pb.truncating = 1;
|
|
|
|
pb.truncate_block = (e2_blkcnt_t)
|
|
|
|
((EXT2_I_SIZE(inode) + fs->blocksize - 1) /
|
|
|
|
fs->blocksize);
|
|
|
|
pb.truncate_offset = inode->i_size % fs->blocksize;
|
|
|
|
} else {
|
|
|
|
pb.truncating = 0;
|
|
|
|
pb.truncate_block = 0;
|
|
|
|
pb.truncate_offset = 0;
|
|
|
|
}
|
|
|
|
pb.truncated_blocks = 0;
|
|
|
|
retval = ext2fs_block_iterate3(fs, ino, BLOCK_FLAG_DEPTH_TRAVERSE,
|
|
|
|
block_buf, release_inode_block, &pb);
|
|
|
|
if (retval) {
|
|
|
|
com_err("release_inode_blocks", retval,
|
|
|
|
_("while calling ext2fs_block_iterate for inode %u"),
|
|
|
|
ino);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (pb.abort)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/* Refresh the inode since ext2fs_block_iterate may have changed it */
|
|
|
|
e2fsck_read_inode_full(ctx, ino, EXT2_INODE(inode), sizeof(*inode),
|
|
|
|
"release_inode_blocks");
|
|
|
|
|
|
|
|
if (pb.truncated_blocks)
|
|
|
|
ext2fs_iblk_sub_blocks(fs, EXT2_INODE(inode),
|
|
|
|
pb.truncated_blocks);
|
|
|
|
|
|
|
|
blk = ext2fs_file_acl_block(fs, EXT2_INODE(inode));
|
|
|
|
if (blk) {
|
|
|
|
retval = ext2fs_adjust_ea_refcount3(fs, blk, block_buf, -1,
|
|
|
|
&count, ino);
|
|
|
|
if (retval == EXT2_ET_BAD_EA_BLOCK_NUM) {
|
|
|
|
retval = 0;
|
|
|
|
count = 1;
|
|
|
|
}
|
|
|
|
if (retval) {
|
|
|
|
com_err("release_inode_blocks", retval,
|
|
|
|
_("while calling ext2fs_adjust_ea_refcount2 for inode %u"),
|
|
|
|
ino);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (count == 0) {
|
|
|
|
if (ctx->qctx)
|
|
|
|
quota_data_sub(ctx->qctx, inode, 0,
|
|
|
|
ctx->fs->blocksize);
|
|
|
|
ext2fs_block_alloc_stats2(fs, blk, -1);
|
|
|
|
ctx->free_blocks++;
|
|
|
|
}
|
|
|
|
ext2fs_file_acl_block_set(fs, EXT2_INODE(inode), 0);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Load all quota data in preparation for orphan clearing. */
|
|
|
|
static errcode_t e2fsck_read_all_quotas(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
ext2_ino_t qf_ino;
|
|
|
|
enum quota_type qtype;
|
|
|
|
errcode_t retval = 0;
|
|
|
|
|
|
|
|
if (!ext2fs_has_feature_quota(ctx->fs->super))
|
|
|
|
return retval;
|
|
|
|
|
|
|
|
retval = quota_init_context(&ctx->qctx, ctx->fs, 0);
|
|
|
|
if (retval)
|
|
|
|
return retval;
|
|
|
|
|
|
|
|
for (qtype = 0 ; qtype < MAXQUOTAS; qtype++) {
|
|
|
|
qf_ino = *quota_sb_inump(ctx->fs->super, qtype);
|
|
|
|
if (qf_ino == 0)
|
|
|
|
continue;
|
|
|
|
|
2024-03-26 10:09:11 +08:00
|
|
|
retval = quota_read_all_dquots(ctx->qctx, qf_ino, qtype,
|
|
|
|
QREAD_USAGE | QREAD_LIMITS);
|
2022-05-13 20:16:34 +08:00
|
|
|
if (retval)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (retval)
|
|
|
|
quota_release_context(&ctx->qctx);
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Write all the quota info to disk. */
|
|
|
|
static errcode_t e2fsck_write_all_quotas(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
struct problem_context pctx;
|
|
|
|
enum quota_type qtype;
|
|
|
|
|
|
|
|
if (!ext2fs_has_feature_quota(ctx->fs->super))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
for (qtype = 0 ; qtype < MAXQUOTAS; qtype++) {
|
|
|
|
pctx.num = qtype;
|
|
|
|
pctx.errcode = quota_write_inode(ctx->qctx, 1 << qtype);
|
|
|
|
if (pctx.errcode) {
|
|
|
|
fix_problem(ctx, PR_6_WRITE_QUOTAS, &pctx);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
quota_release_context(&ctx->qctx);
|
|
|
|
return pctx.errcode;
|
|
|
|
}
|
|
|
|
|
2024-03-26 10:09:11 +08:00
|
|
|
static int release_orphan_inode(e2fsck_t ctx, ext2_ino_t *ino, char *block_buf)
|
|
|
|
{
|
|
|
|
ext2_filsys fs = ctx->fs;
|
|
|
|
struct problem_context pctx;
|
|
|
|
struct ext2_inode_large inode;
|
|
|
|
ext2_ino_t next_ino;
|
|
|
|
|
|
|
|
e2fsck_read_inode_full(ctx, *ino, EXT2_INODE(&inode),
|
|
|
|
sizeof(inode), "release_orphan_inode");
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.ino = *ino;
|
|
|
|
pctx.inode = EXT2_INODE(&inode);
|
|
|
|
pctx.str = inode.i_links_count ? _("Truncating") : _("Clearing");
|
|
|
|
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_CLEAR_INODE, &pctx);
|
|
|
|
|
|
|
|
next_ino = inode.i_dtime;
|
|
|
|
if (next_ino &&
|
|
|
|
((next_ino < EXT2_FIRST_INODE(fs->super)) ||
|
|
|
|
(next_ino > fs->super->s_inodes_count))) {
|
|
|
|
pctx.ino = next_ino;
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_ILLEGAL_INODE, &pctx);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (release_inode_blocks(ctx, *ino, &inode, block_buf, &pctx))
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
if (!inode.i_links_count) {
|
|
|
|
if (ctx->qctx)
|
|
|
|
quota_data_inodes(ctx->qctx, &inode, *ino, -1);
|
|
|
|
ext2fs_inode_alloc_stats2(fs, *ino, -1,
|
|
|
|
LINUX_S_ISDIR(inode.i_mode));
|
|
|
|
ctx->free_inodes++;
|
|
|
|
inode.i_dtime = ctx->now;
|
|
|
|
} else {
|
|
|
|
inode.i_dtime = 0;
|
|
|
|
}
|
|
|
|
e2fsck_write_inode_full(ctx, *ino, EXT2_INODE(&inode),
|
|
|
|
sizeof(inode), "delete_file");
|
|
|
|
*ino = next_ino;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct process_orphan_block_data {
|
|
|
|
e2fsck_t ctx;
|
|
|
|
char *buf;
|
|
|
|
char *block_buf;
|
|
|
|
e2_blkcnt_t blocks;
|
|
|
|
int abort;
|
|
|
|
int clear;
|
|
|
|
errcode_t errcode;
|
|
|
|
ext2_ino_t ino;
|
|
|
|
__u32 generation;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int process_orphan_block(ext2_filsys fs,
|
|
|
|
blk64_t *block_nr,
|
|
|
|
e2_blkcnt_t blockcnt,
|
|
|
|
blk64_t ref_blk EXT2FS_ATTR((unused)),
|
|
|
|
int ref_offset EXT2FS_ATTR((unused)),
|
|
|
|
void *priv_data)
|
|
|
|
{
|
|
|
|
struct process_orphan_block_data *pd;
|
|
|
|
e2fsck_t ctx;
|
|
|
|
struct problem_context pctx;
|
|
|
|
blk64_t blk = *block_nr;
|
|
|
|
struct ext4_orphan_block_tail *tail;
|
|
|
|
int j;
|
|
|
|
int inodes_per_ob;
|
|
|
|
__u32 *bdata;
|
|
|
|
ext2_ino_t ino;
|
|
|
|
|
|
|
|
pd = priv_data;
|
|
|
|
ctx = pd->ctx;
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.ino = fs->super->s_orphan_file_inum;
|
|
|
|
pctx.blk = blockcnt;
|
|
|
|
|
|
|
|
/* Orphan file must not have holes */
|
|
|
|
if (!blk) {
|
|
|
|
if (blockcnt == pd->blocks)
|
|
|
|
return BLOCK_ABORT;
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_FILE_HOLE, &pctx);
|
|
|
|
return_abort:
|
|
|
|
pd->abort = 1;
|
|
|
|
return BLOCK_ABORT;
|
|
|
|
}
|
|
|
|
inodes_per_ob = ext2fs_inodes_per_orphan_block(fs);
|
|
|
|
pd->errcode = io_channel_read_blk64(fs->io, blk, 1, pd->buf);
|
|
|
|
if (pd->errcode)
|
|
|
|
goto return_abort;
|
|
|
|
tail = ext2fs_orphan_block_tail(fs, pd->buf);
|
|
|
|
if (ext2fs_le32_to_cpu(tail->ob_magic) !=
|
|
|
|
EXT4_ORPHAN_BLOCK_MAGIC) {
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_FILE_BAD_MAGIC, &pctx);
|
|
|
|
goto return_abort;
|
|
|
|
}
|
|
|
|
if (!ext2fs_orphan_file_block_csum_verify(fs,
|
|
|
|
fs->super->s_orphan_file_inum, blk, pd->buf)) {
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_FILE_BAD_CHECKSUM, &pctx);
|
|
|
|
goto return_abort;
|
|
|
|
}
|
|
|
|
bdata = (__u32 *)pd->buf;
|
|
|
|
for (j = 0; j < inodes_per_ob; j++) {
|
|
|
|
if (!bdata[j])
|
|
|
|
continue;
|
|
|
|
ino = ext2fs_le32_to_cpu(bdata[j]);
|
|
|
|
if (release_orphan_inode(ctx, &ino, pd->block_buf))
|
|
|
|
goto return_abort;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int process_orphan_file(e2fsck_t ctx, char *block_buf)
|
|
|
|
{
|
|
|
|
ext2_filsys fs = ctx->fs;
|
|
|
|
char *orphan_buf;
|
|
|
|
struct process_orphan_block_data pd;
|
|
|
|
int ret = 0;
|
|
|
|
ext2_ino_t orphan_inum = fs->super->s_orphan_file_inum;
|
|
|
|
struct ext2_inode orphan_inode;
|
|
|
|
struct problem_context pctx;
|
|
|
|
errcode_t retval;
|
|
|
|
|
|
|
|
if (!ext2fs_has_feature_orphan_file(fs->super))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.ino = orphan_inum;
|
|
|
|
|
|
|
|
orphan_buf = (char *) e2fsck_allocate_memory(ctx, fs->blocksize * 4,
|
|
|
|
"orphan block buffer");
|
|
|
|
retval = ext2fs_read_inode(fs, orphan_inum, &orphan_inode);
|
|
|
|
if (retval < 0) {
|
|
|
|
com_err("process_orphan_file", retval,
|
|
|
|
_("while reading inode %d"), orphan_inum);
|
|
|
|
ret = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (EXT2_I_SIZE(&orphan_inode) & (fs->blocksize - 1)) {
|
|
|
|
fix_problem(ctx, PR_0_ORPHAN_FILE_WRONG_SIZE, &pctx);
|
|
|
|
ret = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
pd.buf = orphan_buf + 3 * fs->blocksize;
|
|
|
|
pd.block_buf = block_buf;
|
|
|
|
pd.blocks = EXT2_I_SIZE(&orphan_inode) / fs->blocksize;
|
|
|
|
pd.ctx = ctx;
|
|
|
|
pd.abort = 0;
|
|
|
|
pd.errcode = 0;
|
|
|
|
retval = ext2fs_block_iterate3(fs, orphan_inum,
|
|
|
|
BLOCK_FLAG_DATA_ONLY | BLOCK_FLAG_HOLE,
|
|
|
|
orphan_buf, process_orphan_block, &pd);
|
|
|
|
if (retval) {
|
|
|
|
com_err("process_orphan_block", retval,
|
|
|
|
_("while calling ext2fs_block_iterate for inode %d"),
|
|
|
|
orphan_inum);
|
|
|
|
ret = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (pd.abort) {
|
|
|
|
if (pd.errcode) {
|
|
|
|
com_err("process_orphan_block", pd.errcode,
|
|
|
|
_("while reading blocks of inode %d"),
|
|
|
|
orphan_inum);
|
|
|
|
}
|
|
|
|
ret = 1;
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
ext2fs_free_mem(&orphan_buf);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2022-05-13 20:16:34 +08:00
|
|
|
/*
|
|
|
|
* This function releases all of the orphan inodes. It returns 1 if
|
|
|
|
* it hit some error, and 0 on success.
|
|
|
|
*/
|
|
|
|
static int release_orphan_inodes(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
ext2_filsys fs = ctx->fs;
|
2024-03-26 10:09:11 +08:00
|
|
|
ext2_ino_t ino;
|
2022-05-13 20:16:34 +08:00
|
|
|
struct problem_context pctx;
|
|
|
|
char *block_buf;
|
|
|
|
|
2024-03-26 10:09:11 +08:00
|
|
|
if (fs->super->s_last_orphan == 0 &&
|
|
|
|
!ext2fs_has_feature_orphan_present(fs->super))
|
2022-05-13 20:16:34 +08:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
2024-03-26 10:09:11 +08:00
|
|
|
ino = fs->super->s_last_orphan;
|
|
|
|
pctx.ino = ino;
|
2022-05-13 20:16:34 +08:00
|
|
|
pctx.errcode = e2fsck_read_all_quotas(ctx);
|
|
|
|
if (pctx.errcode) {
|
|
|
|
fix_problem(ctx, PR_0_QUOTA_INIT_CTX, &pctx);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Win or lose, we won't be using the head of the orphan inode
|
|
|
|
* list again.
|
|
|
|
*/
|
|
|
|
fs->super->s_last_orphan = 0;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
|
|
|
|
/*
|
2024-03-26 10:09:11 +08:00
|
|
|
* If the filesystem contains errors, don't process the orphan list
|
|
|
|
* or orphan file, since neither can be trusted; and we're going to
|
|
|
|
* be running a full e2fsck run anyway... We clear orphan file contents
|
|
|
|
* after filesystem is checked to avoid clearing someone else's data.
|
2022-05-13 20:16:34 +08:00
|
|
|
*/
|
|
|
|
if (fs->super->s_state & EXT2_ERROR_FS) {
|
|
|
|
if (ctx->qctx)
|
|
|
|
quota_release_context(&ctx->qctx);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2024-03-26 10:09:11 +08:00
|
|
|
if (ino && ((ino < EXT2_FIRST_INODE(fs->super)) ||
|
|
|
|
(ino > fs->super->s_inodes_count))) {
|
2022-05-13 20:16:34 +08:00
|
|
|
fix_problem(ctx, PR_0_ORPHAN_ILLEGAL_HEAD_INODE, &pctx);
|
|
|
|
goto err_qctx;
|
|
|
|
}
|
|
|
|
|
|
|
|
block_buf = (char *) e2fsck_allocate_memory(ctx, fs->blocksize * 4,
|
|
|
|
"block iterate buffer");
|
|
|
|
e2fsck_read_bitmaps(ctx);
|
|
|
|
|
2024-03-26 10:09:11 +08:00
|
|
|
/* First process orphan list */
|
2022-05-13 20:16:34 +08:00
|
|
|
while (ino) {
|
2024-03-26 10:09:11 +08:00
|
|
|
if (release_orphan_inode(ctx, &ino, block_buf))
|
2022-05-13 20:16:34 +08:00
|
|
|
goto err_buf;
|
2024-03-26 10:09:11 +08:00
|
|
|
}
|
2022-05-13 20:16:34 +08:00
|
|
|
|
2024-03-26 10:09:11 +08:00
|
|
|
/* Next process orphan file */
|
|
|
|
if (ext2fs_has_feature_orphan_present(fs->super) &&
|
|
|
|
!ext2fs_has_feature_orphan_file(fs->super))
|
|
|
|
goto err_buf;
|
|
|
|
if (process_orphan_file(ctx, block_buf))
|
|
|
|
goto err_buf;
|
2022-05-13 20:16:34 +08:00
|
|
|
|
|
|
|
ext2fs_free_mem(&block_buf);
|
|
|
|
pctx.errcode = e2fsck_write_all_quotas(ctx);
|
|
|
|
if (pctx.errcode)
|
|
|
|
goto err;
|
|
|
|
return 0;
|
|
|
|
err_buf:
|
|
|
|
ext2fs_free_mem(&block_buf);
|
|
|
|
err_qctx:
|
|
|
|
if (ctx->qctx)
|
|
|
|
quota_release_context(&ctx->qctx);
|
|
|
|
err:
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2024-03-26 10:09:11 +08:00
|
|
|
static int reinit_orphan_block(ext2_filsys fs,
|
|
|
|
blk64_t *block_nr,
|
|
|
|
e2_blkcnt_t blockcnt,
|
|
|
|
blk64_t ref_blk EXT2FS_ATTR((unused)),
|
|
|
|
int ref_offset EXT2FS_ATTR((unused)),
|
|
|
|
void *priv_data)
|
|
|
|
{
|
|
|
|
struct process_orphan_block_data *pd;
|
|
|
|
e2fsck_t ctx;
|
|
|
|
blk64_t blk = *block_nr;
|
|
|
|
struct problem_context pctx;
|
|
|
|
|
|
|
|
pd = priv_data;
|
|
|
|
ctx = pd->ctx;
|
|
|
|
|
|
|
|
/* Orphan file must not have holes */
|
|
|
|
if (!blk) {
|
|
|
|
if (blockcnt == pd->blocks)
|
|
|
|
return BLOCK_ABORT;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.ino = fs->super->s_orphan_file_inum;
|
|
|
|
pctx.blk = blockcnt;
|
|
|
|
fix_problem(ctx, PR_6_ORPHAN_FILE_HOLE, &pctx);
|
|
|
|
return_abort:
|
|
|
|
pd->abort = 1;
|
|
|
|
return BLOCK_ABORT;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ext2fs_has_feature_metadata_csum(fs->super)) {
|
|
|
|
struct ext4_orphan_block_tail *tail;
|
|
|
|
|
|
|
|
tail = ext2fs_orphan_block_tail(fs, pd->buf);
|
|
|
|
/*
|
|
|
|
* Update checksum to match expected buffer contents with
|
|
|
|
* appropriate block number.
|
|
|
|
*/
|
|
|
|
tail->ob_checksum = ext2fs_do_orphan_file_block_csum(fs,
|
|
|
|
pd->ino, pd->generation, blk, pd->buf);
|
|
|
|
}
|
|
|
|
if (!pd->clear) {
|
|
|
|
pd->errcode = io_channel_read_blk64(fs->io, blk, 1,
|
|
|
|
pd->block_buf);
|
|
|
|
/* Block is already cleanly initialized? */
|
|
|
|
if (!memcmp(pd->block_buf, pd->buf, fs->blocksize))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.ino = fs->super->s_orphan_file_inum;
|
|
|
|
pctx.blk = blockcnt;
|
|
|
|
if (!fix_problem(ctx, PR_6_ORPHAN_BLOCK_DIRTY, &pctx))
|
|
|
|
goto return_abort;
|
|
|
|
pd->clear = 1;
|
|
|
|
}
|
|
|
|
pd->errcode = io_channel_write_blk64(fs->io, blk, 1, pd->buf);
|
|
|
|
if (pd->errcode)
|
|
|
|
goto return_abort;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check and clear orphan file. We just return non-zero if we hit some
|
|
|
|
* inconsistency. Caller will truncate & recreate new orphan file.
|
|
|
|
*/
|
|
|
|
int check_init_orphan_file(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
ext2_filsys fs = ctx->fs;
|
|
|
|
char *orphan_buf;
|
|
|
|
struct process_orphan_block_data pd;
|
|
|
|
struct ext4_orphan_block_tail *tail;
|
|
|
|
ext2_ino_t orphan_inum = fs->super->s_orphan_file_inum;
|
|
|
|
struct ext2_inode orphan_inode;
|
|
|
|
int ret = 0;
|
|
|
|
errcode_t retval;
|
|
|
|
|
|
|
|
orphan_buf = (char *) e2fsck_allocate_memory(ctx, fs->blocksize * 5,
|
|
|
|
"orphan block buffer");
|
|
|
|
e2fsck_read_inode(ctx, orphan_inum, &orphan_inode, "orphan inode");
|
|
|
|
if (EXT2_I_SIZE(&orphan_inode) & (fs->blocksize - 1)) {
|
|
|
|
struct problem_context pctx;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
pctx.ino = orphan_inum;
|
|
|
|
fix_problem(ctx, PR_6_ORPHAN_FILE_WRONG_SIZE, &pctx);
|
|
|
|
ret = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
pd.buf = orphan_buf + 3 * fs->blocksize;
|
|
|
|
pd.block_buf = orphan_buf + 4 * fs->blocksize;
|
|
|
|
pd.blocks = EXT2_I_SIZE(&orphan_inode) / fs->blocksize;
|
|
|
|
pd.ctx = ctx;
|
|
|
|
pd.abort = 0;
|
|
|
|
pd.clear = 0;
|
|
|
|
pd.errcode = 0;
|
|
|
|
pd.ino = orphan_inum;
|
|
|
|
pd.generation = orphan_inode.i_generation;
|
|
|
|
/* Initialize buffer to write */
|
|
|
|
memset(pd.buf, 0, fs->blocksize);
|
|
|
|
tail = ext2fs_orphan_block_tail(fs, pd.buf);
|
|
|
|
tail->ob_magic = ext2fs_cpu_to_le32(EXT4_ORPHAN_BLOCK_MAGIC);
|
|
|
|
|
|
|
|
retval = ext2fs_block_iterate3(fs, orphan_inum,
|
|
|
|
BLOCK_FLAG_DATA_ONLY | BLOCK_FLAG_HOLE,
|
|
|
|
orphan_buf, reinit_orphan_block, &pd);
|
|
|
|
if (retval) {
|
|
|
|
com_err("reinit_orphan_block", retval,
|
|
|
|
_("while calling ext2fs_block_iterate for inode %d"),
|
|
|
|
orphan_inum);
|
|
|
|
ret = 1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (pd.abort) {
|
|
|
|
if (pd.errcode) {
|
|
|
|
com_err("process_orphan_block", pd.errcode,
|
|
|
|
_("while reading blocks of inode %d"),
|
|
|
|
orphan_inum);
|
|
|
|
}
|
|
|
|
ret = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We had to clear some blocks. Report it up. */
|
|
|
|
if (ret == 0 && pd.clear)
|
|
|
|
ret = 2;
|
|
|
|
out:
|
|
|
|
ext2fs_free_mem(&orphan_buf);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2022-05-13 20:16:34 +08:00
|
|
|
/*
|
|
|
|
* Check the resize inode to make sure it is sane. We check both for
|
|
|
|
* the case where on-line resizing is not enabled (in which case the
|
|
|
|
* resize inode should be cleared) as well as the case where on-line
|
|
|
|
* resizing is enabled.
|
|
|
|
*/
|
|
|
|
void check_resize_inode(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
ext2_filsys fs = ctx->fs;
|
|
|
|
struct ext2_inode inode;
|
|
|
|
struct problem_context pctx;
|
|
|
|
int i, gdt_off, ind_off;
|
|
|
|
dgrp_t j;
|
|
|
|
blk_t blk, pblk;
|
|
|
|
blk_t expect; /* for resize inode, which is 32-bit only */
|
|
|
|
__u32 *dind_buf = 0, *ind_buf;
|
|
|
|
errcode_t retval;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
|
|
|
|
if (ext2fs_has_feature_resize_inode(fs->super) &&
|
|
|
|
ext2fs_has_feature_meta_bg(fs->super) &&
|
|
|
|
fix_problem(ctx, PR_0_DISABLE_RESIZE_INODE, &pctx)) {
|
|
|
|
ext2fs_clear_feature_resize_inode(fs->super);
|
|
|
|
fs->super->s_reserved_gdt_blocks = 0;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the resize inode feature isn't set, then
|
|
|
|
* s_reserved_gdt_blocks must be zero.
|
|
|
|
*/
|
|
|
|
if (!ext2fs_has_feature_resize_inode(fs->super)) {
|
|
|
|
if (fs->super->s_reserved_gdt_blocks) {
|
|
|
|
pctx.num = fs->super->s_reserved_gdt_blocks;
|
|
|
|
if (fix_problem(ctx, PR_0_NONZERO_RESERVED_GDT_BLOCKS,
|
|
|
|
&pctx)) {
|
|
|
|
fs->super->s_reserved_gdt_blocks = 0;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Read the resize inode */
|
|
|
|
pctx.ino = EXT2_RESIZE_INO;
|
|
|
|
retval = ext2fs_read_inode(fs, EXT2_RESIZE_INO, &inode);
|
|
|
|
if (retval) {
|
|
|
|
if (ext2fs_has_feature_resize_inode(fs->super))
|
|
|
|
ctx->flags |= E2F_FLAG_RESIZE_INODE;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the resize inode feature isn't set, check to make sure
|
|
|
|
* the resize inode is cleared; then we're done.
|
|
|
|
*/
|
|
|
|
if (!ext2fs_has_feature_resize_inode(fs->super)) {
|
|
|
|
for (i=0; i < EXT2_N_BLOCKS; i++) {
|
|
|
|
if (inode.i_block[i])
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((i < EXT2_N_BLOCKS) &&
|
|
|
|
fix_problem(ctx, PR_0_CLEAR_RESIZE_INODE, &pctx)) {
|
|
|
|
memset(&inode, 0, sizeof(inode));
|
|
|
|
e2fsck_write_inode(ctx, EXT2_RESIZE_INO, &inode,
|
|
|
|
"clear_resize");
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The resize inode feature is enabled; check to make sure the
|
|
|
|
* only block in use is the double indirect block
|
|
|
|
*/
|
|
|
|
blk = inode.i_block[EXT2_DIND_BLOCK];
|
|
|
|
for (i=0; i < EXT2_N_BLOCKS; i++) {
|
|
|
|
if (i != EXT2_DIND_BLOCK && inode.i_block[i])
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((i < EXT2_N_BLOCKS) || !blk || !inode.i_links_count ||
|
|
|
|
!(inode.i_mode & LINUX_S_IFREG) ||
|
|
|
|
(blk < fs->super->s_first_data_block ||
|
|
|
|
blk >= ext2fs_blocks_count(fs->super))) {
|
|
|
|
resize_inode_invalid:
|
|
|
|
if (fix_problem(ctx, PR_0_RESIZE_INODE_INVALID, &pctx)) {
|
|
|
|
memset(&inode, 0, sizeof(inode));
|
|
|
|
e2fsck_write_inode(ctx, EXT2_RESIZE_INO, &inode,
|
|
|
|
"clear_resize");
|
|
|
|
ctx->flags |= E2F_FLAG_RESIZE_INODE;
|
|
|
|
}
|
|
|
|
if (!(ctx->options & E2F_OPT_READONLY)) {
|
|
|
|
fs->super->s_state &= ~EXT2_VALID_FS;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
dind_buf = (__u32 *) e2fsck_allocate_memory(ctx, fs->blocksize * 2,
|
|
|
|
"resize dind buffer");
|
|
|
|
ind_buf = (__u32 *) ((char *) dind_buf + fs->blocksize);
|
|
|
|
|
|
|
|
retval = ext2fs_read_ind_block(fs, blk, dind_buf);
|
|
|
|
if (retval)
|
|
|
|
goto resize_inode_invalid;
|
|
|
|
|
|
|
|
gdt_off = fs->desc_blocks;
|
|
|
|
pblk = fs->super->s_first_data_block + 1 + fs->desc_blocks;
|
|
|
|
if (fs->blocksize == 1024 && fs->super->s_first_data_block == 0)
|
|
|
|
pblk++; /* Deal with 1024 blocksize bigalloc fs */
|
|
|
|
for (i = 0; i < fs->super->s_reserved_gdt_blocks / 4;
|
|
|
|
i++, gdt_off++, pblk++) {
|
|
|
|
gdt_off %= fs->blocksize/4;
|
|
|
|
if (dind_buf[gdt_off] != pblk)
|
|
|
|
goto resize_inode_invalid;
|
|
|
|
retval = ext2fs_read_ind_block(fs, pblk, ind_buf);
|
|
|
|
if (retval)
|
|
|
|
goto resize_inode_invalid;
|
|
|
|
ind_off = 0;
|
|
|
|
for (j = 1; j < fs->group_desc_count; j++) {
|
|
|
|
if (!ext2fs_bg_has_super(fs, j))
|
|
|
|
continue;
|
|
|
|
expect = pblk + EXT2_GROUPS_TO_BLOCKS(fs->super, j);
|
|
|
|
if (ind_buf[ind_off] != expect)
|
|
|
|
goto resize_inode_invalid;
|
|
|
|
ind_off++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
cleanup:
|
|
|
|
if (dind_buf)
|
|
|
|
ext2fs_free_mem(&dind_buf);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function checks the dirhash signed/unsigned hint if necessary.
|
|
|
|
*/
|
|
|
|
static void e2fsck_fix_dirhash_hint(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
struct ext2_super_block *sb = ctx->fs->super;
|
|
|
|
struct problem_context pctx;
|
|
|
|
char c;
|
|
|
|
|
|
|
|
if ((ctx->options & E2F_OPT_READONLY) ||
|
|
|
|
!ext2fs_has_feature_dir_index(sb) ||
|
|
|
|
(sb->s_flags & (EXT2_FLAGS_SIGNED_HASH|EXT2_FLAGS_UNSIGNED_HASH)))
|
|
|
|
return;
|
|
|
|
|
|
|
|
c = (char) 255;
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
if (fix_problem(ctx, PR_0_DIRHASH_HINT, &pctx)) {
|
|
|
|
if (((int) c) == -1) {
|
|
|
|
sb->s_flags |= EXT2_FLAGS_SIGNED_HASH;
|
|
|
|
} else {
|
|
|
|
sb->s_flags |= EXT2_FLAGS_UNSIGNED_HASH;
|
|
|
|
}
|
|
|
|
ext2fs_mark_super_dirty(ctx->fs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void check_super_block(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
ext2_filsys fs = ctx->fs;
|
|
|
|
blk64_t first_block, last_block;
|
|
|
|
struct ext2_super_block *sb = fs->super;
|
|
|
|
unsigned int ipg_max;
|
|
|
|
problem_t problem;
|
|
|
|
blk64_t blocks_per_group = fs->super->s_blocks_per_group;
|
|
|
|
__u32 bpg_max, cpg_max;
|
|
|
|
__u64 blks_max;
|
|
|
|
int inodes_per_block;
|
|
|
|
int inode_size;
|
|
|
|
int accept_time_fudge;
|
|
|
|
int broken_system_clock;
|
|
|
|
dgrp_t i;
|
|
|
|
blk64_t should_be;
|
|
|
|
struct problem_context pctx;
|
|
|
|
blk64_t free_blocks = 0;
|
2024-03-26 10:09:11 +08:00
|
|
|
ext2_ino_t free_inodes = 0;
|
2022-05-13 20:16:34 +08:00
|
|
|
int csum_flag, clear_test_fs_flag;
|
|
|
|
|
|
|
|
inodes_per_block = EXT2_INODES_PER_BLOCK(fs->super);
|
|
|
|
ipg_max = inodes_per_block * (blocks_per_group - 4);
|
|
|
|
if (ipg_max > EXT2_MAX_INODES_PER_GROUP(sb))
|
|
|
|
ipg_max = EXT2_MAX_INODES_PER_GROUP(sb);
|
|
|
|
cpg_max = 8 * EXT2_BLOCK_SIZE(sb);
|
|
|
|
if (cpg_max > EXT2_MAX_CLUSTERS_PER_GROUP(sb))
|
|
|
|
cpg_max = EXT2_MAX_CLUSTERS_PER_GROUP(sb);
|
|
|
|
bpg_max = 8 * EXT2_BLOCK_SIZE(sb) * EXT2FS_CLUSTER_RATIO(fs);
|
|
|
|
if (bpg_max > EXT2_MAX_BLOCKS_PER_GROUP(sb))
|
|
|
|
bpg_max = EXT2_MAX_BLOCKS_PER_GROUP(sb);
|
|
|
|
|
|
|
|
ctx->invalid_inode_bitmap_flag = (int *) e2fsck_allocate_memory(ctx,
|
|
|
|
sizeof(int) * fs->group_desc_count, "invalid_inode_bitmap");
|
|
|
|
ctx->invalid_block_bitmap_flag = (int *) e2fsck_allocate_memory(ctx,
|
|
|
|
sizeof(int) * fs->group_desc_count, "invalid_block_bitmap");
|
|
|
|
ctx->invalid_inode_table_flag = (int *) e2fsck_allocate_memory(ctx,
|
|
|
|
sizeof(int) * fs->group_desc_count, "invalid_inode_table");
|
|
|
|
|
|
|
|
blks_max = (1ULL << 32) * EXT2_MAX_BLOCKS_PER_GROUP(fs->super);
|
|
|
|
if (ext2fs_has_feature_64bit(fs->super)) {
|
|
|
|
if (blks_max > ((1ULL << 48) - 1))
|
|
|
|
blks_max = (1ULL << 48) - 1;
|
|
|
|
} else {
|
|
|
|
if (blks_max > ((1ULL << 32) - 1))
|
|
|
|
blks_max = (1ULL << 32) - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Verify the super block constants...
|
|
|
|
*/
|
|
|
|
if (!check_super_value(ctx, "inodes_count", sb->s_inodes_count,
|
|
|
|
MIN_CHECK, 1, 0))
|
|
|
|
return;
|
|
|
|
if (!check_super_value64(ctx, "blocks_count", ext2fs_blocks_count(sb),
|
|
|
|
MIN_CHECK | MAX_CHECK, 1, blks_max))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "first_data_block", sb->s_first_data_block,
|
|
|
|
MAX_CHECK, 0, ext2fs_blocks_count(sb)))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "log_block_size", sb->s_log_block_size,
|
|
|
|
MIN_CHECK | MAX_CHECK, 0,
|
|
|
|
EXT2_MAX_BLOCK_LOG_SIZE - EXT2_MIN_BLOCK_LOG_SIZE))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "log_cluster_size",
|
|
|
|
sb->s_log_cluster_size,
|
|
|
|
MIN_CHECK | MAX_CHECK, sb->s_log_block_size,
|
|
|
|
(EXT2_MAX_CLUSTER_LOG_SIZE -
|
|
|
|
EXT2_MIN_CLUSTER_LOG_SIZE)))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "clusters_per_group",
|
|
|
|
sb->s_clusters_per_group,
|
|
|
|
MIN_CHECK | MAX_CHECK, 8, cpg_max))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "blocks_per_group", sb->s_blocks_per_group,
|
|
|
|
MIN_CHECK | MAX_CHECK, 8, bpg_max))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "inodes_per_group", sb->s_inodes_per_group,
|
|
|
|
MIN_CHECK | MAX_CHECK, inodes_per_block, ipg_max))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "r_blocks_count", ext2fs_r_blocks_count(sb),
|
|
|
|
MAX_CHECK, 0, ext2fs_blocks_count(sb) / 2))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "reserved_gdt_blocks",
|
|
|
|
sb->s_reserved_gdt_blocks, MAX_CHECK, 0,
|
|
|
|
fs->blocksize / sizeof(__u32)))
|
|
|
|
return;
|
|
|
|
if (!check_super_value(ctx, "desc_size",
|
|
|
|
sb->s_desc_size, MAX_CHECK | LOG2_CHECK, 0,
|
|
|
|
EXT2_MAX_DESC_SIZE))
|
|
|
|
return;
|
|
|
|
|
|
|
|
should_be = (__u64)sb->s_inodes_per_group * fs->group_desc_count;
|
|
|
|
if (should_be > ~0U) {
|
|
|
|
pctx.num = should_be;
|
|
|
|
fix_problem(ctx, PR_0_INODE_COUNT_BIG, &pctx);
|
|
|
|
ctx->flags |= E2F_FLAG_ABORT;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (sb->s_inodes_count != should_be) {
|
|
|
|
pctx.ino = sb->s_inodes_count;
|
|
|
|
pctx.ino2 = should_be;
|
|
|
|
if (fix_problem(ctx, PR_0_INODE_COUNT_WRONG, &pctx)) {
|
|
|
|
sb->s_inodes_count = should_be;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
} else {
|
|
|
|
pctx.num = sb->s_inodes_count;
|
|
|
|
pctx.str = "inodes_count";
|
|
|
|
fix_problem(ctx, PR_0_MISC_CORRUPT_SUPER, &pctx);
|
|
|
|
ctx->flags |= E2F_FLAG_ABORT;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (sb->s_rev_level > EXT2_GOOD_OLD_REV &&
|
|
|
|
!check_super_value(ctx, "first_ino", sb->s_first_ino,
|
|
|
|
MIN_CHECK | MAX_CHECK,
|
|
|
|
EXT2_GOOD_OLD_FIRST_INO, sb->s_inodes_count))
|
|
|
|
return;
|
|
|
|
inode_size = EXT2_INODE_SIZE(sb);
|
|
|
|
if (!check_super_value(ctx, "inode_size",
|
|
|
|
inode_size, MIN_CHECK | MAX_CHECK | LOG2_CHECK,
|
|
|
|
EXT2_GOOD_OLD_INODE_SIZE, fs->blocksize))
|
|
|
|
return;
|
|
|
|
if (sb->s_blocks_per_group != (sb->s_clusters_per_group *
|
|
|
|
EXT2FS_CLUSTER_RATIO(fs))) {
|
|
|
|
pctx.num = sb->s_clusters_per_group * EXT2FS_CLUSTER_RATIO(fs);
|
|
|
|
pctx.str = "block_size";
|
|
|
|
fix_problem(ctx, PR_0_MISC_CORRUPT_SUPER, &pctx);
|
|
|
|
ctx->flags |= E2F_FLAG_ABORT;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((ctx->flags & E2F_FLAG_GOT_DEVSIZE) &&
|
|
|
|
(ctx->num_blocks < ext2fs_blocks_count(sb))) {
|
|
|
|
pctx.blk = ext2fs_blocks_count(sb);
|
|
|
|
pctx.blk2 = ctx->num_blocks;
|
|
|
|
if (fix_problem(ctx, PR_0_FS_SIZE_WRONG, &pctx)) {
|
|
|
|
ctx->flags |= E2F_FLAG_ABORT;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
should_be = (sb->s_log_block_size == 0 &&
|
|
|
|
EXT2FS_CLUSTER_RATIO(fs) == 1) ? 1 : 0;
|
|
|
|
if (sb->s_first_data_block != should_be) {
|
|
|
|
pctx.blk = sb->s_first_data_block;
|
|
|
|
pctx.blk2 = should_be;
|
|
|
|
fix_problem(ctx, PR_0_FIRST_DATA_BLOCK, &pctx);
|
|
|
|
ctx->flags |= E2F_FLAG_ABORT;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (EXT2_INODE_SIZE(sb) > EXT2_GOOD_OLD_INODE_SIZE) {
|
|
|
|
unsigned min =
|
|
|
|
sizeof(((struct ext2_inode_large *) 0)->i_extra_isize) +
|
|
|
|
sizeof(((struct ext2_inode_large *) 0)->i_checksum_hi);
|
|
|
|
unsigned max = EXT2_INODE_SIZE(sb) - EXT2_GOOD_OLD_INODE_SIZE;
|
|
|
|
pctx.num = sb->s_min_extra_isize;
|
|
|
|
if (sb->s_min_extra_isize &&
|
|
|
|
(sb->s_min_extra_isize < min ||
|
|
|
|
sb->s_min_extra_isize > max ||
|
|
|
|
sb->s_min_extra_isize & 3) &&
|
|
|
|
fix_problem(ctx, PR_0_BAD_MIN_EXTRA_ISIZE, &pctx)) {
|
|
|
|
sb->s_min_extra_isize =
|
|
|
|
(sizeof(struct ext2_inode_large) -
|
|
|
|
EXT2_GOOD_OLD_INODE_SIZE);
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
pctx.num = sb->s_want_extra_isize;
|
|
|
|
if (sb->s_want_extra_isize &&
|
|
|
|
(sb->s_want_extra_isize < min ||
|
|
|
|
sb->s_want_extra_isize > max ||
|
|
|
|
sb->s_want_extra_isize & 3) &&
|
|
|
|
fix_problem(ctx, PR_0_BAD_WANT_EXTRA_ISIZE, &pctx)) {
|
|
|
|
sb->s_want_extra_isize =
|
|
|
|
(sizeof(struct ext2_inode_large) -
|
|
|
|
EXT2_GOOD_OLD_INODE_SIZE);
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Are metadata_csum and uninit_bg both set? */
|
|
|
|
if (ext2fs_has_feature_metadata_csum(fs->super) &&
|
|
|
|
ext2fs_has_feature_gdt_csum(fs->super) &&
|
|
|
|
fix_problem(ctx, PR_0_META_AND_GDT_CSUM_SET, &pctx)) {
|
|
|
|
ext2fs_clear_feature_gdt_csum(fs->super);
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
for (i = 0; i < fs->group_desc_count; i++)
|
|
|
|
ext2fs_group_desc_csum_set(fs, i);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We can't have ^metadata_csum,metadata_csum_seed */
|
|
|
|
if (!ext2fs_has_feature_metadata_csum(fs->super) &&
|
|
|
|
ext2fs_has_feature_csum_seed(fs->super) &&
|
|
|
|
fix_problem(ctx, PR_0_CSUM_SEED_WITHOUT_META_CSUM, &pctx)) {
|
|
|
|
ext2fs_clear_feature_csum_seed(fs->super);
|
|
|
|
fs->super->s_checksum_seed = 0;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Is 64bit set and extents unset? */
|
|
|
|
if (ext2fs_has_feature_64bit(fs->super) &&
|
|
|
|
!ext2fs_has_feature_extents(fs->super) &&
|
|
|
|
fix_problem(ctx, PR_0_64BIT_WITHOUT_EXTENTS, &pctx)) {
|
|
|
|
ext2fs_set_feature_extents(fs->super);
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Did user ask us to convert files to extents? */
|
|
|
|
if (ctx->options & E2F_OPT_CONVERT_BMAP) {
|
|
|
|
ext2fs_set_feature_extents(fs->super);
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ext2fs_has_feature_meta_bg(fs->super) &&
|
|
|
|
(fs->super->s_first_meta_bg > fs->desc_blocks)) {
|
|
|
|
pctx.group = fs->desc_blocks;
|
|
|
|
pctx.num = fs->super->s_first_meta_bg;
|
|
|
|
if (fix_problem(ctx, PR_0_FIRST_META_BG_TOO_BIG, &pctx)) {
|
|
|
|
ext2fs_clear_feature_meta_bg(fs->super);
|
|
|
|
fs->super->s_first_meta_bg = 0;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Verify the group descriptors....
|
|
|
|
*/
|
|
|
|
first_block = sb->s_first_data_block;
|
|
|
|
last_block = ext2fs_blocks_count(sb)-1;
|
|
|
|
|
|
|
|
csum_flag = ext2fs_has_group_desc_csum(fs);
|
|
|
|
for (i = 0; i < fs->group_desc_count; i++) {
|
|
|
|
pctx.group = i;
|
|
|
|
|
|
|
|
if (!ext2fs_has_feature_flex_bg(fs->super)) {
|
|
|
|
first_block = ext2fs_group_first_block2(fs, i);
|
|
|
|
last_block = ext2fs_group_last_block2(fs, i);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((ext2fs_block_bitmap_loc(fs, i) < first_block) ||
|
|
|
|
(ext2fs_block_bitmap_loc(fs, i) > last_block)) {
|
|
|
|
pctx.blk = ext2fs_block_bitmap_loc(fs, i);
|
|
|
|
if (fix_problem(ctx, PR_0_BB_NOT_GROUP, &pctx))
|
|
|
|
ext2fs_block_bitmap_loc_set(fs, i, 0);
|
|
|
|
}
|
|
|
|
if (ext2fs_block_bitmap_loc(fs, i) == 0) {
|
|
|
|
ctx->invalid_block_bitmap_flag[i]++;
|
|
|
|
ctx->invalid_bitmaps++;
|
|
|
|
}
|
|
|
|
if ((ext2fs_inode_bitmap_loc(fs, i) < first_block) ||
|
|
|
|
(ext2fs_inode_bitmap_loc(fs, i) > last_block)) {
|
|
|
|
pctx.blk = ext2fs_inode_bitmap_loc(fs, i);
|
|
|
|
if (fix_problem(ctx, PR_0_IB_NOT_GROUP, &pctx))
|
|
|
|
ext2fs_inode_bitmap_loc_set(fs, i, 0);
|
|
|
|
}
|
|
|
|
if (ext2fs_inode_bitmap_loc(fs, i) == 0) {
|
|
|
|
ctx->invalid_inode_bitmap_flag[i]++;
|
|
|
|
ctx->invalid_bitmaps++;
|
|
|
|
}
|
|
|
|
if ((ext2fs_inode_table_loc(fs, i) < first_block) ||
|
|
|
|
((ext2fs_inode_table_loc(fs, i) +
|
|
|
|
fs->inode_blocks_per_group - 1) > last_block)) {
|
|
|
|
pctx.blk = ext2fs_inode_table_loc(fs, i);
|
|
|
|
if (fix_problem(ctx, PR_0_ITABLE_NOT_GROUP, &pctx))
|
|
|
|
ext2fs_inode_table_loc_set(fs, i, 0);
|
|
|
|
}
|
|
|
|
if (ext2fs_inode_table_loc(fs, i) == 0) {
|
|
|
|
ctx->invalid_inode_table_flag[i]++;
|
|
|
|
ctx->invalid_bitmaps++;
|
|
|
|
}
|
|
|
|
free_blocks += ext2fs_bg_free_blocks_count(fs, i);
|
|
|
|
free_inodes += ext2fs_bg_free_inodes_count(fs, i);
|
|
|
|
|
|
|
|
if ((ext2fs_bg_free_blocks_count(fs, i) > sb->s_blocks_per_group) ||
|
|
|
|
(ext2fs_bg_free_inodes_count(fs, i) > sb->s_inodes_per_group) ||
|
|
|
|
(ext2fs_bg_used_dirs_count(fs, i) > sb->s_inodes_per_group))
|
|
|
|
ext2fs_unmark_valid(fs);
|
|
|
|
|
|
|
|
should_be = 0;
|
|
|
|
if (!ext2fs_group_desc_csum_verify(fs, i)) {
|
|
|
|
pctx.csum1 = ext2fs_bg_checksum(fs, i);
|
|
|
|
pctx.csum2 = ext2fs_group_desc_csum(fs, i);
|
|
|
|
if (fix_problem(ctx, PR_0_GDT_CSUM, &pctx)) {
|
|
|
|
ext2fs_bg_flags_clear(fs, i, EXT2_BG_BLOCK_UNINIT);
|
|
|
|
ext2fs_bg_flags_clear(fs, i, EXT2_BG_INODE_UNINIT);
|
|
|
|
ext2fs_bg_itable_unused_set(fs, i, 0);
|
|
|
|
should_be = 1;
|
|
|
|
}
|
|
|
|
ext2fs_unmark_valid(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!csum_flag &&
|
|
|
|
(ext2fs_bg_flags_test(fs, i, EXT2_BG_BLOCK_UNINIT) ||
|
|
|
|
ext2fs_bg_flags_test(fs, i, EXT2_BG_INODE_UNINIT) ||
|
|
|
|
ext2fs_bg_itable_unused(fs, i) != 0)) {
|
|
|
|
if (fix_problem(ctx, PR_0_GDT_UNINIT, &pctx)) {
|
|
|
|
ext2fs_bg_flags_clear(fs, i, EXT2_BG_BLOCK_UNINIT);
|
|
|
|
ext2fs_bg_flags_clear(fs, i, EXT2_BG_INODE_UNINIT);
|
|
|
|
ext2fs_bg_itable_unused_set(fs, i, 0);
|
|
|
|
should_be = 1;
|
|
|
|
}
|
|
|
|
ext2fs_unmark_valid(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == fs->group_desc_count - 1 &&
|
|
|
|
ext2fs_bg_flags_test(fs, i, EXT2_BG_BLOCK_UNINIT)) {
|
|
|
|
if (fix_problem(ctx, PR_0_BB_UNINIT_LAST, &pctx)) {
|
|
|
|
ext2fs_bg_flags_clear(fs, i, EXT2_BG_BLOCK_UNINIT);
|
|
|
|
should_be = 1;
|
|
|
|
}
|
|
|
|
ext2fs_unmark_valid(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (csum_flag &&
|
|
|
|
(ext2fs_bg_itable_unused(fs, i) > ext2fs_bg_free_inodes_count(fs, i) ||
|
|
|
|
ext2fs_bg_itable_unused(fs, i) > sb->s_inodes_per_group)) {
|
|
|
|
pctx.blk = ext2fs_bg_itable_unused(fs, i);
|
|
|
|
if (fix_problem(ctx, PR_0_GDT_ITABLE_UNUSED, &pctx)) {
|
|
|
|
ext2fs_bg_itable_unused_set(fs, i, 0);
|
|
|
|
should_be = 1;
|
|
|
|
}
|
|
|
|
ext2fs_unmark_valid(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (should_be)
|
|
|
|
ext2fs_group_desc_csum_set(fs, i);
|
|
|
|
/* If the user aborts e2fsck by typing ^C, stop right away */
|
|
|
|
if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
ctx->free_blocks = EXT2FS_C2B(fs, free_blocks);
|
|
|
|
ctx->free_inodes = free_inodes;
|
|
|
|
|
|
|
|
if ((ext2fs_free_blocks_count(sb) > ext2fs_blocks_count(sb)) ||
|
|
|
|
(sb->s_free_inodes_count > sb->s_inodes_count))
|
|
|
|
ext2fs_unmark_valid(fs);
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we have invalid bitmaps, set the error state of the
|
|
|
|
* filesystem.
|
|
|
|
*/
|
|
|
|
if (ctx->invalid_bitmaps && !(ctx->options & E2F_OPT_READONLY)) {
|
|
|
|
sb->s_state &= ~EXT2_VALID_FS;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
clear_problem_context(&pctx);
|
|
|
|
|
|
|
|
#ifndef EXT2_SKIP_UUID
|
|
|
|
/*
|
|
|
|
* If the UUID field isn't assigned, assign it.
|
|
|
|
* Skip if checksums are enabled and the filesystem is mounted,
|
|
|
|
* if the id changes under the kernel remounting rw may fail.
|
|
|
|
*/
|
|
|
|
if (!(ctx->options & E2F_OPT_READONLY) && uuid_is_null(sb->s_uuid) &&
|
|
|
|
!ext2fs_has_feature_metadata_csum(ctx->fs->super) &&
|
|
|
|
(!csum_flag || !(ctx->mount_flags & EXT2_MF_MOUNTED))) {
|
|
|
|
if (fix_problem(ctx, PR_0_ADD_UUID, &pctx)) {
|
|
|
|
uuid_generate(sb->s_uuid);
|
|
|
|
ext2fs_init_csum_seed(fs);
|
|
|
|
fs->flags |= EXT2_FLAG_DIRTY;
|
|
|
|
fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check to see if we should disable the test_fs flag
|
|
|
|
*/
|
|
|
|
profile_get_boolean(ctx->profile, "options",
|
|
|
|
"clear_test_fs_flag", 0, 1,
|
|
|
|
&clear_test_fs_flag);
|
|
|
|
if (!(ctx->options & E2F_OPT_READONLY) &&
|
|
|
|
clear_test_fs_flag &&
|
|
|
|
(fs->super->s_flags & EXT2_FLAGS_TEST_FILESYS) &&
|
|
|
|
(fs_proc_check("ext4") || check_for_modules("ext4"))) {
|
|
|
|
if (fix_problem(ctx, PR_0_CLEAR_TESTFS_FLAG, &pctx)) {
|
|
|
|
fs->super->s_flags &= ~EXT2_FLAGS_TEST_FILESYS;
|
|
|
|
fs->flags |= EXT2_FLAG_DIRTY;
|
|
|
|
fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For the Hurd, check to see if the filetype option is set,
|
|
|
|
* since it doesn't support it.
|
|
|
|
*/
|
|
|
|
if (!(ctx->options & E2F_OPT_READONLY) &&
|
|
|
|
fs->super->s_creator_os == EXT2_OS_HURD &&
|
|
|
|
ext2fs_has_feature_filetype(fs->super)) {
|
|
|
|
if (fix_problem(ctx, PR_0_HURD_CLEAR_FILETYPE, &pctx)) {
|
|
|
|
ext2fs_clear_feature_filetype(fs->super);
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we have any of the compatibility flags set, we need to have a
|
|
|
|
* revision 1 filesystem. Most kernels will not check the flags on
|
|
|
|
* a rev 0 filesystem and we may have corruption issues because of
|
|
|
|
* the incompatible changes to the filesystem.
|
|
|
|
*/
|
|
|
|
if (!(ctx->options & E2F_OPT_READONLY) &&
|
|
|
|
fs->super->s_rev_level == EXT2_GOOD_OLD_REV &&
|
|
|
|
(fs->super->s_feature_compat ||
|
|
|
|
fs->super->s_feature_ro_compat ||
|
|
|
|
fs->super->s_feature_incompat) &&
|
|
|
|
fix_problem(ctx, PR_0_FS_REV_LEVEL, &pctx)) {
|
|
|
|
ext2fs_update_dynamic_rev(fs);
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clean up any orphan inodes, if present.
|
|
|
|
*/
|
|
|
|
if (!(ctx->options & E2F_OPT_READONLY) && release_orphan_inodes(ctx)) {
|
|
|
|
fs->super->s_state &= ~EXT2_VALID_FS;
|
|
|
|
ext2fs_mark_super_dirty(fs);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unfortunately, due to Windows' unfortunate design decision
|
|
|
|
* to configure the hardware clock to tick localtime, instead
|
|
|
|
* of the more proper and less error-prone UTC time, many
|
|
|
|
* users end up in the situation where the system clock is
|
|
|
|
* incorrectly set at the time when e2fsck is run.
|
|
|
|
*
|
|
|
|
* Historically this was usually due to some distributions
|
|
|
|
* having buggy init scripts and/or installers that didn't
|
|
|
|
* correctly detect this case and take appropriate
|
|
|
|
* countermeasures. However, it's still possible, despite the
|
|
|
|
* best efforts of init script and installer authors to not be
|
|
|
|
* able to detect this misconfiguration, usually due to a
|
|
|
|
* buggy or misconfigured virtualization manager or the
|
|
|
|
* installer not having access to a network time server during
|
|
|
|
* the installation process. So by default, we allow the
|
|
|
|
* superblock times to be fudged by up to 24 hours. This can
|
|
|
|
* be disabled by setting options.accept_time_fudge to the
|
|
|
|
* boolean value of false in e2fsck.conf. We also support
|
|
|
|
* options.buggy_init_scripts for backwards compatibility.
|
|
|
|
*/
|
|
|
|
profile_get_boolean(ctx->profile, "options", "accept_time_fudge",
|
|
|
|
0, 1, &accept_time_fudge);
|
|
|
|
profile_get_boolean(ctx->profile, "options", "buggy_init_scripts",
|
|
|
|
0, accept_time_fudge, &accept_time_fudge);
|
|
|
|
ctx->time_fudge = accept_time_fudge ? 86400 : 0;
|
|
|
|
|
|
|
|
profile_get_boolean(ctx->profile, "options", "broken_system_clock",
|
|
|
|
0, 0, &broken_system_clock);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check to see if the superblock last mount time or last
|
|
|
|
* write time is in the future.
|
|
|
|
*/
|
2024-03-26 10:09:11 +08:00
|
|
|
if (((ctx->options & E2F_OPT_FORCE) || fs->super->s_checkinterval) &&
|
|
|
|
!broken_system_clock && !(ctx->flags & E2F_FLAG_TIME_INSANE) &&
|
|
|
|
(fs->super->s_mtime > (__u32) ctx->now)) {
|
2022-05-13 20:16:34 +08:00
|
|
|
pctx.num = fs->super->s_mtime;
|
|
|
|
problem = PR_0_FUTURE_SB_LAST_MOUNT;
|
|
|
|
if (fs->super->s_mtime <= (__u32) ctx->now + ctx->time_fudge)
|
|
|
|
problem = PR_0_FUTURE_SB_LAST_MOUNT_FUDGED;
|
|
|
|
if (fix_problem(ctx, problem, &pctx)) {
|
|
|
|
fs->super->s_mtime = ctx->now;
|
|
|
|
fs->flags |= EXT2_FLAG_DIRTY;
|
|
|
|
}
|
|
|
|
}
|
2024-03-26 10:09:11 +08:00
|
|
|
if (((ctx->options & E2F_OPT_FORCE) || fs->super->s_checkinterval) &&
|
|
|
|
!broken_system_clock && !(ctx->flags & E2F_FLAG_TIME_INSANE) &&
|
|
|
|
(fs->super->s_wtime > (__u32) ctx->now)) {
|
2022-05-13 20:16:34 +08:00
|
|
|
pctx.num = fs->super->s_wtime;
|
|
|
|
problem = PR_0_FUTURE_SB_LAST_WRITE;
|
|
|
|
if (fs->super->s_wtime <= (__u32) ctx->now + ctx->time_fudge)
|
|
|
|
problem = PR_0_FUTURE_SB_LAST_WRITE_FUDGED;
|
|
|
|
if (fix_problem(ctx, problem, &pctx)) {
|
|
|
|
fs->super->s_wtime = ctx->now;
|
|
|
|
fs->flags |= EXT2_FLAG_DIRTY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
e2fsck_validate_quota_inodes(ctx);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Move the ext3 journal file, if necessary.
|
|
|
|
*/
|
|
|
|
e2fsck_move_ext3_journal(ctx);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fix journal hint, if necessary
|
|
|
|
*/
|
|
|
|
e2fsck_fix_ext3_journal_hint(ctx);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add dirhash hint if necessary
|
|
|
|
*/
|
|
|
|
e2fsck_fix_dirhash_hint(ctx);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Hide quota inodes if necessary.
|
|
|
|
*/
|
|
|
|
e2fsck_hide_quota(ctx);
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check to see if we should backup the master sb to the backup super
|
|
|
|
* blocks. Returns non-zero if the sb should be backed up.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* A few flags are set on the fly by the kernel, but only in the
|
|
|
|
* primary superblock. This is actually a bad thing, and we should
|
|
|
|
* try to discourage it in the future. In particular, for the newer
|
|
|
|
* ext4 files, especially EXT4_FEATURE_RO_COMPAT_DIR_NLINK and
|
|
|
|
* EXT3_FEATURE_INCOMPAT_EXTENTS. So some of these may go away in the
|
|
|
|
* future. EXT3_FEATURE_INCOMPAT_RECOVER may also get set when
|
|
|
|
* copying the primary superblock during online resize.
|
|
|
|
*
|
|
|
|
* The kernel will set EXT2_FEATURE_COMPAT_EXT_ATTR, but
|
|
|
|
* unfortunately, we shouldn't ignore it since if it's not set in the
|
|
|
|
* backup, the extended attributes in the filesystem will be stripped
|
|
|
|
* away.
|
|
|
|
*/
|
|
|
|
#define FEATURE_RO_COMPAT_IGNORE (EXT2_FEATURE_RO_COMPAT_LARGE_FILE| \
|
|
|
|
EXT4_FEATURE_RO_COMPAT_DIR_NLINK)
|
|
|
|
#define FEATURE_INCOMPAT_IGNORE (EXT3_FEATURE_INCOMPAT_EXTENTS| \
|
|
|
|
EXT3_FEATURE_INCOMPAT_RECOVER)
|
|
|
|
|
|
|
|
int check_backup_super_block(e2fsck_t ctx)
|
|
|
|
{
|
|
|
|
ext2_filsys fs = ctx->fs;
|
|
|
|
errcode_t retval;
|
|
|
|
dgrp_t g;
|
|
|
|
blk64_t sb;
|
|
|
|
int ret = 0;
|
|
|
|
char buf[SUPERBLOCK_SIZE];
|
|
|
|
struct ext2_super_block *backup_sb;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we are already writing out the backup blocks, then we
|
|
|
|
* don't need to test. Also, if the filesystem is invalid, or
|
|
|
|
* the check was aborted or cancelled, we also don't want to
|
|
|
|
* do the backup. If the filesystem was opened read-only then
|
|
|
|
* we can't do the backup.
|
|
|
|
*/
|
|
|
|
if (((fs->flags & EXT2_FLAG_MASTER_SB_ONLY) == 0) ||
|
|
|
|
!ext2fs_test_valid(fs) ||
|
|
|
|
(fs->super->s_state & EXT2_ERROR_FS) ||
|
|
|
|
(ctx->flags & (E2F_FLAG_ABORT | E2F_FLAG_CANCEL)) ||
|
|
|
|
(ctx->options & E2F_OPT_READONLY))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
for (g = 1; g < fs->group_desc_count; g++) {
|
|
|
|
if (!ext2fs_bg_has_super(fs, g))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
sb = ext2fs_group_first_block2(fs, g);
|
|
|
|
|
|
|
|
retval = io_channel_read_blk(fs->io, sb, -SUPERBLOCK_SIZE,
|
|
|
|
buf);
|
|
|
|
if (retval)
|
|
|
|
continue;
|
|
|
|
backup_sb = (struct ext2_super_block *) buf;
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
|
|
ext2fs_swap_super(backup_sb);
|
|
|
|
#endif
|
|
|
|
if ((backup_sb->s_magic != EXT2_SUPER_MAGIC) ||
|
|
|
|
(backup_sb->s_rev_level > EXT2_LIB_CURRENT_REV) ||
|
|
|
|
((backup_sb->s_log_block_size + EXT2_MIN_BLOCK_LOG_SIZE) >
|
|
|
|
EXT2_MAX_BLOCK_LOG_SIZE) ||
|
|
|
|
(EXT2_INODE_SIZE(backup_sb) < EXT2_GOOD_OLD_INODE_SIZE))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
#define SUPER_INCOMPAT_DIFFERENT(x) \
|
|
|
|
((fs->super->x & ~FEATURE_INCOMPAT_IGNORE) != \
|
|
|
|
(backup_sb->x & ~FEATURE_INCOMPAT_IGNORE))
|
|
|
|
#define SUPER_RO_COMPAT_DIFFERENT(x) \
|
|
|
|
((fs->super->x & ~FEATURE_RO_COMPAT_IGNORE) != \
|
|
|
|
(backup_sb->x & ~FEATURE_RO_COMPAT_IGNORE))
|
|
|
|
#define SUPER_DIFFERENT(x) \
|
|
|
|
(fs->super->x != backup_sb->x)
|
|
|
|
|
|
|
|
if (SUPER_DIFFERENT(s_feature_compat) ||
|
|
|
|
SUPER_INCOMPAT_DIFFERENT(s_feature_incompat) ||
|
|
|
|
SUPER_RO_COMPAT_DIFFERENT(s_feature_ro_compat) ||
|
|
|
|
SUPER_DIFFERENT(s_blocks_count) ||
|
|
|
|
SUPER_DIFFERENT(s_blocks_count_hi) ||
|
|
|
|
SUPER_DIFFERENT(s_inodes_count) ||
|
|
|
|
memcmp(fs->super->s_uuid, backup_sb->s_uuid,
|
|
|
|
sizeof(fs->super->s_uuid)))
|
|
|
|
ret = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|