ip_output.c revision 6de922ee8158732706074aacb20c2a5dc6d4d7a3
/*
* Copyright (c) 1982, 1986, 1988, 1990, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)ip_output.c 8.3 (Berkeley) 1/21/94
* ip_output.c,v 1.9 1994/11/16 10:17:10 jkh Exp
*/
/*
* Changes and additions relating to SLiRP are
* Copyright (c) 1995 Danny Gasparovski.
*
* Please read the file COPYRIGHT for the
* terms and conditions of the copyright.
*/
#include <slirp.h>
#include "alias.h"
{
0xff, 0xff, 0xff, 0xff, 0xff, 0xff
};
{
int rc = 1;
if (dst == INADDR_BROADCAST)
{
return 0;
}
if (rc == 0)
return rc;
if (rc == 0)
return rc;
/*
* no chance to send this packet, sorry, we will request ether address via ARP
*/
return rc;
}
/*
* IP output. The packet in mbuf chain m contains a skeletal IP
* header (with len, off, ttl, proto, tos, src, dst).
* The mbuf chain containing the packet will be freed.
* The mbuf opt, if present, will not be freed.
*/
int
{
int rc = 1;
DEBUG_CALL("ip_output");
#ifndef VBOX_WITH_SLIRP_BSD_MBUF
{
LogRel(("NAT: ethernet detects corruption of the packet"));
AssertMsgFailed(("!!Ethernet frame corrupted!!"));
}
#else
M_ASSERTPKTHDR(m);
#endif
#if 0 /* We do no options */
if (opt)
{
}
#endif
/*
* Fill in IP header.
*/
/*
* Verify that we have any chance at all of being able to queue
* the packet or packet fragments
*/
#if 0 /* XXX Hmmm... */
{
goto bad;
}
#endif
* all so we need to calculate destination ethernet address
*/
#ifndef VBOX_WITH_SLIRP_BSD_MBUF
{
if (rc != 0)
goto bad;
}
else
{
rc = 0; /*some times we've already know where to send packet*/
}
#else
/*
* (vvl) Assumption is that m_data points at the IP header and only
* in case of dhcp we know and have header before IP.
*/
if (rc != 0)
goto bad;
#endif
/*
* If small enough for interface, can just send directly.
*/
{
{
#ifndef VBOX_WITH_SLIRP_BSD_MBUF
#else
struct m_tag *t;
{
}
else
{
}
if (rc == PKT_ALIAS_IGNORED)
{
Log(("NAT: packet was droppped\n"));
goto bad;
}
#endif
}
goto done;
}
/*
* Too large for interface; fragment if possible.
* Must be able to put at least 8 bytes per fragment.
*/
{
error = -1;
goto bad;
}
if (len < 8)
{
error = -1;
goto bad;
}
{
#ifdef VBOX_WITH_SLIRP_BSD_MBUF
#endif
{
int rc;
#ifndef VBOX_WITH_SLIRP_BSD_MBUF
#else
struct m_tag *t;
int tmplen = 0;
{
/*we've receives packet in fragments*/
}
else
{
}
{
}
else
{
}
{
if (rc != PKT_ALIAS_IGNORED)
{
}
}
if (rc == PKT_ALIAS_IGNORED)
{
Log(("NAT: packet was droppped\n"));
goto bad;
}
#endif
}
/*
* Loop through length of segment after first fragment,
* make new header and copy data of each part and link onto chain.
*/
m0 = m;
{
#ifndef VBOX_WITH_SLIRP_BSD_MBUF
#else
#endif
if (m == 0)
{
error = -1;
goto sendorfree;
}
m->m_data += if_maxlinkhdr;
#ifdef VBOX_WITH_SLIRP_BSD_MBUF
#endif
/* we've calculated eth_dst for first packet */
#if 0 /* No options */
{
}
#endif
else
#ifndef VBOX_WITH_SLIRP_BSD_MBUF
{
error = -1;
goto sendorfree;
}
#else
#endif
*mnext = m;
}
/*
* Update first fragment by trimming what's been copied out
* and updating header, then send each fragment (in order).
*/
m = m0;
{
m->m_nextpkt = 0;
if (error == 0)
{
#ifndef VBOX_WITH_SLIRP_BSD_MBUF
#else
#endif
}
else
{
}
}
if (error == 0)
}
done:
return (error);
bad:
goto done;
}