raw_ip.c revision 3311
1/*
2 * Copyright (c) 1982, 1986, 1988, 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 *	@(#)raw_ip.c	8.2 (Berkeley) 1/4/94
34 * $Id: raw_ip.c,v 1.4 1994/09/14 03:10:15 wollman Exp $
35 */
36
37#include <sys/param.h>
38#include <sys/malloc.h>
39#include <sys/mbuf.h>
40#include <sys/socket.h>
41#include <sys/protosw.h>
42#include <sys/socketvar.h>
43#include <sys/errno.h>
44#include <sys/systm.h>
45
46#include <net/if.h>
47#include <net/route.h>
48
49#include <netinet/in.h>
50#include <netinet/in_systm.h>
51#include <netinet/ip.h>
52#include <netinet/ip_var.h>
53#include <netinet/ip_mroute.h>
54#include <netinet/in_pcb.h>
55
56struct inpcb rawinpcb;
57
58/*
59 * Nominal space allocated to a raw ip socket.
60 */
61#define	RIPSNDQ		8192
62#define	RIPRCVQ		8192
63
64/*
65 * Raw interface to IP protocol.
66 */
67
68/*
69 * Initialize raw connection block q.
70 */
71void
72rip_init()
73{
74
75	rawinpcb.inp_next = rawinpcb.inp_prev = &rawinpcb;
76}
77
78struct	sockaddr_in ripsrc = { sizeof(ripsrc), AF_INET };
79/*
80 * Setup generic address and protocol structures
81 * for raw_input routine, then pass them along with
82 * mbuf chain.
83 */
84void
85rip_input(m)
86	struct mbuf *m;
87{
88	register struct ip *ip = mtod(m, struct ip *);
89	register struct inpcb *inp;
90	struct socket *last = 0;
91
92	ripsrc.sin_addr = ip->ip_src;
93	for (inp = rawinpcb.inp_next; inp != &rawinpcb; inp = inp->inp_next) {
94		if (inp->inp_ip.ip_p && inp->inp_ip.ip_p != ip->ip_p)
95			continue;
96		if (inp->inp_laddr.s_addr &&
97		    inp->inp_laddr.s_addr == ip->ip_dst.s_addr)
98			continue;
99		if (inp->inp_faddr.s_addr &&
100		    inp->inp_faddr.s_addr == ip->ip_src.s_addr)
101			continue;
102		if (last) {
103			struct mbuf *n = m_copy(m, 0, (int)M_COPYALL);
104			if (n) {
105				if (sbappendaddr(&last->so_rcv,
106				    (struct sockaddr *)&ripsrc, n,
107				    (struct mbuf *)0) == 0)
108					/* should notify about lost packet */
109					m_freem(n);
110				else
111					sorwakeup(last);
112			}
113		}
114		last = inp->inp_socket;
115	}
116	if (last) {
117		if (sbappendaddr(&last->so_rcv, (struct sockaddr *)&ripsrc,
118		    m, (struct mbuf *)0) == 0)
119			m_freem(m);
120		else
121			sorwakeup(last);
122	} else {
123		m_freem(m);
124		ipstat.ips_noproto++;
125		ipstat.ips_delivered--;
126	}
127}
128
129/*
130 * Generate IP header and pass packet to ip_output.
131 * Tack on options user may have setup with control call.
132 */
133int
134rip_output(m, so, dst)
135	register struct mbuf *m;
136	struct socket *so;
137	u_long dst;
138{
139	register struct ip *ip;
140	register struct inpcb *inp = sotoinpcb(so);
141	struct mbuf *opts;
142	int flags = (so->so_options & SO_DONTROUTE) | IP_ALLOWBROADCAST;
143
144	/*
145	 * If the user handed us a complete IP packet, use it.
146	 * Otherwise, allocate an mbuf for a header and fill it in.
147	 */
148	if ((inp->inp_flags & INP_HDRINCL) == 0) {
149		M_PREPEND(m, sizeof(struct ip), M_WAIT);
150		ip = mtod(m, struct ip *);
151		ip->ip_tos = 0;
152		ip->ip_off = 0;
153		ip->ip_p = inp->inp_ip.ip_p;
154		ip->ip_len = m->m_pkthdr.len;
155		ip->ip_src = inp->inp_laddr;
156		ip->ip_dst.s_addr = dst;
157		ip->ip_ttl = MAXTTL;
158		opts = inp->inp_options;
159	} else {
160		ip = mtod(m, struct ip *);
161		if (ip->ip_id == 0)
162			ip->ip_id = htons(ip_id++);
163		opts = NULL;
164		/* XXX prevent ip_output from overwriting header fields */
165		flags |= IP_RAWOUTPUT;
166		ipstat.ips_rawout++;
167	}
168	return (ip_output(m, opts, &inp->inp_route, flags, inp->inp_moptions));
169}
170
171/*
172 * Raw IP socket option processing.
173 */
174int
175rip_ctloutput(op, so, level, optname, m)
176	int op;
177	struct socket *so;
178	int level, optname;
179	struct mbuf **m;
180{
181	register struct inpcb *inp = sotoinpcb(so);
182	register int error;
183
184	if (level != IPPROTO_IP)
185		return (EINVAL);
186
187	switch (optname) {
188
189	case IP_HDRINCL:
190		if (op == PRCO_SETOPT || op == PRCO_GETOPT) {
191			if (m == 0 || *m == 0 || (*m)->m_len < sizeof (int))
192				return (EINVAL);
193			if (op == PRCO_SETOPT) {
194				if (*mtod(*m, int *))
195					inp->inp_flags |= INP_HDRINCL;
196				else
197					inp->inp_flags &= ~INP_HDRINCL;
198				(void)m_free(*m);
199			} else {
200				(*m)->m_len = sizeof (int);
201				*mtod(*m, int *) = inp->inp_flags & INP_HDRINCL;
202			}
203			return (0);
204		}
205		break;
206
207	case IP_RSVP_ON:
208		error = ip_rsvp_init(so);
209		break;
210
211	case IP_RSVP_OFF:
212		error = ip_rsvp_done();
213		break;
214
215	case DVMRP_INIT:
216	case DVMRP_DONE:
217	case DVMRP_ADD_VIF:
218	case DVMRP_DEL_VIF:
219	case DVMRP_ADD_MFC:
220	case DVMRP_DEL_MFC:
221		if (op == PRCO_SETOPT) {
222			error = ip_mrouter_cmd(optname, so, *m);
223			if (*m)
224				(void)m_free(*m);
225		} else
226			error = EINVAL;
227		return (error);
228	}
229	return (ip_ctloutput(op, so, level, optname, m));
230}
231
232u_long	rip_sendspace = RIPSNDQ;
233u_long	rip_recvspace = RIPRCVQ;
234
235/*ARGSUSED*/
236int
237rip_usrreq(so, req, m, nam, control)
238	register struct socket *so;
239	int req;
240	struct mbuf *m, *nam, *control;
241{
242	register int error = 0;
243	register struct inpcb *inp = sotoinpcb(so);
244	switch (req) {
245
246	case PRU_ATTACH:
247		if (inp)
248			panic("rip_attach");
249		if ((so->so_state & SS_PRIV) == 0) {
250			error = EACCES;
251			break;
252		}
253		if ((error = soreserve(so, rip_sendspace, rip_recvspace)) ||
254		    (error = in_pcballoc(so, &rawinpcb)))
255			break;
256		inp = (struct inpcb *)so->so_pcb;
257		inp->inp_ip.ip_p = (int)nam;
258		break;
259
260	case PRU_DISCONNECT:
261		if ((so->so_state & SS_ISCONNECTED) == 0) {
262			error = ENOTCONN;
263			break;
264		}
265		/* FALLTHROUGH */
266	case PRU_ABORT:
267		soisdisconnected(so);
268		/* FALLTHROUGH */
269	case PRU_DETACH:
270		if (inp == 0)
271			panic("rip_detach");
272		if (so == ip_mrouter)
273			ip_mrouter_done();
274		in_pcbdetach(inp);
275		break;
276
277	case PRU_BIND:
278	    {
279		struct sockaddr_in *addr = mtod(nam, struct sockaddr_in *);
280
281		if (nam->m_len != sizeof(*addr)) {
282			error = EINVAL;
283			break;
284		}
285		if ((ifnet == 0) ||
286		    ((addr->sin_family != AF_INET) &&
287		     (addr->sin_family != AF_IMPLINK)) ||
288		    (addr->sin_addr.s_addr &&
289		     ifa_ifwithaddr((struct sockaddr *)addr) == 0)) {
290			error = EADDRNOTAVAIL;
291			break;
292		}
293		inp->inp_laddr = addr->sin_addr;
294		break;
295	    }
296	case PRU_CONNECT:
297	    {
298		struct sockaddr_in *addr = mtod(nam, struct sockaddr_in *);
299
300		if (nam->m_len != sizeof(*addr)) {
301			error = EINVAL;
302			break;
303		}
304		if (ifnet == 0) {
305			error = EADDRNOTAVAIL;
306			break;
307		}
308		if ((addr->sin_family != AF_INET) &&
309		     (addr->sin_family != AF_IMPLINK)) {
310			error = EAFNOSUPPORT;
311			break;
312		}
313		inp->inp_faddr = addr->sin_addr;
314		soisconnected(so);
315		break;
316	    }
317
318	case PRU_CONNECT2:
319		error = EOPNOTSUPP;
320		break;
321
322	/*
323	 * Mark the connection as being incapable of further input.
324	 */
325	case PRU_SHUTDOWN:
326		socantsendmore(so);
327		break;
328
329	/*
330	 * Ship a packet out.  The appropriate raw output
331	 * routine handles any massaging necessary.
332	 */
333	case PRU_SEND:
334	    {
335		register u_long dst;
336
337		if (so->so_state & SS_ISCONNECTED) {
338			if (nam) {
339				error = EISCONN;
340				break;
341			}
342			dst = inp->inp_faddr.s_addr;
343		} else {
344			if (nam == NULL) {
345				error = ENOTCONN;
346				break;
347			}
348			dst = mtod(nam, struct sockaddr_in *)->sin_addr.s_addr;
349		}
350		error = rip_output(m, so, dst);
351		m = NULL;
352		break;
353	    }
354
355	case PRU_SENSE:
356		/*
357		 * stat: don't bother with a blocksize.
358		 */
359		return (0);
360
361	/*
362	 * Not supported.
363	 */
364	case PRU_RCVOOB:
365	case PRU_RCVD:
366	case PRU_LISTEN:
367	case PRU_ACCEPT:
368	case PRU_SENDOOB:
369		error = EOPNOTSUPP;
370		break;
371
372	case PRU_SOCKADDR:
373		in_setsockaddr(inp, nam);
374		break;
375
376	case PRU_PEERADDR:
377		in_setpeeraddr(inp, nam);
378		break;
379
380	default:
381		panic("rip_usrreq");
382	}
383	if (m != NULL)
384		m_freem(m);
385	return (error);
386}
387