1 /* 2 * Copyright (c) 2003, 2004 Jeffrey M. Hsu. All rights reserved. 3 * Copyright (c) 2003, 2004 The DragonFly Project. All rights reserved. 4 * 5 * This code is derived from software contributed to The DragonFly Project 6 * by Jeffrey M. Hsu. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 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. 19 * 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 31 * SUCH DAMAGE. 32 */ 33 34 /* 35 * Copyright (c) 1982, 1986, 1988, 1990, 1993, 1995 36 * The Regents of the University of California. All rights reserved. 37 * 38 * Redistribution and use in source and binary forms, with or without 39 * modification, are permitted provided that the following conditions 40 * are met: 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. 49 * 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 60 * SUCH DAMAGE. 61 * 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 $ 64 */ 65 66 #include "opt_compat.h" 67 #include "opt_inet.h" 68 #include "opt_inet6.h" 69 #include "opt_ipsec.h" 70 #include "opt_tcpdebug.h" 71 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> 79 #include <sys/mbuf.h> 80 #ifdef INET6 81 #include <sys/domain.h> 82 #endif 83 #include <sys/proc.h> 84 #include <sys/priv.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> 91 #include <sys/ktr.h> 92 93 #include <net/route.h> 94 #include <net/if.h> 95 #include <net/netisr2.h> 96 97 #define _IP_VHL 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> 108 #ifdef INET6 109 #include <netinet/icmp6.h> 110 #endif 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> 119 #ifdef TCPDEBUG 120 #include <netinet/tcp_debug.h> 121 #endif 122 #include <netinet6/ip6protosw.h> 123 124 #ifdef IPSEC 125 #include <netinet6/ipsec.h> 126 #include <netproto/key/key.h> 127 #ifdef INET6 128 #include <netinet6/ipsec6.h> 129 #endif 130 #endif 131 132 #ifdef FAST_IPSEC 133 #include <netproto/ipsec/ipsec.h> 134 #ifdef INET6 135 #include <netproto/ipsec/ipsec6.h> 136 #endif 137 #define IPSEC 138 #endif 139 140 #include <sys/md5.h> 141 #include <machine/smp.h> 142 143 #include <sys/msgport2.h> 144 #include <sys/mplock2.h> 145 #include <net/netmsg2.h> 146 147 #if !defined(KTR_TCP) 148 #define KTR_TCP KTR_ALL 149 #endif 150 /* 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) 156 */ 157 158 #define TCP_IW_MAXSEGS_DFLT 4 159 #define TCP_IW_CAPSEGS_DFLT 3 160 161 struct inpcbinfo tcbinfo[MAXCPU]; 162 struct tcpcbackqhead tcpcbackq[MAXCPU]; 163 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"); 167 168 #ifdef INET6 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"); 172 #endif 173 174 /* 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. 181 */ 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"); 185 186 #if 0 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"); 190 #endif 191 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"); 195 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"); 199 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"); 203 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"); 207 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"); 211 212 /* 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). 216 * 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. 222 * 223 * People using the limiter to reduce bottlenecks on slower WAN connections 224 * should set the slop to 20 (2 packets). 225 */ 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"); 229 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"); 233 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"); 237 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"); 241 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%)"); 245 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)"); 249 250 static int tcp_do_rfc3390 = 1; 251 SYSCTL_INT(_net_inet_tcp, OID_AUTO, rfc3390, CTLFLAG_RW, 252 &tcp_do_rfc3390, 0, 253 "Enable RFC 3390 (Increasing TCP's Initial Congestion Window)"); 254 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"); 258 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"); 262 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)"); 266 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)"); 270 271 int tcp_ncr_rxtthresh_max = 16; 272 SYSCTL_INT(_net_inet_tcp, OID_AUTO, ncr_rxtthresh_max, CTLFLAG_RW, 273 &tcp_ncr_rxtthresh_max, 0, 274 "Non-Congestion Robustness (RFC 4653), DupThresh upper limit"); 275 276 static MALLOC_DEFINE(M_TCPTEMP, "tcptemp", "TCP Templates for Keepalives"); 277 static struct malloc_pipe tcptemp_mpipe; 278 279 static void tcp_willblock(void); 280 static void tcp_notify (struct inpcb *, int); 281 282 struct tcp_stats tcpstats_percpu[MAXCPU] __cachealign; 283 284 static struct netmsg_base tcp_drain_netmsg[MAXCPU]; 285 static void tcp_drain_dispatch(netmsg_t nmsg); 286 287 static int 288 sysctl_tcpstats(SYSCTL_HANDLER_ARGS) 289 { 290 int cpu, error = 0; 291 292 for (cpu = 0; cpu < ncpus2; ++cpu) { 293 if ((error = SYSCTL_OUT(req, &tcpstats_percpu[cpu], 294 sizeof(struct tcp_stats)))) 295 break; 296 if ((error = SYSCTL_IN(req, &tcpstats_percpu[cpu], 297 sizeof(struct tcp_stats)))) 298 break; 299 } 300 301 return (error); 302 } 303 SYSCTL_PROC(_net_inet_tcp, TCPCTL_STATS, stats, (CTLTYPE_OPAQUE | CTLFLAG_RW), 304 0, 0, sysctl_tcpstats, "S,tcp_stats", "TCP statistics"); 305 306 /* 307 * Target size of TCP PCB hash tables. Must be a power of two. 308 * 309 * Note that this can be overridden by the kernel environment 310 * variable net.inet.tcp.tcbhashsize 311 */ 312 #ifndef TCBHASHSIZE 313 #define TCBHASHSIZE 512 314 #endif 315 316 /* 317 * This is the actual shape of what we allocate using the zone 318 * allocator. Doing it this way allows us to protect both structures 319 * using the same generation count, and also eliminates the overhead 320 * of allocating tcpcbs separately. By hiding the structure here, 321 * we avoid changing most of the rest of the code (although it needs 322 * to be changed, eventually, for greater efficiency). 323 */ 324 #define ALIGNMENT 32 325 #define ALIGNM1 (ALIGNMENT - 1) 326 struct inp_tp { 327 union { 328 struct inpcb inp; 329 char align[(sizeof(struct inpcb) + ALIGNM1) & ~ALIGNM1]; 330 } inp_tp_u; 331 struct tcpcb tcb; 332 struct tcp_callout inp_tp_rexmt; 333 struct tcp_callout inp_tp_persist; 334 struct tcp_callout inp_tp_keep; 335 struct tcp_callout inp_tp_2msl; 336 struct tcp_callout inp_tp_delack; 337 struct netmsg_tcp_timer inp_tp_timermsg; 338 struct netmsg_base inp_tp_sndmore; 339 }; 340 #undef ALIGNMENT 341 #undef ALIGNM1 342 343 /* 344 * Tcp initialization 345 */ 346 void 347 tcp_init(void) 348 { 349 struct inpcbportinfo *portinfo; 350 struct inpcbinfo *ticb; 351 int hashsize = TCBHASHSIZE; 352 int cpu; 353 354 /* 355 * note: tcptemp is used for keepalives, and it is ok for an 356 * allocation to fail so do not specify MPF_INT. 357 */ 358 mpipe_init(&tcptemp_mpipe, M_TCPTEMP, sizeof(struct tcptemp), 359 25, -1, 0, NULL, NULL, NULL); 360 361 tcp_delacktime = TCPTV_DELACK; 362 tcp_keepinit = TCPTV_KEEP_INIT; 363 tcp_keepidle = TCPTV_KEEP_IDLE; 364 tcp_keepintvl = TCPTV_KEEPINTVL; 365 tcp_maxpersistidle = TCPTV_KEEP_IDLE; 366 tcp_msl = TCPTV_MSL; 367 tcp_rexmit_min = TCPTV_MIN; 368 tcp_rexmit_slop = TCPTV_CPU_VAR; 369 370 TUNABLE_INT_FETCH("net.inet.tcp.tcbhashsize", &hashsize); 371 if (!powerof2(hashsize)) { 372 kprintf("WARNING: TCB hash size not a power of 2\n"); 373 hashsize = 512; /* safe default */ 374 } 375 tcp_tcbhashsize = hashsize; 376 377 portinfo = kmalloc_cachealign(sizeof(*portinfo) * ncpus2, M_PCB, 378 M_WAITOK); 379 380 for (cpu = 0; cpu < ncpus2; cpu++) { 381 ticb = &tcbinfo[cpu]; 382 in_pcbinfo_init(ticb, cpu, FALSE); 383 ticb->hashbase = hashinit(hashsize, M_PCB, 384 &ticb->hashmask); 385 in_pcbportinfo_init(&portinfo[cpu], hashsize, TRUE, cpu); 386 ticb->portinfo = portinfo; 387 ticb->portinfo_mask = ncpus2_mask; 388 ticb->wildcardhashbase = hashinit(hashsize, M_PCB, 389 &ticb->wildcardhashmask); 390 ticb->localgrphashbase = hashinit(hashsize, M_PCB, 391 &ticb->localgrphashmask); 392 ticb->ipi_size = sizeof(struct inp_tp); 393 TAILQ_INIT(&tcpcbackq[cpu]); 394 } 395 396 tcp_reass_maxseg = nmbclusters / 16; 397 TUNABLE_INT_FETCH("net.inet.tcp.reass.maxsegments", &tcp_reass_maxseg); 398 399 #ifdef INET6 400 #define TCP_MINPROTOHDR (sizeof(struct ip6_hdr) + sizeof(struct tcphdr)) 401 #else 402 #define TCP_MINPROTOHDR (sizeof(struct tcpiphdr)) 403 #endif 404 if (max_protohdr < TCP_MINPROTOHDR) 405 max_protohdr = TCP_MINPROTOHDR; 406 if (max_linkhdr + TCP_MINPROTOHDR > MHLEN) 407 panic("tcp_init"); 408 #undef TCP_MINPROTOHDR 409 410 /* 411 * Initialize TCP statistics counters for each CPU. 412 */ 413 for (cpu = 0; cpu < ncpus2; ++cpu) 414 bzero(&tcpstats_percpu[cpu], sizeof(struct tcp_stats)); 415 416 /* 417 * Initialize netmsgs for TCP drain 418 */ 419 for (cpu = 0; cpu < ncpus2; ++cpu) { 420 netmsg_init(&tcp_drain_netmsg[cpu], NULL, &netisr_adone_rport, 421 MSGF_PRIORITY, tcp_drain_dispatch); 422 } 423 424 syncache_init(); 425 netisr_register_rollup(tcp_willblock, NETISR_ROLLUP_PRIO_TCP); 426 } 427 428 static void 429 tcp_willblock(void) 430 { 431 struct tcpcb *tp; 432 int cpu = mycpu->gd_cpuid; 433 434 while ((tp = TAILQ_FIRST(&tcpcbackq[cpu])) != NULL) { 435 KKASSERT(tp->t_flags & TF_ONOUTPUTQ); 436 tp->t_flags &= ~TF_ONOUTPUTQ; 437 TAILQ_REMOVE(&tcpcbackq[cpu], tp, t_outputq); 438 tcp_output(tp); 439 } 440 } 441 442 /* 443 * Fill in the IP and TCP headers for an outgoing packet, given the tcpcb. 444 * tcp_template used to store this data in mbufs, but we now recopy it out 445 * of the tcpcb each time to conserve mbufs. 446 */ 447 void 448 tcp_fillheaders(struct tcpcb *tp, void *ip_ptr, void *tcp_ptr, boolean_t tso) 449 { 450 struct inpcb *inp = tp->t_inpcb; 451 struct tcphdr *tcp_hdr = (struct tcphdr *)tcp_ptr; 452 453 #ifdef INET6 454 if (inp->inp_vflag & INP_IPV6) { 455 struct ip6_hdr *ip6; 456 457 ip6 = (struct ip6_hdr *)ip_ptr; 458 ip6->ip6_flow = (ip6->ip6_flow & ~IPV6_FLOWINFO_MASK) | 459 (inp->in6p_flowinfo & IPV6_FLOWINFO_MASK); 460 ip6->ip6_vfc = (ip6->ip6_vfc & ~IPV6_VERSION_MASK) | 461 (IPV6_VERSION & IPV6_VERSION_MASK); 462 ip6->ip6_nxt = IPPROTO_TCP; 463 ip6->ip6_plen = sizeof(struct tcphdr); 464 ip6->ip6_src = inp->in6p_laddr; 465 ip6->ip6_dst = inp->in6p_faddr; 466 tcp_hdr->th_sum = 0; 467 } else 468 #endif 469 { 470 struct ip *ip = (struct ip *) ip_ptr; 471 u_int plen; 472 473 ip->ip_vhl = IP_VHL_BORING; 474 ip->ip_tos = 0; 475 ip->ip_len = 0; 476 ip->ip_id = 0; 477 ip->ip_off = 0; 478 ip->ip_ttl = 0; 479 ip->ip_sum = 0; 480 ip->ip_p = IPPROTO_TCP; 481 ip->ip_src = inp->inp_laddr; 482 ip->ip_dst = inp->inp_faddr; 483 484 if (tso) 485 plen = htons(IPPROTO_TCP); 486 else 487 plen = htons(sizeof(struct tcphdr) + IPPROTO_TCP); 488 tcp_hdr->th_sum = in_pseudo(ip->ip_src.s_addr, 489 ip->ip_dst.s_addr, plen); 490 } 491 492 tcp_hdr->th_sport = inp->inp_lport; 493 tcp_hdr->th_dport = inp->inp_fport; 494 tcp_hdr->th_seq = 0; 495 tcp_hdr->th_ack = 0; 496 tcp_hdr->th_x2 = 0; 497 tcp_hdr->th_off = 5; 498 tcp_hdr->th_flags = 0; 499 tcp_hdr->th_win = 0; 500 tcp_hdr->th_urp = 0; 501 } 502 503 /* 504 * Create template to be used to send tcp packets on a connection. 505 * Allocates an mbuf and fills in a skeletal tcp/ip header. The only 506 * use for this function is in keepalives, which use tcp_respond. 507 */ 508 struct tcptemp * 509 tcp_maketemplate(struct tcpcb *tp) 510 { 511 struct tcptemp *tmp; 512 513 if ((tmp = mpipe_alloc_nowait(&tcptemp_mpipe)) == NULL) 514 return (NULL); 515 tcp_fillheaders(tp, &tmp->tt_ipgen, &tmp->tt_t, FALSE); 516 return (tmp); 517 } 518 519 void 520 tcp_freetemplate(struct tcptemp *tmp) 521 { 522 mpipe_free(&tcptemp_mpipe, tmp); 523 } 524 525 /* 526 * Send a single message to the TCP at address specified by 527 * the given TCP/IP header. If m == NULL, then we make a copy 528 * of the tcpiphdr at ti and send directly to the addressed host. 529 * This is used to force keep alive messages out using the TCP 530 * template for a connection. If flags are given then we send 531 * a message back to the TCP which originated the * segment ti, 532 * and discard the mbuf containing it and any other attached mbufs. 533 * 534 * In any case the ack and sequence number of the transmitted 535 * segment are as specified by the parameters. 536 * 537 * NOTE: If m != NULL, then ti must point to *inside* the mbuf. 538 */ 539 void 540 tcp_respond(struct tcpcb *tp, void *ipgen, struct tcphdr *th, struct mbuf *m, 541 tcp_seq ack, tcp_seq seq, int flags) 542 { 543 int tlen; 544 long win = 0; 545 struct route *ro = NULL; 546 struct route sro; 547 struct ip *ip = ipgen; 548 struct tcphdr *nth; 549 int ipflags = 0; 550 struct route_in6 *ro6 = NULL; 551 struct route_in6 sro6; 552 struct ip6_hdr *ip6 = ipgen; 553 boolean_t use_tmpro = TRUE; 554 #ifdef INET6 555 boolean_t isipv6 = (IP_VHL_V(ip->ip_vhl) == 6); 556 #else 557 const boolean_t isipv6 = FALSE; 558 #endif 559 560 if (tp != NULL) { 561 if (!(flags & TH_RST)) { 562 win = ssb_space(&tp->t_inpcb->inp_socket->so_rcv); 563 if (win < 0) 564 win = 0; 565 if (win > (long)TCP_MAXWIN << tp->rcv_scale) 566 win = (long)TCP_MAXWIN << tp->rcv_scale; 567 } 568 /* 569 * Don't use the route cache of a listen socket, 570 * it is not MPSAFE; use temporary route cache. 571 */ 572 if (tp->t_state != TCPS_LISTEN) { 573 if (isipv6) 574 ro6 = &tp->t_inpcb->in6p_route; 575 else 576 ro = &tp->t_inpcb->inp_route; 577 use_tmpro = FALSE; 578 } 579 } 580 if (use_tmpro) { 581 if (isipv6) { 582 ro6 = &sro6; 583 bzero(ro6, sizeof *ro6); 584 } else { 585 ro = &sro; 586 bzero(ro, sizeof *ro); 587 } 588 } 589 if (m == NULL) { 590 m = m_gethdr(MB_DONTWAIT, MT_HEADER); 591 if (m == NULL) 592 return; 593 tlen = 0; 594 m->m_data += max_linkhdr; 595 if (isipv6) { 596 bcopy(ip6, mtod(m, caddr_t), sizeof(struct ip6_hdr)); 597 ip6 = mtod(m, struct ip6_hdr *); 598 nth = (struct tcphdr *)(ip6 + 1); 599 } else { 600 bcopy(ip, mtod(m, caddr_t), sizeof(struct ip)); 601 ip = mtod(m, struct ip *); 602 nth = (struct tcphdr *)(ip + 1); 603 } 604 bcopy(th, nth, sizeof(struct tcphdr)); 605 flags = TH_ACK; 606 } else { 607 m_freem(m->m_next); 608 m->m_next = NULL; 609 m->m_data = (caddr_t)ipgen; 610 /* m_len is set later */ 611 tlen = 0; 612 #define xchg(a, b, type) { type t; t = a; a = b; b = t; } 613 if (isipv6) { 614 xchg(ip6->ip6_dst, ip6->ip6_src, struct in6_addr); 615 nth = (struct tcphdr *)(ip6 + 1); 616 } else { 617 xchg(ip->ip_dst.s_addr, ip->ip_src.s_addr, n_long); 618 nth = (struct tcphdr *)(ip + 1); 619 } 620 if (th != nth) { 621 /* 622 * this is usually a case when an extension header 623 * exists between the IPv6 header and the 624 * TCP header. 625 */ 626 nth->th_sport = th->th_sport; 627 nth->th_dport = th->th_dport; 628 } 629 xchg(nth->th_dport, nth->th_sport, n_short); 630 #undef xchg 631 } 632 if (isipv6) { 633 ip6->ip6_flow = 0; 634 ip6->ip6_vfc = IPV6_VERSION; 635 ip6->ip6_nxt = IPPROTO_TCP; 636 ip6->ip6_plen = htons((u_short)(sizeof(struct tcphdr) + tlen)); 637 tlen += sizeof(struct ip6_hdr) + sizeof(struct tcphdr); 638 } else { 639 tlen += sizeof(struct tcpiphdr); 640 ip->ip_len = tlen; 641 ip->ip_ttl = ip_defttl; 642 } 643 m->m_len = tlen; 644 m->m_pkthdr.len = tlen; 645 m->m_pkthdr.rcvif = NULL; 646 nth->th_seq = htonl(seq); 647 nth->th_ack = htonl(ack); 648 nth->th_x2 = 0; 649 nth->th_off = sizeof(struct tcphdr) >> 2; 650 nth->th_flags = flags; 651 if (tp != NULL) 652 nth->th_win = htons((u_short) (win >> tp->rcv_scale)); 653 else 654 nth->th_win = htons((u_short)win); 655 nth->th_urp = 0; 656 if (isipv6) { 657 nth->th_sum = 0; 658 nth->th_sum = in6_cksum(m, IPPROTO_TCP, 659 sizeof(struct ip6_hdr), 660 tlen - sizeof(struct ip6_hdr)); 661 ip6->ip6_hlim = in6_selecthlim(tp ? tp->t_inpcb : NULL, 662 (ro6 && ro6->ro_rt) ? 663 ro6->ro_rt->rt_ifp : NULL); 664 } else { 665 nth->th_sum = in_pseudo(ip->ip_src.s_addr, ip->ip_dst.s_addr, 666 htons((u_short)(tlen - sizeof(struct ip) + ip->ip_p))); 667 m->m_pkthdr.csum_flags = CSUM_TCP; 668 m->m_pkthdr.csum_data = offsetof(struct tcphdr, th_sum); 669 m->m_pkthdr.csum_thlen = sizeof(struct tcphdr); 670 } 671 #ifdef TCPDEBUG 672 if (tp == NULL || (tp->t_inpcb->inp_socket->so_options & SO_DEBUG)) 673 tcp_trace(TA_OUTPUT, 0, tp, mtod(m, void *), th, 0); 674 #endif 675 if (isipv6) { 676 ip6_output(m, NULL, ro6, ipflags, NULL, NULL, 677 tp ? tp->t_inpcb : NULL); 678 if ((ro6 == &sro6) && (ro6->ro_rt != NULL)) { 679 RTFREE(ro6->ro_rt); 680 ro6->ro_rt = NULL; 681 } 682 } else { 683 ipflags |= IP_DEBUGROUTE; 684 ip_output(m, NULL, ro, ipflags, NULL, tp ? tp->t_inpcb : NULL); 685 if ((ro == &sro) && (ro->ro_rt != NULL)) { 686 RTFREE(ro->ro_rt); 687 ro->ro_rt = NULL; 688 } 689 } 690 } 691 692 /* 693 * Create a new TCP control block, making an 694 * empty reassembly queue and hooking it to the argument 695 * protocol control block. The `inp' parameter must have 696 * come from the zone allocator set up in tcp_init(). 697 */ 698 struct tcpcb * 699 tcp_newtcpcb(struct inpcb *inp) 700 { 701 struct inp_tp *it; 702 struct tcpcb *tp; 703 #ifdef INET6 704 boolean_t isipv6 = ((inp->inp_vflag & INP_IPV6) != 0); 705 #else 706 const boolean_t isipv6 = FALSE; 707 #endif 708 709 it = (struct inp_tp *)inp; 710 tp = &it->tcb; 711 bzero(tp, sizeof(struct tcpcb)); 712 TAILQ_INIT(&tp->t_segq); 713 tp->t_maxseg = tp->t_maxopd = isipv6 ? tcp_v6mssdflt : tcp_mssdflt; 714 tp->t_rxtthresh = tcprexmtthresh; 715 716 /* Set up our timeouts. */ 717 tp->tt_rexmt = &it->inp_tp_rexmt; 718 tp->tt_persist = &it->inp_tp_persist; 719 tp->tt_keep = &it->inp_tp_keep; 720 tp->tt_2msl = &it->inp_tp_2msl; 721 tp->tt_delack = &it->inp_tp_delack; 722 tcp_inittimers(tp); 723 724 /* 725 * Zero out timer message. We don't create it here, 726 * since the current CPU may not be the owner of this 727 * inpcb. 728 */ 729 tp->tt_msg = &it->inp_tp_timermsg; 730 bzero(tp->tt_msg, sizeof(*tp->tt_msg)); 731 732 tp->t_keepinit = tcp_keepinit; 733 tp->t_keepidle = tcp_keepidle; 734 tp->t_keepintvl = tcp_keepintvl; 735 tp->t_keepcnt = tcp_keepcnt; 736 tp->t_maxidle = tp->t_keepintvl * tp->t_keepcnt; 737 738 if (tcp_do_ncr) 739 tp->t_flags |= TF_NCR; 740 if (tcp_do_rfc1323) 741 tp->t_flags |= (TF_REQ_SCALE | TF_REQ_TSTMP); 742 743 tp->t_inpcb = inp; /* XXX */ 744 tp->t_state = TCPS_CLOSED; 745 /* 746 * Init srtt to TCPTV_SRTTBASE (0), so we can tell that we have no 747 * rtt estimate. Set rttvar so that srtt + 4 * rttvar gives 748 * reasonable initial retransmit time. 749 */ 750 tp->t_srtt = TCPTV_SRTTBASE; 751 tp->t_rttvar = 752 ((TCPTV_RTOBASE - TCPTV_SRTTBASE) << TCP_RTTVAR_SHIFT) / 4; 753 tp->t_rttmin = tcp_rexmit_min; 754 tp->t_rxtcur = TCPTV_RTOBASE; 755 tp->snd_cwnd = TCP_MAXWIN << TCP_MAX_WINSHIFT; 756 tp->snd_bwnd = TCP_MAXWIN << TCP_MAX_WINSHIFT; 757 tp->snd_ssthresh = TCP_MAXWIN << TCP_MAX_WINSHIFT; 758 tp->snd_last = ticks; 759 tp->t_rcvtime = ticks; 760 /* 761 * IPv4 TTL initialization is necessary for an IPv6 socket as well, 762 * because the socket may be bound to an IPv6 wildcard address, 763 * which may match an IPv4-mapped IPv6 address. 764 */ 765 inp->inp_ip_ttl = ip_defttl; 766 inp->inp_ppcb = tp; 767 tcp_sack_tcpcb_init(tp); 768 769 tp->tt_sndmore = &it->inp_tp_sndmore; 770 tcp_output_init(tp); 771 772 return (tp); /* XXX */ 773 } 774 775 /* 776 * Drop a TCP connection, reporting the specified error. 777 * If connection is synchronized, then send a RST to peer. 778 */ 779 struct tcpcb * 780 tcp_drop(struct tcpcb *tp, int error) 781 { 782 struct socket *so = tp->t_inpcb->inp_socket; 783 784 if (TCPS_HAVERCVDSYN(tp->t_state)) { 785 tp->t_state = TCPS_CLOSED; 786 tcp_output(tp); 787 tcpstat.tcps_drops++; 788 } else 789 tcpstat.tcps_conndrops++; 790 if (error == ETIMEDOUT && tp->t_softerror) 791 error = tp->t_softerror; 792 so->so_error = error; 793 return (tcp_close(tp)); 794 } 795 796 struct netmsg_listen_detach { 797 struct netmsg_base base; 798 struct tcpcb *nm_tp; 799 struct tcpcb *nm_tp_inh; 800 }; 801 802 static void 803 tcp_listen_detach_handler(netmsg_t msg) 804 { 805 struct netmsg_listen_detach *nmsg = (struct netmsg_listen_detach *)msg; 806 struct tcpcb *tp = nmsg->nm_tp; 807 int cpu = mycpuid, nextcpu; 808 809 if (tp->t_flags & TF_LISTEN) 810 syncache_destroy(tp, nmsg->nm_tp_inh); 811 812 in_pcbremwildcardhash_oncpu(tp->t_inpcb, &tcbinfo[cpu]); 813 814 nextcpu = cpu + 1; 815 if (nextcpu < ncpus2) 816 lwkt_forwardmsg(netisr_cpuport(nextcpu), &nmsg->base.lmsg); 817 else 818 lwkt_replymsg(&nmsg->base.lmsg, 0); 819 } 820 821 /* 822 * Close a TCP control block: 823 * discard all space held by the tcp 824 * discard internet protocol block 825 * wake up any sleepers 826 */ 827 struct tcpcb * 828 tcp_close(struct tcpcb *tp) 829 { 830 struct tseg_qent *q; 831 struct inpcb *inp = tp->t_inpcb; 832 struct inpcb *inp_inh = NULL; 833 struct tcpcb *tp_inh = NULL; 834 struct socket *so = inp->inp_socket; 835 struct rtentry *rt; 836 boolean_t dosavessthresh; 837 #ifdef INET6 838 boolean_t isipv6 = ((inp->inp_vflag & INP_IPV6) != 0); 839 boolean_t isafinet6 = (INP_CHECK_SOCKAF(so, AF_INET6) != 0); 840 #else 841 const boolean_t isipv6 = FALSE; 842 #endif 843 844 if (tp->t_flags & TF_LISTEN) { 845 /* 846 * Pending socket/syncache inheritance 847 * 848 * If this is a listen(2) socket, find another listen(2) 849 * socket in the same local group, which could inherit 850 * the syncache and sockets pending on the completion 851 * and incompletion queues. 852 * 853 * NOTE: 854 * Currently the inheritance could only happen on the 855 * listen(2) sockets w/ SO_REUSEPORT set. 856 */ 857 KASSERT(&curthread->td_msgport == netisr_cpuport(0), 858 ("listen socket close not in netisr0")); 859 inp_inh = in_pcblocalgroup_last(&tcbinfo[0], inp); 860 if (inp_inh != NULL) 861 tp_inh = intotcpcb(inp_inh); 862 } 863 864 /* 865 * INP_WILDCARD indicates that listen(2) has been called on 866 * this socket. This implies: 867 * - A wildcard inp's hash is replicated for each protocol thread. 868 * - Syncache for this inp grows independently in each protocol 869 * thread. 870 * - There is more than one cpu 871 * 872 * We have to chain a message to the rest of the protocol threads 873 * to cleanup the wildcard hash and the syncache. The cleanup 874 * in the current protocol thread is defered till the end of this 875 * function (syncache_destroy and in_pcbdetach). 876 * 877 * NOTE: 878 * After cleanup the inp's hash and syncache entries, this inp will 879 * no longer be available to the rest of the protocol threads, so we 880 * are safe to whack the inp in the following code. 881 */ 882 if ((inp->inp_flags & INP_WILDCARD) && ncpus2 > 1) { 883 struct netmsg_listen_detach nmsg; 884 885 KKASSERT(so->so_port == netisr_cpuport(0)); 886 KKASSERT(&curthread->td_msgport == netisr_cpuport(0)); 887 KKASSERT(inp->inp_pcbinfo == &tcbinfo[0]); 888 889 netmsg_init(&nmsg.base, NULL, &curthread->td_msgport, 890 MSGF_PRIORITY, tcp_listen_detach_handler); 891 nmsg.nm_tp = tp; 892 nmsg.nm_tp_inh = tp_inh; 893 lwkt_domsg(netisr_cpuport(1), &nmsg.base.lmsg, 0); 894 } 895 896 KKASSERT(tp->t_state != TCPS_TERMINATING); 897 tp->t_state = TCPS_TERMINATING; 898 899 /* 900 * Make sure that all of our timers are stopped before we 901 * delete the PCB. For listen TCP socket (tp->tt_msg == NULL), 902 * timers are never used. If timer message is never created 903 * (tp->tt_msg->tt_tcb == NULL), timers are never used too. 904 */ 905 if (tp->tt_msg != NULL && tp->tt_msg->tt_tcb != NULL) { 906 tcp_callout_stop(tp, tp->tt_rexmt); 907 tcp_callout_stop(tp, tp->tt_persist); 908 tcp_callout_stop(tp, tp->tt_keep); 909 tcp_callout_stop(tp, tp->tt_2msl); 910 tcp_callout_stop(tp, tp->tt_delack); 911 } 912 913 if (tp->t_flags & TF_ONOUTPUTQ) { 914 KKASSERT(tp->tt_cpu == mycpu->gd_cpuid); 915 TAILQ_REMOVE(&tcpcbackq[tp->tt_cpu], tp, t_outputq); 916 tp->t_flags &= ~TF_ONOUTPUTQ; 917 } 918 919 /* 920 * If we got enough samples through the srtt filter, 921 * save the rtt and rttvar in the routing entry. 922 * 'Enough' is arbitrarily defined as the 16 samples. 923 * 16 samples is enough for the srtt filter to converge 924 * to within 5% of the correct value; fewer samples and 925 * we could save a very bogus rtt. 926 * 927 * Don't update the default route's characteristics and don't 928 * update anything that the user "locked". 929 */ 930 if (tp->t_rttupdated >= 16) { 931 u_long i = 0; 932 933 if (isipv6) { 934 struct sockaddr_in6 *sin6; 935 936 if ((rt = inp->in6p_route.ro_rt) == NULL) 937 goto no_valid_rt; 938 sin6 = (struct sockaddr_in6 *)rt_key(rt); 939 if (IN6_IS_ADDR_UNSPECIFIED(&sin6->sin6_addr)) 940 goto no_valid_rt; 941 } else 942 if ((rt = inp->inp_route.ro_rt) == NULL || 943 ((struct sockaddr_in *)rt_key(rt))-> 944 sin_addr.s_addr == INADDR_ANY) 945 goto no_valid_rt; 946 947 if (!(rt->rt_rmx.rmx_locks & RTV_RTT)) { 948 i = tp->t_srtt * (RTM_RTTUNIT / (hz * TCP_RTT_SCALE)); 949 if (rt->rt_rmx.rmx_rtt && i) 950 /* 951 * filter this update to half the old & half 952 * the new values, converting scale. 953 * See route.h and tcp_var.h for a 954 * description of the scaling constants. 955 */ 956 rt->rt_rmx.rmx_rtt = 957 (rt->rt_rmx.rmx_rtt + i) / 2; 958 else 959 rt->rt_rmx.rmx_rtt = i; 960 tcpstat.tcps_cachedrtt++; 961 } 962 if (!(rt->rt_rmx.rmx_locks & RTV_RTTVAR)) { 963 i = tp->t_rttvar * 964 (RTM_RTTUNIT / (hz * TCP_RTTVAR_SCALE)); 965 if (rt->rt_rmx.rmx_rttvar && i) 966 rt->rt_rmx.rmx_rttvar = 967 (rt->rt_rmx.rmx_rttvar + i) / 2; 968 else 969 rt->rt_rmx.rmx_rttvar = i; 970 tcpstat.tcps_cachedrttvar++; 971 } 972 /* 973 * The old comment here said: 974 * update the pipelimit (ssthresh) if it has been updated 975 * already or if a pipesize was specified & the threshhold 976 * got below half the pipesize. I.e., wait for bad news 977 * before we start updating, then update on both good 978 * and bad news. 979 * 980 * But we want to save the ssthresh even if no pipesize is 981 * specified explicitly in the route, because such 982 * connections still have an implicit pipesize specified 983 * by the global tcp_sendspace. In the absence of a reliable 984 * way to calculate the pipesize, it will have to do. 985 */ 986 i = tp->snd_ssthresh; 987 if (rt->rt_rmx.rmx_sendpipe != 0) 988 dosavessthresh = (i < rt->rt_rmx.rmx_sendpipe/2); 989 else 990 dosavessthresh = (i < so->so_snd.ssb_hiwat/2); 991 if (dosavessthresh || 992 (!(rt->rt_rmx.rmx_locks & RTV_SSTHRESH) && (i != 0) && 993 (rt->rt_rmx.rmx_ssthresh != 0))) { 994 /* 995 * convert the limit from user data bytes to 996 * packets then to packet data bytes. 997 */ 998 i = (i + tp->t_maxseg / 2) / tp->t_maxseg; 999 if (i < 2) 1000 i = 2; 1001 i *= tp->t_maxseg + 1002 (isipv6 ? 1003 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) : 1004 sizeof(struct tcpiphdr)); 1005 if (rt->rt_rmx.rmx_ssthresh) 1006 rt->rt_rmx.rmx_ssthresh = 1007 (rt->rt_rmx.rmx_ssthresh + i) / 2; 1008 else 1009 rt->rt_rmx.rmx_ssthresh = i; 1010 tcpstat.tcps_cachedssthresh++; 1011 } 1012 } 1013 1014 no_valid_rt: 1015 /* free the reassembly queue, if any */ 1016 while((q = TAILQ_FIRST(&tp->t_segq)) != NULL) { 1017 TAILQ_REMOVE(&tp->t_segq, q, tqe_q); 1018 m_freem(q->tqe_m); 1019 kfree(q, M_TSEGQ); 1020 atomic_add_int(&tcp_reass_qsize, -1); 1021 } 1022 /* throw away SACK blocks in scoreboard*/ 1023 if (TCP_DO_SACK(tp)) 1024 tcp_sack_destroy(&tp->scb); 1025 1026 inp->inp_ppcb = NULL; 1027 soisdisconnected(so); 1028 /* note: pcb detached later on */ 1029 1030 tcp_destroy_timermsg(tp); 1031 tcp_output_cancel(tp); 1032 1033 if (tp->t_flags & TF_LISTEN) { 1034 syncache_destroy(tp, tp_inh); 1035 if (inp_inh != NULL && inp_inh->inp_socket != NULL) { 1036 /* 1037 * Pending sockets inheritance only needs 1038 * to be done once in the current thread, 1039 * i.e. netisr0. 1040 */ 1041 soinherit(so, inp_inh->inp_socket); 1042 } 1043 } 1044 1045 so_async_rcvd_drop(so); 1046 /* Drop the reference for the asynchronized pru_rcvd */ 1047 sofree(so); 1048 1049 /* 1050 * NOTE: 1051 * pcbdetach removes any wildcard hash entry on the current CPU. 1052 */ 1053 #ifdef INET6 1054 if (isafinet6) 1055 in6_pcbdetach(inp); 1056 else 1057 #endif 1058 in_pcbdetach(inp); 1059 1060 tcpstat.tcps_closed++; 1061 return (NULL); 1062 } 1063 1064 static __inline void 1065 tcp_drain_oncpu(struct inpcbinfo *pcbinfo) 1066 { 1067 struct inpcbhead *head = &pcbinfo->pcblisthead; 1068 struct inpcb *inpb; 1069 1070 /* 1071 * Since we run in netisr, it is MP safe, even if 1072 * we block during the inpcb list iteration, i.e. 1073 * we don't need to use inpcb marker here. 1074 */ 1075 KASSERT(&curthread->td_msgport == netisr_cpuport(pcbinfo->cpu), 1076 ("not in correct netisr")); 1077 1078 LIST_FOREACH(inpb, head, inp_list) { 1079 struct tcpcb *tcpb; 1080 struct tseg_qent *te; 1081 1082 if ((inpb->inp_flags & INP_PLACEMARKER) == 0 && 1083 (tcpb = intotcpcb(inpb)) != NULL && 1084 (te = TAILQ_FIRST(&tcpb->t_segq)) != NULL) { 1085 TAILQ_REMOVE(&tcpb->t_segq, te, tqe_q); 1086 if (te->tqe_th->th_flags & TH_FIN) 1087 tcpb->t_flags &= ~TF_QUEDFIN; 1088 m_freem(te->tqe_m); 1089 kfree(te, M_TSEGQ); 1090 atomic_add_int(&tcp_reass_qsize, -1); 1091 /* retry */ 1092 } 1093 } 1094 } 1095 1096 static void 1097 tcp_drain_dispatch(netmsg_t nmsg) 1098 { 1099 crit_enter(); 1100 lwkt_replymsg(&nmsg->lmsg, 0); /* reply ASAP */ 1101 crit_exit(); 1102 1103 tcp_drain_oncpu(&tcbinfo[mycpuid]); 1104 } 1105 1106 static void 1107 tcp_drain_ipi(void *arg __unused) 1108 { 1109 int cpu = mycpuid; 1110 struct lwkt_msg *msg = &tcp_drain_netmsg[cpu].lmsg; 1111 1112 crit_enter(); 1113 if (msg->ms_flags & MSGF_DONE) 1114 lwkt_sendmsg_oncpu(netisr_cpuport(cpu), msg); 1115 crit_exit(); 1116 } 1117 1118 void 1119 tcp_drain(void) 1120 { 1121 cpumask_t mask; 1122 1123 if (!do_tcpdrain) 1124 return; 1125 1126 /* 1127 * Walk the tcpbs, if existing, and flush the reassembly queue, 1128 * if there is one... 1129 * XXX: The "Net/3" implementation doesn't imply that the TCP 1130 * reassembly queue should be flushed, but in a situation 1131 * where we're really low on mbufs, this is potentially 1132 * useful. 1133 * YYY: We may consider run tcp_drain_oncpu directly here, 1134 * however, that will require M_WAITOK memory allocation 1135 * for the inpcb marker. 1136 */ 1137 CPUMASK_ASSBMASK(mask, ncpus2); 1138 CPUMASK_ANDMASK(mask, smp_active_mask); 1139 if (CPUMASK_TESTNZERO(mask)) 1140 lwkt_send_ipiq_mask(mask, tcp_drain_ipi, NULL); 1141 } 1142 1143 /* 1144 * Notify a tcp user of an asynchronous error; 1145 * store error as soft error, but wake up user 1146 * (for now, won't do anything until can select for soft error). 1147 * 1148 * Do not wake up user since there currently is no mechanism for 1149 * reporting soft errors (yet - a kqueue filter may be added). 1150 */ 1151 static void 1152 tcp_notify(struct inpcb *inp, int error) 1153 { 1154 struct tcpcb *tp = intotcpcb(inp); 1155 1156 /* 1157 * Ignore some errors if we are hooked up. 1158 * If connection hasn't completed, has retransmitted several times, 1159 * and receives a second error, give up now. This is better 1160 * than waiting a long time to establish a connection that 1161 * can never complete. 1162 */ 1163 if (tp->t_state == TCPS_ESTABLISHED && 1164 (error == EHOSTUNREACH || error == ENETUNREACH || 1165 error == EHOSTDOWN)) { 1166 return; 1167 } else if (tp->t_state < TCPS_ESTABLISHED && tp->t_rxtshift > 3 && 1168 tp->t_softerror) 1169 tcp_drop(tp, error); 1170 else 1171 tp->t_softerror = error; 1172 #if 0 1173 wakeup(&so->so_timeo); 1174 sorwakeup(so); 1175 sowwakeup(so); 1176 #endif 1177 } 1178 1179 static int 1180 tcp_pcblist(SYSCTL_HANDLER_ARGS) 1181 { 1182 int error, i, n; 1183 struct inpcb *marker; 1184 struct inpcb *inp; 1185 int origcpu, ccpu; 1186 1187 error = 0; 1188 n = 0; 1189 1190 /* 1191 * The process of preparing the TCB list is too time-consuming and 1192 * resource-intensive to repeat twice on every request. 1193 */ 1194 if (req->oldptr == NULL) { 1195 for (ccpu = 0; ccpu < ncpus2; ++ccpu) 1196 n += tcbinfo[ccpu].ipi_count; 1197 req->oldidx = (n + n/8 + 10) * sizeof(struct xtcpcb); 1198 return (0); 1199 } 1200 1201 if (req->newptr != NULL) 1202 return (EPERM); 1203 1204 marker = kmalloc(sizeof(struct inpcb), M_TEMP, M_WAITOK|M_ZERO); 1205 marker->inp_flags |= INP_PLACEMARKER; 1206 1207 /* 1208 * OK, now we're committed to doing something. Run the inpcb list 1209 * for each cpu in the system and construct the output. Use a 1210 * list placemarker to deal with list changes occuring during 1211 * copyout blockages (but otherwise depend on being on the correct 1212 * cpu to avoid races). 1213 */ 1214 origcpu = mycpu->gd_cpuid; 1215 for (ccpu = 0; ccpu < ncpus2 && error == 0; ++ccpu) { 1216 caddr_t inp_ppcb; 1217 struct xtcpcb xt; 1218 1219 lwkt_migratecpu(ccpu); 1220 1221 n = tcbinfo[ccpu].ipi_count; 1222 1223 LIST_INSERT_HEAD(&tcbinfo[ccpu].pcblisthead, marker, inp_list); 1224 i = 0; 1225 while ((inp = LIST_NEXT(marker, inp_list)) != NULL && i < n) { 1226 /* 1227 * process a snapshot of pcbs, ignoring placemarkers 1228 * and using our own to allow SYSCTL_OUT to block. 1229 */ 1230 LIST_REMOVE(marker, inp_list); 1231 LIST_INSERT_AFTER(inp, marker, inp_list); 1232 1233 if (inp->inp_flags & INP_PLACEMARKER) 1234 continue; 1235 if (prison_xinpcb(req->td, inp)) 1236 continue; 1237 1238 xt.xt_len = sizeof xt; 1239 bcopy(inp, &xt.xt_inp, sizeof *inp); 1240 inp_ppcb = inp->inp_ppcb; 1241 if (inp_ppcb != NULL) 1242 bcopy(inp_ppcb, &xt.xt_tp, sizeof xt.xt_tp); 1243 else 1244 bzero(&xt.xt_tp, sizeof xt.xt_tp); 1245 if (inp->inp_socket) 1246 sotoxsocket(inp->inp_socket, &xt.xt_socket); 1247 if ((error = SYSCTL_OUT(req, &xt, sizeof xt)) != 0) 1248 break; 1249 ++i; 1250 } 1251 LIST_REMOVE(marker, inp_list); 1252 if (error == 0 && i < n) { 1253 bzero(&xt, sizeof xt); 1254 xt.xt_len = sizeof xt; 1255 while (i < n) { 1256 error = SYSCTL_OUT(req, &xt, sizeof xt); 1257 if (error) 1258 break; 1259 ++i; 1260 } 1261 } 1262 } 1263 1264 /* 1265 * Make sure we are on the same cpu we were on originally, since 1266 * higher level callers expect this. Also don't pollute caches with 1267 * migrated userland data by (eventually) returning to userland 1268 * on a different cpu. 1269 */ 1270 lwkt_migratecpu(origcpu); 1271 kfree(marker, M_TEMP); 1272 return (error); 1273 } 1274 1275 SYSCTL_PROC(_net_inet_tcp, TCPCTL_PCBLIST, pcblist, CTLFLAG_RD, 0, 0, 1276 tcp_pcblist, "S,xtcpcb", "List of active TCP connections"); 1277 1278 static int 1279 tcp_getcred(SYSCTL_HANDLER_ARGS) 1280 { 1281 struct sockaddr_in addrs[2]; 1282 struct ucred cred0, *cred = NULL; 1283 struct inpcb *inp; 1284 int cpu, origcpu, error; 1285 1286 error = priv_check(req->td, PRIV_ROOT); 1287 if (error != 0) 1288 return (error); 1289 error = SYSCTL_IN(req, addrs, sizeof addrs); 1290 if (error != 0) 1291 return (error); 1292 1293 origcpu = mycpuid; 1294 cpu = tcp_addrcpu(addrs[1].sin_addr.s_addr, addrs[1].sin_port, 1295 addrs[0].sin_addr.s_addr, addrs[0].sin_port); 1296 1297 lwkt_migratecpu(cpu); 1298 1299 inp = in_pcblookup_hash(&tcbinfo[cpu], addrs[1].sin_addr, 1300 addrs[1].sin_port, addrs[0].sin_addr, addrs[0].sin_port, 0, NULL); 1301 if (inp == NULL || inp->inp_socket == NULL) { 1302 error = ENOENT; 1303 } else if (inp->inp_socket->so_cred != NULL) { 1304 cred0 = *(inp->inp_socket->so_cred); 1305 cred = &cred0; 1306 } 1307 1308 lwkt_migratecpu(origcpu); 1309 1310 if (error) 1311 return (error); 1312 1313 return SYSCTL_OUT(req, cred, sizeof(struct ucred)); 1314 } 1315 1316 SYSCTL_PROC(_net_inet_tcp, OID_AUTO, getcred, (CTLTYPE_OPAQUE | CTLFLAG_RW), 1317 0, 0, tcp_getcred, "S,ucred", "Get the ucred of a TCP connection"); 1318 1319 #ifdef INET6 1320 static int 1321 tcp6_getcred(SYSCTL_HANDLER_ARGS) 1322 { 1323 struct sockaddr_in6 addrs[2]; 1324 struct inpcb *inp; 1325 int error; 1326 boolean_t mapped = FALSE; 1327 1328 error = priv_check(req->td, PRIV_ROOT); 1329 if (error != 0) 1330 return (error); 1331 error = SYSCTL_IN(req, addrs, sizeof addrs); 1332 if (error != 0) 1333 return (error); 1334 if (IN6_IS_ADDR_V4MAPPED(&addrs[0].sin6_addr)) { 1335 if (IN6_IS_ADDR_V4MAPPED(&addrs[1].sin6_addr)) 1336 mapped = TRUE; 1337 else 1338 return (EINVAL); 1339 } 1340 crit_enter(); 1341 if (mapped) { 1342 inp = in_pcblookup_hash(&tcbinfo[0], 1343 *(struct in_addr *)&addrs[1].sin6_addr.s6_addr[12], 1344 addrs[1].sin6_port, 1345 *(struct in_addr *)&addrs[0].sin6_addr.s6_addr[12], 1346 addrs[0].sin6_port, 1347 0, NULL); 1348 } else { 1349 inp = in6_pcblookup_hash(&tcbinfo[0], 1350 &addrs[1].sin6_addr, addrs[1].sin6_port, 1351 &addrs[0].sin6_addr, addrs[0].sin6_port, 1352 0, NULL); 1353 } 1354 if (inp == NULL || inp->inp_socket == NULL) { 1355 error = ENOENT; 1356 goto out; 1357 } 1358 error = SYSCTL_OUT(req, inp->inp_socket->so_cred, sizeof(struct ucred)); 1359 out: 1360 crit_exit(); 1361 return (error); 1362 } 1363 1364 SYSCTL_PROC(_net_inet6_tcp6, OID_AUTO, getcred, (CTLTYPE_OPAQUE | CTLFLAG_RW), 1365 0, 0, 1366 tcp6_getcred, "S,ucred", "Get the ucred of a TCP6 connection"); 1367 #endif 1368 1369 struct netmsg_tcp_notify { 1370 struct netmsg_base base; 1371 void (*nm_notify)(struct inpcb *, int); 1372 struct in_addr nm_faddr; 1373 int nm_arg; 1374 }; 1375 1376 static void 1377 tcp_notifyall_oncpu(netmsg_t msg) 1378 { 1379 struct netmsg_tcp_notify *nm = (struct netmsg_tcp_notify *)msg; 1380 int nextcpu; 1381 1382 in_pcbnotifyall(&tcbinfo[mycpuid], nm->nm_faddr, 1383 nm->nm_arg, nm->nm_notify); 1384 1385 nextcpu = mycpuid + 1; 1386 if (nextcpu < ncpus2) 1387 lwkt_forwardmsg(netisr_cpuport(nextcpu), &nm->base.lmsg); 1388 else 1389 lwkt_replymsg(&nm->base.lmsg, 0); 1390 } 1391 1392 void 1393 tcp_ctlinput(netmsg_t msg) 1394 { 1395 int cmd = msg->ctlinput.nm_cmd; 1396 struct sockaddr *sa = msg->ctlinput.nm_arg; 1397 struct ip *ip = msg->ctlinput.nm_extra; 1398 struct tcphdr *th; 1399 struct in_addr faddr; 1400 struct inpcb *inp; 1401 struct tcpcb *tp; 1402 void (*notify)(struct inpcb *, int) = tcp_notify; 1403 tcp_seq icmpseq; 1404 int arg, cpu; 1405 1406 if ((unsigned)cmd >= PRC_NCMDS || inetctlerrmap[cmd] == 0) { 1407 goto done; 1408 } 1409 1410 faddr = ((struct sockaddr_in *)sa)->sin_addr; 1411 if (sa->sa_family != AF_INET || faddr.s_addr == INADDR_ANY) 1412 goto done; 1413 1414 arg = inetctlerrmap[cmd]; 1415 if (cmd == PRC_QUENCH) { 1416 notify = tcp_quench; 1417 } else if (icmp_may_rst && 1418 (cmd == PRC_UNREACH_ADMIN_PROHIB || 1419 cmd == PRC_UNREACH_PORT || 1420 cmd == PRC_TIMXCEED_INTRANS) && 1421 ip != NULL) { 1422 notify = tcp_drop_syn_sent; 1423 } else if (cmd == PRC_MSGSIZE) { 1424 struct icmp *icmp = (struct icmp *) 1425 ((caddr_t)ip - offsetof(struct icmp, icmp_ip)); 1426 1427 arg = ntohs(icmp->icmp_nextmtu); 1428 notify = tcp_mtudisc; 1429 } else if (PRC_IS_REDIRECT(cmd)) { 1430 ip = NULL; 1431 notify = in_rtchange; 1432 } else if (cmd == PRC_HOSTDEAD) { 1433 ip = NULL; 1434 } 1435 1436 if (ip != NULL) { 1437 crit_enter(); 1438 th = (struct tcphdr *)((caddr_t)ip + 1439 (IP_VHL_HL(ip->ip_vhl) << 2)); 1440 cpu = tcp_addrcpu(faddr.s_addr, th->th_dport, 1441 ip->ip_src.s_addr, th->th_sport); 1442 inp = in_pcblookup_hash(&tcbinfo[cpu], faddr, th->th_dport, 1443 ip->ip_src, th->th_sport, 0, NULL); 1444 if ((inp != NULL) && (inp->inp_socket != NULL)) { 1445 icmpseq = htonl(th->th_seq); 1446 tp = intotcpcb(inp); 1447 if (SEQ_GEQ(icmpseq, tp->snd_una) && 1448 SEQ_LT(icmpseq, tp->snd_max)) 1449 (*notify)(inp, arg); 1450 } else { 1451 struct in_conninfo inc; 1452 1453 inc.inc_fport = th->th_dport; 1454 inc.inc_lport = th->th_sport; 1455 inc.inc_faddr = faddr; 1456 inc.inc_laddr = ip->ip_src; 1457 #ifdef INET6 1458 inc.inc_isipv6 = 0; 1459 #endif 1460 syncache_unreach(&inc, th); 1461 } 1462 crit_exit(); 1463 } else { 1464 struct netmsg_tcp_notify *nm; 1465 1466 KKASSERT(&curthread->td_msgport == netisr_cpuport(0)); 1467 nm = kmalloc(sizeof(*nm), M_LWKTMSG, M_INTWAIT); 1468 netmsg_init(&nm->base, NULL, &netisr_afree_rport, 1469 0, tcp_notifyall_oncpu); 1470 nm->nm_faddr = faddr; 1471 nm->nm_arg = arg; 1472 nm->nm_notify = notify; 1473 1474 lwkt_sendmsg(netisr_cpuport(0), &nm->base.lmsg); 1475 } 1476 done: 1477 lwkt_replymsg(&msg->lmsg, 0); 1478 } 1479 1480 #ifdef INET6 1481 1482 void 1483 tcp6_ctlinput(netmsg_t msg) 1484 { 1485 int cmd = msg->ctlinput.nm_cmd; 1486 struct sockaddr *sa = msg->ctlinput.nm_arg; 1487 void *d = msg->ctlinput.nm_extra; 1488 struct tcphdr th; 1489 void (*notify) (struct inpcb *, int) = tcp_notify; 1490 struct ip6_hdr *ip6; 1491 struct mbuf *m; 1492 struct ip6ctlparam *ip6cp = NULL; 1493 const struct sockaddr_in6 *sa6_src = NULL; 1494 int off; 1495 struct tcp_portonly { 1496 u_int16_t th_sport; 1497 u_int16_t th_dport; 1498 } *thp; 1499 int arg; 1500 1501 if (sa->sa_family != AF_INET6 || 1502 sa->sa_len != sizeof(struct sockaddr_in6)) { 1503 goto out; 1504 } 1505 1506 arg = 0; 1507 if (cmd == PRC_QUENCH) 1508 notify = tcp_quench; 1509 else if (cmd == PRC_MSGSIZE) { 1510 struct ip6ctlparam *ip6cp = d; 1511 struct icmp6_hdr *icmp6 = ip6cp->ip6c_icmp6; 1512 1513 arg = ntohl(icmp6->icmp6_mtu); 1514 notify = tcp_mtudisc; 1515 } else if (!PRC_IS_REDIRECT(cmd) && 1516 ((unsigned)cmd > PRC_NCMDS || inet6ctlerrmap[cmd] == 0)) { 1517 goto out; 1518 } 1519 1520 /* if the parameter is from icmp6, decode it. */ 1521 if (d != NULL) { 1522 ip6cp = (struct ip6ctlparam *)d; 1523 m = ip6cp->ip6c_m; 1524 ip6 = ip6cp->ip6c_ip6; 1525 off = ip6cp->ip6c_off; 1526 sa6_src = ip6cp->ip6c_src; 1527 } else { 1528 m = NULL; 1529 ip6 = NULL; 1530 off = 0; /* fool gcc */ 1531 sa6_src = &sa6_any; 1532 } 1533 1534 if (ip6 != NULL) { 1535 struct in_conninfo inc; 1536 /* 1537 * XXX: We assume that when IPV6 is non NULL, 1538 * M and OFF are valid. 1539 */ 1540 1541 /* check if we can safely examine src and dst ports */ 1542 if (m->m_pkthdr.len < off + sizeof *thp) 1543 goto out; 1544 1545 bzero(&th, sizeof th); 1546 m_copydata(m, off, sizeof *thp, (caddr_t)&th); 1547 1548 in6_pcbnotify(&tcbinfo[0], sa, th.th_dport, 1549 (struct sockaddr *)ip6cp->ip6c_src, 1550 th.th_sport, cmd, arg, notify); 1551 1552 inc.inc_fport = th.th_dport; 1553 inc.inc_lport = th.th_sport; 1554 inc.inc6_faddr = ((struct sockaddr_in6 *)sa)->sin6_addr; 1555 inc.inc6_laddr = ip6cp->ip6c_src->sin6_addr; 1556 inc.inc_isipv6 = 1; 1557 syncache_unreach(&inc, &th); 1558 } else { 1559 in6_pcbnotify(&tcbinfo[0], sa, 0, 1560 (const struct sockaddr *)sa6_src, 0, cmd, arg, notify); 1561 } 1562 out: 1563 lwkt_replymsg(&msg->ctlinput.base.lmsg, 0); 1564 } 1565 1566 #endif 1567 1568 /* 1569 * Following is where TCP initial sequence number generation occurs. 1570 * 1571 * There are two places where we must use initial sequence numbers: 1572 * 1. In SYN-ACK packets. 1573 * 2. In SYN packets. 1574 * 1575 * All ISNs for SYN-ACK packets are generated by the syncache. See 1576 * tcp_syncache.c for details. 1577 * 1578 * The ISNs in SYN packets must be monotonic; TIME_WAIT recycling 1579 * depends on this property. In addition, these ISNs should be 1580 * unguessable so as to prevent connection hijacking. To satisfy 1581 * the requirements of this situation, the algorithm outlined in 1582 * RFC 1948 is used to generate sequence numbers. 1583 * 1584 * Implementation details: 1585 * 1586 * Time is based off the system timer, and is corrected so that it 1587 * increases by one megabyte per second. This allows for proper 1588 * recycling on high speed LANs while still leaving over an hour 1589 * before rollover. 1590 * 1591 * net.inet.tcp.isn_reseed_interval controls the number of seconds 1592 * between seeding of isn_secret. This is normally set to zero, 1593 * as reseeding should not be necessary. 1594 * 1595 */ 1596 1597 #define ISN_BYTES_PER_SECOND 1048576 1598 1599 u_char isn_secret[32]; 1600 int isn_last_reseed; 1601 MD5_CTX isn_ctx; 1602 1603 tcp_seq 1604 tcp_new_isn(struct tcpcb *tp) 1605 { 1606 u_int32_t md5_buffer[4]; 1607 tcp_seq new_isn; 1608 1609 /* Seed if this is the first use, reseed if requested. */ 1610 if ((isn_last_reseed == 0) || ((tcp_isn_reseed_interval > 0) && 1611 (((u_int)isn_last_reseed + (u_int)tcp_isn_reseed_interval*hz) 1612 < (u_int)ticks))) { 1613 read_random_unlimited(&isn_secret, sizeof isn_secret); 1614 isn_last_reseed = ticks; 1615 } 1616 1617 /* Compute the md5 hash and return the ISN. */ 1618 MD5Init(&isn_ctx); 1619 MD5Update(&isn_ctx, (u_char *)&tp->t_inpcb->inp_fport, sizeof(u_short)); 1620 MD5Update(&isn_ctx, (u_char *)&tp->t_inpcb->inp_lport, sizeof(u_short)); 1621 #ifdef INET6 1622 if (tp->t_inpcb->inp_vflag & INP_IPV6) { 1623 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->in6p_faddr, 1624 sizeof(struct in6_addr)); 1625 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->in6p_laddr, 1626 sizeof(struct in6_addr)); 1627 } else 1628 #endif 1629 { 1630 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->inp_faddr, 1631 sizeof(struct in_addr)); 1632 MD5Update(&isn_ctx, (u_char *) &tp->t_inpcb->inp_laddr, 1633 sizeof(struct in_addr)); 1634 } 1635 MD5Update(&isn_ctx, (u_char *) &isn_secret, sizeof(isn_secret)); 1636 MD5Final((u_char *) &md5_buffer, &isn_ctx); 1637 new_isn = (tcp_seq) md5_buffer[0]; 1638 new_isn += ticks * (ISN_BYTES_PER_SECOND / hz); 1639 return (new_isn); 1640 } 1641 1642 /* 1643 * When a source quench is received, close congestion window 1644 * to one segment. We will gradually open it again as we proceed. 1645 */ 1646 void 1647 tcp_quench(struct inpcb *inp, int error) 1648 { 1649 struct tcpcb *tp = intotcpcb(inp); 1650 1651 if (tp != NULL) { 1652 tp->snd_cwnd = tp->t_maxseg; 1653 tp->snd_wacked = 0; 1654 } 1655 } 1656 1657 /* 1658 * When a specific ICMP unreachable message is received and the 1659 * connection state is SYN-SENT, drop the connection. This behavior 1660 * is controlled by the icmp_may_rst sysctl. 1661 */ 1662 void 1663 tcp_drop_syn_sent(struct inpcb *inp, int error) 1664 { 1665 struct tcpcb *tp = intotcpcb(inp); 1666 1667 if ((tp != NULL) && (tp->t_state == TCPS_SYN_SENT)) 1668 tcp_drop(tp, error); 1669 } 1670 1671 /* 1672 * When a `need fragmentation' ICMP is received, update our idea of the MSS 1673 * based on the new value in the route. Also nudge TCP to send something, 1674 * since we know the packet we just sent was dropped. 1675 * This duplicates some code in the tcp_mss() function in tcp_input.c. 1676 */ 1677 void 1678 tcp_mtudisc(struct inpcb *inp, int mtu) 1679 { 1680 struct tcpcb *tp = intotcpcb(inp); 1681 struct rtentry *rt; 1682 struct socket *so = inp->inp_socket; 1683 int maxopd, mss; 1684 #ifdef INET6 1685 boolean_t isipv6 = ((tp->t_inpcb->inp_vflag & INP_IPV6) != 0); 1686 #else 1687 const boolean_t isipv6 = FALSE; 1688 #endif 1689 1690 if (tp == NULL) 1691 return; 1692 1693 /* 1694 * If no MTU is provided in the ICMP message, use the 1695 * next lower likely value, as specified in RFC 1191. 1696 */ 1697 if (mtu == 0) { 1698 int oldmtu; 1699 1700 oldmtu = tp->t_maxopd + 1701 (isipv6 ? 1702 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) : 1703 sizeof(struct tcpiphdr)); 1704 mtu = ip_next_mtu(oldmtu, 0); 1705 } 1706 1707 if (isipv6) 1708 rt = tcp_rtlookup6(&inp->inp_inc); 1709 else 1710 rt = tcp_rtlookup(&inp->inp_inc); 1711 if (rt != NULL) { 1712 if (rt->rt_rmx.rmx_mtu != 0 && rt->rt_rmx.rmx_mtu < mtu) 1713 mtu = rt->rt_rmx.rmx_mtu; 1714 1715 maxopd = mtu - 1716 (isipv6 ? 1717 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) : 1718 sizeof(struct tcpiphdr)); 1719 1720 /* 1721 * XXX - The following conditional probably violates the TCP 1722 * spec. The problem is that, since we don't know the 1723 * other end's MSS, we are supposed to use a conservative 1724 * default. But, if we do that, then MTU discovery will 1725 * never actually take place, because the conservative 1726 * default is much less than the MTUs typically seen 1727 * on the Internet today. For the moment, we'll sweep 1728 * this under the carpet. 1729 * 1730 * The conservative default might not actually be a problem 1731 * if the only case this occurs is when sending an initial 1732 * SYN with options and data to a host we've never talked 1733 * to before. Then, they will reply with an MSS value which 1734 * will get recorded and the new parameters should get 1735 * recomputed. For Further Study. 1736 */ 1737 if (rt->rt_rmx.rmx_mssopt && rt->rt_rmx.rmx_mssopt < maxopd) 1738 maxopd = rt->rt_rmx.rmx_mssopt; 1739 } else 1740 maxopd = mtu - 1741 (isipv6 ? 1742 sizeof(struct ip6_hdr) + sizeof(struct tcphdr) : 1743 sizeof(struct tcpiphdr)); 1744 1745 if (tp->t_maxopd <= maxopd) 1746 return; 1747 tp->t_maxopd = maxopd; 1748 1749 mss = maxopd; 1750 if ((tp->t_flags & (TF_REQ_TSTMP | TF_RCVD_TSTMP | TF_NOOPT)) == 1751 (TF_REQ_TSTMP | TF_RCVD_TSTMP)) 1752 mss -= TCPOLEN_TSTAMP_APPA; 1753 1754 /* round down to multiple of MCLBYTES */ 1755 #if (MCLBYTES & (MCLBYTES - 1)) == 0 /* test if MCLBYTES power of 2 */ 1756 if (mss > MCLBYTES) 1757 mss &= ~(MCLBYTES - 1); 1758 #else 1759 if (mss > MCLBYTES) 1760 mss = (mss / MCLBYTES) * MCLBYTES; 1761 #endif 1762 1763 if (so->so_snd.ssb_hiwat < mss) 1764 mss = so->so_snd.ssb_hiwat; 1765 1766 tp->t_maxseg = mss; 1767 tp->t_rtttime = 0; 1768 tp->snd_nxt = tp->snd_una; 1769 tcp_output(tp); 1770 tcpstat.tcps_mturesent++; 1771 } 1772 1773 /* 1774 * Look-up the routing entry to the peer of this inpcb. If no route 1775 * is found and it cannot be allocated the return NULL. This routine 1776 * is called by TCP routines that access the rmx structure and by tcp_mss 1777 * to get the interface MTU. 1778 */ 1779 struct rtentry * 1780 tcp_rtlookup(struct in_conninfo *inc) 1781 { 1782 struct route *ro = &inc->inc_route; 1783 1784 if (ro->ro_rt == NULL || !(ro->ro_rt->rt_flags & RTF_UP)) { 1785 /* No route yet, so try to acquire one */ 1786 if (inc->inc_faddr.s_addr != INADDR_ANY) { 1787 /* 1788 * unused portions of the structure MUST be zero'd 1789 * out because rtalloc() treats it as opaque data 1790 */ 1791 bzero(&ro->ro_dst, sizeof(struct sockaddr_in)); 1792 ro->ro_dst.sa_family = AF_INET; 1793 ro->ro_dst.sa_len = sizeof(struct sockaddr_in); 1794 ((struct sockaddr_in *) &ro->ro_dst)->sin_addr = 1795 inc->inc_faddr; 1796 rtalloc(ro); 1797 } 1798 } 1799 return (ro->ro_rt); 1800 } 1801 1802 #ifdef INET6 1803 struct rtentry * 1804 tcp_rtlookup6(struct in_conninfo *inc) 1805 { 1806 struct route_in6 *ro6 = &inc->inc6_route; 1807 1808 if (ro6->ro_rt == NULL || !(ro6->ro_rt->rt_flags & RTF_UP)) { 1809 /* No route yet, so try to acquire one */ 1810 if (!IN6_IS_ADDR_UNSPECIFIED(&inc->inc6_faddr)) { 1811 /* 1812 * unused portions of the structure MUST be zero'd 1813 * out because rtalloc() treats it as opaque data 1814 */ 1815 bzero(&ro6->ro_dst, sizeof(struct sockaddr_in6)); 1816 ro6->ro_dst.sin6_family = AF_INET6; 1817 ro6->ro_dst.sin6_len = sizeof(struct sockaddr_in6); 1818 ro6->ro_dst.sin6_addr = inc->inc6_faddr; 1819 rtalloc((struct route *)ro6); 1820 } 1821 } 1822 return (ro6->ro_rt); 1823 } 1824 #endif 1825 1826 #ifdef IPSEC 1827 /* compute ESP/AH header size for TCP, including outer IP header. */ 1828 size_t 1829 ipsec_hdrsiz_tcp(struct tcpcb *tp) 1830 { 1831 struct inpcb *inp; 1832 struct mbuf *m; 1833 size_t hdrsiz; 1834 struct ip *ip; 1835 struct tcphdr *th; 1836 1837 if ((tp == NULL) || ((inp = tp->t_inpcb) == NULL)) 1838 return (0); 1839 MGETHDR(m, MB_DONTWAIT, MT_DATA); 1840 if (!m) 1841 return (0); 1842 1843 #ifdef INET6 1844 if (inp->inp_vflag & INP_IPV6) { 1845 struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *); 1846 1847 th = (struct tcphdr *)(ip6 + 1); 1848 m->m_pkthdr.len = m->m_len = 1849 sizeof(struct ip6_hdr) + sizeof(struct tcphdr); 1850 tcp_fillheaders(tp, ip6, th, FALSE); 1851 hdrsiz = ipsec6_hdrsiz(m, IPSEC_DIR_OUTBOUND, inp); 1852 } else 1853 #endif 1854 { 1855 ip = mtod(m, struct ip *); 1856 th = (struct tcphdr *)(ip + 1); 1857 m->m_pkthdr.len = m->m_len = sizeof(struct tcpiphdr); 1858 tcp_fillheaders(tp, ip, th, FALSE); 1859 hdrsiz = ipsec4_hdrsiz(m, IPSEC_DIR_OUTBOUND, inp); 1860 } 1861 1862 m_free(m); 1863 return (hdrsiz); 1864 } 1865 #endif 1866 1867 /* 1868 * TCP BANDWIDTH DELAY PRODUCT WINDOW LIMITING 1869 * 1870 * This code attempts to calculate the bandwidth-delay product as a 1871 * means of determining the optimal window size to maximize bandwidth, 1872 * minimize RTT, and avoid the over-allocation of buffers on interfaces and 1873 * routers. This code also does a fairly good job keeping RTTs in check 1874 * across slow links like modems. We implement an algorithm which is very 1875 * similar (but not meant to be) TCP/Vegas. The code operates on the 1876 * transmitter side of a TCP connection and so only effects the transmit 1877 * side of the connection. 1878 * 1879 * BACKGROUND: TCP makes no provision for the management of buffer space 1880 * at the end points or at the intermediate routers and switches. A TCP 1881 * stream, whether using NewReno or not, will eventually buffer as 1882 * many packets as it is able and the only reason this typically works is 1883 * due to the fairly small default buffers made available for a connection 1884 * (typicaly 16K or 32K). As machines use larger windows and/or window 1885 * scaling it is now fairly easy for even a single TCP connection to blow-out 1886 * all available buffer space not only on the local interface, but on 1887 * intermediate routers and switches as well. NewReno makes a misguided 1888 * attempt to 'solve' this problem by waiting for an actual failure to occur, 1889 * then backing off, then steadily increasing the window again until another 1890 * failure occurs, ad-infinitum. This results in terrible oscillation that 1891 * is only made worse as network loads increase and the idea of intentionally 1892 * blowing out network buffers is, frankly, a terrible way to manage network 1893 * resources. 1894 * 1895 * It is far better to limit the transmit window prior to the failure 1896 * condition being achieved. There are two general ways to do this: First 1897 * you can 'scan' through different transmit window sizes and locate the 1898 * point where the RTT stops increasing, indicating that you have filled the 1899 * pipe, then scan backwards until you note that RTT stops decreasing, then 1900 * repeat ad-infinitum. This method works in principle but has severe 1901 * implementation issues due to RTT variances, timer granularity, and 1902 * instability in the algorithm which can lead to many false positives and 1903 * create oscillations as well as interact badly with other TCP streams 1904 * implementing the same algorithm. 1905 * 1906 * The second method is to limit the window to the bandwidth delay product 1907 * of the link. This is the method we implement. RTT variances and our 1908 * own manipulation of the congestion window, bwnd, can potentially 1909 * destabilize the algorithm. For this reason we have to stabilize the 1910 * elements used to calculate the window. We do this by using the minimum 1911 * observed RTT, the long term average of the observed bandwidth, and 1912 * by adding two segments worth of slop. It isn't perfect but it is able 1913 * to react to changing conditions and gives us a very stable basis on 1914 * which to extend the algorithm. 1915 */ 1916 void 1917 tcp_xmit_bandwidth_limit(struct tcpcb *tp, tcp_seq ack_seq) 1918 { 1919 u_long bw; 1920 u_long ibw; 1921 u_long bwnd; 1922 int save_ticks; 1923 int delta_ticks; 1924 1925 /* 1926 * If inflight_enable is disabled in the middle of a tcp connection, 1927 * make sure snd_bwnd is effectively disabled. 1928 */ 1929 if (!tcp_inflight_enable) { 1930 tp->snd_bwnd = TCP_MAXWIN << TCP_MAX_WINSHIFT; 1931 tp->snd_bandwidth = 0; 1932 return; 1933 } 1934 1935 /* 1936 * Validate the delta time. If a connection is new or has been idle 1937 * a long time we have to reset the bandwidth calculator. 1938 */ 1939 save_ticks = ticks; 1940 cpu_ccfence(); 1941 delta_ticks = save_ticks - tp->t_bw_rtttime; 1942 if (tp->t_bw_rtttime == 0 || delta_ticks < 0 || delta_ticks > hz * 10) { 1943 tp->t_bw_rtttime = save_ticks; 1944 tp->t_bw_rtseq = ack_seq; 1945 if (tp->snd_bandwidth == 0) 1946 tp->snd_bandwidth = tcp_inflight_min; 1947 return; 1948 } 1949 1950 /* 1951 * A delta of at least 1 tick is required. Waiting 2 ticks will 1952 * result in better (bw) accuracy. More than that and the ramp-up 1953 * will be too slow. 1954 */ 1955 if (delta_ticks == 0 || delta_ticks == 1) 1956 return; 1957 1958 /* 1959 * Sanity check, plus ignore pure window update acks. 1960 */ 1961 if ((int)(ack_seq - tp->t_bw_rtseq) <= 0) 1962 return; 1963 1964 /* 1965 * Figure out the bandwidth. Due to the tick granularity this 1966 * is a very rough number and it MUST be averaged over a fairly 1967 * long period of time. XXX we need to take into account a link 1968 * that is not using all available bandwidth, but for now our 1969 * slop will ramp us up if this case occurs and the bandwidth later 1970 * increases. 1971 */ 1972 ibw = (int64_t)(ack_seq - tp->t_bw_rtseq) * hz / delta_ticks; 1973 tp->t_bw_rtttime = save_ticks; 1974 tp->t_bw_rtseq = ack_seq; 1975 bw = ((int64_t)tp->snd_bandwidth * 15 + ibw) >> 4; 1976 1977 tp->snd_bandwidth = bw; 1978 1979 /* 1980 * Calculate the semi-static bandwidth delay product, plus two maximal 1981 * segments. The additional slop puts us squarely in the sweet 1982 * spot and also handles the bandwidth run-up case. Without the 1983 * slop we could be locking ourselves into a lower bandwidth. 1984 * 1985 * At very high speeds the bw calculation can become overly sensitive 1986 * and error prone when delta_ticks is low (e.g. usually 1). To deal 1987 * with the problem the stab must be scaled to the bw. A stab of 50 1988 * (the default) increases the bw for the purposes of the bwnd 1989 * calculation by 5%. 1990 * 1991 * Situations Handled: 1992 * (1) Prevents over-queueing of packets on LANs, especially on 1993 * high speed LANs, allowing larger TCP buffers to be 1994 * specified, and also does a good job preventing 1995 * over-queueing of packets over choke points like modems 1996 * (at least for the transmit side). 1997 * 1998 * (2) Is able to handle changing network loads (bandwidth 1999 * drops so bwnd drops, bandwidth increases so bwnd 2000 * increases). 2001 * 2002 * (3) Theoretically should stabilize in the face of multiple 2003 * connections implementing the same algorithm (this may need 2004 * a little work). 2005 * 2006 * (4) Stability value (defaults to 20 = 2 maximal packets) can 2007 * be adjusted with a sysctl but typically only needs to be on 2008 * very slow connections. A value no smaller then 5 should 2009 * be used, but only reduce this default if you have no other 2010 * choice. 2011 */ 2012 2013 #define USERTT ((tp->t_srtt + tp->t_rttvar) + tcp_inflight_adjrtt) 2014 bw += bw * tcp_inflight_stab / 1000; 2015 bwnd = (int64_t)bw * USERTT / (hz << TCP_RTT_SHIFT) + 2016 (int)tp->t_maxseg * 2; 2017 #undef USERTT 2018 2019 if (tcp_inflight_debug > 0) { 2020 static int ltime; 2021 if ((u_int)(save_ticks - ltime) >= hz / tcp_inflight_debug) { 2022 ltime = save_ticks; 2023 kprintf("%p ibw %ld bw %ld rttvar %d srtt %d " 2024 "bwnd %ld delta %d snd_win %ld\n", 2025 tp, ibw, bw, tp->t_rttvar, tp->t_srtt, 2026 bwnd, delta_ticks, tp->snd_wnd); 2027 } 2028 } 2029 if ((long)bwnd < tcp_inflight_min) 2030 bwnd = tcp_inflight_min; 2031 if (bwnd > tcp_inflight_max) 2032 bwnd = tcp_inflight_max; 2033 if ((long)bwnd < tp->t_maxseg * 2) 2034 bwnd = tp->t_maxseg * 2; 2035 tp->snd_bwnd = bwnd; 2036 } 2037 2038 static void 2039 tcp_rmx_iwsegs(struct tcpcb *tp, u_long *maxsegs, u_long *capsegs) 2040 { 2041 struct rtentry *rt; 2042 struct inpcb *inp = tp->t_inpcb; 2043 #ifdef INET6 2044 boolean_t isipv6 = ((inp->inp_vflag & INP_IPV6) ? TRUE : FALSE); 2045 #else 2046 const boolean_t isipv6 = FALSE; 2047 #endif 2048 2049 /* XXX */ 2050 if (tcp_iw_maxsegs < TCP_IW_MAXSEGS_DFLT) 2051 tcp_iw_maxsegs = TCP_IW_MAXSEGS_DFLT; 2052 if (tcp_iw_capsegs < TCP_IW_CAPSEGS_DFLT) 2053 tcp_iw_capsegs = TCP_IW_CAPSEGS_DFLT; 2054 2055 if (isipv6) 2056 rt = tcp_rtlookup6(&inp->inp_inc); 2057 else 2058 rt = tcp_rtlookup(&inp->inp_inc); 2059 if (rt == NULL || 2060 rt->rt_rmx.rmx_iwmaxsegs < TCP_IW_MAXSEGS_DFLT || 2061 rt->rt_rmx.rmx_iwcapsegs < TCP_IW_CAPSEGS_DFLT) { 2062 *maxsegs = tcp_iw_maxsegs; 2063 *capsegs = tcp_iw_capsegs; 2064 return; 2065 } 2066 *maxsegs = rt->rt_rmx.rmx_iwmaxsegs; 2067 *capsegs = rt->rt_rmx.rmx_iwcapsegs; 2068 } 2069 2070 u_long 2071 tcp_initial_window(struct tcpcb *tp) 2072 { 2073 if (tcp_do_rfc3390) { 2074 /* 2075 * RFC3390: 2076 * "If the SYN or SYN/ACK is lost, the initial window 2077 * used by a sender after a correctly transmitted SYN 2078 * MUST be one segment consisting of MSS bytes." 2079 * 2080 * However, we do something a little bit more aggressive 2081 * then RFC3390 here: 2082 * - Only if time spent in the SYN or SYN|ACK retransmition 2083 * >= 3 seconds, the IW is reduced. We do this mainly 2084 * because when RFC3390 is published, the initial RTO is 2085 * still 3 seconds (the threshold we test here), while 2086 * after RFC6298, the initial RTO is 1 second. This 2087 * behaviour probably still falls within the spirit of 2088 * RFC3390. 2089 * - When IW is reduced, 2*MSS is used instead of 1*MSS. 2090 * Mainly to avoid sender and receiver deadlock until 2091 * delayed ACK timer expires. And even RFC2581 does not 2092 * try to reduce IW upon SYN or SYN|ACK retransmition 2093 * timeout. 2094 * 2095 * See also: 2096 * http://tools.ietf.org/html/draft-ietf-tcpm-initcwnd-03 2097 */ 2098 if (tp->t_rxtsyn >= TCPTV_RTOBASE3) { 2099 return (2 * tp->t_maxseg); 2100 } else { 2101 u_long maxsegs, capsegs; 2102 2103 tcp_rmx_iwsegs(tp, &maxsegs, &capsegs); 2104 return min(maxsegs * tp->t_maxseg, 2105 max(2 * tp->t_maxseg, capsegs * 1460)); 2106 } 2107 } else { 2108 /* 2109 * Even RFC2581 (back to 1999) allows 2*SMSS IW. 2110 * 2111 * Mainly to avoid sender and receiver deadlock 2112 * until delayed ACK timer expires. 2113 */ 2114 return (2 * tp->t_maxseg); 2115 } 2116 } 2117 2118 #ifdef TCP_SIGNATURE 2119 /* 2120 * Compute TCP-MD5 hash of a TCP segment. (RFC2385) 2121 * 2122 * We do this over ip, tcphdr, segment data, and the key in the SADB. 2123 * When called from tcp_input(), we can be sure that th_sum has been 2124 * zeroed out and verified already. 2125 * 2126 * Return 0 if successful, otherwise return -1. 2127 * 2128 * XXX The key is retrieved from the system's PF_KEY SADB, by keying a 2129 * search with the destination IP address, and a 'magic SPI' to be 2130 * determined by the application. This is hardcoded elsewhere to 1179 2131 * right now. Another branch of this code exists which uses the SPD to 2132 * specify per-application flows but it is unstable. 2133 */ 2134 int 2135 tcpsignature_compute( 2136 struct mbuf *m, /* mbuf chain */ 2137 int len, /* length of TCP data */ 2138 int optlen, /* length of TCP options */ 2139 u_char *buf, /* storage for MD5 digest */ 2140 u_int direction) /* direction of flow */ 2141 { 2142 struct ippseudo ippseudo; 2143 MD5_CTX ctx; 2144 int doff; 2145 struct ip *ip; 2146 struct ipovly *ipovly; 2147 struct secasvar *sav; 2148 struct tcphdr *th; 2149 #ifdef INET6 2150 struct ip6_hdr *ip6; 2151 struct in6_addr in6; 2152 uint32_t plen; 2153 uint16_t nhdr; 2154 #endif /* INET6 */ 2155 u_short savecsum; 2156 2157 KASSERT(m != NULL, ("passed NULL mbuf. Game over.")); 2158 KASSERT(buf != NULL, ("passed NULL storage pointer for MD5 signature")); 2159 /* 2160 * Extract the destination from the IP header in the mbuf. 2161 */ 2162 ip = mtod(m, struct ip *); 2163 #ifdef INET6 2164 ip6 = NULL; /* Make the compiler happy. */ 2165 #endif /* INET6 */ 2166 /* 2167 * Look up an SADB entry which matches the address found in 2168 * the segment. 2169 */ 2170 switch (IP_VHL_V(ip->ip_vhl)) { 2171 case IPVERSION: 2172 sav = key_allocsa(AF_INET, (caddr_t)&ip->ip_src, (caddr_t)&ip->ip_dst, 2173 IPPROTO_TCP, htonl(TCP_SIG_SPI)); 2174 break; 2175 #ifdef INET6 2176 case (IPV6_VERSION >> 4): 2177 ip6 = mtod(m, struct ip6_hdr *); 2178 sav = key_allocsa(AF_INET6, (caddr_t)&ip6->ip6_src, (caddr_t)&ip6->ip6_dst, 2179 IPPROTO_TCP, htonl(TCP_SIG_SPI)); 2180 break; 2181 #endif /* INET6 */ 2182 default: 2183 return (EINVAL); 2184 /* NOTREACHED */ 2185 break; 2186 } 2187 if (sav == NULL) { 2188 kprintf("%s: SADB lookup failed\n", __func__); 2189 return (EINVAL); 2190 } 2191 MD5Init(&ctx); 2192 2193 /* 2194 * Step 1: Update MD5 hash with IP pseudo-header. 2195 * 2196 * XXX The ippseudo header MUST be digested in network byte order, 2197 * or else we'll fail the regression test. Assume all fields we've 2198 * been doing arithmetic on have been in host byte order. 2199 * XXX One cannot depend on ipovly->ih_len here. When called from 2200 * tcp_output(), the underlying ip_len member has not yet been set. 2201 */ 2202 switch (IP_VHL_V(ip->ip_vhl)) { 2203 case IPVERSION: 2204 ipovly = (struct ipovly *)ip; 2205 ippseudo.ippseudo_src = ipovly->ih_src; 2206 ippseudo.ippseudo_dst = ipovly->ih_dst; 2207 ippseudo.ippseudo_pad = 0; 2208 ippseudo.ippseudo_p = IPPROTO_TCP; 2209 ippseudo.ippseudo_len = htons(len + sizeof(struct tcphdr) + optlen); 2210 MD5Update(&ctx, (char *)&ippseudo, sizeof(struct ippseudo)); 2211 th = (struct tcphdr *)((u_char *)ip + sizeof(struct ip)); 2212 doff = sizeof(struct ip) + sizeof(struct tcphdr) + optlen; 2213 break; 2214 #ifdef INET6 2215 /* 2216 * RFC 2385, 2.0 Proposal 2217 * For IPv6, the pseudo-header is as described in RFC 2460, namely the 2218 * 128-bit source IPv6 address, 128-bit destination IPv6 address, zero- 2219 * extended next header value (to form 32 bits), and 32-bit segment 2220 * length. 2221 * Note: Upper-Layer Packet Length comes before Next Header. 2222 */ 2223 case (IPV6_VERSION >> 4): 2224 in6 = ip6->ip6_src; 2225 in6_clearscope(&in6); 2226 MD5Update(&ctx, (char *)&in6, sizeof(struct in6_addr)); 2227 in6 = ip6->ip6_dst; 2228 in6_clearscope(&in6); 2229 MD5Update(&ctx, (char *)&in6, sizeof(struct in6_addr)); 2230 plen = htonl(len + sizeof(struct tcphdr) + optlen); 2231 MD5Update(&ctx, (char *)&plen, sizeof(uint32_t)); 2232 nhdr = 0; 2233 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t)); 2234 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t)); 2235 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t)); 2236 nhdr = IPPROTO_TCP; 2237 MD5Update(&ctx, (char *)&nhdr, sizeof(uint8_t)); 2238 th = (struct tcphdr *)((u_char *)ip6 + sizeof(struct ip6_hdr)); 2239 doff = sizeof(struct ip6_hdr) + sizeof(struct tcphdr) + optlen; 2240 break; 2241 #endif /* INET6 */ 2242 default: 2243 return (EINVAL); 2244 /* NOTREACHED */ 2245 break; 2246 } 2247 /* 2248 * Step 2: Update MD5 hash with TCP header, excluding options. 2249 * The TCP checksum must be set to zero. 2250 */ 2251 savecsum = th->th_sum; 2252 th->th_sum = 0; 2253 MD5Update(&ctx, (char *)th, sizeof(struct tcphdr)); 2254 th->th_sum = savecsum; 2255 /* 2256 * Step 3: Update MD5 hash with TCP segment data. 2257 * Use m_apply() to avoid an early m_pullup(). 2258 */ 2259 if (len > 0) 2260 m_apply(m, doff, len, tcpsignature_apply, &ctx); 2261 /* 2262 * Step 4: Update MD5 hash with shared secret. 2263 */ 2264 MD5Update(&ctx, _KEYBUF(sav->key_auth), _KEYLEN(sav->key_auth)); 2265 MD5Final(buf, &ctx); 2266 key_sa_recordxfer(sav, m); 2267 key_freesav(sav); 2268 return (0); 2269 } 2270 2271 int 2272 tcpsignature_apply(void *fstate, void *data, unsigned int len) 2273 { 2274 2275 MD5Update((MD5_CTX *)fstate, (unsigned char *)data, len); 2276 return (0); 2277 } 2278 #endif /* TCP_SIGNATURE */ 2279