2012-03-23 00:34:37 +04:00
|
|
|
/* $NetBSD: tcp_usrreq.c,v 1.164 2012/03/22 20:34:39 drochner Exp $ */
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2002-06-09 20:33:36 +04:00
|
|
|
*
|
1999-07-01 12:12:45 +04:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
2002-06-09 20:33:36 +04:00
|
|
|
*
|
1999-07-01 12:12:45 +04:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
1998-02-19 05:36:42 +03:00
|
|
|
|
|
|
|
/*-
|
2006-09-05 04:29:35 +04:00
|
|
|
* Copyright (c) 1997, 1998, 2005, 2006 The NetBSD Foundation, Inc.
|
1998-02-19 05:36:42 +03:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
|
|
* by Jason R. Thorpe and Kevin M. Lahey of the Numerical Aerospace Simulation
|
|
|
|
* Facility, NASA Ames Research Center.
|
2005-03-02 13:20:18 +03:00
|
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
|
|
* by Charles M. Hannum.
|
2006-09-05 04:29:35 +04:00
|
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
|
|
* by Rui Paulo.
|
1998-02-19 05:36:42 +03:00
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
|
|
|
|
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
|
|
|
|
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
1998-01-05 13:31:44 +03:00
|
|
|
* Copyright (c) 1982, 1986, 1988, 1993, 1995
|
1994-05-13 10:02:48 +04:00
|
|
|
* The Regents of the University of California. All rights reserved.
|
1993-03-21 12:45:37 +03:00
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1993-03-21 12:45:37 +03:00
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
1998-01-05 13:31:44 +03:00
|
|
|
* @(#)tcp_usrreq.c 8.5 (Berkeley) 6/21/95
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
|
|
|
|
2001-11-13 03:32:34 +03:00
|
|
|
#include <sys/cdefs.h>
|
2012-03-23 00:34:37 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: tcp_usrreq.c,v 1.164 2012/03/22 20:34:39 drochner Exp $");
|
2001-11-13 03:32:34 +03:00
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
#include "opt_inet.h"
|
1999-07-10 02:57:15 +04:00
|
|
|
#include "opt_ipsec.h"
|
2001-07-08 20:18:56 +04:00
|
|
|
#include "opt_tcp_debug.h"
|
2003-06-23 15:00:59 +04:00
|
|
|
#include "opt_mbuftrace.h"
|
2012-02-02 23:42:57 +04:00
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
1995-03-21 10:48:14 +03:00
|
|
|
#include <sys/kernel.h>
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/stat.h>
|
1996-02-14 02:40:59 +03:00
|
|
|
#include <sys/proc.h>
|
1999-07-01 12:12:45 +04:00
|
|
|
#include <sys/domain.h>
|
1996-02-14 02:40:59 +03:00
|
|
|
#include <sys/sysctl.h>
|
2006-05-15 01:19:33 +04:00
|
|
|
#include <sys/kauth.h>
|
2008-10-11 17:40:57 +04:00
|
|
|
#include <sys/uidinfo.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_systm.h>
|
1995-04-13 10:35:38 +04:00
|
|
|
#include <netinet/in_var.h>
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/in_pcb.h>
|
|
|
|
#include <netinet/ip_var.h>
|
2005-08-10 17:06:49 +04:00
|
|
|
#include <netinet/in_offload.h>
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
#ifndef INET
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#endif
|
|
|
|
#include <netinet/ip6.h>
|
|
|
|
#include <netinet6/in6_pcb.h>
|
|
|
|
#include <netinet6/ip6_var.h>
|
2007-06-29 01:11:12 +04:00
|
|
|
#include <netinet6/scope6_var.h>
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif
|
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <netinet/tcp.h>
|
|
|
|
#include <netinet/tcp_fsm.h>
|
|
|
|
#include <netinet/tcp_seq.h>
|
|
|
|
#include <netinet/tcp_timer.h>
|
|
|
|
#include <netinet/tcp_var.h>
|
2008-04-12 09:58:22 +04:00
|
|
|
#include <netinet/tcp_private.h>
|
2006-10-09 20:27:07 +04:00
|
|
|
#include <netinet/tcp_congctl.h>
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <netinet/tcpip.h>
|
|
|
|
#include <netinet/tcp_debug.h>
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
#include <netinet/tcp_vtw.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2001-11-20 17:34:18 +03:00
|
|
|
#include "opt_tcp_space.h"
|
1997-07-29 02:31:08 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* TCP protocol interface to socket abstraction.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Process a TCP user request for TCP tb. If this is a send request
|
|
|
|
* then m is the mbuf chain of send data. If this is a timer expiration
|
|
|
|
* (called from the software clock routine), then timertype tells which timer.
|
|
|
|
*/
|
|
|
|
/*ARGSUSED*/
|
1994-01-09 02:07:16 +03:00
|
|
|
int
|
2005-02-04 02:50:33 +03:00
|
|
|
tcp_usrreq(struct socket *so, int req,
|
2005-12-11 15:16:03 +03:00
|
|
|
struct mbuf *m, struct mbuf *nam, struct mbuf *control, struct lwp *l)
|
2003-06-30 02:28:00 +04:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct inpcb *inp;
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-03-30 16:51:13 +04:00
|
|
|
struct in6pcb *in6p;
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif
|
2000-03-30 16:51:13 +04:00
|
|
|
struct tcpcb *tp = NULL;
|
1993-03-21 12:45:37 +03:00
|
|
|
int s;
|
|
|
|
int error = 0;
|
2002-10-22 07:14:16 +04:00
|
|
|
#ifdef TCP_DEBUG
|
|
|
|
int ostate = 0;
|
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
int family; /* family of the socket */
|
|
|
|
|
|
|
|
family = so->so_proto->pr_domain->dom_family;
|
|
|
|
|
|
|
|
if (req == PRU_CONTROL) {
|
|
|
|
switch (family) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
case PF_INET:
|
2007-03-04 08:59:00 +03:00
|
|
|
return (in_control(so, (long)m, (void *)nam,
|
2006-07-24 02:06:03 +04:00
|
|
|
(struct ifnet *)control, l));
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
2007-03-04 08:59:00 +03:00
|
|
|
return (in6_control(so, (long)m, (void *)nam,
|
2006-07-24 02:06:03 +04:00
|
|
|
(struct ifnet *)control, l));
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
return EAFNOSUPPORT;
|
|
|
|
}
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2006-10-05 21:35:19 +04:00
|
|
|
s = splsoftnet();
|
|
|
|
|
2000-02-03 02:28:08 +03:00
|
|
|
if (req == PRU_PURGEIF) {
|
2008-04-24 15:38:36 +04:00
|
|
|
mutex_enter(softnet_lock);
|
2000-10-06 13:24:40 +04:00
|
|
|
switch (family) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
2000-10-06 13:24:40 +04:00
|
|
|
case PF_INET:
|
2001-07-03 12:06:19 +04:00
|
|
|
in_pcbpurgeif0(&tcbtable, (struct ifnet *)control);
|
2000-10-06 13:24:40 +04:00
|
|
|
in_purgeif((struct ifnet *)control);
|
|
|
|
in_pcbpurgeif(&tcbtable, (struct ifnet *)control);
|
2000-10-06 14:21:06 +04:00
|
|
|
break;
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
2000-02-03 02:28:08 +03:00
|
|
|
#ifdef INET6
|
2000-10-06 13:24:40 +04:00
|
|
|
case PF_INET6:
|
2003-09-04 13:16:57 +04:00
|
|
|
in6_pcbpurgeif0(&tcbtable, (struct ifnet *)control);
|
2000-10-06 13:24:40 +04:00
|
|
|
in6_purgeif((struct ifnet *)control);
|
2003-09-04 13:16:57 +04:00
|
|
|
in6_pcbpurgeif(&tcbtable, (struct ifnet *)control);
|
2000-10-06 14:21:06 +04:00
|
|
|
break;
|
2000-02-03 02:28:08 +03:00
|
|
|
#endif
|
2000-10-06 13:24:40 +04:00
|
|
|
default:
|
2008-04-24 15:38:36 +04:00
|
|
|
mutex_exit(softnet_lock);
|
2006-10-05 21:35:19 +04:00
|
|
|
splx(s);
|
2000-10-06 13:24:40 +04:00
|
|
|
return (EAFNOSUPPORT);
|
|
|
|
}
|
2008-04-24 15:38:36 +04:00
|
|
|
mutex_exit(softnet_lock);
|
2006-10-05 21:35:19 +04:00
|
|
|
splx(s);
|
2000-02-02 01:52:04 +03:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2008-04-24 15:38:36 +04:00
|
|
|
if (req == PRU_ATTACH)
|
|
|
|
sosetlock(so);
|
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
switch (family) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
case PF_INET:
|
|
|
|
inp = sotoinpcb(so);
|
|
|
|
#ifdef INET6
|
|
|
|
in6p = NULL;
|
|
|
|
#endif
|
|
|
|
break;
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
|
|
|
inp = NULL;
|
|
|
|
in6p = sotoin6pcb(so);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
splx(s);
|
|
|
|
return EAFNOSUPPORT;
|
|
|
|
}
|
|
|
|
|
1996-05-23 21:03:27 +04:00
|
|
|
#ifdef DIAGNOSTIC
|
2000-10-18 01:16:57 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (inp && in6p)
|
|
|
|
panic("tcp_usrreq: both inp and in6p set to non-NULL");
|
2000-10-18 01:16:57 +04:00
|
|
|
#endif
|
1996-05-23 21:03:27 +04:00
|
|
|
if (req != PRU_SEND && req != PRU_SENDOOB && control)
|
|
|
|
panic("tcp_usrreq: unexpected control mbuf");
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* When a TCP is attached to a socket, then there will be
|
|
|
|
* a (struct inpcb) pointed at by the socket, and this
|
|
|
|
* structure will point at a subsidary (struct tcpcb).
|
|
|
|
*/
|
2012-03-17 06:48:51 +04:00
|
|
|
if ((inp == 0
|
|
|
|
#ifdef INET6
|
|
|
|
&& in6p == 0
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif
|
2012-03-17 06:48:51 +04:00
|
|
|
) && (req != PRU_ATTACH && req != PRU_SENSE))
|
1999-07-01 12:12:45 +04:00
|
|
|
{
|
1996-05-23 20:13:19 +04:00
|
|
|
error = EINVAL;
|
|
|
|
goto release;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1993-03-21 12:45:37 +03:00
|
|
|
if (inp) {
|
|
|
|
tp = intotcpcb(inp);
|
|
|
|
/* WHAT IF TP IS 0? */
|
|
|
|
#ifdef KPROF
|
|
|
|
tcp_acounts[tp->t_state][req]++;
|
|
|
|
#endif
|
2002-10-22 07:14:16 +04:00
|
|
|
#ifdef TCP_DEBUG
|
1993-03-21 12:45:37 +03:00
|
|
|
ostate = tp->t_state;
|
2002-10-22 07:14:16 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p) {
|
1999-07-01 12:12:45 +04:00
|
|
|
tp = in6totcpcb(in6p);
|
|
|
|
/* WHAT IF TP IS 0? */
|
|
|
|
#ifdef KPROF
|
|
|
|
tcp_acounts[tp->t_state][req]++;
|
|
|
|
#endif
|
2002-10-22 07:14:16 +04:00
|
|
|
#ifdef TCP_DEBUG
|
1999-07-01 12:12:45 +04:00
|
|
|
ostate = tp->t_state;
|
2002-10-22 07:14:16 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
}
|
|
|
|
#endif
|
1996-05-23 20:13:19 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
switch (req) {
|
|
|
|
|
|
|
|
/*
|
|
|
|
* TCP attaches to socket via PRU_ATTACH, reserving space,
|
|
|
|
* and an internet control block.
|
|
|
|
*/
|
|
|
|
case PRU_ATTACH:
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifndef INET6
|
|
|
|
if (inp != 0)
|
|
|
|
#else
|
|
|
|
if (inp != 0 || in6p != 0)
|
|
|
|
#endif
|
|
|
|
{
|
1993-03-21 12:45:37 +03:00
|
|
|
error = EISCONN;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
error = tcp_attach(so);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if ((so->so_options & SO_LINGER) && so->so_linger == 0)
|
1998-01-05 12:12:29 +03:00
|
|
|
so->so_linger = TCP_LINGERTIME;
|
1993-03-21 12:45:37 +03:00
|
|
|
tp = sototcpcb(so);
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* PRU_DETACH detaches the TCP protocol from the socket.
|
|
|
|
*/
|
|
|
|
case PRU_DETACH:
|
1997-06-12 22:41:14 +04:00
|
|
|
tp = tcp_disconnect(tp);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Give the socket an address.
|
|
|
|
*/
|
|
|
|
case PRU_BIND:
|
1999-07-01 12:12:45 +04:00
|
|
|
switch (family) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
case PF_INET:
|
2006-07-24 02:06:03 +04:00
|
|
|
error = in_pcbbind(inp, nam, l);
|
1999-07-01 12:12:45 +04:00
|
|
|
break;
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
2006-07-24 02:06:03 +04:00
|
|
|
error = in6_pcbbind(in6p, nam, l);
|
2000-12-11 03:07:48 +03:00
|
|
|
if (!error) {
|
|
|
|
/* mapped addr case */
|
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&in6p->in6p_laddr))
|
|
|
|
tp->t_family = AF_INET;
|
|
|
|
else
|
|
|
|
tp->t_family = AF_INET6;
|
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Prepare to accept connections.
|
|
|
|
*/
|
|
|
|
case PRU_LISTEN:
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp && inp->inp_lport == 0) {
|
2008-11-06 06:34:37 +03:00
|
|
|
error = in_pcbbind(inp, NULL, l);
|
1996-05-23 20:13:19 +04:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p && in6p->in6p_lport == 0) {
|
2009-04-17 05:48:22 +04:00
|
|
|
error = in6_pcbbind(in6p, NULL, l);
|
1999-07-01 12:12:45 +04:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
1996-05-23 20:13:19 +04:00
|
|
|
tp->t_state = TCPS_LISTEN;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initiate connection to peer.
|
|
|
|
* Create a template for use in transmissions on this connection.
|
|
|
|
* Enter SYN_SENT state, and mark socket as connecting.
|
|
|
|
* Start keep-alive timer, and seed output sequence space.
|
|
|
|
* Send initial segment on connection.
|
|
|
|
*/
|
|
|
|
case PRU_CONNECT:
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp) {
|
|
|
|
if (inp->inp_lport == 0) {
|
2008-11-06 06:34:37 +03:00
|
|
|
error = in_pcbbind(inp, NULL, l);
|
1999-07-01 12:12:45 +04:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
}
|
2006-07-24 02:06:03 +04:00
|
|
|
error = in_pcbconnect(inp, nam, l);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p) {
|
1999-07-01 12:12:45 +04:00
|
|
|
if (in6p->in6p_lport == 0) {
|
2009-04-17 05:48:22 +04:00
|
|
|
error = in6_pcbbind(in6p, NULL, l);
|
1999-07-01 12:12:45 +04:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
}
|
2006-07-24 02:06:03 +04:00
|
|
|
error = in6_pcbconnect(in6p, nam, l);
|
2000-12-11 03:07:48 +03:00
|
|
|
if (!error) {
|
|
|
|
/* mapped addr case */
|
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&in6p->in6p_faddr))
|
|
|
|
tp->t_family = AF_INET;
|
|
|
|
else
|
|
|
|
tp->t_family = AF_INET6;
|
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
}
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
tp->t_template = tcp_template(tp);
|
|
|
|
if (tp->t_template == 0) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp)
|
|
|
|
in_pcbdisconnect(inp);
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p)
|
1999-07-01 12:12:45 +04:00
|
|
|
in6_pcbdisconnect(in6p);
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
error = ENOBUFS;
|
|
|
|
break;
|
|
|
|
}
|
2007-08-02 06:42:40 +04:00
|
|
|
/*
|
2007-11-04 14:04:26 +03:00
|
|
|
* Compute window scaling to request.
|
|
|
|
* XXX: This should be moved to tcp_output().
|
2007-08-02 06:42:40 +04:00
|
|
|
*/
|
1994-05-13 10:02:48 +04:00
|
|
|
while (tp->request_r_scale < TCP_MAX_WINSHIFT &&
|
2007-11-04 14:04:26 +03:00
|
|
|
(TCP_MAXWIN << tp->request_r_scale) < sb_max)
|
1994-05-13 10:02:48 +04:00
|
|
|
tp->request_r_scale++;
|
1993-03-21 12:45:37 +03:00
|
|
|
soisconnecting(so);
|
2008-04-12 09:58:22 +04:00
|
|
|
TCP_STATINC(TCP_STAT_CONNATTEMPT);
|
1993-03-21 12:45:37 +03:00
|
|
|
tp->t_state = TCPS_SYN_SENT;
|
2007-06-20 19:29:17 +04:00
|
|
|
TCP_TIMER_ARM(tp, TCPT_KEEP, tp->t_keepinit);
|
Two changes, designed to make us even more resilient against TCP
ISS attacks (which we already fend off quite well).
1. First-cut implementation of RFC1948, Steve Bellovin's cryptographic
hash method of generating TCP ISS values. Note, this code is experimental
and disabled by default (experimental enough that I don't export the
variable via sysctl yet, either). There are a couple of issues I'd
like to discuss with Steve, so this code should only be used by people
who really know what they're doing.
2. Per a recent thread on Bugtraq, it's possible to determine a system's
uptime by snooping the RFC1323 TCP timestamp options sent by a host; in
4.4BSD, timestamps are created by incrementing the tcp_now variable
at 2 Hz; there's even a company out there that uses this to determine
web server uptime. According to Newsham's paper "The Problem With
Random Increments", while NetBSD's TCP ISS generation method is much
better than the "random increment" method used by FreeBSD and OpenBSD,
it is still theoretically possible to mount an attack against NetBSD's
method if the attacker knows how many times the tcp_iss_seq variable
has been incremented. By not leaking uptime information, we can make
that much harder to determine. So, we avoid the leak by giving each
TCP connection a timebase of 0.
2001-03-20 23:07:51 +03:00
|
|
|
tp->iss = tcp_new_iss(tp, 0);
|
1993-03-21 12:45:37 +03:00
|
|
|
tcp_sendseqinit(tp);
|
|
|
|
error = tcp_output(tp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create a TCP connection between two sockets.
|
|
|
|
*/
|
|
|
|
case PRU_CONNECT2:
|
|
|
|
error = EOPNOTSUPP;
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initiate disconnect from peer.
|
|
|
|
* If connection never passed embryonic stage, just drop;
|
|
|
|
* else if don't need to let data drain, then can just drop anyways,
|
|
|
|
* else have to begin TCP shutdown process: mark socket disconnecting,
|
|
|
|
* drain unread data, state switch to reflect user close, and
|
|
|
|
* send segment (e.g. FIN) to peer. Socket will be really disconnected
|
|
|
|
* when peer sends FIN and acks ours.
|
|
|
|
*
|
|
|
|
* SHOULD IMPLEMENT LATER PRU_CONNECT VIA REALLOC TCPCB.
|
|
|
|
*/
|
|
|
|
case PRU_DISCONNECT:
|
|
|
|
tp = tcp_disconnect(tp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Accept a connection. Essentially all the work is
|
|
|
|
* done at higher levels; just return the address
|
|
|
|
* of the peer, storing through addr.
|
|
|
|
*/
|
1994-01-11 02:27:39 +03:00
|
|
|
case PRU_ACCEPT:
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp)
|
|
|
|
in_setpeeraddr(inp, nam);
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p)
|
1999-07-01 12:12:45 +04:00
|
|
|
in6_setpeeraddr(in6p, nam);
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Mark the connection as being incapable of further output.
|
|
|
|
*/
|
|
|
|
case PRU_SHUTDOWN:
|
|
|
|
socantsendmore(so);
|
|
|
|
tp = tcp_usrclosed(tp);
|
|
|
|
if (tp)
|
|
|
|
error = tcp_output(tp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* After a receive, possibly send window update to peer.
|
|
|
|
*/
|
|
|
|
case PRU_RCVD:
|
2001-02-11 09:39:35 +03:00
|
|
|
/*
|
|
|
|
* soreceive() calls this function when a user receives
|
|
|
|
* ancillary data on a listening socket. We don't call
|
|
|
|
* tcp_output in such a case, since there is no header
|
|
|
|
* template for a listening socket and hence the kernel
|
|
|
|
* will panic.
|
|
|
|
*/
|
|
|
|
if ((so->so_state & (SS_ISCONNECTED|SS_ISCONNECTING)) != 0)
|
|
|
|
(void) tcp_output(tp);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do a send by putting data in output queue and updating urgent
|
|
|
|
* marker if URG set. Possibly send more data.
|
|
|
|
*/
|
|
|
|
case PRU_SEND:
|
1996-05-23 21:03:27 +04:00
|
|
|
if (control && control->m_len) {
|
|
|
|
m_freem(control);
|
|
|
|
m_freem(m);
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
2002-07-04 01:36:57 +04:00
|
|
|
sbappendstream(&so->so_snd, m);
|
1993-03-21 12:45:37 +03:00
|
|
|
error = tcp_output(tp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Abort the TCP.
|
|
|
|
*/
|
|
|
|
case PRU_ABORT:
|
|
|
|
tp = tcp_drop(tp, ECONNABORTED);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SENSE:
|
1996-05-23 20:13:19 +04:00
|
|
|
/*
|
|
|
|
* stat: don't bother with a blocksize.
|
|
|
|
*/
|
|
|
|
splx(s);
|
1993-03-21 12:45:37 +03:00
|
|
|
return (0);
|
|
|
|
|
|
|
|
case PRU_RCVOOB:
|
1996-05-23 21:03:27 +04:00
|
|
|
if (control && control->m_len) {
|
|
|
|
m_freem(control);
|
|
|
|
m_freem(m);
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
if ((so->so_oobmark == 0 &&
|
|
|
|
(so->so_state & SS_RCVATMARK) == 0) ||
|
|
|
|
so->so_options & SO_OOBINLINE ||
|
|
|
|
tp->t_oobflags & TCPOOB_HADDATA) {
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((tp->t_oobflags & TCPOOB_HAVEDATA) == 0) {
|
|
|
|
error = EWOULDBLOCK;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
m->m_len = 1;
|
2007-03-04 08:59:00 +03:00
|
|
|
*mtod(m, char *) = tp->t_iobc;
|
1995-04-13 10:35:38 +04:00
|
|
|
if (((long)nam & MSG_PEEK) == 0)
|
1993-03-21 12:45:37 +03:00
|
|
|
tp->t_oobflags ^= (TCPOOB_HAVEDATA | TCPOOB_HADDATA);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SENDOOB:
|
|
|
|
if (sbspace(&so->so_snd) < -512) {
|
|
|
|
m_freem(m);
|
|
|
|
error = ENOBUFS;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* According to RFC961 (Assigned Protocols),
|
|
|
|
* the urgent pointer points to the last octet
|
|
|
|
* of urgent data. We continue, however,
|
|
|
|
* to consider it to indicate the first octet
|
|
|
|
* of data past the urgent section.
|
|
|
|
* Otherwise, snd_up should be one lower.
|
|
|
|
*/
|
2002-07-04 01:36:57 +04:00
|
|
|
sbappendstream(&so->so_snd, m);
|
1993-03-21 12:45:37 +03:00
|
|
|
tp->snd_up = tp->snd_una + so->so_snd.sb_cc;
|
|
|
|
tp->t_force = 1;
|
|
|
|
error = tcp_output(tp);
|
|
|
|
tp->t_force = 0;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SOCKADDR:
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp)
|
|
|
|
in_setsockaddr(inp, nam);
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p)
|
1999-07-01 12:12:45 +04:00
|
|
|
in6_setsockaddr(in6p, nam);
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_PEERADDR:
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp)
|
|
|
|
in_setpeeraddr(inp, nam);
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p)
|
1999-07-01 12:12:45 +04:00
|
|
|
in6_setpeeraddr(in6p, nam);
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
panic("tcp_usrreq");
|
|
|
|
}
|
2001-07-08 20:18:56 +04:00
|
|
|
#ifdef TCP_DEBUG
|
1993-03-21 12:45:37 +03:00
|
|
|
if (tp && (so->so_options & SO_DEBUG))
|
1999-07-01 12:12:45 +04:00
|
|
|
tcp_trace(TA_USER, ostate, tp, NULL, req);
|
2001-07-08 20:18:56 +04:00
|
|
|
#endif
|
1996-05-23 20:13:19 +04:00
|
|
|
|
|
|
|
release:
|
1993-03-21 12:45:37 +03:00
|
|
|
splx(s);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
2007-06-20 19:29:17 +04:00
|
|
|
static void
|
|
|
|
change_keepalive(struct socket *so, struct tcpcb *tp)
|
|
|
|
{
|
|
|
|
tp->t_maxidle = tp->t_keepcnt * tp->t_keepintvl;
|
|
|
|
TCP_TIMER_DISARM(tp, TCPT_KEEP);
|
|
|
|
TCP_TIMER_DISARM(tp, TCPT_2MSL);
|
|
|
|
|
|
|
|
if (tp->t_state == TCPS_SYN_RECEIVED ||
|
|
|
|
tp->t_state == TCPS_SYN_SENT) {
|
|
|
|
TCP_TIMER_ARM(tp, TCPT_KEEP, tp->t_keepinit);
|
|
|
|
} else if (so->so_options & SO_KEEPALIVE &&
|
|
|
|
tp->t_state <= TCPS_CLOSE_WAIT) {
|
|
|
|
TCP_TIMER_ARM(tp, TCPT_KEEP, tp->t_keepintvl);
|
|
|
|
} else {
|
|
|
|
TCP_TIMER_ARM(tp, TCPT_KEEP, tp->t_keepidle);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((tp->t_state == TCPS_FIN_WAIT_2) && (tp->t_maxidle > 0))
|
|
|
|
TCP_TIMER_ARM(tp, TCPT_2MSL, tp->t_maxidle);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1994-01-09 02:07:16 +03:00
|
|
|
int
|
2008-08-06 19:01:23 +04:00
|
|
|
tcp_ctloutput(int op, struct socket *so, struct sockopt *sopt)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
1994-05-13 10:02:48 +04:00
|
|
|
int error = 0, s;
|
|
|
|
struct inpcb *inp;
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-03-30 16:51:13 +04:00
|
|
|
struct in6pcb *in6p;
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif
|
2000-03-30 16:51:13 +04:00
|
|
|
struct tcpcb *tp;
|
2007-06-20 19:29:17 +04:00
|
|
|
u_int ui;
|
1999-07-01 12:12:45 +04:00
|
|
|
int family; /* family of the socket */
|
2008-08-06 19:01:23 +04:00
|
|
|
int level, optname, optval;
|
|
|
|
|
|
|
|
level = sopt->sopt_level;
|
|
|
|
optname = sopt->sopt_name;
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
family = so->so_proto->pr_domain->dom_family;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1995-08-13 03:59:09 +04:00
|
|
|
s = splsoftnet();
|
1999-07-01 12:12:45 +04:00
|
|
|
switch (family) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
case PF_INET:
|
|
|
|
inp = sotoinpcb(so);
|
|
|
|
#ifdef INET6
|
|
|
|
in6p = NULL;
|
|
|
|
#endif
|
|
|
|
break;
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
|
|
|
inp = NULL;
|
|
|
|
in6p = sotoin6pcb(so);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
splx(s);
|
2006-11-10 16:19:16 +03:00
|
|
|
panic("%s: af %d", __func__, family);
|
1999-07-01 12:12:45 +04:00
|
|
|
}
|
|
|
|
#ifndef INET6
|
|
|
|
if (inp == NULL)
|
|
|
|
#else
|
|
|
|
if (inp == NULL && in6p == NULL)
|
|
|
|
#endif
|
|
|
|
{
|
1994-05-13 10:02:48 +04:00
|
|
|
splx(s);
|
|
|
|
return (ECONNRESET);
|
|
|
|
}
|
|
|
|
if (level != IPPROTO_TCP) {
|
1999-07-01 12:12:45 +04:00
|
|
|
switch (family) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
case PF_INET:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = ip_ctloutput(op, so, sopt);
|
1999-07-01 12:12:45 +04:00
|
|
|
break;
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = ip6_ctloutput(op, so, sopt);
|
1999-07-01 12:12:45 +04:00
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
splx(s);
|
|
|
|
return (error);
|
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp)
|
|
|
|
tp = intotcpcb(inp);
|
|
|
|
#ifdef INET6
|
|
|
|
else if (in6p)
|
|
|
|
tp = in6totcpcb(in6p);
|
|
|
|
#endif
|
|
|
|
else
|
|
|
|
tp = NULL;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
switch (op) {
|
|
|
|
case PRCO_SETOPT:
|
|
|
|
switch (optname) {
|
Initial commit of a port of the FreeBSD implementation of RFC 2385
(MD5 signatures for TCP, as used with BGP). Credit for original
FreeBSD code goes to Bruce M. Simpson, with FreeBSD sponsorship
credited to sentex.net. Shortening of the setsockopt() name
attributed to Vincent Jardin.
This commit is a minimal, working version of the FreeBSD code, as
MFC'ed to FreeBSD-4. It has received minimal testing with a ttcp
modified to set the TCP-MD5 option; BMS's additions to tcpdump-current
(tcpdump -M) confirm that the MD5 signatures are correct. Committed
as-is for further testing between a NetBSD BGP speaker (e.g., quagga)
and industry-standard BGP speakers (e.g., Cisco, Juniper).
NOTE: This version has two potential flaws. First, I do see any code
that verifies recieved TCP-MD5 signatures. Second, the TCP-MD5
options are internally padded and assumed to be 32-bit aligned. A more
space-efficient scheme is to pack all TCP options densely (and
possibly unaligned) into the TCP header ; then do one final padding to
a 4-byte boundary. Pre-existing comments note that accounting for
TCP-option space when we add SACK is yet to be done. For now, I'm
punting on that; we can solve it properly, in a way that will handle
SACK blocks, as a separate exercise.
In case a pullup to NetBSD-2 is requested, this adds sys/netipsec/xform_tcp.c
,and modifies:
sys/net/pfkeyv2.h,v 1.15
sys/netinet/files.netinet,v 1.5
sys/netinet/ip.h,v 1.25
sys/netinet/tcp.h,v 1.15
sys/netinet/tcp_input.c,v 1.200
sys/netinet/tcp_output.c,v 1.109
sys/netinet/tcp_subr.c,v 1.165
sys/netinet/tcp_usrreq.c,v 1.89
sys/netinet/tcp_var.h,v 1.109
sys/netipsec/files.netipsec,v 1.3
sys/netipsec/ipsec.c,v 1.11
sys/netipsec/ipsec.h,v 1.7
sys/netipsec/key.c,v 1.11
share/man/man4/tcp.4,v 1.16
lib/libipsec/pfkey.c,v 1.20
lib/libipsec/pfkey_dump.c,v 1.17
lib/libipsec/policy_token.l,v 1.8
sbin/setkey/parse.y,v 1.14
sbin/setkey/setkey.8,v 1.27
sbin/setkey/token.l,v 1.15
Note that the preceding two revisions to tcp.4 will be
required to cleanly apply this diff.
2004-04-26 02:25:03 +04:00
|
|
|
#ifdef TCP_SIGNATURE
|
|
|
|
case TCP_MD5SIG:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_getint(sopt, &optval);
|
Initial commit of a port of the FreeBSD implementation of RFC 2385
(MD5 signatures for TCP, as used with BGP). Credit for original
FreeBSD code goes to Bruce M. Simpson, with FreeBSD sponsorship
credited to sentex.net. Shortening of the setsockopt() name
attributed to Vincent Jardin.
This commit is a minimal, working version of the FreeBSD code, as
MFC'ed to FreeBSD-4. It has received minimal testing with a ttcp
modified to set the TCP-MD5 option; BMS's additions to tcpdump-current
(tcpdump -M) confirm that the MD5 signatures are correct. Committed
as-is for further testing between a NetBSD BGP speaker (e.g., quagga)
and industry-standard BGP speakers (e.g., Cisco, Juniper).
NOTE: This version has two potential flaws. First, I do see any code
that verifies recieved TCP-MD5 signatures. Second, the TCP-MD5
options are internally padded and assumed to be 32-bit aligned. A more
space-efficient scheme is to pack all TCP options densely (and
possibly unaligned) into the TCP header ; then do one final padding to
a 4-byte boundary. Pre-existing comments note that accounting for
TCP-option space when we add SACK is yet to be done. For now, I'm
punting on that; we can solve it properly, in a way that will handle
SACK blocks, as a separate exercise.
In case a pullup to NetBSD-2 is requested, this adds sys/netipsec/xform_tcp.c
,and modifies:
sys/net/pfkeyv2.h,v 1.15
sys/netinet/files.netinet,v 1.5
sys/netinet/ip.h,v 1.25
sys/netinet/tcp.h,v 1.15
sys/netinet/tcp_input.c,v 1.200
sys/netinet/tcp_output.c,v 1.109
sys/netinet/tcp_subr.c,v 1.165
sys/netinet/tcp_usrreq.c,v 1.89
sys/netinet/tcp_var.h,v 1.109
sys/netipsec/files.netipsec,v 1.3
sys/netipsec/ipsec.c,v 1.11
sys/netipsec/ipsec.h,v 1.7
sys/netipsec/key.c,v 1.11
share/man/man4/tcp.4,v 1.16
lib/libipsec/pfkey.c,v 1.20
lib/libipsec/pfkey_dump.c,v 1.17
lib/libipsec/policy_token.l,v 1.8
sbin/setkey/parse.y,v 1.14
sbin/setkey/setkey.8,v 1.27
sbin/setkey/token.l,v 1.15
Note that the preceding two revisions to tcp.4 will be
required to cleanly apply this diff.
2004-04-26 02:25:03 +04:00
|
|
|
if (error)
|
|
|
|
break;
|
2008-08-06 19:01:23 +04:00
|
|
|
if (optval > 0)
|
Initial commit of a port of the FreeBSD implementation of RFC 2385
(MD5 signatures for TCP, as used with BGP). Credit for original
FreeBSD code goes to Bruce M. Simpson, with FreeBSD sponsorship
credited to sentex.net. Shortening of the setsockopt() name
attributed to Vincent Jardin.
This commit is a minimal, working version of the FreeBSD code, as
MFC'ed to FreeBSD-4. It has received minimal testing with a ttcp
modified to set the TCP-MD5 option; BMS's additions to tcpdump-current
(tcpdump -M) confirm that the MD5 signatures are correct. Committed
as-is for further testing between a NetBSD BGP speaker (e.g., quagga)
and industry-standard BGP speakers (e.g., Cisco, Juniper).
NOTE: This version has two potential flaws. First, I do see any code
that verifies recieved TCP-MD5 signatures. Second, the TCP-MD5
options are internally padded and assumed to be 32-bit aligned. A more
space-efficient scheme is to pack all TCP options densely (and
possibly unaligned) into the TCP header ; then do one final padding to
a 4-byte boundary. Pre-existing comments note that accounting for
TCP-option space when we add SACK is yet to be done. For now, I'm
punting on that; we can solve it properly, in a way that will handle
SACK blocks, as a separate exercise.
In case a pullup to NetBSD-2 is requested, this adds sys/netipsec/xform_tcp.c
,and modifies:
sys/net/pfkeyv2.h,v 1.15
sys/netinet/files.netinet,v 1.5
sys/netinet/ip.h,v 1.25
sys/netinet/tcp.h,v 1.15
sys/netinet/tcp_input.c,v 1.200
sys/netinet/tcp_output.c,v 1.109
sys/netinet/tcp_subr.c,v 1.165
sys/netinet/tcp_usrreq.c,v 1.89
sys/netinet/tcp_var.h,v 1.109
sys/netipsec/files.netipsec,v 1.3
sys/netipsec/ipsec.c,v 1.11
sys/netipsec/ipsec.h,v 1.7
sys/netipsec/key.c,v 1.11
share/man/man4/tcp.4,v 1.16
lib/libipsec/pfkey.c,v 1.20
lib/libipsec/pfkey_dump.c,v 1.17
lib/libipsec/policy_token.l,v 1.8
sbin/setkey/parse.y,v 1.14
sbin/setkey/setkey.8,v 1.27
sbin/setkey/token.l,v 1.15
Note that the preceding two revisions to tcp.4 will be
required to cleanly apply this diff.
2004-04-26 02:25:03 +04:00
|
|
|
tp->t_flags |= TF_SIGNATURE;
|
2004-05-18 18:44:14 +04:00
|
|
|
else
|
Initial commit of a port of the FreeBSD implementation of RFC 2385
(MD5 signatures for TCP, as used with BGP). Credit for original
FreeBSD code goes to Bruce M. Simpson, with FreeBSD sponsorship
credited to sentex.net. Shortening of the setsockopt() name
attributed to Vincent Jardin.
This commit is a minimal, working version of the FreeBSD code, as
MFC'ed to FreeBSD-4. It has received minimal testing with a ttcp
modified to set the TCP-MD5 option; BMS's additions to tcpdump-current
(tcpdump -M) confirm that the MD5 signatures are correct. Committed
as-is for further testing between a NetBSD BGP speaker (e.g., quagga)
and industry-standard BGP speakers (e.g., Cisco, Juniper).
NOTE: This version has two potential flaws. First, I do see any code
that verifies recieved TCP-MD5 signatures. Second, the TCP-MD5
options are internally padded and assumed to be 32-bit aligned. A more
space-efficient scheme is to pack all TCP options densely (and
possibly unaligned) into the TCP header ; then do one final padding to
a 4-byte boundary. Pre-existing comments note that accounting for
TCP-option space when we add SACK is yet to be done. For now, I'm
punting on that; we can solve it properly, in a way that will handle
SACK blocks, as a separate exercise.
In case a pullup to NetBSD-2 is requested, this adds sys/netipsec/xform_tcp.c
,and modifies:
sys/net/pfkeyv2.h,v 1.15
sys/netinet/files.netinet,v 1.5
sys/netinet/ip.h,v 1.25
sys/netinet/tcp.h,v 1.15
sys/netinet/tcp_input.c,v 1.200
sys/netinet/tcp_output.c,v 1.109
sys/netinet/tcp_subr.c,v 1.165
sys/netinet/tcp_usrreq.c,v 1.89
sys/netinet/tcp_var.h,v 1.109
sys/netipsec/files.netipsec,v 1.3
sys/netipsec/ipsec.c,v 1.11
sys/netipsec/ipsec.h,v 1.7
sys/netipsec/key.c,v 1.11
share/man/man4/tcp.4,v 1.16
lib/libipsec/pfkey.c,v 1.20
lib/libipsec/pfkey_dump.c,v 1.17
lib/libipsec/policy_token.l,v 1.8
sbin/setkey/parse.y,v 1.14
sbin/setkey/setkey.8,v 1.27
sbin/setkey/token.l,v 1.15
Note that the preceding two revisions to tcp.4 will be
required to cleanly apply this diff.
2004-04-26 02:25:03 +04:00
|
|
|
tp->t_flags &= ~TF_SIGNATURE;
|
|
|
|
break;
|
|
|
|
#endif /* TCP_SIGNATURE */
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
case TCP_NODELAY:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_getint(sopt, &optval);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (optval)
|
1993-03-21 12:45:37 +03:00
|
|
|
tp->t_flags |= TF_NODELAY;
|
|
|
|
else
|
|
|
|
tp->t_flags &= ~TF_NODELAY;
|
|
|
|
break;
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
case TCP_MAXSEG:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_getint(sopt, &optval);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (optval > 0 && optval <= tp->t_peermss)
|
|
|
|
tp->t_peermss = optval; /* limit on send size */
|
1994-05-13 10:02:48 +04:00
|
|
|
else
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
2006-10-09 20:27:07 +04:00
|
|
|
#ifdef notyet
|
|
|
|
case TCP_CONGCTL:
|
2008-08-06 19:01:23 +04:00
|
|
|
/* XXX string overflow XXX */
|
|
|
|
error = tcp_congctl_select(tp, sopt->sopt_data);
|
2006-10-09 20:27:07 +04:00
|
|
|
break;
|
2008-08-06 19:01:23 +04:00
|
|
|
#endif
|
1994-05-13 10:02:48 +04:00
|
|
|
|
2007-06-20 19:29:17 +04:00
|
|
|
case TCP_KEEPIDLE:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &ui, sizeof(ui));
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (ui > 0) {
|
2007-06-20 19:29:17 +04:00
|
|
|
tp->t_keepidle = ui;
|
|
|
|
change_keepalive(so, tp);
|
|
|
|
} else
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TCP_KEEPINTVL:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &ui, sizeof(ui));
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (ui > 0) {
|
2007-06-20 19:29:17 +04:00
|
|
|
tp->t_keepintvl = ui;
|
|
|
|
change_keepalive(so, tp);
|
|
|
|
} else
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TCP_KEEPCNT:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &ui, sizeof(ui));
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (ui > 0) {
|
2007-06-20 19:29:17 +04:00
|
|
|
tp->t_keepcnt = ui;
|
|
|
|
change_keepalive(so, tp);
|
|
|
|
} else
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TCP_KEEPINIT:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &ui, sizeof(ui));
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
if (ui > 0) {
|
2007-06-20 19:29:17 +04:00
|
|
|
tp->t_keepinit = ui;
|
|
|
|
change_keepalive(so, tp);
|
|
|
|
} else
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
default:
|
1994-05-13 10:02:48 +04:00
|
|
|
error = ENOPROTOOPT;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRCO_GETOPT:
|
|
|
|
switch (optname) {
|
Initial commit of a port of the FreeBSD implementation of RFC 2385
(MD5 signatures for TCP, as used with BGP). Credit for original
FreeBSD code goes to Bruce M. Simpson, with FreeBSD sponsorship
credited to sentex.net. Shortening of the setsockopt() name
attributed to Vincent Jardin.
This commit is a minimal, working version of the FreeBSD code, as
MFC'ed to FreeBSD-4. It has received minimal testing with a ttcp
modified to set the TCP-MD5 option; BMS's additions to tcpdump-current
(tcpdump -M) confirm that the MD5 signatures are correct. Committed
as-is for further testing between a NetBSD BGP speaker (e.g., quagga)
and industry-standard BGP speakers (e.g., Cisco, Juniper).
NOTE: This version has two potential flaws. First, I do see any code
that verifies recieved TCP-MD5 signatures. Second, the TCP-MD5
options are internally padded and assumed to be 32-bit aligned. A more
space-efficient scheme is to pack all TCP options densely (and
possibly unaligned) into the TCP header ; then do one final padding to
a 4-byte boundary. Pre-existing comments note that accounting for
TCP-option space when we add SACK is yet to be done. For now, I'm
punting on that; we can solve it properly, in a way that will handle
SACK blocks, as a separate exercise.
In case a pullup to NetBSD-2 is requested, this adds sys/netipsec/xform_tcp.c
,and modifies:
sys/net/pfkeyv2.h,v 1.15
sys/netinet/files.netinet,v 1.5
sys/netinet/ip.h,v 1.25
sys/netinet/tcp.h,v 1.15
sys/netinet/tcp_input.c,v 1.200
sys/netinet/tcp_output.c,v 1.109
sys/netinet/tcp_subr.c,v 1.165
sys/netinet/tcp_usrreq.c,v 1.89
sys/netinet/tcp_var.h,v 1.109
sys/netipsec/files.netipsec,v 1.3
sys/netipsec/ipsec.c,v 1.11
sys/netipsec/ipsec.h,v 1.7
sys/netipsec/key.c,v 1.11
share/man/man4/tcp.4,v 1.16
lib/libipsec/pfkey.c,v 1.20
lib/libipsec/pfkey_dump.c,v 1.17
lib/libipsec/policy_token.l,v 1.8
sbin/setkey/parse.y,v 1.14
sbin/setkey/setkey.8,v 1.27
sbin/setkey/token.l,v 1.15
Note that the preceding two revisions to tcp.4 will be
required to cleanly apply this diff.
2004-04-26 02:25:03 +04:00
|
|
|
#ifdef TCP_SIGNATURE
|
|
|
|
case TCP_MD5SIG:
|
2008-08-06 19:01:23 +04:00
|
|
|
optval = (tp->t_flags & TF_SIGNATURE) ? 1 : 0;
|
|
|
|
error = sockopt_set(sopt, &optval, sizeof(optval));
|
Initial commit of a port of the FreeBSD implementation of RFC 2385
(MD5 signatures for TCP, as used with BGP). Credit for original
FreeBSD code goes to Bruce M. Simpson, with FreeBSD sponsorship
credited to sentex.net. Shortening of the setsockopt() name
attributed to Vincent Jardin.
This commit is a minimal, working version of the FreeBSD code, as
MFC'ed to FreeBSD-4. It has received minimal testing with a ttcp
modified to set the TCP-MD5 option; BMS's additions to tcpdump-current
(tcpdump -M) confirm that the MD5 signatures are correct. Committed
as-is for further testing between a NetBSD BGP speaker (e.g., quagga)
and industry-standard BGP speakers (e.g., Cisco, Juniper).
NOTE: This version has two potential flaws. First, I do see any code
that verifies recieved TCP-MD5 signatures. Second, the TCP-MD5
options are internally padded and assumed to be 32-bit aligned. A more
space-efficient scheme is to pack all TCP options densely (and
possibly unaligned) into the TCP header ; then do one final padding to
a 4-byte boundary. Pre-existing comments note that accounting for
TCP-option space when we add SACK is yet to be done. For now, I'm
punting on that; we can solve it properly, in a way that will handle
SACK blocks, as a separate exercise.
In case a pullup to NetBSD-2 is requested, this adds sys/netipsec/xform_tcp.c
,and modifies:
sys/net/pfkeyv2.h,v 1.15
sys/netinet/files.netinet,v 1.5
sys/netinet/ip.h,v 1.25
sys/netinet/tcp.h,v 1.15
sys/netinet/tcp_input.c,v 1.200
sys/netinet/tcp_output.c,v 1.109
sys/netinet/tcp_subr.c,v 1.165
sys/netinet/tcp_usrreq.c,v 1.89
sys/netinet/tcp_var.h,v 1.109
sys/netipsec/files.netipsec,v 1.3
sys/netipsec/ipsec.c,v 1.11
sys/netipsec/ipsec.h,v 1.7
sys/netipsec/key.c,v 1.11
share/man/man4/tcp.4,v 1.16
lib/libipsec/pfkey.c,v 1.20
lib/libipsec/pfkey_dump.c,v 1.17
lib/libipsec/policy_token.l,v 1.8
sbin/setkey/parse.y,v 1.14
sbin/setkey/setkey.8,v 1.27
sbin/setkey/token.l,v 1.15
Note that the preceding two revisions to tcp.4 will be
required to cleanly apply this diff.
2004-04-26 02:25:03 +04:00
|
|
|
break;
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
case TCP_NODELAY:
|
2008-08-06 19:01:23 +04:00
|
|
|
optval = tp->t_flags & TF_NODELAY;
|
|
|
|
error = sockopt_set(sopt, &optval, sizeof(optval));
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
case TCP_MAXSEG:
|
2008-08-06 19:01:23 +04:00
|
|
|
optval = tp->t_peermss;
|
|
|
|
error = sockopt_set(sopt, &optval, sizeof(optval));
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
2006-10-09 20:27:07 +04:00
|
|
|
#ifdef notyet
|
|
|
|
case TCP_CONGCTL:
|
|
|
|
break;
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
default:
|
1994-05-13 10:02:48 +04:00
|
|
|
error = ENOPROTOOPT;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
splx(s);
|
1993-03-21 12:45:37 +03:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1994-10-13 17:26:15 +03:00
|
|
|
#ifndef TCP_SENDSPACE
|
2003-09-30 01:39:35 +04:00
|
|
|
#define TCP_SENDSPACE 1024*32
|
1994-10-13 17:26:15 +03:00
|
|
|
#endif
|
1997-07-29 02:18:48 +04:00
|
|
|
int tcp_sendspace = TCP_SENDSPACE;
|
1994-10-13 17:26:15 +03:00
|
|
|
#ifndef TCP_RECVSPACE
|
2003-09-30 01:39:35 +04:00
|
|
|
#define TCP_RECVSPACE 1024*32
|
1994-10-13 17:26:15 +03:00
|
|
|
#endif
|
1997-07-29 02:18:48 +04:00
|
|
|
int tcp_recvspace = TCP_RECVSPACE;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Attach TCP protocol to socket, allocating
|
|
|
|
* internet protocol control block, tcp control block,
|
|
|
|
* bufer space, and entering LISTEN state if to accept connections.
|
|
|
|
*/
|
1994-01-09 02:07:16 +03:00
|
|
|
int
|
2005-02-04 02:50:33 +03:00
|
|
|
tcp_attach(struct socket *so)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct tcpcb *tp;
|
1993-03-21 12:45:37 +03:00
|
|
|
struct inpcb *inp;
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
struct in6pcb *in6p;
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
int error;
|
1999-07-01 12:12:45 +04:00
|
|
|
int family; /* family of the socket */
|
|
|
|
|
|
|
|
family = so->so_proto->pr_domain->dom_family;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2003-02-26 09:31:08 +03:00
|
|
|
#ifdef MBUFTRACE
|
2006-12-06 12:10:45 +03:00
|
|
|
so->so_mowner = &tcp_sock_mowner;
|
|
|
|
so->so_rcv.sb_mowner = &tcp_sock_rx_mowner;
|
|
|
|
so->so_snd.sb_mowner = &tcp_sock_tx_mowner;
|
2003-02-26 09:31:08 +03:00
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
if (so->so_snd.sb_hiwat == 0 || so->so_rcv.sb_hiwat == 0) {
|
|
|
|
error = soreserve(so, tcp_sendspace, tcp_recvspace);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
}
|
2007-08-02 06:42:40 +04:00
|
|
|
|
|
|
|
so->so_rcv.sb_flags |= SB_AUTOSIZE;
|
|
|
|
so->so_snd.sb_flags |= SB_AUTOSIZE;
|
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
switch (family) {
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
case PF_INET:
|
|
|
|
error = in_pcballoc(so, &tcbtable);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
inp = sotoinpcb(so);
|
|
|
|
#ifdef INET6
|
|
|
|
in6p = NULL;
|
|
|
|
#endif
|
|
|
|
break;
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
2003-09-04 13:16:57 +04:00
|
|
|
error = in6_pcballoc(so, &tcbtable);
|
1999-07-01 12:12:45 +04:00
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
inp = NULL;
|
|
|
|
in6p = sotoin6pcb(so);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
return EAFNOSUPPORT;
|
|
|
|
}
|
|
|
|
if (inp)
|
|
|
|
tp = tcp_newtcpcb(family, (void *)inp);
|
|
|
|
#ifdef INET6
|
|
|
|
else if (in6p)
|
|
|
|
tp = tcp_newtcpcb(family, (void *)in6p);
|
|
|
|
#endif
|
1999-07-02 16:45:32 +04:00
|
|
|
else
|
|
|
|
tp = NULL;
|
1999-07-01 12:12:45 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
if (tp == 0) {
|
|
|
|
int nofd = so->so_state & SS_NOFDREF; /* XXX */
|
|
|
|
|
|
|
|
so->so_state &= ~SS_NOFDREF; /* don't free the socket yet */
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-07-01 12:12:45 +04:00
|
|
|
if (inp)
|
|
|
|
in_pcbdetach(inp);
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
2000-10-17 07:06:42 +04:00
|
|
|
if (in6p)
|
1999-07-01 12:12:45 +04:00
|
|
|
in6_pcbdetach(in6p);
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
so->so_state |= nofd;
|
|
|
|
return (ENOBUFS);
|
|
|
|
}
|
|
|
|
tp->t_state = TCPS_CLOSED;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initiate (or continue) disconnect.
|
|
|
|
* If embryonic state, just send reset (once).
|
|
|
|
* If in ``let data drain'' option and linger null, just drop.
|
|
|
|
* Otherwise (hard), mark socket disconnecting and drop
|
|
|
|
* current input data; switch states based on user close, and
|
|
|
|
* send segment to peer (with FIN).
|
|
|
|
*/
|
|
|
|
struct tcpcb *
|
2005-02-04 02:50:33 +03:00
|
|
|
tcp_disconnect(struct tcpcb *tp)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
1999-07-01 12:12:45 +04:00
|
|
|
struct socket *so;
|
|
|
|
|
|
|
|
if (tp->t_inpcb)
|
|
|
|
so = tp->t_inpcb->inp_socket;
|
|
|
|
#ifdef INET6
|
|
|
|
else if (tp->t_in6pcb)
|
|
|
|
so = tp->t_in6pcb->in6p_socket;
|
|
|
|
#endif
|
|
|
|
else
|
|
|
|
so = NULL;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1994-10-14 19:01:48 +03:00
|
|
|
if (TCPS_HAVEESTABLISHED(tp->t_state) == 0)
|
1993-03-21 12:45:37 +03:00
|
|
|
tp = tcp_close(tp);
|
|
|
|
else if ((so->so_options & SO_LINGER) && so->so_linger == 0)
|
|
|
|
tp = tcp_drop(tp, 0);
|
|
|
|
else {
|
|
|
|
soisdisconnecting(so);
|
|
|
|
sbflush(&so->so_rcv);
|
|
|
|
tp = tcp_usrclosed(tp);
|
|
|
|
if (tp)
|
|
|
|
(void) tcp_output(tp);
|
|
|
|
}
|
|
|
|
return (tp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* User issued close, and wish to trail through shutdown states:
|
|
|
|
* if never received SYN, just forget it. If got a SYN from peer,
|
|
|
|
* but haven't sent FIN, then go to FIN_WAIT_1 state to send peer a FIN.
|
|
|
|
* If already got a FIN from peer, then almost done; go to LAST_ACK
|
|
|
|
* state. In all other cases, have already sent FIN to peer (e.g.
|
|
|
|
* after PRU_SHUTDOWN), and just have to play tedious game waiting
|
|
|
|
* for peer to send FIN or not respond to keep-alives, etc.
|
|
|
|
* We can let the user exit from the close as soon as the FIN is acked.
|
|
|
|
*/
|
|
|
|
struct tcpcb *
|
2005-02-04 02:50:33 +03:00
|
|
|
tcp_usrclosed(struct tcpcb *tp)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
switch (tp->t_state) {
|
|
|
|
|
|
|
|
case TCPS_CLOSED:
|
|
|
|
case TCPS_LISTEN:
|
|
|
|
case TCPS_SYN_SENT:
|
|
|
|
tp->t_state = TCPS_CLOSED;
|
|
|
|
tp = tcp_close(tp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TCPS_SYN_RECEIVED:
|
|
|
|
case TCPS_ESTABLISHED:
|
|
|
|
tp->t_state = TCPS_FIN_WAIT_1;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case TCPS_CLOSE_WAIT:
|
|
|
|
tp->t_state = TCPS_LAST_ACK;
|
|
|
|
break;
|
|
|
|
}
|
1996-01-31 08:37:29 +03:00
|
|
|
if (tp && tp->t_state >= TCPS_FIN_WAIT_2) {
|
1999-07-01 12:12:45 +04:00
|
|
|
struct socket *so;
|
|
|
|
if (tp->t_inpcb)
|
|
|
|
so = tp->t_inpcb->inp_socket;
|
|
|
|
#ifdef INET6
|
|
|
|
else if (tp->t_in6pcb)
|
|
|
|
so = tp->t_in6pcb->in6p_socket;
|
|
|
|
#endif
|
|
|
|
else
|
|
|
|
so = NULL;
|
2006-04-15 03:17:24 +04:00
|
|
|
if (so)
|
|
|
|
soisdisconnected(so);
|
1996-01-31 08:42:37 +03:00
|
|
|
/*
|
|
|
|
* If we are in FIN_WAIT_2, we arrived here because the
|
|
|
|
* application did a shutdown of the send side. Like the
|
|
|
|
* case of a transition from FIN_WAIT_1 to FIN_WAIT_2 after
|
|
|
|
* a full close, we start a timer to make sure sockets are
|
|
|
|
* not left in FIN_WAIT_2 forever.
|
|
|
|
*/
|
2007-06-20 19:29:17 +04:00
|
|
|
if ((tp->t_state == TCPS_FIN_WAIT_2) && (tp->t_maxidle > 0))
|
|
|
|
TCP_TIMER_ARM(tp, TCPT_2MSL, tp->t_maxidle);
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
else if (tp->t_state == TCPS_TIME_WAIT
|
|
|
|
&& ((tp->t_inpcb
|
|
|
|
&& (tcp4_vtw_enable & 1)
|
|
|
|
&& vtw_add(AF_INET, tp))
|
|
|
|
||
|
|
|
|
(tp->t_in6pcb
|
|
|
|
&& (tcp6_vtw_enable & 1)
|
|
|
|
&& vtw_add(AF_INET6, tp)))) {
|
|
|
|
tp = 0;
|
|
|
|
}
|
1996-01-31 08:37:29 +03:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
return (tp);
|
|
|
|
}
|
1995-09-30 10:02:00 +03:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
/*
|
|
|
|
* sysctl helper routine for net.inet.ip.mssdflt. it can't be less
|
|
|
|
* than 32.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
sysctl_net_inet_tcp_mssdflt(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
int error, mssdflt;
|
|
|
|
struct sysctlnode node;
|
|
|
|
|
|
|
|
mssdflt = tcp_mssdflt;
|
|
|
|
node = *rnode;
|
|
|
|
node.sysctl_data = &mssdflt;
|
|
|
|
error = sysctl_lookup(SYSCTLFN_CALL(&node));
|
|
|
|
if (error || newp == NULL)
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
if (mssdflt < 32)
|
|
|
|
return (EINVAL);
|
|
|
|
tcp_mssdflt = mssdflt;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
1998-04-30 00:43:29 +04:00
|
|
|
|
1995-09-30 10:02:00 +03:00
|
|
|
/*
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
* sysctl helper routine for setting port related values under
|
|
|
|
* net.inet.ip and net.inet6.ip6. does basic range checking and does
|
|
|
|
* additional checks for each type. this code has placed in
|
|
|
|
* tcp_input.c since INET and INET6 both use the same tcp code.
|
|
|
|
*
|
|
|
|
* this helper is not static so that both inet and inet6 can use it.
|
1995-09-30 10:02:00 +03:00
|
|
|
*/
|
|
|
|
int
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_net_inet_ip_ports(SYSCTLFN_ARGS)
|
1995-09-30 10:02:00 +03:00
|
|
|
{
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
int error, tmp;
|
|
|
|
int apmin, apmax;
|
|
|
|
#ifndef IPNOPRIVPORTS
|
|
|
|
int lpmin, lpmax;
|
|
|
|
#endif /* IPNOPRIVPORTS */
|
|
|
|
struct sysctlnode node;
|
|
|
|
|
|
|
|
if (namelen != 0)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
switch (name[-3]) {
|
|
|
|
#ifdef INET
|
|
|
|
case PF_INET:
|
|
|
|
apmin = anonportmin;
|
|
|
|
apmax = anonportmax;
|
|
|
|
#ifndef IPNOPRIVPORTS
|
|
|
|
lpmin = lowportmin;
|
|
|
|
lpmax = lowportmax;
|
|
|
|
#endif /* IPNOPRIVPORTS */
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
|
|
|
apmin = ip6_anonportmin;
|
|
|
|
apmax = ip6_anonportmax;
|
|
|
|
#ifndef IPNOPRIVPORTS
|
|
|
|
lpmin = ip6_lowportmin;
|
|
|
|
lpmax = ip6_lowportmax;
|
|
|
|
#endif /* IPNOPRIVPORTS */
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
default:
|
|
|
|
return (EINVAL);
|
1998-09-10 23:53:28 +04:00
|
|
|
}
|
1998-09-10 14:46:03 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
/*
|
|
|
|
* insert temporary copy into node, perform lookup on
|
|
|
|
* temporary, then restore pointer
|
|
|
|
*/
|
|
|
|
node = *rnode;
|
|
|
|
tmp = *(int*)rnode->sysctl_data;
|
|
|
|
node.sysctl_data = &tmp;
|
|
|
|
error = sysctl_lookup(SYSCTLFN_CALL(&node));
|
|
|
|
if (error || newp == NULL)
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* simple port range check
|
|
|
|
*/
|
|
|
|
if (tmp < 0 || tmp > 65535)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* per-node range checks
|
|
|
|
*/
|
|
|
|
switch (rnode->sysctl_num) {
|
|
|
|
case IPCTL_ANONPORTMIN:
|
2009-02-18 16:18:32 +03:00
|
|
|
case IPV6CTL_ANONPORTMIN:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
if (tmp >= apmax)
|
|
|
|
return (EINVAL);
|
|
|
|
#ifndef IPNOPRIVPORTS
|
|
|
|
if (tmp < IPPORT_RESERVED)
|
|
|
|
return (EINVAL);
|
|
|
|
#endif /* IPNOPRIVPORTS */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IPCTL_ANONPORTMAX:
|
2009-02-18 16:18:32 +03:00
|
|
|
case IPV6CTL_ANONPORTMAX:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
if (apmin >= tmp)
|
|
|
|
return (EINVAL);
|
|
|
|
#ifndef IPNOPRIVPORTS
|
|
|
|
if (tmp < IPPORT_RESERVED)
|
|
|
|
return (EINVAL);
|
|
|
|
#endif /* IPNOPRIVPORTS */
|
|
|
|
break;
|
2003-04-20 00:58:35 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#ifndef IPNOPRIVPORTS
|
|
|
|
case IPCTL_LOWPORTMIN:
|
2009-02-18 16:18:32 +03:00
|
|
|
case IPV6CTL_LOWPORTMIN:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
if (tmp >= lpmax ||
|
|
|
|
tmp > IPPORT_RESERVEDMAX ||
|
|
|
|
tmp < IPPORT_RESERVEDMIN)
|
|
|
|
return (EINVAL);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IPCTL_LOWPORTMAX:
|
2009-02-18 16:18:32 +03:00
|
|
|
case IPV6CTL_LOWPORTMAX:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
if (lpmin >= tmp ||
|
|
|
|
tmp > IPPORT_RESERVEDMAX ||
|
|
|
|
tmp < IPPORT_RESERVEDMIN)
|
|
|
|
return (EINVAL);
|
|
|
|
break;
|
|
|
|
#endif /* IPNOPRIVPORTS */
|
|
|
|
|
|
|
|
default:
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
2003-04-20 00:58:35 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
*(int*)rnode->sysctl_data = tmp;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2007-06-26 03:35:12 +04:00
|
|
|
static inline int
|
|
|
|
copyout_uid(struct socket *sockp, void *oldp, size_t *oldlenp)
|
|
|
|
{
|
|
|
|
size_t sz;
|
|
|
|
int error;
|
|
|
|
uid_t uid;
|
|
|
|
|
2009-12-30 09:59:32 +03:00
|
|
|
uid = kauth_cred_geteuid(sockp->so_cred);
|
2007-06-26 03:35:12 +04:00
|
|
|
if (oldp) {
|
|
|
|
sz = MIN(sizeof(uid), *oldlenp);
|
|
|
|
error = copyout(&uid, oldp, sz);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
*oldlenp = sizeof(uid);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int
|
|
|
|
inet4_ident_core(struct in_addr raddr, u_int rport,
|
|
|
|
struct in_addr laddr, u_int lport,
|
|
|
|
void *oldp, size_t *oldlenp,
|
|
|
|
struct lwp *l, int dodrop)
|
|
|
|
{
|
|
|
|
struct inpcb *inp;
|
|
|
|
struct socket *sockp;
|
|
|
|
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
inp = in_pcblookup_connect(&tcbtable, raddr, rport, laddr, lport, 0);
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
if (inp == NULL || (sockp = inp->inp_socket) == NULL)
|
|
|
|
return ESRCH;
|
|
|
|
|
|
|
|
if (dodrop) {
|
|
|
|
struct tcpcb *tp;
|
2009-04-16 00:44:24 +04:00
|
|
|
int error;
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
if (inp == NULL || (tp = intotcpcb(inp)) == NULL ||
|
|
|
|
(inp->inp_socket->so_options & SO_ACCEPTCONN) != 0)
|
|
|
|
return ESRCH;
|
2009-04-16 00:44:24 +04:00
|
|
|
|
|
|
|
error = kauth_authorize_network(l->l_cred, KAUTH_NETWORK_SOCKET,
|
|
|
|
KAUTH_REQ_NETWORK_SOCKET_DROP, inp->inp_socket, tp, NULL);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
(void)tcp_drop(tp, ECONNABORTED);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return copyout_uid(sockp, oldp, oldlenp);
|
|
|
|
}
|
|
|
|
|
2007-06-26 13:19:36 +04:00
|
|
|
#ifdef INET6
|
2007-06-26 03:35:12 +04:00
|
|
|
static inline int
|
|
|
|
inet6_ident_core(struct in6_addr *raddr, u_int rport,
|
|
|
|
struct in6_addr *laddr, u_int lport,
|
|
|
|
void *oldp, size_t *oldlenp,
|
|
|
|
struct lwp *l, int dodrop)
|
|
|
|
{
|
|
|
|
struct in6pcb *in6p;
|
|
|
|
struct socket *sockp;
|
|
|
|
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
in6p = in6_pcblookup_connect(&tcbtable, raddr, rport, laddr, lport, 0, 0);
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
if (in6p == NULL || (sockp = in6p->in6p_socket) == NULL)
|
|
|
|
return ESRCH;
|
|
|
|
|
|
|
|
if (dodrop) {
|
|
|
|
struct tcpcb *tp;
|
2009-04-16 00:44:24 +04:00
|
|
|
int error;
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
if (in6p == NULL || (tp = in6totcpcb(in6p)) == NULL ||
|
|
|
|
(in6p->in6p_socket->so_options & SO_ACCEPTCONN) != 0)
|
|
|
|
return ESRCH;
|
|
|
|
|
2009-04-16 00:44:24 +04:00
|
|
|
error = kauth_authorize_network(l->l_cred, KAUTH_NETWORK_SOCKET,
|
|
|
|
KAUTH_REQ_NETWORK_SOCKET_DROP, in6p->in6p_socket, tp, NULL);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
(void)tcp_drop(tp, ECONNABORTED);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return copyout_uid(sockp, oldp, oldlenp);
|
|
|
|
}
|
2007-06-26 13:19:36 +04:00
|
|
|
#endif
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* sysctl helper routine for the net.inet.tcp.drop and
|
|
|
|
* net.inet6.tcp6.drop nodes.
|
|
|
|
*/
|
|
|
|
#define sysctl_net_inet_tcp_drop sysctl_net_inet_tcp_ident
|
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
/*
|
|
|
|
* sysctl helper routine for the net.inet.tcp.ident and
|
|
|
|
* net.inet6.tcp6.ident nodes. contains backwards compat code for the
|
|
|
|
* old way of looking up the ident information for ipv4 which involves
|
|
|
|
* stuffing the port/addr pairs into the mib lookup.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
sysctl_net_inet_tcp_ident(SYSCTLFN_ARGS)
|
2003-04-20 00:58:35 +04:00
|
|
|
{
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#ifdef INET
|
|
|
|
struct sockaddr_in *si4[2];
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
struct sockaddr_in6 *si6[2];
|
|
|
|
#endif /* INET6 */
|
|
|
|
struct sockaddr_storage sa[2];
|
2008-08-20 22:35:20 +04:00
|
|
|
int error, pf, dodrop;
|
2007-06-26 03:35:12 +04:00
|
|
|
|
|
|
|
dodrop = name[-1] == TCPCTL_DROP;
|
|
|
|
if (dodrop) {
|
|
|
|
if (oldp != NULL || *oldlenp != 0)
|
|
|
|
return EINVAL;
|
|
|
|
if (newp == NULL)
|
|
|
|
return EPERM;
|
|
|
|
if (newlen < sizeof(sa))
|
|
|
|
return ENOMEM;
|
|
|
|
}
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
if (namelen != 4 && namelen != 0)
|
2007-06-26 03:35:12 +04:00
|
|
|
return EINVAL;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
if (name[-2] != IPPROTO_TCP)
|
2007-06-26 03:35:12 +04:00
|
|
|
return EINVAL;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
pf = name[-3];
|
|
|
|
|
|
|
|
/* old style lookup, ipv4 only */
|
|
|
|
if (namelen == 4) {
|
|
|
|
#ifdef INET
|
2004-03-29 08:59:02 +04:00
|
|
|
struct in_addr laddr, raddr;
|
|
|
|
u_int lport, rport;
|
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
if (pf != PF_INET)
|
2007-06-26 03:35:12 +04:00
|
|
|
return EPROTONOSUPPORT;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
raddr.s_addr = (uint32_t)name[0];
|
|
|
|
rport = (u_int)name[1];
|
|
|
|
laddr.s_addr = (uint32_t)name[2];
|
|
|
|
lport = (u_int)name[3];
|
2007-06-26 03:35:12 +04:00
|
|
|
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_enter(softnet_lock);
|
2007-06-26 03:35:12 +04:00
|
|
|
error = inet4_ident_core(raddr, rport, laddr, lport,
|
|
|
|
oldp, oldlenp, l, dodrop);
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_exit(softnet_lock);
|
2007-06-26 03:35:12 +04:00
|
|
|
return error;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#else /* INET */
|
2007-06-26 03:35:12 +04:00
|
|
|
return EINVAL;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#endif /* INET */
|
|
|
|
}
|
|
|
|
|
|
|
|
if (newp == NULL || newlen != sizeof(sa))
|
2007-06-26 03:35:12 +04:00
|
|
|
return EINVAL;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
error = copyin(newp, &sa, newlen);
|
|
|
|
if (error)
|
2007-06-26 03:35:12 +04:00
|
|
|
return error;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* requested families must match
|
|
|
|
*/
|
|
|
|
if (pf != sa[0].ss_family || sa[0].ss_family != sa[1].ss_family)
|
2007-06-26 03:35:12 +04:00
|
|
|
return EINVAL;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
|
|
|
|
switch (pf) {
|
2007-06-29 01:11:12 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
|
|
|
si6[0] = (struct sockaddr_in6*)&sa[0];
|
|
|
|
si6[1] = (struct sockaddr_in6*)&sa[1];
|
|
|
|
if (si6[0]->sin6_len != sizeof(*si6[0]) ||
|
|
|
|
si6[1]->sin6_len != sizeof(*si6[1]))
|
|
|
|
return EINVAL;
|
|
|
|
|
|
|
|
if (!IN6_IS_ADDR_V4MAPPED(&si6[0]->sin6_addr) &&
|
|
|
|
!IN6_IS_ADDR_V4MAPPED(&si6[1]->sin6_addr)) {
|
|
|
|
error = sa6_embedscope(si6[0], ip6_use_defzone);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
error = sa6_embedscope(si6[1], ip6_use_defzone);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_enter(softnet_lock);
|
2007-06-29 01:11:12 +04:00
|
|
|
error = inet6_ident_core(&si6[0]->sin6_addr,
|
|
|
|
si6[0]->sin6_port, &si6[1]->sin6_addr,
|
|
|
|
si6[1]->sin6_port, oldp, oldlenp, l, dodrop);
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_exit(softnet_lock);
|
2007-06-29 01:11:12 +04:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&si6[0]->sin6_addr) !=
|
|
|
|
IN6_IS_ADDR_V4MAPPED(&si6[1]->sin6_addr))
|
|
|
|
return EINVAL;
|
|
|
|
|
|
|
|
in6_sin6_2_sin_in_sock((struct sockaddr *)&sa[0]);
|
|
|
|
in6_sin6_2_sin_in_sock((struct sockaddr *)&sa[1]);
|
|
|
|
/*FALLTHROUGH*/
|
|
|
|
#endif /* INET6 */
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#ifdef INET
|
2007-06-26 03:35:12 +04:00
|
|
|
case PF_INET:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
si4[0] = (struct sockaddr_in*)&sa[0];
|
|
|
|
si4[1] = (struct sockaddr_in*)&sa[1];
|
|
|
|
if (si4[0]->sin_len != sizeof(*si4[0]) ||
|
2007-06-29 01:11:12 +04:00
|
|
|
si4[0]->sin_len != sizeof(*si4[1]))
|
2007-06-26 03:35:12 +04:00
|
|
|
return EINVAL;
|
|
|
|
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_enter(softnet_lock);
|
2007-06-26 03:35:12 +04:00
|
|
|
error = inet4_ident_core(si4[0]->sin_addr, si4[0]->sin_port,
|
|
|
|
si4[1]->sin_addr, si4[1]->sin_port,
|
|
|
|
oldp, oldlenp, l, dodrop);
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_exit(softnet_lock);
|
2007-06-26 03:35:12 +04:00
|
|
|
return error;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#endif /* INET */
|
2007-06-26 03:35:12 +04:00
|
|
|
default:
|
|
|
|
return EPROTONOSUPPORT;
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-03-09 08:07:19 +03:00
|
|
|
/*
|
|
|
|
* sysctl helper for the inet and inet6 pcblists. handles tcp/udp and
|
|
|
|
* inet/inet6, as well as raw pcbs for each. specifically not
|
|
|
|
* declared static so that raw sockets and udp/udp6 can use it as
|
|
|
|
* well.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
sysctl_inpcblist(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
#ifdef INET
|
|
|
|
struct sockaddr_in *in;
|
2005-05-30 01:41:23 +04:00
|
|
|
const struct inpcb *inp;
|
2005-03-09 08:07:19 +03:00
|
|
|
#endif
|
|
|
|
#ifdef INET6
|
|
|
|
struct sockaddr_in6 *in6;
|
2005-05-30 01:41:23 +04:00
|
|
|
const struct in6pcb *in6p;
|
2005-03-09 08:07:19 +03:00
|
|
|
#endif
|
2005-06-20 06:49:18 +04:00
|
|
|
/*
|
|
|
|
* sysctl_data is const, but CIRCLEQ_FOREACH can't use a const
|
|
|
|
* struct inpcbtable pointer, so we have to discard const. :-/
|
|
|
|
*/
|
2005-05-30 01:41:23 +04:00
|
|
|
struct inpcbtable *pcbtbl = __UNCONST(rnode->sysctl_data);
|
|
|
|
const struct inpcb_hdr *inph;
|
2005-03-09 08:07:19 +03:00
|
|
|
struct tcpcb *tp;
|
|
|
|
struct kinfo_pcb pcb;
|
|
|
|
char *dp;
|
|
|
|
u_int op, arg;
|
|
|
|
size_t len, needed, elem_size, out_size;
|
|
|
|
int error, elem_count, pf, proto, pf2;
|
|
|
|
|
|
|
|
if (namelen != 4)
|
|
|
|
return (EINVAL);
|
|
|
|
|
2006-04-15 03:09:16 +04:00
|
|
|
if (oldp != NULL) {
|
|
|
|
len = *oldlenp;
|
|
|
|
elem_size = name[2];
|
|
|
|
elem_count = name[3];
|
|
|
|
if (elem_size != sizeof(pcb))
|
|
|
|
return EINVAL;
|
|
|
|
} else {
|
|
|
|
len = 0;
|
|
|
|
elem_count = INT_MAX;
|
|
|
|
elem_size = sizeof(pcb);
|
|
|
|
}
|
2005-03-09 08:07:19 +03:00
|
|
|
error = 0;
|
|
|
|
dp = oldp;
|
|
|
|
op = name[0];
|
|
|
|
arg = name[1];
|
2006-04-15 03:09:16 +04:00
|
|
|
out_size = elem_size;
|
2005-03-09 08:07:19 +03:00
|
|
|
needed = 0;
|
|
|
|
|
|
|
|
if (namelen == 1 && name[0] == CTL_QUERY)
|
2005-06-09 06:19:59 +04:00
|
|
|
return (sysctl_query(SYSCTLFN_CALL(rnode)));
|
2005-03-09 08:07:19 +03:00
|
|
|
|
|
|
|
if (name - oname != 4)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
pf = oname[1];
|
|
|
|
proto = oname[2];
|
2006-04-15 04:29:25 +04:00
|
|
|
pf2 = (oldp != NULL) ? pf : 0;
|
2005-03-09 08:07:19 +03:00
|
|
|
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_enter(softnet_lock);
|
|
|
|
|
2005-03-09 08:07:19 +03:00
|
|
|
CIRCLEQ_FOREACH(inph, &pcbtbl->inpt_queue, inph_queue) {
|
2005-03-10 08:49:14 +03:00
|
|
|
#ifdef INET
|
2005-05-30 01:41:23 +04:00
|
|
|
inp = (const struct inpcb *)inph;
|
2005-03-10 08:49:14 +03:00
|
|
|
#endif
|
|
|
|
#ifdef INET6
|
2005-05-30 01:41:23 +04:00
|
|
|
in6p = (const struct in6pcb *)inph;
|
2005-03-10 08:49:14 +03:00
|
|
|
#endif
|
2005-03-09 08:07:19 +03:00
|
|
|
|
2005-03-10 08:49:14 +03:00
|
|
|
if (inph->inph_af != pf)
|
2005-03-09 08:07:19 +03:00
|
|
|
continue;
|
|
|
|
|
2006-10-13 19:39:18 +04:00
|
|
|
if (kauth_authorize_network(l->l_cred, KAUTH_NETWORK_SOCKET,
|
|
|
|
KAUTH_REQ_NETWORK_SOCKET_CANSEE, inph->inph_socket, NULL,
|
|
|
|
NULL) != 0)
|
2005-09-07 21:58:13 +04:00
|
|
|
continue;
|
|
|
|
|
2005-03-09 08:07:19 +03:00
|
|
|
memset(&pcb, 0, sizeof(pcb));
|
|
|
|
|
|
|
|
pcb.ki_family = pf;
|
|
|
|
pcb.ki_type = proto;
|
|
|
|
|
|
|
|
switch (pf2) {
|
|
|
|
case 0:
|
|
|
|
/* just probing for size */
|
|
|
|
break;
|
|
|
|
#ifdef INET
|
|
|
|
case PF_INET:
|
|
|
|
pcb.ki_family = inp->inp_socket->so_proto->
|
|
|
|
pr_domain->dom_family;
|
|
|
|
pcb.ki_type = inp->inp_socket->so_proto->
|
|
|
|
pr_type;
|
|
|
|
pcb.ki_protocol = inp->inp_socket->so_proto->
|
|
|
|
pr_protocol;
|
|
|
|
pcb.ki_pflags = inp->inp_flags;
|
|
|
|
|
|
|
|
pcb.ki_sostate = inp->inp_socket->so_state;
|
|
|
|
pcb.ki_prstate = inp->inp_state;
|
|
|
|
if (proto == IPPROTO_TCP) {
|
|
|
|
tp = intotcpcb(inp);
|
|
|
|
pcb.ki_tstate = tp->t_state;
|
|
|
|
pcb.ki_tflags = tp->t_flags;
|
|
|
|
}
|
|
|
|
|
|
|
|
pcb.ki_pcbaddr = PTRTOUINT64(inp);
|
|
|
|
pcb.ki_ppcbaddr = PTRTOUINT64(inp->inp_ppcb);
|
|
|
|
pcb.ki_sockaddr = PTRTOUINT64(inp->inp_socket);
|
|
|
|
|
|
|
|
pcb.ki_rcvq = inp->inp_socket->so_rcv.sb_cc;
|
|
|
|
pcb.ki_sndq = inp->inp_socket->so_snd.sb_cc;
|
|
|
|
|
|
|
|
in = satosin(&pcb.ki_src);
|
|
|
|
in->sin_len = sizeof(*in);
|
|
|
|
in->sin_family = pf;
|
|
|
|
in->sin_port = inp->inp_lport;
|
|
|
|
in->sin_addr = inp->inp_laddr;
|
|
|
|
if (pcb.ki_prstate >= INP_CONNECTED) {
|
|
|
|
in = satosin(&pcb.ki_dst);
|
|
|
|
in->sin_len = sizeof(*in);
|
|
|
|
in->sin_family = pf;
|
|
|
|
in->sin_port = inp->inp_fport;
|
|
|
|
in->sin_addr = inp->inp_faddr;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
#ifdef INET6
|
|
|
|
case PF_INET6:
|
|
|
|
pcb.ki_family = in6p->in6p_socket->so_proto->
|
|
|
|
pr_domain->dom_family;
|
|
|
|
pcb.ki_type = in6p->in6p_socket->so_proto->pr_type;
|
|
|
|
pcb.ki_protocol = in6p->in6p_socket->so_proto->
|
|
|
|
pr_protocol;
|
|
|
|
pcb.ki_pflags = in6p->in6p_flags;
|
|
|
|
|
|
|
|
pcb.ki_sostate = in6p->in6p_socket->so_state;
|
|
|
|
pcb.ki_prstate = in6p->in6p_state;
|
|
|
|
if (proto == IPPROTO_TCP) {
|
|
|
|
tp = in6totcpcb(in6p);
|
|
|
|
pcb.ki_tstate = tp->t_state;
|
|
|
|
pcb.ki_tflags = tp->t_flags;
|
|
|
|
}
|
|
|
|
|
|
|
|
pcb.ki_pcbaddr = PTRTOUINT64(in6p);
|
|
|
|
pcb.ki_ppcbaddr = PTRTOUINT64(in6p->in6p_ppcb);
|
|
|
|
pcb.ki_sockaddr = PTRTOUINT64(in6p->in6p_socket);
|
|
|
|
|
|
|
|
pcb.ki_rcvq = in6p->in6p_socket->so_rcv.sb_cc;
|
|
|
|
pcb.ki_sndq = in6p->in6p_socket->so_snd.sb_cc;
|
|
|
|
|
|
|
|
in6 = satosin6(&pcb.ki_src);
|
|
|
|
in6->sin6_len = sizeof(*in6);
|
|
|
|
in6->sin6_family = pf;
|
|
|
|
in6->sin6_port = in6p->in6p_lport;
|
|
|
|
in6->sin6_flowinfo = in6p->in6p_flowinfo;
|
|
|
|
in6->sin6_addr = in6p->in6p_laddr;
|
|
|
|
in6->sin6_scope_id = 0; /* XXX? */
|
|
|
|
|
|
|
|
if (pcb.ki_prstate >= IN6P_CONNECTED) {
|
|
|
|
in6 = satosin6(&pcb.ki_dst);
|
|
|
|
in6->sin6_len = sizeof(*in6);
|
|
|
|
in6->sin6_family = pf;
|
|
|
|
in6->sin6_port = in6p->in6p_fport;
|
|
|
|
in6->sin6_flowinfo = in6p->in6p_flowinfo;
|
|
|
|
in6->sin6_addr = in6p->in6p_faddr;
|
|
|
|
in6->sin6_scope_id = 0; /* XXX? */
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len >= elem_size && elem_count > 0) {
|
|
|
|
error = copyout(&pcb, dp, out_size);
|
2009-06-07 20:20:29 +04:00
|
|
|
if (error) {
|
|
|
|
mutex_exit(softnet_lock);
|
2005-03-09 08:07:19 +03:00
|
|
|
return (error);
|
2009-06-07 20:20:29 +04:00
|
|
|
}
|
2005-03-09 08:07:19 +03:00
|
|
|
dp += elem_size;
|
|
|
|
len -= elem_size;
|
|
|
|
}
|
2009-03-11 08:55:22 +03:00
|
|
|
needed += elem_size;
|
|
|
|
if (elem_count > 0 && elem_count != INT_MAX)
|
|
|
|
elem_count--;
|
2005-03-09 08:07:19 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
*oldlenp = needed;
|
|
|
|
if (oldp == NULL)
|
|
|
|
*oldlenp += PCB_SLOP * sizeof(struct kinfo_pcb);
|
|
|
|
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_exit(softnet_lock);
|
|
|
|
|
2005-03-09 08:07:19 +03:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
2006-10-09 20:27:07 +04:00
|
|
|
static int
|
|
|
|
sysctl_tcp_congctl(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
struct sysctlnode node;
|
2008-08-20 22:35:20 +04:00
|
|
|
int error;
|
2006-10-09 20:27:07 +04:00
|
|
|
char newname[TCPCC_MAXLEN];
|
|
|
|
|
|
|
|
strlcpy(newname, tcp_congctl_global_name, sizeof(newname) - 1);
|
|
|
|
|
|
|
|
node = *rnode;
|
|
|
|
node.sysctl_data = newname;
|
|
|
|
node.sysctl_size = sizeof(newname);
|
|
|
|
|
|
|
|
error = sysctl_lookup(SYSCTLFN_CALL(&node));
|
|
|
|
|
|
|
|
if (error ||
|
|
|
|
newp == NULL ||
|
|
|
|
strncmp(newname, tcp_congctl_global_name, sizeof(newname)) == 0)
|
|
|
|
return error;
|
|
|
|
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_enter(softnet_lock);
|
|
|
|
error = tcp_congctl_select(NULL, newname);
|
|
|
|
mutex_exit(softnet_lock);
|
|
|
|
|
2006-10-09 20:27:07 +04:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2007-06-20 19:29:17 +04:00
|
|
|
static int
|
|
|
|
sysctl_tcp_keep(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
int error;
|
|
|
|
u_int tmp;
|
|
|
|
struct sysctlnode node;
|
|
|
|
|
|
|
|
node = *rnode;
|
|
|
|
tmp = *(u_int *)rnode->sysctl_data;
|
|
|
|
node.sysctl_data = &tmp;
|
|
|
|
|
|
|
|
error = sysctl_lookup(SYSCTLFN_CALL(&node));
|
|
|
|
if (error || newp == NULL)
|
|
|
|
return error;
|
|
|
|
|
2008-08-20 22:35:20 +04:00
|
|
|
mutex_enter(softnet_lock);
|
|
|
|
|
2007-06-20 19:29:17 +04:00
|
|
|
*(u_int *)rnode->sysctl_data = tmp;
|
|
|
|
tcp_tcpcb_template(); /* update the template */
|
2008-08-20 22:35:20 +04:00
|
|
|
|
|
|
|
mutex_exit(softnet_lock);
|
2007-06-20 19:29:17 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-04-12 09:58:22 +04:00
|
|
|
static int
|
|
|
|
sysctl_net_inet_tcp_stats(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
|
2008-05-04 11:22:14 +04:00
|
|
|
return (NETSTAT_SYSCTL(tcpstat_percpu, TCP_NSTATS));
|
2008-04-12 09:58:22 +04:00
|
|
|
}
|
2007-06-20 19:29:17 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
/*
|
|
|
|
* this (second stage) setup routine is a replacement for tcp_sysctl()
|
|
|
|
* (which is currently used for ipv4 and ipv6)
|
|
|
|
*/
|
|
|
|
static void
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_net_inet_tcp_setup2(struct sysctllog **clog, int pf, const char *pfname,
|
|
|
|
const char *tcpname)
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
{
|
2006-10-19 18:14:34 +04:00
|
|
|
const struct sysctlnode *sack_node;
|
2006-10-19 15:40:51 +04:00
|
|
|
const struct sysctlnode *abc_node;
|
2006-10-19 18:14:34 +04:00
|
|
|
const struct sysctlnode *ecn_node;
|
|
|
|
const struct sysctlnode *congctl_node;
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
const struct sysctlnode *mslt_node;
|
|
|
|
const struct sysctlnode *vtw_node;
|
2005-09-06 06:41:14 +04:00
|
|
|
#ifdef TCP_DEBUG
|
|
|
|
extern struct tcp_debug tcp_debug[TCP_NDEBUG];
|
|
|
|
extern int tcp_debx;
|
|
|
|
#endif
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, "net", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, pfname, NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, pf, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_NODE, tcpname,
|
|
|
|
SYSCTL_DESCR("TCP related settings"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_EOL);
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "rfc1323",
|
|
|
|
SYSCTL_DESCR("Enable RFC1323 TCP extensions"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_do_rfc1323, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_RFC1323, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "sendspace",
|
|
|
|
SYSCTL_DESCR("Default TCP send buffer size"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_sendspace, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SENDSPACE, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "recvspace",
|
|
|
|
SYSCTL_DESCR("Default TCP receive buffer size"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_recvspace, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_RECVSPACE, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "mssdflt",
|
|
|
|
SYSCTL_DESCR("Default maximum segment size"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_net_inet_tcp_mssdflt, 0, &tcp_mssdflt, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_MSSDFLT, CTL_EOL);
|
2007-08-02 06:42:40 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "minmss",
|
|
|
|
SYSCTL_DESCR("Lower limit for TCP maximum segment size"),
|
|
|
|
NULL, 0, &tcp_minmss, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
2009-09-10 02:41:28 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "msl",
|
|
|
|
SYSCTL_DESCR("Maximum Segment Life"),
|
|
|
|
NULL, 0, &tcp_msl, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_MSL, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "syn_cache_limit",
|
|
|
|
SYSCTL_DESCR("Maximum number of entries in the TCP "
|
|
|
|
"compressed state engine"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_syn_cache_limit, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SYN_CACHE_LIMIT,
|
|
|
|
CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "syn_bucket_limit",
|
|
|
|
SYSCTL_DESCR("Maximum number of entries per hash "
|
|
|
|
"bucket in the TCP compressed state "
|
|
|
|
"engine"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_syn_bucket_limit, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SYN_BUCKET_LIMIT,
|
|
|
|
CTL_EOL);
|
|
|
|
#if 0 /* obsoleted */
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "syn_cache_interval",
|
|
|
|
SYSCTL_DESCR("TCP compressed state engine's timer interval"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_syn_cache_interval, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SYN_CACHE_INTER,
|
|
|
|
CTL_EOL);
|
|
|
|
#endif
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "init_win",
|
|
|
|
SYSCTL_DESCR("Initial TCP congestion window"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_init_win, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_INIT_WIN, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "mss_ifmtu",
|
|
|
|
SYSCTL_DESCR("Use interface MTU for calculating MSS"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_mss_ifmtu, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_MSS_IFMTU, CTL_EOL);
|
2005-04-05 05:07:17 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, &sack_node,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "sack",
|
|
|
|
SYSCTL_DESCR("RFC2018 Selective ACKnowledgement tunables"),
|
|
|
|
NULL, 0, NULL, 0,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SACK, CTL_EOL);
|
2006-10-19 18:14:34 +04:00
|
|
|
|
|
|
|
/* Congctl subtree */
|
|
|
|
sysctl_createv(clog, 0, NULL, &congctl_node,
|
2006-10-09 20:27:07 +04:00
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "congctl",
|
|
|
|
SYSCTL_DESCR("TCP Congestion Control"),
|
2006-10-19 18:14:34 +04:00
|
|
|
NULL, 0, NULL, 0,
|
2006-10-09 20:27:07 +04:00
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
2006-10-19 18:14:34 +04:00
|
|
|
sysctl_createv(clog, 0, &congctl_node, NULL,
|
2006-10-09 20:27:07 +04:00
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_STRING, "available",
|
|
|
|
SYSCTL_DESCR("Available Congestion Control Mechanisms"),
|
2006-10-19 18:14:34 +04:00
|
|
|
NULL, 0, &tcp_congctl_avail, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &congctl_node, NULL,
|
2006-10-09 20:27:07 +04:00
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_STRING, "selected",
|
|
|
|
SYSCTL_DESCR("Selected Congestion Control Mechanism"),
|
|
|
|
sysctl_tcp_congctl, 0, NULL, TCPCC_MAXLEN,
|
|
|
|
CTL_CREATE, CTL_EOL);
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "win_scale",
|
|
|
|
SYSCTL_DESCR("Use RFC1323 window scale options"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_do_win_scale, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_WSCALE, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "timestamps",
|
|
|
|
SYSCTL_DESCR("Use RFC1323 time stamp options"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_do_timestamps, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_TSTAMP, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "compat_42",
|
|
|
|
SYSCTL_DESCR("Enable workarounds for 4.2BSD TCP bugs"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_compat_42, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_COMPAT_42, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "cwm",
|
|
|
|
SYSCTL_DESCR("Hughes/Touch/Heidemann Congestion Window "
|
|
|
|
"Monitoring"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_cwm, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_CWM, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "cwm_burstsize",
|
|
|
|
SYSCTL_DESCR("Congestion Window Monitoring allowed "
|
|
|
|
"burst count in packets"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_cwm_burstsize, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_CWM_BURSTSIZE,
|
|
|
|
CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "ack_on_push",
|
|
|
|
SYSCTL_DESCR("Immediately return ACK when PSH is "
|
|
|
|
"received"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_ack_on_push, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_ACK_ON_PUSH, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "keepidle",
|
|
|
|
SYSCTL_DESCR("Allowed connection idle ticks before a "
|
|
|
|
"keepalive probe is sent"),
|
2007-06-20 19:29:17 +04:00
|
|
|
sysctl_tcp_keep, 0, &tcp_keepidle, 0,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_KEEPIDLE, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "keepintvl",
|
|
|
|
SYSCTL_DESCR("Ticks before next keepalive probe is sent"),
|
2007-06-20 19:29:17 +04:00
|
|
|
sysctl_tcp_keep, 0, &tcp_keepintvl, 0,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_KEEPINTVL, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "keepcnt",
|
|
|
|
SYSCTL_DESCR("Number of keepalive probes to send"),
|
2007-06-20 19:29:17 +04:00
|
|
|
sysctl_tcp_keep, 0, &tcp_keepcnt, 0,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_KEEPCNT, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_IMMEDIATE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "slowhz",
|
|
|
|
SYSCTL_DESCR("Keepalive ticks per second"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, PR_SLOWHZ, NULL, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SLOWHZ, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "log_refused",
|
|
|
|
SYSCTL_DESCR("Log refused TCP connections"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_log_refused, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_LOG_REFUSED, CTL_EOL);
|
|
|
|
#if 0 /* obsoleted */
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_INT, "rstratelimit", NULL,
|
|
|
|
NULL, 0, &tcp_rst_ratelim, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_RSTRATELIMIT, CTL_EOL);
|
|
|
|
#endif
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "rstppslimit",
|
|
|
|
SYSCTL_DESCR("Maximum number of RST packets to send "
|
|
|
|
"per second"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_rst_ppslim, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_RSTPPSLIMIT, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "delack_ticks",
|
|
|
|
SYSCTL_DESCR("Number of ticks to delay sending an ACK"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_delack_ticks, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_DELACK_TICKS, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "init_win_local",
|
|
|
|
SYSCTL_DESCR("Initial TCP window size (in segments)"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &tcp_init_win_local, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_INIT_WIN_LOCAL,
|
|
|
|
CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_STRUCT, "ident",
|
|
|
|
SYSCTL_DESCR("RFC1413 Identification Protocol lookups"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_net_inet_tcp_ident, 0, NULL, sizeof(uid_t),
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_IDENT, CTL_EOL);
|
2004-12-15 07:25:19 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "do_loopback_cksum",
|
|
|
|
SYSCTL_DESCR("Perform TCP checksum on loopback"),
|
|
|
|
NULL, 0, &tcp_do_loopback_cksum, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_LOOPBACKCKSUM,
|
|
|
|
CTL_EOL);
|
2005-03-09 08:07:19 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2005-03-11 09:16:15 +03:00
|
|
|
CTLTYPE_STRUCT, "pcblist",
|
2005-03-09 08:07:19 +03:00
|
|
|
SYSCTL_DESCR("TCP protocol control block list"),
|
|
|
|
sysctl_inpcblist, 0, &tcbtable, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE,
|
|
|
|
CTL_EOL);
|
2007-06-20 19:29:17 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "keepinit",
|
|
|
|
SYSCTL_DESCR("Ticks before initial tcp connection times out"),
|
|
|
|
sysctl_tcp_keep, 0, &tcp_keepinit, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
2005-04-05 05:07:17 +04:00
|
|
|
|
2007-08-02 06:42:40 +04:00
|
|
|
/* TCP socket buffers auto-sizing nodes */
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "recvbuf_auto",
|
|
|
|
SYSCTL_DESCR("Enable automatic receive "
|
|
|
|
"buffer sizing (experimental)"),
|
|
|
|
NULL, 0, &tcp_do_autorcvbuf, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "recvbuf_inc",
|
|
|
|
SYSCTL_DESCR("Incrementor step size of "
|
|
|
|
"automatic receive buffer"),
|
|
|
|
NULL, 0, &tcp_autorcvbuf_inc, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "recvbuf_max",
|
|
|
|
SYSCTL_DESCR("Max size of automatic receive buffer"),
|
|
|
|
NULL, 0, &tcp_autorcvbuf_max, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "sendbuf_auto",
|
|
|
|
SYSCTL_DESCR("Enable automatic send "
|
|
|
|
"buffer sizing (experimental)"),
|
|
|
|
NULL, 0, &tcp_do_autosndbuf, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "sendbuf_inc",
|
|
|
|
SYSCTL_DESCR("Incrementor step size of "
|
|
|
|
"automatic send buffer"),
|
|
|
|
NULL, 0, &tcp_autosndbuf_inc, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "sendbuf_max",
|
|
|
|
SYSCTL_DESCR("Max size of automatic send buffer"),
|
|
|
|
NULL, 0, &tcp_autosndbuf_max, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
|
2006-10-19 18:14:34 +04:00
|
|
|
/* ECN subtree */
|
|
|
|
sysctl_createv(clog, 0, NULL, &ecn_node,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "ecn",
|
|
|
|
SYSCTL_DESCR("RFC3168 Explicit Congestion Notification"),
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &ecn_node, NULL,
|
2006-09-05 04:29:35 +04:00
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "enable",
|
|
|
|
SYSCTL_DESCR("Enable TCP Explicit Congestion "
|
|
|
|
"Notification"),
|
2006-10-19 18:14:34 +04:00
|
|
|
NULL, 0, &tcp_do_ecn, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &ecn_node, NULL,
|
2006-09-05 04:29:35 +04:00
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "maxretries",
|
|
|
|
SYSCTL_DESCR("Number of times to retry ECN setup "
|
|
|
|
"before disabling ECN on the connection"),
|
2006-10-19 18:14:34 +04:00
|
|
|
NULL, 0, &tcp_ecn_maxretries, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
|
2005-04-05 05:07:17 +04:00
|
|
|
/* SACK gets it's own little subtree. */
|
|
|
|
sysctl_createv(clog, 0, NULL, &sack_node,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "enable",
|
|
|
|
SYSCTL_DESCR("Enable RFC2018 Selective ACKnowledgement"),
|
|
|
|
NULL, 0, &tcp_do_sack, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SACK, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, &sack_node,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "maxholes",
|
|
|
|
SYSCTL_DESCR("Maximum number of TCP SACK holes allowed per connection"),
|
|
|
|
NULL, 0, &tcp_sack_tp_maxholes, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SACK, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, &sack_node,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "globalmaxholes",
|
|
|
|
SYSCTL_DESCR("Global maximum number of TCP SACK holes"),
|
|
|
|
NULL, 0, &tcp_sack_globalmaxholes, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SACK, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, &sack_node,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_INT, "globalholes",
|
|
|
|
SYSCTL_DESCR("Global number of TCP SACK holes"),
|
|
|
|
NULL, 0, &tcp_sack_globalholes, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_SACK, CTL_CREATE, CTL_EOL);
|
2005-08-05 13:21:25 +04:00
|
|
|
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_STRUCT, "stats",
|
|
|
|
SYSCTL_DESCR("TCP statistics"),
|
2008-04-12 09:58:22 +04:00
|
|
|
sysctl_net_inet_tcp_stats, 0, NULL, 0,
|
2005-08-05 13:21:25 +04:00
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_STATS,
|
|
|
|
CTL_EOL);
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "local_by_rtt",
|
|
|
|
SYSCTL_DESCR("Use RTT estimator to decide which hosts "
|
|
|
|
"are local"),
|
|
|
|
NULL, 0, &tcp_rttlocal, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
2005-09-06 06:41:14 +04:00
|
|
|
#ifdef TCP_DEBUG
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_STRUCT, "debug",
|
|
|
|
SYSCTL_DESCR("TCP sockets debug information"),
|
|
|
|
NULL, 0, &tcp_debug, sizeof(tcp_debug),
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_DEBUG,
|
|
|
|
CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_INT, "debx",
|
2005-09-06 06:57:04 +04:00
|
|
|
SYSCTL_DESCR("Number of TCP debug sockets messages"),
|
2005-09-06 06:41:14 +04:00
|
|
|
NULL, 0, &tcp_debx, sizeof(tcp_debx),
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_DEBX,
|
|
|
|
CTL_EOL);
|
|
|
|
#endif
|
2007-06-26 03:35:12 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_STRUCT, "drop",
|
|
|
|
SYSCTL_DESCR("TCP drop connection"),
|
|
|
|
sysctl_net_inet_tcp_drop, 0, NULL, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, TCPCTL_DROP, CTL_EOL);
|
2006-10-16 22:13:56 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "iss_hash",
|
|
|
|
SYSCTL_DESCR("Enable RFC 1948 ISS by cryptographic "
|
|
|
|
"hash computation"),
|
|
|
|
NULL, 0, &tcp_do_rfc1948, sizeof(tcp_do_rfc1948),
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE,
|
|
|
|
CTL_EOL);
|
2005-09-06 06:41:14 +04:00
|
|
|
|
2006-10-19 15:40:51 +04:00
|
|
|
/* ABC subtree */
|
|
|
|
|
|
|
|
sysctl_createv(clog, 0, NULL, &abc_node,
|
|
|
|
CTLFLAG_PERMANENT, CTLTYPE_NODE, "abc",
|
|
|
|
SYSCTL_DESCR("RFC3465 Appropriate Byte Counting (ABC)"),
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &abc_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "enable",
|
|
|
|
SYSCTL_DESCR("Enable RFC3465 Appropriate Byte Counting"),
|
|
|
|
NULL, 0, &tcp_do_abc, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &abc_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "aggressive",
|
|
|
|
SYSCTL_DESCR("1: L=2*SMSS 0: L=1*SMSS"),
|
|
|
|
NULL, 0, &tcp_abc_aggressive, 0, CTL_CREATE, CTL_EOL);
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
|
|
|
|
/* MSL tuning subtree */
|
|
|
|
|
|
|
|
sysctl_createv(clog, 0, NULL, &mslt_node,
|
|
|
|
CTLFLAG_PERMANENT, CTLTYPE_NODE, "mslt",
|
|
|
|
SYSCTL_DESCR("MSL Tuning for TIME_WAIT truncation"),
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &mslt_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "enable",
|
|
|
|
SYSCTL_DESCR("Enable TIME_WAIT truncation"),
|
|
|
|
NULL, 0, &tcp_msl_enable, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &mslt_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "loopback",
|
|
|
|
SYSCTL_DESCR("MSL value to use for loopback connections"),
|
|
|
|
NULL, 0, &tcp_msl_loop, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &mslt_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "local",
|
|
|
|
SYSCTL_DESCR("MSL value to use for local connections"),
|
|
|
|
NULL, 0, &tcp_msl_local, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &mslt_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "remote",
|
|
|
|
SYSCTL_DESCR("MSL value to use for remote connections"),
|
|
|
|
NULL, 0, &tcp_msl_remote, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &mslt_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "remote_threshold",
|
|
|
|
SYSCTL_DESCR("RTT estimate value to promote local to remote"),
|
|
|
|
NULL, 0, &tcp_msl_remote_threshold, 0, CTL_CREATE, CTL_EOL);
|
|
|
|
|
|
|
|
/* vestigial TIME_WAIT tuning subtree */
|
|
|
|
|
|
|
|
sysctl_createv(clog, 0, NULL, &vtw_node,
|
|
|
|
CTLFLAG_PERMANENT, CTLTYPE_NODE, "vtw",
|
|
|
|
SYSCTL_DESCR("Tuning for Vestigial TIME_WAIT"),
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, pf, IPPROTO_TCP, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &vtw_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "enable",
|
|
|
|
SYSCTL_DESCR("Enable Vestigial TIME_WAIT"),
|
2011-06-06 23:15:43 +04:00
|
|
|
sysctl_tcp_vtw_enable, 0,
|
Reduces the resources demanded by TCP sessions in TIME_WAIT-state using
methods called Vestigial Time-Wait (VTW) and Maximum Segment Lifetime
Truncation (MSLT).
MSLT and VTW were contributed by Coyote Point Systems, Inc.
Even after a TCP session enters the TIME_WAIT state, its corresponding
socket and protocol control blocks (PCBs) stick around until the TCP
Maximum Segment Lifetime (MSL) expires. On a host whose workload
necessarily creates and closes down many TCP sockets, the sockets & PCBs
for TCP sessions in TIME_WAIT state amount to many megabytes of dead
weight in RAM.
Maximum Segment Lifetimes Truncation (MSLT) assigns each TCP session to
a class based on the nearness of the peer. Corresponding to each class
is an MSL, and a session uses the MSL of its class. The classes are
loopback (local host equals remote host), local (local host and remote
host are on the same link/subnet), and remote (local host and remote
host communicate via one or more gateways). Classes corresponding to
nearer peers have lower MSLs by default: 2 seconds for loopback, 10
seconds for local, 60 seconds for remote. Loopback and local sessions
expire more quickly when MSLT is used.
Vestigial Time-Wait (VTW) replaces a TIME_WAIT session's PCB/socket
dead weight with a compact representation of the session, called a
"vestigial PCB". VTW data structures are designed to be very fast and
memory-efficient: for fast insertion and lookup of vestigial PCBs,
the PCBs are stored in a hash table that is designed to minimize the
number of cacheline visits per lookup/insertion. The memory both
for vestigial PCBs and for elements of the PCB hashtable come from
fixed-size pools, and linked data structures exploit this to conserve
memory by representing references with a narrow index/offset from the
start of a pool instead of a pointer. When space for new vestigial PCBs
runs out, VTW makes room by discarding old vestigial PCBs, oldest first.
VTW cooperates with MSLT.
It may help to think of VTW as a "FIN cache" by analogy to the SYN
cache.
A 2.8-GHz Pentium 4 running a test workload that creates TIME_WAIT
sessions as fast as it can is approximately 17% idle when VTW is active
versus 0% idle when VTW is inactive. It has 103 megabytes more free RAM
when VTW is active (approximately 64k vestigial PCBs are created) than
when it is inactive.
2011-05-03 22:28:44 +04:00
|
|
|
(pf == AF_INET) ? &tcp4_vtw_enable : &tcp6_vtw_enable,
|
|
|
|
0, CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, &vtw_node, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READONLY,
|
|
|
|
CTLTYPE_INT, "entries",
|
|
|
|
SYSCTL_DESCR("Maximum number of vestigial TIME_WAIT entries"),
|
|
|
|
NULL, 0, &tcp_vtw_entries, 0, CTL_CREATE, CTL_EOL);
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
}
|
|
|
|
|
2009-09-16 19:23:04 +04:00
|
|
|
void
|
|
|
|
tcp_usrreq_init(void)
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
{
|
|
|
|
|
2009-09-16 19:23:04 +04:00
|
|
|
#ifdef INET
|
|
|
|
sysctl_net_inet_tcp_setup2(NULL, PF_INET, "inet", "tcp");
|
|
|
|
#endif
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#ifdef INET6
|
2009-09-16 19:23:04 +04:00
|
|
|
sysctl_net_inet_tcp_setup2(NULL, PF_INET6, "inet6", "tcp6");
|
|
|
|
#endif
|
2003-04-20 00:58:35 +04:00
|
|
|
}
|