401 lines
13 KiB
C
401 lines
13 KiB
C
/* $NetBSD: fsck.h,v 1.55 2020/04/18 12:54:38 jdolecek Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1980, 1986, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
*
|
|
* This software was developed for the FreeBSD Project by Marshall
|
|
* Kirk McKusick and Network Associates Laboratories, the Security
|
|
* Research Division of Network Associates, Inc. under DARPA/SPAWAR
|
|
* contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
|
|
* research program
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)fsck.h 8.4 (Berkeley) 5/9/95
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <sys/queue.h>
|
|
#include <machine/bswap.h>
|
|
|
|
#ifdef PROGRESS
|
|
#include "progress.h"
|
|
#endif /* PROGRESS */
|
|
|
|
#define MAXDUP 10 /* limit on dup blks (per inode) */
|
|
#define MAXBAD 10 /* limit on bad blks (per inode) */
|
|
#define MAXBUFSPACE 40*1024 /* maximum space to allocate to buffers */
|
|
#define INOBUFSIZE 56*1024 /* size of buffer to read inodes in pass1 */
|
|
|
|
union dinode {
|
|
struct ufs1_dinode dp1;
|
|
struct ufs2_dinode dp2;
|
|
};
|
|
#define DIP(dp, field) \
|
|
(is_ufs2 ? (dp)->dp2.di_##field : (dp)->dp1.di_##field)
|
|
|
|
#define DIP_SET(dp, field, val) do { \
|
|
if (is_ufs2) \
|
|
(dp)->dp2.di_##field = (val); \
|
|
else \
|
|
(dp)->dp1.di_##field = (val); \
|
|
} while (0)
|
|
|
|
#ifndef BUFSIZ
|
|
#define BUFSIZ 1024
|
|
#endif
|
|
|
|
/*
|
|
* Each inode on the filesystem is described by the following structure.
|
|
* The linkcnt is initially set to the value in the inode. Each time it
|
|
* is found during the descent in passes 2, 3, and 4 the count is
|
|
* decremented. Any inodes whose count is non-zero after pass 4 needs to
|
|
* have its link count adjusted by the value remaining in ino_linkcnt.
|
|
*/
|
|
struct inostat {
|
|
char ino_state; /* state of inode, see below */
|
|
char ino_type; /* type of inode */
|
|
short ino_linkcnt; /* number of links not found */
|
|
};
|
|
/*
|
|
* Inode states.
|
|
*/
|
|
#define USTATE 01 /* inode not allocated */
|
|
#define FSTATE 02 /* inode is file */
|
|
#define DSTATE 03 /* inode is directory */
|
|
#define DFOUND 04 /* directory found during descent */
|
|
#define DCLEAR 05 /* directory is to be cleared */
|
|
#define FCLEAR 06 /* file is to be cleared */
|
|
#define DMARK 07 /* used in propagate()'s traversal algorithm */
|
|
|
|
/*
|
|
* Inode state information is contained on per cylinder group lists
|
|
* which are described by the following structure.
|
|
*/
|
|
extern struct inostatlist {
|
|
long il_numalloced; /* number of inodes allocated in this cg */
|
|
struct inostat *il_stat;/* inostat info for this cylinder group */
|
|
} *inostathead;
|
|
|
|
|
|
/*
|
|
* buffer cache structure.
|
|
*/
|
|
struct bufarea {
|
|
struct bufarea *b_next; /* free list queue */
|
|
struct bufarea *b_prev; /* free list queue */
|
|
daddr_t b_bno;
|
|
int b_size;
|
|
int b_errs;
|
|
int b_flags;
|
|
union {
|
|
char *b_buf; /* buffer space */
|
|
int32_t *b_indir1; /* indirect block */
|
|
int64_t *b_indir2; /* indirect block */
|
|
struct fs *b_fs; /* super block */
|
|
struct cg *b_cg; /* cylinder group */
|
|
struct ufs1_dinode *b_dinode1; /* UFS1 inode block */
|
|
struct ufs2_dinode *b_dinode2; /* UFS2 inode block */
|
|
#ifndef NO_APPLE_UFS
|
|
struct appleufslabel *b_appleufs; /* Apple UFS volume label */
|
|
#endif
|
|
} b_un;
|
|
char b_dirty;
|
|
};
|
|
|
|
#define IBLK(bp, i) \
|
|
(is_ufs2 ? (bp)->b_un.b_indir2[i] : (bp)->b_un.b_indir1[i])
|
|
|
|
#define IBLK_SET(bp, i, val) do { \
|
|
if (is_ufs2) \
|
|
(bp)->b_un.b_indir2[i] = (val); \
|
|
else \
|
|
(bp)->b_un.b_indir1[i] = (val); \
|
|
} while (0)
|
|
|
|
#define B_INUSE 1
|
|
|
|
#define MINBUFS 5 /* minimum number of buffers required */
|
|
extern struct bufarea bufhead; /* head of list of other blks in filesys */
|
|
extern struct bufarea sblk; /* file system superblock */
|
|
extern struct bufarea asblk; /* file system superblock */
|
|
extern struct bufarea cgblk; /* cylinder group blocks */
|
|
#ifndef NO_APPLE_UFS
|
|
extern struct bufarea appleufsblk; /* Apple UFS volume label */
|
|
#endif
|
|
extern struct bufarea *pdirbp; /* current directory contents */
|
|
extern struct bufarea *pbp; /* current inode block */
|
|
|
|
#define dirty(bp) (bp)->b_dirty = 1
|
|
#define initbarea(bp) \
|
|
(bp)->b_dirty = 0; \
|
|
(bp)->b_bno = (daddr_t)-1; \
|
|
(bp)->b_flags = 0;
|
|
|
|
extern struct fs *sblock;
|
|
extern struct fs *altsblock;
|
|
extern struct cg *cgrp;
|
|
extern struct fs *sblocksave;
|
|
#define sbdirty() \
|
|
do { \
|
|
memmove(sblk.b_un.b_fs, sblock, SBLOCKSIZE); \
|
|
sb_oldfscompat_write(sblk.b_un.b_fs, sblocksave); \
|
|
if (needswap) \
|
|
ffs_sb_swap(sblk.b_un.b_fs, sblk.b_un.b_fs); \
|
|
sblk.b_dirty = 1; \
|
|
} while (0)
|
|
#define cgdirty() do {copyback_cg(&cgblk); cgblk.b_dirty = 1;} while (0)
|
|
|
|
#define appleufsdirty() \
|
|
do { \
|
|
appleufsblk.b_un.b_appleufs->ul_checksum = 0; \
|
|
appleufsblk.b_un.b_appleufs->ul_checksum = \
|
|
ffs_appleufs_cksum(appleufsblk.b_un.b_appleufs); \
|
|
appleufsblk.b_dirty = 1; \
|
|
} while (0)
|
|
|
|
enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE};
|
|
|
|
struct inodesc {
|
|
enum fixstate id_fix; /* policy on fixing errors */
|
|
int (*id_func) /* function to be applied to blocks of inode */
|
|
(struct inodesc *);
|
|
ino_t id_number; /* inode number described */
|
|
ino_t id_parent; /* for DATA nodes, their parent */
|
|
daddr_t id_blkno; /* current block number being examined */
|
|
int id_numfrags; /* number of frags contained in block */
|
|
int64_t id_filesize; /* for DATA nodes, the size of the directory */
|
|
int id_loc; /* for DATA nodes, current location in dir */
|
|
int64_t id_entryno; /* for DATA nodes, current entry number */
|
|
struct direct *id_dirp; /* for DATA nodes, ptr to current entry */
|
|
const char *id_name; /* for DATA nodes, name to find or enter */
|
|
char id_type; /* type of descriptor, DATA or ADDR */
|
|
uid_t id_uid; /* ownerchip of inode described */
|
|
gid_t id_gid;
|
|
};
|
|
/* file types */
|
|
#define DATA 1
|
|
#define SNAP 2
|
|
#define ADDR 3
|
|
|
|
/*
|
|
* Linked list of duplicate blocks.
|
|
*
|
|
* The list is composed of two parts. The first part of the
|
|
* list (from duplist through the node pointed to by muldup)
|
|
* contains a single copy of each duplicate block that has been
|
|
* found. The second part of the list (from muldup to the end)
|
|
* contains duplicate blocks that have been found more than once.
|
|
* To check if a block has been found as a duplicate it is only
|
|
* necessary to search from duplist through muldup. To find the
|
|
* total number of times that a block has been found as a duplicate
|
|
* the entire list must be searched for occurrences of the block
|
|
* in question. The following diagram shows a sample list where
|
|
* w (found twice), x (found once), y (found three times), and z
|
|
* (found once) are duplicate block numbers:
|
|
*
|
|
* w -> y -> x -> z -> y -> w -> y
|
|
* ^ ^
|
|
* | |
|
|
* duplist muldup
|
|
*/
|
|
struct dups {
|
|
struct dups *next;
|
|
daddr_t dup;
|
|
};
|
|
extern struct dups *duplist; /* head of dup list */
|
|
extern struct dups *muldup; /* end of unique duplicate dup block numbers */
|
|
|
|
/*
|
|
* Linked list of inodes with zero link counts.
|
|
*/
|
|
struct zlncnt {
|
|
struct zlncnt *next;
|
|
ino_t zlncnt;
|
|
};
|
|
extern struct zlncnt *zlnhead; /* head of zero link count list */
|
|
|
|
/*
|
|
* Inode cache data structures.
|
|
*/
|
|
extern struct inoinfo {
|
|
struct inoinfo *i_nexthash; /* next entry in hash chain */
|
|
struct inoinfo *i_child, *i_sibling;
|
|
ino_t i_number; /* inode number of this entry */
|
|
ino_t i_parent; /* inode number of parent */
|
|
ino_t i_dotdot; /* inode number of `..' */
|
|
size_t i_isize; /* size of inode */
|
|
u_int i_numblks; /* size of block array in bytes */
|
|
int64_t i_blks[1]; /* actually longer */
|
|
} **inphead, **inpsort;
|
|
extern long numdirs, dirhash, listmax, inplast;
|
|
|
|
/*
|
|
* quota usage structures
|
|
*/
|
|
struct uquot {
|
|
uint64_t uq_b; /* block usage */
|
|
uint64_t uq_i; /* inode usage */
|
|
SLIST_ENTRY(uquot) uq_entries;
|
|
uint32_t uq_uid; /* uid/gid of the owner */
|
|
};
|
|
SLIST_HEAD(uquot_hash, uquot);
|
|
extern struct uquot_hash *uquot_user_hash;
|
|
extern struct uquot_hash *uquot_group_hash;
|
|
extern uint8_t q2h_hash_shift;
|
|
extern uint16_t q2h_hash_mask;
|
|
|
|
extern long dev_bsize; /* computed value of DEV_BSIZE */
|
|
extern long secsize; /* actual disk sector size */
|
|
extern char nflag; /* assume a no response */
|
|
extern char yflag; /* assume a yes response */
|
|
extern int Uflag; /* resolve user names */
|
|
extern int bflag; /* location of alternate super block */
|
|
extern int debug; /* output debugging info */
|
|
extern int zflag; /* zero unused directory space */
|
|
extern int cvtlevel; /* convert to newer file system format */
|
|
extern int doinglevel1; /* converting to new cylinder group format */
|
|
extern int doinglevel2; /* converting to new inode format */
|
|
extern int newinofmt; /* filesystem has new inode format */
|
|
extern char usedsoftdep; /* just fix soft dependency inconsistencies */
|
|
extern int preen; /* just fix normal inconsistencies */
|
|
extern int quiet; /* Don't print anything if clean */
|
|
extern int forceimage; /* file system is an image file */
|
|
extern int is_ufs2; /* we're dealing with an UFS2 filesystem */
|
|
extern int markclean; /* mark file system clean when done */
|
|
extern char havesb; /* superblock has been read */
|
|
extern char skipclean; /* skip clean file systems if preening */
|
|
extern int fsmodified; /* 1 => write done to file system */
|
|
extern int fsreadfd; /* file descriptor for reading file system */
|
|
extern int fswritefd; /* file descriptor for writing file system */
|
|
extern int rerun; /* rerun fsck. Only used in non-preen mode */
|
|
extern char resolved; /* cleared if unresolved changes => not clean */
|
|
|
|
#ifndef NO_FFS_EI
|
|
extern int endian; /* endian coversion */
|
|
extern int doswap; /* convert byte order */
|
|
extern int needswap; /* need to convert byte order in memory */
|
|
extern int do_blkswap; /* need to do block addr byteswap */
|
|
extern int do_dirswap; /* need to do dir entry byteswap */
|
|
#else
|
|
/* Disable Endian-Independent FFS support for install media */
|
|
#define endian (0)
|
|
#define doswap (0)
|
|
#define needswap (0)
|
|
#define do_blkswap (0)
|
|
#define do_dirswap (0)
|
|
#define ffs_cg_swap(a, b, c) __nothing
|
|
#define ffs_csum_swap(a, b, c) __nothing
|
|
#define ffs_sb_swap(a, b) __nothing
|
|
#define swap_dinode1(a, b) __nothing
|
|
#define swap_dinode2(a, b) __nothing
|
|
#endif
|
|
|
|
#ifndef NO_APPLE_UFS
|
|
extern int isappleufs; /* filesystem is Apple UFS */
|
|
#else
|
|
/* Disable Apple UFS support for install media */
|
|
#define isappleufs (0)
|
|
#endif
|
|
|
|
extern daddr_t maxfsblock; /* number of blocks in the file system */
|
|
extern char *blockmap; /* ptr to primary blk allocation map */
|
|
extern ino_t maxino; /* number of inodes in file system */
|
|
|
|
extern int dirblksiz;
|
|
|
|
extern ino_t lfdir; /* lost & found directory inode number */
|
|
extern const char *lfname; /* lost & found directory name */
|
|
extern int lfmode; /* lost & found directory creation mode */
|
|
|
|
extern daddr_t n_blks; /* number of blocks in use */
|
|
extern ino_t n_files; /* number of files in use */
|
|
|
|
extern long countdirs;
|
|
|
|
extern int got_siginfo; /* received a SIGINFO */
|
|
|
|
#define clearinode(dp) \
|
|
do { \
|
|
if (is_ufs2) \
|
|
(dp)->dp2 = ufs2_zino; \
|
|
else \
|
|
(dp)->dp1 = ufs1_zino; \
|
|
} while (0)
|
|
|
|
extern struct ufs1_dinode ufs1_zino;
|
|
extern struct ufs2_dinode ufs2_zino;
|
|
|
|
#define setbmap(blkno) setbit(blockmap, blkno)
|
|
#define testbmap(blkno) isset(blockmap, blkno)
|
|
#define clrbmap(blkno) clrbit(blockmap, blkno)
|
|
|
|
#define STOP 0x01
|
|
#define SKIP 0x02
|
|
#define KEEPON 0x04
|
|
#define ALTERED 0x08
|
|
#define FOUND 0x10
|
|
|
|
#ifndef NO_FFS_EI
|
|
/* some inline functs to help the byte-swapping mess */
|
|
static inline u_int16_t iswap16 (u_int16_t);
|
|
static inline u_int32_t iswap32 (u_int32_t);
|
|
static inline u_int64_t iswap64 (u_int64_t);
|
|
|
|
static inline u_int16_t
|
|
iswap16(u_int16_t x)
|
|
{
|
|
if (needswap)
|
|
return bswap16(x);
|
|
else return x;
|
|
}
|
|
|
|
static inline u_int32_t
|
|
iswap32(u_int32_t x)
|
|
{
|
|
if (needswap)
|
|
return bswap32(x);
|
|
else return x;
|
|
}
|
|
|
|
static inline u_int64_t
|
|
iswap64(u_int64_t x)
|
|
{
|
|
if (needswap)
|
|
return bswap64(x);
|
|
else return x;
|
|
}
|
|
#else
|
|
#define iswap16(x) (x)
|
|
#define iswap32(x) (x)
|
|
#define iswap64(x) (x)
|
|
#endif /* NO_FFS_EI */
|
|
|
|
#ifdef NO_IOBUF_ALIGNED
|
|
#define aligned_alloc(align, size) malloc((size))
|
|
#endif
|