Home | History | Annotate | Line # | Download | only in net
raw_usrreq.c revision 1.61
      1 /*	$NetBSD: raw_usrreq.c,v 1.61 2018/05/09 06:35:10 maxv 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.61 2018/05/09 06:35:10 maxv 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 	va_start(ap, m0);
     79 	proto = va_arg(ap, struct sockproto *);
     80 	src = va_arg(ap, struct sockaddr *);
     81 	dst = va_arg(ap, struct sockaddr *);
     82 	rawcbhead = va_arg(ap, struct rawcbhead *);
     83 	va_end(ap);
     84 
     85 	last = NULL;
     86 	LIST_FOREACH(rp, rawcbhead, rcb_list) {
     87 		if (rp->rcb_proto.sp_family != proto->sp_family)
     88 			continue;
     89 		if (rp->rcb_proto.sp_protocol  &&
     90 		    rp->rcb_proto.sp_protocol != proto->sp_protocol)
     91 			continue;
     92 		/*
     93 		 * We assume the lower level routines have
     94 		 * placed the address in a canonical format
     95 		 * suitable for a structure comparison.
     96 		 *
     97 		 * Note that if the lengths are not the same
     98 		 * the comparison will fail at the first byte.
     99 		 */
    100 		if (rp->rcb_laddr && !equal(rp->rcb_laddr, dst))
    101 			continue;
    102 		if (rp->rcb_faddr && !equal(rp->rcb_faddr, src))
    103 			continue;
    104 		/* Run any filtering that may have been installed. */
    105 		if (rp->rcb_filter != NULL && rp->rcb_filter(m, proto, rp) != 0)
    106 			continue;
    107 		if (last != NULL) {
    108 			struct mbuf *n;
    109 
    110 			if ((n = m_copypacket(m, M_DONTWAIT)) == NULL ||
    111 			    sbappendaddr(&last->so_rcv, src, n, NULL) == 0)
    112 			{
    113 				if (n != NULL)
    114 					m_freem(n);
    115 				soroverflow(last);
    116 			} else
    117 				sorwakeup(last);
    118 		}
    119 		last = rp->rcb_socket;
    120 	}
    121 	if (last != NULL) {
    122 		if (sbappendaddr(&last->so_rcv, src, m, NULL) == 0) {
    123 			m_free(m);
    124 			soroverflow(last);
    125 		} else
    126 			sorwakeup(last);
    127 	} else {
    128 		m_free(m);
    129 	}
    130 }
    131 
    132 void *
    133 raw_ctlinput(int cmd, const struct sockaddr *arg, void *d)
    134 {
    135 
    136 	if ((unsigned)cmd >= PRC_NCMDS)
    137 		return NULL;
    138 	return NULL;
    139 	/* INCOMPLETE */
    140 }
    141 
    142 void
    143 raw_setsockaddr(struct rawcb *rp, struct sockaddr *nam)
    144 {
    145 
    146 	memcpy(nam, rp->rcb_laddr, rp->rcb_laddr->sa_len);
    147 }
    148 
    149 void
    150 raw_setpeeraddr(struct rawcb *rp, struct sockaddr *nam)
    151 {
    152 
    153 	memcpy(nam, rp->rcb_faddr, rp->rcb_faddr->sa_len);
    154 }
    155 
    156 int
    157 raw_send(struct socket *so, struct mbuf *m, struct sockaddr *nam,
    158     struct mbuf *control, struct lwp *l,
    159     int (*output)(struct mbuf *, struct socket *))
    160 {
    161 	struct rawcb *rp = sotorawcb(so);
    162 	int error = 0;
    163 
    164 	KASSERT(rp != NULL);
    165 
    166 	/*
    167 	 * Ship a packet out.  The appropriate raw output
    168 	 * routine handles any massaging necessary.
    169 	 */
    170 	if (control && control->m_len) {
    171 		m_freem(control);
    172 		m_freem(m);
    173 		return EINVAL;
    174 	}
    175 	if (nam) {
    176 		if ((so->so_state & SS_ISCONNECTED) != 0) {
    177 			error = EISCONN;
    178 			goto die;
    179 		}
    180 		error = (*so->so_proto->pr_usrreqs->pr_connect)(so, nam, l);
    181 		if (error) {
    182 		die:
    183 			m_freem(m);
    184 			return error;
    185 		}
    186 	} else {
    187 		if ((so->so_state & SS_ISCONNECTED) == 0) {
    188 			error = ENOTCONN;
    189 			goto die;
    190 		}
    191 	}
    192 	error = (*output)(m, so);
    193 	if (nam)
    194 		raw_disconnect(rp);
    195 
    196 	return error;
    197 }
    198 
    199 int
    200 raw_usrreq(struct socket *so, int req, struct mbuf *m, struct mbuf *nam,
    201     struct mbuf *control, struct lwp *l)
    202 {
    203 
    204 	KASSERT(req != PRU_ATTACH);
    205 	KASSERT(req != PRU_DETACH);
    206 	KASSERT(req != PRU_ACCEPT);
    207 	KASSERT(req != PRU_BIND);
    208 	KASSERT(req != PRU_LISTEN);
    209 	KASSERT(req != PRU_CONNECT);
    210 	KASSERT(req != PRU_CONNECT2);
    211 	KASSERT(req != PRU_DISCONNECT);
    212 	KASSERT(req != PRU_SHUTDOWN);
    213 	KASSERT(req != PRU_ABORT);
    214 	KASSERT(req != PRU_CONTROL);
    215 	KASSERT(req != PRU_SENSE);
    216 	KASSERT(req != PRU_PEERADDR);
    217 	KASSERT(req != PRU_SOCKADDR);
    218 	KASSERT(req != PRU_RCVD);
    219 	KASSERT(req != PRU_RCVOOB);
    220 	KASSERT(req != PRU_SEND);
    221 	KASSERT(req != PRU_SENDOOB);
    222 	KASSERT(req != PRU_PURGEIF);
    223 
    224 	if (sotorawcb(so) == NULL)
    225 		return EINVAL;
    226 
    227 	panic("raw_usrreq");
    228 
    229 	return 0;
    230 }
    231