bsd/netinet/igmp.c

   1 /*
   2  * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * The contents of this file constitute Original Code as defined in and
   7  * are subject to the Apple Public Source License Version 1.1 (the
   8  * "License").  You may not use this file except in compliance with the
   9  * License.  Please obtain a copy of the License at
  10  * http://www.apple.com/publicsource and read it before using this file.
  11  *
  12  * This Original Code and all software distributed under the License are
  13  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  14  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  15  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  16  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
  17  * License for the specific language governing rights and limitations
  18  * under the License.
  19  *
  20  * @APPLE_LICENSE_HEADER_END@
  21  */
  22 /*
  23  * Copyright (c) 1988 Stephen Deering.
  24  * Copyright (c) 1992, 1993
  25  *      The Regents of the University of California.  All rights reserved.
  26  *
  27  * This code is derived from software contributed to Berkeley by
  28  * Stephen Deering of Stanford University.
  29  *
  30  * Redistribution and use in source and binary forms, with or without
  31  * modification, are permitted provided that the following conditions
  32  * are met:
  33  * 1. Redistributions of source code must retain the above copyright
  34  *    notice, this list of conditions and the following disclaimer.
  35  * 2. Redistributions in binary form must reproduce the above copyright
  36  *    notice, this list of conditions and the following disclaimer in the
  37  *    documentation and/or other materials provided with the distribution.
  38  * 3. All advertising materials mentioning features or use of this software
  39  *    must display the following acknowledgement:
  40  *      This product includes software developed by the University of
  41  *      California, Berkeley and its contributors.
  42  * 4. Neither the name of the University nor the names of its contributors
  43  *    may be used to endorse or promote products derived from this software
  44  *    without specific prior written permission.
  45  *
  46  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  47  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  48  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  49  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  50  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  51  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  52  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  53  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  54  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  55  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  56  * SUCH DAMAGE.
  57  *
  58  *      @(#)igmp.c      8.1 (Berkeley) 7/19/93
  59  */
  60
  61 /*
  62  * Internet Group Management Protocol (IGMP) routines.
  63  *
  64  * Written by Steve Deering, Stanford, May 1988.
  65  * Modified by Rosen Sharma, Stanford, Aug 1994.
  66  * Modified by Bill Fenner, Xerox PARC, Feb 1995.
  67  * Modified to fully comply to IGMPv2 by Bill Fenner, Oct 1995.
  68  *
  69  * MULTICAST Revision: 3.5.1.4
  70  */
  71
  72 #include <sys/param.h>
  73 #include <sys/systm.h>
  74 #include <sys/malloc.h>
  75 #include <sys/mbuf.h>
  76 #include <sys/socket.h>
  77 #include <sys/protosw.h>
  78 #include <sys/kernel.h>
  79 #include <sys/sysctl.h>
  80
  81 #include <net/if.h>
  82 #include <net/route.h>
  83
  84 #include <netinet/in.h>
  85 #include <netinet/in_var.h>
  86 #include <netinet/in_systm.h>
  87 #include <netinet/ip.h>
  88 #include <netinet/ip_var.h>
  89 #include <netinet/igmp.h>
  90 #include <netinet/igmp_var.h>
  91
  92 #ifndef __APPLE__
  93 static MALLOC_DEFINE(M_IGMP, "igmp", "igmp state");
  94 #endif
  95
  96 static struct router_info *
  97                 find_rti __P((struct ifnet *ifp));
  98
  99 static struct igmpstat igmpstat;
 100
 101 SYSCTL_STRUCT(_net_inet_igmp, IGMPCTL_STATS, stats, CTLFLAG_RD,
 102         &igmpstat, igmpstat, "");
 103
 104 static int igmp_timers_are_running;
 105 static u_long igmp_all_hosts_group;
 106 static u_long igmp_all_rtrs_group;
 107 static struct mbuf *router_alert;
 108 static struct router_info *Head;
 109
 110 static void igmp_sendpkt __P((struct in_multi *, int, unsigned long));
 111
 112 void
 113 igmp_init()
 114 {
 115         struct ipoption *ra;
 116
 117         /*
 118          * To avoid byte-swapping the same value over and over again.
 119          */
 120         igmp_all_hosts_group = htonl(INADDR_ALLHOSTS_GROUP);
 121         igmp_all_rtrs_group = htonl(INADDR_ALLRTRS_GROUP);
 122
 123         igmp_timers_are_running = 0;
 124
 125         /*
 126          * Construct a Router Alert option to use in outgoing packets
 127          */
 128         MGET(router_alert, M_DONTWAIT, MT_DATA);
 129         ra = mtod(router_alert, struct ipoption *);
 130         ra->ipopt_dst.s_addr = 0;
 131         ra->ipopt_list[0] = IPOPT_RA;   /* Router Alert Option */
 132         ra->ipopt_list[1] = 0x04;       /* 4 bytes long */
 133         ra->ipopt_list[2] = 0x00;
 134         ra->ipopt_list[3] = 0x00;
 135         router_alert->m_len = sizeof(ra->ipopt_dst) + ra->ipopt_list[1];
 136
 137         Head = (struct router_info *) 0;
 138 }
 139
 140 static struct router_info *
 141 find_rti(ifp)
 142         struct ifnet *ifp;
 143 {
 144         register struct router_info *rti = Head;
 145
 146
 147 #if IGMP_DEBUG
 148         printf("[igmp.c, _find_rti] --> entering \n");
 149 #endif
 150         while (rti) {
 151                 if (rti->rti_ifp == ifp) {
 152 #if IGMP_DEBUG
 153                         printf("[igmp.c, _find_rti] --> found old entry \n");
 154 #endif
 155                         return rti;
 156                 }
 157                 rti = rti->rti_next;
 158         }
 159
 160         MALLOC(rti, struct router_info *, sizeof *rti, M_IGMP, M_NOWAIT);
 161         if (rti != NULL)
 162         {
 163                 rti->rti_ifp = ifp;
 164                 rti->rti_type = IGMP_V2_ROUTER;
 165                 rti->rti_time = 0;
 166                 rti->rti_next = Head;
 167                 Head = rti;
 168         }
 169 #if IGMP_DEBUG
 170         if (rti) printf("[igmp.c, _find_rti] --> created an entry \n");
 171 #endif
 172         return rti;
 173 }
 174
 175 void
 176 igmp_input(m, iphlen)
 177         register struct mbuf *m;
 178         register int iphlen;
 179 {
 180         register struct igmp *igmp;
 181         register struct ip *ip;
 182         register int igmplen;
 183         register struct ifnet *ifp = m->m_pkthdr.rcvif;
 184         register int minlen;
 185         register struct in_multi *inm;
 186         register struct in_ifaddr *ia;
 187         struct in_multistep step;
 188         struct router_info *rti;
 189
 190         int timer; /** timer value in the igmp query header **/
 191
 192         ++igmpstat.igps_rcv_total;
 193
 194         ip = mtod(m, struct ip *);
 195         igmplen = ip->ip_len;
 196
 197         /*
 198          * Validate lengths
 199          */
 200         if (igmplen < IGMP_MINLEN) {
 201                 ++igmpstat.igps_rcv_tooshort;
 202                 m_freem(m);
 203                 return;
 204         }
 205         minlen = iphlen + IGMP_MINLEN;
 206         if ((m->m_flags & M_EXT || m->m_len < minlen) &&
 207             (m = m_pullup(m, minlen)) == 0) {
 208                 ++igmpstat.igps_rcv_tooshort;
 209                 return;
 210         }
 211
 212         /*
 213          * Validate checksum
 214          */
 215         m->m_data += iphlen;
 216         m->m_len -= iphlen;
 217         igmp = mtod(m, struct igmp *);
 218         if (in_cksum(m, igmplen)) {
 219                 ++igmpstat.igps_rcv_badsum;
 220                 m_freem(m);
 221                 return;
 222         }
 223         m->m_data -= iphlen;
 224         m->m_len += iphlen;
 225
 226         ip = mtod(m, struct ip *);
 227         timer = igmp->igmp_code * PR_FASTHZ / IGMP_TIMER_SCALE;
 228         if (timer == 0)
 229                 timer = 1;
 230         rti = find_rti(ifp);
 231         if (rti == NULL) {
 232                 m_freem(m);
 233                 return;
 234         }
 235
 236         /*
 237          * In the IGMPv2 specification, there are 3 states and a flag.
 238          *
 239          * In Non-Member state, we simply don't have a membership record.
 240          * In Delaying Member state, our timer is running (inm->inm_timer)
 241          * In Idle Member state, our timer is not running (inm->inm_timer==0)
 242          *
 243          * The flag is inm->inm_state, it is set to IGMP_OTHERMEMBER if
 244          * we have heard a report from another member, or IGMP_IREPORTEDLAST
 245          * if I sent the last report.
 246          */
 247         switch (igmp->igmp_type) {
 248
 249         case IGMP_MEMBERSHIP_QUERY:
 250                 ++igmpstat.igps_rcv_queries;
 251
 252                 if (ifp->if_flags & IFF_LOOPBACK)
 253                         break;
 254
 255                 if (igmp->igmp_code == 0) {
 256                         /*
 257                          * Old router.  Remember that the querier on this
 258                          * interface is old, and set the timer to the
 259                          * value in RFC 1112.
 260                          */
 261
 262                         rti->rti_type = IGMP_V1_ROUTER;
 263                         rti->rti_time = 0;
 264
 265                         timer = IGMP_MAX_HOST_REPORT_DELAY * PR_FASTHZ;
 266
 267                         if (ip->ip_dst.s_addr != igmp_all_hosts_group ||
 268                             igmp->igmp_group.s_addr != 0) {
 269                                 ++igmpstat.igps_rcv_badqueries;
 270                                 m_freem(m);
 271                                 return;
 272                         }
 273                 } else {
 274                         /*
 275                          * New router.  Simply do the new validity check.
 276                          */
 277
 278                         if (igmp->igmp_group.s_addr != 0 &&
 279                             !IN_MULTICAST(ntohl(igmp->igmp_group.s_addr))) {
 280                                 ++igmpstat.igps_rcv_badqueries;
 281                                 m_freem(m);
 282                                 return;
 283                         }
 284                 }
 285
 286                 /*
 287                  * - Start the timers in all of our membership records
 288                  *   that the query applies to for the interface on
 289                  *   which the query arrived excl. those that belong
 290                  *   to the "all-hosts" group (224.0.0.1).
 291                  * - Restart any timer that is already running but has
 292                  *   a value longer than the requested timeout.
 293                  * - Use the value specified in the query message as
 294                  *   the maximum timeout.
 295                  */
 296                 IN_FIRST_MULTI(step, inm);
 297                 while (inm != NULL) {
 298                         if (inm->inm_ifp == ifp &&
 299                             inm->inm_addr.s_addr != igmp_all_hosts_group &&
 300                             (igmp->igmp_group.s_addr == 0 ||
 301                              igmp->igmp_group.s_addr == inm->inm_addr.s_addr)) {
 302                                 if (inm->inm_timer == 0 ||
 303                                     inm->inm_timer > timer) {
 304                                         inm->inm_timer =
 305                                                 IGMP_RANDOM_DELAY(timer);
 306                                         igmp_timers_are_running = 1;
 307                                 }
 308                         }
 309                         IN_NEXT_MULTI(step, inm);
 310                 }
 311
 312                 break;
 313
 314         case IGMP_V1_MEMBERSHIP_REPORT:
 315         case IGMP_V2_MEMBERSHIP_REPORT:
 316                 /*
 317                  * For fast leave to work, we have to know that we are the
 318                  * last person to send a report for this group.  Reports
 319                  * can potentially get looped back if we are a multicast
 320                  * router, so discard reports sourced by me.
 321                  */
 322                 IFP_TO_IA(ifp, ia);
 323                 if (ia && ip->ip_src.s_addr == IA_SIN(ia)->sin_addr.s_addr)
 324                         break;
 325
 326                 ++igmpstat.igps_rcv_reports;
 327
 328                 if (ifp->if_flags & IFF_LOOPBACK)
 329                         break;
 330
 331                 if (!IN_MULTICAST(ntohl(igmp->igmp_group.s_addr))) {
 332                         ++igmpstat.igps_rcv_badreports;
 333                         m_freem(m);
 334                         return;
 335                 }
 336
 337                 /*
 338                  * KLUDGE: if the IP source address of the report has an
 339                  * unspecified (i.e., zero) subnet number, as is allowed for
 340                  * a booting host, replace it with the correct subnet number
 341                  * so that a process-level multicast routing demon can
 342                  * determine which subnet it arrived from.  This is necessary
 343                  * to compensate for the lack of any way for a process to
 344                  * determine the arrival interface of an incoming packet.
 345                  */
 346                 if ((ntohl(ip->ip_src.s_addr) & IN_CLASSA_NET) == 0)
 347                         if (ia) ip->ip_src.s_addr = htonl(ia->ia_subnet);
 348
 349                 /*
 350                  * If we belong to the group being reported, stop
 351                  * our timer for that group.
 352                  */
 353                 IN_LOOKUP_MULTI(igmp->igmp_group, ifp, inm);
 354
 355                 if (inm != NULL) {
 356                         inm->inm_timer = 0;
 357                         ++igmpstat.igps_rcv_ourreports;
 358
 359                         inm->inm_state = IGMP_OTHERMEMBER;
 360                 }
 361
 362                 break;
 363         }
 364
 365         /*
 366          * Pass all valid IGMP packets up to any process(es) listening
 367          * on a raw IGMP socket.
 368          */
 369         rip_input(m, iphlen);
 370 }
 371
 372 int
 373 igmp_joingroup(inm)
 374         struct in_multi *inm;
 375 {
 376         int s = splnet();
 377
 378         if (inm->inm_addr.s_addr == igmp_all_hosts_group
 379             || inm->inm_ifp->if_flags & IFF_LOOPBACK) {
 380                 inm->inm_timer = 0;
 381                 inm->inm_state = IGMP_OTHERMEMBER;
 382         } else {
 383                 inm->inm_rti = find_rti(inm->inm_ifp);
 384                 if (inm->inm_rti == NULL) return ENOMEM;
 385                 igmp_sendpkt(inm, inm->inm_rti->rti_type, 0);
 386                 inm->inm_timer = IGMP_RANDOM_DELAY(
 387                                         IGMP_MAX_HOST_REPORT_DELAY*PR_FASTHZ);
 388                 inm->inm_state = IGMP_IREPORTEDLAST;
 389                 igmp_timers_are_running = 1;
 390         }
 391         return 0;
 392         splx(s);
 393 }
 394
 395 void
 396 igmp_leavegroup(inm)
 397         struct in_multi *inm;
 398 {
 399         if (inm->inm_state == IGMP_IREPORTEDLAST &&
 400             inm->inm_addr.s_addr != igmp_all_hosts_group &&
 401             !(inm->inm_ifp->if_flags & IFF_LOOPBACK) &&
 402             inm->inm_rti->rti_type != IGMP_V1_ROUTER)
 403                 igmp_sendpkt(inm, IGMP_V2_LEAVE_GROUP, igmp_all_rtrs_group);
 404 }
 405
 406 void
 407 igmp_fasttimo()
 408 {
 409         register struct in_multi *inm;
 410         struct in_multistep step;
 411         int s;
 412
 413         /*
 414          * Quick check to see if any work needs to be done, in order
 415          * to minimize the overhead of fasttimo processing.
 416          */
 417
 418         if (!igmp_timers_are_running)
 419                 return;
 420
 421         s = splnet();
 422         igmp_timers_are_running = 0;
 423         IN_FIRST_MULTI(step, inm);
 424         while (inm != NULL) {
 425                 if (inm->inm_timer == 0) {
 426                         /* do nothing */
 427                 } else if (--inm->inm_timer == 0) {
 428                         igmp_sendpkt(inm, inm->inm_rti->rti_type, 0);
 429                         inm->inm_state = IGMP_IREPORTEDLAST;
 430                 } else {
 431                         igmp_timers_are_running = 1;
 432                 }
 433                 IN_NEXT_MULTI(step, inm);
 434         }
 435         splx(s);
 436 }
 437
 438 void
 439 igmp_slowtimo()
 440 {
 441         int s = splnet();
 442         register struct router_info *rti =  Head;
 443
 444 #if IGMP_DEBUG
 445         printf("[igmp.c,_slowtimo] -- > entering \n");
 446 #endif
 447         while (rti) {
 448             if (rti->rti_type == IGMP_V1_ROUTER) {
 449                 rti->rti_time++;
 450                 if (rti->rti_time >= IGMP_AGE_THRESHOLD) {
 451                         rti->rti_type = IGMP_V2_ROUTER;
 452                 }
 453             }
 454             rti = rti->rti_next;
 455         }
 456 #if IGMP_DEBUG
 457         printf("[igmp.c,_slowtimo] -- > exiting \n");
 458 #endif
 459         splx(s);
 460 }
 461
 462 static struct route igmprt;
 463
 464 static void
 465 igmp_sendpkt(inm, type, addr)
 466         struct in_multi *inm;
 467         int type;
 468         unsigned long addr;
 469 {
 470         struct mbuf *m;
 471         struct igmp *igmp;
 472         struct ip *ip;
 473         struct ip_moptions imo;
 474
 475         MGETHDR(m, M_DONTWAIT, MT_HEADER);
 476         if (m == NULL)
 477                 return;
 478
 479         m->m_pkthdr.rcvif = loif;
 480         m->m_pkthdr.len = sizeof(struct ip) + IGMP_MINLEN;
 481         MH_ALIGN(m, IGMP_MINLEN + sizeof(struct ip));
 482         m->m_data += sizeof(struct ip);
 483         m->m_len = IGMP_MINLEN;
 484         m->m_pkthdr.csum_flags = 0;
 485         m->m_pkthdr.csum_data = 0;
 486         igmp = mtod(m, struct igmp *);
 487         igmp->igmp_type   = type;
 488         igmp->igmp_code   = 0;
 489         igmp->igmp_group  = inm->inm_addr;
 490         igmp->igmp_cksum  = 0;
 491         igmp->igmp_cksum  = in_cksum(m, IGMP_MINLEN);
 492
 493         m->m_data -= sizeof(struct ip);
 494         m->m_len += sizeof(struct ip);
 495         ip = mtod(m, struct ip *);
 496         ip->ip_tos        = 0;
 497         ip->ip_len        = sizeof(struct ip) + IGMP_MINLEN;
 498         ip->ip_off        = 0;
 499         ip->ip_p          = IPPROTO_IGMP;
 500         ip->ip_src.s_addr = INADDR_ANY;
 501         ip->ip_dst.s_addr = addr ? addr : igmp->igmp_group.s_addr;
 502
 503         imo.imo_multicast_ifp  = inm->inm_ifp;
 504         imo.imo_multicast_ttl  = 1;
 505         imo.imo_multicast_vif  = -1;
 506         /*
 507          * Request loopback of the report if we are acting as a multicast
 508          * router, so that the process-level routing demon can hear it.
 509          */
 510         imo.imo_multicast_loop = (ip_mrouter != NULL);
 511
 512         /*
 513          * XXX
 514          * Do we have to worry about reentrancy here?  Don't think so.
 515          */
 516         ip_output(m, router_alert, &igmprt, 0, &imo);
 517
 518         ++igmpstat.igps_snd_reports;
 519 }