Lines Matching +full:block +full:- +full:number
1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause and BSD-2-Clause
10 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
74 #define MINBUFS 100 /* minimum number of buffers required */
76 #define ZEROBUFSIZE (dev_bsize * 128) /* size of zero buffer used by -Z */
80 (dp)->dp1.field : (dp)->dp2.field)
84 (dp)->dp1.field = (val); \
86 (dp)->dp2.field = (val); \
93 * decremented. Any inodes whose count is non-zero after pass 4 needs to
100 u_short ino_linkcnt; /* number of links not found */
111 /* 0x7 UNUSED - see S_IS_DVALID() definition */
118 #define INO_IS_DUNFOUND(ino) S_IS_DUNFOUND(inoinfo(ino)->ino_state)
119 #define INO_IS_DVALID(ino) S_IS_DVALID(inoinfo(ino)->ino_state)
125 long il_numalloced; /* number of inodes allocated in this cg */
135 ino_t i_number; /* inode number */
142 #define HASH(x) ((x * 2654435761) & (HASHSIZE - 1))
150 ufs2_daddr_t b_bno; /* disk block number */
160 ufs1_daddr_t *b_indir1; /* UFS1 indirect block */
161 ufs2_daddr_t *b_indir2; /* UFS2 indirect block */
162 struct fs *b_fs; /* super block */
164 struct ufs1_dinode *b_dinode1; /* UFS1 inode block */
165 struct ufs2_dinode *b_dinode2; /* UFS2 inode block */
171 (bp)->b_un.b_indir1[i] : (bp)->b_un.b_indir2[i])
175 (bp)->b_un.b_indir1[i] = (val); \
177 (bp)->b_un.b_indir2[i] = (val); \
206 "Inode Block", \
226 (bp)->b_flags |= B_DIRTY; \
229 (bp)->b_bno = (ufs2_daddr_t)-4; \
230 (bp)->b_size = 0; \
231 (bp)->b_errs = 0; \
232 (bp)->b_flags = 0; \
233 (bp)->b_type = type; \
234 (bp)->b_refcnt = 0; \
235 (bp)->b_index = 0; \
250 ino_t id_number; /* inode number described */
252 ufs_lbn_t id_lbn; /* logical block number of current block */
253 ufs2_daddr_t id_blkno; /* current block number being examined */
254 int id_level; /* level of indirection of this block */
255 int id_numfrags; /* number of frags contained in block */
258 ufs2_daddr_t id_entryno;/* for DATA nodes, current entry number */
274 * contains a single copy of each duplicate block that has been
277 * To check if a block has been found as a duplicate it is only
279 * total number of times that a block has been found as a duplicate
280 * the entire list must be searched for occurrences of the block
283 * (found once) are duplicate block numbers:
285 * w -> y -> x -> z -> y -> w -> y
295 extern struct dups *muldup; /* end of unique duplicate dup block numbers */
302 ino_t i_number; /* inode number of this entry */
303 ino_t i_parent; /* inode number of parent */
304 ino_t i_dotdot; /* inode number of `..' */
308 u_int i_numblks; /* size of block array in bytes */
320 extern long countdirs; /* number of directories we actually found */
323 extern int adjblkcnt[MIBSIZE]; /* MIB cmd to adjust inode block count */
325 extern int adjndir[MIBSIZE]; /* MIB cmd to adjust number of directories */
326 extern int adjnbfree[MIBSIZE]; /* MIB cmd to adjust number of free blocks */
327 extern int adjnifree[MIBSIZE]; /* MIB cmd to adjust number of free inodes */
328 extern int adjnffree[MIBSIZE]; /* MIB cmd to adjust number of free frags */
329 extern int adjnumclusters[MIBSIZE]; /* MIB cmd adjust number of free clusters */
340 extern off_t bflag; /* location of alternate super block */
358 extern ino_t lfdir; /* lost & found directory inode number */
361 extern ufs2_daddr_t maxfsblock; /* number of blocks in the file system */
362 extern ino_t maxino; /* number of inodes in file system */
363 extern ufs2_daddr_t n_blks; /* number of blocks in use */
364 extern ino_t n_files; /* number of files in use */
367 extern char rerun; /* rerun fsck. Only used in non-preen mode */
372 extern int snapcnt; /* number of active snapshots */
387 (dp)->dp1 = zino.dp1; \
389 (dp)->dp2 = zino.dp2; \
404 #define ERERUN 16 /* fsck needs to be re-run. */
405 #define ERESTART -1
423 * Allocate a block of memory to be used as an I/O buffer.