]> CyberLeo.Net >> Repos - FreeBSD/releng/7.2.git/blob - sbin/fsck_ffs/inode.c
Create releng/7.2 from stable/7 in preparation for 7.2-RELEASE.
[FreeBSD/releng/7.2.git] / sbin / fsck_ffs / inode.c
1 /*
2  * Copyright (c) 1980, 1986, 1993
3  *      The Regents of the University of California.  All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
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  * 4. Neither the name of the University nor the names of its contributors
14  *    may be used to endorse or promote products derived from this software
15  *    without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  */
29
30 #if 0
31 #ifndef lint
32 static const char sccsid[] = "@(#)inode.c       8.8 (Berkeley) 4/28/95";
33 #endif /* not lint */
34 #endif
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
37
38 #include <sys/param.h>
39 #include <sys/stdint.h>
40 #include <sys/time.h>
41 #include <sys/sysctl.h>
42
43 #include <ufs/ufs/dinode.h>
44 #include <ufs/ufs/dir.h>
45 #include <ufs/ffs/fs.h>
46
47 #include <err.h>
48 #include <pwd.h>
49 #include <string.h>
50
51 #include "fsck.h"
52
53 static ino_t startinum;
54
55 static int iblock(struct inodesc *, long ilevel, off_t isize);
56
57 int
58 ckinode(union dinode *dp, struct inodesc *idesc)
59 {
60         off_t remsize, sizepb;
61         int i, offset, ret;
62         union dinode dino;
63         ufs2_daddr_t ndb;
64         mode_t mode;
65         char pathbuf[MAXPATHLEN + 1];
66
67         if (idesc->id_fix != IGNORE)
68                 idesc->id_fix = DONTKNOW;
69         idesc->id_lbn = -1;
70         idesc->id_entryno = 0;
71         idesc->id_filesize = DIP(dp, di_size);
72         mode = DIP(dp, di_mode) & IFMT;
73         if (mode == IFBLK || mode == IFCHR || (mode == IFLNK &&
74             DIP(dp, di_size) < (unsigned)sblock.fs_maxsymlinklen))
75                 return (KEEPON);
76         if (sblock.fs_magic == FS_UFS1_MAGIC)
77                 dino.dp1 = dp->dp1;
78         else
79                 dino.dp2 = dp->dp2;
80         ndb = howmany(DIP(&dino, di_size), sblock.fs_bsize);
81         for (i = 0; i < NDADDR; i++) {
82                 idesc->id_lbn++;
83                 if (--ndb == 0 &&
84                     (offset = blkoff(&sblock, DIP(&dino, di_size))) != 0)
85                         idesc->id_numfrags =
86                                 numfrags(&sblock, fragroundup(&sblock, offset));
87                 else
88                         idesc->id_numfrags = sblock.fs_frag;
89                 if (DIP(&dino, di_db[i]) == 0) {
90                         if (idesc->id_type == DATA && ndb >= 0) {
91                                 /* An empty block in a directory XXX */
92                                 getpathname(pathbuf, idesc->id_number,
93                                                 idesc->id_number);
94                                 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
95                                         pathbuf);
96                                 if (reply("ADJUST LENGTH") == 1) {
97                                         dp = ginode(idesc->id_number);
98                                         DIP_SET(dp, di_size,
99                                             i * sblock.fs_bsize);
100                                         printf(
101                                             "YOU MUST RERUN FSCK AFTERWARDS\n");
102                                         rerun = 1;
103                                         inodirty();
104                                         
105                                 }
106                         }
107                         continue;
108                 }
109                 idesc->id_blkno = DIP(&dino, di_db[i]);
110                 if (idesc->id_type != DATA)
111                         ret = (*idesc->id_func)(idesc);
112                 else
113                         ret = dirscan(idesc);
114                 if (ret & STOP)
115                         return (ret);
116         }
117         idesc->id_numfrags = sblock.fs_frag;
118         remsize = DIP(&dino, di_size) - sblock.fs_bsize * NDADDR;
119         sizepb = sblock.fs_bsize;
120         for (i = 0; i < NIADDR; i++) {
121                 sizepb *= NINDIR(&sblock);
122                 if (DIP(&dino, di_ib[i])) {
123                         idesc->id_blkno = DIP(&dino, di_ib[i]);
124                         ret = iblock(idesc, i + 1, remsize);
125                         if (ret & STOP)
126                                 return (ret);
127                 } else {
128                         idesc->id_lbn += sizepb / sblock.fs_bsize;
129                         if (idesc->id_type == DATA && remsize > 0) {
130                                 /* An empty block in a directory XXX */
131                                 getpathname(pathbuf, idesc->id_number,
132                                                 idesc->id_number);
133                                 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
134                                         pathbuf);
135                                 if (reply("ADJUST LENGTH") == 1) {
136                                         dp = ginode(idesc->id_number);
137                                         DIP_SET(dp, di_size,
138                                             DIP(dp, di_size) - remsize);
139                                         remsize = 0;
140                                         printf(
141                                             "YOU MUST RERUN FSCK AFTERWARDS\n");
142                                         rerun = 1;
143                                         inodirty();
144                                         break;
145                                 }
146                         }
147                 }
148                 remsize -= sizepb;
149         }
150         return (KEEPON);
151 }
152
153 static int
154 iblock(struct inodesc *idesc, long ilevel, off_t isize)
155 {
156         struct bufarea *bp;
157         int i, n, (*func)(struct inodesc *), nif;
158         off_t sizepb;
159         char buf[BUFSIZ];
160         char pathbuf[MAXPATHLEN + 1];
161         union dinode *dp;
162
163         if (idesc->id_type != DATA) {
164                 func = idesc->id_func;
165                 if (((n = (*func)(idesc)) & KEEPON) == 0)
166                         return (n);
167         } else
168                 func = dirscan;
169         if (chkrange(idesc->id_blkno, idesc->id_numfrags))
170                 return (SKIP);
171         bp = getdatablk(idesc->id_blkno, sblock.fs_bsize);
172         ilevel--;
173         for (sizepb = sblock.fs_bsize, i = 0; i < ilevel; i++)
174                 sizepb *= NINDIR(&sblock);
175         if (howmany(isize, sizepb) > NINDIR(&sblock))
176                 nif = NINDIR(&sblock);
177         else
178                 nif = howmany(isize, sizepb);
179         if (idesc->id_func == pass1check && nif < NINDIR(&sblock)) {
180                 for (i = nif; i < NINDIR(&sblock); i++) {
181                         if (IBLK(bp, i) == 0)
182                                 continue;
183                         (void)sprintf(buf, "PARTIALLY TRUNCATED INODE I=%lu",
184                             (u_long)idesc->id_number);
185                         if (preen) {
186                                 pfatal("%s", buf);
187                         } else if (dofix(idesc, buf)) {
188                                 IBLK_SET(bp, i, 0);
189                                 dirty(bp);
190                         }
191                 }
192                 flush(fswritefd, bp);
193         }
194         for (i = 0; i < nif; i++) {
195                 if (ilevel == 0)
196                         idesc->id_lbn++;
197                 if (IBLK(bp, i)) {
198                         idesc->id_blkno = IBLK(bp, i);
199                         if (ilevel == 0)
200                                 n = (*func)(idesc);
201                         else
202                                 n = iblock(idesc, ilevel, isize);
203                         if (n & STOP) {
204                                 bp->b_flags &= ~B_INUSE;
205                                 return (n);
206                         }
207                 } else {
208                         if (idesc->id_type == DATA && isize > 0) {
209                                 /* An empty block in a directory XXX */
210                                 getpathname(pathbuf, idesc->id_number,
211                                                 idesc->id_number);
212                                 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
213                                         pathbuf);
214                                 if (reply("ADJUST LENGTH") == 1) {
215                                         dp = ginode(idesc->id_number);
216                                         DIP_SET(dp, di_size,
217                                             DIP(dp, di_size) - isize);
218                                         isize = 0;
219                                         printf(
220                                             "YOU MUST RERUN FSCK AFTERWARDS\n");
221                                         rerun = 1;
222                                         inodirty();
223                                         bp->b_flags &= ~B_INUSE;
224                                         return(STOP);
225                                 }
226                         }
227                 }
228                 isize -= sizepb;
229         }
230         bp->b_flags &= ~B_INUSE;
231         return (KEEPON);
232 }
233
234 /*
235  * Check that a block in a legal block number.
236  * Return 0 if in range, 1 if out of range.
237  */
238 int
239 chkrange(ufs2_daddr_t blk, int cnt)
240 {
241         int c;
242
243         if (cnt <= 0 || blk <= 0 || blk > maxfsblock ||
244             cnt - 1 > maxfsblock - blk)
245                 return (1);
246         if (cnt > sblock.fs_frag ||
247             fragnum(&sblock, blk) + cnt > sblock.fs_frag) {
248                 if (debug)
249                         printf("bad size: blk %ld, offset %i, size %d\n",
250                             (long)blk, (int)fragnum(&sblock, blk), cnt);
251                 return (1);
252         }
253         c = dtog(&sblock, blk);
254         if (blk < cgdmin(&sblock, c)) {
255                 if ((blk + cnt) > cgsblock(&sblock, c)) {
256                         if (debug) {
257                                 printf("blk %ld < cgdmin %ld;",
258                                     (long)blk, (long)cgdmin(&sblock, c));
259                                 printf(" blk + cnt %ld > cgsbase %ld\n",
260                                     (long)(blk + cnt),
261                                     (long)cgsblock(&sblock, c));
262                         }
263                         return (1);
264                 }
265         } else {
266                 if ((blk + cnt) > cgbase(&sblock, c+1)) {
267                         if (debug)  {
268                                 printf("blk %ld >= cgdmin %ld;",
269                                     (long)blk, (long)cgdmin(&sblock, c));
270                                 printf(" blk + cnt %ld > sblock.fs_fpg %ld\n",
271                                     (long)(blk + cnt), (long)sblock.fs_fpg);
272                         }
273                         return (1);
274                 }
275         }
276         return (0);
277 }
278
279 /*
280  * General purpose interface for reading inodes.
281  */
282 union dinode *
283 ginode(ino_t inumber)
284 {
285         ufs2_daddr_t iblk;
286
287         if (inumber < ROOTINO || inumber > maxino)
288                 errx(EEXIT, "bad inode number %d to ginode", inumber);
289         if (startinum == 0 ||
290             inumber < startinum || inumber >= startinum + INOPB(&sblock)) {
291                 iblk = ino_to_fsba(&sblock, inumber);
292                 if (pbp != 0)
293                         pbp->b_flags &= ~B_INUSE;
294                 pbp = getdatablk(iblk, sblock.fs_bsize);
295                 startinum = (inumber / INOPB(&sblock)) * INOPB(&sblock);
296         }
297         if (sblock.fs_magic == FS_UFS1_MAGIC)
298                 return ((union dinode *)
299                     &pbp->b_un.b_dinode1[inumber % INOPB(&sblock)]);
300         return ((union dinode *)&pbp->b_un.b_dinode2[inumber % INOPB(&sblock)]);
301 }
302
303 /*
304  * Special purpose version of ginode used to optimize first pass
305  * over all the inodes in numerical order.
306  */
307 static ino_t nextino, lastinum, lastvalidinum;
308 static long readcnt, readpercg, fullcnt, inobufsize, partialcnt, partialsize;
309 static caddr_t inodebuf;
310
311 union dinode *
312 getnextinode(ino_t inumber)
313 {
314         long size;
315         ufs2_daddr_t dblk;
316         union dinode *dp;
317         static caddr_t nextinop;
318
319         if (inumber != nextino++ || inumber > lastvalidinum)
320                 errx(EEXIT, "bad inode number %d to nextinode", inumber);
321         if (inumber >= lastinum) {
322                 readcnt++;
323                 dblk = fsbtodb(&sblock, ino_to_fsba(&sblock, lastinum));
324                 if (readcnt % readpercg == 0) {
325                         size = partialsize;
326                         lastinum += partialcnt;
327                 } else {
328                         size = inobufsize;
329                         lastinum += fullcnt;
330                 }
331                 /*
332                  * If blread returns an error, it will already have zeroed
333                  * out the buffer, so we do not need to do so here.
334                  */
335                 (void)blread(fsreadfd, inodebuf, dblk, size);
336                 nextinop = inodebuf;
337         }
338         dp = (union dinode *)nextinop;
339         if (sblock.fs_magic == FS_UFS1_MAGIC)
340                 nextinop += sizeof(struct ufs1_dinode);
341         else
342                 nextinop += sizeof(struct ufs2_dinode);
343         return (dp);
344 }
345
346 void
347 setinodebuf(ino_t inum)
348 {
349
350         if (inum % sblock.fs_ipg != 0)
351                 errx(EEXIT, "bad inode number %d to setinodebuf", inum);
352         lastvalidinum = inum + sblock.fs_ipg - 1;
353         startinum = 0;
354         nextino = inum;
355         lastinum = inum;
356         readcnt = 0;
357         if (inodebuf != NULL)
358                 return;
359         inobufsize = blkroundup(&sblock, INOBUFSIZE);
360         fullcnt = inobufsize / ((sblock.fs_magic == FS_UFS1_MAGIC) ?
361             sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode));
362         readpercg = sblock.fs_ipg / fullcnt;
363         partialcnt = sblock.fs_ipg % fullcnt;
364         partialsize = partialcnt * ((sblock.fs_magic == FS_UFS1_MAGIC) ?
365             sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode));
366         if (partialcnt != 0) {
367                 readpercg++;
368         } else {
369                 partialcnt = fullcnt;
370                 partialsize = inobufsize;
371         }
372         if ((inodebuf = malloc((unsigned)inobufsize)) == NULL)
373                 errx(EEXIT, "cannot allocate space for inode buffer");
374 }
375
376 void
377 freeinodebuf(void)
378 {
379
380         if (inodebuf != NULL)
381                 free((char *)inodebuf);
382         inodebuf = NULL;
383 }
384
385 /*
386  * Routines to maintain information about directory inodes.
387  * This is built during the first pass and used during the
388  * second and third passes.
389  *
390  * Enter inodes into the cache.
391  */
392 void
393 cacheino(union dinode *dp, ino_t inumber)
394 {
395         struct inoinfo *inp, **inpp;
396         int i, blks;
397
398         if (howmany(DIP(dp, di_size), sblock.fs_bsize) > NDADDR)
399                 blks = NDADDR + NIADDR;
400         else
401                 blks = howmany(DIP(dp, di_size), sblock.fs_bsize);
402         inp = (struct inoinfo *)
403                 malloc(sizeof(*inp) + (blks - 1) * sizeof(ufs2_daddr_t));
404         if (inp == NULL)
405                 errx(EEXIT, "cannot increase directory list");
406         inpp = &inphead[inumber % dirhash];
407         inp->i_nexthash = *inpp;
408         *inpp = inp;
409         inp->i_parent = inumber == ROOTINO ? ROOTINO : (ino_t)0;
410         inp->i_dotdot = (ino_t)0;
411         inp->i_number = inumber;
412         inp->i_isize = DIP(dp, di_size);
413         inp->i_numblks = blks;
414         for (i = 0; i < (blks < NDADDR ? blks : NDADDR); i++)
415                 inp->i_blks[i] = DIP(dp, di_db[i]);
416         if (blks > NDADDR)
417                 for (i = 0; i < NIADDR; i++)
418                         inp->i_blks[NDADDR + i] = DIP(dp, di_ib[i]);
419         if (inplast == listmax) {
420                 listmax += 100;
421                 inpsort = (struct inoinfo **)realloc((char *)inpsort,
422                     (unsigned)listmax * sizeof(struct inoinfo *));
423                 if (inpsort == NULL)
424                         errx(EEXIT, "cannot increase directory list");
425         }
426         inpsort[inplast++] = inp;
427 }
428
429 /*
430  * Look up an inode cache structure.
431  */
432 struct inoinfo *
433 getinoinfo(ino_t inumber)
434 {
435         struct inoinfo *inp;
436
437         for (inp = inphead[inumber % dirhash]; inp; inp = inp->i_nexthash) {
438                 if (inp->i_number != inumber)
439                         continue;
440                 return (inp);
441         }
442         errx(EEXIT, "cannot find inode %d", inumber);
443         return ((struct inoinfo *)0);
444 }
445
446 /*
447  * Clean up all the inode cache structure.
448  */
449 void
450 inocleanup(void)
451 {
452         struct inoinfo **inpp;
453
454         if (inphead == NULL)
455                 return;
456         for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--)
457                 free((char *)(*inpp));
458         free((char *)inphead);
459         free((char *)inpsort);
460         inphead = inpsort = NULL;
461 }
462
463 void
464 inodirty(void)
465 {
466
467         dirty(pbp);
468 }
469
470 void
471 clri(struct inodesc *idesc, const char *type, int flag)
472 {
473         union dinode *dp;
474
475         dp = ginode(idesc->id_number);
476         if (flag == 1) {
477                 pwarn("%s %s", type,
478                     (DIP(dp, di_mode) & IFMT) == IFDIR ? "DIR" : "FILE");
479                 pinode(idesc->id_number);
480         }
481         if (preen || reply("CLEAR") == 1) {
482                 if (preen)
483                         printf(" (CLEARED)\n");
484                 n_files--;
485                 if (bkgrdflag == 0) {
486                         (void)ckinode(dp, idesc);
487                         inoinfo(idesc->id_number)->ino_state = USTATE;
488                         clearinode(dp);
489                         inodirty();
490                 } else {
491                         cmd.value = idesc->id_number;
492                         cmd.size = -DIP(dp, di_nlink);
493                         if (debug)
494                                 printf("adjrefcnt ino %ld amt %lld\n",
495                                     (long)cmd.value, (long long)cmd.size);
496                         if (sysctl(adjrefcnt, MIBSIZE, 0, 0,
497                             &cmd, sizeof cmd) == -1)
498                                 rwerror("ADJUST INODE", cmd.value);
499                 }
500         }
501 }
502
503 int
504 findname(struct inodesc *idesc)
505 {
506         struct direct *dirp = idesc->id_dirp;
507
508         if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
509                 idesc->id_entryno++;
510                 return (KEEPON);
511         }
512         memmove(idesc->id_name, dirp->d_name, (size_t)dirp->d_namlen + 1);
513         return (STOP|FOUND);
514 }
515
516 int
517 findino(struct inodesc *idesc)
518 {
519         struct direct *dirp = idesc->id_dirp;
520
521         if (dirp->d_ino == 0)
522                 return (KEEPON);
523         if (strcmp(dirp->d_name, idesc->id_name) == 0 &&
524             dirp->d_ino >= ROOTINO && dirp->d_ino <= maxino) {
525                 idesc->id_parent = dirp->d_ino;
526                 return (STOP|FOUND);
527         }
528         return (KEEPON);
529 }
530
531 int
532 clearentry(struct inodesc *idesc)
533 {
534         struct direct *dirp = idesc->id_dirp;
535
536         if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
537                 idesc->id_entryno++;
538                 return (KEEPON);
539         }
540         dirp->d_ino = 0;
541         return (STOP|FOUND|ALTERED);
542 }
543
544 void
545 pinode(ino_t ino)
546 {
547         union dinode *dp;
548         char *p;
549         struct passwd *pw;
550         time_t t;
551
552         printf(" I=%lu ", (u_long)ino);
553         if (ino < ROOTINO || ino > maxino)
554                 return;
555         dp = ginode(ino);
556         printf(" OWNER=");
557         if ((pw = getpwuid((int)DIP(dp, di_uid))) != 0)
558                 printf("%s ", pw->pw_name);
559         else
560                 printf("%u ", (unsigned)DIP(dp, di_uid));
561         printf("MODE=%o\n", DIP(dp, di_mode));
562         if (preen)
563                 printf("%s: ", cdevname);
564         printf("SIZE=%ju ", (uintmax_t)DIP(dp, di_size));
565         t = DIP(dp, di_mtime);
566         p = ctime(&t);
567         printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]);
568 }
569
570 void
571 blkerror(ino_t ino, const char *type, ufs2_daddr_t blk)
572 {
573
574         pfatal("%jd %s I=%ju", (intmax_t)blk, type, (uintmax_t)ino);
575         printf("\n");
576         switch (inoinfo(ino)->ino_state) {
577
578         case FSTATE:
579         case FZLINK:
580                 inoinfo(ino)->ino_state = FCLEAR;
581                 return;
582
583         case DSTATE:
584         case DZLINK:
585                 inoinfo(ino)->ino_state = DCLEAR;
586                 return;
587
588         case FCLEAR:
589         case DCLEAR:
590                 return;
591
592         default:
593                 errx(EEXIT, "BAD STATE %d TO BLKERR", inoinfo(ino)->ino_state);
594                 /* NOTREACHED */
595         }
596 }
597
598 /*
599  * allocate an unused inode
600  */
601 ino_t
602 allocino(ino_t request, int type)
603 {
604         ino_t ino;
605         union dinode *dp;
606         struct cg *cgp = &cgrp;
607         int cg;
608
609         if (request == 0)
610                 request = ROOTINO;
611         else if (inoinfo(request)->ino_state != USTATE)
612                 return (0);
613         for (ino = request; ino < maxino; ino++)
614                 if (inoinfo(ino)->ino_state == USTATE)
615                         break;
616         if (ino == maxino)
617                 return (0);
618         cg = ino_to_cg(&sblock, ino);
619         getblk(&cgblk, cgtod(&sblock, cg), sblock.fs_cgsize);
620         check_cgmagic(cg, cgp);
621         setbit(cg_inosused(cgp), ino % sblock.fs_ipg);
622         cgp->cg_cs.cs_nifree--;
623         switch (type & IFMT) {
624         case IFDIR:
625                 inoinfo(ino)->ino_state = DSTATE;
626                 cgp->cg_cs.cs_ndir++;
627                 break;
628         case IFREG:
629         case IFLNK:
630                 inoinfo(ino)->ino_state = FSTATE;
631                 break;
632         default:
633                 return (0);
634         }
635         cgdirty();
636         dp = ginode(ino);
637         DIP_SET(dp, di_db[0], allocblk((long)1));
638         if (DIP(dp, di_db[0]) == 0) {
639                 inoinfo(ino)->ino_state = USTATE;
640                 return (0);
641         }
642         DIP_SET(dp, di_mode, type);
643         DIP_SET(dp, di_flags, 0);
644         DIP_SET(dp, di_atime, time(NULL));
645         DIP_SET(dp, di_ctime, DIP(dp, di_atime));
646         DIP_SET(dp, di_mtime, DIP(dp, di_ctime));
647         DIP_SET(dp, di_mtimensec, 0);
648         DIP_SET(dp, di_ctimensec, 0);
649         DIP_SET(dp, di_atimensec, 0);
650         DIP_SET(dp, di_size, sblock.fs_fsize);
651         DIP_SET(dp, di_blocks, btodb(sblock.fs_fsize));
652         n_files++;
653         inodirty();
654         inoinfo(ino)->ino_type = IFTODT(type);
655         return (ino);
656 }
657
658 /*
659  * deallocate an inode
660  */
661 void
662 freeino(ino_t ino)
663 {
664         struct inodesc idesc;
665         union dinode *dp;
666
667         memset(&idesc, 0, sizeof(struct inodesc));
668         idesc.id_type = ADDR;
669         idesc.id_func = pass4check;
670         idesc.id_number = ino;
671         dp = ginode(ino);
672         (void)ckinode(dp, &idesc);
673         clearinode(dp);
674         inodirty();
675         inoinfo(ino)->ino_state = USTATE;
676         n_files--;
677 }