2 * Copyright (c) 1980, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)dir.c 8.8 (Berkeley) 4/28/95
34 * $FreeBSD: src/sbin/fsck/dir.c,v 1.15 1999/08/28 00:12:45 peter Exp $
35 * $DragonFly: src/sbin/fsck/dir.c,v 1.7 2004/12/18 21:43:38 swildner Exp $
38 #include <sys/param.h>
41 #include <vfs/ufs/dinode.h>
42 #include <vfs/ufs/dir.h>
43 #include <vfs/ufs/fs.h>
50 char *lfname = "lost+found";
52 struct dirtemplate emptydir = { 0, DIRBLKSIZ };
53 struct dirtemplate dirhead = {
54 0, 12, DT_DIR, 1, ".",
55 0, DIRBLKSIZ - 12, DT_DIR, 2, ".."
57 struct odirtemplate odirhead = {
59 0, DIRBLKSIZ - 12, 2, ".."
62 static int chgino(struct inodesc *);
63 static int dircheck(struct inodesc *, struct direct *);
64 static int expanddir(struct dinode *dp, char *name);
65 static void freedir(ino_t ino, ino_t parent);
66 static struct direct *fsck_readdir(struct inodesc *);
67 static struct bufarea *getdirblk(ufs_daddr_t blkno, long size);
68 static int lftempname(char *bufp, ino_t ino);
69 static int mkentry(struct inodesc *);
72 * Propagate connected state through the tree.
77 register struct inoinfo **inpp, *inp;
78 struct inoinfo **inpend;
81 inpend = &inpsort[inplast];
84 for (inpp = inpsort; inpp < inpend; inpp++) {
86 if (inp->i_parent == 0)
88 if (inoinfo(inp->i_parent)->ino_state == DFOUND &&
89 inoinfo(inp->i_number)->ino_state == DSTATE) {
90 inoinfo(inp->i_number)->ino_state = DFOUND;
98 * Scan each entry in a directory block.
101 dirscan(register struct inodesc *idesc)
103 register struct direct *dp;
104 register struct bufarea *bp;
105 unsigned int dsize, n;
107 char dbuf[DIRBLKSIZ];
109 if (idesc->id_type != DATA)
110 errx(EEXIT, "wrong type to dirscan %d", idesc->id_type);
111 if (idesc->id_entryno == 0 &&
112 (idesc->id_filesize & (DIRBLKSIZ - 1)) != 0)
113 idesc->id_filesize = roundup(idesc->id_filesize, DIRBLKSIZ);
114 blksiz = idesc->id_numfrags * sblock.fs_fsize;
115 if (chkrange(idesc->id_blkno, idesc->id_numfrags)) {
116 idesc->id_filesize -= blksiz;
120 for (dp = fsck_readdir(idesc); dp != NULL; dp = fsck_readdir(idesc)) {
121 dsize = dp->d_reclen;
122 if (dsize > sizeof(dbuf))
123 dsize = sizeof(dbuf);
124 memmove(dbuf, dp, (size_t)dsize);
125 # if (BYTE_ORDER == LITTLE_ENDIAN)
127 struct direct *tdp = (struct direct *)dbuf;
131 tdp->d_namlen = tdp->d_type;
135 idesc->id_dirp = (struct direct *)dbuf;
136 if ((n = (*idesc->id_func)(idesc)) & ALTERED) {
137 # if (BYTE_ORDER == LITTLE_ENDIAN)
138 if (!newinofmt && !doinglevel2) {
142 tdp = (struct direct *)dbuf;
144 tdp->d_namlen = tdp->d_type;
148 bp = getdirblk(idesc->id_blkno, blksiz);
149 memmove(bp->b_un.b_buf + idesc->id_loc - dsize, dbuf,
157 return (idesc->id_filesize > 0 ? KEEPON : STOP);
161 * get next entry in a directory.
163 static struct direct *
164 fsck_readdir(register struct inodesc *idesc)
166 register struct direct *dp, *ndp;
167 register struct bufarea *bp;
168 long size, blksiz, fix, dploc;
170 blksiz = idesc->id_numfrags * sblock.fs_fsize;
171 bp = getdirblk(idesc->id_blkno, blksiz);
172 if (idesc->id_loc % DIRBLKSIZ == 0 && idesc->id_filesize > 0 &&
173 idesc->id_loc < blksiz) {
174 dp = (struct direct *)(bp->b_un.b_buf + idesc->id_loc);
175 if (dircheck(idesc, dp))
177 if (idesc->id_fix == IGNORE)
179 fix = dofix(idesc, "DIRECTORY CORRUPTED");
180 bp = getdirblk(idesc->id_blkno, blksiz);
181 dp = (struct direct *)(bp->b_un.b_buf + idesc->id_loc);
182 dp->d_reclen = DIRBLKSIZ;
186 dp->d_name[0] = '\0';
189 idesc->id_loc += DIRBLKSIZ;
190 idesc->id_filesize -= DIRBLKSIZ;
194 if (idesc->id_filesize <= 0 || idesc->id_loc >= blksiz)
196 dploc = idesc->id_loc;
197 dp = (struct direct *)(bp->b_un.b_buf + dploc);
198 idesc->id_loc += dp->d_reclen;
199 idesc->id_filesize -= dp->d_reclen;
200 if ((idesc->id_loc % DIRBLKSIZ) == 0)
202 ndp = (struct direct *)(bp->b_un.b_buf + idesc->id_loc);
203 if (idesc->id_loc < blksiz && idesc->id_filesize > 0 &&
204 dircheck(idesc, ndp) == 0) {
205 size = DIRBLKSIZ - (idesc->id_loc % DIRBLKSIZ);
206 idesc->id_loc += size;
207 idesc->id_filesize -= size;
208 if (idesc->id_fix == IGNORE)
210 fix = dofix(idesc, "DIRECTORY CORRUPTED");
211 bp = getdirblk(idesc->id_blkno, blksiz);
212 dp = (struct direct *)(bp->b_un.b_buf + dploc);
213 dp->d_reclen += size;
221 * Verify that a directory entry is valid.
222 * This is a superset of the checks made in the kernel.
225 dircheck(struct inodesc *idesc, register struct direct *dp)
232 spaceleft = DIRBLKSIZ - (idesc->id_loc % DIRBLKSIZ);
233 if (dp->d_reclen == 0 ||
234 dp->d_reclen > spaceleft ||
235 (dp->d_reclen & 0x3) != 0)
239 size = DIRSIZ(!newinofmt, dp);
240 # if (BYTE_ORDER == LITTLE_ENDIAN)
245 namlen = dp->d_namlen;
249 namlen = dp->d_namlen;
252 if (dp->d_reclen < size ||
253 idesc->id_filesize < size ||
254 namlen > MAXNAMLEN ||
257 for (cp = dp->d_name, size = 0; size < namlen; size++)
258 if (*cp == '\0' || (*cp++ == '/'))
266 direrror(ino_t ino, char *errmesg)
269 fileerror(ino, ino, errmesg);
273 fileerror(ino_t cwd, ino_t ino, char *errmesg)
275 register struct dinode *dp;
276 char pathbuf[MAXPATHLEN + 1];
278 pwarn("%s ", errmesg);
281 getpathname(pathbuf, cwd, ino);
282 if (ino < ROOTINO || ino > maxino) {
283 pfatal("NAME=%s\n", pathbuf);
289 (dp->di_mode & IFMT) == IFDIR ? "DIR" : "FILE", pathbuf);
291 pfatal("NAME=%s\n", pathbuf);
295 adjust(register struct inodesc *idesc, int lcnt)
300 dp = ginode(idesc->id_number);
301 if (dp->di_nlink == lcnt) {
303 * If we have not hit any unresolved problems, are running
304 * in preen mode, and are on a filesystem using soft updates,
305 * then just toss any partially allocated files.
307 if (resolved && preen && usedsoftdep) {
308 clri(idesc, "UNREF", 1);
312 * The filesystem can be marked clean even if
313 * a file is not linked up, but is cleared.
314 * Hence, resolved should not be cleared when
315 * linkup is answered no, but clri is answered yes.
317 saveresolved = resolved;
318 if (linkup(idesc->id_number, (ino_t)0, NULL) == 0) {
319 resolved = saveresolved;
320 clri(idesc, "UNREF", 0);
324 * Account for the new reference created by linkup().
326 dp = ginode(idesc->id_number);
331 pwarn("LINK COUNT %s", (lfdir == idesc->id_number) ? lfname :
332 ((dp->di_mode & IFMT) == IFDIR ? "DIR" : "FILE"));
333 pinode(idesc->id_number);
334 printf(" COUNT %d SHOULD BE %d",
335 dp->di_nlink, dp->di_nlink - lcnt);
336 if (preen || usedsoftdep) {
339 pfatal("LINK COUNT INCREASING");
342 printf(" (ADJUSTED)\n");
344 if (preen || reply("ADJUST") == 1) {
345 dp->di_nlink -= lcnt;
352 mkentry(struct inodesc *idesc)
354 register struct direct *dirp = idesc->id_dirp;
355 struct direct newent;
358 newent.d_namlen = strlen(idesc->id_name);
359 newlen = DIRSIZ(0, &newent);
360 if (dirp->d_ino != 0)
361 oldlen = DIRSIZ(0, dirp);
364 if (dirp->d_reclen - oldlen < newlen)
366 newent.d_reclen = dirp->d_reclen - oldlen;
367 dirp->d_reclen = oldlen;
368 dirp = (struct direct *)(((char *)dirp) + oldlen);
369 dirp->d_ino = idesc->id_parent; /* ino to be entered is in id_parent */
370 dirp->d_reclen = newent.d_reclen;
372 dirp->d_type = inoinfo(idesc->id_parent)->ino_type;
375 dirp->d_namlen = newent.d_namlen;
376 memmove(dirp->d_name, idesc->id_name, (size_t)newent.d_namlen + 1);
377 # if (BYTE_ORDER == LITTLE_ENDIAN)
379 * If the entry was split, dirscan() will only reverse the byte
380 * order of the original entry, and not the new one, before
381 * writing it back out. So, we reverse the byte order here if
384 if (oldlen != 0 && !newinofmt && !doinglevel2) {
387 tmp = dirp->d_namlen;
388 dirp->d_namlen = dirp->d_type;
392 return (ALTERED|STOP);
396 chgino(struct inodesc *idesc)
398 register struct direct *dirp = idesc->id_dirp;
400 if (memcmp(dirp->d_name, idesc->id_name, (int)dirp->d_namlen + 1))
402 dirp->d_ino = idesc->id_parent;
404 dirp->d_type = inoinfo(idesc->id_parent)->ino_type;
407 return (ALTERED|STOP);
411 linkup(ino_t orphan, ino_t parentdir, char *name)
413 register struct dinode *dp;
416 struct inodesc idesc;
417 char tempname[BUFSIZ];
419 memset(&idesc, 0, sizeof(struct inodesc));
421 lostdir = (dp->di_mode & IFMT) == IFDIR;
422 pwarn("UNREF %s ", lostdir ? "DIR" : "FILE");
424 if (preen && dp->di_size == 0)
427 printf(" (RECONNECTED)\n");
429 if (reply("RECONNECT") == 0)
432 dp = ginode(ROOTINO);
433 idesc.id_name = lfname;
434 idesc.id_type = DATA;
435 idesc.id_func = findino;
436 idesc.id_number = ROOTINO;
437 if ((ckinode(dp, &idesc) & FOUND) != 0) {
438 lfdir = idesc.id_parent;
440 pwarn("NO lost+found DIRECTORY");
441 if (preen || reply("CREATE")) {
442 lfdir = allocdir(ROOTINO, (ino_t)0, lfmode);
444 if (makeentry(ROOTINO, lfdir, lfname) != 0) {
447 printf(" (CREATED)\n");
449 freedir(lfdir, ROOTINO);
458 pfatal("SORRY. CANNOT CREATE lost+found DIRECTORY");
464 if ((dp->di_mode & IFMT) != IFDIR) {
465 pfatal("lost+found IS NOT A DIRECTORY");
466 if (reply("REALLOCATE") == 0)
469 if ((lfdir = allocdir(ROOTINO, (ino_t)0, lfmode)) == 0) {
470 pfatal("SORRY. CANNOT CREATE lost+found DIRECTORY\n\n");
473 if ((changeino(ROOTINO, lfname, lfdir) & ALTERED) == 0) {
474 pfatal("SORRY. CANNOT CREATE lost+found DIRECTORY\n\n");
478 idesc.id_type = ADDR;
479 idesc.id_func = pass4check;
480 idesc.id_number = oldlfdir;
481 adjust(&idesc, inoinfo(oldlfdir)->ino_linkcnt + 1);
482 inoinfo(oldlfdir)->ino_linkcnt = 0;
485 if (inoinfo(lfdir)->ino_state != DFOUND) {
486 pfatal("SORRY. NO lost+found DIRECTORY\n\n");
489 lftempname(tempname, orphan);
490 if (makeentry(lfdir, orphan, (name ? name : tempname)) == 0) {
491 pfatal("SORRY. NO SPACE IN lost+found DIRECTORY");
495 inoinfo(orphan)->ino_linkcnt--;
497 if ((changeino(orphan, "..", lfdir) & ALTERED) == 0 &&
498 parentdir != (ino_t)-1)
499 makeentry(orphan, lfdir, "..");
503 inoinfo(lfdir)->ino_linkcnt++;
504 pwarn("DIR I=%lu CONNECTED. ", orphan);
505 if (parentdir != (ino_t)-1) {
506 printf("PARENT WAS I=%lu\n", (u_long)parentdir);
508 * The parent directory, because of the ordering
509 * guarantees, has had the link count incremented
510 * for the child, but no entry was made. This
511 * fixes the parent link count so that fsck does
512 * not need to be rerun.
514 inoinfo(parentdir)->ino_linkcnt++;
523 * fix an entry in a directory.
526 changeino(ino_t dir, char *name, ino_t newnum)
528 struct inodesc idesc;
530 memset(&idesc, 0, sizeof(struct inodesc));
531 idesc.id_type = DATA;
532 idesc.id_func = chgino;
533 idesc.id_number = dir;
534 idesc.id_fix = DONTKNOW;
535 idesc.id_name = name;
536 idesc.id_parent = newnum; /* new value for name */
537 return (ckinode(ginode(dir), &idesc));
541 * make an entry in a directory
544 makeentry(ino_t parent, ino_t ino, char *name)
547 struct inodesc idesc;
548 char pathbuf[MAXPATHLEN + 1];
550 if (parent < ROOTINO || parent >= maxino ||
551 ino < ROOTINO || ino >= maxino)
553 memset(&idesc, 0, sizeof(struct inodesc));
554 idesc.id_type = DATA;
555 idesc.id_func = mkentry;
556 idesc.id_number = parent;
557 idesc.id_parent = ino; /* this is the inode to enter */
558 idesc.id_fix = DONTKNOW;
559 idesc.id_name = name;
561 if (dp->di_size % DIRBLKSIZ) {
562 dp->di_size = roundup(dp->di_size, DIRBLKSIZ);
565 if ((ckinode(dp, &idesc) & ALTERED) != 0)
567 getpathname(pathbuf, parent, parent);
569 if (expanddir(dp, pathbuf) == 0)
571 return (ckinode(dp, &idesc) & ALTERED);
575 * Attempt to expand the size of a directory
578 expanddir(register struct dinode *dp, char *name)
580 ufs_daddr_t lastbn, newblk;
581 register struct bufarea *bp;
582 char *cp, firstblk[DIRBLKSIZ];
584 lastbn = lblkno(&sblock, dp->di_size);
585 if (lastbn >= NDADDR - 1 || dp->di_db[lastbn] == 0 || dp->di_size == 0)
587 if ((newblk = allocblk(sblock.fs_frag)) == 0)
589 dp->di_db[lastbn + 1] = dp->di_db[lastbn];
590 dp->di_db[lastbn] = newblk;
591 dp->di_size += sblock.fs_bsize;
592 dp->di_blocks += btodb(sblock.fs_bsize);
593 bp = getdirblk(dp->di_db[lastbn + 1],
594 (long)dblksize(&sblock, dp, lastbn + 1));
597 memmove(firstblk, bp->b_un.b_buf, DIRBLKSIZ);
598 bp = getdirblk(newblk, sblock.fs_bsize);
601 memmove(bp->b_un.b_buf, firstblk, DIRBLKSIZ);
602 for (cp = &bp->b_un.b_buf[DIRBLKSIZ];
603 cp < &bp->b_un.b_buf[sblock.fs_bsize];
605 memmove(cp, &emptydir, sizeof emptydir);
607 bp = getdirblk(dp->di_db[lastbn + 1],
608 (long)dblksize(&sblock, dp, lastbn + 1));
611 memmove(bp->b_un.b_buf, &emptydir, sizeof emptydir);
612 pwarn("NO SPACE LEFT IN %s", name);
614 printf(" (EXPANDED)\n");
615 else if (reply("EXPAND") == 0)
621 dp->di_db[lastbn] = dp->di_db[lastbn + 1];
622 dp->di_db[lastbn + 1] = 0;
623 dp->di_size -= sblock.fs_bsize;
624 dp->di_blocks -= btodb(sblock.fs_bsize);
625 freeblk(newblk, sblock.fs_frag);
630 * allocate a new directory
633 allocdir(ino_t parent, ino_t request, int mode)
638 register struct bufarea *bp;
639 struct dirtemplate *dirp;
641 ino = allocino(request, IFDIR|mode);
645 dirp = (struct dirtemplate *)&odirhead;
647 dirp->dotdot_ino = parent;
649 bp = getdirblk(dp->di_db[0], sblock.fs_fsize);
654 memmove(bp->b_un.b_buf, dirp, sizeof(struct dirtemplate));
655 for (cp = &bp->b_un.b_buf[DIRBLKSIZ];
656 cp < &bp->b_un.b_buf[sblock.fs_fsize];
658 memmove(cp, &emptydir, sizeof emptydir);
662 if (ino == ROOTINO) {
663 inoinfo(ino)->ino_linkcnt = dp->di_nlink;
667 if (inoinfo(parent)->ino_state != DSTATE &&
668 inoinfo(parent)->ino_state != DFOUND) {
673 inoinfo(ino)->ino_state = inoinfo(parent)->ino_state;
674 if (inoinfo(ino)->ino_state == DSTATE) {
675 inoinfo(ino)->ino_linkcnt = dp->di_nlink;
676 inoinfo(parent)->ino_linkcnt++;
685 * free a directory inode
688 freedir(ino_t ino, ino_t parent)
701 * generate a temporary name for the lost+found directory.
704 lftempname(char *bufp, ino_t ino)
711 for (in = maxino; in > 0; in /= 10)
717 *--cp = (in % 10) + '0';
725 * Get a directory block.
726 * Insure that it is held until another is requested.
728 static struct bufarea *
729 getdirblk(ufs_daddr_t blkno, long size)
733 pdirbp->b_flags &= ~B_INUSE;
734 pdirbp = getdatablk(blkno, size);