]>
git.saurik.com Git - apple/xnu.git/blob - bsd/netiso/tp_stat.h
2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
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.
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
20 * @APPLE_LICENSE_HEADER_END@
23 * Copyright (c) 1991, 1993
24 * The Regents of the University of California. All rights reserved.
26 * Redistribution and use in source and binary forms, with or without
27 * modification, are permitted provided that the following conditions
29 * 1. Redistributions of source code must retain the above copyright
30 * notice, this list of conditions and the following disclaimer.
31 * 2. Redistributions in binary form must reproduce the above copyright
32 * notice, this list of conditions and the following disclaimer in the
33 * documentation and/or other materials provided with the distribution.
34 * 3. All advertising materials mentioning features or use of this software
35 * must display the following acknowledgement:
36 * This product includes software developed by the University of
37 * California, Berkeley and its contributors.
38 * 4. Neither the name of the University nor the names of its contributors
39 * may be used to endorse or promote products derived from this software
40 * without specific prior written permission.
42 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
43 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
46 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
48 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
50 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
51 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
54 * @(#)tp_stat.h 8.1 (Berkeley) 6/10/93
57 /***********************************************************
58 Copyright IBM Corporation 1987
62 Permission to use, copy, modify, and distribute this software and its
63 documentation for any purpose and without fee is hereby granted,
64 provided that the above copyright notice appear in all copies and that
65 both that copyright notice and this permission notice appear in
66 supporting documentation, and that the name of IBM not be
67 used in advertising or publicity pertaining to distribution of the
68 software without specific, written prior permission.
70 IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
71 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
72 IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
73 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
74 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
75 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
78 ******************************************************************/
81 * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison
86 * Here are the data structures in which the global
87 * statistics(counters) are gathered.
94 u_long ts_param_ignored
;
100 u_long ts_inv_dutype
;
101 u_long ts_negotfailed
;
105 u_long ts_inv_aclass
;
113 u_long ts_xpd_intheway
;/* xpd mark caused data flow to stop */
114 u_long ts_xpdmark_del
; /* xpd markers thrown away */
115 u_long ts_dt_ooo
; /* dt tpdus received out of order */
116 u_long ts_dt_niw
; /* dt tpdus received & not in window */
117 u_long ts_xpd_niw
; /* xpd tpdus received & not in window */
119 u_long ts_dt_dup
; /* dt tpdus received & are duplicates */
121 u_long ts_zfcdt
; /* # times f credit went down to 0 */
122 u_long ts_lcdt_reduced
; /*
123 # times local cdt reduced on an acknowledgement.
126 u_long ts_pkt_rcvd
; /* from ip */
127 u_long ts_tpdu_rcvd
; /* accepted as a TPDU in tp_input */
131 u_long ts_retrans_cr
;
132 u_long ts_retrans_cc
;
133 u_long ts_retrans_dr
;
134 u_long ts_retrans_dt
;
135 u_long ts_retrans_xpd
;
136 u_long ts_conn_gaveup
;
166 u_long ts_Ccan_inact
;
170 u_long ts_concat_rcvd
;
172 u_long ts_zdebug
; /* zero dref to test timeout on conn estab tp_input.c */
173 u_long ts_ydebug
; /* throw away pseudo-random pkts tp_input.c */
175 u_long ts_unused
; /* kludged concat to test separation tp_emit.c */
176 u_long ts_vdebug
; /* kludge to test input size checking tp_emit.c */
178 u_long ts_ldebug
; /* faked a renegging of credit */
181 u_long ts_mb_cluster
;
182 u_long ts_mb_len_distr
[17];
192 #define NRTT_CATEGORIES 4
193 /* The 4 categories are:
194 * 0 --> tp_flags: ~TPF_PEER_ON_SAMENET | TPF_NL_PDN
195 * 1 --> tp_flags: ~TPF_PEER_ON_SAMENET | ~TPF_NL_PDN
196 * 2 --> tp_flags: TPF_PEER_ON_SAMENET | ~TPF_NL_PDN
197 * 3 --> tp_flags: TPF_PEER_ON_SAMENET | TPF_NL_PDN
199 int ts_rtt
[NRTT_CATEGORIES
];
200 int ts_rtv
[NRTT_CATEGORIES
];
202 u_long ts_ackreason
[_ACK_NUM_REASONS_
];
203 /* ACK_DONT 0 / ACK_STRAT_EACH 0x1 / ACK_STRAT_FULLWIN 0x4
204 * ACK_DUP 0x8 / ACK_EOT 0x10 / ACK_REORDER 0x20
209 #define TP_PM_MAX 0xa /* 10 decimal */
211 #define IncStat(x) tp_stat./**/x/**/++
215 #define PStat(Tpcb, X) (Tpcb)->tp_p_meas->/**/X/**/
216 #define IncPStat(Tpcb, X) if((Tpcb)->tp_perf_on) (Tpcb)->tp_p_meas->/**/X/**/++
218 /* BEWARE OF MACROS like this ^^^ must be sure it's surrounded by {} if
219 * it's used in an if-else statement.
223 /* for perf measurement stuff: maximum window size it can handle */
226 /* the first few are distributions as a fn of window size
227 * only keep enough space for normal format plus 1 slot for
228 * extended format, in case any windows larger than 15 are used
232 * tps_npdusent: for each call to tp_sbsend, we inc the
233 * element representing the number of pdus sent in this call
235 int tps_win_lim_by_cdt
[TP_PM_MAX
+1];
236 int tps_win_lim_by_data
[TP_PM_MAX
+1];
238 * tps_sendtime: Each call to tp_sbsend() is timed. For
239 * Each window size, we keep the running average of the time
240 * taken by tp_sbsend() for each window size.
242 int tps_sendtime
[TP_PM_MAX
+1];
244 * n_TMsendack: # times ack sent because timer went off
245 * n_ack_cuz_eot: # times ack sent due to EOTSDU on incoming packet
246 * n_ack_cuz_dup: # times ack sent for receiving a duplicate pkt.
247 * n_ack_cuz_fullwin: # times ack sent for receiving the full window.
248 * n_ack_cuz_doack: # times ack sent for having just reordered data.
251 int tps_n_ack_cuz_eot
;
252 int tps_n_ack_cuz_fullwin
;
253 int tps_n_ack_cuz_reorder
;
254 int tps_n_ack_cuz_dup
;
255 int tps_n_ack_cuz_strat
;
257 * when we send an ack: how much less than the "expected" window
258 * did we actually ack. For example: if we last sent a credit
259 * of 10, and we're acking now for whatever reason, and have
260 * only received 6 since our last credit advertisement, we'll
261 * keep the difference, 4, in this variable.
263 int tps_ack_early
[TP_PM_MAX
+1];
265 * when we ack, for the # pkts we actually acked w/ this ack,
266 * how much cdt are we advertising?
267 * [ size of window acknowledged ] [ cdt we're giving ]
269 int tps_cdt_acked
[TP_PM_MAX
+1][TP_PM_MAX
+1];
286 #define IFPERF(tpcb) if (tpcb->tp_perf_on && tpcb->tp_p_meas) {
292 #define PStat(tpcb, x) PStat_Junk
293 #define IncPStat(tpcb, x) /* no-op */
294 #define tpmeas(a,b,c,d,e,f) 0
296 #define IFPERF(x) if (0) {
299 #endif /* TP_PERF_MEAS */
301 #endif /* __TP_STAT__ */