summaryrefslogtreecommitdiffstats
path: root/usr.sbin/traceroute
diff options
context:
space:
mode:
authorfenner <fenner@FreeBSD.org>1996-09-30 19:49:54 +0000
committerfenner <fenner@FreeBSD.org>1996-09-30 19:49:54 +0000
commit8c9f462db0e64312a9d88a3f3a34d1168e8537d1 (patch)
tree4066d1e18814e55424c87a769db83ec021652993 /usr.sbin/traceroute
parent44721b732a7df98046e2de1e5ffac91fee7fce44 (diff)
downloadFreeBSD-src-8c9f462db0e64312a9d88a3f3a34d1168e8537d1.zip
FreeBSD-src-8c9f462db0e64312a9d88a3f3a34d1168e8537d1.tar.gz
Grab traceroute out of src/contrib/traceroute
Diffstat (limited to 'usr.sbin/traceroute')
-rw-r--r--usr.sbin/traceroute/Makefile17
-rw-r--r--usr.sbin/traceroute/README29
-rw-r--r--usr.sbin/traceroute/gnuc.h43
-rw-r--r--usr.sbin/traceroute/mean.awk50
-rw-r--r--usr.sbin/traceroute/median.awk67
-rw-r--r--usr.sbin/traceroute/traceroute.8342
-rw-r--r--usr.sbin/traceroute/traceroute.c895
7 files changed, 14 insertions, 1429 deletions
diff --git a/usr.sbin/traceroute/Makefile b/usr.sbin/traceroute/Makefile
index 337f129..6d6bba3 100644
--- a/usr.sbin/traceroute/Makefile
+++ b/usr.sbin/traceroute/Makefile
@@ -1,14 +1,25 @@
-# @(#)Makefile 8.1 (Berkeley) 6/6/93
+# $Id: $
PROG= traceroute
MAN8= traceroute.8
BINOWN= root
BINMODE=4555
-CFLAGS+=-DHAVE_BZERO=1 -DHAVE_SETLINEBUF=1
-
+CFLAGS+=-DHAVE_SYS_SELECT_H=1 -DHAVE_SETLINEBUF=1 -DHAVE_RAW_OPTIONS=1 \
+ -DSTDC_HEADERS=1
# RTT Jitter on the internet these days means printing 3 decimal places on
# > 1000ms times is plain useless. Uncomment this to enable variable precision
# reporting, ie: print a variable precision from 0.001ms through 1000ms
# CFLAGS+=-DSANE_PRECISION
+SRCS= version.c traceroute.c
+CLEANFILES+= version.c
+
+TRACEROUTE_DISTDIR?= ${.CURDIR}/../../contrib/traceroute
+CFLAGS+= -I${TRACEROUTE_DISTDIR}/lbl
+.PATH: ${TRACEROUTE_DISTDIR}
+
+version.c: ${TRACEROUTE_DISTDIR}/VERSION
+ @rm -f $@
+ sed -e 's/.*/char version[] = "&";/' ${TRACEROUTE_DISTDIR}/VERSION > $@
+
.include <bsd.prog.mk>
diff --git a/usr.sbin/traceroute/README b/usr.sbin/traceroute/README
deleted file mode 100644
index 9d9f4e2..0000000
--- a/usr.sbin/traceroute/README
+++ /dev/null
@@ -1,29 +0,0 @@
-@(#) $Header: README,v 1.6 95/08/27 16:58:04 leres Exp $ (LBL)
-
-TRACEROUTE 1.2
-Lawrence Berkeley National Laboratory
-Network Research Group
-traceroute@ee.lbl.gov
-ftp://ftp.ee.lbl.gov/traceroute-*.tar.Z
-
-Traceroute is a system administrators utility to trace the route
-ip packets from the current system take in getting to some
-destination system. See the comments at the front of the
-program for a description of its use.
-
-This program uses raw ip sockets and must be run as root (or installed
-setuid to root).
-
-A couple of awk programs to massage the traceroute output are
-included. "mean.awk" and "median.awk" compute the mean and median time
-to each hop, respectively. I've found that something like
-
- traceroute -q 7 foo.somewhere >t
- awk -f median.awk t | graph
-
-can give you a quick picture of the bad spots on a long path (median is
-usually a better noise filter than mean).
-
-Problems, bugs, questions, desirable enhancements, source code
-contributions, etc., should be sent to the email address
-"traceroute@ee.lbl.gov".
diff --git a/usr.sbin/traceroute/gnuc.h b/usr.sbin/traceroute/gnuc.h
deleted file mode 100644
index 9a3200c..0000000
--- a/usr.sbin/traceroute/gnuc.h
+++ /dev/null
@@ -1,43 +0,0 @@
-/* @(#) $Header: gnuc.h,v 1.3 95/10/09 02:47:01 leres Exp $ (LBL) */
-
-/* Define __P() macro, if necessary */
-#ifndef __P
-#if __STDC__
-#define __P(protos) protos
-#else
-#define __P(protos) ()
-#endif
-#endif
-
-/* inline foo */
-#ifdef __GNUC__
-#define inline __inline
-#else
-#define inline
-#endif
-
-/*
- * Handle new and old "dead" routine prototypes
- *
- * For example:
- *
- * __dead void foo(void) __attribute__((volatile));
- *
- */
-#ifdef __GNUC__
-#ifndef __dead
-#define __dead volatile
-#endif
-#if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 5)
-#ifndef __attribute__
-#define __attribute__(args)
-#endif
-#endif
-#else
-#ifndef __dead
-#define __dead
-#endif
-#ifndef __attribute__
-#define __attribute__(args)
-#endif
-#endif
diff --git a/usr.sbin/traceroute/mean.awk b/usr.sbin/traceroute/mean.awk
deleted file mode 100644
index e97a56f..0000000
--- a/usr.sbin/traceroute/mean.awk
+++ /dev/null
@@ -1,50 +0,0 @@
-#!/bin/awk -f
-#
-# Copyright (c) 1990, 1993
-# The Regents of the University of California. All rights reserved.
-#
-# This code is derived from software contributed to Berkeley by
-# Van Jacobson.
-#
-# 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.
-#
-# @(#)mean.awk 8.1 (Berkeley) 6/6/93
-#
-/^ *[0-9]/ {
- # print out the average time to each hop along a route.
- tottime = 0; n = 0;
- for (f = 5; f <= NF; ++f) {
- if ($f == "ms") {
- tottime += $(f - 1)
- ++n
- }
- }
- if (n > 0)
- print $1, tottime/n, median
-}
diff --git a/usr.sbin/traceroute/median.awk b/usr.sbin/traceroute/median.awk
deleted file mode 100644
index 1a8d81d..0000000
--- a/usr.sbin/traceroute/median.awk
+++ /dev/null
@@ -1,67 +0,0 @@
-#!/bin/awk -f
-#
-# Copyright (c) 1990, 1993
-# The Regents of the University of California. All rights reserved.
-#
-# This code is derived from software contributed to Berkeley by
-# Van Jacobson.
-#
-# 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.
-#
-# @(#)median.awk 8.1 (Berkeley) 6/6/93
-#
-/^ *[0-9]/ {
- # print out the median time to each hop along a route.
- tottime = 0; n = 0;
- for (f = 5; f <= NF; ++f) {
- if ($f == "ms") {
- ++n
- time[n] = $(f - 1)
- }
- }
- if (n > 0) {
- # insertion sort the times to find the median
- for (i = 2; i <= n; ++i) {
- v = time[i]; j = i - 1;
- while (time[j] > v) {
- time[j+1] = time[j];
- j = j - 1;
- if (j < 0)
- break;
- }
- time[j+1] = v;
- }
- if (n > 1 && (n % 2) == 0)
- median = (time[n/2] + time[(n/2) + 1]) / 2
- else
- median = time[(n+1)/2]
-
- print $1, median
- }
-}
diff --git a/usr.sbin/traceroute/traceroute.8 b/usr.sbin/traceroute/traceroute.8
deleted file mode 100644
index 15001e9..0000000
--- a/usr.sbin/traceroute/traceroute.8
+++ /dev/null
@@ -1,342 +0,0 @@
-.\" Copyright (c) 1990, 1991, 1993
-.\" The Regents of the University of California. All rights reserved.
-.\"
-.\" This code is derived from software contributed to Berkeley by
-.\" Van Jacobson.
-.\"
-.\" 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.
-.\"
-.\" @(#)traceroute.8 8.1 (Berkeley) 6/6/93
-.\"
-.Dd March 7, 1996
-.Dt TRACEROUTE 8
-.Os BSD 4.3
-.Sh NAME
-.Nm traceroute
-.Nd print the route packets take to network host
-.Sh SYNOPSIS
-.Nm traceroute
-.Op Fl g Ar gateway
-.Op Fl m Ar max_ttl
-.Op Fl n
-.Op Fl p Ar port
-.Op Fl q Ar nqueries
-.Op Fl r
-.Bk -words
-.Op Fl s Ar src_addr
-.Ek
-.Op Fl t Ar tos
-.Op Fl v
-.Op Fl w Ar waittime
-.Ar host
-.Op Ar packetsize
-.Sh DESCRIPTION
-The Internet is a large and complex aggregation of
-network hardware, connected together by gateways.
-Tracking the route one's packets follow (or finding the miscreant
-gateway that's discarding your packets) can be difficult.
-.Nm Traceroute
-utilizes the IP protocol `time to live' field and attempts to elicit an
-.Tn ICMP
-.Dv TIME_EXCEEDED
-response from each gateway along the path to some
-host.
-.Pp
-The only mandatory parameter is the destination host name or IP number.
-The default probe datagram length is 38 bytes, but this may be increased
-by specifying a packet size (in bytes) after the destination host
-name.
-.Pp
-Other options are:
-.Bl -tag -width Ds
-.It Fl g Ar gateway
-Add a loose-source-route IP option onto the ICMP packet to direct traffic
-to traverse the specified gateway.
-Multiple gateway options may be specified on the command line.
-.It Fl m Ar max_ttl
-Set the max time-to-live (max number of hops) used in outgoing probe
-packets. The default is 30 hops (the same default used for
-.Tn TCP
-connections).
-.It Fl n
-Print hop addresses numerically rather than symbolically and numerically
-(saves a nameserver address-to-name lookup for each gateway found on the
-path).
-.It Fl p Ar port
-Set the base
-.Tn UDP
-.Ar port
-number used in probes (default is 33434).
-.Nm Traceroute
-hopes that nothing is listening on
-.Tn UDP
-ports
-.Em base
-to
-.Em base+nhops-1
-at the destination host (so an
-.Tn ICMP
-.Dv PORT_UNREACHABLE
-message will
-be returned to terminate the route tracing). If something is
-listening on a port in the default range, this option can be used
-to pick an unused port range.
-.It Fl q Ar nqueries
-Set the number of probes per ``ttl'' to
-.Ar nqueries
-(default is three probes).
-.It Fl r
-Bypass the normal routing tables and send directly to a host on an attached
-network.
-If the host is not on a directly-attached network,
-an error is returned.
-This option can be used to ping a local host through an interface
-that has no route through it (e.g., after the interface was dropped by
-.Xr routed 8 ) .
-.It Fl s Ar src_addr
-Use the following IP address
-(which must be given as an IP number, not
-a hostname) as the source address in outgoing probe packets. On
-hosts with more than one IP address, this option can be used to
-force the source address to be something other than the IP address
-of the interface the probe packet is sent on. If the IP address
-is not one of this machine's interface addresses, an error is
-returned and nothing is sent.
-.It Fl t Ar tos
-Set the
-.Em type-of-service
-in probe packets to the following value (default zero). The value must be
-a decimal integer in the range 0 to 255. This option can be used to
-see if different types-of-service result in different paths. (If you
-are not running a
-.Bx 4.3 tahoe
-or later system, this may be academic since the normal network
-services like telnet and ftp don't let you control the
-.Dv TOS ) .
-Not all values of
-.Dv TOS
-are legal or
-meaningful \- see the IP spec for definitions. Useful values are
-probably
-.Ql \-t 16
-(low delay) and
-.Ql \-t 8
-(high throughput).
-.It Fl v
-Verbose output. Received
-.Tn ICMP
-packets other than
-.Dv TIME_EXCEEDED
-and
-.Dv UNREACHABLE Ns s
-are listed.
-.It Fl w
-Set the time (in seconds) to wait for a response to a probe (default 3
-sec.).
-.El
-.Pp
-This program attempts to trace the route an IP packet would follow to some
-internet host by launching
-.Tn UDP
-probe
-packets with a small ttl (time to live) then listening for an
-.Tn ICMP
-"time exceeded" reply from a gateway. We start our probes
-with a ttl of one and increase by one until we get an
-.Tn ICMP
-"port unreachable"
-(which means we got to "host") or hit a max (which
-defaults to 30 hops & can be changed with the
-.Fl m
-flag). Three
-probes (changed with
-.Fl q
-flag) are sent at each ttl setting and a
-line is printed showing the ttl, address of the gateway and
-round trip time of each probe. If the probe answers come from
-different gateways, the address of each responding system will
-be printed. If there is no response within a 3 sec. timeout
-interval (changed with the
-.Fl w
-flag), a "*" is printed for that
-probe.
-.Pp
-We don't want the destination
-host to process the
-.Tn UDP
-probe packets so the destination port is set to an
-unlikely value (if some clod on the destination is using that
-value, it can be changed with the
-.Fl p
-flag).
-.Pp
-A sample use and output might be:
-.Bd -literal
-[yak 71]% traceroute nis.nsf.net.
-traceroute to nis.nsf.net (35.1.1.48), 30 hops max, 56 byte packet
-1 helios.ee.lbl.gov (128.3.112.1) 19 ms 19 ms 0 ms
-2 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 39 ms 19 ms
-3 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 39 ms 19 ms
-4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 39 ms 40 ms 39 ms
-5 ccn-nerif22.Berkeley.EDU (128.32.168.22) 39 ms 39 ms 39 ms
-6 128.32.197.4 (128.32.197.4) 40 ms 59 ms 59 ms
-7 131.119.2.5 (131.119.2.5) 59 ms 59 ms 59 ms
-8 129.140.70.13 (129.140.70.13) 99 ms 99 ms 80 ms
-9 129.140.71.6 (129.140.71.6) 139 ms 239 ms 319 ms
-10 129.140.81.7 (129.140.81.7) 220 ms 199 ms 199 ms
-11 nic.merit.edu (35.1.1.48) 239 ms 239 ms 239 ms
-
-.Ed
-Note that lines 2 & 3 are the same. This is due to a buggy
-kernel on the 2nd hop system \- lbl-csam.arpa \- that forwards
-packets with a zero ttl (a bug in the distributed version
-of 4.3
-.Tn BSD ) .
-Note that you have to guess what path
-the packets are taking cross-country since the
-.Tn NSFNet
-(129.140)
-doesn't supply address-to-name translations for its
-.Tn NSS Ns es .
-.Pp
-A more interesting example is:
-.Bd -literal
-[yak 72]% traceroute allspice.lcs.mit.edu.
-traceroute to allspice.lcs.mit.edu (18.26.0.115), 30 hops max
-1 helios.ee.lbl.gov (128.3.112.1) 0 ms 0 ms 0 ms
-2 lilac-dmc.Berkeley.EDU (128.32.216.1) 19 ms 19 ms 19 ms
-3 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 19 ms 19 ms
-4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 19 ms 39 ms 39 ms
-5 ccn-nerif22.Berkeley.EDU (128.32.168.22) 20 ms 39 ms 39 ms
-6 128.32.197.4 (128.32.197.4) 59 ms 119 ms 39 ms
-7 131.119.2.5 (131.119.2.5) 59 ms 59 ms 39 ms
-8 129.140.70.13 (129.140.70.13) 80 ms 79 ms 99 ms
-9 129.140.71.6 (129.140.71.6) 139 ms 139 ms 159 ms
-10 129.140.81.7 (129.140.81.7) 199 ms 180 ms 300 ms
-11 129.140.72.17 (129.140.72.17) 300 ms 239 ms 239 ms
-12 * * *
-13 128.121.54.72 (128.121.54.72) 259 ms 499 ms 279 ms
-14 * * *
-15 * * *
-16 * * *
-17 * * *
-18 ALLSPICE.LCS.MIT.EDU (18.26.0.115) 339 ms 279 ms 279 ms
-
-.Ed
-Note that the gateways 12, 14, 15, 16 & 17 hops away
-either don't send
-.Tn ICMP
-"time exceeded" messages or send them
-with a ttl too small to reach us. 14 \- 17 are running the
-.Tn MIT
-C Gateway code that doesn't send "time exceeded"s. God
-only knows what's going on with 12.
-.Pp
-The silent gateway 12 in the above may be the result of a bug in
-the 4.[23]
-.Tn BSD
-network code (and its derivatives): 4.x (x <= 3)
-sends an unreachable message using whatever ttl remains in the
-original datagram. Since, for gateways, the remaining ttl is
-zero, the
-.Tn ICMP
-"time exceeded" is guaranteed to not make it back
-to us. The behavior of this bug is slightly more interesting
-when it appears on the destination system:
-.Bd -literal
-1 helios.ee.lbl.gov (128.3.112.1) 0 ms 0 ms 0 ms
-2 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 19 ms 39 ms
-3 lilac-dmc.Berkeley.EDU (128.32.216.1) 19 ms 39 ms 19 ms
-4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 39 ms 40 ms 19 ms
-5 ccn-nerif35.Berkeley.EDU (128.32.168.35) 39 ms 39 ms 39 ms
-6 csgw.Berkeley.EDU (128.32.133.254) 39 ms 59 ms 39 ms
-7 * * *
-8 * * *
-9 * * *
-10 * * *
-11 * * *
-12 * * *
-13 rip.Berkeley.EDU (128.32.131.22) 59 ms ! 39 ms ! 39 ms !
-
-.Ed
-Notice that there are 12 "gateways" (13 is the final
-destination) and exactly the last half of them are "missing".
-What's really happening is that rip (a Sun-3 running Sun OS3.5)
-is using the ttl from our arriving datagram as the ttl in its
-.Tn ICMP
-reply. So, the reply will time out on the return path
-(with no notice sent to anyone since
-.Tn ICMP's
-aren't sent for
-.Tn ICMP's )
-until we probe with a ttl that's at least twice the path
-length. I.e., rip is really only 7 hops away. A reply that
-returns with a ttl of 1 is a clue this problem exists.
-.Nm Traceroute
-prints a "!" after the time if the ttl is <= 1.
-Since vendors ship a lot of obsolete
-.Pf ( Tn DEC Ns \'s
-Ultrix, Sun 3.x) or
-non-standard
-.Pq Tn HPUX
-software, expect to see this problem
-frequently and/or take care picking the target host of your
-probes.
-Other possible annotations after the time are
-.Sy !H ,
-.Sy !N ,
-.Sy !P
-(got a host, network or protocol unreachable, respectively),
-.Sy !S
-or
-.Sy !F
-(source route failed or fragmentation needed \- neither of these should
-ever occur and the associated gateway is busted if you see one). If
-almost all the probes result in some kind of unreachable,
-.Nm traceroute
-will give up and exit.
-.Pp
-This program is intended for use in network testing, measurement
-and management.
-It should be used primarily for manual fault isolation.
-Because of the load it could impose on the network, it is unwise to use
-.Nm traceroute
-during normal operations or from automated scripts.
-.Sh AUTHOR
-Implemented by Van Jacobson from a suggestion by Steve Deering. Debugged
-by a cast of thousands with particularly cogent suggestions or fixes from
-C. Philip Wood, Tim Seaver and Ken Adelman.
-.Sh SEE ALSO
-.Xr netstat 1 ,
-.Xr ping 8
-.Sh HISTORY
-The
-.Nm traceroute
-command first appeard in 4.4
-.Tn BSD
diff --git a/usr.sbin/traceroute/traceroute.c b/usr.sbin/traceroute/traceroute.c
deleted file mode 100644
index ff4e3e8..0000000
--- a/usr.sbin/traceroute/traceroute.c
+++ /dev/null
@@ -1,895 +0,0 @@
-#ifndef lint
-static char *rcsid =
- "@(#)$Header: /home/ncvs/src/usr.sbin/traceroute/traceroute.c,v 1.10 1996/08/21 05:59:19 peter Exp $ (LBL)";
-#endif
-
-/*
- * traceroute host - trace the route ip packets follow going to "host".
- *
- * Attempt to trace the route an ip packet would follow to some
- * internet host. We find out intermediate hops by launching probe
- * packets with a small ttl (time to live) then listening for an
- * icmp "time exceeded" reply from a gateway. We start our probes
- * with a ttl of one and increase by one until we get an icmp "port
- * unreachable" (which means we got to "host") or hit a max (which
- * defaults to 30 hops & can be changed with the -m flag). Three
- * probes (change with -q flag) are sent at each ttl setting and a
- * line is printed showing the ttl, address of the gateway and
- * round trip time of each probe. If the probe answers come from
- * different gateways, the address of each responding system will
- * be printed. If there is no response within a 5 sec. timeout
- * interval (changed with the -w flag), a "*" is printed for that
- * probe.
- *
- * Probe packets are UDP format. We don't want the destination
- * host to process them so the destination port is set to an
- * unlikely value (if some clod on the destination is using that
- * value, it can be changed with the -p flag).
- *
- * A sample use might be:
- *
- * [yak 71]% traceroute nis.nsf.net.
- * traceroute to nis.nsf.net (35.1.1.48), 30 hops max, 56 byte packet
- * 1 helios.ee.lbl.gov (128.3.112.1) 19 ms 19 ms 0 ms
- * 2 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 39 ms 19 ms
- * 3 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 39 ms 19 ms
- * 4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 39 ms 40 ms 39 ms
- * 5 ccn-nerif22.Berkeley.EDU (128.32.168.22) 39 ms 39 ms 39 ms
- * 6 128.32.197.4 (128.32.197.4) 40 ms 59 ms 59 ms
- * 7 131.119.2.5 (131.119.2.5) 59 ms 59 ms 59 ms
- * 8 129.140.70.13 (129.140.70.13) 99 ms 99 ms 80 ms
- * 9 129.140.71.6 (129.140.71.6) 139 ms 239 ms 319 ms
- * 10 129.140.81.7 (129.140.81.7) 220 ms 199 ms 199 ms
- * 11 nic.merit.edu (35.1.1.48) 239 ms 239 ms 239 ms
- *
- * Note that lines 2 & 3 are the same. This is due to a buggy
- * kernel on the 2nd hop system -- lbl-csam.arpa -- that forwards
- * packets with a zero ttl.
- *
- * A more interesting example is:
- *
- * [yak 72]% traceroute allspice.lcs.mit.edu.
- * traceroute to allspice.lcs.mit.edu (18.26.0.115), 30 hops max
- * 1 helios.ee.lbl.gov (128.3.112.1) 0 ms 0 ms 0 ms
- * 2 lilac-dmc.Berkeley.EDU (128.32.216.1) 19 ms 19 ms 19 ms
- * 3 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 19 ms 19 ms
- * 4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 19 ms 39 ms 39 ms
- * 5 ccn-nerif22.Berkeley.EDU (128.32.168.22) 20 ms 39 ms 39 ms
- * 6 128.32.197.4 (128.32.197.4) 59 ms 119 ms 39 ms
- * 7 131.119.2.5 (131.119.2.5) 59 ms 59 ms 39 ms
- * 8 129.140.70.13 (129.140.70.13) 80 ms 79 ms 99 ms
- * 9 129.140.71.6 (129.140.71.6) 139 ms 139 ms 159 ms
- * 10 129.140.81.7 (129.140.81.7) 199 ms 180 ms 300 ms
- * 11 129.140.72.17 (129.140.72.17) 300 ms 239 ms 239 ms
- * 12 * * *
- * 13 128.121.54.72 (128.121.54.72) 259 ms 499 ms 279 ms
- * 14 * * *
- * 15 * * *
- * 16 * * *
- * 17 * * *
- * 18 ALLSPICE.LCS.MIT.EDU (18.26.0.115) 339 ms 279 ms 279 ms
- *
- * (I start to see why I'm having so much trouble with mail to
- * MIT.) Note that the gateways 12, 14, 15, 16 & 17 hops away
- * either don't send ICMP "time exceeded" messages or send them
- * with a ttl too small to reach us. 14 - 17 are running the
- * MIT C Gateway code that doesn't send "time exceeded"s. God
- * only knows what's going on with 12.
- *
- * The silent gateway 12 in the above may be the result of a bug in
- * the 4.[23]BSD network code (and its derivatives): 4.x (x <= 3)
- * sends an unreachable message using whatever ttl remains in the
- * original datagram. Since, for gateways, the remaining ttl is
- * zero, the icmp "time exceeded" is guaranteed to not make it back
- * to us. The behavior of this bug is slightly more interesting
- * when it appears on the destination system:
- *
- * 1 helios.ee.lbl.gov (128.3.112.1) 0 ms 0 ms 0 ms
- * 2 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 19 ms 39 ms
- * 3 lilac-dmc.Berkeley.EDU (128.32.216.1) 19 ms 39 ms 19 ms
- * 4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 39 ms 40 ms 19 ms
- * 5 ccn-nerif35.Berkeley.EDU (128.32.168.35) 39 ms 39 ms 39 ms
- * 6 csgw.Berkeley.EDU (128.32.133.254) 39 ms 59 ms 39 ms
- * 7 * * *
- * 8 * * *
- * 9 * * *
- * 10 * * *
- * 11 * * *
- * 12 * * *
- * 13 rip.Berkeley.EDU (128.32.131.22) 59 ms ! 39 ms ! 39 ms !
- *
- * Notice that there are 12 "gateways" (13 is the final
- * destination) and exactly the last half of them are "missing".
- * What's really happening is that rip (a Sun-3 running Sun OS3.5)
- * is using the ttl from our arriving datagram as the ttl in its
- * icmp reply. So, the reply will time out on the return path
- * (with no notice sent to anyone since icmp's aren't sent for
- * icmp's) until we probe with a ttl that's at least twice the path
- * length. I.e., rip is really only 7 hops away. A reply that
- * returns with a ttl of 1 is a clue this problem exists.
- * Traceroute prints a "!" after the time if the ttl is <= 1.
- * Since vendors ship a lot of obsolete (DEC's Ultrix, Sun 3.x) or
- * non-standard (HPUX) software, expect to see this problem
- * frequently and/or take care picking the target host of your
- * probes.
- *
- * Other possible annotations after the time are !H, !N, !P (got a host,
- * network or protocol unreachable, respectively), !S or !F (source
- * route failed or fragmentation needed -- neither of these should
- * ever occur and the associated gateway is busted if you see one). If
- * almost all the probes result in some kind of unreachable, traceroute
- * will give up and exit.
- *
- * Notes
- * -----
- * This program must be run by root or be setuid. (I suggest that
- * you *don't* make it setuid -- casual use could result in a lot
- * of unnecessary traffic on our poor, congested nets.)
- *
- * This program requires a kernel mod that does not appear in any
- * system available from Berkeley: A raw ip socket using proto
- * IPPROTO_RAW must interpret the data sent as an ip datagram (as
- * opposed to data to be wrapped in a ip datagram). See the README
- * file that came with the source to this program for a description
- * of the mods I made to /sys/netinet/raw_ip.c. Your mileage may
- * vary. But, again, ANY 4.x (x < 4) BSD KERNEL WILL HAVE TO BE
- * MODIFIED TO RUN THIS PROGRAM.
- *
- * The udp port usage may appear bizarre (well, ok, it is bizarre).
- * The problem is that an icmp message only contains 8 bytes of
- * data from the original datagram. 8 bytes is the size of a udp
- * header so, if we want to associate replies with the original
- * datagram, the necessary information must be encoded into the
- * udp header (the ip id could be used but there's no way to
- * interlock with the kernel's assignment of ip id's and, anyway,
- * it would have taken a lot more kernel hacking to allow this
- * code to set the ip id). So, to allow two or more users to
- * use traceroute simultaneously, we use this task's pid as the
- * source port (the high bit is set to move the port number out
- * of the "likely" range). To keep track of which probe is being
- * replied to (so times and/or hop counts don't get confused by a
- * reply that was delayed in transit), we increment the destination
- * port number before each probe.
- *
- * Don't use this as a coding example. I was trying to find a
- * routing problem and this code sort-of popped out after 48 hours
- * without sleep. I was amazed it ever compiled, much less ran.
- *
- * I stole the idea for this program from Steve Deering. Since
- * the first release, I've learned that had I attended the right
- * IETF working group meetings, I also could have stolen it from Guy
- * Almes or Matt Mathis. I don't know (or care) who came up with
- * the idea first. I envy the originators' perspicacity and I'm
- * glad they didn't keep the idea a secret.
- *
- * Tim Seaver, Ken Adelman and C. Philip Wood provided bug fixes and/or
- * enhancements to the original distribution.
- *
- * I've hacked up a round-trip-route version of this that works by
- * sending a loose-source-routed udp datagram through the destination
- * back to yourself. Unfortunately, SO many gateways botch source
- * routing, the thing is almost worthless. Maybe one day...
- *
- * -- Van Jacobson (van@ee.lbl.gov)
- * Tue Dec 20 03:50:13 PST 1988
- */
-
-#include <sys/param.h>
-#include <sys/file.h>
-#include <sys/ioctl.h>
-#include <sys/socket.h>
-#include <sys/time.h>
-
-#include <netinet/in_systm.h>
-#include <netinet/in.h>
-#include <netinet/ip.h>
-#include <netinet/ip_var.h>
-#include <netinet/ip_icmp.h>
-#include <netinet/udp.h>
-
-#include <arpa/inet.h>
-
-#include <ctype.h>
-#include <unistd.h>
-#include <errno.h>
-#include <netdb.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include "gnuc.h"
-#ifdef HAVE_OS_PROTO_H
-#include "os-proto.h"
-#endif
-
-#define MAXPACKET 65535 /* max ip packet size */
-
-#ifndef MAXHOSTNAMELEN
-#define MAXHOSTNAMELEN 64
-#endif
-
-#if !defined(HAVE_BZERO) && !defined(bzero)
-#define bzero(s, n) memset(s, 0, n)
-#define bcopy(s, d, n) memcpy(d, s, n)
-#endif
-
-#if !defined(HAVE_SETLINEBUF) && !defined(setlinebuf)
-#define setlinebuf(f) setvbuf(f, NULL, _IOLBF, 0)
-#endif
-
-#define Fprintf (void)fprintf
-#define Sprintf (void)sprintf
-#define Printf (void)printf
-
-/*
- * format of a (udp) probe packet.
- */
-struct opacket {
- struct ip ip;
- struct udphdr udp;
- u_char seq; /* sequence number of this packet */
- u_char ttl; /* ttl packet left with */
- struct timeval tv; /* time packet left */
-};
-
-u_char packet[512]; /* last inbound (icmp) packet */
-struct opacket *outpacket; /* last output (udp) packet */
-
-int s; /* receive (icmp) socket file descriptor */
-int sndsock; /* send (udp) socket file descriptor */
-
-struct sockaddr whereto; /* Who to try to reach */
-int datalen; /* How much data */
-
-char *source = 0;
-char *hostname;
-char hnamebuf[MAXHOSTNAMELEN];
-
-int nprobes = 3;
-int max_ttl = 30;
-u_short ident;
-u_short port = 32768+666; /* start udp dest port # for probe packets */
-
-int options; /* socket options */
-int verbose;
-int waittime = 5; /* time to wait for response (in seconds) */
-int nflag; /* print addresses numerically */
-
-char usage[] =
- "Usage: traceroute [-dnrv] [-w wait] [-m max_ttl] [-p port#] [-q nqueries] [-t tos] [-s src_addr] [-g gateway] host [data size]\n";
-
-/* Forwards */
-double deltaT(struct timeval *, struct timeval *);
-int main(int, char **);
-int wait_for_reply(int, struct sockaddr_in *, struct timeval *);
-void send_probe(int, int, struct timeval *);
-char *pr_type(u_char);
-int packet_ok(u_char *, int, struct sockaddr_in *, int);
-void print(u_char *, int, struct sockaddr_in *);
-void tvsub(struct timeval *, struct timeval *);
-char *inetname(struct in_addr);
-
-double
-deltaT(struct timeval *t1p, struct timeval *t2p)
-{
- register double dt;
-
- dt = (double)(t2p->tv_sec - t1p->tv_sec) * 1000.0 +
- (double)(t2p->tv_usec - t1p->tv_usec) / 1000.0;
- return (dt);
-}
-
-int
-main(int argc, char **argv)
-{
- struct sockaddr_in from;
- char **av = argv;
- struct sockaddr_in *to = (struct sockaddr_in *) &whereto;
- int on = 1;
- struct protoent *pe;
- int ttl, probe, i;
- int seq = 0;
- int tos = 0;
- struct hostent *hp;
- int lsrr = 0;
- u_long gw;
- u_char optlist[MAX_IPOPTLEN], *oix;
- int sockerrno;
-
- /*
- * Do the setuid-required stuff first, then lose priveleges ASAP.
- * Do error checking for these two calls where they appeared in
- * the original code.
- */
- pe = getprotobyname("icmp");
- if (pe) {
- if ((s = socket(AF_INET, SOCK_RAW, pe->p_proto)) < 0)
- sockerrno = errno;
- else if ((sndsock = socket(AF_INET, SOCK_RAW, IPPROTO_RAW)) < 0)
- sockerrno = errno;
- }
-
- setuid(getuid());
-
- oix = optlist;
- bzero(optlist, sizeof(optlist));
-
- argc--, av++;
- while (argc && *av[0] == '-') {
- while (*++av[0])
- switch (*av[0]) {
- case 'd':
- options |= SO_DEBUG;
- break;
- case 'g':
- argc--, av++;
- if ((lsrr+1) >= ((MAX_IPOPTLEN-IPOPT_MINOFF)/sizeof(u_long))) {
- Fprintf(stderr,"No more than %d gateways\n",
- (u_int)((MAX_IPOPTLEN-IPOPT_MINOFF)/sizeof(u_long))-1);
- exit(1);
- }
- if (lsrr == 0) {
- *oix++ = IPOPT_LSRR;
- oix++; /* Fill in total length later */
- *oix++ = IPOPT_MINOFF; /* Pointer to LSRR addresses */
- }
- lsrr++;
- if (isdigit(*av[0])) {
- gw = inet_addr(*av);
- if (gw) {
- bcopy(&gw, oix, sizeof(u_long));
- } else {
- Fprintf(stderr, "Unknown host %s\n",av[0]);
- exit(1);
- }
- } else {
- hp = gethostbyname(av[0]);
- if (hp) {
- bcopy(hp->h_addr, oix, sizeof(u_long));
- } else {
- Fprintf(stderr, "Unknown host %s\n",av[0]);
- exit(1);
- }
- }
- oix += sizeof(u_long);
- goto nextarg;
- case 'm':
- argc--, av++;
- max_ttl = atoi(av[0]);
- if (max_ttl <= 1) {
- Fprintf(stderr, "max ttl must be >1\n");
- exit(1);
- }
- goto nextarg;
- case 'n':
- nflag++;
- break;
- case 'p':
- argc--, av++;
- port = atoi(av[0]);
- if (port < 1) {
- Fprintf(stderr, "port must be >0\n");
- exit(1);
- }
- goto nextarg;
- case 'q':
- argc--, av++;
- nprobes = atoi(av[0]);
- if (nprobes < 1) {
- Fprintf(stderr, "nprobes must be >0\n");
- exit(1);
- }
- goto nextarg;
- case 'r':
- options |= SO_DONTROUTE;
- break;
- case 's':
- /*
- * set the ip source address of the outbound
- * probe (e.g., on a multi-homed host).
- */
- argc--, av++;
- source = av[0];
- goto nextarg;
- case 't':
- argc--, av++;
- tos = atoi(av[0]);
- if (tos < 0 || tos > 255) {
- Fprintf(stderr, "tos must be 0 to 255\n");
- exit(1);
- }
- goto nextarg;
- case 'v':
- verbose++;
- break;
- case 'w':
- argc--, av++;
- waittime = atoi(av[0]);
- if (waittime <= 1) {
- Fprintf(stderr, "wait must be >1 sec\n");
- exit(1);
- }
- goto nextarg;
- default:
- Printf(usage);
- exit(1);
- }
- nextarg:
- argc--, av++;
- }
- if (argc != 1) {
- Printf(usage);
- exit(1);
- }
- setlinebuf (stdout);
-
- bzero((char *)&whereto, sizeof(struct sockaddr));
- to->sin_family = AF_INET;
- to->sin_addr.s_addr = inet_addr(av[0]);
- if (to->sin_addr.s_addr != -1) {
- (void) strncpy(hnamebuf, av[0], sizeof(hnamebuf));
- hostname = hnamebuf;
- } else {
- hp = gethostbyname(av[0]);
- if (hp) {
- to->sin_family = hp->h_addrtype;
- bcopy(hp->h_addr, (caddr_t)&to->sin_addr, hp->h_length);
- hostname = strdup(hp->h_name);
- } else {
- Printf("%s: unknown host %s\n", argv[0], av[0]);
- exit(1);
- }
- }
-
- if (argc >= 2)
- datalen = atoi(av[1]);
- if (datalen < 0 || datalen >= MAXPACKET - sizeof(struct opacket)) {
- Fprintf(stderr, "traceroute: packet size must be 0 <= s < %d\n",
- (u_int)(MAXPACKET - sizeof(struct opacket)));
- exit(1);
- }
- datalen += sizeof(struct opacket);
- outpacket = (struct opacket *)malloc((unsigned)datalen);
- if (! outpacket) {
- perror("traceroute: malloc");
- exit(1);
- }
- bzero((char *)outpacket, datalen);
- outpacket->ip.ip_dst = to->sin_addr;
- outpacket->ip.ip_tos = tos;
- outpacket->ip.ip_v = IPVERSION;
- outpacket->ip.ip_hl = sizeof(struct ip) >> 2;
-
- ident = (getpid() & 0xffff) | 0x8000;
-
- if (pe == NULL) {
- Fprintf(stderr, "icmp: unknown protocol\n");
- exit(10);
- }
- if (s < 0) {
- errno = sockerrno;
- perror("traceroute: icmp socket");
- exit(5);
- }
- if (options & SO_DEBUG)
- (void) setsockopt(s, SOL_SOCKET, SO_DEBUG,
- (char *)&on, sizeof(on));
- if (options & SO_DONTROUTE)
- (void) setsockopt(s, SOL_SOCKET, SO_DONTROUTE,
- (char *)&on, sizeof(on));
-
- if (sndsock < 0) {
- errno = sockerrno;
- perror("traceroute: raw socket");
- exit(5);
- }
-
- if (lsrr > 0) {
- lsrr++;
- optlist[IPOPT_OLEN]=IPOPT_MINOFF-1+(lsrr*sizeof(u_long));
- bcopy((caddr_t)&to->sin_addr, oix, sizeof(u_long));
- oix += sizeof(u_long);
- while ((oix - optlist)&3) oix++; /* Pad to an even boundry */
-
- if ((pe = getprotobyname("ip")) == NULL) {
- perror("traceroute: unknown protocol ip\n");
- exit(10);
- }
-#ifdef IP_OPTIONS
- if ((setsockopt(sndsock, pe->p_proto, IP_OPTIONS, optlist, oix-optlist)) < 0) {
- perror("traceroute: lsrr options");
- exit(5);
- }
-#endif
- }
-
-#ifdef SO_SNDBUF
- if (setsockopt(sndsock, SOL_SOCKET, SO_SNDBUF, (char *)&datalen,
- sizeof(datalen)) < 0) {
- perror("traceroute: SO_SNDBUF");
- exit(6);
- }
-#endif SO_SNDBUF
-#ifdef IP_HDRINCL
- if (setsockopt(sndsock, IPPROTO_IP, IP_HDRINCL, (char *)&on,
- sizeof(on)) < 0) {
- perror("traceroute: IP_HDRINCL");
- exit(6);
- }
-#endif IP_HDRINCL
- if (options & SO_DEBUG)
- (void) setsockopt(sndsock, SOL_SOCKET, SO_DEBUG,
- (char *)&on, sizeof(on));
- if (options & SO_DONTROUTE)
- (void) setsockopt(sndsock, SOL_SOCKET, SO_DONTROUTE,
- (char *)&on, sizeof(on));
-
- if (source) {
- bzero((char *)&from, sizeof(struct sockaddr));
- from.sin_family = AF_INET;
- from.sin_addr.s_addr = inet_addr(source);
- if (from.sin_addr.s_addr == -1) {
- Printf("traceroute: unknown host %s\n", source);
- exit(1);
- }
- outpacket->ip.ip_src = from.sin_addr;
-#ifndef IP_HDRINCL
- if (bind(sndsock, (struct sockaddr *)&from, sizeof(from)) < 0) {
- perror ("traceroute: bind:");
- exit (1);
- }
-#endif IP_HDRINCL
- }
-
- Fprintf(stderr, "traceroute to %s (%s)", hostname,
- inet_ntoa(to->sin_addr));
- if (source)
- Fprintf(stderr, " from %s", source);
- Fprintf(stderr, ", %d hops max, %d byte packets\n", max_ttl, datalen);
- (void) fflush(stderr);
-
- for (ttl = 1; ttl <= max_ttl; ++ttl) {
- u_long lastaddr = 0;
- int got_there = 0;
- int unreachable = 0;
-
- Printf("%2d ", ttl);
- for (probe = 0; probe < nprobes; ++probe) {
- int cc;
- struct timeval t1, t2;
- struct timezone tz;
- struct ip *ip;
-
- (void) gettimeofday(&t1, &tz);
- send_probe(++seq, ttl, &t1);
- while ((cc = wait_for_reply(s, &from, &t1)) != 0) {
- (void) gettimeofday(&t2, &tz);
- if ((i = packet_ok(packet, cc, &from, seq))) {
- double T;
- int precis;
- if (from.sin_addr.s_addr != lastaddr) {
- print(packet, cc, &from);
- lastaddr = from.sin_addr.s_addr;
- }
- T = deltaT(&t1, &t2);
-#ifdef SANE_PRECISION
- if (T >= 1000.0)
- precis = 0;
- else if (T >= 100.0)
- precis = 1;
- else if (T >= 10.0)
- precis = 2;
- else
-#endif
- precis = 3;
- Printf(" %.*f ms", precis, T);
- switch(i - 1) {
- case ICMP_UNREACH_PORT:
-#ifndef ARCHAIC
- ip = (struct ip *)packet;
- if (ip->ip_ttl <= 1)
- Printf(" !");
-#endif ARCHAIC
- ++got_there;
- break;
- case ICMP_UNREACH_NET:
- ++unreachable;
- Printf(" !N");
- break;
- case ICMP_UNREACH_HOST:
- ++unreachable;
- Printf(" !H");
- break;
- case ICMP_UNREACH_PROTOCOL:
- ++got_there;
- Printf(" !P");
- break;
- case ICMP_UNREACH_NEEDFRAG:
- ++unreachable;
- Printf(" !F");
- break;
- case ICMP_UNREACH_SRCFAIL:
- ++unreachable;
- Printf(" !S");
- break;
- case ICMP_UNREACH_NET_PROHIB:
- ++unreachable;
- Printf(" !A");
- break;
- case ICMP_UNREACH_HOST_PROHIB:
- ++unreachable;
- Printf(" !C");
- break;
- case ICMP_UNREACH_FILTER_PROHIB:
- ++unreachable;
- Printf(" !F");
- break;
- default: /* unknown */
- Printf(" !<%d>", i - 1);
- break;
- case -2: /* normal reply */
- break;
- }
- break;
- }
- }
- if (cc == 0)
- Printf(" *");
- (void) fflush(stdout);
- }
- putchar('\n');
- if (got_there || unreachable >= nprobes-1)
- exit(0);
- }
- exit(0);
-}
-
-int
-wait_for_reply(int sock, struct sockaddr_in *from, struct timeval *sent)
-{
- fd_set fds;
- struct timeval now, wait;
- int cc = 0;
- int fromlen = sizeof (*from);
-
- FD_ZERO(&fds);
- FD_SET(sock, &fds);
- gettimeofday(&now, NULL);
- wait.tv_sec = (sent->tv_sec + waittime) - now.tv_sec;
- wait.tv_usec = sent->tv_usec - now.tv_usec;
- if (wait.tv_usec < 0) {
- wait.tv_usec += 1000000;
- wait.tv_sec--;
- }
- if (wait.tv_sec < 0)
- wait.tv_sec = wait.tv_usec = 0;
-
- if (select(sock+1, &fds, (fd_set *)0, (fd_set *)0, &wait) > 0)
- cc=recvfrom(s, (char *)packet, sizeof(packet), 0,
- (struct sockaddr *)from, &fromlen);
-
- return(cc);
-}
-
-
-void
-send_probe(int seq, int ttl, struct timeval *tp)
-{
- struct opacket *op = outpacket;
- struct ip *ip = &op->ip;
- struct udphdr *up = &op->udp;
- int i;
-
- ip->ip_off = 0;
- ip->ip_p = IPPROTO_UDP;
- ip->ip_len = datalen;
- ip->ip_ttl = ttl;
-
- up->uh_sport = htons(ident);
- up->uh_dport = htons(port+seq);
- up->uh_ulen = htons((u_short)(datalen - sizeof(struct ip)));
- up->uh_sum = 0;
-
- op->seq = seq;
- op->ttl = ttl;
- op->tv = *tp;
-
- i = sendto(sndsock, (char *)outpacket, datalen, 0, &whereto,
- sizeof(struct sockaddr));
- if (i < 0 || i != datalen) {
- if (i<0)
- perror("sendto");
- Printf("traceroute: wrote %s %d chars, ret=%d\n", hostname,
- datalen, i);
- (void) fflush(stdout);
- }
-}
-
-/*
- * Convert an ICMP "type" field to a printable string.
- */
-char *
-pr_type(u_char t)
-{
- static char *ttab[] = {
- "Echo Reply", "ICMP 1", "ICMP 2", "Dest Unreachable",
- "Source Quench", "Redirect", "ICMP 6", "ICMP 7",
- "Echo", "ICMP 9", "ICMP 10", "Time Exceeded",
- "Param Problem", "Timestamp", "Timestamp Reply", "Info Request",
- "Info Reply"
- };
-
- if(t > 16)
- return("OUT-OF-RANGE");
-
- return(ttab[t]);
-}
-
-
-int
-packet_ok(u_char *buf, int cc, struct sockaddr_in *from, int seq)
-{
- register struct icmp *icp;
- u_char type, code;
- int hlen;
-#ifndef ARCHAIC
- struct ip *ip;
-
- ip = (struct ip *) buf;
- hlen = ip->ip_hl << 2;
- if (cc < hlen + ICMP_MINLEN) {
- if (verbose)
- Printf("packet too short (%d bytes) from %s\n", cc,
- inet_ntoa(from->sin_addr));
- return (0);
- }
- cc -= hlen;
- icp = (struct icmp *)(buf + hlen);
-#else
- icp = (struct icmp *)buf;
-#endif ARCHAIC
- type = icp->icmp_type; code = icp->icmp_code;
- if ((type == ICMP_TIMXCEED && code == ICMP_TIMXCEED_INTRANS) ||
- type == ICMP_UNREACH) {
- struct ip *hip;
- struct udphdr *up;
-
- hip = &icp->icmp_ip;
- hlen = hip->ip_hl << 2;
- up = (struct udphdr *)((u_char *)hip + hlen);
- if (hlen + 12 <= cc && hip->ip_p == IPPROTO_UDP &&
- up->uh_sport == htons(ident) &&
- up->uh_dport == htons(port+seq))
- return (type == ICMP_TIMXCEED? -1 : code+1);
- }
-#ifndef ARCHAIC
- if (verbose) {
- int i;
- u_long *lp = (u_long *)&icp->icmp_ip;
-
- Printf("\n%d bytes from %s", cc, inet_ntoa(from->sin_addr));
- Printf(" to %s", inet_ntoa(ip->ip_dst));
- Printf(": icmp type %d (%s) code %d\n", type, pr_type(type),
- icp->icmp_code);
- for (i = 4; i < cc ; i += sizeof(long))
- Printf("%2d: x%8.8lx\n", i, *lp++);
- }
-#endif ARCHAIC
- return(0);
-}
-
-
-void
-print(u_char *buf, int cc, struct sockaddr_in *from)
-{
- struct ip *ip;
- int hlen;
-
- ip = (struct ip *) buf;
- hlen = ip->ip_hl << 2;
- cc -= hlen;
-
- if (nflag)
- Printf(" %s", inet_ntoa(from->sin_addr));
- else
- Printf(" %s (%s)", inetname(from->sin_addr),
- inet_ntoa(from->sin_addr));
-
- if (verbose)
- Printf (" %d bytes to %s", cc, inet_ntoa (ip->ip_dst));
-}
-
-
-#ifdef notyet
-/*
- * Checksum routine for Internet Protocol family headers (C Version)
- */
-in_cksum(u_short *addr, int len)
-{
- register int nleft = len;
- register u_short *w = addr;
- register u_short answer;
- register int sum = 0;
-
- /*
- * Our algorithm is simple, using a 32 bit accumulator (sum),
- * we add sequential 16 bit words to it, and at the end, fold
- * back all the carry bits from the top 16 bits into the lower
- * 16 bits.
- */
- while (nleft > 1) {
- sum += *w++;
- nleft -= 2;
- }
-
- /* mop up an odd byte, if necessary */
- if (nleft == 1)
- sum += *(u_char *)w;
-
- /*
- * add back carry outs from top 16 bits to low 16 bits
- */
- sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */
- sum += (sum >> 16); /* add carry */
- answer = ~sum; /* truncate to 16 bits */
- return (answer);
-}
-#endif notyet
-
-/*
- * Subtract 2 timeval structs: out = out - in.
- * Out is assumed to be >= in.
- */
-void
-tvsub(register struct timeval *out, register struct timeval *in)
-{
- if ((out->tv_usec -= in->tv_usec) < 0) {
- out->tv_sec--;
- out->tv_usec += 1000000;
- }
- out->tv_sec -= in->tv_sec;
-}
-
-
-/*
- * Construct an Internet address representation.
- * If the nflag has been supplied, give
- * numeric value, otherwise try for symbolic name.
- */
-char *
-inetname(struct in_addr in)
-{
- register char *cp;
- static char line[50];
- struct hostent *hp;
- static char domain[MAXHOSTNAMELEN + 1];
- static int first = 1;
-
- if (first && !nflag) {
- first = 0;
- if (gethostname(domain, sizeof(domain)) == 0 &&
- (cp = strchr(domain, '.')))
- (void) strncpy(domain, cp + 1, sizeof(domain));
- else
- domain[0] = 0;
- }
- cp = 0;
- if (!nflag && in.s_addr != INADDR_ANY) {
- hp = gethostbyaddr((char *)&in, sizeof (in), AF_INET);
- if (hp) {
- if ((cp = strchr(hp->h_name, '.')) &&
- !strcmp(cp + 1, domain))
- *cp = 0;
- cp = hp->h_name;
- }
- }
- if (cp)
- (void) strncpy(line, cp, sizeof(line));
- else {
- in.s_addr = ntohl(in.s_addr);
-#define C(x) ((x) & 0xff)
- Sprintf(line, "%lu.%lu.%lu.%lu", C(in.s_addr >> 24),
- C(in.s_addr >> 16), C(in.s_addr >> 8), C(in.s_addr));
- }
- return (line);
-}
OpenPOWER on IntegriCloud