172 lines
4.6 KiB
C
172 lines
4.6 KiB
C
/*
|
|
* Copyright (c) 1984, 1985, 1986, 1987, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)spp_debug.c 8.1 (Berkeley) 6/10/93
|
|
* $Id$
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/mbuf.h>
|
|
#include <sys/socket.h>
|
|
#include <sys/socketvar.h>
|
|
#include <sys/protosw.h>
|
|
#include <sys/errno.h>
|
|
|
|
#include <net/route.h>
|
|
#include <net/if.h>
|
|
#include <netinet/tcp_fsm.h>
|
|
|
|
#include <netns/ns.h>
|
|
#include <netns/ns_pcb.h>
|
|
#include <netns/idp.h>
|
|
#include <netns/idp_var.h>
|
|
#include <netns/sp.h>
|
|
#include <netns/spidp.h>
|
|
#define SPPTIMERS
|
|
#include <netns/spp_timer.h>
|
|
#include <netns/spp_var.h>
|
|
#define SANAMES
|
|
#include <netns/spp_debug.h>
|
|
|
|
int sppconsdebug = 0;
|
|
/*
|
|
* spp debug routines
|
|
*/
|
|
spp_trace(act, ostate, sp, si, req)
|
|
short act;
|
|
u_char ostate;
|
|
struct sppcb *sp;
|
|
struct spidp *si;
|
|
int req;
|
|
{
|
|
#ifdef INET
|
|
#ifdef TCPDEBUG
|
|
u_short seq, ack, len, alo;
|
|
unsigned long iptime();
|
|
int flags;
|
|
struct spp_debug *sd = &spp_debug[spp_debx++];
|
|
extern char *prurequests[];
|
|
extern char *sanames[];
|
|
extern char *tcpstates[];
|
|
extern char *spptimers[];
|
|
|
|
if (spp_debx == SPP_NDEBUG)
|
|
spp_debx = 0;
|
|
sd->sd_time = iptime();
|
|
sd->sd_act = act;
|
|
sd->sd_ostate = ostate;
|
|
sd->sd_cb = (caddr_t)sp;
|
|
if (sp)
|
|
sd->sd_sp = *sp;
|
|
else
|
|
bzero((caddr_t)&sd->sd_sp, sizeof (*sp));
|
|
if (si)
|
|
sd->sd_si = *si;
|
|
else
|
|
bzero((caddr_t)&sd->sd_si, sizeof (*si));
|
|
sd->sd_req = req;
|
|
if (sppconsdebug == 0)
|
|
return;
|
|
if (ostate >= TCP_NSTATES) ostate = 0;
|
|
if (act >= SA_DROP) act = SA_DROP;
|
|
if (sp)
|
|
printf("%x %s:", sp, tcpstates[ostate]);
|
|
else
|
|
printf("???????? ");
|
|
printf("%s ", sanames[act]);
|
|
switch (act) {
|
|
|
|
case SA_RESPOND:
|
|
case SA_INPUT:
|
|
case SA_OUTPUT:
|
|
case SA_DROP:
|
|
if (si == 0)
|
|
break;
|
|
seq = si->si_seq;
|
|
ack = si->si_ack;
|
|
alo = si->si_alo;
|
|
len = si->si_len;
|
|
if (act == SA_OUTPUT) {
|
|
seq = ntohs(seq);
|
|
ack = ntohs(ack);
|
|
alo = ntohs(alo);
|
|
len = ntohs(len);
|
|
}
|
|
#ifndef lint
|
|
#define p1(f) { printf("%s = %x, ", "f", f); }
|
|
p1(seq); p1(ack); p1(alo); p1(len);
|
|
#endif
|
|
flags = si->si_cc;
|
|
if (flags) {
|
|
char *cp = "<";
|
|
#ifndef lint
|
|
#define pf(f) { if (flags&SP_/**/f) { printf("%s%s", cp, "f"); cp = ","; } }
|
|
pf(SP); pf(SA); pf(OB); pf(EM);
|
|
#else
|
|
cp = cp;
|
|
#endif
|
|
printf(">");
|
|
}
|
|
#ifndef lint
|
|
#define p2(f) { printf("%s = %x, ", "f", si->si_/**/f); }
|
|
p2(sid);p2(did);p2(dt);p2(pt);
|
|
#endif
|
|
ns_printhost(&si->si_sna);
|
|
ns_printhost(&si->si_dna);
|
|
|
|
if (act==SA_RESPOND) {
|
|
printf("idp_len = %x, ",
|
|
((struct idp *)si)->idp_len);
|
|
}
|
|
break;
|
|
|
|
case SA_USER:
|
|
printf("%s", prurequests[req&0xff]);
|
|
if ((req & 0xff) == PRU_SLOWTIMO)
|
|
printf("<%s>", spptimers[req>>8]);
|
|
break;
|
|
}
|
|
if (sp)
|
|
printf(" -> %s", tcpstates[sp->s_state]);
|
|
/* print out internal state of sp !?! */
|
|
printf("\n");
|
|
if (sp == 0)
|
|
return;
|
|
#ifndef lint
|
|
#define p3(f) { printf("%s = %x, ", "f", sp->s_/**/f); }
|
|
printf("\t"); p3(rack);p3(ralo);p3(smax);p3(flags); printf("\n");
|
|
#endif
|
|
#endif
|
|
#endif
|
|
}
|