ViewVC Help
View File | Revision Log | Show Annotations | Revision Graph | Root Listing
root/cebix/BasiliskII/src/slirp/tcp_var.h
Revision: 1.2
Committed: 2012-03-30T01:10:28Z (12 years, 8 months ago) by asvitkine
Content type: text/plain
Branch: MAIN
CVS Tags: HEAD
Changes since 1.1: +1 -5 lines
Log Message: 
Switch slirp to 3-clause BSD license. This change went in upstream to QEMU's
version of slirp (where this code comes from), with the following checkin:

commit 2f5f89963186d42a7ded253bc6cf5b32abb45cec
Author: aliguori <aliguori@c046a42c-6fe2-441c-8c8c-71466251a162>
Date:   Mon Jan 26 19:37:41 2009 +0000

    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

File Contents

# User Rev Content
1 gbeauche 1.1 /*
2     * Copyright (c) 1982, 1986, 1993, 1994
3     * The Regents of the University of California. All rights reserved.
4     *
5     * Redistribution and use in source and binary forms, with or without
6     * modification, are permitted provided that the following conditions
7     * are met:
8     * 1. Redistributions of source code must retain the above copyright
9     * notice, this list of conditions and the following disclaimer.
10     * 2. Redistributions in binary form must reproduce the above copyright
11     * notice, this list of conditions and the following disclaimer in the
12     * documentation and/or other materials provided with the distribution.
13 asvitkine 1.2 * 3. Neither the name of the University nor the names of its contributors
14 gbeauche 1.1 * may be used to endorse or promote products derived from this software
15     * without specific prior written permission.
16     *
17     * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18     * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19     * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20     * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21     * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22     * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23     * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24     * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25     * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26     * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27     * SUCH DAMAGE.
28     *
29     * @(#)tcp_var.h 8.3 (Berkeley) 4/10/94
30     * tcp_var.h,v 1.3 1994/08/21 05:27:39 paul Exp
31     */
32    
33     #ifndef _TCP_VAR_H_
34     #define _TCP_VAR_H_
35    
36     #include "tcpip.h"
37     #include "tcp_timer.h"
38    
39     #if SIZEOF_CHAR_P == 4
40     typedef struct tcpiphdr *tcpiphdrp_32;
41     #else
42     typedef u_int32_t tcpiphdrp_32;
43     #endif
44    
45     /*
46     * Tcp control block, one per tcp; fields:
47     */
48     struct tcpcb {
49     tcpiphdrp_32 seg_next; /* sequencing queue */
50     tcpiphdrp_32 seg_prev;
51     short t_state; /* state of this connection */
52     short t_timer[TCPT_NTIMERS]; /* tcp timers */
53     short t_rxtshift; /* log(2) of rexmt exp. backoff */
54     short t_rxtcur; /* current retransmit value */
55     short t_dupacks; /* consecutive dup acks recd */
56     u_short t_maxseg; /* maximum segment size */
57     char t_force; /* 1 if forcing out a byte */
58     u_short t_flags;
59     #define TF_ACKNOW 0x0001 /* ack peer immediately */
60     #define TF_DELACK 0x0002 /* ack, but try to delay it */
61     #define TF_NODELAY 0x0004 /* don't delay packets to coalesce */
62     #define TF_NOOPT 0x0008 /* don't use tcp options */
63     #define TF_SENTFIN 0x0010 /* have sent FIN */
64     #define TF_REQ_SCALE 0x0020 /* have/will request window scaling */
65     #define TF_RCVD_SCALE 0x0040 /* other side has requested scaling */
66     #define TF_REQ_TSTMP 0x0080 /* have/will request timestamps */
67     #define TF_RCVD_TSTMP 0x0100 /* a timestamp was received in SYN */
68     #define TF_SACK_PERMIT 0x0200 /* other side said I could SACK */
69    
70     /* Make it static for now */
71     /* struct tcpiphdr *t_template; / * skeletal packet for transmit */
72     struct tcpiphdr t_template;
73    
74     struct socket *t_socket; /* back pointer to socket */
75     /*
76     * The following fields are used as in the protocol specification.
77     * See RFC783, Dec. 1981, page 21.
78     */
79     /* send sequence variables */
80     tcp_seq snd_una; /* send unacknowledged */
81     tcp_seq snd_nxt; /* send next */
82     tcp_seq snd_up; /* send urgent pointer */
83     tcp_seq snd_wl1; /* window update seg seq number */
84     tcp_seq snd_wl2; /* window update seg ack number */
85     tcp_seq iss; /* initial send sequence number */
86     u_int32_t snd_wnd; /* send window */
87     /* receive sequence variables */
88     u_int32_t rcv_wnd; /* receive window */
89     tcp_seq rcv_nxt; /* receive next */
90     tcp_seq rcv_up; /* receive urgent pointer */
91     tcp_seq irs; /* initial receive sequence number */
92     /*
93     * Additional variables for this implementation.
94     */
95     /* receive variables */
96     tcp_seq rcv_adv; /* advertised window */
97     /* retransmit variables */
98     tcp_seq snd_max; /* highest sequence number sent;
99     * used to recognize retransmits
100     */
101     /* congestion control (for slow start, source quench, retransmit after loss) */
102     u_int32_t snd_cwnd; /* congestion-controlled window */
103     u_int32_t snd_ssthresh; /* snd_cwnd size threshold for
104     * for slow start exponential to
105     * linear switch
106     */
107     /*
108     * transmit timing stuff. See below for scale of srtt and rttvar.
109     * "Variance" is actually smoothed difference.
110     */
111     short t_idle; /* inactivity time */
112     short t_rtt; /* round trip time */
113     tcp_seq t_rtseq; /* sequence number being timed */
114     short t_srtt; /* smoothed round-trip time */
115     short t_rttvar; /* variance in round-trip time */
116     u_short t_rttmin; /* minimum rtt allowed */
117     u_int32_t max_sndwnd; /* largest window peer has offered */
118    
119     /* out-of-band data */
120     char t_oobflags; /* have some */
121     char t_iobc; /* input character */
122     #define TCPOOB_HAVEDATA 0x01
123     #define TCPOOB_HADDATA 0x02
124     short t_softerror; /* possible error not yet reported */
125    
126     /* RFC 1323 variables */
127     u_char snd_scale; /* window scaling for send window */
128     u_char rcv_scale; /* window scaling for recv window */
129     u_char request_r_scale; /* pending window scaling */
130     u_char requested_s_scale;
131     u_int32_t ts_recent; /* timestamp echo data */
132     u_int32_t ts_recent_age; /* when last updated */
133     tcp_seq last_ack_sent;
134    
135     };
136    
137     #define sototcpcb(so) ((so)->so_tcpcb)
138    
139     /*
140     * The smoothed round-trip time and estimated variance
141     * are stored as fixed point numbers scaled by the values below.
142     * For convenience, these scales are also used in smoothing the average
143     * (smoothed = (1/scale)sample + ((scale-1)/scale)smoothed).
144     * With these scales, srtt has 3 bits to the right of the binary point,
145     * and thus an "ALPHA" of 0.875. rttvar has 2 bits to the right of the
146     * binary point, and is smoothed with an ALPHA of 0.75.
147     */
148     #define TCP_RTT_SCALE 8 /* multiplier for srtt; 3 bits frac. */
149     #define TCP_RTT_SHIFT 3 /* shift for srtt; 3 bits frac. */
150     #define TCP_RTTVAR_SCALE 4 /* multiplier for rttvar; 2 bits */
151     #define TCP_RTTVAR_SHIFT 2 /* multiplier for rttvar; 2 bits */
152    
153     /*
154     * The initial retransmission should happen at rtt + 4 * rttvar.
155     * Because of the way we do the smoothing, srtt and rttvar
156     * will each average +1/2 tick of bias. When we compute
157     * the retransmit timer, we want 1/2 tick of rounding and
158     * 1 extra tick because of +-1/2 tick uncertainty in the
159     * firing of the timer. The bias will give us exactly the
160     * 1.5 tick we need. But, because the bias is
161     * statistical, we have to test that we don't drop below
162     * the minimum feasible timer (which is 2 ticks).
163     * This macro assumes that the value of TCP_RTTVAR_SCALE
164     * is the same as the multiplier for rttvar.
165     */
166     #define TCP_REXMTVAL(tp) \
167     (((tp)->t_srtt >> TCP_RTT_SHIFT) + (tp)->t_rttvar)
168    
169     /* XXX
170     * We want to avoid doing m_pullup on incoming packets but that
171     * means avoiding dtom on the tcp reassembly code. That in turn means
172     * keeping an mbuf pointer in the reassembly queue (since we might
173     * have a cluster). As a quick hack, the source & destination
174     * port numbers (which are no longer needed once we've located the
175     * tcpcb) are overlayed with an mbuf pointer.
176     */
177     #if SIZEOF_CHAR_P == 4
178     typedef struct mbuf *mbufp_32;
179     #else
180     typedef u_int32_t mbufp_32;
181     #endif
182     #define REASS_MBUF(ti) (*(mbufp_32 *)&((ti)->ti_t))
183    
184     /*
185     * TCP statistics.
186     * Many of these should be kept per connection,
187     * but that's inconvenient at the moment.
188     */
189     struct tcpstat {
190     u_long tcps_connattempt; /* connections initiated */
191     u_long tcps_accepts; /* connections accepted */
192     u_long tcps_connects; /* connections established */
193     u_long tcps_drops; /* connections dropped */
194     u_long tcps_conndrops; /* embryonic connections dropped */
195     u_long tcps_closed; /* conn. closed (includes drops) */
196     u_long tcps_segstimed; /* segs where we tried to get rtt */
197     u_long tcps_rttupdated; /* times we succeeded */
198     u_long tcps_delack; /* delayed acks sent */
199     u_long tcps_timeoutdrop; /* conn. dropped in rxmt timeout */
200     u_long tcps_rexmttimeo; /* retransmit timeouts */
201     u_long tcps_persisttimeo; /* persist timeouts */
202     u_long tcps_keeptimeo; /* keepalive timeouts */
203     u_long tcps_keepprobe; /* keepalive probes sent */
204     u_long tcps_keepdrops; /* connections dropped in keepalive */
205    
206     u_long tcps_sndtotal; /* total packets sent */
207     u_long tcps_sndpack; /* data packets sent */
208     u_long tcps_sndbyte; /* data bytes sent */
209     u_long tcps_sndrexmitpack; /* data packets retransmitted */
210     u_long tcps_sndrexmitbyte; /* data bytes retransmitted */
211     u_long tcps_sndacks; /* ack-only packets sent */
212     u_long tcps_sndprobe; /* window probes sent */
213     u_long tcps_sndurg; /* packets sent with URG only */
214     u_long tcps_sndwinup; /* window update-only packets sent */
215     u_long tcps_sndctrl; /* control (SYN|FIN|RST) packets sent */
216    
217     u_long tcps_rcvtotal; /* total packets received */
218     u_long tcps_rcvpack; /* packets received in sequence */
219     u_long tcps_rcvbyte; /* bytes received in sequence */
220     u_long tcps_rcvbadsum; /* packets received with ccksum errs */
221     u_long tcps_rcvbadoff; /* packets received with bad offset */
222     /* u_long tcps_rcvshort; */ /* packets received too short */
223     u_long tcps_rcvduppack; /* duplicate-only packets received */
224     u_long tcps_rcvdupbyte; /* duplicate-only bytes received */
225     u_long tcps_rcvpartduppack; /* packets with some duplicate data */
226     u_long tcps_rcvpartdupbyte; /* dup. bytes in part-dup. packets */
227     u_long tcps_rcvoopack; /* out-of-order packets received */
228     u_long tcps_rcvoobyte; /* out-of-order bytes received */
229     u_long tcps_rcvpackafterwin; /* packets with data after window */
230     u_long tcps_rcvbyteafterwin; /* bytes rcvd after window */
231     u_long tcps_rcvafterclose; /* packets rcvd after "close" */
232     u_long tcps_rcvwinprobe; /* rcvd window probe packets */
233     u_long tcps_rcvdupack; /* rcvd duplicate acks */
234     u_long tcps_rcvacktoomuch; /* rcvd acks for unsent data */
235     u_long tcps_rcvackpack; /* rcvd ack packets */
236     u_long tcps_rcvackbyte; /* bytes acked by rcvd acks */
237     u_long tcps_rcvwinupd; /* rcvd window update packets */
238     /* u_long tcps_pawsdrop; */ /* segments dropped due to PAWS */
239     u_long tcps_predack; /* times hdr predict ok for acks */
240     u_long tcps_preddat; /* times hdr predict ok for data pkts */
241     u_long tcps_socachemiss; /* tcp_last_so misses */
242     u_long tcps_didnuttin; /* Times tcp_output didn't do anything XXX */
243     };
244    
245     extern struct tcpstat tcpstat; /* tcp statistics */
246     extern u_int32_t tcp_now; /* for RFC 1323 timestamps */
247    
248     #endif