uipc_domain.c revision 1.10 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1982, 1986 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd *
33 1.3 cgd * from: @(#)uipc_domain.c 7.9 (Berkeley) 3/4/91
34 1.10 cgd * $Id: uipc_domain.c,v 1.10 1994/05/07 00:46:28 cgd Exp $
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd #include <sys/cdefs.h>
38 1.5 mycroft #include <sys/param.h>
39 1.5 mycroft #include <sys/systm.h>
40 1.5 mycroft #include <sys/socket.h>
41 1.5 mycroft #include <sys/protosw.h>
42 1.5 mycroft #include <sys/domain.h>
43 1.5 mycroft #include <sys/mbuf.h>
44 1.5 mycroft #include <sys/time.h>
45 1.5 mycroft #include <sys/kernel.h>
46 1.10 cgd #include <sys/proc.h>
47 1.10 cgd #include <vm/vm.h>
48 1.10 cgd #include <sys/sysctl.h>
49 1.1 cgd
50 1.1 cgd #define ADDDOMAIN(x) { \
51 1.1 cgd extern struct domain __CONCAT(x,domain); \
52 1.1 cgd __CONCAT(x,domain.dom_next) = domains; \
53 1.1 cgd domains = &__CONCAT(x,domain); \
54 1.1 cgd }
55 1.1 cgd
56 1.8 cgd void pffasttimo __P((void *));
57 1.8 cgd void pfslowtimo __P((void *));
58 1.4 andrew
59 1.4 andrew void
60 1.1 cgd domaininit()
61 1.1 cgd {
62 1.1 cgd register struct domain *dp;
63 1.1 cgd register struct protosw *pr;
64 1.1 cgd
65 1.1 cgd #undef unix
66 1.1 cgd #ifndef lint
67 1.1 cgd ADDDOMAIN(unix);
68 1.1 cgd ADDDOMAIN(route);
69 1.1 cgd #ifdef INET
70 1.1 cgd ADDDOMAIN(inet);
71 1.1 cgd #endif
72 1.1 cgd #ifdef NS
73 1.1 cgd ADDDOMAIN(ns);
74 1.1 cgd #endif
75 1.1 cgd #ifdef ISO
76 1.1 cgd ADDDOMAIN(iso);
77 1.1 cgd #endif
78 1.1 cgd #ifdef RMP
79 1.1 cgd ADDDOMAIN(rmp);
80 1.1 cgd #endif
81 1.1 cgd #ifdef CCITT
82 1.1 cgd ADDDOMAIN(ccitt);
83 1.1 cgd #endif
84 1.2 glass #ifdef IMP
85 1.1 cgd ADDDOMAIN(imp);
86 1.1 cgd #endif
87 1.1 cgd #endif
88 1.1 cgd
89 1.1 cgd for (dp = domains; dp; dp = dp->dom_next) {
90 1.1 cgd if (dp->dom_init)
91 1.1 cgd (*dp->dom_init)();
92 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
93 1.1 cgd if (pr->pr_init)
94 1.1 cgd (*pr->pr_init)();
95 1.1 cgd }
96 1.1 cgd
97 1.1 cgd if (max_linkhdr < 16) /* XXX */
98 1.1 cgd max_linkhdr = 16;
99 1.1 cgd max_hdr = max_linkhdr + max_protohdr;
100 1.1 cgd max_datalen = MHLEN - max_hdr;
101 1.9 mycroft timeout(pffasttimo, NULL, 1);
102 1.9 mycroft timeout(pfslowtimo, NULL, 1);
103 1.1 cgd }
104 1.1 cgd
105 1.1 cgd struct protosw *
106 1.1 cgd pffindtype(family, type)
107 1.1 cgd int family, type;
108 1.1 cgd {
109 1.1 cgd register struct domain *dp;
110 1.1 cgd register struct protosw *pr;
111 1.1 cgd
112 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
113 1.1 cgd if (dp->dom_family == family)
114 1.1 cgd goto found;
115 1.1 cgd return (0);
116 1.1 cgd found:
117 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
118 1.1 cgd if (pr->pr_type && pr->pr_type == type)
119 1.1 cgd return (pr);
120 1.1 cgd return (0);
121 1.1 cgd }
122 1.1 cgd
123 1.1 cgd struct protosw *
124 1.1 cgd pffindproto(family, protocol, type)
125 1.1 cgd int family, protocol, type;
126 1.1 cgd {
127 1.1 cgd register struct domain *dp;
128 1.1 cgd register struct protosw *pr;
129 1.1 cgd struct protosw *maybe = 0;
130 1.1 cgd
131 1.1 cgd if (family == 0)
132 1.1 cgd return (0);
133 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
134 1.1 cgd if (dp->dom_family == family)
135 1.1 cgd goto found;
136 1.1 cgd return (0);
137 1.1 cgd found:
138 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
139 1.1 cgd if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
140 1.1 cgd return (pr);
141 1.1 cgd
142 1.1 cgd if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
143 1.1 cgd pr->pr_protocol == 0 && maybe == (struct protosw *)0)
144 1.1 cgd maybe = pr;
145 1.1 cgd }
146 1.1 cgd return (maybe);
147 1.10 cgd }
148 1.10 cgd
149 1.10 cgd net_sysctl(name, namelen, oldp, oldlenp, newp, newlen, p)
150 1.10 cgd int *name;
151 1.10 cgd u_int namelen;
152 1.10 cgd void *oldp;
153 1.10 cgd size_t *oldlenp;
154 1.10 cgd void *newp;
155 1.10 cgd size_t newlen;
156 1.10 cgd struct proc *p;
157 1.10 cgd {
158 1.10 cgd register struct domain *dp;
159 1.10 cgd register struct protosw *pr;
160 1.10 cgd int family, protocol;
161 1.10 cgd
162 1.10 cgd /*
163 1.10 cgd * All sysctl names at this level are nonterminal;
164 1.10 cgd * next two components are protocol family and protocol number,
165 1.10 cgd * then at least one addition component.
166 1.10 cgd */
167 1.10 cgd if (namelen < 3)
168 1.10 cgd return (EISDIR); /* overloaded */
169 1.10 cgd return (ENOPROTOOPT);
170 1.1 cgd }
171 1.1 cgd
172 1.4 andrew void
173 1.1 cgd pfctlinput(cmd, sa)
174 1.1 cgd int cmd;
175 1.1 cgd struct sockaddr *sa;
176 1.1 cgd {
177 1.1 cgd register struct domain *dp;
178 1.1 cgd register struct protosw *pr;
179 1.1 cgd
180 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
181 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
182 1.1 cgd if (pr->pr_ctlinput)
183 1.1 cgd (*pr->pr_ctlinput)(cmd, sa, (caddr_t) 0);
184 1.1 cgd }
185 1.1 cgd
186 1.4 andrew /* ARGSUSED */
187 1.4 andrew void
188 1.6 deraadt pfslowtimo(arg)
189 1.8 cgd void *arg;
190 1.1 cgd {
191 1.1 cgd register struct domain *dp;
192 1.1 cgd register struct protosw *pr;
193 1.1 cgd
194 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
195 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
196 1.1 cgd if (pr->pr_slowtimo)
197 1.1 cgd (*pr->pr_slowtimo)();
198 1.9 mycroft timeout(pfslowtimo, NULL, hz/2);
199 1.1 cgd }
200 1.1 cgd
201 1.4 andrew /* ARGSUSED */
202 1.4 andrew void
203 1.6 deraadt pffasttimo(arg)
204 1.8 cgd void *arg;
205 1.1 cgd {
206 1.1 cgd register struct domain *dp;
207 1.1 cgd register struct protosw *pr;
208 1.1 cgd
209 1.1 cgd for (dp = domains; dp; dp = dp->dom_next)
210 1.1 cgd for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
211 1.1 cgd if (pr->pr_fasttimo)
212 1.1 cgd (*pr->pr_fasttimo)();
213 1.9 mycroft timeout(pffasttimo, NULL, hz/5);
214 1.1 cgd }
215