1 /* 2 * Copyright (c) 1991, 1993, 1995 3 * The Regents of the University of California. All rights reserved. 4 * (c) UNIX System Laboratories, Inc. 5 * All or some portions of this file are derived from material licensed 6 * to the University of California by American Telephone and Telegraph 7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 8 * the permission of UNIX System Laboratories, Inc. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)ufs_inode.c 8.9 (Berkeley) 5/14/95 39 * $FreeBSD: src/sys/ufs/ufs/ufs_inode.c,v 1.25.2.3 2002/07/05 22:42:31 dillon Exp $ 40 * $DragonFly: src/sys/vfs/ufs/ufs_inode.c,v 1.15 2005/09/29 20:20:59 dillon Exp $ 41 */ 42 43 #include "opt_quota.h" 44 #include "opt_ufs.h" 45 46 #include <sys/param.h> 47 #include <sys/systm.h> 48 #include <sys/vnode.h> 49 #include <sys/mount.h> 50 #include <sys/malloc.h> 51 52 #include "quota.h" 53 #include "inode.h" 54 #include "ufsmount.h" 55 #include "ufs_extern.h" 56 #ifdef UFS_DIRHASH 57 #include "dir.h" 58 #include "dirhash.h" 59 #endif 60 61 int prtactive = 0; /* 1 => print out reclaim of active vnodes */ 62 63 /* 64 * Last reference to an inode. If necessary, write or delete it. 65 * 66 * ufs_inactive(struct vnode *a_vp, struct thread *a_td) 67 */ 68 int 69 ufs_inactive(struct vop_inactive_args *ap) 70 { 71 struct vnode *vp = ap->a_vp; 72 struct inode *ip = VTOI(vp); 73 struct thread *td = ap->a_td; 74 int mode, error = 0; 75 76 if (prtactive && vp->v_usecount != 1) 77 vprint("ufs_inactive: pushing active", vp); 78 79 /* 80 * Ignore inodes related to stale file handles. 81 */ 82 if (ip == NULL || ip->i_mode == 0) 83 goto out; 84 if (ip->i_nlink <= 0 && (vp->v_mount->mnt_flag & MNT_RDONLY) == 0) { 85 #ifdef QUOTA 86 if (!getinoquota(ip)) 87 (void)chkiq(ip, -1, NOCRED, FORCE); 88 #endif 89 error = UFS_TRUNCATE(vp, (off_t)0, 0, NOCRED, td); 90 ip->i_rdev = 0; 91 mode = ip->i_mode; 92 ip->i_mode = 0; 93 ip->i_flag |= IN_CHANGE | IN_UPDATE; 94 UFS_VFREE(vp, ip->i_number, mode); 95 } 96 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE)) 97 UFS_UPDATE(vp, 0); 98 out: 99 /* 100 * If we are done with the inode, reclaim it 101 * so that it can be reused immediately. 102 */ 103 if (ip == NULL || ip->i_mode == 0) 104 vrecycle(vp, td); 105 return (error); 106 } 107 108 /* 109 * Reclaim an inode so that it can be used for other purposes. 110 * 111 * ufs_reclaim(struct vnode *a_vp, struct thread *a_td) 112 */ 113 int 114 ufs_reclaim(struct vop_reclaim_args *ap) 115 { 116 struct inode *ip; 117 struct vnode *vp = ap->a_vp; 118 #ifdef QUOTA 119 int i; 120 #endif 121 122 if (prtactive && vp->v_usecount != 1) 123 vprint("ufs_reclaim: pushing active", vp); 124 ip = VTOI(vp); 125 126 /* 127 * Lazy updates. 128 */ 129 if (ip) { 130 if (ap->a_retflags & NCF_FSMID) { 131 ++ip->i_fsmid; 132 ip->i_flag |= IN_LAZYMOD; 133 } 134 if (ip->i_flag & IN_LAZYMOD) { 135 ip->i_flag |= IN_MODIFIED; 136 UFS_UPDATE(vp, 0); 137 } 138 } 139 #ifdef INVARIANTS 140 if (ip && (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE))) { 141 printf("WARNING: INODE %ld flags %08x: modified inode being released!\n", (long)ip->i_number, (int)ip->i_flag); 142 ip->i_flag |= IN_MODIFIED; 143 UFS_UPDATE(vp, 0); 144 } 145 #endif 146 /* 147 * Remove the inode from its hash chain and purge namecache 148 * data associated with the vnode. 149 */ 150 vp->v_data = NULL; 151 if (ip) { 152 ufs_ihashrem(ip); 153 if (ip->i_devvp) { 154 vrele(ip->i_devvp); 155 ip->i_devvp = 0; 156 } 157 #ifdef QUOTA 158 for (i = 0; i < MAXQUOTAS; i++) { 159 if (ip->i_dquot[i] != NODQUOT) { 160 dqrele(vp, ip->i_dquot[i]); 161 ip->i_dquot[i] = NODQUOT; 162 } 163 } 164 #endif 165 #ifdef UFS_DIRHASH 166 if (ip->i_dirhash != NULL) 167 ufsdirhash_free(ip); 168 #endif 169 free(ip, VFSTOUFS(vp->v_mount)->um_malloctype); 170 } 171 return (0); 172 } 173