raw_usrreq.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1980, 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.1 cgd * @(#)raw_usrreq.c 7.9 (Berkeley) 6/28/90
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #include "param.h"
37 1.1 cgd #include "mbuf.h"
38 1.1 cgd #include "domain.h"
39 1.1 cgd #include "protosw.h"
40 1.1 cgd #include "socket.h"
41 1.1 cgd #include "socketvar.h"
42 1.1 cgd #include "errno.h"
43 1.1 cgd
44 1.1 cgd #include "if.h"
45 1.1 cgd #include "route.h"
46 1.1 cgd #include "netisr.h"
47 1.1 cgd #include "raw_cb.h"
48 1.1 cgd
49 1.1 cgd #include "machine/mtpr.h"
50 1.1 cgd
51 1.1 cgd /*
52 1.1 cgd * Initialize raw connection block q.
53 1.1 cgd */
54 1.1 cgd raw_init()
55 1.1 cgd {
56 1.1 cgd
57 1.1 cgd rawcb.rcb_next = rawcb.rcb_prev = &rawcb;
58 1.1 cgd rawintrq.ifq_maxlen = IFQ_MAXLEN;
59 1.1 cgd }
60 1.1 cgd
61 1.1 cgd
62 1.1 cgd /*
63 1.1 cgd * Raw protocol input routine. Find the socket
64 1.1 cgd * associated with the packet(s) and move them over. If
65 1.1 cgd * nothing exists for this packet, drop it.
66 1.1 cgd */
67 1.1 cgd /*
68 1.1 cgd * Raw protocol interface.
69 1.1 cgd */
70 1.1 cgd raw_input(m0, proto, src, dst)
71 1.1 cgd struct mbuf *m0;
72 1.1 cgd register struct sockproto *proto;
73 1.1 cgd struct sockaddr *src, *dst;
74 1.1 cgd {
75 1.1 cgd register struct rawcb *rp;
76 1.1 cgd register struct mbuf *m = m0;
77 1.1 cgd register int sockets = 0;
78 1.1 cgd struct socket *last;
79 1.1 cgd
80 1.1 cgd last = 0;
81 1.1 cgd for (rp = rawcb.rcb_next; rp != &rawcb; rp = rp->rcb_next) {
82 1.1 cgd if (rp->rcb_proto.sp_family != proto->sp_family)
83 1.1 cgd continue;
84 1.1 cgd if (rp->rcb_proto.sp_protocol &&
85 1.1 cgd rp->rcb_proto.sp_protocol != proto->sp_protocol)
86 1.1 cgd continue;
87 1.1 cgd /*
88 1.1 cgd * We assume the lower level routines have
89 1.1 cgd * placed the address in a canonical format
90 1.1 cgd * suitable for a structure comparison.
91 1.1 cgd *
92 1.1 cgd * Note that if the lengths are not the same
93 1.1 cgd * the comparison will fail at the first byte.
94 1.1 cgd */
95 1.1 cgd #define equal(a1, a2) \
96 1.1 cgd (bcmp((caddr_t)(a1), (caddr_t)(a2), a1->sa_len) == 0)
97 1.1 cgd if (rp->rcb_laddr && !equal(rp->rcb_laddr, dst))
98 1.1 cgd continue;
99 1.1 cgd if (rp->rcb_faddr && !equal(rp->rcb_faddr, src))
100 1.1 cgd continue;
101 1.1 cgd if (last) {
102 1.1 cgd struct mbuf *n;
103 1.1 cgd if (n = m_copy(m, 0, (int)M_COPYALL)) {
104 1.1 cgd if (sbappendaddr(&last->so_rcv, src,
105 1.1 cgd n, (struct mbuf *)0) == 0)
106 1.1 cgd /* should notify about lost packet */
107 1.1 cgd m_freem(n);
108 1.1 cgd else {
109 1.1 cgd sorwakeup(last);
110 1.1 cgd sockets++;
111 1.1 cgd }
112 1.1 cgd }
113 1.1 cgd }
114 1.1 cgd last = rp->rcb_socket;
115 1.1 cgd }
116 1.1 cgd if (last) {
117 1.1 cgd if (sbappendaddr(&last->so_rcv, src,
118 1.1 cgd m, (struct mbuf *)0) == 0)
119 1.1 cgd m_freem(m);
120 1.1 cgd else {
121 1.1 cgd sorwakeup(last);
122 1.1 cgd sockets++;
123 1.1 cgd }
124 1.1 cgd } else
125 1.1 cgd m_freem(m);
126 1.1 cgd return (sockets);
127 1.1 cgd }
128 1.1 cgd
129 1.1 cgd /*ARGSUSED*/
130 1.1 cgd raw_ctlinput(cmd, arg)
131 1.1 cgd int cmd;
132 1.1 cgd struct sockaddr *arg;
133 1.1 cgd {
134 1.1 cgd
135 1.1 cgd if (cmd < 0 || cmd > PRC_NCMDS)
136 1.1 cgd return;
137 1.1 cgd /* INCOMPLETE */
138 1.1 cgd }
139 1.1 cgd
140 1.1 cgd /*ARGSUSED*/
141 1.1 cgd raw_usrreq(so, req, m, nam, control)
142 1.1 cgd struct socket *so;
143 1.1 cgd int req;
144 1.1 cgd struct mbuf *m, *nam, *control;
145 1.1 cgd {
146 1.1 cgd register struct rawcb *rp = sotorawcb(so);
147 1.1 cgd register int error = 0;
148 1.1 cgd int len;
149 1.1 cgd
150 1.1 cgd if (req == PRU_CONTROL)
151 1.1 cgd return (EOPNOTSUPP);
152 1.1 cgd if (control && control->m_len) {
153 1.1 cgd error = EOPNOTSUPP;
154 1.1 cgd goto release;
155 1.1 cgd }
156 1.1 cgd if (rp == 0) {
157 1.1 cgd error = EINVAL;
158 1.1 cgd goto release;
159 1.1 cgd }
160 1.1 cgd switch (req) {
161 1.1 cgd
162 1.1 cgd /*
163 1.1 cgd * Allocate a raw control block and fill in the
164 1.1 cgd * necessary info to allow packets to be routed to
165 1.1 cgd * the appropriate raw interface routine.
166 1.1 cgd */
167 1.1 cgd case PRU_ATTACH:
168 1.1 cgd if ((so->so_state & SS_PRIV) == 0) {
169 1.1 cgd error = EACCES;
170 1.1 cgd break;
171 1.1 cgd }
172 1.1 cgd error = raw_attach(so, (int)nam);
173 1.1 cgd break;
174 1.1 cgd
175 1.1 cgd /*
176 1.1 cgd * Destroy state just before socket deallocation.
177 1.1 cgd * Flush data or not depending on the options.
178 1.1 cgd */
179 1.1 cgd case PRU_DETACH:
180 1.1 cgd if (rp == 0) {
181 1.1 cgd error = ENOTCONN;
182 1.1 cgd break;
183 1.1 cgd }
184 1.1 cgd raw_detach(rp);
185 1.1 cgd break;
186 1.1 cgd
187 1.1 cgd #ifdef notdef
188 1.1 cgd /*
189 1.1 cgd * If a socket isn't bound to a single address,
190 1.1 cgd * the raw input routine will hand it anything
191 1.1 cgd * within that protocol family (assuming there's
192 1.1 cgd * nothing else around it should go to).
193 1.1 cgd */
194 1.1 cgd case PRU_CONNECT:
195 1.1 cgd if (rp->rcb_faddr) {
196 1.1 cgd error = EISCONN;
197 1.1 cgd break;
198 1.1 cgd }
199 1.1 cgd nam = m_copym(nam, 0, M_COPYALL, M_WAIT);
200 1.1 cgd rp->rcb_faddr = mtod(nam, struct sockaddr *);
201 1.1 cgd soisconnected(so);
202 1.1 cgd break;
203 1.1 cgd
204 1.1 cgd case PRU_BIND:
205 1.1 cgd if (rp->rcb_laddr) {
206 1.1 cgd error = EINVAL; /* XXX */
207 1.1 cgd break;
208 1.1 cgd }
209 1.1 cgd error = raw_bind(so, nam);
210 1.1 cgd break;
211 1.1 cgd #endif
212 1.1 cgd
213 1.1 cgd case PRU_CONNECT2:
214 1.1 cgd error = EOPNOTSUPP;
215 1.1 cgd goto release;
216 1.1 cgd
217 1.1 cgd case PRU_DISCONNECT:
218 1.1 cgd if (rp->rcb_faddr == 0) {
219 1.1 cgd error = ENOTCONN;
220 1.1 cgd break;
221 1.1 cgd }
222 1.1 cgd raw_disconnect(rp);
223 1.1 cgd soisdisconnected(so);
224 1.1 cgd break;
225 1.1 cgd
226 1.1 cgd /*
227 1.1 cgd * Mark the connection as being incapable of further input.
228 1.1 cgd */
229 1.1 cgd case PRU_SHUTDOWN:
230 1.1 cgd socantsendmore(so);
231 1.1 cgd break;
232 1.1 cgd
233 1.1 cgd /*
234 1.1 cgd * Ship a packet out. The appropriate raw output
235 1.1 cgd * routine handles any massaging necessary.
236 1.1 cgd */
237 1.1 cgd case PRU_SEND:
238 1.1 cgd if (nam) {
239 1.1 cgd if (rp->rcb_faddr) {
240 1.1 cgd error = EISCONN;
241 1.1 cgd break;
242 1.1 cgd }
243 1.1 cgd rp->rcb_faddr = mtod(nam, struct sockaddr *);
244 1.1 cgd } else if (rp->rcb_faddr == 0) {
245 1.1 cgd error = ENOTCONN;
246 1.1 cgd break;
247 1.1 cgd }
248 1.1 cgd error = (*so->so_proto->pr_output)(m, so);
249 1.1 cgd m = NULL;
250 1.1 cgd if (nam)
251 1.1 cgd rp->rcb_faddr = 0;
252 1.1 cgd break;
253 1.1 cgd
254 1.1 cgd case PRU_ABORT:
255 1.1 cgd raw_disconnect(rp);
256 1.1 cgd sofree(so);
257 1.1 cgd soisdisconnected(so);
258 1.1 cgd break;
259 1.1 cgd
260 1.1 cgd case PRU_SENSE:
261 1.1 cgd /*
262 1.1 cgd * stat: don't bother with a blocksize.
263 1.1 cgd */
264 1.1 cgd return (0);
265 1.1 cgd
266 1.1 cgd /*
267 1.1 cgd * Not supported.
268 1.1 cgd */
269 1.1 cgd case PRU_RCVOOB:
270 1.1 cgd case PRU_RCVD:
271 1.1 cgd return(EOPNOTSUPP);
272 1.1 cgd
273 1.1 cgd case PRU_LISTEN:
274 1.1 cgd case PRU_ACCEPT:
275 1.1 cgd case PRU_SENDOOB:
276 1.1 cgd error = EOPNOTSUPP;
277 1.1 cgd break;
278 1.1 cgd
279 1.1 cgd case PRU_SOCKADDR:
280 1.1 cgd if (rp->rcb_laddr == 0) {
281 1.1 cgd error = EINVAL;
282 1.1 cgd break;
283 1.1 cgd }
284 1.1 cgd len = rp->rcb_laddr->sa_len;
285 1.1 cgd bcopy((caddr_t)rp->rcb_laddr, mtod(nam, caddr_t), (unsigned)len);
286 1.1 cgd nam->m_len = len;
287 1.1 cgd break;
288 1.1 cgd
289 1.1 cgd case PRU_PEERADDR:
290 1.1 cgd if (rp->rcb_faddr == 0) {
291 1.1 cgd error = ENOTCONN;
292 1.1 cgd break;
293 1.1 cgd }
294 1.1 cgd len = rp->rcb_faddr->sa_len;
295 1.1 cgd bcopy((caddr_t)rp->rcb_faddr, mtod(nam, caddr_t), (unsigned)len);
296 1.1 cgd nam->m_len = len;
297 1.1 cgd break;
298 1.1 cgd
299 1.1 cgd default:
300 1.1 cgd panic("raw_usrreq");
301 1.1 cgd }
302 1.1 cgd release:
303 1.1 cgd if (m != NULL)
304 1.1 cgd m_freem(m);
305 1.1 cgd return (error);
306 1.1 cgd }
307 1.1 cgd
308 1.1 cgd rawintr() {} /* XXX - referenced by locore. will soon go away */
309