/* $NetBSD: trpt.c,v 1.10 2001/02/19 23:22:48 cgd Exp $ */ /*- * Copyright (c) 1997 The NetBSD Foundation, Inc. * All rights reserved. * * This code is derived from software contributed to The NetBSD Foundation * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility, * NASA Ames Research Center. * * 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 NetBSD * Foundation, Inc. and its contributors. * 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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. */ /* * Copyright (c) 1983, 1988, 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. */ #include #ifndef lint __COPYRIGHT( "@(#) Copyright (c) 1983, 1988, 1993\n\ The Regents of the University of California. All rights reserved.\n"); #endif /* not lint */ #ifndef lint #if 0 static char sccsid[] = "@(#)trpt.c 8.1 (Berkeley) 6/6/93"; #else __RCSID("$NetBSD: trpt.c,v 1.10 2001/02/19 23:22:48 cgd Exp $"); #endif #endif /* not lint */ #include #include #include #include #define PRUREQUESTS #include #include #include #include #include #include #include #include #include #ifdef INET6 #ifndef INET #include #endif #include #endif #include #define TCPSTATES #include #include #define TCPTIMERS #include #include #include #define TANAMES #include #include #include #include #include #include #include #include #include #include #include struct nlist nl[] = { #define N_TCP_DEBUG 0 { "_tcp_debug" }, #define N_TCP_DEBX 1 { "_tcp_debx" }, { NULL }, }; static caddr_t tcp_pcbs[TCP_NDEBUG]; static n_time ntime; static int aflag, follow, sflag, tflag; int main __P((int, char *[])); void dotrace __P((caddr_t)); void tcp_trace __P((short, short, struct tcpcb *, struct tcpcb *, int, void *, int)); int numeric __P((const void *, const void *)); void usage __P((void)); kvm_t *kd; int main(argc, argv) int argc; char *argv[]; { int ch, i, jflag, npcbs; char *system, *core, *cp, errbuf[_POSIX2_LINE_MAX]; gid_t egid = getegid(); (void)setegid(getgid()); system = core = NULL; jflag = npcbs = 0; while ((ch = getopt(argc, argv, "afjp:st")) != -1) { switch (ch) { case 'a': ++aflag; break; case 'f': ++follow; setlinebuf(stdout); break; case 'j': ++jflag; break; case 'p': if (npcbs >= TCP_NDEBUG) errx(1, "too many pcbs specified"); errno = 0; tcp_pcbs[npcbs++] = (caddr_t)strtoul(optarg, &cp, 16); if (*cp != '\0' || errno == ERANGE) errx(1, "invalid address: %s", optarg); break; case 's': ++sflag; break; case 't': ++tflag; break; case 'N': system = optarg; break; case 'M': core = optarg; break; case '?': default: usage(); /* NOTREACHED */ } } argc -= optind; argv += optind; if (argc) usage(); /* * Discard setgid privileges. If not the running kernel, we toss * them away totally so that bad guys can't print interesting stuff * from kernel memory, otherwise switch back to kmem for the * duration of the kvm_openfiles() call. */ if (core != NULL || system != NULL) setgid(getgid()); else setegid(egid); kd = kvm_openfiles(system, core, NULL, O_RDONLY, errbuf); if (kd == NULL) errx(1, "can't open kmem: %s", errbuf); /* get rid of it now anyway */ if (core == NULL && system == NULL) setgid(getgid()); if (kvm_nlist(kd, nl)) errx(2, "%s: no namelist", system ? system : _PATH_UNIX); if (kvm_read(kd, nl[N_TCP_DEBX].n_value, (char *)&tcp_debx, sizeof(tcp_debx)) != sizeof(tcp_debx)) errx(3, "tcp_debx: %s", kvm_geterr(kd)); if (kvm_read(kd, nl[N_TCP_DEBUG].n_value, (char *)tcp_debug, sizeof(tcp_debug)) != sizeof(tcp_debug)) errx(3, "tcp_debug: %s", kvm_geterr(kd)); /* * If no control blocks have been specified, figure * out how many distinct one we have and summarize * them in tcp_pcbs for sorting the trace records * below. */ if (npcbs == 0) { for (i = 0; i < TCP_NDEBUG; i++) { struct tcp_debug *td = &tcp_debug[i]; int j; if (td->td_tcb == 0) continue; for (j = 0; j < npcbs; j++) if (tcp_pcbs[j] == td->td_tcb) break; if (j >= npcbs) tcp_pcbs[npcbs++] = td->td_tcb; } if (npcbs == 0) exit(0); } qsort(tcp_pcbs, npcbs, sizeof(caddr_t), numeric); if (jflag) { for (i = 0;;) { printf("%lx", (long)tcp_pcbs[i]); if (++i == npcbs) break; fputs(", ", stdout); } putchar('\n'); } else { for (i = 0; i < npcbs; i++) { printf("\n%lx:\n", (long)tcp_pcbs[i]); dotrace(tcp_pcbs[i]); } } exit(0); } void dotrace(tcpcb) caddr_t tcpcb; { struct tcp_debug *td; int prev_debx = tcp_debx; int i; again: if (--tcp_debx < 0) tcp_debx = TCP_NDEBUG - 1; for (i = prev_debx % TCP_NDEBUG; i < TCP_NDEBUG; i++) { td = &tcp_debug[i]; if (tcpcb && td->td_tcb != tcpcb) continue; ntime = ntohl(td->td_time); switch (td->td_family) { case AF_INET: tcp_trace(td->td_act, td->td_ostate, (struct tcpcb *)td->td_tcb, &td->td_cb, td->td_family, &td->td_ti, td->td_req); break; #ifdef INET6 case AF_INET6: tcp_trace(td->td_act, td->td_ostate, (struct tcpcb *)td->td_tcb, &td->td_cb, td->td_family, &td->td_ti6, td->td_req); break; #endif default: tcp_trace(td->td_act, td->td_ostate, (struct tcpcb *)td->td_tcb, &td->td_cb, td->td_family, NULL, td->td_req); break; } if (i == tcp_debx) goto done; } for (i = 0; i <= tcp_debx % TCP_NDEBUG; i++) { td = &tcp_debug[i]; if (tcpcb && td->td_tcb != tcpcb) continue; ntime = ntohl(td->td_time); switch (td->td_family) { case AF_INET: tcp_trace(td->td_act, td->td_ostate, (struct tcpcb *)td->td_tcb, &td->td_cb, td->td_family, &td->td_ti, td->td_req); break; #ifdef INET6 case AF_INET6: tcp_trace(td->td_act, td->td_ostate, (struct tcpcb *)td->td_tcb, &td->td_cb, td->td_family, &td->td_ti6, td->td_req); break; #endif default: tcp_trace(td->td_act, td->td_ostate, (struct tcpcb *)td->td_tcb, &td->td_cb, td->td_family, NULL, td->td_req); break; } } done: if (follow) { prev_debx = tcp_debx + 1; if (prev_debx >= TCP_NDEBUG) prev_debx = 0; do { sleep(1); if (kvm_read(kd, nl[N_TCP_DEBX].n_value, (char *)&tcp_debx, sizeof(tcp_debx)) != sizeof(tcp_debx)) errx(3, "tcp_debx: %s", kvm_geterr(kd)); } while (tcp_debx == prev_debx); if (kvm_read(kd, nl[N_TCP_DEBUG].n_value, (char *)tcp_debug, sizeof(tcp_debug)) != sizeof(tcp_debug)) errx(3, "tcp_debug: %s", kvm_geterr(kd)); goto again; } } /* * Tcp debug routines */ /*ARGSUSED*/ void tcp_trace(act, ostate, atp, tp, family, packet, req) short act, ostate; struct tcpcb *atp, *tp; int family; void *packet; int req; { tcp_seq seq, ack; int flags, len, win, timer; struct tcphdr *th = NULL; struct ip *ip = NULL; #ifdef INET6 struct ip6_hdr *ip6 = NULL; #endif char hbuf[MAXHOSTNAMELEN]; switch (family) { case AF_INET: if (packet) { ip = (struct ip *)packet; th = (struct tcphdr *)(ip + 1); } break; #ifdef INET6 case AF_INET6: if (packet) { ip6 = (struct ip6_hdr *)packet; th = (struct tcphdr *)(ip6 + 1); } break; #endif default: return; } printf("%03d %s:%s ", (ntime/10) % 1000, tcpstates[ostate], tanames[act]); #ifndef INET6 if (!ip) #else if (!(ip || ip6)) #endif goto skipact; switch (act) { case TA_INPUT: case TA_OUTPUT: case TA_DROP: if (aflag) { inet_ntop(family, #ifndef INET6 (void *)&ip->ip_src, #else family == AF_INET ? (void *)&ip->ip_src : (void *)&ip6->ip6_src, #endif hbuf, sizeof(hbuf)); printf("(src=%s,%u, ", hbuf, ntohs(th->th_sport)); inet_ntop(family, #ifndef INET6 (void *)&ip->ip_dst, #else family == AF_INET ? (void *)&ip->ip_dst : (void *)&ip6->ip6_dst, #endif hbuf, sizeof(hbuf)); printf("dst=%s,%u)", hbuf, ntohs(th->th_dport)); } seq = th->th_seq; ack = th->th_ack; if (ip) len = ip->ip_len; #ifdef INET6 else if (ip6) len = ip6->ip6_plen; #endif win = th->th_win; if (act == TA_OUTPUT) { NTOHL(seq); NTOHL(ack); NTOHS(len); NTOHS(win); } if (act == TA_OUTPUT) len -= sizeof(struct tcphdr); if (len) printf("[%x..%x)", seq, seq + len); else printf("%x", seq); printf("@%x", ack); if (win) printf("(win=%x)", win); flags = th->th_flags; if (flags) { register char *cp = "<"; #define pf(flag, string) { \ if (th->th_flags&flag) { \ (void)printf("%s%s", cp, string); \ cp = ","; \ } \ } pf(TH_SYN, "SYN"); pf(TH_ACK, "ACK"); pf(TH_FIN, "FIN"); pf(TH_RST, "RST"); pf(TH_PUSH, "PUSH"); pf(TH_URG, "URG"); printf(">"); } break; case TA_USER: timer = req >> 8; req &= 0xff; printf("%s", prurequests[req]); if (req == PRU_SLOWTIMO || req == PRU_FASTTIMO) printf("<%s>", tcptimers[timer]); break; } skipact: printf(" -> %s", tcpstates[tp->t_state]); /* print out internal state of tp !?! */ printf("\n"); if (sflag) { printf("\trcv_nxt %x rcv_wnd %lx snd_una %x snd_nxt %x snd_max %x\n", tp->rcv_nxt, tp->rcv_wnd, tp->snd_una, tp->snd_nxt, tp->snd_max); printf("\tsnd_wl1 %x snd_wl2 %x snd_wnd %lx\n", tp->snd_wl1, tp->snd_wl2, tp->snd_wnd); } /* print out timers? */ if (tflag) { register char *cp = "\t"; register int i; for (i = 0; i < TCPT_NTIMERS; i++) { if (tp->t_timer[i] == 0) continue; printf("%s%s=%d", cp, tcptimers[i], tp->t_timer[i]); if (i == TCPT_REXMT) printf(" (t_rxtshft=%d)", tp->t_rxtshift); cp = ", "; } if (*cp != '\t') putchar('\n'); } } int numeric(v1, v2) const void *v1, *v2; { const caddr_t *c1 = v1; const caddr_t *c2 = v2; int rv; if (*c1 < *c2) rv = -1; else if (*c1 > *c2) rv = 1; else rv = 0; return (rv); } void usage() { (void) fprintf(stderr, "usage: %s [-afjst] [-p hex-address]" " [-N system] [-M core]\n", getprogname()); exit(1); }