igmp_var.h revision 2169 
1/*
2 * Copyright (c) 1988 Stephen Deering.
3 * Copyright (c) 1992, 1993
4 *	The Regents of the University of California.  All rights reserved.
5 *
6 * This code is derived from software contributed to Berkeley by
7 * Stephen Deering of Stanford University.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
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 * 3. All advertising materials mentioning features or use of this software
18 *    must display the following acknowledgement:
19 *	This product includes software developed by the University of
20 *	California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 *    may be used to endorse or promote products derived from this software
23 *    without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 *
37 *	@(#)igmp_var.h	8.1 (Berkeley) 7/19/93
38 * $Id: igmp_var.h,v 1.2 1994/08/02 07:48:09 davidg Exp $
39 */
40
41#ifndef _NETINET_IGMP_VAR_H_
42#define _NETINET_IGMP_VAR_H_
43
44/*
45 * Internet Group Management Protocol (IGMP),
46 * implementation-specific definitions.
47 *
48 * Written by Steve Deering, Stanford, May 1988.
49 *
50 * MULTICAST 1.1
51 */
52
53struct igmpstat {
54	u_long	igps_rcv_total;		/* total IGMP messages received */
55	u_long	igps_rcv_tooshort;	/* received with too few bytes */
56	u_long	igps_rcv_badsum;	/* received with bad checksum */
57	u_long	igps_rcv_queries;	/* received membership queries */
58	u_long	igps_rcv_badqueries;	/* received invalid queries */
59	u_long	igps_rcv_reports;	/* received membership reports */
60	u_long	igps_rcv_badreports;	/* received invalid reports */
61	u_long	igps_rcv_ourreports;	/* received reports for our groups */
62	u_long	igps_snd_reports;	/* sent membership reports */
63};
64
65#ifdef KERNEL
66struct igmpstat igmpstat;
67
68/*
69 * Macro to compute a random timer value between 1 and (IGMP_MAX_REPORTING_
70 * DELAY * countdown frequency).  We generate a "random" number by adding
71 * the total number of IP packets received, our primary IP address, and the
72 * multicast address being timed-out.  The 4.3 random() routine really
73 * ought to be available in the kernel!
74 */
75#define IGMP_RANDOM_DELAY(multiaddr) \
76	/* struct in_addr multiaddr; */ \
77	( (ipstat.ips_total + \
78	   ntohl(IA_SIN(in_ifaddr)->sin_addr.s_addr) + \
79	   ntohl((multiaddr).s_addr) \
80	  ) \
81	  % (IGMP_MAX_HOST_REPORT_DELAY * PR_FASTHZ) + 1 \
82	)
83
84void	igmp_init __P(());
85void	igmp_input __P((struct mbuf *, int));
86void	igmp_joingroup __P((struct in_multi *));
87void	igmp_leavegroup __P((struct in_multi *));
88void	igmp_fasttimo __P(());
89#endif
90
91#endif
92