13f8d2ce5f
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.
298 lines
7.0 KiB
C
298 lines
7.0 KiB
C
/* $NetBSD: uipc_domain.c,v 1.44 2003/12/04 19:38:24 atatat Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1982, 1986, 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.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* 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.
|
|
*
|
|
* @(#)uipc_domain.c 8.3 (Berkeley) 2/14/95
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__KERNEL_RCSID(0, "$NetBSD: uipc_domain.c,v 1.44 2003/12/04 19:38:24 atatat Exp $");
|
|
|
|
#include "opt_inet.h"
|
|
#include "opt_ipsec.h"
|
|
#include "opt_atalk.h"
|
|
#include "opt_ccitt.h"
|
|
#include "opt_iso.h"
|
|
#include "opt_ns.h"
|
|
#include "opt_mbuftrace.h"
|
|
#include "opt_natm.h"
|
|
#include "arp.h"
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/socket.h>
|
|
#include <sys/protosw.h>
|
|
#include <sys/domain.h>
|
|
#include <sys/mbuf.h>
|
|
#include <sys/time.h>
|
|
#include <sys/kernel.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/callout.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/sysctl.h>
|
|
|
|
void pffasttimo __P((void *));
|
|
void pfslowtimo __P((void *));
|
|
|
|
struct domain *domains;
|
|
|
|
struct callout pffasttimo_ch, pfslowtimo_ch;
|
|
|
|
/*
|
|
* Current time values for fast and slow timeouts. We can use u_int
|
|
* relatively safely. The fast timer will roll over in 27 years and
|
|
* the slow timer in 68 years.
|
|
*/
|
|
u_int pfslowtimo_now;
|
|
u_int pffasttimo_now;
|
|
|
|
#define ADDDOMAIN(x) { \
|
|
extern struct domain __CONCAT(x,domain); \
|
|
__CONCAT(x,domain.dom_next) = domains; \
|
|
domains = &__CONCAT(x,domain); \
|
|
}
|
|
|
|
void
|
|
domaininit()
|
|
{
|
|
struct domain *dp;
|
|
struct protosw *pr;
|
|
|
|
#undef unix
|
|
/*
|
|
* KAME NOTE: ADDDOMAIN(route) is moved to the last part so that
|
|
* it will be initialized as the *first* element. confusing!
|
|
*/
|
|
#ifndef lint
|
|
ADDDOMAIN(unix);
|
|
#ifdef INET
|
|
ADDDOMAIN(inet);
|
|
#endif
|
|
#ifdef INET6
|
|
ADDDOMAIN(inet6);
|
|
#endif
|
|
#ifdef NS
|
|
ADDDOMAIN(ns);
|
|
#endif
|
|
#ifdef ISO
|
|
ADDDOMAIN(iso);
|
|
#endif
|
|
#ifdef CCITT
|
|
ADDDOMAIN(ccitt);
|
|
#endif
|
|
#ifdef NATM
|
|
ADDDOMAIN(natm);
|
|
#endif
|
|
#ifdef NETATALK
|
|
ADDDOMAIN(atalk);
|
|
#endif
|
|
#if defined(IPSEC) || defined(FAST_IPSEC)
|
|
ADDDOMAIN(key);
|
|
#endif
|
|
#ifdef INET
|
|
#if NARP > 0
|
|
ADDDOMAIN(arp);
|
|
#endif
|
|
#endif
|
|
ADDDOMAIN(route);
|
|
#endif /* ! lint */
|
|
|
|
for (dp = domains; dp; dp = dp->dom_next) {
|
|
if (dp->dom_init)
|
|
(*dp->dom_init)();
|
|
#ifdef MBUFTRACE
|
|
if (dp->dom_mowner.mo_name[0] == '\0') {
|
|
strncpy(dp->dom_mowner.mo_name, dp->dom_name,
|
|
sizeof(dp->dom_mowner.mo_name));
|
|
MOWNER_ATTACH(&dp->dom_mowner);
|
|
}
|
|
#endif
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
if (pr->pr_init)
|
|
(*pr->pr_init)();
|
|
}
|
|
|
|
if (max_linkhdr < 16) /* XXX */
|
|
max_linkhdr = 16;
|
|
max_hdr = max_linkhdr + max_protohdr;
|
|
max_datalen = MHLEN - max_hdr;
|
|
|
|
callout_init(&pffasttimo_ch);
|
|
callout_init(&pfslowtimo_ch);
|
|
|
|
callout_reset(&pffasttimo_ch, 1, pffasttimo, NULL);
|
|
callout_reset(&pfslowtimo_ch, 1, pfslowtimo, NULL);
|
|
}
|
|
|
|
struct domain *
|
|
pffinddomain(family)
|
|
int family;
|
|
{
|
|
struct domain *dp;
|
|
|
|
for (dp = domains; dp != NULL; dp = dp->dom_next)
|
|
if (dp->dom_family == family)
|
|
return (dp);
|
|
return (NULL);
|
|
}
|
|
|
|
struct protosw *
|
|
pffindtype(family, type)
|
|
int family, type;
|
|
{
|
|
struct domain *dp;
|
|
struct protosw *pr;
|
|
|
|
dp = pffinddomain(family);
|
|
if (dp == NULL)
|
|
return (NULL);
|
|
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
if (pr->pr_type && pr->pr_type == type)
|
|
return (pr);
|
|
|
|
return (NULL);
|
|
}
|
|
|
|
struct protosw *
|
|
pffindproto(family, protocol, type)
|
|
int family, protocol, type;
|
|
{
|
|
struct domain *dp;
|
|
struct protosw *pr;
|
|
struct protosw *maybe = NULL;
|
|
|
|
if (family == 0)
|
|
return (NULL);
|
|
|
|
dp = pffinddomain(family);
|
|
if (dp == NULL)
|
|
return (NULL);
|
|
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
|
|
if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
|
|
return (pr);
|
|
|
|
if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
|
|
pr->pr_protocol == 0 && maybe == NULL)
|
|
maybe = pr;
|
|
}
|
|
return (maybe);
|
|
}
|
|
|
|
SYSCTL_SETUP(sysctl_net_setup, "sysctl net subtree setup")
|
|
{
|
|
sysctl_createv(SYSCTL_PERMANENT,
|
|
CTLTYPE_NODE, "net", NULL,
|
|
NULL, 0, NULL, 0,
|
|
CTL_NET, CTL_EOL);
|
|
|
|
sysctl_createv(SYSCTL_PERMANENT,
|
|
CTLTYPE_NODE, "local", NULL,
|
|
NULL, 0, NULL, 0,
|
|
CTL_NET, PF_LOCAL, CTL_EOL);
|
|
|
|
/*
|
|
* other protocols are expected to have their own setup
|
|
* routines that will do everything. we end up not having
|
|
* anything at all to do.
|
|
*/
|
|
}
|
|
|
|
void
|
|
pfctlinput(cmd, sa)
|
|
int cmd;
|
|
struct sockaddr *sa;
|
|
{
|
|
struct domain *dp;
|
|
struct protosw *pr;
|
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
if (pr->pr_ctlinput)
|
|
(*pr->pr_ctlinput)(cmd, sa, NULL);
|
|
}
|
|
|
|
void
|
|
pfctlinput2(cmd, sa, ctlparam)
|
|
int cmd;
|
|
struct sockaddr *sa;
|
|
void *ctlparam;
|
|
{
|
|
struct domain *dp;
|
|
struct protosw *pr;
|
|
|
|
if (!sa)
|
|
return;
|
|
for (dp = domains; dp; dp = dp->dom_next) {
|
|
/*
|
|
* the check must be made by xx_ctlinput() anyways, to
|
|
* make sure we use data item pointed to by ctlparam in
|
|
* correct way. the following check is made just for safety.
|
|
*/
|
|
if (dp->dom_family != sa->sa_family)
|
|
continue;
|
|
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
if (pr->pr_ctlinput)
|
|
(*pr->pr_ctlinput)(cmd, sa, ctlparam);
|
|
}
|
|
}
|
|
|
|
void
|
|
pfslowtimo(arg)
|
|
void *arg;
|
|
{
|
|
struct domain *dp;
|
|
struct protosw *pr;
|
|
|
|
pfslowtimo_now++;
|
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
if (pr->pr_slowtimo)
|
|
(*pr->pr_slowtimo)();
|
|
callout_reset(&pfslowtimo_ch, hz / 2, pfslowtimo, NULL);
|
|
}
|
|
|
|
void
|
|
pffasttimo(arg)
|
|
void *arg;
|
|
{
|
|
struct domain *dp;
|
|
struct protosw *pr;
|
|
|
|
pffasttimo_now++;
|
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
if (pr->pr_fasttimo)
|
|
(*pr->pr_fasttimo)();
|
|
callout_reset(&pffasttimo_ch, hz / 5, pffasttimo, NULL);
|
|
}
|