2 * Copyright (c) 1995, 1996
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that: (1) source code distributions
7 * retain the above copyright notice and this paragraph in its entirety, (2)
8 * distributions including binary code include the above copyright notice and
9 * this paragraph in its entirety in the documentation or other materials
10 * provided with the distribution, and (3) all advertising materials mentioning
11 * features or use of this software display the following acknowledgement:
12 * ``This product includes software developed by the University of California,
13 * Lawrence Berkeley Laboratory and its contributors.'' Neither the name of
14 * the University nor the names of its contributors may be used to endorse
15 * or promote products derived from this software without specific prior
17 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
19 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
23 static const char rcsid
[] _U_
=
24 "@(#) $Header: /tcpdump/master/tcpdump/print-dvmrp.c,v 1.27 2003-11-19 09:42:04 guy Exp $ (LBL)";
31 #include <tcpdump-stdinc.h>
37 #include "interface.h"
39 #include "addrtoname.h"
42 * DVMRP message types and flag values shamelessly stolen from
45 #define DVMRP_PROBE 1 /* for finding neighbors */
46 #define DVMRP_REPORT 2 /* for reporting some or all routes */
47 #define DVMRP_ASK_NEIGHBORS 3 /* sent by mapper, asking for a list */
48 /* of this router's neighbors */
49 #define DVMRP_NEIGHBORS 4 /* response to such a request */
50 #define DVMRP_ASK_NEIGHBORS2 5 /* as above, want new format reply */
51 #define DVMRP_NEIGHBORS2 6
52 #define DVMRP_PRUNE 7 /* prune message */
53 #define DVMRP_GRAFT 8 /* graft message */
54 #define DVMRP_GRAFT_ACK 9 /* graft acknowledgement */
57 * 'flags' byte values in DVMRP_NEIGHBORS2 reply.
59 #define DVMRP_NF_TUNNEL 0x01 /* neighbors reached via tunnel */
60 #define DVMRP_NF_SRCRT 0x02 /* tunnel uses IP source routing */
61 #define DVMRP_NF_DOWN 0x10 /* kernel state of interface */
62 #define DVMRP_NF_DISABLED 0x20 /* administratively disabled */
63 #define DVMRP_NF_QUERIER 0x40 /* I am the subnet's querier */
65 static int print_probe(const u_char
*, const u_char
*, u_int
);
66 static int print_report(const u_char
*, const u_char
*, u_int
);
67 static int print_neighbors(const u_char
*, const u_char
*, u_int
);
68 static int print_neighbors2(const u_char
*, const u_char
*, u_int
);
69 static int print_prune(const u_char
*);
70 static int print_graft(const u_char
*);
71 static int print_graft_ack(const u_char
*);
73 static u_int32_t target_level
;
76 dvmrp_print(register const u_char
*bp
, register u_int len
)
78 register const u_char
*ep
;
81 ep
= (const u_char
*)snapend
;
88 /* Skip IGMP header */
97 if (print_probe(bp
, ep
, len
) < 0)
105 if (print_report(bp
, ep
, len
) < 0)
110 case DVMRP_ASK_NEIGHBORS
:
111 printf(" Ask-neighbors(old)");
114 case DVMRP_NEIGHBORS
:
115 printf(" Neighbors(old)");
116 if (print_neighbors(bp
, ep
, len
) < 0)
120 case DVMRP_ASK_NEIGHBORS2
:
121 printf(" Ask-neighbors2");
124 case DVMRP_NEIGHBORS2
:
125 printf(" Neighbors2");
127 * extract version and capabilities from IGMP group
132 target_level
= (bp
[0] << 24) | (bp
[1] << 16) |
133 (bp
[2] << 8) | bp
[3];
135 if (print_neighbors2(bp
, ep
, len
) < 0)
141 if (print_prune(bp
) < 0)
147 if (print_graft(bp
) < 0)
151 case DVMRP_GRAFT_ACK
:
152 printf(" Graft-ACK");
153 if (print_graft_ack(bp
) < 0)
158 printf(" [type %d]", type
);
169 print_report(register const u_char
*bp
, register const u_char
*ep
,
172 register u_int32_t mask
, origin
;
173 register int metric
, done
;
174 register u_int i
, width
;
182 mask
= (u_int32_t
)0xff << 24 | bp
[0] << 16 | bp
[1] << 8 | bp
[2];
191 printf("\n\tMask %s", intoa(htonl(mask
)));
195 if (bp
+ width
+ 1 > ep
) {
199 if (len
< width
+ 1) {
200 printf("\n\t [Truncated Report]");
204 for (i
= 0; i
< width
; ++i
) {
206 origin
= origin
<< 8 | *bp
++;
213 done
= metric
& 0x80;
215 printf("\n\t %s metric %d", intoa(htonl(origin
)),
226 print_probe(register const u_char
*bp
, register const u_char
*ep
,
229 register u_int32_t genid
;
232 if ((len
< 4) || ((bp
+ 4) > ep
)) {
237 genid
= (bp
[0] << 24) | (bp
[1] << 16) | (bp
[2] << 8) | bp
[3];
244 printf("genid %u", genid
);
248 while ((len
> 0) && (bp
< ep
)) {
250 printf("\n\tneighbor %s", ipaddr_string(bp
));
259 print_neighbors(register const u_char
*bp
, register const u_char
*ep
,
263 register u_char metric
;
264 register u_char thresh
;
267 while (len
> 0 && bp
< ep
) {
275 while (--ncount
>= 0) {
277 printf(" [%s ->", ipaddr_string(laddr
));
278 printf(" %s, (%d/%d)]",
279 ipaddr_string(bp
), metric
, thresh
);
290 print_neighbors2(register const u_char
*bp
, register const u_char
*ep
,
294 register u_char metric
, thresh
, flags
;
297 printf(" (v %d.%d):",
298 (int)target_level
& 0xff,
299 (int)(target_level
>> 8) & 0xff);
301 while (len
> 0 && bp
< ep
) {
310 while (--ncount
>= 0 && (len
>= 4) && (bp
+ 4) <= ep
) {
311 printf(" [%s -> ", ipaddr_string(laddr
));
312 printf("%s (%d/%d", ipaddr_string(bp
),
314 if (flags
& DVMRP_NF_TUNNEL
)
316 if (flags
& DVMRP_NF_SRCRT
)
318 if (flags
& DVMRP_NF_QUERIER
)
320 if (flags
& DVMRP_NF_DISABLED
)
322 if (flags
& DVMRP_NF_DOWN
)
339 print_prune(register const u_char
*bp
)
342 printf(" src %s grp %s", ipaddr_string(bp
), ipaddr_string(bp
+ 4));
344 (void)printf(" timer ");
345 relts_print(EXTRACT_32BITS(bp
));
352 print_graft(register const u_char
*bp
)
355 printf(" src %s grp %s", ipaddr_string(bp
), ipaddr_string(bp
+ 4));
362 print_graft_ack(register const u_char
*bp
)
365 printf(" src %s grp %s", ipaddr_string(bp
), ipaddr_string(bp
+ 4));