Commit | Line | Data |
---|---|---|
15637ed4 RG |
1 | /*- |
2 | * Copyright (c) 1991 The Regents of the University of California. | |
3 | * All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * 1. Redistributions of source code must retain the above copyright | |
9 | * notice, this list of conditions and the following disclaimer. | |
10 | * 2. Redistributions in binary form must reproduce the above copyright | |
11 | * notice, this list of conditions and the following disclaimer in the | |
12 | * documentation and/or other materials provided with the distribution. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | * | |
43371f85 | 33 | * from: @(#)tp_stat.h 7.5 (Berkeley) 6/27/91 |
8ace4366 | 34 | * $Id: tp_stat.h,v 1.2 1993/10/16 21:05:59 rgrimes Exp $ |
15637ed4 RG |
35 | */ |
36 | ||
37 | /*********************************************************** | |
38 | Copyright IBM Corporation 1987 | |
39 | ||
40 | All Rights Reserved | |
41 | ||
42 | Permission to use, copy, modify, and distribute this software and its | |
43 | documentation for any purpose and without fee is hereby granted, | |
44 | provided that the above copyright notice appear in all copies and that | |
45 | both that copyright notice and this permission notice appear in | |
46 | supporting documentation, and that the name of IBM not be | |
47 | used in advertising or publicity pertaining to distribution of the | |
48 | software without specific, written prior permission. | |
49 | ||
50 | IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING | |
51 | ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL | |
52 | IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR | |
53 | ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, | |
54 | WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, | |
55 | ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS | |
56 | SOFTWARE. | |
57 | ||
58 | ******************************************************************/ | |
59 | ||
60 | /* | |
61 | * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison | |
62 | */ | |
43371f85 | 63 | |
15637ed4 RG |
64 | /* |
65 | * ARGO TP | |
66 | * | |
15637ed4 RG |
67 | * Here are the data structures in which the global |
68 | * statistics(counters) are gathered. | |
69 | */ | |
70 | ||
71 | #ifndef __TP_STAT__ | |
72 | #define __TP_STAT__ | |
73 | ||
74 | struct tp_stat { | |
75 | u_long ts_param_ignored; | |
76 | u_long ts_unused3; | |
77 | u_long ts_bad_csum; | |
78 | ||
79 | u_long ts_inv_length; | |
80 | u_long ts_inv_pcode; | |
81 | u_long ts_inv_dutype; | |
82 | u_long ts_negotfailed; | |
83 | u_long ts_inv_dref; | |
84 | u_long ts_inv_pval; | |
85 | u_long ts_inv_sufx; | |
86 | u_long ts_inv_aclass; | |
87 | ||
88 | u_long ts_xtd_fmt; | |
89 | u_long ts_use_txpd; | |
90 | u_long ts_csum_off; | |
91 | u_long ts_send_drop; | |
92 | u_long ts_recv_drop; | |
93 | ||
94 | u_long ts_xpd_intheway;/* xpd mark caused data flow to stop */ | |
95 | u_long ts_xpdmark_del; /* xpd markers thrown away */ | |
96 | u_long ts_dt_ooo; /* dt tpdus received out of order */ | |
97 | u_long ts_dt_niw; /* dt tpdus received & not in window */ | |
98 | u_long ts_xpd_niw; /* xpd tpdus received & not in window */ | |
99 | u_long ts_xpd_dup; | |
100 | u_long ts_dt_dup; /* dt tpdus received & are duplicates */ | |
101 | ||
102 | u_long ts_zfcdt; /* # times f credit went down to 0 */ | |
103 | u_long ts_lcdt_reduced; /* | |
104 | # times local cdt reduced on an acknowledgement. | |
105 | */ | |
106 | ||
107 | u_long ts_pkt_rcvd; /* from ip */ | |
108 | u_long ts_tpdu_rcvd; /* accepted as a TPDU in tp_input */ | |
109 | u_long ts_tpdu_sent; | |
110 | u_long ts_unused2; | |
111 | ||
112 | u_long ts_retrans_cr; | |
113 | u_long ts_retrans_cc; | |
114 | u_long ts_retrans_dr; | |
115 | u_long ts_retrans_dt; | |
116 | u_long ts_retrans_xpd; | |
117 | u_long ts_conn_gaveup; | |
118 | ||
119 | u_long ts_ER_sent; | |
120 | u_long ts_DT_sent; | |
121 | u_long ts_XPD_sent; | |
122 | u_long ts_AK_sent; | |
123 | u_long ts_XAK_sent; | |
124 | u_long ts_DR_sent; | |
125 | u_long ts_DC_sent; | |
126 | u_long ts_CR_sent; | |
127 | u_long ts_CC_sent; | |
128 | ||
129 | u_long ts_ER_rcvd; | |
130 | u_long ts_DT_rcvd; | |
131 | u_long ts_XPD_rcvd; | |
132 | u_long ts_AK_rcvd; | |
133 | u_long ts_XAK_rcvd; | |
134 | u_long ts_DR_rcvd; | |
135 | u_long ts_DC_rcvd; | |
136 | u_long ts_CR_rcvd; | |
137 | u_long ts_CC_rcvd; | |
138 | ||
139 | u_long ts_Eticks; | |
140 | u_long ts_Eexpired; | |
141 | u_long ts_Eset; | |
142 | u_long ts_Ecan_act; | |
143 | u_long ts_Cticks; | |
144 | u_long ts_Cexpired; | |
145 | u_long ts_Cset; | |
146 | u_long ts_Ccan_act; | |
147 | u_long ts_Ccan_inact; | |
148 | ||
149 | u_long ts_concat_rcvd; | |
150 | ||
151 | u_long ts_zdebug; /* zero dref to test timeout on conn estab tp_input.c */ | |
152 | u_long ts_ydebug; /* throw away pseudo-random pkts tp_input.c */ | |
153 | u_long ts_unused5; | |
154 | u_long ts_unused; /* kludged concat to test separation tp_emit.c */ | |
155 | u_long ts_vdebug; /* kludge to test input size checking tp_emit.c */ | |
156 | u_long ts_unused4; | |
157 | u_long ts_ldebug; /* faked a renegging of credit */ | |
158 | ||
159 | u_long ts_mb_small; | |
160 | u_long ts_mb_cluster; | |
161 | u_long ts_mb_len_distr[17]; | |
162 | ||
163 | u_long ts_eot_input; | |
164 | u_long ts_eot_user; | |
165 | u_long ts_EOT_sent; | |
166 | u_long ts_tp0_conn; | |
167 | u_long ts_tp4_conn; | |
168 | u_long ts_quench; | |
169 | u_long ts_rcvdecbit; | |
170 | ||
171 | #define NRTT_CATEGORIES 4 | |
172 | /* The 4 categories are: | |
173 | * 0 --> tp_flags: ~TPF_PEER_ON_SAMENET | TPF_NL_PDN | |
174 | * 1 --> tp_flags: ~TPF_PEER_ON_SAMENET | ~TPF_NL_PDN | |
175 | * 2 --> tp_flags: TPF_PEER_ON_SAMENET | ~TPF_NL_PDN | |
176 | * 3 --> tp_flags: TPF_PEER_ON_SAMENET | TPF_NL_PDN | |
177 | */ | |
178 | struct timeval ts_rtt[NRTT_CATEGORIES]; | |
179 | struct timeval ts_rtv[NRTT_CATEGORIES]; | |
180 | ||
181 | u_long ts_ackreason[_ACK_NUM_REASONS_]; | |
182 | /* ACK_DONT 0 / ACK_STRAT_EACH 0x1 / ACK_STRAT_FULLWIN 0x4 | |
183 | * ACK_DUP 0x8 / ACK_EOT 0x10 / ACK_REORDER 0x20 | |
184 | * ACK_USRRCV ** | |
185 | * ACK_FCC ** | |
186 | */ | |
8ace4366 GW |
187 | } ; |
188 | ||
189 | #ifdef KERNEL | |
190 | struct tp_stat tp_stat; | |
191 | #endif | |
192 | ||
15637ed4 RG |
193 | #define TP_PM_MAX 0xa /* 10 decimal */ |
194 | ||
195 | #define IncStat(x) tp_stat./**/x/**/++ | |
196 | ||
197 | #ifdef TP_PERF_MEAS | |
198 | ||
199 | #define PStat(Tpcb, X) (Tpcb)->tp_p_meas->/**/X/**/ | |
200 | #define IncPStat(Tpcb, X) if((Tpcb)->tp_perf_on) (Tpcb)->tp_p_meas->/**/X/**/++ | |
201 | ||
202 | /* BEWARE OF MACROS like this ^^^ must be sure it's surrounded by {} if | |
203 | * it's used in an if-else statement. | |
204 | */ | |
205 | ||
206 | ||
207 | /* for perf measurement stuff: maximum window size it can handle */ | |
208 | ||
209 | struct tp_pmeas { | |
210 | /* the first few are distributions as a fn of window size | |
211 | * only keep enough space for normal format plus 1 slot for | |
212 | * extended format, in case any windows larger than 15 are used | |
213 | */ | |
214 | ||
215 | /* | |
216 | * tps_npdusent: for each call to tp_sbsend, we inc the | |
217 | * element representing the number of pdus sent in this call | |
218 | */ | |
219 | int tps_win_lim_by_cdt[TP_PM_MAX+1]; | |
220 | int tps_win_lim_by_data[TP_PM_MAX+1]; | |
221 | /* | |
222 | * tps_sendtime: Each call to tp_sbsend() is timed. For | |
223 | * Each window size, we keep the running average of the time | |
224 | * taken by tp_sbsend() for each window size. | |
225 | */ | |
226 | struct timeval tps_sendtime[TP_PM_MAX+1]; | |
227 | /* | |
228 | * n_TMsendack: # times ack sent because timer went off | |
229 | * n_ack_cuz_eot: # times ack sent due to EOTSDU on incoming packet | |
230 | * n_ack_cuz_dup: # times ack sent for receiving a duplicate pkt. | |
231 | * n_ack_cuz_fullwin: # times ack sent for receiving the full window. | |
232 | * n_ack_cuz_doack: # times ack sent for having just reordered data. | |
233 | */ | |
234 | int tps_n_TMsendack; | |
235 | int tps_n_ack_cuz_eot; | |
236 | int tps_n_ack_cuz_fullwin; | |
237 | int tps_n_ack_cuz_reorder; | |
238 | int tps_n_ack_cuz_dup; | |
239 | int tps_n_ack_cuz_strat; | |
240 | /* | |
241 | * when we send an ack: how much less than the "expected" window | |
242 | * did we actually ack. For example: if we last sent a credit | |
243 | * of 10, and we're acking now for whatever reason, and have | |
244 | * only received 6 since our last credit advertisement, we'll | |
245 | * keep the difference, 4, in this variable. | |
246 | */ | |
247 | int tps_ack_early[TP_PM_MAX+1]; | |
248 | /* | |
249 | * when we ack, for the # pkts we actually acked w/ this ack, | |
250 | * how much cdt are we advertising? | |
251 | * [ size of window acknowledged ] [ cdt we're giving ] | |
252 | */ | |
253 | int tps_cdt_acked[TP_PM_MAX+1][TP_PM_MAX+1]; | |
254 | ||
255 | int tps_AK_sent; | |
256 | int tps_XAK_sent; | |
257 | int tps_DT_sent; | |
258 | int tps_XPD_sent; | |
259 | int tps_AK_rcvd; | |
260 | int tps_XAK_rcvd; | |
261 | int tps_DT_rcvd; | |
262 | int tps_XPD_rcvd; | |
263 | ||
264 | int Nb_from_sess; | |
265 | int Nb_to_sess; | |
266 | int Nb_to_ll; | |
267 | int Nb_from_ll; | |
268 | }; | |
269 | ||
270 | #define IFPERF(tpcb) if (tpcb->tp_perf_on && tpcb->tp_p_meas) { | |
271 | #define ENDPERF } | |
272 | ||
8ace4366 | 273 | #else /* not TP_PERF_MEAS */ |
15637ed4 | 274 | |
8ace4366 | 275 | extern int PStat_Junk; |
15637ed4 RG |
276 | #define PStat(tpcb, x) PStat_Junk |
277 | #define IncPStat(tpcb, x) /* no-op */ | |
278 | #define tpmeas(a,b,c,d,e,f) 0 | |
279 | ||
280 | #define IFPERF(x) if (0) { | |
281 | #define ENDPERF } | |
282 | ||
8ace4366 | 283 | #endif /* TP_PERF_MEAS */ |
15637ed4 | 284 | |
8ace4366 | 285 | #endif /* __TP_STAT__ */ |