/*
- * Copyright (c) 1982, 1986, 1989 Regents of the University of California.
- * All rights reserved.
+ * Copyright (c) 1991, 1993, 1995
+ * The Regents of the University of California. All rights reserved.
*
- * %sccs.include.redist.c%
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ * must display the following acknowledgement:
+ * This product includes software developed by the University of
+ * California, Berkeley and its contributors.
+ * 4. Neither the name of the University nor the names of its contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
*
- * @(#)lfs_alloc.c 7.29 (Berkeley) %G%
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ * @(#)lfs_alloc.c 8.7 (Berkeley) 5/14/95
*/
-#include "param.h"
-#include "kernel.h"
-#include "buf.h"
-#include "vnode.h"
-#include "syslog.h"
-#include "../ufs/quota.h"
-#include "../ufs/inode.h"
-#include "mount.h"
-#include "../ufs/ufsmount.h"
-#include "lfs.h"
-#include "lfs_extern.h"
-
-#define LFS_IENTRY(I, F, IN, BP) \
- if (bread((F)->lfs_ivnode, (IN) / IFPB(F) + (F)->lfs_segtabsz, \
- (F)->lfs_bsize, NOCRED, &BP)) \
- panic("ifile read"); \
- (I) = (IFILE *)BP->b_un.b_addr + IN % IFPB(F);
-
-ino_t
-lfs_ialloc(fs, pip, ipp, cred)
- LFS *fs;
- INODE *pip, **ipp;
- UCRED *cred;
+#include <sys/param.h>
+#include <sys/kernel.h>
+#include <sys/buf.h>
+#include <sys/vnode.h>
+#include <sys/syslog.h>
+#include <sys/mount.h>
+#include <sys/malloc.h>
+
+#include <vm/vm.h>
+
+#include <ufs/ufs/quota.h>
+#include <ufs/ufs/inode.h>
+#include <ufs/ufs/ufsmount.h>
+#include <ufs/ufs/ufs_extern.h>
+
+#include <ufs/lfs/lfs.h>
+#include <ufs/lfs/lfs_extern.h>
+
+extern u_long nextgennumber;
+
+/* Allocate a new inode. */
+/* ARGSUSED */
+int
+lfs_valloc(ap)
+ struct vop_valloc_args /* {
+ struct vnode *a_pvp;
+ int a_mode;
+ struct ucred *a_cred;
+ struct vnode **a_vpp;
+ } */ *ap;
{
- BUF *bp;
- IFILE *ifp;
- INODE *ip;
- VNODE *vp;
+ struct lfs *fs;
+ struct buf *bp;
+ struct ifile *ifp;
+ struct inode *ip;
+ struct vnode *vp;
+ ufs_daddr_t blkno;
ino_t new_ino;
+ u_long i, max;
int error;
+ /* Get the head of the freelist. */
+ fs = VTOI(ap->a_pvp)->i_lfs;
new_ino = fs->lfs_free;
-printf("lfs_ialloc: next free %d\n", new_ino);
- if (new_ino == LFS_UNUSED_INUM) { /* XXX -- allocate more */
- uprintf("\n%s: no inodes left\n", fs->lfs_fsmnt);
- log(LOG_ERR, "uid %d on %s: out of inodes\n",
- cred->cr_uid, fs->lfs_fsmnt);
- return (ENOSPC);
- }
+#ifdef ALLOCPRINT
+ printf("lfs_ialloc: allocate inode %d\n", new_ino);
+#endif
- /* Read the appropriate block from the ifile */
- vp = fs->lfs_ivnode;
+ /*
+ * Remove the inode from the free list and write the new start
+ * of the free list into the superblock.
+ */
LFS_IENTRY(ifp, fs, new_ino, bp);
-
if (ifp->if_daddr != LFS_UNUSED_DADDR)
- panic("lfs_ialloc: corrupt free list");
-
- /* Remove from free list, set the access time. */
+ panic("lfs_ialloc: inuse inode on the free list");
fs->lfs_free = ifp->if_nextfree;
- ifp->if_st_atime = time.tv_sec;
brelse(bp);
- error = lfs_vcreate(ITOV(pip)->v_mount, new_ino, &vp);
- if (error)
+ /* Extend IFILE so that the next lfs_valloc will succeed. */
+ if (fs->lfs_free == LFS_UNUSED_INUM) {
+ vp = fs->lfs_ivnode;
+ ip = VTOI(vp);
+ blkno = lblkno(fs, ip->i_size);
+ lfs_balloc(vp, 0, fs->lfs_bsize, blkno, &bp);
+ ip->i_size += fs->lfs_bsize;
+ vnode_pager_setsize(vp, (u_long)ip->i_size);
+ vnode_pager_uncache(vp);
+
+ i = (blkno - fs->lfs_segtabsz - fs->lfs_cleansz) *
+ fs->lfs_ifpb;
+ fs->lfs_free = i;
+ max = i + fs->lfs_ifpb;
+ for (ifp = (struct ifile *)bp->b_data; i < max; ++ifp) {
+ ifp->if_version = 1;
+ ifp->if_daddr = LFS_UNUSED_DADDR;
+ ifp->if_nextfree = ++i;
+ }
+ ifp--;
+ ifp->if_nextfree = LFS_UNUSED_INUM;
+ if (error = VOP_BWRITE(bp))
+ return (error);
+ }
+
+ /* Create a vnode to associate with the inode. */
+ if (error = lfs_vcreate(ap->a_pvp->v_mount, new_ino, &vp))
return (error);
+
ip = VTOI(vp);
- VREF(ip->i_devvp);
+ /* Zero out the direct and indirect block addresses. */
+ bzero(&ip->i_din, sizeof(struct dinode));
+ ip->i_din.di_inumber = new_ino;
- /*
- * Set up a new generation number for this inode.
- */
+ /* Set a new generation number for this inode. */
if (++nextgennumber < (u_long)time.tv_sec)
nextgennumber = time.tv_sec;
ip->i_gen = nextgennumber;
- lfs_hqueue(ip);
+ /* Insert into the inode hash table. */
+ ufs_ihashins(ip);
- *ipp = ip;
- return (0);
-}
-
-void
-lfs_ifree(ip)
- INODE *ip;
-{
- BUF *bp;
- IFILE *ifp;
- LFS *fs;
- ino_t ino;
+ if (error = ufs_vinit(vp->v_mount, lfs_specop_p, LFS_FIFOOPS, &vp)) {
+ vput(vp);
+ *ap->a_vpp = NULL;
+ return (error);
+ }
-printf("lfs_ifree: free %d\n", ip->i_number);
- fs = ip->i_lfs;
- ino = ip->i_number;
- LFS_IENTRY(ifp, fs, ino, bp);
+ *ap->a_vpp = vp;
+ vp->v_flag |= VDIROP;
+ VREF(ip->i_devvp);
- ifp->if_daddr = LFS_UNUSED_DADDR;
- ++ifp->if_version;
- ifp->if_nextfree = fs->lfs_free;
- brelse(bp);
- fs->lfs_free = ino;
+ /* Set superblock modified bit and increment file count. */
fs->lfs_fmod = 1;
+ ++fs->lfs_nfiles;
+ return (0);
}
-daddr_t
-itod(fs, ino)
- LFS *fs;
- ino_t ino;
-{
- BUF *bp;
- IFILE *ifp;
- daddr_t iaddr;
-
-printf("itod: ino %d\n", ino);
- LFS_IENTRY(ifp, fs, ino, bp);
-
- if (ifp->if_daddr == LFS_UNUSED_DADDR)
- panic("itod: unused daddr");
- iaddr = ifp->if_daddr;
- brelse(bp);
- return (iaddr);
-}
-
-DINODE *
-lfs_ifind(fs, ino, page)
- LFS *fs;
- ino_t ino;
- void *page;
-{
- register DINODE *dip;
- register int cnt;
-
-printf("lfs_ifind: inode %d\n", ino);
- dip = page;
- for (cnt = INOPB(fs); cnt--; ++dip)
- if (dip->di_inum == ino)
- return (dip);
-
- (void)printf("lfs_ifind: dinode %u not found", ino);
- panic("lfs_ifind: inode not found");
- /* NOTREACHED */
-}
-
-/*
- * Create a new vnode/inode and initialize the fields we can.
- */
+/* Create a new vnode/inode pair and initialize what fields we can. */
+int
lfs_vcreate(mp, ino, vpp)
- MOUNT *mp;
+ struct mount *mp;
ino_t ino;
- VNODE **vpp;
+ struct vnode **vpp;
{
- INODE *ip;
- UFSMOUNT *ump;
+ extern int (**lfs_vnodeop_p)();
+ struct inode *ip;
+ struct ufsmount *ump;
int error, i;
-printf("lfs_vcreate: ino %d\n", ino);
- error = getnewvnode(VT_LFS, mp, &lfs_vnodeops, vpp);
- if (error)
- return(error);
+ /* Create the vnode. */
+ if (error = getnewvnode(VT_LFS, mp, lfs_vnodeop_p, vpp)) {
+ *vpp = NULL;
+ return (error);
+ }
+ /* Get a pointer to the private mount structure. */
ump = VFSTOUFS(mp);
/* Initialize the inode. */
- ip = VTOI(*vpp);
- ip->i_diroff = 0;
+ MALLOC(ip, struct inode *, sizeof(struct inode), M_LFSNODE, M_WAITOK);
+ lockinit(&ip->i_lock, PINOD, "lfsinode", 0, 0);
+ (*vpp)->v_data = ip;
+ ip->i_vnode = *vpp;
ip->i_devvp = ump->um_devvp;
+ ip->i_flag = IN_MODIFIED;
ip->i_dev = ump->um_dev;
- ip->i_flag = 0;
+ ip->i_number = ip->i_din.di_inumber = ino;
ip->i_lfs = ump->um_lfs;
- ip->i_lockf = 0;
- ip->i_mode = 0;
- ip->i_number = ip->i_din.di_inum = ino;
- ip->i_vnode = *vpp;
#ifdef QUOTA
for (i = 0; i < MAXQUOTAS; i++)
ip->i_dquot[i] = NODQUOT;
#endif
+ ip->i_lockf = 0;
+ ip->i_diroff = 0;
+ ip->i_mode = 0;
+ ip->i_size = 0;
+ ip->i_blocks = 0;
+ ++ump->um_lfs->lfs_uinodes;
return (0);
}
-/*
- * Return the current version number for a specific inode.
- */
-u_long
-lfs_getversion(fs, ino)
- LFS *fs;
- ino_t ino;
+/* Free an inode. */
+/* ARGUSED */
+int
+lfs_vfree(ap)
+ struct vop_vfree_args /* {
+ struct vnode *a_pvp;
+ ino_t a_ino;
+ int a_mode;
+ } */ *ap;
{
- IFILE *ifp;
- BUF *bp;
- int version;
+ SEGUSE *sup;
+ struct buf *bp;
+ struct ifile *ifp;
+ struct inode *ip;
+ struct lfs *fs;
+ ufs_daddr_t old_iaddr;
+ ino_t ino;
-printf("lfs_getversion: %d\n", ino);
+ /* Get the inode number and file system. */
+ ip = VTOI(ap->a_pvp);
+ fs = ip->i_lfs;
+ ino = ip->i_number;
+ if (ip->i_flag & IN_MODIFIED) {
+ --fs->lfs_uinodes;
+ ip->i_flag &=
+ ~(IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE);
+ }
+ /*
+ * Set the ifile's inode entry to unused, increment its version number
+ * and link it into the free chain.
+ */
LFS_IENTRY(ifp, fs, ino, bp);
- version = ifp->if_version;
- brelse(bp);
- return(version);
+ old_iaddr = ifp->if_daddr;
+ ifp->if_daddr = LFS_UNUSED_DADDR;
+ ++ifp->if_version;
+ ifp->if_nextfree = fs->lfs_free;
+ fs->lfs_free = ino;
+ (void) VOP_BWRITE(bp);
+
+ if (old_iaddr != LFS_UNUSED_DADDR) {
+ LFS_SEGENTRY(sup, fs, datosn(fs, old_iaddr), bp);
+#ifdef DIAGNOSTIC
+ if (sup->su_nbytes < sizeof(struct dinode))
+ panic("lfs_vfree: negative byte count (segment %d)\n",
+ datosn(fs, old_iaddr));
+#endif
+ sup->su_nbytes -= sizeof(struct dinode);
+ (void) VOP_BWRITE(bp);
+ }
+
+ /* Set superblock modified bit and decrement file count. */
+ fs->lfs_fmod = 1;
+ --fs->lfs_nfiles;
+ return (0);
}