1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause and BSD-2-Clause-FreeBSD 3 * 4 * Copyright (c) 2002 Networks Associates Technology, Inc. 5 * All rights reserved. 6 * 7 * This software was developed for the FreeBSD Project by Marshall 8 * Kirk McKusick and Network Associates Laboratories, the Security 9 * Research Division of Network Associates, Inc. under DARPA/SPAWAR 10 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS 11 * research program. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * Copyright (c) 1980, 1986, 1993 35 * The Regents of the University of California. All rights reserved. 36 * 37 * Redistribution and use in source and binary forms, with or without 38 * modification, are permitted provided that the following conditions 39 * are met: 40 * 1. Redistributions of source code must retain the above copyright 41 * notice, this list of conditions and the following disclaimer. 42 * 2. Redistributions in binary form must reproduce the above copyright 43 * notice, this list of conditions and the following disclaimer in the 44 * documentation and/or other materials provided with the distribution. 45 * 3. Neither the name of the University nor the names of its contributors 46 * may be used to endorse or promote products derived from this software 47 * without specific prior written permission. 48 * 49 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 59 * SUCH DAMAGE. 60 * 61 * @(#)fsck.h 8.4 (Berkeley) 5/9/95 62 * $FreeBSD$ 63 */ 64 65 #ifndef _FSCK_H_ 66 #define _FSCK_H_ 67 68 #include <unistd.h> 69 #include <stdlib.h> 70 #include <stdio.h> 71 72 #include <sys/queue.h> 73 74 #define MAXDUP 10 /* limit on dup blks (per inode) */ 75 #define MAXBAD 10 /* limit on bad blks (per inode) */ 76 #define MINBUFS 100 /* minimum number of buffers required */ 77 #define INOBUFSIZE 64*1024 /* size of buffer to read inodes in pass1 */ 78 #define ZEROBUFSIZE (dev_bsize * 128) /* size of zero buffer used by -Z */ 79 80 union dinode { 81 struct ufs1_dinode dp1; 82 struct ufs2_dinode dp2; 83 }; 84 #define DIP(dp, field) \ 85 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \ 86 (dp)->dp1.field : (dp)->dp2.field) 87 88 #define DIP_SET(dp, field, val) do { \ 89 if (sblock.fs_magic == FS_UFS1_MAGIC) \ 90 (dp)->dp1.field = (val); \ 91 else \ 92 (dp)->dp2.field = (val); \ 93 } while (0) 94 95 /* 96 * Each inode on the file system is described by the following structure. 97 * The linkcnt is initially set to the value in the inode. Each time it 98 * is found during the descent in passes 2, 3, and 4 the count is 99 * decremented. Any inodes whose count is non-zero after pass 4 needs to 100 * have its link count adjusted by the value remaining in ino_linkcnt. 101 */ 102 struct inostat { 103 u_char ino_state; /* state of inode, see below */ 104 u_char ino_type:4; /* type of inode */ 105 u_char ino_idtype:4; /* idesc id_type, SNAP or ADDR */ 106 u_short ino_linkcnt; /* number of links not found */ 107 }; 108 /* 109 * Inode states. 110 */ 111 #define USTATE 0x1 /* inode not allocated */ 112 #define FSTATE 0x2 /* inode is file */ 113 #define FZLINK 0x3 /* inode is file with a link count of zero */ 114 #define DSTATE 0x4 /* inode is directory */ 115 #define DZLINK 0x5 /* inode is directory with a zero link count */ 116 #define DFOUND 0x6 /* directory found during descent */ 117 /* 0x7 UNUSED - see S_IS_DVALID() definition */ 118 #define DCLEAR 0x8 /* directory is to be cleared */ 119 #define FCLEAR 0x9 /* file is to be cleared */ 120 /* DUNFOUND === (state == DSTATE || state == DZLINK) */ 121 #define S_IS_DUNFOUND(state) (((state) & ~0x1) == DSTATE) 122 /* DVALID === (state == DSTATE || state == DZLINK || state == DFOUND) */ 123 #define S_IS_DVALID(state) (((state) & ~0x3) == DSTATE) 124 #define INO_IS_DUNFOUND(ino) S_IS_DUNFOUND(inoinfo(ino)->ino_state) 125 #define INO_IS_DVALID(ino) S_IS_DVALID(inoinfo(ino)->ino_state) 126 /* 127 * Inode state information is contained on per cylinder group lists 128 * which are described by the following structure. 129 */ 130 extern struct inostatlist { 131 long il_numalloced; /* number of inodes allocated in this cg */ 132 struct inostat *il_stat;/* inostat info for this cylinder group */ 133 } *inostathead; 134 135 /* 136 * Structure to reference a dinode. 137 */ 138 struct inode { 139 struct bufarea *i_bp; /* buffer containing the dinode */ 140 union dinode *i_dp; /* pointer to dinode in buffer */ 141 ino_t i_number; /* inode number */ 142 }; 143 144 /* 145 * Size of hash tables 146 */ 147 #define HASHSIZE 2048 148 #define HASH(x) ((x * 2654435761) & (HASHSIZE - 1)) 149 150 /* 151 * buffer cache structure. 152 */ 153 struct bufarea { 154 TAILQ_ENTRY(bufarea) b_list; /* LRU buffer queue */ 155 LIST_ENTRY(bufarea) b_hash; /* hash list */ 156 ufs2_daddr_t b_bno; /* disk block number */ 157 int b_size; /* size of I/O */ 158 int b_errs; /* I/O error */ 159 int b_flags; /* B_ flags below */ 160 int b_type; /* BT_ type below */ 161 int b_refcnt; /* ref count of users */ 162 int b_index; /* for BT_LEVEL, ptr index */ 163 /* for BT_INODES, first inum */ 164 union { 165 char *b_buf; /* buffer space */ 166 ufs1_daddr_t *b_indir1; /* UFS1 indirect block */ 167 ufs2_daddr_t *b_indir2; /* UFS2 indirect block */ 168 struct fs *b_fs; /* super block */ 169 struct cg *b_cg; /* cylinder group */ 170 struct ufs1_dinode *b_dinode1; /* UFS1 inode block */ 171 struct ufs2_dinode *b_dinode2; /* UFS2 inode block */ 172 } b_un; 173 }; 174 175 #define IBLK(bp, i) \ 176 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \ 177 (bp)->b_un.b_indir1[i] : (bp)->b_un.b_indir2[i]) 178 179 #define IBLK_SET(bp, i, val) do { \ 180 if (sblock.fs_magic == FS_UFS1_MAGIC) \ 181 (bp)->b_un.b_indir1[i] = (val); \ 182 else \ 183 (bp)->b_un.b_indir2[i] = (val); \ 184 } while (0) 185 186 /* 187 * Buffer flags 188 */ 189 #define B_DIRTY 0x00000001 /* Buffer is dirty */ 190 /* 191 * Type of data in buffer 192 */ 193 #define BT_UNKNOWN 0 /* Buffer type is unknown */ 194 #define BT_SUPERBLK 1 /* Buffer holds a superblock */ 195 #define BT_CYLGRP 2 /* Buffer holds a cylinder group map */ 196 #define BT_LEVEL1 3 /* Buffer holds single level indirect */ 197 #define BT_LEVEL2 4 /* Buffer holds double level indirect */ 198 #define BT_LEVEL3 5 /* Buffer holds triple level indirect */ 199 #define BT_EXTATTR 6 /* Buffer holds external attribute data */ 200 #define BT_INODES 7 /* Buffer holds inodes */ 201 #define BT_DIRDATA 8 /* Buffer holds directory data */ 202 #define BT_DATA 9 /* Buffer holds user data */ 203 #define BT_NUMBUFTYPES 10 204 #define BT_NAMES { \ 205 "unknown", \ 206 "Superblock", \ 207 "Cylinder Group", \ 208 "Single Level Indirect", \ 209 "Double Level Indirect", \ 210 "Triple Level Indirect", \ 211 "External Attribute", \ 212 "Inode Block", \ 213 "Directory Contents", \ 214 "User Data" } 215 extern char *buftype[]; 216 #define BT_BUFTYPE(type) \ 217 type < BT_NUMBUFTYPES ? buftype[type] : buftype[BT_UNKNOWN] 218 extern long readcnt[BT_NUMBUFTYPES]; 219 extern long totalreadcnt[BT_NUMBUFTYPES]; 220 extern struct timespec readtime[BT_NUMBUFTYPES]; 221 extern struct timespec totalreadtime[BT_NUMBUFTYPES]; 222 extern struct timespec startprog; 223 224 extern struct bufarea *icachebp; /* inode cache buffer */ 225 extern struct bufarea sblk; /* file system superblock */ 226 extern struct bufarea *pdirbp; /* current directory contents */ 227 228 #define dirty(bp) do { \ 229 if (fswritefd < 0) \ 230 pfatal("SETTING DIRTY FLAG IN READ_ONLY MODE\n"); \ 231 else \ 232 (bp)->b_flags |= B_DIRTY; \ 233 } while (0) 234 #define initbarea(bp, type) do { \ 235 (bp)->b_bno = (ufs2_daddr_t)-4; \ 236 (bp)->b_size = 0; \ 237 (bp)->b_errs = 0; \ 238 (bp)->b_flags = 0; \ 239 (bp)->b_type = type; \ 240 (bp)->b_refcnt = 0; \ 241 (bp)->b_index = 0; \ 242 } while (0) 243 244 #define sbdirty() dirty(&sblk) 245 #define sblock (*sblk.b_un.b_fs) 246 247 enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE}; 248 extern ino_t cursnapshot; 249 250 struct inodesc { 251 enum fixstate id_fix; /* policy on fixing errors */ 252 int (*id_func)(struct inodesc *); 253 /* function to be applied to blocks of inode */ 254 struct bufarea *id_bp; /* ckinode: buffer with indirect pointers */ 255 union dinode *id_dp; /* ckinode: dinode being traversed */ 256 ino_t id_number; /* inode number described */ 257 ino_t id_parent; /* for DATA nodes, their parent */ 258 ufs_lbn_t id_lbn; /* logical block number of current block */ 259 ufs2_daddr_t id_blkno; /* current block number being examined */ 260 int id_level; /* level of indirection of this block */ 261 int id_numfrags; /* number of frags contained in block */ 262 ufs_lbn_t id_lballoc; /* pass1: last LBN that is allocated */ 263 off_t id_filesize; /* for DATA nodes, the size of the directory */ 264 ufs2_daddr_t id_entryno;/* for DATA nodes, current entry number */ 265 int id_loc; /* for DATA nodes, current location in dir */ 266 struct direct *id_dirp; /* for DATA nodes, ptr to current entry */ 267 char *id_name; /* for DATA nodes, name to find or enter */ 268 char id_type; /* type of descriptor, DATA, ADDR, or SNAP */ 269 }; 270 /* file types */ 271 #define DATA 1 /* a directory */ 272 #define SNAP 2 /* a snapshot */ 273 #define ADDR 3 /* anything but a directory or a snapshot */ 274 275 /* 276 * Linked list of duplicate blocks. 277 * 278 * The list is composed of two parts. The first part of the 279 * list (from duplist through the node pointed to by muldup) 280 * contains a single copy of each duplicate block that has been 281 * found. The second part of the list (from muldup to the end) 282 * contains duplicate blocks that have been found more than once. 283 * To check if a block has been found as a duplicate it is only 284 * necessary to search from duplist through muldup. To find the 285 * total number of times that a block has been found as a duplicate 286 * the entire list must be searched for occurrences of the block 287 * in question. The following diagram shows a sample list where 288 * w (found twice), x (found once), y (found three times), and z 289 * (found once) are duplicate block numbers: 290 * 291 * w -> y -> x -> z -> y -> w -> y 292 * ^ ^ 293 * | | 294 * duplist muldup 295 */ 296 struct dups { 297 struct dups *next; 298 ufs2_daddr_t dup; 299 }; 300 extern struct dups *duplist; /* head of dup list */ 301 extern struct dups *muldup; /* end of unique duplicate dup block numbers */ 302 303 /* 304 * Inode cache data structures. 305 */ 306 extern struct inoinfo { 307 struct inoinfo *i_nexthash; /* next entry in hash chain */ 308 ino_t i_number; /* inode number of this entry */ 309 ino_t i_parent; /* inode number of parent */ 310 ino_t i_dotdot; /* inode number of `..' */ 311 size_t i_isize; /* size of inode */ 312 u_int i_flags; /* flags, see below */ 313 u_int i_numblks; /* size of block array in bytes */ 314 ufs2_daddr_t i_blks[1]; /* actually longer */ 315 } **inphead, **inpsort; 316 /* 317 * flags for struct inoinfo 318 */ 319 #define INFO_NEW 0x0000001 /* replaced broken directory */ 320 321 extern long dirhash, inplast; 322 extern unsigned long numdirs, listmax; 323 extern long countdirs; /* number of directories we actually found */ 324 325 #define MIBSIZE 3 /* size of fsck sysctl MIBs */ 326 extern int adjblkcnt[MIBSIZE]; /* MIB cmd to adjust inode block count */ 327 extern int adjrefcnt[MIBSIZE]; /* MIB cmd to adjust inode reference count */ 328 extern int adjndir[MIBSIZE]; /* MIB cmd to adjust number of directories */ 329 extern int adjnbfree[MIBSIZE]; /* MIB cmd to adjust number of free blocks */ 330 extern int adjnifree[MIBSIZE]; /* MIB cmd to adjust number of free inodes */ 331 extern int adjnffree[MIBSIZE]; /* MIB cmd to adjust number of free frags */ 332 extern int adjnumclusters[MIBSIZE]; /* MIB cmd adjust number of free clusters */ 333 extern int freefiles[MIBSIZE]; /* MIB cmd to free a set of files */ 334 extern int freedirs[MIBSIZE]; /* MIB cmd to free a set of directories */ 335 extern int freeblks[MIBSIZE]; /* MIB cmd to free a set of data blocks */ 336 extern int setsize[MIBSIZE]; /* MIB cmd to set inode size */ 337 extern struct fsck_cmd cmd; /* sysctl file system update commands */ 338 339 extern int bkgrdcheck; /* determine if background check is possible */ 340 extern int bkgrdsumadj; /* whether the kernel has the ability to adjust 341 the superblock summary fields */ 342 extern off_t bflag; /* location of alternate super block */ 343 extern int bkgrdflag; /* use a snapshot to run on an active system */ 344 extern char *blockmap; /* ptr to primary blk allocation map */ 345 extern char *cdevname; /* name of device being checked */ 346 extern char ckclean; /* only do work if not cleanly unmounted */ 347 extern int ckhashadd; /* check hashes to be added */ 348 extern char *copybuf; /* buffer to copy snapshot blocks */ 349 extern int cvtlevel; /* convert to newer file system format */ 350 extern long dev_bsize; /* computed value of DEV_BSIZE */ 351 extern u_int real_dev_bsize; /* actual disk sector size, not overridden */ 352 extern int debug; /* output debugging info */ 353 extern int Eflag; /* delete empty data blocks */ 354 extern int fsmodified; /* 1 => write done to file system */ 355 extern int fsreadfd; /* file descriptor for reading file system */ 356 extern int fswritefd; /* file descriptor for writing file system */ 357 extern char havesb; /* superblock has been read */ 358 extern int inoopt; /* trim out unused inodes */ 359 extern ino_t lfdir; /* lost & found directory inode number */ 360 extern int lfmode; /* lost & found directory creation mode */ 361 extern const char *lfname; /* lost & found directory name */ 362 extern ufs2_daddr_t maxfsblock; /* number of blocks in the file system */ 363 extern ino_t maxino; /* number of inodes in file system */ 364 extern ufs2_daddr_t n_blks; /* number of blocks in use */ 365 extern ino_t n_files; /* number of files in use */ 366 extern char nflag; /* assume a no response */ 367 extern char preen; /* just fix normal inconsistencies */ 368 extern char rerun; /* rerun fsck. Only used in non-preen mode */ 369 extern char resolved; /* cleared if unresolved changes => not clean */ 370 extern int returntosingle; /* 1 => return to single user mode on exit */ 371 extern long secsize; /* actual disk sector size */ 372 extern char skipclean; /* skip clean file systems if preening */ 373 extern int snapcnt; /* number of active snapshots */ 374 extern struct inode snaplist[FSMAXSNAP + 1]; /* list of active snapshots */ 375 extern char snapname[BUFSIZ]; /* when doing snapshots, the name of the file */ 376 extern int sujrecovery; /* 1 => doing check using the journal */ 377 extern int surrender; /* Give up if reads fail */ 378 extern char usedsoftdep; /* just fix soft dependency inconsistencies */ 379 extern int wantrestart; /* Restart fsck on early termination */ 380 extern char yflag; /* assume a yes response */ 381 extern int zflag; /* zero unused directory space */ 382 extern int Zflag; /* zero empty data blocks */ 383 384 extern volatile sig_atomic_t got_siginfo; /* received a SIGINFO */ 385 extern volatile sig_atomic_t got_sigalarm; /* received a SIGALRM */ 386 387 #define clearinode(dp) \ 388 if (sblock.fs_magic == FS_UFS1_MAGIC) { \ 389 (dp)->dp1 = zino.dp1; \ 390 } else { \ 391 (dp)->dp2 = zino.dp2; \ 392 } 393 extern union dinode zino; 394 395 #define setbmap(blkno) setbit(blockmap, blkno) 396 #define testbmap(blkno) isset(blockmap, blkno) 397 #define clrbmap(blkno) clrbit(blockmap, blkno) 398 399 #define STOP 0x01 400 #define SKIP 0x02 401 #define KEEPON 0x04 402 #define ALTERED 0x08 403 #define FOUND 0x10 404 405 #define EEXIT 8 /* Standard error exit. */ 406 #define ERERUN 16 /* fsck needs to be re-run. */ 407 #define ERESTART -1 408 409 int flushentry(void); 410 /* 411 * Wrapper for malloc() that flushes the cylinder group cache to try 412 * to get space. 413 */ 414 static inline void* 415 Malloc(size_t size) 416 { 417 void *retval; 418 419 while ((retval = malloc(size)) == NULL) 420 if (flushentry() == 0) 421 break; 422 return (retval); 423 } 424 425 /* 426 * Wrapper for calloc() that flushes the cylinder group cache to try 427 * to get space. 428 */ 429 static inline void* 430 Calloc(size_t cnt, size_t size) 431 { 432 void *retval; 433 434 while ((retval = calloc(cnt, size)) == NULL) 435 if (flushentry() == 0) 436 break; 437 return (retval); 438 } 439 440 struct fstab; 441 442 443 void adjust(struct inodesc *, int lcnt); 444 void alarmhandler(int sig); 445 ufs2_daddr_t allocblk(long cg, long frags, ufs2_daddr_t (*checkblkavail) 446 (ufs2_daddr_t blkno, long frags)); 447 ino_t allocdir(ino_t parent, ino_t request, int mode); 448 ino_t allocino(ino_t request, int type); 449 void binval(struct bufarea *); 450 void blkerror(ino_t ino, const char *type, ufs2_daddr_t blk); 451 char *blockcheck(char *name); 452 int blread(int fd, char *buf, ufs2_daddr_t blk, long size); 453 void bufinit(void); 454 void blwrite(int fd, char *buf, ufs2_daddr_t blk, ssize_t size); 455 void blerase(int fd, ufs2_daddr_t blk, long size); 456 void blzero(int fd, ufs2_daddr_t blk, long size); 457 void brelse(struct bufarea *); 458 struct inoinfo *cacheino(union dinode *dp, ino_t inumber); 459 void catch(int); 460 void catchquit(int); 461 void cgdirty(struct bufarea *); 462 struct bufarea *cglookup(int cg); 463 int changeino(ino_t dir, const char *name, ino_t newnum); 464 void check_blkcnt(struct inode *ip); 465 int check_cgmagic(int cg, struct bufarea *cgbp, int requestrebuild); 466 int chkrange(ufs2_daddr_t blk, int cnt); 467 void ckfini(int markclean); 468 int ckinode(union dinode *dp, struct inodesc *); 469 void clri(struct inodesc *, const char *type, int flag); 470 int clearentry(struct inodesc *); 471 void copyonwrite(struct fs *, struct bufarea *, 472 ufs2_daddr_t (*checkblkavail)(ufs2_daddr_t, long)); 473 void direrror(ino_t ino, const char *errmesg); 474 int dirscan(struct inodesc *); 475 int dofix(struct inodesc *, const char *msg); 476 int eascan(struct inodesc *, struct ufs2_dinode *dp); 477 void fileerror(ino_t cwd, ino_t ino, const char *errmesg); 478 void finalIOstats(void); 479 int findino(struct inodesc *); 480 int findname(struct inodesc *); 481 void flush(int fd, struct bufarea *bp); 482 int freeblock(struct inodesc *); 483 void freeino(ino_t ino); 484 void freeinodebuf(void); 485 void fsckinit(void); 486 void fsutilinit(void); 487 int ftypeok(union dinode *dp); 488 void getblk(struct bufarea *bp, ufs2_daddr_t blk, long size); 489 struct bufarea *getdatablk(ufs2_daddr_t blkno, long size, int type); 490 struct inoinfo *getinoinfo(ino_t inumber); 491 union dinode *getnextinode(ino_t inumber, int rebuildcg); 492 void getpathname(char *namebuf, ino_t curdir, ino_t ino); 493 void ginode(ino_t, struct inode *); 494 void gjournal_check(const char *filesys); 495 void infohandler(int sig); 496 void irelse(struct inode *); 497 ufs2_daddr_t ino_blkatoff(union dinode *, ino_t, ufs_lbn_t, int *, 498 struct bufarea **); 499 void inocleanup(void); 500 void inodirty(struct inode *); 501 struct inostat *inoinfo(ino_t inum); 502 void IOstats(char *what); 503 int linkup(ino_t orphan, ino_t parentdir, char *name); 504 int makeentry(ino_t parent, ino_t ino, const char *name); 505 int openfilesys(char *dev); 506 void panic(const char *fmt, ...) __printflike(1, 2); 507 void pass1(void); 508 void pass1b(void); 509 int pass1check(struct inodesc *); 510 void pass2(void); 511 void pass3(void); 512 void pass4(void); 513 void pass5(void); 514 void pfatal(const char *fmt, ...) __printflike(1, 2); 515 void propagate(void); 516 void prtbuf(struct bufarea *, const char *, ...) __printflike(2, 3); 517 void prtinode(struct inode *); 518 void pwarn(const char *fmt, ...) __printflike(1, 2); 519 int readsb(void); 520 int reply(const char *question); 521 void rwerror(const char *mesg, ufs2_daddr_t blk); 522 void sblock_init(void); 523 void setinodebuf(int, ino_t); 524 int setup(char *dev); 525 int snapblkfree(struct fs *, ufs2_daddr_t, long, ino_t, 526 ufs2_daddr_t (*)(ufs2_daddr_t, long)); 527 void snapremove(ino_t); 528 void snapflush(ufs2_daddr_t (*checkblkavail)(ufs2_daddr_t, long)); 529 ufs2_daddr_t std_checkblkavail(ufs2_daddr_t blkno, long frags); 530 ufs2_daddr_t suj_checkblkavail(ufs2_daddr_t, long); 531 int suj_check(const char *filesys); 532 void update_maps(struct cg *, struct cg*, int); 533 534 #endif /* !_FSCK_H_ */ 535