|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
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.
11: *
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
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /*-
23: * Copyright (c) 1991, 1993
24: * The Regents of the University of California. All rights reserved.
25: *
26: * Redistribution and use in source and binary forms, with or without
27: * modification, are permitted provided that the following conditions
28: * are met:
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.
41: *
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
52: * SUCH DAMAGE.
53: *
54: * @(#)tp_trace.c 8.1 (Berkeley) 6/10/93
55: */
56:
57: /***********************************************************
58: Copyright IBM Corporation 1987
59:
60: All Rights Reserved
61:
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.
69:
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
76: SOFTWARE.
77:
78: ******************************************************************/
79:
80: /*
81: * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison
82: */
83: /*
84: * ARGO TP
85: *
86: * The whole protocol trace module.
87: * We keep a circular buffer of trace structures, which are big
88: * unions of different structures we might want to see.
89: * Unfortunately this gets too big pretty easily. Pcbs were removed
90: * from the tracing when the kernel got too big to boot.
91: */
92:
93: #define TP_TRACEFILE
94:
95: #include <sys/param.h>
96: #include <sys/systm.h>
97: #include <sys/mbuf.h>
98: #include <sys/socket.h>
99: #include <sys/time.h>
100:
101: #include <netiso/tp_param.h>
102: #include <netiso/tp_timer.h>
103: #include <netiso/tp_stat.h>
104: #include <netiso/tp_param.h>
105: #include <netiso/tp_ip.h>
106: #include <netiso/tp_pcb.h>
107: #include <netiso/tp_tpdu.h>
108: #include <netiso/argo_debug.h>
109: #include <netiso/tp_trace.h>
110:
111: #ifdef TPPT
112: static tp_seq = 0;
113: u_char tp_traceflags[128];
114:
115: /*
116: * The argument tpcb is the obvious.
117: * event here is just the type of trace event - TPPTmisc, etc.
118: * The rest of the arguments have different uses depending
119: * on the type of trace event.
120: */
121: /*ARGSUSED*/
122: /*VARARGS*/
123:
124: void
125: tpTrace(tpcb, event, arg, src, len, arg4, arg5)
126: struct tp_pcb *tpcb;
127: u_int event, arg;
128: u_int src;
129: u_int len;
130: u_int arg4;
131: u_int arg5;
132: {
133: register struct tp_Trace *tp;
134:
135: tp = &tp_Trace[tp_Tracen++];
136: tp_Tracen %= TPTRACEN;
137:
138: tp->tpt_event = event;
139: tp->tpt_tseq = tp_seq++;
140: tp->tpt_arg = arg;
141: if(tpcb)
142: tp->tpt_arg2 = tpcb->tp_lref;
143: bcopy( (caddr_t)&time, (caddr_t)&tp->tpt_time, sizeof(struct timeval) );
144:
145: switch(event) {
146:
147: case TPPTertpdu:
148: bcopy((caddr_t)src, (caddr_t)&tp->tpt_ertpdu,
149: (unsigned)MIN((int)len, sizeof(struct tp_Trace)));
150: break;
151:
152: case TPPTusrreq:
153: case TPPTmisc:
154:
155: /* arg is a string */
156: bcopy((caddr_t)arg, (caddr_t)tp->tpt_str,
157: (unsigned)MIN(1+strlen((caddr_t) arg), TPTRACE_STRLEN));
158: tp->tpt_m2 = src;
159: tp->tpt_m3 = len;
160: tp->tpt_m4 = arg4;
161: tp->tpt_m1 = arg5;
162: break;
163:
164: case TPPTgotXack:
165: case TPPTXack:
166: case TPPTsendack:
167: case TPPTgotack:
168: case TPPTack:
169: case TPPTindicate:
170: default:
171: case TPPTdriver:
172: tp->tpt_m2 = arg;
173: tp->tpt_m3 = src;
174: tp->tpt_m4 = len;
175: tp->tpt_m5 = arg4;
176: tp->tpt_m1 = arg5;
177: break;
178: case TPPTparam:
179: bcopy((caddr_t)src, (caddr_t)&tp->tpt_param, sizeof(struct tp_param));
180: break;
181: case TPPTref:
182: bcopy((caddr_t)src, (caddr_t)&tp->tpt_ref, sizeof(struct tp_ref));
183: break;
184:
185: case TPPTtpduin:
186: case TPPTtpduout:
187: tp->tpt_arg2 = arg4;
188: bcopy((caddr_t)src, (caddr_t)&tp->tpt_tpdu,
189: (unsigned)MIN((int)len, sizeof(struct tp_Trace)));
190: break;
191: }
192: }
193: #endif /* TPPT */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.