]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Copyright (c) 2008 Apple Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ | |
5 | * | |
6 | * This file contains Original Code and/or Modifications of Original Code | |
7 | * as defined in and that are subject to the Apple Public Source License | |
8 | * Version 2.0 (the 'License'). You may not use this file except in | |
9 | * compliance with the License. The rights granted to you under the License | |
10 | * may not be used to create, or enable the creation or redistribution of, | |
11 | * unlawful or unlicensed copies of an Apple operating system, or to | |
12 | * circumvent, violate, or enable the circumvention or violation of, any | |
13 | * terms of an Apple operating system software license agreement. | |
14 | * | |
15 | * Please obtain a copy of the License at | |
16 | * http://www.opensource.apple.com/apsl/ and read it before using this file. | |
17 | * | |
18 | * The Original Code and all software distributed under the License are | |
19 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
20 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, | |
21 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
22 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. | |
23 | * Please see the License for the specific language governing rights and | |
24 | * limitations under the License. | |
25 | * | |
26 | * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ | |
27 | */ | |
28 | /* | |
29 | * Copyright (c) 1989, 1993 | |
30 | * The Regents of the University of California. All rights reserved. | |
31 | * | |
32 | * This code is derived from software contributed to Berkeley by | |
33 | * Mike Muuss. | |
34 | * | |
35 | * Redistribution and use in source and binary forms, with or without | |
36 | * modification, are permitted provided that the following conditions | |
37 | * are met: | |
38 | * 1. Redistributions of source code must retain the above copyright | |
39 | * notice, this list of conditions and the following disclaimer. | |
40 | * 2. Redistributions in binary form must reproduce the above copyright | |
41 | * notice, this list of conditions and the following disclaimer in the | |
42 | * documentation and/or other materials provided with the distribution. | |
43 | * 4. Neither the name of the University nor the names of its contributors | |
44 | * may be used to endorse or promote products derived from this software | |
45 | * without specific prior written permission. | |
46 | * | |
47 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
48 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
49 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
50 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
51 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
52 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
53 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
54 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
55 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
56 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
57 | * SUCH DAMAGE. | |
58 | */ | |
59 | ||
60 | #if 0 | |
61 | #ifndef lint | |
62 | static const char copyright[] = | |
63 | "@(#) Copyright (c) 1989, 1993\n\ | |
64 | The Regents of the University of California. All rights reserved.\n"; | |
65 | #endif /* not lint */ | |
66 | ||
67 | #ifndef lint | |
68 | static char sccsid[] = "@(#)ping.c 8.1 (Berkeley) 6/5/93"; | |
69 | #endif /* not lint */ | |
70 | #endif | |
71 | #include <sys/cdefs.h> | |
72 | #ifndef __APPLE__ | |
73 | __FBSDID("$FreeBSD: src/sbin/ping/ping.c,v 1.112 2007/07/01 12:08:06 gnn Exp $"); | |
74 | #endif | |
75 | ||
76 | /* | |
77 | * P I N G . C | |
78 | * | |
79 | * Using the Internet Control Message Protocol (ICMP) "ECHO" facility, | |
80 | * measure round-trip-delays and packet loss across network paths. | |
81 | * | |
82 | * Author - | |
83 | * Mike Muuss | |
84 | * U. S. Army Ballistic Research Laboratory | |
85 | * December, 1983 | |
86 | * | |
87 | * Status - | |
88 | * Public Domain. Distribution Unlimited. | |
89 | * Bugs - | |
90 | * More statistics could always be gathered. | |
91 | * This program has to run SUID to ROOT to access the ICMP socket. | |
92 | */ | |
93 | ||
94 | #include <sys/param.h> /* NB: we rely on this for <sys/types.h> */ | |
95 | #include <sys/socket.h> | |
96 | #include <sys/sysctl.h> | |
97 | #include <sys/time.h> | |
98 | #include <sys/uio.h> | |
99 | ||
100 | #include <netinet/in.h> | |
101 | #include <netinet/in_systm.h> | |
102 | #include <netinet/ip.h> | |
103 | #include <netinet/ip_icmp.h> | |
104 | #include <netinet/ip_var.h> | |
105 | #include <arpa/inet.h> | |
106 | #include <net/if.h> | |
107 | ||
108 | #ifdef IPSEC | |
109 | #include <netinet6/ipsec.h> | |
110 | #endif /*IPSEC*/ | |
111 | ||
112 | #include <ctype.h> | |
113 | #include <err.h> | |
114 | #include <errno.h> | |
115 | #include <math.h> | |
116 | #include <netdb.h> | |
117 | #include <signal.h> | |
118 | #include <stdio.h> | |
119 | #include <stdlib.h> | |
120 | #include <string.h> | |
121 | #include <sysexits.h> | |
122 | #include <unistd.h> | |
123 | #include <ifaddrs.h> | |
124 | ||
125 | #define INADDR_LEN ((int)sizeof(in_addr_t)) | |
126 | #define TIMEVAL_LEN ((int)sizeof(struct tv32)) | |
127 | #define MASK_LEN (ICMP_MASKLEN - ICMP_MINLEN) | |
128 | #define TS_LEN (ICMP_TSLEN - ICMP_MINLEN) | |
129 | #define DEFDATALEN 56 /* default data length */ | |
130 | #define FLOOD_BACKOFF 20000 /* usecs to back off if F_FLOOD mode */ | |
131 | /* runs out of buffer space */ | |
132 | #define MAXIPLEN (sizeof(struct ip) + MAX_IPOPTLEN) | |
133 | #define MAXICMPLEN (ICMP_ADVLENMIN + MAX_IPOPTLEN) | |
134 | #define MAXWAIT 10000 /* max ms to wait for response */ | |
135 | #define MAXALARM (60 * 60) /* max seconds for alarm timeout */ | |
136 | #define MAXTOS 255 | |
137 | ||
138 | #define A(bit) rcvd_tbl[(bit)>>3] /* identify byte in array */ | |
139 | #define B(bit) (1 << ((bit) & 0x07)) /* identify bit in byte */ | |
140 | #define SET(bit) (A(bit) |= B(bit)) | |
141 | #define CLR(bit) (A(bit) &= (~B(bit))) | |
142 | #define TST(bit) (A(bit) & B(bit)) | |
143 | ||
144 | struct tv32 { | |
145 | u_int32_t tv32_sec; | |
146 | u_int32_t tv32_usec; | |
147 | }; | |
148 | ||
149 | /* various options */ | |
150 | int options; | |
151 | #define F_FLOOD 0x0001 | |
152 | #define F_INTERVAL 0x0002 | |
153 | #define F_NUMERIC 0x0004 | |
154 | #define F_PINGFILLED 0x0008 | |
155 | #define F_QUIET 0x0010 | |
156 | #define F_RROUTE 0x0020 | |
157 | #define F_SO_DEBUG 0x0040 | |
158 | #define F_SO_DONTROUTE 0x0080 | |
159 | #define F_VERBOSE 0x0100 | |
160 | #define F_QUIET2 0x0200 | |
161 | #define F_NOLOOP 0x0400 | |
162 | #define F_MTTL 0x0800 | |
163 | #define F_MIF 0x1000 | |
164 | #define F_AUDIBLE 0x2000 | |
165 | #ifdef IPSEC | |
166 | #ifdef IPSEC_POLICY_IPSEC | |
167 | #define F_POLICY 0x4000 | |
168 | #endif /*IPSEC_POLICY_IPSEC*/ | |
169 | #endif /*IPSEC*/ | |
170 | #define F_TTL 0x8000 | |
171 | #define F_MISSED 0x10000 | |
172 | #define F_ONCE 0x20000 | |
173 | #define F_HDRINCL 0x40000 | |
174 | #define F_MASK 0x80000 | |
175 | #define F_TIME 0x100000 | |
176 | #define F_SWEEP 0x200000 | |
177 | #define F_WAITTIME 0x400000 | |
178 | ||
179 | /* | |
180 | * MAX_DUP_CHK is the number of bits in received table, i.e. the maximum | |
181 | * number of received sequence numbers we can keep track of. Change 128 | |
182 | * to 8192 for complete accuracy... | |
183 | */ | |
184 | #define MAX_DUP_CHK (8 * 128) | |
185 | int mx_dup_ck = MAX_DUP_CHK; | |
186 | char rcvd_tbl[MAX_DUP_CHK / 8]; | |
187 | ||
188 | struct sockaddr_in whereto; /* who to ping */ | |
189 | int datalen = DEFDATALEN; | |
190 | int maxpayload; | |
191 | int s; /* socket file descriptor */ | |
192 | u_char outpackhdr[IP_MAXPACKET], *outpack; | |
193 | char BBELL = '\a'; /* characters written for MISSED and AUDIBLE */ | |
194 | char BSPACE = '\b'; /* characters written for flood */ | |
195 | char DOT = '.'; | |
196 | char *hostname; | |
197 | char *shostname; | |
198 | int ident; /* process id to identify our packets */ | |
199 | int uid; /* cached uid for micro-optimization */ | |
200 | u_char icmp_type = ICMP_ECHO; | |
201 | u_char icmp_type_rsp = ICMP_ECHOREPLY; | |
202 | int phdr_len = 0; | |
203 | int send_len; | |
204 | char *boundif; | |
205 | unsigned int ifscope; | |
206 | #if defined(IP_FORCE_OUT_IFP) && TARGET_OS_EMBEDDED | |
207 | char boundifname[IFNAMSIZ]; | |
208 | #endif /* IP_FORCE_OUT_IFP */ | |
209 | int nocell; | |
210 | int how_traffic_class = 0; | |
211 | int traffic_class = -1; | |
212 | int no_dup = 0; | |
213 | ||
214 | /* counters */ | |
215 | long nmissedmax; /* max value of ntransmitted - nreceived - 1 */ | |
216 | long npackets; /* max packets to transmit */ | |
217 | long nreceived; /* # of packets we got back */ | |
218 | long nrepeats; /* number of duplicates */ | |
219 | long ntransmitted; /* sequence # for outbound packets = #sent */ | |
220 | long snpackets; /* max packets to transmit in one sweep */ | |
221 | long snreceived; /* # of packets we got back in this sweep */ | |
222 | long sntransmitted; /* # of packets we sent in this sweep */ | |
223 | int sweepmax; /* max value of payload in sweep */ | |
224 | int sweepmin = 0; /* start value of payload in sweep */ | |
225 | int sweepincr = 1; /* payload increment in sweep */ | |
226 | int interval = 1000; /* interval between packets, ms */ | |
227 | int waittime = MAXWAIT; /* timeout for each packet */ | |
228 | long nrcvtimeout = 0; /* # of packets we got back after waittime */ | |
229 | ||
230 | /* timing */ | |
231 | int timing; /* flag to do timing */ | |
232 | double tmin = 999999999.0; /* minimum round trip time */ | |
233 | double tmax = 0.0; /* maximum round trip time */ | |
234 | double tsum = 0.0; /* sum of all times, for doing average */ | |
235 | double tsumsq = 0.0; /* sum of all times squared, for std. dev. */ | |
236 | ||
237 | volatile sig_atomic_t finish_up; /* nonzero if we've been told to finish up */ | |
238 | volatile sig_atomic_t siginfo_p; | |
239 | ||
240 | static void fill(char *, char *); | |
241 | static u_short in_cksum(u_short *, int); | |
242 | static void check_status(void); | |
243 | static void finish(void) __dead2; | |
244 | static void pinger(void); | |
245 | static char *pr_addr(struct in_addr); | |
246 | static char *pr_ntime(n_time); | |
247 | static void pr_icmph(struct icmp *); | |
248 | static void pr_iph(struct ip *); | |
249 | static void pr_pack(char *, int, struct sockaddr_in *, struct timeval *, int); | |
250 | static void pr_retip(struct ip *); | |
251 | static void status(int); | |
252 | static void stopit(int); | |
253 | static void tvsub(struct timeval *, struct timeval *); | |
254 | static void usage(void) __dead2; | |
255 | ||
256 | int | |
257 | main(argc, argv) | |
258 | int argc; | |
259 | char *const *argv; | |
260 | { | |
261 | struct sockaddr_in from, sock_in; | |
262 | struct in_addr ifaddr; | |
263 | struct timeval last, intvl; | |
264 | struct iovec iov; | |
265 | struct ip *ip; | |
266 | struct msghdr msg; | |
267 | struct sigaction si_sa; | |
268 | size_t sz; | |
269 | u_char *datap, packet[IP_MAXPACKET]; | |
270 | char *ep, *source, *target, *payload; | |
271 | struct hostent *hp; | |
272 | #ifdef IPSEC_POLICY_IPSEC | |
273 | char *policy_in, *policy_out; | |
274 | #endif | |
275 | struct sockaddr_in *to; | |
276 | double t; | |
277 | u_long alarmtimeout, ultmp; | |
278 | int almost_done, ch, df, hold, i, icmp_len, mib[4], preload, sockerrno, | |
279 | tos, ttl; | |
280 | char ctrl[CMSG_SPACE(sizeof(struct timeval)) + CMSG_SPACE(sizeof(int))]; | |
281 | char hnamebuf[MAXHOSTNAMELEN], snamebuf[MAXHOSTNAMELEN]; | |
282 | #ifdef IP_OPTIONS | |
283 | char rspace[MAX_IPOPTLEN]; /* record route space */ | |
284 | #endif | |
285 | unsigned char loop, mttl; | |
286 | ||
287 | payload = source = NULL; | |
288 | #ifdef IPSEC_POLICY_IPSEC | |
289 | policy_in = policy_out = NULL; | |
290 | #endif | |
291 | ||
292 | /* | |
293 | * Do the stuff that we need root priv's for *first*, and | |
294 | * then drop our setuid bit. Save error reporting for | |
295 | * after arg parsing. | |
296 | */ | |
297 | if (getuid()) | |
298 | s = socket(AF_INET, SOCK_DGRAM, IPPROTO_ICMP); | |
299 | else | |
300 | s = socket(AF_INET, SOCK_RAW, IPPROTO_ICMP); | |
301 | sockerrno = errno; | |
302 | ||
303 | setuid(getuid()); | |
304 | uid = getuid(); | |
305 | ||
306 | alarmtimeout = df = preload = tos = 0; | |
307 | ||
308 | outpack = outpackhdr + sizeof(struct ip); | |
309 | while ((ch = getopt(argc, argv, | |
310 | "Aab:Cc:DdfG:g:h:I:i:k:Ll:M:m:nop:QqRrS:s:T:t:vW:z:" | |
311 | #ifdef IPSEC | |
312 | #ifdef IPSEC_POLICY_IPSEC | |
313 | "P:" | |
314 | #endif /*IPSEC_POLICY_IPSEC*/ | |
315 | #endif /*IPSEC*/ | |
316 | #if defined(IP_FORCE_OUT_IFP) && TARGET_OS_EMBEDDED | |
317 | "B:" | |
318 | #endif /* IP_FORCE_OUT_IFP */ | |
319 | )) != -1) | |
320 | { | |
321 | switch(ch) { | |
322 | case 'A': | |
323 | options |= F_MISSED; | |
324 | break; | |
325 | case 'a': | |
326 | options |= F_AUDIBLE; | |
327 | break; | |
328 | #if defined(IP_FORCE_OUT_IFP) && TARGET_OS_EMBEDDED | |
329 | case 'B': | |
330 | (void) snprintf(boundifname, sizeof (boundifname), | |
331 | "%s", optarg); | |
332 | break; | |
333 | #endif /* IP_FORCE_OUT_IFP */ | |
334 | case 'b': | |
335 | boundif = optarg; | |
336 | break; | |
337 | case 'C': | |
338 | nocell++; | |
339 | break; | |
340 | case 'c': | |
341 | ultmp = strtoul(optarg, &ep, 0); | |
342 | if (*ep || ep == optarg || ultmp > LONG_MAX || !ultmp) | |
343 | errx(EX_USAGE, | |
344 | "invalid count of packets to transmit: `%s'", | |
345 | optarg); | |
346 | npackets = ultmp; | |
347 | break; | |
348 | case 'D': | |
349 | options |= F_HDRINCL; | |
350 | df = 1; | |
351 | break; | |
352 | case 'd': | |
353 | options |= F_SO_DEBUG; | |
354 | break; | |
355 | case 'f': | |
356 | if (uid) { | |
357 | errno = EPERM; | |
358 | err(EX_NOPERM, "-f flag"); | |
359 | } | |
360 | options |= F_FLOOD; | |
361 | setbuf(stdout, (char *)NULL); | |
362 | break; | |
363 | case 'G': /* Maximum packet size for ping sweep */ | |
364 | ultmp = strtoul(optarg, &ep, 0); | |
365 | if (*ep || ep == optarg) | |
366 | errx(EX_USAGE, "invalid packet size: `%s'", | |
367 | optarg); | |
368 | #ifndef __APPLE__ | |
369 | if (uid != 0 && ultmp > DEFDATALEN) { | |
370 | errno = EPERM; | |
371 | err(EX_NOPERM, | |
372 | "packet size too large: %lu > %u", | |
373 | ultmp, DEFDATALEN); | |
374 | } | |
375 | #endif /* __APPLE__ */ | |
376 | options |= F_SWEEP; | |
377 | sweepmax = ultmp; | |
378 | break; | |
379 | case 'g': /* Minimum packet size for ping sweep */ | |
380 | ultmp = strtoul(optarg, &ep, 0); | |
381 | if (*ep || ep == optarg) | |
382 | errx(EX_USAGE, "invalid packet size: `%s'", | |
383 | optarg); | |
384 | #ifndef __APPLE__ | |
385 | if (uid != 0 && ultmp > DEFDATALEN) { | |
386 | errno = EPERM; | |
387 | err(EX_NOPERM, | |
388 | "packet size too large: %lu > %u", | |
389 | ultmp, DEFDATALEN); | |
390 | } | |
391 | #endif /* __APPLE__ */ | |
392 | options |= F_SWEEP; | |
393 | sweepmin = ultmp; | |
394 | break; | |
395 | case 'h': /* Packet size increment for ping sweep */ | |
396 | ultmp = strtoul(optarg, &ep, 0); | |
397 | if (*ep || ep == optarg || ultmp < 1) | |
398 | errx(EX_USAGE, "invalid increment size: `%s'", | |
399 | optarg); | |
400 | #ifndef __APPLE__ | |
401 | if (uid != 0 && ultmp > DEFDATALEN) { | |
402 | errno = EPERM; | |
403 | err(EX_NOPERM, | |
404 | "packet size too large: %lu > %u", | |
405 | ultmp, DEFDATALEN); | |
406 | } | |
407 | #endif /* __APPLE__ */ | |
408 | options |= F_SWEEP; | |
409 | sweepincr = ultmp; | |
410 | break; | |
411 | case 'I': /* multicast interface */ | |
412 | if (inet_aton(optarg, &ifaddr) == 0) | |
413 | errx(EX_USAGE, | |
414 | "invalid multicast interface: `%s'", | |
415 | optarg); | |
416 | options |= F_MIF; | |
417 | break; | |
418 | case 'i': /* wait between sending packets */ | |
419 | t = strtod(optarg, &ep) * 1000.0; | |
420 | if (*ep || ep == optarg || t > (double)INT_MAX) | |
421 | errx(EX_USAGE, "invalid timing interval: `%s'", | |
422 | optarg); | |
423 | options |= F_INTERVAL; | |
424 | interval = (int)t; | |
425 | if (uid && interval < 1000) { | |
426 | errno = EPERM; | |
427 | err(EX_NOPERM, "-i interval too short"); | |
428 | } | |
429 | break; | |
430 | case 'k': | |
431 | how_traffic_class++; | |
432 | traffic_class = atoi(optarg); | |
433 | break; | |
434 | case 'L': | |
435 | options |= F_NOLOOP; | |
436 | loop = 0; | |
437 | break; | |
438 | case 'l': | |
439 | ultmp = strtoul(optarg, &ep, 0); | |
440 | if (*ep || ep == optarg || ultmp > INT_MAX) | |
441 | errx(EX_USAGE, | |
442 | "invalid preload value: `%s'", optarg); | |
443 | if (uid) { | |
444 | errno = EPERM; | |
445 | err(EX_NOPERM, "-l flag"); | |
446 | } | |
447 | preload = ultmp; | |
448 | break; | |
449 | case 'M': | |
450 | switch(optarg[0]) { | |
451 | case 'M': | |
452 | case 'm': | |
453 | options |= F_MASK; | |
454 | break; | |
455 | case 'T': | |
456 | case 't': | |
457 | options |= F_TIME; | |
458 | break; | |
459 | default: | |
460 | errx(EX_USAGE, "invalid message: `%c'", optarg[0]); | |
461 | break; | |
462 | } | |
463 | break; | |
464 | case 'm': /* TTL */ | |
465 | ultmp = strtoul(optarg, &ep, 0); | |
466 | if (*ep || ep == optarg || ultmp > MAXTTL) | |
467 | errx(EX_USAGE, "invalid TTL: `%s'", optarg); | |
468 | ttl = ultmp; | |
469 | options |= F_TTL; | |
470 | break; | |
471 | case 'n': | |
472 | options |= F_NUMERIC; | |
473 | break; | |
474 | case 'o': | |
475 | options |= F_ONCE; | |
476 | break; | |
477 | #ifdef IPSEC | |
478 | #ifdef IPSEC_POLICY_IPSEC | |
479 | case 'P': | |
480 | options |= F_POLICY; | |
481 | if (!strncmp("in", optarg, 2)) | |
482 | policy_in = strdup(optarg); | |
483 | else if (!strncmp("out", optarg, 3)) | |
484 | policy_out = strdup(optarg); | |
485 | else | |
486 | errx(1, "invalid security policy"); | |
487 | break; | |
488 | #endif /*IPSEC_POLICY_IPSEC*/ | |
489 | #endif /*IPSEC*/ | |
490 | case 'p': /* fill buffer with user pattern */ | |
491 | options |= F_PINGFILLED; | |
492 | payload = optarg; | |
493 | break; | |
494 | case 'Q': | |
495 | options |= F_QUIET2; | |
496 | break; | |
497 | case 'q': | |
498 | options |= F_QUIET; | |
499 | break; | |
500 | case 'R': | |
501 | options |= F_RROUTE; | |
502 | break; | |
503 | case 'r': | |
504 | options |= F_SO_DONTROUTE; | |
505 | break; | |
506 | case 'S': | |
507 | source = optarg; | |
508 | break; | |
509 | case 's': /* size of packet to send */ | |
510 | ultmp = strtoul(optarg, &ep, 0); | |
511 | if (*ep || ep == optarg) | |
512 | errx(EX_USAGE, "invalid packet size: `%s'", | |
513 | optarg); | |
514 | #ifndef __APPLE__ | |
515 | if (uid != 0 && ultmp > DEFDATALEN) { | |
516 | errno = EPERM; | |
517 | err(EX_NOPERM, | |
518 | "packet size too large: %lu > %u", | |
519 | ultmp, DEFDATALEN); | |
520 | } | |
521 | #endif /* __APPLE__ */ | |
522 | datalen = ultmp; | |
523 | break; | |
524 | case 'T': /* multicast TTL */ | |
525 | ultmp = strtoul(optarg, &ep, 0); | |
526 | if (*ep || ep == optarg || ultmp > MAXTTL) | |
527 | errx(EX_USAGE, "invalid multicast TTL: `%s'", | |
528 | optarg); | |
529 | mttl = ultmp; | |
530 | options |= F_MTTL; | |
531 | break; | |
532 | case 't': | |
533 | alarmtimeout = strtoul(optarg, &ep, 0); | |
534 | if ((alarmtimeout < 1) || (alarmtimeout == ULONG_MAX)) | |
535 | errx(EX_USAGE, "invalid timeout: `%s'", | |
536 | optarg); | |
537 | if (alarmtimeout > MAXALARM) | |
538 | errx(EX_USAGE, "invalid timeout: `%s' > %d", | |
539 | optarg, MAXALARM); | |
540 | alarm((unsigned int)alarmtimeout); | |
541 | break; | |
542 | case 'v': | |
543 | options |= F_VERBOSE; | |
544 | break; | |
545 | case 'W': /* wait ms for answer */ | |
546 | t = strtod(optarg, &ep); | |
547 | if (*ep || ep == optarg || t > (double)INT_MAX) | |
548 | errx(EX_USAGE, "invalid timing interval: `%s'", | |
549 | optarg); | |
550 | options |= F_WAITTIME; | |
551 | waittime = (int)t; | |
552 | break; | |
553 | case 'z': | |
554 | options |= F_HDRINCL; | |
555 | ultmp = strtoul(optarg, &ep, 0); | |
556 | if (*ep || ep == optarg || ultmp > MAXTOS) | |
557 | errx(EX_USAGE, "invalid TOS: `%s'", optarg); | |
558 | tos = ultmp; | |
559 | break; | |
560 | default: | |
561 | usage(); | |
562 | } | |
563 | } | |
564 | ||
565 | if (boundif != NULL && (ifscope = if_nametoindex(boundif)) == 0) | |
566 | errx(1, "bad interface name"); | |
567 | ||
568 | if (argc - optind != 1) | |
569 | usage(); | |
570 | target = argv[optind]; | |
571 | ||
572 | switch (options & (F_MASK|F_TIME)) { | |
573 | case 0: break; | |
574 | case F_MASK: | |
575 | icmp_type = ICMP_MASKREQ; | |
576 | icmp_type_rsp = ICMP_MASKREPLY; | |
577 | phdr_len = MASK_LEN; | |
578 | if (!(options & F_QUIET)) | |
579 | (void)printf("ICMP_MASKREQ\n"); | |
580 | break; | |
581 | case F_TIME: | |
582 | icmp_type = ICMP_TSTAMP; | |
583 | icmp_type_rsp = ICMP_TSTAMPREPLY; | |
584 | phdr_len = TS_LEN; | |
585 | if (!(options & F_QUIET)) | |
586 | (void)printf("ICMP_TSTAMP\n"); | |
587 | break; | |
588 | default: | |
589 | errx(EX_USAGE, "ICMP_TSTAMP and ICMP_MASKREQ are exclusive."); | |
590 | break; | |
591 | } | |
592 | icmp_len = sizeof(struct ip) + ICMP_MINLEN + phdr_len; | |
593 | if (options & F_RROUTE) | |
594 | icmp_len += MAX_IPOPTLEN; | |
595 | maxpayload = IP_MAXPACKET - icmp_len; | |
596 | if (datalen > maxpayload) | |
597 | errx(EX_USAGE, "packet size too large: %d > %d", datalen, | |
598 | maxpayload); | |
599 | send_len = icmp_len + datalen; | |
600 | datap = &outpack[ICMP_MINLEN + phdr_len + TIMEVAL_LEN]; | |
601 | if (options & F_PINGFILLED) { | |
602 | fill((char *)datap, payload); | |
603 | } | |
604 | if (source) { | |
605 | bzero((char *)&sock_in, sizeof(sock_in)); | |
606 | sock_in.sin_family = AF_INET; | |
607 | if (inet_aton(source, &sock_in.sin_addr) != 0) { | |
608 | shostname = source; | |
609 | } else { | |
610 | hp = gethostbyname2(source, AF_INET); | |
611 | if (!hp) | |
612 | errx(EX_NOHOST, "cannot resolve %s: %s", | |
613 | source, hstrerror(h_errno)); | |
614 | ||
615 | sock_in.sin_len = sizeof sock_in; | |
616 | if ((unsigned)hp->h_length > sizeof(sock_in.sin_addr) || | |
617 | hp->h_length < 0) | |
618 | errx(1, "gethostbyname2: illegal address"); | |
619 | memcpy(&sock_in.sin_addr, hp->h_addr_list[0], | |
620 | sizeof(sock_in.sin_addr)); | |
621 | (void)strncpy(snamebuf, hp->h_name, | |
622 | sizeof(snamebuf) - 1); | |
623 | snamebuf[sizeof(snamebuf) - 1] = '\0'; | |
624 | shostname = snamebuf; | |
625 | } | |
626 | if (bind(s, (struct sockaddr *)&sock_in, sizeof sock_in) == -1) | |
627 | err(1, "bind"); | |
628 | } | |
629 | ||
630 | bzero(&whereto, sizeof(whereto)); | |
631 | to = &whereto; | |
632 | to->sin_family = AF_INET; | |
633 | to->sin_len = sizeof *to; | |
634 | if (inet_aton(target, &to->sin_addr) != 0) { | |
635 | hostname = target; | |
636 | } else { | |
637 | hp = gethostbyname2(target, AF_INET); | |
638 | if (!hp) | |
639 | errx(EX_NOHOST, "cannot resolve %s: %s", | |
640 | target, hstrerror(h_errno)); | |
641 | ||
642 | if ((unsigned)hp->h_length > sizeof(to->sin_addr)) | |
643 | errx(1, "gethostbyname2 returned an illegal address"); | |
644 | memcpy(&to->sin_addr, hp->h_addr_list[0], sizeof to->sin_addr); | |
645 | (void)strncpy(hnamebuf, hp->h_name, sizeof(hnamebuf) - 1); | |
646 | hnamebuf[sizeof(hnamebuf) - 1] = '\0'; | |
647 | hostname = hnamebuf; | |
648 | } | |
649 | ||
650 | do { | |
651 | struct ifaddrs *ifa_list, *ifa; | |
652 | ||
653 | if (IN_MULTICAST(ntohl(whereto.sin_addr.s_addr)) || whereto.sin_addr.s_addr == INADDR_BROADCAST) { | |
654 | no_dup = 1; | |
655 | break; | |
656 | } | |
657 | ||
658 | if (getifaddrs(&ifa_list) == -1) | |
659 | break; | |
660 | for (ifa = ifa_list; ifa; ifa = ifa->ifa_next) { | |
661 | if (ifa->ifa_addr->sa_family != AF_INET) | |
662 | continue; | |
663 | if ((ifa->ifa_flags & IFF_BROADCAST) == 0 || ifa->ifa_broadaddr == NULL) | |
664 | continue; | |
665 | if (whereto.sin_addr.s_addr != ((struct sockaddr_in*)ifa->ifa_broadaddr)->sin_addr.s_addr) | |
666 | continue; | |
667 | no_dup = 1; | |
668 | break; | |
669 | } | |
670 | ||
671 | freeifaddrs(ifa_list); | |
672 | } while (0); | |
673 | ||
674 | if (options & F_FLOOD && options & F_INTERVAL) | |
675 | errx(EX_USAGE, "-f and -i: incompatible options"); | |
676 | ||
677 | if (options & F_FLOOD && IN_MULTICAST(ntohl(to->sin_addr.s_addr))) | |
678 | errx(EX_USAGE, | |
679 | "-f flag cannot be used with multicast destination"); | |
680 | if (options & (F_MIF | F_NOLOOP | F_MTTL) | |
681 | && !IN_MULTICAST(ntohl(to->sin_addr.s_addr))) | |
682 | errx(EX_USAGE, | |
683 | "-I, -L, -T flags cannot be used with unicast destination"); | |
684 | ||
685 | if (datalen >= TIMEVAL_LEN) /* can we time transfer */ | |
686 | timing = 1; | |
687 | ||
688 | if (!(options & F_PINGFILLED)) | |
689 | for (i = TIMEVAL_LEN; i < datalen; ++i) | |
690 | *datap++ = i; | |
691 | ||
692 | ident = getpid() & 0xFFFF; | |
693 | ||
694 | if (s < 0) { | |
695 | errno = sockerrno; | |
696 | err(EX_OSERR, "socket"); | |
697 | } | |
698 | hold = 1; | |
699 | if (ifscope != 0) { | |
700 | if (setsockopt(s, IPPROTO_IP, IP_BOUND_IF, | |
701 | (char *)&ifscope, sizeof (ifscope)) != 0) | |
702 | err(EX_OSERR, "setsockopt(IP_BOUND_IF)"); | |
703 | } | |
704 | #if defined(IP_FORCE_OUT_IFP) && TARGET_OS_EMBEDDED | |
705 | else if (boundifname[0] != 0) { | |
706 | if (setsockopt(s, IPPROTO_IP, IP_FORCE_OUT_IFP, boundifname, | |
707 | sizeof (boundifname)) != 0) | |
708 | err(EX_OSERR, "setsockopt(IP_FORCE_OUT_IFP)"); | |
709 | } | |
710 | #endif /* IP_FORCE_OUT_IFP */ | |
711 | if (nocell) { | |
712 | if (setsockopt(s, IPPROTO_IP, IP_NO_IFT_CELLULAR, | |
713 | (char *)&nocell, sizeof (nocell)) != 0) | |
714 | err(EX_OSERR, "setsockopt(IP_NO_IFT_CELLULAR)"); | |
715 | } | |
716 | if (options & F_SO_DEBUG) | |
717 | (void)setsockopt(s, SOL_SOCKET, SO_DEBUG, (char *)&hold, | |
718 | sizeof(hold)); | |
719 | if (options & F_SO_DONTROUTE) | |
720 | (void)setsockopt(s, SOL_SOCKET, SO_DONTROUTE, (char *)&hold, | |
721 | sizeof(hold)); | |
722 | if (how_traffic_class == 1 && traffic_class > 0) { | |
723 | (void)setsockopt(s, SOL_SOCKET, SO_TRAFFIC_CLASS, (void *)&traffic_class, | |
724 | sizeof(traffic_class)); | |
725 | } | |
726 | if (how_traffic_class > 0) { | |
727 | int on = 1; | |
728 | (void)setsockopt(s, SOL_SOCKET, SO_RECV_TRAFFIC_CLASS, (void *)&on, | |
729 | sizeof(on)); | |
730 | } | |
731 | #ifdef IPSEC | |
732 | #ifdef IPSEC_POLICY_IPSEC | |
733 | if (options & F_POLICY) { | |
734 | char *buf; | |
735 | if (policy_in != NULL) { | |
736 | buf = ipsec_set_policy(policy_in, strlen(policy_in)); | |
737 | if (buf == NULL) | |
738 | errx(EX_CONFIG, "%s", ipsec_strerror()); | |
739 | if (setsockopt(s, IPPROTO_IP, IP_IPSEC_POLICY, | |
740 | buf, ipsec_get_policylen(buf)) < 0) | |
741 | err(EX_CONFIG, | |
742 | "ipsec policy cannot be configured"); | |
743 | free(buf); | |
744 | } | |
745 | ||
746 | if (policy_out != NULL) { | |
747 | buf = ipsec_set_policy(policy_out, strlen(policy_out)); | |
748 | if (buf == NULL) | |
749 | errx(EX_CONFIG, "%s", ipsec_strerror()); | |
750 | if (setsockopt(s, IPPROTO_IP, IP_IPSEC_POLICY, | |
751 | buf, ipsec_get_policylen(buf)) < 0) | |
752 | err(EX_CONFIG, | |
753 | "ipsec policy cannot be configured"); | |
754 | free(buf); | |
755 | } | |
756 | } | |
757 | #endif /*IPSEC_POLICY_IPSEC*/ | |
758 | #endif /*IPSEC*/ | |
759 | ||
760 | if (options & F_HDRINCL) { | |
761 | ip = (struct ip*)outpackhdr; | |
762 | if (!(options & (F_TTL | F_MTTL))) { | |
763 | mib[0] = CTL_NET; | |
764 | mib[1] = PF_INET; | |
765 | mib[2] = IPPROTO_IP; | |
766 | mib[3] = IPCTL_DEFTTL; | |
767 | sz = sizeof(ttl); | |
768 | if (sysctl(mib, 4, &ttl, &sz, NULL, 0) == -1) | |
769 | err(1, "sysctl(net.inet.ip.ttl)"); | |
770 | } | |
771 | setsockopt(s, IPPROTO_IP, IP_HDRINCL, &hold, sizeof(hold)); | |
772 | ip->ip_v = IPVERSION; | |
773 | ip->ip_hl = sizeof(struct ip) >> 2; | |
774 | ip->ip_tos = tos; | |
775 | ip->ip_id = 0; | |
776 | ip->ip_off = df ? IP_DF : 0; | |
777 | ip->ip_ttl = ttl; | |
778 | ip->ip_p = IPPROTO_ICMP; | |
779 | ip->ip_src.s_addr = source ? sock_in.sin_addr.s_addr : INADDR_ANY; | |
780 | ip->ip_dst = to->sin_addr; | |
781 | } | |
782 | /* record route option */ | |
783 | if (options & F_RROUTE) { | |
784 | #ifdef IP_OPTIONS | |
785 | bzero(rspace, sizeof(rspace)); | |
786 | rspace[IPOPT_OPTVAL] = IPOPT_RR; | |
787 | rspace[IPOPT_OLEN] = sizeof(rspace) - 1; | |
788 | rspace[IPOPT_OFFSET] = IPOPT_MINOFF; | |
789 | rspace[sizeof(rspace) - 1] = IPOPT_EOL; | |
790 | if (setsockopt(s, IPPROTO_IP, IP_OPTIONS, rspace, | |
791 | sizeof(rspace)) < 0) | |
792 | err(EX_OSERR, "setsockopt IP_OPTIONS"); | |
793 | #else | |
794 | errx(EX_UNAVAILABLE, | |
795 | "record route not available in this implementation"); | |
796 | #endif /* IP_OPTIONS */ | |
797 | } | |
798 | ||
799 | if (options & F_TTL) { | |
800 | if (setsockopt(s, IPPROTO_IP, IP_TTL, &ttl, | |
801 | sizeof(ttl)) < 0) { | |
802 | err(EX_OSERR, "setsockopt IP_TTL"); | |
803 | } | |
804 | } | |
805 | if (options & F_NOLOOP) { | |
806 | if (setsockopt(s, IPPROTO_IP, IP_MULTICAST_LOOP, &loop, | |
807 | sizeof(loop)) < 0) { | |
808 | err(EX_OSERR, "setsockopt IP_MULTICAST_LOOP"); | |
809 | } | |
810 | } | |
811 | if (options & F_MTTL) { | |
812 | if (setsockopt(s, IPPROTO_IP, IP_MULTICAST_TTL, &mttl, | |
813 | sizeof(mttl)) < 0) { | |
814 | err(EX_OSERR, "setsockopt IP_MULTICAST_TTL"); | |
815 | } | |
816 | } | |
817 | if (options & F_MIF) { | |
818 | if (setsockopt(s, IPPROTO_IP, IP_MULTICAST_IF, &ifaddr, | |
819 | sizeof(ifaddr)) < 0) { | |
820 | err(EX_OSERR, "setsockopt IP_MULTICAST_IF"); | |
821 | } | |
822 | } | |
823 | #ifdef SO_TIMESTAMP | |
824 | { int on = 1; | |
825 | if (setsockopt(s, SOL_SOCKET, SO_TIMESTAMP, &on, sizeof(on)) < 0) | |
826 | err(EX_OSERR, "setsockopt SO_TIMESTAMP"); | |
827 | } | |
828 | #endif | |
829 | if (sweepmax) { | |
830 | if (sweepmin >= sweepmax) | |
831 | errx(EX_USAGE, "Maximum packet size must be greater than the minimum packet size"); | |
832 | ||
833 | if (datalen != DEFDATALEN) | |
834 | errx(EX_USAGE, "Packet size and ping sweep are mutually exclusive"); | |
835 | ||
836 | if (npackets > 0) { | |
837 | snpackets = npackets; | |
838 | npackets = 0; | |
839 | } else | |
840 | snpackets = 1; | |
841 | datalen = sweepmin; | |
842 | send_len = icmp_len + sweepmin; | |
843 | } | |
844 | if (options & F_SWEEP && !sweepmax) | |
845 | errx(EX_USAGE, "Maximum sweep size must be specified"); | |
846 | ||
847 | /* | |
848 | * When pinging the broadcast address, you can get a lot of answers. | |
849 | * Doing something so evil is useful if you are trying to stress the | |
850 | * ethernet, or just want to fill the arp cache to get some stuff for | |
851 | * /etc/ethers. But beware: RFC 1122 allows hosts to ignore broadcast | |
852 | * or multicast pings if they wish. | |
853 | */ | |
854 | ||
855 | /* | |
856 | * XXX receive buffer needs undetermined space for mbuf overhead | |
857 | * as well. | |
858 | */ | |
859 | hold = IP_MAXPACKET + 128; | |
860 | (void)setsockopt(s, SOL_SOCKET, SO_RCVBUF, (char *)&hold, | |
861 | sizeof(hold)); | |
862 | if (uid == 0) | |
863 | (void)setsockopt(s, SOL_SOCKET, SO_SNDBUF, (char *)&hold, | |
864 | sizeof(hold)); | |
865 | ||
866 | if (to->sin_family == AF_INET) { | |
867 | (void)printf("PING %s (%s)", hostname, | |
868 | inet_ntoa(to->sin_addr)); | |
869 | if (source) | |
870 | (void)printf(" from %s", shostname); | |
871 | if (sweepmax) | |
872 | (void)printf(": (%d ... %d) data bytes\n", | |
873 | sweepmin, sweepmax); | |
874 | else | |
875 | (void)printf(": %d data bytes\n", datalen); | |
876 | ||
877 | } else { | |
878 | if (sweepmax) | |
879 | (void)printf("PING %s: (%d ... %d) data bytes\n", | |
880 | hostname, sweepmin, sweepmax); | |
881 | else | |
882 | (void)printf("PING %s: %d data bytes\n", hostname, datalen); | |
883 | } | |
884 | ||
885 | /* | |
886 | * Use sigaction() instead of signal() to get unambiguous semantics, | |
887 | * in particular with SA_RESTART not set. | |
888 | */ | |
889 | ||
890 | sigemptyset(&si_sa.sa_mask); | |
891 | si_sa.sa_flags = 0; | |
892 | ||
893 | si_sa.sa_handler = stopit; | |
894 | if (sigaction(SIGINT, &si_sa, 0) == -1) { | |
895 | err(EX_OSERR, "sigaction SIGINT"); | |
896 | } | |
897 | ||
898 | si_sa.sa_handler = status; | |
899 | if (sigaction(SIGINFO, &si_sa, 0) == -1) { | |
900 | err(EX_OSERR, "sigaction"); | |
901 | } | |
902 | ||
903 | if (alarmtimeout > 0) { | |
904 | si_sa.sa_handler = stopit; | |
905 | if (sigaction(SIGALRM, &si_sa, 0) == -1) | |
906 | err(EX_OSERR, "sigaction SIGALRM"); | |
907 | } | |
908 | ||
909 | bzero(&msg, sizeof(msg)); | |
910 | msg.msg_name = (caddr_t)&from; | |
911 | msg.msg_iov = &iov; | |
912 | msg.msg_iovlen = 1; | |
913 | #ifdef SO_TIMESTAMP | |
914 | msg.msg_control = (caddr_t)ctrl; | |
915 | #endif | |
916 | iov.iov_base = packet; | |
917 | iov.iov_len = IP_MAXPACKET; | |
918 | ||
919 | if (preload == 0) | |
920 | pinger(); /* send the first ping */ | |
921 | else { | |
922 | if (npackets != 0 && preload > npackets) | |
923 | preload = npackets; | |
924 | while (preload--) /* fire off them quickies */ | |
925 | pinger(); | |
926 | } | |
927 | (void)gettimeofday(&last, NULL); | |
928 | ||
929 | if (options & F_FLOOD) { | |
930 | intvl.tv_sec = 0; | |
931 | intvl.tv_usec = 10000; | |
932 | } else { | |
933 | intvl.tv_sec = interval / 1000; | |
934 | intvl.tv_usec = interval % 1000 * 1000; | |
935 | } | |
936 | ||
937 | almost_done = 0; | |
938 | while (!finish_up) { | |
939 | struct timeval now, timeout; | |
940 | fd_set rfds; | |
941 | int cc, n; | |
942 | int tc = -1; | |
943 | ||
944 | check_status(); | |
945 | if ((unsigned)s >= FD_SETSIZE) | |
946 | errx(EX_OSERR, "descriptor too large"); | |
947 | FD_ZERO(&rfds); | |
948 | FD_SET(s, &rfds); | |
949 | (void)gettimeofday(&now, NULL); | |
950 | timeout.tv_sec = last.tv_sec + intvl.tv_sec - now.tv_sec; | |
951 | timeout.tv_usec = last.tv_usec + intvl.tv_usec - now.tv_usec; | |
952 | while (timeout.tv_usec < 0) { | |
953 | timeout.tv_usec += 1000000; | |
954 | timeout.tv_sec--; | |
955 | } | |
956 | while (timeout.tv_usec >= 1000000) { | |
957 | timeout.tv_usec -= 1000000; | |
958 | timeout.tv_sec++; | |
959 | } | |
960 | if (timeout.tv_sec < 0) | |
961 | timeout.tv_sec = timeout.tv_usec = 0; | |
962 | n = select(s + 1, &rfds, NULL, NULL, &timeout); | |
963 | if (n < 0) | |
964 | continue; /* Must be EINTR. */ | |
965 | if (n == 1) { | |
966 | struct timeval *tv = NULL; | |
967 | #ifdef SO_TIMESTAMP | |
968 | struct cmsghdr *cmsg = (struct cmsghdr *)&ctrl; | |
969 | ||
970 | msg.msg_controllen = sizeof(ctrl); | |
971 | #endif | |
972 | msg.msg_namelen = sizeof(from); | |
973 | if ((cc = recvmsg(s, &msg, 0)) < 0) { | |
974 | if (errno == EINTR) | |
975 | continue; | |
976 | warn("recvmsg"); | |
977 | continue; | |
978 | } | |
979 | for (cmsg = CMSG_FIRSTHDR(&msg); cmsg != NULL; cmsg = CMSG_NXTHDR(&msg, cmsg)) { | |
980 | #ifdef SO_TIMESTAMP | |
981 | if (cmsg->cmsg_level == SOL_SOCKET && | |
982 | cmsg->cmsg_type == SCM_TIMESTAMP && | |
983 | cmsg->cmsg_len == CMSG_LEN(sizeof *tv)) { | |
984 | /* Copy to avoid alignment problems: */ | |
985 | memcpy(&now, CMSG_DATA(cmsg), sizeof(now)); | |
986 | tv = &now; | |
987 | } | |
988 | #endif | |
989 | if (cmsg->cmsg_level == SOL_SOCKET && | |
990 | cmsg->cmsg_type == SO_TRAFFIC_CLASS && | |
991 | cmsg->cmsg_len == CMSG_LEN(sizeof(int))) { | |
992 | /* Copy to avoid alignment problems: */ | |
993 | memcpy(&tc, CMSG_DATA(cmsg), sizeof(tc)); | |
994 | } | |
995 | } | |
996 | if (tv == NULL) { | |
997 | (void)gettimeofday(&now, NULL); | |
998 | tv = &now; | |
999 | } | |
1000 | pr_pack((char *)packet, cc, &from, tv, tc); | |
1001 | if ((options & F_ONCE && nreceived) || | |
1002 | (npackets && nreceived >= npackets)) | |
1003 | break; | |
1004 | } | |
1005 | if (n == 0 || options & F_FLOOD) { | |
1006 | if (sweepmax && sntransmitted == snpackets) { | |
1007 | for (i = 0; i < sweepincr ; ++i) | |
1008 | *datap++ = i; | |
1009 | datalen += sweepincr; | |
1010 | if (datalen > sweepmax) | |
1011 | break; | |
1012 | send_len = icmp_len + datalen; | |
1013 | sntransmitted = 0; | |
1014 | } | |
1015 | if (!npackets || ntransmitted < npackets) | |
1016 | pinger(); | |
1017 | else { | |
1018 | if (almost_done) | |
1019 | break; | |
1020 | almost_done = 1; | |
1021 | intvl.tv_usec = 0; | |
1022 | if (nreceived) { | |
1023 | intvl.tv_sec = 2 * tmax / 1000; | |
1024 | if (!intvl.tv_sec) | |
1025 | intvl.tv_sec = 1; | |
1026 | } else { | |
1027 | intvl.tv_sec = waittime / 1000; | |
1028 | intvl.tv_usec = waittime % 1000 * 1000; | |
1029 | } | |
1030 | } | |
1031 | (void)gettimeofday(&last, NULL); | |
1032 | if (ntransmitted - nreceived - 1 > nmissedmax) { | |
1033 | nmissedmax = ntransmitted - nreceived - 1; | |
1034 | if (options & F_MISSED) | |
1035 | (void)write(STDOUT_FILENO, &BBELL, 1); | |
1036 | if (!(options & F_QUIET)) | |
1037 | printf("Request timeout for icmp_seq %ld\n", ntransmitted - 2); | |
1038 | } | |
1039 | } | |
1040 | } | |
1041 | finish(); | |
1042 | /* NOTREACHED */ | |
1043 | exit(0); /* Make the compiler happy */ | |
1044 | } | |
1045 | ||
1046 | /* | |
1047 | * stopit -- | |
1048 | * Set the global bit that causes the main loop to quit. | |
1049 | * Do NOT call finish() from here, since finish() does far too much | |
1050 | * to be called from a signal handler. | |
1051 | */ | |
1052 | void | |
1053 | stopit(sig) | |
1054 | int sig __unused; | |
1055 | { | |
1056 | ||
1057 | /* | |
1058 | * When doing reverse DNS lookups, the finish_up flag might not | |
1059 | * be noticed for a while. Just exit if we get a second SIGINT. | |
1060 | */ | |
1061 | if (!(options & F_NUMERIC) && finish_up) | |
1062 | _exit(nreceived ? 0 : 2); | |
1063 | finish_up = 1; | |
1064 | } | |
1065 | ||
1066 | /* | |
1067 | * pinger -- | |
1068 | * Compose and transmit an ICMP ECHO REQUEST packet. The IP packet | |
1069 | * will be added on by the kernel. The ID field is our UNIX process ID, | |
1070 | * and the sequence number is an ascending integer. The first TIMEVAL_LEN | |
1071 | * bytes of the data portion are used to hold a UNIX "timeval" struct in | |
1072 | * host byte-order, to compute the round-trip time. | |
1073 | */ | |
1074 | static void | |
1075 | pinger(void) | |
1076 | { | |
1077 | struct timeval now; | |
1078 | struct tv32 tv32; | |
1079 | struct ip *ip; | |
1080 | struct icmp *icp; | |
1081 | int cc, i; | |
1082 | u_char *packet; | |
1083 | ||
1084 | packet = outpack; | |
1085 | icp = (struct icmp *)outpack; | |
1086 | icp->icmp_type = icmp_type; | |
1087 | icp->icmp_code = 0; | |
1088 | icp->icmp_cksum = 0; | |
1089 | icp->icmp_seq = htons(ntransmitted); | |
1090 | icp->icmp_id = ident; /* ID */ | |
1091 | ||
1092 | CLR(ntransmitted % mx_dup_ck); | |
1093 | ||
1094 | if ((options & F_TIME) || timing) { | |
1095 | (void)gettimeofday(&now, NULL); | |
1096 | ||
1097 | tv32.tv32_sec = htonl(now.tv_sec); | |
1098 | tv32.tv32_usec = htonl(now.tv_usec); | |
1099 | if (options & F_TIME) | |
1100 | icp->icmp_otime = htonl((now.tv_sec % (24*60*60)) | |
1101 | * 1000 + now.tv_usec / 1000); | |
1102 | if (timing) | |
1103 | bcopy((void *)&tv32, | |
1104 | (void *)&outpack[ICMP_MINLEN + phdr_len], | |
1105 | sizeof(tv32)); | |
1106 | } | |
1107 | ||
1108 | cc = ICMP_MINLEN + phdr_len + datalen; | |
1109 | ||
1110 | /* compute ICMP checksum here */ | |
1111 | icp->icmp_cksum = in_cksum((u_short *)icp, cc); | |
1112 | ||
1113 | if (options & F_HDRINCL) { | |
1114 | cc += sizeof(struct ip); | |
1115 | ip = (struct ip *)outpackhdr; | |
1116 | ip->ip_len = cc; | |
1117 | ip->ip_sum = in_cksum((u_short *)outpackhdr, cc); | |
1118 | packet = outpackhdr; | |
1119 | } | |
1120 | if (how_traffic_class == 2) { | |
1121 | struct msghdr msg; | |
1122 | struct iovec iov; | |
1123 | char *cmbuf[CMSG_SPACE(sizeof(int))]; | |
1124 | struct cmsghdr *cm = (struct cmsghdr *)cmbuf; | |
1125 | ||
1126 | msg.msg_name = &whereto; | |
1127 | msg.msg_namelen = sizeof(whereto); | |
1128 | ||
1129 | iov.iov_base = packet; | |
1130 | iov.iov_len = cc; | |
1131 | msg.msg_iov = &iov; | |
1132 | msg.msg_iovlen = 1; | |
1133 | ||
1134 | cm->cmsg_len = CMSG_LEN(sizeof(int)); | |
1135 | cm->cmsg_level = SOL_SOCKET; | |
1136 | cm->cmsg_type = SO_TRAFFIC_CLASS; | |
1137 | *(int *)CMSG_DATA(cm) = traffic_class; | |
1138 | msg.msg_control = cm; | |
1139 | msg.msg_controllen = CMSG_SPACE(sizeof(int)); | |
1140 | ||
1141 | msg.msg_flags = 0; | |
1142 | ||
1143 | i = sendmsg(s, &msg, 0); | |
1144 | } else { | |
1145 | i = sendto(s, (char *)packet, cc, 0, (struct sockaddr *)&whereto, | |
1146 | sizeof(whereto)); | |
1147 | } | |
1148 | if (i < 0 || i != cc) { | |
1149 | if (i < 0) { | |
1150 | if (options & F_FLOOD && errno == ENOBUFS) { | |
1151 | usleep(FLOOD_BACKOFF); | |
1152 | return; | |
1153 | } | |
1154 | warn("sendto"); | |
1155 | } else { | |
1156 | warn("%s: partial write: %d of %d bytes", | |
1157 | hostname, i, cc); | |
1158 | } | |
1159 | } | |
1160 | ntransmitted++; | |
1161 | sntransmitted++; | |
1162 | if (!(options & F_QUIET) && options & F_FLOOD) | |
1163 | (void)write(STDOUT_FILENO, &DOT, 1); | |
1164 | } | |
1165 | ||
1166 | /* | |
1167 | * pr_pack -- | |
1168 | * Print out the packet, if it came from us. This logic is necessary | |
1169 | * because ALL readers of the ICMP socket get a copy of ALL ICMP packets | |
1170 | * which arrive ('tis only fair). This permits multiple copies of this | |
1171 | * program to be run without having intermingled output (or statistics!). | |
1172 | */ | |
1173 | static void | |
1174 | pr_pack(buf, cc, from, tv, tc) | |
1175 | char *buf; | |
1176 | int cc; | |
1177 | struct sockaddr_in *from; | |
1178 | struct timeval *tv; | |
1179 | int tc; | |
1180 | { | |
1181 | struct in_addr ina; | |
1182 | u_char *cp, *dp; | |
1183 | struct icmp *icp; | |
1184 | struct ip *ip; | |
1185 | const void *tp; | |
1186 | double triptime; | |
1187 | int dupflag, hlen, i, j, recv_len, seq; | |
1188 | static int old_rrlen; | |
1189 | static char old_rr[MAX_IPOPTLEN]; | |
1190 | ||
1191 | /* Check the IP header */ | |
1192 | ip = (struct ip *)buf; | |
1193 | hlen = ip->ip_hl << 2; | |
1194 | recv_len = cc; | |
1195 | if (cc < hlen + ICMP_MINLEN) { | |
1196 | if (options & F_VERBOSE) | |
1197 | warn("packet too short (%d bytes) from %s", cc, | |
1198 | inet_ntoa(from->sin_addr)); | |
1199 | return; | |
1200 | } | |
1201 | ||
1202 | /* Now the ICMP part */ | |
1203 | cc -= hlen; | |
1204 | icp = (struct icmp *)(buf + hlen); | |
1205 | if (icp->icmp_type == icmp_type_rsp) { | |
1206 | if (icp->icmp_id != ident) | |
1207 | return; /* 'Twas not our ECHO */ | |
1208 | ++nreceived; | |
1209 | triptime = 0.0; | |
1210 | if (timing) { | |
1211 | struct timeval tv1; | |
1212 | struct tv32 tv32; | |
1213 | #ifndef icmp_data | |
1214 | tp = &icp->icmp_ip; | |
1215 | #else | |
1216 | tp = icp->icmp_data; | |
1217 | #endif | |
1218 | tp = (const char *)tp + phdr_len; | |
1219 | ||
1220 | if (cc - ICMP_MINLEN - phdr_len >= sizeof(tv1)) { | |
1221 | /* Copy to avoid alignment problems: */ | |
1222 | memcpy(&tv32, tp, sizeof(tv32)); | |
1223 | tv1.tv_sec = ntohl(tv32.tv32_sec); | |
1224 | tv1.tv_usec = ntohl(tv32.tv32_usec); | |
1225 | tvsub(tv, &tv1); | |
1226 | triptime = ((double)tv->tv_sec) * 1000.0 + | |
1227 | ((double)tv->tv_usec) / 1000.0; | |
1228 | tsum += triptime; | |
1229 | tsumsq += triptime * triptime; | |
1230 | if (triptime < tmin) | |
1231 | tmin = triptime; | |
1232 | if (triptime > tmax) | |
1233 | tmax = triptime; | |
1234 | } else | |
1235 | timing = 0; | |
1236 | } | |
1237 | ||
1238 | seq = ntohs(icp->icmp_seq); | |
1239 | ||
1240 | if (TST(seq % mx_dup_ck)) { | |
1241 | ++nrepeats; | |
1242 | --nreceived; | |
1243 | dupflag = 1; | |
1244 | } else { | |
1245 | SET(seq % mx_dup_ck); | |
1246 | dupflag = 0; | |
1247 | } | |
1248 | ||
1249 | if (options & F_QUIET) | |
1250 | return; | |
1251 | ||
1252 | if (options & F_WAITTIME && triptime > waittime) { | |
1253 | ++nrcvtimeout; | |
1254 | return; | |
1255 | } | |
1256 | ||
1257 | if (options & F_FLOOD) | |
1258 | (void)write(STDOUT_FILENO, &BSPACE, 1); | |
1259 | else { | |
1260 | (void)printf("%d bytes from %s: icmp_seq=%u", cc, | |
1261 | inet_ntoa(*(struct in_addr *)&from->sin_addr.s_addr), | |
1262 | seq); | |
1263 | (void)printf(" ttl=%d", ip->ip_ttl); | |
1264 | if (timing) | |
1265 | (void)printf(" time=%.3f ms", triptime); | |
1266 | if (tc != -1) { | |
1267 | (void)printf(" tc=%d", tc); | |
1268 | } | |
1269 | if (dupflag && no_dup == 0) { | |
1270 | (void)printf(" (DUP!)"); | |
1271 | } | |
1272 | if (options & F_AUDIBLE) | |
1273 | (void)write(STDOUT_FILENO, &BBELL, 1); | |
1274 | if (options & F_MASK) { | |
1275 | /* Just prentend this cast isn't ugly */ | |
1276 | (void)printf(" mask=%s", | |
1277 | pr_addr(*(struct in_addr *)&(icp->icmp_mask))); | |
1278 | } | |
1279 | if (options & F_TIME) { | |
1280 | (void)printf(" tso=%s", pr_ntime(icp->icmp_otime)); | |
1281 | (void)printf(" tsr=%s", pr_ntime(icp->icmp_rtime)); | |
1282 | (void)printf(" tst=%s", pr_ntime(icp->icmp_ttime)); | |
1283 | } | |
1284 | if (recv_len != send_len) { | |
1285 | (void)printf( | |
1286 | "\nwrong total length %d instead of %d", | |
1287 | recv_len, send_len); | |
1288 | } | |
1289 | /* check the data */ | |
1290 | cp = (u_char*)&icp->icmp_data[phdr_len]; | |
1291 | dp = &outpack[ICMP_MINLEN + phdr_len]; | |
1292 | cc -= ICMP_MINLEN + phdr_len; | |
1293 | i = 0; | |
1294 | if (timing) { /* don't check variable timestamp */ | |
1295 | cp += TIMEVAL_LEN; | |
1296 | dp += TIMEVAL_LEN; | |
1297 | cc -= TIMEVAL_LEN; | |
1298 | i += TIMEVAL_LEN; | |
1299 | } | |
1300 | for (; i < datalen && cc > 0; ++i, ++cp, ++dp, --cc) { | |
1301 | if (*cp != *dp) { | |
1302 | (void)printf("\nwrong data byte #%d should be 0x%x but was 0x%x", | |
1303 | i, *dp, *cp); | |
1304 | (void)printf("\ncp:"); | |
1305 | cp = (u_char*)&icp->icmp_data[0]; | |
1306 | for (i = 0; i < datalen; ++i, ++cp) { | |
1307 | if ((i % 16) == 8) | |
1308 | (void)printf("\n\t"); | |
1309 | (void)printf("%2x ", *cp); | |
1310 | } | |
1311 | (void)printf("\ndp:"); | |
1312 | cp = &outpack[ICMP_MINLEN]; | |
1313 | for (i = 0; i < datalen; ++i, ++cp) { | |
1314 | if ((i % 16) == 8) | |
1315 | (void)printf("\n\t"); | |
1316 | (void)printf("%2x ", *cp); | |
1317 | } | |
1318 | break; | |
1319 | } | |
1320 | } | |
1321 | } | |
1322 | } else { | |
1323 | /* | |
1324 | * We've got something other than an ECHOREPLY. | |
1325 | * See if it's a reply to something that we sent. | |
1326 | * We can compare IP destination, protocol, | |
1327 | * and ICMP type and ID. | |
1328 | * | |
1329 | * Only print all the error messages if we are running | |
1330 | * as root to avoid leaking information not normally | |
1331 | * available to those not running as root. | |
1332 | */ | |
1333 | #ifndef icmp_data | |
1334 | struct ip *oip = &icp->icmp_ip; | |
1335 | #else | |
1336 | struct ip *oip = (struct ip *)icp->icmp_data; | |
1337 | #endif | |
1338 | struct icmp *oicmp = (struct icmp *)(oip + 1); | |
1339 | ||
1340 | if (((options & F_VERBOSE) && uid == 0) || | |
1341 | (!(options & F_QUIET2) && | |
1342 | (oip->ip_dst.s_addr == whereto.sin_addr.s_addr) && | |
1343 | (oip->ip_p == IPPROTO_ICMP) && | |
1344 | (oicmp->icmp_type == ICMP_ECHO) && | |
1345 | (oicmp->icmp_id == ident))) { | |
1346 | (void)printf("%d bytes from %s: ", cc, | |
1347 | pr_addr(from->sin_addr)); | |
1348 | pr_icmph(icp); | |
1349 | } else | |
1350 | return; | |
1351 | } | |
1352 | ||
1353 | /* Display any IP options */ | |
1354 | cp = (u_char *)buf + sizeof(struct ip); | |
1355 | ||
1356 | for (; hlen > (int)sizeof(struct ip); --hlen, ++cp) | |
1357 | switch (*cp) { | |
1358 | case IPOPT_EOL: | |
1359 | hlen = 0; | |
1360 | break; | |
1361 | case IPOPT_LSRR: | |
1362 | case IPOPT_SSRR: | |
1363 | (void)printf(*cp == IPOPT_LSRR ? | |
1364 | "\nLSRR: " : "\nSSRR: "); | |
1365 | j = cp[IPOPT_OLEN] - IPOPT_MINOFF + 1; | |
1366 | hlen -= 2; | |
1367 | cp += 2; | |
1368 | if (j >= INADDR_LEN && | |
1369 | j <= hlen - (int)sizeof(struct ip)) { | |
1370 | for (;;) { | |
1371 | bcopy(++cp, &ina.s_addr, INADDR_LEN); | |
1372 | if (ina.s_addr == 0) | |
1373 | (void)printf("\t0.0.0.0"); | |
1374 | else | |
1375 | (void)printf("\t%s", | |
1376 | pr_addr(ina)); | |
1377 | hlen -= INADDR_LEN; | |
1378 | cp += INADDR_LEN - 1; | |
1379 | j -= INADDR_LEN; | |
1380 | if (j < INADDR_LEN) | |
1381 | break; | |
1382 | (void)putchar('\n'); | |
1383 | } | |
1384 | } else | |
1385 | (void)printf("\t(truncated route)\n"); | |
1386 | break; | |
1387 | case IPOPT_RR: | |
1388 | j = cp[IPOPT_OLEN]; /* get length */ | |
1389 | i = cp[IPOPT_OFFSET]; /* and pointer */ | |
1390 | hlen -= 2; | |
1391 | cp += 2; | |
1392 | if (i > j) | |
1393 | i = j; | |
1394 | i = i - IPOPT_MINOFF + 1; | |
1395 | if (i < 0 || i > (hlen - (int)sizeof(struct ip))) { | |
1396 | old_rrlen = 0; | |
1397 | continue; | |
1398 | } | |
1399 | if (i == old_rrlen | |
1400 | && !bcmp((char *)cp, old_rr, i) | |
1401 | && !(options & F_FLOOD)) { | |
1402 | (void)printf("\t(same route)"); | |
1403 | hlen -= i; | |
1404 | cp += i; | |
1405 | break; | |
1406 | } | |
1407 | old_rrlen = i; | |
1408 | bcopy((char *)cp, old_rr, i); | |
1409 | (void)printf("\nRR: "); | |
1410 | if (i >= INADDR_LEN && | |
1411 | i <= hlen - (int)sizeof(struct ip)) { | |
1412 | for (;;) { | |
1413 | bcopy(++cp, &ina.s_addr, INADDR_LEN); | |
1414 | if (ina.s_addr == 0) | |
1415 | (void)printf("\t0.0.0.0"); | |
1416 | else | |
1417 | (void)printf("\t%s", | |
1418 | pr_addr(ina)); | |
1419 | hlen -= INADDR_LEN; | |
1420 | cp += INADDR_LEN - 1; | |
1421 | i -= INADDR_LEN; | |
1422 | if (i < INADDR_LEN) | |
1423 | break; | |
1424 | (void)putchar('\n'); | |
1425 | } | |
1426 | } else | |
1427 | (void)printf("\t(truncated route)"); | |
1428 | break; | |
1429 | case IPOPT_NOP: | |
1430 | (void)printf("\nNOP"); | |
1431 | break; | |
1432 | default: | |
1433 | (void)printf("\nunknown option %x", *cp); | |
1434 | break; | |
1435 | } | |
1436 | if (!(options & F_FLOOD)) { | |
1437 | (void)putchar('\n'); | |
1438 | (void)fflush(stdout); | |
1439 | } | |
1440 | } | |
1441 | ||
1442 | /* | |
1443 | * in_cksum -- | |
1444 | * Checksum routine for Internet Protocol family headers (C Version) | |
1445 | */ | |
1446 | u_short | |
1447 | in_cksum(addr, len) | |
1448 | u_short *addr; | |
1449 | int len; | |
1450 | { | |
1451 | int nleft, sum; | |
1452 | u_short *w; | |
1453 | union { | |
1454 | u_short us; | |
1455 | u_char uc[2]; | |
1456 | } last; | |
1457 | u_short answer; | |
1458 | ||
1459 | nleft = len; | |
1460 | sum = 0; | |
1461 | w = addr; | |
1462 | ||
1463 | /* | |
1464 | * Our algorithm is simple, using a 32 bit accumulator (sum), we add | |
1465 | * sequential 16 bit words to it, and at the end, fold back all the | |
1466 | * carry bits from the top 16 bits into the lower 16 bits. | |
1467 | */ | |
1468 | while (nleft > 1) { | |
1469 | sum += *w++; | |
1470 | nleft -= 2; | |
1471 | } | |
1472 | ||
1473 | /* mop up an odd byte, if necessary */ | |
1474 | if (nleft == 1) { | |
1475 | last.uc[0] = *(u_char *)w; | |
1476 | last.uc[1] = 0; | |
1477 | sum += last.us; | |
1478 | } | |
1479 | ||
1480 | /* add back carry outs from top 16 bits to low 16 bits */ | |
1481 | sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */ | |
1482 | sum += (sum >> 16); /* add carry */ | |
1483 | answer = ~sum; /* truncate to 16 bits */ | |
1484 | return(answer); | |
1485 | } | |
1486 | ||
1487 | /* | |
1488 | * tvsub -- | |
1489 | * Subtract 2 timeval structs: out = out - in. Out is assumed to | |
1490 | * be >= in. | |
1491 | */ | |
1492 | static void | |
1493 | tvsub(out, in) | |
1494 | struct timeval *out, *in; | |
1495 | { | |
1496 | ||
1497 | if ((out->tv_usec -= in->tv_usec) < 0) { | |
1498 | --out->tv_sec; | |
1499 | out->tv_usec += 1000000; | |
1500 | } | |
1501 | out->tv_sec -= in->tv_sec; | |
1502 | } | |
1503 | ||
1504 | /* | |
1505 | * status -- | |
1506 | * Print out statistics when SIGINFO is received. | |
1507 | */ | |
1508 | ||
1509 | static void | |
1510 | status(sig) | |
1511 | int sig __unused; | |
1512 | { | |
1513 | ||
1514 | siginfo_p = 1; | |
1515 | } | |
1516 | ||
1517 | static void | |
1518 | check_status() | |
1519 | { | |
1520 | ||
1521 | if (siginfo_p) { | |
1522 | siginfo_p = 0; | |
1523 | (void)fprintf(stderr, "\r%ld/%ld packets received (%.1f%%)", | |
1524 | nreceived, ntransmitted, | |
1525 | ntransmitted ? nreceived * 100.0 / ntransmitted : 0.0); | |
1526 | if (nreceived && timing) | |
1527 | (void)fprintf(stderr, " %.3f min / %.3f avg / %.3f max", | |
1528 | tmin, tsum / (nreceived + nrepeats), tmax); | |
1529 | (void)fprintf(stderr, "\n"); | |
1530 | } | |
1531 | } | |
1532 | ||
1533 | /* | |
1534 | * finish -- | |
1535 | * Print out statistics, and give up. | |
1536 | */ | |
1537 | static void | |
1538 | finish() | |
1539 | { | |
1540 | ||
1541 | (void)signal(SIGINT, SIG_IGN); | |
1542 | (void)signal(SIGALRM, SIG_IGN); | |
1543 | (void)putchar('\n'); | |
1544 | (void)fflush(stdout); | |
1545 | (void)printf("--- %s ping statistics ---\n", hostname); | |
1546 | (void)printf("%ld packets transmitted, ", ntransmitted); | |
1547 | (void)printf("%ld packets received, ", nreceived); | |
1548 | if (nrepeats) | |
1549 | (void)printf("+%ld duplicates, ", nrepeats); | |
1550 | if (ntransmitted) { | |
1551 | if (nreceived > ntransmitted) | |
1552 | (void)printf("-- somebody's printing up packets!"); | |
1553 | else | |
1554 | (void)printf("%.1f%% packet loss", | |
1555 | ((ntransmitted - nreceived) * 100.0) / | |
1556 | ntransmitted); | |
1557 | } | |
1558 | if (nrcvtimeout) | |
1559 | (void)printf(", %ld packets out of wait time", nrcvtimeout); | |
1560 | (void)putchar('\n'); | |
1561 | if (nreceived && timing) { | |
1562 | double n = nreceived + nrepeats; | |
1563 | double avg = tsum / n; | |
1564 | double vari = tsumsq / n - avg * avg; | |
1565 | (void)printf( | |
1566 | "round-trip min/avg/max/stddev = %.3f/%.3f/%.3f/%.3f ms\n", | |
1567 | tmin, avg, tmax, sqrt(vari)); | |
1568 | } | |
1569 | ||
1570 | if (nreceived) | |
1571 | exit(0); | |
1572 | else | |
1573 | exit(2); | |
1574 | } | |
1575 | ||
1576 | #ifdef notdef | |
1577 | static char *ttab[] = { | |
1578 | "Echo Reply", /* ip + seq + udata */ | |
1579 | "Dest Unreachable", /* net, host, proto, port, frag, sr + IP */ | |
1580 | "Source Quench", /* IP */ | |
1581 | "Redirect", /* redirect type, gateway, + IP */ | |
1582 | "Echo", | |
1583 | "Time Exceeded", /* transit, frag reassem + IP */ | |
1584 | "Parameter Problem", /* pointer + IP */ | |
1585 | "Timestamp", /* id + seq + three timestamps */ | |
1586 | "Timestamp Reply", /* " */ | |
1587 | "Info Request", /* id + sq */ | |
1588 | "Info Reply" /* " */ | |
1589 | }; | |
1590 | #endif | |
1591 | ||
1592 | /* | |
1593 | * pr_icmph -- | |
1594 | * Print a descriptive string about an ICMP header. | |
1595 | */ | |
1596 | static void | |
1597 | pr_icmph(icp) | |
1598 | struct icmp *icp; | |
1599 | { | |
1600 | ||
1601 | switch(icp->icmp_type) { | |
1602 | case ICMP_ECHOREPLY: | |
1603 | (void)printf("Echo Reply\n"); | |
1604 | /* XXX ID + Seq + Data */ | |
1605 | break; | |
1606 | case ICMP_UNREACH: | |
1607 | switch(icp->icmp_code) { | |
1608 | case ICMP_UNREACH_NET: | |
1609 | (void)printf("Destination Net Unreachable\n"); | |
1610 | break; | |
1611 | case ICMP_UNREACH_HOST: | |
1612 | (void)printf("Destination Host Unreachable\n"); | |
1613 | break; | |
1614 | case ICMP_UNREACH_PROTOCOL: | |
1615 | (void)printf("Destination Protocol Unreachable\n"); | |
1616 | break; | |
1617 | case ICMP_UNREACH_PORT: | |
1618 | (void)printf("Destination Port Unreachable\n"); | |
1619 | break; | |
1620 | case ICMP_UNREACH_NEEDFRAG: | |
1621 | (void)printf("frag needed and DF set (MTU %d)\n", | |
1622 | ntohs(icp->icmp_nextmtu)); | |
1623 | break; | |
1624 | case ICMP_UNREACH_SRCFAIL: | |
1625 | (void)printf("Source Route Failed\n"); | |
1626 | break; | |
1627 | case ICMP_UNREACH_FILTER_PROHIB: | |
1628 | (void)printf("Communication prohibited by filter\n"); | |
1629 | break; | |
1630 | default: | |
1631 | (void)printf("Dest Unreachable, Bad Code: %d\n", | |
1632 | icp->icmp_code); | |
1633 | break; | |
1634 | } | |
1635 | /* Print returned IP header information */ | |
1636 | #ifndef icmp_data | |
1637 | pr_retip(&icp->icmp_ip); | |
1638 | #else | |
1639 | pr_retip((struct ip *)icp->icmp_data); | |
1640 | #endif | |
1641 | break; | |
1642 | case ICMP_SOURCEQUENCH: | |
1643 | (void)printf("Source Quench\n"); | |
1644 | #ifndef icmp_data | |
1645 | pr_retip(&icp->icmp_ip); | |
1646 | #else | |
1647 | pr_retip((struct ip *)icp->icmp_data); | |
1648 | #endif | |
1649 | break; | |
1650 | case ICMP_REDIRECT: | |
1651 | switch(icp->icmp_code) { | |
1652 | case ICMP_REDIRECT_NET: | |
1653 | (void)printf("Redirect Network"); | |
1654 | break; | |
1655 | case ICMP_REDIRECT_HOST: | |
1656 | (void)printf("Redirect Host"); | |
1657 | break; | |
1658 | case ICMP_REDIRECT_TOSNET: | |
1659 | (void)printf("Redirect Type of Service and Network"); | |
1660 | break; | |
1661 | case ICMP_REDIRECT_TOSHOST: | |
1662 | (void)printf("Redirect Type of Service and Host"); | |
1663 | break; | |
1664 | default: | |
1665 | (void)printf("Redirect, Bad Code: %d", icp->icmp_code); | |
1666 | break; | |
1667 | } | |
1668 | (void)printf("(New addr: %s)\n", inet_ntoa(icp->icmp_gwaddr)); | |
1669 | #ifndef icmp_data | |
1670 | pr_retip(&icp->icmp_ip); | |
1671 | #else | |
1672 | pr_retip((struct ip *)icp->icmp_data); | |
1673 | #endif | |
1674 | break; | |
1675 | case ICMP_ECHO: | |
1676 | (void)printf("Echo Request\n"); | |
1677 | /* XXX ID + Seq + Data */ | |
1678 | break; | |
1679 | case ICMP_TIMXCEED: | |
1680 | switch(icp->icmp_code) { | |
1681 | case ICMP_TIMXCEED_INTRANS: | |
1682 | (void)printf("Time to live exceeded\n"); | |
1683 | break; | |
1684 | case ICMP_TIMXCEED_REASS: | |
1685 | (void)printf("Frag reassembly time exceeded\n"); | |
1686 | break; | |
1687 | default: | |
1688 | (void)printf("Time exceeded, Bad Code: %d\n", | |
1689 | icp->icmp_code); | |
1690 | break; | |
1691 | } | |
1692 | #ifndef icmp_data | |
1693 | pr_retip(&icp->icmp_ip); | |
1694 | #else | |
1695 | pr_retip((struct ip *)icp->icmp_data); | |
1696 | #endif | |
1697 | break; | |
1698 | case ICMP_PARAMPROB: | |
1699 | (void)printf("Parameter problem: pointer = 0x%02x\n", | |
1700 | icp->icmp_hun.ih_pptr); | |
1701 | #ifndef icmp_data | |
1702 | pr_retip(&icp->icmp_ip); | |
1703 | #else | |
1704 | pr_retip((struct ip *)icp->icmp_data); | |
1705 | #endif | |
1706 | break; | |
1707 | case ICMP_TSTAMP: | |
1708 | (void)printf("Timestamp\n"); | |
1709 | /* XXX ID + Seq + 3 timestamps */ | |
1710 | break; | |
1711 | case ICMP_TSTAMPREPLY: | |
1712 | (void)printf("Timestamp Reply\n"); | |
1713 | /* XXX ID + Seq + 3 timestamps */ | |
1714 | break; | |
1715 | case ICMP_IREQ: | |
1716 | (void)printf("Information Request\n"); | |
1717 | /* XXX ID + Seq */ | |
1718 | break; | |
1719 | case ICMP_IREQREPLY: | |
1720 | (void)printf("Information Reply\n"); | |
1721 | /* XXX ID + Seq */ | |
1722 | break; | |
1723 | case ICMP_MASKREQ: | |
1724 | (void)printf("Address Mask Request\n"); | |
1725 | break; | |
1726 | case ICMP_MASKREPLY: | |
1727 | (void)printf("Address Mask Reply\n"); | |
1728 | break; | |
1729 | case ICMP_ROUTERADVERT: | |
1730 | (void)printf("Router Advertisement\n"); | |
1731 | break; | |
1732 | case ICMP_ROUTERSOLICIT: | |
1733 | (void)printf("Router Solicitation\n"); | |
1734 | break; | |
1735 | default: | |
1736 | (void)printf("Bad ICMP type: %d\n", icp->icmp_type); | |
1737 | } | |
1738 | } | |
1739 | ||
1740 | /* | |
1741 | * pr_iph -- | |
1742 | * Print an IP header with options. | |
1743 | */ | |
1744 | static void | |
1745 | pr_iph(ip) | |
1746 | struct ip *ip; | |
1747 | { | |
1748 | u_char *cp; | |
1749 | int hlen; | |
1750 | ||
1751 | hlen = ip->ip_hl << 2; | |
1752 | cp = (u_char *)ip + 20; /* point to options */ | |
1753 | ||
1754 | (void)printf("Vr HL TOS Len ID Flg off TTL Pro cks Src Dst\n"); | |
1755 | (void)printf(" %1x %1x %02x %04x %04x", | |
1756 | ip->ip_v, ip->ip_hl, ip->ip_tos, ntohs(ip->ip_len), | |
1757 | ntohs(ip->ip_id)); | |
1758 | (void)printf(" %1lx %04lx", | |
1759 | (u_long) (ntohl(ip->ip_off) & 0xe000) >> 13, | |
1760 | (u_long) ntohl(ip->ip_off) & 0x1fff); | |
1761 | (void)printf(" %02x %02x %04x", ip->ip_ttl, ip->ip_p, | |
1762 | ntohs(ip->ip_sum)); | |
1763 | (void)printf(" %s ", inet_ntoa(*(struct in_addr *)&ip->ip_src.s_addr)); | |
1764 | (void)printf(" %s ", inet_ntoa(*(struct in_addr *)&ip->ip_dst.s_addr)); | |
1765 | /* dump any option bytes */ | |
1766 | while (hlen-- > 20) { | |
1767 | (void)printf("%02x", *cp++); | |
1768 | } | |
1769 | (void)putchar('\n'); | |
1770 | } | |
1771 | ||
1772 | /* | |
1773 | * pr_addr -- | |
1774 | * Return an ascii host address as a dotted quad and optionally with | |
1775 | * a hostname. | |
1776 | */ | |
1777 | static char * | |
1778 | pr_addr(ina) | |
1779 | struct in_addr ina; | |
1780 | { | |
1781 | struct hostent *hp; | |
1782 | static char buf[16 + 3 + MAXHOSTNAMELEN]; | |
1783 | ||
1784 | if ((options & F_NUMERIC) || | |
1785 | !(hp = gethostbyaddr((char *)&ina, 4, AF_INET))) | |
1786 | return inet_ntoa(ina); | |
1787 | else | |
1788 | (void)snprintf(buf, sizeof(buf), "%s (%s)", hp->h_name, | |
1789 | inet_ntoa(ina)); | |
1790 | return(buf); | |
1791 | } | |
1792 | ||
1793 | /* | |
1794 | * pr_retip -- | |
1795 | * Dump some info on a returned (via ICMP) IP packet. | |
1796 | */ | |
1797 | static void | |
1798 | pr_retip(ip) | |
1799 | struct ip *ip; | |
1800 | { | |
1801 | u_char *cp; | |
1802 | int hlen; | |
1803 | ||
1804 | pr_iph(ip); | |
1805 | hlen = ip->ip_hl << 2; | |
1806 | cp = (u_char *)ip + hlen; | |
1807 | ||
1808 | if (ip->ip_p == 6) | |
1809 | (void)printf("TCP: from port %u, to port %u (decimal)\n", | |
1810 | (*cp * 256 + *(cp + 1)), (*(cp + 2) * 256 + *(cp + 3))); | |
1811 | else if (ip->ip_p == 17) | |
1812 | (void)printf("UDP: from port %u, to port %u (decimal)\n", | |
1813 | (*cp * 256 + *(cp + 1)), (*(cp + 2) * 256 + *(cp + 3))); | |
1814 | } | |
1815 | ||
1816 | static char * | |
1817 | pr_ntime (n_time timestamp) | |
1818 | { | |
1819 | static char buf[10]; | |
1820 | int hour, min, sec; | |
1821 | ||
1822 | sec = ntohl(timestamp) / 1000; | |
1823 | hour = sec / 60 / 60; | |
1824 | min = (sec % (60 * 60)) / 60; | |
1825 | sec = (sec % (60 * 60)) % 60; | |
1826 | ||
1827 | (void)snprintf(buf, sizeof(buf), "%02d:%02d:%02d", hour, min, sec); | |
1828 | ||
1829 | return (buf); | |
1830 | } | |
1831 | ||
1832 | static void | |
1833 | fill(bp, patp) | |
1834 | char *bp, *patp; | |
1835 | { | |
1836 | char *cp; | |
1837 | int pat[16]; | |
1838 | u_int ii, jj, kk; | |
1839 | ||
1840 | for (cp = patp; *cp; cp++) { | |
1841 | if (!isxdigit(*cp)) | |
1842 | errx(EX_USAGE, | |
1843 | "patterns must be specified as hex digits"); | |
1844 | ||
1845 | } | |
1846 | ii = sscanf(patp, | |
1847 | "%2x%2x%2x%2x%2x%2x%2x%2x%2x%2x%2x%2x%2x%2x%2x%2x", | |
1848 | &pat[0], &pat[1], &pat[2], &pat[3], &pat[4], &pat[5], &pat[6], | |
1849 | &pat[7], &pat[8], &pat[9], &pat[10], &pat[11], &pat[12], | |
1850 | &pat[13], &pat[14], &pat[15]); | |
1851 | ||
1852 | if (ii > 0) | |
1853 | for (kk = 0; kk <= maxpayload - (TIMEVAL_LEN + ii); kk += ii) | |
1854 | for (jj = 0; jj < ii; ++jj) | |
1855 | bp[jj + kk] = pat[jj]; | |
1856 | if (!(options & F_QUIET)) { | |
1857 | (void)printf("PATTERN: 0x"); | |
1858 | for (jj = 0; jj < ii; ++jj) | |
1859 | (void)printf("%02x", bp[jj] & 0xFF); | |
1860 | (void)printf("\n"); | |
1861 | } | |
1862 | } | |
1863 | ||
1864 | #if defined(IPSEC) && defined(IPSEC_POLICY_IPSEC) | |
1865 | #define SECOPT " [-P policy]" | |
1866 | #else | |
1867 | #define SECOPT "" | |
1868 | #endif | |
1869 | static void | |
1870 | usage() | |
1871 | { | |
1872 | ||
1873 | (void)fprintf(stderr, "%s\n%s\n%s\n%s\n%s\n%s\n%s\n%s\n", | |
1874 | "usage: ping [-AaDdfnoQqRrv] [-b boundif] [-c count] [-G sweepmaxsize] [-g sweepminsize]", | |
1875 | " [-h sweepincrsize] [-i wait] [-l preload] [-M mask | time] [-m ttl]", | |
1876 | " " SECOPT " [-p pattern] [-S src_addr] [-s packetsize] [-t timeout]", | |
1877 | " [-W waittime] [-z tos] host", | |
1878 | " ping [-AaDdfLnoQqRrv] [-c count] [-I iface] [-i wait] [-l preload]", | |
1879 | " [-M mask | time] [-m ttl]" SECOPT " [-p pattern] [-S src_addr]", | |
1880 | " [-s packetsize] [-T ttl] [-t timeout] [-W waittime]", | |
1881 | " [-z tos] mcast-group"); | |
1882 | exit(EX_USAGE); | |
1883 | } |