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
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
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.
44 #define TCPREXMTTHRESH 3
46 #define TCP_PAWS_IDLE (24 * 24 * 60 * 60 * PR_SLOWHZ)
48 /* for modulo comparisons of timestamps */
49 #define TSTMP_LT(a,b) ((int)((a)-(b)) < 0)
50 #define TSTMP_GEQ(a,b) ((int)((a)-(b)) >= 0)
53 * Insert segment ti into reassembly queue of tcp with
54 * control block tp. Return TH_FIN if reassembly now includes
55 * a segment with FIN. The macro form does the common case inline
56 * (segment is the next to be received on an established connection,
57 * and the queue is empty), avoiding linkage into and removal
58 * from the queue and repetition of various conversions.
59 * Set DELACK for segments received in order, but ack immediately
60 * when segments are out of order (so fast retransmit can work).
62 #define TCP_REASS(tp, ti, m, so, flags) { \
63 if ((ti)->ti_seq == (tp)->rcv_nxt && \
64 tcpfrag_list_empty(tp) && \
65 (tp)->t_state == TCPS_ESTABLISHED) { \
66 tp->t_flags |= TF_DELACK; \
67 (tp)->rcv_nxt += (ti)->ti_len; \
68 flags = (ti)->ti_flags & TH_FIN; \
70 if (tcp_emu((so),(m))) sbappend(so, (m)); \
72 sbappend((so), (m)); \
74 (flags) = tcp_reass((tp), (ti), (m)); \
75 tp->t_flags |= TF_ACKNOW; \
79 static void tcp_dooptions(struct tcpcb
*tp
, uint8_t *cp
, int cnt
,
81 static void tcp_xmit_timer(register struct tcpcb
*tp
, int rtt
);
84 tcp_reass(register struct tcpcb
*tp
, register struct tcpiphdr
*ti
,
87 register struct tcpiphdr
*q
;
88 struct socket
*so
= tp
->t_socket
;
92 * Call with ti==NULL after become established to
93 * force pre-ESTABLISHED data up to user socket.
99 * Find a segment which begins after this one does.
101 for (q
= tcpfrag_list_first(tp
); !tcpfrag_list_end(q
, tp
);
102 q
= tcpiphdr_next(q
))
103 if (SEQ_GT(q
->ti_seq
, ti
->ti_seq
))
107 * If there is a preceding segment, it may provide some of
108 * our data already. If so, drop the data from the incoming
109 * segment. If it provides all of our data, drop us.
111 if (!tcpfrag_list_end(tcpiphdr_prev(q
), tp
)) {
113 q
= tcpiphdr_prev(q
);
114 /* conversion to int (in i) handles seq wraparound */
115 i
= q
->ti_seq
+ q
->ti_len
- ti
->ti_seq
;
117 if (i
>= ti
->ti_len
) {
120 * Try to present any queued data
121 * at the left window edge to the user.
122 * This is needed after the 3-WHS
125 goto present
; /* ??? */
131 q
= tcpiphdr_next(q
);
136 * While we overlap succeeding segments trim them or,
137 * if they are completely covered, dequeue them.
139 while (!tcpfrag_list_end(q
, tp
)) {
140 register int i
= (ti
->ti_seq
+ ti
->ti_len
) - q
->ti_seq
;
146 m_adj(q
->ti_mbuf
, i
);
149 q
= tcpiphdr_next(q
);
150 m
= tcpiphdr_prev(q
)->ti_mbuf
;
151 remque(tcpiphdr2qlink(tcpiphdr_prev(q
)));
156 * Stick new segment in its place.
158 insque(tcpiphdr2qlink(ti
), tcpiphdr2qlink(tcpiphdr_prev(q
)));
162 * Present data to user, advancing rcv_nxt through
163 * completed sequence space.
165 if (!TCPS_HAVEESTABLISHED(tp
->t_state
))
167 ti
= tcpfrag_list_first(tp
);
168 if (tcpfrag_list_end(ti
, tp
) || ti
->ti_seq
!= tp
->rcv_nxt
)
170 if (tp
->t_state
== TCPS_SYN_RECEIVED
&& ti
->ti_len
)
173 tp
->rcv_nxt
+= ti
->ti_len
;
174 flags
= ti
->ti_flags
& TH_FIN
;
175 remque(tcpiphdr2qlink(ti
));
177 ti
= tcpiphdr_next(ti
);
178 if (so
->so_state
& SS_FCANTSENDMORE
)
182 if (tcp_emu(so
,m
)) sbappend(so
, m
);
186 } while (ti
!= (struct tcpiphdr
*)tp
&& ti
->ti_seq
== tp
->rcv_nxt
);
191 * TCP input routine, follows pages 65-76 of the
192 * protocol specification dated September, 1981 very closely.
195 tcp_input(struct mbuf
*m
, int iphlen
, struct socket
*inso
, unsigned short af
)
197 struct ip save_ip
, *ip
;
198 struct ip6 save_ip6
, *ip6
;
199 register struct tcpiphdr
*ti
;
203 register struct tcpcb
*tp
= NULL
;
204 register int tiflags
;
205 struct socket
*so
= NULL
;
206 int todrop
, acked
, ourfinisacked
, needoutput
= 0;
210 struct sockaddr_storage lhost
, fhost
;
211 struct sockaddr_in
*lhost4
, *fhost4
;
212 struct sockaddr_in6
*lhost6
, *fhost6
;
213 struct gfwd_list
*ex_ptr
;
216 DEBUG_CALL("tcp_input");
217 DEBUG_ARG("m = %p iphlen = %2d inso = %p",
221 * If called with m == 0, then we're continuing the connect
227 /* Re-set a few variables */
233 tiflags
= ti
->ti_flags
;
239 ip
= mtod(m
, struct ip
*);
240 ip6
= mtod(m
, struct ip6
*);
244 if (iphlen
> sizeof(struct ip
)) {
245 ip_stripoptions(m
, (struct mbuf
*)0);
246 iphlen
= sizeof(struct ip
);
248 /* XXX Check if too short */
252 * Save a copy of the IP header in case we want restore it
253 * for sending an ICMP error message in response.
256 save_ip
.ip_len
+= iphlen
;
259 * Get IP and TCP header together in first mbuf.
260 * Note: IP leaves IP header in first mbuf.
262 m
->m_data
-= sizeof(struct tcpiphdr
) - sizeof(struct ip
)
263 - sizeof(struct tcphdr
);
264 m
->m_len
+= sizeof(struct tcpiphdr
) - sizeof(struct ip
)
265 - sizeof(struct tcphdr
);
266 ti
= mtod(m
, struct tcpiphdr
*);
269 * Checksum extended TCP header and data.
272 tcpiphdr2qlink(ti
)->next
= tcpiphdr2qlink(ti
)->prev
= NULL
;
273 memset(&ti
->ih_mbuf
, 0 , sizeof(struct mbuf_ptr
));
274 memset(&ti
->ti
, 0, sizeof(ti
->ti
));
276 ti
->ti_src
= save_ip
.ip_src
;
277 ti
->ti_dst
= save_ip
.ip_dst
;
278 ti
->ti_pr
= save_ip
.ip_p
;
279 ti
->ti_len
= htons((uint16_t)tlen
);
284 * Save a copy of the IP header in case we want restore it
285 * for sending an ICMP error message in response.
289 * Get IP and TCP header together in first mbuf.
290 * Note: IP leaves IP header in first mbuf.
292 m
->m_data
-= sizeof(struct tcpiphdr
) - (sizeof(struct ip6
)
293 + sizeof(struct tcphdr
));
294 m
->m_len
+= sizeof(struct tcpiphdr
) - (sizeof(struct ip6
)
295 + sizeof(struct tcphdr
));
296 ti
= mtod(m
, struct tcpiphdr
*);
299 tcpiphdr2qlink(ti
)->next
= tcpiphdr2qlink(ti
)->prev
= NULL
;
300 memset(&ti
->ih_mbuf
, 0 , sizeof(struct mbuf_ptr
));
301 memset(&ti
->ti
, 0, sizeof(ti
->ti
));
303 ti
->ti_src6
= save_ip6
.ip_src
;
304 ti
->ti_dst6
= save_ip6
.ip_dst
;
305 ti
->ti_nh6
= save_ip6
.ip_nh
;
306 ti
->ti_len
= htons((uint16_t)tlen
);
310 g_assert_not_reached();
313 len
= ((sizeof(struct tcpiphdr
) - sizeof(struct tcphdr
)) + tlen
);
319 * Check that TCP offset makes sense,
320 * pull out TCP options and adjust length. XXX
322 off
= ti
->ti_off
<< 2;
323 if (off
< sizeof (struct tcphdr
) || off
> tlen
) {
328 if (off
> sizeof (struct tcphdr
)) {
329 optlen
= off
- sizeof (struct tcphdr
);
330 optp
= mtod(m
, char *) + sizeof (struct tcpiphdr
);
332 tiflags
= ti
->ti_flags
;
335 * Convert TCP protocol specific fields to host format.
343 * Drop TCP, IP headers and TCP options.
345 m
->m_data
+= sizeof(struct tcpiphdr
)+off
-sizeof(struct tcphdr
);
346 m
->m_len
-= sizeof(struct tcpiphdr
)+off
-sizeof(struct tcphdr
);
349 * Locate pcb for segment.
352 lhost
.ss_family
= af
;
353 fhost
.ss_family
= af
;
356 lhost4
= (struct sockaddr_in
*) &lhost
;
357 lhost4
->sin_addr
= ti
->ti_src
;
358 lhost4
->sin_port
= ti
->ti_sport
;
359 fhost4
= (struct sockaddr_in
*) &fhost
;
360 fhost4
->sin_addr
= ti
->ti_dst
;
361 fhost4
->sin_port
= ti
->ti_dport
;
364 lhost6
= (struct sockaddr_in6
*) &lhost
;
365 lhost6
->sin6_addr
= ti
->ti_src6
;
366 lhost6
->sin6_port
= ti
->ti_sport
;
367 fhost6
= (struct sockaddr_in6
*) &fhost
;
368 fhost6
->sin6_addr
= ti
->ti_dst6
;
369 fhost6
->sin6_port
= ti
->ti_dport
;
372 g_assert_not_reached();
375 so
= solookup(&slirp
->tcp_last_so
, &slirp
->tcb
, &lhost
, &fhost
);
378 * If the state is CLOSED (i.e., TCB does not exist) then
379 * all data in the incoming segment is discarded.
380 * If the TCB exists but is in CLOSED state, it is embryonic,
381 * but should either do a listen or a connect soon.
383 * state == CLOSED means we've done socreate() but haven't
384 * attached it to a protocol yet...
386 * XXX If a TCB does not exist, and the TH_SYN flag is
387 * the only flag set, then create a session, mark it
388 * as if it was LISTENING, and continue...
391 if (slirp
->restricted
) {
392 /* Any hostfwds will have an existing socket, so we only get here
393 * for non-hostfwd connections. These should be dropped, unless it
394 * happens to be a guestfwd.
396 for (ex_ptr
= slirp
->guestfwd_list
; ex_ptr
; ex_ptr
= ex_ptr
->ex_next
) {
397 if (ex_ptr
->ex_fport
== ti
->ti_dport
&&
398 ti
->ti_dst
.s_addr
== ex_ptr
->ex_addr
.s_addr
) {
407 if ((tiflags
& (TH_SYN
|TH_FIN
|TH_RST
|TH_URG
|TH_ACK
)) != TH_SYN
)
410 so
= socreate(slirp
);
411 if (tcp_attach(so
) < 0) {
412 g_free(so
); /* Not sofree (if it failed, it's not insqued) */
416 sbreserve(&so
->so_snd
, TCP_SNDSPACE
);
417 sbreserve(&so
->so_rcv
, TCP_RCVSPACE
);
419 so
->lhost
.ss
= lhost
;
420 so
->fhost
.ss
= fhost
;
422 so
->so_iptos
= tcp_tos(so
);
423 if (so
->so_iptos
== 0) {
426 so
->so_iptos
= ((struct ip
*)ti
)->ip_tos
;
431 g_assert_not_reached();
436 tp
->t_state
= TCPS_LISTEN
;
440 * If this is a still-connecting socket, this probably
441 * a retransmit of the SYN. Whether it's a retransmit SYN
442 * or something else, we nuke it.
444 if (so
->so_state
& SS_ISFCONNECTING
)
449 /* XXX Should never fail */
452 if (tp
->t_state
== TCPS_CLOSED
)
458 * Segment received on connection.
459 * Reset idle time and keep-alive timer.
462 if (slirp_do_keepalive
)
463 tp
->t_timer
[TCPT_KEEP
] = TCPTV_KEEPINTVL
;
465 tp
->t_timer
[TCPT_KEEP
] = TCPTV_KEEP_IDLE
;
468 * Process options if not in LISTEN state,
469 * else do it below (after getting remote address).
471 if (optp
&& tp
->t_state
!= TCPS_LISTEN
)
472 tcp_dooptions(tp
, (uint8_t *)optp
, optlen
, ti
);
475 * Header prediction: check for the two common cases
476 * of a uni-directional data xfer. If the packet has
477 * no control flags, is in-sequence, the window didn't
478 * change and we're not retransmitting, it's a
479 * candidate. If the length is zero and the ack moved
480 * forward, we're the sender side of the xfer. Just
481 * free the data acked & wake any higher level process
482 * that was blocked waiting for space. If the length
483 * is non-zero and the ack didn't move, we're the
484 * receiver side. If we're getting packets in-order
485 * (the reassembly queue is empty), add the data to
486 * the socket buffer and note that we need a delayed ack.
488 * XXX Some of these tests are not needed
489 * eg: the tiwin == tp->snd_wnd prevents many more
490 * predictions.. with no *real* advantage..
492 if (tp
->t_state
== TCPS_ESTABLISHED
&&
493 (tiflags
& (TH_SYN
|TH_FIN
|TH_RST
|TH_URG
|TH_ACK
)) == TH_ACK
&&
494 ti
->ti_seq
== tp
->rcv_nxt
&&
495 tiwin
&& tiwin
== tp
->snd_wnd
&&
496 tp
->snd_nxt
== tp
->snd_max
) {
497 if (ti
->ti_len
== 0) {
498 if (SEQ_GT(ti
->ti_ack
, tp
->snd_una
) &&
499 SEQ_LEQ(ti
->ti_ack
, tp
->snd_max
) &&
500 tp
->snd_cwnd
>= tp
->snd_wnd
) {
502 * this is a pure ack for outstanding data.
505 SEQ_GT(ti
->ti_ack
, tp
->t_rtseq
))
506 tcp_xmit_timer(tp
, tp
->t_rtt
);
507 acked
= ti
->ti_ack
- tp
->snd_una
;
509 tp
->snd_una
= ti
->ti_ack
;
513 * If all outstanding data are acked, stop
514 * retransmit timer, otherwise restart timer
515 * using current (possibly backed-off) value.
516 * If process is waiting for space,
517 * wakeup/selwakeup/signal. If data
518 * are ready to send, let tcp_output
519 * decide between more output or persist.
521 if (tp
->snd_una
== tp
->snd_max
)
522 tp
->t_timer
[TCPT_REXMT
] = 0;
523 else if (tp
->t_timer
[TCPT_PERSIST
] == 0)
524 tp
->t_timer
[TCPT_REXMT
] = tp
->t_rxtcur
;
527 * This is called because sowwakeup might have
528 * put data into so_snd. Since we don't so sowwakeup,
529 * we don't need this.. XXX???
531 if (so
->so_snd
.sb_cc
)
532 (void) tcp_output(tp
);
536 } else if (ti
->ti_ack
== tp
->snd_una
&&
537 tcpfrag_list_empty(tp
) &&
538 ti
->ti_len
<= sbspace(&so
->so_rcv
)) {
540 * this is a pure, in-sequence data packet
541 * with nothing on the reassembly queue and
542 * we have enough buffer space to take it.
544 tp
->rcv_nxt
+= ti
->ti_len
;
546 * Add data to socket buffer.
549 if (tcp_emu(so
,m
)) sbappend(so
, m
);
554 * If this is a short packet, then ACK now - with Nagel
555 * congestion avoidance sender won't send more until
558 * It is better to not delay acks at all to maximize
559 * TCP throughput. See RFC 2581.
561 tp
->t_flags
|= TF_ACKNOW
;
565 } /* header prediction */
567 * Calculate amount of space in receive window,
568 * and then do TCP input processing.
569 * Receive window is amount of space in rcv queue,
570 * but not less than advertised window.
573 win
= sbspace(&so
->so_rcv
);
576 tp
->rcv_wnd
= MAX(win
, (int)(tp
->rcv_adv
- tp
->rcv_nxt
));
579 switch (tp
->t_state
) {
582 * If the state is LISTEN then ignore segment if it contains an RST.
583 * If the segment contains an ACK then it is bad and send a RST.
584 * If it does not contain a SYN then it is not interesting; drop it.
585 * Don't bother responding if the destination was a broadcast.
586 * Otherwise initialize tp->rcv_nxt, and tp->irs, select an initial
587 * tp->iss, and send a segment:
588 * <SEQ=ISS><ACK=RCV_NXT><CTL=SYN,ACK>
589 * Also initialize tp->snd_nxt to tp->iss+1 and tp->snd_una to tp->iss.
590 * Fill in remote peer address fields if not previously specified.
591 * Enter SYN_RECEIVED state, and process any other fields of this
592 * segment in this state.
596 if (tiflags
& TH_RST
)
598 if (tiflags
& TH_ACK
)
600 if ((tiflags
& TH_SYN
) == 0)
604 * This has way too many gotos...
605 * But a bit of spaghetti code never hurt anybody :)
609 * If this is destined for the control address, then flag to
610 * tcp_ctl once connected, otherwise connect
613 (so
->so_faddr
.s_addr
& slirp
->vnetwork_mask
.s_addr
) ==
614 slirp
->vnetwork_addr
.s_addr
) {
615 if (so
->so_faddr
.s_addr
!= slirp
->vhost_addr
.s_addr
&&
616 so
->so_faddr
.s_addr
!= slirp
->vnameserver_addr
.s_addr
) {
617 /* May be an add exec */
618 for (ex_ptr
= slirp
->guestfwd_list
; ex_ptr
;
619 ex_ptr
= ex_ptr
->ex_next
) {
620 if(ex_ptr
->ex_fport
== so
->so_fport
&&
621 so
->so_faddr
.s_addr
== ex_ptr
->ex_addr
.s_addr
) {
622 so
->so_state
|= SS_CTL
;
626 if (so
->so_state
& SS_CTL
) {
630 /* CTL_ALIAS: Do nothing, tcp_fconnect will be called on it */
633 if (so
->so_emu
& EMU_NOCONNECT
) {
634 so
->so_emu
&= ~EMU_NOCONNECT
;
638 if ((tcp_fconnect(so
, so
->so_ffamily
) == -1) &&
640 (errno
!= EINPROGRESS
) && (errno
!= EWOULDBLOCK
)
643 DEBUG_MISC(" tcp fconnect errno = %d-%s", errno
, strerror(errno
));
644 if(errno
== ECONNREFUSED
) {
645 /* ACK the SYN, send RST to refuse the connection */
646 tcp_respond(tp
, ti
, m
, ti
->ti_seq
+ 1, (tcp_seq
) 0,
647 TH_RST
| TH_ACK
, af
);
651 code
= ICMP_UNREACH_NET
;
652 if (errno
== EHOSTUNREACH
) {
653 code
= ICMP_UNREACH_HOST
;
657 code
= ICMP6_UNREACH_NO_ROUTE
;
658 if (errno
== EHOSTUNREACH
) {
659 code
= ICMP6_UNREACH_ADDRESS
;
663 g_assert_not_reached();
665 HTONL(ti
->ti_seq
); /* restore tcp header */
669 m
->m_data
-= sizeof(struct tcpiphdr
)+off
-sizeof(struct tcphdr
);
670 m
->m_len
+= sizeof(struct tcpiphdr
)+off
-sizeof(struct tcphdr
);
673 m
->m_data
+= sizeof(struct tcpiphdr
) - sizeof(struct ip
)
674 - sizeof(struct tcphdr
);
675 m
->m_len
-= sizeof(struct tcpiphdr
) - sizeof(struct ip
)
676 - sizeof(struct tcphdr
);
678 icmp_send_error(m
, ICMP_UNREACH
, code
, 0, strerror(errno
));
681 m
->m_data
+= sizeof(struct tcpiphdr
) - (sizeof(struct ip6
)
682 + sizeof(struct tcphdr
));
683 m
->m_len
-= sizeof(struct tcpiphdr
) - (sizeof(struct ip6
)
684 + sizeof(struct tcphdr
));
686 icmp6_send_error(m
, ICMP6_UNREACH
, code
);
689 g_assert_not_reached();
696 * Haven't connected yet, save the current mbuf
698 * XXX Some OS's don't tell us whether the connect()
699 * succeeded or not. So we must time it out.
703 tp
->t_timer
[TCPT_KEEP
] = TCPTV_KEEP_INIT
;
704 tp
->t_state
= TCPS_SYN_RECEIVED
;
706 * Initialize receive sequence numbers now so that we can send a
707 * valid RST if the remote end rejects our connection.
709 tp
->irs
= ti
->ti_seq
;
717 * Check if the connect succeeded
719 if (so
->so_state
& SS_NOFDREF
) {
727 tcp_dooptions(tp
, (uint8_t *)optp
, optlen
, ti
);
732 tp
->iss
= slirp
->tcp_iss
;
733 slirp
->tcp_iss
+= TCP_ISSINCR
/2;
734 tp
->irs
= ti
->ti_seq
;
737 tp
->t_flags
|= TF_ACKNOW
;
738 tp
->t_state
= TCPS_SYN_RECEIVED
;
739 tp
->t_timer
[TCPT_KEEP
] = TCPTV_KEEP_INIT
;
741 } /* case TCPS_LISTEN */
744 * If the state is SYN_SENT:
745 * if seg contains an ACK, but not for our SYN, drop the input.
746 * if seg contains a RST, then drop the connection.
747 * if seg does not contain SYN, then drop it.
748 * Otherwise this is an acceptable SYN segment
749 * initialize tp->rcv_nxt and tp->irs
750 * if seg contains ack then advance tp->snd_una
751 * if SYN has been acked change to ESTABLISHED else SYN_RCVD state
752 * arrange for segment to be acked (eventually)
753 * continue processing rest of data/controls, beginning with URG
756 if ((tiflags
& TH_ACK
) &&
757 (SEQ_LEQ(ti
->ti_ack
, tp
->iss
) ||
758 SEQ_GT(ti
->ti_ack
, tp
->snd_max
)))
761 if (tiflags
& TH_RST
) {
762 if (tiflags
& TH_ACK
) {
763 tcp_drop(tp
, 0); /* XXX Check t_softerror! */
768 if ((tiflags
& TH_SYN
) == 0)
770 if (tiflags
& TH_ACK
) {
771 tp
->snd_una
= ti
->ti_ack
;
772 if (SEQ_LT(tp
->snd_nxt
, tp
->snd_una
))
773 tp
->snd_nxt
= tp
->snd_una
;
776 tp
->t_timer
[TCPT_REXMT
] = 0;
777 tp
->irs
= ti
->ti_seq
;
779 tp
->t_flags
|= TF_ACKNOW
;
780 if (tiflags
& TH_ACK
&& SEQ_GT(tp
->snd_una
, tp
->iss
)) {
782 tp
->t_state
= TCPS_ESTABLISHED
;
784 (void) tcp_reass(tp
, (struct tcpiphdr
*)0,
787 * if we didn't have to retransmit the SYN,
788 * use its rtt as our initial srtt & rtt var.
791 tcp_xmit_timer(tp
, tp
->t_rtt
);
793 tp
->t_state
= TCPS_SYN_RECEIVED
;
797 * Advance ti->ti_seq to correspond to first data byte.
798 * If data, trim to stay within window,
799 * dropping FIN if necessary.
802 if (ti
->ti_len
> tp
->rcv_wnd
) {
803 todrop
= ti
->ti_len
- tp
->rcv_wnd
;
805 ti
->ti_len
= tp
->rcv_wnd
;
808 tp
->snd_wl1
= ti
->ti_seq
- 1;
809 tp
->rcv_up
= ti
->ti_seq
;
811 } /* switch tp->t_state */
813 * States other than LISTEN or SYN_SENT.
814 * Check that at least some bytes of segment are within
815 * receive window. If segment begins before rcv_nxt,
816 * drop leading data (and SYN); if nothing left, just ack.
818 todrop
= tp
->rcv_nxt
- ti
->ti_seq
;
820 if (tiflags
& TH_SYN
) {
830 * Following if statement from Stevens, vol. 2, p. 960.
832 if (todrop
> ti
->ti_len
833 || (todrop
== ti
->ti_len
&& (tiflags
& TH_FIN
) == 0)) {
835 * Any valid FIN must be to the left of the window.
836 * At this point the FIN must be a duplicate or out
837 * of sequence; drop it.
842 * Send an ACK to resynchronize and drop any data.
843 * But keep on processing for RST or ACK.
845 tp
->t_flags
|= TF_ACKNOW
;
849 ti
->ti_seq
+= todrop
;
850 ti
->ti_len
-= todrop
;
851 if (ti
->ti_urp
> todrop
)
852 ti
->ti_urp
-= todrop
;
859 * If new data are received on a connection after the
860 * user processes are gone, then RST the other end.
862 if ((so
->so_state
& SS_NOFDREF
) &&
863 tp
->t_state
> TCPS_CLOSE_WAIT
&& ti
->ti_len
) {
869 * If segment ends after window, drop trailing data
870 * (and PUSH and FIN); if nothing left, just ACK.
872 todrop
= (ti
->ti_seq
+ti
->ti_len
) - (tp
->rcv_nxt
+tp
->rcv_wnd
);
874 if (todrop
>= ti
->ti_len
) {
876 * If a new connection request is received
877 * while in TIME_WAIT, drop the old connection
878 * and start over if the sequence numbers
879 * are above the previous ones.
881 if (tiflags
& TH_SYN
&&
882 tp
->t_state
== TCPS_TIME_WAIT
&&
883 SEQ_GT(ti
->ti_seq
, tp
->rcv_nxt
)) {
884 iss
= tp
->rcv_nxt
+ TCP_ISSINCR
;
889 * If window is closed can only take segments at
890 * window edge, and have to drop data and PUSH from
891 * incoming segments. Continue processing, but
892 * remember to ack. Otherwise, drop segment
895 if (tp
->rcv_wnd
== 0 && ti
->ti_seq
== tp
->rcv_nxt
) {
896 tp
->t_flags
|= TF_ACKNOW
;
902 ti
->ti_len
-= todrop
;
903 tiflags
&= ~(TH_PUSH
|TH_FIN
);
907 * If the RST bit is set examine the state:
908 * SYN_RECEIVED STATE:
909 * If passive open, return to LISTEN state.
910 * If active open, inform user that connection was refused.
911 * ESTABLISHED, FIN_WAIT_1, FIN_WAIT2, CLOSE_WAIT STATES:
912 * Inform user that connection was reset, and close tcb.
913 * CLOSING, LAST_ACK, TIME_WAIT STATES
916 if (tiflags
&TH_RST
) switch (tp
->t_state
) {
918 case TCPS_SYN_RECEIVED
:
919 case TCPS_ESTABLISHED
:
920 case TCPS_FIN_WAIT_1
:
921 case TCPS_FIN_WAIT_2
:
922 case TCPS_CLOSE_WAIT
:
923 tp
->t_state
= TCPS_CLOSED
;
935 * If a SYN is in the window, then this is an
936 * error and we send an RST and drop the connection.
938 if (tiflags
& TH_SYN
) {
944 * If the ACK bit is off we drop the segment and return.
946 if ((tiflags
& TH_ACK
) == 0) goto drop
;
951 switch (tp
->t_state
) {
953 * In SYN_RECEIVED state if the ack ACKs our SYN then enter
954 * ESTABLISHED state and continue processing, otherwise
955 * send an RST. una<=ack<=max
957 case TCPS_SYN_RECEIVED
:
959 if (SEQ_GT(tp
->snd_una
, ti
->ti_ack
) ||
960 SEQ_GT(ti
->ti_ack
, tp
->snd_max
))
962 tp
->t_state
= TCPS_ESTABLISHED
;
964 * The sent SYN is ack'ed with our sequence number +1
965 * The first data byte already in the buffer will get
966 * lost if no correction is made. This is only needed for
967 * SS_CTL since the buffer is empty otherwise.
970 tp
->snd_una
=ti
->ti_ack
;
971 if (so
->so_state
& SS_CTL
) {
972 /* So tcp_ctl reports the right state */
976 so
->so_state
&= ~SS_CTL
; /* success XXX */
977 } else if (ret
== 2) {
978 so
->so_state
&= SS_PERSISTENT_MASK
;
979 so
->so_state
|= SS_NOFDREF
; /* CTL_CMD */
982 tp
->t_state
= TCPS_FIN_WAIT_1
;
988 (void) tcp_reass(tp
, (struct tcpiphdr
*)0, (struct mbuf
*)0);
989 tp
->snd_wl1
= ti
->ti_seq
- 1;
990 /* Avoid ack processing; snd_una==ti_ack => dup ack */
995 * In ESTABLISHED state: drop duplicate ACKs; ACK out of range
996 * ACKs. If the ack is in the range
997 * tp->snd_una < ti->ti_ack <= tp->snd_max
998 * then advance tp->snd_una to ti->ti_ack and drop
999 * data from the retransmission queue. If this ACK reflects
1000 * more up to date window information we update our window information.
1002 case TCPS_ESTABLISHED
:
1003 case TCPS_FIN_WAIT_1
:
1004 case TCPS_FIN_WAIT_2
:
1005 case TCPS_CLOSE_WAIT
:
1008 case TCPS_TIME_WAIT
:
1010 if (SEQ_LEQ(ti
->ti_ack
, tp
->snd_una
)) {
1011 if (ti
->ti_len
== 0 && tiwin
== tp
->snd_wnd
) {
1012 DEBUG_MISC(" dup ack m = %p so = %p", m
, so
);
1014 * If we have outstanding data (other than
1015 * a window probe), this is a completely
1016 * duplicate ack (ie, window info didn't
1017 * change), the ack is the biggest we've
1018 * seen and we've seen exactly our rexmt
1019 * threshold of them, assume a packet
1020 * has been dropped and retransmit it.
1021 * Kludge snd_nxt & the congestion
1022 * window so we send only this one
1025 * We know we're losing at the current
1026 * window size so do congestion avoidance
1027 * (set ssthresh to half the current window
1028 * and pull our congestion window back to
1029 * the new ssthresh).
1031 * Dup acks mean that packets have left the
1032 * network (they're now cached at the receiver)
1033 * so bump cwnd by the amount in the receiver
1034 * to keep a constant cwnd packets in the
1037 if (tp
->t_timer
[TCPT_REXMT
] == 0 ||
1038 ti
->ti_ack
!= tp
->snd_una
)
1040 else if (++tp
->t_dupacks
== TCPREXMTTHRESH
) {
1041 tcp_seq onxt
= tp
->snd_nxt
;
1043 MIN(tp
->snd_wnd
, tp
->snd_cwnd
) /
1048 tp
->snd_ssthresh
= win
* tp
->t_maxseg
;
1049 tp
->t_timer
[TCPT_REXMT
] = 0;
1051 tp
->snd_nxt
= ti
->ti_ack
;
1052 tp
->snd_cwnd
= tp
->t_maxseg
;
1053 (void) tcp_output(tp
);
1054 tp
->snd_cwnd
= tp
->snd_ssthresh
+
1055 tp
->t_maxseg
* tp
->t_dupacks
;
1056 if (SEQ_GT(onxt
, tp
->snd_nxt
))
1059 } else if (tp
->t_dupacks
> TCPREXMTTHRESH
) {
1060 tp
->snd_cwnd
+= tp
->t_maxseg
;
1061 (void) tcp_output(tp
);
1070 * If the congestion window was inflated to account
1071 * for the other side's cached packets, retract it.
1073 if (tp
->t_dupacks
> TCPREXMTTHRESH
&&
1074 tp
->snd_cwnd
> tp
->snd_ssthresh
)
1075 tp
->snd_cwnd
= tp
->snd_ssthresh
;
1077 if (SEQ_GT(ti
->ti_ack
, tp
->snd_max
)) {
1080 acked
= ti
->ti_ack
- tp
->snd_una
;
1083 * If transmit timer is running and timed sequence
1084 * number was acked, update smoothed round trip time.
1085 * Since we now have an rtt measurement, cancel the
1086 * timer backoff (cf., Phil Karn's retransmit alg.).
1087 * Recompute the initial retransmit timer.
1089 if (tp
->t_rtt
&& SEQ_GT(ti
->ti_ack
, tp
->t_rtseq
))
1090 tcp_xmit_timer(tp
,tp
->t_rtt
);
1093 * If all outstanding data is acked, stop retransmit
1094 * timer and remember to restart (more output or persist).
1095 * If there is more data to be acked, restart retransmit
1096 * timer, using current (possibly backed-off) value.
1098 if (ti
->ti_ack
== tp
->snd_max
) {
1099 tp
->t_timer
[TCPT_REXMT
] = 0;
1101 } else if (tp
->t_timer
[TCPT_PERSIST
] == 0)
1102 tp
->t_timer
[TCPT_REXMT
] = tp
->t_rxtcur
;
1104 * When new data is acked, open the congestion window.
1105 * If the window gives us less than ssthresh packets
1106 * in flight, open exponentially (maxseg per packet).
1107 * Otherwise open linearly: maxseg per window
1108 * (maxseg^2 / cwnd per packet).
1111 register unsigned cw
= tp
->snd_cwnd
;
1112 register unsigned incr
= tp
->t_maxseg
;
1114 if (cw
> tp
->snd_ssthresh
)
1115 incr
= incr
* incr
/ cw
;
1116 tp
->snd_cwnd
= MIN(cw
+ incr
, TCP_MAXWIN
<< tp
->snd_scale
);
1118 if (acked
> so
->so_snd
.sb_cc
) {
1119 tp
->snd_wnd
-= so
->so_snd
.sb_cc
;
1120 sodrop(so
, (int)so
->so_snd
.sb_cc
);
1124 tp
->snd_wnd
-= acked
;
1127 tp
->snd_una
= ti
->ti_ack
;
1128 if (SEQ_LT(tp
->snd_nxt
, tp
->snd_una
))
1129 tp
->snd_nxt
= tp
->snd_una
;
1131 switch (tp
->t_state
) {
1134 * In FIN_WAIT_1 STATE in addition to the processing
1135 * for the ESTABLISHED state if our FIN is now acknowledged
1136 * then enter FIN_WAIT_2.
1138 case TCPS_FIN_WAIT_1
:
1139 if (ourfinisacked
) {
1141 * If we can't receive any more
1142 * data, then closing user can proceed.
1143 * Starting the timer is contrary to the
1144 * specification, but if we don't get a FIN
1145 * we'll hang forever.
1147 if (so
->so_state
& SS_FCANTRCVMORE
) {
1148 tp
->t_timer
[TCPT_2MSL
] = TCP_MAXIDLE
;
1150 tp
->t_state
= TCPS_FIN_WAIT_2
;
1155 * In CLOSING STATE in addition to the processing for
1156 * the ESTABLISHED state if the ACK acknowledges our FIN
1157 * then enter the TIME-WAIT state, otherwise ignore
1161 if (ourfinisacked
) {
1162 tp
->t_state
= TCPS_TIME_WAIT
;
1163 tcp_canceltimers(tp
);
1164 tp
->t_timer
[TCPT_2MSL
] = 2 * TCPTV_MSL
;
1169 * In LAST_ACK, we may still be waiting for data to drain
1170 * and/or to be acked, as well as for the ack of our FIN.
1171 * If our FIN is now acknowledged, delete the TCB,
1172 * enter the closed state and return.
1175 if (ourfinisacked
) {
1182 * In TIME_WAIT state the only thing that should arrive
1183 * is a retransmission of the remote FIN. Acknowledge
1184 * it and restart the finack timer.
1186 case TCPS_TIME_WAIT
:
1187 tp
->t_timer
[TCPT_2MSL
] = 2 * TCPTV_MSL
;
1190 } /* switch(tp->t_state) */
1194 * Update window information.
1195 * Don't look at window if no ACK: TAC's send garbage on first SYN.
1197 if ((tiflags
& TH_ACK
) &&
1198 (SEQ_LT(tp
->snd_wl1
, ti
->ti_seq
) ||
1199 (tp
->snd_wl1
== ti
->ti_seq
&& (SEQ_LT(tp
->snd_wl2
, ti
->ti_ack
) ||
1200 (tp
->snd_wl2
== ti
->ti_ack
&& tiwin
> tp
->snd_wnd
))))) {
1201 tp
->snd_wnd
= tiwin
;
1202 tp
->snd_wl1
= ti
->ti_seq
;
1203 tp
->snd_wl2
= ti
->ti_ack
;
1204 if (tp
->snd_wnd
> tp
->max_sndwnd
)
1205 tp
->max_sndwnd
= tp
->snd_wnd
;
1210 * Process segments with URG.
1212 if ((tiflags
& TH_URG
) && ti
->ti_urp
&&
1213 TCPS_HAVERCVDFIN(tp
->t_state
) == 0) {
1215 * This is a kludge, but if we receive and accept
1216 * random urgent pointers, we'll crash in
1217 * soreceive. It's hard to imagine someone
1218 * actually wanting to send this much urgent data.
1220 if (ti
->ti_urp
+ so
->so_rcv
.sb_cc
> so
->so_rcv
.sb_datalen
) {
1226 * If this segment advances the known urgent pointer,
1227 * then mark the data stream. This should not happen
1228 * in CLOSE_WAIT, CLOSING, LAST_ACK or TIME_WAIT STATES since
1229 * a FIN has been received from the remote side.
1230 * In these states we ignore the URG.
1232 * According to RFC961 (Assigned Protocols),
1233 * the urgent pointer points to the last octet
1234 * of urgent data. We continue, however,
1235 * to consider it to indicate the first octet
1236 * of data past the urgent section as the original
1237 * spec states (in one of two places).
1239 if (SEQ_GT(ti
->ti_seq
+ti
->ti_urp
, tp
->rcv_up
)) {
1240 tp
->rcv_up
= ti
->ti_seq
+ ti
->ti_urp
;
1241 so
->so_urgc
= so
->so_rcv
.sb_cc
+
1242 (tp
->rcv_up
- tp
->rcv_nxt
); /* -1; */
1243 tp
->rcv_up
= ti
->ti_seq
+ ti
->ti_urp
;
1248 * If no out of band data is expected,
1249 * pull receive urgent pointer along
1250 * with the receive window.
1252 if (SEQ_GT(tp
->rcv_nxt
, tp
->rcv_up
))
1253 tp
->rcv_up
= tp
->rcv_nxt
;
1257 * If this is a small packet, then ACK now - with Nagel
1258 * congestion avoidance sender won't send more until
1261 if (ti
->ti_len
&& (unsigned)ti
->ti_len
<= 5 &&
1262 ((struct tcpiphdr_2
*)ti
)->first_char
== (char)27) {
1263 tp
->t_flags
|= TF_ACKNOW
;
1267 * Process the segment text, merging it into the TCP sequencing queue,
1268 * and arranging for acknowledgment of receipt if necessary.
1269 * This process logically involves adjusting tp->rcv_wnd as data
1270 * is presented to the user (this happens in tcp_usrreq.c,
1271 * case PRU_RCVD). If a FIN has already been received on this
1272 * connection then we just ignore the text.
1274 if ((ti
->ti_len
|| (tiflags
&TH_FIN
)) &&
1275 TCPS_HAVERCVDFIN(tp
->t_state
) == 0) {
1276 TCP_REASS(tp
, ti
, m
, so
, tiflags
);
1283 * If FIN is received ACK the FIN and let the user know
1284 * that the connection is closing.
1286 if (tiflags
& TH_FIN
) {
1287 if (TCPS_HAVERCVDFIN(tp
->t_state
) == 0) {
1289 * If we receive a FIN we can't send more data,
1291 * Shutdown the socket if there is no rx data in the
1293 * soread() is called on completion of shutdown() and
1294 * will got to TCPS_LAST_ACK, and use tcp_output()
1299 tp
->t_flags
|= TF_ACKNOW
;
1302 switch (tp
->t_state
) {
1305 * In SYN_RECEIVED and ESTABLISHED STATES
1306 * enter the CLOSE_WAIT state.
1308 case TCPS_SYN_RECEIVED
:
1309 case TCPS_ESTABLISHED
:
1310 if(so
->so_emu
== EMU_CTL
) /* no shutdown on socket */
1311 tp
->t_state
= TCPS_LAST_ACK
;
1313 tp
->t_state
= TCPS_CLOSE_WAIT
;
1317 * If still in FIN_WAIT_1 STATE FIN has not been acked so
1318 * enter the CLOSING state.
1320 case TCPS_FIN_WAIT_1
:
1321 tp
->t_state
= TCPS_CLOSING
;
1325 * In FIN_WAIT_2 state enter the TIME_WAIT state,
1326 * starting the time-wait timer, turning off the other
1329 case TCPS_FIN_WAIT_2
:
1330 tp
->t_state
= TCPS_TIME_WAIT
;
1331 tcp_canceltimers(tp
);
1332 tp
->t_timer
[TCPT_2MSL
] = 2 * TCPTV_MSL
;
1336 * In TIME_WAIT state restart the 2 MSL time_wait timer.
1338 case TCPS_TIME_WAIT
:
1339 tp
->t_timer
[TCPT_2MSL
] = 2 * TCPTV_MSL
;
1345 * Return any desired output.
1347 if (needoutput
|| (tp
->t_flags
& TF_ACKNOW
)) {
1348 (void) tcp_output(tp
);
1354 * Generate an ACK dropping incoming segment if it occupies
1355 * sequence space, where the ACK reflects our state.
1357 if (tiflags
& TH_RST
)
1360 tp
->t_flags
|= TF_ACKNOW
;
1361 (void) tcp_output(tp
);
1365 /* reuses m if m!=NULL, m_free() unnecessary */
1366 if (tiflags
& TH_ACK
)
1367 tcp_respond(tp
, ti
, m
, (tcp_seq
)0, ti
->ti_ack
, TH_RST
, af
);
1369 if (tiflags
& TH_SYN
) ti
->ti_len
++;
1370 tcp_respond(tp
, ti
, m
, ti
->ti_seq
+ ti
->ti_len
, (tcp_seq
) 0,
1371 TH_RST
| TH_ACK
, af
);
1378 * Drop space held by incoming segment and return.
1384 tcp_dooptions(struct tcpcb
*tp
, uint8_t *cp
, int cnt
, struct tcpiphdr
*ti
)
1389 DEBUG_CALL("tcp_dooptions");
1390 DEBUG_ARG("tp = %p cnt=%i", tp
, cnt
);
1392 for (; cnt
> 0; cnt
-= optlen
, cp
+= optlen
) {
1394 if (opt
== TCPOPT_EOL
)
1396 if (opt
== TCPOPT_NOP
)
1409 if (optlen
!= TCPOLEN_MAXSEG
)
1411 if (!(ti
->ti_flags
& TH_SYN
))
1413 memcpy((char *) &mss
, (char *) cp
+ 2, sizeof(mss
));
1415 (void) tcp_mss(tp
, mss
); /* sets t_maxseg */
1422 * Collect new round-trip time estimate
1423 * and update averages and current timeout.
1427 tcp_xmit_timer(register struct tcpcb
*tp
, int rtt
)
1429 register short delta
;
1431 DEBUG_CALL("tcp_xmit_timer");
1432 DEBUG_ARG("tp = %p", tp
);
1433 DEBUG_ARG("rtt = %d", rtt
);
1435 if (tp
->t_srtt
!= 0) {
1437 * srtt is stored as fixed point with 3 bits after the
1438 * binary point (i.e., scaled by 8). The following magic
1439 * is equivalent to the smoothing algorithm in rfc793 with
1440 * an alpha of .875 (srtt = rtt/8 + srtt*7/8 in fixed
1441 * point). Adjust rtt to origin 0.
1443 delta
= rtt
- 1 - (tp
->t_srtt
>> TCP_RTT_SHIFT
);
1444 if ((tp
->t_srtt
+= delta
) <= 0)
1447 * We accumulate a smoothed rtt variance (actually, a
1448 * smoothed mean difference), then set the retransmit
1449 * timer to smoothed rtt + 4 times the smoothed variance.
1450 * rttvar is stored as fixed point with 2 bits after the
1451 * binary point (scaled by 4). The following is
1452 * equivalent to rfc793 smoothing with an alpha of .75
1453 * (rttvar = rttvar*3/4 + |delta| / 4). This replaces
1454 * rfc793's wired-in beta.
1458 delta
-= (tp
->t_rttvar
>> TCP_RTTVAR_SHIFT
);
1459 if ((tp
->t_rttvar
+= delta
) <= 0)
1463 * No rtt measurement yet - use the unsmoothed rtt.
1464 * Set the variance to half the rtt (so our first
1465 * retransmit happens at 3*rtt).
1467 tp
->t_srtt
= rtt
<< TCP_RTT_SHIFT
;
1468 tp
->t_rttvar
= rtt
<< (TCP_RTTVAR_SHIFT
- 1);
1474 * the retransmit should happen at rtt + 4 * rttvar.
1475 * Because of the way we do the smoothing, srtt and rttvar
1476 * will each average +1/2 tick of bias. When we compute
1477 * the retransmit timer, we want 1/2 tick of rounding and
1478 * 1 extra tick because of +-1/2 tick uncertainty in the
1479 * firing of the timer. The bias will give us exactly the
1480 * 1.5 tick we need. But, because the bias is
1481 * statistical, we have to test that we don't drop below
1482 * the minimum feasible timer (which is 2 ticks).
1484 TCPT_RANGESET(tp
->t_rxtcur
, TCP_REXMTVAL(tp
),
1485 (short)tp
->t_rttmin
, TCPTV_REXMTMAX
); /* XXX */
1488 * We received an ack for a packet that wasn't retransmitted;
1489 * it is probably safe to discard any error indications we've
1490 * received recently. This isn't quite right, but close enough
1491 * for now (a route might have failed after we sent a segment,
1492 * and the return path might not be symmetrical).
1494 tp
->t_softerror
= 0;
1498 * Determine a reasonable value for maxseg size.
1499 * If the route is known, check route for mtu.
1500 * If none, use an mss that can be handled on the outgoing
1501 * interface without forcing IP to fragment; if bigger than
1502 * an mbuf cluster (MCLBYTES), round down to nearest multiple of MCLBYTES
1503 * to utilize large mbufs. If no route is found, route has no mtu,
1504 * or the destination isn't local, use a default, hopefully conservative
1505 * size (usually 512 or the default IP max size, but no more than the mtu
1506 * of the interface), as we can't discover anything about intervening
1507 * gateways or networks. We also initialize the congestion/slow start
1508 * window to be a single segment if the destination isn't local.
1509 * While looking at the routing entry, we also initialize other path-dependent
1510 * parameters from pre-set or cached values in the routing entry.
1514 tcp_mss(struct tcpcb
*tp
, unsigned offer
)
1516 struct socket
*so
= tp
->t_socket
;
1519 DEBUG_CALL("tcp_mss");
1520 DEBUG_ARG("tp = %p", tp
);
1521 DEBUG_ARG("offer = %d", offer
);
1523 switch (so
->so_ffamily
) {
1525 mss
= MIN(IF_MTU
, IF_MRU
) - sizeof(struct tcphdr
)
1526 - sizeof(struct ip
);
1529 mss
= MIN(IF_MTU
, IF_MRU
) - sizeof(struct tcphdr
)
1530 - sizeof(struct ip6
);
1533 g_assert_not_reached();
1537 mss
= MIN(mss
, offer
);
1539 if (mss
< tp
->t_maxseg
|| offer
!= 0)
1544 sbreserve(&so
->so_snd
, TCP_SNDSPACE
+ ((TCP_SNDSPACE
% mss
) ?
1545 (mss
- (TCP_SNDSPACE
% mss
)) :
1547 sbreserve(&so
->so_rcv
, TCP_RCVSPACE
+ ((TCP_RCVSPACE
% mss
) ?
1548 (mss
- (TCP_RCVSPACE
% mss
)) :
1551 DEBUG_MISC(" returning mss = %d", mss
);