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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)fsck.h 8.4 (Berkeley) 5/9/95
30 * $FreeBSD: src/sbin/fsck/fsck.h,v 1.12.2.1 2001/01/23 23:11:07 iedowse Exp $
37 #define MAXDUP 10 /* limit on dup blks (per inode) */
38 #define MAXBAD 10 /* limit on bad blks (per inode) */
39 #define MAXBUFSPACE 40*1024 /* maximum space to allocate to buffers */
40 #define INOBUFSIZE 56*1024 /* size of buffer to read inodes in pass1 */
43 * Each inode on the filesystem is described by the following structure.
44 * The linkcnt is initially set to the value in the inode. Each time it
45 * is found during the descent in passes 2, 3, and 4 the count is
46 * decremented. Any inodes whose count is non-zero after pass 4 needs to
47 * have its link count adjusted by the value remaining in ino_linkcnt.
50 char ino_state; /* state of inode, see below */
51 char ino_type; /* type of inode */
52 short ino_linkcnt; /* number of links not found */
57 #define USTATE 01 /* inode not allocated */
58 #define FSTATE 02 /* inode is file */
59 #define DSTATE 03 /* inode is directory */
60 #define DFOUND 04 /* directory found during descent */
61 #define DCLEAR 05 /* directory is to be cleared */
62 #define FCLEAR 06 /* file is to be cleared */
64 * Inode state information is contained on per cylinder group lists
65 * which are described by the following structure.
68 long il_numalloced; /* number of inodes allocated in this cg */
69 struct inostat *il_stat;/* inostat info for this cylinder group */
73 * buffer cache structure.
76 struct bufarea *b_next; /* free list queue */
77 struct bufarea *b_prev; /* free list queue */
83 char *b_buf; /* buffer space */
84 ufs_daddr_t *b_indir; /* indirect block */
85 struct fs *b_fs; /* super block */
86 struct cg *b_cg; /* cylinder group */
87 struct ufs1_dinode *b_dinode; /* inode block */
94 #define MINBUFS 5 /* minimum number of buffers required */
95 struct bufarea bufhead; /* head of list of other blks in filesys */
96 struct bufarea sblk; /* file system superblock */
97 struct bufarea cgblk; /* cylinder group blocks */
98 struct bufarea *pdirbp; /* current directory contents */
99 struct bufarea *pbp; /* current inode block */
101 #define dirty(bp) (bp)->b_dirty = 1
102 #define initbarea(bp) \
104 (bp)->b_bno = (ufs_daddr_t)-1; \
107 #define sbdirty() sblk.b_dirty = 1
108 #define cgdirty() cgblk.b_dirty = 1
109 #define sblock (*sblk.b_un.b_fs)
110 #define cgrp (*cgblk.b_un.b_cg)
112 enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE};
115 enum fixstate id_fix; /* policy on fixing errors */
116 int (*id_func)(struct inodesc *); /* function to be applied to blocks of inode */
117 ufs1_ino_t id_number; /* inode number described */
118 ufs1_ino_t id_parent; /* for DATA nodes, their parent */
119 ufs_daddr_t id_blkno; /* current block number being examined */
120 int id_numfrags; /* number of frags contained in block */
121 quad_t id_filesize; /* for DATA nodes, the size of the directory */
122 int id_loc; /* for DATA nodes, current location in dir */
123 int id_entryno; /* for DATA nodes, current entry number */
124 struct direct *id_dirp; /* for DATA nodes, ptr to current entry */
125 char *id_name; /* for DATA nodes, name to find or enter */
126 char id_type; /* type of descriptor, DATA or ADDR */
133 * Linked list of duplicate blocks.
135 * The list is composed of two parts. The first part of the
136 * list (from duplist through the node pointed to by muldup)
137 * contains a single copy of each duplicate block that has been
138 * found. The second part of the list (from muldup to the end)
139 * contains duplicate blocks that have been found more than once.
140 * To check if a block has been found as a duplicate it is only
141 * necessary to search from duplist through muldup. To find the
142 * total number of times that a block has been found as a duplicate
143 * the entire list must be searched for occurences of the block
144 * in question. The following diagram shows a sample list where
145 * w (found twice), x (found once), y (found three times), and z
146 * (found once) are duplicate block numbers:
148 * w -> y -> x -> z -> y -> w -> y
157 struct dups *duplist; /* head of dup list */
158 struct dups *muldup; /* end of unique duplicate dup block numbers */
161 * Linked list of inodes with zero link counts.
167 struct zlncnt *zlnhead; /* head of zero link count list */
170 * Inode cache data structures.
173 struct inoinfo *i_nexthash; /* next entry in hash chain */
174 ufs1_ino_t i_number; /* inode number of this entry */
175 ufs1_ino_t i_parent; /* inode number of parent */
176 ufs1_ino_t i_dotdot; /* inode number of `..' */
177 size_t i_isize; /* size of inode */
178 u_int i_numblks; /* size of block array in bytes */
179 ufs_daddr_t i_blks[1]; /* actually longer */
180 } **inphead, **inpsort;
181 long numdirs, dirhash, listmax, inplast, dirhashmask;
182 long countdirs; /* number of directories we actually found */
185 * Be careful about cache locality of reference, large filesystems may
186 * have tens of millions of directories in them and if fsck has to swap
187 * we want it to swap efficiently. For this reason we try to group
188 * adjacent inodes together by a reasonable factor.
190 #define DIRHASH(ino) ((ino >> 3) & dirhashmask)
192 char *cdevname; /* name of device being checked */
193 long dev_bsize; /* computed value of DEV_BSIZE */
194 long secsize; /* actual disk sector size */
195 char fflag; /* force check, ignore clean flag */
196 char nflag; /* assume a no response */
197 char yflag; /* assume a yes response */
198 int bflag; /* location of alternate super block */
199 int debug; /* output debugging info */
200 int cvtlevel; /* convert to newer file system format */
201 int doinglevel1; /* converting to new cylinder group format */
202 int doinglevel2; /* converting to new inode format */
203 int newinofmt; /* filesystem has new inode format */
204 char usedsoftdep; /* just fix soft dependency inconsistencies */
205 char preen; /* just fix normal inconsistencies */
206 char rerun; /* rerun fsck. Only used in non-preen mode */
207 int returntosingle; /* 1 => return to single user mode on exit */
208 char resolved; /* cleared if unresolved changes => not clean */
209 char havesb; /* superblock has been read */
210 int fsmodified; /* 1 => write done to file system */
211 int fsreadfd; /* file descriptor for reading file system */
212 int fswritefd; /* file descriptor for writing file system */
213 int lastmntonly; /* Output the last mounted on only */
215 ufs_daddr_t maxfsblock; /* number of blocks in the file system */
216 char *blockmap; /* ptr to primary blk allocation map */
217 ufs1_ino_t maxino; /* number of inodes in file system */
219 ufs1_ino_t lfdir; /* lost & found directory inode number */
220 char *lfname; /* lost & found directory name */
221 int lfmode; /* lost & found directory creation mode */
223 ufs_daddr_t n_blks; /* number of blocks in use */
224 ufs_daddr_t n_files; /* number of files in use */
226 int got_siginfo; /* received a SIGINFO */
228 #define clearinode(dp) (*(dp) = zino)
229 struct ufs1_dinode zino;
231 #define setbmap(blkno) setbit(blockmap, blkno)
232 #define testbmap(blkno) isset(blockmap, blkno)
233 #define clrbmap(blkno) clrbit(blockmap, blkno)
241 #define EEXIT 8 /* Standard error exit. */
246 void adjust(struct inodesc *, int);
247 ufs_daddr_t allocblk(long);
248 ufs1_ino_t allocdir(ufs1_ino_t, ufs1_ino_t, int);
249 ufs1_ino_t allocino(ufs1_ino_t, int);
250 void blkerror(ufs1_ino_t, char *, ufs_daddr_t);
251 char *blockcheck(char *);
252 int bread(int, char *, ufs_daddr_t, long);
254 void bwrite(int, char *, ufs_daddr_t, long);
255 void cacheino(struct ufs1_dinode *, ufs1_ino_t);
256 void catch(int) __dead2;
258 int changeino(ufs1_ino_t, char *, ufs1_ino_t);
259 int checkfstab(int, int,
260 int (*)(struct fstab *),
261 int (*)(char *, char *, long, int));
262 int chkrange(ufs_daddr_t, int);
264 int ckinode(struct ufs1_dinode *, struct inodesc *);
265 void clri(struct inodesc *, char *, int);
266 int clearentry(struct inodesc *);
267 void direrror(ufs1_ino_t, char *);
268 int dirscan(struct inodesc *);
269 int dofix(struct inodesc *, char *);
270 void ffs_clrblock(struct fs *, u_char *, ufs_daddr_t);
271 void ffs_fragacct(struct fs *, int, int32_t [], int);
272 int ffs_isblock(struct fs *, u_char *, ufs_daddr_t);
273 void ffs_setblock(struct fs *, u_char *, ufs_daddr_t);
274 void fileerror(ufs1_ino_t, ufs1_ino_t, char *);
275 int findino(struct inodesc *);
276 int findname(struct inodesc *);
277 void flush(int, struct bufarea *);
278 void freeblk(ufs_daddr_t, long);
279 void freeino(ufs1_ino_t);
280 void freeinodebuf(void);
281 int ftypeok(struct ufs1_dinode *);
282 void getblk(struct bufarea *, ufs_daddr_t, long);
283 struct bufarea *getdatablk(ufs_daddr_t, long);
284 struct inoinfo *getinoinfo(ufs1_ino_t);
285 struct ufs1_dinode *getnextinode(ufs1_ino_t);
286 void getpathname(char *, ufs1_ino_t, ufs1_ino_t);
287 struct ufs1_dinode *ginode(ufs1_ino_t);
288 void infohandler(int);
289 void inocleanup(void);
291 struct inostat *inoinfo(ufs1_ino_t);
292 int linkup(ufs1_ino_t, ufs1_ino_t, char *);
293 int makeentry(ufs1_ino_t, ufs1_ino_t, char *);
294 void panic(const char *, ...) __dead2 __printflike(1, 2);
297 int pass1check(struct inodesc *);
301 int pass4check(struct inodesc *);
303 void pfatal(const char *, ...) __printflike(1, 2);
304 void pinode(ufs1_ino_t);
305 void propagate(void);
306 void pwarn(const char *, ...) __printflike(1, 2);
308 void setinodebuf(ufs1_ino_t);