1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1991, 1993, 1995 5 * The Regents of the University of California. All rights reserved. 6 * (c) UNIX System Laboratories, Inc. 7 * All or some portions of this file are derived from material licensed 8 * to the University of California by American Telephone and Telegraph 9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 10 * the permission of UNIX System Laboratories, Inc. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)ufs_inode.c 8.9 (Berkeley) 5/14/95 37 */ 38 39 #include <sys/cdefs.h> 40 __FBSDID("$FreeBSD$"); 41 42 #include "opt_quota.h" 43 #include "opt_ufs.h" 44 45 #include <sys/param.h> 46 #include <sys/systm.h> 47 #include <sys/vnode.h> 48 #include <sys/lock.h> 49 #include <sys/mount.h> 50 #include <sys/malloc.h> 51 #include <sys/mutex.h> 52 53 #include <ufs/ufs/extattr.h> 54 #include <ufs/ufs/quota.h> 55 #include <ufs/ufs/inode.h> 56 #include <ufs/ufs/ufsmount.h> 57 #include <ufs/ufs/ufs_extern.h> 58 #ifdef UFS_DIRHASH 59 #include <ufs/ufs/dir.h> 60 #include <ufs/ufs/dirhash.h> 61 #endif 62 #ifdef UFS_GJOURNAL 63 #include <ufs/ufs/gjournal.h> 64 #endif 65 66 /* 67 * Last reference to an inode. If necessary, write or delete it. 68 */ 69 int 70 ufs_inactive(ap) 71 struct vop_inactive_args /* { 72 struct vnode *a_vp; 73 struct thread *a_td; 74 } */ *ap; 75 { 76 struct vnode *vp = ap->a_vp; 77 struct inode *ip = VTOI(vp); 78 mode_t mode; 79 int error = 0; 80 off_t isize; 81 struct mount *mp; 82 83 mp = NULL; 84 /* 85 * Ignore inodes related to stale file handles. 86 */ 87 if (ip->i_mode == 0) 88 goto out; 89 #ifdef UFS_GJOURNAL 90 ufs_gjournal_close(vp); 91 #endif 92 #ifdef QUOTA 93 /* 94 * Before moving off the active list, we must be sure that 95 * any modified quotas have been pushed since these will no 96 * longer be checked once the vnode is on the inactive list. 97 */ 98 qsyncvp(vp); 99 #endif 100 if ((ip->i_effnlink == 0 && DOINGSOFTDEP(vp)) || 101 (ip->i_nlink <= 0 && !UFS_RDONLY(ip))) { 102 loop: 103 if (vn_start_secondary_write(vp, &mp, V_NOWAIT) != 0) { 104 /* Cannot delete file while file system is suspended */ 105 if ((vp->v_iflag & VI_DOOMED) != 0) { 106 /* Cannot return before file is deleted */ 107 (void) vn_start_secondary_write(vp, &mp, 108 V_WAIT); 109 } else { 110 MNT_ILOCK(mp); 111 if ((mp->mnt_kern_flag & 112 (MNTK_SUSPEND2 | MNTK_SUSPENDED)) == 0) { 113 MNT_IUNLOCK(mp); 114 goto loop; 115 } 116 /* 117 * Fail to inactivate vnode now and 118 * let ffs_snapshot() clean up after 119 * it has resumed the file system. 120 */ 121 VI_LOCK(vp); 122 vp->v_iflag |= VI_OWEINACT; 123 VI_UNLOCK(vp); 124 MNT_IUNLOCK(mp); 125 return (0); 126 } 127 } 128 } 129 isize = ip->i_size; 130 if (I_IS_UFS2(ip)) 131 isize += ip->i_din2->di_extsize; 132 if (ip->i_effnlink <= 0 && isize && !UFS_RDONLY(ip)) 133 error = UFS_TRUNCATE(vp, (off_t)0, IO_EXT | IO_NORMAL, NOCRED); 134 if (ip->i_nlink <= 0 && ip->i_mode && !UFS_RDONLY(ip)) { 135 #ifdef QUOTA 136 if (!getinoquota(ip)) 137 (void)chkiq(ip, -1, NOCRED, FORCE); 138 #endif 139 #ifdef UFS_EXTATTR 140 ufs_extattr_vnode_inactive(vp, ap->a_td); 141 #endif 142 /* 143 * Setting the mode to zero needs to wait for the inode 144 * to be written just as does a change to the link count. 145 * So, rather than creating a new entry point to do the 146 * same thing, we just use softdep_change_linkcnt(). 147 */ 148 DIP_SET(ip, i_rdev, 0); 149 mode = ip->i_mode; 150 ip->i_mode = 0; 151 DIP_SET(ip, i_mode, 0); 152 ip->i_flag |= IN_CHANGE | IN_UPDATE; 153 if (DOINGSOFTDEP(vp)) 154 softdep_change_linkcnt(ip); 155 UFS_VFREE(vp, ip->i_number, mode); 156 } 157 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE)) { 158 if ((ip->i_flag & (IN_CHANGE | IN_UPDATE | IN_MODIFIED)) == 0 && 159 mp == NULL && 160 vn_start_secondary_write(vp, &mp, V_NOWAIT)) { 161 mp = NULL; 162 ip->i_flag &= ~IN_ACCESS; 163 } else { 164 if (mp == NULL) 165 (void) vn_start_secondary_write(vp, &mp, 166 V_WAIT); 167 UFS_UPDATE(vp, 0); 168 } 169 } 170 out: 171 /* 172 * If we are done with the inode, reclaim it 173 * so that it can be reused immediately. 174 */ 175 if (ip->i_mode == 0) 176 vrecycle(vp); 177 if (mp != NULL) 178 vn_finished_secondary_write(mp); 179 return (error); 180 } 181 182 void 183 ufs_prepare_reclaim(struct vnode *vp) 184 { 185 struct inode *ip; 186 #ifdef QUOTA 187 int i; 188 #endif 189 190 ip = VTOI(vp); 191 192 vnode_destroy_vobject(vp); 193 #ifdef QUOTA 194 for (i = 0; i < MAXQUOTAS; i++) { 195 if (ip->i_dquot[i] != NODQUOT) { 196 dqrele(vp, ip->i_dquot[i]); 197 ip->i_dquot[i] = NODQUOT; 198 } 199 } 200 #endif 201 #ifdef UFS_DIRHASH 202 if (ip->i_dirhash != NULL) 203 ufsdirhash_free(ip); 204 #endif 205 } 206 207 /* 208 * Reclaim an inode so that it can be used for other purposes. 209 */ 210 int 211 ufs_reclaim(ap) 212 struct vop_reclaim_args /* { 213 struct vnode *a_vp; 214 struct thread *a_td; 215 } */ *ap; 216 { 217 struct vnode *vp = ap->a_vp; 218 struct inode *ip = VTOI(vp); 219 220 ufs_prepare_reclaim(vp); 221 222 if (ip->i_flag & IN_LAZYMOD) 223 ip->i_flag |= IN_MODIFIED; 224 UFS_UPDATE(vp, 0); 225 /* 226 * Remove the inode from its hash chain. 227 */ 228 vfs_hash_remove(vp); 229 230 /* 231 * Lock the clearing of v_data so ffs_lock() can inspect it 232 * prior to obtaining the lock. 233 */ 234 VI_LOCK(vp); 235 vp->v_data = 0; 236 VI_UNLOCK(vp); 237 UFS_IFREE(ITOUMP(ip), ip); 238 return (0); 239 } 240