tcp_output.c revision 1.8 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1982, 1986, 1988, 1990 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd *
33 1.2 cgd * from: @(#)tcp_output.c 7.22 (Berkeley) 8/31/90
34 1.8 mycroft * $Id: tcp_output.c,v 1.8 1994/04/12 18:09:47 mycroft Exp $
35 1.1 cgd */
36 1.1 cgd
37 1.4 mycroft #include <sys/param.h>
38 1.4 mycroft #include <sys/systm.h>
39 1.4 mycroft #include <sys/malloc.h>
40 1.4 mycroft #include <sys/mbuf.h>
41 1.4 mycroft #include <sys/protosw.h>
42 1.4 mycroft #include <sys/socket.h>
43 1.4 mycroft #include <sys/socketvar.h>
44 1.4 mycroft #include <sys/errno.h>
45 1.1 cgd
46 1.4 mycroft #include <net/route.h>
47 1.1 cgd
48 1.4 mycroft #include <netinet/in.h>
49 1.4 mycroft #include <netinet/in_systm.h>
50 1.4 mycroft #include <netinet/ip.h>
51 1.4 mycroft #include <netinet/in_pcb.h>
52 1.4 mycroft #include <netinet/ip_var.h>
53 1.4 mycroft #include <netinet/tcp.h>
54 1.1 cgd #define TCPOUTFLAGS
55 1.4 mycroft #include <netinet/tcp_fsm.h>
56 1.4 mycroft #include <netinet/tcp_seq.h>
57 1.4 mycroft #include <netinet/tcp_timer.h>
58 1.4 mycroft #include <netinet/tcp_var.h>
59 1.4 mycroft #include <netinet/tcpip.h>
60 1.4 mycroft #include <netinet/tcp_debug.h>
61 1.1 cgd
62 1.1 cgd #ifdef notyet
63 1.1 cgd extern struct mbuf *m_copypack();
64 1.1 cgd #endif
65 1.1 cgd
66 1.1 cgd /*
67 1.1 cgd * Initial options.
68 1.1 cgd */
69 1.1 cgd u_char tcp_initopt[4] = { TCPOPT_MAXSEG, 4, 0x0, 0x0, };
70 1.1 cgd
71 1.1 cgd /*
72 1.1 cgd * Tcp output routine: figure out what should be sent and send it.
73 1.1 cgd */
74 1.6 mycroft int
75 1.1 cgd tcp_output(tp)
76 1.1 cgd register struct tcpcb *tp;
77 1.1 cgd {
78 1.1 cgd register struct socket *so = tp->t_inpcb->inp_socket;
79 1.1 cgd register long len, win;
80 1.1 cgd int off, flags, error;
81 1.1 cgd register struct mbuf *m;
82 1.1 cgd register struct tcpiphdr *ti;
83 1.1 cgd u_char *opt;
84 1.1 cgd unsigned optlen, hdrlen;
85 1.1 cgd int idle, sendalot;
86 1.1 cgd
87 1.1 cgd /*
88 1.1 cgd * Determine length of data that should be transmitted,
89 1.1 cgd * and flags that will be used.
90 1.1 cgd * If there is some data or critical controls (SYN, RST)
91 1.1 cgd * to send, then transmit; otherwise, investigate further.
92 1.1 cgd */
93 1.1 cgd idle = (tp->snd_max == tp->snd_una);
94 1.1 cgd if (idle && tp->t_idle >= tp->t_rxtcur)
95 1.1 cgd /*
96 1.1 cgd * We have been idle for "a while" and no acks are
97 1.1 cgd * expected to clock out any data we send --
98 1.1 cgd * slow start to get ack "clock" running again.
99 1.1 cgd */
100 1.1 cgd tp->snd_cwnd = tp->t_maxseg;
101 1.1 cgd again:
102 1.1 cgd sendalot = 0;
103 1.1 cgd off = tp->snd_nxt - tp->snd_una;
104 1.1 cgd win = min(tp->snd_wnd, tp->snd_cwnd);
105 1.1 cgd
106 1.1 cgd /*
107 1.1 cgd * If in persist timeout with window of 0, send 1 byte.
108 1.1 cgd * Otherwise, if window is small but nonzero
109 1.1 cgd * and timer expired, we will send what we can
110 1.1 cgd * and go to transmit state.
111 1.1 cgd */
112 1.1 cgd if (tp->t_force) {
113 1.1 cgd if (win == 0)
114 1.1 cgd win = 1;
115 1.1 cgd else {
116 1.1 cgd tp->t_timer[TCPT_PERSIST] = 0;
117 1.1 cgd tp->t_rxtshift = 0;
118 1.1 cgd }
119 1.1 cgd }
120 1.1 cgd
121 1.1 cgd flags = tcp_outflags[tp->t_state];
122 1.1 cgd len = min(so->so_snd.sb_cc, win) - off;
123 1.1 cgd
124 1.1 cgd if (len < 0) {
125 1.1 cgd /*
126 1.1 cgd * If FIN has been sent but not acked,
127 1.1 cgd * but we haven't been called to retransmit,
128 1.1 cgd * len will be -1. Otherwise, window shrank
129 1.1 cgd * after we sent into it. If window shrank to 0,
130 1.1 cgd * cancel pending retransmit and pull snd_nxt
131 1.1 cgd * back to (closed) window. We will enter persist
132 1.1 cgd * state below. If the window didn't close completely,
133 1.1 cgd * just wait for an ACK.
134 1.1 cgd */
135 1.1 cgd len = 0;
136 1.1 cgd if (win == 0) {
137 1.1 cgd tp->t_timer[TCPT_REXMT] = 0;
138 1.1 cgd tp->snd_nxt = tp->snd_una;
139 1.1 cgd }
140 1.1 cgd }
141 1.1 cgd if (len > tp->t_maxseg) {
142 1.1 cgd len = tp->t_maxseg;
143 1.1 cgd sendalot = 1;
144 1.1 cgd }
145 1.1 cgd if (SEQ_LT(tp->snd_nxt + len, tp->snd_una + so->so_snd.sb_cc))
146 1.1 cgd flags &= ~TH_FIN;
147 1.1 cgd
148 1.1 cgd win = sbspace(&so->so_rcv);
149 1.1 cgd
150 1.1 cgd /*
151 1.1 cgd * Sender silly window avoidance. If connection is idle
152 1.1 cgd * and can send all data, a maximum segment,
153 1.1 cgd * at least a maximum default-size segment do it,
154 1.1 cgd * or are forced, do it; otherwise don't bother.
155 1.1 cgd * If peer's buffer is tiny, then send
156 1.1 cgd * when window is at least half open.
157 1.1 cgd * If retransmitting (possibly after persist timer forced us
158 1.1 cgd * to send into a small window), then must resend.
159 1.1 cgd */
160 1.1 cgd if (len) {
161 1.1 cgd if (len == tp->t_maxseg)
162 1.1 cgd goto send;
163 1.1 cgd if ((idle || tp->t_flags & TF_NODELAY) &&
164 1.1 cgd len + off >= so->so_snd.sb_cc)
165 1.1 cgd goto send;
166 1.1 cgd if (tp->t_force)
167 1.1 cgd goto send;
168 1.1 cgd if (len >= tp->max_sndwnd / 2)
169 1.1 cgd goto send;
170 1.1 cgd if (SEQ_LT(tp->snd_nxt, tp->snd_max))
171 1.1 cgd goto send;
172 1.1 cgd }
173 1.1 cgd
174 1.1 cgd /*
175 1.1 cgd * Compare available window to amount of window
176 1.1 cgd * known to peer (as advertised window less
177 1.1 cgd * next expected input). If the difference is at least two
178 1.1 cgd * max size segments, or at least 50% of the maximum possible
179 1.1 cgd * window, then want to send a window update to peer.
180 1.1 cgd */
181 1.1 cgd if (win > 0) {
182 1.1 cgd long adv = win - (tp->rcv_adv - tp->rcv_nxt);
183 1.1 cgd
184 1.1 cgd if (adv >= (long) (2 * tp->t_maxseg))
185 1.1 cgd goto send;
186 1.1 cgd if (2 * adv >= (long) so->so_rcv.sb_hiwat)
187 1.1 cgd goto send;
188 1.1 cgd }
189 1.1 cgd
190 1.1 cgd /*
191 1.1 cgd * Send if we owe peer an ACK.
192 1.1 cgd */
193 1.1 cgd if (tp->t_flags & TF_ACKNOW)
194 1.1 cgd goto send;
195 1.1 cgd if (flags & (TH_SYN|TH_RST))
196 1.1 cgd goto send;
197 1.1 cgd if (SEQ_GT(tp->snd_up, tp->snd_una))
198 1.1 cgd goto send;
199 1.1 cgd /*
200 1.1 cgd * If our state indicates that FIN should be sent
201 1.1 cgd * and we have not yet done so, or we're retransmitting the FIN,
202 1.1 cgd * then we need to send.
203 1.1 cgd */
204 1.1 cgd if (flags & TH_FIN &&
205 1.1 cgd ((tp->t_flags & TF_SENTFIN) == 0 || tp->snd_nxt == tp->snd_una))
206 1.1 cgd goto send;
207 1.1 cgd
208 1.1 cgd /*
209 1.1 cgd * TCP window updates are not reliable, rather a polling protocol
210 1.1 cgd * using ``persist'' packets is used to insure receipt of window
211 1.1 cgd * updates. The three ``states'' for the output side are:
212 1.1 cgd * idle not doing retransmits or persists
213 1.1 cgd * persisting to move a small or zero window
214 1.1 cgd * (re)transmitting and thereby not persisting
215 1.1 cgd *
216 1.1 cgd * tp->t_timer[TCPT_PERSIST]
217 1.1 cgd * is set when we are in persist state.
218 1.1 cgd * tp->t_force
219 1.1 cgd * is set when we are called to send a persist packet.
220 1.1 cgd * tp->t_timer[TCPT_REXMT]
221 1.1 cgd * is set when we are retransmitting
222 1.1 cgd * The output side is idle when both timers are zero.
223 1.1 cgd *
224 1.1 cgd * If send window is too small, there is data to transmit, and no
225 1.1 cgd * retransmit or persist is pending, then go to persist state.
226 1.1 cgd * If nothing happens soon, send when timer expires:
227 1.1 cgd * if window is nonzero, transmit what we can,
228 1.1 cgd * otherwise force out a byte.
229 1.1 cgd */
230 1.1 cgd if (so->so_snd.sb_cc && tp->t_timer[TCPT_REXMT] == 0 &&
231 1.1 cgd tp->t_timer[TCPT_PERSIST] == 0) {
232 1.1 cgd tp->t_rxtshift = 0;
233 1.1 cgd tcp_setpersist(tp);
234 1.1 cgd }
235 1.1 cgd
236 1.1 cgd /*
237 1.1 cgd * No reason to send a segment, just return.
238 1.1 cgd */
239 1.1 cgd return (0);
240 1.1 cgd
241 1.1 cgd send:
242 1.1 cgd /*
243 1.1 cgd * Before ESTABLISHED, force sending of initial options
244 1.1 cgd * unless TCP set not to do any options.
245 1.1 cgd * NOTE: we assume that the IP/TCP header plus TCP options
246 1.1 cgd * always fit in a single mbuf, leaving room for a maximum
247 1.1 cgd * link header, i.e.
248 1.1 cgd * max_linkhdr + sizeof (struct tcpiphdr) + optlen <= MHLEN
249 1.1 cgd */
250 1.1 cgd optlen = 0;
251 1.1 cgd hdrlen = sizeof (struct tcpiphdr);
252 1.1 cgd if (flags & TH_SYN && (tp->t_flags & TF_NOOPT) == 0) {
253 1.1 cgd opt = tcp_initopt;
254 1.1 cgd optlen = sizeof (tcp_initopt);
255 1.1 cgd hdrlen += sizeof (tcp_initopt);
256 1.1 cgd *(u_short *)(opt + 2) = htons((u_short) tcp_mss(tp, 0));
257 1.1 cgd #ifdef DIAGNOSTIC
258 1.1 cgd if (max_linkhdr + hdrlen > MHLEN)
259 1.1 cgd panic("tcphdr too big");
260 1.1 cgd #endif
261 1.1 cgd }
262 1.1 cgd
263 1.1 cgd /*
264 1.1 cgd * Grab a header mbuf, attaching a copy of data to
265 1.1 cgd * be transmitted, and initialize the header from
266 1.1 cgd * the template for sends on this connection.
267 1.1 cgd */
268 1.1 cgd if (len) {
269 1.1 cgd if (tp->t_force && len == 1)
270 1.1 cgd tcpstat.tcps_sndprobe++;
271 1.1 cgd else if (SEQ_LT(tp->snd_nxt, tp->snd_max)) {
272 1.1 cgd tcpstat.tcps_sndrexmitpack++;
273 1.1 cgd tcpstat.tcps_sndrexmitbyte += len;
274 1.1 cgd } else {
275 1.1 cgd tcpstat.tcps_sndpack++;
276 1.1 cgd tcpstat.tcps_sndbyte += len;
277 1.1 cgd }
278 1.1 cgd #ifdef notyet
279 1.1 cgd if ((m = m_copypack(so->so_snd.sb_mb, off,
280 1.1 cgd (int)len, max_linkhdr + hdrlen)) == 0) {
281 1.1 cgd error = ENOBUFS;
282 1.1 cgd goto out;
283 1.1 cgd }
284 1.1 cgd /*
285 1.1 cgd * m_copypack left space for our hdr; use it.
286 1.1 cgd */
287 1.1 cgd m->m_len += hdrlen;
288 1.1 cgd m->m_data -= hdrlen;
289 1.1 cgd #else
290 1.1 cgd MGETHDR(m, M_DONTWAIT, MT_HEADER);
291 1.1 cgd if (m == NULL) {
292 1.1 cgd error = ENOBUFS;
293 1.1 cgd goto out;
294 1.1 cgd }
295 1.1 cgd m->m_data += max_linkhdr;
296 1.1 cgd m->m_len = hdrlen;
297 1.1 cgd if (len <= MHLEN - hdrlen - max_linkhdr) {
298 1.1 cgd m_copydata(so->so_snd.sb_mb, off, (int) len,
299 1.1 cgd mtod(m, caddr_t) + hdrlen);
300 1.1 cgd m->m_len += len;
301 1.1 cgd } else {
302 1.1 cgd m->m_next = m_copy(so->so_snd.sb_mb, off, (int) len);
303 1.1 cgd if (m->m_next == 0)
304 1.1 cgd len = 0;
305 1.1 cgd }
306 1.1 cgd #endif
307 1.1 cgd /*
308 1.1 cgd * If we're sending everything we've got, set PUSH.
309 1.1 cgd * (This will keep happy those implementations which only
310 1.1 cgd * give data to the user when a buffer fills or
311 1.1 cgd * a PUSH comes in.)
312 1.1 cgd */
313 1.1 cgd if (off + len == so->so_snd.sb_cc)
314 1.1 cgd flags |= TH_PUSH;
315 1.1 cgd } else {
316 1.1 cgd if (tp->t_flags & TF_ACKNOW)
317 1.1 cgd tcpstat.tcps_sndacks++;
318 1.1 cgd else if (flags & (TH_SYN|TH_FIN|TH_RST))
319 1.1 cgd tcpstat.tcps_sndctrl++;
320 1.1 cgd else if (SEQ_GT(tp->snd_up, tp->snd_una))
321 1.1 cgd tcpstat.tcps_sndurg++;
322 1.1 cgd else
323 1.1 cgd tcpstat.tcps_sndwinup++;
324 1.1 cgd
325 1.1 cgd MGETHDR(m, M_DONTWAIT, MT_HEADER);
326 1.1 cgd if (m == NULL) {
327 1.1 cgd error = ENOBUFS;
328 1.1 cgd goto out;
329 1.1 cgd }
330 1.1 cgd m->m_data += max_linkhdr;
331 1.1 cgd m->m_len = hdrlen;
332 1.1 cgd }
333 1.1 cgd m->m_pkthdr.rcvif = (struct ifnet *)0;
334 1.1 cgd ti = mtod(m, struct tcpiphdr *);
335 1.1 cgd if (tp->t_template == 0)
336 1.1 cgd panic("tcp_output");
337 1.1 cgd bcopy((caddr_t)tp->t_template, (caddr_t)ti, sizeof (struct tcpiphdr));
338 1.1 cgd
339 1.1 cgd /*
340 1.1 cgd * Fill in fields, remembering maximum advertised
341 1.1 cgd * window for use in delaying messages about window sizes.
342 1.1 cgd * If resending a FIN, be sure not to use a new sequence number.
343 1.1 cgd */
344 1.5 mycroft if (flags & TH_FIN && tp->t_flags & TF_SENTFIN &&
345 1.1 cgd tp->snd_nxt == tp->snd_max)
346 1.1 cgd tp->snd_nxt--;
347 1.8 mycroft if (len || (flags & (TH_SYN|TH_FIN)) || tp->t_timer[TCPT_PERSIST])
348 1.8 mycroft ti->ti_seq = htonl(tp->snd_nxt);
349 1.8 mycroft else
350 1.8 mycroft ti->ti_seq = htonl(tp->snd_max);
351 1.1 cgd ti->ti_ack = htonl(tp->rcv_nxt);
352 1.1 cgd if (optlen) {
353 1.1 cgd bcopy((caddr_t)opt, (caddr_t)(ti + 1), optlen);
354 1.1 cgd ti->ti_off = (sizeof (struct tcphdr) + optlen) >> 2;
355 1.1 cgd }
356 1.1 cgd ti->ti_flags = flags;
357 1.1 cgd /*
358 1.1 cgd * Calculate receive window. Don't shrink window,
359 1.1 cgd * but avoid silly window syndrome.
360 1.1 cgd */
361 1.1 cgd if (win < (long)(so->so_rcv.sb_hiwat / 4) && win < (long)tp->t_maxseg)
362 1.1 cgd win = 0;
363 1.1 cgd if (win > TCP_MAXWIN)
364 1.1 cgd win = TCP_MAXWIN;
365 1.1 cgd if (win < (long)(tp->rcv_adv - tp->rcv_nxt))
366 1.1 cgd win = (long)(tp->rcv_adv - tp->rcv_nxt);
367 1.1 cgd ti->ti_win = htons((u_short)win);
368 1.1 cgd if (SEQ_GT(tp->snd_up, tp->snd_nxt)) {
369 1.1 cgd ti->ti_urp = htons((u_short)(tp->snd_up - tp->snd_nxt));
370 1.1 cgd ti->ti_flags |= TH_URG;
371 1.1 cgd } else
372 1.1 cgd /*
373 1.1 cgd * If no urgent pointer to send, then we pull
374 1.1 cgd * the urgent pointer to the left edge of the send window
375 1.1 cgd * so that it doesn't drift into the send window on sequence
376 1.1 cgd * number wraparound.
377 1.1 cgd */
378 1.1 cgd tp->snd_up = tp->snd_una; /* drag it along */
379 1.1 cgd
380 1.1 cgd /*
381 1.1 cgd * Put TCP length in extended header, and then
382 1.1 cgd * checksum extended header and data.
383 1.1 cgd */
384 1.1 cgd if (len + optlen)
385 1.1 cgd ti->ti_len = htons((u_short)(sizeof (struct tcphdr) +
386 1.1 cgd optlen + len));
387 1.1 cgd ti->ti_sum = in_cksum(m, (int)(hdrlen + len));
388 1.1 cgd
389 1.1 cgd /*
390 1.1 cgd * In transmit state, time the transmission and arrange for
391 1.1 cgd * the retransmit. In persist state, just set snd_max.
392 1.1 cgd */
393 1.1 cgd if (tp->t_force == 0 || tp->t_timer[TCPT_PERSIST] == 0) {
394 1.1 cgd tcp_seq startseq = tp->snd_nxt;
395 1.1 cgd
396 1.1 cgd /*
397 1.1 cgd * Advance snd_nxt over sequence space of this segment.
398 1.1 cgd */
399 1.1 cgd if (flags & (TH_SYN|TH_FIN)) {
400 1.1 cgd if (flags & TH_SYN)
401 1.1 cgd tp->snd_nxt++;
402 1.1 cgd if (flags & TH_FIN) {
403 1.1 cgd tp->snd_nxt++;
404 1.1 cgd tp->t_flags |= TF_SENTFIN;
405 1.1 cgd }
406 1.1 cgd }
407 1.1 cgd tp->snd_nxt += len;
408 1.1 cgd if (SEQ_GT(tp->snd_nxt, tp->snd_max)) {
409 1.1 cgd tp->snd_max = tp->snd_nxt;
410 1.1 cgd /*
411 1.1 cgd * Time this transmission if not a retransmission and
412 1.1 cgd * not currently timing anything.
413 1.1 cgd */
414 1.1 cgd if (tp->t_rtt == 0) {
415 1.1 cgd tp->t_rtt = 1;
416 1.1 cgd tp->t_rtseq = startseq;
417 1.1 cgd tcpstat.tcps_segstimed++;
418 1.1 cgd }
419 1.1 cgd }
420 1.1 cgd
421 1.1 cgd /*
422 1.1 cgd * Set retransmit timer if not currently set,
423 1.1 cgd * and not doing an ack or a keep-alive probe.
424 1.1 cgd * Initial value for retransmit timer is smoothed
425 1.1 cgd * round-trip time + 2 * round-trip time variance.
426 1.1 cgd * Initialize shift counter which is used for backoff
427 1.1 cgd * of retransmit time.
428 1.1 cgd */
429 1.1 cgd if (tp->t_timer[TCPT_REXMT] == 0 &&
430 1.1 cgd tp->snd_nxt != tp->snd_una) {
431 1.1 cgd tp->t_timer[TCPT_REXMT] = tp->t_rxtcur;
432 1.1 cgd if (tp->t_timer[TCPT_PERSIST]) {
433 1.1 cgd tp->t_timer[TCPT_PERSIST] = 0;
434 1.1 cgd tp->t_rxtshift = 0;
435 1.1 cgd }
436 1.1 cgd }
437 1.1 cgd } else
438 1.1 cgd if (SEQ_GT(tp->snd_nxt + len, tp->snd_max))
439 1.1 cgd tp->snd_max = tp->snd_nxt + len;
440 1.1 cgd
441 1.1 cgd /*
442 1.1 cgd * Trace.
443 1.1 cgd */
444 1.1 cgd if (so->so_options & SO_DEBUG)
445 1.1 cgd tcp_trace(TA_OUTPUT, tp->t_state, tp, ti, 0);
446 1.1 cgd
447 1.1 cgd /*
448 1.1 cgd * Fill in IP length and desired time to live and
449 1.1 cgd * send to IP level. There should be a better way
450 1.1 cgd * to handle ttl and tos; we could keep them in
451 1.1 cgd * the template, but need a way to checksum without them.
452 1.1 cgd */
453 1.1 cgd m->m_pkthdr.len = hdrlen + len;
454 1.1 cgd ((struct ip *)ti)->ip_len = m->m_pkthdr.len;
455 1.1 cgd ((struct ip *)ti)->ip_ttl = tp->t_inpcb->inp_ip.ip_ttl; /* XXX */
456 1.1 cgd ((struct ip *)ti)->ip_tos = tp->t_inpcb->inp_ip.ip_tos; /* XXX */
457 1.1 cgd #if BSD >= 43
458 1.1 cgd error = ip_output(m, tp->t_inpcb->inp_options, &tp->t_inpcb->inp_route,
459 1.7 mycroft so->so_options & SO_DONTROUTE, NULL);
460 1.1 cgd #else
461 1.5 mycroft error = ip_output(m, (struct mbuf *)0, &tp->t_inpcb->inp_route,
462 1.1 cgd so->so_options & SO_DONTROUTE);
463 1.1 cgd #endif
464 1.1 cgd if (error) {
465 1.1 cgd out:
466 1.1 cgd if (error == ENOBUFS) {
467 1.6 mycroft tcp_quench(tp->t_inpcb, 0);
468 1.1 cgd return (0);
469 1.1 cgd }
470 1.1 cgd if ((error == EHOSTUNREACH || error == ENETDOWN)
471 1.1 cgd && TCPS_HAVERCVDSYN(tp->t_state)) {
472 1.1 cgd tp->t_softerror = error;
473 1.1 cgd return (0);
474 1.1 cgd }
475 1.1 cgd return (error);
476 1.1 cgd }
477 1.1 cgd tcpstat.tcps_sndtotal++;
478 1.1 cgd
479 1.1 cgd /*
480 1.1 cgd * Data sent (as far as we can tell).
481 1.1 cgd * If this advertises a larger window than any other segment,
482 1.1 cgd * then remember the size of the advertised window.
483 1.1 cgd * Any pending ACK has now been sent.
484 1.1 cgd */
485 1.1 cgd if (win > 0 && SEQ_GT(tp->rcv_nxt+win, tp->rcv_adv))
486 1.1 cgd tp->rcv_adv = tp->rcv_nxt + win;
487 1.1 cgd tp->t_flags &= ~(TF_ACKNOW|TF_DELACK);
488 1.1 cgd if (sendalot)
489 1.1 cgd goto again;
490 1.1 cgd return (0);
491 1.1 cgd }
492 1.1 cgd
493 1.6 mycroft void
494 1.1 cgd tcp_setpersist(tp)
495 1.1 cgd register struct tcpcb *tp;
496 1.1 cgd {
497 1.1 cgd register t = ((tp->t_srtt >> 2) + tp->t_rttvar) >> 1;
498 1.1 cgd
499 1.1 cgd if (tp->t_timer[TCPT_REXMT])
500 1.1 cgd panic("tcp_output REXMT");
501 1.1 cgd /*
502 1.1 cgd * Start/restart persistance timer.
503 1.1 cgd */
504 1.1 cgd TCPT_RANGESET(tp->t_timer[TCPT_PERSIST],
505 1.1 cgd t * tcp_backoff[tp->t_rxtshift],
506 1.1 cgd TCPTV_PERSMIN, TCPTV_PERSMAX);
507 1.1 cgd if (tp->t_rxtshift < TCP_MAXRXTSHIFT)
508 1.1 cgd tp->t_rxtshift++;
509 1.1 cgd }
510