xref: /freebsd/sys/kern/uipc_domain.c (revision 0de89efe5c443f213c7ea28773ef2dc6cf3af2ed)
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.17 1997/04/27 20:00:42 wollman 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 static void	pffasttimo __P((void *));
68 static void	pfslowtimo __P((void *));
69 
70 struct domain *domains;
71 
72 #define	ADDDOMAIN(x)	{ \
73 	__CONCAT(x,domain.dom_next) = domains; \
74 	domains = &__CONCAT(x,domain); \
75 }
76 
77 extern struct linker_set domain_set;
78 
79 /* ARGSUSED*/
80 static void
81 domaininit(dummy)
82 	void *dummy;
83 {
84 	register struct domain *dp, **dpp;
85 	register struct protosw *pr;
86 
87 	/*
88 	 * NB - local domain is always present.
89 	 */
90 	ADDDOMAIN(local);
91 
92 	for (dpp = (struct domain **)domain_set.ls_items; *dpp; dpp++) {
93 		(**dpp).dom_next = domains;
94 		domains = *dpp;
95 	}
96 
97 /* - not in our sources
98 #ifdef ISDN
99 	ADDDOMAIN(isdn);
100 #endif
101 */
102 
103 	for (dp = domains; dp; dp = dp->dom_next) {
104 		if (dp->dom_init)
105 			(*dp->dom_init)();
106 		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++){
107 #ifdef PRU_OLDSTYLE
108 			/* See comments in uipc_socket2.c. */
109 			if (pr->pr_usrreqs == 0 && pr->pr_ousrreq)
110 				pr->pr_usrreqs = &pru_oldstyle;
111 #else
112 			if (pr->pr_usrreqs == 0)
113 				panic("domaininit: %ssw[%d] has no usrreqs!",
114 				      dp->dom_name,
115 				      (int)(pr - dp->dom_protosw));
116 #endif
117 			if (pr->pr_init)
118 				(*pr->pr_init)();
119 		}
120 	}
121 
122 	if (max_linkhdr < 16)		/* XXX */
123 		max_linkhdr = 16;
124 	max_hdr = max_linkhdr + max_protohdr;
125 	max_datalen = MHLEN - max_hdr;
126 	timeout(pffasttimo, (void *)0, 1);
127 	timeout(pfslowtimo, (void *)0, 1);
128 }
129 
130 
131 /*
132  * The following two operations are kludge code.  Most likely, they should
133  * be done as a "domainpreinit()" for the first function and then rolled
134  * in as the last act of "domaininit()" for the second.
135  *
136  * In point of fact, it is questionable why other initialization prior
137  * to this does not also take place at splimp by default.
138  */
139 static void
140 kludge_splimp(udata)
141 	void *udata;
142 {
143 	int	*savesplp = udata;
144 
145 	*savesplp = splimp();
146 }
147 
148 static void
149 kludge_splx(udata)
150 	void *udata;
151 {
152 	int	*savesplp = udata;
153 
154 	splx( *savesplp);
155 }
156 
157 
158 
159 struct protosw *
160 pffindtype(family, type)
161 	int family;
162 	int type;
163 {
164 	register struct domain *dp;
165 	register struct protosw *pr;
166 
167 	for (dp = domains; dp; dp = dp->dom_next)
168 		if (dp->dom_family == family)
169 			goto found;
170 	return (0);
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 (0);
176 }
177 
178 struct protosw *
179 pffindproto(family, protocol, type)
180 	int family;
181 	int protocol;
182 	int type;
183 {
184 	register struct domain *dp;
185 	register struct protosw *pr;
186 	struct protosw *maybe = 0;
187 
188 	if (family == 0)
189 		return (0);
190 	for (dp = domains; dp; dp = dp->dom_next)
191 		if (dp->dom_family == family)
192 			goto found;
193 	return (0);
194 found:
195 	for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
196 		if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
197 			return (pr);
198 
199 		if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
200 		    pr->pr_protocol == 0 && maybe == (struct protosw *)0)
201 			maybe = pr;
202 	}
203 	return (maybe);
204 }
205 
206 void
207 pfctlinput(cmd, sa)
208 	int cmd;
209 	struct sockaddr *sa;
210 {
211 	register struct domain *dp;
212 	register struct protosw *pr;
213 
214 	for (dp = domains; dp; dp = dp->dom_next)
215 		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
216 			if (pr->pr_ctlinput)
217 				(*pr->pr_ctlinput)(cmd, sa, (void *)0);
218 }
219 
220 static void
221 pfslowtimo(arg)
222 	void *arg;
223 {
224 	register struct domain *dp;
225 	register struct protosw *pr;
226 
227 	for (dp = domains; dp; dp = dp->dom_next)
228 		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
229 			if (pr->pr_slowtimo)
230 				(*pr->pr_slowtimo)();
231 	timeout(pfslowtimo, (void *)0, hz/2);
232 }
233 
234 static void
235 pffasttimo(arg)
236 	void *arg;
237 {
238 	register struct domain *dp;
239 	register struct protosw *pr;
240 
241 	for (dp = domains; dp; dp = dp->dom_next)
242 		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
243 			if (pr->pr_fasttimo)
244 				(*pr->pr_fasttimo)();
245 	timeout(pffasttimo, (void *)0, hz/5);
246 }
247