projects / reactos.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
ok one more time
[reactos.git] / reactos / apps / utils / net / tracert / tracert.c
1 /*-
2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Van Jacobson.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37 #ifndef lint
38 static char copyright[] =
39 "@(#) Copyright (c) 1990, 1993\n\
40 The Regents of the University of California. All rights reserved.\n";
41 #endif /* not lint */
42
43 #ifndef lint
44 static char sccsid[] = "@(#)traceroute.c 8.1 (Berkeley) 6/6/93";
45 #endif /* not lint */
46
47 /*
48 * traceroute host - trace the route ip packets follow going to "host".
49 *
50 * Attempt to trace the route an ip packet would follow to some
51 * internet host. We find out intermediate hops by launching probe
52 * packets with a small ttl (time to live) then listening for an
53 * icmp "time exceeded" reply from a gateway. We start our probes
54 * with a ttl of one and increase by one until we get an icmp "port
55 * unreachable" (which means we got to "host") or hit a max (which
56 * defaults to 30 hops & can be changed with the -m flag). Three
57 * probes (change with -q flag) are sent at each ttl setting and a
58 * line is printed showing the ttl, address of the gateway and
59 * round trip time of each probe. If the probe answers come from
60 * different gateways, the address of each responding system will
61 * be printed. If there is no response within a 5 sec. timeout
62 * interval (changed with the -w flag), a "*" is printed for that
63 * probe.
64 *
65 * Probe packets are UDP format. We don't want the destination
66 * host to process them so the destination port is set to an
67 * unlikely value (if some clod on the destination is using that
68 * value, it can be changed with the -p flag).
69 *
70 * A sample use might be:
71 *
72 * [yak 71]% traceroute nis.nsf.net.
73 * traceroute to nis.nsf.net (35.1.1.48), 30 hops max, 56 byte packet
74 * 1 helios.ee.lbl.gov (128.3.112.1) 19 ms 19 ms 0 ms
75 * 2 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 39 ms 19 ms
76 * 3 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 39 ms 19 ms
77 * 4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 39 ms 40 ms 39 ms
78 * 5 ccn-nerif22.Berkeley.EDU (128.32.168.22) 39 ms 39 ms 39 ms
79 * 6 128.32.197.4 (128.32.197.4) 40 ms 59 ms 59 ms
80 * 7 131.119.2.5 (131.119.2.5) 59 ms 59 ms 59 ms
81 * 8 129.140.70.13 (129.140.70.13) 99 ms 99 ms 80 ms
82 * 9 129.140.71.6 (129.140.71.6) 139 ms 239 ms 319 ms
83 * 10 129.140.81.7 (129.140.81.7) 220 ms 199 ms 199 ms
84 * 11 nic.merit.edu (35.1.1.48) 239 ms 239 ms 239 ms
85 *
86 * Note that lines 2 & 3 are the same. This is due to a buggy
87 * kernel on the 2nd hop system -- lbl-csam.arpa -- that forwards
88 * packets with a zero ttl.
89 *
90 * A more interesting example is:
91 *
92 * [yak 72]% traceroute allspice.lcs.mit.edu.
93 * traceroute to allspice.lcs.mit.edu (18.26.0.115), 30 hops max
94 * 1 helios.ee.lbl.gov (128.3.112.1) 0 ms 0 ms 0 ms
95 * 2 lilac-dmc.Berkeley.EDU (128.32.216.1) 19 ms 19 ms 19 ms
96 * 3 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 19 ms 19 ms
97 * 4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 19 ms 39 ms 39 ms
98 * 5 ccn-nerif22.Berkeley.EDU (128.32.168.22) 20 ms 39 ms 39 ms
99 * 6 128.32.197.4 (128.32.197.4) 59 ms 119 ms 39 ms
100 * 7 131.119.2.5 (131.119.2.5) 59 ms 59 ms 39 ms
101 * 8 129.140.70.13 (129.140.70.13) 80 ms 79 ms 99 ms
102 * 9 129.140.71.6 (129.140.71.6) 139 ms 139 ms 159 ms
103 * 10 129.140.81.7 (129.140.81.7) 199 ms 180 ms 300 ms
104 * 11 129.140.72.17 (129.140.72.17) 300 ms 239 ms 239 ms
105 * 12 * * *
106 * 13 128.121.54.72 (128.121.54.72) 259 ms 499 ms 279 ms
107 * 14 * * *
108 * 15 * * *
109 * 16 * * *
110 * 17 * * *
111 * 18 ALLSPICE.LCS.MIT.EDU (18.26.0.115) 339 ms 279 ms 279 ms
112 *
113 * (I start to see why I'm having so much trouble with mail to
114 * MIT.) Note that the gateways 12, 14, 15, 16 & 17 hops away
115 * either don't send ICMP "time exceeded" messages or send them
116 * with a ttl too small to reach us. 14 - 17 are running the
117 * MIT C Gateway code that doesn't send "time exceeded"s. God
118 * only knows what's going on with 12.
119 *
120 * The silent gateway 12 in the above may be the result of a bug in
121 * the 4.[23]BSD network code (and its derivatives): 4.x (x <= 3)
122 * sends an unreachable message using whatever ttl remains in the
123 * original datagram. Since, for gateways, the remaining ttl is
124 * zero, the icmp "time exceeded" is guaranteed to not make it back
125 * to us. The behavior of this bug is slightly more interesting
126 * when it appears on the destination system:
127 *
128 * 1 helios.ee.lbl.gov (128.3.112.1) 0 ms 0 ms 0 ms
129 * 2 lilac-dmc.Berkeley.EDU (128.32.216.1) 39 ms 19 ms 39 ms
130 * 3 lilac-dmc.Berkeley.EDU (128.32.216.1) 19 ms 39 ms 19 ms
131 * 4 ccngw-ner-cc.Berkeley.EDU (128.32.136.23) 39 ms 40 ms 19 ms
132 * 5 ccn-nerif35.Berkeley.EDU (128.32.168.35) 39 ms 39 ms 39 ms
133 * 6 csgw.Berkeley.EDU (128.32.133.254) 39 ms 59 ms 39 ms
134 * 7 * * *
135 * 8 * * *
136 * 9 * * *
137 * 10 * * *
138 * 11 * * *
139 * 12 * * *
140 * 13 rip.Berkeley.EDU (128.32.131.22) 59 ms ! 39 ms ! 39 ms !
141 *
142 * Notice that there are 12 "gateways" (13 is the final
143 * destination) and exactly the last half of them are "missing".
144 * What's really happening is that rip (a Sun-3 running Sun OS3.5)
145 * is using the ttl from our arriving datagram as the ttl in its
146 * icmp reply. So, the reply will time out on the return path
147 * (with no notice sent to anyone since icmp's aren't sent for
148 * icmp's) until we probe with a ttl that's at least twice the path
149 * length. I.e., rip is really only 7 hops away. A reply that
150 * returns with a ttl of 1 is a clue this problem exists.
151 * Traceroute prints a "!" after the time if the ttl is <= 1.
152 * Since vendors ship a lot of obsolete (DEC's Ultrix, Sun 3.x) or
153 * non-standard (HPUX) software, expect to see this problem
154 * frequently and/or take care picking the target host of your
155 * probes.
156 *
157 * Other possible annotations after the time are !H, !N, !P (got a host,
158 * network or protocol unreachable, respectively), !S or !F (source
159 * route failed or fragmentation needed -- neither of these should
160 * ever occur and the associated gateway is busted if you see one). If
161 * almost all the probes result in some kind of unreachable, traceroute
162 * will give up and exit.
163 *
164 * Notes
165 * -----
166 * This program must be run by root or be setuid. (I suggest that
167 * you *don't* make it setuid -- casual use could result in a lot
168 * of unnecessary traffic on our poor, congested nets.)
169 *
170 * This program requires a kernel mod that does not appear in any
171 * system available from Berkeley: A raw ip socket using proto
172 * IPPROTO_RAW must interpret the data sent as an ip datagram (as
173 * opposed to data to be wrapped in a ip datagram). See the README
174 * file that came with the source to this program for a description
175 * of the mods I made to /sys/netinet/raw_ip.c. Your mileage may
176 * vary. But, again, ANY 4.x (x < 4) BSD KERNEL WILL HAVE TO BE
177 * MODIFIED TO RUN THIS PROGRAM.
178 *
179 * The udp port usage may appear bizarre (well, ok, it is bizarre).
180 * The problem is that an icmp message only contains 8 bytes of
181 * data from the original datagram. 8 bytes is the size of a udp
182 * header so, if we want to associate replies with the original
183 * datagram, the necessary information must be encoded into the
184 * udp header (the ip id could be used but there's no way to
185 * interlock with the kernel's assignment of ip id's and, anyway,
186 * it would have taken a lot more kernel hacking to allow this
187 * code to set the ip id). So, to allow two or more users to
188 * use traceroute simultaneously, we use this task's pid as the
189 * source port (the high bit is set to move the port number out
190 * of the "likely" range). To keep track of which probe is being
191 * replied to (so times and/or hop counts don't get confused by a
192 * reply that was delayed in transit), we increment the destination
193 * port number before each probe.
194 *
195 * Don't use this as a coding example. I was trying to find a
196 * routing problem and this code sort-of popped out after 48 hours
197 * without sleep. I was amazed it ever compiled, much less ran.
198 *
199 * I stole the idea for this program from Steve Deering. Since
200 * the first release, I've learned that had I attended the right
201 * IETF working group meetings, I also could have stolen it from Guy
202 * Almes or Matt Mathis. I don't know (or care) who came up with
203 * the idea first. I envy the originators' perspicacity and I'm
204 * glad they didn't keep the idea a secret.
205 *
206 * Tim Seaver, Ken Adelman and C. Philip Wood provided bug fixes and/or
207 * enhancements to the original distribution.
208 *
209 * I've hacked up a round-trip-route version of this that works by
210 * sending a loose-source-routed udp datagram through the destination
211 * back to yourself. Unfortunately, SO many gateways botch source
212 * routing, the thing is almost worthless. Maybe one day...
213 *
214 * -- Van Jacobson (van@helios.ee.lbl.gov)
215 * Tue Dec 20 03:50:13 PST 1988
216 */
217
218 #define caddr_t void *
219
220 #include <stdio.h>
221 #include <errno.h>
222 #include <stdlib.h>
223 #include <string.h>
224 #include <unistd.h>
225
226 #include <winsock2.h>
227
228
229 #include <stdio.h>
230 #include <time.h>
231 #include <winsock.h>
232
233 //void print(buf, cc, from);
234 char * inetname(in);
235 double deltaT(t1p, t2p);
236 void usage();
237 void send_probe(seq, ttl);
238
239 #define bzero( ptr, count ) memset( ptr, 0, count )
240 #define bcopy(src,dest,len) memcpy(dest,src,len)
241
242 // setlinebuf is equivalent to the setvbuf call below.
243 inline int setlinebuf(FILE *stream)
244 {
245 return setvbuf( stream, (char*)0, _IONBF, 0 );
246 }
247
248 #ifndef __GNUC__
249 #define EPOCHFILETIME (116444736000000000i64)
250 #else
251 #define EPOCHFILETIME (116444736000000000LL)
252 #endif
253
254 struct timezone {
255 int tz_minuteswest; /* minutes W of Greenwich */
256 int tz_dsttime; /* type of dst correction */
257 };
258
259 int gettimeofday(struct timeval *tv, struct timezone *tz)
260 {
261 FILETIME ft;
262 LARGE_INTEGER li;
263 __int64 t;
264 static int tzflag;
265
266 if (tv)
267 {
268 GetSystemTimeAsFileTime(&ft);
269 //li.LowPart = ft.dwLowDateTime;
270 //li.HighPart = ft.dwHighDateTime;
271 t = li.QuadPart; /* In 100-nanosecond intervals */
272 t -= EPOCHFILETIME; /* Offset to the Epoch time */
273 t /= 10; /* In microseconds */
274 tv->tv_sec = (long)(t / 1000000);
275 tv->tv_usec = (long)(t % 1000000);
276 }
277
278 if (tz)
279 {
280 if (!tzflag)
281 {
282 _tzset();
283 tzflag++;
284 }
285 tz->tz_minuteswest = _timezone / 60;
286 tz->tz_dsttime = _daylight;
287 }
288
289 return 0;
290 }
291
292
293
294 /* Set up endiannes macros for the ip and ip_icmp BSD headers */
295 #ifndef BIG_ENDIAN
296 #define BIG_ENDIAN 4321
297 #endif
298 #ifndef LITTLE_ENDIAN
299 #define LITTLE_ENDIAN 1234
300 #endif
301 #ifndef BYTE_ORDER
302 #ifdef WORDS_BIGENDIAN
303 #define BYTE_ORDER BIG_ENDIAN
304 #else
305 #define BYTE_ORDER LITTLE_ENDIAN
306 #endif
307 #endif /* BYTE_ORDER */
308
309 #define u_int16_t WORD
310 #define u_int32_t DWORD
311
312 /* These are BSD headers. We use these here because they are needed on
313 * libc5 Linux systems. On other platforms they are usually simply more
314 * complete than the native stuff, and cause less portability problems
315 * so we use them anyway.
316 */
317 #include "ip.h"
318 #include "ip_icmp.h"
319
320
321 #define MAXPACKET 65535 /* max ip packet size */
322 #ifndef MAXHOSTNAMELEN
323 #define MAXHOSTNAMELEN 64
324 #endif
325
326 #ifndef FD_SET
327 #define NFDBITS (8*sizeof(fd_set))
328 #define FD_SETSIZE NFDBITS
329 #define FD_SET(n, p) ((p)->fds_bits[(n)/NFDBITS] |= (1 << ((n) % NFDBITS)))
330 #define FD_CLR(n, p) ((p)->fds_bits[(n)/NFDBITS] &= ~(1 << ((n) % NFDBITS)))
331 #define FD_ISSET(n, p) ((p)->fds_bits[(n)/NFDBITS] & (1 << ((n) % NFDBITS)))
332 #define FD_ZERO(p) bzero((char *)(p), sizeof(*(p)))
333 #endif
334
335 #define Fprintf (void)fprintf
336 #define Sprintf (void)sprintf
337 #define Printf (void)printf
338
339 // Define the UDP header
340 //
341 typedef struct udp_hdr
342 {
343 unsigned short src_portno; // Source port number
344 unsigned short dst_portno; // Destination port number
345 unsigned short udp_length; // UDP packet length
346 unsigned short udp_checksum; // UDP checksum (optional)
347 } UDP_HDR, *PUDP_HDR;
348
349 /*
350 * format of a (udp) probe packet.
351 */
352 struct opacket {
353 struct ip ip;
354 UDP_HDR udp;
355 u_char seq; /* sequence number of this packet */
356 u_char ttl; /* ttl packet left with */
357 struct timeval tv; /* time packet left */
358 };
359
360 u_char packet[512]; /* last inbound (icmp) packet */
361 struct opacket *outpacket; /* last output (udp) packet */
362
363 #if 0
364 int wait_for_reply __P((int, struct sockaddr_in *));
365 void send_probe __P((int, int));
366 double deltaT __P((struct timeval *, struct timeval *));
367 int packet_ok __P((u_char *, int, struct sockaddr_in *, int));
368 //void print __P((u_char *, int, struct sockaddr_in *));
369 void tvsub __P((struct timeval *, struct timeval *));
370 char *inetname __P((struct in_addr));
371 void usage __P(());
372 #endif
373
374 int s; /* receive (icmp) socket file descriptor */
375 int sndsock; /* send (udp) socket file descriptor */
376 struct timezone tz; /* leftover */
377
378 struct sockaddr whereto; /* Who to try to reach */
379 int datalen; /* How much data */
380
381 char *source = 0;
382 char *hostname;
383
384 int nprobes = 3;
385 int max_ttl = 30;
386 u_short ident;
387 u_short port = 32768+666; /* start udp dest port # for probe packets */
388 int options; /* socket options */
389 int verbose;
390 int waittime = 5; /* time to wait for response (in seconds) */
391 int nflag; /* print addresses numerically */
392
393 void
394 print(buf, cc, from)
395 u_char *buf;
396 int cc;
397 struct sockaddr_in *from;
398 {
399 struct ip *ip;
400 int hlen;
401
402 ip = (struct ip *) buf;
403 hlen = ip->ip_hl << 2;
404 cc -= hlen;
405
406 if (nflag)
407 Printf(" %s", inet_ntoa(from->sin_addr));
408 else
409 Printf(" %s (%s)", inetname(from->sin_addr),
410 inet_ntoa(from->sin_addr));
411
412 if (verbose)
413 Printf (" %d bytes to %s", cc, inet_ntoa (ip->ip_dst));
414 }
415
416
417 int
418 main(argc, argv)
419 int argc;
420 char *argv[];
421 {
422 extern char *optarg;
423 extern int optind;
424 struct hostent *hp;
425 struct protoent *pe;
426 struct sockaddr_in from, *to;
427 int ch, i, on, probe, seq, tos, ttl;
428
429 on = 1;
430 seq = tos = 0;
431 to = (struct sockaddr_in *)&whereto;
432 while ((ch = getopt(argc, argv, "dm:np:q:rs:t:w:v")) != EOF)
433 switch(ch) {
434 case 'd':
435 options |= SO_DEBUG;
436 break;
437 case 'm':
438 max_ttl = atoi(optarg);
439 if (max_ttl <= 1) {
440 Fprintf(stderr,
441 "traceroute: max ttl must be >1.\n");
442 exit(1);
443 }
444 break;
445 case 'n':
446 nflag++;
447 break;
448 case 'p':
449 port = atoi(optarg);
450 if (port < 1) {
451 Fprintf(stderr,
452 "traceroute: port must be >0.\n");
453 exit(1);
454 }
455 break;
456 case 'q':
457 nprobes = atoi(optarg);
458 if (nprobes < 1) {
459 Fprintf(stderr,
460 "traceroute: nprobes must be >0.\n");
461 exit(1);
462 }
463 break;
464 case 'r':
465 options |= SO_DONTROUTE;
466 break;
467 case 's':
468 /*
469 * set the ip source address of the outbound
470 * probe (e.g., on a multi-homed host).
471 */
472 source = optarg;
473 break;
474 case 't':
475 tos = atoi(optarg);
476 if (tos < 0 || tos > 255) {
477 Fprintf(stderr,
478 "traceroute: tos must be 0 to 255.\n");
479 exit(1);
480 }
481 break;
482 case 'v':
483 verbose++;
484 break;
485 case 'w':
486 waittime = atoi(optarg);
487 if (waittime <= 1) {
488 Fprintf(stderr,
489 "traceroute: wait must be >1 sec.\n");
490 exit(1);
491 }
492 break;
493 default:
494 usage();
495 }
496 argc -= optind;
497 argv += optind;
498
499 if (argc < 1)
500 usage();
501
502 setlinebuf (stdout);
503
504 (void) bzero((char *)&whereto, sizeof(struct sockaddr));
505 to->sin_family = AF_INET;
506 to->sin_addr.s_addr = inet_addr(*argv);
507 if (to->sin_addr.s_addr != -1)
508 hostname = *argv;
509 else {
510 hp = gethostbyname(*argv);
511 if (hp) {
512 to->sin_family = hp->h_addrtype;
513 bcopy(hp->h_addr, (caddr_t)&to->sin_addr, hp->h_length);
514 hostname = hp->h_name;
515 } else {
516 (void)fprintf(stderr,
517 "traceroute: unknown host %s\n", *argv);
518 exit(1);
519 }
520 }
521 if (*++argv)
522 datalen = atoi(*argv);
523 if (datalen < 0 || datalen >= MAXPACKET - sizeof(struct opacket)) {
524 Fprintf(stderr,
525 "traceroute: packet size must be 0 <= s < %ld.\n",
526 MAXPACKET - sizeof(struct opacket));
527 exit(1);
528 }
529 datalen += sizeof(struct opacket);
530 outpacket = (struct opacket *)malloc((unsigned)datalen);
531 if (! outpacket) {
532 perror("traceroute: malloc");
533 exit(1);
534 }
535 (void) bzero((char *)outpacket, datalen);
536 outpacket->ip.ip_dst = to->sin_addr;
537 outpacket->ip.ip_tos = tos;
538 outpacket->ip.ip_v = IPVERSION;
539 outpacket->ip.ip_id = 0;
540
541 ident = (getpid() & 0xffff) | 0x8000;
542
543 if ((pe = getprotobyname("icmp")) == NULL) {
544 Fprintf(stderr, "icmp: unknown protocol\n");
545 exit(10);
546 }
547 if ((s = socket(AF_INET, SOCK_RAW, pe->p_proto)) < 0) {
548 perror("traceroute: icmp socket");
549 exit(5);
550 }
551 if (options & SO_DEBUG)
552 (void) setsockopt(s, SOL_SOCKET, SO_DEBUG,
553 (char *)&on, sizeof(on));
554 if (options & SO_DONTROUTE)
555 (void) setsockopt(s, SOL_SOCKET, SO_DONTROUTE,
556 (char *)&on, sizeof(on));
557
558 if ((sndsock = socket(AF_INET, SOCK_RAW, IPPROTO_RAW)) < 0) {
559 perror("traceroute: raw socket");
560 exit(5);
561 }
562 #ifdef SO_SNDBUF
563 if (setsockopt(sndsock, SOL_SOCKET, SO_SNDBUF, (char *)&datalen,
564 sizeof(datalen)) < 0) {
565 perror("traceroute: SO_SNDBUF");
566 exit(6);
567 }
568 #endif /* SO_SNDBUF */
569 #ifdef IP_HDRINCL
570 if (setsockopt(sndsock, IPPROTO_IP, IP_HDRINCL, (char *)&on,
571 sizeof(on)) < 0) {
572 perror("traceroute: IP_HDRINCL");
573 exit(6);
574 }
575 #endif /* IP_HDRINCL */
576 if (options & SO_DEBUG)
577 (void) setsockopt(sndsock, SOL_SOCKET, SO_DEBUG,
578 (char *)&on, sizeof(on));
579 if (options & SO_DONTROUTE)
580 (void) setsockopt(sndsock, SOL_SOCKET, SO_DONTROUTE,
581 (char *)&on, sizeof(on));
582
583 if (source) {
584 (void) bzero((char *)&from, sizeof(struct sockaddr));
585 from.sin_family = AF_INET;
586 from.sin_addr.s_addr = inet_addr(source);
587 if (from.sin_addr.s_addr == -1) {
588 Printf("traceroute: unknown host %s\n", source);
589 exit(1);
590 }
591 outpacket->ip.ip_src = from.sin_addr;
592 #ifndef IP_HDRINCL
593 if (bind(sndsock, (struct sockaddr *)&from, sizeof(from)) < 0) {
594 perror ("traceroute: bind:");
595 exit (1);
596 }
597 #endif /* IP_HDRINCL */
598 }
599
600 Fprintf(stderr, "traceroute to %s (%s)", hostname,
601 inet_ntoa(to->sin_addr));
602 if (source)
603 Fprintf(stderr, " from %s", source);
604 Fprintf(stderr, ", %d hops max, %d byte packets\n", max_ttl, datalen);
605 (void) fflush(stderr);
606
607 for (ttl = 1; ttl <= max_ttl; ++ttl) {
608 u_long lastaddr = 0;
609 int got_there = 0;
610 int unreachable = 0;
611
612 Printf("%2d ", ttl);
613 for (probe = 0; probe < nprobes; ++probe) {
614 int cc;
615 struct timeval t1, t2;
616 struct timezone tz;
617 struct ip *ip;
618
619 (void) gettimeofday(&t1, &tz);
620 send_probe(++seq, ttl);
621 while (cc = wait_for_reply(s, &from)) {
622 (void) gettimeofday(&t2, &tz);
623 if ((i = packet_ok(packet, cc, &from, seq))) {
624 if (from.sin_addr.s_addr != lastaddr) {
625 print(packet, cc, &from);
626 lastaddr = from.sin_addr.s_addr;
627 }
628 Printf(" %g ms", deltaT(&t1, &t2));
629 switch(i - 1) {
630 case ICMP_UNREACH_PORT:
631 #ifndef ARCHAIC
632 ip = (struct ip *)packet;
633 if (ip->ip_ttl <= 1)
634 Printf(" !");
635 #endif /* ARCHAIC */
636 ++got_there;
637 break;
638 case ICMP_UNREACH_NET:
639 ++unreachable;
640 Printf(" !N");
641 break;
642 case ICMP_UNREACH_HOST:
643 ++unreachable;
644 Printf(" !H");
645 break;
646 case ICMP_UNREACH_PROTOCOL:
647 ++got_there;
648 Printf(" !P");
649 break;
650 case ICMP_UNREACH_NEEDFRAG:
651 ++unreachable;
652 Printf(" !F");
653 break;
654 case ICMP_UNREACH_SRCFAIL:
655 ++unreachable;
656 Printf(" !S");
657 break;
658 }
659 break;
660 }
661 }
662 if (cc == 0)
663 Printf(" *");
664 (void) fflush(stdout);
665 }
666 putchar('\n');
667 if (got_there || unreachable >= nprobes-1)
668 exit(0);
669 }
670 }
671
672 int
673 wait_for_reply(sock, from)
674 int sock;
675 struct sockaddr_in *from;
676 {
677 fd_set fds;
678 struct timeval wait;
679 int cc = 0;
680 int fromlen = sizeof (*from);
681
682 FD_ZERO(&fds);
683 FD_SET(sock, &fds);
684 wait.tv_sec = waittime; wait.tv_usec = 0;
685
686 if (select(sock+1, &fds, (fd_set *)0, (fd_set *)0, &wait) > 0)
687 cc=recvfrom(s, (char *)packet, sizeof(packet), 0,
688 (struct sockaddr *)from, &fromlen);
689
690 return(cc);
691 }
692
693
694 void
695 send_probe(seq, ttl)
696 int seq, ttl;
697 {
698 struct opacket *op = outpacket;
699 struct ip *ip = &op->ip;
700 struct udphdr *up = &op->udp;
701 int i;
702
703 ip->ip_off = 0;
704 ip->ip_hl = sizeof(*ip) >> 2;
705 ip->ip_p = IPPROTO_UDP;
706 ip->ip_len = datalen;
707 ip->ip_ttl = ttl;
708 ip->ip_v = IPVERSION;
709 ip->ip_id = htons(ident+seq);
710
711 // up->uh_sport = htons(ident);
712 // up->uh_dport = htons(port+seq);
713 // up->uh_ulen = htons((u_short)(datalen - sizeof(struct ip)));
714 // up->uh_sum = 0;
715
716 op->seq = seq;
717 op->ttl = ttl;
718 (void) gettimeofday(&op->tv, &tz);
719
720 i = sendto(sndsock, (char *)outpacket, datalen, 0, &whereto,
721 sizeof(struct sockaddr));
722 if (i < 0 || i != datalen) {
723 if (i<0)
724 perror("sendto");
725 Printf("traceroute: wrote %s %d chars, ret=%d\n", hostname,
726 datalen, i);
727 (void) fflush(stdout);
728 }
729 }
730
731
732 double
733 deltaT(t1p, t2p)
734 struct timeval *t1p, *t2p;
735 {
736 register double dt;
737
738 dt = (double)(t2p->tv_sec - t1p->tv_sec) * 1000.0 +
739 (double)(t2p->tv_usec - t1p->tv_usec) / 1000.0;
740 return (dt);
741 }
742
743
744 /*
745 * Convert an ICMP "type" field to a printable string.
746 */
747 char *
748 pr_type(t)
749 u_char t;
750 {
751 static char *ttab[] = {
752 "Echo Reply", "ICMP 1", "ICMP 2", "Dest Unreachable",
753 "Source Quench", "Redirect", "ICMP 6", "ICMP 7",
754 "Echo", "ICMP 9", "ICMP 10", "Time Exceeded",
755 "Param Problem", "Timestamp", "Timestamp Reply", "Info Request",
756 "Info Reply"
757 };
758
759 if(t > 16)
760 return("OUT-OF-RANGE");
761
762 return(ttab[t]);
763 }
764
765
766 int
767 packet_ok(buf, cc, from, seq)
768 u_char *buf;
769 int cc;
770 struct sockaddr_in *from;
771 int seq;
772 {
773 register struct icmp *icp;
774 u_char type, code;
775 int hlen;
776 #ifndef ARCHAIC
777 struct ip *ip;
778
779 ip = (struct ip *) buf;
780 hlen = ip->ip_hl << 2;
781 if (cc < hlen + ICMP_MINLEN) {
782 if (verbose)
783 Printf("packet too short (%d bytes) from %s\n", cc,
784 inet_ntoa(from->sin_addr));
785 return (0);
786 }
787 cc -= hlen;
788 icp = (struct icmp *)(buf + hlen);
789 #else
790 icp = (struct icmp *)buf;
791 #endif /* ARCHAIC */
792 type = icp->icmp_type; code = icp->icmp_code;
793 if ((type == ICMP_TIMXCEED && code == ICMP_TIMXCEED_INTRANS) ||
794 type == ICMP_UNREACH) {
795 struct ip *hip;
796 struct udphdr *up;
797
798 hip = &icp->icmp_ip;
799 hlen = hip->ip_hl << 2;
800 up = (struct udphdr *)((u_char *)hip + hlen);
801 // if (hlen + 12 <= cc && hip->ip_p == IPPROTO_UDP &&
802 // up->uh_sport == htons(ident) &&
803 // up->uh_dport == htons(port+seq))
804 if (hlen + 12 <= cc && hip->ip_p == IPPROTO_UDP)
805 return (type == ICMP_TIMXCEED? -1 : code+1);
806 }
807 #ifndef ARCHAIC
808 if (verbose) {
809 int i;
810 u_long *lp = (u_long *)&icp->icmp_ip;
811
812 Printf("\n%d bytes from %s to %s", cc,
813 inet_ntoa(from->sin_addr), inet_ntoa(ip->ip_dst));
814 Printf(": icmp type %d (%s) code %d\n", type, pr_type(type),
815 icp->icmp_code);
816 for (i = 4; i < cc ; i += sizeof(long))
817 Printf("%2d: x%8.8lx\n", i, *lp++);
818 }
819 #endif /* ARCHAIC */
820 return(0);
821 }
822
823 #ifdef notyet
824 /*
825 * Checksum routine for Internet Protocol family headers (C Version)
826 */
827 u_short
828 in_cksum(addr, len)
829 u_short *addr;
830 int len;
831 {
832 register int nleft = len;
833 register u_short *w = addr;
834 register u_short answer;
835 register int sum = 0;
836
837 /*
838 * Our algorithm is simple, using a 32 bit accumulator (sum),
839 * we add sequential 16 bit words to it, and at the end, fold
840 * back all the carry bits from the top 16 bits into the lower
841 * 16 bits.
842 */
843 while (nleft > 1) {
844 sum += *w++;
845 nleft -= 2;
846 }
847
848 /* mop up an odd byte, if necessary */
849 if (nleft == 1)
850 sum += *(u_char *)w;
851
852 /*
853 * add back carry outs from top 16 bits to low 16 bits
854 */
855 sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */
856 sum += (sum >> 16); /* add carry */
857 answer = ~sum; /* truncate to 16 bits */
858 return (answer);
859 }
860 #endif /* notyet */
861
862 /*
863 * Subtract 2 timeval structs: out = out - in.
864 * Out is assumed to be >= in.
865 */
866 void
867 tvsub(out, in)
868 register struct timeval *out, *in;
869 {
870 if ((out->tv_usec -= in->tv_usec) < 0) {
871 out->tv_sec--;
872 out->tv_usec += 1000000;
873 }
874 out->tv_sec -= in->tv_sec;
875 }
876
877
878 /*
879 * Construct an Internet address representation.
880 * If the nflag has been supplied, give
881 * numeric value, otherwise try for symbolic name.
882 */
883 char *
884 inetname(in)
885 struct in_addr in;
886 {
887 register char *cp;
888 static char line[50];
889 struct hostent *hp;
890 static char domain[MAXHOSTNAMELEN + 1];
891 static int first = 1;
892
893 if (first && !nflag) {
894 first = 0;
895 if (gethostname(domain, MAXHOSTNAMELEN) == 0 &&
896 (cp = strrchr(domain, '.')))
897 (void) strcpy(domain, cp + 1);
898 else
899 domain[0] = 0;
900 }
901 cp = 0;
902 if (!nflag && in.s_addr != INADDR_ANY) {
903 hp = gethostbyaddr((char *)&in, sizeof (in), AF_INET);
904 if (hp) {
905 if ((cp = strrchr(hp->h_name, '.')) &&
906 !strcmp(cp + 1, domain))
907 *cp = 0;
908 cp = hp->h_name;
909 }
910 }
911 if (cp)
912 (void) strcpy(line, cp);
913 else {
914 in.s_addr = ntohl(in.s_addr);
915 #define C(x) ((x) & 0xff)
916 Sprintf(line, "%lu.%lu.%lu.%lu", C(in.s_addr >> 24),
917 C(in.s_addr >> 16), C(in.s_addr >> 8), C(in.s_addr));
918 }
919 return (line);
920 }
921
922 void
923 usage()
924 {
925 (void)fprintf(stderr,
926 "usage: traceroute [-dnrv] [-m max_ttl] [-p port#] [-q nqueries]\n\t\
927 [-s src_addr] [-t tos] [-w wait] host [data size]\n");
928 exit(1);
929 }
A free Windows-compatible Operating System