1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* 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. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. 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.2 (Berkeley) 10/18/93
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/domain.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/kernel.h>
|
1998-05-15 20:11:40 +00:00
|
|
|
#include <sys/socketvar.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/systm.h>
|
1998-05-15 20:11:40 +00:00
|
|
|
#include <vm/vm_zone.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1995-08-28 09:19:25 +00:00
|
|
|
/*
|
|
|
|
* System initialization
|
|
|
|
*
|
|
|
|
* Note: domain initialization wants to take place on a per domain basis
|
|
|
|
* as a result of traversing a linker set. Most likely, each domain
|
|
|
|
* want to call a registration function rather than being handled here
|
|
|
|
* in domaininit(). Probably this will look like:
|
|
|
|
*
|
1999-01-21 00:26:41 +00:00
|
|
|
* SYSINIT(unique, SI_SUB_PROTO_DOMAIN, SI_ORDER_ANY, domain_add, xxx)
|
1995-08-28 09:19:25 +00:00
|
|
|
*
|
|
|
|
* Where 'xxx' is replaced by the address of a parameter struct to be
|
|
|
|
* passed to the doamin_add() function.
|
|
|
|
*/
|
|
|
|
|
1995-09-09 18:10:37 +00:00
|
|
|
static void domaininit __P((void *));
|
1995-08-28 09:19:25 +00:00
|
|
|
SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL)
|
|
|
|
|
2000-11-27 22:52:31 +00:00
|
|
|
static struct callout pffast_callout;
|
|
|
|
static struct callout pfslow_callout;
|
|
|
|
|
1995-11-16 19:00:27 +00:00
|
|
|
static void pffasttimo __P((void *));
|
|
|
|
static void pfslowtimo __P((void *));
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1995-05-11 00:13:26 +00:00
|
|
|
struct domain *domains;
|
|
|
|
|
1999-01-21 00:26:41 +00:00
|
|
|
/*
|
|
|
|
* Add a new protocol domain to the list of supported domains
|
|
|
|
* Note: you cant unload it again because a socket may be using it.
|
|
|
|
* XXX can't fail at this time.
|
|
|
|
*/
|
1999-04-26 08:56:09 +00:00
|
|
|
static void
|
1999-01-21 00:26:41 +00:00
|
|
|
net_init_domain(struct domain *dp)
|
|
|
|
{
|
|
|
|
register struct protosw *pr;
|
|
|
|
int s;
|
|
|
|
|
|
|
|
s = splnet();
|
|
|
|
if (dp->dom_init)
|
|
|
|
(*dp->dom_init)();
|
|
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++){
|
|
|
|
if (pr->pr_usrreqs == 0)
|
|
|
|
panic("domaininit: %ssw[%d] has no usrreqs!",
|
|
|
|
dp->dom_name,
|
|
|
|
(int)(pr - dp->dom_protosw));
|
|
|
|
if (pr->pr_init)
|
|
|
|
(*pr->pr_init)();
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* update global informatio about maximums
|
|
|
|
*/
|
|
|
|
max_hdr = max_linkhdr + max_protohdr;
|
|
|
|
max_datalen = MHLEN - max_hdr;
|
|
|
|
splx(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add a new protocol domain to the list of supported domains
|
|
|
|
* Note: you cant unload it again because a socket may be using it.
|
|
|
|
* XXX can't fail at this time.
|
|
|
|
*/
|
1999-04-26 08:56:09 +00:00
|
|
|
void
|
|
|
|
net_add_domain(void *data)
|
1999-01-21 00:26:41 +00:00
|
|
|
{
|
1999-04-26 08:56:09 +00:00
|
|
|
int s;
|
|
|
|
struct domain *dp;
|
1999-01-21 00:26:41 +00:00
|
|
|
|
1999-04-26 08:56:09 +00:00
|
|
|
dp = (struct domain *)data;
|
1999-01-21 00:26:41 +00:00
|
|
|
s = splnet();
|
|
|
|
dp->dom_next = domains;
|
|
|
|
domains = dp;
|
|
|
|
splx(s);
|
1999-04-26 08:56:09 +00:00
|
|
|
net_init_domain(dp);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1995-08-28 09:19:25 +00:00
|
|
|
/* ARGSUSED*/
|
|
|
|
static void
|
1999-01-21 00:26:41 +00:00
|
|
|
domaininit(void *dummy)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
1998-05-15 20:11:40 +00:00
|
|
|
/*
|
|
|
|
* Before we do any setup, make sure to initialize the
|
|
|
|
* zone allocator we get struct sockets from. The obvious
|
|
|
|
* maximum number of sockets is `maxfiles', but it is possible
|
|
|
|
* to have a socket without an open file (e.g., a connection waiting
|
|
|
|
* to be accept(2)ed). Rather than think up and define a
|
|
|
|
* better value, we just use nmbclusters, since that's what people
|
|
|
|
* are told to increase first when the network runs out of memory.
|
|
|
|
* Perhaps we should have two pools, one of unlimited size
|
|
|
|
* for use during socreate(), and one ZONE_INTERRUPT pool for
|
|
|
|
* use in sonewconn().
|
|
|
|
*/
|
|
|
|
socket_zone = zinit("socket", sizeof(struct socket), maxsockets,
|
|
|
|
ZONE_INTERRUPT, 0);
|
|
|
|
|
1999-01-21 00:26:41 +00:00
|
|
|
if (max_linkhdr < 16) /* XXX */
|
|
|
|
max_linkhdr = 16;
|
|
|
|
|
2000-11-27 22:52:31 +00:00
|
|
|
callout_init(&pffast_callout, 0);
|
|
|
|
callout_init(&pfslow_callout, 0);
|
|
|
|
|
|
|
|
callout_reset(&pffast_callout, 1, pffasttimo, NULL);
|
|
|
|
callout_reset(&pfslow_callout, 1, pfslowtimo, NULL);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1995-08-28 09:19:25 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
struct protosw *
|
1997-09-16 11:44:05 +00:00
|
|
|
pffindtype(family, type)
|
|
|
|
int family;
|
|
|
|
int type;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
register struct domain *dp;
|
|
|
|
register struct protosw *pr;
|
|
|
|
|
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
|
|
|
if (dp->dom_family == family)
|
|
|
|
goto found;
|
|
|
|
return (0);
|
|
|
|
found:
|
|
|
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
|
|
|
if (pr->pr_type && pr->pr_type == type)
|
|
|
|
return (pr);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct protosw *
|
1997-09-16 11:44:05 +00:00
|
|
|
pffindproto(family, protocol, type)
|
|
|
|
int family;
|
|
|
|
int protocol;
|
|
|
|
int type;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
register struct domain *dp;
|
|
|
|
register struct protosw *pr;
|
|
|
|
struct protosw *maybe = 0;
|
|
|
|
|
|
|
|
if (family == 0)
|
|
|
|
return (0);
|
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
|
|
|
if (dp->dom_family == family)
|
|
|
|
goto found;
|
|
|
|
return (0);
|
|
|
|
found:
|
|
|
|
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 == (struct protosw *)0)
|
|
|
|
maybe = pr;
|
|
|
|
}
|
|
|
|
return (maybe);
|
|
|
|
}
|
|
|
|
|
1994-05-25 09:21:21 +00:00
|
|
|
void
|
1994-05-24 10:09:53 +00:00
|
|
|
pfctlinput(cmd, sa)
|
|
|
|
int cmd;
|
|
|
|
struct sockaddr *sa;
|
|
|
|
{
|
|
|
|
register struct domain *dp;
|
|
|
|
register 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)
|
1995-12-16 02:14:44 +00:00
|
|
|
(*pr->pr_ctlinput)(cmd, sa, (void *)0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1995-11-16 19:00:27 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
pfslowtimo(arg)
|
|
|
|
void *arg;
|
|
|
|
{
|
|
|
|
register struct domain *dp;
|
|
|
|
register struct protosw *pr;
|
|
|
|
|
|
|
|
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)();
|
2000-11-27 22:52:31 +00:00
|
|
|
callout_reset(&pfslow_callout, hz/2, pfslowtimo, NULL);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1995-11-16 19:00:27 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
pffasttimo(arg)
|
|
|
|
void *arg;
|
|
|
|
{
|
|
|
|
register struct domain *dp;
|
|
|
|
register struct protosw *pr;
|
|
|
|
|
|
|
|
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)();
|
2000-11-27 22:52:31 +00:00
|
|
|
callout_reset(&pffast_callout, hz/5, pffasttimo, NULL);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|