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 | * | |
4c7b0b09 | 17 | * @(#)ufs_inode.c 7.29 (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); | |
4c7b0b09 KM |
160 | if (vp->v_type == VFIFO) { |
161 | #ifdef FIFO | |
162 | extern struct vnodeops fifo_inodeops; | |
163 | vp->v_op = &fifo_inodeops; | |
164 | #else | |
165 | iput(ip); | |
166 | *ipp = 0; | |
167 | return (EOPNOTSUPP); | |
168 | #endif /* FIFO */ | |
169 | } | |
1259a9f9 | 170 | if (vp->v_type == VCHR || vp->v_type == VBLK) { |
1259a9f9 | 171 | vp->v_op = &spec_inodeops; |
43fc727e | 172 | if (nvp = checkalias(vp, ip->i_rdev, mntp)) { |
7188ac27 | 173 | /* |
1259a9f9 | 174 | * Reinitialize aliased inode. |
7188ac27 | 175 | */ |
1259a9f9 KM |
176 | vp = nvp; |
177 | iq = VTOI(vp); | |
178 | iq->i_vnode = vp; | |
a97f9198 | 179 | iq->i_flag = 0; |
1259a9f9 KM |
180 | ILOCK(iq); |
181 | iq->i_din = ip->i_din; | |
182 | iq->i_dev = dev; | |
183 | iq->i_number = ino; | |
184 | insque(iq, ih); | |
7188ac27 | 185 | /* |
1259a9f9 | 186 | * Discard unneeded vnode |
7188ac27 | 187 | */ |
1259a9f9 KM |
188 | ip->i_mode = 0; |
189 | iput(ip); | |
7188ac27 | 190 | ip = iq; |
5d5124a1 | 191 | } |
7188ac27 | 192 | } |
1259a9f9 KM |
193 | if (ino == ROOTINO) |
194 | vp->v_flag |= VROOT; | |
7188ac27 KM |
195 | /* |
196 | * Finish inode initialization. | |
197 | */ | |
198 | ip->i_fs = fs; | |
199 | ip->i_devvp = VFSTOUFS(mntp)->um_devvp; | |
8fe1c702 | 200 | VREF(ip->i_devvp); |
7188ac27 KM |
201 | #ifdef QUOTA |
202 | if (ip->i_mode != 0) | |
203 | ip->i_dquot = inoquota(ip); | |
204 | #endif | |
afd7e202 KM |
205 | /* |
206 | * Set up a generation number for this inode if it does not | |
207 | * already have one. This should only happen on old filesystems. | |
208 | */ | |
209 | if (ip->i_gen == 0) { | |
210 | if (++nextgennumber < (u_long)time.tv_sec) | |
211 | nextgennumber = time.tv_sec; | |
212 | ip->i_gen = nextgennumber; | |
213 | if ((vp->v_mount->m_flag & M_RDONLY) == 0) | |
214 | ip->i_flag |= IMOD; | |
215 | } | |
7188ac27 KM |
216 | *ipp = ip; |
217 | return (0); | |
218 | } | |
3ebac878 | 219 | |
5d5124a1 | 220 | /* |
a1e9dd57 | 221 | * Unlock and decrement the reference count of an inode structure. |
5d5124a1 BJ |
222 | */ |
223 | iput(ip) | |
7494ef16 | 224 | register struct inode *ip; |
5d5124a1 | 225 | { |
ff56f48a | 226 | |
5c2ba954 | 227 | if ((ip->i_flag & ILOCKED) == 0) |
ff56f48a | 228 | panic("iput"); |
a388503d | 229 | IUNLOCK(ip); |
7188ac27 | 230 | vrele(ITOV(ip)); |
ff56f48a KM |
231 | } |
232 | ||
a1e9dd57 KM |
233 | /* |
234 | * Last reference to an inode, write the inode out and if necessary, | |
235 | * truncate and deallocate the file. | |
236 | */ | |
7188ac27 KM |
237 | ufs_inactive(vp) |
238 | struct vnode *vp; | |
ff56f48a | 239 | { |
7188ac27 | 240 | register struct inode *ip = VTOI(vp); |
a1e9dd57 | 241 | int mode, error = 0; |
7188ac27 | 242 | |
0811b508 | 243 | if (prtactive && vp->v_usecount != 0) |
e038406d | 244 | vprint("ufs_inactive: pushing active", vp); |
b5ea418e KM |
245 | /* |
246 | * Get rid of inodes related to stale file handles. | |
247 | */ | |
1259a9f9 | 248 | if (ip->i_mode == 0) { |
e038406d KM |
249 | if ((vp->v_flag & VXLOCK) == 0) |
250 | vgone(vp); | |
1259a9f9 KM |
251 | return (0); |
252 | } | |
aed86454 | 253 | ILOCK(ip); |
fd80ddd5 | 254 | if (ip->i_nlink <= 0 && (vp->v_mount->m_flag & M_RDONLY) == 0) { |
e038406d | 255 | error = itrunc(ip, (u_long)0, 0); |
7188ac27 KM |
256 | mode = ip->i_mode; |
257 | ip->i_mode = 0; | |
258 | ip->i_rdev = 0; | |
259 | ip->i_flag |= IUPD|ICHG; | |
260 | ifree(ip, ip->i_number, mode); | |
b4567e9c | 261 | #ifdef QUOTA |
7188ac27 KM |
262 | (void) chkiq(ip->i_dev, ip, ip->i_uid, 0); |
263 | dqrele(ip->i_dquot); | |
264 | ip->i_dquot = NODQUOT; | |
89045c38 | 265 | #endif |
7188ac27 KM |
266 | } |
267 | IUPDAT(ip, &time, &time, 0); | |
d11dbec7 KM |
268 | IUNLOCK(ip); |
269 | ip->i_flag = 0; | |
7188ac27 | 270 | /* |
a1e9dd57 KM |
271 | * If we are done with the inode, reclaim it |
272 | * so that it can be reused immediately. | |
7188ac27 | 273 | */ |
d11dbec7 KM |
274 | if (vp->v_usecount == 0 && ip->i_mode == 0 && |
275 | (vp->v_flag & VXLOCK) == 0) | |
276 | vgone(vp); | |
7188ac27 | 277 | return (error); |
5d5124a1 BJ |
278 | } |
279 | ||
280 | /* | |
a1e9dd57 KM |
281 | * Reclaim an inode so that it can be used for other purposes. |
282 | */ | |
283 | ufs_reclaim(vp) | |
284 | register struct vnode *vp; | |
285 | { | |
ff4fb102 | 286 | register struct inode *ip = VTOI(vp); |
a1e9dd57 | 287 | |
0811b508 | 288 | if (prtactive && vp->v_usecount != 0) |
e038406d | 289 | vprint("ufs_reclaim: pushing active", vp); |
a1e9dd57 KM |
290 | /* |
291 | * Remove the inode from its hash chain. | |
292 | */ | |
293 | remque(ip); | |
294 | ip->i_forw = ip; | |
295 | ip->i_back = ip; | |
296 | /* | |
297 | * Purge old data structures associated with the inode. | |
298 | */ | |
299 | cache_purge(vp); | |
300 | if (ip->i_devvp) { | |
301 | vrele(ip->i_devvp); | |
302 | ip->i_devvp = 0; | |
303 | } | |
304 | #ifdef QUOTA | |
305 | dqrele(ip->i_dquot); | |
306 | ip->i_dquot = NODQUOT; | |
307 | #endif | |
a1e9dd57 KM |
308 | ip->i_flag = 0; |
309 | return (0); | |
310 | } | |
311 | ||
312 | /* | |
313 | * Check accessed and update flags on an inode structure. | |
314 | * If any is on, update the inode with the current time. | |
315 | * If waitfor is given, then must ensure I/O order, | |
316 | * so wait for write to complete. | |
5d5124a1 | 317 | */ |
c0bb1685 | 318 | iupdat(ip, ta, tm, waitfor) |
7494ef16 | 319 | register struct inode *ip; |
b32450f4 | 320 | struct timeval *ta, *tm; |
7494ef16 | 321 | int waitfor; |
5d5124a1 | 322 | { |
7188ac27 KM |
323 | struct buf *bp; |
324 | struct vnode *vp = ITOV(ip); | |
5d5124a1 | 325 | struct dinode *dp; |
ec67a3ce | 326 | register struct fs *fs; |
5d5124a1 | 327 | |
ec67a3ce | 328 | fs = ip->i_fs; |
7188ac27 KM |
329 | if ((ip->i_flag & (IUPD|IACC|ICHG|IMOD)) == 0) |
330 | return (0); | |
331 | if (vp->v_mount->m_flag & M_RDONLY) | |
332 | return (0); | |
333 | error = bread(ip->i_devvp, fsbtodb(fs, itod(fs, ip->i_number)), | |
a937f856 | 334 | (int)fs->fs_bsize, NOCRED, &bp); |
7188ac27 KM |
335 | if (error) { |
336 | brelse(bp); | |
337 | return (error); | |
338 | } | |
339 | if (ip->i_flag&IACC) | |
340 | ip->i_atime = ta->tv_sec; | |
341 | if (ip->i_flag&IUPD) | |
342 | ip->i_mtime = tm->tv_sec; | |
343 | if (ip->i_flag&ICHG) | |
344 | ip->i_ctime = time.tv_sec; | |
345 | ip->i_flag &= ~(IUPD|IACC|ICHG|IMOD); | |
346 | dp = bp->b_un.b_dino + itoo(fs, ip->i_number); | |
a1e9dd57 | 347 | *dp = ip->i_din; |
7188ac27 KM |
348 | if (waitfor) { |
349 | return (bwrite(bp)); | |
350 | } else { | |
351 | bdwrite(bp); | |
352 | return (0); | |
5d5124a1 BJ |
353 | } |
354 | } | |
355 | ||
9c03b2c0 SL |
356 | #define SINGLE 0 /* index of single indirect block */ |
357 | #define DOUBLE 1 /* index of double indirect block */ | |
358 | #define TRIPLE 2 /* index of triple indirect block */ | |
5d5124a1 | 359 | /* |
a1e9dd57 KM |
360 | * Truncate the inode ip to at most length size. Free affected disk |
361 | * blocks -- the blocks of the file are removed in reverse order. | |
9c03b2c0 SL |
362 | * |
363 | * NB: triple indirect blocks are untested. | |
5d5124a1 | 364 | */ |
e038406d | 365 | itrunc(oip, length, flags) |
28821bc5 | 366 | register struct inode *oip; |
4f083fd7 | 367 | u_long length; |
e038406d | 368 | int flags; |
5d5124a1 | 369 | { |
4f083fd7 | 370 | register daddr_t lastblock; |
a5e62f37 | 371 | daddr_t bn, lbn, lastiblock[NIADDR]; |
6459ebe0 | 372 | register struct fs *fs; |
9c03b2c0 | 373 | register struct inode *ip; |
28821bc5 | 374 | struct buf *bp; |
7188ac27 KM |
375 | int offset, osize, size, level; |
376 | long count, nblocks, blocksreleased = 0; | |
28821bc5 | 377 | register int i; |
e038406d | 378 | int aflags, error, allerror; |
9c03b2c0 | 379 | struct inode tip; |
4f083fd7 | 380 | |
7b2e4f05 SL |
381 | if (oip->i_size <= length) { |
382 | oip->i_flag |= ICHG|IUPD; | |
7188ac27 KM |
383 | error = iupdat(oip, &time, &time, 1); |
384 | return (error); | |
7b2e4f05 | 385 | } |
c0bb1685 | 386 | /* |
9c03b2c0 SL |
387 | * Calculate index into inode's block list of |
388 | * last direct and indirect blocks (if any) | |
389 | * which we want to keep. Lastblock is -1 when | |
390 | * the file is truncated to 0. | |
c0bb1685 | 391 | */ |
9c03b2c0 | 392 | fs = oip->i_fs; |
4f083fd7 | 393 | lastblock = lblkno(fs, length + fs->fs_bsize - 1) - 1; |
9c03b2c0 SL |
394 | lastiblock[SINGLE] = lastblock - NDADDR; |
395 | lastiblock[DOUBLE] = lastiblock[SINGLE] - NINDIR(fs); | |
396 | lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs); | |
08d9a8ec | 397 | nblocks = btodb(fs->fs_bsize); |
6459ebe0 | 398 | /* |
28821bc5 KM |
399 | * Update the size of the file. If the file is not being |
400 | * truncated to a block boundry, the contents of the | |
401 | * partial block following the end of the file must be | |
402 | * zero'ed in case it ever become accessable again because | |
403 | * of subsequent file growth. | |
404 | */ | |
405 | osize = oip->i_size; | |
406 | offset = blkoff(fs, length); | |
407 | if (offset == 0) { | |
408 | oip->i_size = length; | |
409 | } else { | |
410 | lbn = lblkno(fs, length); | |
e038406d KM |
411 | aflags = B_CLRBUF; |
412 | if (flags & IO_SYNC) | |
413 | aflags |= B_SYNC; | |
414 | if (error = balloc(oip, lbn, offset, &bp, aflags)) | |
7188ac27 | 415 | return (error); |
28821bc5 KM |
416 | oip->i_size = length; |
417 | size = blksize(fs, oip, lbn); | |
e038406d | 418 | bn = bp->b_blkno; |
ec67a3ce | 419 | count = howmany(size, CLBYTES); |
7188ac27 | 420 | munhash(oip->i_devvp, bn + i * CLBYTES / DEV_BSIZE); |
a5e62f37 | 421 | bzero(bp->b_un.b_addr + offset, (unsigned)(size - offset)); |
e038406d KM |
422 | brealloc(bp, size); |
423 | if (flags & IO_SYNC) | |
424 | bwrite(bp); | |
425 | else | |
426 | bdwrite(bp); | |
28821bc5 KM |
427 | } |
428 | /* | |
429 | * Update file and block pointers | |
9c03b2c0 SL |
430 | * on disk before we start freeing blocks. |
431 | * If we crash before free'ing blocks below, | |
432 | * the blocks will be returned to the free list. | |
433 | * lastiblock values are also normalized to -1 | |
434 | * for calls to indirtrunc below. | |
6459ebe0 | 435 | */ |
9c03b2c0 | 436 | tip = *oip; |
28821bc5 | 437 | tip.i_size = osize; |
9c03b2c0 SL |
438 | for (level = TRIPLE; level >= SINGLE; level--) |
439 | if (lastiblock[level] < 0) { | |
440 | oip->i_ib[level] = 0; | |
441 | lastiblock[level] = -1; | |
4f083fd7 | 442 | } |
9c03b2c0 SL |
443 | for (i = NDADDR - 1; i > lastblock; i--) |
444 | oip->i_db[i] = 0; | |
9c03b2c0 | 445 | oip->i_flag |= ICHG|IUPD; |
e038406d | 446 | vinvalbuf(ITOV(oip), (length > 0)); |
2fc1f182 | 447 | allerror = iupdat(oip, &time, &time, MNT_WAIT); |
9c03b2c0 | 448 | |
6459ebe0 | 449 | /* |
9c03b2c0 | 450 | * Indirect blocks first. |
6459ebe0 | 451 | */ |
28821bc5 | 452 | ip = &tip; |
9c03b2c0 SL |
453 | for (level = TRIPLE; level >= SINGLE; level--) { |
454 | bn = ip->i_ib[level]; | |
4f083fd7 | 455 | if (bn != 0) { |
7188ac27 KM |
456 | error = indirtrunc(ip, bn, lastiblock[level], level, |
457 | &count); | |
458 | if (error) | |
459 | allerror = error; | |
460 | blocksreleased += count; | |
9c03b2c0 SL |
461 | if (lastiblock[level] < 0) { |
462 | ip->i_ib[level] = 0; | |
ced3a252 | 463 | blkfree(ip, bn, (off_t)fs->fs_bsize); |
9c03b2c0 | 464 | blocksreleased += nblocks; |
9c03b2c0 SL |
465 | } |
466 | } | |
467 | if (lastiblock[level] >= 0) | |
468 | goto done; | |
4f083fd7 | 469 | } |
9c03b2c0 | 470 | |
6459ebe0 | 471 | /* |
9c03b2c0 | 472 | * All whole direct blocks or frags. |
6459ebe0 | 473 | */ |
4f083fd7 | 474 | for (i = NDADDR - 1; i > lastblock; i--) { |
8011f5df | 475 | register off_t bsize; |
4f083fd7 | 476 | |
6459ebe0 | 477 | bn = ip->i_db[i]; |
4f083fd7 | 478 | if (bn == 0) |
5d5124a1 | 479 | continue; |
4f083fd7 | 480 | ip->i_db[i] = 0; |
0b355a6e | 481 | bsize = (off_t)blksize(fs, ip, i); |
ced3a252 | 482 | blkfree(ip, bn, bsize); |
0b355a6e | 483 | blocksreleased += btodb(bsize); |
4f083fd7 | 484 | } |
9c03b2c0 SL |
485 | if (lastblock < 0) |
486 | goto done; | |
487 | ||
4f083fd7 SL |
488 | /* |
489 | * Finally, look for a change in size of the | |
490 | * last direct block; release any frags. | |
491 | */ | |
9c03b2c0 SL |
492 | bn = ip->i_db[lastblock]; |
493 | if (bn != 0) { | |
8011f5df | 494 | off_t oldspace, newspace; |
9c03b2c0 | 495 | |
4f083fd7 SL |
496 | /* |
497 | * Calculate amount of space we're giving | |
498 | * back as old block size minus new block size. | |
499 | */ | |
9c03b2c0 | 500 | oldspace = blksize(fs, ip, lastblock); |
4f083fd7 | 501 | ip->i_size = length; |
9c03b2c0 SL |
502 | newspace = blksize(fs, ip, lastblock); |
503 | if (newspace == 0) | |
504 | panic("itrunc: newspace"); | |
505 | if (oldspace - newspace > 0) { | |
4f083fd7 SL |
506 | /* |
507 | * Block number of space to be free'd is | |
508 | * the old block # plus the number of frags | |
509 | * required for the storage we're keeping. | |
510 | */ | |
9c03b2c0 | 511 | bn += numfrags(fs, newspace); |
ced3a252 | 512 | blkfree(ip, bn, oldspace - newspace); |
08d9a8ec | 513 | blocksreleased += btodb(oldspace - newspace); |
4f083fd7 | 514 | } |
5d5124a1 | 515 | } |
4f083fd7 | 516 | done: |
9c03b2c0 SL |
517 | /* BEGIN PARANOIA */ |
518 | for (level = SINGLE; level <= TRIPLE; level++) | |
519 | if (ip->i_ib[level] != oip->i_ib[level]) | |
520 | panic("itrunc1"); | |
521 | for (i = 0; i < NDADDR; i++) | |
522 | if (ip->i_db[i] != oip->i_db[i]) | |
523 | panic("itrunc2"); | |
524 | /* END PARANOIA */ | |
08d9a8ec SL |
525 | oip->i_blocks -= blocksreleased; |
526 | if (oip->i_blocks < 0) /* sanity */ | |
527 | oip->i_blocks = 0; | |
528 | oip->i_flag |= ICHG; | |
b4567e9c | 529 | #ifdef QUOTA |
08d9a8ec | 530 | (void) chkdq(oip, -blocksreleased, 0); |
89045c38 | 531 | #endif |
7188ac27 | 532 | return (allerror); |
5d5124a1 BJ |
533 | } |
534 | ||
4f083fd7 SL |
535 | /* |
536 | * Release blocks associated with the inode ip and | |
537 | * stored in the indirect block bn. Blocks are free'd | |
538 | * in LIFO order up to (but not including) lastbn. If | |
9c03b2c0 SL |
539 | * level is greater than SINGLE, the block is an indirect |
540 | * block and recursive calls to indirtrunc must be used to | |
541 | * cleanse other indirect blocks. | |
542 | * | |
543 | * NB: triple indirect blocks are untested. | |
4f083fd7 | 544 | */ |
7188ac27 | 545 | indirtrunc(ip, bn, lastbn, level, countp) |
6459ebe0 | 546 | register struct inode *ip; |
4f083fd7 | 547 | daddr_t bn, lastbn; |
9c03b2c0 | 548 | int level; |
7188ac27 | 549 | long *countp; |
5d5124a1 | 550 | { |
4f083fd7 | 551 | register int i; |
b30358ab | 552 | struct buf *bp; |
9c03b2c0 | 553 | register struct fs *fs = ip->i_fs; |
b30358ab KM |
554 | register daddr_t *bap; |
555 | daddr_t *copy, nb, last; | |
7188ac27 KM |
556 | long blkcount, factor; |
557 | int nblocks, blocksreleased = 0; | |
558 | int error, allerror = 0; | |
5d5124a1 | 559 | |
9c03b2c0 SL |
560 | /* |
561 | * Calculate index in current block of last | |
562 | * block to be kept. -1 indicates the entire | |
563 | * block so we need not calculate the index. | |
564 | */ | |
565 | factor = 1; | |
566 | for (i = SINGLE; i < level; i++) | |
567 | factor *= NINDIR(fs); | |
4f083fd7 | 568 | last = lastbn; |
9c03b2c0 SL |
569 | if (lastbn > 0) |
570 | last /= factor; | |
08d9a8ec | 571 | nblocks = btodb(fs->fs_bsize); |
9c03b2c0 SL |
572 | /* |
573 | * Get buffer of block pointers, zero those | |
574 | * entries corresponding to blocks to be free'd, | |
575 | * and update on disk copy first. | |
576 | */ | |
ec67a3ce MK |
577 | #ifdef SECSIZE |
578 | bp = bread(ip->i_dev, fsbtodb(fs, bn), (int)fs->fs_bsize, | |
579 | fs->fs_dbsize); | |
580 | #else SECSIZE | |
a937f856 KM |
581 | error = bread(ip->i_devvp, fsbtodb(fs, bn), (int)fs->fs_bsize, |
582 | NOCRED, &bp); | |
7188ac27 | 583 | if (error) { |
9c03b2c0 | 584 | brelse(bp); |
7188ac27 KM |
585 | *countp = 0; |
586 | return (error); | |
9c03b2c0 SL |
587 | } |
588 | bap = bp->b_un.b_daddr; | |
b30358ab KM |
589 | MALLOC(copy, daddr_t *, fs->fs_bsize, M_TEMP, M_WAITOK); |
590 | bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->fs_bsize); | |
9c03b2c0 SL |
591 | bzero((caddr_t)&bap[last + 1], |
592 | (u_int)(NINDIR(fs) - (last + 1)) * sizeof (daddr_t)); | |
e038406d KM |
593 | if (last == -1) |
594 | bp->b_flags |= B_INVAL; | |
7188ac27 KM |
595 | error = bwrite(bp); |
596 | if (error) | |
597 | allerror = error; | |
b30358ab | 598 | bap = copy; |
4f083fd7 | 599 | |
9c03b2c0 SL |
600 | /* |
601 | * Recursively free totally unused blocks. | |
602 | */ | |
603 | for (i = NINDIR(fs) - 1; i > last; i--) { | |
5d5124a1 | 604 | nb = bap[i]; |
4f083fd7 | 605 | if (nb == 0) |
5d5124a1 | 606 | continue; |
7188ac27 KM |
607 | if (level > SINGLE) { |
608 | error = indirtrunc(ip, nb, (daddr_t)-1, level - 1, | |
609 | &blkcount); | |
610 | if (error) | |
611 | allerror = error; | |
612 | blocksreleased += blkcount; | |
613 | } | |
ced3a252 | 614 | blkfree(ip, nb, (off_t)fs->fs_bsize); |
4f083fd7 | 615 | blocksreleased += nblocks; |
4f083fd7 | 616 | } |
9c03b2c0 SL |
617 | |
618 | /* | |
619 | * Recursively free last partial block. | |
620 | */ | |
621 | if (level > SINGLE && lastbn >= 0) { | |
622 | last = lastbn % factor; | |
4f083fd7 | 623 | nb = bap[i]; |
7188ac27 KM |
624 | if (nb != 0) { |
625 | error = indirtrunc(ip, nb, last, level - 1, &blkcount); | |
626 | if (error) | |
627 | allerror = error; | |
628 | blocksreleased += blkcount; | |
629 | } | |
5d5124a1 | 630 | } |
b30358ab | 631 | FREE(copy, M_TEMP); |
7188ac27 KM |
632 | *countp = blocksreleased; |
633 | return (allerror); | |
5d5124a1 BJ |
634 | } |
635 | ||
d6a210b8 | 636 | /* |
7494ef16 | 637 | * Lock an inode. If its already locked, set the WANT bit and sleep. |
d6a210b8 | 638 | */ |
7494ef16 BJ |
639 | ilock(ip) |
640 | register struct inode *ip; | |
d6a210b8 BJ |
641 | { |
642 | ||
7188ac27 KM |
643 | while (ip->i_flag & ILOCKED) { |
644 | ip->i_flag |= IWANT; | |
71c4cb8d KM |
645 | if (ip->i_spare0 == u.u_procp->p_pid) |
646 | panic("locking against myself"); | |
647 | ip->i_spare1 = u.u_procp->p_pid; | |
7188ac27 KM |
648 | (void) sleep((caddr_t)ip, PINOD); |
649 | } | |
71c4cb8d KM |
650 | ip->i_spare1 = 0; |
651 | ip->i_spare0 = u.u_procp->p_pid; | |
652 | u.u_spare[0]++; | |
7188ac27 | 653 | ip->i_flag |= ILOCKED; |
d6a210b8 BJ |
654 | } |
655 | ||
656 | /* | |
7494ef16 | 657 | * Unlock an inode. If WANT bit is on, wakeup. |
d6a210b8 | 658 | */ |
ff56f48a | 659 | iunlock(ip) |
7494ef16 | 660 | register struct inode *ip; |
d6a210b8 BJ |
661 | { |
662 | ||
7188ac27 | 663 | if ((ip->i_flag & ILOCKED) == 0) |
e038406d | 664 | vprint("iunlock: unlocked inode", ITOV(ip)); |
71c4cb8d KM |
665 | ip->i_spare0 = 0; |
666 | u.u_spare[0]--; | |
7188ac27 KM |
667 | ip->i_flag &= ~ILOCKED; |
668 | if (ip->i_flag&IWANT) { | |
669 | ip->i_flag &= ~IWANT; | |
670 | wakeup((caddr_t)ip); | |
671 | } | |
672 | } | |
673 | ||
674 | /* | |
675 | * Check mode permission on inode pointer. Mode is READ, WRITE or EXEC. | |
676 | * The mode is shifted to select the owner/group/other fields. The | |
677 | * super user is granted all permissions. | |
678 | * | |
679 | * NB: Called from vnode op table. It seems this could all be done | |
680 | * using vattr's but... | |
681 | */ | |
682 | iaccess(ip, mode, cred) | |
683 | register struct inode *ip; | |
684 | register int mode; | |
685 | struct ucred *cred; | |
686 | { | |
687 | register gid_t *gp; | |
7188ac27 KM |
688 | int i; |
689 | ||
690 | /* | |
a1e9dd57 | 691 | * If you're the super-user, you always get access. |
7188ac27 KM |
692 | */ |
693 | if (cred->cr_uid == 0) | |
694 | return (0); | |
695 | /* | |
696 | * Access check is based on only one of owner, group, public. | |
697 | * If not owner, then check group. If not a member of the | |
698 | * group, then check public access. | |
699 | */ | |
700 | if (cred->cr_uid != ip->i_uid) { | |
701 | mode >>= 3; | |
702 | gp = cred->cr_groups; | |
703 | for (i = 0; i < cred->cr_ngroups; i++, gp++) | |
704 | if (ip->i_gid == *gp) | |
705 | goto found; | |
706 | mode >>= 3; | |
707 | found: | |
708 | ; | |
709 | } | |
710 | if ((ip->i_mode & mode) != 0) | |
711 | return (0); | |
712 | return (EACCES); | |
d6a210b8 | 713 | } |