2014-04-28 19:41:15 +04:00
|
|
|
/* $NetBSD: netstat.h,v 1.50 2014/04/28 15:41:15 christos Exp $ */
|
1995-10-04 00:42:34 +03:00
|
|
|
|
1994-05-13 12:06:36 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1992, 1993
|
|
|
|
* 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 15:13:06 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1994-05-13 12:06:36 +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.
|
|
|
|
*
|
|
|
|
* from: @(#)netstat.h 8.2 (Berkeley) 1/4/94
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/cdefs.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 <kvm.h>
|
1994-05-13 12:06:36 +04:00
|
|
|
|
|
|
|
int Aflag; /* show addresses of protocol control block */
|
|
|
|
int aflag; /* show all sockets (including servers) */
|
2005-08-04 23:39:40 +04:00
|
|
|
int Bflag; /* show Berkeley Packet Filter information */
|
1998-03-19 05:42:57 +03:00
|
|
|
int bflag; /* show i/f byte stats */
|
1994-05-13 12:06:36 +04:00
|
|
|
int dflag; /* show i/f dropped packets */
|
1999-01-11 15:31:53 +03:00
|
|
|
#ifndef SMALL
|
1994-05-13 12:06:36 +04:00
|
|
|
int gflag; /* show group (multicast) routing or stats */
|
1999-01-11 15:31:53 +03:00
|
|
|
#endif
|
2010-02-24 14:00:27 +03:00
|
|
|
int hflag; /* humanize byte counts */
|
1994-05-13 12:06:36 +04:00
|
|
|
int iflag; /* show interfaces */
|
1999-09-16 00:12:18 +04:00
|
|
|
int Lflag; /* don't show LLINFO entries */
|
1999-07-01 22:40:35 +04:00
|
|
|
int lflag; /* show routing table with use and ref */
|
1994-05-13 12:06:36 +04:00
|
|
|
int mflag; /* show memory stats */
|
2001-05-28 08:22:55 +04:00
|
|
|
int numeric_addr; /* show addresses numerically */
|
|
|
|
int numeric_port; /* show ports numerically */
|
2006-05-28 20:51:40 +04:00
|
|
|
int nflag; /* same as above, for show.c compat */
|
1998-06-03 06:41:10 +04:00
|
|
|
int Pflag; /* dump a PCB */
|
1994-05-13 12:06:36 +04:00
|
|
|
int pflag; /* show given protocol */
|
2002-07-03 05:42:59 +04:00
|
|
|
int qflag; /* show softintrq */
|
1994-05-13 12:06:36 +04:00
|
|
|
int rflag; /* show routing tables (or routing stats) */
|
|
|
|
int sflag; /* show protocol statistics */
|
2010-06-27 10:52:37 +04:00
|
|
|
int tagflag; /* show route tags */
|
1994-05-13 12:06:36 +04:00
|
|
|
int tflag; /* show i/f watchdog timers */
|
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
|
|
|
int Vflag; /* show Vestigial TIME_WAIT (VTW) information */
|
2002-02-27 06:55:14 +03:00
|
|
|
int vflag; /* verbose route information or don't truncate names */
|
1994-05-13 12:06:36 +04:00
|
|
|
|
|
|
|
char *interface; /* desired i/f for stats, or NULL for all i/fs */
|
|
|
|
|
|
|
|
int af; /* address family */
|
2003-02-26 09:31:08 +03:00
|
|
|
int use_sysctl; /* use sysctl instead of kmem */
|
2009-09-13 06:53:17 +04:00
|
|
|
int force_sysctl; /* force use of sysctl (or exit) - for testing */
|
1994-05-13 12:06:36 +04:00
|
|
|
|
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
int kread(u_long addr, char *buf, int size);
|
|
|
|
const char *plural(int);
|
|
|
|
const char *plurales(int);
|
|
|
|
int get_hardticks(void);
|
|
|
|
|
|
|
|
void protopr(u_long, const char *);
|
|
|
|
void tcp_stats(u_long, const char *);
|
|
|
|
void tcp_dump(u_long, const char *, u_long);
|
|
|
|
void udp_stats(u_long, const char *);
|
|
|
|
void ip_stats(u_long, const char *);
|
|
|
|
void icmp_stats(u_long, const char *);
|
|
|
|
void igmp_stats(u_long, const char *);
|
|
|
|
void pim_stats(u_long, const char *);
|
|
|
|
void arp_stats(u_long, const char *);
|
|
|
|
void carp_stats(u_long, const char *);
|
|
|
|
void pfsync_stats(u_long, const char*);
|
1999-07-01 22:40:35 +04:00
|
|
|
#ifdef IPSEC
|
2014-04-24 18:54:51 +04:00
|
|
|
void fast_ipsec_stats(u_long, const char *);
|
1999-07-01 22:40:35 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef INET6
|
1999-12-13 18:22:55 +03:00
|
|
|
struct sockaddr_in6;
|
2000-07-06 16:40:19 +04:00
|
|
|
struct in6_addr;
|
2014-04-24 18:54:51 +04:00
|
|
|
void ip6protopr(u_long, const char *);
|
|
|
|
void tcp6_stats(u_long, const char *);
|
|
|
|
void tcp6_dump(u_long, const char *, u_long);
|
|
|
|
void udp6_stats(u_long, const char *);
|
|
|
|
void ip6_stats(u_long, const char *);
|
|
|
|
void ip6_ifstats(const char *);
|
|
|
|
void icmp6_stats(u_long, const char *);
|
|
|
|
void icmp6_ifstats(const char *);
|
|
|
|
void pim6_stats(u_long, const char *);
|
|
|
|
void rip6_stats(u_long, const char *);
|
|
|
|
void mroute6pr(u_long, u_long, u_long);
|
|
|
|
void mrt6_stats(u_long, u_long);
|
|
|
|
char *routename6(struct sockaddr_in6 *);
|
1999-07-01 22:40:35 +04:00
|
|
|
#endif /*INET6*/
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2000-02-26 12:55:24 +03:00
|
|
|
#ifdef IPSEC
|
2014-04-24 18:54:51 +04:00
|
|
|
void pfkey_stats(u_long, const char *);
|
2000-02-26 12:55:24 +03:00
|
|
|
#endif
|
|
|
|
|
1999-02-27 20:37:24 +03:00
|
|
|
void mbpr(u_long, u_long, u_long, u_long, u_long);
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
void hostpr(u_long, u_long);
|
|
|
|
void impstats(u_long, u_long);
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
void pr_rthdr(int, int);
|
|
|
|
void pr_family(int);
|
2014-04-28 19:41:15 +04:00
|
|
|
struct rt_metrics;
|
|
|
|
void pr_rtrmx(struct rt_metrics *);
|
2014-04-24 18:54:51 +04:00
|
|
|
void rt_stats(u_long);
|
|
|
|
char *ns_phost(struct sockaddr *);
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2006-05-28 20:51:40 +04:00
|
|
|
void p_rttables(int);
|
2009-04-12 20:08:37 +04:00
|
|
|
void p_flags(int, const char *);
|
2006-05-28 20:51:40 +04:00
|
|
|
void p_addr(struct sockaddr *, struct sockaddr *, int);
|
|
|
|
void p_gwaddr(struct sockaddr *, int);
|
|
|
|
void p_sockaddr(struct sockaddr *, struct sockaddr *, int, int);
|
|
|
|
char *routename(struct sockaddr *);
|
|
|
|
char *routename4(in_addr_t);
|
|
|
|
char *netname(struct sockaddr *, struct sockaddr *);
|
|
|
|
char *netname4(in_addr_t, in_addr_t);
|
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
/* char *routename(u_int32_t); */
|
|
|
|
/* char *netname(u_int32_t, u_int32_t); */
|
2000-07-06 16:40:19 +04:00
|
|
|
#ifdef INET6
|
2014-04-24 18:54:51 +04:00
|
|
|
char *netname6(struct sockaddr_in6 *, struct sockaddr_in6 *);
|
2000-07-06 16:40:19 +04:00
|
|
|
#endif
|
2014-04-24 18:54:51 +04:00
|
|
|
const char *atalk_print(const struct sockaddr *, int);
|
|
|
|
const char *atalk_print2(const struct sockaddr *, const struct sockaddr *,
|
|
|
|
int);
|
|
|
|
char *ns_print(struct sockaddr *);
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
void nsprotopr(u_long, const char *);
|
|
|
|
void spp_stats(u_long, const char *);
|
|
|
|
void idp_stats(u_long, const char *);
|
|
|
|
void nserr_stats(u_long, const char *);
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
void atalkprotopr(u_long, const char *);
|
|
|
|
void ddp_stats(u_long, const char *);
|
1997-04-03 08:46:44 +04:00
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
void intpr(int, u_long, void (*)(const char *));
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
void unixpr(u_long);
|
1994-05-13 12:06:36 +04:00
|
|
|
|
2014-04-24 18:54:51 +04:00
|
|
|
void routepr(u_long);
|
|
|
|
void mroutepr(u_long, u_long, u_long, u_long);
|
|
|
|
void mrt_stats(u_long, u_long);
|
2005-08-04 23:39:40 +04:00
|
|
|
|
|
|
|
void bpf_stats(void);
|
2009-04-12 20:08:37 +04:00
|
|
|
void bpf_dump(const char *);
|
2006-05-28 20:51:40 +04: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
|
|
|
kvm_t *get_kvmd(void);
|
|
|
|
|
2011-06-21 23:42:45 +04:00
|
|
|
char *mpls_ntoa(const struct sockaddr *);
|
|
|
|
|
2013-06-20 01:12:03 +04:00
|
|
|
struct kinfo_pcb *getpcblist_sysctl(const char *, size_t *);
|
|
|
|
|
2006-05-28 20:51:40 +04:00
|
|
|
#define PLEN (LONG_BIT / 4 + 2)
|