| 1 | /* $Id: ip_output.c 34037 2010-11-12 18:47:32Z vboxsync $ */
|
|---|
| 2 | /** @file
|
|---|
| 3 | * NAT - IP output.
|
|---|
| 4 | */
|
|---|
| 5 |
|
|---|
| 6 | /*
|
|---|
| 7 | * Copyright (C) 2006-2010 Oracle Corporation
|
|---|
| 8 | *
|
|---|
| 9 | * This file is part of VirtualBox Open Source Edition (OSE), as
|
|---|
| 10 | * available from http://www.virtualbox.org. This file is free software;
|
|---|
| 11 | * you can redistribute it and/or modify it under the terms of the GNU
|
|---|
| 12 | * General Public License (GPL) as published by the Free Software
|
|---|
| 13 | * Foundation, in version 2 as it comes in the "COPYING" file of the
|
|---|
| 14 | * VirtualBox OSE distribution. VirtualBox OSE is distributed in the
|
|---|
| 15 | * hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
|
|---|
| 16 | */
|
|---|
| 17 |
|
|---|
| 18 | /*
|
|---|
| 19 | * This code is based on:
|
|---|
| 20 | *
|
|---|
| 21 | * Copyright (c) 1982, 1986, 1988, 1990, 1993
|
|---|
| 22 | * The Regents of the University of California. All rights reserved.
|
|---|
| 23 | *
|
|---|
| 24 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 25 | * modification, are permitted provided that the following conditions
|
|---|
| 26 | * are met:
|
|---|
| 27 | * 1. Redistributions of source code must retain the above copyright
|
|---|
| 28 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 29 | * 2. Redistributions in binary form must reproduce the above copyright
|
|---|
| 30 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 31 | * documentation and/or other materials provided with the distribution.
|
|---|
| 32 | * 3. All advertising materials mentioning features or use of this software
|
|---|
| 33 | * must display the following acknowledgement:
|
|---|
| 34 | * This product includes software developed by the University of
|
|---|
| 35 | * California, Berkeley and its contributors.
|
|---|
| 36 | * 4. Neither the name of the University nor the names of its contributors
|
|---|
| 37 | * may be used to endorse or promote products derived from this software
|
|---|
| 38 | * without specific prior written permission.
|
|---|
| 39 | *
|
|---|
| 40 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 41 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 43 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|---|
| 44 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 45 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 46 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 48 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 50 | * SUCH DAMAGE.
|
|---|
| 51 | *
|
|---|
| 52 | * @(#)ip_output.c 8.3 (Berkeley) 1/21/94
|
|---|
| 53 | * ip_output.c,v 1.9 1994/11/16 10:17:10 jkh Exp
|
|---|
| 54 | */
|
|---|
| 55 |
|
|---|
| 56 | /*
|
|---|
| 57 | * Changes and additions relating to SLiRP are
|
|---|
| 58 | * Copyright (c) 1995 Danny Gasparovski.
|
|---|
| 59 | *
|
|---|
| 60 | * Please read the file COPYRIGHT for the
|
|---|
| 61 | * terms and conditions of the copyright.
|
|---|
| 62 | */
|
|---|
| 63 |
|
|---|
| 64 | #include <slirp.h>
|
|---|
| 65 | #include "alias.h"
|
|---|
| 66 |
|
|---|
| 67 | static const uint8_t broadcast_ethaddr[6] =
|
|---|
| 68 | {
|
|---|
| 69 | 0xff, 0xff, 0xff, 0xff, 0xff, 0xff
|
|---|
| 70 | };
|
|---|
| 71 |
|
|---|
| 72 | static int rt_lookup_in_cache(PNATState pData, uint32_t dst, uint8_t *ether)
|
|---|
| 73 | {
|
|---|
| 74 | int rc;
|
|---|
| 75 | if (dst == INADDR_BROADCAST)
|
|---|
| 76 | {
|
|---|
| 77 | memcpy(ether, broadcast_ethaddr, ETH_ALEN);
|
|---|
| 78 | return VINF_SUCCESS;
|
|---|
| 79 | }
|
|---|
| 80 |
|
|---|
| 81 | rc = slirp_arp_lookup_ether_by_ip(pData, dst, ether);
|
|---|
| 82 | if (RT_SUCCESS(rc))
|
|---|
| 83 | return rc;
|
|---|
| 84 |
|
|---|
| 85 | rc = bootp_cache_lookup_ether_by_ip(pData, dst, ether);
|
|---|
| 86 | if (RT_SUCCESS(rc))
|
|---|
| 87 | return rc;
|
|---|
| 88 | /*
|
|---|
| 89 | * no chance to send this packet, sorry, we will request ether address via ARP
|
|---|
| 90 | */
|
|---|
| 91 | slirp_arp_who_has(pData, dst);
|
|---|
| 92 | return VERR_NOT_FOUND;
|
|---|
| 93 | }
|
|---|
| 94 |
|
|---|
| 95 | /*
|
|---|
| 96 | * IP output. The packet in mbuf chain m contains a skeletal IP
|
|---|
| 97 | * header (with len, off, ttl, proto, tos, src, dst).
|
|---|
| 98 | * The mbuf chain containing the packet will be freed.
|
|---|
| 99 | * The mbuf opt, if present, will not be freed.
|
|---|
| 100 | */
|
|---|
| 101 | int
|
|---|
| 102 | ip_output(PNATState pData, struct socket *so, struct mbuf *m0)
|
|---|
| 103 | {
|
|---|
| 104 | return ip_output0(pData, so, m0, 0);
|
|---|
| 105 | }
|
|---|
| 106 |
|
|---|
| 107 | /* This function will free m0! */
|
|---|
| 108 | int
|
|---|
| 109 | ip_output0(PNATState pData, struct socket *so, struct mbuf *m0, int urg)
|
|---|
| 110 | {
|
|---|
| 111 | register struct ip *ip;
|
|---|
| 112 | register struct mbuf *m = m0;
|
|---|
| 113 | register int hlen = sizeof(struct ip );
|
|---|
| 114 | int len, off, error = 0;
|
|---|
| 115 | extern uint8_t zerro_ethaddr[ETH_ALEN];
|
|---|
| 116 | struct ethhdr *eh = NULL;
|
|---|
| 117 | uint8_t eth_dst[ETH_ALEN];
|
|---|
| 118 | int rc = 1;
|
|---|
| 119 |
|
|---|
| 120 | STAM_PROFILE_START(&pData->StatIP_output, a);
|
|---|
| 121 |
|
|---|
| 122 | DEBUG_CALL("ip_output");
|
|---|
| 123 | DEBUG_ARG("so = %lx", (long)so);
|
|---|
| 124 | DEBUG_ARG("m0 = %lx", (long)m0);
|
|---|
| 125 |
|
|---|
| 126 | M_ASSERTPKTHDR(m);
|
|---|
| 127 | Assert(m->m_pkthdr.header);
|
|---|
| 128 |
|
|---|
| 129 | #if 0 /* We do no options */
|
|---|
| 130 | if (opt)
|
|---|
| 131 | {
|
|---|
| 132 | m = ip_insertoptions(m, opt, &len);
|
|---|
| 133 | hlen = len;
|
|---|
| 134 | }
|
|---|
| 135 | #endif
|
|---|
| 136 | ip = mtod(m, struct ip *);
|
|---|
| 137 | /*
|
|---|
| 138 | * Fill in IP header.
|
|---|
| 139 | */
|
|---|
| 140 | ip->ip_v = IPVERSION;
|
|---|
| 141 | ip->ip_off &= IP_DF;
|
|---|
| 142 | ip->ip_id = RT_H2N_U16(ip_currid++);
|
|---|
| 143 | ip->ip_hl = hlen >> 2;
|
|---|
| 144 | ipstat.ips_localout++;
|
|---|
| 145 |
|
|---|
| 146 | /* Current TCP/IP stack hasn't routing information at
|
|---|
| 147 | * all so we need to calculate destination ethernet address
|
|---|
| 148 | */
|
|---|
| 149 | rc = rt_lookup_in_cache(pData, ip->ip_dst.s_addr, eth_dst);
|
|---|
| 150 | if (RT_FAILURE(rc))
|
|---|
| 151 | goto exit_drop_package;
|
|---|
| 152 |
|
|---|
| 153 | eh = (struct ethhdr *)(m->m_data - ETH_HLEN);
|
|---|
| 154 | /*
|
|---|
| 155 | * If small enough for interface, can just send directly.
|
|---|
| 156 | */
|
|---|
| 157 | if ((u_int16_t)ip->ip_len <= if_mtu)
|
|---|
| 158 | {
|
|---|
| 159 | ip->ip_len = RT_H2N_U16((u_int16_t)ip->ip_len);
|
|---|
| 160 | ip->ip_off = RT_H2N_U16((u_int16_t)ip->ip_off);
|
|---|
| 161 | ip->ip_sum = 0;
|
|---|
| 162 | ip->ip_sum = cksum(m, hlen);
|
|---|
| 163 |
|
|---|
| 164 | {
|
|---|
| 165 | struct m_tag *t;
|
|---|
| 166 | STAM_PROFILE_START(&pData->StatALIAS_output, b);
|
|---|
| 167 | if ((t = m_tag_find(m, PACKET_TAG_ALIAS, NULL)) != 0)
|
|---|
| 168 | rc = LibAliasOut((struct libalias *)&t[1], mtod(m, char *),
|
|---|
| 169 | m_length(m, NULL));
|
|---|
| 170 | else
|
|---|
| 171 | rc = LibAliasOut(pData->proxy_alias, mtod(m, char *),
|
|---|
| 172 | m_length(m, NULL));
|
|---|
| 173 |
|
|---|
| 174 | if (rc == PKT_ALIAS_IGNORED)
|
|---|
| 175 | {
|
|---|
| 176 | Log(("NAT: packet was droppped\n"));
|
|---|
| 177 | goto exit_drop_package;
|
|---|
| 178 | }
|
|---|
| 179 | STAM_PROFILE_STOP(&pData->StatALIAS_output, b);
|
|---|
| 180 | }
|
|---|
| 181 |
|
|---|
| 182 | memcpy(eh->h_source, eth_dst, ETH_ALEN);
|
|---|
| 183 |
|
|---|
| 184 | if_encap(pData, ETH_P_IP, m, urg? ETH_ENCAP_URG : 0);
|
|---|
| 185 | goto done;
|
|---|
| 186 | }
|
|---|
| 187 |
|
|---|
| 188 | /*
|
|---|
| 189 | * Too large for interface; fragment if possible.
|
|---|
| 190 | * Must be able to put at least 8 bytes per fragment.
|
|---|
| 191 | */
|
|---|
| 192 | if (ip->ip_off & IP_DF)
|
|---|
| 193 | {
|
|---|
| 194 | error = -1;
|
|---|
| 195 | ipstat.ips_cantfrag++;
|
|---|
| 196 | goto exit_drop_package;
|
|---|
| 197 | }
|
|---|
| 198 |
|
|---|
| 199 | len = (if_mtu - hlen) &~ 7; /* ip databytes per packet */
|
|---|
| 200 | if (len < 8)
|
|---|
| 201 | {
|
|---|
| 202 | error = -1;
|
|---|
| 203 | goto exit_drop_package;
|
|---|
| 204 | }
|
|---|
| 205 |
|
|---|
| 206 | {
|
|---|
| 207 | int mhlen, firstlen = len;
|
|---|
| 208 | struct mbuf **mnext = &m->m_nextpkt;
|
|---|
| 209 | char *buf; /* intermediate buffer we'll use for a copy of the original packet */
|
|---|
| 210 | /*
|
|---|
| 211 | * Loop through length of segment after first fragment,
|
|---|
| 212 | * make new header and copy data of each part and link onto chain.
|
|---|
| 213 | */
|
|---|
| 214 | m0 = m;
|
|---|
| 215 | mhlen = ip->ip_hl << 2;
|
|---|
| 216 | Log(("NAT:ip:frag: mhlen = %d\n", mhlen));
|
|---|
| 217 | for (off = hlen + len; off < (u_int16_t)ip->ip_len; off += len)
|
|---|
| 218 | {
|
|---|
| 219 | register struct ip *mhip;
|
|---|
| 220 | m = m_getjcl(pData, M_NOWAIT, MT_HEADER , M_PKTHDR, slirp_size(pData));
|
|---|
| 221 | if (m == 0)
|
|---|
| 222 | {
|
|---|
| 223 | error = -1;
|
|---|
| 224 | ipstat.ips_odropped++;
|
|---|
| 225 | goto send_or_free;
|
|---|
| 226 | }
|
|---|
| 227 | m->m_data += if_maxlinkhdr;
|
|---|
| 228 | mhip = mtod(m, struct ip *);
|
|---|
| 229 | *mhip = *ip;
|
|---|
| 230 | m->m_pkthdr.header = mtod(m, void *);
|
|---|
| 231 | /* we've calculated eth_dst for first packet */
|
|---|
| 232 | #if 0 /* No options */
|
|---|
| 233 | if (hlen > sizeof (struct ip))
|
|---|
| 234 | {
|
|---|
| 235 | mhlen = ip_optcopy(ip, mhip) + sizeof (struct ip);
|
|---|
| 236 | mhip->ip_hl = mhlen >> 2;
|
|---|
| 237 | }
|
|---|
| 238 | #endif
|
|---|
| 239 | m->m_len = mhlen;
|
|---|
| 240 | mhip->ip_off = ((off - mhlen) >> 3) + (ip->ip_off & ~IP_MF);
|
|---|
| 241 | if (ip->ip_off & IP_MF)
|
|---|
| 242 | mhip->ip_off |= IP_MF;
|
|---|
| 243 | if (off + len >= (u_int16_t)ip->ip_len)
|
|---|
| 244 | len = (u_int16_t)ip->ip_len - off;
|
|---|
| 245 | else
|
|---|
| 246 | mhip->ip_off |= IP_MF;
|
|---|
| 247 | mhip->ip_len = RT_H2N_U16((u_int16_t)(len + mhlen));
|
|---|
| 248 |
|
|---|
| 249 | buf = RTMemAlloc(len);
|
|---|
| 250 | Log(("NAT:ip:frag: alloc = %d\n", len));
|
|---|
| 251 | m_copydata(m0, off, len, buf); /* copy to buffer */
|
|---|
| 252 | Log(("NAT:ip:frag: m_copydata(m0 = %p,off = %d, len = %d,)\n", m0, off, len));
|
|---|
| 253 |
|
|---|
| 254 | m->m_data += mhlen;
|
|---|
| 255 | m->m_len -= mhlen;
|
|---|
| 256 | m_copyback(pData, m, 0, len, buf); /* copy from buffer */
|
|---|
| 257 | Log(("NAT:ip:frag: m_copyback(m = %p,, len = %d,)\n", m, len));
|
|---|
| 258 | m->m_data -= mhlen;
|
|---|
| 259 | m->m_len += mhlen;
|
|---|
| 260 | RTMemFree(buf);
|
|---|
| 261 | Assert((m->m_len == (mhlen + len)));
|
|---|
| 262 |
|
|---|
| 263 | mhip->ip_off = RT_H2N_U16((u_int16_t)(mhip->ip_off));
|
|---|
| 264 | mhip->ip_sum = 0;
|
|---|
| 265 | mhip->ip_sum = cksum(m, mhlen);
|
|---|
| 266 | *mnext = m;
|
|---|
| 267 | mnext = &m->m_nextpkt;
|
|---|
| 268 | ipstat.ips_ofragments++;
|
|---|
| 269 | }
|
|---|
| 270 | /*
|
|---|
| 271 | * Update first fragment by trimming what's been copied out
|
|---|
| 272 | * and updating header, then send each fragment (in order).
|
|---|
| 273 | *
|
|---|
| 274 | * note: m_adj do all required releases for chained mbufs.
|
|---|
| 275 | */
|
|---|
| 276 | m = m0;
|
|---|
| 277 | m_adj(m, mhlen + firstlen - (u_int16_t)ip->ip_len);
|
|---|
| 278 | Log(("NAT:ip:frag: m_adj(m(m_len:%d) = %p, len = %d)\n", m->m_len, m, mhlen + firstlen - (u_int16_t)ip->ip_len));
|
|---|
| 279 | ip->ip_len = RT_H2N_U16((u_int16_t)mhlen + firstlen);
|
|---|
| 280 | ip->ip_off = RT_H2N_U16((u_int16_t)(ip->ip_off | IP_MF));
|
|---|
| 281 | ip->ip_sum = 0;
|
|---|
| 282 | ip->ip_sum = cksum(m, mhlen);
|
|---|
| 283 |
|
|---|
| 284 | send_or_free:
|
|---|
| 285 | for (m = m0; m; m = m0)
|
|---|
| 286 | {
|
|---|
| 287 | m0 = m->m_nextpkt;
|
|---|
| 288 | m->m_nextpkt = 0;
|
|---|
| 289 | {
|
|---|
| 290 | /* We're aliasing all fragments */
|
|---|
| 291 | struct m_tag *t;
|
|---|
| 292 | int rcLa;
|
|---|
| 293 |
|
|---|
| 294 | if ((t = m_tag_find(m, PACKET_TAG_ALIAS, NULL)) != 0)
|
|---|
| 295 | rcLa = LibAliasOut((struct libalias *)&t[1], mtod(m, char *), m->m_len);
|
|---|
| 296 | else
|
|---|
| 297 | rcLa = LibAliasOut(pData->proxy_alias, mtod(m, char *), m->m_len);
|
|---|
| 298 |
|
|---|
| 299 | if (rcLa == PKT_ALIAS_IGNORED)
|
|---|
| 300 | {
|
|---|
| 301 | Log(("NAT: packet was droppped\n"));
|
|---|
| 302 | goto exit_drop_package;
|
|---|
| 303 | }
|
|---|
| 304 | Log2(("NAT: LibAlias return %d\n", rcLa));
|
|---|
| 305 | }
|
|---|
| 306 | if (error == 0)
|
|---|
| 307 | {
|
|---|
| 308 | m->m_data -= ETH_HLEN;
|
|---|
| 309 | eh = mtod(m, struct ethhdr *);
|
|---|
| 310 | m->m_data += ETH_HLEN;
|
|---|
| 311 | memcpy(eh->h_source, eth_dst, ETH_ALEN);
|
|---|
| 312 |
|
|---|
| 313 | Log(("NAT:ip:frag: if_encap(,,m(m_len = %d) = %p,0)\n", m->m_len, m));
|
|---|
| 314 | if_encap(pData, ETH_P_IP, m, 0);
|
|---|
| 315 | }
|
|---|
| 316 | else
|
|---|
| 317 | m_freem(pData, m);
|
|---|
| 318 | }
|
|---|
| 319 |
|
|---|
| 320 | if (error == 0)
|
|---|
| 321 | ipstat.ips_fragmented++;
|
|---|
| 322 | }
|
|---|
| 323 |
|
|---|
| 324 | done:
|
|---|
| 325 | STAM_PROFILE_STOP(&pData->StatIP_output, a);
|
|---|
| 326 | return error;
|
|---|
| 327 |
|
|---|
| 328 | exit_drop_package:
|
|---|
| 329 | m_freem(pData, m0);
|
|---|
| 330 | STAM_PROFILE_STOP(&pData->StatIP_output, a);
|
|---|
| 331 | return error;
|
|---|
| 332 | }
|
|---|
