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 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * from: @(#)igmp_var.h 8.1 (Berkeley) 7/19/93 34 * $FreeBSD$ 35 */ 36 37 #ifndef _NETINET_IGMP_VAR_H_ 38 #define _NETINET_IGMP_VAR_H_ 39 40 /* 41 * Internet Group Management Protocol (IGMP), 42 * implementation-specific definitions. 43 * 44 * Written by Steve Deering, Stanford, May 1988. 45 * 46 * MULTICAST Revision: 3.5.1.3 47 */ 48 49 struct igmpstat { 50 u_int igps_rcv_total; /* total IGMP messages received */ 51 u_int igps_rcv_tooshort; /* received with too few bytes */ 52 u_int igps_rcv_badsum; /* received with bad checksum */ 53 u_int igps_rcv_queries; /* received membership queries */ 54 u_int igps_rcv_badqueries; /* received invalid queries */ 55 u_int igps_rcv_reports; /* received membership reports */ 56 u_int igps_rcv_badreports; /* received invalid reports */ 57 u_int igps_rcv_ourreports; /* received reports for our groups */ 58 u_int igps_snd_reports; /* sent membership reports */ 59 }; 60 61 #ifdef _KERNEL 62 #define IGMP_RANDOM_DELAY(X) (random() % (X) + 1) 63 64 /* 65 * States for IGMPv2's leave processing 66 */ 67 #define IGMP_OTHERMEMBER 0 68 #define IGMP_IREPORTEDLAST 1 69 70 /* 71 * We must remember what version the subnet's querier is. 72 * We conveniently use the IGMP message type for the proper 73 * membership report to keep this state. 74 */ 75 #define IGMP_V1_ROUTER IGMP_V1_MEMBERSHIP_REPORT 76 #define IGMP_V2_ROUTER IGMP_V2_MEMBERSHIP_REPORT 77 78 /* 79 * Revert to new router if we haven't heard from an old router in 80 * this amount of time. 81 */ 82 #define IGMP_AGE_THRESHOLD 540 83 84 void igmp_init(void); 85 void igmp_input(struct mbuf *, int); 86 void igmp_joingroup(struct in_multi *); 87 void igmp_leavegroup(struct in_multi *); 88 void igmp_fasttimo(void); 89 void igmp_slowtimo(void); 90 91 SYSCTL_DECL(_net_inet_igmp); 92 93 #endif 94 95 /* 96 * Names for IGMP sysctl objects 97 */ 98 #define IGMPCTL_STATS 1 /* statistics (read-only) */ 99 #define IGMPCTL_MAXID 2 100 101 #define IGMPCTL_NAMES { \ 102 { 0, 0 }, \ 103 { "stats", CTLTYPE_STRUCT }, \ 104 } 105 #endif 106