block: Introduce blk_set_allow_write_beyond_eof()
[qemu.git] / slirp / tcp_input.c
blob03be56eaabfe6622f22a594c1427d69499e50e94
1 /*
2 * Copyright (c) 1982, 1986, 1988, 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
29 * @(#)tcp_input.c 8.5 (Berkeley) 4/10/94
30 * tcp_input.c,v 1.10 1994/10/13 18:36:32 wollman Exp
34 * Changes and additions relating to SLiRP
35 * Copyright (c) 1995 Danny Gasparovski.
37 * Please read the file COPYRIGHT for the
38 * terms and conditions of the copyright.
41 #include "qemu/osdep.h"
42 #include <slirp.h>
43 #include "ip_icmp.h"
45 #define TCPREXMTTHRESH 3
47 #define TCP_PAWS_IDLE (24 * 24 * 60 * 60 * PR_SLOWHZ)
49 /* for modulo comparisons of timestamps */
50 #define TSTMP_LT(a,b) ((int)((a)-(b)) < 0)
51 #define TSTMP_GEQ(a,b) ((int)((a)-(b)) >= 0)
54 * Insert segment ti into reassembly queue of tcp with
55 * control block tp. Return TH_FIN if reassembly now includes
56 * a segment with FIN. The macro form does the common case inline
57 * (segment is the next to be received on an established connection,
58 * and the queue is empty), avoiding linkage into and removal
59 * from the queue and repetition of various conversions.
60 * Set DELACK for segments received in order, but ack immediately
61 * when segments are out of order (so fast retransmit can work).
63 #ifdef TCP_ACK_HACK
64 #define TCP_REASS(tp, ti, m, so, flags) {\
65 if ((ti)->ti_seq == (tp)->rcv_nxt && \
66 tcpfrag_list_empty(tp) && \
67 (tp)->t_state == TCPS_ESTABLISHED) {\
68 if (ti->ti_flags & TH_PUSH) \
69 tp->t_flags |= TF_ACKNOW; \
70 else \
71 tp->t_flags |= TF_DELACK; \
72 (tp)->rcv_nxt += (ti)->ti_len; \
73 flags = (ti)->ti_flags & TH_FIN; \
74 if (so->so_emu) { \
75 if (tcp_emu((so),(m))) sbappend((so), (m)); \
76 } else \
77 sbappend((so), (m)); \
78 } else {\
79 (flags) = tcp_reass((tp), (ti), (m)); \
80 tp->t_flags |= TF_ACKNOW; \
81 } \
83 #else
84 #define TCP_REASS(tp, ti, m, so, flags) { \
85 if ((ti)->ti_seq == (tp)->rcv_nxt && \
86 tcpfrag_list_empty(tp) && \
87 (tp)->t_state == TCPS_ESTABLISHED) { \
88 tp->t_flags |= TF_DELACK; \
89 (tp)->rcv_nxt += (ti)->ti_len; \
90 flags = (ti)->ti_flags & TH_FIN; \
91 if (so->so_emu) { \
92 if (tcp_emu((so),(m))) sbappend(so, (m)); \
93 } else \
94 sbappend((so), (m)); \
95 } else { \
96 (flags) = tcp_reass((tp), (ti), (m)); \
97 tp->t_flags |= TF_ACKNOW; \
98 } \
100 #endif
101 static void tcp_dooptions(struct tcpcb *tp, u_char *cp, int cnt,
102 struct tcpiphdr *ti);
103 static void tcp_xmit_timer(register struct tcpcb *tp, int rtt);
105 static int
106 tcp_reass(register struct tcpcb *tp, register struct tcpiphdr *ti,
107 struct mbuf *m)
109 register struct tcpiphdr *q;
110 struct socket *so = tp->t_socket;
111 int flags;
114 * Call with ti==NULL after become established to
115 * force pre-ESTABLISHED data up to user socket.
117 if (ti == NULL)
118 goto present;
121 * Find a segment which begins after this one does.
123 for (q = tcpfrag_list_first(tp); !tcpfrag_list_end(q, tp);
124 q = tcpiphdr_next(q))
125 if (SEQ_GT(q->ti_seq, ti->ti_seq))
126 break;
129 * If there is a preceding segment, it may provide some of
130 * our data already. If so, drop the data from the incoming
131 * segment. If it provides all of our data, drop us.
133 if (!tcpfrag_list_end(tcpiphdr_prev(q), tp)) {
134 register int i;
135 q = tcpiphdr_prev(q);
136 /* conversion to int (in i) handles seq wraparound */
137 i = q->ti_seq + q->ti_len - ti->ti_seq;
138 if (i > 0) {
139 if (i >= ti->ti_len) {
140 m_free(m);
142 * Try to present any queued data
143 * at the left window edge to the user.
144 * This is needed after the 3-WHS
145 * completes.
147 goto present; /* ??? */
149 m_adj(m, i);
150 ti->ti_len -= i;
151 ti->ti_seq += i;
153 q = tcpiphdr_next(q);
155 ti->ti_mbuf = m;
158 * While we overlap succeeding segments trim them or,
159 * if they are completely covered, dequeue them.
161 while (!tcpfrag_list_end(q, tp)) {
162 register int i = (ti->ti_seq + ti->ti_len) - q->ti_seq;
163 if (i <= 0)
164 break;
165 if (i < q->ti_len) {
166 q->ti_seq += i;
167 q->ti_len -= i;
168 m_adj(q->ti_mbuf, i);
169 break;
171 q = tcpiphdr_next(q);
172 m = tcpiphdr_prev(q)->ti_mbuf;
173 remque(tcpiphdr2qlink(tcpiphdr_prev(q)));
174 m_free(m);
178 * Stick new segment in its place.
180 insque(tcpiphdr2qlink(ti), tcpiphdr2qlink(tcpiphdr_prev(q)));
182 present:
184 * Present data to user, advancing rcv_nxt through
185 * completed sequence space.
187 if (!TCPS_HAVEESTABLISHED(tp->t_state))
188 return (0);
189 ti = tcpfrag_list_first(tp);
190 if (tcpfrag_list_end(ti, tp) || ti->ti_seq != tp->rcv_nxt)
191 return (0);
192 if (tp->t_state == TCPS_SYN_RECEIVED && ti->ti_len)
193 return (0);
194 do {
195 tp->rcv_nxt += ti->ti_len;
196 flags = ti->ti_flags & TH_FIN;
197 remque(tcpiphdr2qlink(ti));
198 m = ti->ti_mbuf;
199 ti = tcpiphdr_next(ti);
200 if (so->so_state & SS_FCANTSENDMORE)
201 m_free(m);
202 else {
203 if (so->so_emu) {
204 if (tcp_emu(so,m)) sbappend(so, m);
205 } else
206 sbappend(so, m);
208 } while (ti != (struct tcpiphdr *)tp && ti->ti_seq == tp->rcv_nxt);
209 return (flags);
213 * TCP input routine, follows pages 65-76 of the
214 * protocol specification dated September, 1981 very closely.
216 void
217 tcp_input(struct mbuf *m, int iphlen, struct socket *inso)
219 struct ip save_ip, *ip;
220 register struct tcpiphdr *ti;
221 caddr_t optp = NULL;
222 int optlen = 0;
223 int len, tlen, off;
224 register struct tcpcb *tp = NULL;
225 register int tiflags;
226 struct socket *so = NULL;
227 int todrop, acked, ourfinisacked, needoutput = 0;
228 int iss = 0;
229 u_long tiwin;
230 int ret;
231 struct sockaddr_storage lhost, fhost;
232 struct sockaddr_in *lhost4, *fhost4;
233 struct ex_list *ex_ptr;
234 Slirp *slirp;
236 DEBUG_CALL("tcp_input");
237 DEBUG_ARGS((dfd, " m = %p iphlen = %2d inso = %p\n",
238 m, iphlen, inso));
241 * If called with m == 0, then we're continuing the connect
243 if (m == NULL) {
244 so = inso;
245 slirp = so->slirp;
247 /* Re-set a few variables */
248 tp = sototcpcb(so);
249 m = so->so_m;
250 so->so_m = NULL;
251 ti = so->so_ti;
252 tiwin = ti->ti_win;
253 tiflags = ti->ti_flags;
255 goto cont_conn;
257 slirp = m->slirp;
260 * Get IP and TCP header together in first mbuf.
261 * Note: IP leaves IP header in first mbuf.
263 ti = mtod(m, struct tcpiphdr *);
264 if (iphlen > sizeof(struct ip )) {
265 ip_stripoptions(m, (struct mbuf *)0);
266 iphlen=sizeof(struct ip );
268 /* XXX Check if too short */
272 * Save a copy of the IP header in case we want restore it
273 * for sending an ICMP error message in response.
275 ip=mtod(m, struct ip *);
276 save_ip = *ip;
277 save_ip.ip_len+= iphlen;
280 * Checksum extended TCP header and data.
282 tlen = ((struct ip *)ti)->ip_len;
283 tcpiphdr2qlink(ti)->next = tcpiphdr2qlink(ti)->prev = NULL;
284 memset(&ti->ti_i.ih_mbuf, 0 , sizeof(struct mbuf_ptr));
285 ti->ti_x1 = 0;
286 ti->ti_len = htons((uint16_t)tlen);
287 len = sizeof(struct ip ) + tlen;
288 if(cksum(m, len)) {
289 goto drop;
293 * Check that TCP offset makes sense,
294 * pull out TCP options and adjust length. XXX
296 off = ti->ti_off << 2;
297 if (off < sizeof (struct tcphdr) || off > tlen) {
298 goto drop;
300 tlen -= off;
301 ti->ti_len = tlen;
302 if (off > sizeof (struct tcphdr)) {
303 optlen = off - sizeof (struct tcphdr);
304 optp = mtod(m, caddr_t) + sizeof (struct tcpiphdr);
306 tiflags = ti->ti_flags;
309 * Convert TCP protocol specific fields to host format.
311 NTOHL(ti->ti_seq);
312 NTOHL(ti->ti_ack);
313 NTOHS(ti->ti_win);
314 NTOHS(ti->ti_urp);
317 * Drop TCP, IP headers and TCP options.
319 m->m_data += sizeof(struct tcpiphdr)+off-sizeof(struct tcphdr);
320 m->m_len -= sizeof(struct tcpiphdr)+off-sizeof(struct tcphdr);
323 * Locate pcb for segment.
325 findso:
326 lhost.ss_family = AF_INET;
327 lhost4 = (struct sockaddr_in *) &lhost;
328 lhost4->sin_addr = ti->ti_src;
329 lhost4->sin_port = ti->ti_sport;
330 fhost.ss_family = AF_INET;
331 fhost4 = (struct sockaddr_in *) &fhost;
332 fhost4->sin_addr = ti->ti_dst;
333 fhost4->sin_port = ti->ti_dport;
335 so = solookup(&slirp->tcp_last_so, &slirp->tcb, &lhost, &fhost);
338 * If the state is CLOSED (i.e., TCB does not exist) then
339 * all data in the incoming segment is discarded.
340 * If the TCB exists but is in CLOSED state, it is embryonic,
341 * but should either do a listen or a connect soon.
343 * state == CLOSED means we've done socreate() but haven't
344 * attached it to a protocol yet...
346 * XXX If a TCB does not exist, and the TH_SYN flag is
347 * the only flag set, then create a session, mark it
348 * as if it was LISTENING, and continue...
350 if (so == NULL) {
351 if (slirp->restricted) {
352 /* Any hostfwds will have an existing socket, so we only get here
353 * for non-hostfwd connections. These should be dropped, unless it
354 * happens to be a guestfwd.
356 for (ex_ptr = slirp->exec_list; ex_ptr; ex_ptr = ex_ptr->ex_next) {
357 if (ex_ptr->ex_fport == ti->ti_dport &&
358 ti->ti_dst.s_addr == ex_ptr->ex_addr.s_addr) {
359 break;
362 if (!ex_ptr) {
363 goto dropwithreset;
367 if ((tiflags & (TH_SYN|TH_FIN|TH_RST|TH_URG|TH_ACK)) != TH_SYN)
368 goto dropwithreset;
370 if ((so = socreate(slirp)) == NULL)
371 goto dropwithreset;
372 if (tcp_attach(so) < 0) {
373 free(so); /* Not sofree (if it failed, it's not insqued) */
374 goto dropwithreset;
377 sbreserve(&so->so_snd, TCP_SNDSPACE);
378 sbreserve(&so->so_rcv, TCP_RCVSPACE);
380 so->lhost.ss = lhost;
381 so->fhost.ss = fhost;
383 if ((so->so_iptos = tcp_tos(so)) == 0)
384 so->so_iptos = ((struct ip *)ti)->ip_tos;
386 tp = sototcpcb(so);
387 tp->t_state = TCPS_LISTEN;
391 * If this is a still-connecting socket, this probably
392 * a retransmit of the SYN. Whether it's a retransmit SYN
393 * or something else, we nuke it.
395 if (so->so_state & SS_ISFCONNECTING)
396 goto drop;
398 tp = sototcpcb(so);
400 /* XXX Should never fail */
401 if (tp == NULL)
402 goto dropwithreset;
403 if (tp->t_state == TCPS_CLOSED)
404 goto drop;
406 tiwin = ti->ti_win;
409 * Segment received on connection.
410 * Reset idle time and keep-alive timer.
412 tp->t_idle = 0;
413 if (SO_OPTIONS)
414 tp->t_timer[TCPT_KEEP] = TCPTV_KEEPINTVL;
415 else
416 tp->t_timer[TCPT_KEEP] = TCPTV_KEEP_IDLE;
419 * Process options if not in LISTEN state,
420 * else do it below (after getting remote address).
422 if (optp && tp->t_state != TCPS_LISTEN)
423 tcp_dooptions(tp, (u_char *)optp, optlen, ti);
426 * Header prediction: check for the two common cases
427 * of a uni-directional data xfer. If the packet has
428 * no control flags, is in-sequence, the window didn't
429 * change and we're not retransmitting, it's a
430 * candidate. If the length is zero and the ack moved
431 * forward, we're the sender side of the xfer. Just
432 * free the data acked & wake any higher level process
433 * that was blocked waiting for space. If the length
434 * is non-zero and the ack didn't move, we're the
435 * receiver side. If we're getting packets in-order
436 * (the reassembly queue is empty), add the data to
437 * the socket buffer and note that we need a delayed ack.
439 * XXX Some of these tests are not needed
440 * eg: the tiwin == tp->snd_wnd prevents many more
441 * predictions.. with no *real* advantage..
443 if (tp->t_state == TCPS_ESTABLISHED &&
444 (tiflags & (TH_SYN|TH_FIN|TH_RST|TH_URG|TH_ACK)) == TH_ACK &&
445 ti->ti_seq == tp->rcv_nxt &&
446 tiwin && tiwin == tp->snd_wnd &&
447 tp->snd_nxt == tp->snd_max) {
448 if (ti->ti_len == 0) {
449 if (SEQ_GT(ti->ti_ack, tp->snd_una) &&
450 SEQ_LEQ(ti->ti_ack, tp->snd_max) &&
451 tp->snd_cwnd >= tp->snd_wnd) {
453 * this is a pure ack for outstanding data.
455 if (tp->t_rtt &&
456 SEQ_GT(ti->ti_ack, tp->t_rtseq))
457 tcp_xmit_timer(tp, tp->t_rtt);
458 acked = ti->ti_ack - tp->snd_una;
459 sbdrop(&so->so_snd, acked);
460 tp->snd_una = ti->ti_ack;
461 m_free(m);
464 * If all outstanding data are acked, stop
465 * retransmit timer, otherwise restart timer
466 * using current (possibly backed-off) value.
467 * If process is waiting for space,
468 * wakeup/selwakeup/signal. If data
469 * are ready to send, let tcp_output
470 * decide between more output or persist.
472 if (tp->snd_una == tp->snd_max)
473 tp->t_timer[TCPT_REXMT] = 0;
474 else if (tp->t_timer[TCPT_PERSIST] == 0)
475 tp->t_timer[TCPT_REXMT] = tp->t_rxtcur;
478 * This is called because sowwakeup might have
479 * put data into so_snd. Since we don't so sowwakeup,
480 * we don't need this.. XXX???
482 if (so->so_snd.sb_cc)
483 (void) tcp_output(tp);
485 return;
487 } else if (ti->ti_ack == tp->snd_una &&
488 tcpfrag_list_empty(tp) &&
489 ti->ti_len <= sbspace(&so->so_rcv)) {
491 * this is a pure, in-sequence data packet
492 * with nothing on the reassembly queue and
493 * we have enough buffer space to take it.
495 tp->rcv_nxt += ti->ti_len;
497 * Add data to socket buffer.
499 if (so->so_emu) {
500 if (tcp_emu(so,m)) sbappend(so, m);
501 } else
502 sbappend(so, m);
505 * If this is a short packet, then ACK now - with Nagel
506 * congestion avoidance sender won't send more until
507 * he gets an ACK.
509 * It is better to not delay acks at all to maximize
510 * TCP throughput. See RFC 2581.
512 tp->t_flags |= TF_ACKNOW;
513 tcp_output(tp);
514 return;
516 } /* header prediction */
518 * Calculate amount of space in receive window,
519 * and then do TCP input processing.
520 * Receive window is amount of space in rcv queue,
521 * but not less than advertised window.
523 { int win;
524 win = sbspace(&so->so_rcv);
525 if (win < 0)
526 win = 0;
527 tp->rcv_wnd = max(win, (int)(tp->rcv_adv - tp->rcv_nxt));
530 switch (tp->t_state) {
533 * If the state is LISTEN then ignore segment if it contains an RST.
534 * If the segment contains an ACK then it is bad and send a RST.
535 * If it does not contain a SYN then it is not interesting; drop it.
536 * Don't bother responding if the destination was a broadcast.
537 * Otherwise initialize tp->rcv_nxt, and tp->irs, select an initial
538 * tp->iss, and send a segment:
539 * <SEQ=ISS><ACK=RCV_NXT><CTL=SYN,ACK>
540 * Also initialize tp->snd_nxt to tp->iss+1 and tp->snd_una to tp->iss.
541 * Fill in remote peer address fields if not previously specified.
542 * Enter SYN_RECEIVED state, and process any other fields of this
543 * segment in this state.
545 case TCPS_LISTEN: {
547 if (tiflags & TH_RST)
548 goto drop;
549 if (tiflags & TH_ACK)
550 goto dropwithreset;
551 if ((tiflags & TH_SYN) == 0)
552 goto drop;
555 * This has way too many gotos...
556 * But a bit of spaghetti code never hurt anybody :)
560 * If this is destined for the control address, then flag to
561 * tcp_ctl once connected, otherwise connect
563 if ((so->so_faddr.s_addr & slirp->vnetwork_mask.s_addr) ==
564 slirp->vnetwork_addr.s_addr) {
565 if (so->so_faddr.s_addr != slirp->vhost_addr.s_addr &&
566 so->so_faddr.s_addr != slirp->vnameserver_addr.s_addr) {
567 /* May be an add exec */
568 for (ex_ptr = slirp->exec_list; ex_ptr;
569 ex_ptr = ex_ptr->ex_next) {
570 if(ex_ptr->ex_fport == so->so_fport &&
571 so->so_faddr.s_addr == ex_ptr->ex_addr.s_addr) {
572 so->so_state |= SS_CTL;
573 break;
576 if (so->so_state & SS_CTL) {
577 goto cont_input;
580 /* CTL_ALIAS: Do nothing, tcp_fconnect will be called on it */
583 if (so->so_emu & EMU_NOCONNECT) {
584 so->so_emu &= ~EMU_NOCONNECT;
585 goto cont_input;
588 if ((tcp_fconnect(so, so->so_ffamily) == -1) &&
589 (errno != EINPROGRESS) && (errno != EWOULDBLOCK)
591 u_char code=ICMP_UNREACH_NET;
592 DEBUG_MISC((dfd, " tcp fconnect errno = %d-%s\n",
593 errno,strerror(errno)));
594 if(errno == ECONNREFUSED) {
595 /* ACK the SYN, send RST to refuse the connection */
596 tcp_respond(tp, ti, m, ti->ti_seq+1, (tcp_seq)0,
597 TH_RST|TH_ACK);
598 } else {
599 if(errno == EHOSTUNREACH) code=ICMP_UNREACH_HOST;
600 HTONL(ti->ti_seq); /* restore tcp header */
601 HTONL(ti->ti_ack);
602 HTONS(ti->ti_win);
603 HTONS(ti->ti_urp);
604 m->m_data -= sizeof(struct tcpiphdr)+off-sizeof(struct tcphdr);
605 m->m_len += sizeof(struct tcpiphdr)+off-sizeof(struct tcphdr);
606 *ip=save_ip;
607 icmp_error(m, ICMP_UNREACH,code, 0,strerror(errno));
609 tcp_close(tp);
610 m_free(m);
611 } else {
613 * Haven't connected yet, save the current mbuf
614 * and ti, and return
615 * XXX Some OS's don't tell us whether the connect()
616 * succeeded or not. So we must time it out.
618 so->so_m = m;
619 so->so_ti = ti;
620 tp->t_timer[TCPT_KEEP] = TCPTV_KEEP_INIT;
621 tp->t_state = TCPS_SYN_RECEIVED;
622 tcp_template(tp);
624 return;
626 cont_conn:
627 /* m==NULL
628 * Check if the connect succeeded
630 if (so->so_state & SS_NOFDREF) {
631 tp = tcp_close(tp);
632 goto dropwithreset;
634 cont_input:
635 tcp_template(tp);
637 if (optp)
638 tcp_dooptions(tp, (u_char *)optp, optlen, ti);
640 if (iss)
641 tp->iss = iss;
642 else
643 tp->iss = slirp->tcp_iss;
644 slirp->tcp_iss += TCP_ISSINCR/2;
645 tp->irs = ti->ti_seq;
646 tcp_sendseqinit(tp);
647 tcp_rcvseqinit(tp);
648 tp->t_flags |= TF_ACKNOW;
649 tp->t_state = TCPS_SYN_RECEIVED;
650 tp->t_timer[TCPT_KEEP] = TCPTV_KEEP_INIT;
651 goto trimthenstep6;
652 } /* case TCPS_LISTEN */
655 * If the state is SYN_SENT:
656 * if seg contains an ACK, but not for our SYN, drop the input.
657 * if seg contains a RST, then drop the connection.
658 * if seg does not contain SYN, then drop it.
659 * Otherwise this is an acceptable SYN segment
660 * initialize tp->rcv_nxt and tp->irs
661 * if seg contains ack then advance tp->snd_una
662 * if SYN has been acked change to ESTABLISHED else SYN_RCVD state
663 * arrange for segment to be acked (eventually)
664 * continue processing rest of data/controls, beginning with URG
666 case TCPS_SYN_SENT:
667 if ((tiflags & TH_ACK) &&
668 (SEQ_LEQ(ti->ti_ack, tp->iss) ||
669 SEQ_GT(ti->ti_ack, tp->snd_max)))
670 goto dropwithreset;
672 if (tiflags & TH_RST) {
673 if (tiflags & TH_ACK) {
674 tcp_drop(tp, 0); /* XXX Check t_softerror! */
676 goto drop;
679 if ((tiflags & TH_SYN) == 0)
680 goto drop;
681 if (tiflags & TH_ACK) {
682 tp->snd_una = ti->ti_ack;
683 if (SEQ_LT(tp->snd_nxt, tp->snd_una))
684 tp->snd_nxt = tp->snd_una;
687 tp->t_timer[TCPT_REXMT] = 0;
688 tp->irs = ti->ti_seq;
689 tcp_rcvseqinit(tp);
690 tp->t_flags |= TF_ACKNOW;
691 if (tiflags & TH_ACK && SEQ_GT(tp->snd_una, tp->iss)) {
692 soisfconnected(so);
693 tp->t_state = TCPS_ESTABLISHED;
695 (void) tcp_reass(tp, (struct tcpiphdr *)0,
696 (struct mbuf *)0);
698 * if we didn't have to retransmit the SYN,
699 * use its rtt as our initial srtt & rtt var.
701 if (tp->t_rtt)
702 tcp_xmit_timer(tp, tp->t_rtt);
703 } else
704 tp->t_state = TCPS_SYN_RECEIVED;
706 trimthenstep6:
708 * Advance ti->ti_seq to correspond to first data byte.
709 * If data, trim to stay within window,
710 * dropping FIN if necessary.
712 ti->ti_seq++;
713 if (ti->ti_len > tp->rcv_wnd) {
714 todrop = ti->ti_len - tp->rcv_wnd;
715 m_adj(m, -todrop);
716 ti->ti_len = tp->rcv_wnd;
717 tiflags &= ~TH_FIN;
719 tp->snd_wl1 = ti->ti_seq - 1;
720 tp->rcv_up = ti->ti_seq;
721 goto step6;
722 } /* switch tp->t_state */
724 * States other than LISTEN or SYN_SENT.
725 * Check that at least some bytes of segment are within
726 * receive window. If segment begins before rcv_nxt,
727 * drop leading data (and SYN); if nothing left, just ack.
729 todrop = tp->rcv_nxt - ti->ti_seq;
730 if (todrop > 0) {
731 if (tiflags & TH_SYN) {
732 tiflags &= ~TH_SYN;
733 ti->ti_seq++;
734 if (ti->ti_urp > 1)
735 ti->ti_urp--;
736 else
737 tiflags &= ~TH_URG;
738 todrop--;
741 * Following if statement from Stevens, vol. 2, p. 960.
743 if (todrop > ti->ti_len
744 || (todrop == ti->ti_len && (tiflags & TH_FIN) == 0)) {
746 * Any valid FIN must be to the left of the window.
747 * At this point the FIN must be a duplicate or out
748 * of sequence; drop it.
750 tiflags &= ~TH_FIN;
753 * Send an ACK to resynchronize and drop any data.
754 * But keep on processing for RST or ACK.
756 tp->t_flags |= TF_ACKNOW;
757 todrop = ti->ti_len;
759 m_adj(m, todrop);
760 ti->ti_seq += todrop;
761 ti->ti_len -= todrop;
762 if (ti->ti_urp > todrop)
763 ti->ti_urp -= todrop;
764 else {
765 tiflags &= ~TH_URG;
766 ti->ti_urp = 0;
770 * If new data are received on a connection after the
771 * user processes are gone, then RST the other end.
773 if ((so->so_state & SS_NOFDREF) &&
774 tp->t_state > TCPS_CLOSE_WAIT && ti->ti_len) {
775 tp = tcp_close(tp);
776 goto dropwithreset;
780 * If segment ends after window, drop trailing data
781 * (and PUSH and FIN); if nothing left, just ACK.
783 todrop = (ti->ti_seq+ti->ti_len) - (tp->rcv_nxt+tp->rcv_wnd);
784 if (todrop > 0) {
785 if (todrop >= ti->ti_len) {
787 * If a new connection request is received
788 * while in TIME_WAIT, drop the old connection
789 * and start over if the sequence numbers
790 * are above the previous ones.
792 if (tiflags & TH_SYN &&
793 tp->t_state == TCPS_TIME_WAIT &&
794 SEQ_GT(ti->ti_seq, tp->rcv_nxt)) {
795 iss = tp->rcv_nxt + TCP_ISSINCR;
796 tp = tcp_close(tp);
797 goto findso;
800 * If window is closed can only take segments at
801 * window edge, and have to drop data and PUSH from
802 * incoming segments. Continue processing, but
803 * remember to ack. Otherwise, drop segment
804 * and ack.
806 if (tp->rcv_wnd == 0 && ti->ti_seq == tp->rcv_nxt) {
807 tp->t_flags |= TF_ACKNOW;
808 } else {
809 goto dropafterack;
812 m_adj(m, -todrop);
813 ti->ti_len -= todrop;
814 tiflags &= ~(TH_PUSH|TH_FIN);
818 * If the RST bit is set examine the state:
819 * SYN_RECEIVED STATE:
820 * If passive open, return to LISTEN state.
821 * If active open, inform user that connection was refused.
822 * ESTABLISHED, FIN_WAIT_1, FIN_WAIT2, CLOSE_WAIT STATES:
823 * Inform user that connection was reset, and close tcb.
824 * CLOSING, LAST_ACK, TIME_WAIT STATES
825 * Close the tcb.
827 if (tiflags&TH_RST) switch (tp->t_state) {
829 case TCPS_SYN_RECEIVED:
830 case TCPS_ESTABLISHED:
831 case TCPS_FIN_WAIT_1:
832 case TCPS_FIN_WAIT_2:
833 case TCPS_CLOSE_WAIT:
834 tp->t_state = TCPS_CLOSED;
835 tcp_close(tp);
836 goto drop;
838 case TCPS_CLOSING:
839 case TCPS_LAST_ACK:
840 case TCPS_TIME_WAIT:
841 tcp_close(tp);
842 goto drop;
846 * If a SYN is in the window, then this is an
847 * error and we send an RST and drop the connection.
849 if (tiflags & TH_SYN) {
850 tp = tcp_drop(tp,0);
851 goto dropwithreset;
855 * If the ACK bit is off we drop the segment and return.
857 if ((tiflags & TH_ACK) == 0) goto drop;
860 * Ack processing.
862 switch (tp->t_state) {
864 * In SYN_RECEIVED state if the ack ACKs our SYN then enter
865 * ESTABLISHED state and continue processing, otherwise
866 * send an RST. una<=ack<=max
868 case TCPS_SYN_RECEIVED:
870 if (SEQ_GT(tp->snd_una, ti->ti_ack) ||
871 SEQ_GT(ti->ti_ack, tp->snd_max))
872 goto dropwithreset;
873 tp->t_state = TCPS_ESTABLISHED;
875 * The sent SYN is ack'ed with our sequence number +1
876 * The first data byte already in the buffer will get
877 * lost if no correction is made. This is only needed for
878 * SS_CTL since the buffer is empty otherwise.
879 * tp->snd_una++; or:
881 tp->snd_una=ti->ti_ack;
882 if (so->so_state & SS_CTL) {
883 /* So tcp_ctl reports the right state */
884 ret = tcp_ctl(so);
885 if (ret == 1) {
886 soisfconnected(so);
887 so->so_state &= ~SS_CTL; /* success XXX */
888 } else if (ret == 2) {
889 so->so_state &= SS_PERSISTENT_MASK;
890 so->so_state |= SS_NOFDREF; /* CTL_CMD */
891 } else {
892 needoutput = 1;
893 tp->t_state = TCPS_FIN_WAIT_1;
895 } else {
896 soisfconnected(so);
899 (void) tcp_reass(tp, (struct tcpiphdr *)0, (struct mbuf *)0);
900 tp->snd_wl1 = ti->ti_seq - 1;
901 /* Avoid ack processing; snd_una==ti_ack => dup ack */
902 goto synrx_to_est;
903 /* fall into ... */
906 * In ESTABLISHED state: drop duplicate ACKs; ACK out of range
907 * ACKs. If the ack is in the range
908 * tp->snd_una < ti->ti_ack <= tp->snd_max
909 * then advance tp->snd_una to ti->ti_ack and drop
910 * data from the retransmission queue. If this ACK reflects
911 * more up to date window information we update our window information.
913 case TCPS_ESTABLISHED:
914 case TCPS_FIN_WAIT_1:
915 case TCPS_FIN_WAIT_2:
916 case TCPS_CLOSE_WAIT:
917 case TCPS_CLOSING:
918 case TCPS_LAST_ACK:
919 case TCPS_TIME_WAIT:
921 if (SEQ_LEQ(ti->ti_ack, tp->snd_una)) {
922 if (ti->ti_len == 0 && tiwin == tp->snd_wnd) {
923 DEBUG_MISC((dfd, " dup ack m = %p so = %p\n",
924 m, so));
926 * If we have outstanding data (other than
927 * a window probe), this is a completely
928 * duplicate ack (ie, window info didn't
929 * change), the ack is the biggest we've
930 * seen and we've seen exactly our rexmt
931 * threshold of them, assume a packet
932 * has been dropped and retransmit it.
933 * Kludge snd_nxt & the congestion
934 * window so we send only this one
935 * packet.
937 * We know we're losing at the current
938 * window size so do congestion avoidance
939 * (set ssthresh to half the current window
940 * and pull our congestion window back to
941 * the new ssthresh).
943 * Dup acks mean that packets have left the
944 * network (they're now cached at the receiver)
945 * so bump cwnd by the amount in the receiver
946 * to keep a constant cwnd packets in the
947 * network.
949 if (tp->t_timer[TCPT_REXMT] == 0 ||
950 ti->ti_ack != tp->snd_una)
951 tp->t_dupacks = 0;
952 else if (++tp->t_dupacks == TCPREXMTTHRESH) {
953 tcp_seq onxt = tp->snd_nxt;
954 u_int win =
955 min(tp->snd_wnd, tp->snd_cwnd) / 2 /
956 tp->t_maxseg;
958 if (win < 2)
959 win = 2;
960 tp->snd_ssthresh = win * tp->t_maxseg;
961 tp->t_timer[TCPT_REXMT] = 0;
962 tp->t_rtt = 0;
963 tp->snd_nxt = ti->ti_ack;
964 tp->snd_cwnd = tp->t_maxseg;
965 (void) tcp_output(tp);
966 tp->snd_cwnd = tp->snd_ssthresh +
967 tp->t_maxseg * tp->t_dupacks;
968 if (SEQ_GT(onxt, tp->snd_nxt))
969 tp->snd_nxt = onxt;
970 goto drop;
971 } else if (tp->t_dupacks > TCPREXMTTHRESH) {
972 tp->snd_cwnd += tp->t_maxseg;
973 (void) tcp_output(tp);
974 goto drop;
976 } else
977 tp->t_dupacks = 0;
978 break;
980 synrx_to_est:
982 * If the congestion window was inflated to account
983 * for the other side's cached packets, retract it.
985 if (tp->t_dupacks > TCPREXMTTHRESH &&
986 tp->snd_cwnd > tp->snd_ssthresh)
987 tp->snd_cwnd = tp->snd_ssthresh;
988 tp->t_dupacks = 0;
989 if (SEQ_GT(ti->ti_ack, tp->snd_max)) {
990 goto dropafterack;
992 acked = ti->ti_ack - tp->snd_una;
995 * If transmit timer is running and timed sequence
996 * number was acked, update smoothed round trip time.
997 * Since we now have an rtt measurement, cancel the
998 * timer backoff (cf., Phil Karn's retransmit alg.).
999 * Recompute the initial retransmit timer.
1001 if (tp->t_rtt && SEQ_GT(ti->ti_ack, tp->t_rtseq))
1002 tcp_xmit_timer(tp,tp->t_rtt);
1005 * If all outstanding data is acked, stop retransmit
1006 * timer and remember to restart (more output or persist).
1007 * If there is more data to be acked, restart retransmit
1008 * timer, using current (possibly backed-off) value.
1010 if (ti->ti_ack == tp->snd_max) {
1011 tp->t_timer[TCPT_REXMT] = 0;
1012 needoutput = 1;
1013 } else if (tp->t_timer[TCPT_PERSIST] == 0)
1014 tp->t_timer[TCPT_REXMT] = tp->t_rxtcur;
1016 * When new data is acked, open the congestion window.
1017 * If the window gives us less than ssthresh packets
1018 * in flight, open exponentially (maxseg per packet).
1019 * Otherwise open linearly: maxseg per window
1020 * (maxseg^2 / cwnd per packet).
1023 register u_int cw = tp->snd_cwnd;
1024 register u_int incr = tp->t_maxseg;
1026 if (cw > tp->snd_ssthresh)
1027 incr = incr * incr / cw;
1028 tp->snd_cwnd = min(cw + incr, TCP_MAXWIN<<tp->snd_scale);
1030 if (acked > so->so_snd.sb_cc) {
1031 tp->snd_wnd -= so->so_snd.sb_cc;
1032 sbdrop(&so->so_snd, (int )so->so_snd.sb_cc);
1033 ourfinisacked = 1;
1034 } else {
1035 sbdrop(&so->so_snd, acked);
1036 tp->snd_wnd -= acked;
1037 ourfinisacked = 0;
1039 tp->snd_una = ti->ti_ack;
1040 if (SEQ_LT(tp->snd_nxt, tp->snd_una))
1041 tp->snd_nxt = tp->snd_una;
1043 switch (tp->t_state) {
1046 * In FIN_WAIT_1 STATE in addition to the processing
1047 * for the ESTABLISHED state if our FIN is now acknowledged
1048 * then enter FIN_WAIT_2.
1050 case TCPS_FIN_WAIT_1:
1051 if (ourfinisacked) {
1053 * If we can't receive any more
1054 * data, then closing user can proceed.
1055 * Starting the timer is contrary to the
1056 * specification, but if we don't get a FIN
1057 * we'll hang forever.
1059 if (so->so_state & SS_FCANTRCVMORE) {
1060 tp->t_timer[TCPT_2MSL] = TCP_MAXIDLE;
1062 tp->t_state = TCPS_FIN_WAIT_2;
1064 break;
1067 * In CLOSING STATE in addition to the processing for
1068 * the ESTABLISHED state if the ACK acknowledges our FIN
1069 * then enter the TIME-WAIT state, otherwise ignore
1070 * the segment.
1072 case TCPS_CLOSING:
1073 if (ourfinisacked) {
1074 tp->t_state = TCPS_TIME_WAIT;
1075 tcp_canceltimers(tp);
1076 tp->t_timer[TCPT_2MSL] = 2 * TCPTV_MSL;
1078 break;
1081 * In LAST_ACK, we may still be waiting for data to drain
1082 * and/or to be acked, as well as for the ack of our FIN.
1083 * If our FIN is now acknowledged, delete the TCB,
1084 * enter the closed state and return.
1086 case TCPS_LAST_ACK:
1087 if (ourfinisacked) {
1088 tcp_close(tp);
1089 goto drop;
1091 break;
1094 * In TIME_WAIT state the only thing that should arrive
1095 * is a retransmission of the remote FIN. Acknowledge
1096 * it and restart the finack timer.
1098 case TCPS_TIME_WAIT:
1099 tp->t_timer[TCPT_2MSL] = 2 * TCPTV_MSL;
1100 goto dropafterack;
1102 } /* switch(tp->t_state) */
1104 step6:
1106 * Update window information.
1107 * Don't look at window if no ACK: TAC's send garbage on first SYN.
1109 if ((tiflags & TH_ACK) &&
1110 (SEQ_LT(tp->snd_wl1, ti->ti_seq) ||
1111 (tp->snd_wl1 == ti->ti_seq && (SEQ_LT(tp->snd_wl2, ti->ti_ack) ||
1112 (tp->snd_wl2 == ti->ti_ack && tiwin > tp->snd_wnd))))) {
1113 tp->snd_wnd = tiwin;
1114 tp->snd_wl1 = ti->ti_seq;
1115 tp->snd_wl2 = ti->ti_ack;
1116 if (tp->snd_wnd > tp->max_sndwnd)
1117 tp->max_sndwnd = tp->snd_wnd;
1118 needoutput = 1;
1122 * Process segments with URG.
1124 if ((tiflags & TH_URG) && ti->ti_urp &&
1125 TCPS_HAVERCVDFIN(tp->t_state) == 0) {
1127 * This is a kludge, but if we receive and accept
1128 * random urgent pointers, we'll crash in
1129 * soreceive. It's hard to imagine someone
1130 * actually wanting to send this much urgent data.
1132 if (ti->ti_urp + so->so_rcv.sb_cc > so->so_rcv.sb_datalen) {
1133 ti->ti_urp = 0;
1134 tiflags &= ~TH_URG;
1135 goto dodata;
1138 * If this segment advances the known urgent pointer,
1139 * then mark the data stream. This should not happen
1140 * in CLOSE_WAIT, CLOSING, LAST_ACK or TIME_WAIT STATES since
1141 * a FIN has been received from the remote side.
1142 * In these states we ignore the URG.
1144 * According to RFC961 (Assigned Protocols),
1145 * the urgent pointer points to the last octet
1146 * of urgent data. We continue, however,
1147 * to consider it to indicate the first octet
1148 * of data past the urgent section as the original
1149 * spec states (in one of two places).
1151 if (SEQ_GT(ti->ti_seq+ti->ti_urp, tp->rcv_up)) {
1152 tp->rcv_up = ti->ti_seq + ti->ti_urp;
1153 so->so_urgc = so->so_rcv.sb_cc +
1154 (tp->rcv_up - tp->rcv_nxt); /* -1; */
1155 tp->rcv_up = ti->ti_seq + ti->ti_urp;
1158 } else
1160 * If no out of band data is expected,
1161 * pull receive urgent pointer along
1162 * with the receive window.
1164 if (SEQ_GT(tp->rcv_nxt, tp->rcv_up))
1165 tp->rcv_up = tp->rcv_nxt;
1166 dodata:
1169 * If this is a small packet, then ACK now - with Nagel
1170 * congestion avoidance sender won't send more until
1171 * he gets an ACK.
1173 if (ti->ti_len && (unsigned)ti->ti_len <= 5 &&
1174 ((struct tcpiphdr_2 *)ti)->first_char == (char)27) {
1175 tp->t_flags |= TF_ACKNOW;
1179 * Process the segment text, merging it into the TCP sequencing queue,
1180 * and arranging for acknowledgment of receipt if necessary.
1181 * This process logically involves adjusting tp->rcv_wnd as data
1182 * is presented to the user (this happens in tcp_usrreq.c,
1183 * case PRU_RCVD). If a FIN has already been received on this
1184 * connection then we just ignore the text.
1186 if ((ti->ti_len || (tiflags&TH_FIN)) &&
1187 TCPS_HAVERCVDFIN(tp->t_state) == 0) {
1188 TCP_REASS(tp, ti, m, so, tiflags);
1189 } else {
1190 m_free(m);
1191 tiflags &= ~TH_FIN;
1195 * If FIN is received ACK the FIN and let the user know
1196 * that the connection is closing.
1198 if (tiflags & TH_FIN) {
1199 if (TCPS_HAVERCVDFIN(tp->t_state) == 0) {
1201 * If we receive a FIN we can't send more data,
1202 * set it SS_FDRAIN
1203 * Shutdown the socket if there is no rx data in the
1204 * buffer.
1205 * soread() is called on completion of shutdown() and
1206 * will got to TCPS_LAST_ACK, and use tcp_output()
1207 * to send the FIN.
1209 sofwdrain(so);
1211 tp->t_flags |= TF_ACKNOW;
1212 tp->rcv_nxt++;
1214 switch (tp->t_state) {
1217 * In SYN_RECEIVED and ESTABLISHED STATES
1218 * enter the CLOSE_WAIT state.
1220 case TCPS_SYN_RECEIVED:
1221 case TCPS_ESTABLISHED:
1222 if(so->so_emu == EMU_CTL) /* no shutdown on socket */
1223 tp->t_state = TCPS_LAST_ACK;
1224 else
1225 tp->t_state = TCPS_CLOSE_WAIT;
1226 break;
1229 * If still in FIN_WAIT_1 STATE FIN has not been acked so
1230 * enter the CLOSING state.
1232 case TCPS_FIN_WAIT_1:
1233 tp->t_state = TCPS_CLOSING;
1234 break;
1237 * In FIN_WAIT_2 state enter the TIME_WAIT state,
1238 * starting the time-wait timer, turning off the other
1239 * standard timers.
1241 case TCPS_FIN_WAIT_2:
1242 tp->t_state = TCPS_TIME_WAIT;
1243 tcp_canceltimers(tp);
1244 tp->t_timer[TCPT_2MSL] = 2 * TCPTV_MSL;
1245 break;
1248 * In TIME_WAIT state restart the 2 MSL time_wait timer.
1250 case TCPS_TIME_WAIT:
1251 tp->t_timer[TCPT_2MSL] = 2 * TCPTV_MSL;
1252 break;
1257 * Return any desired output.
1259 if (needoutput || (tp->t_flags & TF_ACKNOW)) {
1260 (void) tcp_output(tp);
1262 return;
1264 dropafterack:
1266 * Generate an ACK dropping incoming segment if it occupies
1267 * sequence space, where the ACK reflects our state.
1269 if (tiflags & TH_RST)
1270 goto drop;
1271 m_free(m);
1272 tp->t_flags |= TF_ACKNOW;
1273 (void) tcp_output(tp);
1274 return;
1276 dropwithreset:
1277 /* reuses m if m!=NULL, m_free() unnecessary */
1278 if (tiflags & TH_ACK)
1279 tcp_respond(tp, ti, m, (tcp_seq)0, ti->ti_ack, TH_RST);
1280 else {
1281 if (tiflags & TH_SYN) ti->ti_len++;
1282 tcp_respond(tp, ti, m, ti->ti_seq+ti->ti_len, (tcp_seq)0,
1283 TH_RST|TH_ACK);
1286 return;
1288 drop:
1290 * Drop space held by incoming segment and return.
1292 m_free(m);
1295 static void
1296 tcp_dooptions(struct tcpcb *tp, u_char *cp, int cnt, struct tcpiphdr *ti)
1298 uint16_t mss;
1299 int opt, optlen;
1301 DEBUG_CALL("tcp_dooptions");
1302 DEBUG_ARGS((dfd, " tp = %p cnt=%i\n", tp, cnt));
1304 for (; cnt > 0; cnt -= optlen, cp += optlen) {
1305 opt = cp[0];
1306 if (opt == TCPOPT_EOL)
1307 break;
1308 if (opt == TCPOPT_NOP)
1309 optlen = 1;
1310 else {
1311 optlen = cp[1];
1312 if (optlen <= 0)
1313 break;
1315 switch (opt) {
1317 default:
1318 continue;
1320 case TCPOPT_MAXSEG:
1321 if (optlen != TCPOLEN_MAXSEG)
1322 continue;
1323 if (!(ti->ti_flags & TH_SYN))
1324 continue;
1325 memcpy((char *) &mss, (char *) cp + 2, sizeof(mss));
1326 NTOHS(mss);
1327 (void) tcp_mss(tp, mss); /* sets t_maxseg */
1328 break;
1335 * Pull out of band byte out of a segment so
1336 * it doesn't appear in the user's data queue.
1337 * It is still reflected in the segment length for
1338 * sequencing purposes.
1341 #ifdef notdef
1343 void
1344 tcp_pulloutofband(so, ti, m)
1345 struct socket *so;
1346 struct tcpiphdr *ti;
1347 register struct mbuf *m;
1349 int cnt = ti->ti_urp - 1;
1351 while (cnt >= 0) {
1352 if (m->m_len > cnt) {
1353 char *cp = mtod(m, caddr_t) + cnt;
1354 struct tcpcb *tp = sototcpcb(so);
1356 tp->t_iobc = *cp;
1357 tp->t_oobflags |= TCPOOB_HAVEDATA;
1358 memcpy(sp, cp+1, (unsigned)(m->m_len - cnt - 1));
1359 m->m_len--;
1360 return;
1362 cnt -= m->m_len;
1363 m = m->m_next; /* XXX WRONG! Fix it! */
1364 if (m == 0)
1365 break;
1367 panic("tcp_pulloutofband");
1370 #endif /* notdef */
1373 * Collect new round-trip time estimate
1374 * and update averages and current timeout.
1377 static void
1378 tcp_xmit_timer(register struct tcpcb *tp, int rtt)
1380 register short delta;
1382 DEBUG_CALL("tcp_xmit_timer");
1383 DEBUG_ARG("tp = %p", tp);
1384 DEBUG_ARG("rtt = %d", rtt);
1386 if (tp->t_srtt != 0) {
1388 * srtt is stored as fixed point with 3 bits after the
1389 * binary point (i.e., scaled by 8). The following magic
1390 * is equivalent to the smoothing algorithm in rfc793 with
1391 * an alpha of .875 (srtt = rtt/8 + srtt*7/8 in fixed
1392 * point). Adjust rtt to origin 0.
1394 delta = rtt - 1 - (tp->t_srtt >> TCP_RTT_SHIFT);
1395 if ((tp->t_srtt += delta) <= 0)
1396 tp->t_srtt = 1;
1398 * We accumulate a smoothed rtt variance (actually, a
1399 * smoothed mean difference), then set the retransmit
1400 * timer to smoothed rtt + 4 times the smoothed variance.
1401 * rttvar is stored as fixed point with 2 bits after the
1402 * binary point (scaled by 4). The following is
1403 * equivalent to rfc793 smoothing with an alpha of .75
1404 * (rttvar = rttvar*3/4 + |delta| / 4). This replaces
1405 * rfc793's wired-in beta.
1407 if (delta < 0)
1408 delta = -delta;
1409 delta -= (tp->t_rttvar >> TCP_RTTVAR_SHIFT);
1410 if ((tp->t_rttvar += delta) <= 0)
1411 tp->t_rttvar = 1;
1412 } else {
1414 * No rtt measurement yet - use the unsmoothed rtt.
1415 * Set the variance to half the rtt (so our first
1416 * retransmit happens at 3*rtt).
1418 tp->t_srtt = rtt << TCP_RTT_SHIFT;
1419 tp->t_rttvar = rtt << (TCP_RTTVAR_SHIFT - 1);
1421 tp->t_rtt = 0;
1422 tp->t_rxtshift = 0;
1425 * the retransmit should happen at rtt + 4 * rttvar.
1426 * Because of the way we do the smoothing, srtt and rttvar
1427 * will each average +1/2 tick of bias. When we compute
1428 * the retransmit timer, we want 1/2 tick of rounding and
1429 * 1 extra tick because of +-1/2 tick uncertainty in the
1430 * firing of the timer. The bias will give us exactly the
1431 * 1.5 tick we need. But, because the bias is
1432 * statistical, we have to test that we don't drop below
1433 * the minimum feasible timer (which is 2 ticks).
1435 TCPT_RANGESET(tp->t_rxtcur, TCP_REXMTVAL(tp),
1436 (short)tp->t_rttmin, TCPTV_REXMTMAX); /* XXX */
1439 * We received an ack for a packet that wasn't retransmitted;
1440 * it is probably safe to discard any error indications we've
1441 * received recently. This isn't quite right, but close enough
1442 * for now (a route might have failed after we sent a segment,
1443 * and the return path might not be symmetrical).
1445 tp->t_softerror = 0;
1449 * Determine a reasonable value for maxseg size.
1450 * If the route is known, check route for mtu.
1451 * If none, use an mss that can be handled on the outgoing
1452 * interface without forcing IP to fragment; if bigger than
1453 * an mbuf cluster (MCLBYTES), round down to nearest multiple of MCLBYTES
1454 * to utilize large mbufs. If no route is found, route has no mtu,
1455 * or the destination isn't local, use a default, hopefully conservative
1456 * size (usually 512 or the default IP max size, but no more than the mtu
1457 * of the interface), as we can't discover anything about intervening
1458 * gateways or networks. We also initialize the congestion/slow start
1459 * window to be a single segment if the destination isn't local.
1460 * While looking at the routing entry, we also initialize other path-dependent
1461 * parameters from pre-set or cached values in the routing entry.
1465 tcp_mss(struct tcpcb *tp, u_int offer)
1467 struct socket *so = tp->t_socket;
1468 int mss;
1470 DEBUG_CALL("tcp_mss");
1471 DEBUG_ARG("tp = %p", tp);
1472 DEBUG_ARG("offer = %d", offer);
1474 mss = min(IF_MTU, IF_MRU) - sizeof(struct tcpiphdr);
1475 if (offer)
1476 mss = min(mss, offer);
1477 mss = max(mss, 32);
1478 if (mss < tp->t_maxseg || offer != 0)
1479 tp->t_maxseg = mss;
1481 tp->snd_cwnd = mss;
1483 sbreserve(&so->so_snd, TCP_SNDSPACE + ((TCP_SNDSPACE % mss) ?
1484 (mss - (TCP_SNDSPACE % mss)) :
1485 0));
1486 sbreserve(&so->so_rcv, TCP_RCVSPACE + ((TCP_RCVSPACE % mss) ?
1487 (mss - (TCP_RCVSPACE % mss)) :
1488 0));
1490 DEBUG_MISC((dfd, " returning mss = %d\n", mss));
1492 return mss;