dir.c revision 1.8 1 1.8 agc /* $NetBSD: dir.c,v 1.8 2003/08/07 10:04:16 agc Exp $ */
2 1.1 bouyer
3 1.1 bouyer /*
4 1.1 bouyer * Copyright (c) 1980, 1986, 1993
5 1.1 bouyer * The Regents of the University of California. All rights reserved.
6 1.1 bouyer *
7 1.1 bouyer * Redistribution and use in source and binary forms, with or without
8 1.1 bouyer * modification, are permitted provided that the following conditions
9 1.1 bouyer * are met:
10 1.1 bouyer * 1. Redistributions of source code must retain the above copyright
11 1.1 bouyer * notice, this list of conditions and the following disclaimer.
12 1.1 bouyer * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 bouyer * notice, this list of conditions and the following disclaimer in the
14 1.1 bouyer * documentation and/or other materials provided with the distribution.
15 1.8 agc * 3. Neither the name of the University nor the names of its contributors
16 1.8 agc * may be used to endorse or promote products derived from this software
17 1.8 agc * without specific prior written permission.
18 1.8 agc *
19 1.8 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.8 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.8 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.8 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.8 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.8 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.8 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.8 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.8 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.8 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.8 agc * SUCH DAMAGE.
30 1.8 agc */
31 1.8 agc
32 1.8 agc /*
33 1.8 agc * Copyright (c) 1997 Manuel Bouyer.
34 1.8 agc *
35 1.8 agc * Redistribution and use in source and binary forms, with or without
36 1.8 agc * modification, are permitted provided that the following conditions
37 1.8 agc * are met:
38 1.8 agc * 1. Redistributions of source code must retain the above copyright
39 1.8 agc * notice, this list of conditions and the following disclaimer.
40 1.8 agc * 2. Redistributions in binary form must reproduce the above copyright
41 1.8 agc * notice, this list of conditions and the following disclaimer in the
42 1.8 agc * documentation and/or other materials provided with the distribution.
43 1.1 bouyer * 3. All advertising materials mentioning features or use of this software
44 1.1 bouyer * must display the following acknowledgement:
45 1.1 bouyer * This product includes software developed by the University of
46 1.1 bouyer * California, Berkeley and its contributors.
47 1.1 bouyer * 4. Neither the name of the University nor the names of its contributors
48 1.1 bouyer * may be used to endorse or promote products derived from this software
49 1.1 bouyer * without specific prior written permission.
50 1.1 bouyer *
51 1.1 bouyer * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52 1.1 bouyer * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53 1.1 bouyer * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54 1.1 bouyer * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55 1.1 bouyer * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56 1.1 bouyer * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57 1.1 bouyer * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58 1.1 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59 1.1 bouyer * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60 1.1 bouyer * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 1.1 bouyer * SUCH DAMAGE.
62 1.1 bouyer */
63 1.1 bouyer
64 1.2 lukem #include <sys/cdefs.h>
65 1.1 bouyer #ifndef lint
66 1.1 bouyer #if 0
67 1.1 bouyer static char sccsid[] = "@(#)dir.c 8.5 (Berkeley) 12/8/94";
68 1.1 bouyer #else
69 1.8 agc __RCSID("$NetBSD: dir.c,v 1.8 2003/08/07 10:04:16 agc Exp $");
70 1.1 bouyer #endif
71 1.1 bouyer #endif /* not lint */
72 1.1 bouyer
73 1.1 bouyer #include <sys/param.h>
74 1.1 bouyer #include <sys/time.h>
75 1.4 bouyer #include <ufs/ufs/dir.h>
76 1.1 bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
77 1.1 bouyer #include <ufs/ext2fs/ext2fs_dir.h>
78 1.1 bouyer #include <ufs/ext2fs/ext2fs.h>
79 1.1 bouyer
80 1.1 bouyer #include <ufs/ufs/dinode.h> /* for IFMT & friends */
81 1.1 bouyer
82 1.1 bouyer #include <stdio.h>
83 1.1 bouyer #include <stdlib.h>
84 1.1 bouyer #include <string.h>
85 1.1 bouyer
86 1.1 bouyer #include "fsck.h"
87 1.1 bouyer #include "fsutil.h"
88 1.1 bouyer #include "extern.h"
89 1.1 bouyer
90 1.1 bouyer char *lfname = "lost+found";
91 1.1 bouyer int lfmode = 01777;
92 1.1 bouyer struct ext2fs_dirtemplate emptydir = { 0, DIRBLKSIZ };
93 1.1 bouyer struct ext2fs_dirtemplate dirhead = {
94 1.5 bouyer 0, 12, 1, EXT2_FT_DIR, ".",
95 1.5 bouyer 0, DIRBLKSIZ - 12, 2, EXT2_FT_DIR, ".."
96 1.1 bouyer };
97 1.1 bouyer #undef DIRBLKSIZ
98 1.1 bouyer
99 1.1 bouyer static int expanddir __P((struct ext2fs_dinode *, char *));
100 1.1 bouyer static void freedir __P((ino_t, ino_t));
101 1.1 bouyer static struct ext2fs_direct *fsck_readdir __P((struct inodesc *));
102 1.1 bouyer static struct bufarea *getdirblk __P((daddr_t, long));
103 1.1 bouyer static int lftempname __P((char *, ino_t));
104 1.1 bouyer static int mkentry __P((struct inodesc *));
105 1.1 bouyer static int chgino __P((struct inodesc *));
106 1.1 bouyer
107 1.1 bouyer /*
108 1.1 bouyer * Propagate connected state through the tree.
109 1.1 bouyer */
110 1.1 bouyer void
111 1.1 bouyer propagate()
112 1.1 bouyer {
113 1.2 lukem struct inoinfo **inpp, *inp, *pinp;
114 1.1 bouyer struct inoinfo **inpend;
115 1.1 bouyer
116 1.1 bouyer /*
117 1.1 bouyer * Create a list of children for each directory.
118 1.1 bouyer */
119 1.1 bouyer inpend = &inpsort[inplast];
120 1.1 bouyer for (inpp = inpsort; inpp < inpend; inpp++) {
121 1.1 bouyer inp = *inpp;
122 1.1 bouyer if (inp->i_parent == 0 ||
123 1.1 bouyer inp->i_number == EXT2_ROOTINO)
124 1.1 bouyer continue;
125 1.1 bouyer pinp = getinoinfo(inp->i_parent);
126 1.1 bouyer inp->i_parentp = pinp;
127 1.1 bouyer inp->i_sibling = pinp->i_child;
128 1.1 bouyer pinp->i_child = inp;
129 1.1 bouyer }
130 1.1 bouyer inp = getinoinfo(EXT2_ROOTINO);
131 1.1 bouyer while (inp) {
132 1.1 bouyer statemap[inp->i_number] = DFOUND;
133 1.1 bouyer if (inp->i_child &&
134 1.1 bouyer statemap[inp->i_child->i_number] == DSTATE)
135 1.1 bouyer inp = inp->i_child;
136 1.1 bouyer else if (inp->i_sibling)
137 1.1 bouyer inp = inp->i_sibling;
138 1.1 bouyer else
139 1.1 bouyer inp = inp->i_parentp;
140 1.1 bouyer }
141 1.1 bouyer }
142 1.1 bouyer
143 1.1 bouyer /*
144 1.1 bouyer * Scan each entry in a directory block.
145 1.1 bouyer */
146 1.1 bouyer int
147 1.1 bouyer dirscan(idesc)
148 1.2 lukem struct inodesc *idesc;
149 1.1 bouyer {
150 1.2 lukem struct ext2fs_direct *dp;
151 1.2 lukem struct bufarea *bp;
152 1.1 bouyer int dsize, n;
153 1.1 bouyer long blksiz;
154 1.1 bouyer char *dbuf = NULL;
155 1.1 bouyer
156 1.1 bouyer if ((dbuf = malloc(sblock.e2fs_bsize)) == NULL) {
157 1.1 bouyer fprintf(stderr, "out of memory");
158 1.1 bouyer exit(8);
159 1.1 bouyer }
160 1.1 bouyer
161 1.1 bouyer if (idesc->id_type != DATA)
162 1.1 bouyer errexit("wrong type to dirscan %d\n", idesc->id_type);
163 1.1 bouyer if (idesc->id_entryno == 0 &&
164 1.1 bouyer (idesc->id_filesize & (sblock.e2fs_bsize - 1)) != 0)
165 1.1 bouyer idesc->id_filesize = roundup(idesc->id_filesize, sblock.e2fs_bsize);
166 1.1 bouyer blksiz = idesc->id_numfrags * sblock.e2fs_bsize;
167 1.1 bouyer if (chkrange(idesc->id_blkno, idesc->id_numfrags)) {
168 1.1 bouyer idesc->id_filesize -= blksiz;
169 1.1 bouyer return (SKIP);
170 1.1 bouyer }
171 1.1 bouyer idesc->id_loc = 0;
172 1.1 bouyer for (dp = fsck_readdir(idesc); dp != NULL; dp = fsck_readdir(idesc)) {
173 1.3 bouyer dsize = fs2h16(dp->e2d_reclen);
174 1.1 bouyer memcpy(dbuf, dp, (size_t)dsize);
175 1.1 bouyer idesc->id_dirp = (struct ext2fs_direct *)dbuf;
176 1.1 bouyer if ((n = (*idesc->id_func)(idesc)) & ALTERED) {
177 1.1 bouyer bp = getdirblk(idesc->id_blkno, blksiz);
178 1.1 bouyer memcpy(bp->b_un.b_buf + idesc->id_loc - dsize, dbuf,
179 1.1 bouyer (size_t)dsize);
180 1.1 bouyer dirty(bp);
181 1.1 bouyer sbdirty();
182 1.1 bouyer }
183 1.1 bouyer if (n & STOP) {
184 1.1 bouyer free(dbuf);
185 1.1 bouyer return (n);
186 1.1 bouyer }
187 1.1 bouyer }
188 1.1 bouyer free(dbuf);
189 1.1 bouyer return (idesc->id_filesize > 0 ? KEEPON : STOP);
190 1.1 bouyer }
191 1.1 bouyer
192 1.1 bouyer /*
193 1.1 bouyer * get next entry in a directory.
194 1.1 bouyer */
195 1.1 bouyer static struct ext2fs_direct *
196 1.1 bouyer fsck_readdir(idesc)
197 1.2 lukem struct inodesc *idesc;
198 1.1 bouyer {
199 1.2 lukem struct ext2fs_direct *dp, *ndp;
200 1.2 lukem struct bufarea *bp;
201 1.1 bouyer long size, blksiz, fix, dploc;
202 1.1 bouyer
203 1.1 bouyer blksiz = idesc->id_numfrags * sblock.e2fs_bsize;
204 1.1 bouyer bp = getdirblk(idesc->id_blkno, blksiz);
205 1.1 bouyer if (idesc->id_loc % sblock.e2fs_bsize == 0 && idesc->id_filesize > 0 &&
206 1.1 bouyer idesc->id_loc < blksiz) {
207 1.1 bouyer dp = (struct ext2fs_direct *)(bp->b_un.b_buf + idesc->id_loc);
208 1.1 bouyer if (dircheck(idesc, dp))
209 1.1 bouyer goto dpok;
210 1.1 bouyer if (idesc->id_fix == IGNORE)
211 1.1 bouyer return (0);
212 1.1 bouyer fix = dofix(idesc, "DIRECTORY CORRUPTED");
213 1.1 bouyer bp = getdirblk(idesc->id_blkno, blksiz);
214 1.1 bouyer dp = (struct ext2fs_direct *)(bp->b_un.b_buf + idesc->id_loc);
215 1.3 bouyer dp->e2d_reclen = h2fs16(sblock.e2fs_bsize);
216 1.1 bouyer dp->e2d_ino = 0;
217 1.1 bouyer dp->e2d_namlen = 0;
218 1.4 bouyer dp->e2d_type = 0;
219 1.1 bouyer dp->e2d_name[0] = '\0';
220 1.1 bouyer if (fix)
221 1.1 bouyer dirty(bp);
222 1.1 bouyer idesc->id_loc += sblock.e2fs_bsize;
223 1.1 bouyer idesc->id_filesize -= sblock.e2fs_bsize;
224 1.1 bouyer return (dp);
225 1.1 bouyer }
226 1.1 bouyer dpok:
227 1.1 bouyer if (idesc->id_filesize <= 0 || idesc->id_loc >= blksiz)
228 1.1 bouyer return NULL;
229 1.1 bouyer dploc = idesc->id_loc;
230 1.1 bouyer dp = (struct ext2fs_direct *)(bp->b_un.b_buf + dploc);
231 1.3 bouyer idesc->id_loc += fs2h16(dp->e2d_reclen);
232 1.3 bouyer idesc->id_filesize -= fs2h16(dp->e2d_reclen);
233 1.1 bouyer if ((idesc->id_loc % sblock.e2fs_bsize) == 0)
234 1.1 bouyer return (dp);
235 1.1 bouyer ndp = (struct ext2fs_direct *)(bp->b_un.b_buf + idesc->id_loc);
236 1.1 bouyer if (idesc->id_loc < blksiz && idesc->id_filesize > 0 &&
237 1.1 bouyer dircheck(idesc, ndp) == 0) {
238 1.1 bouyer size = sblock.e2fs_bsize - (idesc->id_loc % sblock.e2fs_bsize);
239 1.1 bouyer idesc->id_loc += size;
240 1.1 bouyer idesc->id_filesize -= size;
241 1.1 bouyer if (idesc->id_fix == IGNORE)
242 1.1 bouyer return (0);
243 1.1 bouyer fix = dofix(idesc, "DIRECTORY CORRUPTED");
244 1.1 bouyer bp = getdirblk(idesc->id_blkno, blksiz);
245 1.1 bouyer dp = (struct ext2fs_direct *)(bp->b_un.b_buf + dploc);
246 1.3 bouyer dp->e2d_reclen = h2fs16(fs2h16(dp->e2d_reclen) + size);
247 1.1 bouyer if (fix)
248 1.1 bouyer dirty(bp);
249 1.1 bouyer }
250 1.1 bouyer return (dp);
251 1.1 bouyer }
252 1.1 bouyer
253 1.1 bouyer /*
254 1.1 bouyer * Verify that a directory entry is valid.
255 1.1 bouyer * This is a superset of the checks made in the kernel.
256 1.1 bouyer */
257 1.1 bouyer int
258 1.1 bouyer dircheck(idesc, dp)
259 1.1 bouyer struct inodesc *idesc;
260 1.1 bouyer struct ext2fs_direct *dp;
261 1.1 bouyer {
262 1.1 bouyer int size;
263 1.1 bouyer char *cp;
264 1.1 bouyer int spaceleft;
265 1.3 bouyer u_int16_t reclen = fs2h16(dp->e2d_reclen);
266 1.1 bouyer
267 1.1 bouyer spaceleft = sblock.e2fs_bsize - (idesc->id_loc % sblock.e2fs_bsize);
268 1.3 bouyer if (fs2h32(dp->e2d_ino) > maxino ||
269 1.3 bouyer reclen == 0 ||
270 1.3 bouyer reclen > spaceleft ||
271 1.3 bouyer (reclen & 0x3) != 0)
272 1.1 bouyer return (0);
273 1.1 bouyer if (dp->e2d_ino == 0)
274 1.1 bouyer return (1);
275 1.5 bouyer if (sblock.e2fs.e2fs_rev < E2FS_REV1 ||
276 1.4 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE) == 0)
277 1.4 bouyer if (dp->e2d_type != 0)
278 1.4 bouyer return (1);
279 1.4 bouyer size = EXT2FS_DIRSIZ(dp->e2d_namlen);
280 1.3 bouyer if (reclen < size ||
281 1.6 simonb idesc->id_filesize < size /* ||
282 1.6 simonb dp->e2d_namlen > EXT2FS_MAXNAMLEN */)
283 1.1 bouyer return (0);
284 1.4 bouyer for (cp = dp->e2d_name, size = 0; size < dp->e2d_namlen; size++)
285 1.1 bouyer if (*cp == '\0' || (*cp++ == '/'))
286 1.1 bouyer return (0);
287 1.1 bouyer return (1);
288 1.1 bouyer }
289 1.1 bouyer
290 1.1 bouyer void
291 1.1 bouyer direrror(ino, errmesg)
292 1.1 bouyer ino_t ino;
293 1.1 bouyer char *errmesg;
294 1.1 bouyer {
295 1.1 bouyer
296 1.1 bouyer fileerror(ino, ino, errmesg);
297 1.1 bouyer }
298 1.1 bouyer
299 1.1 bouyer void
300 1.1 bouyer fileerror(cwd, ino, errmesg)
301 1.1 bouyer ino_t cwd, ino;
302 1.1 bouyer char *errmesg;
303 1.1 bouyer {
304 1.2 lukem struct ext2fs_dinode *dp;
305 1.1 bouyer char pathbuf[MAXPATHLEN + 1];
306 1.1 bouyer
307 1.1 bouyer pwarn("%s ", errmesg);
308 1.1 bouyer pinode(ino);
309 1.1 bouyer printf("\n");
310 1.7 itojun getpathname(pathbuf, sizeof(pathbuf), cwd, ino);
311 1.1 bouyer if ((ino < EXT2_FIRSTINO && ino != EXT2_ROOTINO) || ino > maxino) {
312 1.1 bouyer pfatal("NAME=%s\n", pathbuf);
313 1.1 bouyer return;
314 1.1 bouyer }
315 1.1 bouyer dp = ginode(ino);
316 1.1 bouyer if (ftypeok(dp))
317 1.1 bouyer pfatal("%s=%s\n",
318 1.3 bouyer (fs2h16(dp->e2di_mode) & IFMT) == IFDIR ? "DIR" : "FILE", pathbuf);
319 1.1 bouyer else
320 1.1 bouyer pfatal("NAME=%s\n", pathbuf);
321 1.1 bouyer }
322 1.1 bouyer
323 1.1 bouyer void
324 1.1 bouyer adjust(idesc, lcnt)
325 1.2 lukem struct inodesc *idesc;
326 1.1 bouyer short lcnt;
327 1.1 bouyer {
328 1.2 lukem struct ext2fs_dinode *dp;
329 1.1 bouyer
330 1.1 bouyer dp = ginode(idesc->id_number);
331 1.3 bouyer if (fs2h16(dp->e2di_nlink) == lcnt) {
332 1.1 bouyer if (linkup(idesc->id_number, (ino_t)0) == 0)
333 1.1 bouyer clri(idesc, "UNREF", 0);
334 1.1 bouyer } else {
335 1.1 bouyer pwarn("LINK COUNT %s", (lfdir == idesc->id_number) ? lfname :
336 1.3 bouyer ((fs2h16(dp->e2di_mode) & IFMT) == IFDIR ? "DIR" : "FILE"));
337 1.1 bouyer pinode(idesc->id_number);
338 1.1 bouyer printf(" COUNT %d SHOULD BE %d",
339 1.3 bouyer fs2h16(dp->e2di_nlink), fs2h16(dp->e2di_nlink) - lcnt);
340 1.1 bouyer if (preen) {
341 1.1 bouyer if (lcnt < 0) {
342 1.1 bouyer printf("\n");
343 1.1 bouyer pfatal("LINK COUNT INCREASING");
344 1.1 bouyer }
345 1.1 bouyer printf(" (ADJUSTED)\n");
346 1.1 bouyer }
347 1.1 bouyer if (preen || reply("ADJUST") == 1) {
348 1.3 bouyer dp->e2di_nlink = h2fs16(fs2h16(dp->e2di_nlink) - lcnt);
349 1.1 bouyer inodirty();
350 1.1 bouyer }
351 1.1 bouyer }
352 1.1 bouyer }
353 1.1 bouyer
354 1.1 bouyer static int
355 1.1 bouyer mkentry(idesc)
356 1.1 bouyer struct inodesc *idesc;
357 1.1 bouyer {
358 1.2 lukem struct ext2fs_direct *dirp = idesc->id_dirp;
359 1.1 bouyer struct ext2fs_direct newent;
360 1.1 bouyer int newlen, oldlen;
361 1.1 bouyer
362 1.4 bouyer newent.e2d_namlen = strlen(idesc->id_name);
363 1.4 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
364 1.4 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE))
365 1.5 bouyer newent.e2d_type = inot2ext2dt(typemap[idesc->id_parent]);
366 1.4 bouyer newlen = EXT2FS_DIRSIZ(newent.e2d_namlen);
367 1.1 bouyer if (dirp->e2d_ino != 0)
368 1.4 bouyer oldlen = EXT2FS_DIRSIZ(dirp->e2d_namlen);
369 1.1 bouyer else
370 1.1 bouyer oldlen = 0;
371 1.3 bouyer if (fs2h16(dirp->e2d_reclen) - oldlen < newlen)
372 1.1 bouyer return (KEEPON);
373 1.3 bouyer newent.e2d_reclen = h2fs16(fs2h16(dirp->e2d_reclen) - oldlen);
374 1.3 bouyer dirp->e2d_reclen = h2fs16(oldlen);
375 1.1 bouyer dirp = (struct ext2fs_direct *)(((char *)dirp) + oldlen);
376 1.3 bouyer dirp->e2d_ino = h2fs32(idesc->id_parent); /* ino to be entered is in id_parent */
377 1.1 bouyer dirp->e2d_reclen = newent.e2d_reclen;
378 1.1 bouyer dirp->e2d_namlen = newent.e2d_namlen;
379 1.4 bouyer dirp->e2d_type = newent.e2d_type;
380 1.4 bouyer memcpy(dirp->e2d_name, idesc->id_name, (size_t)(dirp->e2d_namlen));
381 1.1 bouyer return (ALTERED|STOP);
382 1.1 bouyer }
383 1.1 bouyer
384 1.1 bouyer static int
385 1.1 bouyer chgino(idesc)
386 1.1 bouyer struct inodesc *idesc;
387 1.1 bouyer {
388 1.2 lukem struct ext2fs_direct *dirp = idesc->id_dirp;
389 1.4 bouyer u_int16_t namlen = dirp->e2d_namlen;
390 1.1 bouyer
391 1.3 bouyer if (strlen(idesc->id_name) != namlen ||
392 1.3 bouyer strncmp(dirp->e2d_name, idesc->id_name, (int)namlen))
393 1.1 bouyer return (KEEPON);
394 1.3 bouyer dirp->e2d_ino = h2fs32(idesc->id_parent);
395 1.4 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
396 1.4 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE))
397 1.5 bouyer dirp->e2d_type = inot2ext2dt(typemap[idesc->id_parent]);
398 1.4 bouyer else
399 1.4 bouyer dirp->e2d_type = 0;
400 1.1 bouyer return (ALTERED|STOP);
401 1.1 bouyer }
402 1.1 bouyer
403 1.1 bouyer int
404 1.1 bouyer linkup(orphan, parentdir)
405 1.1 bouyer ino_t orphan;
406 1.1 bouyer ino_t parentdir;
407 1.1 bouyer {
408 1.2 lukem struct ext2fs_dinode *dp;
409 1.1 bouyer int lostdir;
410 1.1 bouyer ino_t oldlfdir;
411 1.1 bouyer struct inodesc idesc;
412 1.1 bouyer char tempname[BUFSIZ];
413 1.1 bouyer
414 1.1 bouyer memset(&idesc, 0, sizeof(struct inodesc));
415 1.1 bouyer dp = ginode(orphan);
416 1.3 bouyer lostdir = (fs2h16(dp->e2di_mode) & IFMT) == IFDIR;
417 1.1 bouyer pwarn("UNREF %s ", lostdir ? "DIR" : "FILE");
418 1.1 bouyer pinode(orphan);
419 1.3 bouyer if (preen && fs2h32(dp->e2di_size) == 0)
420 1.1 bouyer return (0);
421 1.1 bouyer if (preen)
422 1.1 bouyer printf(" (RECONNECTED)\n");
423 1.1 bouyer else
424 1.1 bouyer if (reply("RECONNECT") == 0)
425 1.1 bouyer return (0);
426 1.1 bouyer if (lfdir == 0) {
427 1.1 bouyer dp = ginode(EXT2_ROOTINO);
428 1.1 bouyer idesc.id_name = lfname;
429 1.1 bouyer idesc.id_type = DATA;
430 1.1 bouyer idesc.id_func = findino;
431 1.1 bouyer idesc.id_number = EXT2_ROOTINO;
432 1.1 bouyer if ((ckinode(dp, &idesc) & FOUND) != 0) {
433 1.1 bouyer lfdir = idesc.id_parent;
434 1.1 bouyer } else {
435 1.1 bouyer pwarn("NO lost+found DIRECTORY");
436 1.1 bouyer if (preen || reply("CREATE")) {
437 1.1 bouyer lfdir = allocdir(EXT2_ROOTINO, (ino_t)0, lfmode);
438 1.1 bouyer if (lfdir != 0) {
439 1.1 bouyer if (makeentry(EXT2_ROOTINO, lfdir, lfname) != 0) {
440 1.1 bouyer if (preen)
441 1.1 bouyer printf(" (CREATED)\n");
442 1.1 bouyer } else {
443 1.1 bouyer freedir(lfdir, EXT2_ROOTINO);
444 1.1 bouyer lfdir = 0;
445 1.1 bouyer if (preen)
446 1.1 bouyer printf("\n");
447 1.1 bouyer }
448 1.1 bouyer }
449 1.1 bouyer }
450 1.1 bouyer }
451 1.1 bouyer if (lfdir == 0) {
452 1.1 bouyer pfatal("SORRY. CANNOT CREATE lost+found DIRECTORY");
453 1.1 bouyer printf("\n\n");
454 1.1 bouyer return (0);
455 1.1 bouyer }
456 1.1 bouyer }
457 1.1 bouyer dp = ginode(lfdir);
458 1.3 bouyer if ((fs2h16(dp->e2di_mode) & IFMT) != IFDIR) {
459 1.1 bouyer pfatal("lost+found IS NOT A DIRECTORY");
460 1.1 bouyer if (reply("REALLOCATE") == 0)
461 1.1 bouyer return (0);
462 1.1 bouyer oldlfdir = lfdir;
463 1.1 bouyer if ((lfdir = allocdir(EXT2_ROOTINO, (ino_t)0, lfmode)) == 0) {
464 1.1 bouyer pfatal("SORRY. CANNOT CREATE lost+found DIRECTORY\n\n");
465 1.1 bouyer return (0);
466 1.1 bouyer }
467 1.1 bouyer if ((changeino(EXT2_ROOTINO, lfname, lfdir) & ALTERED) == 0) {
468 1.1 bouyer pfatal("SORRY. CANNOT CREATE lost+found DIRECTORY\n\n");
469 1.1 bouyer return (0);
470 1.1 bouyer }
471 1.1 bouyer inodirty();
472 1.1 bouyer idesc.id_type = ADDR;
473 1.1 bouyer idesc.id_func = pass4check;
474 1.1 bouyer idesc.id_number = oldlfdir;
475 1.1 bouyer adjust(&idesc, lncntp[oldlfdir] + 1);
476 1.1 bouyer lncntp[oldlfdir] = 0;
477 1.1 bouyer dp = ginode(lfdir);
478 1.1 bouyer }
479 1.1 bouyer if (statemap[lfdir] != DFOUND) {
480 1.1 bouyer pfatal("SORRY. NO lost+found DIRECTORY\n\n");
481 1.1 bouyer return (0);
482 1.1 bouyer }
483 1.1 bouyer (void)lftempname(tempname, orphan);
484 1.1 bouyer if (makeentry(lfdir, orphan, tempname) == 0) {
485 1.1 bouyer pfatal("SORRY. NO SPACE IN lost+found DIRECTORY");
486 1.1 bouyer printf("\n\n");
487 1.1 bouyer return (0);
488 1.1 bouyer }
489 1.1 bouyer lncntp[orphan]--;
490 1.1 bouyer if (lostdir) {
491 1.1 bouyer if ((changeino(orphan, "..", lfdir) & ALTERED) == 0 &&
492 1.1 bouyer parentdir != (ino_t)-1)
493 1.1 bouyer (void)makeentry(orphan, lfdir, "..");
494 1.1 bouyer dp = ginode(lfdir);
495 1.3 bouyer dp->e2di_nlink = h2fs16(fs2h16(dp->e2di_nlink) +1);
496 1.1 bouyer inodirty();
497 1.1 bouyer lncntp[lfdir]++;
498 1.1 bouyer pwarn("DIR I=%u CONNECTED. ", orphan);
499 1.1 bouyer if (parentdir != (ino_t)-1)
500 1.1 bouyer printf("PARENT WAS I=%u\n", parentdir);
501 1.1 bouyer if (preen == 0)
502 1.1 bouyer printf("\n");
503 1.1 bouyer }
504 1.1 bouyer return (1);
505 1.1 bouyer }
506 1.1 bouyer
507 1.1 bouyer /*
508 1.1 bouyer * fix an entry in a directory.
509 1.1 bouyer */
510 1.1 bouyer int
511 1.1 bouyer changeino(dir, name, newnum)
512 1.1 bouyer ino_t dir;
513 1.1 bouyer char *name;
514 1.1 bouyer ino_t newnum;
515 1.1 bouyer {
516 1.1 bouyer struct inodesc idesc;
517 1.1 bouyer
518 1.1 bouyer memset(&idesc, 0, sizeof(struct inodesc));
519 1.1 bouyer idesc.id_type = DATA;
520 1.1 bouyer idesc.id_func = chgino;
521 1.1 bouyer idesc.id_number = dir;
522 1.1 bouyer idesc.id_fix = DONTKNOW;
523 1.1 bouyer idesc.id_name = name;
524 1.1 bouyer idesc.id_parent = newnum; /* new value for name */
525 1.1 bouyer return (ckinode(ginode(dir), &idesc));
526 1.1 bouyer }
527 1.1 bouyer
528 1.1 bouyer /*
529 1.1 bouyer * make an entry in a directory
530 1.1 bouyer */
531 1.1 bouyer int
532 1.1 bouyer makeentry(parent, ino, name)
533 1.1 bouyer ino_t parent, ino;
534 1.1 bouyer char *name;
535 1.1 bouyer {
536 1.1 bouyer struct ext2fs_dinode *dp;
537 1.1 bouyer struct inodesc idesc;
538 1.1 bouyer char pathbuf[MAXPATHLEN + 1];
539 1.1 bouyer
540 1.1 bouyer if ((parent < EXT2_FIRSTINO && parent != EXT2_ROOTINO)
541 1.1 bouyer || parent >= maxino ||
542 1.1 bouyer (ino < EXT2_FIRSTINO && ino < EXT2_ROOTINO) || ino >= maxino)
543 1.1 bouyer return (0);
544 1.1 bouyer memset(&idesc, 0, sizeof(struct inodesc));
545 1.1 bouyer idesc.id_type = DATA;
546 1.1 bouyer idesc.id_func = mkentry;
547 1.1 bouyer idesc.id_number = parent;
548 1.1 bouyer idesc.id_parent = ino; /* this is the inode to enter */
549 1.1 bouyer idesc.id_fix = DONTKNOW;
550 1.1 bouyer idesc.id_name = name;
551 1.1 bouyer dp = ginode(parent);
552 1.3 bouyer if (fs2h32(dp->e2di_size) % sblock.e2fs_bsize) {
553 1.3 bouyer dp->e2di_size =
554 1.3 bouyer h2fs32(roundup(fs2h32(dp->e2di_size), sblock.e2fs_bsize));
555 1.1 bouyer inodirty();
556 1.1 bouyer }
557 1.1 bouyer if ((ckinode(dp, &idesc) & ALTERED) != 0)
558 1.1 bouyer return (1);
559 1.7 itojun getpathname(pathbuf, sizeof(pathbuf), parent, parent);
560 1.1 bouyer dp = ginode(parent);
561 1.1 bouyer if (expanddir(dp, pathbuf) == 0)
562 1.1 bouyer return (0);
563 1.1 bouyer return (ckinode(dp, &idesc) & ALTERED);
564 1.1 bouyer }
565 1.1 bouyer
566 1.1 bouyer /*
567 1.1 bouyer * Attempt to expand the size of a directory
568 1.1 bouyer */
569 1.1 bouyer static int
570 1.1 bouyer expanddir(dp, name)
571 1.2 lukem struct ext2fs_dinode *dp;
572 1.1 bouyer char *name;
573 1.1 bouyer {
574 1.1 bouyer daddr_t lastbn, newblk;
575 1.2 lukem struct bufarea *bp;
576 1.3 bouyer char *firstblk;
577 1.1 bouyer
578 1.1 bouyer if ((firstblk = malloc(sblock.e2fs_bsize)) == NULL) {
579 1.1 bouyer fprintf(stderr, "out of memory");
580 1.1 bouyer exit(8);
581 1.1 bouyer }
582 1.1 bouyer
583 1.3 bouyer lastbn = lblkno(&sblock, fs2h32(dp->e2di_size));
584 1.3 bouyer if (lastbn >= NDADDR - 1 || fs2h32(dp->e2di_blocks[lastbn]) == 0 ||
585 1.3 bouyer fs2h32(dp->e2di_size) == 0)
586 1.1 bouyer return (0);
587 1.1 bouyer if ((newblk = allocblk()) == 0)
588 1.1 bouyer return (0);
589 1.1 bouyer dp->e2di_blocks[lastbn + 1] = dp->e2di_blocks[lastbn];
590 1.3 bouyer dp->e2di_blocks[lastbn] = h2fs32(newblk);
591 1.3 bouyer dp->e2di_size = h2fs32(fs2h32(dp->e2di_size) + sblock.e2fs_bsize);
592 1.3 bouyer dp->e2di_nblock = h2fs32(fs2h32(dp->e2di_nblock) + 1);
593 1.3 bouyer bp = getdirblk(fs2h32(dp->e2di_blocks[lastbn + 1]),
594 1.1 bouyer sblock.e2fs_bsize);
595 1.1 bouyer if (bp->b_errs)
596 1.1 bouyer goto bad;
597 1.1 bouyer memcpy(firstblk, bp->b_un.b_buf, sblock.e2fs_bsize);
598 1.1 bouyer bp = getdirblk(newblk, sblock.e2fs_bsize);
599 1.1 bouyer if (bp->b_errs)
600 1.1 bouyer goto bad;
601 1.1 bouyer memcpy(bp->b_un.b_buf, firstblk, sblock.e2fs_bsize);
602 1.1 bouyer dirty(bp);
603 1.3 bouyer bp = getdirblk(fs2h32(dp->e2di_blocks[lastbn + 1]),
604 1.1 bouyer sblock.e2fs_bsize);
605 1.1 bouyer if (bp->b_errs)
606 1.1 bouyer goto bad;
607 1.3 bouyer emptydir.dot_reclen = h2fs16(sblock.e2fs_bsize);
608 1.1 bouyer memcpy(bp->b_un.b_buf, &emptydir, sizeof emptydir);
609 1.1 bouyer pwarn("NO SPACE LEFT IN %s", name);
610 1.1 bouyer if (preen)
611 1.1 bouyer printf(" (EXPANDED)\n");
612 1.1 bouyer else if (reply("EXPAND") == 0)
613 1.1 bouyer goto bad;
614 1.1 bouyer dirty(bp);
615 1.1 bouyer inodirty();
616 1.1 bouyer return (1);
617 1.1 bouyer bad:
618 1.1 bouyer dp->e2di_blocks[lastbn] = dp->e2di_blocks[lastbn + 1];
619 1.1 bouyer dp->e2di_blocks[lastbn + 1] = 0;
620 1.3 bouyer dp->e2di_size = h2fs32(fs2h32(dp->e2di_size) - sblock.e2fs_bsize);
621 1.3 bouyer dp->e2di_nblock = h2fs32(fs2h32(dp->e2di_nblock) - 1);
622 1.1 bouyer freeblk(newblk);
623 1.1 bouyer return (0);
624 1.1 bouyer }
625 1.1 bouyer
626 1.1 bouyer /*
627 1.1 bouyer * allocate a new directory
628 1.1 bouyer */
629 1.1 bouyer int
630 1.1 bouyer allocdir(parent, request, mode)
631 1.1 bouyer ino_t parent, request;
632 1.1 bouyer int mode;
633 1.1 bouyer {
634 1.1 bouyer ino_t ino;
635 1.1 bouyer struct ext2fs_dinode *dp;
636 1.2 lukem struct bufarea *bp;
637 1.1 bouyer struct ext2fs_dirtemplate *dirp;
638 1.1 bouyer
639 1.1 bouyer ino = allocino(request, IFDIR|mode);
640 1.3 bouyer dirhead.dot_reclen = h2fs16(12); /* XXX */
641 1.3 bouyer dirhead.dotdot_reclen = h2fs16(sblock.e2fs_bsize - 12); /* XXX */
642 1.4 bouyer dirhead.dot_namlen = 1;
643 1.4 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
644 1.4 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE))
645 1.5 bouyer dirhead.dot_type = EXT2_FT_DIR;
646 1.4 bouyer else
647 1.4 bouyer dirhead.dot_type = 0;
648 1.4 bouyer dirhead.dotdot_namlen = 2;
649 1.4 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
650 1.4 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE))
651 1.5 bouyer dirhead.dotdot_type = EXT2_FT_DIR;
652 1.4 bouyer else
653 1.4 bouyer dirhead.dotdot_type = 0;
654 1.1 bouyer dirp = &dirhead;
655 1.3 bouyer dirp->dot_ino = h2fs32(ino);
656 1.3 bouyer dirp->dotdot_ino = h2fs32(parent);
657 1.1 bouyer dp = ginode(ino);
658 1.3 bouyer bp = getdirblk(fs2h32(dp->e2di_blocks[0]), sblock.e2fs_bsize);
659 1.1 bouyer if (bp->b_errs) {
660 1.1 bouyer freeino(ino);
661 1.1 bouyer return (0);
662 1.1 bouyer }
663 1.1 bouyer memcpy(bp->b_un.b_buf, dirp, sizeof(struct ext2fs_dirtemplate));
664 1.1 bouyer dirty(bp);
665 1.3 bouyer dp->e2di_nlink = h2fs16(2);
666 1.1 bouyer inodirty();
667 1.1 bouyer if (ino == EXT2_ROOTINO) {
668 1.3 bouyer lncntp[ino] = fs2h16(dp->e2di_nlink);
669 1.1 bouyer cacheino(dp, ino);
670 1.1 bouyer return(ino);
671 1.1 bouyer }
672 1.1 bouyer if (statemap[parent] != DSTATE && statemap[parent] != DFOUND) {
673 1.1 bouyer freeino(ino);
674 1.1 bouyer return (0);
675 1.1 bouyer }
676 1.1 bouyer cacheino(dp, ino);
677 1.1 bouyer statemap[ino] = statemap[parent];
678 1.1 bouyer if (statemap[ino] == DSTATE) {
679 1.3 bouyer lncntp[ino] = fs2h16(dp->e2di_nlink);
680 1.1 bouyer lncntp[parent]++;
681 1.1 bouyer }
682 1.1 bouyer dp = ginode(parent);
683 1.3 bouyer dp->e2di_nlink = h2fs16(fs2h16(dp->e2di_nlink) + 1);
684 1.1 bouyer inodirty();
685 1.1 bouyer return (ino);
686 1.1 bouyer }
687 1.1 bouyer
688 1.1 bouyer /*
689 1.1 bouyer * free a directory inode
690 1.1 bouyer */
691 1.1 bouyer static void
692 1.1 bouyer freedir(ino, parent)
693 1.1 bouyer ino_t ino, parent;
694 1.1 bouyer {
695 1.1 bouyer struct ext2fs_dinode *dp;
696 1.1 bouyer
697 1.1 bouyer if (ino != parent) {
698 1.1 bouyer dp = ginode(parent);
699 1.3 bouyer dp->e2di_nlink = h2fs16(fs2h16(dp->e2di_nlink) - 1);
700 1.1 bouyer inodirty();
701 1.1 bouyer }
702 1.1 bouyer freeino(ino);
703 1.1 bouyer }
704 1.1 bouyer
705 1.1 bouyer /*
706 1.1 bouyer * generate a temporary name for the lost+found directory.
707 1.1 bouyer */
708 1.1 bouyer static int
709 1.1 bouyer lftempname(bufp, ino)
710 1.1 bouyer char *bufp;
711 1.1 bouyer ino_t ino;
712 1.1 bouyer {
713 1.2 lukem ino_t in;
714 1.2 lukem char *cp;
715 1.1 bouyer int namlen;
716 1.1 bouyer
717 1.1 bouyer cp = bufp + 2;
718 1.1 bouyer for (in = maxino; in > 0; in /= 10)
719 1.1 bouyer cp++;
720 1.1 bouyer *--cp = 0;
721 1.1 bouyer namlen = cp - bufp;
722 1.1 bouyer in = ino;
723 1.1 bouyer while (cp > bufp) {
724 1.1 bouyer *--cp = (in % 10) + '0';
725 1.1 bouyer in /= 10;
726 1.1 bouyer }
727 1.1 bouyer *cp = '#';
728 1.1 bouyer return (namlen);
729 1.1 bouyer }
730 1.1 bouyer
731 1.1 bouyer /*
732 1.1 bouyer * Get a directory block.
733 1.1 bouyer * Insure that it is held until another is requested.
734 1.1 bouyer */
735 1.1 bouyer static struct bufarea *
736 1.1 bouyer getdirblk(blkno, size)
737 1.1 bouyer daddr_t blkno;
738 1.1 bouyer long size;
739 1.1 bouyer {
740 1.1 bouyer
741 1.1 bouyer if (pdirbp != 0)
742 1.1 bouyer pdirbp->b_flags &= ~B_INUSE;
743 1.1 bouyer pdirbp = getdatablk(blkno, size);
744 1.1 bouyer return (pdirbp);
745 1.1 bouyer }
746