1130b656e5
This will make a number of things easier in the future, as well as (finally!) avoiding the Id-smashing problem which has plagued developers for so long. Boy, I'm glad we're not using sup anymore. This update would have been insane otherwise.
169 lines
4.5 KiB
C
169 lines
4.5 KiB
C
/*
|
|
* Copyright (c) 1982, 1986, 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.
|
|
*
|
|
* @(#)tcp_debug.c 8.1 (Berkeley) 6/10/93
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifdef TCPDEBUG
|
|
/* load symbolic names */
|
|
#define PRUREQUESTS
|
|
#define TCPSTATES
|
|
#define TCPTIMERS
|
|
#define TANAMES
|
|
#endif
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/queue.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/in.h>
|
|
#include <netinet/in_systm.h>
|
|
#include <netinet/ip.h>
|
|
#include <netinet/in_pcb.h>
|
|
#include <netinet/ip_var.h>
|
|
#include <netinet/tcp.h>
|
|
#include <netinet/tcp_fsm.h>
|
|
#include <netinet/tcp_seq.h>
|
|
#include <netinet/tcp_timer.h>
|
|
#include <netinet/tcp_var.h>
|
|
#include <netinet/tcpip.h>
|
|
#include <netinet/tcp_debug.h>
|
|
|
|
#ifdef TCPDEBUG
|
|
static int tcpconsdebug = 0;
|
|
#endif
|
|
|
|
static struct tcp_debug tcp_debug[TCP_NDEBUG];
|
|
static int tcp_debx;
|
|
|
|
/*
|
|
* Tcp debug routines
|
|
*/
|
|
void
|
|
tcp_trace(act, ostate, tp, ti, req)
|
|
short act, ostate;
|
|
struct tcpcb *tp;
|
|
struct tcpiphdr *ti;
|
|
int req;
|
|
{
|
|
tcp_seq seq, ack;
|
|
int len, flags;
|
|
struct tcp_debug *td = &tcp_debug[tcp_debx++];
|
|
|
|
if (tcp_debx == TCP_NDEBUG)
|
|
tcp_debx = 0;
|
|
td->td_time = iptime();
|
|
td->td_act = act;
|
|
td->td_ostate = ostate;
|
|
td->td_tcb = (caddr_t)tp;
|
|
if (tp)
|
|
td->td_cb = *tp;
|
|
else
|
|
bzero((caddr_t)&td->td_cb, sizeof (*tp));
|
|
if (ti)
|
|
td->td_ti = *ti;
|
|
else
|
|
bzero((caddr_t)&td->td_ti, sizeof (*ti));
|
|
td->td_req = req;
|
|
#ifdef TCPDEBUG
|
|
if (tcpconsdebug == 0)
|
|
return;
|
|
if (tp)
|
|
printf("%p %s:", tp, tcpstates[ostate]);
|
|
else
|
|
printf("???????? ");
|
|
printf("%s ", tanames[act]);
|
|
switch (act) {
|
|
|
|
case TA_INPUT:
|
|
case TA_OUTPUT:
|
|
case TA_DROP:
|
|
if (ti == 0)
|
|
break;
|
|
seq = ti->ti_seq;
|
|
ack = ti->ti_ack;
|
|
len = ti->ti_len;
|
|
if (act == TA_OUTPUT) {
|
|
seq = ntohl(seq);
|
|
ack = ntohl(ack);
|
|
len = ntohs((u_short)len);
|
|
}
|
|
if (act == TA_OUTPUT)
|
|
len -= sizeof (struct tcphdr);
|
|
if (len)
|
|
printf("[%x..%x)", seq, seq+len);
|
|
else
|
|
printf("%x", seq);
|
|
printf("@%x, urp=%x", ack, ti->ti_urp);
|
|
flags = ti->ti_flags;
|
|
if (flags) {
|
|
char *cp = "<";
|
|
#define pf(f) { \
|
|
if (ti->ti_flags & TH_##f) { \
|
|
printf("%s%s", cp, #f); \
|
|
cp = ","; \
|
|
} \
|
|
}
|
|
pf(SYN); pf(ACK); pf(FIN); pf(RST); pf(PUSH); pf(URG);
|
|
printf(">");
|
|
}
|
|
break;
|
|
|
|
case TA_USER:
|
|
printf("%s", prurequests[req&0xff]);
|
|
if ((req & 0xff) == PRU_SLOWTIMO)
|
|
printf("<%s>", tcptimers[req>>8]);
|
|
break;
|
|
}
|
|
if (tp)
|
|
printf(" -> %s", tcpstates[tp->t_state]);
|
|
/* print out internal state of tp !?! */
|
|
printf("\n");
|
|
if (tp == 0)
|
|
return;
|
|
printf("\trcv_(nxt,wnd,up) (%x,%x,%x) snd_(una,nxt,max) (%x,%x,%x)\n",
|
|
tp->rcv_nxt, tp->rcv_wnd, tp->rcv_up, tp->snd_una, tp->snd_nxt,
|
|
tp->snd_max);
|
|
printf("\tsnd_(wl1,wl2,wnd) (%x,%x,%x)\n",
|
|
tp->snd_wl1, tp->snd_wl2, tp->snd_wnd);
|
|
#endif /* TCPDEBUG */
|
|
}
|