uipc_domain.c revision 25201 
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.16 1997/02/22 09:39:27 peter 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
59static int	x_save_spl;			/* used by kludge*/
60static void kludge_splimp __P((void *));
61static void kludge_splx __P((void *));
62static void domaininit __P((void *));
63SYSINIT(splimp, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST, kludge_splimp, &x_save_spl)
64SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL)
65SYSINIT(splx, SI_SUB_PROTO_END, SI_ORDER_FIRST, kludge_splx, &x_save_spl)
66
67static void	pffasttimo __P((void *));
68static void	pfslowtimo __P((void *));
69
70struct domain *domains;
71
72#define	ADDDOMAIN(x)	{ \
73	__CONCAT(x,domain.dom_next) = domains; \
74	domains = &__CONCAT(x,domain); \
75}
76
77extern struct linker_set domain_set;
78
79/* ARGSUSED*/
80static void
81domaininit(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 */
139static void
140kludge_splimp(udata)
141	void *udata;
142{
143	int	*savesplp = udata;
144
145	*savesplp = splimp();
146}
147
148static void
149kludge_splx(udata)
150	void *udata;
151{
152	int	*savesplp = udata;
153
154	splx( *savesplp);
155}
156
157
158
159struct protosw *
160pffindtype(int family, int type)
161{
162	register struct domain *dp;
163	register struct protosw *pr;
164
165	for (dp = domains; dp; dp = dp->dom_next)
166		if (dp->dom_family == family)
167			goto found;
168	return (0);
169found:
170	for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
171		if (pr->pr_type && pr->pr_type == type)
172			return (pr);
173	return (0);
174}
175
176struct protosw *
177pffindproto(int family, int protocol, int type)
178{
179	register struct domain *dp;
180	register struct protosw *pr;
181	struct protosw *maybe = 0;
182
183	if (family == 0)
184		return (0);
185	for (dp = domains; dp; dp = dp->dom_next)
186		if (dp->dom_family == family)
187			goto found;
188	return (0);
189found:
190	for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
191		if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
192			return (pr);
193
194		if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
195		    pr->pr_protocol == 0 && maybe == (struct protosw *)0)
196			maybe = pr;
197	}
198	return (maybe);
199}
200
201void
202pfctlinput(cmd, sa)
203	int cmd;
204	struct sockaddr *sa;
205{
206	register struct domain *dp;
207	register struct protosw *pr;
208
209	for (dp = domains; dp; dp = dp->dom_next)
210		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
211			if (pr->pr_ctlinput)
212				(*pr->pr_ctlinput)(cmd, sa, (void *)0);
213}
214
215static void
216pfslowtimo(arg)
217	void *arg;
218{
219	register struct domain *dp;
220	register struct protosw *pr;
221
222	for (dp = domains; dp; dp = dp->dom_next)
223		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
224			if (pr->pr_slowtimo)
225				(*pr->pr_slowtimo)();
226	timeout(pfslowtimo, (void *)0, hz/2);
227}
228
229static void
230pffasttimo(arg)
231	void *arg;
232{
233	register struct domain *dp;
234	register struct protosw *pr;
235
236	for (dp = domains; dp; dp = dp->dom_next)
237		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
238			if (pr->pr_fasttimo)
239				(*pr->pr_fasttimo)();
240	timeout(pffasttimo, (void *)0, hz/5);
241}
242