uipc_domain.c revision 1.35 1 1.35 simonb /* $NetBSD: uipc_domain.c,v 1.35 2001/10/29 07:02:30 simonb Exp $ */
2 1.12 cgd
3 1.1 cgd /*
4 1.11 mycroft * Copyright (c) 1982, 1986, 1993
5 1.11 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd *
35 1.18 fvdl * @(#)uipc_domain.c 8.3 (Berkeley) 2/14/95
36 1.1 cgd */
37 1.20 jonathan
38 1.20 jonathan #include "opt_inet.h"
39 1.27 thorpej #include "opt_ipsec.h"
40 1.20 jonathan #include "opt_atalk.h"
41 1.21 jonathan #include "opt_ccitt.h"
42 1.22 jonathan #include "opt_iso.h"
43 1.23 jonathan #include "opt_ns.h"
44 1.24 jonathan #include "opt_natm.h"
45 1.28 sommerfe #include "arp.h"
46 1.1 cgd
47 1.5 mycroft #include <sys/param.h>
48 1.5 mycroft #include <sys/socket.h>
49 1.5 mycroft #include <sys/protosw.h>
50 1.5 mycroft #include <sys/domain.h>
51 1.5 mycroft #include <sys/mbuf.h>
52 1.5 mycroft #include <sys/time.h>
53 1.5 mycroft #include <sys/kernel.h>
54 1.11 mycroft #include <sys/systm.h>
55 1.30 thorpej #include <sys/callout.h>
56 1.10 cgd #include <sys/proc.h>
57 1.10 cgd #include <sys/sysctl.h>
58 1.13 christos
59 1.11 mycroft void pffasttimo __P((void *));
60 1.11 mycroft void pfslowtimo __P((void *));
61 1.11 mycroft
62 1.30 thorpej struct callout pffasttimo_ch, pfslowtimo_ch;
63 1.30 thorpej
64 1.19 thorpej /*
65 1.19 thorpej * Current time values for fast and slow timeouts. We can use u_int
66 1.19 thorpej * relatively safely. The fast timer will roll over in 27 years and
67 1.19 thorpej * the slow timer in 68 years.
68 1.19 thorpej */
69 1.19 thorpej u_int pfslowtimo_now;
70 1.19 thorpej u_int pffasttimo_now;
71 1.19 thorpej
72 1.1 cgd #define ADDDOMAIN(x) { \
73 1.1 cgd extern struct domain __CONCAT(x,domain); \
74 1.1 cgd __CONCAT(x,domain.dom_next) = domains; \
75 1.1 cgd domains = &__CONCAT(x,domain); \
76 1.1 cgd }
77 1.1 cgd
78 1.4 andrew void
79 1.1 cgd domaininit()
80 1.1 cgd {
81 1.31 augustss struct domain *dp;
82 1.31 augustss struct protosw *pr;
83 1.1 cgd
84 1.1 cgd #undef unix
85 1.26 itojun /*
86 1.26 itojun * KAME NOTE: ADDDOMAIN(route) is moved to the last part so that
87 1.26 itojun * it will be initialized as the *first* element. confusing!
88 1.26 itojun */
89 1.1 cgd #ifndef lint
90 1.1 cgd ADDDOMAIN(unix);
91 1.1 cgd #ifdef INET
92 1.1 cgd ADDDOMAIN(inet);
93 1.1 cgd #endif
94 1.26 itojun #ifdef INET6
95 1.26 itojun ADDDOMAIN(inet6);
96 1.26 itojun #endif
97 1.1 cgd #ifdef NS
98 1.1 cgd ADDDOMAIN(ns);
99 1.1 cgd #endif
100 1.1 cgd #ifdef ISO
101 1.1 cgd ADDDOMAIN(iso);
102 1.1 cgd #endif
103 1.1 cgd #ifdef CCITT
104 1.1 cgd ADDDOMAIN(ccitt);
105 1.15 chuck #endif
106 1.15 chuck #ifdef NATM
107 1.15 chuck ADDDOMAIN(natm);
108 1.17 christos #endif
109 1.17 christos #ifdef NETATALK
110 1.17 christos ADDDOMAIN(atalk);
111 1.1 cgd #endif
112 1.26 itojun #ifdef IPSEC
113 1.26 itojun ADDDOMAIN(key);
114 1.28 sommerfe #endif
115 1.33 itojun #ifdef INET
116 1.28 sommerfe #if NARP > 0
117 1.28 sommerfe ADDDOMAIN(arp);
118 1.33 itojun #endif
119 1.26 itojun #endif
120 1.26 itojun ADDDOMAIN(route);
121 1.25 thorpej #endif /* ! lint */
122 1.1 cgd
123 1.1 cgd for (dp = domains; dp; dp = dp->dom_next) {
124 1.1 cgd if (dp->dom_init)
125 1.1 cgd (*dp->dom_init)();
126 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
127 1.1 cgd if (pr->pr_init)
128 1.1 cgd (*pr->pr_init)();
129 1.1 cgd }
130 1.1 cgd
131 1.16 explorer if (max_linkhdr < 16) /* XXX */
132 1.16 explorer max_linkhdr = 16;
133 1.1 cgd max_hdr = max_linkhdr + max_protohdr;
134 1.1 cgd max_datalen = MHLEN - max_hdr;
135 1.30 thorpej
136 1.30 thorpej callout_init(&pffasttimo_ch);
137 1.30 thorpej callout_init(&pfslowtimo_ch);
138 1.30 thorpej
139 1.30 thorpej callout_reset(&pffasttimo_ch, 1, pffasttimo, NULL);
140 1.30 thorpej callout_reset(&pfslowtimo_ch, 1, pfslowtimo, NULL);
141 1.1 cgd }
142 1.1 cgd
143 1.29 thorpej struct domain *
144 1.29 thorpej pffinddomain(family)
145 1.29 thorpej int family;
146 1.29 thorpej {
147 1.29 thorpej struct domain *dp;
148 1.29 thorpej
149 1.29 thorpej for (dp = domains; dp != NULL; dp = dp->dom_next)
150 1.29 thorpej if (dp->dom_family == family)
151 1.29 thorpej return (dp);
152 1.29 thorpej return (NULL);
153 1.29 thorpej }
154 1.29 thorpej
155 1.1 cgd struct protosw *
156 1.1 cgd pffindtype(family, type)
157 1.1 cgd int family, type;
158 1.1 cgd {
159 1.29 thorpej struct domain *dp;
160 1.29 thorpej struct protosw *pr;
161 1.29 thorpej
162 1.29 thorpej dp = pffinddomain(family);
163 1.29 thorpej if (dp == NULL)
164 1.29 thorpej return (NULL);
165 1.1 cgd
166 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
167 1.1 cgd if (pr->pr_type && pr->pr_type == type)
168 1.1 cgd return (pr);
169 1.29 thorpej
170 1.29 thorpej return (NULL);
171 1.1 cgd }
172 1.1 cgd
173 1.1 cgd struct protosw *
174 1.1 cgd pffindproto(family, protocol, type)
175 1.1 cgd int family, protocol, type;
176 1.1 cgd {
177 1.29 thorpej struct domain *dp;
178 1.29 thorpej struct protosw *pr;
179 1.29 thorpej struct protosw *maybe = NULL;
180 1.1 cgd
181 1.1 cgd if (family == 0)
182 1.29 thorpej return (NULL);
183 1.29 thorpej
184 1.29 thorpej dp = pffinddomain(family);
185 1.29 thorpej if (dp == NULL)
186 1.29 thorpej return (NULL);
187 1.29 thorpej
188 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
189 1.1 cgd if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
190 1.1 cgd return (pr);
191 1.1 cgd
192 1.1 cgd if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
193 1.29 thorpej pr->pr_protocol == 0 && maybe == NULL)
194 1.1 cgd maybe = pr;
195 1.1 cgd }
196 1.1 cgd return (maybe);
197 1.10 cgd }
198 1.10 cgd
199 1.11 mycroft int
200 1.10 cgd net_sysctl(name, namelen, oldp, oldlenp, newp, newlen, p)
201 1.10 cgd int *name;
202 1.10 cgd u_int namelen;
203 1.10 cgd void *oldp;
204 1.10 cgd size_t *oldlenp;
205 1.10 cgd void *newp;
206 1.10 cgd size_t newlen;
207 1.10 cgd struct proc *p;
208 1.10 cgd {
209 1.29 thorpej struct domain *dp;
210 1.29 thorpej struct protosw *pr;
211 1.10 cgd int family, protocol;
212 1.10 cgd
213 1.10 cgd /*
214 1.26 itojun * All sysctl names at this level are nonterminal.
215 1.26 itojun * PF_KEY: next component is protocol family, and then at least one
216 1.26 itojun * additional component.
217 1.26 itojun * usually: next two components are protocol family and protocol
218 1.26 itojun * number, then at least one addition component.
219 1.10 cgd */
220 1.26 itojun if (namelen < 2)
221 1.10 cgd return (EISDIR); /* overloaded */
222 1.11 mycroft family = name[0];
223 1.11 mycroft
224 1.11 mycroft if (family == 0)
225 1.11 mycroft return (0);
226 1.29 thorpej
227 1.29 thorpej dp = pffinddomain(family);
228 1.29 thorpej if (dp == NULL)
229 1.29 thorpej return (ENOPROTOOPT);
230 1.29 thorpej
231 1.26 itojun switch (family) {
232 1.26 itojun #ifdef IPSEC
233 1.26 itojun case PF_KEY:
234 1.26 itojun pr = dp->dom_protosw;
235 1.26 itojun if (pr->pr_sysctl)
236 1.26 itojun return ((*pr->pr_sysctl)(name + 1, namelen - 1,
237 1.26 itojun oldp, oldlenp, newp, newlen));
238 1.26 itojun return (ENOPROTOOPT);
239 1.26 itojun #endif
240 1.26 itojun default:
241 1.26 itojun break;
242 1.26 itojun }
243 1.26 itojun if (namelen < 3)
244 1.26 itojun return (EISDIR); /* overloaded */
245 1.26 itojun protocol = name[1];
246 1.11 mycroft for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
247 1.11 mycroft if (pr->pr_protocol == protocol && pr->pr_sysctl)
248 1.11 mycroft return ((*pr->pr_sysctl)(name + 2, namelen - 2,
249 1.11 mycroft oldp, oldlenp, newp, newlen));
250 1.10 cgd return (ENOPROTOOPT);
251 1.1 cgd }
252 1.1 cgd
253 1.4 andrew void
254 1.1 cgd pfctlinput(cmd, sa)
255 1.1 cgd int cmd;
256 1.1 cgd struct sockaddr *sa;
257 1.1 cgd {
258 1.31 augustss struct domain *dp;
259 1.31 augustss struct protosw *pr;
260 1.1 cgd
261 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
262 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
263 1.1 cgd if (pr->pr_ctlinput)
264 1.13 christos (*pr->pr_ctlinput)(cmd, sa, NULL);
265 1.34 itojun }
266 1.34 itojun
267 1.34 itojun void
268 1.34 itojun pfctlinput2(cmd, sa, ctlparam)
269 1.34 itojun int cmd;
270 1.34 itojun struct sockaddr *sa;
271 1.34 itojun void *ctlparam;
272 1.34 itojun {
273 1.34 itojun struct domain *dp;
274 1.34 itojun struct protosw *pr;
275 1.34 itojun
276 1.34 itojun if (!sa)
277 1.34 itojun return;
278 1.34 itojun for (dp = domains; dp; dp = dp->dom_next) {
279 1.34 itojun /*
280 1.34 itojun * the check must be made by xx_ctlinput() anyways, to
281 1.34 itojun * make sure we use data item pointed to by ctlparam in
282 1.34 itojun * correct way. the following check is made just for safety.
283 1.34 itojun */
284 1.34 itojun if (dp->dom_family != sa->sa_family)
285 1.34 itojun continue;
286 1.34 itojun
287 1.34 itojun for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
288 1.34 itojun if (pr->pr_ctlinput)
289 1.34 itojun (*pr->pr_ctlinput)(cmd, sa, ctlparam);
290 1.34 itojun }
291 1.1 cgd }
292 1.1 cgd
293 1.4 andrew void
294 1.6 deraadt pfslowtimo(arg)
295 1.8 cgd void *arg;
296 1.1 cgd {
297 1.31 augustss struct domain *dp;
298 1.31 augustss struct protosw *pr;
299 1.1 cgd
300 1.19 thorpej pfslowtimo_now++;
301 1.19 thorpej
302 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
303 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
304 1.1 cgd if (pr->pr_slowtimo)
305 1.1 cgd (*pr->pr_slowtimo)();
306 1.30 thorpej callout_reset(&pfslowtimo_ch, hz / 2, pfslowtimo, NULL);
307 1.1 cgd }
308 1.1 cgd
309 1.4 andrew void
310 1.6 deraadt pffasttimo(arg)
311 1.8 cgd void *arg;
312 1.1 cgd {
313 1.31 augustss struct domain *dp;
314 1.31 augustss struct protosw *pr;
315 1.19 thorpej
316 1.19 thorpej pffasttimo_now++;
317 1.1 cgd
318 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
319 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
320 1.1 cgd if (pr->pr_fasttimo)
321 1.1 cgd (*pr->pr_fasttimo)();
322 1.30 thorpej callout_reset(&pffasttimo_ch, hz / 5, pffasttimo, NULL);
323 1.1 cgd }
324