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