1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/*
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. */
#include <sys/types.h>
#include <sys/time.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include "../ufs/fs.h"
#include "../ufs/dinode.h"
#include "../ufs/dir.h"
/* Type of an inode */
enum inodetype
{
UNALLOC, /* not allocated */
REG, /* allocated, not dir */
DIR, /* dir */
BADDIR, /* dir with bad block pointers */
};
/* Added to directories in pass 2 */
#define DIR_REF 0x80000000 /* dir has been found in connectivity search */
/* State of each inode (set by pass 1) */
enum inodetype *inodestate;
/* Number of links claimed by each inode (set by pass 1) */
nlink_t *linkcount;
/* Number of links found to each inode (set by pass 2) */
nlink_t *linkfound;
/* DT_foo type of each inode (set by pass 1) */
char *typemap;
enum contret
{
RET_STOP,
RET_GOOD,
RET_BAD,
};
/* One of these structures is set up for each directory by
pass 1 and used by passes 2 and 3. */
struct dirinfo
{
struct inoinfo *i_nexthash; /* next entry in hash chain */
ino_t i_number; /* inode entry of this dir */
ino_t i_parent; /* inode entry of parent */
ino_t i_dotdot; /* inode number of `..' */
ino_t i_dot; /* inode number of `.' */
ino_t i_isize; /* size of inode */
u_int i_numblks; /* size of block array in bytes */
daddr_t i_blks[0]; /* array of inode block addresses */
};
/* Array of all the dirinfo structures in inode number order */
struct dirinfo **dirarray;
/* Array of all thi dirinfo structures sorted by their first
block address */
struct dirinfo **dirsorted;
int dirarrayused; /* number of directories */
int dirarraysize; /* alloced size of dirarray/dirsorted */
struct dups {
struct dups *next;
daddr_t dup;
};
struct dups *duplist; /* head of dup list */
struct dups *muldup; /* end of unique duplicate dup block numbers */
char sblockbuf[SBSIZE];
struct fs *sblock = (struct fs *)sblockbuf;
daddr_t maxfsblock;
int maxino;
int direct_symlink_extension;
int newinofmt;
int preen;
int readfd, writefd;
int fsmodified;
int lfdir;
char lfname[] = "lost+found";
mode_t lfmode = IFDIR | 0755;
#define howmany(x,y) (((x)+((y)-1))/(y))
#define roundup(x, y) ((((x)+((y)-1))/(y))*(y))
#define DEV_BSIZE 512
int setup (char *);
void pass1 (), pass1b (), pass2 (), pass3 (), pass4 (), pass5 ();
void readblock (daddr_t, void *, size_t);
void writeblock (daddr_t, void *, size_t);
void getinode (ino_t, struct dinode *);
void write_inode (ino_t, struct dinode *);
void clear_inode (ino_t, struct dinode *);
int reply (char *);
void pfatal (char *, ...) __attribute__ ((format (printf, 1, 2)));
void errexit (char *, ...) __attribute__ ((format (printf, 1, 2),
noreturn));
void pwarn (char *, ...) __attribute__ ((format (printf, 1, 2)));
|
