|
|
1.1 root 1: /*
2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7: * Reserved. This file contains Original Code and/or Modifications of
8: * Original Code as defined in and that are subject to the Apple Public
9: * Source License Version 1.1 (the "License"). You may not use this file
10: * except in compliance with the License. Please obtain a copy of the
11: * License at http://www.apple.com/publicsource and read it before using
12: * this file.
13: *
14: * The Original Code and all software distributed under the License are
15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
19: * License for the specific language governing rights and limitations
20: * under the License.
21: *
22: * @APPLE_LICENSE_HEADER_END@
23: */
24:
25: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
26: /*
27: * Copyright (c) 1992, 1993
28: * The Regents of the University of California. All rights reserved.
29: *
30: * This code is derived from software contributed to Berkeley by
31: * Rick Macklem at The University of Guelph.
32: *
33: * Redistribution and use in source and binary forms, with or without
34: * modification, are permitted provided that the following conditions
35: * are met:
36: * 1. Redistributions of source code must retain the above copyright
37: * notice, this list of conditions and the following disclaimer.
38: * 2. Redistributions in binary form must reproduce the above copyright
39: * notice, this list of conditions and the following disclaimer in the
40: * documentation and/or other materials provided with the distribution.
41: * 3. All advertising materials mentioning features or use of this software
42: * must display the following acknowledgement:
43: * This product includes software developed by the University of
44: * California, Berkeley and its contributors.
45: * 4. Neither the name of the University nor the names of its contributors
46: * may be used to endorse or promote products derived from this software
47: * without specific prior written permission.
48: *
49: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59: * SUCH DAMAGE.
60: *
61: * @(#)nfsrtt.h 8.2 (Berkeley) 3/30/95
62: * FreeBSD-Id: nfsrtt.h,v 1.8 1997/06/03 17:22:47 dfr Exp $
63: */
64:
65:
66: #ifndef _NFS_NFSRTT_H_
67: #define _NFS_NFSRTT_H_
68:
69: /*
70: * Definitions for performance monitor.
71: * The client and server logging are turned on by setting the global
72: * constant "nfsrtton" to 1.
73: */
74: #define NFSRTTLOGSIZ 128
75:
76: /*
77: * Circular log of client side rpc activity. Each log entry is for one
78: * rpc filled in upon completion. (ie. in order of completion)
79: * The "pos" is the table index for the "next" entry, therefore the
80: * list goes from nfsrtt.rttl[pos] --> nfsrtt.rttl[pos - 1] in
81: * chronological order of completion.
82: */
83: struct nfsrtt {
84: int pos; /* Position in array for next entry */
85: struct rttl {
86: u_int32_t proc; /* NFS procedure number */
87: int rtt; /* Measured round trip time */
88: int rto; /* Round Trip Timeout */
89: int sent; /* # rpcs in progress */
90: int cwnd; /* Send window */
91: int srtt; /* Ave Round Trip Time */
92: int sdrtt; /* Ave mean deviation of RTT */
93: fsid_t fsid; /* Fsid for mount point */
94: struct timeval tstamp; /* Timestamp of log entry */
95: } rttl[NFSRTTLOGSIZ];
96: };
97:
98: /*
99: * And definitions for server side performance monitor.
100: * The log organization is the same as above except it is filled in at the
101: * time the server sends the rpc reply.
102: */
103:
104: /*
105: * Bits for the flags field.
106: */
107: #define DRT_NQNFS 0x01 /* Rpc used Nqnfs protocol */
108: #define DRT_TCP 0x02 /* Client used TCP transport */
109: #define DRT_CACHEREPLY 0x04 /* Reply was from recent request cache */
110: #define DRT_CACHEDROP 0x08 /* Rpc request dropped, due to recent reply */
111: #define DRT_NFSV3 0x10 /* Rpc used NFS Version 3 */
112:
113: /*
114: * Server log structure
115: * NB: ipadr == INADDR_ANY indicates a client using a non IP protocol.
116: * (ISO perhaps?)
117: */
118: struct nfsdrt {
119: int pos; /* Position of next log entry */
120: struct drt {
121: int flag; /* Bits as defined above */
122: u_int32_t proc; /* NFS procedure number */
123: u_long ipadr; /* IP address of client */
124: int resptime; /* Response time (usec) */
125: struct timeval tstamp; /* Timestamp of log entry */
126: } drt[NFSRTTLOGSIZ];
127: };
128:
129: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.