2004-04-22 04:10:48 +04:00
|
|
|
/*
|
|
|
|
* 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
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
Remove the advertising clause from the slirp license
According to the FSF, the 4-clause BSD license, which slirp is covered under,
is not compatible with the GPL or LGPL[1].
[1] http://www.fsf.org/licensing/licenses/index_html#GPLIncompatibleLicenses
There are three declared copyright holders in slirp that use the 4-clause
BSD license, the Regents of UC Berkley, Danny Gasparovski, and Kelly Price.
Below are the appropriate permissions to remove the advertise clause from slirp
from each party.
Special thanks go to Richard Fontana from Red Hat for contacting all of the
necessary authors to resolve this issue!
Regents of UC Berkley:
From ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
July 22, 1999
To All Licensees, Distributors of Any Version of BSD:
As you know, certain of the Berkeley Software Distribution ("BSD") source
code files require that further distributions of products containing all or
portions of the software, acknowledge within their advertising materials
that such products contain software developed by UC Berkeley and its
contributors.
Specifically, the provision reads:
" * 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."
Effective immediately, licensees and distributors are no longer required to
include the acknowledgement within advertising materials. Accordingly, the
foregoing paragraph of those BSD Unix files containing it is hereby deleted
in its entirety.
William Hoskins
Director, Office of Technology Licensing
University of California, Berkeley
Danny Gasparovski:
Subject: RE: Slirp license
Date: Thu, 8 Jan 2009 10:51:00 +1100
From: "Gasparovski, Daniel" <Daniel.Gasparovski@ato.gov.au>
To: "Richard Fontana" <rfontana@redhat.com>
Hi Richard,
I have no objection to having Slirp code in QEMU be licensed under the
3-clause BSD license.
Thanks for taking the effort to consult me about this.
Dan ...
Kelly Price:
Date: Thu, 8 Jan 2009 19:38:56 -0500
From: "Kelly Price" <strredwolf@gmail.com>
To: "Richard Fontana" <rfontana@redhat.com>
Subject: Re: Slirp license
Thanks for contacting me, Richard. I'm glad you were able to find
Dan, as I've been "keeping the light on" for Slirp. I have no use for
it now, and I have little time for it (now holding onto Keenspot's
Comic Genesis and having a regular US state government position). If
Dan would like to return to the project, I'd love to give it back to
him.
As for copyright, I don't own all of it. Dan does, so I will defer to
him. Any of my patches I will gladly license to the 3-part BSD
license. My interest in re-licensing was because we didn't have ready
info to contact Dan. If Dan would like to port Slirp back out of
QEMU, a lot of us 64-bit users would be grateful.
Feel free to share this email address with Dan. I will be glad to
effect a transfer of the project to him and Mr. Bellard of the QEMU
project.
Signed-off-by: Anthony Liguori <aliguori@us.ibm.com>
git-svn-id: svn://svn.savannah.nongnu.org/qemu/trunk@6451 c046a42c-6fe2-441c-8c8c-71466251a162
2009-01-26 22:37:41 +03:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
2004-04-22 04:10:48 +04:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2016-06-22 20:11:19 +03:00
|
|
|
#include "slirp.h"
|
2004-04-22 04:10:48 +04:00
|
|
|
|
2007-10-26 23:34:46 +04:00
|
|
|
/* Number of packets queued before we start sending
|
|
|
|
* (to prevent allocing too many mbufs) */
|
|
|
|
#define IF_THRESH 10
|
|
|
|
|
2004-04-22 04:10:48 +04:00
|
|
|
/*
|
|
|
|
* 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
|
2009-03-07 18:32:56 +03:00
|
|
|
ip_output(struct socket *so, struct mbuf *m0)
|
2004-04-22 04:10:48 +04:00
|
|
|
{
|
2009-06-24 16:42:31 +04:00
|
|
|
Slirp *slirp = m0->slirp;
|
2004-04-22 04:10:48 +04:00
|
|
|
register struct ip *ip;
|
|
|
|
register struct mbuf *m = m0;
|
|
|
|
register int hlen = sizeof(struct ip );
|
|
|
|
int len, off, error = 0;
|
|
|
|
|
|
|
|
DEBUG_CALL("ip_output");
|
2015-08-29 10:12:35 +03:00
|
|
|
DEBUG_ARG("so = %p", so);
|
|
|
|
DEBUG_ARG("m0 = %p", m0);
|
2007-09-17 01:08:06 +04:00
|
|
|
|
2004-04-22 04:10:48 +04:00
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
/*
|
|
|
|
* Fill in IP header.
|
|
|
|
*/
|
|
|
|
ip->ip_v = IPVERSION;
|
|
|
|
ip->ip_off &= IP_DF;
|
2009-06-24 16:42:31 +04:00
|
|
|
ip->ip_id = htons(slirp->ip_id++);
|
2004-04-22 04:10:48 +04:00
|
|
|
ip->ip_hl = hlen >> 2;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If small enough for interface, can just send directly.
|
|
|
|
*/
|
2010-07-23 00:15:23 +04:00
|
|
|
if ((uint16_t)ip->ip_len <= IF_MTU) {
|
|
|
|
ip->ip_len = htons((uint16_t)ip->ip_len);
|
|
|
|
ip->ip_off = htons((uint16_t)ip->ip_off);
|
2004-04-22 04:10:48 +04:00
|
|
|
ip->ip_sum = 0;
|
|
|
|
ip->ip_sum = cksum(m, hlen);
|
|
|
|
|
|
|
|
if_output(so, m);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Too large for interface; fragment if possible.
|
|
|
|
* Must be able to put at least 8 bytes per fragment.
|
|
|
|
*/
|
|
|
|
if (ip->ip_off & IP_DF) {
|
|
|
|
error = -1;
|
|
|
|
goto bad;
|
|
|
|
}
|
2007-09-17 01:08:06 +04:00
|
|
|
|
2007-10-26 23:01:16 +04:00
|
|
|
len = (IF_MTU - hlen) &~ 7; /* ip databytes per packet */
|
2004-04-22 04:10:48 +04:00
|
|
|
if (len < 8) {
|
|
|
|
error = -1;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
int mhlen, firstlen = len;
|
|
|
|
struct mbuf **mnext = &m->m_nextpkt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Loop through length of segment after first fragment,
|
|
|
|
* make new header and copy data of each part and link onto chain.
|
|
|
|
*/
|
|
|
|
m0 = m;
|
|
|
|
mhlen = sizeof (struct ip);
|
2010-07-23 00:15:23 +04:00
|
|
|
for (off = hlen + len; off < (uint16_t)ip->ip_len; off += len) {
|
2004-04-22 04:10:48 +04:00
|
|
|
register struct ip *mhip;
|
2009-06-24 16:42:31 +04:00
|
|
|
m = m_get(slirp);
|
2009-03-07 18:32:56 +03:00
|
|
|
if (m == NULL) {
|
2004-04-22 04:10:48 +04:00
|
|
|
error = -1;
|
|
|
|
goto sendorfree;
|
|
|
|
}
|
2007-10-26 23:01:16 +04:00
|
|
|
m->m_data += IF_MAXLINKHDR;
|
2004-04-22 04:10:48 +04:00
|
|
|
mhip = mtod(m, struct ip *);
|
|
|
|
*mhip = *ip;
|
2007-09-17 12:09:54 +04:00
|
|
|
|
2004-04-22 04:10:48 +04:00
|
|
|
m->m_len = mhlen;
|
|
|
|
mhip->ip_off = ((off - hlen) >> 3) + (ip->ip_off & ~IP_MF);
|
|
|
|
if (ip->ip_off & IP_MF)
|
|
|
|
mhip->ip_off |= IP_MF;
|
2010-07-23 00:15:23 +04:00
|
|
|
if (off + len >= (uint16_t)ip->ip_len)
|
|
|
|
len = (uint16_t)ip->ip_len - off;
|
2007-09-17 01:08:06 +04:00
|
|
|
else
|
2004-04-22 04:10:48 +04:00
|
|
|
mhip->ip_off |= IP_MF;
|
2010-07-23 00:15:23 +04:00
|
|
|
mhip->ip_len = htons((uint16_t)(len + mhlen));
|
2007-09-17 12:09:54 +04:00
|
|
|
|
2004-04-22 04:10:48 +04:00
|
|
|
if (m_copy(m, m0, off, len) < 0) {
|
|
|
|
error = -1;
|
|
|
|
goto sendorfree;
|
|
|
|
}
|
2007-09-17 12:09:54 +04:00
|
|
|
|
2010-07-23 00:15:23 +04:00
|
|
|
mhip->ip_off = htons((uint16_t)mhip->ip_off);
|
2004-04-22 04:10:48 +04:00
|
|
|
mhip->ip_sum = 0;
|
|
|
|
mhip->ip_sum = cksum(m, mhlen);
|
|
|
|
*mnext = m;
|
|
|
|
mnext = &m->m_nextpkt;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Update first fragment by trimming what's been copied out
|
|
|
|
* and updating header, then send each fragment (in order).
|
|
|
|
*/
|
|
|
|
m = m0;
|
2010-07-23 00:15:23 +04:00
|
|
|
m_adj(m, hlen + firstlen - (uint16_t)ip->ip_len);
|
|
|
|
ip->ip_len = htons((uint16_t)m->m_len);
|
|
|
|
ip->ip_off = htons((uint16_t)(ip->ip_off | IP_MF));
|
2004-04-22 04:10:48 +04:00
|
|
|
ip->ip_sum = 0;
|
|
|
|
ip->ip_sum = cksum(m, hlen);
|
|
|
|
sendorfree:
|
|
|
|
for (m = m0; m; m = m0) {
|
|
|
|
m0 = m->m_nextpkt;
|
2009-03-07 18:32:56 +03:00
|
|
|
m->m_nextpkt = NULL;
|
2004-04-22 04:10:48 +04:00
|
|
|
if (error == 0)
|
|
|
|
if_output(so, m);
|
|
|
|
else
|
2011-07-20 14:20:16 +04:00
|
|
|
m_free(m);
|
2004-04-22 04:10:48 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
bad:
|
2011-07-20 14:20:16 +04:00
|
|
|
m_free(m0);
|
2004-04-22 04:10:48 +04:00
|
|
|
goto done;
|
|
|
|
}
|