1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332
|
/*
* Copyright (c) 1995, 1996
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that: (1) source code distributions
* retain the above copyright notice and this paragraph in its entirety, (2)
* distributions including binary code include the above copyright notice and
* this paragraph in its entirety in the documentation or other materials
* provided with the distribution, and (3) all advertising materials mentioning
* features or use of this software display the following acknowledgement:
* ``This product includes software developed by the University of California,
* Lawrence Berkeley Laboratory and its contributors.'' Neither the name of
* the University nor the names of its contributors may be used to endorse
* or promote products derived from this software without specific prior
* written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
/* \summary: Distance Vector Multicast Routing Protocol printer */
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "netdissect-stdinc.h"
#include "netdissect.h"
#include "extract.h"
#include "addrtoname.h"
/*
* See: RFC 1075 and draft-ietf-idmr-dvmrp-v3
*
* DVMRP message types and flag values shamelessly stolen from
* mrouted/dvmrp.h.
*/
#define DVMRP_PROBE 1 /* for finding neighbors */
#define DVMRP_REPORT 2 /* for reporting some or all routes */
#define DVMRP_ASK_NEIGHBORS 3 /* sent by mapper, asking for a list */
/* of this router's neighbors */
#define DVMRP_NEIGHBORS 4 /* response to such a request */
#define DVMRP_ASK_NEIGHBORS2 5 /* as above, want new format reply */
#define DVMRP_NEIGHBORS2 6
#define DVMRP_PRUNE 7 /* prune message */
#define DVMRP_GRAFT 8 /* graft message */
#define DVMRP_GRAFT_ACK 9 /* graft acknowledgement */
static const struct tok dvmrp_msgtype_str[] = {
{ DVMRP_PROBE, "Probe" },
{ DVMRP_REPORT, "Report" },
{ DVMRP_ASK_NEIGHBORS, "Ask-neighbors(old)" },
{ DVMRP_NEIGHBORS, "Neighbors(old)" },
{ DVMRP_ASK_NEIGHBORS2, "Ask-neighbors2" },
{ DVMRP_NEIGHBORS2, "Neighbors2" },
{ DVMRP_PRUNE, "Prune" },
{ DVMRP_GRAFT, "Graft" },
{ DVMRP_GRAFT_ACK, "Graft-ACK" },
{ 0, NULL }
};
/*
* 'flags' byte values in DVMRP_NEIGHBORS2 reply.
*/
#define DVMRP_NF_TUNNEL 0x01 /* neighbors reached via tunnel */
#define DVMRP_NF_SRCRT 0x02 /* tunnel uses IP source routing */
#define DVMRP_NF_DOWN 0x10 /* kernel state of interface */
#define DVMRP_NF_DISABLED 0x20 /* administratively disabled */
#define DVMRP_NF_QUERIER 0x40 /* I am the subnet's querier */
static void print_probe(netdissect_options *, const u_char *, u_int);
static void print_report(netdissect_options *, const u_char *, u_int);
static void print_neighbors(netdissect_options *, const u_char *, u_int);
static void print_neighbors2(netdissect_options *, const u_char *, u_int, uint8_t, uint8_t);
void
dvmrp_print(netdissect_options *ndo,
const u_char *bp, u_int len)
{
u_char type;
uint8_t major_version, minor_version;
ndo->ndo_protocol = "dvmrp";
if (len < 8) {
ND_PRINT(" [length %u < 8]", len);
goto invalid;
}
type = GET_U_1(bp + 1);
/* Skip IGMP header */
bp += 8;
len -= 8;
ND_PRINT(" %s", tok2str(dvmrp_msgtype_str, "[type %u]", type));
switch (type) {
case DVMRP_PROBE:
if (ndo->ndo_vflag) {
print_probe(ndo, bp, len);
}
break;
case DVMRP_REPORT:
if (ndo->ndo_vflag > 1) {
print_report(ndo, bp, len);
}
break;
case DVMRP_NEIGHBORS:
print_neighbors(ndo, bp, len);
break;
case DVMRP_NEIGHBORS2:
/*
* extract version from IGMP group address field
*/
bp -= 4;
major_version = GET_U_1(bp + 3);
minor_version = GET_U_1(bp + 2);
bp += 4;
print_neighbors2(ndo, bp, len, major_version, minor_version);
break;
case DVMRP_PRUNE:
ND_PRINT(" src %s grp %s", GET_IPADDR_STRING(bp), GET_IPADDR_STRING(bp + 4));
ND_PRINT(" timer ");
unsigned_relts_print(ndo, GET_BE_U_4(bp + 8));
break;
case DVMRP_GRAFT:
ND_PRINT(" src %s grp %s", GET_IPADDR_STRING(bp), GET_IPADDR_STRING(bp + 4));
break;
case DVMRP_GRAFT_ACK:
ND_PRINT(" src %s grp %s", GET_IPADDR_STRING(bp), GET_IPADDR_STRING(bp + 4));
break;
}
return;
invalid:
nd_print_invalid(ndo);
}
static void
print_report(netdissect_options *ndo,
const u_char *bp,
u_int len)
{
uint32_t mask, origin;
u_int metric, done;
u_int i, width;
while (len > 0) {
if (len < 3) {
ND_PRINT(" [length %u < 3]", len);
goto invalid;
}
mask = (uint32_t)0xff << 24 | GET_U_1(bp) << 16 |
GET_U_1(bp + 1) << 8 | GET_U_1(bp + 2);
width = 1;
if (GET_U_1(bp))
width = 2;
if (GET_U_1(bp + 1))
width = 3;
if (GET_U_1(bp + 2))
width = 4;
ND_PRINT("\n\tMask %s", intoa(htonl(mask)));
bp += 3;
len -= 3;
do {
if (len < width + 1) {
ND_PRINT("\n\t [Truncated Report]");
goto invalid;
}
origin = 0;
for (i = 0; i < width; ++i) {
origin = origin << 8 | GET_U_1(bp);
bp++;
}
for ( ; i < 4; ++i)
origin <<= 8;
metric = GET_U_1(bp);
bp++;
done = metric & 0x80;
metric &= 0x7f;
ND_PRINT("\n\t %s metric %u", intoa(htonl(origin)),
metric);
len -= width + 1;
} while (!done);
}
return;
invalid:
nd_print_invalid(ndo);
}
static void
print_probe(netdissect_options *ndo,
const u_char *bp,
u_int len)
{
if (len < 4) {
ND_PRINT(" [full length %u < 4]", len);
goto invalid;
}
ND_PRINT(ndo->ndo_vflag > 1 ? "\n\t" : " ");
ND_PRINT("genid %u", GET_BE_U_4(bp));
if (ndo->ndo_vflag < 2)
return;
bp += 4;
len -= 4;
while (len > 0) {
if (len < 4) {
ND_PRINT("[remaining length %u < 4]", len);
goto invalid;
}
ND_PRINT("\n\tneighbor %s", GET_IPADDR_STRING(bp));
bp += 4; len -= 4;
}
return;
invalid:
nd_print_invalid(ndo);
}
static void
print_neighbors(netdissect_options *ndo,
const u_char *bp,
u_int len)
{
const u_char *laddr;
u_char metric;
u_char thresh;
int ncount;
while (len > 0) {
if (len < 7) {
ND_PRINT(" [length %u < 7]", len);
goto invalid;
}
laddr = bp;
bp += 4;
metric = GET_U_1(bp);
bp++;
thresh = GET_U_1(bp);
bp++;
ncount = GET_U_1(bp);
bp++;
len -= 7;
while (--ncount >= 0) {
if (len < 4) {
ND_PRINT(" [length %u < 4]", len);
goto invalid;
}
ND_PRINT(" [%s ->", GET_IPADDR_STRING(laddr));
ND_PRINT(" %s, (%u/%u)]",
GET_IPADDR_STRING(bp), metric, thresh);
bp += 4;
len -= 4;
}
}
return;
invalid:
nd_print_invalid(ndo);
}
static void
print_neighbors2(netdissect_options *ndo,
const u_char *bp,
u_int len, uint8_t major_version,
uint8_t minor_version)
{
const u_char *laddr;
u_char metric, thresh, flags;
int ncount;
ND_PRINT(" (v %u.%u):", major_version, minor_version);
while (len > 0) {
if (len < 8) {
ND_PRINT(" [length %u < 8]", len);
goto invalid;
}
laddr = bp;
bp += 4;
metric = GET_U_1(bp);
bp++;
thresh = GET_U_1(bp);
bp++;
flags = GET_U_1(bp);
bp++;
ncount = GET_U_1(bp);
bp++;
len -= 8;
while (--ncount >= 0 && len > 0) {
if (len < 4) {
ND_PRINT(" [length %u < 4]", len);
goto invalid;
}
ND_PRINT(" [%s -> ", GET_IPADDR_STRING(laddr));
ND_PRINT("%s (%u/%u", GET_IPADDR_STRING(bp),
metric, thresh);
if (flags & DVMRP_NF_TUNNEL)
ND_PRINT("/tunnel");
if (flags & DVMRP_NF_SRCRT)
ND_PRINT("/srcrt");
if (flags & DVMRP_NF_QUERIER)
ND_PRINT("/querier");
if (flags & DVMRP_NF_DISABLED)
ND_PRINT("/disabled");
if (flags & DVMRP_NF_DOWN)
ND_PRINT("/down");
ND_PRINT(")]");
bp += 4;
len -= 4;
}
if (ncount != -1) {
ND_PRINT(" [invalid ncount]");
goto invalid;
}
}
return;
invalid:
nd_print_invalid(ndo);
}
|