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.4 (Berkeley) 5/9/95
|
34 * $FreeBSD: head/sbin/fsck_ffs/fsck.h 75884 2001-04-23 21:39:14Z iedowse $
|
| 34 * $FreeBSD: head/sbin/fsck_ffs/fsck.h 75927 2001-04-24 22:38:08Z mckusick $ |
35 */
36
37#include <unistd.h>
38#include <stdlib.h>
39#include <stdio.h>
40
41#define MAXDUP 10 /* limit on dup blks (per inode) */
42#define MAXBAD 10 /* limit on bad blks (per inode) */
43#define MAXBUFSPACE 40*1024 /* maximum space to allocate to buffers */
44#define INOBUFSIZE 56*1024 /* size of buffer to read inodes in pass1 */
45
46/*
47 * Each inode on the filesystem is described by the following structure.
48 * The linkcnt is initially set to the value in the inode. Each time it
49 * is found during the descent in passes 2, 3, and 4 the count is
50 * decremented. Any inodes whose count is non-zero after pass 4 needs to
51 * have its link count adjusted by the value remaining in ino_linkcnt.
52 */
53struct inostat {
54 char ino_state; /* state of inode, see below */
55 char ino_type; /* type of inode */
56 short ino_linkcnt; /* number of links not found */
57};
58/*
59 * Inode states.
60 */
61#define USTATE 01 /* inode not allocated */
62#define FSTATE 02 /* inode is file */
63#define DSTATE 03 /* inode is directory */
64#define DFOUND 04 /* directory found during descent */
65#define DCLEAR 05 /* directory is to be cleared */
66#define FCLEAR 06 /* file is to be cleared */
67/*
68 * Inode state information is contained on per cylinder group lists
69 * which are described by the following structure.
70 */
71struct inostatlist {
72 long il_numalloced; /* number of inodes allocated in this cg */
73 struct inostat *il_stat;/* inostat info for this cylinder group */
74} *inostathead;
75
76/*
77 * buffer cache structure.
78 */
79struct bufarea {
80 struct bufarea *b_next; /* free list queue */
81 struct bufarea *b_prev; /* free list queue */
82 ufs_daddr_t b_bno;
83 int b_size;
84 int b_errs;
85 int b_flags;
86 union {
87 char *b_buf; /* buffer space */
88 ufs_daddr_t *b_indir; /* indirect block */
89 struct fs *b_fs; /* super block */
90 struct cg *b_cg; /* cylinder group */
91 struct dinode *b_dinode; /* inode block */
92 } b_un;
93 char b_dirty;
94};
95
96#define B_INUSE 1
97
98#define MINBUFS 5 /* minimum number of buffers required */
99struct bufarea bufhead; /* head of list of other blks in filesys */
100struct bufarea sblk; /* file system superblock */
101struct bufarea cgblk; /* cylinder group blocks */
102struct bufarea *pdirbp; /* current directory contents */
103struct bufarea *pbp; /* current inode block */
104
105#define dirty(bp) \
106 if (fswritefd < 0) \
107 pfatal("SETTING DIRTY FLAG IN READ_ONLY MODE\n"); \
108 else \
109 (bp)->b_dirty = 1
110#define initbarea(bp) \
111 (bp)->b_dirty = 0; \
112 (bp)->b_bno = (ufs_daddr_t)-1; \
113 (bp)->b_flags = 0;
114
115#define sbdirty() dirty(&sblk)
116#define cgdirty() dirty(&cgblk)
117#define sblock (*sblk.b_un.b_fs)
118#define cgrp (*cgblk.b_un.b_cg)
119
120enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE};
121ino_t cursnapshot;
122
123struct inodesc {
124 enum fixstate id_fix; /* policy on fixing errors */
125 int (*id_func)(); /* function to be applied to blocks of inode */
126 ino_t id_number; /* inode number described */
127 ino_t id_parent; /* for DATA nodes, their parent */
128 int id_lbn; /* logical block number of current block */
129 ufs_daddr_t id_blkno; /* current block number being examined */
130 int id_numfrags; /* number of frags contained in block */
131 quad_t id_filesize; /* for DATA nodes, the size of the directory */
132 int id_loc; /* for DATA nodes, current location in dir */
133 int id_entryno; /* for DATA nodes, current entry number */
134 struct direct *id_dirp; /* for DATA nodes, ptr to current entry */
135 char *id_name; /* for DATA nodes, name to find or enter */
136 char id_type; /* type of descriptor, DATA or ADDR */
137};
138/* file types */
139#define DATA 1 /* a directory */
140#define SNAP 2 /* a snapshot */
141#define ADDR 3 /* anything but a directory or a snapshot */
142
143/*
144 * Linked list of duplicate blocks.
145 *
146 * The list is composed of two parts. The first part of the
147 * list (from duplist through the node pointed to by muldup)
148 * contains a single copy of each duplicate block that has been
149 * found. The second part of the list (from muldup to the end)
150 * contains duplicate blocks that have been found more than once.
151 * To check if a block has been found as a duplicate it is only
152 * necessary to search from duplist through muldup. To find the
153 * total number of times that a block has been found as a duplicate
154 * the entire list must be searched for occurences of the block
155 * in question. The following diagram shows a sample list where
156 * w (found twice), x (found once), y (found three times), and z
157 * (found once) are duplicate block numbers:
158 *
159 * w -> y -> x -> z -> y -> w -> y
160 * ^ ^
161 * | |
162 * duplist muldup
163 */
164struct dups {
165 struct dups *next;
166 ufs_daddr_t dup;
167};
168struct dups *duplist; /* head of dup list */
169struct dups *muldup; /* end of unique duplicate dup block numbers */
170
171/*
172 * Linked list of inodes with zero link counts.
173 */
174struct zlncnt {
175 struct zlncnt *next;
176 ino_t zlncnt;
177};
178struct zlncnt *zlnhead; /* head of zero link count list */
179
180/*
181 * Inode cache data structures.
182 */
183struct inoinfo {
184 struct inoinfo *i_nexthash; /* next entry in hash chain */
185 ino_t i_number; /* inode number of this entry */
186 ino_t i_parent; /* inode number of parent */
187 ino_t i_dotdot; /* inode number of `..' */
188 size_t i_isize; /* size of inode */
189 u_int i_numblks; /* size of block array in bytes */
190 ufs_daddr_t i_blks[1]; /* actually longer */
191} **inphead, **inpsort;
192long numdirs, dirhash, listmax, inplast;
193long countdirs; /* number of directories we actually found */
194
195#define MIBSIZE 3 /* size of fsck sysctl MIBs */
196int adjrefcnt[MIBSIZE]; /* MIB command to adjust inode reference cnt */
197int adjblkcnt[MIBSIZE]; /* MIB command to adjust inode block count */
198int freefiles[MIBSIZE]; /* MIB command to free a set of files */
199int freedirs[MIBSIZE]; /* MIB command to free a set of directories */
200int freeblks[MIBSIZE]; /* MIB command to free a set of data blocks */
201struct fsck_cmd cmd; /* sysctl filesystem update commands */
202char snapname[BUFSIZ]; /* when doing snapshots, the name of the file */
203char *cdevname; /* name of device being checked */
204long dev_bsize; /* computed value of DEV_BSIZE */
205long secsize; /* actual disk sector size */
206char nflag; /* assume a no response */
207char yflag; /* assume a yes response */
208int bkgrdflag; /* use a snapshot to run on an active system */
209int bflag; /* location of alternate super block */
210int debug; /* output debugging info */
211int cvtlevel; /* convert to newer file system format */
212int doinglevel1; /* converting to new cylinder group format */
213int doinglevel2; /* converting to new inode format */
214int newinofmt; /* filesystem has new inode format */
|
| 215int bkgrdcheck; /* determine if background check is possible */ |
216char usedsoftdep; /* just fix soft dependency inconsistencies */
217char preen; /* just fix normal inconsistencies */
218char rerun; /* rerun fsck. Only used in non-preen mode */
219int returntosingle; /* 1 => return to single user mode on exit */
220char resolved; /* cleared if unresolved changes => not clean */
221char havesb; /* superblock has been read */
222char skipclean; /* skip clean file systems if preening */
223int fsmodified; /* 1 => write done to file system */
224int fsreadfd; /* file descriptor for reading file system */
225int fswritefd; /* file descriptor for writing file system */
226
227ufs_daddr_t maxfsblock; /* number of blocks in the file system */
228char *blockmap; /* ptr to primary blk allocation map */
229ino_t maxino; /* number of inodes in file system */
230
231ino_t lfdir; /* lost & found directory inode number */
232char *lfname; /* lost & found directory name */
233int lfmode; /* lost & found directory creation mode */
234
235ufs_daddr_t n_blks; /* number of blocks in use */
236ufs_daddr_t n_files; /* number of files in use */
237
238int got_siginfo; /* received a SIGINFO */
239
240#define clearinode(dp) (*(dp) = zino)
241struct dinode zino;
242
243#define setbmap(blkno) setbit(blockmap, blkno)
244#define testbmap(blkno) isset(blockmap, blkno)
245#define clrbmap(blkno) clrbit(blockmap, blkno)
246
247#define STOP 0x01
248#define SKIP 0x02
249#define KEEPON 0x04
250#define ALTERED 0x08
251#define FOUND 0x10
252
253#define EEXIT 8 /* Standard error exit. */
254
255struct fstab;
256
257
258void adjust __P((struct inodesc *, int lcnt));
259ufs_daddr_t allocblk __P((long frags));
260ino_t allocdir __P((ino_t parent, ino_t request, int mode));
261ino_t allocino __P((ino_t request, int type));
262void blkerror __P((ino_t ino, char *type, ufs_daddr_t blk));
263char *blockcheck __P((char *name));
264int bread __P((int fd, char *buf, ufs_daddr_t blk, long size));
265void bufinit __P((void));
266void bwrite __P((int fd, char *buf, ufs_daddr_t blk, long size));
267void cacheino __P((struct dinode *dp, ino_t inumber));
268void catch __P((int));
269void catchquit __P((int));
270int changeino __P((ino_t dir, char *name, ino_t newnum));
271int chkrange __P((ufs_daddr_t blk, int cnt));
272void ckfini __P((int markclean));
273int ckinode __P((struct dinode *dp, struct inodesc *));
274void clri __P((struct inodesc *, char *type, int flag));
275int clearentry __P((struct inodesc *));
276void direrror __P((ino_t ino, char *errmesg));
277int dirscan __P((struct inodesc *));
278int dofix __P((struct inodesc *, char *msg));
279void ffs_clrblock __P((struct fs *, u_char *, ufs_daddr_t));
280void ffs_fragacct __P((struct fs *, int, int32_t [], int));
281int ffs_isblock __P((struct fs *, u_char *, ufs_daddr_t));
282void ffs_setblock __P((struct fs *, u_char *, ufs_daddr_t));
283void fileerror __P((ino_t cwd, ino_t ino, char *errmesg));
284int findino __P((struct inodesc *));
285int findname __P((struct inodesc *));
286void flush __P((int fd, struct bufarea *bp));
287void freeblk __P((ufs_daddr_t blkno, long frags));
288void freeino __P((ino_t ino));
289void freeinodebuf __P((void));
290int ftypeok __P((struct dinode *dp));
291void getblk __P((struct bufarea *bp, ufs_daddr_t blk, long size));
292struct bufarea *getdatablk __P((ufs_daddr_t blkno, long size));
293struct inoinfo *getinoinfo __P((ino_t inumber));
294struct dinode *getnextinode __P((ino_t inumber));
295void getpathname __P((char *namebuf, ino_t curdir, ino_t ino));
296struct dinode *ginode __P((ino_t inumber));
297void infohandler __P((int sig));
298void inocleanup __P((void));
299void inodirty __P((void));
300struct inostat *inoinfo __P((ino_t inum));
301int linkup __P((ino_t orphan, ino_t parentdir, char *name));
302int makeentry __P((ino_t parent, ino_t ino, char *name));
303void panic __P((const char *fmt, ...));
304void pass1 __P((void));
305void pass1b __P((void));
306int pass1check __P((struct inodesc *));
307void pass2 __P((void));
308void pass3 __P((void));
309void pass4 __P((void));
310int pass4check __P((struct inodesc *));
311void pass5 __P((void));
312void pfatal __P((const char *fmt, ...));
313void pinode __P((ino_t ino));
314void propagate __P((void));
315void pwarn __P((const char *fmt, ...));
316int readsb __P((int listerr));
317int reply __P((char *question));
318void rwerror __P((char *mesg, ufs_daddr_t blk));
319void sblock_init __P((void));
320void setinodebuf __P((ino_t));
321int setup __P((char *dev));
322void voidquit __P((int));
|