/* * Copyright (c) 2002 INRIA. All rights reserved. * * Implementation of Internet Group Management Protocol, Version 3. * Developed by Hitoshi Asaeda, INRIA, February 2002. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of INRIA nor the names of its contributors may be * used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include #include /* * Multicast source filters list per group address. */ LIST_HEAD(ias_head, in_addr_source); struct in_addr_source { struct sockaddr_in ias_addr; /* source address */ LIST_ENTRY(in_addr_source) ias_list; /* list of source addresses */ u_int ias_refcount; /* reference count of the source */ }; struct in_addr_slist { struct ias_head *head; /* head point of this list */ u_int16_t numsrc; /* num of sources of this list */ u_int mode; /* temporarily used in calculation */ }; struct in_multi_source { u_int ims_mode; /* current source filter mode */ u_int ims_grpjoin; /* (*,G) join request bit */ struct in_addr_slist *ims_cur; /* current filtered source list */ struct in_addr_slist *ims_rec; /* recorded source address list */ struct in_addr_slist *ims_in; /* include source address list */ /* struct in_addr_slist *ims_ex;*/ /* N/A: exclude source address list */ struct in_addr_slist *ims_alw; /* pending ALLOW source address */ struct in_addr_slist *ims_blk; /* pending BLOCK source address */ struct in_addr_slist *ims_toin; /* pending TO_IN source address */ struct in_addr_slist *ims_toex; /* pending TO_EX source address */ u_int ims_timer; /* state-change report timer */ u_int ims_robvar; /* robusutness var. of grp record */ }; #ifdef _KERNEL #define inmm_src inm->inm_source /* * Filter definition of State Change Report of IGMP/MLD, given from the state * change of current filter mode and new filter mode. */ #define REPORT_FILTER1 1 /* INCLUDE(A) -> INCLUDE(B) */ #define REPORT_FILTER2 2 /* EXCLUDE(A) -> EXCLUDE(B) */ #define REPORT_FILTER3 3 /* INCLUDE(A) -> EXCLUDE(B) */ #define REPORT_FILTER4 4 /* EXCLUDE(A) -> INCLUDE(B) */ #define IMS_ADD_SOURCE 1 /* request to add source to list */ #define IMS_DELETE_SOURCE 2 /* request to delete source to list */ #define IGMP_MSFON_OPS(optname) \ (((optname) == IP_ADD_SOURCE_MEMBERSHIP) || \ ((optname) == MCAST_JOIN_SOURCE_GROUP)) #define IGMP_MSFOFF_OPS(optname) \ (((optname) == IP_DROP_SOURCE_MEMBERSHIP) || \ ((optname) == MCAST_LEAVE_SOURCE_GROUP)) #define IMO_MSF_ALLOC(msf) do { \ (msf) = (struct sock_msf *) \ malloc(sizeof(struct sock_msf), \ M_IPMOPTS, M_NOWAIT); \ if ((msf) == NULL) { \ error = ENOBUFS; \ break; \ } \ (msf)->msf_head = (struct msf_head *) \ malloc(sizeof(struct msf_head), \ M_IPMOPTS, M_NOWAIT); \ if ((msf)->msf_head == NULL) { \ IMO_MSF_FREE((msf)); \ error = ENOBUFS; \ break; \ } \ LIST_INIT((msf)->msf_head); \ (msf)->msf_numsrc = 0; \ (msf)->msf_grpjoin = 0; \ } while (/*CONSTCOND*/ 0) #define IMO_MSF_FREE(msf) do { \ if ((msf)->msf_head != NULL) \ FREE((msf)->msf_head, M_IPMOPTS); \ if ((msf) != NULL) \ FREE((msf), M_IPMOPTS); \ } while (/*CONSTCOND*/ 0) /* * Macros for Protocol-Independent programming */ #define SIN(x) ((struct sockaddr_in *)(x)) #define SIN_ADDR(x) (SIN(x)->sin_addr.s_addr) #define SIN6(x) ((struct sockaddr_in6 *)(x)) #define SIN6_ADDR(x) (&(SIN6(x)->sin6_addr)) /* * Compares two sockaddrs; * Assuming both point to the same sockaddr_XX */ #define SS_IS_ADDR_MULTICAST(x) \ (((struct sockaddr *)(x))->sa_family == AF_INET ? \ (ntohl(SIN_ADDR(x)) >> 24) == 224 : \ /* the endian of IN_MULTICAST() arg varies OS by OS */ \ ((struct sockaddr *)(x))->sa_family == AF_INET6 ? \ IN6_IS_ADDR_MULTICAST(SIN6_ADDR(x)) : \ 0) #define SS_IS_ADDR_UNSPECIFIED(x) \ (((struct sockaddr *)(x))->sa_family == AF_INET ? \ (ntohl(SIN_ADDR(x)) == INADDR_ANY) : \ ((struct sockaddr *)(x))->sa_family == AF_INET6 ? \ IN6_IS_ADDR_UNSPECIFIED(SIN6_ADDR(x)) : \ 0) #define SS_COMPARE(a, op, b) \ (sa_compare((struct sockaddr *)(a), (struct sockaddr *)(b)) op 0) int in_addmultisrc(struct in_multi *, u_int, struct sockaddr_storage *); int in_delmultisrc(struct in_multi *, u_int, struct sockaddr_storage *); void in_undomultisrc(struct in_multi *, struct sockaddr_storage *, int); void in_free_all_msflist(struct in_multi *); void in_free_msflist(struct in_addr_slist *); void in_free_msfaddr(struct in_addr_slist *, struct sockaddr_in *); void in_clear_all_report(struct in_multi *); int in_merge_msfaddr(struct in_addr_slist *, struct sockaddr_in *, int); int in_getmoptlist(struct sock_msf *, u_int16_t *, struct sockaddr_storage **, u_int *); int in_setmoptaddr(struct sockaddr_storage *, struct sock_msf *, int); void in_freemoptlist(struct sock_msf *); void in_cleanmoptaddr(struct sock_msf *, int); void in_undomoptaddr(struct sock_msf *, int); int sa_compare(struct sockaddr *, struct sockaddr *); #endif /* _KERNEL */