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