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.7 2004/12/28 08:09:59 hsu 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/systm.h> 46 #include <vm/vm_zone.h> 47 48 /* 49 * System initialization 50 * 51 * Note: domain initialization wants to take place on a per domain basis 52 * as a result of traversing a linker set. Most likely, each domain 53 * want to call a registration function rather than being handled here 54 * in domaininit(). Probably this will look like: 55 * 56 * SYSINIT(unique, SI_SUB_PROTO_DOMAIN, SI_ORDER_ANY, domain_add, xxx) 57 * 58 * Where 'xxx' is replaced by the address of a parameter struct to be 59 * passed to the doamin_add() function. 60 */ 61 62 static void domaininit (void *); 63 SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL) 64 65 static void pffasttimo (void *); 66 static void pfslowtimo (void *); 67 68 struct domain *domains; 69 70 static struct callout pffasttimo_ch; 71 static struct callout pfslowtimo_ch; 72 73 /* 74 * Add a new protocol domain to the list of supported domains 75 * Note: you cant unload it again because a socket may be using it. 76 * XXX can't fail at this time. 77 */ 78 static void 79 net_init_domain(struct domain *dp) 80 { 81 struct protosw *pr; 82 int s; 83 84 s = splnet(); 85 if (dp->dom_init) 86 (*dp->dom_init)(); 87 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) { 88 if (pr->pr_usrreqs == NULL) 89 panic("domaininit: %ssw[%d] has no usrreqs!", 90 dp->dom_name, pr - dp->dom_protosw); 91 if (pr->pr_init) 92 (*pr->pr_init)(); 93 } 94 /* 95 * update global informatio about maximums 96 */ 97 max_hdr = max_linkhdr + max_protohdr; 98 max_datalen = MHLEN - max_hdr; 99 splx(s); 100 } 101 102 /* 103 * Add a new protocol domain to the list of supported domains 104 * Note: you cant unload it again because a socket may be using it. 105 * XXX can't fail at this time. 106 */ 107 void 108 net_add_domain(void *data) 109 { 110 int s; 111 struct domain *dp; 112 113 dp = (struct domain *)data; 114 s = splnet(); 115 dp->dom_next = domains; 116 domains = dp; 117 splx(s); 118 net_init_domain(dp); 119 } 120 121 /* ARGSUSED*/ 122 static void 123 domaininit(void *dummy) 124 { 125 /* 126 * Before we do any setup, make sure to initialize the 127 * zone allocator we get struct sockets from. The obvious 128 * maximum number of sockets is `maxfiles', but it is possible 129 * to have a socket without an open file (e.g., a connection waiting 130 * to be accept(2)ed). Rather than think up and define a 131 * better value, we just use nmbclusters, since that's what people 132 * are told to increase first when the network runs out of memory. 133 * Perhaps we should have two pools, one of unlimited size 134 * for use during socreate(), and one ZONE_INTERRUPT pool for 135 * use in sonewconn(). 136 */ 137 socket_zone = zinit("socket", sizeof(struct socket), maxsockets, 138 ZONE_INTERRUPT, 0); 139 140 if (max_linkhdr < 16) /* XXX */ 141 max_linkhdr = 16; 142 143 callout_init(&pffasttimo_ch); 144 callout_init(&pfslowtimo_ch); 145 callout_reset(&pffasttimo_ch, 1, pffasttimo, NULL); 146 callout_reset(&pfslowtimo_ch, 1, pfslowtimo, NULL); 147 } 148 149 150 struct protosw * 151 pffindtype(int family, int type) 152 { 153 struct domain *dp; 154 struct protosw *pr; 155 156 for (dp = domains; dp; dp = dp->dom_next) 157 if (dp->dom_family == family) 158 goto found; 159 return (NULL); 160 161 found: 162 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 163 if (pr->pr_type && pr->pr_type == type) 164 return (pr); 165 return (NULL); 166 } 167 168 struct protosw * 169 pffindproto(int family, int protocol, int type) 170 { 171 struct domain *dp; 172 struct protosw *pr; 173 struct protosw *maybe = NULL; 174 175 if (family == 0) 176 return (NULL); 177 for (dp = domains; dp; dp = dp->dom_next) 178 if (dp->dom_family == family) 179 goto found; 180 return (NULL); 181 182 found: 183 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) { 184 if ((pr->pr_protocol == protocol) && (pr->pr_type == type)) 185 return (pr); 186 187 if (type == SOCK_RAW && pr->pr_type == SOCK_RAW && 188 pr->pr_protocol == 0 && maybe == (struct protosw *)NULL) 189 maybe = pr; 190 } 191 return (maybe); 192 } 193 194 void 195 pfctlinput(int cmd, struct sockaddr *sa) 196 { 197 struct domain *dp; 198 struct protosw *pr; 199 200 for (dp = domains; dp; dp = dp->dom_next) 201 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 202 if (pr->pr_ctlinput) 203 (*pr->pr_ctlinput)(cmd, sa, (void *)NULL); 204 } 205 206 void 207 pfctlinput2(int cmd, struct sockaddr *sa, void *ctlparam) 208 { 209 struct domain *dp; 210 struct protosw *pr; 211 212 if (!sa) 213 return; 214 for (dp = domains; dp; dp = dp->dom_next) { 215 /* 216 * the check must be made by xx_ctlinput() anyways, to 217 * make sure we use data item pointed to by ctlparam in 218 * correct way. the following check is made just for safety. 219 */ 220 if (dp->dom_family != sa->sa_family) 221 continue; 222 223 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 224 if (pr->pr_ctlinput) 225 (*pr->pr_ctlinput)(cmd, sa, ctlparam); 226 } 227 } 228 229 static void 230 pfslowtimo(void *arg) 231 { 232 struct domain *dp; 233 struct protosw *pr; 234 235 for (dp = domains; dp; dp = dp->dom_next) 236 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 237 if (pr->pr_slowtimo) 238 (*pr->pr_slowtimo)(); 239 callout_reset(&pfslowtimo_ch, hz / 2, pfslowtimo, NULL); 240 } 241 242 static void 243 pffasttimo(void *arg) 244 { 245 struct domain *dp; 246 struct protosw *pr; 247 248 for (dp = domains; dp; dp = dp->dom_next) 249 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 250 if (pr->pr_fasttimo) 251 (*pr->pr_fasttimo)(); 252 callout_reset(&pffasttimo_ch, hz / 5, pffasttimo, NULL); 253 } 254