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.21 2001/05/10 05:30:20 fenner 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 */
53 /* of this router's neighbors */
54 #define DVMRP_NEIGHBORS 4 /* response to such a request */
55 #define DVMRP_ASK_NEIGHBORS2 5 /* as above, want new format reply */
56 #define DVMRP_NEIGHBORS2 6
57 #define DVMRP_PRUNE 7 /* prune message */
58 #define DVMRP_GRAFT 8 /* graft message */
59 #define DVMRP_GRAFT_ACK 9 /* graft acknowledgement */
62 * 'flags' byte values in DVMRP_NEIGHBORS2 reply.
64 #define DVMRP_NF_TUNNEL 0x01 /* neighbors reached via tunnel */
65 #define DVMRP_NF_SRCRT 0x02 /* tunnel uses IP source routing */
66 #define DVMRP_NF_DOWN 0x10 /* kernel state of interface */
67 #define DVMRP_NF_DISABLED 0x20 /* administratively disabled */
68 #define DVMRP_NF_QUERIER 0x40 /* I am the subnet's querier */
70 static void print_probe(const u_char *, const u_char *, u_int);
71 static void print_report(const u_char *, const u_char *, u_int);
72 static void print_neighbors(const u_char *, const u_char *, u_int);
73 static void print_neighbors2(const u_char *, const u_char *, u_int);
74 static void print_prune(const u_char *, const u_char *, u_int);
75 static void print_graft(const u_char *, const u_char *, u_int);
76 static void print_graft_ack(const u_char *, const u_char *, u_int);
78 static u_int32_t target_level;
81 dvmrp_print(register const u_char *bp, register u_int len)
83 register const u_char *ep;
86 ep = (const u_char *)snapend;
92 /* Skip IGMP header */
101 print_probe(bp, ep, len);
107 print_report(bp, ep, len);
110 case DVMRP_ASK_NEIGHBORS:
111 printf(" Ask-neighbors(old)");
114 case DVMRP_NEIGHBORS:
115 printf(" Neighbors(old)");
116 print_neighbors(bp, ep, len);
119 case DVMRP_ASK_NEIGHBORS2:
120 printf(" Ask-neighbors2");
123 case DVMRP_NEIGHBORS2:
124 printf(" Neighbors2");
126 * extract version and capabilities from IGMP group
130 target_level = (bp[0] << 24) | (bp[1] << 16) |
131 (bp[2] << 8) | bp[3];
133 print_neighbors2(bp, ep, len);
138 print_prune(bp, ep, len);
143 print_graft(bp, ep, len);
146 case DVMRP_GRAFT_ACK:
147 printf(" Graft-ACK");
148 print_graft_ack(bp, ep, len);
152 printf(" [type %d]", type);
158 print_report(register const u_char *bp, register const u_char *ep,
161 register u_int32_t mask, origin;
162 register int metric, i, width, done;
169 mask = (u_int32_t)0xff << 24 | bp[0] << 16 | bp[1] << 8 | bp[2];
178 printf("\n\tMask %s", intoa(htonl(mask)));
182 if (bp + width + 1 > ep) {
186 if (len < width + 1) {
187 printf("\n\t [Truncated Report]");
191 for (i = 0; i < width; ++i)
192 origin = origin << 8 | *bp++;
197 done = metric & 0x80;
199 printf("\n\t %s metric %d", intoa(htonl(origin)),
207 print_probe(register const u_char *bp, register const u_char *ep,
210 register u_int32_t genid;
213 if ((len < 4) || ((bp + 4) > ep)) {
218 genid = (bp[0] << 24) | (bp[1] << 16) | (bp[2] << 8) | bp[3];
225 printf("genid %u", genid);
229 while ((len > 0) && (bp < ep)) {
231 printf("\n\tneighbor %s", ipaddr_string(bp));
236 (void)printf("[|dvmrp]");
240 print_neighbors(register const u_char *bp, register const u_char *ep,
244 register u_char metric;
245 register u_char thresh;
248 while (len > 0 && bp < ep) {
256 while (--ncount >= 0) {
258 printf(" [%s ->", ipaddr_string(laddr));
259 printf(" %s, (%d/%d)]",
260 ipaddr_string(bp), metric, thresh);
267 (void)printf("[|dvmrp]");
271 print_neighbors2(register const u_char *bp, register const u_char *ep,
275 register u_char metric, thresh, flags;
278 printf(" (v %d.%d):",
279 (int)target_level & 0xff,
280 (int)(target_level >> 8) & 0xff);
282 while (len > 0 && bp < ep) {
291 while (--ncount >= 0 && (len >= 4) && (bp + 4) <= ep) {
292 printf(" [%s -> ", ipaddr_string(laddr));
293 printf("%s (%d/%d", ipaddr_string(bp),
295 if (flags & DVMRP_NF_TUNNEL)
297 if (flags & DVMRP_NF_SRCRT)
299 if (flags & DVMRP_NF_QUERIER)
301 if (flags & DVMRP_NF_DISABLED)
303 if (flags & DVMRP_NF_DOWN)
316 (void)printf("[|dvmrp]");
320 print_prune(register const u_char *bp, register const u_char *ep,
324 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
326 (void)printf(" timer ");
327 relts_print(EXTRACT_32BITS(bp));
330 (void)printf("[|dvmrp]");
334 print_graft(register const u_char *bp, register const u_char *ep,
338 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
341 (void)printf("[|dvmrp]");
345 print_graft_ack(register const u_char *bp, register const u_char *ep,
349 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
352 (void)printf("[|dvmrp]");