Check for free space during allocation (need to figure out where
[unix-history] / usr / src / sys / ufs / lfs / lfs_inode.c
CommitLineData
da7c5cc6 1/*
7795cb4d 2 * Copyright (c) 1986, 1989, 1991 Regents of the University of California.
7188ac27 3 * All rights reserved.
da7c5cc6 4 *
b702c21d 5 * %sccs.include.redist.c%
7188ac27 6 *
55134c58 7 * @(#)lfs_inode.c 7.80 (Berkeley) %G%
da7c5cc6 8 */
5d5124a1 9
29ad237c
KB
10#include <sys/param.h>
11#include <sys/systm.h>
12#include <sys/mount.h>
13#include <sys/proc.h>
14#include <sys/file.h>
15#include <sys/buf.h>
16#include <sys/vnode.h>
17#include <sys/kernel.h>
18#include <sys/malloc.h>
5d5124a1 19
89663819
KM
20#include <vm/vm.h>
21
7795cb4d
KB
22#include <ufs/ufs/quota.h>
23#include <ufs/ufs/inode.h>
24#include <ufs/ufs/ufsmount.h>
25#include <ufs/ufs/ufs_extern.h>
c6f5111d 26
7795cb4d
KB
27#include <ufs/lfs/lfs.h>
28#include <ufs/lfs/lfs_extern.h>
2bf2d153 29
0a0d4fba 30int
0b4d6502 31lfs_init()
5d5124a1 32{
29ad237c 33 return (ufs_init());
5d5124a1
BJ
34}
35
841fa75e 36/* Search a block for a specific dinode. */
b4de8c04 37struct dinode *
841fa75e
KB
38lfs_ifind(fs, ino, dip)
39 struct lfs *fs;
40 ino_t ino;
41 register struct dinode *dip;
42{
43 register int cnt;
3ce71481 44 register struct dinode *ldip;
841fa75e 45
3ce71481
KB
46 for (cnt = INOPB(fs), ldip = dip + (cnt - 1); cnt--; --ldip)
47 if (ldip->di_inum == ino)
48 return (ldip);
841fa75e
KB
49
50 panic("lfs_ifind: dinode %u not found", ino);
51 /* NOTREACHED */
52}
53
0a0d4fba 54int
b4de8c04
KB
55lfs_update(ap)
56 struct vop_update_args /* {
57 struct vnode *a_vp;
58 struct timeval *a_ta;
59 struct timeval *a_tm;
60 int a_waitfor;
61 } */ *ap;
ff56f48a 62{
406c9a0d 63 struct vnode *vp = ap->a_vp;
ffcee610
KM
64 struct inode *ip;
65
406c9a0d 66 if (vp->v_mount->mnt_flag & MNT_RDONLY)
ffcee610 67 return (0);
406c9a0d 68 ip = VTOI(vp);
4ec7cf31 69 if ((ip->i_flag & (IUPD | IACC | ICHG | IMOD)) == 0)
ffcee610 70 return (0);
4ec7cf31 71 if (ip->i_flag & IACC)
7e11a0c9 72 ip->i_atime.ts_sec = ap->a_ta->tv_sec;
4ec7cf31 73 if (ip->i_flag & IUPD) {
7e11a0c9 74 ip->i_mtime.ts_sec = ap->a_tm->tv_sec;
d9011ad6 75 (ip)->i_modrev++;
5b51b344 76 }
4ec7cf31 77 if (ip->i_flag & ICHG)
7e11a0c9 78 ip->i_ctime.ts_sec = time.tv_sec;
4ec7cf31 79 ip->i_flag &= ~(IUPD|IACC|ICHG);
ffcee610 80
4ec7cf31
KB
81 if (!(ip->i_flag & IMOD))
82 ++(VFSTOUFS(vp->v_mount)->um_lfs->lfs_uinodes);
83 ip->i_flag |= IMOD;
84
85 /* If sync, push back the vnode and any dirty blocks it may have. */
486f8af1 86 return (ap->a_waitfor & LFS_SYNC ? lfs_vflush(vp) : 0);
5d5124a1
BJ
87}
88
2c68aab8 89/* Update segment usage information when removing a block. */
4ee2ad24
KB
90#define UPDATE_SEGUSE \
91 if (lastseg != -1) { \
92 LFS_SEGENTRY(sup, fs, lastseg, sup_bp); \
6b82c196
KB
93 if ((num << fs->lfs_bshift) > sup->su_nbytes) \
94 panic("lfs_truncate: negative bytes in segment %d\n", \
95 lastseg); \
5b792b30 96 sup->su_nbytes -= num << fs->lfs_bshift; \
4ec7cf31 97 e1 = VOP_BWRITE(sup_bp); \
4ee2ad24
KB
98 blocksreleased += num; \
99 }
2c68aab8
KB
100
101#define SEGDEC { \
f2bd68a0 102 if (daddr != 0) { \
2c68aab8
KB
103 if (lastseg != (seg = datosn(fs, daddr))) { \
104 UPDATE_SEGUSE; \
105 num = 1; \
106 lastseg = seg; \
107 } else \
108 ++num; \
109 } \
110}
111
5d5124a1 112/*
2c68aab8
KB
113 * Truncate the inode ip to at most length size. Update segment usage
114 * table information.
5d5124a1 115 */
29ad237c
KB
116/* ARGSUSED */
117int
b4de8c04
KB
118lfs_truncate(ap)
119 struct vop_truncate_args /* {
120 struct vnode *a_vp;
121 off_t a_length;
122 int a_flags;
123 struct ucred *a_cred;
124 struct proc *a_p;
125 } */ *ap;
5d5124a1 126{
8f42dbe0 127 register INDIR *inp;
2c68aab8
KB
128 register int i;
129 register daddr_t *daddrp;
b4de8c04
KB
130 register struct vnode *vp = ap->a_vp;
131 off_t length = ap->a_length;
4ee2ad24 132 struct buf *bp, *sup_bp;
d942bf69 133 struct timeval tv;
b3071295 134 struct ifile *ifp;
2c68aab8
KB
135 struct inode *ip;
136 struct lfs *fs;
137 INDIR a[NIADDR + 2], a_end[NIADDR + 2];
138 SEGUSE *sup;
139 daddr_t daddr, lastblock, lbn, olastblock;
55134c58 140 long off, a_released, blocksreleased, i_released;
b4de8c04 141 int e1, e2, depth, lastseg, num, offset, seg, size;
4f083fd7 142
e4b973c5
KB
143 ip = VTOI(vp);
144 tv = time;
145 if (vp->v_type == VLNK && vp->v_mount->mnt_maxsymlinklen > 0) {
146#ifdef DIAGNOSTIC
147 if (length != 0)
148 panic("lfs_truncate: partial truncate of symlink");
149#endif
150 bzero((char *)&ip->i_shortlink, (u_int)ip->i_size);
151 ip->i_size = 0;
152 ip->i_flag |= ICHG|IUPD;
486f8af1 153 return (VOP_UPDATE(vp, &tv, &tv, 0));
e4b973c5 154 }
b4de8c04 155 vnode_pager_setsize(vp, (u_long)length);
b3071295 156
b3071295
KB
157 fs = ip->i_lfs;
158
b4de8c04
KB
159 /* If length is larger than the file, just update the times. */
160 if (ip->i_size <= length) {
2c68aab8 161 ip->i_flag |= ICHG|IUPD;
486f8af1 162 return (VOP_UPDATE(vp, &tv, &tv, 0));
7b2e4f05 163 }
b3071295 164
2c68aab8
KB
165 /*
166 * Calculate index into inode's block list of last direct and indirect
167 * blocks (if any) which we want to keep. Lastblock is 0 when the
168 * file is truncated to 0.
169 */
b4de8c04 170 lastblock = lblkno(fs, length + fs->lfs_bsize - 1);
2c68aab8 171 olastblock = lblkno(fs, ip->i_size + fs->lfs_bsize - 1) - 1;
29ad237c 172
c0bb1685 173 /*
29ad237c
KB
174 * Update the size of the file. If the file is not being truncated to
175 * a block boundry, the contents of the partial block following the end
176 * of the file must be zero'ed in case it ever become accessable again
177 * because of subsequent file growth.
28821bc5 178 */
b4de8c04 179 offset = blkoff(fs, length);
29ad237c 180 if (offset == 0)
b4de8c04 181 ip->i_size = length;
29ad237c 182 else {
b4de8c04 183 lbn = lblkno(fs, length);
4b61628b 184#ifdef QUOTA
b4de8c04
KB
185 if (e1 = getinoquota(ip))
186 return (e1);
d5075120 187#endif
b4de8c04
KB
188 if (e1 = bread(vp, lbn, fs->lfs_bsize, NOCRED, &bp))
189 return (e1);
190 ip->i_size = length;
a79b7b81 191 size = blksize(fs);
b4de8c04 192 (void)vnode_pager_uncache(vp);
a5e62f37 193 bzero(bp->b_un.b_addr + offset, (unsigned)(size - offset));
9cf42d55 194 allocbuf(bp, size);
4ec7cf31
KB
195 if (e1 = VOP_BWRITE(bp))
196 return (e1);
5d5124a1 197 }
f28a1334 198 /*
2c68aab8
KB
199 * Modify sup->su_nbyte counters for each deleted block; keep track
200 * of number of blocks removed for ip->i_blocks.
201 */
202 blocksreleased = 0;
203 num = 0;
204 lastseg = -1;
205
206 for (lbn = olastblock; lbn >= lastblock;) {
b4de8c04 207 lfs_bmaparray(vp, lbn, &daddr, a, &depth);
2c68aab8
KB
208 if (lbn == olastblock)
209 for (i = NIADDR + 2; i--;)
210 a_end[i] = a[i];
211 switch (depth) {
212 case 0: /* Direct block. */
213 daddr = ip->i_db[lbn];
214 SEGDEC;
215 ip->i_db[lbn] = 0;
216 --lbn;
217 break;
218#ifdef DIAGNOSTIC
219 case 1: /* An indirect block. */
220 panic("lfs_truncate: lfs_bmaparray returned depth 1");
221 /* NOTREACHED */
222#endif
223 default: /* Chain of indirect blocks. */
8f42dbe0
JH
224 inp = a + --depth;
225 if (inp->in_off > 0 && lbn != lastblock) {
226 lbn -= inp->in_off < lbn - lastblock ?
227 inp->in_off : lbn - lastblock;
2c68aab8
KB
228 break;
229 }
8f42dbe0
JH
230 for (; depth && (inp->in_off == 0 || lbn == lastblock);
231 --inp, --depth) {
b4de8c04 232 if (bread(vp,
8f42dbe0 233 inp->in_lbn, fs->lfs_bsize, NOCRED, &bp))
2c68aab8 234 panic("lfs_truncate: bread bno %d",
8f42dbe0
JH
235 inp->in_lbn);
236 daddrp = bp->b_un.b_daddr + inp->in_off;
237 for (i = inp->in_off;
2c68aab8
KB
238 i++ <= a_end[depth].in_off;) {
239 daddr = *daddrp++;
240 SEGDEC;
241 }
c86ca11e 242 a_end[depth].in_off = NINDIR(fs) - 1;
8f42dbe0 243 if (inp->in_off == 0)
c86ca11e
CS
244 brelse (bp);
245 else {
8f42dbe0 246 bzero(bp->b_un.b_daddr + inp->in_off,
2c68aab8 247 fs->lfs_bsize -
8f42dbe0 248 inp->in_off * sizeof(daddr_t));
4ec7cf31
KB
249 if (e1 = VOP_BWRITE(bp))
250 return (e1);
c86ca11e 251 }
2c68aab8 252 }
c86ca11e 253 if (depth == 0 && a[1].in_off == 0) {
2c68aab8
KB
254 off = a[0].in_off;
255 daddr = ip->i_ib[off];
256 SEGDEC;
257 ip->i_ib[off] = 0;
258 }
5b792b30 259 if (lbn == lastblock || lbn <= NDADDR)
2c68aab8
KB
260 --lbn;
261 else {
262 lbn -= NINDIR(fs);
263 if (lbn < lastblock)
264 lbn = lastblock;
265 }
266 }
267 }
4ee2ad24 268 UPDATE_SEGUSE;
6b82c196
KB
269
270 /* If truncating the file to 0, update the version number. */
271 if (length == 0) {
272 LFS_IENTRY(ifp, fs, ip->i_number, bp);
273 ++ifp->if_version;
4ec7cf31 274 (void) VOP_BWRITE(bp);
6b82c196
KB
275 }
276
7f06053c 277#ifdef DIAGNOSTIC
4ec7cf31 278 if (ip->i_blocks < fsbtodb(fs, blocksreleased))
7f06053c
KB
279 panic("lfs_truncate: block count < 0");
280#endif
4ec7cf31
KB
281 ip->i_blocks -= fsbtodb(fs, blocksreleased);
282 fs->lfs_bfree += fsbtodb(fs, blocksreleased);
2c68aab8 283 ip->i_flag |= ICHG|IUPD;
4ec7cf31
KB
284 /*
285 * Traverse dirty block list counting number of dirty buffers
286 * that are being deleted out of the cache, so that the lfs_avail
287 * field can be updated.
288 */
55134c58
MS
289 a_released = 0;
290 i_released = 0;
4ec7cf31 291 for (bp = vp->v_dirtyblkhd; bp; bp = bp->b_blockf)
55134c58
MS
292 if (bp->b_flags & B_LOCKED) {
293 ++a_released;
294 /*
295 * XXX
296 * When buffers are created in the cache, their block
297 * number is set equal to their logical block number.
298 * If that is still true, we are assuming that the
299 * blocks are new (not yet on disk) and weren't
300 * counted above. However, there is a slight chance
301 * that a block's disk address is equal to its logical
302 * block number in which case, we'll get an overcounting
303 * here.
304 */
305 if (bp->b_blkno == bp->b_lblkno)
306 ++i_released;
307 }
308 blocksreleased = fsbtodb(fs, i_released);
309#ifdef DIAGNOSTIC
310 if (blocksreleased > ip->i_blocks) {
311 printf("lfs_inode: Warning! %s\n",
312 "more blocks released from inode than are in inode");
313 blocksreleased = ip->i_blocks;
314 }
315#endif
316 fs->lfs_bfree += blocksreleased;
317 ip->i_blocks -= blocksreleased;
318#ifdef DIAGNOSTIC
319 if (length == 0 && ip->i_blocks != 0)
320 printf("lfs_inode: Warning! %s%d%s\n",
321 "Truncation to zero, but ", ip->i_blocks,
322 " blocks left on inode");
323#endif
324 fs->lfs_avail -= fsbtodb(fs, a_released);
b4de8c04 325 e1 = vinvalbuf(vp, length > 0, ap->a_cred, ap->a_p);
e4b973c5 326 e2 = VOP_UPDATE(vp, &tv, &tv, 0);
b4de8c04 327 return (e1 ? e1 : e2 ? e2 : 0);
7188ac27 328}