* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
* @(#)fsck.h 5.4 (Berkeley) %G%
#define MAXDUP 10 /* limit on dup blks (per inode) */
#define MAXBAD 10 /* limit on bad blks (per inode) */
typedef int (*SIG_TYP
)();
#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 */
typedef struct dinode DINODE
;
typedef struct direct DIRECT
;
#define ALLOC(dip) (((dip)->di_mode & IFMT) != 0)
#define DIRCT(dip) (((dip)->di_mode & IFMT) == IFDIR)
(((dip)->di_mode & IFMT) == IFBLK || ((dip)->di_mode & IFMT) == IFCHR)
#define MAXNINDIR (MAXBSIZE / sizeof (daddr_t))
#define MAXINOPB (MAXBSIZE / sizeof (struct dinode))
#define SPERB (MAXBSIZE / sizeof(short))
struct bufarea
*b_next
; /* must be first */
char b_buf
[MAXBSIZE
]; /* buffer space */
short b_lnks
[SPERB
]; /* link counts */
daddr_t b_indir
[MAXNINDIR
]; /* indirect block */
struct fs b_fs
; /* super block */
struct cg b_cg
; /* cylinder group */
struct dinode b_dinode
[MAXINOPB
]; /* inode block */
typedef struct bufarea BUFAREA
;
BUFAREA inoblk
; /* inode blocks */
BUFAREA fileblk
; /* other blks in filesys */
BUFAREA sblk
; /* file system superblock */
BUFAREA cgblk
; /* cylinder group blocks */
#define initbarea(x) (x)->b_dirty = 0;(x)->b_bno = (daddr_t)-1
#define dirty(x) (x)->b_dirty = 1
#define inodirty() inoblk.b_dirty = 1
#define sbdirty() sblk.b_dirty = 1
#define cgdirty() cgblk.b_dirty = 1
#define dirblk fileblk.b_un
#define sblock sblk.b_un.b_fs
#define cgrp cgblk.b_un.b_cg
} dfile
; /* file descriptors for filesys */
enum fixstate
{DONTKNOW
, NOFIX
, FIX
};
enum fixstate id_fix
; /* policy on fixing errors */
int (*id_func
)(); /* function to be applied to blocks of inode */
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 */
long id_filesize
; /* for DATA nodes, the size of the directory */
int id_loc
; /* for DATA nodes, current location in dir */
int id_entryno
; /* for DATA nodes, current entry number */
DIRECT
*id_dirp
; /* for DATA nodes, ptr to current entry */
char *id_name
; /* for DATA nodes, name to find or enter */
char id_type
; /* type of descriptor, DATA or ADDR */
* 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 occurences 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
struct dups
*duplist
; /* head of dup list */
struct dups
*muldup
; /* end of unique duplicate dup block numbers */
* Linked list of inodes with zero link counts.
struct zlncnt
*zlnhead
; /* head of zero link count list */
long dev_bsize
; /* computed value of DEV_BSIZE */
long secsize
; /* actual disk sector size */
char nflag
; /* assume a no response */
char yflag
; /* assume a yes response */
int bflag
; /* location of alternate super block */
int debug
; /* output debugging info */
char preen
; /* just fix normal inconsistencies */
char hotroot
; /* checking root device */
char *blockmap
; /* ptr to primary blk allocation map */
char *statemap
; /* ptr to inode state table */
short *lncntp
; /* ptr to link count table */
char pathname
[BUFSIZ
]; /* current pathname */
char *pathp
; /* pointer to pathname position */
daddr_t fmax
; /* number of blocks in the volume */
ino_t imax
; /* number of inodes */
ino_t lastino
; /* hiwater mark of inodes */
ino_t lfdir
; /* lost & found directory inode number */
char *lfname
; /* lost & found directory name */
off_t maxblk
; /* largest logical blk in file */
off_t bmapsz
; /* num chars in blockmap */
daddr_t n_blks
; /* number of blocks used */
daddr_t n_files
; /* number of files seen */
#define zapino(x) (*(x) = zino)
#define setbmap(x) setbit(blockmap, x)
#define getbmap(x) isset(blockmap, x)
#define clrbmap(x) clrbit(blockmap, x)