1 /* 2 * Copyright (c) 1982, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 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 * @(#)uipc_domain.c 8.2 (Berkeley) 10/18/93 34 * $FreeBSD: src/sys/kern/uipc_domain.c,v 1.22.2.1 2001/07/03 11:01:37 ume Exp $ 35 * $DragonFly: src/sys/kern/uipc_domain.c,v 1.13 2008/10/27 02:56:30 sephe Exp $ 36 */ 37 38 #include <sys/param.h> 39 #include <sys/socket.h> 40 #include <sys/protosw.h> 41 #include <sys/domain.h> 42 #include <sys/mbuf.h> 43 #include <sys/kernel.h> 44 #include <sys/socketvar.h> 45 #include <sys/socketops.h> 46 #include <sys/systm.h> 47 #include <vm/vm_zone.h> 48 49 #include <sys/thread2.h> 50 51 /* 52 * System initialization 53 * 54 * Note: domain initialization wants to take place on a per domain basis 55 * as a result of traversing a linker set. Most likely, each domain 56 * want to call a registration function rather than being handled here 57 * in domaininit(). Probably this will look like: 58 * 59 * SYSINIT(unique, SI_SUB_PROTO_DOMAIN, SI_ORDER_ANY, domain_add, xxx) 60 * 61 * Where 'xxx' is replaced by the address of a parameter struct to be 62 * passed to the doamin_add() function. 63 */ 64 65 static void domaininit (void *); 66 SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL) 67 68 static void pffasttimo (void *); 69 static void pfslowtimo (void *); 70 71 struct domainlist domains; 72 73 static struct callout pffasttimo_ch; 74 static struct callout pfslowtimo_ch; 75 76 /* 77 * Add a new protocol domain to the list of supported domains 78 * Note: you cant unload it again because a socket may be using it. 79 * XXX can't fail at this time. 80 */ 81 static void 82 net_init_domain(struct domain *dp) 83 { 84 struct protosw *pr; 85 86 crit_enter(); 87 if (dp->dom_init) 88 (*dp->dom_init)(); 89 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) { 90 if (pr->pr_usrreqs == NULL) 91 panic("domaininit: %ssw[%d] has no usrreqs!", 92 dp->dom_name, pr - dp->dom_protosw); 93 if (pr->pr_init) 94 (*pr->pr_init)(); 95 } 96 /* 97 * update global information about maximums 98 */ 99 max_hdr = max_linkhdr + max_protohdr; 100 max_datalen = MHLEN - max_hdr; 101 crit_exit(); 102 } 103 104 /* 105 * Add a new protocol domain to the list of supported domains 106 * Note: you cant unload it again because a socket may be using it. 107 * XXX can't fail at this time. 108 */ 109 void 110 net_add_domain(void *data) 111 { 112 struct domain *dp = data; 113 114 crit_enter(); 115 SLIST_INSERT_HEAD(&domains, dp, dom_next); 116 crit_exit(); 117 net_init_domain(dp); 118 } 119 120 /* ARGSUSED*/ 121 static void 122 domaininit(void *dummy) 123 { 124 if (max_linkhdr < 16) /* XXX */ 125 max_linkhdr = 16; 126 127 callout_init(&pffasttimo_ch); 128 callout_init(&pfslowtimo_ch); 129 callout_reset(&pffasttimo_ch, 1, pffasttimo, NULL); 130 callout_reset(&pfslowtimo_ch, 1, pfslowtimo, NULL); 131 } 132 133 134 struct protosw * 135 pffindtype(int family, int type) 136 { 137 struct domain *dp; 138 struct protosw *pr; 139 140 SLIST_FOREACH(dp, &domains, dom_next) 141 if (dp->dom_family == family) 142 goto found; 143 return (NULL); 144 145 found: 146 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 147 if (pr->pr_type && pr->pr_type == type) 148 return (pr); 149 return (NULL); 150 } 151 152 struct protosw * 153 pffindproto(int family, int protocol, int type) 154 { 155 struct domain *dp; 156 struct protosw *pr; 157 struct protosw *maybe = NULL; 158 159 if (family == 0) 160 return (NULL); 161 SLIST_FOREACH(dp, &domains, dom_next) 162 if (dp->dom_family == family) 163 goto found; 164 return (NULL); 165 166 found: 167 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) { 168 if ((pr->pr_protocol == protocol) && (pr->pr_type == type)) 169 return (pr); 170 171 if (type == SOCK_RAW && pr->pr_type == SOCK_RAW && 172 pr->pr_protocol == 0 && maybe == (struct protosw *)NULL) 173 maybe = pr; 174 } 175 return (maybe); 176 } 177 178 void 179 kpfctlinput(int cmd, struct sockaddr *sa) 180 { 181 struct domain *dp; 182 struct protosw *pr; 183 184 SLIST_FOREACH(dp, &domains, dom_next) { 185 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 186 so_pru_ctlinput(pr, cmd, sa, NULL); 187 } 188 } 189 190 void 191 kpfctlinput2(int cmd, struct sockaddr *sa, void *ctlparam) 192 { 193 struct domain *dp; 194 struct protosw *pr; 195 196 if (!sa) 197 return; 198 SLIST_FOREACH(dp, &domains, dom_next) { 199 /* 200 * the check must be made by xx_ctlinput() anyways, to 201 * make sure we use data item pointed to by ctlparam in 202 * correct way. the following check is made just for safety. 203 */ 204 if (dp->dom_family != sa->sa_family) 205 continue; 206 207 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 208 so_pru_ctlinput(pr, cmd, sa, ctlparam); 209 } 210 } 211 212 static void 213 pfslowtimo(void *arg) 214 { 215 struct domain *dp; 216 struct protosw *pr; 217 218 SLIST_FOREACH(dp, &domains, dom_next) 219 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 220 if (pr->pr_slowtimo) 221 (*pr->pr_slowtimo)(); 222 callout_reset(&pfslowtimo_ch, hz / 2, pfslowtimo, NULL); 223 } 224 225 static void 226 pffasttimo(void *arg) 227 { 228 struct domain *dp; 229 struct protosw *pr; 230 231 SLIST_FOREACH(dp, &domains, dom_next) 232 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 233 if (pr->pr_fasttimo) 234 (*pr->pr_fasttimo)(); 235 callout_reset(&pffasttimo_ch, hz / 5, pffasttimo, NULL); 236 } 237