2 * Copyright (c) 2003, 2004 Jeffrey M. Hsu. All rights reserved.
3 * Copyright (c) 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, 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_subr.c 8.2 (Berkeley) 5/24/95
63 * $FreeBSD: src/sys/netinet/tcp_subr.c,v 1.73.2.31 2003/01/24 05:11:34 sam Exp $
66 #include "opt_compat.h"
68 #include "opt_inet6.h"
69 #include "opt_ipsec.h"
70 #include "opt_tcpdebug.h"
72 #include <sys/param.h>
73 #include <sys/systm.h>
74 #include <sys/callout.h>
75 #include <sys/kernel.h>
76 #include <sys/sysctl.h>
77 #include <sys/malloc.h>
78 #include <sys/mpipe.h>
81 #include <sys/domain.h>
85 #include <sys/socket.h>
86 #include <sys/socketops.h>
87 #include <sys/socketvar.h>
88 #include <sys/protosw.h>
89 #include <sys/random.h>
90 #include <sys/in_cksum.h>
93 #include <net/route.h>
95 #include <net/netisr2.h>
98 #include <netinet/in.h>
99 #include <netinet/in_systm.h>
100 #include <netinet/ip.h>
101 #include <netinet/ip6.h>
102 #include <netinet/in_pcb.h>
103 #include <netinet6/in6_pcb.h>
104 #include <netinet/in_var.h>
105 #include <netinet/ip_var.h>
106 #include <netinet6/ip6_var.h>
107 #include <netinet/ip_icmp.h>
109 #include <netinet/icmp6.h>
111 #include <netinet/tcp.h>
112 #include <netinet/tcp_fsm.h>
113 #include <netinet/tcp_seq.h>
114 #include <netinet/tcp_timer.h>
115 #include <netinet/tcp_timer2.h>
116 #include <netinet/tcp_var.h>
117 #include <netinet6/tcp6_var.h>
118 #include <netinet/tcpip.h>
120 #include <netinet/tcp_debug.h>
122 #include <netinet6/ip6protosw.h>
125 #include <netinet6/ipsec.h>
126 #include <netproto/key/key.h>
128 #include <netinet6/ipsec6.h>
133 #include <netproto/ipsec/ipsec.h>
135 #include <netproto/ipsec/ipsec6.h>
141 #include <machine/smp.h>
143 #include <sys/msgport2.h>
144 #include <sys/mplock2.h>
145 #include <net/netmsg2.h>
147 #if !defined(KTR_TCP)
148 #define KTR_TCP KTR_ALL
151 KTR_INFO_MASTER(tcp);
152 KTR_INFO(KTR_TCP, tcp, rxmsg, 0, "tcp getmsg", 0);
153 KTR_INFO(KTR_TCP, tcp, wait, 1, "tcp waitmsg", 0);
154 KTR_INFO(KTR_TCP, tcp, delayed, 2, "tcp execute delayed ops", 0);
155 #define logtcp(name) KTR_LOG(tcp_ ## name)
158 #define TCP_IW_MAXSEGS_DFLT 4
159 #define TCP_IW_CAPSEGS_DFLT 3
161 struct inpcbinfo tcbinfo[MAXCPU];
162 struct tcpcbackqhead tcpcbackq[MAXCPU];
164 int tcp_mssdflt = TCP_MSS;
165 SYSCTL_INT(_net_inet_tcp, TCPCTL_MSSDFLT, mssdflt, CTLFLAG_RW,
166 &tcp_mssdflt, 0, "Default TCP Maximum Segment Size");
169 int tcp_v6mssdflt = TCP6_MSS;
170 SYSCTL_INT(_net_inet_tcp, TCPCTL_V6MSSDFLT, v6mssdflt, CTLFLAG_RW,
171 &tcp_v6mssdflt, 0, "Default TCP Maximum Segment Size for IPv6");
175 * Minimum MSS we accept and use. This prevents DoS attacks where
176 * we are forced to a ridiculous low MSS like 20 and send hundreds
177 * of packets instead of one. The effect scales with the available
178 * bandwidth and quickly saturates the CPU and network interface
179 * with packet generation and sending. Set to zero to disable MINMSS
180 * checking. This setting prevents us from sending too small packets.
182 int tcp_minmss = TCP_MINMSS;
183 SYSCTL_INT(_net_inet_tcp, OID_AUTO, minmss, CTLFLAG_RW,
184 &tcp_minmss , 0, "Minmum TCP Maximum Segment Size");
187 static int tcp_rttdflt = TCPTV_SRTTDFLT / PR_SLOWHZ;
188 SYSCTL_INT(_net_inet_tcp, TCPCTL_RTTDFLT, rttdflt, CTLFLAG_RW,
189 &tcp_rttdflt, 0, "Default maximum TCP Round Trip Time");
192 int tcp_do_rfc1323 = 1;
193 SYSCTL_INT(_net_inet_tcp, TCPCTL_DO_RFC1323, rfc1323, CTLFLAG_RW,
194 &tcp_do_rfc1323, 0, "Enable rfc1323 (high performance TCP) extensions");
196 static int tcp_tcbhashsize = 0;
197 SYSCTL_INT(_net_inet_tcp, OID_AUTO, tcbhashsize, CTLFLAG_RD,
198 &tcp_tcbhashsize, 0, "Size of TCP control block hashtable");
200 static int do_tcpdrain = 1;
201 SYSCTL_INT(_net_inet_tcp, OID_AUTO, do_tcpdrain, CTLFLAG_RW, &do_tcpdrain, 0,
202 "Enable tcp_drain routine for extra help when low on mbufs");
204 static int icmp_may_rst = 1;
205 SYSCTL_INT(_net_inet_tcp, OID_AUTO, icmp_may_rst, CTLFLAG_RW, &icmp_may_rst, 0,
206 "Certain ICMP unreachable messages may abort connections in SYN_SENT");
208 static int tcp_isn_reseed_interval = 0;
209 SYSCTL_INT(_net_inet_tcp, OID_AUTO, isn_reseed_interval, CTLFLAG_RW,
210 &tcp_isn_reseed_interval, 0, "Seconds between reseeding of ISN secret");
213 * TCP bandwidth limiting sysctls. The inflight limiter is now turned on
214 * by default, but with generous values which should allow maximal
215 * bandwidth. In particular, the slop defaults to 50 (5 packets).
217 * The reason for doing this is that the limiter is the only mechanism we
218 * have which seems to do a really good job preventing receiver RX rings
219 * on network interfaces from getting blown out. Even though GigE/10GigE
220 * is supposed to flow control it looks like either it doesn't actually
221 * do it or Open Source drivers do not properly enable it.
223 * People using the limiter to reduce bottlenecks on slower WAN connections
224 * should set the slop to 20 (2 packets).
226 static int tcp_inflight_enable = 1;
227 SYSCTL_INT(_net_inet_tcp, OID_AUTO, inflight_enable, CTLFLAG_RW,
228 &tcp_inflight_enable, 0, "Enable automatic TCP inflight data limiting");
230 static int tcp_inflight_debug = 0;
231 SYSCTL_INT(_net_inet_tcp, OID_AUTO, inflight_debug, CTLFLAG_RW,
232 &tcp_inflight_debug, 0, "Debug TCP inflight calculations");
234 static int tcp_inflight_min = 6144;
235 SYSCTL_INT(_net_inet_tcp, OID_AUTO, inflight_min, CTLFLAG_RW,
236 &tcp_inflight_min, 0, "Lower bound for TCP inflight window");
238 static int tcp_inflight_max = TCP_MAXWIN << TCP_MAX_WINSHIFT;
239 SYSCTL_INT(_net_inet_tcp, OID_AUTO, inflight_max, CTLFLAG_RW,
240 &tcp_inflight_max, 0, "Upper bound for TCP inflight window");
242 static int tcp_inflight_stab = 50;
243 SYSCTL_INT(_net_inet_tcp, OID_AUTO, inflight_stab, CTLFLAG_RW,
244 &tcp_inflight_stab, 0, "Fudge bw 1/10% (50=5%)");
246 static int tcp_inflight_adjrtt = 2;
247 SYSCTL_INT(_net_inet_tcp, OID_AUTO, inflight_adjrtt, CTLFLAG_RW,
248 &tcp_inflight_adjrtt, 0, "Slop for rtt 1/(hz*32)");
250 static int tcp_do_rfc3390 = 1;
251 SYSCTL_INT(_net_inet_tcp, OID_AUTO, rfc3390, CTLFLAG_RW,
253 "Enable RFC 3390 (Increasing TCP's Initial Congestion Window)");
255 static u_long tcp_iw_maxsegs = TCP_IW_MAXSEGS_DFLT;
256 SYSCTL_ULONG(_net_inet_tcp, OID_AUTO, iwmaxsegs, CTLFLAG_RW,
257 &tcp_iw_maxsegs, 0, "TCP IW segments max");
259 static u_long tcp_iw_capsegs = TCP_IW_CAPSEGS_DFLT;
260 SYSCTL_ULONG(_net_inet_tcp, OID_AUTO, iwcapsegs, CTLFLAG_RW,
261 &tcp_iw_capsegs, 0, "TCP IW segments");
263 int tcp_low_rtobase = 1;
264 SYSCTL_INT(_net_inet_tcp, OID_AUTO, low_rtobase, CTLFLAG_RW,
265 &tcp_low_rtobase, 0, "Lowering the Initial RTO (RFC 6298)");
267 static int tcp_do_ncr = 1;
268 SYSCTL_INT(_net_inet_tcp, OID_AUTO, ncr, CTLFLAG_RW,
269 &tcp_do_ncr, 0, "Non-Congestion Robustness (RFC 4653)");
271 static MALLOC_DEFINE(M_TCPTEMP, "tcptemp", "TCP Templates for Keepalives");
272 static struct malloc_pipe tcptemp_mpipe;
274 static void tcp_willblock(void);
275 static void tcp_notify (struct inpcb *, int);
277 struct tcp_stats tcpstats_percpu[MAXCPU] __cachealign;
280 sysctl_tcpstats(SYSCTL_HANDLER_ARGS)
284 for (cpu = 0; cpu < ncpus2; ++cpu) {
285 if ((error = SYSCTL_OUT(req, &tcpstats_percpu[cpu],
286 sizeof(struct tcp_stats))))
288 if ((error = SYSCTL_IN(req, &tcpstats_percpu[cpu],
289 sizeof(struct tcp_stats))))
295 SYSCTL_PROC(_net_inet_tcp, TCPCTL_STATS, stats, (CTLTYPE_OPAQUE | CTLFLAG_RW),
296 0, 0, sysctl_tcpstats, "S,tcp_stats", "TCP statistics");
299 * Target size of TCP PCB hash tables. Must be a power of two.
301 * Note that this can be overridden by the kernel environment
302 * variable net.inet.tcp.tcbhashsize
305 #define TCBHASHSIZE 512
309 * This is the actual shape of what we allocate using the zone
310 * allocator. Doing it this way allows us to protect both structures
311 * using the same generation count, and also eliminates the overhead
312 * of allocating tcpcbs separately. By hiding the structure here,
313 * we avoid changing most of the rest of the code (although it needs
314 * to be changed, eventually, for greater efficiency).
317 #define ALIGNM1 (ALIGNMENT - 1)
321 char align[(sizeof(struct inpcb) + ALIGNM1) & ~ALIGNM1];
324 struct tcp_callout inp_tp_rexmt;
325 struct tcp_callout inp_tp_persist;
326 struct tcp_callout inp_tp_keep;
327 struct tcp_callout inp_tp_2msl;
328 struct tcp_callout inp_tp_delack;
329 struct netmsg_tcp_timer inp_tp_timermsg;
330 struct netmsg_base inp_tp_sndmore;
341 struct inpcbportinfo *portinfo;
342 struct inpcbinfo *ticb;
343 int hashsize = TCBHASHSIZE;
347 * note: tcptemp is used for keepalives, and it is ok for an
348 * allocation to fail so do not specify MPF_INT.
350 mpipe_init(&tcptemp_mpipe, M_TCPTEMP, sizeof(struct tcptemp),
351 25, -1, 0, NULL, NULL, NULL);
353 tcp_delacktime = TCPTV_DELACK;
354 tcp_keepinit = TCPTV_KEEP_INIT;
355 tcp_keepidle = TCPTV_KEEP_IDLE;
356 tcp_keepintvl = TCPTV_KEEPINTVL;
357 tcp_maxpersistidle = TCPTV_KEEP_IDLE;
359 tcp_rexmit_min = TCPTV_MIN;
360 tcp_rexmit_slop = TCPTV_CPU_VAR;
362 TUNABLE_INT_FETCH("net.inet.tcp.tcbhashsize", &hashsize);
363 if (!powerof2(hashsize)) {
364 kprintf("WARNING: TCB hash size not a power of 2\n");
365 hashsize = 512; /* safe default */
367 tcp_tcbhashsize = hashsize;
369 portinfo = kmalloc_cachealign(sizeof(*portinfo) * ncpus2, M_PCB,
372 for (cpu = 0; cpu < ncpus2; cpu++) {
373 ticb = &tcbinfo[cpu];
374 in_pcbinfo_init(ticb);
376 ticb->hashbase = hashinit(hashsize, M_PCB,
378 in_pcbportinfo_init(&portinfo[cpu], hashsize, TRUE, cpu);
379 ticb->portinfo = portinfo;
380 ticb->portinfo_mask = ncpus2_mask;
381 ticb->wildcardhashbase = hashinit(hashsize, M_PCB,
382 &ticb->wildcardhashmask);
383 ticb->localgrphashbase = hashinit(hashsize, M_PCB,
384 &ticb->localgrphashmask);
385 ticb->ipi_size = sizeof(struct inp_tp);
386 TAILQ_INIT(&tcpcbackq[cpu]);
389 tcp_reass_maxseg = nmbclusters / 16;
390 TUNABLE_INT_FETCH("net.inet.tcp.reass.maxsegments", &tcp_reass_maxseg);
393 #define TCP_MINPROTOHDR (sizeof(struct ip6_hdr) + sizeof(struct tcphdr))
395 #define TCP_MINPROTOHDR (sizeof(struct tcpiphdr))
397 if (max_protohdr < TCP_MINPROTOHDR)
398 max_protohdr = TCP_MINPROTOHDR;
399 if (max_linkhdr + TCP_MINPROTOHDR > MHLEN)
401 #undef TCP_MINPROTOHDR
404 * Initialize TCP statistics counters for each CPU.
406 for (cpu = 0; cpu < ncpus2; ++cpu)
407 bzero(&tcpstats_percpu[cpu], sizeof(struct tcp_stats));
410 netisr_register_rollup(tcp_willblock, NETISR_ROLLUP_PRIO_TCP);
417 int cpu = mycpu->gd_cpuid;
419 while ((tp = TAILQ_FIRST(&tcpcbackq[cpu])) != NULL) {
420 KKASSERT(tp->t_flags & TF_ONOUTPUTQ);
421 tp->t_flags &= ~TF_ONOUTPUTQ;
422 TAILQ_REMOVE(&tcpcbackq[cpu], tp, t_outputq);
428 * Fill in the IP and TCP headers for an outgoing packet, given the tcpcb.
429 * tcp_template used to store this data in mbufs, but we now recopy it out
430 * of the tcpcb each time to conserve mbufs.
433 tcp_fillheaders(struct tcpcb *tp, void *ip_ptr, void *tcp_ptr, boolean_t tso)
435 struct inpcb *inp = tp->t_inpcb;
436 struct tcphdr *tcp_hdr = (struct tcphdr *)tcp_ptr;
439 if (inp->inp_vflag & INP_IPV6) {
442 ip6 = (struct ip6_hdr *)ip_ptr;
443 ip6->ip6_flow = (ip6->ip6_flow & ~IPV6_FLOWINFO_MASK) |
444 (inp->in6p_flowinfo & IPV6_FLOWINFO_MASK);
445 ip6->ip6_vfc = (ip6->ip6_vfc & ~IPV6_VERSION_MASK) |
446 (IPV6_VERSION & IPV6_VERSION_MASK);
447 ip6->ip6_nxt = IPPROTO_TCP;
448 ip6->ip6_plen = sizeof(struct tcphdr);
449 ip6->ip6_src = inp->in6p_laddr;
450 ip6->ip6_dst = inp->in6p_faddr;
455 struct ip *ip = (struct ip *) ip_ptr;
458 ip->ip_vhl = IP_VHL_BORING;
465 ip->ip_p = IPPROTO_TCP;
466 ip->ip_src = inp->inp_laddr;
467 ip->ip_dst = inp->inp_faddr;
470 plen = htons(IPPROTO_TCP);
472 plen = htons(sizeof(struct tcphdr) + IPPROTO_TCP);
473 tcp_hdr->th_sum = in_pseudo(ip->ip_src.s_addr,
474 ip->ip_dst.s_addr, plen);
477 tcp_hdr->th_sport = inp->inp_lport;
478 tcp_hdr->th_dport = inp->inp_fport;
483 tcp_hdr->th_flags = 0;
489 * Create template to be used to send tcp packets on a connection.
490 * Allocates an mbuf and fills in a skeletal tcp/ip header. The only
491 * use for this function is in keepalives, which use tcp_respond.
494 tcp_maketemplate(struct tcpcb *tp)
498 if ((tmp = mpipe_alloc_nowait(&tcptemp_mpipe)) == NULL)
500 tcp_fillheaders(tp, &tmp->tt_ipgen, &tmp->tt_t, FALSE);
505 tcp_freetemplate(struct tcptemp *tmp)
507 mpipe_free(&tcptemp_mpipe, tmp);
511 * Send a single message to the TCP at address specified by
512 * the given TCP/IP header. If m == NULL, then we make a copy
513 * of the tcpiphdr at ti and send directly to the addressed host.
514 * This is used to force keep alive messages out using the TCP
515 * template for a connection. If flags are given then we send
516 * a message back to the TCP which originated the * segment ti,
517 * and discard the mbuf containing it and any other attached mbufs.
519 * In any case the ack and sequence number of the transmitted
520 * segment are as specified by the parameters.
522 * NOTE: If m != NULL, then ti must point to *inside* the mbuf.
525 tcp_respond(struct tcpcb *tp, void *ipgen, struct tcphdr *th, struct mbuf *m,
526 tcp_seq ack, tcp_seq seq, int flags)
530 struct route *ro = NULL;
532 struct ip *ip = ipgen;
535 struct route_in6 *ro6 = NULL;
536 struct route_in6 sro6;
537 struct ip6_hdr *ip6 = ipgen;
538 boolean_t use_tmpro = TRUE;
540 boolean_t isipv6 = (IP_VHL_V(ip->ip_vhl) == 6);
542 const boolean_t isipv6 = FALSE;
546 if (!(flags & TH_RST)) {
547 win = ssb_space(&tp->t_inpcb->inp_socket->so_rcv);
550 if (win > (long)TCP_MAXWIN << tp->rcv_scale)
551 win = (long)TCP_MAXWIN << tp->rcv_scale;
554 * Don't use the route cache of a listen socket,
555 * it is not MPSAFE; use temporary route cache.
557 if (tp->t_state != TCPS_LISTEN) {
559 ro6 = &tp->t_inpcb->in6p_route;
561 ro = &tp->t_inpcb->inp_route;
568 bzero(ro6, sizeof *ro6);
571 bzero(ro, sizeof *ro);
575 m = m_gethdr(MB_DONTWAIT, MT_HEADER);
579 m->m_data += max_linkhdr;
581 bcopy(ip6, mtod(m, caddr_t), sizeof(struct ip6_hdr));
582 ip6 = mtod(m, struct ip6_hdr *);
583 nth = (struct tcphdr *)(ip6 + 1);
585 bcopy(ip, mtod(m, caddr_t), sizeof(struct ip));
586 ip = mtod(m, struct ip *);
587 nth = (struct tcphdr *)(ip + 1);
589 bcopy(th, nth, sizeof(struct tcphdr));
594 m->m_data = (caddr_t)ipgen;
595 /* m_len is set later */
597 #define xchg(a, b, type) { type t; t = a; a = b; b = t; }
599 xchg(ip6->ip6_dst, ip6->ip6_src, struct in6_addr);
600 nth = (struct tcphdr *)(ip6 + 1);
602 xchg(ip->ip_dst.s_addr, ip->ip_src.s_addr, n_long);
603 nth = (struct tcphdr *)(ip + 1);
607 * this is usually a case when an extension header
608 * exists between the IPv6 header and the
611 nth->th_sport = th->th_sport;
612 nth->th_dport = th->th_dport;
614 xchg(nth->th_dport, nth->th_sport, n_short);
619 ip6->ip6_vfc = IPV6_VERSION;
620 ip6->ip6_nxt = IPPROTO_TCP;
621 ip6->ip6_plen = htons((u_short)(sizeof(struct tcphdr) + tlen));
622 tlen += sizeof(struct ip6_hdr) + sizeof(struct tcphdr);
624 tlen += sizeof(struct tcpiphdr);
626 ip->ip_ttl = ip_defttl;
629 m->m_pkthdr.len = tlen;
630 m->m_pkthdr.rcvif = NULL;
631 nth->th_seq = htonl(seq);
632 nth->th_ack = htonl(ack);
634 nth->th_off = sizeof(struct tcphdr) >> 2;
635 nth->th_flags = flags;
637 nth->th_win = htons((u_short) (win >> tp->rcv_scale));
639 nth->th_win = htons((u_short)win);
643 nth->th_sum = in6_cksum(m, IPPROTO_TCP,
644 sizeof(struct ip6_hdr),
645 tlen - sizeof(struct ip6_hdr));
646 ip6->ip6_hlim = in6_selecthlim(tp ? tp->t_inpcb : NULL,
647 (ro6 && ro6->ro_rt) ?
648 ro6->ro_rt->rt_ifp : NULL);
650 nth->th_sum = in_pseudo(ip->ip_src.s_addr, ip->ip_dst.s_addr,
651 htons((u_short)(tlen - sizeof(struct ip) + ip->ip_p)));
652 m->m_pkthdr.csum_flags = CSUM_TCP;
653 m->m_pkthdr.csum_data = offsetof(struct tcphdr, th_sum);
654 m->m_pkthdr.csum_thlen = sizeof(struct tcphdr);
657 if (tp == NULL || (tp->t_inpcb->inp_socket->so_options & SO_DEBUG))
658 tcp_trace(TA_OUTPUT, 0, tp, mtod(m, void *), th, 0);
661 ip6_output(m, NULL, ro6, ipflags, NULL, NULL,
662 tp ? tp->t_inpcb : NULL);
663 if ((ro6 == &sro6) && (ro6->ro_rt != NULL)) {
668 ipflags |= IP_DEBUGROUTE;
669 ip_output(m, NULL, ro, ipflags, NULL, tp ? tp->t_inpcb : NULL);
670 if ((ro == &sro) && (ro->ro_rt != NULL)) {
678 * Create a new TCP control block, making an
679 * empty reassembly queue and hooking it to the argument
680 * protocol control block. The `inp' parameter must have
681 * come from the zone allocator set up in tcp_init().
684 tcp_newtcpcb(struct inpcb *inp)
689 boolean_t isipv6 = ((inp->inp_vflag & INP_IPV6) != 0);
691 const boolean_t isipv6 = FALSE;
694 it = (struct inp_tp *)inp;
696 bzero(tp, sizeof(struct tcpcb));
697 TAILQ_INIT(&tp->t_segq);
698 tp->t_maxseg = tp->t_maxopd = isipv6 ? tcp_v6mssdflt : tcp_mssdflt;
699 tp->t_rxtthresh = tcprexmtthresh;
701 /* Set up our timeouts. */
702 tp->tt_rexmt = &it->inp_tp_rexmt;
703 tp->tt_persist = &it->inp_tp_persist;
704 tp->tt_keep = &it->inp_tp_keep;
705 tp->tt_2msl = &it->inp_tp_2msl;
706 tp->tt_delack = &it->inp_tp_delack;
710 * Zero out timer message. We don't create it here,
711 * since the current CPU may not be the owner of this
714 tp->tt_msg = &it->inp_tp_timermsg;
715 bzero(tp->tt_msg, sizeof(*tp->tt_msg));
717 tp->t_keepinit = tcp_keepinit;
718 tp->t_keepidle = tcp_keepidle;
719 tp->t_keepintvl = tcp_keepintvl;
720 tp->t_keepcnt = tcp_keepcnt;
721 tp->t_maxidle = tp->t_keepintvl * tp->t_keepcnt;
724 tp->t_flags |= TF_NCR;
726 tp->t_flags |= (TF_REQ_SCALE | TF_REQ_TSTMP);
728 tp->t_inpcb = inp; /* XXX */
729 tp->t_state = TCPS_CLOSED;
731 * Init srtt to TCPTV_SRTTBASE (0), so we can tell that we have no
732 * rtt estimate. Set rttvar so that srtt + 4 * rttvar gives
733 * reasonable initial retransmit time.
735 tp->t_srtt = TCPTV_SRTTBASE;
737 ((TCPTV_RTOBASE - TCPTV_SRTTBASE) << TCP_RTTVAR_SHIFT) / 4;
738 tp->t_rttmin = tcp_rexmit_min;
739 tp->t_rxtcur = TCPTV_RTOBASE;
740 tp->snd_cwnd = TCP_MAXWIN << TCP_MAX_WINSHIFT;
741 tp->snd_bwnd = TCP_MAXWIN << TCP_MAX_WINSHIFT;
742 tp->snd_ssthresh = TCP_MAXWIN << TCP_MAX_WINSHIFT;
743 tp->snd_last = ticks;
744 tp->t_rcvtime = ticks;
746 * IPv4 TTL initialization is necessary for an IPv6 socket as well,
747 * because the socket may be bound to an IPv6 wildcard address,
748 * which may match an IPv4-mapped IPv6 address.
750 inp->inp_ip_ttl = ip_defttl;
752 tcp_sack_tcpcb_init(tp);
754 tp->tt_sndmore = &it->inp_tp_sndmore;
757 return (tp); /* XXX */
761 * Drop a TCP connection, reporting the specified error.
762 * If connection is synchronized, then send a RST to peer.
765 tcp_drop(struct tcpcb *tp, int error)
767 struct socket *so = tp->t_inpcb->inp_socket;
769 if (TCPS_HAVERCVDSYN(tp->t_state)) {
770 tp->t_state = TCPS_CLOSED;
772 tcpstat.tcps_drops++;
774 tcpstat.tcps_conndrops++;
775 if (error == ETIMEDOUT && tp->t_softerror)
776 error = tp->t_softerror;
777 so->so_error = error;
778 return (tcp_close(tp));
781 struct netmsg_listen_detach {
782 struct netmsg_base base;
784 struct tcpcb *nm_tp_inh;
788 tcp_listen_detach_handler(netmsg_t msg)
790 struct netmsg_listen_detach *nmsg = (struct netmsg_listen_detach *)msg;
791 struct tcpcb *tp = nmsg->nm_tp;
792 int cpu = mycpuid, nextcpu;
794 if (tp->t_flags & TF_LISTEN)
795 syncache_destroy(tp, nmsg->nm_tp_inh);
797 in_pcbremwildcardhash_oncpu(tp->t_inpcb, &tcbinfo[cpu]);
800 if (nextcpu < ncpus2)
801 lwkt_forwardmsg(netisr_cpuport(nextcpu), &nmsg->base.lmsg);
803 lwkt_replymsg(&nmsg->base.lmsg, 0);
807 * Close a TCP control block:
808 * discard all space held by the tcp
809 * discard internet protocol block
810 * wake up any sleepers
813 tcp_close(struct tcpcb *tp)
816 struct inpcb *inp = tp->t_inpcb;
817 struct inpcb *inp_inh = NULL;
818 struct tcpcb *tp_inh = NULL;
819 struct socket *so = inp->inp_socket;
821 boolean_t dosavessthresh;
823 boolean_t isipv6 = ((inp->inp_vflag & INP_IPV6) != 0);
824 boolean_t isafinet6 = (INP_CHECK_SOCKAF(so, AF_INET6) != 0);
826 const boolean_t isipv6 = FALSE;
829 if (tp->t_flags & TF_LISTEN) {
831 * Pending socket/syncache inheritance
833 * If this is a listen(2) socket, find another listen(2)
834 * socket in the same local group, which could inherit
835 * the syncache and sockets pending on the completion
836 * and incompletion queues.
839 * Currently the inheritance could only happen on the
840 * listen(2) sockets w/ SO_REUSEPORT set.
842 KASSERT(&curthread->td_msgport == netisr_cpuport(0),
843 ("listen socket close not in netisr0"));
844 inp_inh = in_pcblocalgroup_last(&tcbinfo[0], inp);
846 tp_inh = intotcpcb(inp_inh);
850 * INP_WILDCARD_MP indicates that listen(2) has been called on
851 * this socket. This implies:
852 * - A wildcard inp's hash is replicated for each protocol thread.
853 * - Syncache for this inp grows independently in each protocol
855 * - There is more than one cpu
857 * We have to chain a message to the rest of the protocol threads
858 * to cleanup the wildcard hash and the syncache. The cleanup
859 * in the current protocol thread is defered till the end of this
863 * After cleanup the inp's hash and syncache entries, this inp will
864 * no longer be available to the rest of the protocol threads, so we
865 * are safe to whack the inp in the following code.
867 if (inp->inp_flags & INP_WILDCARD_MP) {
868 struct netmsg_listen_detach nmsg;
870 KKASSERT(so->so_port == netisr_cpuport(0));
871 KKASSERT(&curthread->td_msgport == netisr_cpuport(0));
872 KKASSERT(inp->inp_pcbinfo == &tcbinfo[0]);
874 netmsg_init(&nmsg.base, NULL, &curthread->td_msgport,
875 MSGF_PRIORITY, tcp_listen_detach_handler);
877 nmsg.nm_tp_inh = tp_inh;
878 lwkt_domsg(netisr_cpuport(1), &nmsg.base.lmsg, 0);
880 inp->inp_flags &= ~INP_WILDCARD_MP;
883 KKASSERT(tp->t_state != TCPS_TERMINATING);
884 tp->t_state = TCPS_TERMINATING;
887 * Make sure that all of our timers are stopped before we
888 * delete the PCB. For listen TCP socket (tp->tt_msg == NULL),
889 * timers are never used. If timer message is never created
890 * (tp->tt_msg->tt_tcb == NULL), timers are never used too.
892 if (tp->tt_msg != NULL && tp->tt_msg->tt_tcb != NULL) {
893 tcp_callout_stop(tp, tp->tt_rexmt);
894 tcp_callout_stop(tp, tp->tt_persist);
895 tcp_callout_stop(tp, tp->tt_keep);
896 tcp_callout_stop(tp, tp->tt_2msl);
897 tcp_callout_stop(tp, tp->tt_delack);
900 if (tp->t_flags & TF_ONOUTPUTQ) {
901 KKASSERT(tp->tt_cpu == mycpu->gd_cpuid);
902 TAILQ_REMOVE(&tcpcbackq[tp->tt_cpu], tp, t_outputq);
903 tp->t_flags &= ~TF_ONOUTPUTQ;
907 * If we got enough samples through the srtt filter,
908 * save the rtt and rttvar in the routing entry.
909 * 'Enough' is arbitrarily defined as the 16 samples.
910 * 16 samples is enough for the srtt filter to converge
911 * to within 5% of the correct value; fewer samples and
912 * we could save a very bogus rtt.
914 * Don't update the default route's characteristics and don't
915 * update anything that the user "locked".
917 if (tp->t_rttupdated >= 16) {
921 struct sockaddr_in6 *sin6;
923 if ((rt = inp->in6p_route.ro_rt) == NULL)
925 sin6 = (struct sockaddr_in6 *)rt_key(rt);
926 if (IN6_IS_ADDR_UNSPECIFIED(&sin6->sin6_addr))
929 if ((rt = inp->inp_route.ro_rt) == NULL ||
930 ((struct sockaddr_in *)rt_key(rt))->
931 sin_addr.s_addr == INADDR_ANY)
934 if (!(rt->rt_rmx.rmx_locks & RTV_RTT)) {
935 i = tp->t_srtt * (RTM_RTTUNIT / (hz * TCP_RTT_SCALE));
936 if (rt->rt_rmx.rmx_rtt && i)
938 * filter this update to half the old & half
939 * the new values, converting scale.
940 * See route.h and tcp_var.h for a
941 * description of the scaling constants.
944 (rt->rt_rmx.rmx_rtt + i) / 2;
946 rt->rt_rmx.rmx_rtt = i;
947 tcpstat.tcps_cachedrtt++;
949 if (!(rt->rt_rmx.rmx_locks & RTV_RTTVAR)) {
951 (RTM_RTTUNIT / (hz * TCP_RTTVAR_SCALE));
952 if (rt->rt_rmx.rmx_rttvar && i)
953 rt->rt_rmx.rmx_rttvar =
954 (rt->rt_rmx.rmx_rttvar + i) / 2;
956 rt->rt_rmx.rmx_rttvar = i;
957 tcpstat.tcps_cachedrttvar++;
960 * The old comment here said:
961 * update the pipelimit (ssthresh) if it has been updated
962 * already or if a pipesize was specified & the threshhold
963 * got below half the pipesize. I.e., wait for bad news
964 * before we start updating, then update on both good
967 * But we want to save the ssthresh even if no pipesize is
968 * specified explicitly in the route, because such
969 * connections still have an implicit pipesize specified
970 * by the global tcp_sendspace. In the absence of a reliable
971 * way to calculate the pipesize, it will have to do.
973 i = tp->snd_ssthresh;
974 if (rt->rt_rmx.rmx_sendpipe != 0)
975 dosavessthresh = (i < rt->rt_rmx.rmx_sendpipe/2);
977 dosavessthresh = (i < so->so_snd.ssb_hiwat/2);
978 if (dosavessthresh ||
979 (!(rt->rt_rmx.rmx_locks & RTV_SSTHRESH) && (i != 0) &&
980 (rt->rt_rmx.rmx_ssthresh != 0))) {
982 * convert the limit from user data bytes to
983 * packets then to packet data bytes.
985 i = (i + tp->t_maxseg / 2) / tp->t_maxseg;
990 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) :
991 sizeof(struct tcpiphdr));
992 if (rt->rt_rmx.rmx_ssthresh)
993 rt->rt_rmx.rmx_ssthresh =
994 (rt->rt_rmx.rmx_ssthresh + i) / 2;
996 rt->rt_rmx.rmx_ssthresh = i;
997 tcpstat.tcps_cachedssthresh++;
1002 /* free the reassembly queue, if any */
1003 while((q = TAILQ_FIRST(&tp->t_segq)) != NULL) {
1004 TAILQ_REMOVE(&tp->t_segq, q, tqe_q);
1007 atomic_add_int(&tcp_reass_qsize, -1);
1009 /* throw away SACK blocks in scoreboard*/
1010 if (TCP_DO_SACK(tp))
1011 tcp_sack_destroy(&tp->scb);
1013 inp->inp_ppcb = NULL;
1014 soisdisconnected(so);
1015 /* note: pcb detached later on */
1017 tcp_destroy_timermsg(tp);
1018 tcp_output_cancel(tp);
1020 if (tp->t_flags & TF_LISTEN) {
1021 syncache_destroy(tp, tp_inh);
1022 if (inp_inh != NULL && inp_inh->inp_socket != NULL) {
1024 * Pending sockets inheritance only needs
1025 * to be done once in the current thread,
1028 soinherit(so, inp_inh->inp_socket);
1032 so_async_rcvd_drop(so);
1033 /* Drop the reference for the asynchronized pru_rcvd */
1038 * pcbdetach removes any wildcard hash entry on the current CPU.
1047 tcpstat.tcps_closed++;
1051 static __inline void
1052 tcp_drain_oncpu(struct inpcbhead *head)
1054 struct inpcb *marker;
1057 struct tseg_qent *te;
1060 * Allows us to block while running the list
1062 marker = kmalloc(sizeof(struct inpcb), M_TEMP, M_WAITOK|M_ZERO);
1063 marker->inp_flags |= INP_PLACEMARKER;
1064 LIST_INSERT_HEAD(head, marker, inp_list);
1066 while ((inpb = LIST_NEXT(marker, inp_list)) != NULL) {
1067 if ((inpb->inp_flags & INP_PLACEMARKER) == 0 &&
1068 (tcpb = intotcpcb(inpb)) != NULL &&
1069 (te = TAILQ_FIRST(&tcpb->t_segq)) != NULL) {
1070 TAILQ_REMOVE(&tcpb->t_segq, te, tqe_q);
1071 if (te->tqe_th->th_flags & TH_FIN)
1072 tcpb->t_flags &= ~TF_QUEDFIN;
1075 atomic_add_int(&tcp_reass_qsize, -1);
1078 LIST_REMOVE(marker, inp_list);
1079 LIST_INSERT_AFTER(inpb, marker, inp_list);
1082 LIST_REMOVE(marker, inp_list);
1083 kfree(marker, M_TEMP);
1086 struct netmsg_tcp_drain {
1087 struct netmsg_base base;
1088 struct inpcbhead *nm_head;
1092 tcp_drain_handler(netmsg_t msg)
1094 struct netmsg_tcp_drain *nm = (void *)msg;
1096 tcp_drain_oncpu(nm->nm_head);
1097 lwkt_replymsg(&nm->base.lmsg, 0);
1109 * Walk the tcpbs, if existing, and flush the reassembly queue,
1110 * if there is one...
1111 * XXX: The "Net/3" implementation doesn't imply that the TCP
1112 * reassembly queue should be flushed, but in a situation
1113 * where we're really low on mbufs, this is potentially
1116 for (cpu = 0; cpu < ncpus2; cpu++) {
1117 struct netmsg_tcp_drain *nm;
1119 if (cpu == mycpu->gd_cpuid) {
1120 tcp_drain_oncpu(&tcbinfo[cpu].pcblisthead);
1122 nm = kmalloc(sizeof(struct netmsg_tcp_drain),
1123 M_LWKTMSG, M_NOWAIT);
1126 netmsg_init(&nm->base, NULL, &netisr_afree_rport,
1127 0, tcp_drain_handler);
1128 nm->nm_head = &tcbinfo[cpu].pcblisthead;
1129 lwkt_sendmsg(netisr_cpuport(cpu), &nm->base.lmsg);
1135 * Notify a tcp user of an asynchronous error;
1136 * store error as soft error, but wake up user
1137 * (for now, won't do anything until can select for soft error).
1139 * Do not wake up user since there currently is no mechanism for
1140 * reporting soft errors (yet - a kqueue filter may be added).
1143 tcp_notify(struct inpcb *inp, int error)
1145 struct tcpcb *tp = intotcpcb(inp);
1148 * Ignore some errors if we are hooked up.
1149 * If connection hasn't completed, has retransmitted several times,
1150 * and receives a second error, give up now. This is better
1151 * than waiting a long time to establish a connection that
1152 * can never complete.
1154 if (tp->t_state == TCPS_ESTABLISHED &&
1155 (error == EHOSTUNREACH || error == ENETUNREACH ||
1156 error == EHOSTDOWN)) {
1158 } else if (tp->t_state < TCPS_ESTABLISHED && tp->t_rxtshift > 3 &&
1160 tcp_drop(tp, error);
1162 tp->t_softerror = error;
1164 wakeup(&so->so_timeo);
1171 tcp_pcblist(SYSCTL_HANDLER_ARGS)
1174 struct inpcb *marker;
1183 * The process of preparing the TCB list is too time-consuming and
1184 * resource-intensive to repeat twice on every request.
1186 if (req->oldptr == NULL) {
1187 for (ccpu = 0; ccpu < ncpus2; ++ccpu) {
1188 gd = globaldata_find(ccpu);
1189 n += tcbinfo[gd->gd_cpuid].ipi_count;
1191 req->oldidx = (n + n/8 + 10) * sizeof(struct xtcpcb);
1195 if (req->newptr != NULL)
1198 marker = kmalloc(sizeof(struct inpcb), M_TEMP, M_WAITOK|M_ZERO);
1199 marker->inp_flags |= INP_PLACEMARKER;
1202 * OK, now we're committed to doing something. Run the inpcb list
1203 * for each cpu in the system and construct the output. Use a
1204 * list placemarker to deal with list changes occuring during
1205 * copyout blockages (but otherwise depend on being on the correct
1206 * cpu to avoid races).
1208 origcpu = mycpu->gd_cpuid;
1209 for (ccpu = 0; ccpu < ncpus2 && error == 0; ++ccpu) {
1213 lwkt_migratecpu(ccpu);
1215 n = tcbinfo[ccpu].ipi_count;
1217 LIST_INSERT_HEAD(&tcbinfo[ccpu].pcblisthead, marker, inp_list);
1219 while ((inp = LIST_NEXT(marker, inp_list)) != NULL && i < n) {
1221 * process a snapshot of pcbs, ignoring placemarkers
1222 * and using our own to allow SYSCTL_OUT to block.
1224 LIST_REMOVE(marker, inp_list);
1225 LIST_INSERT_AFTER(inp, marker, inp_list);
1227 if (inp->inp_flags & INP_PLACEMARKER)
1229 if (prison_xinpcb(req->td, inp))
1232 xt.xt_len = sizeof xt;
1233 bcopy(inp, &xt.xt_inp, sizeof *inp);
1234 inp_ppcb = inp->inp_ppcb;
1235 if (inp_ppcb != NULL)
1236 bcopy(inp_ppcb, &xt.xt_tp, sizeof xt.xt_tp);
1238 bzero(&xt.xt_tp, sizeof xt.xt_tp);
1239 if (inp->inp_socket)
1240 sotoxsocket(inp->inp_socket, &xt.xt_socket);
1241 if ((error = SYSCTL_OUT(req, &xt, sizeof xt)) != 0)
1245 LIST_REMOVE(marker, inp_list);
1246 if (error == 0 && i < n) {
1247 bzero(&xt, sizeof xt);
1248 xt.xt_len = sizeof xt;
1250 error = SYSCTL_OUT(req, &xt, sizeof xt);
1259 * Make sure we are on the same cpu we were on originally, since
1260 * higher level callers expect this. Also don't pollute caches with
1261 * migrated userland data by (eventually) returning to userland
1262 * on a different cpu.
1264 lwkt_migratecpu(origcpu);
1265 kfree(marker, M_TEMP);
1269 SYSCTL_PROC(_net_inet_tcp, TCPCTL_PCBLIST, pcblist, CTLFLAG_RD, 0, 0,
1270 tcp_pcblist, "S,xtcpcb", "List of active TCP connections");
1273 tcp_getcred(SYSCTL_HANDLER_ARGS)
1275 struct sockaddr_in addrs[2];
1280 error = priv_check(req->td, PRIV_ROOT);
1283 error = SYSCTL_IN(req, addrs, sizeof addrs);
1287 cpu = tcp_addrcpu(addrs[1].sin_addr.s_addr, addrs[1].sin_port,
1288 addrs[0].sin_addr.s_addr, addrs[0].sin_port);
1289 inp = in_pcblookup_hash(&tcbinfo[cpu], addrs[1].sin_addr,
1290 addrs[1].sin_port, addrs[0].sin_addr, addrs[0].sin_port, 0, NULL);
1291 if (inp == NULL || inp->inp_socket == NULL) {
1295 error = SYSCTL_OUT(req, inp->inp_socket->so_cred, sizeof(struct ucred));
1301 SYSCTL_PROC(_net_inet_tcp, OID_AUTO, getcred, (CTLTYPE_OPAQUE | CTLFLAG_RW),
1302 0, 0, tcp_getcred, "S,ucred", "Get the ucred of a TCP connection");
1306 tcp6_getcred(SYSCTL_HANDLER_ARGS)
1308 struct sockaddr_in6 addrs[2];
1311 boolean_t mapped = FALSE;
1313 error = priv_check(req->td, PRIV_ROOT);
1316 error = SYSCTL_IN(req, addrs, sizeof addrs);
1319 if (IN6_IS_ADDR_V4MAPPED(&addrs[0].sin6_addr)) {
1320 if (IN6_IS_ADDR_V4MAPPED(&addrs[1].sin6_addr))
1327 inp = in_pcblookup_hash(&tcbinfo[0],
1328 *(struct in_addr *)&addrs[1].sin6_addr.s6_addr[12],
1330 *(struct in_addr *)&addrs[0].sin6_addr.s6_addr[12],
1334 inp = in6_pcblookup_hash(&tcbinfo[0],
1335 &addrs[1].sin6_addr, addrs[1].sin6_port,
1336 &addrs[0].sin6_addr, addrs[0].sin6_port,
1339 if (inp == NULL || inp->inp_socket == NULL) {
1343 error = SYSCTL_OUT(req, inp->inp_socket->so_cred, sizeof(struct ucred));
1349 SYSCTL_PROC(_net_inet6_tcp6, OID_AUTO, getcred, (CTLTYPE_OPAQUE | CTLFLAG_RW),
1351 tcp6_getcred, "S,ucred", "Get the ucred of a TCP6 connection");
1354 struct netmsg_tcp_notify {
1355 struct netmsg_base base;
1356 void (*nm_notify)(struct inpcb *, int);
1357 struct in_addr nm_faddr;
1362 tcp_notifyall_oncpu(netmsg_t msg)
1364 struct netmsg_tcp_notify *nm = (struct netmsg_tcp_notify *)msg;
1367 in_pcbnotifyall(&tcbinfo[mycpuid].pcblisthead, nm->nm_faddr,
1368 nm->nm_arg, nm->nm_notify);
1370 nextcpu = mycpuid + 1;
1371 if (nextcpu < ncpus2)
1372 lwkt_forwardmsg(netisr_cpuport(nextcpu), &nm->base.lmsg);
1374 lwkt_replymsg(&nm->base.lmsg, 0);
1378 tcp_ctlinput(netmsg_t msg)
1380 int cmd = msg->ctlinput.nm_cmd;
1381 struct sockaddr *sa = msg->ctlinput.nm_arg;
1382 struct ip *ip = msg->ctlinput.nm_extra;
1384 struct in_addr faddr;
1387 void (*notify)(struct inpcb *, int) = tcp_notify;
1391 if ((unsigned)cmd >= PRC_NCMDS || inetctlerrmap[cmd] == 0) {
1395 faddr = ((struct sockaddr_in *)sa)->sin_addr;
1396 if (sa->sa_family != AF_INET || faddr.s_addr == INADDR_ANY)
1399 arg = inetctlerrmap[cmd];
1400 if (cmd == PRC_QUENCH) {
1401 notify = tcp_quench;
1402 } else if (icmp_may_rst &&
1403 (cmd == PRC_UNREACH_ADMIN_PROHIB ||
1404 cmd == PRC_UNREACH_PORT ||
1405 cmd == PRC_TIMXCEED_INTRANS) &&
1407 notify = tcp_drop_syn_sent;
1408 } else if (cmd == PRC_MSGSIZE) {
1409 struct icmp *icmp = (struct icmp *)
1410 ((caddr_t)ip - offsetof(struct icmp, icmp_ip));
1412 arg = ntohs(icmp->icmp_nextmtu);
1413 notify = tcp_mtudisc;
1414 } else if (PRC_IS_REDIRECT(cmd)) {
1416 notify = in_rtchange;
1417 } else if (cmd == PRC_HOSTDEAD) {
1423 th = (struct tcphdr *)((caddr_t)ip +
1424 (IP_VHL_HL(ip->ip_vhl) << 2));
1425 cpu = tcp_addrcpu(faddr.s_addr, th->th_dport,
1426 ip->ip_src.s_addr, th->th_sport);
1427 inp = in_pcblookup_hash(&tcbinfo[cpu], faddr, th->th_dport,
1428 ip->ip_src, th->th_sport, 0, NULL);
1429 if ((inp != NULL) && (inp->inp_socket != NULL)) {
1430 icmpseq = htonl(th->th_seq);
1431 tp = intotcpcb(inp);
1432 if (SEQ_GEQ(icmpseq, tp->snd_una) &&
1433 SEQ_LT(icmpseq, tp->snd_max))
1434 (*notify)(inp, arg);
1436 struct in_conninfo inc;
1438 inc.inc_fport = th->th_dport;
1439 inc.inc_lport = th->th_sport;
1440 inc.inc_faddr = faddr;
1441 inc.inc_laddr = ip->ip_src;
1445 syncache_unreach(&inc, th);
1449 struct netmsg_tcp_notify *nm;
1451 KKASSERT(&curthread->td_msgport == netisr_cpuport(0));
1452 nm = kmalloc(sizeof(*nm), M_LWKTMSG, M_INTWAIT);
1453 netmsg_init(&nm->base, NULL, &netisr_afree_rport,
1454 0, tcp_notifyall_oncpu);
1455 nm->nm_faddr = faddr;
1457 nm->nm_notify = notify;
1459 lwkt_sendmsg(netisr_cpuport(0), &nm->base.lmsg);
1462 lwkt_replymsg(&msg->lmsg, 0);
1468 tcp6_ctlinput(netmsg_t msg)
1470 int cmd = msg->ctlinput.nm_cmd;
1471 struct sockaddr *sa = msg->ctlinput.nm_arg;
1472 void *d = msg->ctlinput.nm_extra;
1474 void (*notify) (struct inpcb *, int) = tcp_notify;
1475 struct ip6_hdr *ip6;
1477 struct ip6ctlparam *ip6cp = NULL;
1478 const struct sockaddr_in6 *sa6_src = NULL;
1480 struct tcp_portonly {
1486 if (sa->sa_family != AF_INET6 ||
1487 sa->sa_len != sizeof(struct sockaddr_in6)) {
1492 if (cmd == PRC_QUENCH)
1493 notify = tcp_quench;
1494 else if (cmd == PRC_MSGSIZE) {
1495 struct ip6ctlparam *ip6cp = d;
1496 struct icmp6_hdr *icmp6 = ip6cp->ip6c_icmp6;
1498 arg = ntohl(icmp6->icmp6_mtu);
1499 notify = tcp_mtudisc;
1500 } else if (!PRC_IS_REDIRECT(cmd) &&
1501 ((unsigned)cmd > PRC_NCMDS || inet6ctlerrmap[cmd] == 0)) {
1505 /* if the parameter is from icmp6, decode it. */
1507 ip6cp = (struct ip6ctlparam *)d;
1509 ip6 = ip6cp->ip6c_ip6;
1510 off = ip6cp->ip6c_off;
1511 sa6_src = ip6cp->ip6c_src;
1515 off = 0; /* fool gcc */
1520 struct in_conninfo inc;
1522 * XXX: We assume that when IPV6 is non NULL,
1523 * M and OFF are valid.
1526 /* check if we can safely examine src and dst ports */
1527 if (m->m_pkthdr.len < off + sizeof *thp)
1530 bzero(&th, sizeof th);
1531 m_copydata(m, off, sizeof *thp, (caddr_t)&th);
1533 in6_pcbnotify(&tcbinfo[0].pcblisthead, sa, th.th_dport,
1534 (struct sockaddr *)ip6cp->ip6c_src,
1535 th.th_sport, cmd, arg, notify);
1537 inc.inc_fport = th.th_dport;
1538 inc.inc_lport = th.th_sport;
1539 inc.inc6_faddr = ((struct sockaddr_in6 *)sa)->sin6_addr;
1540 inc.inc6_laddr = ip6cp->ip6c_src->sin6_addr;
1542 syncache_unreach(&inc, &th);
1544 in6_pcbnotify(&tcbinfo[0].pcblisthead, sa, 0,
1545 (const struct sockaddr *)sa6_src, 0, cmd, arg, notify);
1548 lwkt_replymsg(&msg->ctlinput.base.lmsg, 0);
1554 * Following is where TCP initial sequence number generation occurs.
1556 * There are two places where we must use initial sequence numbers:
1557 * 1. In SYN-ACK packets.
1558 * 2. In SYN packets.
1560 * All ISNs for SYN-ACK packets are generated by the syncache. See
1561 * tcp_syncache.c for details.
1563 * The ISNs in SYN packets must be monotonic; TIME_WAIT recycling
1564 * depends on this property. In addition, these ISNs should be
1565 * unguessable so as to prevent connection hijacking. To satisfy
1566 * the requirements of this situation, the algorithm outlined in
1567 * RFC 1948 is used to generate sequence numbers.
1569 * Implementation details:
1571 * Time is based off the system timer, and is corrected so that it
1572 * increases by one megabyte per second. This allows for proper
1573 * recycling on high speed LANs while still leaving over an hour
1576 * net.inet.tcp.isn_reseed_interval controls the number of seconds
1577 * between seeding of isn_secret. This is normally set to zero,
1578 * as reseeding should not be necessary.
1582 #define ISN_BYTES_PER_SECOND 1048576
1584 u_char isn_secret[32];
1585 int isn_last_reseed;
1589 tcp_new_isn(struct tcpcb *tp)
1591 u_int32_t md5_buffer[4];
1594 /* Seed if this is the first use, reseed if requested. */
1595 if ((isn_last_reseed == 0) || ((tcp_isn_reseed_interval > 0) &&
1596 (((u_int)isn_last_reseed + (u_int)tcp_isn_reseed_interval*hz)
1598 read_random_unlimited(&isn_secret, sizeof isn_secret);
1599 isn_last_reseed = ticks;
1602 /* Compute the md5 hash and return the ISN. */
1604 MD5Update(&isn_ctx, (u_char *)&tp->t_inpcb->inp_fport, sizeof(u_short));
1605 MD5Update(&isn_ctx, (u_char *)&tp->t_inpcb->inp_lport, sizeof(u_short));
1607 if (tp->t_inpcb->inp_vflag & INP_IPV6) {
1608 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->in6p_faddr,
1609 sizeof(struct in6_addr));
1610 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->in6p_laddr,
1611 sizeof(struct in6_addr));
1615 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->inp_faddr,
1616 sizeof(struct in_addr));
1617 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->inp_laddr,
1618 sizeof(struct in_addr));
1620 MD5Update(&isn_ctx, (u_char *) &isn_secret, sizeof(isn_secret));
1621 MD5Final((u_char *) &md5_buffer, &isn_ctx);
1622 new_isn = (tcp_seq) md5_buffer[0];
1623 new_isn += ticks * (ISN_BYTES_PER_SECOND / hz);
1628 * When a source quench is received, close congestion window
1629 * to one segment. We will gradually open it again as we proceed.
1632 tcp_quench(struct inpcb *inp, int error)
1634 struct tcpcb *tp = intotcpcb(inp);
1637 tp->snd_cwnd = tp->t_maxseg;
1643 * When a specific ICMP unreachable message is received and the
1644 * connection state is SYN-SENT, drop the connection. This behavior
1645 * is controlled by the icmp_may_rst sysctl.
1648 tcp_drop_syn_sent(struct inpcb *inp, int error)
1650 struct tcpcb *tp = intotcpcb(inp);
1652 if ((tp != NULL) && (tp->t_state == TCPS_SYN_SENT))
1653 tcp_drop(tp, error);
1657 * When a `need fragmentation' ICMP is received, update our idea of the MSS
1658 * based on the new value in the route. Also nudge TCP to send something,
1659 * since we know the packet we just sent was dropped.
1660 * This duplicates some code in the tcp_mss() function in tcp_input.c.
1663 tcp_mtudisc(struct inpcb *inp, int mtu)
1665 struct tcpcb *tp = intotcpcb(inp);
1667 struct socket *so = inp->inp_socket;
1670 boolean_t isipv6 = ((tp->t_inpcb->inp_vflag & INP_IPV6) != 0);
1672 const boolean_t isipv6 = FALSE;
1679 * If no MTU is provided in the ICMP message, use the
1680 * next lower likely value, as specified in RFC 1191.
1685 oldmtu = tp->t_maxopd +
1687 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) :
1688 sizeof(struct tcpiphdr));
1689 mtu = ip_next_mtu(oldmtu, 0);
1693 rt = tcp_rtlookup6(&inp->inp_inc);
1695 rt = tcp_rtlookup(&inp->inp_inc);
1697 if (rt->rt_rmx.rmx_mtu != 0 && rt->rt_rmx.rmx_mtu < mtu)
1698 mtu = rt->rt_rmx.rmx_mtu;
1702 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) :
1703 sizeof(struct tcpiphdr));
1706 * XXX - The following conditional probably violates the TCP
1707 * spec. The problem is that, since we don't know the
1708 * other end's MSS, we are supposed to use a conservative
1709 * default. But, if we do that, then MTU discovery will
1710 * never actually take place, because the conservative
1711 * default is much less than the MTUs typically seen
1712 * on the Internet today. For the moment, we'll sweep
1713 * this under the carpet.
1715 * The conservative default might not actually be a problem
1716 * if the only case this occurs is when sending an initial
1717 * SYN with options and data to a host we've never talked
1718 * to before. Then, they will reply with an MSS value which
1719 * will get recorded and the new parameters should get
1720 * recomputed. For Further Study.
1722 if (rt->rt_rmx.rmx_mssopt && rt->rt_rmx.rmx_mssopt < maxopd)
1723 maxopd = rt->rt_rmx.rmx_mssopt;
1727 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) :
1728 sizeof(struct tcpiphdr));
1730 if (tp->t_maxopd <= maxopd)
1732 tp->t_maxopd = maxopd;
1735 if ((tp->t_flags & (TF_REQ_TSTMP | TF_RCVD_TSTMP | TF_NOOPT)) ==
1736 (TF_REQ_TSTMP | TF_RCVD_TSTMP))
1737 mss -= TCPOLEN_TSTAMP_APPA;
1739 /* round down to multiple of MCLBYTES */
1740 #if (MCLBYTES & (MCLBYTES - 1)) == 0 /* test if MCLBYTES power of 2 */
1742 mss &= ~(MCLBYTES - 1);
1745 mss = (mss / MCLBYTES) * MCLBYTES;
1748 if (so->so_snd.ssb_hiwat < mss)
1749 mss = so->so_snd.ssb_hiwat;
1753 tp->snd_nxt = tp->snd_una;
1755 tcpstat.tcps_mturesent++;
1759 * Look-up the routing entry to the peer of this inpcb. If no route
1760 * is found and it cannot be allocated the return NULL. This routine
1761 * is called by TCP routines that access the rmx structure and by tcp_mss
1762 * to get the interface MTU.
1765 tcp_rtlookup(struct in_conninfo *inc)
1767 struct route *ro = &inc->inc_route;
1769 if (ro->ro_rt == NULL || !(ro->ro_rt->rt_flags & RTF_UP)) {
1770 /* No route yet, so try to acquire one */
1771 if (inc->inc_faddr.s_addr != INADDR_ANY) {
1773 * unused portions of the structure MUST be zero'd
1774 * out because rtalloc() treats it as opaque data
1776 bzero(&ro->ro_dst, sizeof(struct sockaddr_in));
1777 ro->ro_dst.sa_family = AF_INET;
1778 ro->ro_dst.sa_len = sizeof(struct sockaddr_in);
1779 ((struct sockaddr_in *) &ro->ro_dst)->sin_addr =
1789 tcp_rtlookup6(struct in_conninfo *inc)
1791 struct route_in6 *ro6 = &inc->inc6_route;
1793 if (ro6->ro_rt == NULL || !(ro6->ro_rt->rt_flags & RTF_UP)) {
1794 /* No route yet, so try to acquire one */
1795 if (!IN6_IS_ADDR_UNSPECIFIED(&inc->inc6_faddr)) {
1797 * unused portions of the structure MUST be zero'd
1798 * out because rtalloc() treats it as opaque data
1800 bzero(&ro6->ro_dst, sizeof(struct sockaddr_in6));
1801 ro6->ro_dst.sin6_family = AF_INET6;
1802 ro6->ro_dst.sin6_len = sizeof(struct sockaddr_in6);
1803 ro6->ro_dst.sin6_addr = inc->inc6_faddr;
1804 rtalloc((struct route *)ro6);
1807 return (ro6->ro_rt);
1812 /* compute ESP/AH header size for TCP, including outer IP header. */
1814 ipsec_hdrsiz_tcp(struct tcpcb *tp)
1822 if ((tp == NULL) || ((inp = tp->t_inpcb) == NULL))
1824 MGETHDR(m, MB_DONTWAIT, MT_DATA);
1829 if (inp->inp_vflag & INP_IPV6) {
1830 struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
1832 th = (struct tcphdr *)(ip6 + 1);
1833 m->m_pkthdr.len = m->m_len =
1834 sizeof(struct ip6_hdr) + sizeof(struct tcphdr);
1835 tcp_fillheaders(tp, ip6, th, FALSE);
1836 hdrsiz = ipsec6_hdrsiz(m, IPSEC_DIR_OUTBOUND, inp);
1840 ip = mtod(m, struct ip *);
1841 th = (struct tcphdr *)(ip + 1);
1842 m->m_pkthdr.len = m->m_len = sizeof(struct tcpiphdr);
1843 tcp_fillheaders(tp, ip, th, FALSE);
1844 hdrsiz = ipsec4_hdrsiz(m, IPSEC_DIR_OUTBOUND, inp);
1853 * TCP BANDWIDTH DELAY PRODUCT WINDOW LIMITING
1855 * This code attempts to calculate the bandwidth-delay product as a
1856 * means of determining the optimal window size to maximize bandwidth,
1857 * minimize RTT, and avoid the over-allocation of buffers on interfaces and
1858 * routers. This code also does a fairly good job keeping RTTs in check
1859 * across slow links like modems. We implement an algorithm which is very
1860 * similar (but not meant to be) TCP/Vegas. The code operates on the
1861 * transmitter side of a TCP connection and so only effects the transmit
1862 * side of the connection.
1864 * BACKGROUND: TCP makes no provision for the management of buffer space
1865 * at the end points or at the intermediate routers and switches. A TCP
1866 * stream, whether using NewReno or not, will eventually buffer as
1867 * many packets as it is able and the only reason this typically works is
1868 * due to the fairly small default buffers made available for a connection
1869 * (typicaly 16K or 32K). As machines use larger windows and/or window
1870 * scaling it is now fairly easy for even a single TCP connection to blow-out
1871 * all available buffer space not only on the local interface, but on
1872 * intermediate routers and switches as well. NewReno makes a misguided
1873 * attempt to 'solve' this problem by waiting for an actual failure to occur,
1874 * then backing off, then steadily increasing the window again until another
1875 * failure occurs, ad-infinitum. This results in terrible oscillation that
1876 * is only made worse as network loads increase and the idea of intentionally
1877 * blowing out network buffers is, frankly, a terrible way to manage network
1880 * It is far better to limit the transmit window prior to the failure
1881 * condition being achieved. There are two general ways to do this: First
1882 * you can 'scan' through different transmit window sizes and locate the
1883 * point where the RTT stops increasing, indicating that you have filled the
1884 * pipe, then scan backwards until you note that RTT stops decreasing, then
1885 * repeat ad-infinitum. This method works in principle but has severe
1886 * implementation issues due to RTT variances, timer granularity, and
1887 * instability in the algorithm which can lead to many false positives and
1888 * create oscillations as well as interact badly with other TCP streams
1889 * implementing the same algorithm.
1891 * The second method is to limit the window to the bandwidth delay product
1892 * of the link. This is the method we implement. RTT variances and our
1893 * own manipulation of the congestion window, bwnd, can potentially
1894 * destabilize the algorithm. For this reason we have to stabilize the
1895 * elements used to calculate the window. We do this by using the minimum
1896 * observed RTT, the long term average of the observed bandwidth, and
1897 * by adding two segments worth of slop. It isn't perfect but it is able
1898 * to react to changing conditions and gives us a very stable basis on
1899 * which to extend the algorithm.
1902 tcp_xmit_bandwidth_limit(struct tcpcb *tp, tcp_seq ack_seq)
1911 * If inflight_enable is disabled in the middle of a tcp connection,
1912 * make sure snd_bwnd is effectively disabled.
1914 if (!tcp_inflight_enable) {
1915 tp->snd_bwnd = TCP_MAXWIN << TCP_MAX_WINSHIFT;
1916 tp->snd_bandwidth = 0;
1921 * Validate the delta time. If a connection is new or has been idle
1922 * a long time we have to reset the bandwidth calculator.
1926 delta_ticks = save_ticks - tp->t_bw_rtttime;
1927 if (tp->t_bw_rtttime == 0 || delta_ticks < 0 || delta_ticks > hz * 10) {
1928 tp->t_bw_rtttime = save_ticks;
1929 tp->t_bw_rtseq = ack_seq;
1930 if (tp->snd_bandwidth == 0)
1931 tp->snd_bandwidth = tcp_inflight_min;
1936 * A delta of at least 1 tick is required. Waiting 2 ticks will
1937 * result in better (bw) accuracy. More than that and the ramp-up
1940 if (delta_ticks == 0 || delta_ticks == 1)
1944 * Sanity check, plus ignore pure window update acks.
1946 if ((int)(ack_seq - tp->t_bw_rtseq) <= 0)
1950 * Figure out the bandwidth. Due to the tick granularity this
1951 * is a very rough number and it MUST be averaged over a fairly
1952 * long period of time. XXX we need to take into account a link
1953 * that is not using all available bandwidth, but for now our
1954 * slop will ramp us up if this case occurs and the bandwidth later
1957 ibw = (int64_t)(ack_seq - tp->t_bw_rtseq) * hz / delta_ticks;
1958 tp->t_bw_rtttime = save_ticks;
1959 tp->t_bw_rtseq = ack_seq;
1960 bw = ((int64_t)tp->snd_bandwidth * 15 + ibw) >> 4;
1962 tp->snd_bandwidth = bw;
1965 * Calculate the semi-static bandwidth delay product, plus two maximal
1966 * segments. The additional slop puts us squarely in the sweet
1967 * spot and also handles the bandwidth run-up case. Without the
1968 * slop we could be locking ourselves into a lower bandwidth.
1970 * At very high speeds the bw calculation can become overly sensitive
1971 * and error prone when delta_ticks is low (e.g. usually 1). To deal
1972 * with the problem the stab must be scaled to the bw. A stab of 50
1973 * (the default) increases the bw for the purposes of the bwnd
1974 * calculation by 5%.
1976 * Situations Handled:
1977 * (1) Prevents over-queueing of packets on LANs, especially on
1978 * high speed LANs, allowing larger TCP buffers to be
1979 * specified, and also does a good job preventing
1980 * over-queueing of packets over choke points like modems
1981 * (at least for the transmit side).
1983 * (2) Is able to handle changing network loads (bandwidth
1984 * drops so bwnd drops, bandwidth increases so bwnd
1987 * (3) Theoretically should stabilize in the face of multiple
1988 * connections implementing the same algorithm (this may need
1991 * (4) Stability value (defaults to 20 = 2 maximal packets) can
1992 * be adjusted with a sysctl but typically only needs to be on
1993 * very slow connections. A value no smaller then 5 should
1994 * be used, but only reduce this default if you have no other
1998 #define USERTT ((tp->t_srtt + tp->t_rttvar) + tcp_inflight_adjrtt)
1999 bw += bw * tcp_inflight_stab / 1000;
2000 bwnd = (int64_t)bw * USERTT / (hz << TCP_RTT_SHIFT) +
2001 (int)tp->t_maxseg * 2;
2004 if (tcp_inflight_debug > 0) {
2006 if ((u_int)(save_ticks - ltime) >= hz / tcp_inflight_debug) {
2008 kprintf("%p ibw %ld bw %ld rttvar %d srtt %d "
2009 "bwnd %ld delta %d snd_win %ld\n",
2010 tp, ibw, bw, tp->t_rttvar, tp->t_srtt,
2011 bwnd, delta_ticks, tp->snd_wnd);
2014 if ((long)bwnd < tcp_inflight_min)
2015 bwnd = tcp_inflight_min;
2016 if (bwnd > tcp_inflight_max)
2017 bwnd = tcp_inflight_max;
2018 if ((long)bwnd < tp->t_maxseg * 2)
2019 bwnd = tp->t_maxseg * 2;
2020 tp->snd_bwnd = bwnd;
2024 tcp_rmx_iwsegs(struct tcpcb *tp, u_long *maxsegs, u_long *capsegs)
2027 struct inpcb *inp = tp->t_inpcb;
2029 boolean_t isipv6 = ((inp->inp_vflag & INP_IPV6) ? TRUE : FALSE);
2031 const boolean_t isipv6 = FALSE;
2035 if (tcp_iw_maxsegs < TCP_IW_MAXSEGS_DFLT)
2036 tcp_iw_maxsegs = TCP_IW_MAXSEGS_DFLT;
2037 if (tcp_iw_capsegs < TCP_IW_CAPSEGS_DFLT)
2038 tcp_iw_capsegs = TCP_IW_CAPSEGS_DFLT;
2041 rt = tcp_rtlookup6(&inp->inp_inc);
2043 rt = tcp_rtlookup(&inp->inp_inc);
2045 rt->rt_rmx.rmx_iwmaxsegs < TCP_IW_MAXSEGS_DFLT ||
2046 rt->rt_rmx.rmx_iwcapsegs < TCP_IW_CAPSEGS_DFLT) {
2047 *maxsegs = tcp_iw_maxsegs;
2048 *capsegs = tcp_iw_capsegs;
2051 *maxsegs = rt->rt_rmx.rmx_iwmaxsegs;
2052 *capsegs = rt->rt_rmx.rmx_iwcapsegs;
2056 tcp_initial_window(struct tcpcb *tp)
2058 if (tcp_do_rfc3390) {
2061 * "If the SYN or SYN/ACK is lost, the initial window
2062 * used by a sender after a correctly transmitted SYN
2063 * MUST be one segment consisting of MSS bytes."
2065 * However, we do something a little bit more aggressive
2066 * then RFC3390 here:
2067 * - Only if time spent in the SYN or SYN|ACK retransmition
2068 * >= 3 seconds, the IW is reduced. We do this mainly
2069 * because when RFC3390 is published, the initial RTO is
2070 * still 3 seconds (the threshold we test here), while
2071 * after RFC6298, the initial RTO is 1 second. This
2072 * behaviour probably still falls within the spirit of
2074 * - When IW is reduced, 2*MSS is used instead of 1*MSS.
2075 * Mainly to avoid sender and receiver deadlock until
2076 * delayed ACK timer expires. And even RFC2581 does not
2077 * try to reduce IW upon SYN or SYN|ACK retransmition
2081 * http://tools.ietf.org/html/draft-ietf-tcpm-initcwnd-03
2083 if (tp->t_rxtsyn >= TCPTV_RTOBASE3) {
2084 return (2 * tp->t_maxseg);
2086 u_long maxsegs, capsegs;
2088 tcp_rmx_iwsegs(tp, &maxsegs, &capsegs);
2089 return min(maxsegs * tp->t_maxseg,
2090 max(2 * tp->t_maxseg, capsegs * 1460));
2094 * Even RFC2581 (back to 1999) allows 2*SMSS IW.
2096 * Mainly to avoid sender and receiver deadlock
2097 * until delayed ACK timer expires.
2099 return (2 * tp->t_maxseg);
2103 #ifdef TCP_SIGNATURE
2105 * Compute TCP-MD5 hash of a TCP segment. (RFC2385)
2107 * We do this over ip, tcphdr, segment data, and the key in the SADB.
2108 * When called from tcp_input(), we can be sure that th_sum has been
2109 * zeroed out and verified already.
2111 * Return 0 if successful, otherwise return -1.
2113 * XXX The key is retrieved from the system's PF_KEY SADB, by keying a
2114 * search with the destination IP address, and a 'magic SPI' to be
2115 * determined by the application. This is hardcoded elsewhere to 1179
2116 * right now. Another branch of this code exists which uses the SPD to
2117 * specify per-application flows but it is unstable.
2120 tcpsignature_compute(
2121 struct mbuf *m, /* mbuf chain */
2122 int len, /* length of TCP data */
2123 int optlen, /* length of TCP options */
2124 u_char *buf, /* storage for MD5 digest */
2125 u_int direction) /* direction of flow */
2127 struct ippseudo ippseudo;
2131 struct ipovly *ipovly;
2132 struct secasvar *sav;
2135 struct ip6_hdr *ip6;
2136 struct in6_addr in6;
2142 KASSERT(m != NULL, ("passed NULL mbuf. Game over."));
2143 KASSERT(buf != NULL, ("passed NULL storage pointer for MD5 signature"));
2145 * Extract the destination from the IP header in the mbuf.
2147 ip = mtod(m, struct ip *);
2149 ip6 = NULL; /* Make the compiler happy. */
2152 * Look up an SADB entry which matches the address found in
2155 switch (IP_VHL_V(ip->ip_vhl)) {
2157 sav = key_allocsa(AF_INET, (caddr_t)&ip->ip_src, (caddr_t)&ip->ip_dst,
2158 IPPROTO_TCP, htonl(TCP_SIG_SPI));
2161 case (IPV6_VERSION >> 4):
2162 ip6 = mtod(m, struct ip6_hdr *);
2163 sav = key_allocsa(AF_INET6, (caddr_t)&ip6->ip6_src, (caddr_t)&ip6->ip6_dst,
2164 IPPROTO_TCP, htonl(TCP_SIG_SPI));
2173 kprintf("%s: SADB lookup failed\n", __func__);
2179 * Step 1: Update MD5 hash with IP pseudo-header.
2181 * XXX The ippseudo header MUST be digested in network byte order,
2182 * or else we'll fail the regression test. Assume all fields we've
2183 * been doing arithmetic on have been in host byte order.
2184 * XXX One cannot depend on ipovly->ih_len here. When called from
2185 * tcp_output(), the underlying ip_len member has not yet been set.
2187 switch (IP_VHL_V(ip->ip_vhl)) {
2189 ipovly = (struct ipovly *)ip;
2190 ippseudo.ippseudo_src = ipovly->ih_src;
2191 ippseudo.ippseudo_dst = ipovly->ih_dst;
2192 ippseudo.ippseudo_pad = 0;
2193 ippseudo.ippseudo_p = IPPROTO_TCP;
2194 ippseudo.ippseudo_len = htons(len + sizeof(struct tcphdr) + optlen);
2195 MD5Update(&ctx, (char *)&ippseudo, sizeof(struct ippseudo));
2196 th = (struct tcphdr *)((u_char *)ip + sizeof(struct ip));
2197 doff = sizeof(struct ip) + sizeof(struct tcphdr) + optlen;
2201 * RFC 2385, 2.0 Proposal
2202 * For IPv6, the pseudo-header is as described in RFC 2460, namely the
2203 * 128-bit source IPv6 address, 128-bit destination IPv6 address, zero-
2204 * extended next header value (to form 32 bits), and 32-bit segment
2206 * Note: Upper-Layer Packet Length comes before Next Header.
2208 case (IPV6_VERSION >> 4):
2210 in6_clearscope(&in6);
2211 MD5Update(&ctx, (char *)&in6, sizeof(struct in6_addr));
2213 in6_clearscope(&in6);
2214 MD5Update(&ctx, (char *)&in6, sizeof(struct in6_addr));
2215 plen = htonl(len + sizeof(struct tcphdr) + optlen);
2216 MD5Update(&ctx, (char *)&plen, sizeof(uint32_t));
2218 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t));
2219 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t));
2220 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t));
2222 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t));
2223 th = (struct tcphdr *)((u_char *)ip6 + sizeof(struct ip6_hdr));
2224 doff = sizeof(struct ip6_hdr) + sizeof(struct tcphdr) + optlen;
2233 * Step 2: Update MD5 hash with TCP header, excluding options.
2234 * The TCP checksum must be set to zero.
2236 savecsum = th->th_sum;
2238 MD5Update(&ctx, (char *)th, sizeof(struct tcphdr));
2239 th->th_sum = savecsum;
2241 * Step 3: Update MD5 hash with TCP segment data.
2242 * Use m_apply() to avoid an early m_pullup().
2245 m_apply(m, doff, len, tcpsignature_apply, &ctx);
2247 * Step 4: Update MD5 hash with shared secret.
2249 MD5Update(&ctx, _KEYBUF(sav->key_auth), _KEYLEN(sav->key_auth));
2250 MD5Final(buf, &ctx);
2251 key_sa_recordxfer(sav, m);
2257 tcpsignature_apply(void *fstate, void *data, unsigned int len)
2260 MD5Update((MD5_CTX *)fstate, (unsigned char *)data, len);
2263 #endif /* TCP_SIGNATURE */