git.saurik.com Git - apple/xnu.git/blame_incremental

... / ...

Commit	Line	Data
	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	* from: @(#)igmp_var.h 8.1 (Berkeley) 7/19/93
	59	*/
	60
	61	#ifndef _NETINET_IGMP_VAR_H_
	62	#define _NETINET_IGMP_VAR_H_
	63	#include <sys/appleapiopts.h>
	64
	65
	66	/*
	67	* Internet Group Management Protocol (IGMP),
	68	* implementation-specific definitions.
	69	*
	70	* Written by Steve Deering, Stanford, May 1988.
	71	*
	72	* MULTICAST Revision: 3.5.1.3
	73	*/
	74
	75	struct igmpstat {
	76	u_int igps_rcv_total; /* total IGMP messages received */
	77	u_int igps_rcv_tooshort; /* received with too few bytes */
	78	u_int igps_rcv_badsum; /* received with bad checksum */
	79	u_int igps_rcv_queries; /* received membership queries */
	80	u_int igps_rcv_badqueries; /* received invalid queries */
	81	u_int igps_rcv_reports; /* received membership reports */
	82	u_int igps_rcv_badreports; /* received invalid reports */
	83	u_int igps_rcv_ourreports; /* received reports for our groups */
	84	u_int igps_snd_reports; /* sent membership reports */
	85	};
	86
	87	#ifdef KERNEL_PRIVATE
	88	#ifdef KERNEL
	89	#define IGMP_RANDOM_DELAY(X) (random() % (X) + 1)
	90
	91	/*
	92	* States for IGMPv2's leave processing
	93	*/
	94	#define IGMP_OTHERMEMBER 0
	95	#define IGMP_IREPORTEDLAST 1
	96
	97	/*
	98	* We must remember what version the subnet's querier is.
	99	* We conveniently use the IGMP message type for the proper
	100	* membership report to keep this state.
	101	*/
	102	#define IGMP_V1_ROUTER IGMP_V1_MEMBERSHIP_REPORT
	103	#define IGMP_V2_ROUTER IGMP_V2_MEMBERSHIP_REPORT
	104
	105	/*
	106	* Revert to new router if we haven't heard from an old router in
	107	* this amount of time.
	108	*/
	109	#define IGMP_AGE_THRESHOLD 540
	110
	111	void igmp_init(void);
	112	void igmp_input(struct mbuf *, int);
	113	int igmp_joingroup(struct in_multi *);
	114	void igmp_leavegroup(struct in_multi *);
	115	void igmp_fasttimo(void);
	116	void igmp_slowtimo(void);
	117
	118	SYSCTL_DECL(_net_inet_igmp);
	119
	120	#endif /* KERNEL */
	121	#endif /* KERNEL_PRIVATE */
	122
	123	/*
	124	* Names for IGMP sysctl objects
	125	*/
	126	#define IGMPCTL_STATS 1 /* statistics (read-only) */
	127	#define IGMPCTL_MAXID 2
	128
	129	#ifdef KERNEL_PRIVATE
	130	#define IGMPCTL_NAMES { \
	131	{ 0, 0 }, \
	132	{ "stats", CTLTYPE_STRUCT }, \
	133	}
	134
	135	#endif /* KERNEL_PRIVATE */
	136	#endif