-/* lfs_inode.c 6.8 84/07/15 */
-
-#include "../h/param.h"
-#include "../h/systm.h"
-#include "../h/mount.h"
-#include "../h/dir.h"
-#include "../h/user.h"
-#include "../h/inode.h"
-#include "../h/fs.h"
-#include "../h/conf.h"
-#include "../h/buf.h"
+/*
+ * Copyright (c) 1982, 1986, 1989 Regents of the University of California.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms are permitted
+ * provided that the above copyright notice and this paragraph are
+ * duplicated in all such forms and that any documentation,
+ * advertising materials, and other materials related to such
+ * distribution and use acknowledge that the software was developed
+ * by the University of California, Berkeley. The name of the
+ * University may not be used to endorse or promote products derived
+ * from this software without specific prior written permission.
+ * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+ * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+ *
+ * @(#)lfs_inode.c 7.21 (Berkeley) %G%
+ */
+
+#include "param.h"
+#include "systm.h"
+#include "mount.h"
+#include "user.h"
+#include "file.h"
+#include "buf.h"
+#include "cmap.h"
+#include "vnode.h"
+#include "../ufs/inode.h"
+#include "../ufs/fs.h"
+#include "../ufs/ufsmount.h"
#ifdef QUOTA
-#include "../h/quota.h"
+#include "../ufs/quota.h"
#endif
-#include "../h/kernel.h"
+#include "kernel.h"
+#include "malloc.h"
-#define INOHSZ 64
+#define INOHSZ 512
#if ((INOHSZ&(INOHSZ-1)) == 0)
#define INOHASH(dev,ino) (((dev)+(ino))&(INOHSZ-1))
#else
#define INOHASH(dev,ino) (((unsigned)((dev)+(ino)))%INOHSZ)
#endif
-union ihead { /* inode LRU cache, Chris Maltby */
+union ihead {
union ihead *ih_head[2];
struct inode *ih_chain[2];
} ihead[INOHSZ];
-struct inode *ifreeh, **ifreet;
+int prtactive; /* 1 => print out reclaim of active vnodes */
/*
- * Initialize hash links for inodes
- * and build inode free list.
+ * Initialize hash links for inodes.
*/
-ihinit()
+ufs_init()
{
register int i;
- register struct inode *ip = inode;
- register union ihead *ih = ihead;
+ register union ihead *ih = ihead;
+#ifndef lint
+ if (VN_MAXPRIVATE < sizeof(struct inode))
+ panic("ihinit: too small");
+#endif /* not lint */
for (i = INOHSZ; --i >= 0; ih++) {
ih->ih_head[0] = ih;
ih->ih_head[1] = ih;
}
- ifreeh = ip;
- ifreet = &ip->i_freef;
- ip->i_freeb = &ifreeh;
- ip->i_forw = ip;
- ip->i_back = ip;
- for (i = ninode; --i > 0; ) {
- ++ip;
- ip->i_forw = ip;
- ip->i_back = ip;
- *ifreet = ip;
- ip->i_freeb = ifreet;
- ifreet = &ip->i_freef;
- }
- ip->i_freef = NULL;
-}
-
-#ifdef notdef
-/*
- * Find an inode if it is incore.
- * This is the equivalent, for inodes,
- * of ``incore'' in bio.c or ``pfind'' in subr.c.
- */
-struct inode *
-ifind(dev, ino)
- dev_t dev;
- ino_t ino;
-{
- register struct inode *ip;
- register union ihead *ih;
-
- ih = &ihead[INOHASH(dev, ino)];
- for (ip = ih->ih_chain[0]; ip != (struct inode *)ih; ip = ip->i_forw)
- if (ino==ip->i_number && dev==ip->i_dev)
- return (ip);
- return ((struct inode *)0);
}
-#endif notdef
/*
- * Look up an inode by device,inumber.
+ * Look up an vnode/inode by device,inumber.
* If it is in core (in the inode structure),
* honor the locking protocol.
* If it is not in core, read it in from the
* specified device.
- * If the inode is mounted on, perform
- * the indicated indirection.
+ * Callers must check for mount points!!
* In all cases, a pointer to a locked
* inode structure is returned.
- *
- * panic: no imt -- if the mounted file
- * system is not in the mount table.
- * "cannot happen"
*/
-struct inode *
-iget(dev, fs, ino)
- dev_t dev;
- register struct fs *fs;
+iget(xp, ino, ipp)
+ struct inode *xp;
ino_t ino;
+ struct inode **ipp;
{
- register struct inode *ip;
- register union ihead *ih;
- register struct mount *mp;
- register struct buf *bp;
- register struct dinode *dp;
- register struct inode *iq;
- struct inode *xp;
-
+ dev_t dev = xp->i_dev;
+ struct mount *mntp = ITOV(xp)->v_mount;
+ register struct fs *fs = VFSTOUFS(mntp)->um_fs;
+ extern struct vnodeops ufs_vnodeops, spec_inodeops;
+ register struct inode *ip, *iq;
+ register struct vnode *vp;
+ struct vnode *nvp;
+ struct buf *bp;
+ struct dinode *dp;
+ union ihead *ih;
+ int error;
-loop:
ih = &ihead[INOHASH(dev, ino)];
- for (ip = ih->ih_chain[0]; ip != (struct inode *)ih; ip = ip->i_forw)
- if (ino == ip->i_number && dev == ip->i_dev) {
- /*
- * Following is essentially an inline expanded
- * copy of igrab(), expanded inline for speed,
- * and so that the test for a mounted on inode
- * can be deferred until after we are sure that
- * the inode isn't busy.
- */
- if ((ip->i_flag&ILOCKED) != 0) {
- ip->i_flag |= IWANT;
- sleep((caddr_t)ip, PINOD);
- goto loop;
- }
- if ((ip->i_flag&IMOUNT) != 0) {
- for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
- if(mp->m_inodp == ip) {
- dev = mp->m_dev;
- fs = mp->m_bufp->b_un.b_fs;
- ino = ROOTINO;
- goto loop;
- }
- panic("no imt");
- }
- if (ip->i_count == 0) { /* ino on free list */
- if (iq = ip->i_freef)
- iq->i_freeb = ip->i_freeb;
- else
- ifreet = ip->i_freeb;
- *ip->i_freeb = iq;
- ip->i_freef = NULL;
- ip->i_freeb = NULL;
- }
- ip->i_count++;
- ip->i_flag |= ILOCKED;
- return(ip);
+loop:
+ for (ip = ih->ih_chain[0]; ip != (struct inode *)ih; ip = ip->i_forw) {
+ if (ino != ip->i_number || dev != ip->i_dev)
+ continue;
+ if ((ip->i_flag&ILOCKED) != 0) {
+ ip->i_flag |= IWANT;
+ sleep((caddr_t)ip, PINOD);
+ goto loop;
}
-
- if ((ip = ifreeh) == NULL) {
- tablefull("inode");
- u.u_error = ENFILE;
- return(NULL);
+ if (vget(ITOV(ip)))
+ goto loop;
+ *ipp = ip;
+ return(0);
}
- if (ip->i_count)
- panic("free inode isn't");
- if (iq = ip->i_freef)
- iq->i_freeb = &ifreeh;
- ifreeh = iq;
- ip->i_freef = NULL;
- ip->i_freeb = NULL;
/*
- * Now to take inode off the hash chain it was on
- * (initially, or after an iflush, it is on a "hash chain"
- * consisting entirely of itself, and pointed to by no-one,
- * but that doesn't matter), and put it on the chain for
- * its new (ino, dev) pair
+ * Allocate a new inode.
*/
- remque(ip);
- insque(ip, ih);
- ip->i_dev = dev;
- ip->i_fs = fs;
- ip->i_number = ino;
- ip->i_id = ++nextinodeid; /* also used in rename */
- /*
- * At an absurd rate of 100 calls/second,
- * this should occur once every 8 months.
- */
- if (nextinodeid < 0)
- for (nextinodeid = 0, xp = inode; xp < inodeNINODE; xp++)
- xp->i_id = 0;
- ip->i_flag = ILOCKED;
- ip->i_count++;
+ if (error = getnewvnode(VT_UFS, mntp, &ufs_vnodeops, &nvp)) {
+ *ipp = 0;
+ return (error);
+ }
+ ip = VTOI(nvp);
+ ip->i_vnode = nvp;
+ ip->i_flag = 0;
+ ip->i_devvp = 0;
ip->i_lastr = 0;
+ ip->i_mode = 0;
#ifdef QUOTA
- dqrele(ip->i_dquot);
+ ip->i_dquot = NODQUOT;
#endif
- bp = bread(dev, fsbtodb(fs, itod(fs, ino)), (int)fs->fs_bsize);
/*
- * Check I/O errors
+ * Put it onto its hash chain and lock it so that other requests for
+ * this inode will block if they arrive while we are sleeping waiting
+ * for old data structures to be purged or for the contents of the
+ * disk portion of this inode to be read.
*/
- if ((bp->b_flags&B_ERROR) != 0) {
- brelse(bp);
- /*
- * the inode doesn't contain anything useful, so it would
- * be misleading to leave it on its hash chain.
- * 'iput' will take care of putting it back on the free list.
- */
- remque(ip);
- ip->i_forw = ip;
- ip->i_back = ip;
+ ip->i_dev = dev;
+ ip->i_number = ino;
+ insque(ip, ih);
+ ILOCK(ip);
+ /*
+ * Read in the disk contents for the inode.
+ */
+ if (error = bread(VFSTOUFS(mntp)->um_devvp, fsbtodb(fs, itod(fs, ino)),
+ (int)fs->fs_bsize, NOCRED, &bp)) {
/*
- * we also loose its inumber, just in case (as iput
- * doesn't do that any more) - but as it isn't on its
- * hash chain, I doubt if this is really necessary .. kre
- * (probably the two methods are interchangable)
+ * Unlock and discard unneeded inode.
*/
- ip->i_number = 0;
-#ifdef QUOTA
- ip->i_dquot = NODQUOT;
-#endif
iput(ip);
- return(NULL);
+ brelse(bp);
+ *ipp = 0;
+ return (error);
}
dp = bp->b_un.b_dino;
dp += itoo(fs, ino);
- ip->i_ic = dp->di_ic;
+ ip->i_din = *dp;
brelse(bp);
+ /*
+ * Initialize the associated vnode
+ */
+ vp = ITOV(ip);
+ vp->v_type = IFTOVT(ip->i_mode);
+ if (vp->v_type == VCHR || vp->v_type == VBLK) {
+ vp->v_rdev = ip->i_rdev;
+ vp->v_op = &spec_inodeops;
+ if (nvp = checkalias(vp, mntp)) {
+ /*
+ * Reinitialize aliased inode.
+ */
+ vp = nvp;
+ iq = VTOI(vp);
+ iq->i_vnode = vp;
+ iq->i_lastr = 0;
+ iq->i_flag = 0;
+ ILOCK(iq);
+ iq->i_din = ip->i_din;
+ iq->i_dev = dev;
+ iq->i_number = ino;
+ insque(iq, ih);
+ /*
+ * Discard unneeded vnode
+ */
+ ip->i_mode = 0;
+ iput(ip);
+ ip = iq;
+ }
+ }
+ if (ino == ROOTINO)
+ vp->v_flag |= VROOT;
+ /*
+ * Finish inode initialization.
+ */
+ ip->i_fs = fs;
+ ip->i_devvp = VFSTOUFS(mntp)->um_devvp;
+ VREF(ip->i_devvp);
#ifdef QUOTA
- if (ip->i_mode == 0)
- ip->i_dquot = NODQUOT;
- else
+ if (ip->i_mode != 0)
ip->i_dquot = inoquota(ip);
#endif
- return (ip);
+ /*
+ * Set up a generation number for this inode if it does not
+ * already have one. This should only happen on old filesystems.
+ */
+ if (ip->i_gen == 0) {
+ if (++nextgennumber < (u_long)time.tv_sec)
+ nextgennumber = time.tv_sec;
+ ip->i_gen = nextgennumber;
+ if ((vp->v_mount->m_flag & M_RDONLY) == 0)
+ ip->i_flag |= IMOD;
+ }
+ *ipp = ip;
+ return (0);
}
/*
- * Convert a pointer to an inode into a reference to an inode.
- *
- * This is basically the internal piece of iget (after the
- * inode pointer is located) but without the test for mounted
- * filesystems. It is caller's responsibility to check that
- * the inode pointer is valid.
+ * Unlock and decrement the reference count of an inode structure.
*/
-igrab(ip)
+iput(ip)
register struct inode *ip;
{
- while ((ip->i_flag&ILOCKED) != 0) {
- ip->i_flag |= IWANT;
- sleep((caddr_t)ip, PINOD);
- }
- if (ip->i_count == 0) { /* ino on free list */
- register struct inode *iq;
-
- if (iq = ip->i_freef)
- iq->i_freeb = ip->i_freeb;
- else
- ifreet = ip->i_freeb;
- *ip->i_freeb = iq;
- ip->i_freef = NULL;
- ip->i_freeb = NULL;
- }
- ip->i_count++;
- ip->i_flag |= ILOCKED;
+
+ if ((ip->i_flag & ILOCKED) == 0)
+ panic("iput");
+ IUNLOCK(ip);
+ vrele(ITOV(ip));
}
/*
- * Decrement reference count of
- * an inode structure.
- * On the last reference,
- * write the inode out and if necessary,
+ * Last reference to an inode, write the inode out and if necessary,
* truncate and deallocate the file.
*/
-iput(ip)
- register struct inode *ip;
+ufs_inactive(vp)
+ struct vnode *vp;
{
+ register struct inode *ip = VTOI(vp);
+ int mode, error = 0;
- if ((ip->i_flag & ILOCKED) == 0)
- panic("iput");
+ if (prtactive && vp->v_count != 0)
+ printf("ufs_inactive: pushing active ino %d dev 0x%x\n",
+ ip->i_number, ip->i_dev);
+ /*
+ * Get rid of inodes related to stale file handles.
+ */
+ if (ip->i_mode == 0) {
+ vgone(vp);
+ return (0);
+ }
+ ILOCK(ip);
+ if (ip->i_nlink <= 0 && (vp->v_mount->m_flag & M_RDONLY) == 0) {
+ error = itrunc(ip, (u_long)0);
+ mode = ip->i_mode;
+ ip->i_mode = 0;
+ ip->i_rdev = 0;
+ ip->i_flag |= IUPD|ICHG;
+ ifree(ip, ip->i_number, mode);
+#ifdef QUOTA
+ (void) chkiq(ip->i_dev, ip, ip->i_uid, 0);
+ dqrele(ip->i_dquot);
+ ip->i_dquot = NODQUOT;
+#endif
+ }
+ IUPDAT(ip, &time, &time, 0);
IUNLOCK(ip);
- irele(ip);
+ ip->i_flag = 0;
+ /*
+ * If we are done with the inode, reclaim it
+ * so that it can be reused immediately.
+ */
+ if (vp->v_count == 0 && ip->i_mode == 0)
+ vgone(vp);
+ return (error);
}
-irele(ip)
- register struct inode *ip;
+/*
+ * Reclaim an inode so that it can be used for other purposes.
+ */
+ufs_reclaim(vp)
+ register struct vnode *vp;
{
- int mode;
+ register struct inode *ip = VTOI(vp);
- if (ip->i_count == 1) {
- ip->i_flag |= ILOCKED;
- if (ip->i_nlink <= 0) {
- itrunc(ip, (u_long)0);
- mode = ip->i_mode;
- ip->i_mode = 0;
- ip->i_rdev = 0;
- ip->i_flag |= IUPD|ICHG;
- ifree(ip, ip->i_number, mode);
+ if (prtactive && vp->v_count != 0)
+ printf("ufs_reclaim: pushing active ino %d dev 0x%x\n",
+ ip->i_number, ip->i_dev);
+ /*
+ * Remove the inode from its hash chain.
+ */
+ remque(ip);
+ ip->i_forw = ip;
+ ip->i_back = ip;
+ /*
+ * Purge old data structures associated with the inode.
+ */
+ cache_purge(vp);
+ if (ip->i_devvp) {
+ vrele(ip->i_devvp);
+ ip->i_devvp = 0;
+ }
#ifdef QUOTA
- (void) chkiq(ip->i_dev, ip, ip->i_uid, 0);
- dqrele(ip->i_dquot);
- ip->i_dquot = NODQUOT;
+ dqrele(ip->i_dquot);
+ ip->i_dquot = NODQUOT;
#endif
- }
- IUPDAT(ip, &time, &time, 0);
- IUNLOCK(ip);
- ip->i_flag = 0;
- /*
- * Put the inode on the end of the free list.
- * Possibly in some cases it would be better to
- * put the inode at the head of the free list,
- * (eg: where i_mode == 0 || i_number == 0)
- * but I will think about that later .. kre
- * (i_number is rarely 0 - only after an i/o error in iget,
- * where i_mode == 0, the inode will probably be wanted
- * again soon for an ialloc, so possibly we should keep it)
- */
- if (ifreeh) {
- *ifreet = ip;
- ip->i_freeb = ifreet;
- } else {
- ifreeh = ip;
- ip->i_freeb = &ifreeh;
- }
- ip->i_freef = NULL;
- ifreet = &ip->i_freef;
- } else if (!(ip->i_flag & ILOCKED))
- ITIMES(ip, &time, &time);
- ip->i_count--;
+ ip->i_flag = 0;
+ return (0);
}
/*
- * Check accessed and update flags on
- * an inode structure.
- * If any is on, update the inode
- * with the current time.
- * If waitfor is given, then must insure
- * i/o order so wait for write to complete.
+ * Check accessed and update flags on an inode structure.
+ * If any is on, update the inode with the current time.
+ * If waitfor is given, then must ensure I/O order,
+ * so wait for write to complete.
*/
iupdat(ip, ta, tm, waitfor)
register struct inode *ip;
struct timeval *ta, *tm;
int waitfor;
{
- register struct buf *bp;
+ struct buf *bp;
+ struct vnode *vp = ITOV(ip);
struct dinode *dp;
- register struct fs *fp;
-
- fp = ip->i_fs;
- if ((ip->i_flag & (IUPD|IACC|ICHG|IMOD)) != 0) {
- if (fp->fs_ronly)
- return;
- bp = bread(ip->i_dev, fsbtodb(fp, itod(fp, ip->i_number)),
- (int)fp->fs_bsize);
- if (bp->b_flags & B_ERROR) {
- brelse(bp);
- return;
- }
- if (ip->i_flag&IACC)
- ip->i_atime = ta->tv_sec;
- if (ip->i_flag&IUPD)
- ip->i_mtime = tm->tv_sec;
- if (ip->i_flag&ICHG)
- ip->i_ctime = time.tv_sec;
- ip->i_flag &= ~(IUPD|IACC|ICHG|IMOD);
- dp = bp->b_un.b_dino + itoo(fp, ip->i_number);
- dp->di_ic = ip->i_ic;
- if (waitfor)
- bwrite(bp);
- else
- bdwrite(bp);
+ register struct fs *fs;
+
+ fs = ip->i_fs;
+ if ((ip->i_flag & (IUPD|IACC|ICHG|IMOD)) == 0)
+ return (0);
+ if (vp->v_mount->m_flag & M_RDONLY)
+ return (0);
+ error = bread(ip->i_devvp, fsbtodb(fs, itod(fs, ip->i_number)),
+ (int)fs->fs_bsize, NOCRED, &bp);
+ if (error) {
+ brelse(bp);
+ return (error);
+ }
+ if (ip->i_flag&IACC)
+ ip->i_atime = ta->tv_sec;
+ if (ip->i_flag&IUPD)
+ ip->i_mtime = tm->tv_sec;
+ if (ip->i_flag&ICHG)
+ ip->i_ctime = time.tv_sec;
+ ip->i_flag &= ~(IUPD|IACC|ICHG|IMOD);
+ dp = bp->b_un.b_dino + itoo(fs, ip->i_number);
+ *dp = ip->i_din;
+ if (waitfor) {
+ return (bwrite(bp));
+ } else {
+ bdwrite(bp);
+ return (0);
}
}
#define DOUBLE 1 /* index of double indirect block */
#define TRIPLE 2 /* index of triple indirect block */
/*
- * Truncate the inode ip to at most
- * length size. Free affected disk
- * blocks -- the blocks of the file
- * are removed in reverse order.
+ * Truncate the inode ip to at most length size. Free affected disk
+ * blocks -- the blocks of the file are removed in reverse order.
*
* NB: triple indirect blocks are untested.
*/
itrunc(oip, length)
- struct inode *oip;
+ register struct inode *oip;
u_long length;
{
- register i;
register daddr_t lastblock;
- daddr_t bn, lastiblock[NIADDR];
+ daddr_t bn, lbn, lastiblock[NIADDR];
register struct fs *fs;
register struct inode *ip;
+ struct buf *bp;
+ int offset, osize, size, level;
+ long count, nblocks, blocksreleased = 0;
+ register int i;
+ int error, allerror = 0;
struct inode tip;
- long blocksreleased = 0, nblocks;
- long indirtrunc();
- int level;
if (oip->i_size <= length) {
oip->i_flag |= ICHG|IUPD;
- iupdat(oip, &time, &time, 1);
- return;
+ error = iupdat(oip, &time, &time, 1);
+ return (error);
}
/*
* Calculate index into inode's block list of
lastiblock[TRIPLE] = lastiblock[DOUBLE] - NINDIR(fs) * NINDIR(fs);
nblocks = btodb(fs->fs_bsize);
/*
- * Update size of file and block pointers
+ * Update the size of the file. If the file is not being
+ * truncated to a block boundry, the contents of the
+ * partial block following the end of the file must be
+ * zero'ed in case it ever become accessable again because
+ * of subsequent file growth.
+ */
+ osize = oip->i_size;
+ offset = blkoff(fs, length);
+ if (offset == 0) {
+ oip->i_size = length;
+ } else {
+ lbn = lblkno(fs, length);
+ error = balloc(oip, lbn, offset, &bn, B_CLRBUF);
+ if (error)
+ return (error);
+ if ((long)bn < 0)
+ panic("itrunc: hole");
+ oip->i_size = length;
+ size = blksize(fs, oip, lbn);
+ count = howmany(size, CLBYTES);
+ munhash(oip->i_devvp, bn + i * CLBYTES / DEV_BSIZE);
+ error = bread(oip->i_devvp, bn, size, NOCRED, &bp);
+ if (error) {
+ oip->i_size = osize;
+ brelse(bp);
+ return (error);
+ }
+ bzero(bp->b_un.b_addr + offset, (unsigned)(size - offset));
+ bdwrite(bp);
+ }
+ /*
+ * Update file and block pointers
* on disk before we start freeing blocks.
* If we crash before free'ing blocks below,
* the blocks will be returned to the free list.
* lastiblock values are also normalized to -1
* for calls to indirtrunc below.
- * (? fsck doesn't check validity of pointers in indirect blocks)
*/
tip = *oip;
+ tip.i_size = osize;
for (level = TRIPLE; level >= SINGLE; level--)
if (lastiblock[level] < 0) {
oip->i_ib[level] = 0;
}
for (i = NDADDR - 1; i > lastblock; i--)
oip->i_db[i] = 0;
- oip->i_size = length;
oip->i_flag |= ICHG|IUPD;
- iupdat(oip, &time, &time, 1);
- ip = &tip;
+ allerror = syncip(oip, MNT_WAIT);
/*
* Indirect blocks first.
*/
+ ip = &tip;
for (level = TRIPLE; level >= SINGLE; level--) {
bn = ip->i_ib[level];
if (bn != 0) {
- blocksreleased +=
- indirtrunc(ip, bn, lastiblock[level], level);
+ error = indirtrunc(ip, bn, lastiblock[level], level,
+ &count);
+ if (error)
+ allerror = error;
+ blocksreleased += count;
if (lastiblock[level] < 0) {
ip->i_ib[level] = 0;
- free(ip, bn, (off_t)fs->fs_bsize);
+ blkfree(ip, bn, (off_t)fs->fs_bsize);
blocksreleased += nblocks;
}
}
* All whole direct blocks or frags.
*/
for (i = NDADDR - 1; i > lastblock; i--) {
- register int size;
+ register off_t bsize;
bn = ip->i_db[i];
if (bn == 0)
continue;
ip->i_db[i] = 0;
- size = (off_t)blksize(fs, ip, i);
- free(ip, bn, size);
- blocksreleased += btodb(size);
+ bsize = (off_t)blksize(fs, ip, i);
+ blkfree(ip, bn, bsize);
+ blocksreleased += btodb(bsize);
}
if (lastblock < 0)
goto done;
*/
bn = ip->i_db[lastblock];
if (bn != 0) {
- int oldspace, newspace;
+ off_t oldspace, newspace;
/*
* Calculate amount of space we're giving
* required for the storage we're keeping.
*/
bn += numfrags(fs, newspace);
- free(ip, bn, oldspace - newspace);
+ blkfree(ip, bn, oldspace - newspace);
blocksreleased += btodb(oldspace - newspace);
}
}
#ifdef QUOTA
(void) chkdq(oip, -blocksreleased, 0);
#endif
+ return (allerror);
}
/*
*
* NB: triple indirect blocks are untested.
*/
-long
-indirtrunc(ip, bn, lastbn, level)
+indirtrunc(ip, bn, lastbn, level, countp)
register struct inode *ip;
daddr_t bn, lastbn;
int level;
+ long *countp;
{
register int i;
- struct buf *bp, *copy;
- register daddr_t *bap;
+ struct buf *bp;
register struct fs *fs = ip->i_fs;
- daddr_t nb, last;
- long factor;
- int blocksreleased = 0, nblocks;
+ register daddr_t *bap;
+ daddr_t *copy, nb, last;
+ long blkcount, factor;
+ int nblocks, blocksreleased = 0;
+ int error, allerror = 0;
/*
* Calculate index in current block of last
* entries corresponding to blocks to be free'd,
* and update on disk copy first.
*/
- copy = geteblk((int)fs->fs_bsize);
- bp = bread(ip->i_dev, fsbtodb(fs, bn), (int)fs->fs_bsize);
- if (bp->b_flags&B_ERROR) {
- brelse(copy);
+#ifdef SECSIZE
+ bp = bread(ip->i_dev, fsbtodb(fs, bn), (int)fs->fs_bsize,
+ fs->fs_dbsize);
+#else SECSIZE
+ error = bread(ip->i_devvp, fsbtodb(fs, bn), (int)fs->fs_bsize,
+ NOCRED, &bp);
+ if (error) {
brelse(bp);
- return (0);
+ *countp = 0;
+ return (error);
}
bap = bp->b_un.b_daddr;
- bcopy((caddr_t)bap, (caddr_t)copy->b_un.b_daddr, (u_int)fs->fs_bsize);
+ MALLOC(copy, daddr_t *, fs->fs_bsize, M_TEMP, M_WAITOK);
+ bcopy((caddr_t)bap, (caddr_t)copy, (u_int)fs->fs_bsize);
bzero((caddr_t)&bap[last + 1],
(u_int)(NINDIR(fs) - (last + 1)) * sizeof (daddr_t));
- bwrite(bp);
- bp = copy, bap = bp->b_un.b_daddr;
+ error = bwrite(bp);
+ if (error)
+ allerror = error;
+ bap = copy;
/*
* Recursively free totally unused blocks.
nb = bap[i];
if (nb == 0)
continue;
- if (level > SINGLE)
- blocksreleased +=
- indirtrunc(ip, nb, (daddr_t)-1, level - 1);
- free(ip, nb, (int)fs->fs_bsize);
+ if (level > SINGLE) {
+ error = indirtrunc(ip, nb, (daddr_t)-1, level - 1,
+ &blkcount);
+ if (error)
+ allerror = error;
+ blocksreleased += blkcount;
+ }
+ blkfree(ip, nb, (off_t)fs->fs_bsize);
blocksreleased += nblocks;
}
if (level > SINGLE && lastbn >= 0) {
last = lastbn % factor;
nb = bap[i];
- if (nb != 0)
- blocksreleased += indirtrunc(ip, nb, last, level - 1);
+ if (nb != 0) {
+ error = indirtrunc(ip, nb, last, level - 1, &blkcount);
+ if (error)
+ allerror = error;
+ blocksreleased += blkcount;
+ }
}
- brelse(bp);
- return (blocksreleased);
+ FREE(copy, M_TEMP);
+ *countp = blocksreleased;
+ return (allerror);
}
/*
- * remove any inodes in the inode cache belonging to dev
- *
- * There should not be any active ones, return error if any are found
- * (nb: this is a user error, not a system err)
- *
- * Also, count the references to dev by block devices - this really
- * has nothing to do with the object of the procedure, but as we have
- * to scan the inode table here anyway, we might as well get the
- * extra benefit.
- *
- * this is called from sumount()/sys3.c when dev is being unmounted
+ * Lock an inode. If its already locked, set the WANT bit and sleep.
*/
-#ifdef QUOTA
-iflush(dev, iq)
- dev_t dev;
- struct inode *iq;
-#else
-iflush(dev)
- dev_t dev;
-#endif
-{
+ilock(ip)
register struct inode *ip;
- register open = 0;
+{
- for (ip = inode; ip < inodeNINODE; ip++) {
-#ifdef QUOTA
- if (ip != iq && ip->i_dev == dev)
-#else
- if (ip->i_dev == dev)
-#endif
- if (ip->i_count)
- return(-1);
- else {
- remque(ip);
- ip->i_forw = ip;
- ip->i_back = ip;
- /*
- * as i_count == 0, the inode was on the free
- * list already, just leave it there, it will
- * fall off the bottom eventually. We could
- * perhaps move it to the head of the free
- * list, but as umounts are done so
- * infrequently, we would gain very little,
- * while making the code bigger.
- */
-#ifdef QUOTA
- dqrele(ip->i_dquot);
- ip->i_dquot = NODQUOT;
-#endif
- }
- else if (ip->i_count && (ip->i_mode&IFMT)==IFBLK &&
- ip->i_rdev == dev)
- open++;
+ while (ip->i_flag & ILOCKED) {
+ ip->i_flag |= IWANT;
+ (void) sleep((caddr_t)ip, PINOD);
}
- return (open);
+ ip->i_flag |= ILOCKED;
}
/*
- * Lock an inode. If its already locked, set the WANT bit and sleep.
+ * Unlock an inode. If WANT bit is on, wakeup.
*/
-ilock(ip)
+iunlock(ip)
register struct inode *ip;
{
- ILOCK(ip);
+ if ((ip->i_flag & ILOCKED) == 0)
+ printf("unlocking unlocked inode %d on dev 0x%x\n",
+ ip->i_number, ip->i_dev);
+ ip->i_flag &= ~ILOCKED;
+ if (ip->i_flag&IWANT) {
+ ip->i_flag &= ~IWANT;
+ wakeup((caddr_t)ip);
+ }
}
/*
- * Unlock an inode. If WANT bit is on, wakeup.
+ * Check mode permission on inode pointer. Mode is READ, WRITE or EXEC.
+ * The mode is shifted to select the owner/group/other fields. The
+ * super user is granted all permissions.
+ *
+ * NB: Called from vnode op table. It seems this could all be done
+ * using vattr's but...
*/
-iunlock(ip)
+iaccess(ip, mode, cred)
register struct inode *ip;
+ register int mode;
+ struct ucred *cred;
{
+ register gid_t *gp;
+ int i;
- IUNLOCK(ip);
+ /*
+ * If you're the super-user, you always get access.
+ */
+ if (cred->cr_uid == 0)
+ return (0);
+ /*
+ * Access check is based on only one of owner, group, public.
+ * If not owner, then check group. If not a member of the
+ * group, then check public access.
+ */
+ if (cred->cr_uid != ip->i_uid) {
+ mode >>= 3;
+ gp = cred->cr_groups;
+ for (i = 0; i < cred->cr_ngroups; i++, gp++)
+ if (ip->i_gid == *gp)
+ goto found;
+ mode >>= 3;
+found:
+ ;
+ }
+ if ((ip->i_mode & mode) != 0)
+ return (0);
+ return (EACCES);
}