/*
|
/*
|
* Copyright (c) 1982, 1986, 1993
|
* Copyright (c) 1982, 1986, 1993
|
* The Regents of the University of California. All rights reserved.
|
* The Regents of the University of California. All rights reserved.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 3. All advertising materials mentioning features or use of this software
|
* 3. All advertising materials mentioning features or use of this software
|
* must display the following acknowledgement:
|
* must display the following acknowledgement:
|
* This product includes software developed by the University of
|
* This product includes software developed by the University of
|
* California, Berkeley and its contributors.
|
* California, Berkeley and its contributors.
|
* 4. Neither the name of the University nor the names of 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
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* 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
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*
|
*
|
* @(#)uipc_domain.c 8.2 (Berkeley) 10/18/93
|
* @(#)uipc_domain.c 8.2 (Berkeley) 10/18/93
|
* $Id: uipc_domain.c,v 1.2 2001-09-27 12:01:51 chris Exp $
|
* $Id: uipc_domain.c,v 1.2 2001-09-27 12:01:51 chris Exp $
|
*/
|
*/
|
|
|
#include <sys/param.h>
|
#include <sys/param.h>
|
#include <sys/socket.h>
|
#include <sys/socket.h>
|
#include <sys/protosw.h>
|
#include <sys/protosw.h>
|
#include <sys/domain.h>
|
#include <sys/domain.h>
|
#include <sys/mbuf.h>
|
#include <sys/mbuf.h>
|
#include <sys/kernel.h>
|
#include <sys/kernel.h>
|
#include <sys/systm.h>
|
#include <sys/systm.h>
|
|
|
/*
|
/*
|
* System initialization
|
* System initialization
|
*
|
*
|
* Note: domain initialization wants to take place on a per domain basis
|
* Note: domain initialization wants to take place on a per domain basis
|
* as a result of traversing a linker set. Most likely, each domain
|
* as a result of traversing a linker set. Most likely, each domain
|
* want to call a registration function rather than being handled here
|
* want to call a registration function rather than being handled here
|
* in domaininit(). Probably this will look like:
|
* in domaininit(). Probably this will look like:
|
*
|
*
|
* SYSINIT(unique, SI_SUB_PROTO_DOMAI, SI_ORDER_ANY, domain_add, xxx)
|
* SYSINIT(unique, SI_SUB_PROTO_DOMAI, SI_ORDER_ANY, domain_add, xxx)
|
*
|
*
|
* Where 'xxx' is replaced by the address of a parameter struct to be
|
* Where 'xxx' is replaced by the address of a parameter struct to be
|
* passed to the doamin_add() function.
|
* passed to the doamin_add() function.
|
*/
|
*/
|
|
|
#if !defined(__rtems__)
|
#if !defined(__rtems__)
|
static int x_save_spl; /* used by kludge*/
|
static int x_save_spl; /* used by kludge*/
|
static void kludge_splimp __P((void *));
|
static void kludge_splimp __P((void *));
|
static void kludge_splx __P((void *));
|
static void kludge_splx __P((void *));
|
void domaininit __P((void *));
|
void domaininit __P((void *));
|
SYSINIT(splimp, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST, kludge_splimp, &x_save_spl)
|
SYSINIT(splimp, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST, kludge_splimp, &x_save_spl)
|
SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL)
|
SYSINIT(domain, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST, domaininit, NULL)
|
SYSINIT(splx, SI_SUB_PROTO_END, SI_ORDER_FIRST, kludge_splx, &x_save_spl)
|
SYSINIT(splx, SI_SUB_PROTO_END, SI_ORDER_FIRST, kludge_splx, &x_save_spl)
|
#endif
|
#endif
|
|
|
static void pffasttimo __P((void *));
|
static void pffasttimo __P((void *));
|
static void pfslowtimo __P((void *));
|
static void pfslowtimo __P((void *));
|
|
|
struct domain *domains;
|
struct domain *domains;
|
|
|
#define ADDDOMAIN(x) { \
|
#define ADDDOMAIN(x) { \
|
__CONCAT(x,domain.dom_next) = domains; \
|
__CONCAT(x,domain.dom_next) = domains; \
|
domains = &__CONCAT(x,domain); \
|
domains = &__CONCAT(x,domain); \
|
}
|
}
|
|
|
extern struct linker_set domain_set;
|
extern struct linker_set domain_set;
|
|
|
/* ARGSUSED*/
|
/* ARGSUSED*/
|
void
|
void
|
domaininit(dummy)
|
domaininit(dummy)
|
void *dummy;
|
void *dummy;
|
{
|
{
|
register struct domain *dp;
|
register struct domain *dp;
|
register struct protosw *pr;
|
register struct protosw *pr;
|
|
|
/* - not in our sources
|
/* - not in our sources
|
#ifdef ISDN
|
#ifdef ISDN
|
ADDDOMAIN(isdn);
|
ADDDOMAIN(isdn);
|
#endif
|
#endif
|
*/
|
*/
|
|
|
for (dp = domains; dp; dp = dp->dom_next) {
|
for (dp = domains; dp; dp = dp->dom_next) {
|
if (dp->dom_init)
|
if (dp->dom_init)
|
(*dp->dom_init)();
|
(*dp->dom_init)();
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++){
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++){
|
#ifdef PRU_OLDSTYLE
|
#ifdef PRU_OLDSTYLE
|
/* See comments in uipc_socket2.c. */
|
/* See comments in uipc_socket2.c. */
|
if (pr->pr_usrreqs == 0 && pr->pr_ousrreq)
|
if (pr->pr_usrreqs == 0 && pr->pr_ousrreq)
|
pr->pr_usrreqs = &pru_oldstyle;
|
pr->pr_usrreqs = &pru_oldstyle;
|
#endif
|
#endif
|
if (pr->pr_init)
|
if (pr->pr_init)
|
(*pr->pr_init)();
|
(*pr->pr_init)();
|
}
|
}
|
}
|
}
|
|
|
if (max_linkhdr < 16) /* XXX */
|
if (max_linkhdr < 16) /* XXX */
|
max_linkhdr = 16;
|
max_linkhdr = 16;
|
max_hdr = max_linkhdr + max_protohdr;
|
max_hdr = max_linkhdr + max_protohdr;
|
max_datalen = MHLEN - max_hdr;
|
max_datalen = MHLEN - max_hdr;
|
timeout(pffasttimo, (void *)0, 1);
|
timeout(pffasttimo, (void *)0, 1);
|
timeout(pfslowtimo, (void *)0, 1);
|
timeout(pfslowtimo, (void *)0, 1);
|
}
|
}
|
|
|
|
|
#if !defined(__rtems__)
|
#if !defined(__rtems__)
|
/*
|
/*
|
* The following two operations are kludge code. Most likely, they should
|
* The following two operations are kludge code. Most likely, they should
|
* be done as a "domainpreinit()" for the first function and then rolled
|
* be done as a "domainpreinit()" for the first function and then rolled
|
* in as the last act of "domaininit()" for the second.
|
* in as the last act of "domaininit()" for the second.
|
*
|
*
|
* In point of fact, it is questionable why other initialization prior
|
* In point of fact, it is questionable why other initialization prior
|
* to this does not also take place at splimp by default.
|
* to this does not also take place at splimp by default.
|
*/
|
*/
|
static void
|
static void
|
kludge_splimp(udata)
|
kludge_splimp(udata)
|
void *udata;
|
void *udata;
|
{
|
{
|
int *savesplp = udata;
|
int *savesplp = udata;
|
|
|
*savesplp = splimp();
|
*savesplp = splimp();
|
}
|
}
|
|
|
static void
|
static void
|
kludge_splx(udata)
|
kludge_splx(udata)
|
void *udata;
|
void *udata;
|
{
|
{
|
int *savesplp = udata;
|
int *savesplp = udata;
|
|
|
splx( *savesplp);
|
splx( *savesplp);
|
}
|
}
|
#endif /* !defined(__rtems__) */
|
#endif /* !defined(__rtems__) */
|
|
|
struct protosw *
|
struct protosw *
|
pffindtype(int family, int type)
|
pffindtype(int family, int type)
|
{
|
{
|
register struct domain *dp;
|
register struct domain *dp;
|
register struct protosw *pr;
|
register struct protosw *pr;
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (dp = domains; dp; dp = dp->dom_next)
|
if (dp->dom_family == family)
|
if (dp->dom_family == family)
|
goto found;
|
goto found;
|
return (0);
|
return (0);
|
found:
|
found:
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
if (pr->pr_type && pr->pr_type == type)
|
if (pr->pr_type && pr->pr_type == type)
|
return (pr);
|
return (pr);
|
return (0);
|
return (0);
|
}
|
}
|
|
|
struct protosw *
|
struct protosw *
|
pffindproto(int family, int protocol, int type)
|
pffindproto(int family, int protocol, int type)
|
{
|
{
|
register struct domain *dp;
|
register struct domain *dp;
|
register struct protosw *pr;
|
register struct protosw *pr;
|
struct protosw *maybe = 0;
|
struct protosw *maybe = 0;
|
|
|
if (family == 0)
|
if (family == 0)
|
return (0);
|
return (0);
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (dp = domains; dp; dp = dp->dom_next)
|
if (dp->dom_family == family)
|
if (dp->dom_family == family)
|
goto found;
|
goto found;
|
return (0);
|
return (0);
|
found:
|
found:
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
|
if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
|
if ((pr->pr_protocol == protocol) && (pr->pr_type == type))
|
return (pr);
|
return (pr);
|
|
|
if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
|
if (type == SOCK_RAW && pr->pr_type == SOCK_RAW &&
|
pr->pr_protocol == 0 && maybe == (struct protosw *)0)
|
pr->pr_protocol == 0 && maybe == (struct protosw *)0)
|
maybe = pr;
|
maybe = pr;
|
}
|
}
|
return (maybe);
|
return (maybe);
|
}
|
}
|
|
|
void
|
void
|
pfctlinput(cmd, sa)
|
pfctlinput(cmd, sa)
|
int cmd;
|
int cmd;
|
struct sockaddr *sa;
|
struct sockaddr *sa;
|
{
|
{
|
register struct domain *dp;
|
register struct domain *dp;
|
register struct protosw *pr;
|
register struct protosw *pr;
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
if (pr->pr_ctlinput)
|
if (pr->pr_ctlinput)
|
(*pr->pr_ctlinput)(cmd, sa, (void *)0);
|
(*pr->pr_ctlinput)(cmd, sa, (void *)0);
|
}
|
}
|
|
|
static void
|
static void
|
pfslowtimo(arg)
|
pfslowtimo(arg)
|
void *arg;
|
void *arg;
|
{
|
{
|
register struct domain *dp;
|
register struct domain *dp;
|
register struct protosw *pr;
|
register struct protosw *pr;
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
if (pr->pr_slowtimo)
|
if (pr->pr_slowtimo)
|
(*pr->pr_slowtimo)();
|
(*pr->pr_slowtimo)();
|
timeout(pfslowtimo, (void *)0, hz/2);
|
timeout(pfslowtimo, (void *)0, hz/2);
|
}
|
}
|
|
|
static void
|
static void
|
pffasttimo(arg)
|
pffasttimo(arg)
|
void *arg;
|
void *arg;
|
{
|
{
|
register struct domain *dp;
|
register struct domain *dp;
|
register struct protosw *pr;
|
register struct protosw *pr;
|
|
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (dp = domains; dp; dp = dp->dom_next)
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++)
|
if (pr->pr_fasttimo)
|
if (pr->pr_fasttimo)
|
(*pr->pr_fasttimo)();
|
(*pr->pr_fasttimo)();
|
timeout(pffasttimo, (void *)0, hz/5);
|
timeout(pffasttimo, (void *)0, hz/5);
|
}
|
}
|
|
|
