Home | History | Annotate | Line # | Download | only in net
raw_usrreq.c revision 1.57
      1 /*	$NetBSD: raw_usrreq.c,v 1.57 2017/09/25 01:56:22 ozaki-r Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1980, 1986, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  *
     31  *	@(#)raw_usrreq.c	8.1 (Berkeley) 6/10/93
     32  */
     33 
     34 /*
     35  * Raw protocol interface.
     36  */
     37 
     38 #include <sys/cdefs.h>
     39 __KERNEL_RCSID(0, "$NetBSD: raw_usrreq.c,v 1.57 2017/09/25 01:56:22 ozaki-r Exp $");
     40 
     41 #include <sys/param.h>
     42 #include <sys/mbuf.h>
     43 #include <sys/domain.h>
     44 #include <sys/protosw.h>
     45 #include <sys/socket.h>
     46 #include <sys/socketvar.h>
     47 #include <sys/errno.h>
     48 #include <sys/systm.h>
     49 #include <sys/proc.h>
     50 #include <sys/kauth.h>
     51 
     52 #include <net/if.h>
     53 #include <net/route.h>
     54 #include <net/netisr.h>
     55 #include <net/raw_cb.h>
     56 
     57 static inline int
     58 equal(const struct sockaddr *a1, const struct sockaddr *a2)
     59 {
     60 	return memcmp(a1, a2, a1->sa_len) == 0;
     61 }
     62 
     63 /*
     64  * raw_input: find the socket associated with the packet and move it over.
     65  * If nothing exists for this packet, drop it.
     66  */
     67 void
     68 raw_input(struct mbuf *m0, ...)
     69 {
     70 	struct rawcb *rp;
     71 	struct mbuf *m = m0;
     72 	struct socket *last;
     73 	va_list ap;
     74 	struct sockproto *proto;
     75 	struct sockaddr *src, *dst;
     76 	struct rawcbhead *rawcbhead;
     77 
     78 	KASSERT(mutex_owned(softnet_lock));
     79 
     80 	va_start(ap, m0);
     81 	proto = va_arg(ap, struct sockproto *);
     82 	src = va_arg(ap, struct sockaddr *);
     83 	dst = va_arg(ap, struct sockaddr *);
     84 	rawcbhead = va_arg(ap, struct rawcbhead *);
     85 	va_end(ap);
     86 
     87 	last = NULL;
     88 	LIST_FOREACH(rp, rawcbhead, rcb_list) {
     89 		if (rp->rcb_proto.sp_family != proto->sp_family)
     90 			continue;
     91 		if (rp->rcb_proto.sp_protocol  &&
     92 		    rp->rcb_proto.sp_protocol != proto->sp_protocol)
     93 			continue;
     94 		/*
     95 		 * We assume the lower level routines have
     96 		 * placed the address in a canonical format
     97 		 * suitable for a structure comparison.
     98 		 *
     99 		 * Note that if the lengths are not the same
    100 		 * the comparison will fail at the first byte.
    101 		 */
    102 		if (rp->rcb_laddr && !equal(rp->rcb_laddr, dst))
    103 			continue;
    104 		if (rp->rcb_faddr && !equal(rp->rcb_faddr, src))
    105 			continue;
    106 		/* Run any filtering that may have been installed. */
    107 		if (rp->rcb_filter != NULL && rp->rcb_filter(m, proto, rp) != 0)
    108 			continue;
    109 		if (last != NULL) {
    110 			struct mbuf *n;
    111 			if ((n = m_copy(m, 0, M_COPYALL)) == NULL)
    112 				;
    113 			else if (sbappendaddr(&last->so_rcv, src, n, NULL) == 0)
    114 				/* should notify about lost packet */
    115 				m_freem(n);
    116 			else {
    117 				sorwakeup(last);
    118 			}
    119 		}
    120 		last = rp->rcb_socket;
    121 	}
    122 	if (last == NULL || sbappendaddr(&last->so_rcv, src, m, NULL) == 0)
    123 		m_freem(m);
    124 	else {
    125 		sorwakeup(last);
    126 	}
    127 }
    128 
    129 void *
    130 raw_ctlinput(int cmd, const struct sockaddr *arg, void *d)
    131 {
    132 
    133 	if ((unsigned)cmd >= PRC_NCMDS)
    134 		return NULL;
    135 	return NULL;
    136 	/* INCOMPLETE */
    137 }
    138 
    139 void
    140 raw_setsockaddr(struct rawcb *rp, struct sockaddr *nam)
    141 {
    142 
    143 	memcpy(nam, rp->rcb_laddr, rp->rcb_laddr->sa_len);
    144 }
    145 
    146 void
    147 raw_setpeeraddr(struct rawcb *rp, struct sockaddr *nam)
    148 {
    149 
    150 	memcpy(nam, rp->rcb_faddr, rp->rcb_faddr->sa_len);
    151 }
    152 
    153 int
    154 raw_send(struct socket *so, struct mbuf *m, struct sockaddr *nam,
    155     struct mbuf *control, struct lwp *l,
    156     int (*output)(struct mbuf *, struct socket *))
    157 {
    158 	struct rawcb *rp = sotorawcb(so);
    159 	int error = 0;
    160 
    161 	KASSERT(rp != NULL);
    162 
    163 	/*
    164 	 * Ship a packet out.  The appropriate raw output
    165 	 * routine handles any massaging necessary.
    166 	 */
    167 	if (control && control->m_len) {
    168 		m_freem(control);
    169 		m_freem(m);
    170 		return EINVAL;
    171 	}
    172 	if (nam) {
    173 		if ((so->so_state & SS_ISCONNECTED) != 0) {
    174 			error = EISCONN;
    175 			goto die;
    176 		}
    177 		error = (*so->so_proto->pr_usrreqs->pr_connect)(so, nam, l);
    178 		if (error) {
    179 		die:
    180 			m_freem(m);
    181 			return error;
    182 		}
    183 	} else {
    184 		if ((so->so_state & SS_ISCONNECTED) == 0) {
    185 			error = ENOTCONN;
    186 			goto die;
    187 		}
    188 	}
    189 	error = (*output)(m, so);
    190 	if (nam)
    191 		raw_disconnect(rp);
    192 
    193 	return error;
    194 }
    195 
    196 int
    197 raw_usrreq(struct socket *so, int req, struct mbuf *m, struct mbuf *nam,
    198     struct mbuf *control, struct lwp *l)
    199 {
    200 
    201 	KASSERT(req != PRU_ATTACH);
    202 	KASSERT(req != PRU_DETACH);
    203 	KASSERT(req != PRU_ACCEPT);
    204 	KASSERT(req != PRU_BIND);
    205 	KASSERT(req != PRU_LISTEN);
    206 	KASSERT(req != PRU_CONNECT);
    207 	KASSERT(req != PRU_CONNECT2);
    208 	KASSERT(req != PRU_DISCONNECT);
    209 	KASSERT(req != PRU_SHUTDOWN);
    210 	KASSERT(req != PRU_ABORT);
    211 	KASSERT(req != PRU_CONTROL);
    212 	KASSERT(req != PRU_SENSE);
    213 	KASSERT(req != PRU_PEERADDR);
    214 	KASSERT(req != PRU_SOCKADDR);
    215 	KASSERT(req != PRU_RCVD);
    216 	KASSERT(req != PRU_RCVOOB);
    217 	KASSERT(req != PRU_SEND);
    218 	KASSERT(req != PRU_SENDOOB);
    219 	KASSERT(req != PRU_PURGEIF);
    220 
    221 	if (sotorawcb(so) == NULL)
    222 		return EINVAL;
    223 
    224 	panic("raw_usrreq");
    225 
    226 	return 0;
    227 }
    228