2 * Copyright (c) 2002, 2003, 2004 Jeffrey M. Hsu. All rights reserved.
3 * Copyright (c) 2002, 2003, 2004 The DragonFly Project. All rights reserved.
5 * This code is derived from software contributed to The DragonFly Project
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of The DragonFly Project nor the names of its
17 * contributors may be used to endorse or promote products derived
18 * from this software without specific, prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
28 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
29 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
30 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * Copyright (c) 1982, 1986, 1988, 1990, 1993, 1994, 1995
36 * The Regents of the University of California. All rights reserved.
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
46 * 3. Neither the name of the University nor the names of its contributors
47 * may be used to endorse or promote products derived from this software
48 * without specific prior written permission.
50 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
51 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
52 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
53 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
54 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
55 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
56 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
57 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
58 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
59 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 * @(#)tcp_input.c 8.12 (Berkeley) 5/24/95
63 * $FreeBSD: src/sys/netinet/tcp_input.c,v 1.107.2.38 2003/05/21 04:46:41 cjc Exp $
67 #include "opt_inet6.h"
68 #include "opt_ipsec.h"
69 #include "opt_tcpdebug.h"
70 #include "opt_tcp_input.h"
72 #include <sys/param.h>
73 #include <sys/systm.h>
74 #include <sys/kernel.h>
75 #include <sys/sysctl.h>
76 #include <sys/malloc.h>
78 #include <sys/proc.h> /* for proc0 declaration */
79 #include <sys/protosw.h>
80 #include <sys/socket.h>
81 #include <sys/socketvar.h>
82 #include <sys/syslog.h>
83 #include <sys/in_cksum.h>
85 #include <sys/socketvar2.h>
87 #include <machine/cpu.h> /* before tcp_seq.h, for tcp_random18() */
88 #include <machine/stdarg.h>
91 #include <net/route.h>
93 #include <netinet/in.h>
94 #include <netinet/in_systm.h>
95 #include <netinet/ip.h>
96 #include <netinet/ip_icmp.h> /* for ICMP_BANDLIM */
97 #include <netinet/in_var.h>
98 #include <netinet/icmp_var.h> /* for ICMP_BANDLIM */
99 #include <netinet/in_pcb.h>
100 #include <netinet/ip_var.h>
101 #include <netinet/ip6.h>
102 #include <netinet/icmp6.h>
103 #include <netinet6/nd6.h>
104 #include <netinet6/ip6_var.h>
105 #include <netinet6/in6_pcb.h>
106 #include <netinet/tcp.h>
107 #include <netinet/tcp_fsm.h>
108 #include <netinet/tcp_seq.h>
109 #include <netinet/tcp_timer.h>
110 #include <netinet/tcp_timer2.h>
111 #include <netinet/tcp_var.h>
112 #include <netinet6/tcp6_var.h>
113 #include <netinet/tcpip.h>
116 #include <netinet/tcp_debug.h>
118 u_char tcp_saveipgen
[40]; /* the size must be of max ip header, now IPv6 */
119 struct tcphdr tcp_savetcp
;
123 #include <netproto/ipsec/ipsec.h>
124 #include <netproto/ipsec/ipsec6.h>
128 #include <netinet6/ipsec.h>
129 #include <netinet6/ipsec6.h>
130 #include <netproto/key/key.h>
134 * Limit burst of new packets during SACK based fast recovery
135 * or extended limited transmit.
137 #define TCP_SACK_MAXBURST 4
139 MALLOC_DEFINE(M_TSEGQ
, "tseg_qent", "TCP segment queue entry");
141 static int log_in_vain
= 0;
142 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, log_in_vain
, CTLFLAG_RW
,
143 &log_in_vain
, 0, "Log all incoming TCP connections");
145 static int blackhole
= 0;
146 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, blackhole
, CTLFLAG_RW
,
147 &blackhole
, 0, "Do not send RST when dropping refused connections");
149 int tcp_delack_enabled
= 1;
150 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, delayed_ack
, CTLFLAG_RW
,
151 &tcp_delack_enabled
, 0,
152 "Delay ACK to try and piggyback it onto a data packet");
154 #ifdef TCP_DROP_SYNFIN
155 static int drop_synfin
= 0;
156 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, drop_synfin
, CTLFLAG_RW
,
157 &drop_synfin
, 0, "Drop TCP packets with SYN+FIN set");
160 static int tcp_do_limitedtransmit
= 1;
161 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, limitedtransmit
, CTLFLAG_RW
,
162 &tcp_do_limitedtransmit
, 0, "Enable RFC 3042 (Limited Transmit)");
164 static int tcp_do_early_retransmit
= 1;
165 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, earlyretransmit
, CTLFLAG_RW
,
166 &tcp_do_early_retransmit
, 0, "Early retransmit");
168 int tcp_aggregate_acks
= 1;
169 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, aggregate_acks
, CTLFLAG_RW
,
170 &tcp_aggregate_acks
, 0, "Aggregate built-up acks into one ack");
172 static int tcp_do_eifel_detect
= 1;
173 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, eifel
, CTLFLAG_RW
,
174 &tcp_do_eifel_detect
, 0, "Eifel detection algorithm (RFC 3522)");
176 static int tcp_do_abc
= 1;
177 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, abc
, CTLFLAG_RW
,
179 "TCP Appropriate Byte Counting (RFC 3465)");
182 * The following value actually takes range [25ms, 250ms],
183 * given that most modern systems use 1ms ~ 10ms as the unit
184 * of timestamp option.
186 static u_int tcp_paws_tolerance
= 25;
187 SYSCTL_UINT(_net_inet_tcp
, OID_AUTO
, paws_tolerance
, CTLFLAG_RW
,
188 &tcp_paws_tolerance
, 0, "RFC1323 PAWS tolerance");
191 * Define as tunable for easy testing with SACK on and off.
192 * Warning: do not change setting in the middle of an existing active TCP flow,
193 * else strange things might happen to that flow.
196 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, sack
, CTLFLAG_RW
,
197 &tcp_do_sack
, 0, "Enable SACK Algorithms");
199 int tcp_do_smartsack
= 1;
200 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, smartsack
, CTLFLAG_RW
,
201 &tcp_do_smartsack
, 0, "Enable Smart SACK Algorithms");
203 int tcp_do_rescuesack
= 1;
204 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, rescuesack
, CTLFLAG_RW
,
205 &tcp_do_rescuesack
, 0, "Rescue retransmission for SACK");
207 int tcp_aggressive_rescuesack
= 0;
208 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, rescuesack_agg
, CTLFLAG_RW
,
209 &tcp_aggressive_rescuesack
, 0, "Aggressive rescue retransmission for SACK");
211 static int tcp_force_sackrxt
= 1;
212 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, force_sackrxt
, CTLFLAG_RW
,
213 &tcp_force_sackrxt
, 0, "Allowed forced SACK retransmit burst");
215 int tcp_do_rfc6675
= 1;
216 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, rfc6675
, CTLFLAG_RW
,
217 &tcp_do_rfc6675
, 0, "Enable RFC6675");
219 int tcp_rfc6675_rxt
= 0;
220 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, rfc6675_rxt
, CTLFLAG_RW
,
221 &tcp_rfc6675_rxt
, 0, "Enable RFC6675 retransmit");
223 SYSCTL_NODE(_net_inet_tcp
, OID_AUTO
, reass
, CTLFLAG_RW
, 0,
224 "TCP Segment Reassembly Queue");
226 int tcp_reass_maxseg
= 0;
227 SYSCTL_INT(_net_inet_tcp_reass
, OID_AUTO
, maxsegments
, CTLFLAG_RD
,
228 &tcp_reass_maxseg
, 0,
229 "Global maximum number of TCP Segments in Reassembly Queue");
231 int tcp_reass_qsize
= 0;
232 SYSCTL_INT(_net_inet_tcp_reass
, OID_AUTO
, cursegments
, CTLFLAG_RD
,
234 "Global number of TCP Segments currently in Reassembly Queue");
236 static int tcp_reass_overflows
= 0;
237 SYSCTL_INT(_net_inet_tcp_reass
, OID_AUTO
, overflows
, CTLFLAG_RD
,
238 &tcp_reass_overflows
, 0,
239 "Global number of TCP Segment Reassembly Queue Overflows");
241 int tcp_do_autorcvbuf
= 1;
242 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, recvbuf_auto
, CTLFLAG_RW
,
243 &tcp_do_autorcvbuf
, 0, "Enable automatic receive buffer sizing");
245 int tcp_autorcvbuf_inc
= 16*1024;
246 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, recvbuf_inc
, CTLFLAG_RW
,
247 &tcp_autorcvbuf_inc
, 0,
248 "Incrementor step size of automatic receive buffer");
250 int tcp_autorcvbuf_max
= 2*1024*1024;
251 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, recvbuf_max
, CTLFLAG_RW
,
252 &tcp_autorcvbuf_max
, 0, "Max size of automatic receive buffer");
254 int tcp_sosend_agglim
= 2;
255 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, sosend_agglim
, CTLFLAG_RW
,
256 &tcp_sosend_agglim
, 0, "TCP sosend mbuf aggregation limit");
258 int tcp_sosend_async
= 1;
259 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, sosend_async
, CTLFLAG_RW
,
260 &tcp_sosend_async
, 0, "TCP asynchronized pru_send");
262 int tcp_sosend_jcluster
= 1;
263 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, sosend_jcluster
, CTLFLAG_RW
,
264 &tcp_sosend_jcluster
, 0, "TCP output uses jcluster");
266 static int tcp_ignore_redun_dsack
= 1;
267 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, ignore_redun_dsack
, CTLFLAG_RW
,
268 &tcp_ignore_redun_dsack
, 0, "Ignore redundant DSACK");
270 static int tcp_reuseport_ext
= 1;
271 SYSCTL_INT(_net_inet_tcp
, OID_AUTO
, reuseport_ext
, CTLFLAG_RW
,
272 &tcp_reuseport_ext
, 0, "SO_REUSEPORT extension");
274 static void tcp_dooptions(struct tcpopt
*, u_char
*, int, boolean_t
,
276 static void tcp_pulloutofband(struct socket
*,
277 struct tcphdr
*, struct mbuf
*, int);
278 static int tcp_reass(struct tcpcb
*, struct tcphdr
*, int *,
280 static void tcp_xmit_timer(struct tcpcb
*, int, tcp_seq
);
281 static void tcp_newreno_partial_ack(struct tcpcb
*, struct tcphdr
*, int);
282 static void tcp_sack_rexmt(struct tcpcb
*, boolean_t
);
283 static boolean_t
tcp_sack_limitedxmit(struct tcpcb
*);
284 static int tcp_rmx_msl(const struct tcpcb
*);
285 static void tcp_established(struct tcpcb
*);
286 static boolean_t
tcp_recv_dupack(struct tcpcb
*, tcp_seq
, u_int
);
288 /* Neighbor Discovery, Neighbor Unreachability Detection Upper layer hint. */
290 #define ND6_HINT(tp) \
292 if ((tp) && (tp)->t_inpcb && \
293 INP_ISIPV6((tp)->t_inpcb) && \
294 (tp)->t_inpcb->in6p_route.ro_rt) \
295 nd6_nud_hint((tp)->t_inpcb->in6p_route.ro_rt, NULL, 0); \
302 * Indicate whether this ack should be delayed. We can delay the ack if
303 * - delayed acks are enabled and
304 * - there is no delayed ack timer in progress and
305 * - our last ack wasn't a 0-sized window. We never want to delay
306 * the ack that opens up a 0-sized window.
308 #define DELAY_ACK(tp) \
309 (tcp_delack_enabled && !tcp_callout_pending(tp, tp->tt_delack) && \
310 !(tp->t_flags & TF_RXWIN0SENT))
312 #define acceptable_window_update(tp, th, tiwin) \
313 (SEQ_LT(tp->snd_wl1, th->th_seq) || \
314 (tp->snd_wl1 == th->th_seq && \
315 (SEQ_LT(tp->snd_wl2, th->th_ack) || \
316 (tp->snd_wl2 == th->th_ack && tiwin > tp->snd_wnd))))
318 #define iceildiv(n, d) (((n)+(d)-1) / (d))
319 #define need_early_retransmit(tp, ownd) \
320 (tcp_do_early_retransmit && \
321 (tcp_do_eifel_detect && (tp->t_flags & TF_RCVD_TSTMP)) && \
322 ownd < ((tp->t_rxtthresh + 1) * tp->t_maxseg) && \
323 tp->t_dupacks + 1 >= iceildiv(ownd, tp->t_maxseg) && \
324 (!TCP_DO_SACK(tp) || ownd <= tp->t_maxseg || \
325 tcp_sack_has_sacked(&tp->scb, ownd - tp->t_maxseg)))
328 * Returns TRUE, if this segment can be merged with the last
329 * pending segment in the reassemble queue and this segment
330 * does not overlap with the pending segment immediately
331 * preceeding the last pending segment.
333 static __inline boolean_t
334 tcp_paws_canreasslast(const struct tcpcb
*tp
, const struct tcphdr
*th
, int tlen
)
336 const struct tseg_qent
*last
, *prev
;
338 last
= TAILQ_LAST(&tp
->t_segq
, tsegqe_head
);
342 /* This segment comes immediately after the last pending segment */
343 if (last
->tqe_th
->th_seq
+ last
->tqe_len
== th
->th_seq
) {
344 if (last
->tqe_th
->th_flags
& TH_FIN
) {
345 /* No segments should follow segment w/ FIN */
351 if (th
->th_seq
+ tlen
!= last
->tqe_th
->th_seq
)
353 /* This segment comes immediately before the last pending segment */
355 prev
= TAILQ_PREV(last
, tsegqe_head
, tqe_q
);
358 * No pending preceeding segment, we assume this segment
359 * could be reassembled.
364 /* This segment does not overlap with the preceeding segment */
365 if (SEQ_GEQ(th
->th_seq
, prev
->tqe_th
->th_seq
+ prev
->tqe_len
))
372 tcp_ncr_update_rxtthresh(struct tcpcb
*tp
)
374 int old_rxtthresh
= tp
->t_rxtthresh
;
375 uint32_t ownd
= tp
->snd_max
- tp
->snd_una
;
377 tp
->t_rxtthresh
= min(tcp_ncr_rxtthresh_max
,
378 max(tcprexmtthresh
, ((ownd
/ tp
->t_maxseg
) >> 1)));
379 if (tp
->t_rxtthresh
!= old_rxtthresh
) {
380 tcp_sack_update_lostseq(&tp
->scb
, tp
->snd_una
,
381 tp
->t_maxseg
, tp
->t_rxtthresh
);
386 tcp_reass(struct tcpcb
*tp
, struct tcphdr
*th
, int *tlenp
, struct mbuf
*m
)
389 struct tseg_qent
*p
= NULL
;
390 struct tseg_qent
*te
;
391 struct socket
*so
= tp
->t_inpcb
->inp_socket
;
395 * Call with th == NULL after become established to
396 * force pre-ESTABLISHED data up to user socket.
402 * Limit the number of segments in the reassembly queue to prevent
403 * holding on to too many segments (and thus running out of mbufs).
404 * Make sure to let the missing segment through which caused this
405 * queue. Always keep one global queue entry spare to be able to
406 * process the missing segment.
408 if (th
->th_seq
!= tp
->rcv_nxt
&&
409 tcp_reass_qsize
+ 1 >= tcp_reass_maxseg
) {
410 tcp_reass_overflows
++;
411 tcpstat
.tcps_rcvmemdrop
++;
413 /* no SACK block to report */
414 tp
->reportblk
.rblk_start
= tp
->reportblk
.rblk_end
;
418 /* Allocate a new queue entry. */
419 te
= kmalloc(sizeof(struct tseg_qent
), M_TSEGQ
, M_INTWAIT
| M_NULLOK
);
421 tcpstat
.tcps_rcvmemdrop
++;
423 /* no SACK block to report */
424 tp
->reportblk
.rblk_start
= tp
->reportblk
.rblk_end
;
427 atomic_add_int(&tcp_reass_qsize
, 1);
429 if (th
->th_flags
& TH_FIN
)
430 tp
->t_flags
|= TF_QUEDFIN
;
433 * Find a segment which begins after this one does.
435 TAILQ_FOREACH(q
, &tp
->t_segq
, tqe_q
) {
436 if (SEQ_GT(q
->tqe_th
->th_seq
, th
->th_seq
))
442 * If there is a preceding segment, it may provide some of
443 * our data already. If so, drop the data from the incoming
444 * segment. If it provides all of our data, drop us.
449 /* conversion to int (in i) handles seq wraparound */
450 i
= p
->tqe_th
->th_seq
+ p
->tqe_len
- th
->th_seq
;
451 if (i
> 0) { /* overlaps preceding segment */
453 (TSACK_F_DUPSEG
| TSACK_F_ENCLOSESEG
);
454 /* enclosing block starts w/ preceding segment */
455 tp
->encloseblk
.rblk_start
= p
->tqe_th
->th_seq
;
457 if (th
->th_flags
& TH_FIN
)
458 p
->tqe_th
->th_flags
|= TH_FIN
;
460 /* preceding encloses incoming segment */
461 tp
->encloseblk
.rblk_end
= TCP_SACK_BLKEND(
462 p
->tqe_th
->th_seq
+ p
->tqe_len
,
463 p
->tqe_th
->th_flags
);
464 tcpstat
.tcps_rcvduppack
++;
465 tcpstat
.tcps_rcvdupbyte
+= *tlenp
;
468 atomic_add_int(&tcp_reass_qsize
, -1);
470 * Try to present any queued data
471 * at the left window edge to the user.
472 * This is needed after the 3-WHS
475 goto present
; /* ??? */
480 /* incoming segment end is enclosing block end */
481 tp
->encloseblk
.rblk_end
= TCP_SACK_BLKEND(
482 th
->th_seq
+ *tlenp
, th
->th_flags
);
483 /* trim end of reported D-SACK block */
484 tp
->reportblk
.rblk_end
= th
->th_seq
;
487 tcpstat
.tcps_rcvoopack
++;
488 tcpstat
.tcps_rcvoobyte
+= *tlenp
;
491 * While we overlap succeeding segments trim them or,
492 * if they are completely covered, dequeue them.
495 tcp_seq_diff_t i
= (th
->th_seq
+ *tlenp
) - q
->tqe_th
->th_seq
;
496 tcp_seq qend
= q
->tqe_th
->th_seq
+ q
->tqe_len
;
497 tcp_seq qend_sack
= TCP_SACK_BLKEND(qend
, q
->tqe_th
->th_flags
);
498 struct tseg_qent
*nq
;
502 if (!(tp
->sack_flags
& TSACK_F_DUPSEG
)) {
503 /* first time through */
504 tp
->sack_flags
|= (TSACK_F_DUPSEG
| TSACK_F_ENCLOSESEG
);
505 tp
->encloseblk
= tp
->reportblk
;
506 /* report trailing duplicate D-SACK segment */
507 tp
->reportblk
.rblk_start
= q
->tqe_th
->th_seq
;
509 if ((tp
->sack_flags
& TSACK_F_ENCLOSESEG
) &&
510 SEQ_GT(qend_sack
, tp
->encloseblk
.rblk_end
)) {
511 /* extend enclosing block if one exists */
512 tp
->encloseblk
.rblk_end
= qend_sack
;
514 if (i
< q
->tqe_len
) {
515 q
->tqe_th
->th_seq
+= i
;
521 if (q
->tqe_th
->th_flags
& TH_FIN
)
522 th
->th_flags
|= TH_FIN
;
524 nq
= TAILQ_NEXT(q
, tqe_q
);
525 TAILQ_REMOVE(&tp
->t_segq
, q
, tqe_q
);
528 atomic_add_int(&tcp_reass_qsize
, -1);
532 /* Insert the new segment queue entry into place. */
535 te
->tqe_len
= *tlenp
;
537 /* check if can coalesce with following segment */
538 if (q
!= NULL
&& (th
->th_seq
+ *tlenp
== q
->tqe_th
->th_seq
)) {
541 te
->tqe_len
+= q
->tqe_len
;
542 if (q
->tqe_th
->th_flags
& TH_FIN
)
543 te
->tqe_th
->th_flags
|= TH_FIN
;
544 tend_sack
= TCP_SACK_BLKEND(te
->tqe_th
->th_seq
+ te
->tqe_len
,
545 te
->tqe_th
->th_flags
);
547 m_cat(te
->tqe_m
, q
->tqe_m
);
548 tp
->encloseblk
.rblk_end
= tend_sack
;
550 * When not reporting a duplicate segment, use
551 * the larger enclosing block as the SACK block.
553 if (!(tp
->sack_flags
& TSACK_F_DUPSEG
))
554 tp
->reportblk
.rblk_end
= tend_sack
;
555 TAILQ_REMOVE(&tp
->t_segq
, q
, tqe_q
);
557 atomic_add_int(&tcp_reass_qsize
, -1);
561 TAILQ_INSERT_HEAD(&tp
->t_segq
, te
, tqe_q
);
563 /* check if can coalesce with preceding segment */
564 if (p
->tqe_th
->th_seq
+ p
->tqe_len
== th
->th_seq
) {
565 if (te
->tqe_th
->th_flags
& TH_FIN
)
566 p
->tqe_th
->th_flags
|= TH_FIN
;
567 p
->tqe_len
+= te
->tqe_len
;
568 m_cat(p
->tqe_m
, te
->tqe_m
);
569 tp
->encloseblk
.rblk_start
= p
->tqe_th
->th_seq
;
571 * When not reporting a duplicate segment, use
572 * the larger enclosing block as the SACK block.
574 if (!(tp
->sack_flags
& TSACK_F_DUPSEG
))
575 tp
->reportblk
.rblk_start
= p
->tqe_th
->th_seq
;
577 atomic_add_int(&tcp_reass_qsize
, -1);
579 TAILQ_INSERT_AFTER(&tp
->t_segq
, p
, te
, tqe_q
);
585 * Present data to user, advancing rcv_nxt through
586 * completed sequence space.
588 if (!TCPS_HAVEESTABLISHED(tp
->t_state
))
590 q
= TAILQ_FIRST(&tp
->t_segq
);
591 if (q
== NULL
|| q
->tqe_th
->th_seq
!= tp
->rcv_nxt
)
593 tp
->rcv_nxt
+= q
->tqe_len
;
594 if (!(tp
->sack_flags
& TSACK_F_DUPSEG
)) {
595 /* no SACK block to report since ACK advanced */
596 tp
->reportblk
.rblk_start
= tp
->reportblk
.rblk_end
;
598 /* no enclosing block to report since ACK advanced */
599 tp
->sack_flags
&= ~TSACK_F_ENCLOSESEG
;
600 flags
= q
->tqe_th
->th_flags
& TH_FIN
;
601 TAILQ_REMOVE(&tp
->t_segq
, q
, tqe_q
);
602 KASSERT(TAILQ_EMPTY(&tp
->t_segq
) ||
603 TAILQ_FIRST(&tp
->t_segq
)->tqe_th
->th_seq
!= tp
->rcv_nxt
,
604 ("segment not coalesced"));
605 if (so
->so_state
& SS_CANTRCVMORE
) {
608 lwkt_gettoken(&so
->so_rcv
.ssb_token
);
609 ssb_appendstream(&so
->so_rcv
, q
->tqe_m
);
610 lwkt_reltoken(&so
->so_rcv
.ssb_token
);
613 atomic_add_int(&tcp_reass_qsize
, -1);
620 * TCP input routine, follows pages 65-76 of the
621 * protocol specification dated September, 1981 very closely.
625 tcp6_input(struct mbuf
**mp
, int *offp
, int proto
)
627 struct mbuf
*m
= *mp
;
628 struct in6_ifaddr
*ia6
;
630 IP6_EXTHDR_CHECK(m
, *offp
, sizeof(struct tcphdr
), IPPROTO_DONE
);
633 * draft-itojun-ipv6-tcp-to-anycast
634 * better place to put this in?
636 ia6
= ip6_getdstifaddr(m
);
637 if (ia6
&& (ia6
->ia6_flags
& IN6_IFF_ANYCAST
)) {
638 icmp6_error(m
, ICMP6_DST_UNREACH
, ICMP6_DST_UNREACH_ADDR
,
639 offsetof(struct ip6_hdr
, ip6_dst
));
640 return (IPPROTO_DONE
);
643 tcp_input(mp
, offp
, proto
);
644 return (IPPROTO_DONE
);
649 tcp_input(struct mbuf
**mp
, int *offp
, int proto
)
653 struct ip
*ip
= NULL
;
655 struct inpcb
*inp
= NULL
;
661 struct tcpcb
*tp
= NULL
;
663 struct socket
*so
= NULL
;
665 boolean_t ourfinisacked
, needoutput
= FALSE
, delayed_dupack
= FALSE
;
666 tcp_seq th_dupack
= 0; /* XXX gcc warning */
667 u_int to_flags
= 0; /* XXX gcc warning */
670 struct tcpopt to
; /* options in this segment */
671 struct sockaddr_in
*next_hop
= NULL
;
672 int rstreason
; /* For badport_bandlim accounting purposes */
674 struct ip6_hdr
*ip6
= NULL
;
679 const boolean_t isipv6
= FALSE
;
689 tcpstat
.tcps_rcvtotal
++;
691 if (m
->m_pkthdr
.fw_flags
& IPFORWARD_MBUF_TAGGED
) {
694 mtag
= m_tag_find(m
, PACKET_TAG_IPFORWARD
, NULL
);
695 KKASSERT(mtag
!= NULL
);
696 next_hop
= m_tag_data(mtag
);
700 isipv6
= (mtod(m
, struct ip
*)->ip_v
== 6) ? TRUE
: FALSE
;
704 /* IP6_EXTHDR_CHECK() is already done at tcp6_input() */
705 ip6
= mtod(m
, struct ip6_hdr
*);
706 tlen
= (sizeof *ip6
) + ntohs(ip6
->ip6_plen
) - off0
;
707 if (in6_cksum(m
, IPPROTO_TCP
, off0
, tlen
)) {
708 tcpstat
.tcps_rcvbadsum
++;
711 th
= (struct tcphdr
*)((caddr_t
)ip6
+ off0
);
714 * Be proactive about unspecified IPv6 address in source.
715 * As we use all-zero to indicate unbounded/unconnected pcb,
716 * unspecified IPv6 address can be used to confuse us.
718 * Note that packets with unspecified IPv6 destination is
719 * already dropped in ip6_input.
721 if (IN6_IS_ADDR_UNSPECIFIED(&ip6
->ip6_src
)) {
727 * Get IP and TCP header together in first mbuf.
728 * Note: IP leaves IP header in first mbuf.
730 if (off0
> sizeof(struct ip
)) {
732 off0
= sizeof(struct ip
);
734 /* already checked and pulled up in ip_demux() */
735 KASSERT(m
->m_len
>= sizeof(struct tcpiphdr
),
736 ("TCP header not in one mbuf: m->m_len %d", m
->m_len
));
737 ip
= mtod(m
, struct ip
*);
738 ipov
= (struct ipovly
*)ip
;
739 th
= (struct tcphdr
*)((caddr_t
)ip
+ off0
);
742 if (m
->m_pkthdr
.csum_flags
& CSUM_DATA_VALID
) {
743 if (m
->m_pkthdr
.csum_flags
& CSUM_PSEUDO_HDR
)
744 th
->th_sum
= m
->m_pkthdr
.csum_data
;
746 th
->th_sum
= in_pseudo(ip
->ip_src
.s_addr
,
748 htonl(m
->m_pkthdr
.csum_data
+
751 th
->th_sum
^= 0xffff;
754 * Checksum extended TCP header and data.
756 len
= sizeof(struct ip
) + tlen
;
757 bzero(ipov
->ih_x1
, sizeof ipov
->ih_x1
);
758 ipov
->ih_len
= (u_short
)tlen
;
759 ipov
->ih_len
= htons(ipov
->ih_len
);
760 th
->th_sum
= in_cksum(m
, len
);
763 tcpstat
.tcps_rcvbadsum
++;
767 /* Re-initialization for later version check */
768 ip
->ip_v
= IPVERSION
;
773 * Check that TCP offset makes sense,
774 * pull out TCP options and adjust length. XXX
776 off
= th
->th_off
<< 2;
777 /* already checked and pulled up in ip_demux() */
778 KASSERT(off
>= sizeof(struct tcphdr
) && off
<= tlen
,
779 ("bad TCP data offset %d (tlen %d)", off
, tlen
));
780 tlen
-= off
; /* tlen is used instead of ti->ti_len */
781 if (off
> sizeof(struct tcphdr
)) {
783 IP6_EXTHDR_CHECK(m
, off0
, off
, IPPROTO_DONE
);
784 ip6
= mtod(m
, struct ip6_hdr
*);
785 th
= (struct tcphdr
*)((caddr_t
)ip6
+ off0
);
787 /* already pulled up in ip_demux() */
788 KASSERT(m
->m_len
>= sizeof(struct ip
) + off
,
789 ("TCP header and options not in one mbuf: "
790 "m_len %d, off %d", m
->m_len
, off
));
792 optlen
= off
- sizeof(struct tcphdr
);
793 optp
= (u_char
*)(th
+ 1);
795 thflags
= th
->th_flags
;
797 #ifdef TCP_DROP_SYNFIN
799 * If the drop_synfin option is enabled, drop all packets with
800 * both the SYN and FIN bits set. This prevents e.g. nmap from
801 * identifying the TCP/IP stack.
803 * This is a violation of the TCP specification.
805 if (drop_synfin
&& (thflags
& (TH_SYN
| TH_FIN
)) == (TH_SYN
| TH_FIN
))
810 * Convert TCP protocol specific fields to host format.
812 th
->th_seq
= ntohl(th
->th_seq
);
813 th
->th_ack
= ntohl(th
->th_ack
);
814 th
->th_win
= ntohs(th
->th_win
);
815 th
->th_urp
= ntohs(th
->th_urp
);
818 * Delay dropping TCP, IP headers, IPv6 ext headers, and TCP options,
819 * until after ip6_savecontrol() is called and before other functions
820 * which don't want those proto headers.
821 * Because ip6_savecontrol() is going to parse the mbuf to
822 * search for data to be passed up to user-land, it wants mbuf
823 * parameters to be unchanged.
824 * XXX: the call of ip6_savecontrol() has been obsoleted based on
825 * latest version of the advanced API (20020110).
827 drop_hdrlen
= off0
+ off
;
830 * Locate pcb for segment.
833 /* IPFIREWALL_FORWARD section */
834 if (next_hop
!= NULL
&& !isipv6
) { /* IPv6 support is not there yet */
836 * Transparently forwarded. Pretend to be the destination.
837 * already got one like this?
839 cpu
= mycpu
->gd_cpuid
;
840 inp
= in_pcblookup_hash(&tcbinfo
[cpu
],
841 ip
->ip_src
, th
->th_sport
,
842 ip
->ip_dst
, th
->th_dport
,
843 0, m
->m_pkthdr
.rcvif
);
846 * It's new. Try to find the ambushing socket.
850 * The rest of the ipfw code stores the port in
852 * (The IP address is still in network order.)
854 in_port_t dport
= next_hop
->sin_port
?
855 htons(next_hop
->sin_port
) :
858 cpu
= tcp_addrcpu(ip
->ip_src
.s_addr
, th
->th_sport
,
859 next_hop
->sin_addr
.s_addr
, dport
);
860 inp
= in_pcblookup_hash(&tcbinfo
[cpu
],
861 ip
->ip_src
, th
->th_sport
,
862 next_hop
->sin_addr
, dport
,
863 1, m
->m_pkthdr
.rcvif
);
867 inp
= in6_pcblookup_hash(&tcbinfo
[0],
868 &ip6
->ip6_src
, th
->th_sport
,
869 &ip6
->ip6_dst
, th
->th_dport
,
870 1, m
->m_pkthdr
.rcvif
);
872 cpu
= mycpu
->gd_cpuid
;
873 inp
= in_pcblookup_pkthash(&tcbinfo
[cpu
],
874 ip
->ip_src
, th
->th_sport
,
875 ip
->ip_dst
, th
->th_dport
,
876 1, m
->m_pkthdr
.rcvif
,
877 tcp_reuseport_ext
? m
: NULL
);
882 * If the state is CLOSED (i.e., TCB does not exist) then
883 * all data in the incoming segment is discarded.
884 * If the TCB exists but is in CLOSED state, it is embryonic,
885 * but should either do a listen or a connect soon.
890 char dbuf
[INET6_ADDRSTRLEN
+2], sbuf
[INET6_ADDRSTRLEN
+2];
892 char dbuf
[sizeof "aaa.bbb.ccc.ddd"];
893 char sbuf
[sizeof "aaa.bbb.ccc.ddd"];
897 strcat(dbuf
, ip6_sprintf(&ip6
->ip6_dst
));
900 strcat(sbuf
, ip6_sprintf(&ip6
->ip6_src
));
903 strcpy(dbuf
, inet_ntoa(ip
->ip_dst
));
904 strcpy(sbuf
, inet_ntoa(ip
->ip_src
));
906 switch (log_in_vain
) {
908 if (!(thflags
& TH_SYN
))
912 "Connection attempt to TCP %s:%d "
913 "from %s:%d flags:0x%02x\n",
914 dbuf
, ntohs(th
->th_dport
), sbuf
,
915 ntohs(th
->th_sport
), thflags
);
924 if (thflags
& TH_SYN
)
933 rstreason
= BANDLIM_RST_CLOSEDPORT
;
939 if (ipsec6_in_reject_so(m
, inp
->inp_socket
)) {
940 ipsec6stat
.in_polvio
++;
944 if (ipsec4_in_reject_so(m
, inp
->inp_socket
)) {
945 ipsecstat
.in_polvio
++;
952 if (ipsec6_in_reject(m
, inp
))
955 if (ipsec4_in_reject(m
, inp
))
959 /* Check the minimum TTL for socket. */
961 if ((isipv6
? ip6
->ip6_hlim
: ip
->ip_ttl
) < inp
->inp_ip_minttl
)
966 KASSERT(tp
!= NULL
, ("tcp_input: tp is NULL"));
967 if (tp
->t_state
<= TCPS_CLOSED
)
970 so
= inp
->inp_socket
;
973 if (so
->so_options
& SO_DEBUG
) {
974 ostate
= tp
->t_state
;
976 bcopy(ip6
, tcp_saveipgen
, sizeof(*ip6
));
978 bcopy(ip
, tcp_saveipgen
, sizeof(*ip
));
983 bzero(&to
, sizeof to
);
985 if (so
->so_options
& SO_ACCEPTCONN
) {
986 struct in_conninfo inc
;
989 inc
.inc_isipv6
= (isipv6
== TRUE
);
992 inc
.inc6_faddr
= ip6
->ip6_src
;
993 inc
.inc6_laddr
= ip6
->ip6_dst
;
994 inc
.inc6_route
.ro_rt
= NULL
; /* XXX */
996 inc
.inc_faddr
= ip
->ip_src
;
997 inc
.inc_laddr
= ip
->ip_dst
;
998 inc
.inc_route
.ro_rt
= NULL
; /* XXX */
1000 inc
.inc_fport
= th
->th_sport
;
1001 inc
.inc_lport
= th
->th_dport
;
1004 * If the state is LISTEN then ignore segment if it contains
1005 * a RST. If the segment contains an ACK then it is bad and
1006 * send a RST. If it does not contain a SYN then it is not
1007 * interesting; drop it.
1009 * If the state is SYN_RECEIVED (syncache) and seg contains
1010 * an ACK, but not for our SYN/ACK, send a RST. If the seg
1011 * contains a RST, check the sequence number to see if it
1012 * is a valid reset segment.
1014 if ((thflags
& (TH_RST
| TH_ACK
| TH_SYN
)) != TH_SYN
) {
1015 if ((thflags
& (TH_RST
| TH_ACK
| TH_SYN
)) == TH_ACK
) {
1016 if (!syncache_expand(&inc
, th
, &so
, m
)) {
1018 * No syncache entry, or ACK was not
1019 * for our SYN/ACK. Send a RST.
1021 tcpstat
.tcps_badsyn
++;
1022 rstreason
= BANDLIM_RST_OPENPORT
;
1027 * Could not complete 3-way handshake,
1028 * connection is being closed down, and
1029 * syncache will free mbuf.
1032 return(IPPROTO_DONE
);
1035 * We must be in the correct protocol thread
1036 * for this connection.
1038 KKASSERT(so
->so_port
== &curthread
->td_msgport
);
1041 * Socket is created in state SYN_RECEIVED.
1042 * Continue processing segment.
1045 tp
= intotcpcb(inp
);
1047 * This is what would have happened in
1048 * tcp_output() when the SYN,ACK was sent.
1050 tp
->snd_up
= tp
->snd_una
;
1051 tp
->snd_max
= tp
->snd_nxt
= tp
->iss
+ 1;
1052 tp
->last_ack_sent
= tp
->rcv_nxt
;
1056 if (thflags
& TH_RST
) {
1057 syncache_chkrst(&inc
, th
);
1060 if (thflags
& TH_ACK
) {
1061 syncache_badack(&inc
);
1062 tcpstat
.tcps_badsyn
++;
1063 rstreason
= BANDLIM_RST_OPENPORT
;
1070 * Segment's flags are (SYN) or (SYN | FIN).
1074 * If deprecated address is forbidden,
1075 * we do not accept SYN to deprecated interface
1076 * address to prevent any new inbound connection from
1077 * getting established.
1078 * When we do not accept SYN, we send a TCP RST,
1079 * with deprecated source address (instead of dropping
1080 * it). We compromise it as it is much better for peer
1081 * to send a RST, and RST will be the final packet
1084 * If we do not forbid deprecated addresses, we accept
1085 * the SYN packet. RFC2462 does not suggest dropping
1087 * If we decipher RFC2462 5.5.4, it says like this:
1088 * 1. use of deprecated addr with existing
1089 * communication is okay - "SHOULD continue to be
1091 * 2. use of it with new communication:
1092 * (2a) "SHOULD NOT be used if alternate address
1093 * with sufficient scope is available"
1094 * (2b) nothing mentioned otherwise.
1095 * Here we fall into (2b) case as we have no choice in
1096 * our source address selection - we must obey the peer.
1098 * The wording in RFC2462 is confusing, and there are
1099 * multiple description text for deprecated address
1100 * handling - worse, they are not exactly the same.
1101 * I believe 5.5.4 is the best one, so we follow 5.5.4.
1103 if (isipv6
&& !ip6_use_deprecated
) {
1104 struct in6_ifaddr
*ia6
;
1106 if ((ia6
= ip6_getdstifaddr(m
)) &&
1107 (ia6
->ia6_flags
& IN6_IFF_DEPRECATED
)) {
1109 rstreason
= BANDLIM_RST_OPENPORT
;
1115 * If it is from this socket, drop it, it must be forged.
1116 * Don't bother responding if the destination was a broadcast.
1118 if (th
->th_dport
== th
->th_sport
) {
1120 if (IN6_ARE_ADDR_EQUAL(&ip6
->ip6_dst
,
1124 if (ip
->ip_dst
.s_addr
== ip
->ip_src
.s_addr
)
1129 * RFC1122 4.2.3.10, p. 104: discard bcast/mcast SYN
1131 * Note that it is quite possible to receive unicast
1132 * link-layer packets with a broadcast IP address. Use
1133 * in_broadcast() to find them.
1135 if (m
->m_flags
& (M_BCAST
| M_MCAST
))
1138 if (IN6_IS_ADDR_MULTICAST(&ip6
->ip6_dst
) ||
1139 IN6_IS_ADDR_MULTICAST(&ip6
->ip6_src
))
1142 if (IN_MULTICAST(ntohl(ip
->ip_dst
.s_addr
)) ||
1143 IN_MULTICAST(ntohl(ip
->ip_src
.s_addr
)) ||
1144 ip
->ip_src
.s_addr
== htonl(INADDR_BROADCAST
) ||
1145 in_broadcast(ip
->ip_dst
, m
->m_pkthdr
.rcvif
))
1149 * SYN appears to be valid; create compressed TCP state
1150 * for syncache, or perform t/tcp connection.
1152 if (so
->so_qlen
<= so
->so_qlimit
) {
1153 tcp_dooptions(&to
, optp
, optlen
, TRUE
, th
->th_ack
);
1154 if (!syncache_add(&inc
, &to
, th
, so
, m
))
1158 * Entry added to syncache, mbuf used to
1159 * send SYN,ACK packet.
1161 return(IPPROTO_DONE
);
1168 * Should not happen - syncache should pick up these connections.
1170 * Once we are past handling listen sockets we must be in the
1171 * correct protocol processing thread.
1173 KASSERT(tp
->t_state
!= TCPS_LISTEN
, ("tcp_input: TCPS_LISTEN state"));
1174 KKASSERT(so
->so_port
== &curthread
->td_msgport
);
1176 /* Unscale the window into a 32-bit value. */
1177 if (!(thflags
& TH_SYN
))
1178 tiwin
= th
->th_win
<< tp
->snd_scale
;
1183 * This is the second part of the MSS DoS prevention code (after
1184 * minmss on the sending side) and it deals with too many too small
1185 * tcp packets in a too short timeframe (1 second).
1187 * XXX Removed. This code was crap. It does not scale to network
1188 * speed, and default values break NFS. Gone.
1193 * Segment received on connection.
1195 * Reset idle time and keep-alive timer. Don't waste time if less
1196 * then a second has elapsed.
1198 if ((int)(ticks
- tp
->t_rcvtime
) > hz
)
1199 tcp_timer_keep_activity(tp
, thflags
);
1203 * XXX this is tradtitional behavior, may need to be cleaned up.
1205 tcp_dooptions(&to
, optp
, optlen
, (thflags
& TH_SYN
) != 0, th
->th_ack
);
1206 if (tp
->t_state
== TCPS_SYN_SENT
&& (thflags
& TH_SYN
)) {
1207 if ((to
.to_flags
& TOF_SCALE
) && (tp
->t_flags
& TF_REQ_SCALE
)) {
1208 tp
->t_flags
|= TF_RCVD_SCALE
;
1209 tp
->snd_scale
= to
.to_requested_s_scale
;
1213 * Initial send window; will be updated upon next ACK
1215 tp
->snd_wnd
= th
->th_win
;
1217 if (to
.to_flags
& TOF_TS
) {
1218 tp
->t_flags
|= TF_RCVD_TSTMP
;
1219 tp
->ts_recent
= to
.to_tsval
;
1220 tp
->ts_recent_age
= ticks
;
1222 if (!(to
.to_flags
& TOF_MSS
))
1224 tcp_mss(tp
, to
.to_mss
);
1226 * Only set the TF_SACK_PERMITTED per-connection flag
1227 * if we got a SACK_PERMITTED option from the other side
1228 * and the global tcp_do_sack variable is true.
1230 if (tcp_do_sack
&& (to
.to_flags
& TOF_SACK_PERMITTED
))
1231 tp
->t_flags
|= TF_SACK_PERMITTED
;
1235 * Header prediction: check for the two common cases
1236 * of a uni-directional data xfer. If the packet has
1237 * no control flags, is in-sequence, the window didn't
1238 * change and we're not retransmitting, it's a
1239 * candidate. If the length is zero and the ack moved
1240 * forward, we're the sender side of the xfer. Just
1241 * free the data acked & wake any higher level process
1242 * that was blocked waiting for space. If the length
1243 * is non-zero and the ack didn't move, we're the
1244 * receiver side. If we're getting packets in-order
1245 * (the reassembly queue is empty), add the data to
1246 * the socket buffer and note that we need a delayed ack.
1247 * Make sure that the hidden state-flags are also off.
1248 * Since we check for TCPS_ESTABLISHED above, it can only
1251 if (tp
->t_state
== TCPS_ESTABLISHED
&&
1252 (thflags
& (TH_SYN
|TH_FIN
|TH_RST
|TH_URG
|TH_ACK
)) == TH_ACK
&&
1253 !(tp
->t_flags
& (TF_NEEDSYN
| TF_NEEDFIN
)) &&
1254 (!(to
.to_flags
& TOF_TS
) ||
1255 TSTMP_GEQ(to
.to_tsval
, tp
->ts_recent
)) &&
1256 th
->th_seq
== tp
->rcv_nxt
&&
1257 tp
->snd_nxt
== tp
->snd_max
) {
1260 * If last ACK falls within this segment's sequence numbers,
1261 * record the timestamp.
1262 * NOTE that the test is modified according to the latest
1263 * proposal of the tcplw@cray.com list (Braden 1993/04/26).
1265 if ((to
.to_flags
& TOF_TS
) &&
1266 SEQ_LEQ(th
->th_seq
, tp
->last_ack_sent
)) {
1267 tp
->ts_recent_age
= ticks
;
1268 tp
->ts_recent
= to
.to_tsval
;
1272 if (SEQ_GT(th
->th_ack
, tp
->snd_una
) &&
1273 SEQ_LEQ(th
->th_ack
, tp
->snd_max
) &&
1274 tp
->snd_cwnd
>= tp
->snd_wnd
&&
1275 !IN_FASTRECOVERY(tp
)) {
1277 * This is a pure ack for outstanding data.
1279 ++tcpstat
.tcps_predack
;
1281 * "bad retransmit" recovery
1283 * If Eifel detection applies, then
1284 * it is deterministic, so use it
1285 * unconditionally over the old heuristic.
1286 * Otherwise, fall back to the old heuristic.
1288 if (tcp_do_eifel_detect
&&
1289 (to
.to_flags
& TOF_TS
) && to
.to_tsecr
&&
1290 (tp
->rxt_flags
& TRXT_F_FIRSTACCACK
)) {
1291 /* Eifel detection applicable. */
1292 if (to
.to_tsecr
< tp
->t_rexmtTS
) {
1293 tcp_revert_congestion_state(tp
);
1294 ++tcpstat
.tcps_eifeldetected
;
1295 if (tp
->t_rxtshift
!= 1 ||
1296 ticks
>= tp
->t_badrxtwin
)
1297 ++tcpstat
.tcps_rttcantdetect
;
1299 } else if (tp
->t_rxtshift
== 1 &&
1300 ticks
< tp
->t_badrxtwin
) {
1301 tcp_revert_congestion_state(tp
);
1302 ++tcpstat
.tcps_rttdetected
;
1304 tp
->rxt_flags
&= ~(TRXT_F_FIRSTACCACK
|
1305 TRXT_F_FASTREXMT
| TRXT_F_EARLYREXMT
);
1307 * Recalculate the retransmit timer / rtt.
1309 * Some machines (certain windows boxes)
1310 * send broken timestamp replies during the
1311 * SYN+ACK phase, ignore timestamps of 0.
1313 if ((to
.to_flags
& TOF_TS
) && to
.to_tsecr
) {
1315 ticks
- to
.to_tsecr
+ 1,
1317 } else if (tp
->t_rtttime
&&
1318 SEQ_GT(th
->th_ack
, tp
->t_rtseq
)) {
1320 ticks
- tp
->t_rtttime
+ 1,
1323 tcp_xmit_bandwidth_limit(tp
, th
->th_ack
);
1324 acked
= th
->th_ack
- tp
->snd_una
;
1325 tcpstat
.tcps_rcvackpack
++;
1326 tcpstat
.tcps_rcvackbyte
+= acked
;
1327 sbdrop(&so
->so_snd
.sb
, acked
);
1328 tp
->snd_recover
= th
->th_ack
- 1;
1329 tp
->snd_una
= th
->th_ack
;
1332 * Update window information.
1334 if (tiwin
!= tp
->snd_wnd
&&
1335 acceptable_window_update(tp
, th
, tiwin
)) {
1336 /* keep track of pure window updates */
1337 if (tp
->snd_wl2
== th
->th_ack
&&
1338 tiwin
> tp
->snd_wnd
)
1339 tcpstat
.tcps_rcvwinupd
++;
1340 tp
->snd_wnd
= tiwin
;
1341 tp
->snd_wl1
= th
->th_seq
;
1342 tp
->snd_wl2
= th
->th_ack
;
1343 if (tp
->snd_wnd
> tp
->max_sndwnd
)
1344 tp
->max_sndwnd
= tp
->snd_wnd
;
1347 ND6_HINT(tp
); /* some progress has been done */
1349 * If all outstanding data are acked, stop
1350 * retransmit timer, otherwise restart timer
1351 * using current (possibly backed-off) value.
1352 * If process is waiting for space,
1353 * wakeup/selwakeup/signal. If data
1354 * are ready to send, let tcp_output
1355 * decide between more output or persist.
1357 if (tp
->snd_una
== tp
->snd_max
) {
1358 tcp_callout_stop(tp
, tp
->tt_rexmt
);
1359 } else if (!tcp_callout_active(tp
,
1361 tcp_callout_reset(tp
, tp
->tt_rexmt
,
1362 tp
->t_rxtcur
, tcp_timer_rexmt
);
1365 if (so
->so_snd
.ssb_cc
> 0 &&
1366 !tcp_output_pending(tp
))
1367 tcp_output_fair(tp
);
1368 return(IPPROTO_DONE
);
1370 } else if (tiwin
== tp
->snd_wnd
&&
1371 th
->th_ack
== tp
->snd_una
&&
1372 TAILQ_EMPTY(&tp
->t_segq
) &&
1373 tlen
<= ssb_space(&so
->so_rcv
)) {
1374 u_long newsize
= 0; /* automatic sockbuf scaling */
1376 * This is a pure, in-sequence data packet
1377 * with nothing on the reassembly queue and
1378 * we have enough buffer space to take it.
1380 ++tcpstat
.tcps_preddat
;
1381 tp
->rcv_nxt
+= tlen
;
1382 tcpstat
.tcps_rcvpack
++;
1383 tcpstat
.tcps_rcvbyte
+= tlen
;
1384 ND6_HINT(tp
); /* some progress has been done */
1386 * Automatic sizing of receive socket buffer. Often the send
1387 * buffer size is not optimally adjusted to the actual network
1388 * conditions at hand (delay bandwidth product). Setting the
1389 * buffer size too small limits throughput on links with high
1390 * bandwidth and high delay (eg. trans-continental/oceanic links).
1392 * On the receive side the socket buffer memory is only rarely
1393 * used to any significant extent. This allows us to be much
1394 * more aggressive in scaling the receive socket buffer. For
1395 * the case that the buffer space is actually used to a large
1396 * extent and we run out of kernel memory we can simply drop
1397 * the new segments; TCP on the sender will just retransmit it
1398 * later. Setting the buffer size too big may only consume too
1399 * much kernel memory if the application doesn't read() from
1400 * the socket or packet loss or reordering makes use of the
1403 * The criteria to step up the receive buffer one notch are:
1404 * 1. the number of bytes received during the time it takes
1405 * one timestamp to be reflected back to us (the RTT);
1406 * 2. received bytes per RTT is within seven eighth of the
1407 * current socket buffer size;
1408 * 3. receive buffer size has not hit maximal automatic size;
1410 * This algorithm does one step per RTT at most and only if
1411 * we receive a bulk stream w/o packet losses or reorderings.
1412 * Shrinking the buffer during idle times is not necessary as
1413 * it doesn't consume any memory when idle.
1415 * TODO: Only step up if the application is actually serving
1416 * the buffer to better manage the socket buffer resources.
1418 if (tcp_do_autorcvbuf
&&
1420 (so
->so_rcv
.ssb_flags
& SSB_AUTOSIZE
)) {
1421 if (to
.to_tsecr
> tp
->rfbuf_ts
&&
1422 to
.to_tsecr
- tp
->rfbuf_ts
< hz
) {
1424 (so
->so_rcv
.ssb_hiwat
/ 8 * 7) &&
1425 so
->so_rcv
.ssb_hiwat
<
1426 tcp_autorcvbuf_max
) {
1428 ulmin(so
->so_rcv
.ssb_hiwat
+
1430 tcp_autorcvbuf_max
);
1432 /* Start over with next RTT. */
1436 tp
->rfbuf_cnt
+= tlen
; /* add up */
1439 * Add data to socket buffer.
1441 if (so
->so_state
& SS_CANTRCVMORE
) {
1445 * Set new socket buffer size, give up when
1448 * Adjusting the size can mess up ACK
1449 * sequencing when pure window updates are
1450 * being avoided (which is the default),
1453 lwkt_gettoken(&so
->so_rcv
.ssb_token
);
1455 tp
->t_flags
|= TF_RXRESIZED
;
1456 if (!ssb_reserve(&so
->so_rcv
, newsize
,
1458 atomic_clear_int(&so
->so_rcv
.ssb_flags
, SSB_AUTOSIZE
);
1461 (TCP_MAXWIN
<< tp
->rcv_scale
)) {
1462 atomic_clear_int(&so
->so_rcv
.ssb_flags
, SSB_AUTOSIZE
);
1465 m_adj(m
, drop_hdrlen
); /* delayed header drop */
1466 ssb_appendstream(&so
->so_rcv
, m
);
1467 lwkt_reltoken(&so
->so_rcv
.ssb_token
);
1471 * This code is responsible for most of the ACKs
1472 * the TCP stack sends back after receiving a data
1473 * packet. Note that the DELAY_ACK check fails if
1474 * the delack timer is already running, which results
1475 * in an ack being sent every other packet (which is
1478 * We then further aggregate acks by not actually
1479 * sending one until the protocol thread has completed
1480 * processing the current backlog of packets. This
1481 * does not delay the ack any further, but allows us
1482 * to take advantage of the packet aggregation that
1483 * high speed NICs do (usually blocks of 8-10 packets)
1484 * to send a single ack rather then four or five acks,
1485 * greatly reducing the ack rate, the return channel
1486 * bandwidth, and the protocol overhead on both ends.
1488 * Since this also has the effect of slowing down
1489 * the exponential slow-start ramp-up, systems with
1490 * very large bandwidth-delay products might want
1491 * to turn the feature off.
1493 if (DELAY_ACK(tp
)) {
1494 tcp_callout_reset(tp
, tp
->tt_delack
,
1495 tcp_delacktime
, tcp_timer_delack
);
1496 } else if (tcp_aggregate_acks
) {
1497 tp
->t_flags
|= TF_ACKNOW
;
1498 if (!(tp
->t_flags
& TF_ONOUTPUTQ
)) {
1499 tp
->t_flags
|= TF_ONOUTPUTQ
;
1500 tp
->tt_cpu
= mycpu
->gd_cpuid
;
1502 &tcpcbackq
[tp
->tt_cpu
],
1506 tp
->t_flags
|= TF_ACKNOW
;
1509 return(IPPROTO_DONE
);
1514 * Calculate amount of space in receive window,
1515 * and then do TCP input processing.
1516 * Receive window is amount of space in rcv queue,
1517 * but not less than advertised window.
1519 recvwin
= ssb_space(&so
->so_rcv
);
1522 tp
->rcv_wnd
= imax(recvwin
, (int)(tp
->rcv_adv
- tp
->rcv_nxt
));
1524 /* Reset receive buffer auto scaling when not in bulk receive mode. */
1528 switch (tp
->t_state
) {
1530 * If the state is SYN_RECEIVED:
1531 * if seg contains an ACK, but not for our SYN/ACK, send a RST.
1533 case TCPS_SYN_RECEIVED
:
1534 if ((thflags
& TH_ACK
) &&
1535 (SEQ_LEQ(th
->th_ack
, tp
->snd_una
) ||
1536 SEQ_GT(th
->th_ack
, tp
->snd_max
))) {
1537 rstreason
= BANDLIM_RST_OPENPORT
;
1543 * If the state is SYN_SENT:
1544 * if seg contains an ACK, but not for our SYN, drop the input.
1545 * if seg contains a RST, then drop the connection.
1546 * if seg does not contain SYN, then drop it.
1547 * Otherwise this is an acceptable SYN segment
1548 * initialize tp->rcv_nxt and tp->irs
1549 * if seg contains ack then advance tp->snd_una
1550 * if SYN has been acked change to ESTABLISHED else SYN_RCVD state
1551 * arrange for segment to be acked (eventually)
1552 * continue processing rest of data/controls, beginning with URG
1555 if ((thflags
& TH_ACK
) &&
1556 (SEQ_LEQ(th
->th_ack
, tp
->iss
) ||
1557 SEQ_GT(th
->th_ack
, tp
->snd_max
))) {
1558 rstreason
= BANDLIM_UNLIMITED
;
1561 if (thflags
& TH_RST
) {
1562 if (thflags
& TH_ACK
)
1563 tp
= tcp_drop(tp
, ECONNREFUSED
);
1566 if (!(thflags
& TH_SYN
))
1569 tp
->irs
= th
->th_seq
;
1571 if (thflags
& TH_ACK
) {
1572 /* Our SYN was acked. */
1573 tcpstat
.tcps_connects
++;
1575 /* Do window scaling on this connection? */
1576 if ((tp
->t_flags
& (TF_RCVD_SCALE
| TF_REQ_SCALE
)) ==
1577 (TF_RCVD_SCALE
| TF_REQ_SCALE
))
1578 tp
->rcv_scale
= tp
->request_r_scale
;
1579 tp
->rcv_adv
+= tp
->rcv_wnd
;
1580 tp
->snd_una
++; /* SYN is acked */
1581 tcp_callout_stop(tp
, tp
->tt_rexmt
);
1583 * If there's data, delay ACK; if there's also a FIN
1584 * ACKNOW will be turned on later.
1586 if (DELAY_ACK(tp
) && tlen
!= 0) {
1587 tcp_callout_reset(tp
, tp
->tt_delack
,
1588 tcp_delacktime
, tcp_timer_delack
);
1590 tp
->t_flags
|= TF_ACKNOW
;
1593 * Received <SYN,ACK> in SYN_SENT[*] state.
1595 * SYN_SENT --> ESTABLISHED
1596 * SYN_SENT* --> FIN_WAIT_1
1598 tp
->t_starttime
= ticks
;
1599 if (tp
->t_flags
& TF_NEEDFIN
) {
1600 tp
->t_state
= TCPS_FIN_WAIT_1
;
1601 tp
->t_flags
&= ~TF_NEEDFIN
;
1604 tcp_established(tp
);
1608 * Received initial SYN in SYN-SENT[*] state =>
1609 * simultaneous open.
1610 * Do 3-way handshake:
1611 * SYN-SENT -> SYN-RECEIVED
1612 * SYN-SENT* -> SYN-RECEIVED*
1614 tp
->t_flags
|= TF_ACKNOW
;
1615 tcp_callout_stop(tp
, tp
->tt_rexmt
);
1616 tp
->t_state
= TCPS_SYN_RECEIVED
;
1620 * Advance th->th_seq to correspond to first data byte.
1621 * If data, trim to stay within window,
1622 * dropping FIN if necessary.
1625 if (tlen
> tp
->rcv_wnd
) {
1626 todrop
= tlen
- tp
->rcv_wnd
;
1630 tcpstat
.tcps_rcvpackafterwin
++;
1631 tcpstat
.tcps_rcvbyteafterwin
+= todrop
;
1633 tp
->snd_wl1
= th
->th_seq
- 1;
1634 tp
->rcv_up
= th
->th_seq
;
1636 * Client side of transaction: already sent SYN and data.
1637 * If the remote host used T/TCP to validate the SYN,
1638 * our data will be ACK'd; if so, enter normal data segment
1639 * processing in the middle of step 5, ack processing.
1640 * Otherwise, goto step 6.
1642 if (thflags
& TH_ACK
)
1648 * If the state is LAST_ACK or CLOSING or TIME_WAIT:
1649 * do normal processing (we no longer bother with T/TCP).
1653 case TCPS_TIME_WAIT
:
1654 break; /* continue normal processing */
1658 * States other than LISTEN or SYN_SENT.
1659 * First check the RST flag and sequence number since reset segments
1660 * are exempt from the timestamp and connection count tests. This
1661 * fixes a bug introduced by the Stevens, vol. 2, p. 960 bugfix
1662 * below which allowed reset segments in half the sequence space
1663 * to fall though and be processed (which gives forged reset
1664 * segments with a random sequence number a 50 percent chance of
1665 * killing a connection).
1666 * Then check timestamp, if present.
1667 * Then check the connection count, if present.
1668 * Then check that at least some bytes of segment are within
1669 * receive window. If segment begins before rcv_nxt,
1670 * drop leading data (and SYN); if nothing left, just ack.
1673 * If the RST bit is set, check the sequence number to see
1674 * if this is a valid reset segment.
1676 * In all states except SYN-SENT, all reset (RST) segments
1677 * are validated by checking their SEQ-fields. A reset is
1678 * valid if its sequence number is in the window.
1679 * Note: this does not take into account delayed ACKs, so
1680 * we should test against last_ack_sent instead of rcv_nxt.
1681 * The sequence number in the reset segment is normally an
1682 * echo of our outgoing acknowledgement numbers, but some hosts
1683 * send a reset with the sequence number at the rightmost edge
1684 * of our receive window, and we have to handle this case.
1685 * If we have multiple segments in flight, the intial reset
1686 * segment sequence numbers will be to the left of last_ack_sent,
1687 * but they will eventually catch up.
1688 * In any case, it never made sense to trim reset segments to
1689 * fit the receive window since RFC 1122 says:
1690 * 4.2.2.12 RST Segment: RFC-793 Section 3.4
1692 * A TCP SHOULD allow a received RST segment to include data.
1695 * It has been suggested that a RST segment could contain
1696 * ASCII text that encoded and explained the cause of the
1697 * RST. No standard has yet been established for such
1700 * If the reset segment passes the sequence number test examine
1702 * SYN_RECEIVED STATE:
1703 * If passive open, return to LISTEN state.
1704 * If active open, inform user that connection was refused.
1705 * ESTABLISHED, FIN_WAIT_1, FIN_WAIT_2, CLOSE_WAIT STATES:
1706 * Inform user that connection was reset, and close tcb.
1707 * CLOSING, LAST_ACK STATES:
1710 * Drop the segment - see Stevens, vol. 2, p. 964 and
1713 if (thflags
& TH_RST
) {
1714 if (SEQ_GEQ(th
->th_seq
, tp
->last_ack_sent
) &&
1715 SEQ_LEQ(th
->th_seq
, tp
->last_ack_sent
+ tp
->rcv_wnd
)) {
1716 switch (tp
->t_state
) {
1718 case TCPS_SYN_RECEIVED
:
1719 so
->so_error
= ECONNREFUSED
;
1722 case TCPS_ESTABLISHED
:
1723 case TCPS_FIN_WAIT_1
:
1724 case TCPS_FIN_WAIT_2
:
1725 case TCPS_CLOSE_WAIT
:
1726 so
->so_error
= ECONNRESET
;
1728 tp
->t_state
= TCPS_CLOSED
;
1729 tcpstat
.tcps_drops
++;
1738 case TCPS_TIME_WAIT
:
1746 * RFC 1323 PAWS: If we have a timestamp reply on this segment
1747 * and it's less than ts_recent, drop it.
1749 if ((to
.to_flags
& TOF_TS
) && tp
->ts_recent
!= 0 &&
1750 TSTMP_LT(to
.to_tsval
, tp
->ts_recent
)) {
1751 /* Check to see if ts_recent is over 24 days old. */
1752 if ((int)(ticks
- tp
->ts_recent_age
) > TCP_PAWS_IDLE
) {
1754 * Invalidate ts_recent. If this segment updates
1755 * ts_recent, the age will be reset later and ts_recent
1756 * will get a valid value. If it does not, setting
1757 * ts_recent to zero will at least satisfy the
1758 * requirement that zero be placed in the timestamp
1759 * echo reply when ts_recent isn't valid. The
1760 * age isn't reset until we get a valid ts_recent
1761 * because we don't want out-of-order segments to be
1762 * dropped when ts_recent is old.
1765 } else if (tcp_paws_tolerance
&& tlen
!= 0 &&
1766 tp
->t_state
== TCPS_ESTABLISHED
&&
1767 (thflags
& (TH_SYN
|TH_FIN
|TH_RST
|TH_URG
|TH_ACK
)) == TH_ACK
&&
1768 !(tp
->t_flags
& (TF_NEEDSYN
| TF_NEEDFIN
)) &&
1769 th
->th_ack
== tp
->snd_una
&&
1770 tiwin
== tp
->snd_wnd
&&
1771 TSTMP_GEQ(to
.to_tsval
+ tcp_paws_tolerance
, tp
->ts_recent
)&&
1772 (th
->th_seq
== tp
->rcv_nxt
||
1773 (SEQ_GT(th
->th_seq
, tp
->rcv_nxt
) &&
1774 tcp_paws_canreasslast(tp
, th
, tlen
)))) {
1776 * This tends to prevent valid new segments from being
1777 * dropped by the reordered segments sent by the fast
1778 * retransmission algorithm on the sending side, i.e.
1779 * the fast retransmitted segment w/ larger timestamp
1780 * arrives earlier than the previously sent new segments
1781 * w/ smaller timestamp.
1783 * If following conditions are met, the segment is
1785 * - The segment contains data
1786 * - The connection is established
1787 * - The header does not contain important flags
1788 * - SYN or FIN is not needed
1789 * - It does not acknowledge new data
1790 * - Receive window is not changed
1791 * - The timestamp is within "acceptable" range
1792 * - The new segment is what we are expecting or
1793 * the new segment could be merged w/ the last
1794 * pending segment on the reassemble queue
1796 tcpstat
.tcps_pawsaccept
++;
1797 tcpstat
.tcps_pawsdrop
++;
1799 tcpstat
.tcps_rcvduppack
++;
1800 tcpstat
.tcps_rcvdupbyte
+= tlen
;
1801 tcpstat
.tcps_pawsdrop
++;
1809 * In the SYN-RECEIVED state, validate that the packet belongs to
1810 * this connection before trimming the data to fit the receive
1811 * window. Check the sequence number versus IRS since we know
1812 * the sequence numbers haven't wrapped. This is a partial fix
1813 * for the "LAND" DoS attack.
1815 if (tp
->t_state
== TCPS_SYN_RECEIVED
&& SEQ_LT(th
->th_seq
, tp
->irs
)) {
1816 rstreason
= BANDLIM_RST_OPENPORT
;
1820 todrop
= tp
->rcv_nxt
- th
->th_seq
;
1822 if (TCP_DO_SACK(tp
)) {
1823 /* Report duplicate segment at head of packet. */
1824 tp
->reportblk
.rblk_start
= th
->th_seq
;
1825 tp
->reportblk
.rblk_end
= TCP_SACK_BLKEND(
1826 th
->th_seq
+ tlen
, thflags
);
1827 if (SEQ_GT(tp
->reportblk
.rblk_end
, tp
->rcv_nxt
))
1828 tp
->reportblk
.rblk_end
= tp
->rcv_nxt
;
1829 tp
->sack_flags
|= (TSACK_F_DUPSEG
| TSACK_F_SACKLEFT
);
1830 tp
->t_flags
|= TF_ACKNOW
;
1832 if (thflags
& TH_SYN
) {
1842 * Following if statement from Stevens, vol. 2, p. 960.
1844 if (todrop
> tlen
||
1845 (todrop
== tlen
&& !(thflags
& TH_FIN
))) {
1847 * Any valid FIN must be to the left of the window.
1848 * At this point the FIN must be a duplicate or out
1849 * of sequence; drop it.
1854 * Send an ACK to resynchronize and drop any data.
1855 * But keep on processing for RST or ACK.
1857 tp
->t_flags
|= TF_ACKNOW
;
1859 tcpstat
.tcps_rcvduppack
++;
1860 tcpstat
.tcps_rcvdupbyte
+= todrop
;
1862 tcpstat
.tcps_rcvpartduppack
++;
1863 tcpstat
.tcps_rcvpartdupbyte
+= todrop
;
1865 drop_hdrlen
+= todrop
; /* drop from the top afterwards */
1866 th
->th_seq
+= todrop
;
1868 if (th
->th_urp
> todrop
)
1869 th
->th_urp
-= todrop
;
1877 * If new data are received on a connection after the
1878 * user processes are gone, then RST the other end.
1880 if ((so
->so_state
& SS_NOFDREF
) &&
1881 tp
->t_state
> TCPS_CLOSE_WAIT
&& tlen
) {
1883 tcpstat
.tcps_rcvafterclose
++;
1884 rstreason
= BANDLIM_UNLIMITED
;
1889 * If segment ends after window, drop trailing data
1890 * (and PUSH and FIN); if nothing left, just ACK.
1892 todrop
= (th
->th_seq
+ tlen
) - (tp
->rcv_nxt
+ tp
->rcv_wnd
);
1894 tcpstat
.tcps_rcvpackafterwin
++;
1895 if (todrop
>= tlen
) {
1896 tcpstat
.tcps_rcvbyteafterwin
+= tlen
;
1898 * If a new connection request is received
1899 * while in TIME_WAIT, drop the old connection
1900 * and start over if the sequence numbers
1901 * are above the previous ones.
1903 if (thflags
& TH_SYN
&&
1904 tp
->t_state
== TCPS_TIME_WAIT
&&
1905 SEQ_GT(th
->th_seq
, tp
->rcv_nxt
)) {
1910 * If window is closed can only take segments at
1911 * window edge, and have to drop data and PUSH from
1912 * incoming segments. Continue processing, but
1913 * remember to ack. Otherwise, drop segment
1916 if (tp
->rcv_wnd
== 0 && th
->th_seq
== tp
->rcv_nxt
) {
1917 tp
->t_flags
|= TF_ACKNOW
;
1918 tcpstat
.tcps_rcvwinprobe
++;
1922 tcpstat
.tcps_rcvbyteafterwin
+= todrop
;
1925 thflags
&= ~(TH_PUSH
| TH_FIN
);
1929 * If last ACK falls within this segment's sequence numbers,
1930 * record its timestamp.
1932 * 1) That the test incorporates suggestions from the latest
1933 * proposal of the tcplw@cray.com list (Braden 1993/04/26).
1934 * 2) That updating only on newer timestamps interferes with
1935 * our earlier PAWS tests, so this check should be solely
1936 * predicated on the sequence space of this segment.
1937 * 3) That we modify the segment boundary check to be
1938 * Last.ACK.Sent <= SEG.SEQ + SEG.LEN
1939 * instead of RFC1323's
1940 * Last.ACK.Sent < SEG.SEQ + SEG.LEN,
1941 * This modified check allows us to overcome RFC1323's
1942 * limitations as described in Stevens TCP/IP Illustrated
1943 * Vol. 2 p.869. In such cases, we can still calculate the
1944 * RTT correctly when RCV.NXT == Last.ACK.Sent.
1946 if ((to
.to_flags
& TOF_TS
) && SEQ_LEQ(th
->th_seq
, tp
->last_ack_sent
) &&
1947 SEQ_LEQ(tp
->last_ack_sent
, (th
->th_seq
+ tlen
1948 + ((thflags
& TH_SYN
) != 0)
1949 + ((thflags
& TH_FIN
) != 0)))) {
1950 tp
->ts_recent_age
= ticks
;
1951 tp
->ts_recent
= to
.to_tsval
;
1955 * If a SYN is in the window, then this is an
1956 * error and we send an RST and drop the connection.
1958 if (thflags
& TH_SYN
) {
1959 tp
= tcp_drop(tp
, ECONNRESET
);
1960 rstreason
= BANDLIM_UNLIMITED
;
1965 * If the ACK bit is off: if in SYN-RECEIVED state or SENDSYN
1966 * flag is on (half-synchronized state), then queue data for
1967 * later processing; else drop segment and return.
1969 if (!(thflags
& TH_ACK
)) {
1970 if (tp
->t_state
== TCPS_SYN_RECEIVED
||
1971 (tp
->t_flags
& TF_NEEDSYN
))
1980 switch (tp
->t_state
) {
1982 * In SYN_RECEIVED state, the ACK acknowledges our SYN, so enter
1983 * ESTABLISHED state and continue processing.
1984 * The ACK was checked above.
1986 case TCPS_SYN_RECEIVED
:
1988 tcpstat
.tcps_connects
++;
1990 /* Do window scaling? */
1991 if ((tp
->t_flags
& (TF_RCVD_SCALE
| TF_REQ_SCALE
)) ==
1992 (TF_RCVD_SCALE
| TF_REQ_SCALE
))
1993 tp
->rcv_scale
= tp
->request_r_scale
;
1996 * SYN-RECEIVED -> ESTABLISHED
1997 * SYN-RECEIVED* -> FIN-WAIT-1
1999 tp
->t_starttime
= ticks
;
2000 if (tp
->t_flags
& TF_NEEDFIN
) {
2001 tp
->t_state
= TCPS_FIN_WAIT_1
;
2002 tp
->t_flags
&= ~TF_NEEDFIN
;
2004 tcp_established(tp
);
2007 * If segment contains data or ACK, will call tcp_reass()
2008 * later; if not, do so now to pass queued data to user.
2010 if (tlen
== 0 && !(thflags
& TH_FIN
))
2011 tcp_reass(tp
, NULL
, NULL
, NULL
);
2015 * In ESTABLISHED state: drop duplicate ACKs; ACK out of range
2016 * ACKs. If the ack is in the range
2017 * tp->snd_una < th->th_ack <= tp->snd_max
2018 * then advance tp->snd_una to th->th_ack and drop
2019 * data from the retransmission queue. If this ACK reflects
2020 * more up to date window information we update our window information.
2022 case TCPS_ESTABLISHED
:
2023 case TCPS_FIN_WAIT_1
:
2024 case TCPS_FIN_WAIT_2
:
2025 case TCPS_CLOSE_WAIT
:
2028 case TCPS_TIME_WAIT
:
2030 if (SEQ_LEQ(th
->th_ack
, tp
->snd_una
)) {
2031 boolean_t maynotdup
= FALSE
;
2033 if (TCP_DO_SACK(tp
))
2034 tcp_sack_update_scoreboard(tp
, &to
);
2036 if (tlen
!= 0 || tiwin
!= tp
->snd_wnd
||
2037 ((thflags
& TH_FIN
) && !(tp
->t_flags
& TF_SAWFIN
)))
2040 if (!tcp_callout_active(tp
, tp
->tt_rexmt
) ||
2041 th
->th_ack
!= tp
->snd_una
) {
2043 tcpstat
.tcps_rcvdupack
++;
2048 #define DELAY_DUPACK \
2050 delayed_dupack = TRUE; \
2051 th_dupack = th->th_ack; \
2052 to_flags = to.to_flags; \
2055 if (!tcp_do_rfc6675
||
2058 (TOF_SACK
| TOF_SACK_REDUNDANT
))
2066 if ((thflags
& TH_FIN
) && !(tp
->t_flags
& TF_QUEDFIN
)) {
2068 * This could happen, if the reassemable
2069 * queue overflew or was drained. Don't
2070 * drop this FIN here; defer the duplicated
2071 * ACK processing until this FIN gets queued.
2078 if (tcp_recv_dupack(tp
, th
->th_ack
, to
.to_flags
))
2084 KASSERT(SEQ_GT(th
->th_ack
, tp
->snd_una
), ("th_ack <= snd_una"));
2086 if (SEQ_GT(th
->th_ack
, tp
->snd_max
)) {
2088 * Detected optimistic ACK attack.
2089 * Force slow-start to de-synchronize attack.
2091 tp
->snd_cwnd
= tp
->t_maxseg
;
2094 tcpstat
.tcps_rcvacktoomuch
++;
2098 * If we reach this point, ACK is not a duplicate,
2099 * i.e., it ACKs something we sent.
2101 if (tp
->t_flags
& TF_NEEDSYN
) {
2103 * T/TCP: Connection was half-synchronized, and our
2104 * SYN has been ACK'd (so connection is now fully
2105 * synchronized). Go to non-starred state,
2106 * increment snd_una for ACK of SYN, and check if
2107 * we can do window scaling.
2109 tp
->t_flags
&= ~TF_NEEDSYN
;
2111 /* Do window scaling? */
2112 if ((tp
->t_flags
& (TF_RCVD_SCALE
| TF_REQ_SCALE
)) ==
2113 (TF_RCVD_SCALE
| TF_REQ_SCALE
))
2114 tp
->rcv_scale
= tp
->request_r_scale
;
2118 acked
= th
->th_ack
- tp
->snd_una
;
2119 tcpstat
.tcps_rcvackpack
++;
2120 tcpstat
.tcps_rcvackbyte
+= acked
;
2122 if (tcp_do_eifel_detect
&& acked
> 0 &&
2123 (to
.to_flags
& TOF_TS
) && (to
.to_tsecr
!= 0) &&
2124 (tp
->rxt_flags
& TRXT_F_FIRSTACCACK
)) {
2125 /* Eifel detection applicable. */
2126 if (to
.to_tsecr
< tp
->t_rexmtTS
) {
2127 ++tcpstat
.tcps_eifeldetected
;
2128 tcp_revert_congestion_state(tp
);
2129 if (tp
->t_rxtshift
!= 1 ||
2130 ticks
>= tp
->t_badrxtwin
)
2131 ++tcpstat
.tcps_rttcantdetect
;
2133 } else if (tp
->t_rxtshift
== 1 && ticks
< tp
->t_badrxtwin
) {
2135 * If we just performed our first retransmit,
2136 * and the ACK arrives within our recovery window,
2137 * then it was a mistake to do the retransmit
2138 * in the first place. Recover our original cwnd
2139 * and ssthresh, and proceed to transmit where we
2142 tcp_revert_congestion_state(tp
);
2143 ++tcpstat
.tcps_rttdetected
;
2147 * If we have a timestamp reply, update smoothed
2148 * round trip time. If no timestamp is present but
2149 * transmit timer is running and timed sequence
2150 * number was acked, update smoothed round trip time.
2151 * Since we now have an rtt measurement, cancel the
2152 * timer backoff (cf., Phil Karn's retransmit alg.).
2153 * Recompute the initial retransmit timer.
2155 * Some machines (certain windows boxes) send broken
2156 * timestamp replies during the SYN+ACK phase, ignore
2159 if ((to
.to_flags
& TOF_TS
) && (to
.to_tsecr
!= 0))
2160 tcp_xmit_timer(tp
, ticks
- to
.to_tsecr
+ 1,
2162 else if (tp
->t_rtttime
&& SEQ_GT(th
->th_ack
, tp
->t_rtseq
))
2163 tcp_xmit_timer(tp
, ticks
- tp
->t_rtttime
+ 1,
2165 tcp_xmit_bandwidth_limit(tp
, th
->th_ack
);
2168 * If no data (only SYN) was ACK'd,
2169 * skip rest of ACK processing.
2174 /* Stop looking for an acceptable ACK since one was received. */
2175 tp
->rxt_flags
&= ~(TRXT_F_FIRSTACCACK
|
2176 TRXT_F_FASTREXMT
| TRXT_F_EARLYREXMT
);
2178 if (acked
> so
->so_snd
.ssb_cc
) {
2179 tp
->snd_wnd
-= so
->so_snd
.ssb_cc
;
2180 sbdrop(&so
->so_snd
.sb
, (int)so
->so_snd
.ssb_cc
);
2181 ourfinisacked
= TRUE
;
2183 sbdrop(&so
->so_snd
.sb
, acked
);
2184 tp
->snd_wnd
-= acked
;
2185 ourfinisacked
= FALSE
;
2190 * Update window information.
2192 if (acceptable_window_update(tp
, th
, tiwin
)) {
2193 /* keep track of pure window updates */
2194 if (tlen
== 0 && tp
->snd_wl2
== th
->th_ack
&&
2195 tiwin
> tp
->snd_wnd
)
2196 tcpstat
.tcps_rcvwinupd
++;
2197 tp
->snd_wnd
= tiwin
;
2198 tp
->snd_wl1
= th
->th_seq
;
2199 tp
->snd_wl2
= th
->th_ack
;
2200 if (tp
->snd_wnd
> tp
->max_sndwnd
)
2201 tp
->max_sndwnd
= tp
->snd_wnd
;
2205 tp
->snd_una
= th
->th_ack
;
2206 if (TCP_DO_SACK(tp
))
2207 tcp_sack_update_scoreboard(tp
, &to
);
2208 if (IN_FASTRECOVERY(tp
)) {
2209 if (SEQ_GEQ(th
->th_ack
, tp
->snd_recover
)) {
2210 EXIT_FASTRECOVERY(tp
);
2213 * If the congestion window was inflated
2214 * to account for the other side's
2215 * cached packets, retract it.
2217 if (!TCP_DO_SACK(tp
))
2218 tp
->snd_cwnd
= tp
->snd_ssthresh
;
2221 * Window inflation should have left us
2222 * with approximately snd_ssthresh outstanding
2223 * data. But, in case we would be inclined
2224 * to send a burst, better do it using
2227 if (SEQ_GT(th
->th_ack
+ tp
->snd_cwnd
,
2228 tp
->snd_max
+ 2 * tp
->t_maxseg
))
2230 (tp
->snd_max
- tp
->snd_una
) +
2235 if (TCP_DO_SACK(tp
)) {
2236 tp
->snd_max_rexmt
= tp
->snd_max
;
2238 tp
->snd_una
== tp
->rexmt_high
);
2240 tcp_newreno_partial_ack(tp
, th
, acked
);
2246 * Open the congestion window. When in slow-start,
2247 * open exponentially: maxseg per packet. Otherwise,
2248 * open linearly: maxseg per window.
2250 if (tp
->snd_cwnd
<= tp
->snd_ssthresh
) {
2252 (SEQ_LT(tp
->snd_nxt
, tp
->snd_max
) ?
2253 tp
->t_maxseg
: 2 * tp
->t_maxseg
);
2256 tp
->snd_cwnd
+= tcp_do_abc
?
2257 min(acked
, abc_sslimit
) : tp
->t_maxseg
;
2259 /* linear increase */
2260 tp
->snd_wacked
+= tcp_do_abc
? acked
:
2262 if (tp
->snd_wacked
>= tp
->snd_cwnd
) {
2263 tp
->snd_wacked
-= tp
->snd_cwnd
;
2264 tp
->snd_cwnd
+= tp
->t_maxseg
;
2267 tp
->snd_cwnd
= min(tp
->snd_cwnd
,
2268 TCP_MAXWIN
<< tp
->snd_scale
);
2269 tp
->snd_recover
= th
->th_ack
- 1;
2271 if (SEQ_LT(tp
->snd_nxt
, tp
->snd_una
))
2272 tp
->snd_nxt
= tp
->snd_una
;
2275 * If all outstanding data is acked, stop retransmit
2276 * timer and remember to restart (more output or persist).
2277 * If there is more data to be acked, restart retransmit
2278 * timer, using current (possibly backed-off) value.
2280 if (th
->th_ack
== tp
->snd_max
) {
2281 tcp_callout_stop(tp
, tp
->tt_rexmt
);
2283 } else if (!tcp_callout_active(tp
, tp
->tt_persist
)) {
2284 tcp_callout_reset(tp
, tp
->tt_rexmt
, tp
->t_rxtcur
,
2288 switch (tp
->t_state
) {
2290 * In FIN_WAIT_1 STATE in addition to the processing
2291 * for the ESTABLISHED state if our FIN is now acknowledged
2292 * then enter FIN_WAIT_2.
2294 case TCPS_FIN_WAIT_1
:
2295 if (ourfinisacked
) {
2297 * If we can't receive any more
2298 * data, then closing user can proceed.
2299 * Starting the timer is contrary to the
2300 * specification, but if we don't get a FIN
2301 * we'll hang forever.
2303 if (so
->so_state
& SS_CANTRCVMORE
) {
2304 soisdisconnected(so
);
2305 tcp_callout_reset(tp
, tp
->tt_2msl
,
2306 tp
->t_maxidle
, tcp_timer_2msl
);
2308 tp
->t_state
= TCPS_FIN_WAIT_2
;
2313 * In CLOSING STATE in addition to the processing for
2314 * the ESTABLISHED state if the ACK acknowledges our FIN
2315 * then enter the TIME-WAIT state, otherwise ignore
2319 if (ourfinisacked
) {
2320 tp
->t_state
= TCPS_TIME_WAIT
;
2321 tcp_canceltimers(tp
);
2322 tcp_callout_reset(tp
, tp
->tt_2msl
,
2323 2 * tcp_rmx_msl(tp
),
2325 soisdisconnected(so
);
2330 * In LAST_ACK, we may still be waiting for data to drain
2331 * and/or to be acked, as well as for the ack of our FIN.
2332 * If our FIN is now acknowledged, delete the TCB,
2333 * enter the closed state and return.
2336 if (ourfinisacked
) {
2343 * In TIME_WAIT state the only thing that should arrive
2344 * is a retransmission of the remote FIN. Acknowledge
2345 * it and restart the finack timer.
2347 case TCPS_TIME_WAIT
:
2348 tcp_callout_reset(tp
, tp
->tt_2msl
, 2 * tcp_rmx_msl(tp
),
2356 * Update window information.
2357 * Don't look at window if no ACK: TAC's send garbage on first SYN.
2359 if ((thflags
& TH_ACK
) &&
2360 acceptable_window_update(tp
, th
, tiwin
)) {
2361 /* keep track of pure window updates */
2362 if (tlen
== 0 && tp
->snd_wl2
== th
->th_ack
&&
2363 tiwin
> tp
->snd_wnd
)
2364 tcpstat
.tcps_rcvwinupd
++;
2365 tp
->snd_wnd
= tiwin
;
2366 tp
->snd_wl1
= th
->th_seq
;
2367 tp
->snd_wl2
= th
->th_ack
;
2368 if (tp
->snd_wnd
> tp
->max_sndwnd
)
2369 tp
->max_sndwnd
= tp
->snd_wnd
;
2374 * Process segments with URG.
2376 if ((thflags
& TH_URG
) && th
->th_urp
&&
2377 !TCPS_HAVERCVDFIN(tp
->t_state
)) {
2379 * This is a kludge, but if we receive and accept
2380 * random urgent pointers, we'll crash in
2381 * soreceive. It's hard to imagine someone
2382 * actually wanting to send this much urgent data.
2384 if (th
->th_urp
+ so
->so_rcv
.ssb_cc
> sb_max
) {
2385 th
->th_urp
= 0; /* XXX */
2386 thflags
&= ~TH_URG
; /* XXX */
2387 goto dodata
; /* XXX */
2390 * If this segment advances the known urgent pointer,
2391 * then mark the data stream. This should not happen
2392 * in CLOSE_WAIT, CLOSING, LAST_ACK or TIME_WAIT STATES since
2393 * a FIN has been received from the remote side.
2394 * In these states we ignore the URG.
2396 * According to RFC961 (Assigned Protocols),
2397 * the urgent pointer points to the last octet
2398 * of urgent data. We continue, however,
2399 * to consider it to indicate the first octet
2400 * of data past the urgent section as the original
2401 * spec states (in one of two places).
2403 if (SEQ_GT(th
->th_seq
+ th
->th_urp
, tp
->rcv_up
)) {
2404 tp
->rcv_up
= th
->th_seq
+ th
->th_urp
;
2405 so
->so_oobmark
= so
->so_rcv
.ssb_cc
+
2406 (tp
->rcv_up
- tp
->rcv_nxt
) - 1;
2407 if (so
->so_oobmark
== 0)
2408 sosetstate(so
, SS_RCVATMARK
);
2410 tp
->t_oobflags
&= ~(TCPOOB_HAVEDATA
| TCPOOB_HADDATA
);
2413 * Remove out of band data so doesn't get presented to user.
2414 * This can happen independent of advancing the URG pointer,
2415 * but if two URG's are pending at once, some out-of-band
2416 * data may creep in... ick.
2418 if (th
->th_urp
<= (u_long
)tlen
&&
2419 !(so
->so_options
& SO_OOBINLINE
)) {
2420 /* hdr drop is delayed */
2421 tcp_pulloutofband(so
, th
, m
, drop_hdrlen
);
2425 * If no out of band data is expected,
2426 * pull receive urgent pointer along
2427 * with the receive window.
2429 if (SEQ_GT(tp
->rcv_nxt
, tp
->rcv_up
))
2430 tp
->rcv_up
= tp
->rcv_nxt
;
2435 * Process the segment text, merging it into the TCP sequencing queue,
2436 * and arranging for acknowledgment of receipt if necessary.
2437 * This process logically involves adjusting tp->rcv_wnd as data
2438 * is presented to the user (this happens in tcp_usrreq.c,
2439 * case PRU_RCVD). If a FIN has already been received on this
2440 * connection then we just ignore the text.
2442 if ((tlen
|| (thflags
& TH_FIN
)) && !TCPS_HAVERCVDFIN(tp
->t_state
)) {
2443 if (thflags
& TH_FIN
)
2444 tp
->t_flags
|= TF_SAWFIN
;
2445 m_adj(m
, drop_hdrlen
); /* delayed header drop */
2447 * Insert segment which includes th into TCP reassembly queue
2448 * with control block tp. Set thflags to whether reassembly now
2449 * includes a segment with FIN. This handles the common case
2450 * inline (segment is the next to be received on an established
2451 * connection, and the queue is empty), avoiding linkage into
2452 * and removal from the queue and repetition of various
2454 * Set DELACK for segments received in order, but ack
2455 * immediately when segments are out of order (so
2456 * fast retransmit can work).
2458 if (th
->th_seq
== tp
->rcv_nxt
&&
2459 TAILQ_EMPTY(&tp
->t_segq
) &&
2460 TCPS_HAVEESTABLISHED(tp
->t_state
)) {
2461 if (thflags
& TH_FIN
)
2462 tp
->t_flags
|= TF_QUEDFIN
;
2463 if (DELAY_ACK(tp
)) {
2464 tcp_callout_reset(tp
, tp
->tt_delack
,
2465 tcp_delacktime
, tcp_timer_delack
);
2467 tp
->t_flags
|= TF_ACKNOW
;
2469 tp
->rcv_nxt
+= tlen
;
2470 thflags
= th
->th_flags
& TH_FIN
;
2471 tcpstat
.tcps_rcvpack
++;
2472 tcpstat
.tcps_rcvbyte
+= tlen
;
2474 if (so
->so_state
& SS_CANTRCVMORE
) {
2477 lwkt_gettoken(&so
->so_rcv
.ssb_token
);
2478 ssb_appendstream(&so
->so_rcv
, m
);
2479 lwkt_reltoken(&so
->so_rcv
.ssb_token
);
2483 if (!(tp
->sack_flags
& TSACK_F_DUPSEG
)) {
2484 /* Initialize SACK report block. */
2485 tp
->reportblk
.rblk_start
= th
->th_seq
;
2486 tp
->reportblk
.rblk_end
= TCP_SACK_BLKEND(
2487 th
->th_seq
+ tlen
, thflags
);
2489 thflags
= tcp_reass(tp
, th
, &tlen
, m
);
2490 tp
->t_flags
|= TF_ACKNOW
;
2494 * Note the amount of data that peer has sent into
2495 * our window, in order to estimate the sender's
2498 len
= so
->so_rcv
.ssb_hiwat
- (tp
->rcv_adv
- tp
->rcv_nxt
);
2505 * If FIN is received ACK the FIN and let the user know
2506 * that the connection is closing.
2508 if (thflags
& TH_FIN
) {
2509 if (!TCPS_HAVERCVDFIN(tp
->t_state
)) {
2512 * If connection is half-synchronized
2513 * (ie NEEDSYN flag on) then delay ACK,
2514 * so it may be piggybacked when SYN is sent.
2515 * Otherwise, since we received a FIN then no
2516 * more input can be expected, send ACK now.
2518 if (DELAY_ACK(tp
) && (tp
->t_flags
& TF_NEEDSYN
)) {
2519 tcp_callout_reset(tp
, tp
->tt_delack
,
2520 tcp_delacktime
, tcp_timer_delack
);
2522 tp
->t_flags
|= TF_ACKNOW
;
2527 switch (tp
->t_state
) {
2529 * In SYN_RECEIVED and ESTABLISHED STATES
2530 * enter the CLOSE_WAIT state.
2532 case TCPS_SYN_RECEIVED
:
2533 tp
->t_starttime
= ticks
;
2535 case TCPS_ESTABLISHED
:
2536 tp
->t_state
= TCPS_CLOSE_WAIT
;
2540 * If still in FIN_WAIT_1 STATE FIN has not been acked so
2541 * enter the CLOSING state.
2543 case TCPS_FIN_WAIT_1
:
2544 tp
->t_state
= TCPS_CLOSING
;
2548 * In FIN_WAIT_2 state enter the TIME_WAIT state,
2549 * starting the time-wait timer, turning off the other
2552 case TCPS_FIN_WAIT_2
:
2553 tp
->t_state
= TCPS_TIME_WAIT
;
2554 tcp_canceltimers(tp
);
2555 tcp_callout_reset(tp
, tp
->tt_2msl
, 2 * tcp_rmx_msl(tp
),
2557 soisdisconnected(so
);
2561 * In TIME_WAIT state restart the 2 MSL time_wait timer.
2563 case TCPS_TIME_WAIT
:
2564 tcp_callout_reset(tp
, tp
->tt_2msl
, 2 * tcp_rmx_msl(tp
),
2571 if (so
->so_options
& SO_DEBUG
)
2572 tcp_trace(TA_INPUT
, ostate
, tp
, tcp_saveipgen
, &tcp_savetcp
, 0);
2576 * Delayed duplicated ACK processing
2578 if (delayed_dupack
&& tcp_recv_dupack(tp
, th_dupack
, to_flags
))
2582 * Return any desired output.
2584 if ((tp
->t_flags
& TF_ACKNOW
) ||
2585 (needoutput
&& tcp_sack_report_needed(tp
))) {
2586 tcp_output_cancel(tp
);
2587 tcp_output_fair(tp
);
2588 } else if (needoutput
&& !tcp_output_pending(tp
)) {
2589 tcp_output_fair(tp
);
2591 tcp_sack_report_cleanup(tp
);
2592 return(IPPROTO_DONE
);
2596 * Generate an ACK dropping incoming segment if it occupies
2597 * sequence space, where the ACK reflects our state.
2599 * We can now skip the test for the RST flag since all
2600 * paths to this code happen after packets containing
2601 * RST have been dropped.
2603 * In the SYN-RECEIVED state, don't send an ACK unless the
2604 * segment we received passes the SYN-RECEIVED ACK test.
2605 * If it fails send a RST. This breaks the loop in the
2606 * "LAND" DoS attack, and also prevents an ACK storm
2607 * between two listening ports that have been sent forged
2608 * SYN segments, each with the source address of the other.
2610 if (tp
->t_state
== TCPS_SYN_RECEIVED
&& (thflags
& TH_ACK
) &&
2611 (SEQ_GT(tp
->snd_una
, th
->th_ack
) ||
2612 SEQ_GT(th
->th_ack
, tp
->snd_max
)) ) {
2613 rstreason
= BANDLIM_RST_OPENPORT
;
2617 if (so
->so_options
& SO_DEBUG
)
2618 tcp_trace(TA_DROP
, ostate
, tp
, tcp_saveipgen
, &tcp_savetcp
, 0);
2621 tp
->t_flags
|= TF_ACKNOW
;
2623 tcp_sack_report_cleanup(tp
);
2624 return(IPPROTO_DONE
);
2628 * Generate a RST, dropping incoming segment.
2629 * Make ACK acceptable to originator of segment.
2630 * Don't bother to respond if destination was broadcast/multicast.
2632 if ((thflags
& TH_RST
) || m
->m_flags
& (M_BCAST
| M_MCAST
))
2635 if (IN6_IS_ADDR_MULTICAST(&ip6
->ip6_dst
) ||
2636 IN6_IS_ADDR_MULTICAST(&ip6
->ip6_src
))
2639 if (IN_MULTICAST(ntohl(ip
->ip_dst
.s_addr
)) ||
2640 IN_MULTICAST(ntohl(ip
->ip_src
.s_addr
)) ||
2641 ip
->ip_src
.s_addr
== htonl(INADDR_BROADCAST
) ||
2642 in_broadcast(ip
->ip_dst
, m
->m_pkthdr
.rcvif
))
2645 /* IPv6 anycast check is done at tcp6_input() */
2648 * Perform bandwidth limiting.
2651 if (badport_bandlim(rstreason
) < 0)
2656 if (tp
== NULL
|| (tp
->t_inpcb
->inp_socket
->so_options
& SO_DEBUG
))
2657 tcp_trace(TA_DROP
, ostate
, tp
, tcp_saveipgen
, &tcp_savetcp
, 0);
2659 if (thflags
& TH_ACK
)
2660 /* mtod() below is safe as long as hdr dropping is delayed */
2661 tcp_respond(tp
, mtod(m
, void *), th
, m
, (tcp_seq
)0, th
->th_ack
,
2664 if (thflags
& TH_SYN
)
2666 /* mtod() below is safe as long as hdr dropping is delayed */
2667 tcp_respond(tp
, mtod(m
, void *), th
, m
, th
->th_seq
+ tlen
,
2668 (tcp_seq
)0, TH_RST
| TH_ACK
);
2671 tcp_sack_report_cleanup(tp
);
2672 return(IPPROTO_DONE
);
2676 * Drop space held by incoming segment and return.
2679 if (tp
== NULL
|| (tp
->t_inpcb
->inp_socket
->so_options
& SO_DEBUG
))
2680 tcp_trace(TA_DROP
, ostate
, tp
, tcp_saveipgen
, &tcp_savetcp
, 0);
2684 tcp_sack_report_cleanup(tp
);
2685 return(IPPROTO_DONE
);
2689 * Parse TCP options and place in tcpopt.
2692 tcp_dooptions(struct tcpopt
*to
, u_char
*cp
, int cnt
, boolean_t is_syn
,
2698 for (; cnt
> 0; cnt
-= optlen
, cp
+= optlen
) {
2700 if (opt
== TCPOPT_EOL
)
2702 if (opt
== TCPOPT_NOP
)
2708 if (optlen
< 2 || optlen
> cnt
)
2713 if (optlen
!= TCPOLEN_MAXSEG
)
2717 to
->to_flags
|= TOF_MSS
;
2718 bcopy(cp
+ 2, &to
->to_mss
, sizeof to
->to_mss
);
2719 to
->to_mss
= ntohs(to
->to_mss
);
2722 if (optlen
!= TCPOLEN_WINDOW
)
2726 to
->to_flags
|= TOF_SCALE
;
2727 to
->to_requested_s_scale
= min(cp
[2], TCP_MAX_WINSHIFT
);
2729 case TCPOPT_TIMESTAMP
:
2730 if (optlen
!= TCPOLEN_TIMESTAMP
)
2732 to
->to_flags
|= TOF_TS
;
2733 bcopy(cp
+ 2, &to
->to_tsval
, sizeof to
->to_tsval
);
2734 to
->to_tsval
= ntohl(to
->to_tsval
);
2735 bcopy(cp
+ 6, &to
->to_tsecr
, sizeof to
->to_tsecr
);
2736 to
->to_tsecr
= ntohl(to
->to_tsecr
);
2738 * If echoed timestamp is later than the current time,
2739 * fall back to non RFC1323 RTT calculation.
2741 if (to
->to_tsecr
!= 0 && TSTMP_GT(to
->to_tsecr
, ticks
))
2744 case TCPOPT_SACK_PERMITTED
:
2745 if (optlen
!= TCPOLEN_SACK_PERMITTED
)
2749 to
->to_flags
|= TOF_SACK_PERMITTED
;
2752 if ((optlen
- 2) & 0x07) /* not multiple of 8 */
2754 to
->to_nsackblocks
= (optlen
- 2) / 8;
2755 to
->to_sackblocks
= (struct raw_sackblock
*) (cp
+ 2);
2756 to
->to_flags
|= TOF_SACK
;
2757 for (i
= 0; i
< to
->to_nsackblocks
; i
++) {
2758 struct raw_sackblock
*r
= &to
->to_sackblocks
[i
];
2760 r
->rblk_start
= ntohl(r
->rblk_start
);
2761 r
->rblk_end
= ntohl(r
->rblk_end
);
2763 if (SEQ_LEQ(r
->rblk_end
, r
->rblk_start
)) {
2765 * Invalid SACK block; discard all
2768 tcpstat
.tcps_rcvbadsackopt
++;
2769 to
->to_nsackblocks
= 0;
2770 to
->to_sackblocks
= NULL
;
2771 to
->to_flags
&= ~TOF_SACK
;
2775 if ((to
->to_flags
& TOF_SACK
) &&
2776 tcp_sack_ndsack_blocks(to
->to_sackblocks
,
2777 to
->to_nsackblocks
, ack
))
2778 to
->to_flags
|= TOF_DSACK
;
2780 #ifdef TCP_SIGNATURE
2782 * XXX In order to reply to a host which has set the
2783 * TCP_SIGNATURE option in its initial SYN, we have to
2784 * record the fact that the option was observed here
2785 * for the syncache code to perform the correct response.
2787 case TCPOPT_SIGNATURE
:
2788 if (optlen
!= TCPOLEN_SIGNATURE
)
2790 to
->to_flags
|= (TOF_SIGNATURE
| TOF_SIGLEN
);
2792 #endif /* TCP_SIGNATURE */
2800 * Pull out of band byte out of a segment so
2801 * it doesn't appear in the user's data queue.
2802 * It is still reflected in the segment length for
2803 * sequencing purposes.
2804 * "off" is the delayed to be dropped hdrlen.
2807 tcp_pulloutofband(struct socket
*so
, struct tcphdr
*th
, struct mbuf
*m
, int off
)
2809 int cnt
= off
+ th
->th_urp
- 1;
2812 if (m
->m_len
> cnt
) {
2813 char *cp
= mtod(m
, caddr_t
) + cnt
;
2814 struct tcpcb
*tp
= sototcpcb(so
);
2817 tp
->t_oobflags
|= TCPOOB_HAVEDATA
;
2818 bcopy(cp
+ 1, cp
, m
->m_len
- cnt
- 1);
2820 if (m
->m_flags
& M_PKTHDR
)
2829 panic("tcp_pulloutofband");
2833 * Collect new round-trip time estimate and update averages and current
2837 tcp_xmit_timer(struct tcpcb
*tp
, int rtt
, tcp_seq ack
)
2841 tcpstat
.tcps_rttupdated
++;
2843 if ((tp
->rxt_flags
& TRXT_F_REBASERTO
) &&
2844 SEQ_GT(ack
, tp
->snd_max_prev
)) {
2845 #ifdef DEBUG_EIFEL_RESPONSE
2846 kprintf("srtt/rttvar, prev %d/%d, cur %d/%d, ",
2847 tp
->t_srtt_prev
, tp
->t_rttvar_prev
,
2848 tp
->t_srtt
, tp
->t_rttvar
);
2851 tcpstat
.tcps_eifelresponse
++;
2853 tp
->rxt_flags
&= ~TRXT_F_REBASERTO
;
2854 tp
->t_srtt
= max(tp
->t_srtt_prev
, (rtt
<< TCP_RTT_SHIFT
));
2855 tp
->t_rttvar
= max(tp
->t_rttvar_prev
,
2856 (rtt
<< (TCP_RTTVAR_SHIFT
- 1)));
2857 if (tp
->t_rttbest
> tp
->t_srtt
+ tp
->t_rttvar
)
2858 tp
->t_rttbest
= tp
->t_srtt
+ tp
->t_rttvar
;
2860 #ifdef DEBUG_EIFEL_RESPONSE
2861 kprintf("new %d/%d ", tp
->t_srtt
, tp
->t_rttvar
);
2863 } else if (tp
->t_srtt
!= 0) {
2867 * srtt is stored as fixed point with 5 bits after the
2868 * binary point (i.e., scaled by 32). The following magic
2869 * is equivalent to the smoothing algorithm in rfc793 with
2870 * an alpha of .875 (srtt = rtt/32 + srtt*31/32 in fixed
2871 * point). Adjust rtt to origin 0.
2873 delta
= ((rtt
- 1) << TCP_DELTA_SHIFT
)
2874 - (tp
->t_srtt
>> (TCP_RTT_SHIFT
- TCP_DELTA_SHIFT
));
2876 if ((tp
->t_srtt
+= delta
) <= 0)
2880 * We accumulate a smoothed rtt variance (actually, a
2881 * smoothed mean difference), then set the retransmit
2882 * timer to smoothed rtt + 4 times the smoothed variance.
2883 * rttvar is stored as fixed point with 4 bits after the
2884 * binary point (scaled by 16). The following is
2885 * equivalent to rfc793 smoothing with an alpha of .75
2886 * (rttvar = rttvar*3/4 + |delta| / 4). This replaces
2887 * rfc793's wired-in beta.
2891 delta
-= tp
->t_rttvar
>> (TCP_RTTVAR_SHIFT
- TCP_DELTA_SHIFT
);
2892 if ((tp
->t_rttvar
+= delta
) <= 0)
2894 if (tp
->t_rttbest
> tp
->t_srtt
+ tp
->t_rttvar
)
2895 tp
->t_rttbest
= tp
->t_srtt
+ tp
->t_rttvar
;
2898 * No rtt measurement yet - use the unsmoothed rtt.
2899 * Set the variance to half the rtt (so our first
2900 * retransmit happens at 3*rtt).
2902 tp
->t_srtt
= rtt
<< TCP_RTT_SHIFT
;
2903 tp
->t_rttvar
= rtt
<< (TCP_RTTVAR_SHIFT
- 1);
2904 tp
->t_rttbest
= tp
->t_srtt
+ tp
->t_rttvar
;
2909 #ifdef DEBUG_EIFEL_RESPONSE
2911 kprintf("| rxtcur prev %d, old %d, ",
2912 tp
->t_rxtcur_prev
, tp
->t_rxtcur
);
2917 * the retransmit should happen at rtt + 4 * rttvar.
2918 * Because of the way we do the smoothing, srtt and rttvar
2919 * will each average +1/2 tick of bias. When we compute
2920 * the retransmit timer, we want 1/2 tick of rounding and
2921 * 1 extra tick because of +-1/2 tick uncertainty in the
2922 * firing of the timer. The bias will give us exactly the
2923 * 1.5 tick we need. But, because the bias is
2924 * statistical, we have to test that we don't drop below
2925 * the minimum feasible timer (which is 2 ticks).
2927 TCPT_RANGESET(tp
->t_rxtcur
, TCP_REXMTVAL(tp
),
2928 max(tp
->t_rttmin
, rtt
+ 2), TCPTV_REXMTMAX
);
2931 if (tp
->t_rxtcur
< tp
->t_rxtcur_prev
+ tcp_eifel_rtoinc
) {
2933 * RFC4015 requires that the new RTO is at least
2934 * 2*G (tcp_eifel_rtoinc) greater then the RTO
2935 * (t_rxtcur_prev) when the spurious retransmit
2938 * The above condition could be true, if the SRTT
2939 * and RTTVAR used to calculate t_rxtcur_prev
2940 * resulted in a value less than t_rttmin. So
2941 * simply increasing SRTT by tcp_eifel_rtoinc when
2942 * preparing for the Eifel response could not ensure
2943 * that the new RTO will be tcp_eifel_rtoinc greater
2946 tp
->t_rxtcur
= tp
->t_rxtcur_prev
+ tcp_eifel_rtoinc
;
2948 #ifdef DEBUG_EIFEL_RESPONSE
2949 kprintf("new %d\n", tp
->t_rxtcur
);
2954 * We received an ack for a packet that wasn't retransmitted;
2955 * it is probably safe to discard any error indications we've
2956 * received recently. This isn't quite right, but close enough
2957 * for now (a route might have failed after we sent a segment,
2958 * and the return path might not be symmetrical).
2960 tp
->t_softerror
= 0;
2964 * Determine a reasonable value for maxseg size.
2965 * If the route is known, check route for mtu.
2966 * If none, use an mss that can be handled on the outgoing
2967 * interface without forcing IP to fragment; if bigger than
2968 * an mbuf cluster (MCLBYTES), round down to nearest multiple of MCLBYTES
2969 * to utilize large mbufs. If no route is found, route has no mtu,
2970 * or the destination isn't local, use a default, hopefully conservative
2971 * size (usually 512 or the default IP max size, but no more than the mtu
2972 * of the interface), as we can't discover anything about intervening
2973 * gateways or networks. We also initialize the congestion/slow start
2974 * window to be a single segment if the destination isn't local.
2975 * While looking at the routing entry, we also initialize other path-dependent
2976 * parameters from pre-set or cached values in the routing entry.
2978 * Also take into account the space needed for options that we
2979 * send regularly. Make maxseg shorter by that amount to assure
2980 * that we can send maxseg amount of data even when the options
2981 * are present. Store the upper limit of the length of options plus
2984 * NOTE that this routine is only called when we process an incoming
2985 * segment, for outgoing segments only tcp_mssopt is called.
2988 tcp_mss(struct tcpcb
*tp
, int offer
)
2994 struct inpcb
*inp
= tp
->t_inpcb
;
2997 boolean_t isipv6
= INP_ISIPV6(inp
);
2998 size_t min_protoh
= isipv6
?
2999 sizeof(struct ip6_hdr
) + sizeof(struct tcphdr
) :
3000 sizeof(struct tcpiphdr
);
3002 const boolean_t isipv6
= FALSE
;
3003 const size_t min_protoh
= sizeof(struct tcpiphdr
);
3007 rt
= tcp_rtlookup6(&inp
->inp_inc
);
3009 rt
= tcp_rtlookup(&inp
->inp_inc
);
3011 tp
->t_maxopd
= tp
->t_maxseg
=
3012 (isipv6
? tcp_v6mssdflt
: tcp_mssdflt
);
3016 so
= inp
->inp_socket
;
3019 * Offer == 0 means that there was no MSS on the SYN segment,
3020 * in this case we use either the interface mtu or tcp_mssdflt.
3022 * An offer which is too large will be cut down later.
3026 if (in6_localaddr(&inp
->in6p_faddr
))
3027 offer
= IN6_LINKMTU(rt
->rt_ifp
) - min_protoh
;
3029 offer
= tcp_v6mssdflt
;
3031 if (in_localaddr(inp
->inp_faddr
))
3032 offer
= ifp
->if_mtu
- min_protoh
;
3034 offer
= tcp_mssdflt
;
3039 * Prevent DoS attack with too small MSS. Round up
3040 * to at least minmss.
3042 * Sanity check: make sure that maxopd will be large
3043 * enough to allow some data on segments even is the
3044 * all the option space is used (40bytes). Otherwise
3045 * funny things may happen in tcp_output.
3047 offer
= max(offer
, tcp_minmss
);
3048 offer
= max(offer
, 64);
3050 rt
->rt_rmx
.rmx_mssopt
= offer
;
3053 * While we're here, check if there's an initial rtt
3054 * or rttvar. Convert from the route-table units
3055 * to scaled multiples of the slow timeout timer.
3057 if (tp
->t_srtt
== 0 && (rtt
= rt
->rt_rmx
.rmx_rtt
)) {
3059 * XXX the lock bit for RTT indicates that the value
3060 * is also a minimum value; this is subject to time.
3062 if (rt
->rt_rmx
.rmx_locks
& RTV_RTT
)
3063 tp
->t_rttmin
= rtt
/ (RTM_RTTUNIT
/ hz
);
3064 tp
->t_srtt
= rtt
/ (RTM_RTTUNIT
/ (hz
* TCP_RTT_SCALE
));
3065 tp
->t_rttbest
= tp
->t_srtt
+ TCP_RTT_SCALE
;
3066 tcpstat
.tcps_usedrtt
++;
3067 if (rt
->rt_rmx
.rmx_rttvar
) {
3068 tp
->t_rttvar
= rt
->rt_rmx
.rmx_rttvar
/
3069 (RTM_RTTUNIT
/ (hz
* TCP_RTTVAR_SCALE
));
3070 tcpstat
.tcps_usedrttvar
++;
3072 /* default variation is +- 1 rtt */
3074 tp
->t_srtt
* TCP_RTTVAR_SCALE
/ TCP_RTT_SCALE
;
3076 TCPT_RANGESET(tp
->t_rxtcur
,
3077 ((tp
->t_srtt
>> 2) + tp
->t_rttvar
) >> 1,
3078 tp
->t_rttmin
, TCPTV_REXMTMAX
);
3082 * if there's an mtu associated with the route, use it
3083 * else, use the link mtu. Take the smaller of mss or offer
3086 if (rt
->rt_rmx
.rmx_mtu
) {
3087 mss
= rt
->rt_rmx
.rmx_mtu
;
3090 mss
= IN6_LINKMTU(rt
->rt_ifp
);
3095 mss
= min(mss
, offer
);
3098 * maxopd stores the maximum length of data AND options
3099 * in a segment; maxseg is the amount of data in a normal
3100 * segment. We need to store this value (maxopd) apart
3101 * from maxseg, because now every segment carries options
3102 * and thus we normally have somewhat less data in segments.
3106 if ((tp
->t_flags
& (TF_REQ_TSTMP
| TF_NOOPT
)) == TF_REQ_TSTMP
&&
3107 ((tp
->t_flags
& TF_RCVD_TSTMP
) == TF_RCVD_TSTMP
))
3108 mss
-= TCPOLEN_TSTAMP_APPA
;
3110 #if (MCLBYTES & (MCLBYTES - 1)) == 0
3112 mss
&= ~(MCLBYTES
-1);
3115 mss
= mss
/ MCLBYTES
* MCLBYTES
;
3118 * If there's a pipesize, change the socket buffer
3119 * to that size. Make the socket buffers an integral
3120 * number of mss units; if the mss is larger than
3121 * the socket buffer, decrease the mss.
3124 if ((bufsize
= rt
->rt_rmx
.rmx_sendpipe
) == 0)
3126 bufsize
= so
->so_snd
.ssb_hiwat
;
3130 bufsize
= roundup(bufsize
, mss
);
3131 if (bufsize
> sb_max
)
3133 if (bufsize
> so
->so_snd
.ssb_hiwat
)
3134 ssb_reserve(&so
->so_snd
, bufsize
, so
, NULL
);
3139 if ((bufsize
= rt
->rt_rmx
.rmx_recvpipe
) == 0)
3141 bufsize
= so
->so_rcv
.ssb_hiwat
;
3142 if (bufsize
> mss
) {
3143 bufsize
= roundup(bufsize
, mss
);
3144 if (bufsize
> sb_max
)
3146 if (bufsize
> so
->so_rcv
.ssb_hiwat
) {
3147 lwkt_gettoken(&so
->so_rcv
.ssb_token
);
3148 ssb_reserve(&so
->so_rcv
, bufsize
, so
, NULL
);
3149 lwkt_reltoken(&so
->so_rcv
.ssb_token
);
3154 * Set the slow-start flight size
3156 * NOTE: t_maxseg must have been configured!
3158 tp
->snd_cwnd
= tcp_initial_window(tp
);
3160 if (rt
->rt_rmx
.rmx_ssthresh
) {
3162 * There's some sort of gateway or interface
3163 * buffer limit on the path. Use this to set
3164 * the slow start threshhold, but set the
3165 * threshold to no less than 2*mss.
3167 tp
->snd_ssthresh
= max(2 * mss
, rt
->rt_rmx
.rmx_ssthresh
);
3168 tcpstat
.tcps_usedssthresh
++;
3173 * Determine the MSS option to send on an outgoing SYN.
3176 tcp_mssopt(struct tcpcb
*tp
)
3180 boolean_t isipv6
= INP_ISIPV6(tp
->t_inpcb
);
3181 int min_protoh
= isipv6
?
3182 sizeof(struct ip6_hdr
) + sizeof(struct tcphdr
) :
3183 sizeof(struct tcpiphdr
);
3185 const boolean_t isipv6
= FALSE
;
3186 const size_t min_protoh
= sizeof(struct tcpiphdr
);
3190 rt
= tcp_rtlookup6(&tp
->t_inpcb
->inp_inc
);
3192 rt
= tcp_rtlookup(&tp
->t_inpcb
->inp_inc
);
3194 return (isipv6
? tcp_v6mssdflt
: tcp_mssdflt
);
3197 return ((isipv6
? IN6_LINKMTU(rt
->rt_ifp
) : rt
->rt_ifp
->if_mtu
) -
3200 return (rt
->rt_ifp
->if_mtu
- min_protoh
);
3205 * When a partial ack arrives, force the retransmission of the
3206 * next unacknowledged segment. Do not exit Fast Recovery.
3208 * Implement the Slow-but-Steady variant of NewReno by restarting the
3209 * the retransmission timer. Turn it off here so it can be restarted
3210 * later in tcp_output().
3213 tcp_newreno_partial_ack(struct tcpcb
*tp
, struct tcphdr
*th
, int acked
)
3215 tcp_seq old_snd_nxt
= tp
->snd_nxt
;
3216 u_long ocwnd
= tp
->snd_cwnd
;
3218 tcp_callout_stop(tp
, tp
->tt_rexmt
);
3220 tp
->snd_nxt
= th
->th_ack
;
3221 /* Set snd_cwnd to one segment beyond acknowledged offset. */
3222 tp
->snd_cwnd
= tp
->t_maxseg
;
3223 tp
->t_flags
|= TF_ACKNOW
;
3225 if (SEQ_GT(old_snd_nxt
, tp
->snd_nxt
))
3226 tp
->snd_nxt
= old_snd_nxt
;
3227 /* partial window deflation */
3229 tp
->snd_cwnd
= ocwnd
- acked
+ tp
->t_maxseg
;
3231 tp
->snd_cwnd
= tp
->t_maxseg
;
3235 * In contrast to the Slow-but-Steady NewReno variant,
3236 * we do not reset the retransmission timer for SACK retransmissions,
3237 * except when retransmitting snd_una.
3240 tcp_sack_rexmt(struct tcpcb
*tp
, boolean_t force
)
3242 tcp_seq old_snd_nxt
= tp
->snd_nxt
;
3243 u_long ocwnd
= tp
->snd_cwnd
;
3245 int nseg
= 0; /* consecutive new segments */
3246 int nseg_rexmt
= 0; /* retransmitted segments */
3250 uint32_t unsacked
= tcp_sack_first_unsacked_len(tp
);
3253 * Try to fill the first hole in the receiver's
3256 maxrexmt
= howmany(unsacked
, tp
->t_maxseg
);
3257 if (maxrexmt
> tcp_force_sackrxt
)
3258 maxrexmt
= tcp_force_sackrxt
;
3262 pipe
= tcp_sack_compute_pipe(tp
);
3263 while (((tcp_seq_diff_t
)(ocwnd
- pipe
) >= (tcp_seq_diff_t
)tp
->t_maxseg
3264 || (force
&& nseg_rexmt
< maxrexmt
&& nseg
== 0)) &&
3265 (!tcp_do_smartsack
|| nseg
< TCP_SACK_MAXBURST
)) {
3266 tcp_seq old_snd_max
, old_rexmt_high
, nextrexmt
;
3267 uint32_t sent
, seglen
;
3271 old_rexmt_high
= tp
->rexmt_high
;
3272 if (!tcp_sack_nextseg(tp
, &nextrexmt
, &seglen
, &rescue
)) {
3273 tp
->rexmt_high
= old_rexmt_high
;
3278 * If the next tranmission is a rescue retranmission,
3279 * we check whether we have already sent some data
3280 * (either new segments or retransmitted segments)
3281 * into the the network or not. Since the idea of rescue
3282 * retransmission is to sustain ACK clock, as long as
3283 * some segments are in the network, ACK clock will be
3286 if (rescue
&& (nseg_rexmt
> 0 || nseg
> 0)) {
3287 tp
->rexmt_high
= old_rexmt_high
;
3291 if (nextrexmt
== tp
->snd_max
)
3295 tp
->snd_nxt
= nextrexmt
;
3296 tp
->snd_cwnd
= nextrexmt
- tp
->snd_una
+ seglen
;
3297 old_snd_max
= tp
->snd_max
;
3298 if (nextrexmt
== tp
->snd_una
)
3299 tcp_callout_stop(tp
, tp
->tt_rexmt
);
3300 tp
->t_flags
|= TF_XMITNOW
;
3301 error
= tcp_output(tp
);
3303 tp
->rexmt_high
= old_rexmt_high
;
3306 sent
= tp
->snd_nxt
- nextrexmt
;
3308 tp
->rexmt_high
= old_rexmt_high
;
3312 tcpstat
.tcps_sndsackpack
++;
3313 tcpstat
.tcps_sndsackbyte
+= sent
;
3316 tcpstat
.tcps_sackrescue
++;
3317 tp
->rexmt_rescue
= tp
->snd_nxt
;
3318 tp
->sack_flags
|= TSACK_F_SACKRESCUED
;
3321 if (SEQ_LT(nextrexmt
, old_snd_max
) &&
3322 SEQ_LT(tp
->rexmt_high
, tp
->snd_nxt
)) {
3323 tp
->rexmt_high
= seq_min(tp
->snd_nxt
, old_snd_max
);
3324 if (tcp_aggressive_rescuesack
&&
3325 (tp
->sack_flags
& TSACK_F_SACKRESCUED
) &&
3326 SEQ_LT(tp
->rexmt_rescue
, tp
->rexmt_high
)) {
3327 /* Drag RescueRxt along with HighRxt */
3328 tp
->rexmt_rescue
= tp
->rexmt_high
;
3332 if (SEQ_GT(old_snd_nxt
, tp
->snd_nxt
))
3333 tp
->snd_nxt
= old_snd_nxt
;
3334 tp
->snd_cwnd
= ocwnd
;
3338 * Return TRUE, if some new segments are sent
3341 tcp_sack_limitedxmit(struct tcpcb
*tp
)
3343 tcp_seq oldsndnxt
= tp
->snd_nxt
;
3344 tcp_seq oldsndmax
= tp
->snd_max
;
3345 u_long ocwnd
= tp
->snd_cwnd
;
3346 uint32_t pipe
, sent
;
3347 boolean_t ret
= FALSE
;
3348 tcp_seq_diff_t cwnd_left
;
3351 tp
->rexmt_high
= tp
->snd_una
- 1;
3352 pipe
= tcp_sack_compute_pipe(tp
);
3353 cwnd_left
= (tcp_seq_diff_t
)(ocwnd
- pipe
);
3354 if (cwnd_left
< (tcp_seq_diff_t
)tp
->t_maxseg
)
3357 if (tcp_do_smartsack
)
3358 cwnd_left
= ulmin(cwnd_left
, tp
->t_maxseg
* TCP_SACK_MAXBURST
);
3360 next
= tp
->snd_nxt
= tp
->snd_max
;
3361 tp
->snd_cwnd
= tp
->snd_nxt
- tp
->snd_una
+
3362 rounddown(cwnd_left
, tp
->t_maxseg
);
3364 tp
->t_flags
|= TF_XMITNOW
;
3367 sent
= tp
->snd_nxt
- next
;
3369 tcpstat
.tcps_sndlimited
+= howmany(sent
, tp
->t_maxseg
);
3373 if (SEQ_LT(oldsndnxt
, oldsndmax
)) {
3374 KASSERT(SEQ_GEQ(oldsndnxt
, tp
->snd_una
),
3375 ("snd_una moved in other threads"));
3376 tp
->snd_nxt
= oldsndnxt
;
3378 tp
->snd_cwnd
= ocwnd
;
3380 if (ret
&& TCP_DO_NCR(tp
))
3381 tcp_ncr_update_rxtthresh(tp
);
3387 * Reset idle time and keep-alive timer, typically called when a valid
3388 * tcp packet is received but may also be called when FASTKEEP is set
3389 * to prevent the previous long-timeout from calculating to a drop.
3391 * Only update t_rcvtime for non-SYN packets.
3393 * Handle the case where one side thinks the connection is established
3394 * but the other side has, say, rebooted without cleaning out the
3395 * connection. The SYNs could be construed as an attack and wind
3396 * up ignored, but in case it isn't an attack we can validate the
3397 * connection by forcing a keepalive.
3400 tcp_timer_keep_activity(struct tcpcb
*tp
, int thflags
)
3402 if (TCPS_HAVEESTABLISHED(tp
->t_state
)) {
3403 if ((thflags
& (TH_SYN
| TH_ACK
)) == TH_SYN
) {
3404 tp
->t_flags
|= TF_KEEPALIVE
;
3405 tcp_callout_reset(tp
, tp
->tt_keep
, hz
/ 2,
3408 tp
->t_rcvtime
= ticks
;
3409 tp
->t_flags
&= ~TF_KEEPALIVE
;
3410 tcp_callout_reset(tp
, tp
->tt_keep
,
3418 tcp_rmx_msl(const struct tcpcb
*tp
)
3421 struct inpcb
*inp
= tp
->t_inpcb
;
3424 boolean_t isipv6
= INP_ISIPV6(inp
);
3426 const boolean_t isipv6
= FALSE
;
3430 rt
= tcp_rtlookup6(&inp
->inp_inc
);
3432 rt
= tcp_rtlookup(&inp
->inp_inc
);
3433 if (rt
== NULL
|| rt
->rt_rmx
.rmx_msl
== 0)
3436 msl
= (rt
->rt_rmx
.rmx_msl
* hz
) / 1000;
3444 tcp_established(struct tcpcb
*tp
)
3446 tp
->t_state
= TCPS_ESTABLISHED
;
3447 tcp_callout_reset(tp
, tp
->tt_keep
, tp
->t_keepidle
, tcp_timer_keep
);
3449 if (tp
->t_rxtsyn
> 0) {
3452 * "If the timer expires awaiting the ACK of a SYN segment
3453 * and the TCP implementation is using an RTO less than 3
3454 * seconds, the RTO MUST be re-initialized to 3 seconds
3455 * when data transmission begins"
3457 if (tp
->t_rxtcur
< TCPTV_RTOBASE3
)
3458 tp
->t_rxtcur
= TCPTV_RTOBASE3
;
3463 * Returns TRUE, if the ACK should be dropped
3466 tcp_recv_dupack(struct tcpcb
*tp
, tcp_seq th_ack
, u_int to_flags
)
3468 boolean_t fast_sack_rexmt
= TRUE
;
3470 tcpstat
.tcps_rcvdupack
++;
3473 * We have outstanding data (other than a window probe),
3474 * this is a completely duplicate ack (ie, window info
3475 * didn't change), the ack is the biggest we've seen and
3476 * we've seen exactly our rexmt threshhold of them, so
3477 * assume a packet has been dropped and retransmit it.
3478 * Kludge snd_nxt & the congestion window so we send only
3481 if (IN_FASTRECOVERY(tp
)) {
3482 if (TCP_DO_SACK(tp
)) {
3483 boolean_t force
= FALSE
;
3485 if (tp
->snd_una
== tp
->rexmt_high
&&
3486 (to_flags
& (TOF_SACK
| TOF_SACK_REDUNDANT
)) ==
3489 * New segments got SACKed and
3490 * no retransmit yet.
3495 /* No artifical cwnd inflation. */
3496 tcp_sack_rexmt(tp
, force
);
3499 * Dup acks mean that packets have left
3500 * the network (they're now cached at the
3501 * receiver) so bump cwnd by the amount in
3502 * the receiver to keep a constant cwnd
3503 * packets in the network.
3505 tp
->snd_cwnd
+= tp
->t_maxseg
;
3509 } else if (SEQ_LT(th_ack
, tp
->snd_recover
)) {
3512 } else if (tcp_ignore_redun_dsack
&& TCP_DO_SACK(tp
) &&
3513 (to_flags
& (TOF_DSACK
| TOF_SACK_REDUNDANT
)) ==
3514 (TOF_DSACK
| TOF_SACK_REDUNDANT
)) {
3516 * If the ACK carries DSACK and other SACK blocks
3517 * carry information that we have already known,
3518 * don't count this ACK as duplicate ACK. This
3519 * prevents spurious early retransmit and fast
3520 * retransmit. This also meets the requirement of
3521 * RFC3042 that new segments should not be sent if
3522 * the SACK blocks do not contain new information
3523 * (XXX we actually loosen the requirment that only
3524 * DSACK is checked here).
3526 * This kind of ACKs are usually sent after spurious
3529 /* Do nothing; don't change t_dupacks */
3531 } else if (tp
->t_dupacks
== 0 && TCP_DO_NCR(tp
)) {
3532 tcp_ncr_update_rxtthresh(tp
);
3535 if (++tp
->t_dupacks
== tp
->t_rxtthresh
) {
3536 tcp_seq old_snd_nxt
;
3540 if (tcp_do_eifel_detect
&& (tp
->t_flags
& TF_RCVD_TSTMP
)) {
3541 tcp_save_congestion_state(tp
);
3542 tp
->rxt_flags
|= TRXT_F_FASTREXMT
;
3545 * We know we're losing at the current window size,
3546 * so do congestion avoidance: set ssthresh to half
3547 * the current window and pull our congestion window
3548 * back to the new ssthresh.
3550 win
= min(tp
->snd_wnd
, tp
->snd_cwnd
) / 2 / tp
->t_maxseg
;
3553 tp
->snd_ssthresh
= win
* tp
->t_maxseg
;
3554 ENTER_FASTRECOVERY(tp
);
3555 tp
->snd_recover
= tp
->snd_max
;
3556 tcp_callout_stop(tp
, tp
->tt_rexmt
);
3558 old_snd_nxt
= tp
->snd_nxt
;
3559 tp
->snd_nxt
= th_ack
;
3560 if (TCP_DO_SACK(tp
)) {
3563 rxtlen
= tcp_sack_first_unsacked_len(tp
);
3564 if (rxtlen
> tp
->t_maxseg
)
3565 rxtlen
= tp
->t_maxseg
;
3566 tp
->snd_cwnd
= rxtlen
;
3568 tp
->snd_cwnd
= tp
->t_maxseg
;
3571 ++tcpstat
.tcps_sndfastrexmit
;
3572 tp
->snd_cwnd
= tp
->snd_ssthresh
;
3573 tp
->rexmt_high
= tp
->snd_nxt
;
3574 tp
->sack_flags
&= ~TSACK_F_SACKRESCUED
;
3575 if (SEQ_GT(old_snd_nxt
, tp
->snd_nxt
))
3576 tp
->snd_nxt
= old_snd_nxt
;
3577 KASSERT(tp
->snd_limited
<= 2, ("tp->snd_limited too big"));
3578 if (TCP_DO_SACK(tp
)) {
3579 if (fast_sack_rexmt
)
3580 tcp_sack_rexmt(tp
, FALSE
);
3582 tp
->snd_cwnd
+= tp
->t_maxseg
*
3583 (tp
->t_dupacks
- tp
->snd_limited
);
3585 } else if ((tcp_do_rfc6675
&& TCP_DO_SACK(tp
)) || TCP_DO_NCR(tp
)) {
3587 * The RFC6675 recommends to reduce the byte threshold,
3588 * and enter fast retransmit if IsLost(snd_una). However,
3589 * if we use IsLost(snd_una) based fast retransmit here,
3590 * segments reordering will cause spurious retransmit. So
3591 * we defer the IsLost(snd_una) based fast retransmit until
3592 * the extended limited transmit can't send any segments and
3593 * early retransmit can't be done.
3595 if (tcp_rfc6675_rxt
&& tcp_do_rfc6675
&&
3596 tcp_sack_islost(&tp
->scb
, tp
->snd_una
))
3597 goto fastretransmit
;
3599 if (tcp_do_limitedtransmit
|| TCP_DO_NCR(tp
)) {
3600 if (!tcp_sack_limitedxmit(tp
)) {
3601 /* outstanding data */
3602 uint32_t ownd
= tp
->snd_max
- tp
->snd_una
;
3604 if (need_early_retransmit(tp
, ownd
)) {
3605 ++tcpstat
.tcps_sndearlyrexmit
;
3606 tp
->rxt_flags
|= TRXT_F_EARLYREXMT
;
3607 goto fastretransmit
;
3608 } else if (tcp_do_rfc6675
&&
3609 tcp_sack_islost(&tp
->scb
, tp
->snd_una
)) {
3610 fast_sack_rexmt
= FALSE
;
3611 goto fastretransmit
;
3615 } else if (tcp_do_limitedtransmit
) {
3616 u_long oldcwnd
= tp
->snd_cwnd
;
3617 tcp_seq oldsndmax
= tp
->snd_max
;
3618 tcp_seq oldsndnxt
= tp
->snd_nxt
;
3619 /* outstanding data */
3620 uint32_t ownd
= tp
->snd_max
- tp
->snd_una
;
3623 KASSERT(tp
->t_dupacks
== 1 || tp
->t_dupacks
== 2,
3624 ("dupacks not 1 or 2"));
3625 if (tp
->t_dupacks
== 1)
3626 tp
->snd_limited
= 0;
3627 tp
->snd_nxt
= tp
->snd_max
;
3628 tp
->snd_cwnd
= ownd
+
3629 (tp
->t_dupacks
- tp
->snd_limited
) * tp
->t_maxseg
;
3630 tp
->t_flags
|= TF_XMITNOW
;
3633 if (SEQ_LT(oldsndnxt
, oldsndmax
)) {
3634 KASSERT(SEQ_GEQ(oldsndnxt
, tp
->snd_una
),
3635 ("snd_una moved in other threads"));
3636 tp
->snd_nxt
= oldsndnxt
;
3638 tp
->snd_cwnd
= oldcwnd
;
3639 sent
= tp
->snd_max
- oldsndmax
;
3640 if (sent
> tp
->t_maxseg
) {
3641 KASSERT((tp
->t_dupacks
== 2 && tp
->snd_limited
== 0) ||
3642 (sent
== tp
->t_maxseg
+ 1 &&
3643 (tp
->t_flags
& TF_SENTFIN
)),
3645 KASSERT(sent
<= tp
->t_maxseg
* 2,
3646 ("sent too many segments"));
3647 tp
->snd_limited
= 2;
3648 tcpstat
.tcps_sndlimited
+= 2;
3649 } else if (sent
> 0) {
3651 ++tcpstat
.tcps_sndlimited
;
3652 } else if (need_early_retransmit(tp
, ownd
)) {
3653 ++tcpstat
.tcps_sndearlyrexmit
;
3654 tp
->rxt_flags
|= TRXT_F_EARLYREXMT
;
3655 goto fastretransmit
;