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[] =
24 "@(#) $Header: /tcpdump/master/tcpdump/print-dvmrp.c,v 1.20 2000/09/29 04:58:36 guy Exp $ (LBL)";
31 #include <sys/param.h>
33 #include <sys/socket.h>
35 #include <netinet/in.h>
42 #include "interface.h"
44 #include "addrtoname.h"
47 * DVMRP message types and flag values shamelessly stolen from
50 #define DVMRP_PROBE 1 /* for finding neighbors */
51 #define DVMRP_REPORT 2 /* for reporting some or all routes */
52 #define DVMRP_ASK_NEIGHBORS 3 /* sent by mapper, asking for a list */
54 * of this router's neighbors
56 #define DVMRP_NEIGHBORS 4 /* response to such a request */
57 #define DVMRP_ASK_NEIGHBORS2 5 /* as above, want new format reply */
58 #define DVMRP_NEIGHBORS2 6
59 #define DVMRP_PRUNE 7 /* prune message */
60 #define DVMRP_GRAFT 8 /* graft message */
61 #define DVMRP_GRAFT_ACK 9 /* graft acknowledgement */
64 * 'flags' byte values in DVMRP_NEIGHBORS2 reply.
66 #define DVMRP_NF_TUNNEL 0x01 /* neighbors reached via tunnel */
67 #define DVMRP_NF_SRCRT 0x02 /* tunnel uses IP source routing */
68 #define DVMRP_NF_DOWN 0x10 /* kernel state of interface */
69 #define DVMRP_NF_DISABLED 0x20 /* administratively disabled */
70 #define DVMRP_NF_QUERIER 0x40 /* I am the subnet's querier */
72 static void print_probe(const u_char *, const u_char *, u_int);
73 static void print_report(const u_char *, const u_char *, u_int);
74 static void print_neighbors(const u_char *, const u_char *, u_int);
75 static void print_neighbors2(const u_char *, const u_char *, u_int);
76 static void print_prune(const u_char *, const u_char *, u_int);
77 static void print_graft(const u_char *, const u_char *, u_int);
78 static void print_graft_ack(const u_char *, const u_char *, u_int);
80 static u_int32_t target_level;
83 dvmrp_print(register const u_char *bp, register u_int len)
85 register const u_char *ep;
88 ep = (const u_char *)snapend;
105 print_probe(bp, ep, len);
111 print_report(bp, ep, len);
114 case DVMRP_ASK_NEIGHBORS:
115 printf(" Ask-neighbors(old)");
118 case DVMRP_NEIGHBORS:
119 printf(" Neighbors(old)");
120 print_neighbors(bp, ep, len);
123 case DVMRP_ASK_NEIGHBORS2:
124 printf(" Ask-neighbors2");
127 case DVMRP_NEIGHBORS2:
128 printf(" Neighbors2");
130 * extract version and capabilities from IGMP group
134 target_level = (bp[0] << 24) | (bp[1] << 16) |
135 (bp[2] << 8) | bp[3];
137 print_neighbors2(bp, ep, len);
142 print_prune(bp, ep, len);
147 print_graft(bp, ep, len);
150 case DVMRP_GRAFT_ACK:
151 printf(" Graft-ACK");
152 print_graft_ack(bp, ep, len);
156 printf(" [type %d]", type);
162 print_report(register const u_char *bp, register const u_char *ep,
165 register u_int32_t mask, origin;
166 register int metric, i, width, done;
173 mask = (u_int32_t)0xff << 24 | bp[0] << 16 | bp[1] << 8 | bp[2];
182 printf("\n\tMask %s", intoa(htonl(mask)));
186 if (bp + width + 1 > ep) {
190 if (len < width + 1) {
191 printf("\n\t [Truncated Report]");
195 for (i = 0; i < width; ++i)
196 origin = origin << 8 | *bp++;
201 done = metric & 0x80;
203 printf("\n\t %s metric %d", intoa(htonl(origin)),
211 print_probe(register const u_char *bp, register const u_char *ep,
214 register u_int32_t genid;
217 if ((len < 4) || ((bp + 4) > ep)) {
222 genid = (bp[0] << 24) | (bp[1] << 16) | (bp[2] << 8) | bp[3];
225 printf("\n\tgenid %u", genid);
227 while ((len > 0) && (bp < ep)) {
229 printf("\n\tneighbor %s", ipaddr_string(bp));
234 (void)printf("[|dvmrp]");
238 print_neighbors(register const u_char *bp, register const u_char *ep,
242 register u_char metric;
243 register u_char thresh;
246 while (len > 0 && bp < ep) {
254 while (--ncount >= 0) {
256 printf(" [%s ->", ipaddr_string(laddr));
257 printf(" %s, (%d/%d)]",
258 ipaddr_string(bp), metric, thresh);
265 (void)printf("[|dvmrp]");
269 print_neighbors2(register const u_char *bp, register const u_char *ep,
273 register u_char metric, thresh, flags;
276 printf(" (v %d.%d):",
277 (int)target_level & 0xff,
278 (int)(target_level >> 8) & 0xff);
280 while (len > 0 && bp < ep) {
289 while (--ncount >= 0 && (len >= 4) && (bp + 4) <= ep) {
290 printf(" [%s -> ", ipaddr_string(laddr));
291 printf("%s (%d/%d", ipaddr_string(bp),
293 if (flags & DVMRP_NF_TUNNEL)
295 if (flags & DVMRP_NF_SRCRT)
297 if (flags & DVMRP_NF_QUERIER)
299 if (flags & DVMRP_NF_DISABLED)
301 if (flags & DVMRP_NF_DOWN)
314 (void)printf("[|dvmrp]");
318 print_prune(register const u_char *bp, register const u_char *ep,
322 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
324 (void)printf(" timer ");
325 relts_print(EXTRACT_32BITS(bp));
328 (void)printf("[|dvmrp]");
332 print_graft(register const u_char *bp, register const u_char *ep,
336 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
339 (void)printf("[|dvmrp]");
343 print_graft_ack(register const u_char *bp, register const u_char *ep,
347 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
350 (void)printf("[|dvmrp]");