uipc_domain.c revision 1.20 1 1.20 jonathan /* $NetBSD: uipc_domain.c,v 1.20 1998/07/05 00:51:25 jonathan 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.20 jonathan #include "opt_atalk.h"
40 1.1 cgd
41 1.5 mycroft #include <sys/param.h>
42 1.5 mycroft #include <sys/socket.h>
43 1.5 mycroft #include <sys/protosw.h>
44 1.5 mycroft #include <sys/domain.h>
45 1.5 mycroft #include <sys/mbuf.h>
46 1.5 mycroft #include <sys/time.h>
47 1.5 mycroft #include <sys/kernel.h>
48 1.11 mycroft #include <sys/systm.h>
49 1.10 cgd #include <sys/proc.h>
50 1.10 cgd #include <vm/vm.h>
51 1.10 cgd #include <sys/sysctl.h>
52 1.13 christos
53 1.11 mycroft void pffasttimo __P((void *));
54 1.11 mycroft void pfslowtimo __P((void *));
55 1.11 mycroft
56 1.19 thorpej /*
57 1.19 thorpej * Current time values for fast and slow timeouts. We can use u_int
58 1.19 thorpej * relatively safely. The fast timer will roll over in 27 years and
59 1.19 thorpej * the slow timer in 68 years.
60 1.19 thorpej */
61 1.19 thorpej u_int pfslowtimo_now;
62 1.19 thorpej u_int pffasttimo_now;
63 1.19 thorpej
64 1.1 cgd #define ADDDOMAIN(x) { \
65 1.1 cgd extern struct domain __CONCAT(x,domain); \
66 1.1 cgd __CONCAT(x,domain.dom_next) = domains; \
67 1.1 cgd domains = &__CONCAT(x,domain); \
68 1.1 cgd }
69 1.1 cgd
70 1.4 andrew void
71 1.1 cgd domaininit()
72 1.1 cgd {
73 1.1 cgd register struct domain *dp;
74 1.1 cgd register struct protosw *pr;
75 1.1 cgd
76 1.1 cgd #undef unix
77 1.1 cgd #ifndef lint
78 1.1 cgd ADDDOMAIN(unix);
79 1.1 cgd ADDDOMAIN(route);
80 1.1 cgd #ifdef INET
81 1.1 cgd ADDDOMAIN(inet);
82 1.1 cgd #endif
83 1.1 cgd #ifdef NS
84 1.1 cgd ADDDOMAIN(ns);
85 1.1 cgd #endif
86 1.1 cgd #ifdef ISO
87 1.1 cgd ADDDOMAIN(iso);
88 1.1 cgd #endif
89 1.1 cgd #ifdef CCITT
90 1.1 cgd ADDDOMAIN(ccitt);
91 1.15 chuck #endif
92 1.15 chuck #ifdef NATM
93 1.15 chuck ADDDOMAIN(natm);
94 1.17 christos #endif
95 1.17 christos #ifdef NETATALK
96 1.17 christos ADDDOMAIN(atalk);
97 1.1 cgd #endif
98 1.11 mycroft #ifdef notdef /* XXXX */
99 1.11 mycroft #include "imp.h"
100 1.11 mycroft #if NIMP > 0
101 1.1 cgd ADDDOMAIN(imp);
102 1.1 cgd #endif
103 1.1 cgd #endif
104 1.11 mycroft #endif
105 1.1 cgd
106 1.1 cgd for (dp = domains; dp; dp = dp->dom_next) {
107 1.1 cgd if (dp->dom_init)
108 1.1 cgd (*dp->dom_init)();
109 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
110 1.1 cgd if (pr->pr_init)
111 1.1 cgd (*pr->pr_init)();
112 1.1 cgd }
113 1.1 cgd
114 1.16 explorer if (max_linkhdr < 16) /* XXX */
115 1.16 explorer max_linkhdr = 16;
116 1.1 cgd max_hdr = max_linkhdr + max_protohdr;
117 1.1 cgd max_datalen = MHLEN - max_hdr;
118 1.9 mycroft timeout(pffasttimo, NULL, 1);
119 1.9 mycroft timeout(pfslowtimo, NULL, 1);
120 1.1 cgd }
121 1.1 cgd
122 1.1 cgd struct protosw *
123 1.1 cgd pffindtype(family, type)
124 1.1 cgd int family, type;
125 1.1 cgd {
126 1.1 cgd register struct domain *dp;
127 1.1 cgd register struct protosw *pr;
128 1.1 cgd
129 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
130 1.1 cgd if (dp->dom_family == family)
131 1.1 cgd goto found;
132 1.1 cgd return (0);
133 1.1 cgd found:
134 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
135 1.1 cgd if (pr->pr_type && pr->pr_type == type)
136 1.1 cgd return (pr);
137 1.1 cgd return (0);
138 1.1 cgd }
139 1.1 cgd
140 1.1 cgd struct protosw *
141 1.1 cgd pffindproto(family, protocol, type)
142 1.1 cgd int family, protocol, type;
143 1.1 cgd {
144 1.1 cgd register struct domain *dp;
145 1.1 cgd register struct protosw *pr;
146 1.1 cgd struct protosw *maybe = 0;
147 1.1 cgd
148 1.1 cgd if (family == 0)
149 1.1 cgd return (0);
150 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
151 1.1 cgd if (dp->dom_family == family)
152 1.1 cgd goto found;
153 1.1 cgd return (0);
154 1.1 cgd found:
155 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
156 1.1 cgd if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
157 1.1 cgd return (pr);
158 1.1 cgd
159 1.1 cgd if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
160 1.1 cgd pr->pr_protocol == 0 && maybe == (struct protosw *)0)
161 1.1 cgd maybe = pr;
162 1.1 cgd }
163 1.1 cgd return (maybe);
164 1.10 cgd }
165 1.10 cgd
166 1.11 mycroft int
167 1.10 cgd net_sysctl(name, namelen, oldp, oldlenp, newp, newlen, p)
168 1.10 cgd int *name;
169 1.10 cgd u_int namelen;
170 1.10 cgd void *oldp;
171 1.10 cgd size_t *oldlenp;
172 1.10 cgd void *newp;
173 1.10 cgd size_t newlen;
174 1.10 cgd struct proc *p;
175 1.10 cgd {
176 1.10 cgd register struct domain *dp;
177 1.10 cgd register struct protosw *pr;
178 1.10 cgd int family, protocol;
179 1.10 cgd
180 1.10 cgd /*
181 1.10 cgd * All sysctl names at this level are nonterminal;
182 1.10 cgd * next two components are protocol family and protocol number,
183 1.10 cgd * then at least one addition component.
184 1.10 cgd */
185 1.10 cgd if (namelen < 3)
186 1.10 cgd return (EISDIR); /* overloaded */
187 1.11 mycroft family = name[0];
188 1.11 mycroft protocol = name[1];
189 1.11 mycroft
190 1.11 mycroft if (family == 0)
191 1.11 mycroft return (0);
192 1.11 mycroft for (dp = domains; dp; dp = dp->dom_next)
193 1.11 mycroft if (dp->dom_family == family)
194 1.11 mycroft goto found;
195 1.11 mycroft return (ENOPROTOOPT);
196 1.11 mycroft found:
197 1.11 mycroft for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
198 1.11 mycroft if (pr->pr_protocol == protocol && pr->pr_sysctl)
199 1.11 mycroft return ((*pr->pr_sysctl)(name + 2, namelen - 2,
200 1.11 mycroft oldp, oldlenp, newp, newlen));
201 1.10 cgd return (ENOPROTOOPT);
202 1.1 cgd }
203 1.1 cgd
204 1.4 andrew void
205 1.1 cgd pfctlinput(cmd, sa)
206 1.1 cgd int cmd;
207 1.1 cgd struct sockaddr *sa;
208 1.1 cgd {
209 1.1 cgd register struct domain *dp;
210 1.1 cgd register struct protosw *pr;
211 1.1 cgd
212 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
213 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
214 1.1 cgd if (pr->pr_ctlinput)
215 1.13 christos (*pr->pr_ctlinput)(cmd, sa, NULL);
216 1.1 cgd }
217 1.1 cgd
218 1.4 andrew void
219 1.6 deraadt pfslowtimo(arg)
220 1.8 cgd void *arg;
221 1.1 cgd {
222 1.1 cgd register struct domain *dp;
223 1.1 cgd register struct protosw *pr;
224 1.1 cgd
225 1.19 thorpej pfslowtimo_now++;
226 1.19 thorpej
227 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
228 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
229 1.1 cgd if (pr->pr_slowtimo)
230 1.1 cgd (*pr->pr_slowtimo)();
231 1.9 mycroft timeout(pfslowtimo, NULL, hz/2);
232 1.1 cgd }
233 1.1 cgd
234 1.4 andrew void
235 1.6 deraadt pffasttimo(arg)
236 1.8 cgd void *arg;
237 1.1 cgd {
238 1.1 cgd register struct domain *dp;
239 1.1 cgd register struct protosw *pr;
240 1.19 thorpej
241 1.19 thorpej pffasttimo_now++;
242 1.1 cgd
243 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
244 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
245 1.1 cgd if (pr->pr_fasttimo)
246 1.1 cgd (*pr->pr_fasttimo)();
247 1.9 mycroft timeout(pffasttimo, NULL, hz/5);
248 1.1 cgd }
249