ip_output.c revision 3c2389b23b02aeda241ecb294e50b4522128e276
/* $Id$ */
/** @file
* NAT - IP output.
*/
/*
* Copyright (C) 2006-2010 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*/
/*
* This code is based on:
*
* 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;
if (dst == INADDR_BROADCAST)
{
return VINF_SUCCESS;
}
if (RT_SUCCESS(rc))
return rc;
if (RT_SUCCESS(rc))
return rc;
/*
* no chance to send this packet, sorry, we will request ether address via ARP
*/
return VERR_NOT_FOUND;
}
/*
* 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
{
}
/* This function will free m0! */
int
{
int rc = 1;
DEBUG_CALL("ip_output");
M_ASSERTPKTHDR(m);
#if 0 /* We do no options */
if (opt)
{
}
#endif
/*
* Fill in IP header.
*/
* all so we need to calculate destination ethernet address
*/
if (RT_FAILURE(rc))
goto exit_drop_package;
/*
* If small enough for interface, can just send directly.
*/
{
{
struct m_tag *t;
else
if (rc == PKT_ALIAS_IGNORED)
{
Log(("NAT: packet was droppped\n"));
goto exit_drop_package;
}
}
goto done;
}
/*
* Too large for interface; fragment if possible.
* Must be able to put at least 8 bytes per fragment.
*/
{
error = -1;
goto exit_drop_package;
}
if (len < 8)
{
error = -1;
goto exit_drop_package;
}
{
char *buf; /* intermediate buffer we'll use for a copy of the original packet */
{
struct m_tag *t;
int tmplen = 0;
int rcLa;
{
/* we've received a packet in fragments */
}
else
{
}
else
{
if (rcLa != PKT_ALIAS_IGNORED)
{
}
}
if (rcLa == PKT_ALIAS_IGNORED)
{
Log(("NAT: packet was droppped\n"));
goto exit_drop_package;
}
}
/*
* Loop through length of segment after first fragment,
* make new header and copy data of each part and link onto chain.
*/
m0 = m;
{
if (m == 0)
{
error = -1;
goto send_or_free;
}
m->m_data += if_maxlinkhdr;
/* we've calculated eth_dst for first packet */
#if 0 /* No options */
{
}
#endif
else
*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)
{
}
else
}
if (error == 0)
}
done:
return error;
return error;
}