]> git.saurik.com Git - apple/xnu.git/blob - bsd/ufs/ufs/ufs_inode.c
0a1a1814cd4243c6d837e57844f62df0b7b14fff
[apple/xnu.git] / bsd / ufs / ufs / ufs_inode.c
1 /*
2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * The contents of this file constitute Original Code as defined in and
7 * are subject to the Apple Public Source License Version 1.1 (the
8 * "License"). You may not use this file except in compliance with the
9 * License. Please obtain a copy of the License at
10 * http://www.apple.com/publicsource and read it before using this file.
11 *
12 * This Original Code and all software distributed under the License are
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17 * License for the specific language governing rights and limitations
18 * under the License.
19 *
20 * @APPLE_LICENSE_HEADER_END@
21 */
22 /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
23 /*
24 * Copyright (c) 1991, 1993, 1995
25 * The Regents of the University of California. All rights reserved.
26 * (c) UNIX System Laboratories, Inc.
27 * All or some portions of this file are derived from material licensed
28 * to the University of California by American Telephone and Telegraph
29 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
30 * the permission of UNIX System Laboratories, Inc.
31 *
32 * Redistribution and use in source and binary forms, with or without
33 * modification, are permitted provided that the following conditions
34 * are met:
35 * 1. Redistributions of source code must retain the above copyright
36 * notice, this list of conditions and the following disclaimer.
37 * 2. Redistributions in binary form must reproduce the above copyright
38 * notice, this list of conditions and the following disclaimer in the
39 * documentation and/or other materials provided with the distribution.
40 * 3. All advertising materials mentioning features or use of this software
41 * must display the following acknowledgement:
42 * This product includes software developed by the University of
43 * California, Berkeley and its contributors.
44 * 4. Neither the name of the University nor the names of its contributors
45 * may be used to endorse or promote products derived from this software
46 * without specific prior written permission.
47 *
48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
58 * SUCH DAMAGE.
59 *
60 * @(#)ufs_inode.c 8.9 (Berkeley) 5/14/95
61 */
62
63 #include <sys/param.h>
64 #include <sys/systm.h>
65 #include <sys/proc.h>
66 #include <sys/vnode.h>
67 #include <sys/mount.h>
68 #include <sys/kernel.h>
69 #include <sys/malloc.h>
70
71 #include <ufs/ufs/quota.h>
72 #include <ufs/ufs/inode.h>
73 #include <ufs/ufs/ufsmount.h>
74 #include <ufs/ufs/ufs_extern.h>
75
76 u_long nextgennumber; /* Next generation number to assign. */
77 extern int prtactive;
78
79 /*
80 * Last reference to an inode. If necessary, write or delete it.
81 */
82 int
83 ufs_inactive(ap)
84 struct vop_inactive_args /* {
85 struct vnode *a_vp;
86 struct proc *a_p;
87 } */ *ap;
88 {
89 struct vnode *vp = ap->a_vp;
90 struct inode *ip = VTOI(vp);
91 struct proc *p = ap->a_p;
92 struct timeval tv;
93 int mode, error = 0;
94 extern int prtactive;
95
96 if (prtactive && vp->v_usecount != 0)
97 vprint("ffs_inactive: pushing active", vp);
98
99 /*
100 * Ignore inodes related to stale file handles.
101 */
102 if (ip->i_mode == 0)
103 goto out;
104 if (ip->i_nlink <= 0 && (vp->v_mount->mnt_flag & MNT_RDONLY) == 0) {
105 #if QUOTA
106 if (!getinoquota(ip))
107 (void)chkiq(ip, -1, NOCRED, 0);
108 #endif
109 error = VOP_TRUNCATE(vp, (off_t)0, 0, NOCRED, p);
110 ip->i_rdev = 0;
111 mode = ip->i_mode;
112 ip->i_mode = 0;
113 ip->i_flag |= IN_CHANGE | IN_UPDATE;
114 VOP_VFREE(vp, ip->i_number, mode);
115 }
116 if (ip->i_flag & (IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE)) {
117 tv = time;
118 VOP_UPDATE(vp, &tv, &tv, 0);
119 }
120 out:
121 VOP_UNLOCK(vp, 0, p);
122 /*
123 * If we are done with the inode, reclaim it
124 * so that it can be reused immediately.
125 */
126 if (ip->i_mode == 0)
127 vrecycle(vp, (struct slock *)0, p);
128 return (error);
129 }
130
131 /*
132 * Reclaim an inode so that it can be used for other purposes.
133 */
134 int
135 ufs_reclaim(vp, p)
136 struct vnode *vp;
137 struct proc *p;
138 {
139 register struct inode *ip;
140 int i;
141 extern int prtactive;
142
143 if (prtactive && vp->v_usecount != 0)
144 vprint("ufs_reclaim: pushing active", vp);
145 /*
146 * Remove the inode from its hash chain.
147 */
148 ip = VTOI(vp);
149 ufs_ihashrem(ip);
150 /*
151 * Purge old data structures associated with the inode.
152 */
153 cache_purge(vp);
154 if (ip->i_devvp) {
155 vrele(ip->i_devvp);
156 ip->i_devvp = 0;
157 }
158 #if QUOTA
159 for (i = 0; i < MAXQUOTAS; i++) {
160 if (ip->i_dquot[i] != NODQUOT) {
161 dqrele(vp, ip->i_dquot[i]);
162 ip->i_dquot[i] = NODQUOT;
163 }
164 }
165 #endif
166 return (0);
167 }