fsck.h revision 18808
1/* 2 * Copyright (c) 1980, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)fsck.h 8.1 (Berkeley) 6/5/93 34 */ 35 36#define MAXDUP 10 /* limit on dup blks (per inode) */ 37#define MAXBAD 10 /* limit on bad blks (per inode) */ 38#define MAXBUFSPACE 40*1024 /* maximum space to allocate to buffers */ 39#define INOBUFSIZE 56*1024 /* size of buffer to read inodes in pass1 */ 40 41#ifndef BUFSIZ 42#define BUFSIZ 1024 43#endif 44 45#define USTATE 01 /* inode not allocated */ 46#define FSTATE 02 /* inode is file */ 47#define DSTATE 03 /* inode is directory */ 48#define DFOUND 04 /* directory found during descent */ 49#define DCLEAR 05 /* directory is to be cleared */ 50#define FCLEAR 06 /* file is to be cleared */ 51 52/* 53 * buffer cache structure. 54 */ 55struct bufarea { 56 struct bufarea *b_next; /* free list queue */ 57 struct bufarea *b_prev; /* free list queue */ 58 daddr_t b_bno; 59 int b_size; 60 int b_errs; 61 int b_flags; 62 union { 63 char *b_buf; /* buffer space */ 64 daddr_t *b_indir; /* indirect block */ 65 struct fs *b_fs; /* super block */ 66 struct cg *b_cg; /* cylinder group */ 67 struct dinode *b_dinode; /* inode block */ 68 } b_un; 69 char b_dirty; 70}; 71 72#define B_INUSE 1 73 74#define MINBUFS 5 /* minimum number of buffers required */ 75struct bufarea bufhead; /* head of list of other blks in filesys */ 76struct bufarea sblk; /* file system superblock */ 77struct bufarea cgblk; /* cylinder group blocks */ 78struct bufarea *pdirbp; /* current directory contents */ 79struct bufarea *pbp; /* current inode block */ 80struct bufarea *getdatablk(); 81 82#define dirty(bp) (bp)->b_dirty = 1 83#define initbarea(bp) \ 84 (bp)->b_dirty = 0; \ 85 (bp)->b_bno = (daddr_t)-1; \ 86 (bp)->b_flags = 0; 87 88#define sbdirty() sblk.b_dirty = 1 89#define cgdirty() cgblk.b_dirty = 1 90#define sblock (*sblk.b_un.b_fs) 91#define cgrp (*cgblk.b_un.b_cg) 92 93enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE}; 94 95struct inodesc { 96 enum fixstate id_fix; /* policy on fixing errors */ 97 int (*id_func)(); /* function to be applied to blocks of inode */ 98 ino_t id_number; /* inode number described */ 99 ino_t id_parent; /* for DATA nodes, their parent */ 100 daddr_t id_blkno; /* current block number being examined */ 101 int id_numfrags; /* number of frags contained in block */ 102 quad_t id_filesize; /* for DATA nodes, the size of the directory */ 103 int id_loc; /* for DATA nodes, current location in dir */ 104 int id_entryno; /* for DATA nodes, current entry number */ 105 struct direct *id_dirp; /* for DATA nodes, ptr to current entry */ 106 char *id_name; /* for DATA nodes, name to find or enter */ 107 char id_type; /* type of descriptor, DATA or ADDR */ 108}; 109/* file types */ 110#define DATA 1 111#define ADDR 2 112 113/* 114 * Linked list of duplicate blocks. 115 * 116 * The list is composed of two parts. The first part of the 117 * list (from duplist through the node pointed to by muldup) 118 * contains a single copy of each duplicate block that has been 119 * found. The second part of the list (from muldup to the end) 120 * contains duplicate blocks that have been found more than once. 121 * To check if a block has been found as a duplicate it is only 122 * necessary to search from duplist through muldup. To find the 123 * total number of times that a block has been found as a duplicate 124 * the entire list must be searched for occurences of the block 125 * in question. The following diagram shows a sample list where 126 * w (found twice), x (found once), y (found three times), and z 127 * (found once) are duplicate block numbers: 128 * 129 * w -> y -> x -> z -> y -> w -> y 130 * ^ ^ 131 * | | 132 * duplist muldup 133 */ 134struct dups { 135 struct dups *next; 136 daddr_t dup; 137}; 138struct dups *duplist; /* head of dup list */ 139struct dups *muldup; /* end of unique duplicate dup block numbers */ 140 141/* 142 * Linked list of inodes with zero link counts. 143 */ 144struct zlncnt { 145 struct zlncnt *next; 146 ino_t zlncnt; 147}; 148struct zlncnt *zlnhead; /* head of zero link count list */ 149 150/* 151 * Inode cache data structures. 152 */ 153struct inoinfo { 154 struct inoinfo *i_nexthash; /* next entry in hash chain */ 155 ino_t i_number; /* inode number of this entry */ 156 ino_t i_parent; /* inode number of parent */ 157 ino_t i_dotdot; /* inode number of `..' */ 158 size_t i_isize; /* size of inode */ 159 u_int i_numblks; /* size of block array in bytes */ 160 daddr_t i_blks[1]; /* actually longer */ 161} **inphead, **inpsort; 162long numdirs, listmax, inplast; 163 164char *cdevname; /* name of device being checked */ 165long dev_bsize; /* computed value of DEV_BSIZE */ 166long secsize; /* actual disk sector size */ 167char fflag; /* force fs check (ignore clean flag) */ 168char nflag; /* assume a no response */ 169char yflag; /* assume a yes response */ 170int bflag; /* location of alternate super block */ 171int debug; /* output debugging info */ 172int cvtlevel; /* convert to newer file system format */ 173int doinglevel1; /* converting to new cylinder group format */ 174int doinglevel2; /* converting to new inode format */ 175int newinofmt; /* filesystem has new inode format */ 176char preen; /* just fix normal inconsistencies */ 177char hotroot; /* checking root device */ 178char havesb; /* superblock has been read */ 179int fsmodified; /* 1 => write done to file system */ 180int fsreadfd; /* file descriptor for reading file system */ 181int fswritefd; /* file descriptor for writing file system */ 182int returntosingle; /* return to single user mode */ 183int rerun; /* rerun fsck. Only used in non-preen mode */ 184 185daddr_t maxfsblock; /* number of blocks in the file system */ 186char *blockmap; /* ptr to primary blk allocation map */ 187ino_t maxino; /* number of inodes in file system */ 188ino_t lastino; /* last inode in use */ 189char *statemap; /* ptr to inode state table */ 190unsigned char *typemap; /* ptr to inode type table */ 191short *lncntp; /* ptr to link count table */ 192 193ino_t lfdir; /* lost & found directory inode number */ 194char *lfname; /* lost & found directory name */ 195int lfmode; /* lost & found directory creation mode */ 196 197daddr_t n_blks; /* number of blocks in use */ 198daddr_t n_files; /* number of files in use */ 199 200#define clearinode(dp) (*(dp) = zino) 201struct dinode zino; 202 203#define setbmap(blkno) setbit(blockmap, blkno) 204#define testbmap(blkno) isset(blockmap, blkno) 205#define clrbmap(blkno) clrbit(blockmap, blkno) 206 207#define STOP 0x01 208#define SKIP 0x02 209#define KEEPON 0x04 210#define ALTERED 0x08 211#define FOUND 0x10 212 213/* dir.c */ 214void adjust __P((struct inodesc *idesc, short lcnt)); 215ino_t allocdir __P((ino_t parent, ino_t request, int mode)); 216int changeino __P((ino_t dir, char *name, ino_t newnum)); 217void direrror __P((ino_t ino, char *errmesg)); 218int dirscan __P((struct inodesc *idesc)); 219void fileerror __P((ino_t cwd, ino_t ino, char *errmesg)); 220int linkup __P((ino_t orphan, ino_t parentdir)); 221int makeentry __P((ino_t parent, ino_t ino, char *name)); 222void propagate __P((void)); 223 224/* ffs_subr.c */ 225void ffs_fragacct __P((struct fs *fs, int fragmap, long *fraglist, int cnt)); 226 227/* inode.c */ 228ino_t allocino __P((ino_t request, int type)); 229void blkerror __P((ino_t ino, char *type, daddr_t blk)); 230void cacheino __P((struct dinode *dp, ino_t inumber)); 231int chkrange __P((daddr_t blk, int cnt)); 232int ckinode __P((struct dinode *dp, struct inodesc *idesc)); 233void clri __P((struct inodesc *idesc, char *type, int flag)); 234int findino __P((struct inodesc *idesc)); 235void freeino __P((ino_t ino)); 236void freeinodebuf __P((void)); 237struct dinode * ginode __P((ino_t inumber)); 238struct inoinfo * getinoinfo __P((ino_t inumber)); 239struct dinode * getnextinode __P((ino_t inumber)); 240void inodirty __P((void)); 241void inocleanup __P((void)); 242void pinode __P((ino_t ino)); 243void resetinodebuf __P((void)); 244int findname __P((struct inodesc *idesc)); 245 246/* pass1.c */ 247void pass1 __P((void)); 248int pass1check __P((struct inodesc *idesc)); 249 250/* pass1b.c */ 251void pass1b __P((void)); 252 253/* pass2.c */ 254void pass2 __P((void)); 255 256/* pass3.c */ 257void pass3 __P((void)); 258 259/* pass4.c */ 260void pass4 __P((void)); 261int pass4check __P((struct inodesc *idesc)); 262 263/* pass5.c */ 264void pass5 __P((void)); 265 266/* preen.c */ 267char *blockcheck __P((char *name)); 268int checkfstab __P((int preen, int maxrun,int (*docheck)(), int (*chkit)())); 269 270/* setup.c */ 271int setup __P((char *dev)); 272 273/* utilities.c */ 274int allocblk __P((long frags)); 275int bread __P((int fd, char *buf, daddr_t blk, long size)); 276void bufinit __P((void)); 277void bwrite __P((int fd, char *buf, daddr_t blk, long size)); 278void catch __P((int)); 279void catchquit __P((int)); 280void ckfini __P((void)); 281int dofix __P((struct inodesc *idesc, char *msg)); 282void errexit __P((const char *s1, ...)) __dead2; 283void flush __P((int fd, struct bufarea *bp)); 284void freeblk __P((daddr_t blkno, long frags)); 285int ftypeok __P((struct dinode *dp)); 286void getblk __P((struct bufarea *bp, daddr_t blk, long size)); 287struct bufarea * getdatablk __P((daddr_t blkno, long size)); 288void getpathname __P((char *namebuf, ino_t curdir, ino_t ino)); 289void panic __P((const char *, ...)) __dead2; 290void pfatal __P((const char *s1, ...)); 291void pwarn __P((const char *s1, ...)); 292int reply __P((char *question)); 293void voidquit __P((int)); 294