nfs_node.c revision 1.1.1.3 1 1.1 cgd /*
2 1.1.1.2 fvdl * Copyright (c) 1989, 1993
3 1.1.1.2 fvdl * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Rick Macklem at The University of Guelph.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd *
36 1.1.1.3 fvdl * @(#)nfs_node.c 8.6 (Berkeley) 5/22/95
37 1.1 cgd */
38 1.1 cgd
39 1.1.1.3 fvdl
40 1.1.1.2 fvdl #include <sys/param.h>
41 1.1.1.2 fvdl #include <sys/systm.h>
42 1.1.1.2 fvdl #include <sys/proc.h>
43 1.1.1.2 fvdl #include <sys/mount.h>
44 1.1.1.2 fvdl #include <sys/namei.h>
45 1.1.1.2 fvdl #include <sys/vnode.h>
46 1.1.1.2 fvdl #include <sys/kernel.h>
47 1.1.1.2 fvdl #include <sys/malloc.h>
48 1.1.1.2 fvdl
49 1.1.1.2 fvdl #include <nfs/rpcv2.h>
50 1.1.1.3 fvdl #include <nfs/nfsproto.h>
51 1.1.1.2 fvdl #include <nfs/nfs.h>
52 1.1.1.2 fvdl #include <nfs/nfsnode.h>
53 1.1.1.2 fvdl #include <nfs/nfsmount.h>
54 1.1.1.2 fvdl #include <nfs/nqnfs.h>
55 1.1.1.2 fvdl
56 1.1.1.3 fvdl LIST_HEAD(nfsnodehashhead, nfsnode) *nfsnodehashtbl;
57 1.1.1.3 fvdl u_long nfsnodehash;
58 1.1 cgd
59 1.1 cgd #define TRUE 1
60 1.1 cgd #define FALSE 0
61 1.1 cgd
62 1.1 cgd /*
63 1.1 cgd * Initialize hash links for nfsnodes
64 1.1 cgd * and build nfsnode free list.
65 1.1 cgd */
66 1.1.1.3 fvdl void
67 1.1 cgd nfs_nhinit()
68 1.1 cgd {
69 1.1 cgd
70 1.1 cgd #ifndef lint
71 1.1.1.2 fvdl if ((sizeof(struct nfsnode) - 1) & sizeof(struct nfsnode))
72 1.1.1.2 fvdl printf("nfs_nhinit: bad size %d\n", sizeof(struct nfsnode));
73 1.1 cgd #endif /* not lint */
74 1.1.1.3 fvdl nfsnodehashtbl = hashinit(desiredvnodes, M_NFSNODE, &nfsnodehash);
75 1.1 cgd }
76 1.1 cgd
77 1.1 cgd /*
78 1.1 cgd * Compute an entry in the NFS hash table structure
79 1.1 cgd */
80 1.1.1.3 fvdl u_long
81 1.1.1.3 fvdl nfs_hash(fhp, fhsize)
82 1.1.1.3 fvdl register nfsfh_t *fhp;
83 1.1.1.3 fvdl int fhsize;
84 1.1 cgd {
85 1.1 cgd register u_char *fhpp;
86 1.1 cgd register u_long fhsum;
87 1.1.1.3 fvdl register int i;
88 1.1 cgd
89 1.1 cgd fhpp = &fhp->fh_bytes[0];
90 1.1 cgd fhsum = 0;
91 1.1.1.3 fvdl for (i = 0; i < fhsize; i++)
92 1.1 cgd fhsum += *fhpp++;
93 1.1.1.3 fvdl return (fhsum);
94 1.1 cgd }
95 1.1 cgd
96 1.1 cgd /*
97 1.1 cgd * Look up a vnode/nfsnode by file handle.
98 1.1 cgd * Callers must check for mount points!!
99 1.1 cgd * In all cases, a pointer to a
100 1.1 cgd * nfsnode structure is returned.
101 1.1 cgd */
102 1.1.1.3 fvdl int
103 1.1.1.3 fvdl nfs_nget(mntp, fhp, fhsize, npp)
104 1.1 cgd struct mount *mntp;
105 1.1.1.3 fvdl register nfsfh_t *fhp;
106 1.1.1.3 fvdl int fhsize;
107 1.1 cgd struct nfsnode **npp;
108 1.1 cgd {
109 1.1.1.3 fvdl struct proc *p = curproc; /* XXX */
110 1.1.1.3 fvdl struct nfsnode *np;
111 1.1.1.3 fvdl struct nfsnodehashhead *nhpp;
112 1.1 cgd register struct vnode *vp;
113 1.1.1.2 fvdl extern int (**nfsv2_vnodeop_p)();
114 1.1 cgd struct vnode *nvp;
115 1.1 cgd int error;
116 1.1 cgd
117 1.1.1.3 fvdl nhpp = NFSNOHASH(nfs_hash(fhp, fhsize));
118 1.1 cgd loop:
119 1.1.1.3 fvdl for (np = nhpp->lh_first; np != 0; np = np->n_hash.le_next) {
120 1.1.1.3 fvdl if (mntp != NFSTOV(np)->v_mount || np->n_fhsize != fhsize ||
121 1.1.1.3 fvdl bcmp((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize))
122 1.1 cgd continue;
123 1.1 cgd vp = NFSTOV(np);
124 1.1.1.3 fvdl if (vget(vp, LK_EXCLUSIVE, p))
125 1.1 cgd goto loop;
126 1.1 cgd *npp = np;
127 1.1 cgd return(0);
128 1.1 cgd }
129 1.1.1.3 fvdl error = getnewvnode(VT_NFS, mntp, nfsv2_vnodeop_p, &nvp);
130 1.1.1.3 fvdl if (error) {
131 1.1 cgd *npp = 0;
132 1.1 cgd return (error);
133 1.1 cgd }
134 1.1 cgd vp = nvp;
135 1.1.1.2 fvdl MALLOC(np, struct nfsnode *, sizeof *np, M_NFSNODE, M_WAITOK);
136 1.1.1.3 fvdl bzero((caddr_t)np, sizeof *np);
137 1.1.1.2 fvdl vp->v_data = np;
138 1.1 cgd np->n_vnode = vp;
139 1.1 cgd /*
140 1.1 cgd * Insert the nfsnode in the hash queue for its new file handle
141 1.1 cgd */
142 1.1.1.3 fvdl LIST_INSERT_HEAD(nhpp, np, n_hash);
143 1.1.1.3 fvdl if (fhsize > NFS_SMALLFH) {
144 1.1.1.3 fvdl MALLOC(np->n_fhp, nfsfh_t *, fhsize, M_NFSBIGFH, M_WAITOK);
145 1.1.1.3 fvdl } else
146 1.1.1.3 fvdl np->n_fhp = &np->n_fh;
147 1.1.1.3 fvdl bcopy((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize);
148 1.1.1.3 fvdl np->n_fhsize = fhsize;
149 1.1 cgd *npp = np;
150 1.1 cgd return (0);
151 1.1 cgd }
152 1.1 cgd
153 1.1.1.3 fvdl int
154 1.1.1.2 fvdl nfs_inactive(ap)
155 1.1.1.2 fvdl struct vop_inactive_args /* {
156 1.1.1.2 fvdl struct vnode *a_vp;
157 1.1.1.3 fvdl struct proc *a_p;
158 1.1.1.2 fvdl } */ *ap;
159 1.1 cgd {
160 1.1 cgd register struct nfsnode *np;
161 1.1 cgd register struct sillyrename *sp;
162 1.1.1.2 fvdl struct proc *p = curproc; /* XXX */
163 1.1 cgd extern int prtactive;
164 1.1 cgd
165 1.1.1.2 fvdl np = VTONFS(ap->a_vp);
166 1.1.1.2 fvdl if (prtactive && ap->a_vp->v_usecount != 0)
167 1.1.1.2 fvdl vprint("nfs_inactive: pushing active", ap->a_vp);
168 1.1.1.3 fvdl if (ap->a_vp->v_type != VDIR)
169 1.1.1.3 fvdl sp = np->n_sillyrename;
170 1.1.1.3 fvdl else
171 1.1.1.3 fvdl sp = (struct sillyrename *)0;
172 1.1 cgd np->n_sillyrename = (struct sillyrename *)0;
173 1.1 cgd if (sp) {
174 1.1 cgd /*
175 1.1 cgd * Remove the silly file that was rename'd earlier
176 1.1 cgd */
177 1.1.1.2 fvdl (void) nfs_vinvalbuf(ap->a_vp, 0, sp->s_cred, p, 1);
178 1.1.1.2 fvdl nfs_removeit(sp);
179 1.1 cgd crfree(sp->s_cred);
180 1.1 cgd vrele(sp->s_dvp);
181 1.1.1.3 fvdl FREE((caddr_t)sp, M_NFSREQ);
182 1.1.1.2 fvdl }
183 1.1.1.2 fvdl np->n_flag &= (NMODIFIED | NFLUSHINPROG | NFLUSHWANT | NQNFSEVICTED |
184 1.1.1.2 fvdl NQNFSNONCACHE | NQNFSWRITE);
185 1.1.1.3 fvdl VOP_UNLOCK(ap->a_vp, 0, ap->a_p);
186 1.1 cgd return (0);
187 1.1 cgd }
188 1.1 cgd
189 1.1 cgd /*
190 1.1 cgd * Reclaim an nfsnode so that it can be used for other purposes.
191 1.1 cgd */
192 1.1.1.3 fvdl int
193 1.1.1.2 fvdl nfs_reclaim(ap)
194 1.1.1.2 fvdl struct vop_reclaim_args /* {
195 1.1.1.2 fvdl struct vnode *a_vp;
196 1.1.1.2 fvdl } */ *ap;
197 1.1 cgd {
198 1.1.1.2 fvdl register struct vnode *vp = ap->a_vp;
199 1.1 cgd register struct nfsnode *np = VTONFS(vp);
200 1.1.1.2 fvdl register struct nfsmount *nmp = VFSTONFS(vp->v_mount);
201 1.1.1.3 fvdl register struct nfsdmap *dp, *dp2;
202 1.1 cgd extern int prtactive;
203 1.1 cgd
204 1.1 cgd if (prtactive && vp->v_usecount != 0)
205 1.1 cgd vprint("nfs_reclaim: pushing active", vp);
206 1.1.1.3 fvdl
207 1.1.1.3 fvdl LIST_REMOVE(np, n_hash);
208 1.1.1.2 fvdl
209 1.1.1.2 fvdl /*
210 1.1.1.2 fvdl * For nqnfs, take it off the timer queue as required.
211 1.1.1.2 fvdl */
212 1.1.1.3 fvdl if ((nmp->nm_flag & NFSMNT_NQNFS) && np->n_timer.cqe_next != 0) {
213 1.1.1.3 fvdl CIRCLEQ_REMOVE(&nmp->nm_timerhead, np, n_timer);
214 1.1.1.2 fvdl }
215 1.1 cgd
216 1.1.1.2 fvdl /*
217 1.1.1.3 fvdl * Free up any directory cookie structures and
218 1.1.1.3 fvdl * large file handle structures that might be associated with
219 1.1.1.3 fvdl * this nfs node.
220 1.1.1.2 fvdl */
221 1.1.1.3 fvdl if (vp->v_type == VDIR) {
222 1.1.1.3 fvdl dp = np->n_cookies.lh_first;
223 1.1.1.3 fvdl while (dp) {
224 1.1.1.3 fvdl dp2 = dp;
225 1.1.1.3 fvdl dp = dp->ndm_list.le_next;
226 1.1.1.3 fvdl FREE((caddr_t)dp2, M_NFSDIROFF);
227 1.1.1.3 fvdl }
228 1.1.1.3 fvdl }
229 1.1.1.3 fvdl if (np->n_fhsize > NFS_SMALLFH) {
230 1.1.1.3 fvdl FREE((caddr_t)np->n_fhp, M_NFSBIGFH);
231 1.1 cgd }
232 1.1 cgd
233 1.1.1.3 fvdl cache_purge(vp);
234 1.1.1.3 fvdl FREE(vp->v_data, M_NFSNODE);
235 1.1.1.3 fvdl vp->v_data = (void *)0;
236 1.1 cgd return (0);
237 1.1 cgd }
238 1.1 cgd
239 1.1 cgd /*
240 1.1 cgd * Nfs abort op, called after namei() when a CREATE/DELETE isn't actually
241 1.1 cgd * done. Currently nothing to do.
242 1.1 cgd */
243 1.1 cgd /* ARGSUSED */
244 1.1.1.2 fvdl int
245 1.1.1.2 fvdl nfs_abortop(ap)
246 1.1.1.2 fvdl struct vop_abortop_args /* {
247 1.1.1.2 fvdl struct vnode *a_dvp;
248 1.1.1.2 fvdl struct componentname *a_cnp;
249 1.1.1.2 fvdl } */ *ap;
250 1.1 cgd {
251 1.1 cgd
252 1.1.1.2 fvdl if ((ap->a_cnp->cn_flags & (HASBUF | SAVESTART)) == HASBUF)
253 1.1.1.2 fvdl FREE(ap->a_cnp->cn_pnbuf, M_NAMEI);
254 1.1 cgd return (0);
255 1.1 cgd }
256