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 * $Id: uipc_domain.c,v 1.9 1995/09/09 18:10:11 davidg Exp $ 35 */ 36 37 #include <sys/param.h> 38 #include <sys/socket.h> 39 #include <sys/protosw.h> 40 #include <sys/domain.h> 41 #include <sys/mbuf.h> 42 #include <sys/kernel.h> 43 #include <sys/systm.h> 44 45 /* 46 * System initialization 47 * 48 * Note: domain initialization wants to take place on a per domain basis 49 * as a result of traversing a linker set. Most likely, each domain 50 * want to call a registration function rather than being handled here 51 * in domaininit(). Probably this will look like: 52 * 53 * SYSINIT(unique, SI_SUB_PROTO_DOMAI, SI_ORDER_ANY, domain_add, xxx) 54 * 55 * Where 'xxx' is replaced by the address of a parameter struct to be 56 * passed to the doamin_add() function. 57 */ 58 59 static int x_save_spl; /* used by kludge*/ 60 static void kludge_splimp __P((void *)); 61 static void kludge_splx __P((void *)); 62 static void domaininit __P((void *)); 63 SYSINIT(splimp, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST, kludge_splimp, &x_save_spl) 64 SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL) 65 SYSINIT(splx, SI_SUB_PROTO_END, SI_ORDER_FIRST, kludge_splx, &x_save_spl) 66 67 68 static void pffasttimo __P((void *)); 69 static void pfslowtimo __P((void *)); 70 71 struct domain *domains; 72 73 #define ADDDOMAIN(x) { \ 74 __CONCAT(x,domain.dom_next) = domains; \ 75 domains = &__CONCAT(x,domain); \ 76 } 77 78 extern struct linker_set domain_set; 79 80 /* ARGSUSED*/ 81 static void 82 domaininit(udata) 83 void *udata; /* not used*/ 84 { 85 register struct domain *dp, **dpp; 86 register struct protosw *pr; 87 88 /* 89 * NB - local domain is always present. 90 */ 91 ADDDOMAIN(local); 92 93 for (dpp = (struct domain **)domain_set.ls_items; *dpp; dpp++) { 94 (**dpp).dom_next = domains; 95 domains = *dpp; 96 } 97 98 /* - not in our sources 99 #ifdef ISDN 100 ADDDOMAIN(isdn); 101 #endif 102 */ 103 104 for (dp = domains; dp; dp = dp->dom_next) { 105 if (dp->dom_init) 106 (*dp->dom_init)(); 107 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 108 if (pr->pr_init) 109 (*pr->pr_init)(); 110 } 111 112 if (max_linkhdr < 16) /* XXX */ 113 max_linkhdr = 16; 114 max_hdr = max_linkhdr + max_protohdr; 115 max_datalen = MHLEN - max_hdr; 116 timeout(pffasttimo, (void *)0, 1); 117 timeout(pfslowtimo, (void *)0, 1); 118 } 119 120 121 /* 122 * The following two operations are kludge code. Most likely, they should 123 * be done as a "domainpreinit()" for the first function and then rolled 124 * in as the last act of "domaininit()" for the second. 125 * 126 * In point of fact, it is questionable why other initialization prior 127 * to this does not also take place at splimp by default. 128 */ 129 static void 130 kludge_splimp(udata) 131 void *udata; 132 { 133 int *savesplp = (int *)udata; 134 135 *savesplp = splimp(); 136 } 137 138 static void 139 kludge_splx(udata) 140 void *udata; 141 { 142 int *savesplp = (int *)udata; 143 144 splx( *savesplp); 145 } 146 147 148 149 struct protosw * 150 pffindtype(int family, int type) 151 { 152 register struct domain *dp; 153 register struct protosw *pr; 154 155 for (dp = domains; dp; dp = dp->dom_next) 156 if (dp->dom_family == family) 157 goto found; 158 return (0); 159 found: 160 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 161 if (pr->pr_type && pr->pr_type == type) 162 return (pr); 163 return (0); 164 } 165 166 struct protosw * 167 pffindproto(int family, int protocol, int type) 168 { 169 register struct domain *dp; 170 register struct protosw *pr; 171 struct protosw *maybe = 0; 172 173 if (family == 0) 174 return (0); 175 for (dp = domains; dp; dp = dp->dom_next) 176 if (dp->dom_family == family) 177 goto found; 178 return (0); 179 found: 180 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) { 181 if ((pr->pr_protocol == protocol) && (pr->pr_type == type)) 182 return (pr); 183 184 if (type == SOCK_RAW && pr->pr_type == SOCK_RAW && 185 pr->pr_protocol == 0 && maybe == (struct protosw *)0) 186 maybe = pr; 187 } 188 return (maybe); 189 } 190 191 void 192 pfctlinput(cmd, sa) 193 int cmd; 194 struct sockaddr *sa; 195 { 196 register struct domain *dp; 197 register struct protosw *pr; 198 199 for (dp = domains; dp; dp = dp->dom_next) 200 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 201 if (pr->pr_ctlinput) 202 (*pr->pr_ctlinput)(cmd, sa, (caddr_t)0); 203 } 204 205 static void 206 pfslowtimo(arg) 207 void *arg; 208 { 209 register struct domain *dp; 210 register struct protosw *pr; 211 212 for (dp = domains; dp; dp = dp->dom_next) 213 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 214 if (pr->pr_slowtimo) 215 (*pr->pr_slowtimo)(); 216 timeout(pfslowtimo, (void *)0, hz/2); 217 } 218 219 static void 220 pffasttimo(arg) 221 void *arg; 222 { 223 register struct domain *dp; 224 register struct protosw *pr; 225 226 for (dp = domains; dp; dp = dp->dom_next) 227 for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) 228 if (pr->pr_fasttimo) 229 (*pr->pr_fasttimo)(); 230 timeout(pffasttimo, (void *)0, hz/5); 231 } 232