2 * Copyright (c) 2000-2010 Apple Inc. All rights reserved.
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
28 /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
30 * Copyright (c) 1989, 1993
31 * The Regents of the University of California. All rights reserved.
33 * This code is derived from software contributed to Berkeley by
34 * Rick Macklem at The University of Guelph.
36 * Redistribution and use in source and binary forms, with or without
37 * modification, are permitted provided that the following conditions
39 * 1. Redistributions of source code must retain the above copyright
40 * notice, this list of conditions and the following disclaimer.
41 * 2. Redistributions in binary form must reproduce the above copyright
42 * notice, this list of conditions and the following disclaimer in the
43 * documentation and/or other materials provided with the distribution.
44 * 3. All advertising materials mentioning features or use of this software
45 * must display the following acknowledgement:
46 * This product includes software developed by the University of
47 * California, Berkeley and its contributors.
48 * 4. Neither the name of the University nor the names of its contributors
49 * may be used to endorse or promote products derived from this software
50 * without specific prior written permission.
52 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64 * @(#)nfs_srvcache.c 8.3 (Berkeley) 3/30/95
65 * FreeBSD-Id: nfs_srvcache.c,v 1.15 1997/10/12 20:25:46 phk Exp $
70 * Reference: Chet Juszczak, "Improving the Performance and Correctness
71 * of an NFS Server", in Proc. Winter 1989 USENIX Conference,
72 * pages 53-63. San Diego, February 1989.
74 #include <sys/param.h>
75 #include <sys/vnode.h>
76 #include <sys/mount_internal.h>
77 #include <sys/kernel.h>
78 #include <sys/systm.h>
80 #include <sys/kpi_mbuf.h>
81 #include <sys/malloc.h>
82 #include <sys/socket.h>
83 #include <libkern/OSAtomic.h>
85 #include <netinet/in.h>
86 #include <nfs/rpcv2.h>
87 #include <nfs/nfsproto.h>
89 #include <nfs/nfsrvcache.h>
91 extern int nfsv2_procid
[NFS_NPROCS
];
92 static int nfsrv_reqcache_count
;
93 int nfsrv_reqcache_size
= NFSRVCACHESIZ
;
95 #define NFSRCHASH(xid) \
96 (&nfsrv_reqcache_hashtbl[((xid) + ((xid) >> 24)) & nfsrv_reqcache_hash])
97 LIST_HEAD(nfsrv_reqcache_hash
, nfsrvcache
) * nfsrv_reqcache_hashtbl
;
98 TAILQ_HEAD(nfsrv_reqcache_lru
, nfsrvcache
) nfsrv_reqcache_lruhead
;
99 u_long nfsrv_reqcache_hash
;
101 lck_grp_t
*nfsrv_reqcache_lck_grp
;
102 lck_mtx_t
*nfsrv_reqcache_mutex
;
105 * Static array that defines which nfs rpc's are nonidempotent
107 static int nonidempotent
[NFS_NPROCS
] = {
133 /* True iff the rpc reply is an nfs status ONLY! */
134 static int nfsv2_repstat
[NFS_NPROCS
] = {
156 * Initialize the server request cache list
159 nfsrv_initcache(void)
161 if (nfsrv_reqcache_size
<= 0) {
165 lck_mtx_lock(nfsrv_reqcache_mutex
);
166 /* init nfs server request cache hash table */
167 nfsrv_reqcache_hashtbl
= hashinit(nfsrv_reqcache_size
, M_NFSD
, &nfsrv_reqcache_hash
);
168 TAILQ_INIT(&nfsrv_reqcache_lruhead
);
169 lck_mtx_unlock(nfsrv_reqcache_mutex
);
173 * This function compares two net addresses by family and returns TRUE
174 * if they are the same host.
175 * If there is any doubt, return FALSE.
176 * The AF_INET family is handled as a special case so that address mbufs
177 * don't need to be saved to store "struct in_addr", which is only 4 bytes.
178 * Ditto for AF_INET6 which is only 16 bytes.
183 union nethostaddr
*haddr
,
186 struct sockaddr_in
*inetaddr
;
187 struct sockaddr_in6
*inet6addr
;
191 inetaddr
= mbuf_data(nam
);
192 if ((inetaddr
->sin_family
== AF_INET
) &&
193 (inetaddr
->sin_addr
.s_addr
== haddr
->had_inetaddr
)) {
198 inet6addr
= mbuf_data(nam
);
199 if ((inet6addr
->sin6_family
== AF_INET6
) &&
200 !bcmp(&inet6addr
->sin6_addr
, &haddr
->had_inet6addr
, sizeof(inet6addr
->sin6_addr
))) {
209 * Look for the request in the cache
211 * return action and optionally reply
213 * insert it in the cache
215 * The rules are as follows:
216 * - if in progress, return DROP request
217 * - if completed within DELAY of the current time, return DROP it
218 * - if completed a longer time ago return REPLY if the reply was cached or
220 * Update/add new request at end of lru list
224 struct nfsrv_descript
*nd
,
225 struct nfsrv_sock
*slp
,
228 struct nfsrvcache
*rp
;
229 struct nfsm_chain nmrep
;
230 struct sockaddr
*saddr
;
234 * Don't cache recent requests for reliable transport protocols.
235 * (Maybe we should for the case of a reconnect, but..)
240 lck_mtx_lock(nfsrv_reqcache_mutex
);
242 for (rp
= NFSRCHASH(nd
->nd_retxid
)->lh_first
; rp
!= 0;
243 rp
= rp
->rc_hash
.le_next
) {
244 if (nd
->nd_retxid
== rp
->rc_xid
&& nd
->nd_procnum
== rp
->rc_proc
&&
245 netaddr_match(rp
->rc_family
, &rp
->rc_haddr
, nd
->nd_nam
)) {
246 if ((rp
->rc_flag
& RC_LOCKED
) != 0) {
247 rp
->rc_flag
|= RC_WANTED
;
248 msleep(rp
, nfsrv_reqcache_mutex
, PZERO
- 1, "nfsrc", NULL
);
251 rp
->rc_flag
|= RC_LOCKED
;
252 /* If not at end of LRU chain, move it there */
253 if (rp
->rc_lru
.tqe_next
) {
254 TAILQ_REMOVE(&nfsrv_reqcache_lruhead
, rp
, rc_lru
);
255 TAILQ_INSERT_TAIL(&nfsrv_reqcache_lruhead
, rp
, rc_lru
);
257 if (rp
->rc_state
== RC_UNUSED
) {
258 panic("nfsrv cache");
260 if (rp
->rc_state
== RC_INPROG
) {
261 OSAddAtomic64(1, &nfsstats
.srvcache_inproghits
);
263 } else if (rp
->rc_flag
& RC_REPSTATUS
) {
264 OSAddAtomic64(1, &nfsstats
.srvcache_nonidemdonehits
);
265 nd
->nd_repstat
= rp
->rc_status
;
266 error
= nfsrv_rephead(nd
, slp
, &nmrep
, 0);
268 printf("nfsrv cache: reply alloc failed for nonidem request hit\n");
273 *mrepp
= nmrep
.nmc_mhead
;
275 } else if (rp
->rc_flag
& RC_REPMBUF
) {
276 OSAddAtomic64(1, &nfsstats
.srvcache_nonidemdonehits
);
277 error
= mbuf_copym(rp
->rc_reply
, 0, MBUF_COPYALL
, MBUF_WAITOK
, mrepp
);
279 printf("nfsrv cache: reply copym failed for nonidem request hit\n");
285 OSAddAtomic64(1, &nfsstats
.srvcache_idemdonehits
);
286 rp
->rc_state
= RC_INPROG
;
289 rp
->rc_flag
&= ~RC_LOCKED
;
290 if (rp
->rc_flag
& RC_WANTED
) {
291 rp
->rc_flag
&= ~RC_WANTED
;
294 lck_mtx_unlock(nfsrv_reqcache_mutex
);
298 OSAddAtomic64(1, &nfsstats
.srvcache_misses
);
299 if (nfsrv_reqcache_count
< nfsrv_reqcache_size
) {
300 /* try to allocate a new entry */
301 MALLOC(rp
, struct nfsrvcache
*, sizeof *rp
, M_NFSD
, M_WAITOK
);
303 bzero((char *)rp
, sizeof *rp
);
304 nfsrv_reqcache_count
++;
305 rp
->rc_flag
= RC_LOCKED
;
311 /* try to reuse the least recently used entry */
312 rp
= nfsrv_reqcache_lruhead
.tqh_first
;
314 /* no entry to reuse? */
315 /* OK, we just won't be able to cache this request */
316 lck_mtx_unlock(nfsrv_reqcache_mutex
);
319 while ((rp
->rc_flag
& RC_LOCKED
) != 0) {
320 rp
->rc_flag
|= RC_WANTED
;
321 msleep(rp
, nfsrv_reqcache_mutex
, PZERO
- 1, "nfsrc", NULL
);
322 rp
= nfsrv_reqcache_lruhead
.tqh_first
;
324 rp
->rc_flag
|= RC_LOCKED
;
325 LIST_REMOVE(rp
, rc_hash
);
326 TAILQ_REMOVE(&nfsrv_reqcache_lruhead
, rp
, rc_lru
);
327 if (rp
->rc_flag
& RC_REPMBUF
) {
328 mbuf_freem(rp
->rc_reply
);
330 if (rp
->rc_flag
& RC_NAM
) {
331 mbuf_freem(rp
->rc_nam
);
333 rp
->rc_flag
&= (RC_LOCKED
| RC_WANTED
);
335 TAILQ_INSERT_TAIL(&nfsrv_reqcache_lruhead
, rp
, rc_lru
);
336 rp
->rc_state
= RC_INPROG
;
337 rp
->rc_xid
= nd
->nd_retxid
;
338 saddr
= mbuf_data(nd
->nd_nam
);
339 rp
->rc_family
= saddr
->sa_family
;
340 switch (saddr
->sa_family
) {
342 rp
->rc_flag
|= RC_INETADDR
;
343 rp
->rc_inetaddr
= ((struct sockaddr_in
*)saddr
)->sin_addr
.s_addr
;
346 rp
->rc_flag
|= RC_INETADDR
;
347 rp
->rc_inet6addr
= ((struct sockaddr_in6
*)saddr
)->sin6_addr
;
350 error
= mbuf_copym(nd
->nd_nam
, 0, MBUF_COPYALL
, MBUF_WAITOK
, &rp
->rc_nam
);
352 printf("nfsrv cache: nam copym failed\n");
354 rp
->rc_flag
|= RC_NAM
;
359 rp
->rc_proc
= nd
->nd_procnum
;
360 LIST_INSERT_HEAD(NFSRCHASH(nd
->nd_retxid
), rp
, rc_hash
);
361 rp
->rc_flag
&= ~RC_LOCKED
;
362 if (rp
->rc_flag
& RC_WANTED
) {
363 rp
->rc_flag
&= ~RC_WANTED
;
366 lck_mtx_unlock(nfsrv_reqcache_mutex
);
371 * Update a request cache entry after the rpc has been done
375 struct nfsrv_descript
*nd
,
379 struct nfsrvcache
*rp
;
385 lck_mtx_lock(nfsrv_reqcache_mutex
);
387 for (rp
= NFSRCHASH(nd
->nd_retxid
)->lh_first
; rp
!= 0;
388 rp
= rp
->rc_hash
.le_next
) {
389 if (nd
->nd_retxid
== rp
->rc_xid
&& nd
->nd_procnum
== rp
->rc_proc
&&
390 netaddr_match(rp
->rc_family
, &rp
->rc_haddr
, nd
->nd_nam
)) {
391 if ((rp
->rc_flag
& RC_LOCKED
) != 0) {
392 rp
->rc_flag
|= RC_WANTED
;
393 msleep(rp
, nfsrv_reqcache_mutex
, PZERO
- 1, "nfsrc", NULL
);
396 rp
->rc_flag
|= RC_LOCKED
;
397 if (rp
->rc_state
== RC_DONE
) {
399 * This can occur if the cache is too small.
400 * Retransmits of the same request aren't
401 * dropped so we may see the operation
402 * complete more then once.
404 if (rp
->rc_flag
& RC_REPMBUF
) {
405 mbuf_freem(rp
->rc_reply
);
406 rp
->rc_flag
&= ~RC_REPMBUF
;
409 rp
->rc_state
= RC_DONE
;
411 * If we have a valid reply update status and save
412 * the reply for non-idempotent rpc's.
414 if (repvalid
&& nonidempotent
[nd
->nd_procnum
]) {
415 if ((nd
->nd_vers
== NFS_VER2
) &&
416 nfsv2_repstat
[nfsv2_procid
[nd
->nd_procnum
]]) {
417 rp
->rc_status
= nd
->nd_repstat
;
418 rp
->rc_flag
|= RC_REPSTATUS
;
420 error
= mbuf_copym(repmbuf
, 0, MBUF_COPYALL
, MBUF_WAITOK
, &rp
->rc_reply
);
422 rp
->rc_flag
|= RC_REPMBUF
;
426 rp
->rc_flag
&= ~RC_LOCKED
;
427 if (rp
->rc_flag
& RC_WANTED
) {
428 rp
->rc_flag
&= ~RC_WANTED
;
431 lck_mtx_unlock(nfsrv_reqcache_mutex
);
435 lck_mtx_unlock(nfsrv_reqcache_mutex
);
439 * Clean out the cache. Called when the last nfsd terminates.
442 nfsrv_cleancache(void)
444 struct nfsrvcache
*rp
, *nextrp
;
446 lck_mtx_lock(nfsrv_reqcache_mutex
);
447 for (rp
= nfsrv_reqcache_lruhead
.tqh_first
; rp
!= 0; rp
= nextrp
) {
448 nextrp
= rp
->rc_lru
.tqe_next
;
449 LIST_REMOVE(rp
, rc_hash
);
450 TAILQ_REMOVE(&nfsrv_reqcache_lruhead
, rp
, rc_lru
);
453 nfsrv_reqcache_count
= 0;
454 FREE(nfsrv_reqcache_hashtbl
, M_TEMP
);
455 lck_mtx_unlock(nfsrv_reqcache_mutex
);
458 #endif /* NFSSERVER */