Return to tp_trace.c CVS log

Up to [Apple Darwin 0.x] / kernel / bsd / netiso

Annotation of kernel/bsd/netiso/tp_trace.c, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
        !             3:  *
        !             4:  * @APPLE_LICENSE_HEADER_START@
        !             5:  * 
        !             6:  * Portions Copyright (c) 1999 Apple Computer, Inc.  All Rights
        !             7:  * Reserved.  This file contains Original Code and/or Modifications of
        !             8:  * Original Code as defined in and that are subject to the Apple Public
        !             9:  * Source License Version 1.1 (the "License").  You may not use this file
        !            10:  * except in compliance with the License.  Please obtain a copy of the
        !            11:  * License at http://www.apple.com/publicsource and read it before using
        !            12:  * this file.
        !            13:  * 
        !            14:  * The Original Code and all software distributed under the License are
        !            15:  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
        !            16:  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
        !            17:  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
        !            18:  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
        !            19:  * License for the specific language governing rights and limitations
        !            20:  * under the License.
        !            21:  * 
        !            22:  * @APPLE_LICENSE_HEADER_END@
        !            23:  */
        !            24: 
        !            25: /*-
        !            26:  * Copyright (c) 1991, 1993
        !            27:  *     The Regents of the University of California.  All rights reserved.
        !            28:  *
        !            29:  * Redistribution and use in source and binary forms, with or without
        !            30:  * modification, are permitted provided that the following conditions
        !            31:  * are met:
        !            32:  * 1. Redistributions of source code must retain the above copyright
        !            33:  *    notice, this list of conditions and the following disclaimer.
        !            34:  * 2. Redistributions in binary form must reproduce the above copyright
        !            35:  *    notice, this list of conditions and the following disclaimer in the
        !            36:  *    documentation and/or other materials provided with the distribution.
        !            37:  * 3. All advertising materials mentioning features or use of this software
        !            38:  *    must display the following acknowledgement:
        !            39:  *     This product includes software developed by the University of
        !            40:  *     California, Berkeley and its contributors.
        !            41:  * 4. Neither the name of the University nor the names of its contributors
        !            42:  *    may be used to endorse or promote products derived from this software
        !            43:  *    without specific prior written permission.
        !            44:  *
        !            45:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
        !            46:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
        !            47:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
        !            48:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
        !            49:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
        !            50:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
        !            51:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
        !            52:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
        !            53:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
        !            54:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
        !            55:  * SUCH DAMAGE.
        !            56:  *
        !            57:  *     @(#)tp_trace.c  8.1 (Berkeley) 6/10/93
        !            58:  */
        !            59: 
        !            60: /***********************************************************
        !            61:                Copyright IBM Corporation 1987
        !            62: 
        !            63:                       All Rights Reserved
        !            64: 
        !            65: Permission to use, copy, modify, and distribute this software and its 
        !            66: documentation for any purpose and without fee is hereby granted, 
        !            67: provided that the above copyright notice appear in all copies and that
        !            68: both that copyright notice and this permission notice appear in 
        !            69: supporting documentation, and that the name of IBM not be
        !            70: used in advertising or publicity pertaining to distribution of the
        !            71: software without specific, written prior permission.  
        !            72: 
        !            73: IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
        !            74: ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
        !            75: IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
        !            76: ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
        !            77: WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
        !            78: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
        !            79: SOFTWARE.
        !            80: 
        !            81: ******************************************************************/
        !            82: 
        !            83: /*
        !            84:  * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison
        !            85:  */
        !            86: /* 
        !            87:  * ARGO TP
        !            88:  *
        !            89:  * The whole protocol trace module.
        !            90:  * We keep a circular buffer of trace structures, which are big
        !            91:  * unions of different structures we might want to see.
        !            92:  * Unfortunately this gets too big pretty easily. Pcbs were removed
        !            93:  * from the tracing when the kernel got too big to boot.
        !            94:  */
        !            95: 
        !            96: #define TP_TRACEFILE
        !            97: 
        !            98: #include <sys/param.h>
        !            99: #include <sys/systm.h>
        !           100: #include <sys/mbuf.h>
        !           101: #include <sys/socket.h>
        !           102: #include <sys/time.h>
        !           103: 
        !           104: #include <netiso/tp_param.h>
        !           105: #include <netiso/tp_timer.h>
        !           106: #include <netiso/tp_stat.h>
        !           107: #include <netiso/tp_param.h>
        !           108: #include <netiso/tp_ip.h>
        !           109: #include <netiso/tp_pcb.h>
        !           110: #include <netiso/tp_tpdu.h>
        !           111: #include <netiso/argo_debug.h>
        !           112: #include <netiso/tp_trace.h>
        !           113: 
        !           114: #ifdef TPPT
        !           115: static tp_seq = 0;
        !           116: u_char tp_traceflags[128];
        !           117: 
        !           118: /*
        !           119:  * The argument tpcb is the obvious.
        !           120:  * event here is just the type of trace event - TPPTmisc, etc.
        !           121:  * The rest of the arguments have different uses depending
        !           122:  * on the type of trace event.
        !           123:  */
        !           124: /*ARGSUSED*/
        !           125: /*VARARGS*/
        !           126: 
        !           127: void
        !           128: tpTrace(tpcb, event, arg, src, len, arg4, arg5)
        !           129:        struct tp_pcb   *tpcb;
        !           130:        u_int                   event, arg;
        !           131:        u_int                   src;
        !           132:        u_int                   len; 
        !           133:        u_int                   arg4;
        !           134:        u_int                   arg5;
        !           135: {
        !           136:        register struct tp_Trace *tp;
        !           137: 
        !           138:        tp = &tp_Trace[tp_Tracen++];
        !           139:        tp_Tracen %= TPTRACEN;
        !           140: 
        !           141:        tp->tpt_event = event;
        !           142:        tp->tpt_tseq = tp_seq++;
        !           143:        tp->tpt_arg = arg;
        !           144:        if(tpcb)
        !           145:                tp->tpt_arg2 = tpcb->tp_lref;
        !           146:        bcopy( (caddr_t)&time, (caddr_t)&tp->tpt_time, sizeof(struct timeval) );
        !           147: 
        !           148:        switch(event) {
        !           149: 
        !           150:        case TPPTertpdu:
        !           151:                bcopy((caddr_t)src, (caddr_t)&tp->tpt_ertpdu,
        !           152:                        (unsigned)MIN((int)len, sizeof(struct tp_Trace)));
        !           153:                break;
        !           154: 
        !           155:        case TPPTusrreq:
        !           156:        case TPPTmisc:
        !           157: 
        !           158:                /* arg is a string */
        !           159:                bcopy((caddr_t)arg, (caddr_t)tp->tpt_str, 
        !           160:                        (unsigned)MIN(1+strlen((caddr_t) arg), TPTRACE_STRLEN));
        !           161:                tp->tpt_m2 = src; 
        !           162:                tp->tpt_m3 = len;
        !           163:                tp->tpt_m4 = arg4;
        !           164:                tp->tpt_m1 = arg5;
        !           165:                break;
        !           166: 
        !           167:        case TPPTgotXack: 
        !           168:        case TPPTXack: 
        !           169:        case TPPTsendack: 
        !           170:        case TPPTgotack: 
        !           171:        case TPPTack: 
        !           172:        case TPPTindicate: 
        !           173:        default:
        !           174:        case TPPTdriver: 
        !           175:                tp->tpt_m2 = arg; 
        !           176:                tp->tpt_m3 = src;
        !           177:                tp->tpt_m4 = len;
        !           178:                tp->tpt_m5 = arg4;
        !           179:                tp->tpt_m1 = arg5; 
        !           180:                break;
        !           181:        case TPPTparam:
        !           182:                bcopy((caddr_t)src, (caddr_t)&tp->tpt_param, sizeof(struct tp_param));
        !           183:                break;
        !           184:        case TPPTref:
        !           185:                bcopy((caddr_t)src, (caddr_t)&tp->tpt_ref, sizeof(struct tp_ref));
        !           186:                break;
        !           187: 
        !           188:        case TPPTtpduin:
        !           189:        case TPPTtpduout:
        !           190:                tp->tpt_arg2 = arg4;
        !           191:                bcopy((caddr_t)src, (caddr_t)&tp->tpt_tpdu,
        !           192:                      (unsigned)MIN((int)len, sizeof(struct tp_Trace)));
        !           193:                break;
        !           194:        }
        !           195: }
        !           196: #endif /* TPPT */

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.