//==========================================================================
|
//==========================================================================
|
//
|
//
|
// sys/net/rtsock.c
|
// sys/net/rtsock.c
|
//
|
//
|
//
|
//
|
//
|
//
|
//==========================================================================
|
//==========================================================================
|
//####BSDCOPYRIGHTBEGIN####
|
//####BSDCOPYRIGHTBEGIN####
|
//
|
//
|
// -------------------------------------------
|
// -------------------------------------------
|
//
|
//
|
// Portions of this software may have been derived from OpenBSD or other sources,
|
// Portions of this software may have been derived from OpenBSD or other sources,
|
// and are covered by the appropriate copyright disclaimers included herein.
|
// and are covered by the appropriate copyright disclaimers included herein.
|
//
|
//
|
// -------------------------------------------
|
// -------------------------------------------
|
//
|
//
|
//####BSDCOPYRIGHTEND####
|
//####BSDCOPYRIGHTEND####
|
//==========================================================================
|
//==========================================================================
|
//#####DESCRIPTIONBEGIN####
|
//#####DESCRIPTIONBEGIN####
|
//
|
//
|
// Author(s): gthomas
|
// Author(s): gthomas
|
// Contributors: gthomas
|
// Contributors: gthomas
|
// Date: 2000-01-10
|
// Date: 2000-01-10
|
// Purpose:
|
// Purpose:
|
// Description:
|
// Description:
|
//
|
//
|
//
|
//
|
//####DESCRIPTIONEND####
|
//####DESCRIPTIONEND####
|
//
|
//
|
//==========================================================================
|
//==========================================================================
|
|
|
|
|
/* $OpenBSD: rtsock.c,v 1.8 1999/12/08 06:50:18 itojun Exp $ */
|
/* $OpenBSD: rtsock.c,v 1.8 1999/12/08 06:50:18 itojun Exp $ */
|
/* $NetBSD: rtsock.c,v 1.18 1996/03/29 00:32:10 cgd Exp $ */
|
/* $NetBSD: rtsock.c,v 1.18 1996/03/29 00:32:10 cgd Exp $ */
|
|
|
/*
|
/*
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
* All rights reserved.
|
* 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. Neither the name of the project nor the names of its contributors
|
* 3. Neither the name of the project 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 PROJECT AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT 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 PROJECT OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT 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.
|
*/
|
*/
|
|
|
/*
|
/*
|
* Copyright (c) 1988, 1991, 1993
|
* Copyright (c) 1988, 1991, 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.
|
*
|
*
|
* @(#)rtsock.c 8.6 (Berkeley) 2/11/95
|
* @(#)rtsock.c 8.6 (Berkeley) 2/11/95
|
*/
|
*/
|
|
|
#include <sys/param.h>
|
#include <sys/param.h>
|
#ifndef __ECOS
|
#ifndef __ECOS
|
#include <sys/systm.h>
|
#include <sys/systm.h>
|
#include <sys/proc.h>
|
#include <sys/proc.h>
|
#endif
|
#endif
|
#include <sys/mbuf.h>
|
#include <sys/mbuf.h>
|
#include <sys/socket.h>
|
#include <sys/socket.h>
|
#include <sys/socketvar.h>
|
#include <sys/socketvar.h>
|
#include <sys/domain.h>
|
#include <sys/domain.h>
|
#include <sys/protosw.h>
|
#include <sys/protosw.h>
|
|
|
#ifndef __ECOS
|
#ifndef __ECOS
|
#include <vm/vm.h>
|
#include <vm/vm.h>
|
#include <sys/sysctl.h>
|
#include <sys/sysctl.h>
|
#endif
|
#endif
|
|
|
#include <net/if.h>
|
#include <net/if.h>
|
#include <net/route.h>
|
#include <net/route.h>
|
#include <net/raw_cb.h>
|
#include <net/raw_cb.h>
|
|
|
#include <machine/stdarg.h>
|
#include <machine/stdarg.h>
|
|
|
struct sockaddr route_dst = { 2, PF_ROUTE, };
|
struct sockaddr route_dst = { 2, PF_ROUTE, };
|
struct sockaddr route_src = { 2, PF_ROUTE, };
|
struct sockaddr route_src = { 2, PF_ROUTE, };
|
struct sockproto route_proto = { PF_ROUTE, };
|
struct sockproto route_proto = { PF_ROUTE, };
|
|
|
struct walkarg {
|
struct walkarg {
|
int w_op, w_arg, w_given, w_needed, w_tmemsize;
|
int w_op, w_arg, w_given, w_needed, w_tmemsize;
|
caddr_t w_where, w_tmem;
|
caddr_t w_where, w_tmem;
|
};
|
};
|
|
|
static struct mbuf *
|
static struct mbuf *
|
rt_msg1 __P((int, struct rt_addrinfo *));
|
rt_msg1 __P((int, struct rt_addrinfo *));
|
static int rt_msg2 __P((int,
|
static int rt_msg2 __P((int,
|
struct rt_addrinfo *, caddr_t, struct walkarg *));
|
struct rt_addrinfo *, caddr_t, struct walkarg *));
|
static void rt_xaddrs __P((caddr_t, caddr_t, struct rt_addrinfo *));
|
static void rt_xaddrs __P((caddr_t, caddr_t, struct rt_addrinfo *));
|
static void rt_setif __P((struct rtentry *, struct sockaddr *,
|
static void rt_setif __P((struct rtentry *, struct sockaddr *,
|
struct sockaddr *, struct sockaddr *));
|
struct sockaddr *, struct sockaddr *));
|
|
|
/* Sleazy use of local variables throughout file, warning!!!! */
|
/* Sleazy use of local variables throughout file, warning!!!! */
|
#define dst info.rti_info[RTAX_DST]
|
#define dst info.rti_info[RTAX_DST]
|
#define gate info.rti_info[RTAX_GATEWAY]
|
#define gate info.rti_info[RTAX_GATEWAY]
|
#define netmask info.rti_info[RTAX_NETMASK]
|
#define netmask info.rti_info[RTAX_NETMASK]
|
#define genmask info.rti_info[RTAX_GENMASK]
|
#define genmask info.rti_info[RTAX_GENMASK]
|
#define ifpaddr info.rti_info[RTAX_IFP]
|
#define ifpaddr info.rti_info[RTAX_IFP]
|
#define ifaaddr info.rti_info[RTAX_IFA]
|
#define ifaaddr info.rti_info[RTAX_IFA]
|
#define brdaddr info.rti_info[RTAX_BRD]
|
#define brdaddr info.rti_info[RTAX_BRD]
|
|
|
/*ARGSUSED*/
|
/*ARGSUSED*/
|
int
|
int
|
route_usrreq(so, req, m, nam, control)
|
route_usrreq(so, req, m, nam, control)
|
register struct socket *so;
|
register struct socket *so;
|
int req;
|
int req;
|
struct mbuf *m, *nam, *control;
|
struct mbuf *m, *nam, *control;
|
{
|
{
|
register int error = 0;
|
register int error = 0;
|
register struct rawcb *rp = sotorawcb(so);
|
register struct rawcb *rp = sotorawcb(so);
|
int s;
|
int s;
|
|
|
if (req == PRU_ATTACH) {
|
if (req == PRU_ATTACH) {
|
MALLOC(rp, struct rawcb *, sizeof(*rp), M_PCB, M_WAITOK);
|
MALLOC(rp, struct rawcb *, sizeof(*rp), M_PCB, M_WAITOK);
|
if ((so->so_pcb = rp) != NULL)
|
if ((so->so_pcb = rp) != NULL)
|
bzero(so->so_pcb, sizeof(*rp));
|
bzero(so->so_pcb, sizeof(*rp));
|
|
|
}
|
}
|
if (req == PRU_DETACH && rp) {
|
if (req == PRU_DETACH && rp) {
|
int af = rp->rcb_proto.sp_protocol;
|
int af = rp->rcb_proto.sp_protocol;
|
if (af == AF_INET)
|
if (af == AF_INET)
|
route_cb.ip_count--;
|
route_cb.ip_count--;
|
else if (af == AF_INET6)
|
else if (af == AF_INET6)
|
route_cb.ip6_count--;
|
route_cb.ip6_count--;
|
else if (af == AF_NS)
|
else if (af == AF_NS)
|
route_cb.ns_count--;
|
route_cb.ns_count--;
|
else if (af == AF_ISO)
|
else if (af == AF_ISO)
|
route_cb.iso_count--;
|
route_cb.iso_count--;
|
route_cb.any_count--;
|
route_cb.any_count--;
|
}
|
}
|
s = splsoftnet();
|
s = splsoftnet();
|
/*
|
/*
|
* Don't call raw_usrreq() in the attach case, because
|
* Don't call raw_usrreq() in the attach case, because
|
* we want to allow non-privileged processes to listen on
|
* we want to allow non-privileged processes to listen on
|
* and send "safe" commands to the routing socket.
|
* and send "safe" commands to the routing socket.
|
*/
|
*/
|
if (req == PRU_ATTACH) {
|
if (req == PRU_ATTACH) {
|
#ifndef __ECOS
|
#ifndef __ECOS
|
if (curproc == 0)
|
if (curproc == 0)
|
error = EACCES;
|
error = EACCES;
|
else
|
else
|
#endif // FIXME?
|
#endif // FIXME?
|
error = raw_attach(so, (int)(long)nam);
|
error = raw_attach(so, (int)(long)nam);
|
} else
|
} else
|
error = raw_usrreq(so, req, m, nam, control);
|
error = raw_usrreq(so, req, m, nam, control);
|
|
|
rp = sotorawcb(so);
|
rp = sotorawcb(so);
|
if (req == PRU_ATTACH && rp) {
|
if (req == PRU_ATTACH && rp) {
|
int af = rp->rcb_proto.sp_protocol;
|
int af = rp->rcb_proto.sp_protocol;
|
if (error) {
|
if (error) {
|
free((caddr_t)rp, M_PCB);
|
free((caddr_t)rp, M_PCB);
|
splx(s);
|
splx(s);
|
return (error);
|
return (error);
|
}
|
}
|
if (af == AF_INET)
|
if (af == AF_INET)
|
route_cb.ip_count++;
|
route_cb.ip_count++;
|
else if (af == AF_INET6)
|
else if (af == AF_INET6)
|
route_cb.ip6_count++;
|
route_cb.ip6_count++;
|
else if (af == AF_NS)
|
else if (af == AF_NS)
|
route_cb.ns_count++;
|
route_cb.ns_count++;
|
else if (af == AF_ISO)
|
else if (af == AF_ISO)
|
route_cb.iso_count++;
|
route_cb.iso_count++;
|
rp->rcb_faddr = &route_src;
|
rp->rcb_faddr = &route_src;
|
route_cb.any_count++;
|
route_cb.any_count++;
|
soisconnected(so);
|
soisconnected(so);
|
so->so_options |= SO_USELOOPBACK;
|
so->so_options |= SO_USELOOPBACK;
|
}
|
}
|
splx(s);
|
splx(s);
|
return (error);
|
return (error);
|
}
|
}
|
|
|
/*ARGSUSED*/
|
/*ARGSUSED*/
|
int
|
int
|
#if __STDC__
|
#if __STDC__
|
route_output(struct mbuf *m, ...)
|
route_output(struct mbuf *m, ...)
|
#else
|
#else
|
route_output(m, va_alist)
|
route_output(m, va_alist)
|
struct mbuf *m;
|
struct mbuf *m;
|
va_dcl
|
va_dcl
|
#endif
|
#endif
|
{
|
{
|
register struct rt_msghdr *rtm = 0;
|
register struct rt_msghdr *rtm = 0;
|
register struct rtentry *rt = 0;
|
register struct rtentry *rt = 0;
|
struct rtentry *saved_nrt = 0;
|
struct rtentry *saved_nrt = 0;
|
struct radix_node_head *rnh;
|
struct radix_node_head *rnh;
|
struct rt_addrinfo info;
|
struct rt_addrinfo info;
|
int len, error = 0;
|
int len, error = 0;
|
struct ifnet *ifp = 0;
|
struct ifnet *ifp = 0;
|
struct socket *so;
|
struct socket *so;
|
va_list ap;
|
va_list ap;
|
|
|
va_start(ap, m);
|
va_start(ap, m);
|
so = va_arg(ap, struct socket *);
|
so = va_arg(ap, struct socket *);
|
va_end(ap);
|
va_end(ap);
|
|
|
bzero(&info, sizeof(info));
|
bzero(&info, sizeof(info));
|
#define senderr(e) { error = e; goto flush;}
|
#define senderr(e) { error = e; goto flush;}
|
if (m == 0 || ((m->m_len < sizeof(int32_t)) &&
|
if (m == 0 || ((m->m_len < sizeof(int32_t)) &&
|
(m = m_pullup(m, sizeof(int32_t))) == 0))
|
(m = m_pullup(m, sizeof(int32_t))) == 0))
|
return (ENOBUFS);
|
return (ENOBUFS);
|
if ((m->m_flags & M_PKTHDR) == 0)
|
if ((m->m_flags & M_PKTHDR) == 0)
|
panic("route_output");
|
panic("route_output");
|
len = m->m_pkthdr.len;
|
len = m->m_pkthdr.len;
|
if (len < sizeof(*rtm) ||
|
if (len < sizeof(*rtm) ||
|
len != mtod(m, struct rt_msghdr *)->rtm_msglen) {
|
len != mtod(m, struct rt_msghdr *)->rtm_msglen) {
|
dst = 0;
|
dst = 0;
|
senderr(EINVAL);
|
senderr(EINVAL);
|
}
|
}
|
R_Malloc(rtm, struct rt_msghdr *, len);
|
R_Malloc(rtm, struct rt_msghdr *, len);
|
if (rtm == 0) {
|
if (rtm == 0) {
|
dst = 0;
|
dst = 0;
|
senderr(ENOBUFS);
|
senderr(ENOBUFS);
|
}
|
}
|
m_copydata(m, 0, len, (caddr_t)rtm);
|
m_copydata(m, 0, len, (caddr_t)rtm);
|
if (rtm->rtm_version != RTM_VERSION) {
|
if (rtm->rtm_version != RTM_VERSION) {
|
dst = 0;
|
dst = 0;
|
senderr(EPROTONOSUPPORT);
|
senderr(EPROTONOSUPPORT);
|
}
|
}
|
#ifdef __ECOS
|
#ifdef __ECOS
|
rtm->rtm_pid = 0; // FIXME
|
rtm->rtm_pid = 0; // FIXME
|
#else
|
#else
|
rtm->rtm_pid = curproc->p_pid;
|
rtm->rtm_pid = curproc->p_pid;
|
#endif
|
#endif
|
info.rti_addrs = rtm->rtm_addrs;
|
info.rti_addrs = rtm->rtm_addrs;
|
rt_xaddrs((caddr_t)(rtm + 1), len + (caddr_t)rtm, &info);
|
rt_xaddrs((caddr_t)(rtm + 1), len + (caddr_t)rtm, &info);
|
if (dst == 0)
|
if (dst == 0)
|
senderr(EINVAL);
|
senderr(EINVAL);
|
if (genmask) {
|
if (genmask) {
|
struct radix_node *t;
|
struct radix_node *t;
|
t = rn_addmask((caddr_t)genmask, 0, 1);
|
t = rn_addmask((caddr_t)genmask, 0, 1);
|
if (t && Bcmp(genmask, t->rn_key, *(u_char *)genmask) == 0)
|
if (t && Bcmp(genmask, t->rn_key, *(u_char *)genmask) == 0)
|
genmask = (struct sockaddr *)(t->rn_key);
|
genmask = (struct sockaddr *)(t->rn_key);
|
else
|
else
|
senderr(ENOBUFS);
|
senderr(ENOBUFS);
|
}
|
}
|
|
|
/*
|
/*
|
* Verify that the caller has the appropriate privilege; RTM_GET
|
* Verify that the caller has the appropriate privilege; RTM_GET
|
* is the only operation the non-superuser is allowed.
|
* is the only operation the non-superuser is allowed.
|
*/
|
*/
|
#ifndef __ECOS
|
#ifndef __ECOS
|
if (rtm->rtm_type != RTM_GET &&
|
if (rtm->rtm_type != RTM_GET &&
|
suser(curproc->p_ucred, &curproc->p_acflag) != 0)
|
suser(curproc->p_ucred, &curproc->p_acflag) != 0)
|
senderr(EACCES);
|
senderr(EACCES);
|
#endif
|
#endif
|
switch (rtm->rtm_type) {
|
switch (rtm->rtm_type) {
|
|
|
case RTM_ADD:
|
case RTM_ADD:
|
if (gate == 0)
|
if (gate == 0)
|
senderr(EINVAL);
|
senderr(EINVAL);
|
error = rtrequest(RTM_ADD, dst, gate, netmask,
|
error = rtrequest(RTM_ADD, dst, gate, netmask,
|
rtm->rtm_flags, &saved_nrt);
|
rtm->rtm_flags, &saved_nrt);
|
if (error == 0 && saved_nrt) {
|
if (error == 0 && saved_nrt) {
|
/*
|
/*
|
* If the route request specified an interface with
|
* If the route request specified an interface with
|
* IFA and/or IFP, we set the requested interface on
|
* IFA and/or IFP, we set the requested interface on
|
* the route with rt_setif. It would be much better
|
* the route with rt_setif. It would be much better
|
* to do this inside rtrequest, but that would
|
* to do this inside rtrequest, but that would
|
* require passing the desired interface, in some
|
* require passing the desired interface, in some
|
* form, to rtrequest. Since rtrequest is called in
|
* form, to rtrequest. Since rtrequest is called in
|
* so many places (roughly 40 in our source), adding
|
* so many places (roughly 40 in our source), adding
|
* a parameter is to much for us to swallow; this is
|
* a parameter is to much for us to swallow; this is
|
* something for the FreeBSD developers to tackle.
|
* something for the FreeBSD developers to tackle.
|
* Instead, we let rtrequest compute whatever
|
* Instead, we let rtrequest compute whatever
|
* interface it wants, then come in behind it and
|
* interface it wants, then come in behind it and
|
* stick in the interface that we really want. This
|
* stick in the interface that we really want. This
|
* works reasonably well except when rtrequest can't
|
* works reasonably well except when rtrequest can't
|
* figure out what interface to use (with
|
* figure out what interface to use (with
|
* ifa_withroute) and returns ENETUNREACH. Ideally
|
* ifa_withroute) and returns ENETUNREACH. Ideally
|
* it shouldn't matter if rtrequest can't figure out
|
* it shouldn't matter if rtrequest can't figure out
|
* the interface if we're going to explicitly set it
|
* the interface if we're going to explicitly set it
|
* ourselves anyway. But practically we can't
|
* ourselves anyway. But practically we can't
|
* recover here because rtrequest will not do any of
|
* recover here because rtrequest will not do any of
|
* the work necessary to add the route if it can't
|
* the work necessary to add the route if it can't
|
* find an interface. As long as there is a default
|
* find an interface. As long as there is a default
|
* route that leads to some interface, rtrequest will
|
* route that leads to some interface, rtrequest will
|
* find an interface, so this problem should be
|
* find an interface, so this problem should be
|
* rarely encountered.
|
* rarely encountered.
|
* dwiggins@bbn.com
|
* dwiggins@bbn.com
|
*/
|
*/
|
|
|
rt_setif(saved_nrt, ifpaddr, ifaaddr, gate);
|
rt_setif(saved_nrt, ifpaddr, ifaaddr, gate);
|
rt_setmetrics(rtm->rtm_inits,
|
rt_setmetrics(rtm->rtm_inits,
|
&rtm->rtm_rmx, &saved_nrt->rt_rmx);
|
&rtm->rtm_rmx, &saved_nrt->rt_rmx);
|
saved_nrt->rt_refcnt--;
|
saved_nrt->rt_refcnt--;
|
saved_nrt->rt_genmask = genmask;
|
saved_nrt->rt_genmask = genmask;
|
}
|
}
|
break;
|
break;
|
|
|
case RTM_DELETE:
|
case RTM_DELETE:
|
error = rtrequest(RTM_DELETE, dst, gate, netmask,
|
error = rtrequest(RTM_DELETE, dst, gate, netmask,
|
rtm->rtm_flags, &saved_nrt);
|
rtm->rtm_flags, &saved_nrt);
|
if (error == 0) {
|
if (error == 0) {
|
(rt = saved_nrt)->rt_refcnt++;
|
(rt = saved_nrt)->rt_refcnt++;
|
goto report;
|
goto report;
|
}
|
}
|
break;
|
break;
|
|
|
case RTM_GET:
|
case RTM_GET:
|
case RTM_CHANGE:
|
case RTM_CHANGE:
|
case RTM_LOCK:
|
case RTM_LOCK:
|
if ((rnh = rt_tables[dst->sa_family]) == 0) {
|
if ((rnh = rt_tables[dst->sa_family]) == 0) {
|
senderr(EAFNOSUPPORT);
|
senderr(EAFNOSUPPORT);
|
} else if ((rt = (struct rtentry *)
|
} else if ((rt = (struct rtentry *)
|
rnh->rnh_lookup(dst, netmask, rnh)) != NULL)
|
rnh->rnh_lookup(dst, netmask, rnh)) != NULL)
|
rt->rt_refcnt++;
|
rt->rt_refcnt++;
|
else
|
else
|
senderr(ESRCH);
|
senderr(ESRCH);
|
switch(rtm->rtm_type) {
|
switch(rtm->rtm_type) {
|
|
|
case RTM_GET:
|
case RTM_GET:
|
report:
|
report:
|
dst = rt_key(rt);
|
dst = rt_key(rt);
|
gate = rt->rt_gateway;
|
gate = rt->rt_gateway;
|
netmask = rt_mask(rt);
|
netmask = rt_mask(rt);
|
genmask = rt->rt_genmask;
|
genmask = rt->rt_genmask;
|
if (rtm->rtm_addrs & (RTA_IFP | RTA_IFA)) {
|
if (rtm->rtm_addrs & (RTA_IFP | RTA_IFA)) {
|
if ((ifp = rt->rt_ifp) != NULL) {
|
if ((ifp = rt->rt_ifp) != NULL) {
|
ifpaddr = ifp->if_addrlist.tqh_first->ifa_addr;
|
ifpaddr = ifp->if_addrlist.tqh_first->ifa_addr;
|
ifaaddr = rt->rt_ifa->ifa_addr;
|
ifaaddr = rt->rt_ifa->ifa_addr;
|
if (ifp->if_flags & IFF_POINTOPOINT)
|
if (ifp->if_flags & IFF_POINTOPOINT)
|
brdaddr = rt->rt_ifa->ifa_dstaddr;
|
brdaddr = rt->rt_ifa->ifa_dstaddr;
|
else
|
else
|
brdaddr = 0;
|
brdaddr = 0;
|
rtm->rtm_index = ifp->if_index;
|
rtm->rtm_index = ifp->if_index;
|
} else {
|
} else {
|
ifpaddr = 0;
|
ifpaddr = 0;
|
ifaaddr = 0;
|
ifaaddr = 0;
|
}
|
}
|
}
|
}
|
len = rt_msg2(rtm->rtm_type, &info, (caddr_t)0,
|
len = rt_msg2(rtm->rtm_type, &info, (caddr_t)0,
|
(struct walkarg *)0);
|
(struct walkarg *)0);
|
if (len > rtm->rtm_msglen) {
|
if (len > rtm->rtm_msglen) {
|
struct rt_msghdr *new_rtm;
|
struct rt_msghdr *new_rtm;
|
R_Malloc(new_rtm, struct rt_msghdr *, len);
|
R_Malloc(new_rtm, struct rt_msghdr *, len);
|
if (new_rtm == 0)
|
if (new_rtm == 0)
|
senderr(ENOBUFS);
|
senderr(ENOBUFS);
|
Bcopy(rtm, new_rtm, rtm->rtm_msglen);
|
Bcopy(rtm, new_rtm, rtm->rtm_msglen);
|
Free(rtm); rtm = new_rtm;
|
Free(rtm); rtm = new_rtm;
|
}
|
}
|
(void)rt_msg2(rtm->rtm_type, &info, (caddr_t)rtm,
|
(void)rt_msg2(rtm->rtm_type, &info, (caddr_t)rtm,
|
(struct walkarg *)0);
|
(struct walkarg *)0);
|
rtm->rtm_flags = rt->rt_flags;
|
rtm->rtm_flags = rt->rt_flags;
|
rtm->rtm_rmx = rt->rt_rmx;
|
rtm->rtm_rmx = rt->rt_rmx;
|
rtm->rtm_addrs = info.rti_addrs;
|
rtm->rtm_addrs = info.rti_addrs;
|
break;
|
break;
|
|
|
case RTM_CHANGE:
|
case RTM_CHANGE:
|
if (gate && rt_setgate(rt, rt_key(rt), gate))
|
if (gate && rt_setgate(rt, rt_key(rt), gate))
|
#ifdef __ECOS
|
#ifdef __ECOS
|
senderr(EMFILE);
|
senderr(EMFILE);
|
#else
|
#else
|
senderr(EDQUOT);
|
senderr(EDQUOT);
|
#endif
|
#endif
|
|
|
#if 1
|
#if 1
|
rt_setif(rt, ifpaddr, ifaaddr, gate);
|
rt_setif(rt, ifpaddr, ifaaddr, gate);
|
#else
|
#else
|
/* new gateway could require new ifaddr, ifp;
|
/* new gateway could require new ifaddr, ifp;
|
flags may also be different; ifp may be specified
|
flags may also be different; ifp may be specified
|
by ll sockaddr when protocol address is ambiguous */
|
by ll sockaddr when protocol address is ambiguous */
|
if (ifpaddr && (ifa = ifa_ifwithnet(ifpaddr)) &&
|
if (ifpaddr && (ifa = ifa_ifwithnet(ifpaddr)) &&
|
(ifp = ifa->ifa_ifp) && (ifaaddr || gate))
|
(ifp = ifa->ifa_ifp) && (ifaaddr || gate))
|
ifa = ifaof_ifpforaddr(ifaaddr ? ifaaddr : gate,
|
ifa = ifaof_ifpforaddr(ifaaddr ? ifaaddr : gate,
|
ifp);
|
ifp);
|
else if ((ifaaddr && (ifa = ifa_ifwithaddr(ifaaddr))) ||
|
else if ((ifaaddr && (ifa = ifa_ifwithaddr(ifaaddr))) ||
|
(gate && (ifa = ifa_ifwithroute(rt->rt_flags,
|
(gate && (ifa = ifa_ifwithroute(rt->rt_flags,
|
rt_key(rt), gate))))
|
rt_key(rt), gate))))
|
ifp = ifa->ifa_ifp;
|
ifp = ifa->ifa_ifp;
|
if (ifa) {
|
if (ifa) {
|
register struct ifaddr *oifa = rt->rt_ifa;
|
register struct ifaddr *oifa = rt->rt_ifa;
|
if (oifa != ifa) {
|
if (oifa != ifa) {
|
if (oifa && oifa->ifa_rtrequest)
|
if (oifa && oifa->ifa_rtrequest)
|
oifa->ifa_rtrequest(RTM_DELETE,
|
oifa->ifa_rtrequest(RTM_DELETE,
|
rt, gate);
|
rt, gate);
|
IFAFREE(rt->rt_ifa);
|
IFAFREE(rt->rt_ifa);
|
rt->rt_ifa = ifa;
|
rt->rt_ifa = ifa;
|
ifa->ifa_refcnt++;
|
ifa->ifa_refcnt++;
|
rt->rt_ifp = ifp;
|
rt->rt_ifp = ifp;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
rt_setmetrics(rtm->rtm_inits, &rtm->rtm_rmx,
|
rt_setmetrics(rtm->rtm_inits, &rtm->rtm_rmx,
|
&rt->rt_rmx);
|
&rt->rt_rmx);
|
#if 0
|
#if 0
|
if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
|
if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
|
rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, gate);
|
rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, gate);
|
#endif
|
#endif
|
if (genmask)
|
if (genmask)
|
rt->rt_genmask = genmask;
|
rt->rt_genmask = genmask;
|
/*
|
/*
|
* Fall into
|
* Fall into
|
*/
|
*/
|
case RTM_LOCK:
|
case RTM_LOCK:
|
rt->rt_rmx.rmx_locks &= ~(rtm->rtm_inits);
|
rt->rt_rmx.rmx_locks &= ~(rtm->rtm_inits);
|
rt->rt_rmx.rmx_locks |=
|
rt->rt_rmx.rmx_locks |=
|
(rtm->rtm_inits & rtm->rtm_rmx.rmx_locks);
|
(rtm->rtm_inits & rtm->rtm_rmx.rmx_locks);
|
break;
|
break;
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
senderr(EOPNOTSUPP);
|
senderr(EOPNOTSUPP);
|
}
|
}
|
|
|
flush:
|
flush:
|
if (rtm) {
|
if (rtm) {
|
if (error)
|
if (error)
|
rtm->rtm_errno = error;
|
rtm->rtm_errno = error;
|
else
|
else
|
rtm->rtm_flags |= RTF_DONE;
|
rtm->rtm_flags |= RTF_DONE;
|
}
|
}
|
if (rt)
|
if (rt)
|
rtfree(rt);
|
rtfree(rt);
|
{
|
{
|
register struct rawcb *rp = 0;
|
register struct rawcb *rp = 0;
|
/*
|
/*
|
* Check to see if we don't want our own messages.
|
* Check to see if we don't want our own messages.
|
*/
|
*/
|
if ((so->so_options & SO_USELOOPBACK) == 0) {
|
if ((so->so_options & SO_USELOOPBACK) == 0) {
|
if (route_cb.any_count <= 1) {
|
if (route_cb.any_count <= 1) {
|
if (rtm)
|
if (rtm)
|
Free(rtm);
|
Free(rtm);
|
m_freem(m);
|
m_freem(m);
|
return (error);
|
return (error);
|
}
|
}
|
/* There is another listener, so construct message */
|
/* There is another listener, so construct message */
|
rp = sotorawcb(so);
|
rp = sotorawcb(so);
|
}
|
}
|
if (rtm) {
|
if (rtm) {
|
m_copyback(m, 0, rtm->rtm_msglen, (caddr_t)rtm);
|
m_copyback(m, 0, rtm->rtm_msglen, (caddr_t)rtm);
|
Free(rtm);
|
Free(rtm);
|
}
|
}
|
if (rp)
|
if (rp)
|
rp->rcb_proto.sp_family = 0; /* Avoid us */
|
rp->rcb_proto.sp_family = 0; /* Avoid us */
|
if (dst)
|
if (dst)
|
route_proto.sp_protocol = dst->sa_family;
|
route_proto.sp_protocol = dst->sa_family;
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
if (rp)
|
if (rp)
|
rp->rcb_proto.sp_family = PF_ROUTE;
|
rp->rcb_proto.sp_family = PF_ROUTE;
|
}
|
}
|
return (error);
|
return (error);
|
}
|
}
|
|
|
void
|
void
|
rt_setmetrics(which, in, out)
|
rt_setmetrics(which, in, out)
|
u_long which;
|
u_long which;
|
register struct rt_metrics *in, *out;
|
register struct rt_metrics *in, *out;
|
{
|
{
|
#define metric(f, e) if (which & (f)) out->e = in->e;
|
#define metric(f, e) if (which & (f)) out->e = in->e;
|
metric(RTV_RPIPE, rmx_recvpipe);
|
metric(RTV_RPIPE, rmx_recvpipe);
|
metric(RTV_SPIPE, rmx_sendpipe);
|
metric(RTV_SPIPE, rmx_sendpipe);
|
metric(RTV_SSTHRESH, rmx_ssthresh);
|
metric(RTV_SSTHRESH, rmx_ssthresh);
|
metric(RTV_RTT, rmx_rtt);
|
metric(RTV_RTT, rmx_rtt);
|
metric(RTV_RTTVAR, rmx_rttvar);
|
metric(RTV_RTTVAR, rmx_rttvar);
|
metric(RTV_HOPCOUNT, rmx_hopcount);
|
metric(RTV_HOPCOUNT, rmx_hopcount);
|
metric(RTV_MTU, rmx_mtu);
|
metric(RTV_MTU, rmx_mtu);
|
metric(RTV_EXPIRE, rmx_expire);
|
metric(RTV_EXPIRE, rmx_expire);
|
#undef metric
|
#undef metric
|
}
|
}
|
|
|
/*
|
/*
|
* Set route's interface given ifpaddr, ifaaddr, and gateway.
|
* Set route's interface given ifpaddr, ifaaddr, and gateway.
|
*/
|
*/
|
static void
|
static void
|
rt_setif(rt, Ifpaddr, Ifaaddr, Gate)
|
rt_setif(rt, Ifpaddr, Ifaaddr, Gate)
|
struct rtentry *rt;
|
struct rtentry *rt;
|
struct sockaddr *Ifpaddr, *Ifaaddr, *Gate;
|
struct sockaddr *Ifpaddr, *Ifaaddr, *Gate;
|
{
|
{
|
struct ifaddr *ifa = 0;
|
struct ifaddr *ifa = 0;
|
struct ifnet *ifp = 0;
|
struct ifnet *ifp = 0;
|
|
|
/* new gateway could require new ifaddr, ifp;
|
/* new gateway could require new ifaddr, ifp;
|
flags may also be different; ifp may be specified
|
flags may also be different; ifp may be specified
|
by ll sockaddr when protocol address is ambiguous */
|
by ll sockaddr when protocol address is ambiguous */
|
if (Ifpaddr && (ifa = ifa_ifwithnet(Ifpaddr)) &&
|
if (Ifpaddr && (ifa = ifa_ifwithnet(Ifpaddr)) &&
|
(ifp = ifa->ifa_ifp) && (Ifaaddr || Gate))
|
(ifp = ifa->ifa_ifp) && (Ifaaddr || Gate))
|
ifa = ifaof_ifpforaddr(Ifaaddr ? Ifaaddr : Gate,
|
ifa = ifaof_ifpforaddr(Ifaaddr ? Ifaaddr : Gate,
|
ifp);
|
ifp);
|
else if (Ifpaddr && (ifp = if_withname(Ifpaddr)) ) {
|
else if (Ifpaddr && (ifp = if_withname(Ifpaddr)) ) {
|
ifa = Gate ? ifaof_ifpforaddr(Gate, ifp) :
|
ifa = Gate ? ifaof_ifpforaddr(Gate, ifp) :
|
TAILQ_FIRST(&ifp->if_addrlist);
|
TAILQ_FIRST(&ifp->if_addrlist);
|
}
|
}
|
else if ((Ifaaddr && (ifa = ifa_ifwithaddr(Ifaaddr))) ||
|
else if ((Ifaaddr && (ifa = ifa_ifwithaddr(Ifaaddr))) ||
|
(Gate && (ifa = ifa_ifwithroute(rt->rt_flags,
|
(Gate && (ifa = ifa_ifwithroute(rt->rt_flags,
|
rt_key(rt), Gate))))
|
rt_key(rt), Gate))))
|
ifp = ifa->ifa_ifp;
|
ifp = ifa->ifa_ifp;
|
if (ifa) {
|
if (ifa) {
|
register struct ifaddr *oifa = rt->rt_ifa;
|
register struct ifaddr *oifa = rt->rt_ifa;
|
if (oifa != ifa) {
|
if (oifa != ifa) {
|
if (oifa && oifa->ifa_rtrequest)
|
if (oifa && oifa->ifa_rtrequest)
|
oifa->ifa_rtrequest(RTM_DELETE,
|
oifa->ifa_rtrequest(RTM_DELETE,
|
rt, Gate);
|
rt, Gate);
|
IFAFREE(rt->rt_ifa);
|
IFAFREE(rt->rt_ifa);
|
rt->rt_ifa = ifa;
|
rt->rt_ifa = ifa;
|
ifa->ifa_refcnt++;
|
ifa->ifa_refcnt++;
|
rt->rt_ifp = ifp;
|
rt->rt_ifp = ifp;
|
rt->rt_rmx.rmx_mtu = ifp->if_mtu;
|
rt->rt_rmx.rmx_mtu = ifp->if_mtu;
|
if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
|
if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
|
rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, Gate);
|
rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, Gate);
|
} else
|
} else
|
goto call_ifareq;
|
goto call_ifareq;
|
return;
|
return;
|
}
|
}
|
call_ifareq:
|
call_ifareq:
|
/* XXX: to reset gateway to correct value, at RTM_CHANGE */
|
/* XXX: to reset gateway to correct value, at RTM_CHANGE */
|
if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
|
if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
|
rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, Gate);
|
rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, Gate);
|
}
|
}
|
|
|
|
|
#define ROUNDUP(a) \
|
#define ROUNDUP(a) \
|
((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
|
((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
|
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
|
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
|
|
|
static void
|
static void
|
rt_xaddrs(cp, cplim, rtinfo)
|
rt_xaddrs(cp, cplim, rtinfo)
|
register caddr_t cp, cplim;
|
register caddr_t cp, cplim;
|
register struct rt_addrinfo *rtinfo;
|
register struct rt_addrinfo *rtinfo;
|
{
|
{
|
register struct sockaddr *sa;
|
register struct sockaddr *sa;
|
register int i;
|
register int i;
|
|
|
bzero(rtinfo->rti_info, sizeof(rtinfo->rti_info));
|
bzero(rtinfo->rti_info, sizeof(rtinfo->rti_info));
|
for (i = 0; (i < RTAX_MAX) && (cp < cplim); i++) {
|
for (i = 0; (i < RTAX_MAX) && (cp < cplim); i++) {
|
if ((rtinfo->rti_addrs & (1 << i)) == 0)
|
if ((rtinfo->rti_addrs & (1 << i)) == 0)
|
continue;
|
continue;
|
rtinfo->rti_info[i] = sa = (struct sockaddr *)cp;
|
rtinfo->rti_info[i] = sa = (struct sockaddr *)cp;
|
ADVANCE(cp, sa);
|
ADVANCE(cp, sa);
|
}
|
}
|
}
|
}
|
|
|
/*
|
/*
|
* Copy data from a buffer back into the indicated mbuf chain,
|
* Copy data from a buffer back into the indicated mbuf chain,
|
* starting "off" bytes from the beginning, extending the mbuf
|
* starting "off" bytes from the beginning, extending the mbuf
|
* chain if necessary. The mbuf needs to be properly initalized
|
* chain if necessary. The mbuf needs to be properly initalized
|
* including the setting of m_len.
|
* including the setting of m_len.
|
*/
|
*/
|
void
|
void
|
m_copyback(m0, off, len, cp)
|
m_copyback(m0, off, len, cp)
|
struct mbuf *m0;
|
struct mbuf *m0;
|
register int off;
|
register int off;
|
register int len;
|
register int len;
|
caddr_t cp;
|
caddr_t cp;
|
{
|
{
|
register int mlen;
|
register int mlen;
|
register struct mbuf *m = m0, *n;
|
register struct mbuf *m = m0, *n;
|
int totlen = 0;
|
int totlen = 0;
|
|
|
if (m0 == 0)
|
if (m0 == 0)
|
return;
|
return;
|
while (off > (mlen = m->m_len)) {
|
while (off > (mlen = m->m_len)) {
|
off -= mlen;
|
off -= mlen;
|
totlen += mlen;
|
totlen += mlen;
|
if (m->m_next == 0) {
|
if (m->m_next == 0) {
|
n = m_getclr(M_DONTWAIT, m->m_type);
|
n = m_getclr(M_DONTWAIT, m->m_type);
|
if (n == 0)
|
if (n == 0)
|
goto out;
|
goto out;
|
n->m_len = min(MLEN, len + off);
|
n->m_len = min(MLEN, len + off);
|
m->m_next = n;
|
m->m_next = n;
|
}
|
}
|
m = m->m_next;
|
m = m->m_next;
|
}
|
}
|
while (len > 0) {
|
while (len > 0) {
|
mlen = min (m->m_len - off, len);
|
mlen = min (m->m_len - off, len);
|
bcopy(cp, off + mtod(m, caddr_t), (unsigned)mlen);
|
bcopy(cp, off + mtod(m, caddr_t), (unsigned)mlen);
|
cp += mlen;
|
cp += mlen;
|
len -= mlen;
|
len -= mlen;
|
mlen += off;
|
mlen += off;
|
off = 0;
|
off = 0;
|
totlen += mlen;
|
totlen += mlen;
|
if (len == 0)
|
if (len == 0)
|
break;
|
break;
|
if (m->m_next == 0) {
|
if (m->m_next == 0) {
|
n = m_get(M_DONTWAIT, m->m_type);
|
n = m_get(M_DONTWAIT, m->m_type);
|
if (n == 0)
|
if (n == 0)
|
break;
|
break;
|
n->m_len = min(MLEN, len);
|
n->m_len = min(MLEN, len);
|
m->m_next = n;
|
m->m_next = n;
|
}
|
}
|
m = m->m_next;
|
m = m->m_next;
|
}
|
}
|
out: if (((m = m0)->m_flags & M_PKTHDR) && (m->m_pkthdr.len < totlen))
|
out: if (((m = m0)->m_flags & M_PKTHDR) && (m->m_pkthdr.len < totlen))
|
m->m_pkthdr.len = totlen;
|
m->m_pkthdr.len = totlen;
|
}
|
}
|
|
|
static struct mbuf *
|
static struct mbuf *
|
rt_msg1(type, rtinfo)
|
rt_msg1(type, rtinfo)
|
int type;
|
int type;
|
register struct rt_addrinfo *rtinfo;
|
register struct rt_addrinfo *rtinfo;
|
{
|
{
|
register struct rt_msghdr *rtm;
|
register struct rt_msghdr *rtm;
|
register struct mbuf *m;
|
register struct mbuf *m;
|
register int i;
|
register int i;
|
register struct sockaddr *sa;
|
register struct sockaddr *sa;
|
int len, dlen;
|
int len, dlen;
|
|
|
m = m_gethdr(M_DONTWAIT, MT_DATA);
|
m = m_gethdr(M_DONTWAIT, MT_DATA);
|
if (m == 0)
|
if (m == 0)
|
return (m);
|
return (m);
|
switch (type) {
|
switch (type) {
|
|
|
case RTM_DELADDR:
|
case RTM_DELADDR:
|
case RTM_NEWADDR:
|
case RTM_NEWADDR:
|
len = sizeof(struct ifa_msghdr);
|
len = sizeof(struct ifa_msghdr);
|
break;
|
break;
|
|
|
case RTM_IFINFO:
|
case RTM_IFINFO:
|
len = sizeof(struct if_msghdr);
|
len = sizeof(struct if_msghdr);
|
break;
|
break;
|
|
|
default:
|
default:
|
len = sizeof(struct rt_msghdr);
|
len = sizeof(struct rt_msghdr);
|
}
|
}
|
if (len > MHLEN)
|
if (len > MHLEN)
|
panic("rt_msg1");
|
panic("rt_msg1");
|
m->m_pkthdr.len = m->m_len = len;
|
m->m_pkthdr.len = m->m_len = len;
|
m->m_pkthdr.rcvif = 0;
|
m->m_pkthdr.rcvif = 0;
|
rtm = mtod(m, struct rt_msghdr *);
|
rtm = mtod(m, struct rt_msghdr *);
|
bzero((caddr_t)rtm, len);
|
bzero((caddr_t)rtm, len);
|
for (i = 0; i < RTAX_MAX; i++) {
|
for (i = 0; i < RTAX_MAX; i++) {
|
if ((sa = rtinfo->rti_info[i]) == NULL)
|
if ((sa = rtinfo->rti_info[i]) == NULL)
|
continue;
|
continue;
|
rtinfo->rti_addrs |= (1 << i);
|
rtinfo->rti_addrs |= (1 << i);
|
dlen = ROUNDUP(sa->sa_len);
|
dlen = ROUNDUP(sa->sa_len);
|
m_copyback(m, len, dlen, (caddr_t)sa);
|
m_copyback(m, len, dlen, (caddr_t)sa);
|
len += dlen;
|
len += dlen;
|
}
|
}
|
if (m->m_pkthdr.len != len) {
|
if (m->m_pkthdr.len != len) {
|
m_freem(m);
|
m_freem(m);
|
return (NULL);
|
return (NULL);
|
}
|
}
|
rtm->rtm_msglen = len;
|
rtm->rtm_msglen = len;
|
rtm->rtm_version = RTM_VERSION;
|
rtm->rtm_version = RTM_VERSION;
|
rtm->rtm_type = type;
|
rtm->rtm_type = type;
|
return (m);
|
return (m);
|
}
|
}
|
|
|
static int
|
static int
|
rt_msg2(type, rtinfo, cp, w)
|
rt_msg2(type, rtinfo, cp, w)
|
int type;
|
int type;
|
register struct rt_addrinfo *rtinfo;
|
register struct rt_addrinfo *rtinfo;
|
caddr_t cp;
|
caddr_t cp;
|
struct walkarg *w;
|
struct walkarg *w;
|
{
|
{
|
register int i;
|
register int i;
|
int len, dlen, second_time = 0;
|
int len, dlen, second_time = 0;
|
caddr_t cp0;
|
caddr_t cp0;
|
|
|
rtinfo->rti_addrs = 0;
|
rtinfo->rti_addrs = 0;
|
again:
|
again:
|
switch (type) {
|
switch (type) {
|
|
|
case RTM_DELADDR:
|
case RTM_DELADDR:
|
case RTM_NEWADDR:
|
case RTM_NEWADDR:
|
len = sizeof(struct ifa_msghdr);
|
len = sizeof(struct ifa_msghdr);
|
break;
|
break;
|
|
|
case RTM_IFINFO:
|
case RTM_IFINFO:
|
len = sizeof(struct if_msghdr);
|
len = sizeof(struct if_msghdr);
|
break;
|
break;
|
|
|
default:
|
default:
|
len = sizeof(struct rt_msghdr);
|
len = sizeof(struct rt_msghdr);
|
}
|
}
|
if ((cp0 = cp) != NULL)
|
if ((cp0 = cp) != NULL)
|
cp += len;
|
cp += len;
|
for (i = 0; i < RTAX_MAX; i++) {
|
for (i = 0; i < RTAX_MAX; i++) {
|
register struct sockaddr *sa;
|
register struct sockaddr *sa;
|
|
|
if ((sa = rtinfo->rti_info[i]) == 0)
|
if ((sa = rtinfo->rti_info[i]) == 0)
|
continue;
|
continue;
|
rtinfo->rti_addrs |= (1 << i);
|
rtinfo->rti_addrs |= (1 << i);
|
dlen = ROUNDUP(sa->sa_len);
|
dlen = ROUNDUP(sa->sa_len);
|
if (cp) {
|
if (cp) {
|
bcopy((caddr_t)sa, cp, (unsigned)dlen);
|
bcopy((caddr_t)sa, cp, (unsigned)dlen);
|
cp += dlen;
|
cp += dlen;
|
}
|
}
|
len += dlen;
|
len += dlen;
|
}
|
}
|
if (cp == 0 && w != NULL && !second_time) {
|
if (cp == 0 && w != NULL && !second_time) {
|
register struct walkarg *rw = w;
|
register struct walkarg *rw = w;
|
|
|
rw->w_needed += len;
|
rw->w_needed += len;
|
if (rw->w_needed <= 0 && rw->w_where) {
|
if (rw->w_needed <= 0 && rw->w_where) {
|
if (rw->w_tmemsize < len) {
|
if (rw->w_tmemsize < len) {
|
if (rw->w_tmem)
|
if (rw->w_tmem)
|
free(rw->w_tmem, M_RTABLE);
|
free(rw->w_tmem, M_RTABLE);
|
rw->w_tmem = (caddr_t) malloc(len, M_RTABLE,
|
rw->w_tmem = (caddr_t) malloc(len, M_RTABLE,
|
M_NOWAIT);
|
M_NOWAIT);
|
if (rw->w_tmem)
|
if (rw->w_tmem)
|
rw->w_tmemsize = len;
|
rw->w_tmemsize = len;
|
}
|
}
|
if (rw->w_tmem) {
|
if (rw->w_tmem) {
|
cp = rw->w_tmem;
|
cp = rw->w_tmem;
|
second_time = 1;
|
second_time = 1;
|
goto again;
|
goto again;
|
} else
|
} else
|
rw->w_where = 0;
|
rw->w_where = 0;
|
}
|
}
|
}
|
}
|
if (cp) {
|
if (cp) {
|
register struct rt_msghdr *rtm = (struct rt_msghdr *)cp0;
|
register struct rt_msghdr *rtm = (struct rt_msghdr *)cp0;
|
|
|
rtm->rtm_version = RTM_VERSION;
|
rtm->rtm_version = RTM_VERSION;
|
rtm->rtm_type = type;
|
rtm->rtm_type = type;
|
rtm->rtm_msglen = len;
|
rtm->rtm_msglen = len;
|
}
|
}
|
return (len);
|
return (len);
|
}
|
}
|
|
|
/*
|
/*
|
* This routine is called to generate a message from the routing
|
* This routine is called to generate a message from the routing
|
* socket indicating that a redirect has occured, a routing lookup
|
* socket indicating that a redirect has occured, a routing lookup
|
* has failed, or that a protocol has detected timeouts to a particular
|
* has failed, or that a protocol has detected timeouts to a particular
|
* destination.
|
* destination.
|
*/
|
*/
|
void
|
void
|
rt_missmsg(type, rtinfo, flags, error)
|
rt_missmsg(type, rtinfo, flags, error)
|
int type, flags, error;
|
int type, flags, error;
|
register struct rt_addrinfo *rtinfo;
|
register struct rt_addrinfo *rtinfo;
|
{
|
{
|
register struct rt_msghdr *rtm;
|
register struct rt_msghdr *rtm;
|
register struct mbuf *m;
|
register struct mbuf *m;
|
struct sockaddr *sa = rtinfo->rti_info[RTAX_DST];
|
struct sockaddr *sa = rtinfo->rti_info[RTAX_DST];
|
|
|
if (route_cb.any_count == 0)
|
if (route_cb.any_count == 0)
|
return;
|
return;
|
m = rt_msg1(type, rtinfo);
|
m = rt_msg1(type, rtinfo);
|
if (m == 0)
|
if (m == 0)
|
return;
|
return;
|
rtm = mtod(m, struct rt_msghdr *);
|
rtm = mtod(m, struct rt_msghdr *);
|
rtm->rtm_flags = RTF_DONE | flags;
|
rtm->rtm_flags = RTF_DONE | flags;
|
rtm->rtm_errno = error;
|
rtm->rtm_errno = error;
|
rtm->rtm_addrs = rtinfo->rti_addrs;
|
rtm->rtm_addrs = rtinfo->rti_addrs;
|
route_proto.sp_protocol = sa ? sa->sa_family : 0;
|
route_proto.sp_protocol = sa ? sa->sa_family : 0;
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
}
|
}
|
|
|
/*
|
/*
|
* This routine is called to generate a message from the routing
|
* This routine is called to generate a message from the routing
|
* socket indicating that the status of a network interface has changed.
|
* socket indicating that the status of a network interface has changed.
|
*/
|
*/
|
void
|
void
|
rt_ifmsg(ifp)
|
rt_ifmsg(ifp)
|
register struct ifnet *ifp;
|
register struct ifnet *ifp;
|
{
|
{
|
register struct if_msghdr *ifm;
|
register struct if_msghdr *ifm;
|
struct mbuf *m;
|
struct mbuf *m;
|
struct rt_addrinfo info;
|
struct rt_addrinfo info;
|
|
|
if (route_cb.any_count == 0)
|
if (route_cb.any_count == 0)
|
return;
|
return;
|
bzero((caddr_t)&info, sizeof(info));
|
bzero((caddr_t)&info, sizeof(info));
|
m = rt_msg1(RTM_IFINFO, &info);
|
m = rt_msg1(RTM_IFINFO, &info);
|
if (m == 0)
|
if (m == 0)
|
return;
|
return;
|
ifm = mtod(m, struct if_msghdr *);
|
ifm = mtod(m, struct if_msghdr *);
|
ifm->ifm_index = ifp->if_index;
|
ifm->ifm_index = ifp->if_index;
|
ifm->ifm_flags = ifp->if_flags;
|
ifm->ifm_flags = ifp->if_flags;
|
ifm->ifm_data = ifp->if_data;
|
ifm->ifm_data = ifp->if_data;
|
ifm->ifm_addrs = 0;
|
ifm->ifm_addrs = 0;
|
route_proto.sp_protocol = 0;
|
route_proto.sp_protocol = 0;
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
}
|
}
|
|
|
/*
|
/*
|
* This is called to generate messages from the routing socket
|
* This is called to generate messages from the routing socket
|
* indicating a network interface has had addresses associated with it.
|
* indicating a network interface has had addresses associated with it.
|
* if we ever reverse the logic and replace messages TO the routing
|
* if we ever reverse the logic and replace messages TO the routing
|
* socket indicate a request to configure interfaces, then it will
|
* socket indicate a request to configure interfaces, then it will
|
* be unnecessary as the routing socket will automatically generate
|
* be unnecessary as the routing socket will automatically generate
|
* copies of it.
|
* copies of it.
|
*/
|
*/
|
void
|
void
|
rt_newaddrmsg(cmd, ifa, error, rt)
|
rt_newaddrmsg(cmd, ifa, error, rt)
|
int cmd, error;
|
int cmd, error;
|
register struct ifaddr *ifa;
|
register struct ifaddr *ifa;
|
register struct rtentry *rt;
|
register struct rtentry *rt;
|
{
|
{
|
struct rt_addrinfo info;
|
struct rt_addrinfo info;
|
struct sockaddr *sa = NULL;
|
struct sockaddr *sa = NULL;
|
int pass;
|
int pass;
|
struct mbuf *m = NULL;
|
struct mbuf *m = NULL;
|
struct ifnet *ifp = ifa->ifa_ifp;
|
struct ifnet *ifp = ifa->ifa_ifp;
|
|
|
if (route_cb.any_count == 0)
|
if (route_cb.any_count == 0)
|
return;
|
return;
|
for (pass = 1; pass < 3; pass++) {
|
for (pass = 1; pass < 3; pass++) {
|
bzero((caddr_t)&info, sizeof(info));
|
bzero((caddr_t)&info, sizeof(info));
|
if ((cmd == RTM_ADD && pass == 1) ||
|
if ((cmd == RTM_ADD && pass == 1) ||
|
(cmd == RTM_DELETE && pass == 2)) {
|
(cmd == RTM_DELETE && pass == 2)) {
|
register struct ifa_msghdr *ifam;
|
register struct ifa_msghdr *ifam;
|
int ncmd = cmd == RTM_ADD ? RTM_NEWADDR : RTM_DELADDR;
|
int ncmd = cmd == RTM_ADD ? RTM_NEWADDR : RTM_DELADDR;
|
|
|
ifaaddr = sa = ifa->ifa_addr;
|
ifaaddr = sa = ifa->ifa_addr;
|
ifpaddr = ifp->if_addrlist.tqh_first->ifa_addr;
|
ifpaddr = ifp->if_addrlist.tqh_first->ifa_addr;
|
netmask = ifa->ifa_netmask;
|
netmask = ifa->ifa_netmask;
|
brdaddr = ifa->ifa_dstaddr;
|
brdaddr = ifa->ifa_dstaddr;
|
if ((m = rt_msg1(ncmd, &info)) == NULL)
|
if ((m = rt_msg1(ncmd, &info)) == NULL)
|
continue;
|
continue;
|
ifam = mtod(m, struct ifa_msghdr *);
|
ifam = mtod(m, struct ifa_msghdr *);
|
ifam->ifam_index = ifp->if_index;
|
ifam->ifam_index = ifp->if_index;
|
ifam->ifam_metric = ifa->ifa_metric;
|
ifam->ifam_metric = ifa->ifa_metric;
|
ifam->ifam_flags = ifa->ifa_flags;
|
ifam->ifam_flags = ifa->ifa_flags;
|
ifam->ifam_addrs = info.rti_addrs;
|
ifam->ifam_addrs = info.rti_addrs;
|
}
|
}
|
if ((cmd == RTM_ADD && pass == 2) ||
|
if ((cmd == RTM_ADD && pass == 2) ||
|
(cmd == RTM_DELETE && pass == 1)) {
|
(cmd == RTM_DELETE && pass == 1)) {
|
register struct rt_msghdr *rtm;
|
register struct rt_msghdr *rtm;
|
|
|
if (rt == 0)
|
if (rt == 0)
|
continue;
|
continue;
|
netmask = rt_mask(rt);
|
netmask = rt_mask(rt);
|
dst = sa = rt_key(rt);
|
dst = sa = rt_key(rt);
|
gate = rt->rt_gateway;
|
gate = rt->rt_gateway;
|
if ((m = rt_msg1(cmd, &info)) == NULL)
|
if ((m = rt_msg1(cmd, &info)) == NULL)
|
continue;
|
continue;
|
rtm = mtod(m, struct rt_msghdr *);
|
rtm = mtod(m, struct rt_msghdr *);
|
rtm->rtm_index = ifp->if_index;
|
rtm->rtm_index = ifp->if_index;
|
rtm->rtm_flags |= rt->rt_flags;
|
rtm->rtm_flags |= rt->rt_flags;
|
rtm->rtm_errno = error;
|
rtm->rtm_errno = error;
|
rtm->rtm_addrs = info.rti_addrs;
|
rtm->rtm_addrs = info.rti_addrs;
|
}
|
}
|
route_proto.sp_protocol = sa ? sa->sa_family : 0;
|
route_proto.sp_protocol = sa ? sa->sa_family : 0;
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
}
|
}
|
}
|
}
|
|
|
#ifndef __ECOS
|
#ifndef __ECOS
|
/*
|
/*
|
* This is used in dumping the kernel table via sysctl().
|
* This is used in dumping the kernel table via sysctl().
|
*/
|
*/
|
int
|
int
|
sysctl_dumpentry(rn, v)
|
sysctl_dumpentry(rn, v)
|
struct radix_node *rn;
|
struct radix_node *rn;
|
register void *v;
|
register void *v;
|
{
|
{
|
register struct walkarg *w = v;
|
register struct walkarg *w = v;
|
register struct rtentry *rt = (struct rtentry *)rn;
|
register struct rtentry *rt = (struct rtentry *)rn;
|
int error = 0, size;
|
int error = 0, size;
|
struct rt_addrinfo info;
|
struct rt_addrinfo info;
|
|
|
if (w->w_op == NET_RT_FLAGS && !(rt->rt_flags & w->w_arg))
|
if (w->w_op == NET_RT_FLAGS && !(rt->rt_flags & w->w_arg))
|
return 0;
|
return 0;
|
bzero((caddr_t)&info, sizeof(info));
|
bzero((caddr_t)&info, sizeof(info));
|
dst = rt_key(rt);
|
dst = rt_key(rt);
|
gate = rt->rt_gateway;
|
gate = rt->rt_gateway;
|
netmask = rt_mask(rt);
|
netmask = rt_mask(rt);
|
genmask = rt->rt_genmask;
|
genmask = rt->rt_genmask;
|
if (rt->rt_ifp) {
|
if (rt->rt_ifp) {
|
ifpaddr = rt->rt_ifp->if_addrlist.tqh_first->ifa_addr;
|
ifpaddr = rt->rt_ifp->if_addrlist.tqh_first->ifa_addr;
|
ifaaddr = rt->rt_ifa->ifa_addr;
|
ifaaddr = rt->rt_ifa->ifa_addr;
|
if (rt->rt_ifp->if_flags & IFF_POINTOPOINT)
|
if (rt->rt_ifp->if_flags & IFF_POINTOPOINT)
|
brdaddr = rt->rt_ifa->ifa_dstaddr;
|
brdaddr = rt->rt_ifa->ifa_dstaddr;
|
}
|
}
|
size = rt_msg2(RTM_GET, &info, 0, w);
|
size = rt_msg2(RTM_GET, &info, 0, w);
|
if (w->w_where && w->w_tmem) {
|
if (w->w_where && w->w_tmem) {
|
register struct rt_msghdr *rtm = (struct rt_msghdr *)w->w_tmem;
|
register struct rt_msghdr *rtm = (struct rt_msghdr *)w->w_tmem;
|
|
|
rtm->rtm_flags = rt->rt_flags;
|
rtm->rtm_flags = rt->rt_flags;
|
rtm->rtm_use = rt->rt_use;
|
rtm->rtm_use = rt->rt_use;
|
rtm->rtm_rmx = rt->rt_rmx;
|
rtm->rtm_rmx = rt->rt_rmx;
|
rtm->rtm_index = rt->rt_ifp->if_index;
|
rtm->rtm_index = rt->rt_ifp->if_index;
|
rtm->rtm_errno = rtm->rtm_pid = rtm->rtm_seq = 0;
|
rtm->rtm_errno = rtm->rtm_pid = rtm->rtm_seq = 0;
|
rtm->rtm_addrs = info.rti_addrs;
|
rtm->rtm_addrs = info.rti_addrs;
|
if ((error = copyout((caddr_t)rtm, w->w_where, size)) != 0)
|
if ((error = copyout((caddr_t)rtm, w->w_where, size)) != 0)
|
w->w_where = NULL;
|
w->w_where = NULL;
|
else
|
else
|
w->w_where += size;
|
w->w_where += size;
|
}
|
}
|
return (error);
|
return (error);
|
}
|
}
|
|
|
int
|
int
|
sysctl_iflist(af, w)
|
sysctl_iflist(af, w)
|
int af;
|
int af;
|
register struct walkarg *w;
|
register struct walkarg *w;
|
{
|
{
|
register struct ifnet *ifp;
|
register struct ifnet *ifp;
|
register struct ifaddr *ifa;
|
register struct ifaddr *ifa;
|
struct rt_addrinfo info;
|
struct rt_addrinfo info;
|
int len, error = 0;
|
int len, error = 0;
|
|
|
bzero((caddr_t)&info, sizeof(info));
|
bzero((caddr_t)&info, sizeof(info));
|
for (ifp = ifnet.tqh_first; ifp != 0; ifp = ifp->if_list.tqe_next) {
|
for (ifp = ifnet.tqh_first; ifp != 0; ifp = ifp->if_list.tqe_next) {
|
if (w->w_arg && w->w_arg != ifp->if_index)
|
if (w->w_arg && w->w_arg != ifp->if_index)
|
continue;
|
continue;
|
ifa = ifp->if_addrlist.tqh_first;
|
ifa = ifp->if_addrlist.tqh_first;
|
ifpaddr = ifa->ifa_addr;
|
ifpaddr = ifa->ifa_addr;
|
len = rt_msg2(RTM_IFINFO, &info, (caddr_t)0, w);
|
len = rt_msg2(RTM_IFINFO, &info, (caddr_t)0, w);
|
ifpaddr = 0;
|
ifpaddr = 0;
|
if (w->w_where && w->w_tmem) {
|
if (w->w_where && w->w_tmem) {
|
register struct if_msghdr *ifm;
|
register struct if_msghdr *ifm;
|
|
|
ifm = (struct if_msghdr *)w->w_tmem;
|
ifm = (struct if_msghdr *)w->w_tmem;
|
ifm->ifm_index = ifp->if_index;
|
ifm->ifm_index = ifp->if_index;
|
ifm->ifm_flags = ifp->if_flags;
|
ifm->ifm_flags = ifp->if_flags;
|
ifm->ifm_data = ifp->if_data;
|
ifm->ifm_data = ifp->if_data;
|
ifm->ifm_addrs = info.rti_addrs;
|
ifm->ifm_addrs = info.rti_addrs;
|
error = copyout((caddr_t)ifm, w->w_where, len);
|
error = copyout((caddr_t)ifm, w->w_where, len);
|
if (error)
|
if (error)
|
return (error);
|
return (error);
|
w->w_where += len;
|
w->w_where += len;
|
}
|
}
|
while ((ifa = ifa->ifa_list.tqe_next) != NULL) {
|
while ((ifa = ifa->ifa_list.tqe_next) != NULL) {
|
if (af && af != ifa->ifa_addr->sa_family)
|
if (af && af != ifa->ifa_addr->sa_family)
|
continue;
|
continue;
|
ifaaddr = ifa->ifa_addr;
|
ifaaddr = ifa->ifa_addr;
|
netmask = ifa->ifa_netmask;
|
netmask = ifa->ifa_netmask;
|
brdaddr = ifa->ifa_dstaddr;
|
brdaddr = ifa->ifa_dstaddr;
|
len = rt_msg2(RTM_NEWADDR, &info, 0, w);
|
len = rt_msg2(RTM_NEWADDR, &info, 0, w);
|
if (w->w_where && w->w_tmem) {
|
if (w->w_where && w->w_tmem) {
|
register struct ifa_msghdr *ifam;
|
register struct ifa_msghdr *ifam;
|
|
|
ifam = (struct ifa_msghdr *)w->w_tmem;
|
ifam = (struct ifa_msghdr *)w->w_tmem;
|
ifam->ifam_index = ifa->ifa_ifp->if_index;
|
ifam->ifam_index = ifa->ifa_ifp->if_index;
|
ifam->ifam_flags = ifa->ifa_flags;
|
ifam->ifam_flags = ifa->ifa_flags;
|
ifam->ifam_metric = ifa->ifa_metric;
|
ifam->ifam_metric = ifa->ifa_metric;
|
ifam->ifam_addrs = info.rti_addrs;
|
ifam->ifam_addrs = info.rti_addrs;
|
error = copyout(w->w_tmem, w->w_where, len);
|
error = copyout(w->w_tmem, w->w_where, len);
|
if (error)
|
if (error)
|
return (error);
|
return (error);
|
w->w_where += len;
|
w->w_where += len;
|
}
|
}
|
}
|
}
|
ifaaddr = netmask = brdaddr = 0;
|
ifaaddr = netmask = brdaddr = 0;
|
}
|
}
|
return (0);
|
return (0);
|
}
|
}
|
|
|
int
|
int
|
sysctl_rtable(name, namelen, where, given, new, newlen)
|
sysctl_rtable(name, namelen, where, given, new, newlen)
|
int *name;
|
int *name;
|
u_int namelen;
|
u_int namelen;
|
void *where;
|
void *where;
|
size_t *given;
|
size_t *given;
|
void *new;
|
void *new;
|
size_t newlen;
|
size_t newlen;
|
{
|
{
|
register struct radix_node_head *rnh;
|
register struct radix_node_head *rnh;
|
int i, s, error = EINVAL;
|
int i, s, error = EINVAL;
|
u_char af;
|
u_char af;
|
struct walkarg w;
|
struct walkarg w;
|
|
|
if (new)
|
if (new)
|
return (EPERM);
|
return (EPERM);
|
if (namelen != 3)
|
if (namelen != 3)
|
return (EINVAL);
|
return (EINVAL);
|
af = name[0];
|
af = name[0];
|
Bzero(&w, sizeof(w));
|
Bzero(&w, sizeof(w));
|
w.w_where = where;
|
w.w_where = where;
|
w.w_given = *given;
|
w.w_given = *given;
|
w.w_needed = 0 - w.w_given;
|
w.w_needed = 0 - w.w_given;
|
w.w_op = name[1];
|
w.w_op = name[1];
|
w.w_arg = name[2];
|
w.w_arg = name[2];
|
|
|
s = splsoftnet();
|
s = splsoftnet();
|
switch (w.w_op) {
|
switch (w.w_op) {
|
|
|
case NET_RT_DUMP:
|
case NET_RT_DUMP:
|
case NET_RT_FLAGS:
|
case NET_RT_FLAGS:
|
for (i = 1; i <= AF_MAX; i++)
|
for (i = 1; i <= AF_MAX; i++)
|
if ((rnh = rt_tables[i]) && (af == 0 || af == i) &&
|
if ((rnh = rt_tables[i]) && (af == 0 || af == i) &&
|
(error = (*rnh->rnh_walktree)(rnh,
|
(error = (*rnh->rnh_walktree)(rnh,
|
sysctl_dumpentry,
|
sysctl_dumpentry,
|
&w)))
|
&w)))
|
break;
|
break;
|
break;
|
break;
|
|
|
case NET_RT_IFLIST:
|
case NET_RT_IFLIST:
|
error = sysctl_iflist(af, &w);
|
error = sysctl_iflist(af, &w);
|
}
|
}
|
splx(s);
|
splx(s);
|
if (w.w_tmem)
|
if (w.w_tmem)
|
free(w.w_tmem, M_RTABLE);
|
free(w.w_tmem, M_RTABLE);
|
w.w_needed += w.w_given;
|
w.w_needed += w.w_given;
|
if (where) {
|
if (where) {
|
*given = w.w_where - (caddr_t) where;
|
*given = w.w_where - (caddr_t) where;
|
if (*given < w.w_needed)
|
if (*given < w.w_needed)
|
return (ENOMEM);
|
return (ENOMEM);
|
} else {
|
} else {
|
*given = (11 * w.w_needed) / 10;
|
*given = (11 * w.w_needed) / 10;
|
}
|
}
|
return (error);
|
return (error);
|
}
|
}
|
#endif
|
#endif
|
|
|
/*
|
/*
|
* Definitions of protocols supported in the ROUTE domain.
|
* Definitions of protocols supported in the ROUTE domain.
|
*/
|
*/
|
|
|
extern struct domain routedomain; /* or at least forward */
|
extern struct domain routedomain; /* or at least forward */
|
|
|
struct protosw routesw[] = {
|
struct protosw routesw[] = {
|
{ SOCK_RAW, &routedomain, 0, PR_ATOMIC|PR_ADDR,
|
{ SOCK_RAW, &routedomain, 0, PR_ATOMIC|PR_ADDR,
|
raw_input, route_output, raw_ctlinput, 0,
|
raw_input, route_output, raw_ctlinput, 0,
|
route_usrreq,
|
route_usrreq,
|
raw_init, 0, 0, 0,
|
raw_init, 0, 0, 0,
|
#ifdef __ECOS
|
#ifdef __ECOS
|
0,
|
0,
|
#else
|
#else
|
sysctl_rtable,
|
sysctl_rtable,
|
#endif
|
#endif
|
}
|
}
|
};
|
};
|
|
|
struct domain routedomain =
|
struct domain routedomain =
|
{ PF_ROUTE, "route", route_init, 0, 0,
|
{ PF_ROUTE, "route", route_init, 0, 0,
|
routesw, &routesw[sizeof(routesw)/sizeof(routesw[0])] };
|
routesw, &routesw[sizeof(routesw)/sizeof(routesw[0])] };
|
|
|
