2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
33 * @(#)fsck.h 8.4 (Berkeley) 5/9/95
40 #define MAXDUP 10 /* limit on dup blks (per inode) */
41 #define MAXBAD 10 /* limit on bad blks (per inode) */
42 #define MAXBUFSPACE 40*1024 /* maximum space to allocate to buffers */
43 #define INOBUFSIZE 56*1024 /* size of buffer to read inodes in pass1 */
49 #define USTATE 01 /* inode not allocated */
50 #define FSTATE 02 /* inode is file */
51 #define DSTATE 03 /* inode is directory */
52 #define DFOUND 04 /* directory found during descent */
53 #define DCLEAR 05 /* directory is to be cleared */
54 #define FCLEAR 06 /* file is to be cleared */
57 * buffer cache structure.
60 struct bufarea *b_next; /* free list queue */
61 struct bufarea *b_prev; /* free list queue */
67 char *b_buf; /* buffer space */
68 ufs_daddr_t *b_indir; /* indirect block */
69 struct fs *b_fs; /* super block */
70 struct cg *b_cg; /* cylinder group */
71 struct dinode *b_dinode; /* inode block */
78 #define MINBUFS 5 /* minimum number of buffers required */
79 struct bufarea bufhead; /* head of list of other blks in filesys */
80 struct bufarea sblk; /* file system superblock */
81 struct bufarea cgblk; /* cylinder group blocks */
82 struct bufarea *pdirbp; /* current directory contents */
83 struct bufarea *pbp; /* current inode block */
85 #define dirty(bp) (bp)->b_dirty = 1
86 #define initbarea(bp) \
88 (bp)->b_bno = (ufs_daddr_t)-1; \
91 #define sbdirty() sblk.b_dirty = 1
92 #define cgdirty() cgblk.b_dirty = 1
93 #define sblock (*sblk.b_un.b_fs)
94 #define cgrp (*cgblk.b_un.b_cg)
96 enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE};
99 enum fixstate id_fix; /* policy on fixing errors */
100 int (*id_func)(); /* function to be applied to blocks of inode */
101 ino_t id_number; /* inode number described */
102 ino_t id_parent; /* for DATA nodes, their parent */
103 ufs_daddr_t id_blkno; /* current block number being examined */
104 int id_numfrags; /* number of frags contained in block */
105 quad_t id_filesize; /* for DATA nodes, the size of the directory */
106 int id_loc; /* for DATA nodes, current location in dir */
107 int id_entryno; /* for DATA nodes, current entry number */
108 struct direct *id_dirp; /* for DATA nodes, ptr to current entry */
109 char *id_name; /* for DATA nodes, name to find or enter */
110 char id_type; /* type of descriptor, DATA or ADDR */
117 * Linked list of duplicate blocks.
119 * The list is composed of two parts. The first part of the
120 * list (from duplist through the node pointed to by muldup)
121 * contains a single copy of each duplicate block that has been
122 * found. The second part of the list (from muldup to the end)
123 * contains duplicate blocks that have been found more than once.
124 * To check if a block has been found as a duplicate it is only
125 * necessary to search from duplist through muldup. To find the
126 * total number of times that a block has been found as a duplicate
127 * the entire list must be searched for occurences of the block
128 * in question. The following diagram shows a sample list where
129 * w (found twice), x (found once), y (found three times), and z
130 * (found once) are duplicate block numbers:
132 * w -> y -> x -> z -> y -> w -> y
141 struct dups *duplist; /* head of dup list */
142 struct dups *muldup; /* end of unique duplicate dup block numbers */
145 * Linked list of inodes with zero link counts.
151 struct zlncnt *zlnhead; /* head of zero link count list */
154 * Inode cache data structures.
157 struct inoinfo *i_nexthash; /* next entry in hash chain */
158 ino_t i_number; /* inode number of this entry */
159 ino_t i_parent; /* inode number of parent */
160 ino_t i_dotdot; /* inode number of `..' */
161 size_t i_isize; /* size of inode */
162 u_int i_numblks; /* size of block array in bytes */
163 ufs_daddr_t i_blks[1]; /* actually longer */
164 } **inphead, **inpsort;
165 long numdirs, listmax, inplast;
167 char *cdevname; /* name of device being checked */
168 long dev_bsize; /* computed value of DEV_BSIZE */
169 long secsize; /* actual disk sector size */
170 char fflag; /* force fs check (ignore clean flag) */
171 char nflag; /* assume a no response */
172 char yflag; /* assume a yes response */
173 int bflag; /* location of alternate super block */
174 int debug; /* output debugging info */
175 int cvtlevel; /* convert to newer file system format */
176 int doinglevel1; /* converting to new cylinder group format */
177 int doinglevel2; /* converting to new inode format */
178 int newinofmt; /* filesystem has new inode format */
179 char usedsoftdep; /* just fix soft dependency inconsistencies */
180 char resolved; /* cleared if unresolved changes => not clean */
181 char preen; /* just fix normal inconsistencies */
182 char hotroot; /* checking root device */
183 char havesb; /* superblock has been read */
184 int fsmodified; /* 1 => write done to file system */
185 int fsreadfd; /* file descriptor for reading file system */
186 int fswritefd; /* file descriptor for writing file system */
187 int returntosingle; /* return to single user mode */
188 int rerun; /* rerun fsck. Only used in non-preen mode */
190 ufs_daddr_t maxfsblock; /* number of blocks in the file system */
191 char *blockmap; /* ptr to primary blk allocation map */
192 ino_t maxino; /* number of inodes in file system */
193 ino_t lastino; /* last inode in use */
194 char *statemap; /* ptr to inode state table */
195 u_char *typemap; /* ptr to inode type table */
196 short *lncntp; /* ptr to link count table */
198 ino_t lfdir; /* lost & found directory inode number */
199 char *lfname; /* lost & found directory name */
200 int lfmode; /* lost & found directory creation mode */
202 ufs_daddr_t n_blks; /* number of blocks in use */
203 ufs_daddr_t n_files; /* number of files in use */
205 #define clearinode(dp) (*(dp) = zino)
208 #define setbmap(blkno) setbit(blockmap, blkno)
209 #define testbmap(blkno) isset(blockmap, blkno)
210 #define clrbmap(blkno) clrbit(blockmap, blkno)
218 #define EEXIT 8 /* Standard error exit. */
222 void adjust __P((struct inodesc *, int lcnt));
223 ufs_daddr_t allocblk __P((long frags));
224 ino_t allocdir __P((ino_t parent, ino_t request, int mode));
225 ino_t allocino __P((ino_t request, int type));
226 void blkerror __P((ino_t ino, char *type, ufs_daddr_t blk));
227 char *blockcheck __P((char *name));
228 int bread __P((int fd, char *buf, ufs_daddr_t blk, long size));
229 void bufinit __P((void));
230 void bwrite __P((int fd, char *buf, ufs_daddr_t blk, long size));
231 void cacheino __P((struct dinode *dp, ino_t inumber));
232 void catch __P((int));
233 void catchquit __P((int));
234 int changeino __P((ino_t dir, char *name, ino_t newnum));
235 int checkfstab __P((int preen, int maxrun,
236 int (*docheck)(struct fstab *),
237 int (*chkit)(char *, char *, long, int)));
238 int chkrange __P((ufs_daddr_t blk, int cnt));
239 void ckfini __P((int markclean));
240 int ckinode __P((struct dinode *dp, struct inodesc *));
241 void clri __P((struct inodesc *, char *type, int flag));
242 void direrror __P((ino_t ino, char *errmesg));
243 int dirscan __P((struct inodesc *));
244 int dofix __P((struct inodesc *, char *msg));
245 void ffs_clrblock __P((struct fs *, u_char *, ufs_daddr_t));
246 void ffs_fragacct __P((struct fs *, int, int32_t [], int));
247 int ffs_isblock __P((struct fs *, u_char *, ufs_daddr_t));
248 void ffs_setblock __P((struct fs *, u_char *, ufs_daddr_t));
249 void fileerror __P((ino_t cwd, ino_t ino, char *errmesg));
250 int findino __P((struct inodesc *));
251 int findname __P((struct inodesc *));
252 void flush __P((int fd, struct bufarea *bp));
253 void freeblk __P((ufs_daddr_t blkno, long frags));
254 void freeino __P((ino_t ino));
255 void freeinodebuf __P((void));
256 int ftypeok __P((struct dinode *dp));
257 void getblk __P((struct bufarea *bp, ufs_daddr_t blk, long size));
258 struct bufarea *getdatablk __P((ufs_daddr_t blkno, long size));
259 struct inoinfo *getinoinfo __P((ino_t inumber));
260 struct dinode *getnextinode __P((ino_t inumber));
261 void getpathname __P((char *namebuf, ino_t curdir, ino_t ino));
262 struct dinode *ginode __P((ino_t inumber));
263 void inocleanup __P((void));
264 void inodirty __P((void));
265 int linkup __P((ino_t orphan, ino_t parentdir));
266 int makeentry __P((ino_t parent, ino_t ino, char *name));
267 void panic __P((const char *fmt, ...));
268 void pass1 __P((void));
269 void pass1b __P((void));
270 int pass1check __P((struct inodesc *));
271 void pass2 __P((void));
272 void pass3 __P((void));
273 void pass4 __P((void));
274 int pass4check __P((struct inodesc *));
275 void pass5 __P((void));
276 void pfatal __P((const char *fmt, ...));
277 void pinode __P((ino_t ino));
278 void propagate __P((void));
279 void pwarn __P((const char *fmt, ...));
280 int reply __P((char *question));
281 void resetinodebuf __P((void));
282 int setup __P((char *dev));
283 void voidquit __P((int));