inode.c revision 1.35 1 1.35 perseant /* $NetBSD: inode.c,v 1.35 2006/09/01 19:52:48 perseant Exp $ */
2 1.20 agc
3 1.23 perseant /*-
4 1.23 perseant * Copyright (c) 1997, 1998 The NetBSD Foundation, Inc.
5 1.23 perseant * All rights reserved.
6 1.23 perseant *
7 1.23 perseant * This code is derived from software contributed to The NetBSD Foundation
8 1.23 perseant * by Konrad E. Schroder <perseant (at) hhhh.org>.
9 1.20 agc *
10 1.20 agc * Redistribution and use in source and binary forms, with or without
11 1.20 agc * modification, are permitted provided that the following conditions
12 1.20 agc * are met:
13 1.20 agc * 1. Redistributions of source code must retain the above copyright
14 1.20 agc * notice, this list of conditions and the following disclaimer.
15 1.20 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.20 agc * notice, this list of conditions and the following disclaimer in the
17 1.20 agc * documentation and/or other materials provided with the distribution.
18 1.23 perseant * 3. All advertising materials mentioning features or use of this software
19 1.23 perseant * must display the following acknowledgement:
20 1.23 perseant * This product includes software developed by the NetBSD
21 1.23 perseant * Foundation, Inc. and its contributors.
22 1.23 perseant * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.23 perseant * contributors may be used to endorse or promote products derived
24 1.23 perseant * from this software without specific prior written permission.
25 1.20 agc *
26 1.23 perseant * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.23 perseant * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.23 perseant * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.23 perseant * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.23 perseant * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.23 perseant * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.23 perseant * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.23 perseant * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.23 perseant * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.23 perseant * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.23 perseant * POSSIBILITY OF SUCH DAMAGE.
37 1.20 agc */
38 1.1 perseant
39 1.1 perseant /*
40 1.23 perseant * Copyright (c) 1980, 1986, 1993
41 1.23 perseant * The Regents of the University of California. All rights reserved.
42 1.1 perseant *
43 1.1 perseant * Redistribution and use in source and binary forms, with or without
44 1.1 perseant * modification, are permitted provided that the following conditions
45 1.1 perseant * are met:
46 1.1 perseant * 1. Redistributions of source code must retain the above copyright
47 1.1 perseant * notice, this list of conditions and the following disclaimer.
48 1.1 perseant * 2. Redistributions in binary form must reproduce the above copyright
49 1.1 perseant * notice, this list of conditions and the following disclaimer in the
50 1.1 perseant * documentation and/or other materials provided with the distribution.
51 1.23 perseant * 3. Neither the name of the University nor the names of its contributors
52 1.1 perseant * may be used to endorse or promote products derived from this software
53 1.1 perseant * without specific prior written permission.
54 1.1 perseant *
55 1.1 perseant * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
56 1.1 perseant * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
57 1.1 perseant * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
58 1.1 perseant * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
59 1.1 perseant * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
60 1.1 perseant * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
61 1.1 perseant * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
62 1.1 perseant * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
63 1.1 perseant * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
64 1.1 perseant * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
65 1.1 perseant * SUCH DAMAGE.
66 1.1 perseant */
67 1.1 perseant
68 1.16 perseant #include <sys/types.h>
69 1.1 perseant #include <sys/param.h>
70 1.1 perseant #include <sys/time.h>
71 1.16 perseant #include <sys/buf.h>
72 1.16 perseant #include <sys/mount.h>
73 1.16 perseant
74 1.16 perseant #include <ufs/ufs/inode.h>
75 1.1 perseant #include <ufs/ufs/dir.h>
76 1.16 perseant #define vnode uvnode
77 1.1 perseant #include <ufs/lfs/lfs.h>
78 1.16 perseant #undef vnode
79 1.16 perseant
80 1.16 perseant #include <err.h>
81 1.1 perseant #ifndef SMALL
82 1.1 perseant #include <pwd.h>
83 1.1 perseant #endif
84 1.1 perseant #include <stdio.h>
85 1.1 perseant #include <stdlib.h>
86 1.1 perseant #include <string.h>
87 1.1 perseant
88 1.16 perseant #include "bufcache.h"
89 1.16 perseant #include "vnode.h"
90 1.31 christos #include "lfs_user.h"
91 1.16 perseant
92 1.1 perseant #include "fsck.h"
93 1.1 perseant #include "fsutil.h"
94 1.1 perseant #include "extern.h"
95 1.1 perseant
96 1.16 perseant extern SEGUSE *seg_table;
97 1.16 perseant extern ufs_daddr_t *din_table;
98 1.1 perseant
99 1.16 perseant static int iblock(struct inodesc *, long, u_int64_t);
100 1.16 perseant int blksreqd(struct lfs *, int);
101 1.16 perseant int lfs_maxino(void);
102 1.1 perseant
103 1.1 perseant /*
104 1.16 perseant * Get a dinode of a given inum.
105 1.16 perseant * XXX combine this function with vget.
106 1.1 perseant */
107 1.17 fvdl struct ufs1_dinode *
108 1.16 perseant ginode(ino_t ino)
109 1.1 perseant {
110 1.16 perseant struct uvnode *vp;
111 1.16 perseant struct ubuf *bp;
112 1.11 perseant IFILE *ifp;
113 1.1 perseant
114 1.16 perseant vp = vget(fs, ino);
115 1.16 perseant if (vp == NULL)
116 1.6 perseant return NULL;
117 1.5 perseant
118 1.16 perseant if (din_table[ino] == 0x0) {
119 1.16 perseant LFS_IENTRY(ifp, fs, ino, bp);
120 1.16 perseant din_table[ino] = ifp->if_daddr;
121 1.17 fvdl seg_table[dtosn(fs, ifp->if_daddr)].su_nbytes += DINODE1_SIZE;
122 1.16 perseant brelse(bp);
123 1.6 perseant }
124 1.17 fvdl return (VTOI(vp)->i_din.ffs1_din);
125 1.1 perseant }
126 1.1 perseant
127 1.1 perseant /*
128 1.16 perseant * Check validity of held blocks in an inode, recursing through all blocks.
129 1.1 perseant */
130 1.1 perseant int
131 1.17 fvdl ckinode(struct ufs1_dinode *dp, struct inodesc *idesc)
132 1.6 perseant {
133 1.16 perseant ufs_daddr_t *ap, lbn;
134 1.16 perseant long ret, n, ndb, offset;
135 1.17 fvdl struct ufs1_dinode dino;
136 1.16 perseant u_int64_t remsize, sizepb;
137 1.16 perseant mode_t mode;
138 1.16 perseant char pathbuf[MAXPATHLEN + 1];
139 1.16 perseant struct uvnode *vp, *thisvp;
140 1.6 perseant
141 1.6 perseant if (idesc->id_fix != IGNORE)
142 1.6 perseant idesc->id_fix = DONTKNOW;
143 1.6 perseant idesc->id_entryno = 0;
144 1.6 perseant idesc->id_filesize = dp->di_size;
145 1.6 perseant mode = dp->di_mode & IFMT;
146 1.6 perseant if (mode == IFBLK || mode == IFCHR ||
147 1.16 perseant (mode == IFLNK && (dp->di_size < fs->lfs_maxsymlinklen ||
148 1.16 perseant (fs->lfs_maxsymlinklen == 0 &&
149 1.16 perseant dp->di_blocks == 0))))
150 1.6 perseant return (KEEPON);
151 1.6 perseant dino = *dp;
152 1.16 perseant ndb = howmany(dino.di_size, fs->lfs_bsize);
153 1.6 perseant
154 1.18 yamt thisvp = vget(fs, idesc->id_number);
155 1.16 perseant for (lbn = 0; lbn < NDADDR; lbn++) {
156 1.16 perseant ap = dino.di_db + lbn;
157 1.16 perseant if (thisvp)
158 1.6 perseant idesc->id_numfrags =
159 1.16 perseant numfrags(fs, VTOI(thisvp)->i_lfs_fragsize[lbn]);
160 1.16 perseant else {
161 1.16 perseant if (--ndb == 0 && (offset = blkoff(fs, dino.di_size)) != 0) {
162 1.16 perseant idesc->id_numfrags =
163 1.16 perseant numfrags(fs, fragroundup(fs, offset));
164 1.16 perseant } else
165 1.16 perseant idesc->id_numfrags = fs->lfs_frag;
166 1.16 perseant }
167 1.6 perseant if (*ap == 0) {
168 1.6 perseant if (idesc->id_type == DATA && ndb >= 0) {
169 1.6 perseant /* An empty block in a directory XXX */
170 1.19 itojun getpathname(pathbuf, sizeof(pathbuf),
171 1.19 itojun idesc->id_number, idesc->id_number);
172 1.32 perseant pfatal("DIRECTORY %s INO %lld: CONTAINS EMPTY BLOCKS [1]",
173 1.32 perseant pathbuf, (long long)idesc->id_number);
174 1.6 perseant if (reply("ADJUST LENGTH") == 1) {
175 1.16 perseant vp = vget(fs, idesc->id_number);
176 1.16 perseant dp = VTOD(vp);
177 1.6 perseant dp->di_size = (ap - &dino.di_db[0]) *
178 1.16 perseant fs->lfs_bsize;
179 1.6 perseant printf(
180 1.16 perseant "YOU MUST RERUN FSCK AFTERWARDS\n");
181 1.6 perseant rerun = 1;
182 1.16 perseant inodirty(VTOI(vp));
183 1.32 perseant } else
184 1.32 perseant break;
185 1.6 perseant }
186 1.6 perseant continue;
187 1.6 perseant }
188 1.6 perseant idesc->id_blkno = *ap;
189 1.6 perseant idesc->id_lblkno = ap - &dino.di_db[0];
190 1.6 perseant if (idesc->id_type == ADDR) {
191 1.16 perseant ret = (*idesc->id_func) (idesc);
192 1.6 perseant } else
193 1.6 perseant ret = dirscan(idesc);
194 1.6 perseant if (ret & STOP)
195 1.6 perseant return (ret);
196 1.6 perseant }
197 1.16 perseant idesc->id_numfrags = fs->lfs_frag;
198 1.16 perseant remsize = dino.di_size - fs->lfs_bsize * NDADDR;
199 1.16 perseant sizepb = fs->lfs_bsize;
200 1.6 perseant for (ap = &dino.di_ib[0], n = 1; n <= NIADDR; ap++, n++) {
201 1.6 perseant if (*ap) {
202 1.6 perseant idesc->id_blkno = *ap;
203 1.6 perseant ret = iblock(idesc, n, remsize);
204 1.6 perseant if (ret & STOP)
205 1.6 perseant return (ret);
206 1.6 perseant } else {
207 1.6 perseant if (idesc->id_type == DATA && remsize > 0) {
208 1.6 perseant /* An empty block in a directory XXX */
209 1.19 itojun getpathname(pathbuf, sizeof(pathbuf),
210 1.19 itojun idesc->id_number, idesc->id_number);
211 1.32 perseant pfatal("DIRECTORY %s INO %lld: CONTAINS EMPTY BLOCKS [2]",
212 1.32 perseant pathbuf, (long long)idesc->id_number);
213 1.6 perseant if (reply("ADJUST LENGTH") == 1) {
214 1.16 perseant vp = vget(fs, idesc->id_number);
215 1.16 perseant dp = VTOD(vp);
216 1.6 perseant dp->di_size -= remsize;
217 1.6 perseant remsize = 0;
218 1.6 perseant printf(
219 1.16 perseant "YOU MUST RERUN FSCK AFTERWARDS\n");
220 1.6 perseant rerun = 1;
221 1.16 perseant inodirty(VTOI(vp));
222 1.6 perseant break;
223 1.32 perseant } else
224 1.32 perseant break;
225 1.6 perseant }
226 1.6 perseant }
227 1.16 perseant sizepb *= NINDIR(fs);
228 1.6 perseant remsize -= sizepb;
229 1.6 perseant }
230 1.6 perseant return (KEEPON);
231 1.1 perseant }
232 1.1 perseant
233 1.1 perseant static int
234 1.16 perseant iblock(struct inodesc *idesc, long ilevel, u_int64_t isize)
235 1.6 perseant {
236 1.16 perseant ufs_daddr_t *ap, *aplim;
237 1.16 perseant struct ubuf *bp;
238 1.16 perseant int i, n, (*func) (struct inodesc *), nif;
239 1.16 perseant u_int64_t sizepb;
240 1.16 perseant char pathbuf[MAXPATHLEN + 1], buf[BUFSIZ];
241 1.16 perseant struct uvnode *devvp, *vp;
242 1.16 perseant int diddirty = 0;
243 1.6 perseant
244 1.6 perseant if (idesc->id_type == ADDR) {
245 1.6 perseant func = idesc->id_func;
246 1.16 perseant n = (*func) (idesc);
247 1.6 perseant if ((n & KEEPON) == 0)
248 1.6 perseant return (n);
249 1.6 perseant } else
250 1.6 perseant func = dirscan;
251 1.16 perseant if (chkrange(idesc->id_blkno, fragstofsb(fs, idesc->id_numfrags)))
252 1.6 perseant return (SKIP);
253 1.16 perseant
254 1.26 perseant devvp = fs->lfs_devvp;
255 1.16 perseant bread(devvp, fsbtodb(fs, idesc->id_blkno), fs->lfs_bsize, NOCRED, &bp);
256 1.6 perseant ilevel--;
257 1.16 perseant for (sizepb = fs->lfs_bsize, i = 0; i < ilevel; i++)
258 1.16 perseant sizepb *= NINDIR(fs);
259 1.16 perseant if (isize > sizepb * NINDIR(fs))
260 1.16 perseant nif = NINDIR(fs);
261 1.6 perseant else
262 1.6 perseant nif = howmany(isize, sizepb);
263 1.16 perseant if (idesc->id_func == pass1check && nif < NINDIR(fs)) {
264 1.16 perseant aplim = ((ufs_daddr_t *) bp->b_data) + NINDIR(fs);
265 1.16 perseant for (ap = ((ufs_daddr_t *) bp->b_data) + nif; ap < aplim; ap++) {
266 1.6 perseant if (*ap == 0)
267 1.6 perseant continue;
268 1.30 christos (void) sprintf(buf, "PARTIALLY TRUNCATED INODE I=%llu",
269 1.30 christos (unsigned long long)idesc->id_number);
270 1.6 perseant if (dofix(idesc, buf)) {
271 1.6 perseant *ap = 0;
272 1.16 perseant ++diddirty;
273 1.6 perseant }
274 1.6 perseant }
275 1.6 perseant }
276 1.16 perseant aplim = ((ufs_daddr_t *) bp->b_data) + nif;
277 1.16 perseant for (ap = ((ufs_daddr_t *) bp->b_data); ap < aplim; ap++) {
278 1.6 perseant if (*ap) {
279 1.6 perseant idesc->id_blkno = *ap;
280 1.22 yamt if (ilevel == 0) {
281 1.22 yamt /*
282 1.22 yamt * dirscan needs lblkno.
283 1.22 yamt */
284 1.22 yamt idesc->id_lblkno++;
285 1.16 perseant n = (*func) (idesc);
286 1.22 yamt } else {
287 1.6 perseant n = iblock(idesc, ilevel, isize);
288 1.22 yamt }
289 1.6 perseant if (n & STOP) {
290 1.16 perseant if (diddirty)
291 1.16 perseant VOP_BWRITE(bp);
292 1.16 perseant else
293 1.16 perseant brelse(bp);
294 1.6 perseant return (n);
295 1.6 perseant }
296 1.6 perseant } else {
297 1.6 perseant if (idesc->id_type == DATA && isize > 0) {
298 1.6 perseant /* An empty block in a directory XXX */
299 1.19 itojun getpathname(pathbuf, sizeof(pathbuf),
300 1.19 itojun idesc->id_number, idesc->id_number);
301 1.32 perseant pfatal("DIRECTORY %s INO %lld: CONTAINS EMPTY BLOCKS [3]",
302 1.32 perseant pathbuf, (long long)idesc->id_number);
303 1.6 perseant if (reply("ADJUST LENGTH") == 1) {
304 1.16 perseant vp = vget(fs, idesc->id_number);
305 1.17 fvdl VTOI(vp)->i_ffs1_size -= isize;
306 1.6 perseant isize = 0;
307 1.6 perseant printf(
308 1.16 perseant "YOU MUST RERUN FSCK AFTERWARDS\n");
309 1.6 perseant rerun = 1;
310 1.16 perseant inodirty(VTOI(vp));
311 1.16 perseant if (diddirty)
312 1.16 perseant VOP_BWRITE(bp);
313 1.16 perseant else
314 1.16 perseant brelse(bp);
315 1.6 perseant return (STOP);
316 1.6 perseant }
317 1.6 perseant }
318 1.6 perseant }
319 1.6 perseant isize -= sizepb;
320 1.6 perseant }
321 1.16 perseant if (diddirty)
322 1.16 perseant VOP_BWRITE(bp);
323 1.16 perseant else
324 1.16 perseant brelse(bp);
325 1.6 perseant return (KEEPON);
326 1.1 perseant }
327 1.27 perseant
328 1.1 perseant /*
329 1.1 perseant * Check that a block in a legal block number.
330 1.1 perseant * Return 0 if in range, 1 if out of range.
331 1.1 perseant */
332 1.1 perseant int
333 1.6 perseant chkrange(daddr_t blk, int cnt)
334 1.6 perseant {
335 1.16 perseant if (blk < sntod(fs, 0)) {
336 1.11 perseant return (1);
337 1.11 perseant }
338 1.11 perseant if (blk > maxfsblock) {
339 1.11 perseant return (1);
340 1.11 perseant }
341 1.16 perseant if (blk + cnt < sntod(fs, 0)) {
342 1.7 perseant return (1);
343 1.7 perseant }
344 1.11 perseant if (blk + cnt > maxfsblock) {
345 1.6 perseant return (1);
346 1.6 perseant }
347 1.6 perseant return (0);
348 1.1 perseant }
349 1.27 perseant
350 1.1 perseant /*
351 1.1 perseant * Routines to maintain information about directory inodes.
352 1.1 perseant * This is built during the first pass and used during the
353 1.1 perseant * second and third passes.
354 1.1 perseant *
355 1.1 perseant * Enter inodes into the cache.
356 1.1 perseant */
357 1.1 perseant void
358 1.17 fvdl cacheino(struct ufs1_dinode * dp, ino_t inumber)
359 1.6 perseant {
360 1.16 perseant struct inoinfo *inp;
361 1.21 itojun struct inoinfo **inpp, **ninpsort;
362 1.16 perseant unsigned int blks;
363 1.6 perseant
364 1.16 perseant blks = howmany(dp->di_size, fs->lfs_bsize);
365 1.6 perseant if (blks > NDADDR)
366 1.6 perseant blks = NDADDR + NIADDR;
367 1.6 perseant inp = (struct inoinfo *)
368 1.16 perseant malloc(sizeof(*inp) + (blks - 1) * sizeof(ufs_daddr_t));
369 1.6 perseant if (inp == NULL)
370 1.6 perseant return;
371 1.6 perseant inpp = &inphead[inumber % numdirs];
372 1.6 perseant inp->i_nexthash = *inpp;
373 1.6 perseant *inpp = inp;
374 1.6 perseant inp->i_child = inp->i_sibling = inp->i_parentp = 0;
375 1.6 perseant if (inumber == ROOTINO)
376 1.6 perseant inp->i_parent = ROOTINO;
377 1.6 perseant else
378 1.16 perseant inp->i_parent = (ino_t) 0;
379 1.16 perseant inp->i_dotdot = (ino_t) 0;
380 1.6 perseant inp->i_number = inumber;
381 1.6 perseant inp->i_isize = dp->di_size;
382 1.16 perseant
383 1.16 perseant inp->i_numblks = blks * sizeof(ufs_daddr_t);
384 1.16 perseant memcpy(&inp->i_blks[0], &dp->di_db[0], (size_t) inp->i_numblks);
385 1.6 perseant if (inplast == listmax) {
386 1.21 itojun ninpsort = (struct inoinfo **) realloc((char *) inpsort,
387 1.21 itojun (unsigned) (listmax + 100) * sizeof(struct inoinfo *));
388 1.21 itojun if (ninpsort == NULL)
389 1.21 itojun err(8, "cannot increase directory list\n");
390 1.21 itojun inpsort = ninpsort;
391 1.6 perseant listmax += 100;
392 1.6 perseant }
393 1.6 perseant inpsort[inplast++] = inp;
394 1.1 perseant }
395 1.1 perseant
396 1.1 perseant /*
397 1.1 perseant * Look up an inode cache structure.
398 1.1 perseant */
399 1.1 perseant struct inoinfo *
400 1.6 perseant getinoinfo(ino_t inumber)
401 1.1 perseant {
402 1.25 perry struct inoinfo *inp;
403 1.1 perseant
404 1.6 perseant for (inp = inphead[inumber % numdirs]; inp; inp = inp->i_nexthash) {
405 1.6 perseant if (inp->i_number != inumber)
406 1.6 perseant continue;
407 1.6 perseant return (inp);
408 1.6 perseant }
409 1.30 christos err(8, "cannot find inode %llu\n", (unsigned long long)inumber);
410 1.16 perseant return ((struct inoinfo *) 0);
411 1.1 perseant }
412 1.1 perseant
413 1.1 perseant /*
414 1.1 perseant * Clean up all the inode cache structure.
415 1.1 perseant */
416 1.1 perseant void
417 1.25 perry inocleanup(void)
418 1.1 perseant {
419 1.25 perry struct inoinfo **inpp;
420 1.1 perseant
421 1.6 perseant if (inphead == NULL)
422 1.6 perseant return;
423 1.6 perseant for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--)
424 1.16 perseant free((char *) (*inpp));
425 1.16 perseant free((char *) inphead);
426 1.16 perseant free((char *) inpsort);
427 1.6 perseant inphead = inpsort = NULL;
428 1.1 perseant }
429 1.1 perseant
430 1.1 perseant void
431 1.16 perseant inodirty(struct inode *ip)
432 1.1 perseant {
433 1.16 perseant ip->i_flag |= IN_MODIFIED;
434 1.1 perseant }
435 1.1 perseant
436 1.1 perseant void
437 1.28 christos clri(struct inodesc * idesc, const char *type, int flag)
438 1.6 perseant {
439 1.16 perseant struct uvnode *vp;
440 1.6 perseant
441 1.16 perseant vp = vget(fs, idesc->id_number);
442 1.35 perseant if (flag & 0x1) {
443 1.6 perseant pwarn("%s %s", type,
444 1.17 fvdl (VTOI(vp)->i_ffs1_mode & IFMT) == IFDIR ? "DIR" : "FILE");
445 1.6 perseant pinode(idesc->id_number);
446 1.6 perseant }
447 1.35 perseant if ((flag & 0x2) || preen || reply("CLEAR") == 1) {
448 1.16 perseant if (preen && flag != 2)
449 1.6 perseant printf(" (CLEARED)\n");
450 1.6 perseant n_files--;
451 1.16 perseant (void) ckinode(VTOD(vp), idesc);
452 1.24 yamt clearinode(idesc->id_number);
453 1.6 perseant statemap[idesc->id_number] = USTATE;
454 1.24 yamt vnode_destroy(vp);
455 1.35 perseant return;
456 1.24 yamt }
457 1.35 perseant return;
458 1.24 yamt }
459 1.6 perseant
460 1.24 yamt void
461 1.24 yamt clearinode(ino_t inumber)
462 1.24 yamt {
463 1.24 yamt struct ubuf *bp;
464 1.24 yamt IFILE *ifp;
465 1.24 yamt daddr_t daddr;
466 1.24 yamt
467 1.24 yamt /* Send cleared inode to the free list */
468 1.24 yamt
469 1.24 yamt LFS_IENTRY(ifp, fs, inumber, bp);
470 1.24 yamt daddr = ifp->if_daddr;
471 1.33 perseant if (daddr == LFS_UNUSED_DADDR) {
472 1.33 perseant brelse(bp);
473 1.33 perseant return;
474 1.33 perseant }
475 1.24 yamt ifp->if_daddr = LFS_UNUSED_DADDR;
476 1.24 yamt ifp->if_nextfree = fs->lfs_freehd;
477 1.24 yamt fs->lfs_freehd = inumber;
478 1.24 yamt sbdirty();
479 1.24 yamt VOP_BWRITE(bp);
480 1.6 perseant
481 1.24 yamt /*
482 1.24 yamt * update segment usage.
483 1.24 yamt */
484 1.24 yamt if (daddr != LFS_UNUSED_DADDR) {
485 1.24 yamt SEGUSE *sup;
486 1.24 yamt u_int32_t oldsn = dtosn(fs, daddr);
487 1.24 yamt
488 1.34 perseant seg_table[oldsn].su_nbytes -= DINODE1_SIZE;
489 1.24 yamt LFS_SEGENTRY(sup, fs, oldsn, bp);
490 1.24 yamt sup->su_nbytes -= DINODE1_SIZE;
491 1.24 yamt LFS_WRITESEGENTRY(sup, fs, oldsn, bp); /* Ifile */
492 1.6 perseant }
493 1.1 perseant }
494 1.1 perseant
495 1.1 perseant int
496 1.16 perseant findname(struct inodesc * idesc)
497 1.1 perseant {
498 1.25 perry struct direct *dirp = idesc->id_dirp;
499 1.28 christos size_t len;
500 1.28 christos char *buf;
501 1.1 perseant
502 1.6 perseant if (dirp->d_ino != idesc->id_parent)
503 1.6 perseant return (KEEPON);
504 1.28 christos if ((len = dirp->d_namlen + 1) > MAXPATHLEN) {
505 1.28 christos /* Truncate it but don't overflow the buffer */
506 1.28 christos len = MAXPATHLEN;
507 1.28 christos }
508 1.28 christos /* this is namebuf with utils.h */
509 1.28 christos buf = __UNCONST(idesc->id_name);
510 1.28 christos (void)memcpy(buf, dirp->d_name, len);
511 1.6 perseant return (STOP | FOUND);
512 1.1 perseant }
513 1.1 perseant
514 1.1 perseant int
515 1.16 perseant findino(struct inodesc * idesc)
516 1.1 perseant {
517 1.25 perry struct direct *dirp = idesc->id_dirp;
518 1.1 perseant
519 1.6 perseant if (dirp->d_ino == 0)
520 1.6 perseant return (KEEPON);
521 1.6 perseant if (strcmp(dirp->d_name, idesc->id_name) == 0 &&
522 1.7 perseant dirp->d_ino >= ROOTINO && dirp->d_ino < maxino) {
523 1.6 perseant idesc->id_parent = dirp->d_ino;
524 1.6 perseant return (STOP | FOUND);
525 1.6 perseant }
526 1.6 perseant return (KEEPON);
527 1.1 perseant }
528 1.1 perseant
529 1.1 perseant void
530 1.6 perseant pinode(ino_t ino)
531 1.1 perseant {
532 1.25 perry struct ufs1_dinode *dp;
533 1.25 perry char *p;
534 1.16 perseant struct passwd *pw;
535 1.16 perseant time_t t;
536 1.6 perseant
537 1.30 christos printf(" I=%llu ", (unsigned long long)ino);
538 1.7 perseant if (ino < ROOTINO || ino >= maxino)
539 1.6 perseant return;
540 1.6 perseant dp = ginode(ino);
541 1.6 perseant if (dp) {
542 1.6 perseant printf(" OWNER=");
543 1.1 perseant #ifndef SMALL
544 1.16 perseant if ((pw = getpwuid((int) dp->di_uid)) != 0)
545 1.6 perseant printf("%s ", pw->pw_name);
546 1.6 perseant else
547 1.1 perseant #endif
548 1.16 perseant printf("%u ", (unsigned) dp->di_uid);
549 1.6 perseant printf("MODE=%o\n", dp->di_mode);
550 1.6 perseant if (preen)
551 1.6 perseant printf("%s: ", cdevname());
552 1.16 perseant printf("SIZE=%llu ", (unsigned long long) dp->di_size);
553 1.6 perseant t = dp->di_mtime;
554 1.6 perseant p = ctime(&t);
555 1.6 perseant printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]);
556 1.6 perseant }
557 1.1 perseant }
558 1.1 perseant
559 1.1 perseant void
560 1.29 christos blkerror(ino_t ino, const char *type, daddr_t blk)
561 1.6 perseant {
562 1.6 perseant
563 1.30 christos pfatal("%lld %s I=%llu", (long long) blk, type,
564 1.30 christos (unsigned long long)ino);
565 1.6 perseant printf("\n");
566 1.6 perseant if (exitonfail)
567 1.6 perseant exit(1);
568 1.6 perseant switch (statemap[ino]) {
569 1.6 perseant
570 1.6 perseant case FSTATE:
571 1.6 perseant statemap[ino] = FCLEAR;
572 1.6 perseant return;
573 1.6 perseant
574 1.6 perseant case DSTATE:
575 1.6 perseant statemap[ino] = DCLEAR;
576 1.6 perseant return;
577 1.6 perseant
578 1.6 perseant case FCLEAR:
579 1.6 perseant case DCLEAR:
580 1.6 perseant return;
581 1.6 perseant
582 1.6 perseant default:
583 1.16 perseant err(8, "BAD STATE %d TO BLKERR\n", statemap[ino]);
584 1.6 perseant /* NOTREACHED */
585 1.6 perseant }
586 1.1 perseant }
587 1.27 perseant
588 1.1 perseant /*
589 1.1 perseant * allocate an unused inode
590 1.1 perseant */
591 1.1 perseant ino_t
592 1.6 perseant allocino(ino_t request, int type)
593 1.6 perseant {
594 1.16 perseant ino_t ino;
595 1.17 fvdl struct ufs1_dinode *dp;
596 1.16 perseant time_t t;
597 1.16 perseant struct uvnode *vp;
598 1.16 perseant struct ubuf *bp;
599 1.6 perseant
600 1.6 perseant if (request == 0)
601 1.6 perseant request = ROOTINO;
602 1.6 perseant else if (statemap[request] != USTATE)
603 1.6 perseant return (0);
604 1.6 perseant for (ino = request; ino < maxino; ino++)
605 1.6 perseant if (statemap[ino] == USTATE)
606 1.6 perseant break;
607 1.6 perseant if (ino == maxino)
608 1.32 perseant extend_ifile(fs);
609 1.32 perseant
610 1.6 perseant switch (type & IFMT) {
611 1.6 perseant case IFDIR:
612 1.6 perseant statemap[ino] = DSTATE;
613 1.6 perseant break;
614 1.6 perseant case IFREG:
615 1.6 perseant case IFLNK:
616 1.6 perseant statemap[ino] = FSTATE;
617 1.6 perseant break;
618 1.6 perseant default:
619 1.6 perseant return (0);
620 1.6 perseant }
621 1.27 perseant vp = lfs_valloc(fs, ino);
622 1.27 perseant if (vp == NULL)
623 1.27 perseant return (0);
624 1.17 fvdl dp = (VTOI(vp)->i_din.ffs1_din);
625 1.16 perseant bp = getblk(vp, 0, fs->lfs_fsize);
626 1.16 perseant VOP_BWRITE(bp);
627 1.6 perseant dp->di_mode = type;
628 1.16 perseant (void) time(&t);
629 1.6 perseant dp->di_atime = t;
630 1.6 perseant dp->di_mtime = dp->di_ctime = dp->di_atime;
631 1.16 perseant dp->di_size = fs->lfs_fsize;
632 1.16 perseant dp->di_blocks = btofsb(fs, fs->lfs_fsize);
633 1.6 perseant n_files++;
634 1.16 perseant inodirty(VTOI(vp));
635 1.16 perseant typemap[ino] = IFTODT(type);
636 1.6 perseant return (ino);
637 1.1 perseant }
638 1.27 perseant
639 1.1 perseant /*
640 1.1 perseant * deallocate an inode
641 1.1 perseant */
642 1.1 perseant void
643 1.6 perseant freeino(ino_t ino)
644 1.1 perseant {
645 1.16 perseant struct inodesc idesc;
646 1.16 perseant struct uvnode *vp;
647 1.1 perseant
648 1.6 perseant memset(&idesc, 0, sizeof(struct inodesc));
649 1.6 perseant idesc.id_type = ADDR;
650 1.6 perseant idesc.id_func = pass4check;
651 1.6 perseant idesc.id_number = ino;
652 1.16 perseant vp = vget(fs, ino);
653 1.16 perseant (void) ckinode(VTOD(vp), &idesc);
654 1.24 yamt clearinode(ino);
655 1.6 perseant statemap[ino] = USTATE;
656 1.24 yamt vnode_destroy(vp);
657 1.5 perseant
658 1.6 perseant n_files--;
659 1.1 perseant }
660