igmp_var.h revision 1.13 1 1.13 itojun /* $NetBSD: igmp_var.h,v 1.13 2002/05/29 01:33:45 itojun Exp $ */
2 1.6 cgd
3 1.1 hpeyerl /*
4 1.1 hpeyerl * Copyright (c) 1988 Stephen Deering.
5 1.5 mycroft * Copyright (c) 1992, 1993
6 1.5 mycroft * The Regents of the University of California. All rights reserved.
7 1.1 hpeyerl *
8 1.1 hpeyerl * This code is derived from software contributed to Berkeley by
9 1.1 hpeyerl * Stephen Deering of Stanford University.
10 1.1 hpeyerl *
11 1.1 hpeyerl * Redistribution and use in source and binary forms, with or without
12 1.1 hpeyerl * modification, are permitted provided that the following conditions
13 1.1 hpeyerl * are met:
14 1.1 hpeyerl * 1. Redistributions of source code must retain the above copyright
15 1.1 hpeyerl * notice, this list of conditions and the following disclaimer.
16 1.1 hpeyerl * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 hpeyerl * notice, this list of conditions and the following disclaimer in the
18 1.1 hpeyerl * documentation and/or other materials provided with the distribution.
19 1.1 hpeyerl * 3. All advertising materials mentioning features or use of this software
20 1.1 hpeyerl * must display the following acknowledgement:
21 1.1 hpeyerl * This product includes software developed by the University of
22 1.1 hpeyerl * California, Berkeley and its contributors.
23 1.1 hpeyerl * 4. Neither the name of the University nor the names of its contributors
24 1.1 hpeyerl * may be used to endorse or promote products derived from this software
25 1.1 hpeyerl * without specific prior written permission.
26 1.1 hpeyerl *
27 1.1 hpeyerl * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 1.1 hpeyerl * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 1.1 hpeyerl * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 1.1 hpeyerl * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 1.1 hpeyerl * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 1.1 hpeyerl * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 1.1 hpeyerl * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 1.1 hpeyerl * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 1.1 hpeyerl * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 1.1 hpeyerl * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 1.1 hpeyerl * SUCH DAMAGE.
38 1.1 hpeyerl *
39 1.6 cgd * @(#)igmp_var.h 8.1 (Berkeley) 7/19/93
40 1.1 hpeyerl */
41 1.1 hpeyerl
42 1.10 perry #ifndef _NETINET_IGMP_VAR_H_
43 1.10 perry #define _NETINET_IGMP_VAR_H_
44 1.10 perry
45 1.1 hpeyerl /*
46 1.1 hpeyerl * Internet Group Management Protocol (IGMP),
47 1.1 hpeyerl * implementation-specific definitions.
48 1.1 hpeyerl *
49 1.1 hpeyerl * Written by Steve Deering, Stanford, May 1988.
50 1.8 mycroft * Modified by Rosen Sharma, Stanford, Aug 1994.
51 1.8 mycroft * Modified by Bill Fenner, Xerox PARC, Feb 1995.
52 1.1 hpeyerl *
53 1.8 mycroft * MULTICAST 1.3
54 1.1 hpeyerl */
55 1.1 hpeyerl
56 1.1 hpeyerl struct igmpstat {
57 1.11 bouyer u_quad_t igps_rcv_total; /* total IGMP messages received */
58 1.11 bouyer u_quad_t igps_rcv_tooshort; /* received with too few bytes */
59 1.11 bouyer u_quad_t igps_rcv_badsum; /* received with bad checksum */
60 1.11 bouyer u_quad_t igps_rcv_queries; /* received membership queries */
61 1.11 bouyer u_quad_t igps_rcv_badqueries; /* received invalid queries */
62 1.11 bouyer u_quad_t igps_rcv_reports; /* received membership reports */
63 1.11 bouyer u_quad_t igps_rcv_badreports; /* received invalid reports */
64 1.11 bouyer u_quad_t igps_rcv_ourreports; /* received reports for our groups */
65 1.11 bouyer u_quad_t igps_snd_reports; /* sent membership reports */
66 1.1 hpeyerl };
67 1.1 hpeyerl
68 1.7 jtc #ifdef _KERNEL
69 1.12 matt extern struct igmpstat igmpstat;
70 1.1 hpeyerl
71 1.1 hpeyerl /*
72 1.1 hpeyerl * Macro to compute a random timer value between 1 and (IGMP_MAX_REPORTING_
73 1.1 hpeyerl * DELAY * countdown frequency). We assume that the routine random()
74 1.1 hpeyerl * is defined somewhere (and that it returns a positive number).
75 1.1 hpeyerl */
76 1.13 itojun #define IGMP_RANDOM_DELAY(X) (arc4random() % (X) + 1)
77 1.1 hpeyerl
78 1.3 mycroft void igmp_init __P((void));
79 1.9 christos void igmp_input __P((struct mbuf *, ...));
80 1.1 hpeyerl void igmp_joingroup __P((struct in_multi *));
81 1.1 hpeyerl void igmp_leavegroup __P((struct in_multi *));
82 1.3 mycroft void igmp_fasttimo __P((void));
83 1.8 mycroft void igmp_slowtimo __P((void));
84 1.1 hpeyerl #endif
85 1.10 perry
86 1.10 perry #endif /* _NETINET_IGMP_VAR_H_ */
87