projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| b688fc87 WJ |
1 | /* |
| 2 | * Copyright (c) 1982, 1986 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 | * | |
| 33 | * @(#)tcp_debug.c 7.6 (Berkeley) 6/28/90 | |
| 34 | */ | |
| 35 | ||
| 36 | #ifdef TCPDEBUG | |
| 37 | /* load symbolic names */ | |
| 38 | #define PRUREQUESTS | |
| 39 | #define TCPSTATES | |
| 40 | #define TCPTIMERS | |
| 41 | #define TANAMES | |
| 42 | #endif | |
| 43 | ||
| 44 | #include "param.h" | |
| 45 | #include "systm.h" | |
| 46 | #include "mbuf.h" | |
| 47 | #include "socket.h" | |
| 48 | #include "socketvar.h" | |
| 49 | #include "protosw.h" | |
| 50 | #include "errno.h" | |
| 51 | ||
| 52 | #include "../net/route.h" | |
| 53 | #include "../net/if.h" | |
| 54 | ||
| 55 | #include "in.h" | |
| 56 | #include "in_systm.h" | |
| 57 | #include "ip.h" | |
| 58 | #include "in_pcb.h" | |
| 59 | #include "ip_var.h" | |
| 60 | #include "tcp.h" | |
| 61 | #include "tcp_fsm.h" | |
| 62 | #include "tcp_seq.h" | |
| 63 | #include "tcp_timer.h" | |
| 64 | #include "tcp_var.h" | |
| 65 | #include "tcpip.h" | |
| 66 | #include "tcp_debug.h" | |
| 67 | ||
| 68 | #ifdef TCPDEBUG | |
| 69 | int tcpconsdebug = 0; | |
| 70 | #endif | |
| 71 | /* | |
| 72 | * Tcp debug routines | |
| 73 | */ | |
| 74 | tcp_trace(act, ostate, tp, ti, req) | |
| 75 | short act, ostate; | |
| 76 | struct tcpcb *tp; | |
| 77 | struct tcpiphdr *ti; | |
| 78 | int req; | |
| 79 | { | |
| 80 | tcp_seq seq, ack; | |
| 81 | int len, flags; | |
| 82 | struct tcp_debug *td = &tcp_debug[tcp_debx++]; | |
| 83 | ||
| 84 | if (tcp_debx == TCP_NDEBUG) | |
| 85 | tcp_debx = 0; | |
| 86 | td->td_time = iptime(); | |
| 87 | td->td_act = act; | |
| 88 | td->td_ostate = ostate; | |
| 89 | td->td_tcb = (caddr_t)tp; | |
| 90 | if (tp) | |
| 91 | td->td_cb = *tp; | |
| 92 | else | |
| 93 | bzero((caddr_t)&td->td_cb, sizeof (*tp)); | |
| 94 | if (ti) | |
| 95 | td->td_ti = *ti; | |
| 96 | else | |
| 97 | bzero((caddr_t)&td->td_ti, sizeof (*ti)); | |
| 98 | td->td_req = req; | |
| 99 | #ifdef TCPDEBUG | |
| 100 | if (tcpconsdebug == 0) | |
| 101 | return; | |
| 102 | if (tp) | |
| 103 | printf("%x %s:", tp, tcpstates[ostate]); | |
| 104 | else | |
| 105 | printf("???????? "); | |
| 106 | printf("%s ", tanames[act]); | |
| 107 | switch (act) { | |
| 108 | ||
| 109 | case TA_INPUT: | |
| 110 | case TA_OUTPUT: | |
| 111 | case TA_DROP: | |
| 112 | if (ti == 0) | |
| 113 | break; | |
| 114 | seq = ti->ti_seq; | |
| 115 | ack = ti->ti_ack; | |
| 116 | len = ti->ti_len; | |
| 117 | if (act == TA_OUTPUT) { | |
| 118 | seq = ntohl(seq); | |
| 119 | ack = ntohl(ack); | |
| 120 | len = ntohs((u_short)len); | |
| 121 | } | |
| 122 | if (act == TA_OUTPUT) | |
| 123 | len -= sizeof (struct tcphdr); | |
| 124 | if (len) | |
| 125 | printf("[%x..%x)", seq, seq+len); | |
| 126 | else | |
| 127 | printf("%x", seq); | |
| 128 | printf("@%x, urp=%x", ack, ti->ti_urp); | |
| 129 | flags = ti->ti_flags; | |
| 130 | if (flags) { | |
| 131 | #ifndef lint | |
| 132 | char *cp = "<"; | |
| 133 | #define pf(f) { if (ti->ti_flags&TH_/**/f) { printf("%s%s", cp, "f"); cp = ","; } } | |
| 134 | pf(SYN); pf(ACK); pf(FIN); pf(RST); pf(PUSH); pf(URG); | |
| 135 | #endif | |
| 136 | printf(">"); | |
| 137 | } | |
| 138 | break; | |
| 139 | ||
| 140 | case TA_USER: | |
| 141 | printf("%s", prurequests[req&0xff]); | |
| 142 | if ((req & 0xff) == PRU_SLOWTIMO) | |
| 143 | printf("<%s>", tcptimers[req>>8]); | |
| 144 | break; | |
| 145 | } | |
| 146 | if (tp) | |
| 147 | printf(" -> %s", tcpstates[tp->t_state]); | |
| 148 | /* print out internal state of tp !?! */ | |
| 149 | printf("\n"); | |
| 150 | if (tp == 0) | |
| 151 | return; | |
| 152 | printf("\trcv_(nxt,wnd,up) (%x,%x,%x) snd_(una,nxt,max) (%x,%x,%x)\n", | |
| 153 | tp->rcv_nxt, tp->rcv_wnd, tp->rcv_up, tp->snd_una, tp->snd_nxt, | |
| 154 | tp->snd_max); | |
| 155 | printf("\tsnd_(wl1,wl2,wnd) (%x,%x,%x)\n", | |
| 156 | tp->snd_wl1, tp->snd_wl2, tp->snd_wnd); | |
| 157 | #endif /* TCPDEBUG */ | |
| 158 | } |