2 * Copyright (c) 1980, 1986 The Regents of the University of California.
5 * Redistribution and use in source and binary forms are permitted
6 * provided that the above copyright notice and this paragraph are
7 * duplicated in all such forms and that any documentation,
8 * advertising materials, and other materials related to such
9 * distribution and use acknowledge that the software was developed
10 * by the University of California, Berkeley. The name of the
11 * University may not be used to endorse or promote products derived
12 * from this software without specific prior written permission.
13 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18 #include <afsconfig.h>
19 #include <afs/param.h>
26 #ifdef AFS_VFSINCL_ENV
27 #include <sys/vnode.h>
29 #include <sys/fs/ufs_inode.h>
30 #include <sys/fs/ufs_fs.h>
32 #include <sys/fs/ufs_fsdir.h>
34 #include <sys/fs/ufs_mount.h>
36 #include <ufs/inode.h>
39 #else /* AFS_VFSINCL_ENV */
40 #include <sys/inode.h>
42 #define LONGFILENAMES 1
43 #include <sys/sysmacros.h>
47 #endif /* AFS_VFSINCL_ENV */
52 static struct dups *duphead;
61 memset(&idesc, 0, sizeof(struct inodesc));
63 idesc.id_func = pass1bcheck;
66 for (c = 0; c < sblock.fs_ncg; c++) {
67 for (i = 0; i < sblock.fs_ipg; i++, inumber++) {
68 if (inumber < ROOTINO)
73 idesc.id_number = inumber;
75 idesc.id_fix = DONTKNOW;
77 #if defined(ACLS) && defined(AFS_HPUX_ENV)
78 if (((statemap[inumber] & STATE) != USTATE) &&
80 if (statemap[inumber] != USTATE &&
82 (ckinode(dp, &idesc) & STOP))
89 struct inodesc *idesc;
92 int nfrags, res = KEEPON;
93 daddr_t blkno = idesc->id_blkno;
95 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
96 if (chkrange(blkno, 1))
98 for (dlp = duphead; dlp; dlp = dlp->next) {
99 if (dlp->dup == blkno) {
100 blkerror(idesc->id_number, "DUP", blkno);
101 dlp->dup = duphead->dup;
102 duphead->dup = blkno;
103 duphead = duphead->next;
108 if (muldup == 0 || duphead == muldup->next)