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 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499
|
/*
* Copyright (c) 1998-2001
* University of Southern California/Information Sciences Institute.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project 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 BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* $Id: igmp.c,v 1.18 2002/09/26 00:59:29 pavlin Exp $
*/
/*
* Part of this program has been derived from mrouted.
* The mrouted program is covered by the license in the accompanying file
* named "LICENSE.mrouted".
*
* The mrouted program is COPYRIGHT 1989 by The Board of Trustees of
* Leland Stanford Junior University.
*
*/
#include "defs.h"
/*
* Exported variables.
*/
char *igmp_recv_buf; /* input packet buffer */
char *igmp_send_buf; /* output packet buffer */
int igmp_socket; /* socket for all network I/O */
uint32_t allhosts_group; /* allhosts addr in net order */
uint32_t allrouters_group; /* All-Routers addr in net order */
uint32_t allreports_group; /* All IGMP routers in net order */
#ifdef RAW_OUTPUT_IS_RAW
extern int curttl;
#endif /* RAW_OUTPUT_IS_RAW */
/*
* Local functions definitions.
*/
static void igmp_read (int i, fd_set *rfd);
static void accept_igmp (ssize_t recvlen);
/*
* Open and initialize the igmp socket, and fill in the non-changing
* IP header fields in the output packet buffer.
*/
void init_igmp(void)
{
struct ip *ip;
char *router_alert;
igmp_recv_buf = calloc(1, RECV_BUF_SIZE);
igmp_send_buf = calloc(1, SEND_BUF_SIZE);
if (!igmp_recv_buf || !igmp_send_buf)
logit(LOG_ERR, 0, "Ran out of memory in init_igmp()");
if ((igmp_socket = socket(AF_INET, SOCK_RAW, IPPROTO_IGMP)) < 0)
logit(LOG_ERR, errno, "Failed creating IGMP socket in init_igmp()");
k_hdr_include(igmp_socket, TRUE); /* include IP header when sending */
k_set_sndbuf(igmp_socket, SO_SEND_BUF_SIZE_MAX,
SO_SEND_BUF_SIZE_MIN); /* lots of output buffering */
k_set_rcvbuf(igmp_socket, SO_RECV_BUF_SIZE_MAX,
SO_RECV_BUF_SIZE_MIN); /* lots of input buffering */
k_set_ttl(igmp_socket, MINTTL); /* restrict multicasts to one hop */
k_set_loop(igmp_socket, FALSE); /* disable multicast loopback */
ip = (struct ip *)igmp_send_buf;
memset(ip, 0, IP_IGMP_HEADER_LEN);
ip->ip_v = IPVERSION;
ip->ip_hl = IP_IGMP_HEADER_LEN >> 2;
ip->ip_tos = 0xc0; /* Internet Control */
ip->ip_id = 0; /* let kernel fill in */
ip->ip_off = 0;
ip->ip_ttl = MAXTTL; /* applies to unicasts only */
ip->ip_p = IPPROTO_IGMP;
ip->ip_sum = 0; /* let kernel fill in */
/* Enable RFC2113 IP Router Alert. Per spec this is required to
* force certain routers/switches to inspect this frame. */
router_alert = igmp_send_buf + sizeof(struct ip);
router_alert[0] = IPOPT_RA;
router_alert[1] = 4;
router_alert[2] = 0;
router_alert[3] = 0;
/* Everywhere in the daemon we use network-byte-order */
allhosts_group = htonl(INADDR_ALLHOSTS_GROUP);
allrouters_group = htonl(INADDR_ALLRTRS_GROUP);
allreports_group = htonl(INADDR_ALLRPTS_GROUP);
if (register_input_handler(igmp_socket, igmp_read) < 0)
logit(LOG_ERR, 0, "Failed registering igmp_read() as an input handler in init_igmp()");
}
/* Read an IGMP message */
static void igmp_read(int i __attribute__((unused)), fd_set *rfd __attribute__((unused)))
{
ssize_t len;
socklen_t dummy = 0;
while ((len = recvfrom(igmp_socket, igmp_recv_buf, RECV_BUF_SIZE, 0, NULL, &dummy)) < 0) {
if (errno == EINTR)
continue; /* Received signal, retry syscall. */
logit(LOG_ERR, errno, "Failed recvfrom() in igmp_read()");
return;
}
accept_igmp(len);
}
/*
* Process a newly received IGMP packet that is sitting in the input
* packet buffer.
*/
static void accept_igmp(ssize_t recvlen)
{
int ipdatalen, iphdrlen, igmpdatalen;
uint32_t src, dst, group;
struct ip *ip;
struct igmp *igmp;
int igmp_version = 3;
if (recvlen < (ssize_t)sizeof(struct ip)) {
logit(LOG_WARNING, 0, "Received IGMP packet too short (%u bytes) for IP header", recvlen);
return;
}
ip = (struct ip *)igmp_recv_buf;
src = ip->ip_src.s_addr;
dst = ip->ip_dst.s_addr;
/* packets sent up from kernel to daemon have ip->ip_p = 0 */
if (ip->ip_p == 0) {
#if 0 /* XXX */
if (src == 0 || dst == 0)
logit(LOG_WARNING, 0, "Kernel request not accurate, src %s dst %s",
inet_fmt(src, s1, sizeof(s1)), inet_fmt(dst, s2, sizeof(s2)));
else
#endif
process_kernel_call();
return;
}
iphdrlen = ip->ip_hl << 2;
#if 0
#ifdef HAVE_IP_HDRINCL_BSD_ORDER
#ifdef __NetBSD__
ipdatalen = ip->ip_len; /* The NetBSD kernel subtracts hlen for us, unfortunately. */
#else
ipdatalen = ip->ip_len - iphdrlen;
#endif
#else
ipdatalen = ntohs(ip->ip_len) - iphdrlen;
#endif
#else /* !0 */
ipdatalen = recvlen - iphdrlen;
#endif /* O */
if (iphdrlen + ipdatalen != recvlen) {
logit(LOG_WARNING, 0, "Received packet from %s shorter (%u bytes) than hdr+data length (%u+%u)",
inet_fmt(src, s1, sizeof(s1)), recvlen, iphdrlen, ipdatalen);
return;
}
igmp = (struct igmp *)(igmp_recv_buf + iphdrlen);
group = igmp->igmp_group.s_addr;
igmpdatalen = ipdatalen - IGMP_MINLEN;
if (igmpdatalen < 0) {
logit(LOG_WARNING, 0, "Received IP data field too short (%u bytes) for IGMP, from %s",
ipdatalen, inet_fmt(src, s1, sizeof(s1)));
return;
}
IF_DEBUG(DEBUG_IGMP)
logit(LOG_DEBUG, 0, "Received %s from %s to %s",
packet_kind(IPPROTO_IGMP, igmp->igmp_type, igmp->igmp_code),
inet_fmt(src, s1, sizeof(s1)), inet_fmt(dst, s2, sizeof(s2)));
switch (igmp->igmp_type) {
case IGMP_MEMBERSHIP_QUERY:
/* RFC 3376:7.1 */
if (ipdatalen == 8) {
if (igmp->igmp_code == 0)
igmp_version = 1;
else
igmp_version = 2;
} else if (ipdatalen >= 12) {
igmp_version = 3;
} else {
logit(LOG_DEBUG, 0, "Received invalid IGMP Membership query: Max Resp Code = %d, length = %d",
igmp->igmp_code, ipdatalen);
}
accept_membership_query(src, dst, group, igmp->igmp_code, igmp_version);
return;
case IGMP_V1_MEMBERSHIP_REPORT:
case IGMP_V2_MEMBERSHIP_REPORT:
accept_group_report(src, dst, group, igmp->igmp_type);
return;
case IGMP_V2_LEAVE_GROUP:
accept_leave_message(src, dst, group);
return;
case IGMP_V3_MEMBERSHIP_REPORT:
if (igmpdatalen < IGMP_V3_GROUP_RECORD_MIN_SIZE) {
logit(LOG_DEBUG, 0, "Too short IGMP v3 Membership report: igmpdatalen(%d) < MIN(%d)", igmpdatalen, IGMP_V3_GROUP_RECORD_MIN_SIZE);
return;
}
accept_membership_report(src, dst, (struct igmpv3_report *)(igmp_recv_buf + iphdrlen), recvlen - iphdrlen);
return;
case IGMP_DVMRP:
/* XXX: TODO: most of the stuff below is not implemented. We are still
* only PIM router.
*/
group = ntohl(group);
switch (igmp->igmp_code) {
case DVMRP_PROBE:
dvmrp_accept_probe(src, dst, (uint8_t *)(igmp+1), igmpdatalen, group);
return;
case DVMRP_REPORT:
dvmrp_accept_report(src, dst, (uint8_t *)(igmp+1), igmpdatalen, group);
return;
case DVMRP_ASK_NEIGHBORS:
accept_neighbor_request(src, dst);
return;
case DVMRP_ASK_NEIGHBORS2:
accept_neighbor_request2(src, dst);
return;
case DVMRP_NEIGHBORS:
dvmrp_accept_neighbors(src, dst, (uint8_t *)(igmp+1), igmpdatalen, group);
return;
case DVMRP_NEIGHBORS2:
dvmrp_accept_neighbors2(src, dst, (uint8_t *)(igmp+1), igmpdatalen, group);
return;
case DVMRP_PRUNE:
dvmrp_accept_prune(src, dst, (uint8_t *)(igmp+1), igmpdatalen);
return;
case DVMRP_GRAFT:
dvmrp_accept_graft(src, dst, (uint8_t *)(igmp+1), igmpdatalen);
return;
case DVMRP_GRAFT_ACK:
dvmrp_accept_g_ack(src, dst, (uint8_t *)(igmp+1), igmpdatalen);
return;
case DVMRP_INFO_REQUEST:
dvmrp_accept_info_request(src, dst, (uint8_t *)(igmp+1), igmpdatalen);
return;
case DVMRP_INFO_REPLY:
dvmrp_accept_info_reply(src, dst, (uint8_t *)(igmp+1), igmpdatalen);
return;
default:
logit(LOG_INFO, 0, "Ignoring unknown DVMRP message code %u from %s to %s",
igmp->igmp_code, inet_fmt(src, s1, sizeof(s1)), inet_fmt(dst, s2, sizeof(s2)));
return;
}
case IGMP_PIM:
return; /* TODO: this is PIM v1 message. Handle it?. */
case IGMP_MTRACE_RESP:
return; /* TODO: implement it */
case IGMP_MTRACE:
accept_mtrace(src, dst, group, (char *)(igmp+1), igmp->igmp_code, igmpdatalen);
return;
default:
logit(LOG_INFO, 0, "Ignoring unknown IGMP message type %x from %s to %s",
igmp->igmp_type, inet_fmt(src, s1, sizeof(s1)), inet_fmt(dst, s2, sizeof(s2)));
return;
}
}
static void send_ip_frame(uint32_t src, uint32_t dst, int type, int code, char *buf, size_t len)
{
int setloop = 0;
struct ip *ip;
struct sockaddr_in sin;
char source[20], dest[20];
/* Prepare the IP header */
len += IP_IGMP_HEADER_LEN;
ip = (struct ip *)buf;
ip->ip_id = 0; /* let kernel fill in */
ip->ip_off = 0;
ip->ip_src.s_addr = src;
ip->ip_dst.s_addr = dst;
#ifdef HAVE_IP_HDRINCL_BSD_ORDER
ip->ip_len = len;
#else
ip->ip_len = htons(len);
#endif
if (IN_MULTICAST(ntohl(dst))) {
k_set_if(igmp_socket, src);
if (type != IGMP_DVMRP || dst == allhosts_group) {
setloop = 1;
k_set_loop(igmp_socket, TRUE);
}
#ifdef RAW_OUTPUT_IS_RAW
ip->ip_ttl = curttl;
} else {
ip->ip_ttl = MAXTTL;
#endif
}
memset(&sin, 0, sizeof(sin));
sin.sin_family = AF_INET;
sin.sin_addr.s_addr = dst;
#ifdef HAVE_SA_LEN
sin.sin_len = sizeof(sin);
#endif
IF_DEBUG(DEBUG_IGMP)
logit(LOG_DEBUG, 0, "Send %s from %s to %s",
packet_kind(IPPROTO_IGMP, type, code),
src == INADDR_ANY_N ? "INADDR_ANY" :
inet_fmt(src, s1, sizeof(s1)), inet_fmt(dst, s2, sizeof(s2)));
while (sendto(igmp_socket, buf, len, 0, (struct sockaddr *)&sin, sizeof(sin)) < 0) {
if (errno == EINTR)
continue; /* Received signal, retry syscall. */
if (errno == ENETDOWN || errno == ENODEV)
check_vif_state();
else if (errno == EPERM || errno == EHOSTUNREACH)
logit(LOG_WARNING, 0, "Not allowed to send IGMP message from %s to %s, possibly firewall"
#ifdef __linux__
", or SELinux policy violation,"
#endif
" related problem."
,
inet_fmt(src, source, sizeof(source)), inet_fmt(dst, dest, sizeof(dest)));
else
logit(log_level(IPPROTO_IGMP, type, code), errno, "Sendto to %s on %s",
inet_fmt(dst, s1, sizeof(s1)), inet_fmt(src, s2, sizeof(s2)));
if (setloop)
k_set_loop(igmp_socket, FALSE);
return;
}
if (setloop)
k_set_loop(igmp_socket, FALSE);
IF_DEBUG(DEBUG_PKT | debug_kind(IPPROTO_IGMP, type, code)) {
logit(LOG_DEBUG, 0, "SENT %5d bytes %s from %-15s to %s", len,
packet_kind(IPPROTO_IGMP, type, code),
src == INADDR_ANY_N
? "INADDR_ANY"
: inet_fmt(src, s1, sizeof(s1)),
inet_fmt(dst, s2, sizeof(s2)));
}
}
/*
* RFC-3376 states that Max Resp Code (MRC) and Querier's Query Interval Code
* (QQIC) should be presented in floating point value if their value exceeds
* 128. The following formula is used by IGMPv3 clients to calculate the
* actual value of the floating point:
*
* 0 1 2 3 4 5 6 7
* +-+-+-+-+-+-+-+-+
* |1| exp | mant |
* +-+-+-+-+-+-+-+-+
*
* QQI / MRT = (mant | 0x10) << (exp + 3)
*
* This requires us to find the largest set (fls) bit in the 15-bit number
* and set the exponent based on its index in the bits 15-8. ie.
*
* exponent 0: igmp_fls(0000 0000 1000 0010)
* exponent 5: igmp_fls(0001 0000 0000 0000)
* exponent 7: igmp_fls(0111 0101 0000 0000)
*
* and set that as the exponent. The mantissa is set to the last 4 bits
* remaining after the (3 + exponent) shifts to the right.
*
* Note!
* The numbers 31744-32767 are the maximum we can present with floating
* point that has an exponent of 3 and a mantissa of 4. After this the
* implementation just wraps around back to zero.
*/
static inline uint8_t igmp_floating_point(unsigned int mantissa)
{
unsigned int exponent;
/* Wrap around numbers larger than 2^15, since those can not be
* presented with 7-bit floating point. */
mantissa &= 0x00007FFF;
/* If top 8 bits are zero. */
if (!(mantissa & 0x00007F80))
return mantissa;
/* Shift the mantissa and mark this code floating point. */
mantissa >>= 3;
/* At this point the actual exponent (bits 7-5) are still 0, but the
* exponent might be incremented below. */
exponent = 0x00000080;
/* If bits 7-4 are not zero. */
if (mantissa & 0x00000F00) {
mantissa >>= 4;
/* The index of largest set bit is at least 4. */
exponent |= 0x00000040;
}
/* If bits 7-6 OR bits 3-2 are not zero. */
if (mantissa & 0x000000C0) {
mantissa >>= 2;
/* The index of largest set bit is atleast 6 if we shifted the
* mantissa earlier or atleast 2 if we did not shift it. */
exponent |= 0x00000020;
}
/* If bit 7 OR bit 3 OR bit 1 is not zero. */
if (mantissa & 0x00000020) {
mantissa >>= 1;
/* The index of largest set bit is atleast 7 if we shifted the
* mantissa two times earlier or atleast 3 if we shifted the
* mantissa last time or atleast 1 if we did not shift it. */
exponent |= 0x00000010;
}
return exponent | (mantissa & 0x0000000F);
}
void send_igmp(char *buf, uint32_t src, uint32_t dst, int type, int code, uint32_t group, int datalen)
{
size_t len = IGMP_MINLEN + datalen;
struct igmpv3_query *igmp;
igmp = (struct igmpv3_query *)(buf + IP_IGMP_HEADER_LEN);
igmp->type = type;
if (datalen >= 4)
igmp->code = igmp_floating_point(code);
else
igmp->code = code;
igmp->group = group;
igmp->csum = 0;
igmp->csum = inet_cksum((uint16_t *)igmp, len);
if (datalen >= 4) {
igmp->qrv = 2;
igmp->qqic = igmp_floating_point(igmp_query_interval);
}
send_ip_frame(src, dst, type, code, buf, len);
}
/**
* Local Variables:
* version-control: t
* indent-tabs-mode: t
* c-file-style: "ellemtel"
* c-basic-offset: 4
* End:
*/
|