summaryrefslogtreecommitdiff
path: root/ufs-fsck
diff options
context:
space:
mode:
authorMichael I. Bushnell <mib@gnu.org>1994-10-07 21:59:44 +0000
committerMichael I. Bushnell <mib@gnu.org>1994-10-07 21:59:44 +0000
commit4d980b71d6eaa5436ae56fe2d312f3617e5f97f2 (patch)
tree72c054c14fa4b2922acf408a5086f742578ad291 /ufs-fsck
parent7b54d7d60273a40517a219c7a8dd364b0b2737f8 (diff)
Initial revision
Diffstat (limited to 'ufs-fsck')
-rw-r--r--ufs-fsck/pass1b.c77
1 files changed, 77 insertions, 0 deletions
diff --git a/ufs-fsck/pass1b.c b/ufs-fsck/pass1b.c
new file mode 100644
index 00000000..c259a6ad
--- /dev/null
+++ b/ufs-fsck/pass1b.c
@@ -0,0 +1,77 @@
+/* Pass 1b of fsck
+ Copyright (C) 1994 Free Software Foundation, Inc.
+ Written by Michael I. Bushnell.
+
+ This file is part of the GNU Hurd.
+
+ The GNU Hurd is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2, or (at
+ your option) any later version.
+
+ The GNU Hurd is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
+
+pass1b ()
+{
+ struct dinode dino;
+ struct dinode *dp = &dino;
+ int cg, i;
+ ino_t number;
+ int dupblk;
+
+ /* Check each block of file DP; if the block is in the dup block
+ list then add it to the dup block list under this file.
+ Return RET_GOOD or RET_BAD if the block is
+ good or bad, respectively. */
+ int
+ checkblock (daddr_t bno, int nfrags)
+ {
+ struct dups *dlp;
+
+ for (nfrags; nfrags > 0; bno++, nfrags--)
+ {
+ if (chkrange (blkno, 1))
+ return RET_BAD;
+ for (dlp = duphead; dlp; dlp = dlp->next)
+ {
+ if (dlp->dup == blkno)
+ {
+ if (!dupblk)
+ printf ("I=%lu HAD DUPLICATE BLOCKS\n", number);
+ dupblk = 1;
+ printf ("DUPLICATE BLOCK %d\n", bno);
+ dlp->dup = duphead->dup;
+ duphead->dup = blkno;
+ duphead = duphead->next;
+ }
+ if (dlp == muldup)
+ break;
+ }
+ if (muldup == 0 || duphead == muldup->next)
+ return RET_BAD;
+ }
+ return RET_GOOD;
+ }
+
+ /* Call CHECKBLOCK for each block of each node, to see if it holds
+ a block already found to be a duplicate. */
+ for (cg = 0; cg < sblock.fs_ncg; cg++)
+ for (i = 0; i < sblock.fs_ipg; i++, number++)
+ {
+ if (number < ROOTINO)
+ continue;
+ if (statemap[inumber] != UNALLOC)
+ {
+ getinode (number, dp);
+ dupblk = 0;
+ allblock_iterate (dp, checkblock);
+ }
+ }
+}