igmp.c revision 1.33 1 1.33 matt /* $NetBSD: igmp.c,v 1.33 2003/06/15 02:49:32 matt Exp $ */
2 1.21 itojun
3 1.21 itojun /*
4 1.21 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 1.21 itojun * All rights reserved.
6 1.29 itojun *
7 1.21 itojun * Redistribution and use in source and binary forms, with or without
8 1.21 itojun * modification, are permitted provided that the following conditions
9 1.21 itojun * are met:
10 1.21 itojun * 1. Redistributions of source code must retain the above copyright
11 1.21 itojun * notice, this list of conditions and the following disclaimer.
12 1.21 itojun * 2. Redistributions in binary form must reproduce the above copyright
13 1.21 itojun * notice, this list of conditions and the following disclaimer in the
14 1.21 itojun * documentation and/or other materials provided with the distribution.
15 1.21 itojun * 3. Neither the name of the project nor the names of its contributors
16 1.21 itojun * may be used to endorse or promote products derived from this software
17 1.21 itojun * without specific prior written permission.
18 1.29 itojun *
19 1.21 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
20 1.21 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.21 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.21 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
23 1.21 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.21 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.21 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.21 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.21 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.21 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.21 itojun * SUCH DAMAGE.
30 1.21 itojun */
31 1.8 cgd
32 1.1 hpeyerl /*
33 1.10 mycroft * Internet Group Management Protocol (IGMP) routines.
34 1.1 hpeyerl *
35 1.10 mycroft * Written by Steve Deering, Stanford, May 1988.
36 1.10 mycroft * Modified by Rosen Sharma, Stanford, Aug 1994.
37 1.10 mycroft * Modified by Bill Fenner, Xerox PARC, Feb 1995.
38 1.1 hpeyerl *
39 1.10 mycroft * MULTICAST Revision: 1.3
40 1.1 hpeyerl */
41 1.27 lukem
42 1.27 lukem #include <sys/cdefs.h>
43 1.33 matt __KERNEL_RCSID(0, "$NetBSD: igmp.c,v 1.33 2003/06/15 02:49:32 matt Exp $");
44 1.17 scottr
45 1.17 scottr #include "opt_mrouting.h"
46 1.1 hpeyerl
47 1.1 hpeyerl #include <sys/param.h>
48 1.1 hpeyerl #include <sys/mbuf.h>
49 1.1 hpeyerl #include <sys/socket.h>
50 1.1 hpeyerl #include <sys/protosw.h>
51 1.15 christos #include <sys/systm.h>
52 1.1 hpeyerl
53 1.1 hpeyerl #include <net/if.h>
54 1.1 hpeyerl #include <net/route.h>
55 1.1 hpeyerl
56 1.1 hpeyerl #include <netinet/in.h>
57 1.1 hpeyerl #include <netinet/in_var.h>
58 1.1 hpeyerl #include <netinet/in_systm.h>
59 1.1 hpeyerl #include <netinet/ip.h>
60 1.1 hpeyerl #include <netinet/ip_var.h>
61 1.1 hpeyerl #include <netinet/igmp.h>
62 1.1 hpeyerl #include <netinet/igmp_var.h>
63 1.1 hpeyerl
64 1.15 christos #include <machine/stdarg.h>
65 1.15 christos
66 1.10 mycroft #define IP_MULTICASTOPTS 0
67 1.10 mycroft
68 1.33 matt struct pool igmp_rti_pool;
69 1.28 matt struct igmpstat igmpstat;
70 1.25 matt int igmp_timers_are_running;
71 1.33 matt static LIST_HEAD(, router_info) rti_head = LIST_HEAD_INITIALIZER(rti_head);
72 1.1 hpeyerl
73 1.10 mycroft void igmp_sendpkt __P((struct in_multi *, int));
74 1.15 christos static int rti_fill __P((struct in_multi *));
75 1.15 christos static struct router_info * rti_find __P((struct ifnet *));
76 1.1 hpeyerl
77 1.1 hpeyerl void
78 1.1 hpeyerl igmp_init()
79 1.1 hpeyerl {
80 1.10 mycroft igmp_timers_are_running = 0;
81 1.33 matt pool_init(&igmp_rti_pool, sizeof(struct router_info), 0, 0, 0, "igmppl",
82 1.33 matt NULL);
83 1.10 mycroft }
84 1.10 mycroft
85 1.10 mycroft static int
86 1.10 mycroft rti_fill(inm)
87 1.10 mycroft struct in_multi *inm;
88 1.10 mycroft {
89 1.24 augustss struct router_info *rti;
90 1.10 mycroft
91 1.33 matt LIST_FOREACH(rti, &rti_head, rti_link) {
92 1.10 mycroft if (rti->rti_ifp == inm->inm_ifp) {
93 1.10 mycroft inm->inm_rti = rti;
94 1.10 mycroft if (rti->rti_type == IGMP_v1_ROUTER)
95 1.10 mycroft return (IGMP_v1_HOST_MEMBERSHIP_REPORT);
96 1.10 mycroft else
97 1.10 mycroft return (IGMP_v2_HOST_MEMBERSHIP_REPORT);
98 1.10 mycroft }
99 1.10 mycroft }
100 1.10 mycroft
101 1.33 matt rti = pool_get(&igmp_rti_pool, PR_NOWAIT);
102 1.33 matt if (rti == NULL)
103 1.33 matt return 0;
104 1.10 mycroft rti->rti_ifp = inm->inm_ifp;
105 1.10 mycroft rti->rti_type = IGMP_v2_ROUTER;
106 1.33 matt LIST_INSERT_HEAD(&rti_head, rti, rti_link);
107 1.10 mycroft inm->inm_rti = rti;
108 1.10 mycroft return (IGMP_v2_HOST_MEMBERSHIP_REPORT);
109 1.10 mycroft }
110 1.10 mycroft
111 1.10 mycroft static struct router_info *
112 1.10 mycroft rti_find(ifp)
113 1.10 mycroft struct ifnet *ifp;
114 1.10 mycroft {
115 1.24 augustss struct router_info *rti;
116 1.10 mycroft
117 1.33 matt LIST_FOREACH(rti, &rti_head, rti_link) {
118 1.10 mycroft if (rti->rti_ifp == ifp)
119 1.10 mycroft return (rti);
120 1.10 mycroft }
121 1.10 mycroft
122 1.33 matt rti = pool_get(&igmp_rti_pool, PR_NOWAIT);
123 1.33 matt if (rti == NULL)
124 1.33 matt return NULL;
125 1.10 mycroft rti->rti_ifp = ifp;
126 1.10 mycroft rti->rti_type = IGMP_v2_ROUTER;
127 1.33 matt LIST_INSERT_HEAD(&rti_head, rti, rti_link);
128 1.10 mycroft return (rti);
129 1.1 hpeyerl }
130 1.1 hpeyerl
131 1.1 hpeyerl void
132 1.15 christos #if __STDC__
133 1.15 christos igmp_input(struct mbuf *m, ...)
134 1.15 christos #else
135 1.15 christos igmp_input(m, va_alist)
136 1.15 christos struct mbuf *m;
137 1.15 christos va_dcl
138 1.15 christos #endif
139 1.15 christos {
140 1.21 itojun int proto;
141 1.24 augustss int iphlen;
142 1.24 augustss struct ifnet *ifp = m->m_pkthdr.rcvif;
143 1.24 augustss struct ip *ip = mtod(m, struct ip *);
144 1.24 augustss struct igmp *igmp;
145 1.32 thorpej u_int minlen;
146 1.10 mycroft struct in_multi *inm;
147 1.10 mycroft struct in_multistep step;
148 1.10 mycroft struct router_info *rti;
149 1.24 augustss struct in_ifaddr *ia;
150 1.32 thorpej u_int timer;
151 1.15 christos va_list ap;
152 1.31 itojun u_int16_t ip_len;
153 1.15 christos
154 1.15 christos va_start(ap, m);
155 1.15 christos iphlen = va_arg(ap, int);
156 1.21 itojun proto = va_arg(ap, int);
157 1.15 christos va_end(ap);
158 1.1 hpeyerl
159 1.1 hpeyerl ++igmpstat.igps_rcv_total;
160 1.1 hpeyerl
161 1.1 hpeyerl /*
162 1.1 hpeyerl * Validate lengths
163 1.1 hpeyerl */
164 1.19 mycroft minlen = iphlen + IGMP_MINLEN;
165 1.31 itojun ip_len = ntohs(ip->ip_len);
166 1.31 itojun if (ip_len < minlen) {
167 1.1 hpeyerl ++igmpstat.igps_rcv_tooshort;
168 1.1 hpeyerl m_freem(m);
169 1.1 hpeyerl return;
170 1.1 hpeyerl }
171 1.25 matt if (((m->m_flags & M_EXT) && (ip->ip_src.s_addr & IN_CLASSA_NET) == 0)
172 1.25 matt || m->m_len < minlen) {
173 1.25 matt if ((m = m_pullup(m, minlen)) == 0) {
174 1.25 matt ++igmpstat.igps_rcv_tooshort;
175 1.25 matt return;
176 1.25 matt }
177 1.25 matt ip = mtod(m, struct ip *);
178 1.1 hpeyerl }
179 1.1 hpeyerl
180 1.1 hpeyerl /*
181 1.1 hpeyerl * Validate checksum
182 1.1 hpeyerl */
183 1.1 hpeyerl m->m_data += iphlen;
184 1.1 hpeyerl m->m_len -= iphlen;
185 1.1 hpeyerl igmp = mtod(m, struct igmp *);
186 1.30 thorpej /* No need to assert alignment here. */
187 1.31 itojun if (in_cksum(m, ip_len - iphlen)) {
188 1.1 hpeyerl ++igmpstat.igps_rcv_badsum;
189 1.1 hpeyerl m_freem(m);
190 1.1 hpeyerl return;
191 1.1 hpeyerl }
192 1.1 hpeyerl m->m_data -= iphlen;
193 1.1 hpeyerl m->m_len += iphlen;
194 1.1 hpeyerl
195 1.1 hpeyerl switch (igmp->igmp_type) {
196 1.1 hpeyerl
197 1.1 hpeyerl case IGMP_HOST_MEMBERSHIP_QUERY:
198 1.1 hpeyerl ++igmpstat.igps_rcv_queries;
199 1.1 hpeyerl
200 1.6 mycroft if (ifp->if_flags & IFF_LOOPBACK)
201 1.1 hpeyerl break;
202 1.1 hpeyerl
203 1.10 mycroft if (igmp->igmp_code == 0) {
204 1.10 mycroft rti = rti_find(ifp);
205 1.33 matt if (rti == NULL)
206 1.33 matt break;
207 1.10 mycroft rti->rti_type = IGMP_v1_ROUTER;
208 1.10 mycroft rti->rti_age = 0;
209 1.10 mycroft
210 1.12 mycroft if (ip->ip_dst.s_addr != INADDR_ALLHOSTS_GROUP) {
211 1.10 mycroft ++igmpstat.igps_rcv_badqueries;
212 1.10 mycroft m_freem(m);
213 1.10 mycroft return;
214 1.10 mycroft }
215 1.10 mycroft
216 1.10 mycroft /*
217 1.10 mycroft * Start the timers in all of our membership records
218 1.10 mycroft * for the interface on which the query arrived,
219 1.10 mycroft * except those that are already running and those
220 1.10 mycroft * that belong to a "local" group (224.0.0.X).
221 1.10 mycroft */
222 1.10 mycroft IN_FIRST_MULTI(step, inm);
223 1.10 mycroft while (inm != NULL) {
224 1.10 mycroft if (inm->inm_ifp == ifp &&
225 1.10 mycroft inm->inm_timer == 0 &&
226 1.10 mycroft !IN_LOCAL_GROUP(inm->inm_addr.s_addr)) {
227 1.10 mycroft inm->inm_state = IGMP_DELAYING_MEMBER;
228 1.10 mycroft inm->inm_timer = IGMP_RANDOM_DELAY(
229 1.10 mycroft IGMP_MAX_HOST_REPORT_DELAY * PR_FASTHZ);
230 1.10 mycroft igmp_timers_are_running = 1;
231 1.10 mycroft }
232 1.10 mycroft IN_NEXT_MULTI(step, inm);
233 1.10 mycroft }
234 1.10 mycroft } else {
235 1.12 mycroft if (!IN_MULTICAST(ip->ip_dst.s_addr)) {
236 1.10 mycroft ++igmpstat.igps_rcv_badqueries;
237 1.10 mycroft m_freem(m);
238 1.10 mycroft return;
239 1.10 mycroft }
240 1.10 mycroft
241 1.10 mycroft timer = igmp->igmp_code * PR_FASTHZ / IGMP_TIMER_SCALE;
242 1.20 hwr if (timer == 0)
243 1.20 hwr timer =1;
244 1.10 mycroft
245 1.10 mycroft /*
246 1.10 mycroft * Start the timers in all of our membership records
247 1.10 mycroft * for the interface on which the query arrived,
248 1.10 mycroft * except those that are already running and those
249 1.10 mycroft * that belong to a "local" group (224.0.0.X). For
250 1.10 mycroft * timers already running, check if they need to be
251 1.10 mycroft * reset.
252 1.10 mycroft */
253 1.10 mycroft IN_FIRST_MULTI(step, inm);
254 1.10 mycroft while (inm != NULL) {
255 1.10 mycroft if (inm->inm_ifp == ifp &&
256 1.10 mycroft !IN_LOCAL_GROUP(inm->inm_addr.s_addr) &&
257 1.12 mycroft (ip->ip_dst.s_addr == INADDR_ALLHOSTS_GROUP ||
258 1.16 mycroft in_hosteq(ip->ip_dst, inm->inm_addr))) {
259 1.10 mycroft switch (inm->inm_state) {
260 1.10 mycroft case IGMP_DELAYING_MEMBER:
261 1.10 mycroft if (inm->inm_timer <= timer)
262 1.10 mycroft break;
263 1.10 mycroft /* FALLTHROUGH */
264 1.10 mycroft case IGMP_IDLE_MEMBER:
265 1.10 mycroft case IGMP_LAZY_MEMBER:
266 1.10 mycroft case IGMP_AWAKENING_MEMBER:
267 1.10 mycroft inm->inm_state =
268 1.10 mycroft IGMP_DELAYING_MEMBER;
269 1.10 mycroft inm->inm_timer =
270 1.10 mycroft IGMP_RANDOM_DELAY(timer);
271 1.10 mycroft igmp_timers_are_running = 1;
272 1.10 mycroft break;
273 1.10 mycroft case IGMP_SLEEPING_MEMBER:
274 1.10 mycroft inm->inm_state =
275 1.10 mycroft IGMP_AWAKENING_MEMBER;
276 1.10 mycroft break;
277 1.10 mycroft }
278 1.10 mycroft }
279 1.10 mycroft IN_NEXT_MULTI(step, inm);
280 1.10 mycroft }
281 1.10 mycroft }
282 1.10 mycroft
283 1.10 mycroft break;
284 1.10 mycroft
285 1.10 mycroft case IGMP_v1_HOST_MEMBERSHIP_REPORT:
286 1.10 mycroft ++igmpstat.igps_rcv_reports;
287 1.10 mycroft
288 1.10 mycroft if (ifp->if_flags & IFF_LOOPBACK)
289 1.10 mycroft break;
290 1.10 mycroft
291 1.12 mycroft if (!IN_MULTICAST(igmp->igmp_group.s_addr) ||
292 1.16 mycroft !in_hosteq(igmp->igmp_group, ip->ip_dst)) {
293 1.10 mycroft ++igmpstat.igps_rcv_badreports;
294 1.1 hpeyerl m_freem(m);
295 1.1 hpeyerl return;
296 1.1 hpeyerl }
297 1.1 hpeyerl
298 1.1 hpeyerl /*
299 1.10 mycroft * KLUDGE: if the IP source address of the report has an
300 1.10 mycroft * unspecified (i.e., zero) subnet number, as is allowed for
301 1.10 mycroft * a booting host, replace it with the correct subnet number
302 1.10 mycroft * so that a process-level multicast routing daemon can
303 1.10 mycroft * determine which subnet it arrived from. This is necessary
304 1.10 mycroft * to compensate for the lack of any way for a process to
305 1.10 mycroft * determine the arrival interface of an incoming packet.
306 1.1 hpeyerl */
307 1.12 mycroft if ((ip->ip_src.s_addr & IN_CLASSA_NET) == 0) {
308 1.18 tls IFP_TO_IA(ifp, ia); /* XXX */
309 1.10 mycroft if (ia)
310 1.12 mycroft ip->ip_src.s_addr = ia->ia_subnet;
311 1.10 mycroft }
312 1.10 mycroft
313 1.10 mycroft /*
314 1.10 mycroft * If we belong to the group being reported, stop
315 1.10 mycroft * our timer for that group.
316 1.10 mycroft */
317 1.10 mycroft IN_LOOKUP_MULTI(igmp->igmp_group, ifp, inm);
318 1.10 mycroft if (inm != NULL) {
319 1.10 mycroft inm->inm_timer = 0;
320 1.10 mycroft ++igmpstat.igps_rcv_ourreports;
321 1.10 mycroft
322 1.10 mycroft switch (inm->inm_state) {
323 1.10 mycroft case IGMP_IDLE_MEMBER:
324 1.10 mycroft case IGMP_LAZY_MEMBER:
325 1.10 mycroft case IGMP_AWAKENING_MEMBER:
326 1.10 mycroft case IGMP_SLEEPING_MEMBER:
327 1.10 mycroft inm->inm_state = IGMP_SLEEPING_MEMBER;
328 1.10 mycroft break;
329 1.10 mycroft case IGMP_DELAYING_MEMBER:
330 1.10 mycroft if (inm->inm_rti->rti_type == IGMP_v1_ROUTER)
331 1.10 mycroft inm->inm_state = IGMP_LAZY_MEMBER;
332 1.10 mycroft else
333 1.10 mycroft inm->inm_state = IGMP_SLEEPING_MEMBER;
334 1.10 mycroft break;
335 1.1 hpeyerl }
336 1.1 hpeyerl }
337 1.1 hpeyerl
338 1.1 hpeyerl break;
339 1.1 hpeyerl
340 1.10 mycroft case IGMP_v2_HOST_MEMBERSHIP_REPORT:
341 1.10 mycroft #ifdef MROUTING
342 1.10 mycroft /*
343 1.10 mycroft * Make sure we don't hear our own membership report. Fast
344 1.10 mycroft * leave requires knowing that we are the only member of a
345 1.10 mycroft * group.
346 1.10 mycroft */
347 1.18 tls IFP_TO_IA(ifp, ia); /* XXX */
348 1.16 mycroft if (ia && in_hosteq(ip->ip_src, ia->ia_addr.sin_addr))
349 1.10 mycroft break;
350 1.10 mycroft #endif
351 1.10 mycroft
352 1.1 hpeyerl ++igmpstat.igps_rcv_reports;
353 1.1 hpeyerl
354 1.6 mycroft if (ifp->if_flags & IFF_LOOPBACK)
355 1.1 hpeyerl break;
356 1.1 hpeyerl
357 1.12 mycroft if (!IN_MULTICAST(igmp->igmp_group.s_addr) ||
358 1.16 mycroft !in_hosteq(igmp->igmp_group, ip->ip_dst)) {
359 1.1 hpeyerl ++igmpstat.igps_rcv_badreports;
360 1.1 hpeyerl m_freem(m);
361 1.1 hpeyerl return;
362 1.1 hpeyerl }
363 1.1 hpeyerl
364 1.1 hpeyerl /*
365 1.1 hpeyerl * KLUDGE: if the IP source address of the report has an
366 1.1 hpeyerl * unspecified (i.e., zero) subnet number, as is allowed for
367 1.1 hpeyerl * a booting host, replace it with the correct subnet number
368 1.10 mycroft * so that a process-level multicast routing daemon can
369 1.1 hpeyerl * determine which subnet it arrived from. This is necessary
370 1.1 hpeyerl * to compensate for the lack of any way for a process to
371 1.1 hpeyerl * determine the arrival interface of an incoming packet.
372 1.1 hpeyerl */
373 1.12 mycroft if ((ip->ip_src.s_addr & IN_CLASSA_NET) == 0) {
374 1.10 mycroft #ifndef MROUTING
375 1.18 tls IFP_TO_IA(ifp, ia); /* XXX */
376 1.10 mycroft #endif
377 1.10 mycroft if (ia)
378 1.12 mycroft ip->ip_src.s_addr = ia->ia_subnet;
379 1.1 hpeyerl }
380 1.1 hpeyerl
381 1.1 hpeyerl /*
382 1.1 hpeyerl * If we belong to the group being reported, stop
383 1.1 hpeyerl * our timer for that group.
384 1.1 hpeyerl */
385 1.1 hpeyerl IN_LOOKUP_MULTI(igmp->igmp_group, ifp, inm);
386 1.1 hpeyerl if (inm != NULL) {
387 1.1 hpeyerl inm->inm_timer = 0;
388 1.1 hpeyerl ++igmpstat.igps_rcv_ourreports;
389 1.10 mycroft
390 1.10 mycroft switch (inm->inm_state) {
391 1.10 mycroft case IGMP_DELAYING_MEMBER:
392 1.10 mycroft case IGMP_IDLE_MEMBER:
393 1.10 mycroft case IGMP_AWAKENING_MEMBER:
394 1.10 mycroft inm->inm_state = IGMP_LAZY_MEMBER;
395 1.10 mycroft break;
396 1.10 mycroft case IGMP_LAZY_MEMBER:
397 1.10 mycroft case IGMP_SLEEPING_MEMBER:
398 1.10 mycroft break;
399 1.10 mycroft }
400 1.1 hpeyerl }
401 1.1 hpeyerl
402 1.1 hpeyerl break;
403 1.10 mycroft
404 1.1 hpeyerl }
405 1.1 hpeyerl
406 1.1 hpeyerl /*
407 1.1 hpeyerl * Pass all valid IGMP packets up to any process(es) listening
408 1.1 hpeyerl * on a raw IGMP socket.
409 1.1 hpeyerl */
410 1.21 itojun rip_input(m, iphlen, proto);
411 1.21 itojun return;
412 1.1 hpeyerl }
413 1.1 hpeyerl
414 1.33 matt int
415 1.1 hpeyerl igmp_joingroup(inm)
416 1.1 hpeyerl struct in_multi *inm;
417 1.1 hpeyerl {
418 1.33 matt int report_type;
419 1.14 mycroft int s = splsoftnet();
420 1.10 mycroft
421 1.10 mycroft inm->inm_state = IGMP_IDLE_MEMBER;
422 1.1 hpeyerl
423 1.10 mycroft if (!IN_LOCAL_GROUP(inm->inm_addr.s_addr) &&
424 1.10 mycroft (inm->inm_ifp->if_flags & IFF_LOOPBACK) == 0) {
425 1.33 matt report_type = rti_fill(inm);
426 1.33 matt if (report_type == 0)
427 1.33 matt return ENOMEM;
428 1.33 matt igmp_sendpkt(inm, report_type);
429 1.10 mycroft inm->inm_state = IGMP_DELAYING_MEMBER;
430 1.10 mycroft inm->inm_timer = IGMP_RANDOM_DELAY(
431 1.10 mycroft IGMP_MAX_HOST_REPORT_DELAY * PR_FASTHZ);
432 1.10 mycroft igmp_timers_are_running = 1;
433 1.10 mycroft } else
434 1.1 hpeyerl inm->inm_timer = 0;
435 1.1 hpeyerl splx(s);
436 1.33 matt return 0;
437 1.1 hpeyerl }
438 1.1 hpeyerl
439 1.1 hpeyerl void
440 1.1 hpeyerl igmp_leavegroup(inm)
441 1.1 hpeyerl struct in_multi *inm;
442 1.1 hpeyerl {
443 1.10 mycroft
444 1.10 mycroft switch (inm->inm_state) {
445 1.10 mycroft case IGMP_DELAYING_MEMBER:
446 1.10 mycroft case IGMP_IDLE_MEMBER:
447 1.10 mycroft if (!IN_LOCAL_GROUP(inm->inm_addr.s_addr) &&
448 1.10 mycroft (inm->inm_ifp->if_flags & IFF_LOOPBACK) == 0)
449 1.10 mycroft if (inm->inm_rti->rti_type != IGMP_v1_ROUTER)
450 1.10 mycroft igmp_sendpkt(inm, IGMP_HOST_LEAVE_MESSAGE);
451 1.10 mycroft break;
452 1.10 mycroft case IGMP_LAZY_MEMBER:
453 1.10 mycroft case IGMP_AWAKENING_MEMBER:
454 1.10 mycroft case IGMP_SLEEPING_MEMBER:
455 1.10 mycroft break;
456 1.10 mycroft }
457 1.1 hpeyerl }
458 1.1 hpeyerl
459 1.1 hpeyerl void
460 1.1 hpeyerl igmp_fasttimo()
461 1.1 hpeyerl {
462 1.24 augustss struct in_multi *inm;
463 1.1 hpeyerl struct in_multistep step;
464 1.10 mycroft int s;
465 1.1 hpeyerl
466 1.1 hpeyerl /*
467 1.1 hpeyerl * Quick check to see if any work needs to be done, in order
468 1.1 hpeyerl * to minimize the overhead of fasttimo processing.
469 1.1 hpeyerl */
470 1.1 hpeyerl if (!igmp_timers_are_running)
471 1.1 hpeyerl return;
472 1.1 hpeyerl
473 1.14 mycroft s = splsoftnet();
474 1.1 hpeyerl igmp_timers_are_running = 0;
475 1.1 hpeyerl IN_FIRST_MULTI(step, inm);
476 1.1 hpeyerl while (inm != NULL) {
477 1.1 hpeyerl if (inm->inm_timer == 0) {
478 1.1 hpeyerl /* do nothing */
479 1.1 hpeyerl } else if (--inm->inm_timer == 0) {
480 1.10 mycroft if (inm->inm_state == IGMP_DELAYING_MEMBER) {
481 1.10 mycroft if (inm->inm_rti->rti_type == IGMP_v1_ROUTER)
482 1.10 mycroft igmp_sendpkt(inm,
483 1.10 mycroft IGMP_v1_HOST_MEMBERSHIP_REPORT);
484 1.10 mycroft else
485 1.10 mycroft igmp_sendpkt(inm,
486 1.10 mycroft IGMP_v2_HOST_MEMBERSHIP_REPORT);
487 1.10 mycroft inm->inm_state = IGMP_IDLE_MEMBER;
488 1.10 mycroft }
489 1.1 hpeyerl } else {
490 1.1 hpeyerl igmp_timers_are_running = 1;
491 1.1 hpeyerl }
492 1.1 hpeyerl IN_NEXT_MULTI(step, inm);
493 1.1 hpeyerl }
494 1.1 hpeyerl splx(s);
495 1.1 hpeyerl }
496 1.1 hpeyerl
497 1.10 mycroft void
498 1.10 mycroft igmp_slowtimo()
499 1.10 mycroft {
500 1.24 augustss struct router_info *rti;
501 1.10 mycroft int s;
502 1.10 mycroft
503 1.14 mycroft s = splsoftnet();
504 1.33 matt LIST_FOREACH(rti, &rti_head, rti_link) {
505 1.10 mycroft if (rti->rti_type == IGMP_v1_ROUTER &&
506 1.10 mycroft ++rti->rti_age >= IGMP_AGE_THRESHOLD) {
507 1.10 mycroft rti->rti_type = IGMP_v2_ROUTER;
508 1.10 mycroft }
509 1.10 mycroft }
510 1.10 mycroft splx(s);
511 1.10 mycroft }
512 1.10 mycroft
513 1.10 mycroft void
514 1.10 mycroft igmp_sendpkt(inm, type)
515 1.10 mycroft struct in_multi *inm;
516 1.10 mycroft int type;
517 1.1 hpeyerl {
518 1.10 mycroft struct mbuf *m;
519 1.10 mycroft struct igmp *igmp;
520 1.10 mycroft struct ip *ip;
521 1.10 mycroft struct ip_moptions imo;
522 1.10 mycroft #ifdef MROUTING
523 1.10 mycroft extern struct socket *ip_mrouter;
524 1.10 mycroft #endif /* MROUTING */
525 1.1 hpeyerl
526 1.1 hpeyerl MGETHDR(m, M_DONTWAIT, MT_HEADER);
527 1.1 hpeyerl if (m == NULL)
528 1.1 hpeyerl return;
529 1.1 hpeyerl /*
530 1.1 hpeyerl * Assume max_linkhdr + sizeof(struct ip) + IGMP_MINLEN
531 1.1 hpeyerl * is smaller than mbuf size returned by MGETHDR.
532 1.1 hpeyerl */
533 1.1 hpeyerl m->m_data += max_linkhdr;
534 1.1 hpeyerl m->m_len = sizeof(struct ip) + IGMP_MINLEN;
535 1.1 hpeyerl m->m_pkthdr.len = sizeof(struct ip) + IGMP_MINLEN;
536 1.1 hpeyerl
537 1.1 hpeyerl ip = mtod(m, struct ip *);
538 1.1 hpeyerl ip->ip_tos = 0;
539 1.31 itojun ip->ip_len = htons(sizeof(struct ip) + IGMP_MINLEN);
540 1.31 itojun ip->ip_off = htons(0);
541 1.1 hpeyerl ip->ip_p = IPPROTO_IGMP;
542 1.16 mycroft ip->ip_src = zeroin_addr;
543 1.1 hpeyerl ip->ip_dst = inm->inm_addr;
544 1.1 hpeyerl
545 1.7 brezak m->m_data += sizeof(struct ip);
546 1.7 brezak m->m_len -= sizeof(struct ip);
547 1.7 brezak igmp = mtod(m, struct igmp *);
548 1.10 mycroft igmp->igmp_type = type;
549 1.1 hpeyerl igmp->igmp_code = 0;
550 1.1 hpeyerl igmp->igmp_group = inm->inm_addr;
551 1.1 hpeyerl igmp->igmp_cksum = 0;
552 1.1 hpeyerl igmp->igmp_cksum = in_cksum(m, IGMP_MINLEN);
553 1.7 brezak m->m_data -= sizeof(struct ip);
554 1.7 brezak m->m_len += sizeof(struct ip);
555 1.1 hpeyerl
556 1.10 mycroft imo.imo_multicast_ifp = inm->inm_ifp;
557 1.10 mycroft imo.imo_multicast_ttl = 1;
558 1.10 mycroft #ifdef RSVP_ISI
559 1.10 mycroft imo.imo_multicast_vif = -1;
560 1.10 mycroft #endif
561 1.1 hpeyerl /*
562 1.1 hpeyerl * Request loopback of the report if we are acting as a multicast
563 1.1 hpeyerl * router, so that the process-level routing demon can hear it.
564 1.1 hpeyerl */
565 1.1 hpeyerl #ifdef MROUTING
566 1.10 mycroft imo.imo_multicast_loop = (ip_mrouter != NULL);
567 1.10 mycroft #else
568 1.10 mycroft imo.imo_multicast_loop = 0;
569 1.10 mycroft #endif /* MROUTING */
570 1.10 mycroft
571 1.10 mycroft ip_output(m, (struct mbuf *)0, (struct route *)0, IP_MULTICASTOPTS,
572 1.10 mycroft &imo);
573 1.1 hpeyerl
574 1.1 hpeyerl ++igmpstat.igps_snd_reports;
575 1.1 hpeyerl }
576