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: print-dvmrp.c,v 1.13 96/12/10 23:16:30 leres Exp $ (LBL)";
27 #include <sys/param.h>
29 #include <sys/socket.h>
31 #include <netinet/in.h>
32 #include <netinet/in_systm.h>
33 #include <netinet/ip.h>
34 #include <netinet/ip_var.h>
35 #include <netinet/udp.h>
36 #include <netinet/udp_var.h>
37 #include <netinet/tcp.h>
38 #include <netinet/tcpip.h>
45 #include "interface.h"
46 #include "addrtoname.h"
49 * DVMRP message types and flag values shamelessly stolen from
52 #define DVMRP_PROBE 1 /* for finding neighbors */
53 #define DVMRP_REPORT 2 /* for reporting some or all routes */
54 #define DVMRP_ASK_NEIGHBORS 3 /* sent by mapper, asking for a list */
56 * of this router's neighbors
58 #define DVMRP_NEIGHBORS 4 /* response to such a request */
59 #define DVMRP_ASK_NEIGHBORS2 5 /* as above, want new format reply */
60 #define DVMRP_NEIGHBORS2 6
61 #define DVMRP_PRUNE 7 /* prune message */
62 #define DVMRP_GRAFT 8 /* graft message */
63 #define DVMRP_GRAFT_ACK 9 /* graft acknowledgement */
66 * 'flags' byte values in DVMRP_NEIGHBORS2 reply.
68 #define DVMRP_NF_TUNNEL 0x01 /* neighbors reached via tunnel */
69 #define DVMRP_NF_SRCRT 0x02 /* tunnel uses IP source routing */
70 #define DVMRP_NF_DOWN 0x10 /* kernel state of interface */
71 #define DVMRP_NF_DISABLED 0x20 /* administratively disabled */
72 #define DVMRP_NF_QUERIER 0x40 /* I am the subnet's querier */
74 static void print_probe(const u_char *, const u_char *, u_int);
75 static void print_report(const u_char *, const u_char *, u_int);
76 static void print_neighbors(const u_char *, const u_char *, u_int);
77 static void print_neighbors2(const u_char *, const u_char *, u_int);
78 static void print_prune(const u_char *, const u_char *, u_int);
79 static void print_graft(const u_char *, const u_char *, u_int);
80 static void print_graft_ack(const u_char *, const u_char *, u_int);
82 static u_int32_t target_level;
85 dvmrp_print(register const u_char *bp, register u_int len)
87 register const u_char *ep;
90 ep = (const u_char *)snapend;
107 print_probe(bp, ep, len);
113 print_report(bp, ep, len);
116 case DVMRP_ASK_NEIGHBORS:
117 printf(" Ask-neighbors(old)");
120 case DVMRP_NEIGHBORS:
121 printf(" Neighbors(old)");
122 print_neighbors(bp, ep, len);
125 case DVMRP_ASK_NEIGHBORS2:
126 printf(" Ask-neighbors2");
129 case DVMRP_NEIGHBORS2:
130 printf(" Neighbors2");
132 * extract version and capabilities from IGMP group
136 target_level = (bp[0] << 24) | (bp[1] << 16) |
137 (bp[2] << 8) | bp[3];
139 print_neighbors2(bp, ep, len);
144 print_prune(bp, ep, len);
149 print_graft(bp, ep, len);
152 case DVMRP_GRAFT_ACK:
153 printf(" Graft-ACK");
154 print_graft_ack(bp, ep, len);
158 printf(" [type %d]", type);
164 print_report(register const u_char *bp, register const u_char *ep,
167 register u_int32_t mask, origin;
168 register int metric, i, width, done;
175 mask = (u_int32_t)0xff << 24 | bp[0] << 16 | bp[1] << 8 | bp[2];
184 printf("\n\tMask %s", intoa(htonl(mask)));
188 if (bp + width + 1 > ep) {
192 if (len < width + 1) {
193 printf("\n\t [Truncated Report]");
197 for (i = 0; i < width; ++i)
198 origin = origin << 8 | *bp++;
203 done = metric & 0x80;
205 printf("\n\t %s metric %d", intoa(htonl(origin)),
212 #define GET_ADDR(to) (memcpy((char *)to, (char *)bp, 4), bp += 4)
215 print_probe(register const u_char *bp, register const u_char *ep,
218 register u_int32_t genid;
221 if ((len < 4) || ((bp + 4) > ep)) {
226 genid = (bp[0] << 24) | (bp[1] << 16) | (bp[2] << 8) | bp[3];
229 printf("\n\tgenid %u", genid);
231 while ((len > 0) && (bp < ep)) {
232 if ((len < 4) || ((bp + 4) > ep)) {
238 printf("\n\tneighbor %s", ipaddr_string(neighbor));
243 print_neighbors(register const u_char *bp, register const u_char *ep,
246 u_char laddr[4], neighbor[4];
247 register u_char metric;
248 register u_char thresh;
251 while (len > 0 && bp < ep) {
252 if (len < 7 || (bp + 7) >= ep) {
261 while (--ncount >= 0 && (len >= 4) && (bp + 4) < ep) {
263 printf(" [%s ->", ipaddr_string(laddr));
264 printf(" %s, (%d/%d)]",
265 ipaddr_string(neighbor), metric, thresh);
272 print_neighbors2(register const u_char *bp, register const u_char *ep,
275 u_char laddr[4], neighbor[4];
276 register u_char metric, thresh, flags;
279 printf(" (v %d.%d):",
280 (int)target_level & 0xff,
281 (int)(target_level >> 8) & 0xff);
283 while (len > 0 && bp < ep) {
284 if (len < 8 || (bp + 8) >= ep) {
294 while (--ncount >= 0 && (len >= 4) && (bp + 4) <= ep) {
296 printf(" [%s -> ", ipaddr_string(laddr));
297 printf("%s (%d/%d", ipaddr_string(neighbor),
299 if (flags & DVMRP_NF_TUNNEL)
301 if (flags & DVMRP_NF_SRCRT)
303 if (flags & DVMRP_NF_QUERIER)
305 if (flags & DVMRP_NF_DISABLED)
307 if (flags & DVMRP_NF_DOWN)
320 print_prune(register const u_char *bp, register const u_char *ep,
328 if (len < 12 || (bp + 12) > ep) {
332 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
334 GET_ADDR(prune_timer.b);
335 printf(" timer %d", (int)ntohl(prune_timer.i));
339 print_graft(register const u_char *bp, register const u_char *ep,
343 if (len < 8 || (bp + 8) > ep) {
347 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));
351 print_graft_ack(register const u_char *bp, register const u_char *ep,
355 if (len < 8 || (bp + 8) > ep) {
359 printf(" src %s grp %s", ipaddr_string(bp), ipaddr_string(bp + 4));