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_EMPTY 10 /* Buffer allocated but not filled */ 204 #define BT_NUMBUFTYPES 11 205 #define BT_NAMES { \ 206 "unknown", \ 207 "Superblock", \ 208 "Cylinder Group", \ 209 "Single Level Indirect", \ 210 "Double Level Indirect", \ 211 "Triple Level Indirect", \ 212 "External Attribute", \ 213 "Inode Block", \ 214 "Directory Contents", \ 215 "User Data", \ 216 "Allocated but not filled" } 217 extern char *buftype[]; 218 #define BT_BUFTYPE(type) \ 219 type < BT_NUMBUFTYPES ? buftype[type] : buftype[BT_UNKNOWN] 220 extern long readcnt[BT_NUMBUFTYPES]; 221 extern long totalreadcnt[BT_NUMBUFTYPES]; 222 extern struct timespec readtime[BT_NUMBUFTYPES]; 223 extern struct timespec totalreadtime[BT_NUMBUFTYPES]; 224 extern struct timespec startprog; 225 226 extern struct bufarea *icachebp; /* inode cache buffer */ 227 extern struct bufarea sblk; /* file system superblock */ 228 extern struct bufarea *pdirbp; /* current directory contents */ 229 extern int sujrecovery; /* 1 => doing check using the journal */ 230 231 #define dirty(bp) do { \ 232 if (fswritefd < 0) \ 233 pfatal("SETTING DIRTY FLAG IN READ_ONLY MODE\n"); \ 234 else \ 235 (bp)->b_flags |= B_DIRTY; \ 236 } while (0) 237 #define initbarea(bp, type) do { \ 238 (bp)->b_bno = (ufs2_daddr_t)-1; \ 239 (bp)->b_size = 0; \ 240 (bp)->b_errs = 0; \ 241 (bp)->b_flags = 0; \ 242 (bp)->b_type = type; \ 243 (bp)->b_refcnt = 0; \ 244 (bp)->b_index = 0; \ 245 } while (0) 246 247 #define sbdirty() dirty(&sblk) 248 #define sblock (*sblk.b_un.b_fs) 249 250 enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE}; 251 extern ino_t cursnapshot; 252 253 struct inodesc { 254 enum fixstate id_fix; /* policy on fixing errors */ 255 int (*id_func)(struct inodesc *); 256 /* function to be applied to blocks of inode */ 257 struct bufarea *id_bp; /* ckinode: buffer with indirect pointers */ 258 union dinode *id_dp; /* ckinode: dinode being traversed */ 259 ino_t id_number; /* inode number described */ 260 ino_t id_parent; /* for DATA nodes, their parent */ 261 ufs_lbn_t id_lbn; /* logical block number of current block */ 262 ufs2_daddr_t id_blkno; /* current block number being examined */ 263 int id_level; /* level of indirection of this block */ 264 int id_numfrags; /* number of frags contained in block */ 265 ufs_lbn_t id_lballoc; /* pass1: last LBN that is allocated */ 266 off_t id_filesize; /* for DATA nodes, the size of the directory */ 267 ufs2_daddr_t id_entryno;/* for DATA nodes, current entry number */ 268 int id_loc; /* for DATA nodes, current location in dir */ 269 struct direct *id_dirp; /* for DATA nodes, ptr to current entry */ 270 char *id_name; /* for DATA nodes, name to find or enter */ 271 char id_type; /* type of descriptor, DATA, ADDR, or SNAP */ 272 }; 273 /* file types */ 274 #define DATA 1 /* a directory */ 275 #define SNAP 2 /* a snapshot */ 276 #define ADDR 3 /* anything but a directory or a snapshot */ 277 278 /* 279 * Linked list of duplicate blocks. 280 * 281 * The list is composed of two parts. The first part of the 282 * list (from duplist through the node pointed to by muldup) 283 * contains a single copy of each duplicate block that has been 284 * found. The second part of the list (from muldup to the end) 285 * contains duplicate blocks that have been found more than once. 286 * To check if a block has been found as a duplicate it is only 287 * necessary to search from duplist through muldup. To find the 288 * total number of times that a block has been found as a duplicate 289 * the entire list must be searched for occurrences of the block 290 * in question. The following diagram shows a sample list where 291 * w (found twice), x (found once), y (found three times), and z 292 * (found once) are duplicate block numbers: 293 * 294 * w -> y -> x -> z -> y -> w -> y 295 * ^ ^ 296 * | | 297 * duplist muldup 298 */ 299 struct dups { 300 struct dups *next; 301 ufs2_daddr_t dup; 302 }; 303 extern struct dups *duplist; /* head of dup list */ 304 extern struct dups *muldup; /* end of unique duplicate dup block numbers */ 305 306 /* 307 * Inode cache data structures. 308 */ 309 extern struct inoinfo { 310 struct inoinfo *i_nexthash; /* next entry in hash chain */ 311 ino_t i_number; /* inode number of this entry */ 312 ino_t i_parent; /* inode number of parent */ 313 ino_t i_dotdot; /* inode number of `..' */ 314 size_t i_isize; /* size of inode */ 315 u_int i_numblks; /* size of block array in bytes */ 316 ufs2_daddr_t i_blks[1]; /* actually longer */ 317 } **inphead, **inpsort; 318 extern long dirhash, inplast; 319 extern unsigned long numdirs, listmax; 320 extern long countdirs; /* number of directories we actually found */ 321 322 #define MIBSIZE 3 /* size of fsck sysctl MIBs */ 323 extern int adjrefcnt[MIBSIZE]; /* MIB command to adjust inode reference cnt */ 324 extern int adjblkcnt[MIBSIZE]; /* MIB command to adjust inode block count */ 325 extern int setsize[MIBSIZE]; /* MIB command to set inode size */ 326 extern int adjndir[MIBSIZE]; /* MIB command to adjust number of directories */ 327 extern int adjnbfree[MIBSIZE]; /* MIB command to adjust number of free blocks */ 328 extern int adjnifree[MIBSIZE]; /* MIB command to adjust number of free inodes */ 329 extern int adjnffree[MIBSIZE]; /* MIB command to adjust number of free frags */ 330 extern int adjnumclusters[MIBSIZE]; /* MIB command to adjust number of free clusters */ 331 extern int freefiles[MIBSIZE]; /* MIB command to free a set of files */ 332 extern int freedirs[MIBSIZE]; /* MIB command to free a set of directories */ 333 extern int freeblks[MIBSIZE]; /* MIB command to free a set of data blocks */ 334 extern struct fsck_cmd cmd; /* sysctl file system update commands */ 335 extern char snapname[BUFSIZ]; /* when doing snapshots, the name of the file */ 336 extern char *cdevname; /* name of device being checked */ 337 extern long dev_bsize; /* computed value of DEV_BSIZE */ 338 extern long secsize; /* actual disk sector size */ 339 extern u_int real_dev_bsize; /* actual disk sector size, not overridden */ 340 extern char nflag; /* assume a no response */ 341 extern char yflag; /* assume a yes response */ 342 extern int bkgrdflag; /* use a snapshot to run on an active system */ 343 extern off_t bflag; /* location of alternate super block */ 344 extern int debug; /* output debugging info */ 345 extern int Eflag; /* delete empty data blocks */ 346 extern int Zflag; /* zero empty data blocks */ 347 extern int zflag; /* zero unused directory space */ 348 extern int inoopt; /* trim out unused inodes */ 349 extern char ckclean; /* only do work if not cleanly unmounted */ 350 extern int cvtlevel; /* convert to newer file system format */ 351 extern int ckhashadd; /* check hashes to be added */ 352 extern int bkgrdcheck; /* determine if background check is possible */ 353 extern int bkgrdsumadj; /* whether the kernel have ability to adjust superblock summary */ 354 extern char usedsoftdep; /* just fix soft dependency inconsistencies */ 355 extern char preen; /* just fix normal inconsistencies */ 356 extern char rerun; /* rerun fsck. Only used in non-preen mode */ 357 extern int returntosingle; /* 1 => return to single user mode on exit */ 358 extern char resolved; /* cleared if unresolved changes => not clean */ 359 extern int sbhashfailed; /* when reading superblock check hash failed */ 360 extern char havesb; /* superblock has been read */ 361 extern char skipclean; /* skip clean file systems if preening */ 362 extern int fsmodified; /* 1 => write done to file system */ 363 extern int fsreadfd; /* file descriptor for reading file system */ 364 extern int fswritefd; /* file descriptor for writing file system */ 365 extern int surrender; /* Give up if reads fail */ 366 extern int wantrestart; /* Restart fsck on early termination */ 367 368 extern ufs2_daddr_t maxfsblock; /* number of blocks in the file system */ 369 extern char *blockmap; /* ptr to primary blk allocation map */ 370 extern ino_t maxino; /* number of inodes in file system */ 371 372 extern ino_t lfdir; /* lost & found directory inode number */ 373 extern const char *lfname; /* lost & found directory name */ 374 extern int lfmode; /* lost & found directory creation mode */ 375 376 extern ufs2_daddr_t n_blks; /* number of blocks in use */ 377 extern ino_t n_files; /* number of files in use */ 378 379 extern volatile sig_atomic_t got_siginfo; /* received a SIGINFO */ 380 extern volatile sig_atomic_t got_sigalarm; /* received a SIGALRM */ 381 382 #define clearinode(dp) \ 383 if (sblock.fs_magic == FS_UFS1_MAGIC) { \ 384 (dp)->dp1 = zino.dp1; \ 385 } else { \ 386 (dp)->dp2 = zino.dp2; \ 387 } 388 extern union dinode zino; 389 390 #define setbmap(blkno) setbit(blockmap, blkno) 391 #define testbmap(blkno) isset(blockmap, blkno) 392 #define clrbmap(blkno) clrbit(blockmap, blkno) 393 394 #define STOP 0x01 395 #define SKIP 0x02 396 #define KEEPON 0x04 397 #define ALTERED 0x08 398 #define FOUND 0x10 399 400 #define EEXIT 8 /* Standard error exit. */ 401 #define ERERUN 16 /* fsck needs to be re-run. */ 402 #define ERESTART -1 403 404 int flushentry(void); 405 /* 406 * Wrapper for malloc() that flushes the cylinder group cache to try 407 * to get space. 408 */ 409 static inline void* 410 Malloc(size_t size) 411 { 412 void *retval; 413 414 while ((retval = malloc(size)) == NULL) 415 if (flushentry() == 0) 416 break; 417 return (retval); 418 } 419 420 /* 421 * Wrapper for calloc() that flushes the cylinder group cache to try 422 * to get space. 423 */ 424 static inline void* 425 Calloc(size_t cnt, size_t size) 426 { 427 void *retval; 428 429 while ((retval = calloc(cnt, size)) == NULL) 430 if (flushentry() == 0) 431 break; 432 return (retval); 433 } 434 435 struct fstab; 436 437 438 void adjust(struct inodesc *, int lcnt); 439 void alarmhandler(int sig); 440 ufs2_daddr_t allocblk(long frags); 441 ino_t allocdir(ino_t parent, ino_t request, int mode); 442 ino_t allocino(ino_t request, int type); 443 void blkerror(ino_t ino, const char *type, ufs2_daddr_t blk); 444 char *blockcheck(char *name); 445 int blread(int fd, char *buf, ufs2_daddr_t blk, long size); 446 void bufinit(void); 447 void blwrite(int fd, char *buf, ufs2_daddr_t blk, ssize_t size); 448 void blerase(int fd, ufs2_daddr_t blk, long size); 449 void blzero(int fd, ufs2_daddr_t blk, long size); 450 void brelse(struct bufarea *); 451 void cacheino(union dinode *dp, ino_t inumber); 452 void catch(int); 453 void catchquit(int); 454 void cgdirty(struct bufarea *); 455 struct bufarea *cglookup(int cg); 456 int changeino(ino_t dir, const char *name, ino_t newnum); 457 int check_cgmagic(int cg, struct bufarea *cgbp, int requestrebuild); 458 int chkrange(ufs2_daddr_t blk, int cnt); 459 void ckfini(int markclean); 460 int ckinode(union dinode *dp, struct inodesc *); 461 void clri(struct inodesc *, const char *type, int flag); 462 int clearentry(struct inodesc *); 463 void direrror(ino_t ino, const char *errmesg); 464 int dirscan(struct inodesc *); 465 int dofix(struct inodesc *, const char *msg); 466 int eascan(struct inodesc *, struct ufs2_dinode *dp); 467 void fileerror(ino_t cwd, ino_t ino, const char *errmesg); 468 void finalIOstats(void); 469 int findino(struct inodesc *); 470 int findname(struct inodesc *); 471 void flush(int fd, struct bufarea *bp); 472 int freeblock(struct inodesc *); 473 void freeino(ino_t ino); 474 void freeinodebuf(void); 475 void fsutilinit(void); 476 int ftypeok(union dinode *dp); 477 void getblk(struct bufarea *bp, ufs2_daddr_t blk, long size); 478 struct bufarea *getdatablk(ufs2_daddr_t blkno, long size, int type); 479 struct inoinfo *getinoinfo(ino_t inumber); 480 union dinode *getnextinode(ino_t inumber, int rebuildcg); 481 void getpathname(char *namebuf, ino_t curdir, ino_t ino); 482 void ginode(ino_t, struct inode *); 483 void infohandler(int sig); 484 void irelse(struct inode *); 485 ufs2_daddr_t ino_blkatoff(union dinode *, ino_t, ufs_lbn_t, int *, 486 struct bufarea **); 487 void inocleanup(void); 488 void inodirty(struct inode *); 489 struct inostat *inoinfo(ino_t inum); 490 void IOstats(char *what); 491 int linkup(ino_t orphan, ino_t parentdir, char *name); 492 int makeentry(ino_t parent, ino_t ino, const char *name); 493 int openfilesys(char *dev); 494 void panic(const char *fmt, ...) __printflike(1, 2); 495 void pass1(void); 496 void pass1b(void); 497 int pass1check(struct inodesc *); 498 void pass2(void); 499 void pass3(void); 500 void pass4(void); 501 void pass5(void); 502 void pfatal(const char *fmt, ...) __printflike(1, 2); 503 void propagate(void); 504 void prtinode(struct inode *); 505 void pwarn(const char *fmt, ...) __printflike(1, 2); 506 int readsb(int listerr); 507 int reply(const char *question); 508 void rwerror(const char *mesg, ufs2_daddr_t blk); 509 void sblock_init(void); 510 void setinodebuf(int, ino_t); 511 int setup(char *dev); 512 void gjournal_check(const char *filesys); 513 int suj_check(const char *filesys); 514 void update_maps(struct cg *, struct cg*, int); 515 void fsckinit(void); 516 517 #endif /* !_FSCK_H_ */ 518