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