fsck.h revision 1.1
1/* $NetBSD: fsck.h,v 1.13 1996/10/11 20:15:46 thorpej Exp $ */ 2 3/* Modified for EXT2FS on NetBSD by Manuel Bouyer, April 1997 */ 4 5/* 6 * Copyright (c) 1980, 1986, 1993 7 * The Regents of the University of California. All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. All advertising materials mentioning features or use of this software 18 * must display the following acknowledgement: 19 * This product includes software developed by the University of 20 * California, Berkeley and its contributors. 21 * 4. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * @(#)fsck.h 8.1 (Berkeley) 6/5/93 38 */ 39 40#define MAXDUP 10 /* limit on dup blks (per inode) */ 41#define MAXBAD 10 /* limit on bad blks (per inode) */ 42#define MAXBUFSPACE 80*1024 /* maximum space to allocate to buffers */ 43#define INOBUFSIZE 128*1024 /* size of buffer to read inodes in pass1 */ 44 45#ifndef BUFSIZ 46#define BUFSIZ 1024 47#endif 48 49#define USTATE 01 /* inode not allocated */ 50#define FSTATE 02 /* inode is file */ 51#define DSTATE 03 /* inode is directory */ 52#define DFOUND 04 /* directory found during descent */ 53#define DCLEAR 05 /* directory is to be cleared */ 54#define FCLEAR 06 /* file is to be cleared */ 55 56/* 57 * buffer cache structure. 58 */ 59struct bufarea { 60 struct bufarea *b_next; /* free list queue */ 61 struct bufarea *b_prev; /* free list queue */ 62 daddr_t b_bno; 63 int b_size; 64 int b_errs; 65 int b_flags; 66 union { 67 char *b_buf; /* buffer space */ 68 daddr_t *b_indir; /* indirect block */ 69 struct m_ext2fs *b_fs; /* super block */ 70 struct ext2_gd *b_cgd; /* cylinder group descriptor */ 71 struct ext2fs_dinode *b_dinode; /* inode block */ 72 } b_un; 73 char b_dirty; 74}; 75 76#define B_INUSE 1 77 78#define MINBUFS 5 /* minimum number of buffers required */ 79struct bufarea bufhead; /* head of list of other blks in filesys */ 80struct bufarea sblk; /* file system superblock */ 81struct bufarea *pdirbp; /* current directory contents */ 82struct bufarea *pbp; /* current inode block */ 83struct bufarea *getdatablk __P((daddr_t, long)); 84 85#define dirty(bp) (bp)->b_dirty = 1 86#define initbarea(bp) \ 87 (bp)->b_dirty = 0; \ 88 (bp)->b_bno = (daddr_t)-1; \ 89 (bp)->b_flags = 0; 90 91#define sbdirty() sblk.b_dirty = 1 92#define cgdirty() cgblk.b_dirty = 1 93#define sblock (*sblk.b_un.b_fs) 94#define cgrp (*cgblk.b_un.b_cg) 95 96enum fixstate {DONTKNOW, NOFIX, FIX, IGNORE}; 97 98struct inodesc { 99 enum fixstate id_fix; /* policy on fixing errors */ 100 int (*id_func) /* function to be applied to blocks of inode */ 101 __P((struct inodesc *)); 102 ino_t id_number; /* inode number described */ 103 ino_t id_parent; /* for DATA nodes, their parent */ 104 daddr_t id_blkno; /* current block number being examined */ 105 int id_numfrags; /* number of frags contained in block */ 106 quad_t id_filesize; /* for DATA nodes, the size of the directory */ 107 int id_loc; /* for DATA nodes, current location in dir */ 108 int id_entryno; /* for DATA nodes, current entry number */ 109 struct ext2fs_direct *id_dirp; /* for DATA nodes, ptr to current entry */ 110 char *id_name; /* for DATA nodes, name to find or enter */ 111 char id_type; /* type of descriptor, DATA or ADDR */ 112}; 113/* file types */ 114#define DATA 1 115#define ADDR 2 116 117/* 118 * Linked list of duplicate blocks. 119 * 120 * The list is composed of two parts. The first part of the 121 * list (from duplist through the node pointed to by muldup) 122 * contains a single copy of each duplicate block that has been 123 * found. The second part of the list (from muldup to the end) 124 * contains duplicate blocks that have been found more than once. 125 * To check if a block has been found as a duplicate it is only 126 * necessary to search from duplist through muldup. To find the 127 * total number of times that a block has been found as a duplicate 128 * the entire list must be searched for occurences of the block 129 * in question. The following diagram shows a sample list where 130 * w (found twice), x (found once), y (found three times), and z 131 * (found once) are duplicate block numbers: 132 * 133 * w -> y -> x -> z -> y -> w -> y 134 * ^ ^ 135 * | | 136 * duplist muldup 137 */ 138struct dups { 139 struct dups *next; 140 daddr_t dup; 141}; 142struct dups *duplist; /* head of dup list */ 143struct dups *muldup; /* end of unique duplicate dup block numbers */ 144 145/* 146 * Linked list of inodes with zero link counts. 147 */ 148struct zlncnt { 149 struct zlncnt *next; 150 ino_t zlncnt; 151}; 152struct zlncnt *zlnhead; /* head of zero link count list */ 153 154/* 155 * Inode cache data structures. 156 */ 157struct inoinfo { 158 struct inoinfo *i_nexthash; /* next entry in hash chain */ 159 struct inoinfo *i_child, *i_sibling, *i_parentp; 160 ino_t i_number; /* inode number of this entry */ 161 ino_t i_parent; /* inode number of parent */ 162 ino_t i_dotdot; /* inode number of `..' */ 163 size_t i_isize; /* size of inode */ 164 u_int i_numblks; /* size of block array in bytes */ 165 daddr_t i_blks[1]; /* actually longer */ 166} **inphead, **inpsort; 167long numdirs, listmax, inplast; 168 169long dev_bsize; /* computed value of DEV_BSIZE */ 170long secsize; /* actual disk sector size */ 171char nflag; /* assume a no response */ 172char yflag; /* assume a yes response */ 173int bflag; /* location of alternate super block */ 174int debug; /* output debugging info */ 175int preen; /* just fix normal inconsistencies */ 176char havesb; /* superblock has been read */ 177char skipclean; /* skip clean file systems if preening */ 178int fsmodified; /* 1 => write done to file system */ 179int fsreadfd; /* file descriptor for reading file system */ 180int fswritefd; /* file descriptor for writing file system */ 181int rerun; /* rerun fsck. Only used in non-preen mode */ 182 183daddr_t maxfsblock; /* number of blocks in the file system */ 184daddr_t cgoverhead; /* overhead per cg */ 185char *blockmap; /* ptr to primary blk allocation map */ 186ino_t maxino; /* number of inodes in file system */ 187ino_t lastino; /* last inode in use */ 188char *statemap; /* ptr to inode state table */ 189int16_t *lncntp; /* ptr to link count table */ 190 191ino_t lfdir; /* lost & found directory inode number */ 192char *lfname; /* lost & found directory name */ 193int lfmode; /* lost & found directory creation mode */ 194 195daddr_t n_blks; /* number of blocks in use */ 196daddr_t n_files; /* number of files in use */ 197 198#define clearinode(dp) (*(dp) = zino) 199struct ext2fs_dinode zino; 200 201#define setbmap(blkno) setbit(blockmap, blkno) 202#define testbmap(blkno) isset(blockmap, blkno) 203#define clrbmap(blkno) clrbit(blockmap, blkno) 204 205#define STOP 0x01 206#define SKIP 0x02 207#define KEEPON 0x04 208#define ALTERED 0x08 209#define FOUND 0x10 210 211struct ext2fs_dinode *ginode __P((ino_t)); 212struct inoinfo *getinoinfo __P((ino_t)); 213void getblk __P((struct bufarea *, daddr_t, long)); 214ino_t allocino __P((ino_t, int)); 215