2004-04-22 02:10:48 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 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 20:37:41 +01:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
2004-04-22 02:10:48 +02: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.
|
|
|
|
*
|
|
|
|
* @(#)tcpip.h 8.1 (Berkeley) 6/10/93
|
|
|
|
* tcpip.h,v 1.3 1994/08/21 05:27:40 paul Exp
|
|
|
|
*/
|
|
|
|
|
2016-06-29 13:47:03 +02:00
|
|
|
#ifndef TCPIP_H
|
|
|
|
#define TCPIP_H
|
2004-04-22 02:10:48 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Tcp+ip header, after ip options removed.
|
|
|
|
*/
|
|
|
|
struct tcpiphdr {
|
2016-03-15 10:31:20 +01:00
|
|
|
struct mbuf_ptr ih_mbuf; /* backpointer to mbuf */
|
|
|
|
union {
|
|
|
|
struct {
|
|
|
|
struct in_addr ih_src; /* source internet address */
|
|
|
|
struct in_addr ih_dst; /* destination internet address */
|
|
|
|
uint8_t ih_x1; /* (unused) */
|
|
|
|
uint8_t ih_pr; /* protocol */
|
|
|
|
} ti_i4;
|
2016-03-15 10:31:21 +01:00
|
|
|
struct {
|
|
|
|
struct in6_addr ih_src;
|
|
|
|
struct in6_addr ih_dst;
|
|
|
|
uint8_t ih_x1;
|
|
|
|
uint8_t ih_nh;
|
|
|
|
} ti_i6;
|
2016-03-15 10:31:20 +01:00
|
|
|
} ti;
|
|
|
|
uint16_t ti_x0;
|
|
|
|
uint16_t ti_len; /* protocol length */
|
|
|
|
struct tcphdr ti_t; /* tcp header */
|
2004-04-22 02:10:48 +02:00
|
|
|
};
|
2016-03-15 10:31:20 +01:00
|
|
|
#define ti_mbuf ih_mbuf.mptr
|
|
|
|
#define ti_pr ti.ti_i4.ih_pr
|
|
|
|
#define ti_src ti.ti_i4.ih_src
|
|
|
|
#define ti_dst ti.ti_i4.ih_dst
|
2016-03-15 10:31:21 +01:00
|
|
|
#define ti_src6 ti.ti_i6.ih_src
|
|
|
|
#define ti_dst6 ti.ti_i6.ih_dst
|
|
|
|
#define ti_nh6 ti.ti_i6.ih_nh
|
2004-04-22 02:10:48 +02:00
|
|
|
#define ti_sport ti_t.th_sport
|
|
|
|
#define ti_dport ti_t.th_dport
|
|
|
|
#define ti_seq ti_t.th_seq
|
|
|
|
#define ti_ack ti_t.th_ack
|
|
|
|
#define ti_x2 ti_t.th_x2
|
|
|
|
#define ti_off ti_t.th_off
|
|
|
|
#define ti_flags ti_t.th_flags
|
|
|
|
#define ti_win ti_t.th_win
|
|
|
|
#define ti_sum ti_t.th_sum
|
|
|
|
#define ti_urp ti_t.th_urp
|
|
|
|
|
2009-01-13 20:48:42 +01:00
|
|
|
#define tcpiphdr2qlink(T) ((struct qlink*)(((char*)(T)) - sizeof(struct qlink)))
|
|
|
|
#define qlink2tcpiphdr(Q) ((struct tcpiphdr*)(((char*)(Q)) + sizeof(struct qlink)))
|
|
|
|
#define tcpiphdr_next(T) qlink2tcpiphdr(tcpiphdr2qlink(T)->next)
|
|
|
|
#define tcpiphdr_prev(T) qlink2tcpiphdr(tcpiphdr2qlink(T)->prev)
|
|
|
|
#define tcpfrag_list_first(T) qlink2tcpiphdr((T)->seg_next)
|
|
|
|
#define tcpfrag_list_end(F, T) (tcpiphdr2qlink(F) == (struct qlink*)(T))
|
|
|
|
#define tcpfrag_list_empty(T) ((T)->seg_next == (struct tcpiphdr*)(T))
|
|
|
|
|
2016-03-15 10:31:20 +01:00
|
|
|
/* This is the difference between the size of a tcpiphdr structure, and the
|
|
|
|
* size of actual ip+tcp headers, rounded up since we need to align data. */
|
|
|
|
#define TCPIPHDR_DELTA\
|
2016-11-29 16:07:34 +01:00
|
|
|
(MAX(0,\
|
2016-03-15 10:31:20 +01:00
|
|
|
(sizeof(struct tcpiphdr)\
|
|
|
|
- sizeof(struct ip) - sizeof(struct tcphdr) + 3) & ~3))
|
|
|
|
|
2004-04-22 02:10:48 +02:00
|
|
|
/*
|
|
|
|
* Just a clean way to get to the first byte
|
|
|
|
* of the packet
|
|
|
|
*/
|
|
|
|
struct tcpiphdr_2 {
|
|
|
|
struct tcpiphdr dummy;
|
|
|
|
char first_char;
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif
|