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 #define PRU_NOTSUPP(pu, label) \ 82 if (pu->pru_ ## label == NULL) \ 83 pu->pru_ ## label = pru_ ## label ## _notsupp; 84 #define PRU_NULL(pu, label) \ 85 if (pu->pru_ ## label == NULL) \ 86 pu->pru_ ## label = pru_ ## label ## _null; 87 88 static void 89 net_init_domain(struct domain *dp) 90 { 91 struct protosw *pr; 92 struct pr_usrreqs *pu; 93 94 crit_enter(); 95 if (dp->dom_init) 96 (*dp->dom_init)(); 97 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) { 98 pu = pr->pr_usrreqs; 99 if (pu == NULL) 100 panic("domaininit: %ssw[%ld] has no usrreqs!", 101 dp->dom_name, (long)(pr - dp->dom_protosw)); 102 PRU_NOTSUPP(pu, accept); 103 PRU_NOTSUPP(pu, bind); 104 PRU_NOTSUPP(pu, connect); 105 PRU_NOTSUPP(pu, connect2); 106 PRU_NOTSUPP(pu, control); 107 PRU_NOTSUPP(pu, disconnect); 108 PRU_NOTSUPP(pu, listen); 109 PRU_NOTSUPP(pu, peeraddr); 110 PRU_NOTSUPP(pu, rcvd); 111 PRU_NOTSUPP(pu, rcvoob); 112 PRU_NULL(pu, sense); 113 PRU_NOTSUPP(pu, shutdown); 114 PRU_NOTSUPP(pu, sockaddr); 115 PRU_NOTSUPP(pu, sosend); 116 PRU_NOTSUPP(pu, soreceive); 117 PRU_NOTSUPP(pu, ctloutput); 118 119 if (pr->pr_init) 120 (*pr->pr_init)(); 121 } 122 /* 123 * update global information about maximums 124 */ 125 max_hdr = max_linkhdr + max_protohdr; 126 max_datalen = MHLEN - max_hdr; 127 crit_exit(); 128 } 129 130 /* 131 * Add a new protocol domain to the list of supported domains 132 * Note: you cant unload it again because a socket may be using it. 133 * XXX can't fail at this time. 134 */ 135 void 136 net_add_domain(void *data) 137 { 138 struct domain *dp = data; 139 140 crit_enter(); 141 SLIST_INSERT_HEAD(&domains, dp, dom_next); 142 crit_exit(); 143 net_init_domain(dp); 144 } 145 146 /* ARGSUSED*/ 147 static void 148 domaininit(void *dummy) 149 { 150 if (max_linkhdr < 16) /* XXX */ 151 max_linkhdr = 16; 152 153 callout_init(&pffasttimo_ch); 154 callout_init(&pfslowtimo_ch); 155 callout_reset(&pffasttimo_ch, 1, pffasttimo, NULL); 156 callout_reset(&pfslowtimo_ch, 1, pfslowtimo, NULL); 157 } 158 159 160 struct protosw * 161 pffindtype(int family, int type) 162 { 163 struct domain *dp; 164 struct protosw *pr; 165 166 SLIST_FOREACH(dp, &domains, dom_next) 167 if (dp->dom_family == family) 168 goto found; 169 return (NULL); 170 171 found: 172 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 173 if (pr->pr_type && pr->pr_type == type) 174 return (pr); 175 return (NULL); 176 } 177 178 struct protosw * 179 pffindproto(int family, int protocol, int type) 180 { 181 struct domain *dp; 182 struct protosw *pr; 183 struct protosw *maybe = NULL; 184 185 if (family == 0) 186 return (NULL); 187 SLIST_FOREACH(dp, &domains, dom_next) 188 if (dp->dom_family == family) 189 goto found; 190 return (NULL); 191 192 found: 193 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) { 194 if ((pr->pr_protocol == protocol) && (pr->pr_type == type)) 195 return (pr); 196 197 if (type == SOCK_RAW && pr->pr_type == SOCK_RAW && 198 pr->pr_protocol == 0 && maybe == NULL) 199 maybe = pr; 200 } 201 return (maybe); 202 } 203 204 void 205 kpfctlinput(int cmd, struct sockaddr *sa) 206 { 207 struct domain *dp; 208 struct protosw *pr; 209 210 SLIST_FOREACH(dp, &domains, dom_next) { 211 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 212 so_pru_ctlinput(pr, cmd, sa, NULL); 213 } 214 } 215 216 void 217 kpfctlinput2(int cmd, struct sockaddr *sa, void *ctlparam) 218 { 219 struct domain *dp; 220 struct protosw *pr; 221 222 if (!sa) 223 return; 224 SLIST_FOREACH(dp, &domains, dom_next) { 225 /* 226 * the check must be made by xx_ctlinput() anyways, to 227 * make sure we use data item pointed to by ctlparam in 228 * correct way. the following check is made just for safety. 229 */ 230 if (dp->dom_family != sa->sa_family) 231 continue; 232 233 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 234 so_pru_ctlinput(pr, cmd, sa, ctlparam); 235 } 236 } 237 238 static void 239 pfslowtimo(void *arg) 240 { 241 struct domain *dp; 242 struct protosw *pr; 243 244 SLIST_FOREACH(dp, &domains, dom_next) 245 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 246 if (pr->pr_slowtimo) 247 (*pr->pr_slowtimo)(); 248 callout_reset(&pfslowtimo_ch, hz / 2, pfslowtimo, NULL); 249 } 250 251 static void 252 pffasttimo(void *arg) 253 { 254 struct domain *dp; 255 struct protosw *pr; 256 257 SLIST_FOREACH(dp, &domains, dom_next) 258 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 259 if (pr->pr_fasttimo) 260 (*pr->pr_fasttimo)(); 261 callout_reset(&pffasttimo_ch, hz / 5, pffasttimo, NULL); 262 } 263