|
|
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: *
1.1.1.3 ! root 33: * from: @(#)tp_trace.c 7.4 (Berkeley) 5/6/91
! 34: * tp_trace.c,v 1.2 1993/05/20 05:28:05 cgd Exp
1.1 root 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: */
63: /*
64: * ARGO TP
65: *
66: * The whole protocol trace module.
67: * We keep a circular buffer of trace structures, which are big
68: * unions of different structures we might want to see.
69: * Unfortunately this gets too big pretty easily. Pcbs were removed
70: * from the tracing when the kernel got too big to boot.
71: */
72:
73: #define TP_TRACEFILE
74:
75: #include "param.h"
76: #include "systm.h"
77: #include "mbuf.h"
78: #include "socket.h"
79: #include "types.h"
80: #include "time.h"
81:
82: #include "tp_param.h"
83: #include "tp_timer.h"
84: #include "tp_stat.h"
85: #include "tp_param.h"
86: #include "tp_ip.h"
87: #include "tp_pcb.h"
88: #include "tp_tpdu.h"
89: #include "argo_debug.h"
90: #include "tp_trace.h"
91:
92: #ifdef TPPT
93: static tp_seq = 0;
94: u_char tp_traceflags[128];
95:
96: /*
97: * The argument tpcb is the obvious.
98: * event here is just the type of trace event - TPPTmisc, etc.
99: * The rest of the arguments have different uses depending
100: * on the type of trace event.
101: */
102: /*ARGSUSED*/
103: /*VARARGS*/
104:
105: void
106: tpTrace(tpcb, event, arg, src, len, arg4, arg5)
107: struct tp_pcb *tpcb;
108: u_int event, arg;
109: u_int src;
110: u_int len;
111: u_int arg4;
112: u_int arg5;
113: {
114: register struct tp_Trace *tp;
115:
116: tp = &tp_Trace[tp_Tracen++];
117: tp_Tracen %= TPTRACEN;
118:
119: tp->tpt_event = event;
120: tp->tpt_tseq = tp_seq++;
121: tp->tpt_arg = arg;
122: if(tpcb)
123: tp->tpt_arg2 = tpcb->tp_lref;
124: bcopy( (caddr_t)&time, (caddr_t)&tp->tpt_time, sizeof(struct timeval) );
125:
126: switch(event) {
127:
128: case TPPTertpdu:
129: bcopy((caddr_t)src, (caddr_t)&tp->tpt_ertpdu,
130: (unsigned)MIN((int)len, sizeof(struct tp_Trace)));
131: break;
132:
133: case TPPTusrreq:
134: case TPPTmisc:
135:
136: /* arg is a string */
137: bcopy((caddr_t)arg, (caddr_t)tp->tpt_str,
138: (unsigned)MIN(1+strlen((caddr_t) arg), TPTRACE_STRLEN));
139: tp->tpt_m2 = src;
140: tp->tpt_m3 = len;
141: tp->tpt_m4 = arg4;
142: tp->tpt_m1 = arg5;
143: break;
144:
145: case TPPTgotXack:
146: case TPPTXack:
147: case TPPTsendack:
148: case TPPTgotack:
149: case TPPTack:
150: case TPPTindicate:
151: default:
152: case TPPTdriver:
153: tp->tpt_m2 = arg;
154: tp->tpt_m3 = src;
155: tp->tpt_m4 = len;
156: tp->tpt_m5 = arg4;
157: tp->tpt_m1 = arg5;
158: break;
159: case TPPTparam:
160: bcopy((caddr_t)src, (caddr_t)&tp->tpt_param, sizeof(struct tp_param));
161: break;
162: case TPPTref:
163: bcopy((caddr_t)src, (caddr_t)&tp->tpt_ref, sizeof(struct tp_ref));
164: break;
165:
166: case TPPTtpduin:
167: case TPPTtpduout:
168: tp->tpt_arg2 = arg4;
169: bcopy((caddr_t)src, (caddr_t)&tp->tpt_tpdu,
170: (unsigned)MIN((int)len, sizeof(struct tp_Trace)));
171: break;
172: }
173: }
174: #endif TPPT
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.