| 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 | * from: @(#)igmp_var.h 8.1 (Berkeley) 7/19/93
|
|---|
| 38 | * $FreeBSD: src/sys/netinet/igmp_var.h,v 1.17 1999/12/29 04:40:59 peter Exp $
|
|---|
| 39 | */
|
|---|
| 40 |
|
|---|
| 41 | #ifndef _NETINET_IGMP_VAR_H_
|
|---|
| 42 | #define _NETINET_IGMP_VAR_H_
|
|---|
| 43 |
|
|---|
| 44 | #ifndef TCPV40HDRS
|
|---|
| 45 |
|
|---|
| 46 | /*
|
|---|
| 47 | * Internet Group Management Protocol (IGMP),
|
|---|
| 48 | * implementation-specific definitions.
|
|---|
| 49 | *
|
|---|
| 50 | * Written by Steve Deering, Stanford, May 1988.
|
|---|
| 51 | *
|
|---|
| 52 | * MULTICAST Revision: 3.5.1.3
|
|---|
| 53 | */
|
|---|
| 54 |
|
|---|
| 55 | struct igmpstat {
|
|---|
| 56 | u_int igps_rcv_total; /* total IGMP messages received */
|
|---|
| 57 | u_int igps_rcv_tooshort; /* received with too few bytes */
|
|---|
| 58 | u_int igps_rcv_badsum; /* received with bad checksum */
|
|---|
| 59 | u_int igps_rcv_queries; /* received membership queries */
|
|---|
| 60 | u_int igps_rcv_badqueries; /* received invalid queries */
|
|---|
| 61 | u_int igps_rcv_reports; /* received membership reports */
|
|---|
| 62 | u_int igps_rcv_badreports; /* received invalid reports */
|
|---|
| 63 | u_int igps_rcv_ourreports; /* received reports for our groups */
|
|---|
| 64 | u_int igps_snd_reports; /* sent membership reports */
|
|---|
| 65 | };
|
|---|
| 66 |
|
|---|
| 67 | #if 0 /* not on OS/2 */
|
|---|
| 68 | #ifdef _KERNEL
|
|---|
| 69 | #define IGMP_RANDOM_DELAY(X) (random() % (X) + 1)
|
|---|
| 70 |
|
|---|
| 71 | /*
|
|---|
| 72 | * States for IGMPv2's leave processing
|
|---|
| 73 | */
|
|---|
| 74 | #define IGMP_OTHERMEMBER 0
|
|---|
| 75 | #define IGMP_IREPORTEDLAST 1
|
|---|
| 76 |
|
|---|
| 77 | /*
|
|---|
| 78 | * We must remember what version the subnet's querier is.
|
|---|
| 79 | * We conveniently use the IGMP message type for the proper
|
|---|
| 80 | * membership report to keep this state.
|
|---|
| 81 | */
|
|---|
| 82 | #define IGMP_V1_ROUTER IGMP_V1_MEMBERSHIP_REPORT
|
|---|
| 83 | #define IGMP_V2_ROUTER IGMP_V2_MEMBERSHIP_REPORT
|
|---|
| 84 |
|
|---|
| 85 | /*
|
|---|
| 86 | * Revert to new router if we haven't heard from an old router in
|
|---|
| 87 | * this amount of time.
|
|---|
| 88 | */
|
|---|
| 89 | #define IGMP_AGE_THRESHOLD 540
|
|---|
| 90 |
|
|---|
| 91 | void igmp_init __P((void));
|
|---|
| 92 | void igmp_input __P((struct mbuf *, int, int));
|
|---|
| 93 | void igmp_joingroup __P((struct in_multi *));
|
|---|
| 94 | void igmp_leavegroup __P((struct in_multi *));
|
|---|
| 95 | void igmp_fasttimo __P((void));
|
|---|
| 96 | void igmp_slowtimo __P((void));
|
|---|
| 97 |
|
|---|
| 98 | SYSCTL_DECL(_net_inet_igmp);
|
|---|
| 99 |
|
|---|
| 100 | #endif /*_KERNEL*/
|
|---|
| 101 |
|
|---|
| 102 | /*
|
|---|
| 103 | * Names for IGMP sysctl objects
|
|---|
| 104 | */
|
|---|
| 105 | #define IGMPCTL_STATS 1 /* statistics (read-only) */
|
|---|
| 106 | #define IGMPCTL_MAXID 2
|
|---|
| 107 |
|
|---|
| 108 | #define IGMPCTL_NAMES { \
|
|---|
| 109 | { 0, 0 }, \
|
|---|
| 110 | { "stats", CTLTYPE_STRUCT }, \
|
|---|
| 111 | }
|
|---|
| 112 | #endif /*0*/
|
|---|
| 113 |
|
|---|
| 114 | #endif /* !TCPV40HDRS */
|
|---|
| 115 | #endif
|
|---|
