tcp_output.c revision 1.41 1 /* $NetBSD: tcp_output.c,v 1.41 1998/07/17 22:52:01 thorpej Exp $ */
2
3 /*-
4 * Copyright (c) 1997, 1998 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Jason R. Thorpe and Kevin M. Lahey of the Numerical Aerospace Simulation
9 * Facility, NASA Ames Research Center.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the NetBSD
22 * Foundation, Inc. and its contributors.
23 * 4. Neither the name of The NetBSD Foundation nor the names of its
24 * contributors may be used to endorse or promote products derived
25 * from this software without specific prior written permission.
26 *
27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 * POSSIBILITY OF SUCH DAMAGE.
38 */
39
40 /*
41 * Copyright (c) 1982, 1986, 1988, 1990, 1993, 1995
42 * The Regents of the University of California. All rights reserved.
43 *
44 * Redistribution and use in source and binary forms, with or without
45 * modification, are permitted provided that the following conditions
46 * are met:
47 * 1. Redistributions of source code must retain the above copyright
48 * notice, this list of conditions and the following disclaimer.
49 * 2. Redistributions in binary form must reproduce the above copyright
50 * notice, this list of conditions and the following disclaimer in the
51 * documentation and/or other materials provided with the distribution.
52 * 3. All advertising materials mentioning features or use of this software
53 * must display the following acknowledgement:
54 * This product includes software developed by the University of
55 * California, Berkeley and its contributors.
56 * 4. Neither the name of the University nor the names of its contributors
57 * may be used to endorse or promote products derived from this software
58 * without specific prior written permission.
59 *
60 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
61 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
62 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
63 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
64 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
65 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
66 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
67 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
68 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
69 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
70 * SUCH DAMAGE.
71 *
72 * @(#)tcp_output.c 8.4 (Berkeley) 5/24/95
73 */
74
75 #include <sys/param.h>
76 #include <sys/systm.h>
77 #include <sys/malloc.h>
78 #include <sys/mbuf.h>
79 #include <sys/protosw.h>
80 #include <sys/socket.h>
81 #include <sys/socketvar.h>
82 #include <sys/errno.h>
83
84 #include <net/if.h>
85 #include <net/route.h>
86
87 #include <netinet/in.h>
88 #include <netinet/in_systm.h>
89 #include <netinet/ip.h>
90 #include <netinet/in_pcb.h>
91 #include <netinet/ip_var.h>
92 #include <netinet/tcp.h>
93 #define TCPOUTFLAGS
94 #include <netinet/tcp_fsm.h>
95 #include <netinet/tcp_seq.h>
96 #include <netinet/tcp_timer.h>
97 #include <netinet/tcp_var.h>
98 #include <netinet/tcpip.h>
99 #include <netinet/tcp_debug.h>
100
101 #ifdef notyet
102 extern struct mbuf *m_copypack();
103 #endif
104
105 #define MAX_TCPOPTLEN 32 /* max # bytes that go in options */
106
107 /*
108 * Knob to enable Congestion Window Monitoring, and control the
109 * the burst size it allows. Default burst is 4 packets, per
110 * the Internet draft.
111 */
112 int tcp_cwm = 0;
113 int tcp_cwm_burstsize = 4;
114
115 static __inline void tcp_segsize __P((struct tcpcb *, int *, int *));
116 static __inline void
117 tcp_segsize(tp, txsegsizep, rxsegsizep)
118 struct tcpcb *tp;
119 int *txsegsizep, *rxsegsizep;
120 {
121 struct inpcb *inp = tp->t_inpcb;
122 struct rtentry *rt;
123 struct ifnet *ifp;
124 int size;
125
126 if ((rt = in_pcbrtentry(inp)) == NULL) {
127 size = tcp_mssdflt;
128 goto out;
129 }
130
131 ifp = rt->rt_ifp;
132
133 if (rt->rt_rmx.rmx_mtu != 0)
134 size = rt->rt_rmx.rmx_mtu - sizeof(struct tcpiphdr);
135 else if (ip_mtudisc || in_localaddr(inp->inp_faddr) ||
136 ifp->if_flags & IFF_LOOPBACK)
137 size = ifp->if_mtu - sizeof(struct tcpiphdr);
138 else
139 size = tcp_mssdflt;
140 size -= (tcp_optlen(tp) + ip_optlen(tp->t_inpcb));
141
142 out:
143 *txsegsizep = min(tp->t_peermss, size);
144 *rxsegsizep = min(tp->t_ourmss, size);
145
146 if (*txsegsizep != tp->t_segsz) {
147 /*
148 * If the new segment size is larger, we don't want to
149 * mess up the congestion window, but if it is smaller
150 * we'll have to reduce the congestion window to ensure
151 * that we don't get into trouble with initial windows
152 * and the rest. In any case, if the segment size
153 * has changed, chances are the path has, too, and
154 * our congestion window will be different.
155 */
156 if (*txsegsizep < tp->t_segsz) {
157 tp->snd_cwnd = max((tp->snd_cwnd / tp->t_segsz)
158 * *txsegsizep, *txsegsizep);
159 tp->snd_ssthresh = max((tp->snd_ssthresh / tp->t_segsz)
160 * *txsegsizep, *txsegsizep);
161 }
162 tp->t_segsz = *txsegsizep;
163 }
164 }
165
166 /*
167 * Tcp output routine: figure out what should be sent and send it.
168 */
169 int
170 tcp_output(tp)
171 register struct tcpcb *tp;
172 {
173 register struct socket *so = tp->t_inpcb->inp_socket;
174 register long len, win;
175 int off, flags, error;
176 register struct mbuf *m;
177 register struct tcpiphdr *ti;
178 u_char opt[MAX_TCPOPTLEN];
179 unsigned optlen, hdrlen;
180 int idle, sendalot, txsegsize, rxsegsize;
181
182 tcp_segsize(tp, &txsegsize, &rxsegsize);
183
184 idle = (tp->snd_max == tp->snd_una);
185
186 /*
187 * Restart Window computation. From draft-floyd-incr-init-win-03:
188 *
189 * Optionally, a TCP MAY set the restart window to the
190 * minimum of the value used for the initial window and
191 * the current value of cwnd (in other words, using a
192 * larger value for the restart window should never increase
193 * the size of cwnd).
194 */
195 if (tcp_cwm) {
196 /*
197 * Hughes/Touch/Heidemann Congestion Window Monitoring.
198 * Count the number of packets currently pending
199 * acknowledgement, and limit our congestion window
200 * to a pre-determined allowed burst size plus that count.
201 * This prevents bursting once all pending packets have
202 * been acknowledged (i.e. transmission is idle).
203 */
204 tp->snd_cwnd = min(tp->snd_cwnd,
205 (tcp_cwm_burstsize * txsegsize) +
206 (tp->snd_nxt - tp->snd_una));
207 } else {
208 if (idle && tp->t_idle >= tp->t_rxtcur) {
209 /*
210 * We have been idle for "a while" and no acks are
211 * expected to clock out any data we send --
212 * slow start to get ack "clock" running again.
213 */
214 tp->snd_cwnd = min(tp->snd_cwnd,
215 TCP_INITIAL_WINDOW(tcp_init_win, txsegsize));
216 }
217 }
218
219 again:
220 /*
221 * Determine length of data that should be transmitted, and
222 * flags that should be used. If there is some data or critical
223 * controls (SYN, RST) to send, then transmit; otherwise,
224 * investigate further.
225 */
226 sendalot = 0;
227 off = tp->snd_nxt - tp->snd_una;
228 win = min(tp->snd_wnd, tp->snd_cwnd);
229
230 flags = tcp_outflags[tp->t_state];
231 /*
232 * If in persist timeout with window of 0, send 1 byte.
233 * Otherwise, if window is small but nonzero
234 * and timer expired, we will send what we can
235 * and go to transmit state.
236 */
237 if (tp->t_force) {
238 if (win == 0) {
239 /*
240 * If we still have some data to send, then
241 * clear the FIN bit. Usually this would
242 * happen below when it realizes that we
243 * aren't sending all the data. However,
244 * if we have exactly 1 byte of unset data,
245 * then it won't clear the FIN bit below,
246 * and if we are in persist state, we wind
247 * up sending the packet without recording
248 * that we sent the FIN bit.
249 *
250 * We can't just blindly clear the FIN bit,
251 * because if we don't have any more data
252 * to send then the probe will be the FIN
253 * itself.
254 */
255 if (off < so->so_snd.sb_cc)
256 flags &= ~TH_FIN;
257 win = 1;
258 } else {
259 TCP_TIMER_DISARM(tp, TCPT_PERSIST);
260 tp->t_rxtshift = 0;
261 }
262 }
263
264 if (win < so->so_snd.sb_cc) {
265 len = win - off;
266 flags &= ~TH_FIN;
267 } else
268 len = so->so_snd.sb_cc - off;
269
270 if (len < 0) {
271 /*
272 * If FIN has been sent but not acked,
273 * but we haven't been called to retransmit,
274 * len will be -1. Otherwise, window shrank
275 * after we sent into it. If window shrank to 0,
276 * cancel pending retransmit, pull snd_nxt back
277 * to (closed) window, and set the persist timer
278 * if it isn't already going. If the window didn't
279 * close completely, just wait for an ACK.
280 */
281 len = 0;
282 if (win == 0) {
283 TCP_TIMER_DISARM(tp, TCPT_REXMT);
284 tp->t_rxtshift = 0;
285 tp->snd_nxt = tp->snd_una;
286 if (TCP_TIMER_ISARMED(tp, TCPT_PERSIST) == 0)
287 tcp_setpersist(tp);
288 }
289 }
290 if (len > txsegsize) {
291 len = txsegsize;
292 flags &= ~TH_FIN;
293 sendalot = 1;
294 }
295
296 win = sbspace(&so->so_rcv);
297
298 /*
299 * Sender silly window avoidance. If connection is idle
300 * and can send all data, a maximum segment,
301 * at least a maximum default-size segment do it,
302 * or are forced, do it; otherwise don't bother.
303 * If peer's buffer is tiny, then send
304 * when window is at least half open.
305 * If retransmitting (possibly after persist timer forced us
306 * to send into a small window), then must resend.
307 */
308 if (len) {
309 if (len == txsegsize)
310 goto send;
311 if ((idle || tp->t_flags & TF_NODELAY) &&
312 len + off >= so->so_snd.sb_cc)
313 goto send;
314 if (tp->t_force)
315 goto send;
316 if (len >= tp->max_sndwnd / 2)
317 goto send;
318 if (SEQ_LT(tp->snd_nxt, tp->snd_max))
319 goto send;
320 }
321
322 /*
323 * Compare available window to amount of window known to peer
324 * (as advertised window less next expected input). If the
325 * difference is at least twice the size of the largest segment
326 * we expect to receive (i.e. two segments) or at least 50% of
327 * the maximum possible window, then want to send a window update
328 * to peer.
329 */
330 if (win > 0) {
331 /*
332 * "adv" is the amount we can increase the window,
333 * taking into account that we are limited by
334 * TCP_MAXWIN << tp->rcv_scale.
335 */
336 long adv = min(win, (long)TCP_MAXWIN << tp->rcv_scale) -
337 (tp->rcv_adv - tp->rcv_nxt);
338
339 if (adv >= (long) (2 * rxsegsize))
340 goto send;
341 if (2 * adv >= (long) so->so_rcv.sb_hiwat)
342 goto send;
343 }
344
345 /*
346 * Send if we owe peer an ACK.
347 */
348 if (tp->t_flags & TF_ACKNOW)
349 goto send;
350 if (flags & (TH_SYN|TH_RST))
351 goto send;
352 if (SEQ_GT(tp->snd_up, tp->snd_una))
353 goto send;
354 /*
355 * If our state indicates that FIN should be sent
356 * and we have not yet done so, or we're retransmitting the FIN,
357 * then we need to send.
358 */
359 if (flags & TH_FIN &&
360 ((tp->t_flags & TF_SENTFIN) == 0 || tp->snd_nxt == tp->snd_una))
361 goto send;
362
363 /*
364 * TCP window updates are not reliable, rather a polling protocol
365 * using ``persist'' packets is used to insure receipt of window
366 * updates. The three ``states'' for the output side are:
367 * idle not doing retransmits or persists
368 * persisting to move a small or zero window
369 * (re)transmitting and thereby not persisting
370 *
371 * tp->t_timer[TCPT_PERSIST]
372 * is set when we are in persist state.
373 * tp->t_force
374 * is set when we are called to send a persist packet.
375 * tp->t_timer[TCPT_REXMT]
376 * is set when we are retransmitting
377 * The output side is idle when both timers are zero.
378 *
379 * If send window is too small, there is data to transmit, and no
380 * retransmit or persist is pending, then go to persist state.
381 * If nothing happens soon, send when timer expires:
382 * if window is nonzero, transmit what we can,
383 * otherwise force out a byte.
384 */
385 if (so->so_snd.sb_cc && TCP_TIMER_ISARMED(tp, TCPT_REXMT) == 0 &&
386 TCP_TIMER_ISARMED(tp, TCPT_PERSIST) == 0) {
387 tp->t_rxtshift = 0;
388 tcp_setpersist(tp);
389 }
390
391 /*
392 * No reason to send a segment, just return.
393 */
394 return (0);
395
396 send:
397 /*
398 * Before ESTABLISHED, force sending of initial options
399 * unless TCP set not to do any options.
400 * NOTE: we assume that the IP/TCP header plus TCP options
401 * always fit in a single mbuf, leaving room for a maximum
402 * link header, i.e.
403 * max_linkhdr + sizeof (struct tcpiphdr) + optlen <= MHLEN
404 */
405 optlen = 0;
406 hdrlen = sizeof (struct tcpiphdr);
407 if (flags & TH_SYN) {
408 struct rtentry *rt = in_pcbrtentry(tp->t_inpcb);
409
410 tp->snd_nxt = tp->iss;
411 tp->t_ourmss = tcp_mss_to_advertise(rt != NULL ?
412 rt->rt_ifp : NULL);
413 if ((tp->t_flags & TF_NOOPT) == 0) {
414 opt[0] = TCPOPT_MAXSEG;
415 opt[1] = 4;
416 opt[2] = (tp->t_ourmss >> 8) & 0xff;
417 opt[3] = tp->t_ourmss & 0xff;
418 optlen = 4;
419
420 if ((tp->t_flags & TF_REQ_SCALE) &&
421 ((flags & TH_ACK) == 0 ||
422 (tp->t_flags & TF_RCVD_SCALE))) {
423 *((u_int32_t *) (opt + optlen)) = htonl(
424 TCPOPT_NOP << 24 |
425 TCPOPT_WINDOW << 16 |
426 TCPOLEN_WINDOW << 8 |
427 tp->request_r_scale);
428 optlen += 4;
429 }
430 }
431 }
432
433 /*
434 * Send a timestamp and echo-reply if this is a SYN and our side
435 * wants to use timestamps (TF_REQ_TSTMP is set) or both our side
436 * and our peer have sent timestamps in our SYN's.
437 */
438 if ((tp->t_flags & (TF_REQ_TSTMP|TF_NOOPT)) == TF_REQ_TSTMP &&
439 (flags & TH_RST) == 0 &&
440 ((flags & (TH_SYN|TH_ACK)) == TH_SYN ||
441 (tp->t_flags & TF_RCVD_TSTMP))) {
442 u_int32_t *lp = (u_int32_t *)(opt + optlen);
443
444 /* Form timestamp option as shown in appendix A of RFC 1323. */
445 *lp++ = htonl(TCPOPT_TSTAMP_HDR);
446 *lp++ = htonl(tcp_now);
447 *lp = htonl(tp->ts_recent);
448 optlen += TCPOLEN_TSTAMP_APPA;
449 }
450
451 hdrlen += optlen;
452
453 #ifdef DIAGNOSTIC
454 if (len > txsegsize)
455 panic("tcp data to be sent is larger than segment");
456 if (max_linkhdr + hdrlen > MHLEN)
457 panic("tcphdr too big");
458 #endif
459
460 /*
461 * Grab a header mbuf, attaching a copy of data to
462 * be transmitted, and initialize the header from
463 * the template for sends on this connection.
464 */
465 if (len) {
466 if (tp->t_force && len == 1)
467 tcpstat.tcps_sndprobe++;
468 else if (SEQ_LT(tp->snd_nxt, tp->snd_max)) {
469 tcpstat.tcps_sndrexmitpack++;
470 tcpstat.tcps_sndrexmitbyte += len;
471 } else {
472 tcpstat.tcps_sndpack++;
473 tcpstat.tcps_sndbyte += len;
474 }
475 #ifdef notyet
476 if ((m = m_copypack(so->so_snd.sb_mb, off,
477 (int)len, max_linkhdr + hdrlen)) == 0) {
478 error = ENOBUFS;
479 goto out;
480 }
481 /*
482 * m_copypack left space for our hdr; use it.
483 */
484 m->m_len += hdrlen;
485 m->m_data -= hdrlen;
486 #else
487 MGETHDR(m, M_DONTWAIT, MT_HEADER);
488 if (m == NULL) {
489 error = ENOBUFS;
490 goto out;
491 }
492 m->m_data += max_linkhdr;
493 m->m_len = hdrlen;
494 if (len <= MHLEN - hdrlen - max_linkhdr) {
495 m_copydata(so->so_snd.sb_mb, off, (int) len,
496 mtod(m, caddr_t) + hdrlen);
497 m->m_len += len;
498 } else {
499 m->m_next = m_copy(so->so_snd.sb_mb, off, (int) len);
500 if (m->m_next == 0) {
501 m_freem(m);
502 error = ENOBUFS;
503 goto out;
504 }
505 }
506 #endif
507 /*
508 * If we're sending everything we've got, set PUSH.
509 * (This will keep happy those implementations which only
510 * give data to the user when a buffer fills or
511 * a PUSH comes in.)
512 */
513 if (off + len == so->so_snd.sb_cc)
514 flags |= TH_PUSH;
515 } else {
516 if (tp->t_flags & TF_ACKNOW)
517 tcpstat.tcps_sndacks++;
518 else if (flags & (TH_SYN|TH_FIN|TH_RST))
519 tcpstat.tcps_sndctrl++;
520 else if (SEQ_GT(tp->snd_up, tp->snd_una))
521 tcpstat.tcps_sndurg++;
522 else
523 tcpstat.tcps_sndwinup++;
524
525 MGETHDR(m, M_DONTWAIT, MT_HEADER);
526 if (m == NULL) {
527 error = ENOBUFS;
528 goto out;
529 }
530 m->m_data += max_linkhdr;
531 m->m_len = hdrlen;
532 }
533 m->m_pkthdr.rcvif = (struct ifnet *)0;
534 ti = mtod(m, struct tcpiphdr *);
535 if (tp->t_template == 0)
536 panic("tcp_output");
537 bcopy((caddr_t)tp->t_template, (caddr_t)ti, sizeof (struct tcpiphdr));
538
539 /*
540 * Fill in fields, remembering maximum advertised
541 * window for use in delaying messages about window sizes.
542 * If resending a FIN, be sure not to use a new sequence number.
543 */
544 if (flags & TH_FIN && tp->t_flags & TF_SENTFIN &&
545 tp->snd_nxt == tp->snd_max)
546 tp->snd_nxt--;
547 /*
548 * If we are doing retransmissions, then snd_nxt will
549 * not reflect the first unsent octet. For ACK only
550 * packets, we do not want the sequence number of the
551 * retransmitted packet, we want the sequence number
552 * of the next unsent octet. So, if there is no data
553 * (and no SYN or FIN), use snd_max instead of snd_nxt
554 * when filling in ti_seq. But if we are in persist
555 * state, snd_max might reflect one byte beyond the
556 * right edge of the window, so use snd_nxt in that
557 * case, since we know we aren't doing a retransmission.
558 * (retransmit and persist are mutually exclusive...)
559 */
560 if (len || (flags & (TH_SYN|TH_FIN)) ||
561 TCP_TIMER_ISARMED(tp, TCPT_PERSIST))
562 ti->ti_seq = htonl(tp->snd_nxt);
563 else
564 ti->ti_seq = htonl(tp->snd_max);
565 ti->ti_ack = htonl(tp->rcv_nxt);
566 if (optlen) {
567 bcopy((caddr_t)opt, (caddr_t)(ti + 1), optlen);
568 ti->ti_off = (sizeof (struct tcphdr) + optlen) >> 2;
569 }
570 ti->ti_flags = flags;
571 /*
572 * Calculate receive window. Don't shrink window,
573 * but avoid silly window syndrome.
574 */
575 if (win < (long)(so->so_rcv.sb_hiwat / 4) && win < (long)rxsegsize)
576 win = 0;
577 if (win > (long)TCP_MAXWIN << tp->rcv_scale)
578 win = (long)TCP_MAXWIN << tp->rcv_scale;
579 if (win < (long)(tp->rcv_adv - tp->rcv_nxt))
580 win = (long)(tp->rcv_adv - tp->rcv_nxt);
581 ti->ti_win = htons((u_int16_t) (win>>tp->rcv_scale));
582 if (SEQ_GT(tp->snd_up, tp->snd_nxt)) {
583 u_int32_t urp = tp->snd_up - tp->snd_nxt;
584 if (urp > IP_MAXPACKET)
585 urp = IP_MAXPACKET;
586 ti->ti_urp = htons((u_int16_t)urp);
587 ti->ti_flags |= TH_URG;
588 } else
589 /*
590 * If no urgent pointer to send, then we pull
591 * the urgent pointer to the left edge of the send window
592 * so that it doesn't drift into the send window on sequence
593 * number wraparound.
594 */
595 tp->snd_up = tp->snd_una; /* drag it along */
596
597 /*
598 * Put TCP length in extended header, and then
599 * checksum extended header and data.
600 */
601 if (len + optlen)
602 ti->ti_len = htons((u_int16_t)(sizeof (struct tcphdr) +
603 optlen + len));
604 ti->ti_sum = in_cksum(m, (int)(hdrlen + len));
605
606 /*
607 * In transmit state, time the transmission and arrange for
608 * the retransmit. In persist state, just set snd_max.
609 */
610 if (tp->t_force == 0 || TCP_TIMER_ISARMED(tp, TCPT_PERSIST) == 0) {
611 tcp_seq startseq = tp->snd_nxt;
612
613 /*
614 * Advance snd_nxt over sequence space of this segment.
615 */
616 if (flags & (TH_SYN|TH_FIN)) {
617 if (flags & TH_SYN)
618 tp->snd_nxt++;
619 if (flags & TH_FIN) {
620 tp->snd_nxt++;
621 tp->t_flags |= TF_SENTFIN;
622 }
623 }
624 tp->snd_nxt += len;
625 if (SEQ_GT(tp->snd_nxt, tp->snd_max)) {
626 tp->snd_max = tp->snd_nxt;
627 /*
628 * Time this transmission if not a retransmission and
629 * not currently timing anything.
630 */
631 if (tp->t_rtt == 0) {
632 tp->t_rtt = 1;
633 tp->t_rtseq = startseq;
634 tcpstat.tcps_segstimed++;
635 }
636 }
637
638 /*
639 * Set retransmit timer if not currently set,
640 * and not doing an ack or a keep-alive probe.
641 * Initial value for retransmit timer is smoothed
642 * round-trip time + 2 * round-trip time variance.
643 * Initialize shift counter which is used for backoff
644 * of retransmit time.
645 */
646 if (TCP_TIMER_ISARMED(tp, TCPT_REXMT) == 0 &&
647 tp->snd_nxt != tp->snd_una) {
648 TCP_TIMER_ARM(tp, TCPT_REXMT, tp->t_rxtcur);
649 if (TCP_TIMER_ISARMED(tp, TCPT_PERSIST)) {
650 TCP_TIMER_DISARM(tp, TCPT_PERSIST);
651 tp->t_rxtshift = 0;
652 }
653 }
654 } else
655 if (SEQ_GT(tp->snd_nxt + len, tp->snd_max))
656 tp->snd_max = tp->snd_nxt + len;
657
658 /*
659 * Trace.
660 */
661 if (so->so_options & SO_DEBUG)
662 tcp_trace(TA_OUTPUT, tp->t_state, tp, ti, 0);
663
664 /*
665 * Fill in IP length and desired time to live and
666 * send to IP level. There should be a better way
667 * to handle ttl and tos; we could keep them in
668 * the template, but need a way to checksum without them.
669 */
670 m->m_pkthdr.len = hdrlen + len;
671 {
672 struct rtentry *rt;
673
674 ((struct ip *)ti)->ip_len = m->m_pkthdr.len;
675 ((struct ip *)ti)->ip_ttl = tp->t_inpcb->inp_ip.ip_ttl; /* XXX */
676 ((struct ip *)ti)->ip_tos = tp->t_inpcb->inp_ip.ip_tos; /* XXX */
677
678 if (ip_mtudisc && (rt = in_pcbrtentry(tp->t_inpcb)) != 0 &&
679 (rt->rt_rmx.rmx_locks & RTV_MTU) == 0)
680 ((struct ip *)ti)->ip_off |= IP_DF;
681
682 #if BSD >= 43
683 error = ip_output(m, tp->t_inpcb->inp_options, &tp->t_inpcb->inp_route,
684 so->so_options & SO_DONTROUTE, 0);
685 #else
686 error = ip_output(m, (struct mbuf *)0, &tp->t_inpcb->inp_route,
687 so->so_options & SO_DONTROUTE);
688 #endif
689 }
690 if (error) {
691 out:
692 if (error == ENOBUFS) {
693 tcp_quench(tp->t_inpcb, 0);
694 return (0);
695 }
696 if ((error == EHOSTUNREACH || error == ENETDOWN)
697 && TCPS_HAVERCVDSYN(tp->t_state)) {
698 tp->t_softerror = error;
699 return (0);
700 }
701 return (error);
702 }
703 tcpstat.tcps_sndtotal++;
704 if (tp->t_flags & TF_DELACK)
705 tcpstat.tcps_delack++;
706
707 /*
708 * Data sent (as far as we can tell).
709 * If this advertises a larger window than any other segment,
710 * then remember the size of the advertised window.
711 * Any pending ACK has now been sent.
712 */
713 if (win > 0 && SEQ_GT(tp->rcv_nxt+win, tp->rcv_adv))
714 tp->rcv_adv = tp->rcv_nxt + win;
715 tp->last_ack_sent = tp->rcv_nxt;
716 tp->t_flags &= ~TF_ACKNOW;
717 TCP_CLEAR_DELACK(tp);
718 if (sendalot)
719 goto again;
720 return (0);
721 }
722
723 void
724 tcp_setpersist(tp)
725 register struct tcpcb *tp;
726 {
727 register int t = ((tp->t_srtt >> 2) + tp->t_rttvar) >> (1 + 2);
728 int nticks;
729
730 if (TCP_TIMER_ISARMED(tp, TCPT_REXMT))
731 panic("tcp_output REXMT");
732 /*
733 * Start/restart persistance timer.
734 */
735 if (t < tp->t_rttmin)
736 t = tp->t_rttmin;
737 TCPT_RANGESET(nticks, t * tcp_backoff[tp->t_rxtshift],
738 TCPTV_PERSMIN, TCPTV_PERSMAX);
739 TCP_TIMER_ARM(tp, TCPT_PERSIST, nticks);
740 if (tp->t_rxtshift < TCP_MAXRXTSHIFT)
741 tp->t_rxtshift++;
742 }
743