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