2 * Copyright (c) 1982, 1986, 1988, 1990, 1993, 1994, 1995
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 * 4. 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.12 (Berkeley) 5/24/95
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
36 #include "opt_inet6.h"
37 #include "opt_tcpdebug.h"
39 #include <sys/param.h>
40 #include <sys/kernel.h>
41 #include <sys/malloc.h>
43 #include <sys/socket.h>
44 #include <sys/socketvar.h>
45 #include <sys/sysctl.h>
46 #include <sys/syslog.h>
47 #include <sys/systm.h>
52 #include <net/route.h>
55 #include <netinet/in.h>
56 #include <netinet/in_pcb.h>
57 #include <netinet/in_systm.h>
58 #include <netinet/in_var.h>
59 #include <netinet/ip.h>
60 #include <netinet/ip_var.h>
61 #include <netinet/ip_options.h>
62 #include <netinet/ip6.h>
63 #include <netinet6/in6_pcb.h>
64 #include <netinet6/ip6_var.h>
65 #include <netinet6/nd6.h>
66 #include <netinet/tcp.h>
67 #include <netinet/tcp_fsm.h>
68 #include <netinet/tcp_seq.h>
69 #include <netinet/tcp_timer.h>
70 #include <netinet/tcp_var.h>
71 #include <netinet6/tcp6_var.h>
72 #include <netinet/tcpip.h>
74 #include <netinet/tcp_debug.h>
77 static int tcp_reass_sysctl_maxseg(SYSCTL_HANDLER_ARGS);
78 static int tcp_reass_sysctl_qsize(SYSCTL_HANDLER_ARGS);
80 SYSCTL_NODE(_net_inet_tcp, OID_AUTO, reass, CTLFLAG_RW, 0,
81 "TCP Segment Reassembly Queue");
83 static VNET_DEFINE(int, tcp_reass_maxseg) = 0;
84 #define V_tcp_reass_maxseg VNET(tcp_reass_maxseg)
85 SYSCTL_VNET_PROC(_net_inet_tcp_reass, OID_AUTO, maxsegments, CTLFLAG_RDTUN,
86 &VNET_NAME(tcp_reass_maxseg), 0, &tcp_reass_sysctl_maxseg, "I",
87 "Global maximum number of TCP Segments in Reassembly Queue");
89 static VNET_DEFINE(int, tcp_reass_qsize) = 0;
90 #define V_tcp_reass_qsize VNET(tcp_reass_qsize)
91 SYSCTL_VNET_PROC(_net_inet_tcp_reass, OID_AUTO, cursegments, CTLFLAG_RD,
92 &VNET_NAME(tcp_reass_qsize), 0, &tcp_reass_sysctl_qsize, "I",
93 "Global number of TCP Segments currently in Reassembly Queue");
95 static VNET_DEFINE(int, tcp_reass_maxqlen) = 48;
96 #define V_tcp_reass_maxqlen VNET(tcp_reass_maxqlen)
97 SYSCTL_VNET_INT(_net_inet_tcp_reass, OID_AUTO, maxqlen, CTLFLAG_RW,
98 &VNET_NAME(tcp_reass_maxqlen), 0,
99 "Maximum number of TCP Segments per individual Reassembly Queue");
101 static VNET_DEFINE(int, tcp_reass_overflows) = 0;
102 #define V_tcp_reass_overflows VNET(tcp_reass_overflows)
103 SYSCTL_VNET_INT(_net_inet_tcp_reass, OID_AUTO, overflows, CTLFLAG_RD,
104 &VNET_NAME(tcp_reass_overflows), 0,
105 "Global number of TCP Segment Reassembly Queue Overflows");
107 static VNET_DEFINE(uma_zone_t, tcp_reass_zone);
108 #define V_tcp_reass_zone VNET(tcp_reass_zone)
110 /* Initialize TCP reassembly queue */
112 tcp_reass_zone_change(void *tag)
115 V_tcp_reass_maxseg = nmbclusters / 16;
116 uma_zone_set_max(V_tcp_reass_zone, V_tcp_reass_maxseg);
123 V_tcp_reass_maxseg = nmbclusters / 16;
124 TUNABLE_INT_FETCH("net.inet.tcp.reass.maxsegments",
125 &V_tcp_reass_maxseg);
126 V_tcp_reass_zone = uma_zcreate("tcpreass", sizeof (struct tseg_qent),
127 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
128 uma_zone_set_max(V_tcp_reass_zone, V_tcp_reass_maxseg);
129 EVENTHANDLER_REGISTER(nmbclusters_change,
130 tcp_reass_zone_change, NULL, EVENTHANDLER_PRI_ANY);
135 tcp_reass_destroy(void)
138 uma_zdestroy(V_tcp_reass_zone);
143 tcp_reass_flush(struct tcpcb *tp)
145 struct tseg_qent *qe;
147 INP_WLOCK_ASSERT(tp->t_inpcb);
149 while ((qe = LIST_FIRST(&tp->t_segq)) != NULL) {
150 LIST_REMOVE(qe, tqe_q);
152 uma_zfree(V_tcp_reass_zone, qe);
156 KASSERT((tp->t_segqlen == 0),
157 ("TCP reass queue %p segment count is %d instead of 0 after flush.",
162 tcp_reass_sysctl_maxseg(SYSCTL_HANDLER_ARGS)
164 V_tcp_reass_maxseg = uma_zone_get_max(V_tcp_reass_zone);
165 return (sysctl_handle_int(oidp, arg1, arg2, req));
169 tcp_reass_sysctl_qsize(SYSCTL_HANDLER_ARGS)
171 V_tcp_reass_qsize = uma_zone_get_cur(V_tcp_reass_zone);
172 return (sysctl_handle_int(oidp, arg1, arg2, req));
176 tcp_reass(struct tcpcb *tp, struct tcphdr *th, int *tlenp, struct mbuf *m)
179 struct tseg_qent *p = NULL;
180 struct tseg_qent *nq;
181 struct tseg_qent *te = NULL;
182 struct socket *so = tp->t_inpcb->inp_socket;
185 INP_WLOCK_ASSERT(tp->t_inpcb);
188 * XXX: tcp_reass() is rather inefficient with its data structures
189 * and should be rewritten (see NetBSD for optimizations).
193 * Call with th==NULL after become established to
194 * force pre-ESTABLISHED data up to user socket.
200 * Limit the number of segments in the reassembly queue to prevent
201 * holding on to too many segments (and thus running out of mbufs).
202 * Make sure to let the missing segment through which caused this
205 if (th->th_seq != tp->rcv_nxt &&
206 tp->t_segqlen >= V_tcp_reass_maxqlen) {
207 V_tcp_reass_overflows++;
208 TCPSTAT_INC(tcps_rcvmemdrop);
215 * Allocate a new queue entry. If we can't, or hit the zone limit
218 te = uma_zalloc(V_tcp_reass_zone, M_NOWAIT);
220 TCPSTAT_INC(tcps_rcvmemdrop);
228 * Find a segment which begins after this one does.
230 LIST_FOREACH(q, &tp->t_segq, tqe_q) {
231 if (SEQ_GT(q->tqe_th->th_seq, th->th_seq))
237 * If there is a preceding segment, it may provide some of
238 * our data already. If so, drop the data from the incoming
239 * segment. If it provides all of our data, drop us.
243 /* conversion to int (in i) handles seq wraparound */
244 i = p->tqe_th->th_seq + p->tqe_len - th->th_seq;
247 TCPSTAT_INC(tcps_rcvduppack);
248 TCPSTAT_ADD(tcps_rcvdupbyte, *tlenp);
250 uma_zfree(V_tcp_reass_zone, te);
253 * Try to present any queued data
254 * at the left window edge to the user.
255 * This is needed after the 3-WHS
258 goto present; /* ??? */
265 TCPSTAT_INC(tcps_rcvoopack);
266 TCPSTAT_ADD(tcps_rcvoobyte, *tlenp);
269 * While we overlap succeeding segments trim them or,
270 * if they are completely covered, dequeue them.
273 int i = (th->th_seq + *tlenp) - q->tqe_th->th_seq;
276 if (i < q->tqe_len) {
277 q->tqe_th->th_seq += i;
283 nq = LIST_NEXT(q, tqe_q);
284 LIST_REMOVE(q, tqe_q);
286 uma_zfree(V_tcp_reass_zone, q);
291 /* Insert the new segment queue entry into place. */
294 te->tqe_len = *tlenp;
297 LIST_INSERT_HEAD(&tp->t_segq, te, tqe_q);
299 LIST_INSERT_AFTER(p, te, tqe_q);
304 * Present data to user, advancing rcv_nxt through
305 * completed sequence space.
307 if (!TCPS_HAVEESTABLISHED(tp->t_state))
309 q = LIST_FIRST(&tp->t_segq);
310 if (!q || q->tqe_th->th_seq != tp->rcv_nxt)
312 SOCKBUF_LOCK(&so->so_rcv);
314 tp->rcv_nxt += q->tqe_len;
315 flags = q->tqe_th->th_flags & TH_FIN;
316 nq = LIST_NEXT(q, tqe_q);
317 LIST_REMOVE(q, tqe_q);
318 if (so->so_rcv.sb_state & SBS_CANTRCVMORE)
321 sbappendstream_locked(&so->so_rcv, q->tqe_m);
322 uma_zfree(V_tcp_reass_zone, q);
325 } while (q && q->tqe_th->th_seq == tp->rcv_nxt);
327 sorwakeup_locked(so);