| 1 | /* $NetBSD: raw_usrreq.c,v 1.55 2016/01/20 21:43:59 riastradh 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.55 2016/01/20 21:43:59 riastradh 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 | void |
| 58 | raw_init(void) |
| 59 | { |
| 60 | LIST_INIT(&rawcb); |
| 61 | } |
| 62 | |
| 63 | static inline int |
| 64 | equal(const struct sockaddr *a1, const struct sockaddr *a2) |
| 65 | { |
| 66 | return memcmp(a1, a2, a1->sa_len) == 0; |
| 67 | } |
| 68 | |
| 69 | /* |
| 70 | * raw_input: find the socket associated with the packet and move it over. |
| 71 | * If nothing exists for this packet, drop it. |
| 72 | */ |
| 73 | void |
| 74 | raw_input(struct mbuf *m0, ...) |
| 75 | { |
| 76 | struct rawcb *rp; |
| 77 | struct mbuf *m = m0; |
| 78 | struct socket *last; |
| 79 | va_list ap; |
| 80 | struct sockproto *proto; |
| 81 | struct sockaddr *src, *dst; |
| 82 | |
| 83 | KASSERT(mutex_owned(softnet_lock)); |
| 84 | |
| 85 | va_start(ap, m0); |
| 86 | proto = va_arg(ap, struct sockproto *); |
| 87 | src = va_arg(ap, struct sockaddr *); |
| 88 | dst = va_arg(ap, struct sockaddr *); |
| 89 | va_end(ap); |
| 90 | |
| 91 | last = NULL; |
| 92 | LIST_FOREACH(rp, &rawcb, rcb_list) { |
| 93 | if (rp->rcb_proto.sp_family != proto->sp_family) |
| 94 | continue; |
| 95 | if (rp->rcb_proto.sp_protocol && |
| 96 | rp->rcb_proto.sp_protocol != proto->sp_protocol) |
| 97 | continue; |
| 98 | /* |
| 99 | * We assume the lower level routines have |
| 100 | * placed the address in a canonical format |
| 101 | * suitable for a structure comparison. |
| 102 | * |
| 103 | * Note that if the lengths are not the same |
| 104 | * the comparison will fail at the first byte. |
| 105 | */ |
| 106 | if (rp->rcb_laddr && !equal(rp->rcb_laddr, dst)) |
| 107 | continue; |
| 108 | if (rp->rcb_faddr && !equal(rp->rcb_faddr, src)) |
| 109 | continue; |
| 110 | if (last != NULL) { |
| 111 | struct mbuf *n; |
| 112 | if ((n = m_copy(m, 0, M_COPYALL)) == NULL) |
| 113 | ; |
| 114 | else if (sbappendaddr(&last->so_rcv, src, n, NULL) == 0) |
| 115 | /* should notify about lost packet */ |
| 116 | m_freem(n); |
| 117 | else { |
| 118 | sorwakeup(last); |
| 119 | } |
| 120 | } |
| 121 | last = rp->rcb_socket; |
| 122 | } |
| 123 | if (last == NULL || sbappendaddr(&last->so_rcv, src, m, NULL) == 0) |
| 124 | m_freem(m); |
| 125 | else { |
| 126 | sorwakeup(last); |
| 127 | } |
| 128 | } |
| 129 | |
| 130 | void * |
| 131 | raw_ctlinput(int cmd, const struct sockaddr *arg, void *d) |
| 132 | { |
| 133 | |
| 134 | if ((unsigned)cmd >= PRC_NCMDS) |
| 135 | return NULL; |
| 136 | return NULL; |
| 137 | /* INCOMPLETE */ |
| 138 | } |
| 139 | |
| 140 | void |
| 141 | raw_setsockaddr(struct rawcb *rp, struct sockaddr *nam) |
| 142 | { |
| 143 | |
| 144 | memcpy(nam, rp->rcb_laddr, rp->rcb_laddr->sa_len); |
| 145 | } |
| 146 | |
| 147 | void |
| 148 | raw_setpeeraddr(struct rawcb *rp, struct sockaddr *nam) |
| 149 | { |
| 150 | |
| 151 | memcpy(nam, rp->rcb_faddr, rp->rcb_faddr->sa_len); |
| 152 | } |
| 153 | |
| 154 | int |
| 155 | raw_send(struct socket *so, struct mbuf *m, struct sockaddr *nam, |
| 156 | struct mbuf *control, struct lwp *l, |
| 157 | int (*output)(struct mbuf *, struct socket *)) |
| 158 | { |
| 159 | struct rawcb *rp = sotorawcb(so); |
| 160 | int error = 0; |
| 161 | |
| 162 | KASSERT(rp != NULL); |
| 163 | |
| 164 | /* |
| 165 | * Ship a packet out. The appropriate raw output |
| 166 | * routine handles any massaging necessary. |
| 167 | */ |
| 168 | if (control && control->m_len) { |
| 169 | m_freem(control); |
| 170 | m_freem(m); |
| 171 | return EINVAL; |
| 172 | } |
| 173 | if (nam) { |
| 174 | if ((so->so_state & SS_ISCONNECTED) != 0) { |
| 175 | error = EISCONN; |
| 176 | goto die; |
| 177 | } |
| 178 | error = (*so->so_proto->pr_usrreqs->pr_connect)(so, nam, l); |
| 179 | if (error) { |
| 180 | die: |
| 181 | m_freem(m); |
| 182 | return error; |
| 183 | } |
| 184 | } else { |
| 185 | if ((so->so_state & SS_ISCONNECTED) == 0) { |
| 186 | error = ENOTCONN; |
| 187 | goto die; |
| 188 | } |
| 189 | } |
| 190 | error = (*output)(m, so); |
| 191 | if (nam) |
| 192 | raw_disconnect(rp); |
| 193 | |
| 194 | return error; |
| 195 | } |
| 196 | |
| 197 | int |
| 198 | raw_usrreq(struct socket *so, int req, struct mbuf *m, struct mbuf *nam, |
| 199 | struct mbuf *control, struct lwp *l) |
| 200 | { |
| 201 | |
| 202 | KASSERT(req != PRU_ATTACH); |
| 203 | KASSERT(req != PRU_DETACH); |
| 204 | KASSERT(req != PRU_ACCEPT); |
| 205 | KASSERT(req != PRU_BIND); |
| 206 | KASSERT(req != PRU_LISTEN); |
| 207 | KASSERT(req != PRU_CONNECT); |
| 208 | KASSERT(req != PRU_CONNECT2); |
| 209 | KASSERT(req != PRU_DISCONNECT); |
| 210 | KASSERT(req != PRU_SHUTDOWN); |
| 211 | KASSERT(req != PRU_ABORT); |
| 212 | KASSERT(req != PRU_CONTROL); |
| 213 | KASSERT(req != PRU_SENSE); |
| 214 | KASSERT(req != PRU_PEERADDR); |
| 215 | KASSERT(req != PRU_SOCKADDR); |
| 216 | KASSERT(req != PRU_RCVD); |
| 217 | KASSERT(req != PRU_RCVOOB); |
| 218 | KASSERT(req != PRU_SEND); |
| 219 | KASSERT(req != PRU_SENDOOB); |
| 220 | KASSERT(req != PRU_PURGEIF); |
| 221 | |
| 222 | if (sotorawcb(so) == NULL) |
| 223 | return EINVAL; |
| 224 | |
| 225 | panic("raw_usrreq" ); |
| 226 | |
| 227 | return 0; |
| 228 | } |
| 229 | |