262 lines
6.4 KiB
C
262 lines
6.4 KiB
C
/* $NetBSD: uipc_domain.c,v 1.49 2005/01/23 18:41:56 matt 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.49 2005/01/23 18:41:56 matt Exp $");
|
|
|
|
#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/queue.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/sysctl.h>
|
|
|
|
void pffasttimo(void *);
|
|
void pfslowtimo(void *);
|
|
|
|
struct domainhead domains = STAILQ_HEAD_INITIALIZER(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;
|
|
|
|
void
|
|
domaininit()
|
|
{
|
|
__link_set_decl(domains, struct domain);
|
|
struct domain * const * dpp;
|
|
struct domain *rt_domain = NULL;
|
|
|
|
/*
|
|
* Add all of the domains. Make sure the PF_ROUTE
|
|
* domain is added last.
|
|
*/
|
|
__link_set_foreach(dpp, domains) {
|
|
if ((*dpp)->dom_family == PF_ROUTE)
|
|
rt_domain = *dpp;
|
|
else
|
|
domain_attach(*dpp);
|
|
}
|
|
if (rt_domain)
|
|
domain_attach(rt_domain);
|
|
|
|
callout_init(&pffasttimo_ch);
|
|
callout_init(&pfslowtimo_ch);
|
|
|
|
callout_reset(&pffasttimo_ch, 1, pffasttimo, NULL);
|
|
callout_reset(&pfslowtimo_ch, 1, pfslowtimo, NULL);
|
|
}
|
|
|
|
void
|
|
domain_attach(struct domain *dp)
|
|
{
|
|
const struct protosw *pr;
|
|
|
|
STAILQ_INSERT_TAIL(&domains, dp, dom_link);
|
|
|
|
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;
|
|
}
|
|
|
|
struct domain *
|
|
pffinddomain(int family)
|
|
{
|
|
struct domain *dp;
|
|
|
|
DOMAIN_FOREACH(dp)
|
|
if (dp->dom_family == family)
|
|
return (dp);
|
|
return (NULL);
|
|
}
|
|
|
|
const struct protosw *
|
|
pffindtype(int family, int type)
|
|
{
|
|
struct domain *dp;
|
|
const 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);
|
|
}
|
|
|
|
const struct protosw *
|
|
pffindproto(int family, int protocol, int type)
|
|
{
|
|
struct domain *dp;
|
|
const struct protosw *pr;
|
|
const 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(clog, 0, NULL, NULL,
|
|
CTLFLAG_PERMANENT,
|
|
CTLTYPE_NODE, "net", NULL,
|
|
NULL, 0, NULL, 0,
|
|
CTL_NET, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
CTLFLAG_PERMANENT,
|
|
CTLTYPE_NODE, "local",
|
|
SYSCTL_DESCR("PF_LOCAL related settings"),
|
|
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(int cmd, struct sockaddr *sa)
|
|
{
|
|
struct domain *dp;
|
|
const struct protosw *pr;
|
|
|
|
DOMAIN_FOREACH(dp)
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
if (pr->pr_ctlinput)
|
|
(*pr->pr_ctlinput)(cmd, sa, NULL);
|
|
}
|
|
|
|
void
|
|
pfctlinput2(int cmd, struct sockaddr *sa, void *ctlparam)
|
|
{
|
|
struct domain *dp;
|
|
const struct protosw *pr;
|
|
|
|
if (!sa)
|
|
return;
|
|
|
|
DOMAIN_FOREACH(dp) {
|
|
/*
|
|
* 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(void *arg)
|
|
{
|
|
struct domain *dp;
|
|
const struct protosw *pr;
|
|
|
|
pfslowtimo_now++;
|
|
|
|
DOMAIN_FOREACH(dp) {
|
|
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(void *arg)
|
|
{
|
|
struct domain *dp;
|
|
const struct protosw *pr;
|
|
|
|
pffasttimo_now++;
|
|
|
|
DOMAIN_FOREACH(dp) {
|
|
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);
|
|
}
|