Commit | Line | Data |
---|---|---|
15637ed4 RG |
1 | /* |
2 | * Copyright (c) 1980, 1986 The Regents of the University of California. | |
3 | * 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 5.17 (Berkeley) 7/27/90 | |
78ed81a3 | 34 | * |
35 | * $Header: /b/source/CVS/src/sbin/fsck/fsck.h,v 1.3 1993/03/23 00:27:51 cgd Exp $ | |
15637ed4 RG |
36 | */ |
37 | ||
38 | #define MAXDUP 10 /* limit on dup blks (per inode) */ | |
39 | #define MAXBAD 10 /* limit on bad blks (per inode) */ | |
40 | #define MAXBUFSPACE 40*1024 /* maximum space to allocate to buffers */ | |
41 | #define INOBUFSIZE 56*1024 /* size of buffer to read inodes in pass1 */ | |
42 | ||
43 | #ifndef BUFSIZ | |
44 | #define BUFSIZ 1024 | |
45 | #endif | |
46 | ||
47 | #define USTATE 01 /* inode not allocated */ | |
48 | #define FSTATE 02 /* inode is file */ | |
49 | #define DSTATE 03 /* inode is directory */ | |
50 | #define DFOUND 04 /* directory found during descent */ | |
51 | #define DCLEAR 05 /* directory is to be cleared */ | |
52 | #define FCLEAR 06 /* file is to be cleared */ | |
53 | ||
54 | /* | |
55 | * buffer cache structure. | |
56 | */ | |
57 | struct bufarea { | |
58 | struct bufarea *b_next; /* free list queue */ | |
59 | struct bufarea *b_prev; /* free list queue */ | |
60 | daddr_t b_bno; | |
61 | int b_size; | |
62 | int b_errs; | |
63 | int b_flags; | |
64 | union { | |
65 | char *b_buf; /* buffer space */ | |
66 | daddr_t *b_indir; /* indirect block */ | |
67 | struct fs *b_fs; /* super block */ | |
68 | struct cg *b_cg; /* cylinder group */ | |
69 | struct dinode *b_dinode; /* inode block */ | |
70 | } b_un; | |
71 | char b_dirty; | |
72 | }; | |
73 | ||
74 | #define B_INUSE 1 | |
75 | ||
76 | #define MINBUFS 5 /* minimum number of buffers required */ | |
77 | struct bufarea bufhead; /* head of list of other blks in filesys */ | |
78 | struct bufarea sblk; /* file system superblock */ | |
79 | struct bufarea cgblk; /* cylinder group blocks */ | |
80 | struct bufarea *pdirbp; /* current directory contents */ | |
81 | struct bufarea *pbp; /* current inode block */ | |
82 | struct bufarea *getdatablk(); | |
83 | ||
84 | #define dirty(bp) (bp)->b_dirty = 1 | |
85 | #define initbarea(bp) \ | |
86 | (bp)->b_dirty = 0; \ | |
87 | (bp)->b_bno = (daddr_t)-1; \ | |
88 | (bp)->b_flags = 0; | |
89 | ||
90 | #define sbdirty() sblk.b_dirty = 1 | |
91 | #define cgdirty() cgblk.b_dirty = 1 | |
92 | #define sblock (*sblk.b_un.b_fs) | |
93 | #define cgrp (*cgblk.b_un.b_cg) | |
94 | ||
95 | enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE}; | |
96 | ||
97 | struct inodesc { | |
98 | enum fixstate id_fix; /* policy on fixing errors */ | |
99 | int (*id_func)(); /* function to be applied to blocks of inode */ | |
100 | ino_t id_number; /* inode number described */ | |
101 | ino_t id_parent; /* for DATA nodes, their parent */ | |
102 | daddr_t id_blkno; /* current block number being examined */ | |
103 | int id_numfrags; /* number of frags contained in block */ | |
104 | long id_filesize; /* for DATA nodes, the size of the directory */ | |
105 | int id_loc; /* for DATA nodes, current location in dir */ | |
106 | int id_entryno; /* for DATA nodes, current entry number */ | |
107 | struct direct *id_dirp; /* for DATA nodes, ptr to current entry */ | |
108 | char *id_name; /* for DATA nodes, name to find or enter */ | |
109 | char id_type; /* type of descriptor, DATA or ADDR */ | |
110 | }; | |
111 | /* file types */ | |
112 | #define DATA 1 | |
113 | #define ADDR 2 | |
114 | ||
115 | /* | |
116 | * Linked list of duplicate blocks. | |
117 | * | |
118 | * The list is composed of two parts. The first part of the | |
119 | * list (from duplist through the node pointed to by muldup) | |
120 | * contains a single copy of each duplicate block that has been | |
121 | * found. The second part of the list (from muldup to the end) | |
122 | * contains duplicate blocks that have been found more than once. | |
123 | * To check if a block has been found as a duplicate it is only | |
124 | * necessary to search from duplist through muldup. To find the | |
125 | * total number of times that a block has been found as a duplicate | |
126 | * the entire list must be searched for occurences of the block | |
127 | * in question. The following diagram shows a sample list where | |
128 | * w (found twice), x (found once), y (found three times), and z | |
129 | * (found once) are duplicate block numbers: | |
130 | * | |
131 | * w -> y -> x -> z -> y -> w -> y | |
132 | * ^ ^ | |
133 | * | | | |
134 | * duplist muldup | |
135 | */ | |
136 | struct dups { | |
137 | struct dups *next; | |
138 | daddr_t dup; | |
139 | }; | |
140 | struct dups *duplist; /* head of dup list */ | |
141 | struct dups *muldup; /* end of unique duplicate dup block numbers */ | |
142 | ||
143 | /* | |
144 | * Linked list of inodes with zero link counts. | |
145 | */ | |
146 | struct zlncnt { | |
147 | struct zlncnt *next; | |
148 | ino_t zlncnt; | |
149 | }; | |
150 | struct zlncnt *zlnhead; /* head of zero link count list */ | |
151 | ||
152 | /* | |
153 | * Inode cache data structures. | |
154 | */ | |
155 | struct inoinfo { | |
156 | struct inoinfo *i_nexthash; /* next entry in hash chain */ | |
157 | ino_t i_number; /* inode number of this entry */ | |
158 | ino_t i_parent; /* inode number of parent */ | |
159 | ino_t i_dotdot; /* inode number of `..' */ | |
160 | size_t i_isize; /* size of inode */ | |
161 | u_int i_numblks; /* size of block array in bytes */ | |
162 | daddr_t i_blks[1]; /* actually longer */ | |
163 | } **inphead, **inpsort; | |
164 | long numdirs, listmax, inplast; | |
165 | ||
166 | char *devname; /* name of device being checked */ | |
167 | long dev_bsize; /* computed value of DEV_BSIZE */ | |
168 | long secsize; /* actual disk sector size */ | |
169 | char nflag; /* assume a no response */ | |
170 | char yflag; /* assume a yes response */ | |
171 | int bflag; /* location of alternate super block */ | |
172 | int debug; /* output debugging info */ | |
173 | int cvtflag; /* convert to old file system format */ | |
174 | char preen; /* just fix normal inconsistencies */ | |
175 | char hotroot; /* checking root device */ | |
176 | char havesb; /* superblock has been read */ | |
177 | int fsmodified; /* 1 => write done to file system */ | |
178 | int fsreadfd; /* file descriptor for reading file system */ | |
179 | int fswritefd; /* file descriptor for writing file system */ | |
180 | ||
181 | daddr_t maxfsblock; /* number of blocks in the file system */ | |
182 | char *blockmap; /* ptr to primary blk allocation map */ | |
183 | ino_t maxino; /* number of inodes in file system */ | |
184 | ino_t lastino; /* last inode in use */ | |
185 | char *statemap; /* ptr to inode state table */ | |
186 | short *lncntp; /* ptr to link count table */ | |
187 | ||
188 | ino_t lfdir; /* lost & found directory inode number */ | |
189 | char *lfname; /* lost & found directory name */ | |
190 | int lfmode; /* lost & found directory creation mode */ | |
191 | ||
192 | daddr_t n_blks; /* number of blocks in use */ | |
193 | daddr_t n_files; /* number of files in use */ | |
194 | ||
195 | #define clearinode(dp) (*(dp) = zino) | |
196 | struct dinode zino; | |
197 | ||
198 | #define setbmap(blkno) setbit(blockmap, blkno) | |
199 | #define testbmap(blkno) isset(blockmap, blkno) | |
200 | #define clrbmap(blkno) clrbit(blockmap, blkno) | |
201 | ||
202 | #define STOP 0x01 | |
203 | #define SKIP 0x02 | |
204 | #define KEEPON 0x04 | |
205 | #define ALTERED 0x08 | |
206 | #define FOUND 0x10 | |
207 | ||
208 | time_t time(); | |
209 | struct dinode *ginode(); | |
210 | struct inoinfo *getinoinfo(); | |
211 | void getblk(); | |
212 | ino_t allocino(); | |
213 | int findino(); |