tcp_output.c revision 1.147 1 /* $NetBSD: tcp_output.c,v 1.147 2006/10/08 11:01:46 yamt Exp $ */
2
3 /*
4 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the project nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32 /*
33 * @(#)COPYRIGHT 1.1 (NRL) 17 January 1995
34 *
35 * NRL grants permission for redistribution and use in source and binary
36 * forms, with or without modification, of the software and documentation
37 * created at NRL provided that the following conditions are met:
38 *
39 * 1. Redistributions of source code must retain the above copyright
40 * notice, this list of conditions and the following disclaimer.
41 * 2. Redistributions in binary form must reproduce the above copyright
42 * notice, this list of conditions and the following disclaimer in the
43 * documentation and/or other materials provided with the distribution.
44 * 3. All advertising materials mentioning features or use of this software
45 * must display the following acknowledgements:
46 * This product includes software developed by the University of
47 * California, Berkeley and its contributors.
48 * This product includes software developed at the Information
49 * Technology Division, US Naval Research Laboratory.
50 * 4. Neither the name of the NRL nor the names of its contributors
51 * may be used to endorse or promote products derived from this software
52 * without specific prior written permission.
53 *
54 * THE SOFTWARE PROVIDED BY NRL IS PROVIDED BY NRL AND CONTRIBUTORS ``AS
55 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
56 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
57 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL NRL OR
58 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
59 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
60 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
61 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
62 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
63 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
64 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
65 *
66 * The views and conclusions contained in the software and documentation
67 * are those of the authors and should not be interpreted as representing
68 * official policies, either expressed or implied, of the US Naval
69 * Research Laboratory (NRL).
70 */
71
72 /*-
73 * Copyright (c) 1997, 1998, 2001, 2005, 2006 The NetBSD Foundation, Inc.
74 * All rights reserved.
75 *
76 * This code is derived from software contributed to The NetBSD Foundation
77 * by Jason R. Thorpe and Kevin M. Lahey of the Numerical Aerospace Simulation
78 * Facility, NASA Ames Research Center.
79 * This code is derived from software contributed to The NetBSD Foundation
80 * by Charles M. Hannum.
81 * This code is derived from software contributed to The NetBSD Foundation
82 * by Rui Paulo.
83 *
84 * Redistribution and use in source and binary forms, with or without
85 * modification, are permitted provided that the following conditions
86 * are met:
87 * 1. Redistributions of source code must retain the above copyright
88 * notice, this list of conditions and the following disclaimer.
89 * 2. Redistributions in binary form must reproduce the above copyright
90 * notice, this list of conditions and the following disclaimer in the
91 * documentation and/or other materials provided with the distribution.
92 * 3. All advertising materials mentioning features or use of this software
93 * must display the following acknowledgement:
94 * This product includes software developed by the NetBSD
95 * Foundation, Inc. and its contributors.
96 * 4. Neither the name of The NetBSD Foundation nor the names of its
97 * contributors may be used to endorse or promote products derived
98 * from this software without specific prior written permission.
99 *
100 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
101 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
102 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
103 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
104 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
105 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
106 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
107 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
108 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
109 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
110 * POSSIBILITY OF SUCH DAMAGE.
111 */
112
113 /*
114 * Copyright (c) 1982, 1986, 1988, 1990, 1993, 1995
115 * The Regents of the University of California. All rights reserved.
116 *
117 * Redistribution and use in source and binary forms, with or without
118 * modification, are permitted provided that the following conditions
119 * are met:
120 * 1. Redistributions of source code must retain the above copyright
121 * notice, this list of conditions and the following disclaimer.
122 * 2. Redistributions in binary form must reproduce the above copyright
123 * notice, this list of conditions and the following disclaimer in the
124 * documentation and/or other materials provided with the distribution.
125 * 3. Neither the name of the University nor the names of its contributors
126 * may be used to endorse or promote products derived from this software
127 * without specific prior written permission.
128 *
129 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
130 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
131 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
132 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
133 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
134 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
135 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
136 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
137 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
138 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
139 * SUCH DAMAGE.
140 *
141 * @(#)tcp_output.c 8.4 (Berkeley) 5/24/95
142 */
143
144 #include <sys/cdefs.h>
145 __KERNEL_RCSID(0, "$NetBSD: tcp_output.c,v 1.147 2006/10/08 11:01:46 yamt Exp $");
146
147 #include "opt_inet.h"
148 #include "opt_ipsec.h"
149 #include "opt_tcp_debug.h"
150
151 #include <sys/param.h>
152 #include <sys/systm.h>
153 #include <sys/malloc.h>
154 #include <sys/mbuf.h>
155 #include <sys/protosw.h>
156 #include <sys/socket.h>
157 #include <sys/socketvar.h>
158 #include <sys/errno.h>
159 #include <sys/domain.h>
160 #include <sys/kernel.h>
161 #ifdef TCP_SIGNATURE
162 #include <sys/md5.h>
163 #endif
164
165 #include <net/if.h>
166 #include <net/route.h>
167
168 #include <netinet/in.h>
169 #include <netinet/in_systm.h>
170 #include <netinet/ip.h>
171 #include <netinet/in_pcb.h>
172 #include <netinet/ip_var.h>
173
174 #ifdef INET6
175 #ifndef INET
176 #include <netinet/in.h>
177 #endif
178 #include <netinet/ip6.h>
179 #include <netinet6/in6_var.h>
180 #include <netinet6/ip6_var.h>
181 #include <netinet6/in6_pcb.h>
182 #include <netinet6/nd6.h>
183 #endif
184
185 #ifdef FAST_IPSEC
186 #include <netipsec/ipsec.h>
187 #include <netipsec/key.h>
188 #endif /* FAST_IPSEC*/
189 #ifdef IPSEC
190 #include <netinet6/ipsec.h>
191 #endif
192
193 #include <netinet/tcp.h>
194 #define TCPOUTFLAGS
195 #include <netinet/tcp_fsm.h>
196 #include <netinet/tcp_seq.h>
197 #include <netinet/tcp_timer.h>
198 #include <netinet/tcp_var.h>
199 #include <netinet/tcpip.h>
200 #include <netinet/tcp_debug.h>
201 #include <netinet/in_offload.h>
202
203 #ifdef IPSEC
204 #include <netkey/key.h>
205 #endif
206
207 #ifdef notyet
208 extern struct mbuf *m_copypack();
209 #endif
210
211 /*
212 * Knob to enable Congestion Window Monitoring, and control
213 * the burst size it allows. Default burst is 4 packets, per
214 * the Internet draft.
215 */
216 int tcp_cwm = 0;
217 int tcp_cwm_burstsize = 4;
218
219 #ifdef TCP_OUTPUT_COUNTERS
220 #include <sys/device.h>
221
222 extern struct evcnt tcp_output_bigheader;
223 extern struct evcnt tcp_output_predict_hit;
224 extern struct evcnt tcp_output_predict_miss;
225 extern struct evcnt tcp_output_copysmall;
226 extern struct evcnt tcp_output_copybig;
227 extern struct evcnt tcp_output_refbig;
228
229 #define TCP_OUTPUT_COUNTER_INCR(ev) (ev)->ev_count++
230 #else
231
232 #define TCP_OUTPUT_COUNTER_INCR(ev) /* nothing */
233
234 #endif /* TCP_OUTPUT_COUNTERS */
235
236 static
237 #ifndef GPROF
238 inline
239 #endif
240 int
241 tcp_segsize(struct tcpcb *tp, int *txsegsizep, int *rxsegsizep)
242 {
243 #ifdef INET
244 struct inpcb *inp = tp->t_inpcb;
245 #endif
246 #ifdef INET6
247 struct in6pcb *in6p = tp->t_in6pcb;
248 #endif
249 struct socket *so = NULL;
250 struct rtentry *rt;
251 struct ifnet *ifp;
252 int size;
253 int hdrlen;
254 int optlen;
255
256 #ifdef DIAGNOSTIC
257 if (tp->t_inpcb && tp->t_in6pcb)
258 panic("tcp_segsize: both t_inpcb and t_in6pcb are set");
259 #endif
260 switch (tp->t_family) {
261 #ifdef INET
262 case AF_INET:
263 hdrlen = sizeof(struct ip) + sizeof(struct tcphdr);
264 break;
265 #endif
266 #ifdef INET6
267 case AF_INET6:
268 hdrlen = sizeof(struct ip6_hdr) + sizeof(struct tcphdr);
269 break;
270 #endif
271 default:
272 size = tcp_mssdflt;
273 goto out;
274 }
275
276 rt = NULL;
277 #ifdef INET
278 if (inp) {
279 rt = in_pcbrtentry(inp);
280 so = inp->inp_socket;
281 }
282 #endif
283 #ifdef INET6
284 if (in6p) {
285 rt = in6_pcbrtentry(in6p);
286 so = in6p->in6p_socket;
287 }
288 #endif
289 if (rt == NULL) {
290 size = tcp_mssdflt;
291 goto out;
292 }
293
294 ifp = rt->rt_ifp;
295
296 size = tcp_mssdflt;
297 if (tp->t_mtudisc && rt->rt_rmx.rmx_mtu != 0) {
298 #ifdef INET6
299 if (in6p && rt->rt_rmx.rmx_mtu < IPV6_MMTU) {
300 /*
301 * RFC2460 section 5, last paragraph: if path MTU is
302 * smaller than 1280, use 1280 as packet size and
303 * attach fragment header.
304 */
305 size = IPV6_MMTU - hdrlen - sizeof(struct ip6_frag);
306 } else
307 size = rt->rt_rmx.rmx_mtu - hdrlen;
308 #else
309 size = rt->rt_rmx.rmx_mtu - hdrlen;
310 #endif
311 } else if (ifp->if_flags & IFF_LOOPBACK)
312 size = ifp->if_mtu - hdrlen;
313 #ifdef INET
314 else if (inp && tp->t_mtudisc)
315 size = ifp->if_mtu - hdrlen;
316 else if (inp && in_localaddr(inp->inp_faddr))
317 size = ifp->if_mtu - hdrlen;
318 #endif
319 #ifdef INET6
320 else if (in6p) {
321 #ifdef INET
322 if (IN6_IS_ADDR_V4MAPPED(&in6p->in6p_faddr)) {
323 /* mapped addr case */
324 struct in_addr d;
325 bcopy(&in6p->in6p_faddr.s6_addr32[3], &d, sizeof(d));
326 if (tp->t_mtudisc || in_localaddr(d))
327 size = ifp->if_mtu - hdrlen;
328 } else
329 #endif
330 {
331 /*
332 * for IPv6, path MTU discovery is always turned on,
333 * or the node must use packet size <= 1280.
334 */
335 size = tp->t_mtudisc ? IN6_LINKMTU(ifp) : IPV6_MMTU;
336 size -= hdrlen;
337 }
338 }
339 #endif
340 out:
341 /*
342 * Now we must make room for whatever extra TCP/IP options are in
343 * the packet.
344 */
345 optlen = tcp_optlen(tp);
346
347 /*
348 * XXX tp->t_ourmss should have the right size, but without this code
349 * fragmentation will occur... need more investigation
350 */
351 #ifdef INET
352 if (inp) {
353 #if defined(IPSEC) || defined(FAST_IPSEC)
354 if (! IPSEC_PCB_SKIP_IPSEC(inp->inp_sp, IPSEC_DIR_OUTBOUND))
355 optlen += ipsec4_hdrsiz_tcp(tp);
356 #endif
357 optlen += ip_optlen(inp);
358 }
359 #endif
360 #ifdef INET6
361 #ifdef INET
362 if (in6p && tp->t_family == AF_INET) {
363 #if defined(IPSEC) || defined(FAST_IPSEC)
364 if (! IPSEC_PCB_SKIP_IPSEC(in6p->in6p_sp, IPSEC_DIR_OUTBOUND))
365 optlen += ipsec4_hdrsiz_tcp(tp);
366 #endif
367 /* XXX size -= ip_optlen(in6p); */
368 } else
369 #endif
370 if (in6p && tp->t_family == AF_INET6) {
371 #ifdef IPSEC
372 if (! IPSEC_PCB_SKIP_IPSEC(in6p->in6p_sp, IPSEC_DIR_OUTBOUND))
373 optlen += ipsec6_hdrsiz_tcp(tp);
374 #endif
375 optlen += ip6_optlen(in6p);
376 }
377 #endif
378 size -= optlen;
379
380 /* there may not be any room for data if mtu is too small */
381 if (size < 0)
382 return (EMSGSIZE);
383
384 /*
385 * *rxsegsizep holds *estimated* inbound segment size (estimation
386 * assumes that path MTU is the same for both ways). this is only
387 * for silly window avoidance, do not use the value for other purposes.
388 *
389 * ipseclen is subtracted from both sides, this may not be right.
390 * I'm not quite sure about this (could someone comment).
391 */
392 *txsegsizep = min(tp->t_peermss - optlen, size);
393 /*
394 * Never send more than half a buffer full. This insures that we can
395 * always keep 2 packets on the wire, no matter what SO_SNDBUF is, and
396 * therefore acks will never be delayed unless we run out of data to
397 * transmit.
398 */
399 if (so)
400 *txsegsizep = min(so->so_snd.sb_hiwat >> 1, *txsegsizep);
401 *rxsegsizep = min(tp->t_ourmss - optlen, size);
402
403 if (*txsegsizep != tp->t_segsz) {
404 /*
405 * If the new segment size is larger, we don't want to
406 * mess up the congestion window, but if it is smaller
407 * we'll have to reduce the congestion window to ensure
408 * that we don't get into trouble with initial windows
409 * and the rest. In any case, if the segment size
410 * has changed, chances are the path has, too, and
411 * our congestion window will be different.
412 */
413 if (*txsegsizep < tp->t_segsz) {
414 tp->snd_cwnd = max((tp->snd_cwnd / tp->t_segsz)
415 * *txsegsizep, *txsegsizep);
416 tp->snd_ssthresh = max((tp->snd_ssthresh / tp->t_segsz)
417 * *txsegsizep, *txsegsizep);
418 }
419 tp->t_segsz = *txsegsizep;
420 }
421
422 return (0);
423 }
424
425 static
426 #ifndef GPROF
427 inline
428 #endif
429 int
430 tcp_build_datapkt(struct tcpcb *tp, struct socket *so, int off,
431 long len, int hdrlen, struct mbuf **mp)
432 {
433 struct mbuf *m, *m0;
434
435 if (tp->t_force && len == 1)
436 tcpstat.tcps_sndprobe++;
437 else if (SEQ_LT(tp->snd_nxt, tp->snd_max)) {
438 tcpstat.tcps_sndrexmitpack++;
439 tcpstat.tcps_sndrexmitbyte += len;
440 } else {
441 tcpstat.tcps_sndpack++;
442 tcpstat.tcps_sndbyte += len;
443 }
444 #ifdef notyet
445 if ((m = m_copypack(so->so_snd.sb_mb, off,
446 (int)len, max_linkhdr + hdrlen)) == 0)
447 return (ENOBUFS);
448 /*
449 * m_copypack left space for our hdr; use it.
450 */
451 m->m_len += hdrlen;
452 m->m_data -= hdrlen;
453 #else
454 MGETHDR(m, M_DONTWAIT, MT_HEADER);
455 if (__predict_false(m == NULL))
456 return (ENOBUFS);
457 MCLAIM(m, &tcp_tx_mowner);
458
459 /*
460 * XXX Because other code assumes headers will fit in
461 * XXX one header mbuf.
462 *
463 * (This code should almost *never* be run.)
464 */
465 if (__predict_false((max_linkhdr + hdrlen) > MHLEN)) {
466 TCP_OUTPUT_COUNTER_INCR(&tcp_output_bigheader);
467 MCLGET(m, M_DONTWAIT);
468 if ((m->m_flags & M_EXT) == 0) {
469 m_freem(m);
470 return (ENOBUFS);
471 }
472 }
473
474 m->m_data += max_linkhdr;
475 m->m_len = hdrlen;
476
477 /*
478 * To avoid traversing the whole sb_mb chain for correct
479 * data to send, remember last sent mbuf, its offset and
480 * the sent size. When called the next time, see if the
481 * data to send is directly following the previous transfer.
482 * This is important for large TCP windows.
483 */
484 if (off == 0 || tp->t_lastm == NULL ||
485 (tp->t_lastoff + tp->t_lastlen) != off) {
486 TCP_OUTPUT_COUNTER_INCR(&tcp_output_predict_miss);
487 /*
488 * Either a new packet or a retransmit.
489 * Start from the beginning.
490 */
491 tp->t_lastm = so->so_snd.sb_mb;
492 tp->t_inoff = off;
493 } else {
494 TCP_OUTPUT_COUNTER_INCR(&tcp_output_predict_hit);
495 tp->t_inoff += tp->t_lastlen;
496 }
497
498 /* Traverse forward to next packet */
499 while (tp->t_inoff > 0) {
500 if (tp->t_lastm == NULL)
501 panic("tp->t_lastm == NULL");
502 if (tp->t_inoff < tp->t_lastm->m_len)
503 break;
504 tp->t_inoff -= tp->t_lastm->m_len;
505 tp->t_lastm = tp->t_lastm->m_next;
506 }
507
508 tp->t_lastoff = off;
509 tp->t_lastlen = len;
510 m0 = tp->t_lastm;
511 off = tp->t_inoff;
512
513 if (len <= M_TRAILINGSPACE(m)) {
514 m_copydata(m0, off, (int) len, mtod(m, caddr_t) + hdrlen);
515 m->m_len += len;
516 TCP_OUTPUT_COUNTER_INCR(&tcp_output_copysmall);
517 } else {
518 m->m_next = m_copy(m0, off, (int) len);
519 if (m->m_next == NULL) {
520 m_freem(m);
521 return (ENOBUFS);
522 }
523 #ifdef TCP_OUTPUT_COUNTERS
524 if (m->m_next->m_flags & M_EXT)
525 TCP_OUTPUT_COUNTER_INCR(&tcp_output_refbig);
526 else
527 TCP_OUTPUT_COUNTER_INCR(&tcp_output_copybig);
528 #endif /* TCP_OUTPUT_COUNTERS */
529 }
530 #endif
531
532 *mp = m;
533 return (0);
534 }
535
536 /*
537 * Tcp output routine: figure out what should be sent and send it.
538 */
539 int
540 tcp_output(struct tcpcb *tp)
541 {
542 struct socket *so;
543 struct route *ro;
544 long len, win;
545 int off, flags, error;
546 struct mbuf *m;
547 struct ip *ip;
548 #ifdef INET6
549 struct ip6_hdr *ip6;
550 #endif
551 struct tcphdr *th;
552 u_char opt[MAX_TCPOPTLEN];
553 unsigned optlen, hdrlen, packetlen;
554 unsigned int sack_numblks;
555 int idle, sendalot, txsegsize, rxsegsize;
556 int txsegsize_nosack;
557 int maxburst = TCP_MAXBURST;
558 int af; /* address family on the wire */
559 int iphdrlen;
560 int has_tso, use_tso;
561 int sack_rxmit;
562 int sack_bytes_rxmt;
563 struct sackhole *p;
564 #ifdef TCP_SIGNATURE
565 int sigoff = 0;
566 #endif
567
568 #ifdef DIAGNOSTIC
569 if (tp->t_inpcb && tp->t_in6pcb)
570 panic("tcp_output: both t_inpcb and t_in6pcb are set");
571 #endif
572 so = NULL;
573 ro = NULL;
574 if (tp->t_inpcb) {
575 so = tp->t_inpcb->inp_socket;
576 ro = &tp->t_inpcb->inp_route;
577 }
578 #ifdef INET6
579 else if (tp->t_in6pcb) {
580 so = tp->t_in6pcb->in6p_socket;
581 ro = (struct route *)&tp->t_in6pcb->in6p_route;
582 }
583 #endif
584
585 switch (af = tp->t_family) {
586 #ifdef INET
587 case AF_INET:
588 if (tp->t_inpcb)
589 break;
590 #ifdef INET6
591 /* mapped addr case */
592 if (tp->t_in6pcb)
593 break;
594 #endif
595 return (EINVAL);
596 #endif
597 #ifdef INET6
598 case AF_INET6:
599 if (tp->t_in6pcb)
600 break;
601 return (EINVAL);
602 #endif
603 default:
604 return (EAFNOSUPPORT);
605 }
606
607 if (tcp_segsize(tp, &txsegsize, &rxsegsize))
608 return (EMSGSIZE);
609
610 idle = (tp->snd_max == tp->snd_una);
611
612 /*
613 * Determine if we can use TCP segmentation offload:
614 * - If we're using IPv4
615 * - If there is not an IPsec policy that prevents it
616 * - If the interface can do it
617 */
618 has_tso = tp->t_inpcb != NULL &&
619 #if defined(IPSEC) || defined(FAST_IPSEC)
620 IPSEC_PCB_SKIP_IPSEC(tp->t_inpcb->inp_sp,
621 IPSEC_DIR_OUTBOUND) &&
622 #endif
623 tp->t_inpcb->inp_route.ro_rt != NULL &&
624 (tp->t_inpcb->inp_route.ro_rt->rt_ifp->if_capenable &
625 IFCAP_TSOv4) != 0;
626
627 /*
628 * Restart Window computation. From draft-floyd-incr-init-win-03:
629 *
630 * Optionally, a TCP MAY set the restart window to the
631 * minimum of the value used for the initial window and
632 * the current value of cwnd (in other words, using a
633 * larger value for the restart window should never increase
634 * the size of cwnd).
635 */
636 if (tcp_cwm) {
637 /*
638 * Hughes/Touch/Heidemann Congestion Window Monitoring.
639 * Count the number of packets currently pending
640 * acknowledgement, and limit our congestion window
641 * to a pre-determined allowed burst size plus that count.
642 * This prevents bursting once all pending packets have
643 * been acknowledged (i.e. transmission is idle).
644 *
645 * XXX Link this to Initial Window?
646 */
647 tp->snd_cwnd = min(tp->snd_cwnd,
648 (tcp_cwm_burstsize * txsegsize) +
649 (tp->snd_nxt - tp->snd_una));
650 } else {
651 if (idle && (tcp_now - tp->t_rcvtime) >= tp->t_rxtcur) {
652 /*
653 * We have been idle for "a while" and no acks are
654 * expected to clock out any data we send --
655 * slow start to get ack "clock" running again.
656 */
657 int ss = tcp_init_win;
658 #ifdef INET
659 if (tp->t_inpcb &&
660 in_localaddr(tp->t_inpcb->inp_faddr))
661 ss = tcp_init_win_local;
662 #endif
663 #ifdef INET6
664 if (tp->t_in6pcb &&
665 in6_localaddr(&tp->t_in6pcb->in6p_faddr))
666 ss = tcp_init_win_local;
667 #endif
668 tp->snd_cwnd = min(tp->snd_cwnd,
669 TCP_INITIAL_WINDOW(ss, txsegsize));
670 }
671 }
672
673 txsegsize_nosack = txsegsize;
674 again:
675 use_tso = has_tso;
676 TCP_REASS_LOCK(tp);
677 sack_numblks = tcp_sack_numblks(tp);
678 if (sack_numblks) {
679 int sackoptlen;
680
681 sackoptlen = TCP_SACK_OPTLEN(sack_numblks);
682 if (sackoptlen > txsegsize_nosack) {
683 sack_numblks = 0; /* give up SACK */
684 txsegsize = txsegsize_nosack;
685 } else {
686 if ((tp->rcv_sack_flags & TCPSACK_HAVED) != 0) {
687 /* don't duplicate D-SACK. */
688 use_tso = 0;
689 }
690 txsegsize = txsegsize_nosack - sackoptlen;
691 }
692 } else {
693 txsegsize = txsegsize_nosack;
694 }
695
696 /*
697 * Determine length of data that should be transmitted, and
698 * flags that should be used. If there is some data or critical
699 * controls (SYN, RST) to send, then transmit; otherwise,
700 * investigate further.
701 *
702 * Readjust SACK information to avoid resending duplicate data.
703 */
704 if (TCP_SACK_ENABLED(tp) && SEQ_LT(tp->snd_nxt, tp->snd_max))
705 tcp_sack_adjust(tp);
706 sendalot = 0;
707 off = tp->snd_nxt - tp->snd_una;
708 win = min(tp->snd_wnd, tp->snd_cwnd);
709
710 flags = tcp_outflags[tp->t_state];
711
712 /*
713 * Send any SACK-generated retransmissions. If we're explicitly trying
714 * to send out new data (when sendalot is 1), bypass this function.
715 * If we retransmit in fast recovery mode, decrement snd_cwnd, since
716 * we're replacing a (future) new transmission with a retransmission
717 * now, and we previously incremented snd_cwnd in tcp_input().
718 */
719 /*
720 * Still in sack recovery , reset rxmit flag to zero.
721 */
722 sack_rxmit = 0;
723 sack_bytes_rxmt = 0;
724 len = 0;
725 p = NULL;
726 do {
727 long cwin;
728 if (!TCP_SACK_ENABLED(tp))
729 break;
730 if (tp->t_partialacks < 0)
731 break;
732 p = tcp_sack_output(tp, &sack_bytes_rxmt);
733 if (p == NULL)
734 break;
735
736 cwin = min(tp->snd_wnd, tp->snd_cwnd) - sack_bytes_rxmt;
737 if (cwin < 0)
738 cwin = 0;
739 /* Do not retransmit SACK segments beyond snd_recover */
740 if (SEQ_GT(p->end, tp->snd_recover)) {
741 /*
742 * (At least) part of sack hole extends beyond
743 * snd_recover. Check to see if we can rexmit data
744 * for this hole.
745 */
746 if (SEQ_GEQ(p->rxmit, tp->snd_recover)) {
747 /*
748 * Can't rexmit any more data for this hole.
749 * That data will be rexmitted in the next
750 * sack recovery episode, when snd_recover
751 * moves past p->rxmit.
752 */
753 p = NULL;
754 break;
755 }
756 /* Can rexmit part of the current hole */
757 len = ((long)ulmin(cwin, tp->snd_recover - p->rxmit));
758 } else
759 len = ((long)ulmin(cwin, p->end - p->rxmit));
760 off = p->rxmit - tp->snd_una;
761 if (off + len > so->so_snd.sb_cc) {
762 /* 1 for TH_FIN */
763 KASSERT(off + len == so->so_snd.sb_cc + 1);
764 KASSERT(p->rxmit + len == tp->snd_max);
765 len = so->so_snd.sb_cc - off;
766 }
767 if (len > 0) {
768 sack_rxmit = 1;
769 sendalot = 1;
770 }
771 } while (/*CONSTCOND*/0);
772
773 /*
774 * If in persist timeout with window of 0, send 1 byte.
775 * Otherwise, if window is small but nonzero
776 * and timer expired, we will send what we can
777 * and go to transmit state.
778 */
779 if (tp->t_force) {
780 if (win == 0) {
781 /*
782 * If we still have some data to send, then
783 * clear the FIN bit. Usually this would
784 * happen below when it realizes that we
785 * aren't sending all the data. However,
786 * if we have exactly 1 byte of unset data,
787 * then it won't clear the FIN bit below,
788 * and if we are in persist state, we wind
789 * up sending the packet without recording
790 * that we sent the FIN bit.
791 *
792 * We can't just blindly clear the FIN bit,
793 * because if we don't have any more data
794 * to send then the probe will be the FIN
795 * itself.
796 */
797 if (off < so->so_snd.sb_cc)
798 flags &= ~TH_FIN;
799 win = 1;
800 } else {
801 TCP_TIMER_DISARM(tp, TCPT_PERSIST);
802 tp->t_rxtshift = 0;
803 }
804 }
805
806 if (sack_rxmit == 0) {
807 if (sack_bytes_rxmt != 0) {
808 long cwin;
809
810 /*
811 * We are inside of a SACK recovery episode and are
812 * sending new data, having retransmitted all the
813 * data possible in the scoreboard.
814 */
815 if (tp->snd_wnd < so->so_snd.sb_cc) {
816 len = tp->snd_wnd - off;
817 flags &= ~TH_FIN;
818 } else {
819 len = so->so_snd.sb_cc - off;
820 }
821
822 /*
823 * From FreeBSD:
824 * Don't remove this (len > 0) check !
825 * We explicitly check for len > 0 here (although it
826 * isn't really necessary), to work around a gcc
827 * optimization issue - to force gcc to compute
828 * len above. Without this check, the computation
829 * of len is bungled by the optimizer.
830 */
831 if (len > 0) {
832 cwin = tp->snd_cwnd -
833 (tp->snd_nxt - tp->sack_newdata) -
834 sack_bytes_rxmt;
835 if (cwin < 0)
836 cwin = 0;
837 if (cwin < len) {
838 len = cwin;
839 flags &= ~TH_FIN;
840 }
841 }
842 } else if (win < so->so_snd.sb_cc) {
843 len = win - off;
844 flags &= ~TH_FIN;
845 } else {
846 len = so->so_snd.sb_cc - off;
847 }
848 }
849
850 if (len < 0) {
851 /*
852 * If FIN has been sent but not acked,
853 * but we haven't been called to retransmit,
854 * len will be -1. Otherwise, window shrank
855 * after we sent into it. If window shrank to 0,
856 * cancel pending retransmit, pull snd_nxt back
857 * to (closed) window, and set the persist timer
858 * if it isn't already going. If the window didn't
859 * close completely, just wait for an ACK.
860 *
861 * If we have a pending FIN, either it has already been
862 * transmitted or it is outside the window, so drop it.
863 * If the FIN has been transmitted, but this is not a
864 * retransmission, then len must be -1. Therefore we also
865 * prevent here the sending of `gratuitous FINs'. This
866 * eliminates the need to check for that case below (e.g.
867 * to back up snd_nxt before the FIN so that the sequence
868 * number is correct).
869 */
870 len = 0;
871 flags &= ~TH_FIN;
872 if (win == 0) {
873 TCP_TIMER_DISARM(tp, TCPT_REXMT);
874 tp->t_rxtshift = 0;
875 tp->snd_nxt = tp->snd_una;
876 if (TCP_TIMER_ISARMED(tp, TCPT_PERSIST) == 0)
877 tcp_setpersist(tp);
878 }
879 }
880 if (len > txsegsize) {
881 if (use_tso) {
882 /*
883 * Truncate TSO transfers to IP_MAXPACKET, and make
884 * sure that we send equal size transfers down the
885 * stack (rather than big-small-big-small-...).
886 */
887 len = (min(len, IP_MAXPACKET) / txsegsize) * txsegsize;
888 if (len <= txsegsize) {
889 use_tso = 0;
890 }
891 } else
892 len = txsegsize;
893 flags &= ~TH_FIN;
894 sendalot = 1;
895 } else
896 use_tso = 0;
897 if (sack_rxmit) {
898 if (SEQ_LT(p->rxmit + len, tp->snd_una + so->so_snd.sb_cc))
899 flags &= ~TH_FIN;
900 }
901
902 win = sbspace(&so->so_rcv);
903
904 /*
905 * Sender silly window avoidance. If connection is idle
906 * and can send all data, a maximum segment,
907 * at least a maximum default-size segment do it,
908 * or are forced, do it; otherwise don't bother.
909 * If peer's buffer is tiny, then send
910 * when window is at least half open.
911 * If retransmitting (possibly after persist timer forced us
912 * to send into a small window), then must resend.
913 */
914 if (len) {
915 if (len >= txsegsize)
916 goto send;
917 if ((so->so_state & SS_MORETOCOME) == 0 &&
918 ((idle || tp->t_flags & TF_NODELAY) &&
919 len + off >= so->so_snd.sb_cc))
920 goto send;
921 if (tp->t_force)
922 goto send;
923 if (len >= tp->max_sndwnd / 2)
924 goto send;
925 if (SEQ_LT(tp->snd_nxt, tp->snd_max))
926 goto send;
927 if (sack_rxmit)
928 goto send;
929 }
930
931 /*
932 * Compare available window to amount of window known to peer
933 * (as advertised window less next expected input). If the
934 * difference is at least twice the size of the largest segment
935 * we expect to receive (i.e. two segments) or at least 50% of
936 * the maximum possible window, then want to send a window update
937 * to peer.
938 */
939 if (win > 0) {
940 /*
941 * "adv" is the amount we can increase the window,
942 * taking into account that we are limited by
943 * TCP_MAXWIN << tp->rcv_scale.
944 */
945 long adv = min(win, (long)TCP_MAXWIN << tp->rcv_scale) -
946 (tp->rcv_adv - tp->rcv_nxt);
947
948 if (adv >= (long) (2 * rxsegsize))
949 goto send;
950 if (2 * adv >= (long) so->so_rcv.sb_hiwat)
951 goto send;
952 }
953
954 /*
955 * Send if we owe peer an ACK.
956 */
957 if (tp->t_flags & TF_ACKNOW)
958 goto send;
959 if (flags & (TH_SYN|TH_FIN|TH_RST))
960 goto send;
961 if (SEQ_GT(tp->snd_up, tp->snd_una))
962 goto send;
963 /*
964 * In SACK, it is possible for tcp_output to fail to send a segment
965 * after the retransmission timer has been turned off. Make sure
966 * that the retransmission timer is set.
967 */
968 if (TCP_SACK_ENABLED(tp) && SEQ_GT(tp->snd_max, tp->snd_una) &&
969 !TCP_TIMER_ISARMED(tp, TCPT_REXMT) &&
970 !TCP_TIMER_ISARMED(tp, TCPT_PERSIST)) {
971 TCP_TIMER_ARM(tp, TCPT_REXMT, tp->t_rxtcur);
972 goto just_return;
973 }
974
975 /*
976 * TCP window updates are not reliable, rather a polling protocol
977 * using ``persist'' packets is used to insure receipt of window
978 * updates. The three ``states'' for the output side are:
979 * idle not doing retransmits or persists
980 * persisting to move a small or zero window
981 * (re)transmitting and thereby not persisting
982 *
983 * tp->t_timer[TCPT_PERSIST]
984 * is set when we are in persist state.
985 * tp->t_force
986 * is set when we are called to send a persist packet.
987 * tp->t_timer[TCPT_REXMT]
988 * is set when we are retransmitting
989 * The output side is idle when both timers are zero.
990 *
991 * If send window is too small, there is data to transmit, and no
992 * retransmit or persist is pending, then go to persist state.
993 * If nothing happens soon, send when timer expires:
994 * if window is nonzero, transmit what we can,
995 * otherwise force out a byte.
996 */
997 if (so->so_snd.sb_cc && TCP_TIMER_ISARMED(tp, TCPT_REXMT) == 0 &&
998 TCP_TIMER_ISARMED(tp, TCPT_PERSIST) == 0) {
999 tp->t_rxtshift = 0;
1000 tcp_setpersist(tp);
1001 }
1002
1003 /*
1004 * No reason to send a segment, just return.
1005 */
1006 just_return:
1007 TCP_REASS_UNLOCK(tp);
1008 return (0);
1009
1010 send:
1011 /*
1012 * Before ESTABLISHED, force sending of initial options
1013 * unless TCP set not to do any options.
1014 * NOTE: we assume that the IP/TCP header plus TCP options
1015 * always fit in a single mbuf, leaving room for a maximum
1016 * link header, i.e.
1017 * max_linkhdr + sizeof (struct tcpiphdr) + optlen <= MCLBYTES
1018 */
1019 optlen = 0;
1020 switch (af) {
1021 #ifdef INET
1022 case AF_INET:
1023 iphdrlen = sizeof(struct ip) + sizeof(struct tcphdr);
1024 break;
1025 #endif
1026 #ifdef INET6
1027 case AF_INET6:
1028 iphdrlen = sizeof(struct ip6_hdr) + sizeof(struct tcphdr);
1029 break;
1030 #endif
1031 default: /*pacify gcc*/
1032 iphdrlen = 0;
1033 break;
1034 }
1035 hdrlen = iphdrlen;
1036 if (flags & TH_SYN) {
1037 struct rtentry *rt;
1038
1039 rt = NULL;
1040 #ifdef INET
1041 if (tp->t_inpcb)
1042 rt = in_pcbrtentry(tp->t_inpcb);
1043 #endif
1044 #ifdef INET6
1045 if (tp->t_in6pcb)
1046 rt = in6_pcbrtentry(tp->t_in6pcb);
1047 #endif
1048
1049 tp->snd_nxt = tp->iss;
1050 tp->t_ourmss = tcp_mss_to_advertise(rt != NULL ?
1051 rt->rt_ifp : NULL, af);
1052 if ((tp->t_flags & TF_NOOPT) == 0) {
1053 opt[0] = TCPOPT_MAXSEG;
1054 opt[1] = 4;
1055 opt[2] = (tp->t_ourmss >> 8) & 0xff;
1056 opt[3] = tp->t_ourmss & 0xff;
1057 optlen = 4;
1058
1059 if ((tp->t_flags & TF_REQ_SCALE) &&
1060 ((flags & TH_ACK) == 0 ||
1061 (tp->t_flags & TF_RCVD_SCALE))) {
1062 *((u_int32_t *) (opt + optlen)) = htonl(
1063 TCPOPT_NOP << 24 |
1064 TCPOPT_WINDOW << 16 |
1065 TCPOLEN_WINDOW << 8 |
1066 tp->request_r_scale);
1067 optlen += 4;
1068 }
1069 if (tcp_do_sack) {
1070 u_int8_t *cp = (u_int8_t *)(opt + optlen);
1071
1072 cp[0] = TCPOPT_SACK_PERMITTED;
1073 cp[1] = 2;
1074 cp[2] = TCPOPT_NOP;
1075 cp[3] = TCPOPT_NOP;
1076 optlen += 4;
1077 }
1078 }
1079 }
1080
1081 /*
1082 * Send a timestamp and echo-reply if this is a SYN and our side
1083 * wants to use timestamps (TF_REQ_TSTMP is set) or both our side
1084 * and our peer have sent timestamps in our SYN's.
1085 */
1086 if ((tp->t_flags & (TF_REQ_TSTMP|TF_NOOPT)) == TF_REQ_TSTMP &&
1087 (flags & TH_RST) == 0 &&
1088 ((flags & (TH_SYN|TH_ACK)) == TH_SYN ||
1089 (tp->t_flags & TF_RCVD_TSTMP))) {
1090 u_int32_t *lp = (u_int32_t *)(opt + optlen);
1091
1092 /* Form timestamp option as shown in appendix A of RFC 1323. */
1093 *lp++ = htonl(TCPOPT_TSTAMP_HDR);
1094 *lp++ = htonl(TCP_TIMESTAMP(tp));
1095 *lp = htonl(tp->ts_recent);
1096 optlen += TCPOLEN_TSTAMP_APPA;
1097 }
1098
1099 /*
1100 * Tack on the SACK block if it is necessary.
1101 */
1102 if (sack_numblks) {
1103 int sack_len;
1104 u_char *bp = (u_char *)(opt + optlen);
1105 u_int32_t *lp = (u_int32_t *)(bp + 4);
1106 struct ipqent *tiqe;
1107
1108 sack_len = sack_numblks * 8 + 2;
1109 bp[0] = TCPOPT_NOP;
1110 bp[1] = TCPOPT_NOP;
1111 bp[2] = TCPOPT_SACK;
1112 bp[3] = sack_len;
1113 if ((tp->rcv_sack_flags & TCPSACK_HAVED) != 0) {
1114 sack_numblks--;
1115 *lp++ = htonl(tp->rcv_dsack_block.left);
1116 *lp++ = htonl(tp->rcv_dsack_block.right);
1117 tp->rcv_sack_flags &= ~TCPSACK_HAVED;
1118 }
1119 for (tiqe = TAILQ_FIRST(&tp->timeq);
1120 sack_numblks > 0; tiqe = TAILQ_NEXT(tiqe, ipqe_timeq)) {
1121 KASSERT(tiqe != NULL);
1122 sack_numblks--;
1123 *lp++ = htonl(tiqe->ipqe_seq);
1124 *lp++ = htonl(tiqe->ipqe_seq + tiqe->ipqe_len +
1125 ((tiqe->ipqe_flags & TH_FIN) != 0 ? 1 : 0));
1126 }
1127 optlen += sack_len + 2;
1128 }
1129 TCP_REASS_UNLOCK(tp);
1130
1131 #ifdef TCP_SIGNATURE
1132 #if defined(INET6) && defined(FAST_IPSEC)
1133 if (tp->t_family == AF_INET)
1134 #endif
1135 if (tp->t_flags & TF_SIGNATURE) {
1136 u_char *bp;
1137 /*
1138 * Initialize TCP-MD5 option (RFC2385)
1139 */
1140 bp = (u_char *)opt + optlen;
1141 *bp++ = TCPOPT_SIGNATURE;
1142 *bp++ = TCPOLEN_SIGNATURE;
1143 sigoff = optlen + 2;
1144 bzero(bp, TCP_SIGLEN);
1145 bp += TCP_SIGLEN;
1146 optlen += TCPOLEN_SIGNATURE;
1147 /*
1148 * Terminate options list and maintain 32-bit alignment.
1149 */
1150 *bp++ = TCPOPT_NOP;
1151 *bp++ = TCPOPT_EOL;
1152 optlen += 2;
1153 }
1154 #endif /* TCP_SIGNATURE */
1155
1156 hdrlen += optlen;
1157
1158 #ifdef DIAGNOSTIC
1159 if (!use_tso && len > txsegsize)
1160 panic("tcp data to be sent is larger than segment");
1161 else if (use_tso && len > IP_MAXPACKET)
1162 panic("tcp data to be sent is larger than max TSO size");
1163 if (max_linkhdr + hdrlen > MCLBYTES)
1164 panic("tcphdr too big");
1165 #endif
1166
1167 /*
1168 * Grab a header mbuf, attaching a copy of data to
1169 * be transmitted, and initialize the header from
1170 * the template for sends on this connection.
1171 */
1172 if (len) {
1173 error = tcp_build_datapkt(tp, so, off, len, hdrlen, &m);
1174 if (error)
1175 goto out;
1176 /*
1177 * If we're sending everything we've got, set PUSH.
1178 * (This will keep happy those implementations which only
1179 * give data to the user when a buffer fills or
1180 * a PUSH comes in.)
1181 */
1182 if (off + len == so->so_snd.sb_cc)
1183 flags |= TH_PUSH;
1184 } else {
1185 if (tp->t_flags & TF_ACKNOW)
1186 tcpstat.tcps_sndacks++;
1187 else if (flags & (TH_SYN|TH_FIN|TH_RST))
1188 tcpstat.tcps_sndctrl++;
1189 else if (SEQ_GT(tp->snd_up, tp->snd_una))
1190 tcpstat.tcps_sndurg++;
1191 else
1192 tcpstat.tcps_sndwinup++;
1193
1194 MGETHDR(m, M_DONTWAIT, MT_HEADER);
1195 if (m != NULL && max_linkhdr + hdrlen > MHLEN) {
1196 MCLGET(m, M_DONTWAIT);
1197 if ((m->m_flags & M_EXT) == 0) {
1198 m_freem(m);
1199 m = NULL;
1200 }
1201 }
1202 if (m == NULL) {
1203 error = ENOBUFS;
1204 goto out;
1205 }
1206 MCLAIM(m, &tcp_tx_mowner);
1207 m->m_data += max_linkhdr;
1208 m->m_len = hdrlen;
1209 }
1210 m->m_pkthdr.rcvif = (struct ifnet *)0;
1211 switch (af) {
1212 #ifdef INET
1213 case AF_INET:
1214 ip = mtod(m, struct ip *);
1215 #ifdef INET6
1216 ip6 = NULL;
1217 #endif
1218 th = (struct tcphdr *)(ip + 1);
1219 break;
1220 #endif
1221 #ifdef INET6
1222 case AF_INET6:
1223 ip = NULL;
1224 ip6 = mtod(m, struct ip6_hdr *);
1225 th = (struct tcphdr *)(ip6 + 1);
1226 break;
1227 #endif
1228 default: /*pacify gcc*/
1229 ip = NULL;
1230 #ifdef INET6
1231 ip6 = NULL;
1232 #endif
1233 th = NULL;
1234 break;
1235 }
1236 if (tp->t_template == 0)
1237 panic("tcp_output");
1238 if (tp->t_template->m_len < iphdrlen)
1239 panic("tcp_output");
1240 bcopy(mtod(tp->t_template, caddr_t), mtod(m, caddr_t), iphdrlen);
1241
1242 /*
1243 * If we are starting a connection, send ECN setup
1244 * SYN packet. If we are on a retransmit, we may
1245 * resend those bits a number of times as per
1246 * RFC 3168.
1247 */
1248 if (tp->t_state == TCPS_SYN_SENT && tcp_do_ecn) {
1249 if (tp->t_flags & TF_SYN_REXMT) {
1250 if (tp->t_ecn_retries--)
1251 flags |= TH_ECE|TH_CWR;
1252 } else {
1253 flags |= TH_ECE|TH_CWR;
1254 tp->t_ecn_retries = tcp_ecn_maxretries;
1255 }
1256 }
1257
1258 if (TCP_ECN_ALLOWED(tp)) {
1259 /*
1260 * If the peer has ECN, mark data packets
1261 * ECN capable. Ignore pure ack packets, retransmissions
1262 * and window probes.
1263 */
1264 if (len > 0 && SEQ_GEQ(tp->snd_nxt, tp->snd_max) &&
1265 !(tp->t_force && len == 1)) {
1266 switch (af) {
1267 #ifdef INET
1268 case AF_INET:
1269 tp->t_inpcb->inp_ip.ip_tos |= IPTOS_ECN_ECT0;
1270 break;
1271 #endif
1272 #ifdef INET6
1273 case AF_INET6:
1274 ip6->ip6_flow |= htonl(IPTOS_ECN_ECT0 << 20);
1275 break;
1276 #endif
1277 }
1278 tcpstat.tcps_ecn_ect++;
1279 }
1280
1281 /*
1282 * Reply with proper ECN notifications.
1283 */
1284 if (tp->t_flags & TF_ECN_SND_CWR) {
1285 flags |= TH_CWR;
1286 tp->t_flags &= ~TF_ECN_SND_CWR;
1287 }
1288 if (tp->t_flags & TF_ECN_SND_ECE) {
1289 flags |= TH_ECE;
1290 }
1291 }
1292
1293
1294 /*
1295 * If we are doing retransmissions, then snd_nxt will
1296 * not reflect the first unsent octet. For ACK only
1297 * packets, we do not want the sequence number of the
1298 * retransmitted packet, we want the sequence number
1299 * of the next unsent octet. So, if there is no data
1300 * (and no SYN or FIN), use snd_max instead of snd_nxt
1301 * when filling in ti_seq. But if we are in persist
1302 * state, snd_max might reflect one byte beyond the
1303 * right edge of the window, so use snd_nxt in that
1304 * case, since we know we aren't doing a retransmission.
1305 * (retransmit and persist are mutually exclusive...)
1306 */
1307 if (TCP_SACK_ENABLED(tp) && sack_rxmit) {
1308 th->th_seq = htonl(p->rxmit);
1309 p->rxmit += len;
1310 } else {
1311 if (len || (flags & (TH_SYN|TH_FIN)) ||
1312 TCP_TIMER_ISARMED(tp, TCPT_PERSIST))
1313 th->th_seq = htonl(tp->snd_nxt);
1314 else
1315 th->th_seq = htonl(tp->snd_max);
1316 }
1317 th->th_ack = htonl(tp->rcv_nxt);
1318 if (optlen) {
1319 bcopy((caddr_t)opt, (caddr_t)(th + 1), optlen);
1320 th->th_off = (sizeof (struct tcphdr) + optlen) >> 2;
1321 }
1322 th->th_flags = flags;
1323 /*
1324 * Calculate receive window. Don't shrink window,
1325 * but avoid silly window syndrome.
1326 */
1327 if (win < (long)(so->so_rcv.sb_hiwat / 4) && win < (long)rxsegsize)
1328 win = 0;
1329 if (win > (long)TCP_MAXWIN << tp->rcv_scale)
1330 win = (long)TCP_MAXWIN << tp->rcv_scale;
1331 if (win < (long)(int32_t)(tp->rcv_adv - tp->rcv_nxt))
1332 win = (long)(int32_t)(tp->rcv_adv - tp->rcv_nxt);
1333 th->th_win = htons((u_int16_t) (win>>tp->rcv_scale));
1334 if (SEQ_GT(tp->snd_up, tp->snd_nxt)) {
1335 u_int32_t urp = tp->snd_up - tp->snd_nxt;
1336 if (urp > IP_MAXPACKET)
1337 urp = IP_MAXPACKET;
1338 th->th_urp = htons((u_int16_t)urp);
1339 th->th_flags |= TH_URG;
1340 } else
1341 /*
1342 * If no urgent pointer to send, then we pull
1343 * the urgent pointer to the left edge of the send window
1344 * so that it doesn't drift into the send window on sequence
1345 * number wraparound.
1346 */
1347 tp->snd_up = tp->snd_una; /* drag it along */
1348
1349 #ifdef TCP_SIGNATURE
1350 #if defined(INET6) && defined(FAST_IPSEC)
1351 if (tp->t_family == AF_INET) /* XXX */
1352 #endif
1353 if (sigoff && (tp->t_flags & TF_SIGNATURE)) {
1354 struct secasvar *sav;
1355 u_int8_t *sigp;
1356
1357 sav = tcp_signature_getsav(m, th);
1358
1359 if (sav == NULL) {
1360 if (m)
1361 m_freem(m);
1362 return (EPERM);
1363 }
1364
1365 m->m_pkthdr.len = hdrlen + len;
1366 sigp = (caddr_t)th + sizeof(*th) + sigoff;
1367 tcp_signature(m, th, (caddr_t)th - mtod(m, caddr_t), sav, sigp);
1368
1369 key_sa_recordxfer(sav, m);
1370 #ifdef FAST_IPSEC
1371 KEY_FREESAV(&sav);
1372 #else
1373 key_freesav(sav);
1374 #endif
1375 }
1376 #endif
1377
1378 /*
1379 * Set ourselves up to be checksummed just before the packet
1380 * hits the wire.
1381 */
1382 switch (af) {
1383 #ifdef INET
1384 case AF_INET:
1385 m->m_pkthdr.csum_data = offsetof(struct tcphdr, th_sum);
1386 if (use_tso) {
1387 m->m_pkthdr.segsz = txsegsize;
1388 m->m_pkthdr.csum_flags = M_CSUM_TSOv4;
1389 } else {
1390 m->m_pkthdr.csum_flags = M_CSUM_TCPv4;
1391 if (len + optlen) {
1392 /* Fixup the pseudo-header checksum. */
1393 /* XXXJRT Not IP Jumbogram safe. */
1394 th->th_sum = in_cksum_addword(th->th_sum,
1395 htons((u_int16_t) (len + optlen)));
1396 }
1397 }
1398 break;
1399 #endif
1400 #ifdef INET6
1401 case AF_INET6:
1402 m->m_pkthdr.csum_data = offsetof(struct tcphdr, th_sum);
1403 m->m_pkthdr.csum_flags = M_CSUM_TCPv6;
1404 if (len + optlen) {
1405 /* Fixup the pseudo-header checksum. */
1406 /* XXXJRT: Not IPv6 Jumbogram safe. */
1407 th->th_sum = in_cksum_addword(th->th_sum,
1408 htons((u_int16_t) (len + optlen)));
1409 }
1410 break;
1411 #endif
1412 }
1413
1414 /*
1415 * In transmit state, time the transmission and arrange for
1416 * the retransmit. In persist state, just set snd_max.
1417 */
1418 if (tp->t_force == 0 || TCP_TIMER_ISARMED(tp, TCPT_PERSIST) == 0) {
1419 tcp_seq startseq = tp->snd_nxt;
1420
1421 /*
1422 * Advance snd_nxt over sequence space of this segment.
1423 * There are no states in which we send both a SYN and a FIN,
1424 * so we collapse the tests for these flags.
1425 */
1426 if (flags & (TH_SYN|TH_FIN))
1427 tp->snd_nxt++;
1428 if (sack_rxmit)
1429 goto timer;
1430 tp->snd_nxt += len;
1431 if (SEQ_GT(tp->snd_nxt, tp->snd_max)) {
1432 tp->snd_max = tp->snd_nxt;
1433 /*
1434 * Time this transmission if not a retransmission and
1435 * not currently timing anything.
1436 */
1437 if (tp->t_rtttime == 0) {
1438 tp->t_rtttime = tcp_now;
1439 tp->t_rtseq = startseq;
1440 tcpstat.tcps_segstimed++;
1441 }
1442 }
1443
1444 /*
1445 * Set retransmit timer if not currently set,
1446 * and not doing an ack or a keep-alive probe.
1447 * Initial value for retransmit timer is smoothed
1448 * round-trip time + 2 * round-trip time variance.
1449 * Initialize shift counter which is used for backoff
1450 * of retransmit time.
1451 */
1452 timer:
1453 if (TCP_TIMER_ISARMED(tp, TCPT_REXMT) == 0 &&
1454 ((sack_rxmit && tp->snd_nxt != tp->snd_max) ||
1455 tp->snd_nxt != tp->snd_una)) {
1456 if (TCP_TIMER_ISARMED(tp, TCPT_PERSIST)) {
1457 TCP_TIMER_DISARM(tp, TCPT_PERSIST);
1458 tp->t_rxtshift = 0;
1459 }
1460 TCP_TIMER_ARM(tp, TCPT_REXMT, tp->t_rxtcur);
1461 }
1462 } else
1463 if (SEQ_GT(tp->snd_nxt + len, tp->snd_max))
1464 tp->snd_max = tp->snd_nxt + len;
1465
1466 #ifdef TCP_DEBUG
1467 /*
1468 * Trace.
1469 */
1470 if (so->so_options & SO_DEBUG)
1471 tcp_trace(TA_OUTPUT, tp->t_state, tp, m, 0);
1472 #endif
1473
1474 /*
1475 * Fill in IP length and desired time to live and
1476 * send to IP level. There should be a better way
1477 * to handle ttl and tos; we could keep them in
1478 * the template, but need a way to checksum without them.
1479 */
1480 m->m_pkthdr.len = hdrlen + len;
1481
1482 switch (af) {
1483 #ifdef INET
1484 case AF_INET:
1485 ip->ip_len = htons(m->m_pkthdr.len);
1486 packetlen = m->m_pkthdr.len;
1487 if (tp->t_inpcb) {
1488 ip->ip_ttl = tp->t_inpcb->inp_ip.ip_ttl;
1489 ip->ip_tos = tp->t_inpcb->inp_ip.ip_tos;
1490 }
1491 #ifdef INET6
1492 else if (tp->t_in6pcb) {
1493 ip->ip_ttl = in6_selecthlim(tp->t_in6pcb, NULL); /*XXX*/
1494 ip->ip_tos = 0; /*XXX*/
1495 }
1496 #endif
1497 break;
1498 #endif
1499 #ifdef INET6
1500 case AF_INET6:
1501 packetlen = m->m_pkthdr.len;
1502 ip6->ip6_nxt = IPPROTO_TCP;
1503 if (tp->t_in6pcb) {
1504 /*
1505 * we separately set hoplimit for every segment, since
1506 * the user might want to change the value via
1507 * setsockopt. Also, desired default hop limit might
1508 * be changed via Neighbor Discovery.
1509 */
1510 ip6->ip6_hlim = in6_selecthlim(tp->t_in6pcb,
1511 ro->ro_rt ? ro->ro_rt->rt_ifp : NULL);
1512 }
1513 /* ip6->ip6_flow = ??? */
1514 /* ip6_plen will be filled in ip6_output(). */
1515 break;
1516 #endif
1517 default: /*pacify gcc*/
1518 packetlen = 0;
1519 break;
1520 }
1521
1522 switch (af) {
1523 #ifdef INET
1524 case AF_INET:
1525 {
1526 struct mbuf *opts;
1527
1528 if (tp->t_inpcb)
1529 opts = tp->t_inpcb->inp_options;
1530 else
1531 opts = NULL;
1532 error = ip_output(m, opts, ro,
1533 (tp->t_mtudisc ? IP_MTUDISC : 0) |
1534 (so->so_options & SO_DONTROUTE),
1535 (struct ip_moptions *)0, so);
1536 break;
1537 }
1538 #endif
1539 #ifdef INET6
1540 case AF_INET6:
1541 {
1542 struct ip6_pktopts *opts;
1543
1544 if (tp->t_in6pcb)
1545 opts = tp->t_in6pcb->in6p_outputopts;
1546 else
1547 opts = NULL;
1548 error = ip6_output(m, opts, (struct route_in6 *)ro,
1549 so->so_options & SO_DONTROUTE,
1550 (struct ip6_moptions *)0, so, NULL);
1551 break;
1552 }
1553 #endif
1554 default:
1555 error = EAFNOSUPPORT;
1556 break;
1557 }
1558 if (error) {
1559 out:
1560 if (error == ENOBUFS) {
1561 tcpstat.tcps_selfquench++;
1562 #ifdef INET
1563 if (tp->t_inpcb)
1564 tcp_quench(tp->t_inpcb, 0);
1565 #endif
1566 #ifdef INET6
1567 if (tp->t_in6pcb)
1568 tcp6_quench(tp->t_in6pcb, 0);
1569 #endif
1570 error = 0;
1571 } else if ((error == EHOSTUNREACH || error == ENETDOWN) &&
1572 TCPS_HAVERCVDSYN(tp->t_state)) {
1573 tp->t_softerror = error;
1574 error = 0;
1575 }
1576
1577 /* Back out the seqence number advance. */
1578 if (sack_rxmit)
1579 p->rxmit -= len;
1580
1581 /* Restart the delayed ACK timer, if necessary. */
1582 if (tp->t_flags & TF_DELACK)
1583 TCP_RESTART_DELACK(tp);
1584
1585 return (error);
1586 }
1587
1588 if (packetlen > tp->t_pmtud_mtu_sent)
1589 tp->t_pmtud_mtu_sent = packetlen;
1590
1591 tcpstat.tcps_sndtotal++;
1592 if (tp->t_flags & TF_DELACK)
1593 tcpstat.tcps_delack++;
1594
1595 /*
1596 * Data sent (as far as we can tell).
1597 * If this advertises a larger window than any other segment,
1598 * then remember the size of the advertised window.
1599 * Any pending ACK has now been sent.
1600 */
1601 if (win > 0 && SEQ_GT(tp->rcv_nxt+win, tp->rcv_adv))
1602 tp->rcv_adv = tp->rcv_nxt + win;
1603 tp->last_ack_sent = tp->rcv_nxt;
1604 tp->t_flags &= ~TF_ACKNOW;
1605 TCP_CLEAR_DELACK(tp);
1606 #ifdef DIAGNOSTIC
1607 if (maxburst < 0)
1608 printf("tcp_output: maxburst exceeded by %d\n", -maxburst);
1609 #endif
1610 if (sendalot && (!tcp_do_newreno || --maxburst))
1611 goto again;
1612 return (0);
1613 }
1614
1615 void
1616 tcp_setpersist(struct tcpcb *tp)
1617 {
1618 int t = ((tp->t_srtt >> 2) + tp->t_rttvar) >> (1 + 2);
1619 int nticks;
1620
1621 if (TCP_TIMER_ISARMED(tp, TCPT_REXMT))
1622 panic("tcp_output REXMT");
1623 /*
1624 * Start/restart persistance timer.
1625 */
1626 if (t < tp->t_rttmin)
1627 t = tp->t_rttmin;
1628 TCPT_RANGESET(nticks, t * tcp_backoff[tp->t_rxtshift],
1629 TCPTV_PERSMIN, TCPTV_PERSMAX);
1630 TCP_TIMER_ARM(tp, TCPT_PERSIST, nticks);
1631 if (tp->t_rxtshift < TCP_MAXRXTSHIFT)
1632 tp->t_rxtshift++;
1633 }
1634
1635 #if defined(INET)
1636 /*
1637 * tcp4_segment: handle M_CSUM_TSOv4 by software.
1638 *
1639 * => always consume m.
1640 * => call output_func with output_arg for each segments.
1641 */
1642
1643 int
1644 tcp4_segment(struct mbuf *m, int (*output_func)(void *, struct mbuf *),
1645 void *output_arg)
1646 {
1647 int mss;
1648 int iphlen;
1649 int thlen;
1650 int hlen;
1651 int len;
1652 struct ip *iph;
1653 struct tcphdr *th;
1654 uint16_t ipid;
1655 uint32_t tcpseq;
1656 struct mbuf *hdr = NULL;
1657 struct mbuf *t;
1658 int error = 0;
1659
1660 KASSERT((m->m_flags & M_PKTHDR) != 0);
1661 KASSERT((m->m_pkthdr.csum_flags & M_CSUM_TSOv4) != 0);
1662
1663 m->m_pkthdr.csum_flags = 0;
1664
1665 len = m->m_pkthdr.len;
1666 KASSERT(len >= sizeof(*iph) + sizeof(*th));
1667
1668 if (m->m_len < sizeof(*iph)) {
1669 m = m_pullup(m, sizeof(*iph));
1670 if (m == NULL) {
1671 error = ENOMEM;
1672 goto quit;
1673 }
1674 }
1675 iph = mtod(m, struct ip *);
1676 iphlen = iph->ip_hl * 4;
1677 KASSERT(iph->ip_v == IPVERSION);
1678 KASSERT(iphlen >= sizeof(*iph));
1679 KASSERT(iph->ip_p == IPPROTO_TCP);
1680 ipid = ntohs(iph->ip_id);
1681
1682 hlen = iphlen + sizeof(*th);
1683 if (m->m_len < hlen) {
1684 m = m_pullup(m, hlen);
1685 if (m == NULL) {
1686 error = ENOMEM;
1687 goto quit;
1688 }
1689 }
1690 th = (void *)(mtod(m, char *) + iphlen);
1691 tcpseq = ntohl(th->th_seq);
1692 thlen = th->th_off * 4;
1693 hlen = iphlen + thlen;
1694
1695 mss = m->m_pkthdr.segsz;
1696 KASSERT(mss != 0);
1697 KASSERT(len > hlen);
1698
1699 t = m_split(m, hlen, M_NOWAIT);
1700 if (t == NULL) {
1701 error = ENOMEM;
1702 goto quit;
1703 }
1704 hdr = m;
1705 m = t;
1706 len -= hlen;
1707 KASSERT(len % mss == 0);
1708 while (len > 0) {
1709 struct mbuf *n;
1710
1711 n = m_dup(hdr, 0, hlen, M_NOWAIT);
1712 if (n == NULL) {
1713 error = ENOMEM;
1714 goto quit;
1715 }
1716 KASSERT(n->m_len == hlen); /* XXX */
1717
1718 t = m_split(m, mss, M_NOWAIT);
1719 if (t == NULL) {
1720 m_freem(n);
1721 error = ENOMEM;
1722 goto quit;
1723 }
1724 m_cat(n, m);
1725 m = t;
1726
1727 KASSERT(n->m_len >= hlen); /* XXX */
1728
1729 n->m_pkthdr.len = hlen + mss;
1730 iph = mtod(n, struct ip *);
1731 KASSERT(iph->ip_v == IPVERSION);
1732 iph->ip_len = htons(n->m_pkthdr.len);
1733 iph->ip_id = htons(ipid);
1734 th = (void *)(mtod(n, char *) + iphlen);
1735 th->th_seq = htonl(tcpseq);
1736 iph->ip_sum = 0;
1737 iph->ip_sum = in_cksum(n, iphlen);
1738 th->th_sum = 0;
1739 th->th_sum = in4_cksum(n, IPPROTO_TCP, iphlen, thlen + mss);
1740
1741 error = (*output_func)(output_arg, n);
1742 if (error) {
1743 goto quit;
1744 }
1745
1746 tcpseq += mss;
1747 ipid++;
1748 len -= mss;
1749 }
1750
1751 quit:
1752 if (hdr != NULL) {
1753 m_freem(hdr);
1754 }
1755 if (m != NULL) {
1756 m_freem(m);
1757 }
1758
1759 return error;
1760 }
1761 #endif /* defined(INET) */
1762