1 /* 2 * Copyright (c) 2002 Networks Associates Technology, Inc. 3 * All rights reserved. 4 * 5 * This software was developed for the FreeBSD Project by Marshall 6 * Kirk McKusick and Network Associates Laboratories, the Security 7 * Research Division of Network Associates, Inc. under DARPA/SPAWAR 8 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS 9 * research program 10 * 11 * Copyright (c) 1982, 1989, 1993 12 * The Regents of the University of California. All rights reserved. 13 * (c) UNIX System Laboratories, Inc. 14 * Copyright (c) 1980, 1986, 1993 15 * The Regents of the University of California. All rights reserved. 16 * 17 * Redistribution and use in source and binary forms, with or without 18 * modification, are permitted provided that the following conditions 19 * are met: 20 * 1. Redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer. 22 * 2. Redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution. 25 * 3. All advertising materials mentioning features or use of this software 26 * must display the following acknowledgement: 27 * This product includes software developed by the University of 28 * California, Berkeley and its contributors. 29 * 4. Neither the name of the University nor the names of its contributors 30 * may be used to endorse or promote products derived from this software 31 * without specific prior written permission. 32 * 33 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 36 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 43 * SUCH DAMAGE. 44 * 45 * @(#)fsck.h 8.4 (Berkeley) 5/9/95 46 * $FreeBSD$ 47 */ 48 49 #include <unistd.h> 50 #include <stdlib.h> 51 #include <stdio.h> 52 53 #define MAXDUP 10 /* limit on dup blks (per inode) */ 54 #define MAXBAD 10 /* limit on bad blks (per inode) */ 55 #define MAXBUFSPACE 40*1024 /* maximum space to allocate to buffers */ 56 #define INOBUFSIZE 56*1024 /* size of buffer to read inodes in pass1 */ 57 58 union dinode { 59 struct ufs1_dinode dp1; 60 struct ufs2_dinode dp2; 61 }; 62 #define DIP(dp, field) \ 63 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \ 64 (dp)->dp1.field : (dp)->dp2.field) 65 66 /* 67 * Each inode on the filesystem is described by the following structure. 68 * The linkcnt is initially set to the value in the inode. Each time it 69 * is found during the descent in passes 2, 3, and 4 the count is 70 * decremented. Any inodes whose count is non-zero after pass 4 needs to 71 * have its link count adjusted by the value remaining in ino_linkcnt. 72 */ 73 struct inostat { 74 char ino_state; /* state of inode, see below */ 75 char ino_type; /* type of inode */ 76 short ino_linkcnt; /* number of links not found */ 77 }; 78 /* 79 * Inode states. 80 */ 81 #define USTATE 01 /* inode not allocated */ 82 #define FSTATE 02 /* inode is file */ 83 #define DSTATE 03 /* inode is directory */ 84 #define DFOUND 04 /* directory found during descent */ 85 #define DCLEAR 05 /* directory is to be cleared */ 86 #define FCLEAR 06 /* file is to be cleared */ 87 /* 88 * Inode state information is contained on per cylinder group lists 89 * which are described by the following structure. 90 */ 91 struct inostatlist { 92 long il_numalloced; /* number of inodes allocated in this cg */ 93 struct inostat *il_stat;/* inostat info for this cylinder group */ 94 } *inostathead; 95 96 /* 97 * buffer cache structure. 98 */ 99 struct bufarea { 100 struct bufarea *b_next; /* free list queue */ 101 struct bufarea *b_prev; /* free list queue */ 102 ufs2_daddr_t b_bno; 103 int b_size; 104 int b_errs; 105 int b_flags; 106 union { 107 char *b_buf; /* buffer space */ 108 ufs1_daddr_t *b_indir1; /* UFS1 indirect block */ 109 ufs2_daddr_t *b_indir2; /* UFS2 indirect block */ 110 struct fs *b_fs; /* super block */ 111 struct cg *b_cg; /* cylinder group */ 112 struct ufs1_dinode *b_dinode1; /* UFS1 inode block */ 113 struct ufs2_dinode *b_dinode2; /* UFS2 inode block */ 114 } b_un; 115 char b_dirty; 116 }; 117 #define IBLK(bp, i) \ 118 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \ 119 (bp)->b_un.b_indir1[i] : (bp)->b_un.b_indir2[i]) 120 121 #define B_INUSE 1 122 123 #define MINBUFS 5 /* minimum number of buffers required */ 124 struct bufarea bufhead; /* head of list of other blks in filesys */ 125 struct bufarea sblk; /* filesystem superblock */ 126 struct bufarea cgblk; /* cylinder group blocks */ 127 struct bufarea *pdirbp; /* current directory contents */ 128 struct bufarea *pbp; /* current inode block */ 129 130 #define dirty(bp) do { \ 131 if (fswritefd < 0) \ 132 pfatal("SETTING DIRTY FLAG IN READ_ONLY MODE\n"); \ 133 else \ 134 (bp)->b_dirty = 1; \ 135 } while (0) 136 #define initbarea(bp) do { \ 137 (bp)->b_dirty = 0; \ 138 (bp)->b_bno = (ufs2_daddr_t)-1; \ 139 (bp)->b_flags = 0; \ 140 } while (0) 141 142 #define sbdirty() dirty(&sblk) 143 #define cgdirty() dirty(&cgblk) 144 #define sblock (*sblk.b_un.b_fs) 145 #define cgrp (*cgblk.b_un.b_cg) 146 147 enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE}; 148 ino_t cursnapshot; 149 150 struct inodesc { 151 enum fixstate id_fix; /* policy on fixing errors */ 152 int (*id_func)(); /* function to be applied to blocks of inode */ 153 ino_t id_number; /* inode number described */ 154 ino_t id_parent; /* for DATA nodes, their parent */ 155 ufs_lbn_t id_lbn; /* logical block number of current block */ 156 ufs2_daddr_t id_blkno; /* current block number being examined */ 157 int id_numfrags; /* number of frags contained in block */ 158 off_t id_filesize; /* for DATA nodes, the size of the directory */ 159 ufs2_daddr_t id_entryno;/* for DATA nodes, current entry number */ 160 int id_loc; /* for DATA nodes, current location in dir */ 161 struct direct *id_dirp; /* for DATA nodes, ptr to current entry */ 162 char *id_name; /* for DATA nodes, name to find or enter */ 163 char id_type; /* type of descriptor, DATA or ADDR */ 164 }; 165 /* file types */ 166 #define DATA 1 /* a directory */ 167 #define SNAP 2 /* a snapshot */ 168 #define ADDR 3 /* anything but a directory or a snapshot */ 169 170 /* 171 * Linked list of duplicate blocks. 172 * 173 * The list is composed of two parts. The first part of the 174 * list (from duplist through the node pointed to by muldup) 175 * contains a single copy of each duplicate block that has been 176 * found. The second part of the list (from muldup to the end) 177 * contains duplicate blocks that have been found more than once. 178 * To check if a block has been found as a duplicate it is only 179 * necessary to search from duplist through muldup. To find the 180 * total number of times that a block has been found as a duplicate 181 * the entire list must be searched for occurences of the block 182 * in question. The following diagram shows a sample list where 183 * w (found twice), x (found once), y (found three times), and z 184 * (found once) are duplicate block numbers: 185 * 186 * w -> y -> x -> z -> y -> w -> y 187 * ^ ^ 188 * | | 189 * duplist muldup 190 */ 191 struct dups { 192 struct dups *next; 193 ufs2_daddr_t dup; 194 }; 195 struct dups *duplist; /* head of dup list */ 196 struct dups *muldup; /* end of unique duplicate dup block numbers */ 197 198 /* 199 * Linked list of inodes with zero link counts. 200 */ 201 struct zlncnt { 202 struct zlncnt *next; 203 ino_t zlncnt; 204 }; 205 struct zlncnt *zlnhead; /* head of zero link count list */ 206 207 /* 208 * Inode cache data structures. 209 */ 210 struct inoinfo { 211 struct inoinfo *i_nexthash; /* next entry in hash chain */ 212 ino_t i_number; /* inode number of this entry */ 213 ino_t i_parent; /* inode number of parent */ 214 ino_t i_dotdot; /* inode number of `..' */ 215 size_t i_isize; /* size of inode */ 216 u_int i_numblks; /* size of block array in bytes */ 217 ufs2_daddr_t i_blks[1]; /* actually longer */ 218 } **inphead, **inpsort; 219 long numdirs, dirhash, listmax, inplast; 220 long countdirs; /* number of directories we actually found */ 221 222 #define MIBSIZE 3 /* size of fsck sysctl MIBs */ 223 int adjrefcnt[MIBSIZE]; /* MIB command to adjust inode reference cnt */ 224 int adjblkcnt[MIBSIZE]; /* MIB command to adjust inode block count */ 225 int freefiles[MIBSIZE]; /* MIB command to free a set of files */ 226 int freedirs[MIBSIZE]; /* MIB command to free a set of directories */ 227 int freeblks[MIBSIZE]; /* MIB command to free a set of data blocks */ 228 struct fsck_cmd cmd; /* sysctl filesystem update commands */ 229 char snapname[BUFSIZ]; /* when doing snapshots, the name of the file */ 230 char *cdevname; /* name of device being checked */ 231 long dev_bsize; /* computed value of DEV_BSIZE */ 232 long secsize; /* actual disk sector size */ 233 char nflag; /* assume a no response */ 234 char yflag; /* assume a yes response */ 235 int bkgrdflag; /* use a snapshot to run on an active system */ 236 int bflag; /* location of alternate super block */ 237 int debug; /* output debugging info */ 238 int cvtlevel; /* convert to newer filesystem format */ 239 int bkgrdcheck; /* determine if background check is possible */ 240 char usedsoftdep; /* just fix soft dependency inconsistencies */ 241 char preen; /* just fix normal inconsistencies */ 242 char rerun; /* rerun fsck. Only used in non-preen mode */ 243 int returntosingle; /* 1 => return to single user mode on exit */ 244 char resolved; /* cleared if unresolved changes => not clean */ 245 char havesb; /* superblock has been read */ 246 char skipclean; /* skip clean filesystems if preening */ 247 int fsmodified; /* 1 => write done to filesystem */ 248 int fsreadfd; /* file descriptor for reading filesystem */ 249 int fswritefd; /* file descriptor for writing filesystem */ 250 251 ufs2_daddr_t maxfsblock; /* number of blocks in the filesystem */ 252 char *blockmap; /* ptr to primary blk allocation map */ 253 ino_t maxino; /* number of inodes in filesystem */ 254 255 ino_t lfdir; /* lost & found directory inode number */ 256 char *lfname; /* lost & found directory name */ 257 int lfmode; /* lost & found directory creation mode */ 258 259 ufs2_daddr_t n_blks; /* number of blocks in use */ 260 ino_t n_files; /* number of files in use */ 261 262 int got_siginfo; /* received a SIGINFO */ 263 264 #define clearinode(dp) \ 265 if (sblock.fs_magic == FS_UFS1_MAGIC) { \ 266 (dp)->dp1 = ufs1_zino; \ 267 } else { \ 268 (dp)->dp2 = ufs2_zino; \ 269 } 270 struct ufs1_dinode ufs1_zino; 271 struct ufs2_dinode ufs2_zino; 272 273 #define setbmap(blkno) setbit(blockmap, blkno) 274 #define testbmap(blkno) isset(blockmap, blkno) 275 #define clrbmap(blkno) clrbit(blockmap, blkno) 276 277 #define STOP 0x01 278 #define SKIP 0x02 279 #define KEEPON 0x04 280 #define ALTERED 0x08 281 #define FOUND 0x10 282 283 #define EEXIT 8 /* Standard error exit. */ 284 285 struct fstab; 286 287 288 void adjust(struct inodesc *, int lcnt); 289 ufs2_daddr_t allocblk(long frags); 290 ino_t allocdir(ino_t parent, ino_t request, int mode); 291 ino_t allocino(ino_t request, int type); 292 void blkerror(ino_t ino, char *type, ufs2_daddr_t blk); 293 char *blockcheck(char *name); 294 int bread(int fd, char *buf, ufs2_daddr_t blk, long size); 295 void bufinit(void); 296 void bwrite(int fd, char *buf, ufs2_daddr_t blk, long size); 297 void cacheino(union dinode *dp, ino_t inumber); 298 void catch(int); 299 void catchquit(int); 300 int changeino(ino_t dir, char *name, ino_t newnum); 301 int chkrange(ufs2_daddr_t blk, int cnt); 302 void ckfini(int markclean); 303 int ckinode(union dinode *dp, struct inodesc *); 304 void clri(struct inodesc *, char *type, int flag); 305 int clearentry(struct inodesc *); 306 void direrror(ino_t ino, char *errmesg); 307 int dirscan(struct inodesc *); 308 int dofix(struct inodesc *, char *msg); 309 void ffs_clrblock(struct fs *, u_char *, ufs1_daddr_t); 310 void ffs_fragacct(struct fs *, int, int32_t [], int); 311 int ffs_isblock(struct fs *, u_char *, ufs1_daddr_t); 312 void ffs_setblock(struct fs *, u_char *, ufs1_daddr_t); 313 void fileerror(ino_t cwd, ino_t ino, char *errmesg); 314 int findino(struct inodesc *); 315 int findname(struct inodesc *); 316 void flush(int fd, struct bufarea *bp); 317 void freeblk(ufs2_daddr_t blkno, long frags); 318 void freeino(ino_t ino); 319 void freeinodebuf(void); 320 int ftypeok(union dinode *dp); 321 void getblk(struct bufarea *bp, ufs2_daddr_t blk, long size); 322 struct bufarea *getdatablk(ufs2_daddr_t blkno, long size); 323 struct inoinfo *getinoinfo(ino_t inumber); 324 union dinode *getnextinode(ino_t inumber); 325 void getpathname(char *namebuf, ino_t curdir, ino_t ino); 326 union dinode *ginode(ino_t inumber); 327 void infohandler(int sig); 328 void inocleanup(void); 329 void inodirty(void); 330 struct inostat *inoinfo(ino_t inum); 331 int linkup(ino_t orphan, ino_t parentdir, char *name); 332 int makeentry(ino_t parent, ino_t ino, char *name); 333 void panic(const char *fmt, ...) __printflike(1, 2); 334 void pass1(void); 335 void pass1b(void); 336 int pass1check(struct inodesc *); 337 void pass2(void); 338 void pass3(void); 339 void pass4(void); 340 int pass4check(struct inodesc *); 341 void pass5(void); 342 void pfatal(const char *fmt, ...) __printflike(1, 2); 343 void pinode(ino_t ino); 344 void propagate(void); 345 void pwarn(const char *fmt, ...) __printflike(1, 2); 346 int readsb(int listerr); 347 int reply(char *question); 348 void rwerror(char *mesg, ufs2_daddr_t blk); 349 void sblock_init(void); 350 void setinodebuf(ino_t); 351 int setup(char *dev); 352