lfs_alloc.c revision 1.13
1 /* $NetBSD: lfs_alloc.c,v 1.13 1998/06/09 07:46:33 scottr Exp $ */ 2 3 /* 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)lfs_alloc.c 8.4 (Berkeley) 1/4/94 36 */ 37 38 #if defined(_KERNEL) && !defined(_LKM) 39 #include "opt_quota.h" 40 #endif 41 42 #include <sys/param.h> 43 #include <sys/systm.h> 44 #include <sys/kernel.h> 45 #include <sys/buf.h> 46 #include <sys/vnode.h> 47 #include <sys/syslog.h> 48 #include <sys/mount.h> 49 #include <sys/malloc.h> 50 51 #include <vm/vm.h> 52 53 #include <ufs/ufs/quota.h> 54 #include <ufs/ufs/inode.h> 55 #include <ufs/ufs/ufsmount.h> 56 #include <ufs/ufs/ufs_extern.h> 57 58 #include <ufs/lfs/lfs.h> 59 #include <ufs/lfs/lfs_extern.h> 60 61 /* Allocate a new inode. */ 62 /* ARGSUSED */ 63 int 64 lfs_valloc(v) 65 void *v; 66 { 67 struct vop_valloc_args /* { 68 struct vnode *a_pvp; 69 int a_mode; 70 struct ucred *a_cred; 71 struct vnode **a_vpp; 72 } */ *ap = v; 73 struct lfs *fs; 74 struct buf *bp; 75 struct ifile *ifp; 76 struct inode *ip; 77 struct vnode *vp; 78 ufs_daddr_t blkno; 79 ino_t new_ino; 80 u_long i, max; 81 int error; 82 83 /* Get the head of the freelist. */ 84 fs = VTOI(ap->a_pvp)->i_lfs; 85 new_ino = fs->lfs_free; 86 #ifdef ALLOCPRINT 87 printf("lfs_ialloc: allocate inode %d\n", new_ino); 88 #endif 89 90 /* 91 * Remove the inode from the free list and write the new start 92 * of the free list into the superblock. 93 */ 94 LFS_IENTRY(ifp, fs, new_ino, bp); 95 if (ifp->if_daddr != LFS_UNUSED_DADDR) 96 panic("lfs_ialloc: inuse inode on the free list"); 97 fs->lfs_free = ifp->if_nextfree; 98 brelse(bp); 99 100 /* Extend IFILE so that the next lfs_valloc will succeed. */ 101 if (fs->lfs_free == LFS_UNUSED_INUM) { 102 vp = fs->lfs_ivnode; 103 ip = VTOI(vp); 104 blkno = lblkno(fs, ip->i_ffs_size); 105 lfs_balloc(vp, 0, fs->lfs_bsize, blkno, &bp); 106 ip->i_ffs_size += fs->lfs_bsize; 107 #ifdef UVM 108 uvm_vnp_setsize(vp, ip->i_ffs_size); 109 (void)uvm_vnp_uncache(vp); 110 #else 111 vnode_pager_setsize(vp, ip->i_ffs_size); 112 vnode_pager_uncache(vp); 113 #endif 114 115 i = (blkno - fs->lfs_segtabsz - fs->lfs_cleansz) * 116 fs->lfs_ifpb; 117 fs->lfs_free = i; 118 max = i + fs->lfs_ifpb; 119 for (ifp = (struct ifile *)bp->b_data; i < max; ++ifp) { 120 ifp->if_version = 1; 121 ifp->if_daddr = LFS_UNUSED_DADDR; 122 ifp->if_nextfree = ++i; 123 } 124 ifp--; 125 ifp->if_nextfree = LFS_UNUSED_INUM; 126 if ((error = VOP_BWRITE(bp)) != 0) 127 return (error); 128 } 129 130 /* Create a vnode to associate with the inode. */ 131 if ((error = lfs_vcreate(ap->a_pvp->v_mount, new_ino, &vp)) != 0) 132 return (error); 133 134 135 ip = VTOI(vp); 136 /* Zero out the direct and indirect block addresses. */ 137 bzero(&ip->i_din.ffs_din, sizeof(struct dinode)); 138 ip->i_din.ffs_din.di_inumber = new_ino; 139 140 /* Set a new generation number for this inode. */ 141 ip->i_ffs_gen++; 142 143 /* Insert into the inode hash table. */ 144 ufs_ihashins(ip); 145 146 error = ufs_vinit(vp->v_mount, lfs_specop_p, LFS_FIFOOPS, &vp); 147 if (error) { 148 vput(vp); 149 *ap->a_vpp = NULL; 150 return (error); 151 } 152 153 *ap->a_vpp = vp; 154 vp->v_flag |= VDIROP; 155 VREF(ip->i_devvp); 156 157 /* Set superblock modified bit and increment file count. */ 158 fs->lfs_fmod = 1; 159 ++fs->lfs_nfiles; 160 return (0); 161 } 162 163 /* Create a new vnode/inode pair and initialize what fields we can. */ 164 int 165 lfs_vcreate(mp, ino, vpp) 166 struct mount *mp; 167 ino_t ino; 168 struct vnode **vpp; 169 { 170 extern int (**lfs_vnodeop_p) __P((void *)); 171 struct inode *ip; 172 struct ufsmount *ump; 173 int error; 174 #ifdef QUOTA 175 int i; 176 #endif 177 178 /* Create the vnode. */ 179 if ((error = getnewvnode(VT_LFS, mp, lfs_vnodeop_p, vpp)) != 0) { 180 *vpp = NULL; 181 return (error); 182 } 183 184 /* Get a pointer to the private mount structure. */ 185 ump = VFSTOUFS(mp); 186 187 /* Initialize the inode. */ 188 MALLOC(ip, struct inode *, sizeof(struct inode), M_LFSNODE, M_WAITOK); 189 lockinit(&ip->i_lock, PINOD, "lfsinode", 0, 0); 190 (*vpp)->v_data = ip; 191 ip->i_vnode = *vpp; 192 ip->i_devvp = ump->um_devvp; 193 ip->i_flag = IN_MODIFIED; 194 ip->i_dev = ump->um_dev; 195 ip->i_number = ip->i_din.ffs_din.di_inumber = ino; 196 ip->i_lfs = ump->um_lfs; 197 #ifdef QUOTA 198 for (i = 0; i < MAXQUOTAS; i++) 199 ip->i_dquot[i] = NODQUOT; 200 #endif 201 ip->i_lockf = 0; 202 ip->i_diroff = 0; 203 ip->i_ffs_mode = 0; 204 ip->i_ffs_size = 0; 205 ip->i_ffs_blocks = 0; 206 ++ump->um_lfs->lfs_uinodes; 207 return (0); 208 } 209 210 /* Free an inode. */ 211 /* ARGUSED */ 212 int 213 lfs_vfree(v) 214 void *v; 215 { 216 struct vop_vfree_args /* { 217 struct vnode *a_pvp; 218 ino_t a_ino; 219 int a_mode; 220 } */ *ap = v; 221 SEGUSE *sup; 222 struct buf *bp; 223 struct ifile *ifp; 224 struct inode *ip; 225 struct lfs *fs; 226 ufs_daddr_t old_iaddr; 227 ino_t ino; 228 229 /* Get the inode number and file system. */ 230 ip = VTOI(ap->a_pvp); 231 fs = ip->i_lfs; 232 ino = ip->i_number; 233 if (ip->i_flag & IN_MODIFIED) { 234 --fs->lfs_uinodes; 235 ip->i_flag &= 236 ~(IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE); 237 } 238 /* 239 * Set the ifile's inode entry to unused, increment its version number 240 * and link it into the free chain. 241 */ 242 LFS_IENTRY(ifp, fs, ino, bp); 243 old_iaddr = ifp->if_daddr; 244 ifp->if_daddr = LFS_UNUSED_DADDR; 245 ++ifp->if_version; 246 ifp->if_nextfree = fs->lfs_free; 247 fs->lfs_free = ino; 248 (void) VOP_BWRITE(bp); 249 250 if (old_iaddr != LFS_UNUSED_DADDR) { 251 LFS_SEGENTRY(sup, fs, datosn(fs, old_iaddr), bp); 252 #ifdef DIAGNOSTIC 253 if (sup->su_nbytes < sizeof(struct dinode)) 254 panic("lfs_vfree: negative byte count (segment %d)\n", 255 datosn(fs, old_iaddr)); 256 #endif 257 sup->su_nbytes -= sizeof(struct dinode); 258 (void) VOP_BWRITE(bp); 259 } 260 261 /* Set superblock modified bit and decrement file count. */ 262 fs->lfs_fmod = 1; 263 --fs->lfs_nfiles; 264 return (0); 265 } 266
Indexes created Mon Sep 22 13:09:51 GMT 2025