xref: /dragonfly/sys/kern/uipc_domain.c (revision 7b1120e5)
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. Neither the name of the University nor the names of its contributors
14  *    may be used to endorse or promote products derived from this software
15  *    without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  *
29  *	@(#)uipc_domain.c	8.2 (Berkeley) 10/18/93
30  * $FreeBSD: src/sys/kern/uipc_domain.c,v 1.22.2.1 2001/07/03 11:01:37 ume Exp $
31  */
32 
33 #include <sys/param.h>
34 #include <sys/socket.h>
35 #include <sys/protosw.h>
36 #include <sys/domain.h>
37 #include <sys/mbuf.h>
38 #include <sys/kernel.h>
39 #include <sys/socketvar.h>
40 #include <sys/socketops.h>
41 #include <sys/systm.h>
42 #include <vm/vm_zone.h>
43 
44 #include <sys/thread2.h>
45 
46 /*
47  * System initialization
48  *
49  * Note: domain initialization wants to take place on a per domain basis
50  * as a result of traversing a linker set.  Most likely, each domain
51  * want to call a registration function rather than being handled here
52  * in domaininit().  Probably this will look like:
53  *
54  * SYSINIT(unique, SI_SUB_PROTO_DOMAIN, SI_ORDER_ANY, domain_add, xxx);
55  *
56  * Where 'xxx' is replaced by the address of a parameter struct to be
57  * passed to the doamin_add() function.
58  */
59 
60 static void domaininit (void *);
61 SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL);
62 
63 struct domainlist domains;
64 
65 /*
66  * Add a new protocol domain to the list of supported domains
67  * Note: you cant unload it again because a socket may be using it.
68  * XXX can't fail at this time.
69  */
70 #define PR_NOTSUPP(pr, label)		\
71 	if (pr->pr_ ## label == NULL)	\
72 		pr->pr_ ## label = pr_generic_notsupp;
73 
74 #define PRU_NOTSUPP(pu, label)		\
75 	if (pu->pru_ ## label == NULL)	\
76 		pu->pru_ ## label = pr_generic_notsupp;
77 
78 static void
79 net_init_domain(struct domain *dp)
80 {
81 	struct protosw *pr;
82 	struct pr_usrreqs *pu;
83 
84 	crit_enter();
85 
86 	if (dp->dom_init)
87 		(*dp->dom_init)();
88 
89 	for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
90 		pu = pr->pr_usrreqs;
91 		if (pu == NULL) {
92 			panic("domaininit: %ssw[%ld] has no usrreqs!",
93 			      dp->dom_name, (long)(pr - dp->dom_protosw));
94 		}
95 		PR_NOTSUPP(pr, ctloutput);
96 		PRU_NOTSUPP(pu, accept);
97 		PRU_NOTSUPP(pu, bind);
98 		PRU_NOTSUPP(pu, connect);
99 		PRU_NOTSUPP(pu, connect2);
100 		PRU_NOTSUPP(pu, control);
101 		PRU_NOTSUPP(pu, disconnect);
102 		PRU_NOTSUPP(pu, listen);
103 		PRU_NOTSUPP(pu, peeraddr);
104 		PRU_NOTSUPP(pu, rcvd);
105 		PRU_NOTSUPP(pu, rcvoob);
106 		PRU_NOTSUPP(pu, shutdown);
107 		PRU_NOTSUPP(pu, sockaddr);
108 
109 		if (pu->pru_sense == NULL)
110 			pu->pru_sense = pru_sense_null;
111 		if (pu->pru_sosend == NULL)
112 			pu->pru_sosend = pru_sosend_notsupp;
113 		if (pu->pru_soreceive == NULL)
114 			pu->pru_soreceive = pru_soreceive_notsupp;
115 
116 		if (pr->pr_init)
117 			(*pr->pr_init)();
118 	}
119 	/*
120 	 * update global information about maximums
121 	 */
122 	max_hdr = max_linkhdr + max_protohdr;
123 	max_datalen = MHLEN - max_hdr;
124 	crit_exit();
125 }
126 
127 /*
128  * Add a new protocol domain to the list of supported domains
129  * Note: you cant unload it again because a socket may be using it.
130  * XXX can't fail at this time.
131  */
132 void
133 net_add_domain(void *data)
134 {
135 	struct domain *dp = data;
136 
137 	crit_enter();
138 	SLIST_INSERT_HEAD(&domains, dp, dom_next);
139 	crit_exit();
140 	net_init_domain(dp);
141 }
142 
143 /* ARGSUSED*/
144 static void
145 domaininit(void *dummy)
146 {
147 	if (max_linkhdr < 20)		/* XXX */
148 		max_linkhdr = 20;
149 }
150 
151 
152 struct protosw *
153 pffindtype(int family, int type)
154 {
155 	struct domain *dp;
156 	struct protosw *pr;
157 
158 	SLIST_FOREACH(dp, &domains, dom_next)
159 		if (dp->dom_family == family)
160 			goto found;
161 	return (NULL);
162 
163 found:
164 	for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
165 		if (pr->pr_type && pr->pr_type == type)
166 			return (pr);
167 	return (NULL);
168 }
169 
170 struct protosw *
171 pffindproto(int family, int protocol, int type)
172 {
173 	struct domain *dp;
174 	struct protosw *pr;
175 	struct protosw *maybe = NULL;
176 
177 	if (family == 0)
178 		return (NULL);
179 	SLIST_FOREACH(dp, &domains, dom_next)
180 		if (dp->dom_family == family)
181 			goto found;
182 	return (NULL);
183 
184 found:
185 	for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
186 		if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
187 			return (pr);
188 
189 		if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
190 		    pr->pr_protocol == 0 && maybe == NULL)
191 			maybe = pr;
192 	}
193 	return (maybe);
194 }
195 
196 void
197 kpfctlinput(int cmd, struct sockaddr *sa)
198 {
199 	struct domain *dp;
200 	struct protosw *pr;
201 
202 	SLIST_FOREACH(dp, &domains, dom_next) {
203 		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
204 			so_pr_ctlinput(pr, cmd, sa, NULL);
205 	}
206 }
207 
208 void
209 kpfctlinput_direct(int cmd, struct sockaddr *sa)
210 {
211 	struct domain *dp;
212 	struct protosw *pr;
213 
214 	SLIST_FOREACH(dp, &domains, dom_next) {
215 		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
216 			so_pr_ctlinput_direct(pr, cmd, sa, NULL);
217 	}
218 }
219 
220 void
221 kpfctlinput2(int cmd, struct sockaddr *sa, void *ctlparam)
222 {
223 	struct domain *dp;
224 	struct protosw *pr;
225 
226 	if (!sa)
227 		return;
228 	SLIST_FOREACH(dp, &domains, dom_next) {
229 		/*
230 		 * the check must be made by xx_ctlinput() anyways, to
231 		 * make sure we use data item pointed to by ctlparam in
232 		 * correct way.  the following check is made just for safety.
233 		 */
234 		if (dp->dom_family != sa->sa_family)
235 			continue;
236 
237 		for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
238 			so_pr_ctlinput(pr, cmd, sa, ctlparam);
239 	}
240 }
241