2 * Copyright (c) 1988 Stephen Deering.
3 * Copyright (c) 1992, 1993
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
7 * Stephen Deering of Stanford University.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)igmp.c 8.1 (Berkeley) 7/19/93
38 * Internet Group Management Protocol (IGMP) routines.
40 * Written by Steve Deering, Stanford, May 1988.
41 * Modified by Rosen Sharma, Stanford, Aug 1994.
42 * Modified by Bill Fenner, Xerox PARC, Feb 1995.
43 * Modified to fully comply to IGMPv2 by Bill Fenner, Oct 1995.
45 * MULTICAST Revision: 3.5.1.4
50 #include <sys/param.h>
51 #include <sys/systm.h>
52 #include <sys/malloc.h>
54 #include <sys/socket.h>
55 #include <sys/protosw.h>
56 #include <sys/kernel.h>
57 #include <sys/sysctl.h>
60 #include <net/route.h>
62 #include <netinet/in.h>
63 #include <netinet/in_var.h>
64 #include <netinet/in_systm.h>
65 #include <netinet/ip.h>
66 #include <netinet/ip_var.h>
67 #include <netinet/ip_options.h>
68 #include <netinet/igmp.h>
69 #include <netinet/igmp_var.h>
71 #include <machine/in_cksum.h>
73 #include <security/mac/mac_framework.h>
75 static MALLOC_DEFINE(M_IGMP, "igmp", "igmp state");
77 static struct router_info *find_rti(struct ifnet *ifp);
78 static void igmp_sendpkt(struct in_multi *, int, unsigned long);
80 static struct igmpstat igmpstat;
82 SYSCTL_STRUCT(_net_inet_igmp, IGMPCTL_STATS, stats, CTLFLAG_RW, &igmpstat,
86 * igmp_mtx protects all mutable global variables in igmp.c, as well as the
87 * data fields in struct router_info. In general, a router_info structure
88 * will be valid as long as the referencing struct in_multi is valid, so no
89 * reference counting is used. We allow unlocked reads of router_info data
90 * when accessed via an in_multi read-only.
92 static struct mtx igmp_mtx;
93 static SLIST_HEAD(, router_info) router_info_head;
94 static int igmp_timers_are_running;
97 * XXXRW: can we define these such that these can be made const? In any
98 * case, these shouldn't be changed after igmp_init() and therefore don't
101 static u_long igmp_all_hosts_group;
102 static u_long igmp_all_rtrs_group;
104 static struct mbuf *router_alert;
105 static struct route igmprt;
108 #define IGMP_PRINTF(x) printf(x)
110 #define IGMP_PRINTF(x)
119 * To avoid byte-swapping the same value over and over again.
121 igmp_all_hosts_group = htonl(INADDR_ALLHOSTS_GROUP);
122 igmp_all_rtrs_group = htonl(INADDR_ALLRTRS_GROUP);
124 igmp_timers_are_running = 0;
127 * Construct a Router Alert option to use in outgoing packets.
129 MGET(router_alert, M_DONTWAIT, MT_DATA);
130 ra = mtod(router_alert, struct ipoption *);
131 ra->ipopt_dst.s_addr = 0;
132 ra->ipopt_list[0] = IPOPT_RA; /* Router Alert Option */
133 ra->ipopt_list[1] = 0x04; /* 4 bytes long */
134 ra->ipopt_list[2] = 0x00;
135 ra->ipopt_list[3] = 0x00;
136 router_alert->m_len = sizeof(ra->ipopt_dst) + ra->ipopt_list[1];
138 mtx_init(&igmp_mtx, "igmp_mtx", NULL, MTX_DEF);
139 SLIST_INIT(&router_info_head);
142 static struct router_info *
143 find_rti(struct ifnet *ifp)
145 struct router_info *rti;
147 mtx_assert(&igmp_mtx, MA_OWNED);
148 IGMP_PRINTF("[igmp.c, _find_rti] --> entering \n");
149 SLIST_FOREACH(rti, &router_info_head, rti_list) {
150 if (rti->rti_ifp == ifp) {
152 "[igmp.c, _find_rti] --> found old entry \n");
156 MALLOC(rti, struct router_info *, sizeof *rti, M_IGMP, M_NOWAIT);
158 IGMP_PRINTF("[igmp.c, _find_rti] --> no memory for entry\n");
162 rti->rti_type = IGMP_V2_ROUTER;
164 SLIST_INSERT_HEAD(&router_info_head, rti, rti_list);
165 IGMP_PRINTF("[igmp.c, _find_rti] --> created an entry \n");
170 igmp_input(register struct mbuf *m, int off)
172 register int iphlen = off;
173 register struct igmp *igmp;
174 register struct ip *ip;
175 register int igmplen;
176 register struct ifnet *ifp = m->m_pkthdr.rcvif;
178 register struct in_multi *inm;
179 register struct in_ifaddr *ia;
180 struct in_multistep step;
181 struct router_info *rti;
182 int timer; /** timer value in the igmp query header **/
184 ++igmpstat.igps_rcv_total;
186 ip = mtod(m, struct ip *);
187 igmplen = ip->ip_len;
192 if (igmplen < IGMP_MINLEN) {
193 ++igmpstat.igps_rcv_tooshort;
197 minlen = iphlen + IGMP_MINLEN;
198 if ((m->m_flags & M_EXT || m->m_len < minlen) &&
199 (m = m_pullup(m, minlen)) == 0) {
200 ++igmpstat.igps_rcv_tooshort;
209 igmp = mtod(m, struct igmp *);
210 if (in_cksum(m, igmplen)) {
211 ++igmpstat.igps_rcv_badsum;
218 ip = mtod(m, struct ip *);
219 timer = igmp->igmp_code * PR_FASTHZ / IGMP_TIMER_SCALE;
224 * In the IGMPv2 specification, there are 3 states and a flag.
226 * In Non-Member state, we simply don't have a membership record.
227 * In Delaying Member state, our timer is running (inm->inm_timer).
228 * In Idle Member state, our timer is not running (inm->inm_timer==0).
230 * The flag is inm->inm_state, it is set to IGMP_OTHERMEMBER if we
231 * have heard a report from another member, or IGMP_IREPORTEDLAST if
232 * I sent the last report.
234 switch (igmp->igmp_type) {
235 case IGMP_MEMBERSHIP_QUERY:
236 ++igmpstat.igps_rcv_queries;
238 if (ifp->if_flags & IFF_LOOPBACK)
241 if (igmp->igmp_code == 0) {
243 * Old router. Remember that the querier on this
244 * interface is old, and set the timer to the value
251 mtx_unlock(&igmp_mtx);
255 rti->rti_type = IGMP_V1_ROUTER;
257 mtx_unlock(&igmp_mtx);
259 timer = IGMP_MAX_HOST_REPORT_DELAY * PR_FASTHZ;
261 if (ip->ip_dst.s_addr != igmp_all_hosts_group ||
262 igmp->igmp_group.s_addr != 0) {
263 ++igmpstat.igps_rcv_badqueries;
269 * New router. Simply do the new validity check.
272 if (igmp->igmp_group.s_addr != 0 &&
273 !IN_MULTICAST(ntohl(igmp->igmp_group.s_addr))) {
274 ++igmpstat.igps_rcv_badqueries;
281 * - Start the timers in all of our membership records that
282 * the query applies to for the interface on which the
283 * query arrived excl. those that belong to the "all-hosts"
285 * - Restart any timer that is already running but has a
286 * value longer than the requested timeout.
287 * - Use the value specified in the query message as the
291 IN_FIRST_MULTI(step, inm);
292 while (inm != NULL) {
293 if (inm->inm_ifp == ifp &&
294 inm->inm_addr.s_addr != igmp_all_hosts_group &&
295 (igmp->igmp_group.s_addr == 0 ||
296 igmp->igmp_group.s_addr == inm->inm_addr.s_addr)) {
297 if (inm->inm_timer == 0 ||
298 inm->inm_timer > timer) {
300 IGMP_RANDOM_DELAY(timer);
301 igmp_timers_are_running = 1;
304 IN_NEXT_MULTI(step, inm);
309 case IGMP_V1_MEMBERSHIP_REPORT:
310 case IGMP_V2_MEMBERSHIP_REPORT:
312 * For fast leave to work, we have to know that we are the
313 * last person to send a report for this group. Reports can
314 * potentially get looped back if we are a multicast router,
315 * so discard reports sourced by me.
319 ip->ip_src.s_addr == IA_SIN(ia)->sin_addr.s_addr)
322 ++igmpstat.igps_rcv_reports;
324 if (ifp->if_flags & IFF_LOOPBACK)
327 if (!IN_MULTICAST(ntohl(igmp->igmp_group.s_addr))) {
328 ++igmpstat.igps_rcv_badreports;
334 * KLUDGE: if the IP source address of the report has an
335 * unspecified (i.e., zero) subnet number, as is allowed for
336 * a booting host, replace it with the correct subnet number
337 * so that a process-level multicast routing daemon can
338 * determine which subnet it arrived from. This is necessary
339 * to compensate for the lack of any way for a process to
340 * determine the arrival interface of an incoming packet.
342 if ((ntohl(ip->ip_src.s_addr) & IN_CLASSA_NET) == 0) {
344 ip->ip_src.s_addr = htonl(ia->ia_subnet);
348 * If we belong to the group being reported, stop our timer
352 IN_LOOKUP_MULTI(igmp->igmp_group, ifp, inm);
355 ++igmpstat.igps_rcv_ourreports;
356 inm->inm_state = IGMP_OTHERMEMBER;
363 * Pass all valid IGMP packets up to any process(es) listening on a
370 igmp_joingroup(struct in_multi *inm)
373 IN_MULTI_LOCK_ASSERT();
375 if (inm->inm_addr.s_addr == igmp_all_hosts_group
376 || inm->inm_ifp->if_flags & IFF_LOOPBACK) {
378 inm->inm_state = IGMP_OTHERMEMBER;
381 inm->inm_rti = find_rti(inm->inm_ifp);
382 mtx_unlock(&igmp_mtx);
383 if (inm->inm_rti != NULL) {
384 igmp_sendpkt(inm, inm->inm_rti->rti_type, 0);
385 inm->inm_timer = IGMP_RANDOM_DELAY(
386 IGMP_MAX_HOST_REPORT_DELAY*PR_FASTHZ);
387 inm->inm_state = IGMP_IREPORTEDLAST;
388 igmp_timers_are_running = 1;
390 /* XXX handling of failure case? */
395 igmp_leavegroup(struct in_multi *inm)
398 IN_MULTI_LOCK_ASSERT();
400 if (inm->inm_state == IGMP_IREPORTEDLAST &&
401 inm->inm_addr.s_addr != igmp_all_hosts_group &&
402 !(inm->inm_ifp->if_flags & IFF_LOOPBACK) &&
403 inm->inm_rti->rti_type != IGMP_V1_ROUTER)
404 igmp_sendpkt(inm, IGMP_V2_LEAVE_GROUP, igmp_all_rtrs_group);
410 register struct in_multi *inm;
411 struct in_multistep step;
414 * Quick check to see if any work needs to be done, in order to
415 * minimize the overhead of fasttimo processing.
418 if (!igmp_timers_are_running)
422 igmp_timers_are_running = 0;
423 IN_FIRST_MULTI(step, inm);
424 while (inm != NULL) {
425 if (inm->inm_timer == 0) {
427 } else if (--inm->inm_timer == 0) {
428 igmp_sendpkt(inm, inm->inm_rti->rti_type, 0);
429 inm->inm_state = IGMP_IREPORTEDLAST;
431 igmp_timers_are_running = 1;
433 IN_NEXT_MULTI(step, inm);
441 struct router_info *rti;
443 IGMP_PRINTF("[igmp.c,_slowtimo] -- > entering \n");
445 SLIST_FOREACH(rti, &router_info_head, rti_list) {
446 if (rti->rti_type == IGMP_V1_ROUTER) {
448 if (rti->rti_time >= IGMP_AGE_THRESHOLD)
449 rti->rti_type = IGMP_V2_ROUTER;
452 mtx_unlock(&igmp_mtx);
453 IGMP_PRINTF("[igmp.c,_slowtimo] -- > exiting \n");
457 igmp_sendpkt(struct in_multi *inm, int type, unsigned long addr)
462 struct ip_moptions imo;
464 IN_MULTI_LOCK_ASSERT();
466 MGETHDR(m, M_DONTWAIT, MT_DATA);
470 m->m_pkthdr.rcvif = loif;
472 mac_create_mbuf_linklayer(inm->inm_ifp, m);
474 m->m_pkthdr.len = sizeof(struct ip) + IGMP_MINLEN;
475 MH_ALIGN(m, IGMP_MINLEN + sizeof(struct ip));
476 m->m_data += sizeof(struct ip);
477 m->m_len = IGMP_MINLEN;
478 igmp = mtod(m, struct igmp *);
479 igmp->igmp_type = type;
481 igmp->igmp_group = inm->inm_addr;
482 igmp->igmp_cksum = 0;
483 igmp->igmp_cksum = in_cksum(m, IGMP_MINLEN);
485 m->m_data -= sizeof(struct ip);
486 m->m_len += sizeof(struct ip);
487 ip = mtod(m, struct ip *);
489 ip->ip_len = sizeof(struct ip) + IGMP_MINLEN;
491 ip->ip_p = IPPROTO_IGMP;
492 ip->ip_src.s_addr = INADDR_ANY;
493 ip->ip_dst.s_addr = addr ? addr : igmp->igmp_group.s_addr;
495 imo.imo_multicast_ifp = inm->inm_ifp;
496 imo.imo_multicast_ttl = 1;
497 imo.imo_multicast_vif = -1;
499 * Request loopback of the report if we are acting as a multicast
500 * router, so that the process-level routing daemon can hear it.
502 imo.imo_multicast_loop = (ip_mrouter != NULL);
505 * XXX: Do we have to worry about reentrancy here? Don't think so.
507 ip_output(m, router_alert, &igmprt, 0, &imo, NULL);
509 ++igmpstat.igps_snd_reports;