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