Commit | Line | Data |
---|---|---|
da7c5cc6 | 1 | /* |
7188ac27 KM |
2 | * Copyright (c) 1982, 1986, 1989 Regents of the University of California. |
3 | * All rights reserved. | |
da7c5cc6 | 4 | * |
7188ac27 KM |
5 | * Redistribution and use in source and binary forms are permitted |
6 | * provided that the above copyright notice and this paragraph are | |
7 | * duplicated in all such forms and that any documentation, | |
8 | * advertising materials, and other materials related to such | |
9 | * distribution and use acknowledge that the software was developed | |
10 | * by the University of California, Berkeley. The name of the | |
11 | * University may not be used to endorse or promote products derived | |
12 | * from this software without specific prior written permission. | |
13 | * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR | |
14 | * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED | |
15 | * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. | |
16 | * | |
c9ad8afc | 17 | * @(#)lfs_inode.c 7.27 (Berkeley) %G% |
da7c5cc6 | 18 | */ |
5d5124a1 | 19 | |
94368568 JB |
20 | #include "param.h" |
21 | #include "systm.h" | |
22 | #include "mount.h" | |
94368568 | 23 | #include "user.h" |
71c4cb8d | 24 | #include "proc.h" |
7188ac27 | 25 | #include "file.h" |
94368568 | 26 | #include "buf.h" |
0b355a6e | 27 | #include "cmap.h" |
7188ac27 KM |
28 | #include "vnode.h" |
29 | #include "../ufs/inode.h" | |
30 | #include "../ufs/fs.h" | |
31 | #include "../ufs/ufsmount.h" | |
b4567e9c | 32 | #ifdef QUOTA |
7188ac27 | 33 | #include "../ufs/quota.h" |
4147b3f6 | 34 | #endif |
94368568 | 35 | #include "kernel.h" |
b30358ab | 36 | #include "malloc.h" |
5d5124a1 | 37 | |
c22c66ff | 38 | #define INOHSZ 512 |
3ebac878 RE |
39 | #if ((INOHSZ&(INOHSZ-1)) == 0) |
40 | #define INOHASH(dev,ino) (((dev)+(ino))&(INOHSZ-1)) | |
41 | #else | |
a3a9487d | 42 | #define INOHASH(dev,ino) (((unsigned)((dev)+(ino)))%INOHSZ) |
3ebac878 RE |
43 | #endif |
44 | ||
a1e9dd57 | 45 | union ihead { |
3ebac878 RE |
46 | union ihead *ih_head[2]; |
47 | struct inode *ih_chain[2]; | |
48 | } ihead[INOHSZ]; | |
49 | ||
2bf2d153 KM |
50 | int prtactive; /* 1 => print out reclaim of active vnodes */ |
51 | ||
5d5124a1 | 52 | /* |
a1e9dd57 | 53 | * Initialize hash links for inodes. |
5d5124a1 | 54 | */ |
1259a9f9 | 55 | ufs_init() |
5d5124a1 BJ |
56 | { |
57 | register int i; | |
a1e9dd57 | 58 | register union ihead *ih = ihead; |
5d5124a1 | 59 | |
ff4fb102 | 60 | #ifndef lint |
a1e9dd57 KM |
61 | if (VN_MAXPRIVATE < sizeof(struct inode)) |
62 | panic("ihinit: too small"); | |
ff4fb102 | 63 | #endif /* not lint */ |
3ebac878 RE |
64 | for (i = INOHSZ; --i >= 0; ih++) { |
65 | ih->ih_head[0] = ih; | |
66 | ih->ih_head[1] = ih; | |
67 | } | |
5d5124a1 BJ |
68 | } |
69 | ||
3ebac878 | 70 | /* |
7188ac27 | 71 | * Look up an vnode/inode by device,inumber. |
5d5124a1 BJ |
72 | * If it is in core (in the inode structure), |
73 | * honor the locking protocol. | |
74 | * If it is not in core, read it in from the | |
75 | * specified device. | |
7188ac27 | 76 | * Callers must check for mount points!! |
5d5124a1 BJ |
77 | * In all cases, a pointer to a locked |
78 | * inode structure is returned. | |
5d5124a1 | 79 | */ |
7188ac27 KM |
80 | iget(xp, ino, ipp) |
81 | struct inode *xp; | |
7494ef16 | 82 | ino_t ino; |
7188ac27 | 83 | struct inode **ipp; |
5d5124a1 | 84 | { |
7188ac27 KM |
85 | dev_t dev = xp->i_dev; |
86 | struct mount *mntp = ITOV(xp)->v_mount; | |
87 | register struct fs *fs = VFSTOUFS(mntp)->um_fs; | |
1259a9f9 | 88 | extern struct vnodeops ufs_vnodeops, spec_inodeops; |
7188ac27 KM |
89 | register struct inode *ip, *iq; |
90 | register struct vnode *vp; | |
1259a9f9 | 91 | struct vnode *nvp; |
7188ac27 | 92 | struct buf *bp; |
1259a9f9 | 93 | struct dinode *dp; |
7188ac27 KM |
94 | union ihead *ih; |
95 | int error; | |
2e64ab65 | 96 | |
3ebac878 | 97 | ih = &ihead[INOHASH(dev, ino)]; |
1259a9f9 | 98 | loop: |
a1e9dd57 KM |
99 | for (ip = ih->ih_chain[0]; ip != (struct inode *)ih; ip = ip->i_forw) { |
100 | if (ino != ip->i_number || dev != ip->i_dev) | |
101 | continue; | |
a1e9dd57 KM |
102 | if ((ip->i_flag&ILOCKED) != 0) { |
103 | ip->i_flag |= IWANT; | |
104 | sleep((caddr_t)ip, PINOD); | |
105 | goto loop; | |
7188ac27 | 106 | } |
1259a9f9 KM |
107 | if (vget(ITOV(ip))) |
108 | goto loop; | |
a1e9dd57 KM |
109 | *ipp = ip; |
110 | return(0); | |
111 | } | |
1259a9f9 KM |
112 | /* |
113 | * Allocate a new inode. | |
114 | */ | |
115 | if (error = getnewvnode(VT_UFS, mntp, &ufs_vnodeops, &nvp)) { | |
7188ac27 KM |
116 | *ipp = 0; |
117 | return (error); | |
118 | } | |
1259a9f9 KM |
119 | ip = VTOI(nvp); |
120 | ip->i_vnode = nvp; | |
121 | ip->i_flag = 0; | |
122 | ip->i_devvp = 0; | |
1259a9f9 | 123 | ip->i_mode = 0; |
c9ad8afc | 124 | ip->i_diroff = 0; |
1259a9f9 KM |
125 | #ifdef QUOTA |
126 | ip->i_dquot = NODQUOT; | |
127 | #endif | |
128 | /* | |
129 | * Put it onto its hash chain and lock it so that other requests for | |
130 | * this inode will block if they arrive while we are sleeping waiting | |
131 | * for old data structures to be purged or for the contents of the | |
132 | * disk portion of this inode to be read. | |
133 | */ | |
134 | ip->i_dev = dev; | |
135 | ip->i_number = ino; | |
136 | insque(ip, ih); | |
137 | ILOCK(ip); | |
7188ac27 KM |
138 | /* |
139 | * Read in the disk contents for the inode. | |
140 | */ | |
141 | if (error = bread(VFSTOUFS(mntp)->um_devvp, fsbtodb(fs, itod(fs, ino)), | |
a937f856 | 142 | (int)fs->fs_bsize, NOCRED, &bp)) { |
7188ac27 | 143 | /* |
a1e9dd57 | 144 | * Unlock and discard unneeded inode. |
7188ac27 | 145 | */ |
1259a9f9 | 146 | iput(ip); |
7188ac27 KM |
147 | brelse(bp); |
148 | *ipp = 0; | |
1259a9f9 | 149 | return (error); |
7188ac27 | 150 | } |
7188ac27 KM |
151 | dp = bp->b_un.b_dino; |
152 | dp += itoo(fs, ino); | |
1259a9f9 KM |
153 | ip->i_din = *dp; |
154 | brelse(bp); | |
155 | /* | |
156 | * Initialize the associated vnode | |
157 | */ | |
158 | vp = ITOV(ip); | |
159 | vp->v_type = IFTOVT(ip->i_mode); | |
160 | if (vp->v_type == VCHR || vp->v_type == VBLK) { | |
1259a9f9 | 161 | vp->v_op = &spec_inodeops; |
43fc727e | 162 | if (nvp = checkalias(vp, ip->i_rdev, mntp)) { |
7188ac27 | 163 | /* |
1259a9f9 | 164 | * Reinitialize aliased inode. |
7188ac27 | 165 | */ |
1259a9f9 KM |
166 | vp = nvp; |
167 | iq = VTOI(vp); | |
168 | iq->i_vnode = vp; | |
a97f9198 | 169 | iq->i_flag = 0; |
1259a9f9 KM |
170 | ILOCK(iq); |
171 | iq->i_din = ip->i_din; | |
172 | iq->i_dev = dev; | |
173 | iq->i_number = ino; | |
174 | insque(iq, ih); | |
7188ac27 | 175 | /* |
1259a9f9 | 176 | * Discard unneeded vnode |
7188ac27 | 177 | */ |
1259a9f9 KM |
178 | ip->i_mode = 0; |
179 | iput(ip); | |
7188ac27 | 180 | ip = iq; |
5d5124a1 | 181 | } |
7188ac27 | 182 | } |
1259a9f9 KM |
183 | if (ino == ROOTINO) |
184 | vp->v_flag |= VROOT; | |
7188ac27 KM |
185 | /* |
186 | * Finish inode initialization. | |
187 | */ | |
188 | ip->i_fs = fs; | |
189 | ip->i_devvp = VFSTOUFS(mntp)->um_devvp; | |
8fe1c702 | 190 | VREF(ip->i_devvp); |
7188ac27 KM |
191 | #ifdef QUOTA |
192 | if (ip->i_mode != 0) | |
193 | ip->i_dquot = inoquota(ip); | |
194 | #endif | |
afd7e202 KM |
195 | /* |
196 | * Set up a generation number for this inode if it does not | |
197 | * already have one. This should only happen on old filesystems. | |
198 | */ | |
199 | if (ip->i_gen == 0) { | |
200 | if (++nextgennumber < (u_long)time.tv_sec) | |
201 | nextgennumber = time.tv_sec; | |
202 | ip->i_gen = nextgennumber; | |
203 | if ((vp->v_mount->m_flag & M_RDONLY) == 0) | |
204 | ip->i_flag |= IMOD; | |
205 | } | |
7188ac27 KM |
206 | *ipp = ip; |
207 | return (0); | |
208 | } | |
3ebac878 | 209 | |
5d5124a1 | 210 | /* |
a1e9dd57 | 211 | * Unlock and decrement the reference count of an inode structure. |
5d5124a1 BJ |
212 | */ |
213 | iput(ip) | |
7494ef16 | 214 | register struct inode *ip; |
5d5124a1 | 215 | { |
ff56f48a | 216 | |
5c2ba954 | 217 | if ((ip->i_flag & ILOCKED) == 0) |
ff56f48a | 218 | panic("iput"); |
a388503d | 219 | IUNLOCK(ip); |
7188ac27 | 220 | vrele(ITOV(ip)); |
ff56f48a KM |
221 | } |
222 | ||
a1e9dd57 KM |
223 | /* |
224 | * Last reference to an inode, write the inode out and if necessary, | |
225 | * truncate and deallocate the file. | |
226 | */ | |
7188ac27 KM |
227 | ufs_inactive(vp) |
228 | struct vnode *vp; | |
ff56f48a | 229 | { |
7188ac27 | 230 | register struct inode *ip = VTOI(vp); |
a1e9dd57 | 231 | int mode, error = 0; |
7188ac27 | 232 | |
0811b508 | 233 | if (prtactive && vp->v_usecount != 0) |
e038406d | 234 | vprint("ufs_inactive: pushing active", vp); |
b5ea418e KM |
235 | /* |
236 | * Get rid of inodes related to stale file handles. | |
237 | */ | |
1259a9f9 | 238 | if (ip->i_mode == 0) { |
e038406d KM |
239 | if ((vp->v_flag & VXLOCK) == 0) |
240 | vgone(vp); | |
1259a9f9 KM |
241 | return (0); |
242 | } | |
aed86454 | 243 | ILOCK(ip); |
fd80ddd5 | 244 | if (ip->i_nlink <= 0 && (vp->v_mount->m_flag & M_RDONLY) == 0) { |
e038406d | 245 | error = itrunc(ip, (u_long)0, 0); |
7188ac27 KM |
246 | mode = ip->i_mode; |
247 | ip->i_mode = 0; | |
248 | ip->i_rdev = 0; | |
249 | ip->i_flag |= IUPD|ICHG; | |
250 | ifree(ip, ip->i_number, mode); | |
b4567e9c | 251 | #ifdef QUOTA |
7188ac27 KM |
252 | (void) chkiq(ip->i_dev, ip, ip->i_uid, 0); |
253 | dqrele(ip->i_dquot); | |
254 | ip->i_dquot = NODQUOT; | |
89045c38 | 255 | #endif |
7188ac27 KM |
256 | } |
257 | IUPDAT(ip, &time, &time, 0); | |
7188ac27 | 258 | /* |
a1e9dd57 KM |
259 | * If we are done with the inode, reclaim it |
260 | * so that it can be reused immediately. | |
7188ac27 | 261 | */ |
0811b508 | 262 | if (vp->v_usecount == 0 && ip->i_mode == 0) { |
e038406d KM |
263 | vinvalbuf(vp, 0); |
264 | IUNLOCK(ip); | |
265 | ip->i_flag = 0; | |
266 | if ((vp->v_flag & VXLOCK) == 0) | |
267 | vgone(vp); | |
268 | return (error); | |
269 | } | |
270 | IUNLOCK(ip); | |
271 | ip->i_flag = 0; | |
7188ac27 | 272 | return (error); |
5d5124a1 BJ |
273 | } |
274 | ||
275 | /* | |
a1e9dd57 KM |
276 | * Reclaim an inode so that it can be used for other purposes. |
277 | */ | |
278 | ufs_reclaim(vp) | |
279 | register struct vnode *vp; | |
280 | { | |
ff4fb102 | 281 | register struct inode *ip = VTOI(vp); |
a1e9dd57 | 282 | |
0811b508 | 283 | if (prtactive && vp->v_usecount != 0) |
e038406d | 284 | vprint("ufs_reclaim: pushing active", vp); |
a1e9dd57 KM |
285 | /* |
286 | * Remove the inode from its hash chain. | |
287 | */ | |
288 | remque(ip); | |
289 | ip->i_forw = ip; | |
290 | ip->i_back = ip; | |
291 | /* | |
292 | * Purge old data structures associated with the inode. | |
293 | */ | |
294 | cache_purge(vp); | |
295 | if (ip->i_devvp) { | |
296 | vrele(ip->i_devvp); | |
297 | ip->i_devvp = 0; | |
298 | } | |
299 | #ifdef QUOTA | |
300 | dqrele(ip->i_dquot); | |
301 | ip->i_dquot = NODQUOT; | |
302 | #endif | |
a1e9dd57 KM |
303 | ip->i_flag = 0; |
304 | return (0); | |
305 | } | |
306 | ||
307 | /* | |
308 | * Check accessed and update flags on an inode structure. | |
309 | * If any is on, update the inode with the current time. | |
310 | * If waitfor is given, then must ensure I/O order, | |
311 | * so wait for write to complete. | |
5d5124a1 | 312 | */ |
c0bb1685 | 313 | iupdat(ip, ta, tm, waitfor) |
7494ef16 | 314 | register struct inode *ip; |
b32450f4 | 315 | struct timeval *ta, *tm; |
7494ef16 | 316 | int waitfor; |
5d5124a1 | 317 | { |
7188ac27 KM |
318 | struct buf *bp; |
319 | struct vnode *vp = ITOV(ip); | |
5d5124a1 | 320 | struct dinode *dp; |
ec67a3ce | 321 | register struct fs *fs; |
5d5124a1 | 322 | |
ec67a3ce | 323 | fs = ip->i_fs; |
7188ac27 KM |
324 | if ((ip->i_flag & (IUPD|IACC|ICHG|IMOD)) == 0) |
325 | return (0); | |
326 | if (vp->v_mount->m_flag & M_RDONLY) | |
327 | return (0); | |
328 | error = bread(ip->i_devvp, fsbtodb(fs, itod(fs, ip->i_number)), | |
a937f856 | 329 | (int)fs->fs_bsize, NOCRED, &bp); |
7188ac27 KM |
330 | if (error) { |
331 | brelse(bp); | |
332 | return (error); | |
333 | } | |
334 | if (ip->i_flag&IACC) | |
335 | ip->i_atime = ta->tv_sec; | |
336 | if (ip->i_flag&IUPD) | |
337 | ip->i_mtime = tm->tv_sec; | |
338 | if (ip->i_flag&ICHG) | |
339 | ip->i_ctime = time.tv_sec; | |
340 | ip->i_flag &= ~(IUPD|IACC|ICHG|IMOD); | |
341 | dp = bp->b_un.b_dino + itoo(fs, ip->i_number); | |
a1e9dd57 | 342 | *dp = ip->i_din; |
7188ac27 KM |
343 | if (waitfor) { |
344 | return (bwrite(bp)); | |
345 | } else { | |
346 | bdwrite(bp); | |
347 | return (0); | |
5d5124a1 BJ |
348 | } |
349 | } | |
350 | ||
9c03b2c0 SL |
351 | #define SINGLE 0 /* index of single indirect block */ |
352 | #define DOUBLE 1 /* index of double indirect block */ | |
353 | #define TRIPLE 2 /* index of triple indirect block */ | |
5d5124a1 | 354 | /* |
a1e9dd57 KM |
355 | * Truncate the inode ip to at most length size. Free affected disk |
356 | * blocks -- the blocks of the file are removed in reverse order. | |
9c03b2c0 SL |
357 | * |
358 | * NB: triple indirect blocks are untested. | |
5d5124a1 | 359 | */ |
e038406d | 360 | itrunc(oip, length, flags) |
28821bc5 | 361 | register struct inode *oip; |
4f083fd7 | 362 | u_long length; |
e038406d | 363 | int flags; |
5d5124a1 | 364 | { |
4f083fd7 | 365 | register daddr_t lastblock; |
a5e62f37 | 366 | daddr_t bn, lbn, lastiblock[NIADDR]; |
6459ebe0 | 367 | register struct fs *fs; |
9c03b2c0 | 368 | register struct inode *ip; |
28821bc5 | 369 | struct buf *bp; |
7188ac27 KM |
370 | int offset, osize, size, level; |
371 | long count, nblocks, blocksreleased = 0; | |
28821bc5 | 372 | register int i; |
e038406d | 373 | int aflags, error, allerror; |
9c03b2c0 | 374 | struct inode tip; |
4f083fd7 | 375 | |
7b2e4f05 SL |
376 | if (oip->i_size <= length) { |
377 | oip->i_flag |= ICHG|IUPD; | |
7188ac27 KM |
378 | error = iupdat(oip, &time, &time, 1); |
379 | return (error); | |
7b2e4f05 | 380 | } |
c0bb1685 | 381 | /* |
9c03b2c0 SL |
382 | * Calculate index into inode's block list of |
383 | * last direct and indirect blocks (if any) | |
384 | * which we want to keep. Lastblock is -1 when | |
385 | * the file is truncated to 0. | |
c0bb1685 | 386 | */ |
9c03b2c0 | 387 | fs = oip->i_fs; |
4f083fd7 | 388 | lastblock = lblkno(fs, length + fs->fs_bsize - 1) - 1; |
9c03b2c0 SL |
389 | lastiblock[SINGLE] = lastblock - NDADDR; |
390 | lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs); | |
391 | lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs); | |
08d9a8ec | 392 | nblocks = btodb(fs->fs_bsize); |
6459ebe0 | 393 | /* |
28821bc5 KM |
394 | * Update the size of the file. If the file is not being |
395 | * truncated to a block boundry, the contents of the | |
396 | * partial block following the end of the file must be | |
397 | * zero'ed in case it ever become accessable again because | |
398 | * of subsequent file growth. | |
399 | */ | |
400 | osize = oip->i_size; | |
401 | offset = blkoff(fs, length); | |
402 | if (offset == 0) { | |
403 | oip->i_size = length; | |
404 | } else { | |
405 | lbn = lblkno(fs, length); | |
e038406d KM |
406 | aflags = B_CLRBUF; |
407 | if (flags & IO_SYNC) | |
408 | aflags |= B_SYNC; | |
409 | if (error = balloc(oip, lbn, offset, &bp, aflags)) | |
7188ac27 | 410 | return (error); |
28821bc5 KM |
411 | oip->i_size = length; |
412 | size = blksize(fs, oip, lbn); | |
e038406d | 413 | bn = bp->b_blkno; |
ec67a3ce | 414 | count = howmany(size, CLBYTES); |
7188ac27 | 415 | munhash(oip->i_devvp, bn + i * CLBYTES / DEV_BSIZE); |
a5e62f37 | 416 | bzero(bp->b_un.b_addr + offset, (unsigned)(size - offset)); |
e038406d KM |
417 | brealloc(bp, size); |
418 | if (flags & IO_SYNC) | |
419 | bwrite(bp); | |
420 | else | |
421 | bdwrite(bp); | |
28821bc5 KM |
422 | } |
423 | /* | |
424 | * Update file and block pointers | |
9c03b2c0 SL |
425 | * on disk before we start freeing blocks. |
426 | * If we crash before free'ing blocks below, | |
427 | * the blocks will be returned to the free list. | |
428 | * lastiblock values are also normalized to -1 | |
429 | * for calls to indirtrunc below. | |
6459ebe0 | 430 | */ |
9c03b2c0 | 431 | tip = *oip; |
28821bc5 | 432 | tip.i_size = osize; |
9c03b2c0 SL |
433 | for (level = TRIPLE; level >= SINGLE; level--) |
434 | if (lastiblock[level] < 0) { | |
435 | oip->i_ib[level] = 0; | |
436 | lastiblock[level] = -1; | |
4f083fd7 | 437 | } |
9c03b2c0 SL |
438 | for (i = NDADDR - 1; i > lastblock; i--) |
439 | oip->i_db[i] = 0; | |
9c03b2c0 | 440 | oip->i_flag |= ICHG|IUPD; |
e038406d | 441 | vinvalbuf(ITOV(oip), (length > 0)); |
2fc1f182 | 442 | allerror = iupdat(oip, &time, &time, MNT_WAIT); |
9c03b2c0 | 443 | |
6459ebe0 | 444 | /* |
9c03b2c0 | 445 | * Indirect blocks first. |
6459ebe0 | 446 | */ |
28821bc5 | 447 | ip = &tip; |
9c03b2c0 SL |
448 | for (level = TRIPLE; level >= SINGLE; level--) { |
449 | bn = ip->i_ib[level]; | |
4f083fd7 | 450 | if (bn != 0) { |
7188ac27 KM |
451 | error = indirtrunc(ip, bn, lastiblock[level], level, |
452 | &count); | |
453 | if (error) | |
454 | allerror = error; | |
455 | blocksreleased += count; | |
9c03b2c0 SL |
456 | if (lastiblock[level] < 0) { |
457 | ip->i_ib[level] = 0; | |
ced3a252 | 458 | blkfree(ip, bn, (off_t)fs->fs_bsize); |
9c03b2c0 | 459 | blocksreleased += nblocks; |
9c03b2c0 SL |
460 | } |
461 | } | |
462 | if (lastiblock[level] >= 0) | |
463 | goto done; | |
4f083fd7 | 464 | } |
9c03b2c0 | 465 | |
6459ebe0 | 466 | /* |
9c03b2c0 | 467 | * All whole direct blocks or frags. |
6459ebe0 | 468 | */ |
4f083fd7 | 469 | for (i = NDADDR - 1; i > lastblock; i--) { |
8011f5df | 470 | register off_t bsize; |
4f083fd7 | 471 | |
6459ebe0 | 472 | bn = ip->i_db[i]; |
4f083fd7 | 473 | if (bn == 0) |
5d5124a1 | 474 | continue; |
4f083fd7 | 475 | ip->i_db[i] = 0; |
0b355a6e | 476 | bsize = (off_t)blksize(fs, ip, i); |
ced3a252 | 477 | blkfree(ip, bn, bsize); |
0b355a6e | 478 | blocksreleased += btodb(bsize); |
4f083fd7 | 479 | } |
9c03b2c0 SL |
480 | if (lastblock < 0) |
481 | goto done; | |
482 | ||
4f083fd7 SL |
483 | /* |
484 | * Finally, look for a change in size of the | |
485 | * last direct block; release any frags. | |
486 | */ | |
9c03b2c0 SL |
487 | bn = ip->i_db[lastblock]; |
488 | if (bn != 0) { | |
8011f5df | 489 | off_t oldspace, newspace; |
9c03b2c0 | 490 | |
4f083fd7 SL |
491 | /* |
492 | * Calculate amount of space we're giving | |
493 | * back as old block size minus new block size. | |
494 | */ | |
9c03b2c0 | 495 | oldspace = blksize(fs, ip, lastblock); |
4f083fd7 | 496 | ip->i_size = length; |
9c03b2c0 SL |
497 | newspace = blksize(fs, ip, lastblock); |
498 | if (newspace == 0) | |
499 | panic("itrunc: newspace"); | |
500 | if (oldspace - newspace > 0) { | |
4f083fd7 SL |
501 | /* |
502 | * Block number of space to be free'd is | |
503 | * the old block # plus the number of frags | |
504 | * required for the storage we're keeping. | |
505 | */ | |
9c03b2c0 | 506 | bn += numfrags(fs, newspace); |
ced3a252 | 507 | blkfree(ip, bn, oldspace - newspace); |
08d9a8ec | 508 | blocksreleased += btodb(oldspace - newspace); |
4f083fd7 | 509 | } |
5d5124a1 | 510 | } |
4f083fd7 | 511 | done: |
9c03b2c0 SL |
512 | /* BEGIN PARANOIA */ |
513 | for (level = SINGLE; level <= TRIPLE; level++) | |
514 | if (ip->i_ib[level] != oip->i_ib[level]) | |
515 | panic("itrunc1"); | |
516 | for (i = 0; i < NDADDR; i++) | |
517 | if (ip->i_db[i] != oip->i_db[i]) | |
518 | panic("itrunc2"); | |
519 | /* END PARANOIA */ | |
08d9a8ec SL |
520 | oip->i_blocks -= blocksreleased; |
521 | if (oip->i_blocks < 0) /* sanity */ | |
522 | oip->i_blocks = 0; | |
523 | oip->i_flag |= ICHG; | |
b4567e9c | 524 | #ifdef QUOTA |
08d9a8ec | 525 | (void) chkdq(oip, -blocksreleased, 0); |
89045c38 | 526 | #endif |
7188ac27 | 527 | return (allerror); |
5d5124a1 BJ |
528 | } |
529 | ||
4f083fd7 SL |
530 | /* |
531 | * Release blocks associated with the inode ip and | |
532 | * stored in the indirect block bn. Blocks are free'd | |
533 | * in LIFO order up to (but not including) lastbn. If | |
9c03b2c0 SL |
534 | * level is greater than SINGLE, the block is an indirect |
535 | * block and recursive calls to indirtrunc must be used to | |
536 | * cleanse other indirect blocks. | |
537 | * | |
538 | * NB: triple indirect blocks are untested. | |
4f083fd7 | 539 | */ |
7188ac27 | 540 | indirtrunc(ip, bn, lastbn, level, countp) |
6459ebe0 | 541 | register struct inode *ip; |
4f083fd7 | 542 | daddr_t bn, lastbn; |
9c03b2c0 | 543 | int level; |
7188ac27 | 544 | long *countp; |
5d5124a1 | 545 | { |
4f083fd7 | 546 | register int i; |
b30358ab | 547 | struct buf *bp; |
9c03b2c0 | 548 | register struct fs *fs = ip->i_fs; |
b30358ab KM |
549 | register daddr_t *bap; |
550 | daddr_t *copy, nb, last; | |
7188ac27 KM |
551 | long blkcount, factor; |
552 | int nblocks, blocksreleased = 0; | |
553 | int error, allerror = 0; | |
5d5124a1 | 554 | |
9c03b2c0 SL |
555 | /* |
556 | * Calculate index in current block of last | |
557 | * block to be kept. -1 indicates the entire | |
558 | * block so we need not calculate the index. | |
559 | */ | |
560 | factor = 1; | |
561 | for (i = SINGLE; i < level; i++) | |
562 | factor *= NINDIR(fs); | |
4f083fd7 | 563 | last = lastbn; |
9c03b2c0 SL |
564 | if (lastbn > 0) |
565 | last /= factor; | |
08d9a8ec | 566 | nblocks = btodb(fs->fs_bsize); |
9c03b2c0 SL |
567 | /* |
568 | * Get buffer of block pointers, zero those | |
569 | * entries corresponding to blocks to be free'd, | |
570 | * and update on disk copy first. | |
571 | */ | |
ec67a3ce MK |
572 | #ifdef SECSIZE |
573 | bp = bread(ip->i_dev, fsbtodb(fs, bn), (int)fs->fs_bsize, | |
574 | fs->fs_dbsize); | |
575 | #else SECSIZE | |
a937f856 KM |
576 | error = bread(ip->i_devvp, fsbtodb(fs, bn), (int)fs->fs_bsize, |
577 | NOCRED, &bp); | |
7188ac27 | 578 | if (error) { |
9c03b2c0 | 579 | brelse(bp); |
7188ac27 KM |
580 | *countp = 0; |
581 | return (error); | |
9c03b2c0 SL |
582 | } |
583 | bap = bp->b_un.b_daddr; | |
b30358ab KM |
584 | MALLOC(copy, daddr_t *, fs->fs_bsize, M_TEMP, M_WAITOK); |
585 | bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->fs_bsize); | |
9c03b2c0 SL |
586 | bzero((caddr_t)&bap[last + 1], |
587 | (u_int)(NINDIR(fs) - (last + 1)) * sizeof (daddr_t)); | |
e038406d KM |
588 | if (last == -1) |
589 | bp->b_flags |= B_INVAL; | |
7188ac27 KM |
590 | error = bwrite(bp); |
591 | if (error) | |
592 | allerror = error; | |
b30358ab | 593 | bap = copy; |
4f083fd7 | 594 | |
9c03b2c0 SL |
595 | /* |
596 | * Recursively free totally unused blocks. | |
597 | */ | |
598 | for (i = NINDIR(fs) - 1; i > last; i--) { | |
5d5124a1 | 599 | nb = bap[i]; |
4f083fd7 | 600 | if (nb == 0) |
5d5124a1 | 601 | continue; |
7188ac27 KM |
602 | if (level > SINGLE) { |
603 | error = indirtrunc(ip, nb, (daddr_t)-1, level - 1, | |
604 | &blkcount); | |
605 | if (error) | |
606 | allerror = error; | |
607 | blocksreleased += blkcount; | |
608 | } | |
ced3a252 | 609 | blkfree(ip, nb, (off_t)fs->fs_bsize); |
4f083fd7 | 610 | blocksreleased += nblocks; |
4f083fd7 | 611 | } |
9c03b2c0 SL |
612 | |
613 | /* | |
614 | * Recursively free last partial block. | |
615 | */ | |
616 | if (level > SINGLE && lastbn >= 0) { | |
617 | last = lastbn % factor; | |
4f083fd7 | 618 | nb = bap[i]; |
7188ac27 KM |
619 | if (nb != 0) { |
620 | error = indirtrunc(ip, nb, last, level - 1, &blkcount); | |
621 | if (error) | |
622 | allerror = error; | |
623 | blocksreleased += blkcount; | |
624 | } | |
5d5124a1 | 625 | } |
b30358ab | 626 | FREE(copy, M_TEMP); |
7188ac27 KM |
627 | *countp = blocksreleased; |
628 | return (allerror); | |
5d5124a1 BJ |
629 | } |
630 | ||
d6a210b8 | 631 | /* |
7494ef16 | 632 | * Lock an inode. If its already locked, set the WANT bit and sleep. |
d6a210b8 | 633 | */ |
7494ef16 BJ |
634 | ilock(ip) |
635 | register struct inode *ip; | |
d6a210b8 BJ |
636 | { |
637 | ||
7188ac27 KM |
638 | while (ip->i_flag & ILOCKED) { |
639 | ip->i_flag |= IWANT; | |
71c4cb8d KM |
640 | if (ip->i_spare0 == u.u_procp->p_pid) |
641 | panic("locking against myself"); | |
642 | ip->i_spare1 = u.u_procp->p_pid; | |
7188ac27 KM |
643 | (void) sleep((caddr_t)ip, PINOD); |
644 | } | |
71c4cb8d KM |
645 | ip->i_spare1 = 0; |
646 | ip->i_spare0 = u.u_procp->p_pid; | |
647 | u.u_spare[0]++; | |
7188ac27 | 648 | ip->i_flag |= ILOCKED; |
d6a210b8 BJ |
649 | } |
650 | ||
651 | /* | |
7494ef16 | 652 | * Unlock an inode. If WANT bit is on, wakeup. |
d6a210b8 | 653 | */ |
ff56f48a | 654 | iunlock(ip) |
7494ef16 | 655 | register struct inode *ip; |
d6a210b8 BJ |
656 | { |
657 | ||
7188ac27 | 658 | if ((ip->i_flag & ILOCKED) == 0) |
e038406d | 659 | vprint("iunlock: unlocked inode", ITOV(ip)); |
71c4cb8d KM |
660 | ip->i_spare0 = 0; |
661 | u.u_spare[0]--; | |
7188ac27 KM |
662 | ip->i_flag &= ~ILOCKED; |
663 | if (ip->i_flag&IWANT) { | |
664 | ip->i_flag &= ~IWANT; | |
665 | wakeup((caddr_t)ip); | |
666 | } | |
667 | } | |
668 | ||
669 | /* | |
670 | * Check mode permission on inode pointer. Mode is READ, WRITE or EXEC. | |
671 | * The mode is shifted to select the owner/group/other fields. The | |
672 | * super user is granted all permissions. | |
673 | * | |
674 | * NB: Called from vnode op table. It seems this could all be done | |
675 | * using vattr's but... | |
676 | */ | |
677 | iaccess(ip, mode, cred) | |
678 | register struct inode *ip; | |
679 | register int mode; | |
680 | struct ucred *cred; | |
681 | { | |
682 | register gid_t *gp; | |
7188ac27 KM |
683 | int i; |
684 | ||
685 | /* | |
a1e9dd57 | 686 | * If you're the super-user, you always get access. |
7188ac27 KM |
687 | */ |
688 | if (cred->cr_uid == 0) | |
689 | return (0); | |
690 | /* | |
691 | * Access check is based on only one of owner, group, public. | |
692 | * If not owner, then check group. If not a member of the | |
693 | * group, then check public access. | |
694 | */ | |
695 | if (cred->cr_uid != ip->i_uid) { | |
696 | mode >>= 3; | |
697 | gp = cred->cr_groups; | |
698 | for (i = 0; i < cred->cr_ngroups; i++, gp++) | |
699 | if (ip->i_gid == *gp) | |
700 | goto found; | |
701 | mode >>= 3; | |
702 | found: | |
703 | ; | |
704 | } | |
705 | if ((ip->i_mode & mode) != 0) | |
706 | return (0); | |
707 | return (EACCES); | |
d6a210b8 | 708 | } |