2015-05-24 18:43:45 +03:00
|
|
|
/* $NetBSD: in6_pcb.h,v 1.46 2015/05/24 15:43:45 rtr Exp $ */
|
2001-02-11 09:49:49 +03:00
|
|
|
/* $KAME: in6_pcb.h,v 1.45 2001/02/09 05:59:46 itojun Exp $ */
|
1999-07-04 01:24:45 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
|
* All rights reserved.
|
2000-06-05 10:38:22 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +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.
|
2000-06-05 10:38:22 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +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.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Copyright (c) 1982, 1986, 1990, 1993
|
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* 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
|
1999-06-28 10:36:47 +04: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.
|
|
|
|
|
*
|
|
|
|
|
* @(#)in_pcb.h 8.1 (Berkeley) 6/10/93
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef _NETINET6_IN6_PCB_H_
|
|
|
|
|
#define _NETINET6_IN6_PCB_H_
|
|
|
|
|
|
|
|
|
|
#include <sys/queue.h>
|
2003-09-04 13:16:57 +04:00
|
|
|
#include <netinet/in_pcb_hdr.h>
|
2015-03-30 05:23:21 +03:00
|
|
|
#include <netinet/ip6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Common structure pcb for internet protocol implementation.
|
|
|
|
|
* Here are stored pointers to local and foreign host table
|
|
|
|
|
* entries, local and foreign socket numbers, and pointers
|
|
|
|
|
* up (to a socket structure) and down (to a protocol-specific)
|
|
|
|
|
* control block.
|
|
|
|
|
*/
|
|
|
|
|
struct icmp6_filter;
|
|
|
|
|
|
|
|
|
|
struct in6pcb {
|
2003-09-04 13:16:57 +04:00
|
|
|
struct inpcb_hdr in6p_head;
|
2011-09-24 21:22:14 +04:00
|
|
|
#define in6p_hash in6p_head.inph_hash
|
|
|
|
|
#define in6p_queue in6p_head.inph_queue
|
|
|
|
|
#define in6p_af in6p_head.inph_af
|
|
|
|
|
#define in6p_ppcb in6p_head.inph_ppcb
|
|
|
|
|
#define in6p_state in6p_head.inph_state
|
2012-06-25 19:28:38 +04:00
|
|
|
#define in6p_portalgo in6p_head.inph_portalgo
|
2011-09-24 21:22:14 +04:00
|
|
|
#define in6p_socket in6p_head.inph_socket
|
|
|
|
|
#define in6p_table in6p_head.inph_table
|
|
|
|
|
#define in6p_sp in6p_head.inph_sp
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
struct route in6p_route; /* placeholder for routing entry */
|
2000-02-03 16:17:39 +03:00
|
|
|
u_int16_t in6p_fport; /* foreign port */
|
|
|
|
|
u_int16_t in6p_lport; /* local port */
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t in6p_flowinfo; /* priority and flowlabel */
|
1999-06-28 10:36:47 +04:00
|
|
|
int in6p_flags; /* generic IP6/datagram flags */
|
|
|
|
|
int in6p_hops; /* default hop limit */
|
|
|
|
|
struct ip6_hdr in6p_ip6; /* header prototype */
|
|
|
|
|
struct mbuf *in6p_options; /* IP6 options */
|
|
|
|
|
struct ip6_pktopts *in6p_outputopts; /* IP6 options for outgoing packets */
|
|
|
|
|
struct ip6_moptions *in6p_moptions; /* IP6 multicast options */
|
|
|
|
|
struct icmp6_filter *in6p_icmp6filt;
|
|
|
|
|
int in6p_cksum; /* IPV6_CHECKSUM setsockopt */
|
2011-09-24 21:22:14 +04:00
|
|
|
bool in6p_bindportonsend;
|
2014-10-12 00:53:16 +04:00
|
|
|
struct ip_moptions *in6p_v4moptions;/* IP4 multicast options */
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
|
|
|
|
|
2003-08-25 04:14:30 +04:00
|
|
|
#define in6p_faddr in6p_ip6.ip6_dst
|
|
|
|
|
#define in6p_laddr in6p_ip6.ip6_src
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-09-04 13:16:57 +04:00
|
|
|
/* states in inp_state: */
|
|
|
|
|
#define IN6P_ATTACHED INP_ATTACHED
|
|
|
|
|
#define IN6P_BOUND INP_BOUND
|
|
|
|
|
#define IN6P_CONNECTED INP_CONNECTED
|
|
|
|
|
|
1999-12-27 09:38:47 +03:00
|
|
|
/*
|
|
|
|
|
* Flags in in6p_flags
|
|
|
|
|
* We define KAME's original flags in higher 16 bits as much as possible
|
|
|
|
|
* for compatibility with *bsd*s.
|
|
|
|
|
*/
|
|
|
|
|
#define IN6P_RECVOPTS 0x001000 /* receive incoming IP6 options */
|
|
|
|
|
#define IN6P_RECVRETOPTS 0x002000 /* receive IP6 options for reply */
|
|
|
|
|
#define IN6P_RECVDSTADDR 0x004000 /* receive IP6 dst address */
|
2001-10-15 13:51:15 +04:00
|
|
|
#define IN6P_IPV6_V6ONLY 0x008000 /* restrict AF_INET6 socket for v6 */
|
1999-12-27 09:38:47 +03:00
|
|
|
#define IN6P_PKTINFO 0x010000 /* receive IP6 dst and I/F */
|
|
|
|
|
#define IN6P_HOPLIMIT 0x020000 /* receive hoplimit */
|
|
|
|
|
#define IN6P_HOPOPTS 0x040000 /* receive hop-by-hop options */
|
|
|
|
|
#define IN6P_DSTOPTS 0x080000 /* receive dst options after rthdr */
|
|
|
|
|
#define IN6P_RTHDR 0x100000 /* receive routing header */
|
|
|
|
|
#define IN6P_RTHDRDSTOPTS 0x200000 /* receive dstoptions before rthdr */
|
2006-05-05 04:03:21 +04:00
|
|
|
#define IN6P_TCLASS 0x400000 /* traffic class */
|
1999-12-27 09:38:47 +03:00
|
|
|
|
|
|
|
|
#define IN6P_HIGHPORT 0x1000000 /* user wants "high" port binding */
|
|
|
|
|
#define IN6P_LOWPORT 0x2000000 /* user wants "low" port binding */
|
|
|
|
|
#define IN6P_ANONPORT 0x4000000 /* port chosen for user */
|
|
|
|
|
#define IN6P_FAITH 0x8000000 /* accept FAITH'ed connections */
|
2006-05-05 04:03:21 +04:00
|
|
|
|
|
|
|
|
#define IN6P_RFC2292 0x40000000 /* RFC2292 */
|
|
|
|
|
#define IN6P_MTU 0x80000000 /* use minimum MTU */
|
1999-12-27 09:38:47 +03:00
|
|
|
|
|
|
|
|
#define IN6P_CONTROLOPTS (IN6P_PKTINFO|IN6P_HOPLIMIT|IN6P_HOPOPTS|\
|
2004-06-11 08:10:10 +04:00
|
|
|
IN6P_DSTOPTS|IN6P_RTHDR|IN6P_RTHDRDSTOPTS|\
|
2006-05-05 04:03:21 +04:00
|
|
|
IN6P_TCLASS|IN6P_RFC2292|\
|
|
|
|
|
IN6P_MTU)
|
1999-12-27 09:38:47 +03:00
|
|
|
|
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
|
|
|
#ifdef _KERNEL
|
1999-06-28 10:36:47 +04:00
|
|
|
/* compute hash value for foreign and local in6_addr and port */
|
|
|
|
|
#define IN6_HASH(faddr, fport, laddr, lport) \
|
|
|
|
|
(((faddr)->s6_addr32[0] ^ (faddr)->s6_addr32[1] ^ \
|
|
|
|
|
(faddr)->s6_addr32[2] ^ (faddr)->s6_addr32[3] ^ \
|
|
|
|
|
(laddr)->s6_addr32[0] ^ (laddr)->s6_addr32[1] ^ \
|
|
|
|
|
(laddr)->s6_addr32[2] ^ (laddr)->s6_addr32[3]) \
|
|
|
|
|
+ (fport) + (lport))
|
|
|
|
|
|
|
|
|
|
#define sotoin6pcb(so) ((struct in6pcb *)(so)->so_pcb)
|
|
|
|
|
|
2006-01-26 21:59:18 +03:00
|
|
|
void in6_losing(struct in6pcb *);
|
|
|
|
|
void in6_pcbinit(struct inpcbtable *, int, int);
|
|
|
|
|
int in6_pcballoc(struct socket *, void *);
|
2015-04-03 23:01:07 +03:00
|
|
|
int in6_pcbbind(void *, struct sockaddr_in6 *, struct lwp *);
|
2015-05-02 20:18:03 +03:00
|
|
|
int in6_pcbconnect(void *, struct sockaddr_in6 *, struct lwp *);
|
2006-01-26 21:59:18 +03:00
|
|
|
void in6_pcbdetach(struct in6pcb *);
|
|
|
|
|
void in6_pcbdisconnect(struct in6pcb *);
|
|
|
|
|
struct in6pcb *in6_pcblookup_port(struct inpcbtable *, struct in6_addr *,
|
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
|
|
|
u_int, int, struct vestigial_inpcb *);
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
int in6_pcbnotify(struct inpcbtable *, const struct sockaddr *,
|
2005-05-30 01:43:51 +04:00
|
|
|
u_int, const struct sockaddr *, u_int, int, void *,
|
2006-01-26 21:59:18 +03:00
|
|
|
void (*)(struct in6pcb *, int));
|
|
|
|
|
void in6_pcbpurgeif0(struct inpcbtable *, struct ifnet *);
|
|
|
|
|
void in6_pcbpurgeif(struct inpcbtable *, struct ifnet *);
|
|
|
|
|
void in6_pcbstate(struct in6pcb *, int);
|
|
|
|
|
void in6_rtchange(struct in6pcb *, int);
|
2015-04-25 01:32:37 +03:00
|
|
|
void in6_setpeeraddr(struct in6pcb *, struct sockaddr_in6 *);
|
|
|
|
|
void in6_setsockaddr(struct in6pcb *, struct sockaddr_in6 *);
|
2000-07-07 19:54:16 +04:00
|
|
|
|
|
|
|
|
/* in in6_src.c */
|
2006-01-26 21:59:18 +03:00
|
|
|
int in6_selecthlim(struct in6pcb *, struct ifnet *);
|
2015-04-27 05:59:44 +03:00
|
|
|
int in6_selecthlim_rt(struct in6pcb *);
|
2009-04-30 22:18:34 +04:00
|
|
|
int in6_pcbsetport(struct sockaddr_in6 *, struct in6pcb *, struct lwp *);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
|
extern struct rtentry *
|
2006-01-26 21:59:18 +03:00
|
|
|
in6_pcbrtentry(struct in6pcb *);
|
|
|
|
|
extern struct in6pcb *in6_pcblookup_connect(struct inpcbtable *,
|
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 in6_addr *, u_int, const struct in6_addr *, u_int, int,
|
|
|
|
|
struct vestigial_inpcb *);
|
2006-01-26 21:59:18 +03:00
|
|
|
extern struct in6pcb *in6_pcblookup_bind(struct inpcbtable *,
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
const struct in6_addr *, u_int, int);
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif /* _KERNEL */
|
|
|
|
|
|
|
|
|
|
#endif /* !_NETINET6_IN6_PCB_H_ */
|