First take at security model abstraction.
- Add a few scopes to the kernel: system, network, and machdep.
- Add a few more actions/sub-actions (requests), and start using them as
opposed to the KAUTH_GENERIC_ISSUSER place-holders.
- Introduce a basic set of listeners that implement our "traditional"
security model, called "bsd44". This is the default (and only) model we
have at the moment.
- Update all relevant documentation.
- Add some code and docs to help folks who want to actually use this stuff:
* There's a sample overlay model, sitting on-top of "bsd44", for
fast experimenting with tweaking just a subset of an existing model.
This is pretty cool because it's *really* straightforward to do stuff
you had to use ugly hacks for until now...
* And of course, documentation describing how to do the above for quick
reference, including code samples.
All of these changes were tested for regressions using a Python-based
testsuite that will be (I hope) available soon via pkgsrc. Information
about the tests, and how to write new ones, can be found on:
http://kauth.linbsd.org/kauthwiki
NOTE FOR DEVELOPERS: *PLEASE* don't add any code that does any of the
following:
- Uses a KAUTH_GENERIC_ISSUSER kauth(9) request,
- Checks 'securelevel' directly,
- Checks a uid/gid directly.
(or if you feel you have to, contact me first)
This is still work in progress; It's far from being done, but now it'll
be a lot easier.
Relevant mailing list threads:
http://mail-index.netbsd.org/tech-security/2006/01/25/0011.html
http://mail-index.netbsd.org/tech-security/2006/03/24/0001.html
http://mail-index.netbsd.org/tech-security/2006/04/18/0000.html
http://mail-index.netbsd.org/tech-security/2006/05/15/0000.html
http://mail-index.netbsd.org/tech-security/2006/08/01/0000.html
http://mail-index.netbsd.org/tech-security/2006/08/25/0000.html
Many thanks to YAMAMOTO Takashi, Matt Thomas, and Christos Zoulas for help
stablizing kauth(9).
Full credit for the regression tests, making sure these changes didn't break
anything, goes to Matt Fleming and Jaime Fournier.
Happy birthday Randi! :)
2006-09-09 00:58:56 +04:00
|
|
|
/* $NetBSD: rtsock.c,v 1.88 2006/09/08 20:58:58 elad Exp $ */
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2005-02-27 01:45:09 +03:00
|
|
|
*
|
1999-07-01 12:12:45 +04:00
|
|
|
* 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 project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
2005-02-27 01:45:09 +03:00
|
|
|
*
|
1999-07-01 12:12:45 +04:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT 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 PROJECT 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.
|
|
|
|
*/
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
1994-05-13 10:02:48 +04:00
|
|
|
* Copyright (c) 1988, 1991, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
1993-03-21 12:45:37 +03:00
|
|
|
*
|
|
|
|
* 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.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1993-03-21 12:45:37 +03:00
|
|
|
* 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.
|
|
|
|
*
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)rtsock.c 8.7 (Berkeley) 10/12/95
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
|
|
|
|
2001-11-13 02:49:33 +03:00
|
|
|
#include <sys/cdefs.h>
|
First take at security model abstraction.
- Add a few scopes to the kernel: system, network, and machdep.
- Add a few more actions/sub-actions (requests), and start using them as
opposed to the KAUTH_GENERIC_ISSUSER place-holders.
- Introduce a basic set of listeners that implement our "traditional"
security model, called "bsd44". This is the default (and only) model we
have at the moment.
- Update all relevant documentation.
- Add some code and docs to help folks who want to actually use this stuff:
* There's a sample overlay model, sitting on-top of "bsd44", for
fast experimenting with tweaking just a subset of an existing model.
This is pretty cool because it's *really* straightforward to do stuff
you had to use ugly hacks for until now...
* And of course, documentation describing how to do the above for quick
reference, including code samples.
All of these changes were tested for regressions using a Python-based
testsuite that will be (I hope) available soon via pkgsrc. Information
about the tests, and how to write new ones, can be found on:
http://kauth.linbsd.org/kauthwiki
NOTE FOR DEVELOPERS: *PLEASE* don't add any code that does any of the
following:
- Uses a KAUTH_GENERIC_ISSUSER kauth(9) request,
- Checks 'securelevel' directly,
- Checks a uid/gid directly.
(or if you feel you have to, contact me first)
This is still work in progress; It's far from being done, but now it'll
be a lot easier.
Relevant mailing list threads:
http://mail-index.netbsd.org/tech-security/2006/01/25/0011.html
http://mail-index.netbsd.org/tech-security/2006/03/24/0001.html
http://mail-index.netbsd.org/tech-security/2006/04/18/0000.html
http://mail-index.netbsd.org/tech-security/2006/05/15/0000.html
http://mail-index.netbsd.org/tech-security/2006/08/01/0000.html
http://mail-index.netbsd.org/tech-security/2006/08/25/0000.html
Many thanks to YAMAMOTO Takashi, Matt Thomas, and Christos Zoulas for help
stablizing kauth(9).
Full credit for the regression tests, making sure these changes didn't break
anything, goes to Matt Fleming and Jaime Fournier.
Happy birthday Randi! :)
2006-09-09 00:58:56 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: rtsock.c,v 1.88 2006/09/08 20:58:58 elad Exp $");
|
2001-11-13 02:49:33 +03:00
|
|
|
|
1999-07-10 03:41:16 +04:00
|
|
|
#include "opt_inet.h"
|
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/proc.h>
|
1994-05-13 10:02:48 +04:00
|
|
|
#include <sys/mbuf.h>
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/domain.h>
|
|
|
|
#include <sys/protosw.h>
|
1996-02-14 00:59:53 +03:00
|
|
|
#include <sys/sysctl.h>
|
2006-05-15 01:19:33 +04:00
|
|
|
#include <sys/kauth.h>
|
1996-02-14 00:59:53 +03:00
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/raw_cb.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1996-02-14 00:59:53 +03:00
|
|
|
#include <machine/stdarg.h>
|
|
|
|
|
2005-01-23 21:41:56 +03:00
|
|
|
DOMAIN_DEFINE(routedomain); /* forward declare and add to link set */
|
2003-02-26 09:31:08 +03:00
|
|
|
|
2006-09-03 09:08:18 +04:00
|
|
|
struct sockaddr route_dst = { .sa_len = 2, .sa_family = PF_ROUTE, };
|
|
|
|
struct sockaddr route_src = { .sa_len = 2, .sa_family = PF_ROUTE, };
|
|
|
|
struct sockproto route_proto = { .sp_family = PF_ROUTE, };
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
struct walkarg {
|
1999-04-02 21:22:21 +04:00
|
|
|
int w_op;
|
|
|
|
int w_arg;
|
|
|
|
int w_given;
|
|
|
|
int w_needed;
|
|
|
|
caddr_t w_where;
|
|
|
|
int w_tmemsize;
|
|
|
|
int w_tmemneeded;
|
|
|
|
caddr_t w_tmem;
|
1994-05-13 10:02:48 +04:00
|
|
|
};
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2004-04-22 01:03:43 +04:00
|
|
|
static struct mbuf *rt_msg1(int, struct rt_addrinfo *, caddr_t, int);
|
|
|
|
static int rt_msg2(int, struct rt_addrinfo *, caddr_t, struct walkarg *, int *);
|
2004-10-23 23:13:22 +04:00
|
|
|
static int rt_xaddrs(u_char, const char *, const char *, struct rt_addrinfo *);
|
2005-06-22 10:14:51 +04:00
|
|
|
static struct mbuf *rt_makeifannouncemsg(struct ifnet *, int, int,
|
|
|
|
struct rt_addrinfo *);
|
2004-04-22 01:03:43 +04:00
|
|
|
static int sysctl_dumpentry(struct radix_node *, void *);
|
|
|
|
static int sysctl_iflist(int, struct walkarg *, int);
|
|
|
|
static int sysctl_rtable(SYSCTLFN_PROTO);
|
2005-12-24 23:45:08 +03:00
|
|
|
static inline void rt_adjustcount(int, int);
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
/* Sleazy use of local variables throughout file, warning!!!! */
|
|
|
|
#define dst info.rti_info[RTAX_DST]
|
|
|
|
#define gate info.rti_info[RTAX_GATEWAY]
|
|
|
|
#define netmask info.rti_info[RTAX_NETMASK]
|
|
|
|
#define genmask info.rti_info[RTAX_GENMASK]
|
|
|
|
#define ifpaddr info.rti_info[RTAX_IFP]
|
|
|
|
#define ifaaddr info.rti_info[RTAX_IFA]
|
|
|
|
#define brdaddr info.rti_info[RTAX_BRD]
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2005-12-24 23:45:08 +03:00
|
|
|
static inline void
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_adjustcount(int af, int cnt)
|
1998-12-10 18:52:39 +03:00
|
|
|
{
|
1998-12-12 20:26:09 +03:00
|
|
|
route_cb.any_count += cnt;
|
1998-12-10 18:52:39 +03:00
|
|
|
switch (af) {
|
|
|
|
case AF_INET:
|
|
|
|
route_cb.ip_count += cnt;
|
|
|
|
return;
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
route_cb.ip6_count += cnt;
|
|
|
|
return;
|
|
|
|
#endif
|
1998-12-10 18:52:39 +03:00
|
|
|
case AF_IPX:
|
|
|
|
route_cb.ipx_count += cnt;
|
|
|
|
return;
|
|
|
|
case AF_NS:
|
|
|
|
route_cb.ns_count += cnt;
|
|
|
|
return;
|
|
|
|
case AF_ISO:
|
|
|
|
route_cb.iso_count += cnt;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*ARGSUSED*/
|
1994-05-11 13:26:46 +04:00
|
|
|
int
|
2004-04-22 01:03:43 +04:00
|
|
|
route_usrreq(struct socket *so, int req, struct mbuf *m, struct mbuf *nam,
|
2005-12-11 15:16:03 +03:00
|
|
|
struct mbuf *control, struct lwp *l)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 13:45:33 +04:00
|
|
|
int error = 0;
|
|
|
|
struct rawcb *rp = sotorawcb(so);
|
1993-03-21 12:45:37 +03:00
|
|
|
int s;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
if (req == PRU_ATTACH) {
|
|
|
|
MALLOC(rp, struct rawcb *, sizeof(*rp), M_PCB, M_WAITOK);
|
1996-02-14 00:59:53 +03:00
|
|
|
if ((so->so_pcb = rp) != NULL)
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(so->so_pcb, 0, sizeof(*rp));
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
}
|
1998-12-10 18:52:39 +03:00
|
|
|
if (req == PRU_DETACH && rp)
|
|
|
|
rt_adjustcount(rp->rcb_proto.sp_protocol, -1);
|
1995-08-13 03:59:09 +04:00
|
|
|
s = splsoftnet();
|
1997-02-22 06:47:01 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Don't call raw_usrreq() in the attach case, because
|
|
|
|
* we want to allow non-privileged processes to listen on
|
|
|
|
* and send "safe" commands to the routing socket.
|
|
|
|
*/
|
|
|
|
if (req == PRU_ATTACH) {
|
2005-12-11 15:16:03 +03:00
|
|
|
if (l == 0)
|
1997-02-22 06:47:01 +03:00
|
|
|
error = EACCES;
|
|
|
|
else
|
|
|
|
error = raw_attach(so, (int)(long)nam);
|
|
|
|
} else
|
2005-12-11 15:16:03 +03:00
|
|
|
error = raw_usrreq(so, req, m, nam, control, l);
|
1997-02-22 06:47:01 +03:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
rp = sotorawcb(so);
|
|
|
|
if (req == PRU_ATTACH && rp) {
|
|
|
|
if (error) {
|
|
|
|
free((caddr_t)rp, M_PCB);
|
|
|
|
splx(s);
|
|
|
|
return (error);
|
|
|
|
}
|
1998-12-10 18:52:39 +03:00
|
|
|
rt_adjustcount(rp->rcb_proto.sp_protocol, 1);
|
1996-05-23 22:30:57 +04:00
|
|
|
rp->rcb_laddr = &route_src;
|
|
|
|
rp->rcb_faddr = &route_dst;
|
1993-03-21 12:45:37 +03:00
|
|
|
soisconnected(so);
|
|
|
|
so->so_options |= SO_USELOOPBACK;
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
1994-05-11 13:26:46 +04:00
|
|
|
int
|
1996-02-14 00:59:53 +03:00
|
|
|
route_output(struct mbuf *m, ...)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 13:45:33 +04:00
|
|
|
struct rt_msghdr *rtm = 0;
|
|
|
|
struct radix_node *rn = 0;
|
|
|
|
struct rtentry *rt = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
struct rtentry *saved_nrt = 0;
|
1995-08-19 11:48:14 +04:00
|
|
|
struct radix_node_head *rnh;
|
1994-05-13 10:02:48 +04:00
|
|
|
struct rt_addrinfo info;
|
1993-03-21 12:45:37 +03:00
|
|
|
int len, error = 0;
|
|
|
|
struct ifnet *ifp = 0;
|
2000-02-17 07:28:00 +03:00
|
|
|
struct ifaddr *ifa = 0;
|
1996-02-14 00:59:53 +03:00
|
|
|
struct socket *so;
|
|
|
|
va_list ap;
|
2002-02-22 20:26:31 +03:00
|
|
|
sa_family_t family;
|
1996-02-14 00:59:53 +03:00
|
|
|
|
|
|
|
va_start(ap, m);
|
|
|
|
so = va_arg(ap, struct socket *);
|
|
|
|
va_end(ap);
|
|
|
|
|
2002-11-02 10:20:42 +03:00
|
|
|
#define senderr(e) do { error = e; goto flush;} while (/*CONSTCOND*/ 0)
|
1995-03-08 05:56:49 +03:00
|
|
|
if (m == 0 || ((m->m_len < sizeof(int32_t)) &&
|
1996-07-01 05:12:32 +04:00
|
|
|
(m = m_pullup(m, sizeof(int32_t))) == 0))
|
1993-03-21 12:45:37 +03:00
|
|
|
return (ENOBUFS);
|
|
|
|
if ((m->m_flags & M_PKTHDR) == 0)
|
|
|
|
panic("route_output");
|
|
|
|
len = m->m_pkthdr.len;
|
|
|
|
if (len < sizeof(*rtm) ||
|
1994-05-13 10:02:48 +04:00
|
|
|
len != mtod(m, struct rt_msghdr *)->rtm_msglen) {
|
|
|
|
dst = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
senderr(EINVAL);
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
R_Malloc(rtm, struct rt_msghdr *, len);
|
1994-05-13 10:02:48 +04:00
|
|
|
if (rtm == 0) {
|
|
|
|
dst = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
senderr(ENOBUFS);
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
m_copydata(m, 0, len, (caddr_t)rtm);
|
1994-05-13 10:02:48 +04:00
|
|
|
if (rtm->rtm_version != RTM_VERSION) {
|
|
|
|
dst = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
senderr(EPROTONOSUPPORT);
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
rtm->rtm_pid = curproc->p_pid;
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&info, 0, sizeof(info));
|
1994-05-13 10:02:48 +04:00
|
|
|
info.rti_addrs = rtm->rtm_addrs;
|
2004-10-23 23:13:22 +04:00
|
|
|
if (rt_xaddrs(rtm->rtm_type, (caddr_t)(rtm + 1), len + (caddr_t)rtm, &info))
|
2000-09-28 05:14:06 +04:00
|
|
|
senderr(EINVAL);
|
2001-01-17 07:05:41 +03:00
|
|
|
info.rti_flags = rtm->rtm_flags;
|
1998-03-01 05:20:01 +03:00
|
|
|
if (dst == 0 || (dst->sa_family >= AF_MAX))
|
|
|
|
senderr(EINVAL);
|
|
|
|
if (gate != 0 && (gate->sa_family >= AF_MAX))
|
1993-03-21 12:45:37 +03:00
|
|
|
senderr(EINVAL);
|
1994-05-13 10:02:48 +04:00
|
|
|
if (genmask) {
|
|
|
|
struct radix_node *t;
|
2005-05-30 01:22:52 +04:00
|
|
|
t = rn_addmask(genmask, 0, 1);
|
|
|
|
if (t && genmask->sa_len >= ((const struct sockaddr *)t->rn_key)->sa_len &&
|
|
|
|
Bcmp((const char *const *)genmask + 1, (const char *const *)t->rn_key + 1,
|
|
|
|
((const struct sockaddr *)t->rn_key)->sa_len) - 1)
|
|
|
|
genmask = (const struct sockaddr *)(t->rn_key);
|
1993-03-21 12:45:37 +03:00
|
|
|
else
|
|
|
|
senderr(ENOBUFS);
|
|
|
|
}
|
1997-02-22 06:47:01 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Verify that the caller has the appropriate privilege; RTM_GET
|
|
|
|
* is the only operation the non-superuser is allowed.
|
|
|
|
*/
|
First take at security model abstraction.
- Add a few scopes to the kernel: system, network, and machdep.
- Add a few more actions/sub-actions (requests), and start using them as
opposed to the KAUTH_GENERIC_ISSUSER place-holders.
- Introduce a basic set of listeners that implement our "traditional"
security model, called "bsd44". This is the default (and only) model we
have at the moment.
- Update all relevant documentation.
- Add some code and docs to help folks who want to actually use this stuff:
* There's a sample overlay model, sitting on-top of "bsd44", for
fast experimenting with tweaking just a subset of an existing model.
This is pretty cool because it's *really* straightforward to do stuff
you had to use ugly hacks for until now...
* And of course, documentation describing how to do the above for quick
reference, including code samples.
All of these changes were tested for regressions using a Python-based
testsuite that will be (I hope) available soon via pkgsrc. Information
about the tests, and how to write new ones, can be found on:
http://kauth.linbsd.org/kauthwiki
NOTE FOR DEVELOPERS: *PLEASE* don't add any code that does any of the
following:
- Uses a KAUTH_GENERIC_ISSUSER kauth(9) request,
- Checks 'securelevel' directly,
- Checks a uid/gid directly.
(or if you feel you have to, contact me first)
This is still work in progress; It's far from being done, but now it'll
be a lot easier.
Relevant mailing list threads:
http://mail-index.netbsd.org/tech-security/2006/01/25/0011.html
http://mail-index.netbsd.org/tech-security/2006/03/24/0001.html
http://mail-index.netbsd.org/tech-security/2006/04/18/0000.html
http://mail-index.netbsd.org/tech-security/2006/05/15/0000.html
http://mail-index.netbsd.org/tech-security/2006/08/01/0000.html
http://mail-index.netbsd.org/tech-security/2006/08/25/0000.html
Many thanks to YAMAMOTO Takashi, Matt Thomas, and Christos Zoulas for help
stablizing kauth(9).
Full credit for the regression tests, making sure these changes didn't break
anything, goes to Matt Fleming and Jaime Fournier.
Happy birthday Randi! :)
2006-09-09 00:58:56 +04:00
|
|
|
if (kauth_authorize_network(curlwp->l_cred, KAUTH_NETWORK_ROUTE,
|
|
|
|
rtm, NULL, NULL, NULL) != 0)
|
1997-02-22 06:47:01 +03:00
|
|
|
senderr(EACCES);
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
switch (rtm->rtm_type) {
|
1994-05-13 10:02:48 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
case RTM_ADD:
|
|
|
|
if (gate == 0)
|
|
|
|
senderr(EINVAL);
|
2001-01-17 07:05:41 +03:00
|
|
|
error = rtrequest1(rtm->rtm_type, &info, &saved_nrt);
|
1993-03-21 12:45:37 +03:00
|
|
|
if (error == 0 && saved_nrt) {
|
|
|
|
rt_setmetrics(rtm->rtm_inits,
|
1996-07-01 05:12:32 +04:00
|
|
|
&rtm->rtm_rmx, &saved_nrt->rt_rmx);
|
1993-03-21 12:45:37 +03:00
|
|
|
saved_nrt->rt_refcnt--;
|
|
|
|
saved_nrt->rt_genmask = genmask;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case RTM_DELETE:
|
2001-01-17 07:05:41 +03:00
|
|
|
error = rtrequest1(rtm->rtm_type, &info, &saved_nrt);
|
1995-08-19 11:48:14 +04:00
|
|
|
if (error == 0) {
|
|
|
|
(rt = saved_nrt)->rt_refcnt++;
|
|
|
|
goto report;
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case RTM_GET:
|
|
|
|
case RTM_CHANGE:
|
|
|
|
case RTM_LOCK:
|
1995-08-19 11:48:14 +04:00
|
|
|
if ((rnh = rt_tables[dst->sa_family]) == 0) {
|
|
|
|
senderr(EAFNOSUPPORT);
|
2000-03-10 17:47:12 +03:00
|
|
|
}
|
|
|
|
rn = rnh->rnh_lookup(dst, netmask, rnh);
|
|
|
|
if (rn == NULL || (rn->rn_flags & RNF_ROOT) != 0) {
|
1993-03-21 12:45:37 +03:00
|
|
|
senderr(ESRCH);
|
2000-03-10 17:47:12 +03:00
|
|
|
}
|
|
|
|
rt = (struct rtentry *)rn;
|
|
|
|
rt->rt_refcnt++;
|
2003-06-24 12:31:32 +04:00
|
|
|
if (rtm->rtm_type != RTM_GET) {/* XXX: too grotty */
|
2005-05-30 01:22:52 +04:00
|
|
|
struct radix_node *rnn;
|
2003-06-24 12:31:32 +04:00
|
|
|
extern struct radix_node_head *mask_rnhead;
|
|
|
|
|
|
|
|
if (Bcmp(dst, rt_key(rt), dst->sa_len) != 0)
|
|
|
|
senderr(ESRCH);
|
2005-05-30 01:22:52 +04:00
|
|
|
if (netmask && (rnn = rn_search(netmask,
|
2003-06-24 12:31:32 +04:00
|
|
|
mask_rnhead->rnh_treetop)))
|
2005-05-30 01:22:52 +04:00
|
|
|
netmask = (const struct sockaddr *)rnn->rn_key;
|
|
|
|
for (rnn = rt->rt_nodes; rnn; rnn = rnn->rn_dupedkey)
|
|
|
|
if (netmask == (const struct sockaddr *)rnn->rn_mask)
|
2003-06-24 12:31:32 +04:00
|
|
|
break;
|
2005-05-30 01:22:52 +04:00
|
|
|
if (rnn == 0)
|
2003-06-24 12:31:32 +04:00
|
|
|
senderr(ETOOMANYREFS);
|
2005-05-30 01:22:52 +04:00
|
|
|
rt = (struct rtentry *)rnn;
|
2003-06-24 12:31:32 +04:00
|
|
|
}
|
2000-03-10 17:47:12 +03:00
|
|
|
|
2003-05-02 07:15:23 +04:00
|
|
|
switch (rtm->rtm_type) {
|
1993-03-21 12:45:37 +03:00
|
|
|
case RTM_GET:
|
1995-08-19 11:48:14 +04:00
|
|
|
report:
|
1994-05-13 10:02:48 +04:00
|
|
|
dst = rt_key(rt);
|
|
|
|
gate = rt->rt_gateway;
|
|
|
|
netmask = rt_mask(rt);
|
|
|
|
genmask = rt->rt_genmask;
|
1993-03-21 12:45:37 +03:00
|
|
|
if (rtm->rtm_addrs & (RTA_IFP | RTA_IFA)) {
|
1996-02-14 00:59:53 +03:00
|
|
|
if ((ifp = rt->rt_ifp) != NULL) {
|
2001-11-05 21:02:15 +03:00
|
|
|
ifpaddr = TAILQ_FIRST(&ifp->if_addrlist)->ifa_addr;
|
1993-03-21 12:45:37 +03:00
|
|
|
ifaaddr = rt->rt_ifa->ifa_addr;
|
1995-08-19 11:48:14 +04:00
|
|
|
if (ifp->if_flags & IFF_POINTOPOINT)
|
|
|
|
brdaddr = rt->rt_ifa->ifa_dstaddr;
|
|
|
|
else
|
|
|
|
brdaddr = 0;
|
1994-05-13 10:02:48 +04:00
|
|
|
rtm->rtm_index = ifp->if_index;
|
1993-03-21 12:45:37 +03:00
|
|
|
} else {
|
1994-05-13 10:02:48 +04:00
|
|
|
ifpaddr = 0;
|
|
|
|
ifaaddr = 0;
|
2000-03-10 17:47:12 +03:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1999-04-02 21:22:21 +04:00
|
|
|
(void)rt_msg2(rtm->rtm_type, &info, (caddr_t)0,
|
|
|
|
(struct walkarg *)0, &len);
|
1993-03-21 12:45:37 +03:00
|
|
|
if (len > rtm->rtm_msglen) {
|
|
|
|
struct rt_msghdr *new_rtm;
|
|
|
|
R_Malloc(new_rtm, struct rt_msghdr *, len);
|
|
|
|
if (new_rtm == 0)
|
|
|
|
senderr(ENOBUFS);
|
|
|
|
Bcopy(rtm, new_rtm, rtm->rtm_msglen);
|
|
|
|
Free(rtm); rtm = new_rtm;
|
|
|
|
}
|
1996-12-11 12:37:42 +03:00
|
|
|
(void)rt_msg2(rtm->rtm_type, &info, (caddr_t)rtm,
|
1999-04-02 21:22:21 +04:00
|
|
|
(struct walkarg *)0, 0);
|
1993-03-21 12:45:37 +03:00
|
|
|
rtm->rtm_flags = rt->rt_flags;
|
|
|
|
rtm->rtm_rmx = rt->rt_rmx;
|
1994-05-13 10:02:48 +04:00
|
|
|
rtm->rtm_addrs = info.rti_addrs;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case RTM_CHANGE:
|
2001-01-17 07:05:41 +03:00
|
|
|
/*
|
|
|
|
* new gateway could require new ifaddr, ifp;
|
|
|
|
* flags may also be different; ifp may be specified
|
|
|
|
* by ll sockaddr when protocol address is ambiguous
|
|
|
|
*/
|
|
|
|
if ((error = rt_getifa(&info)) != 0)
|
|
|
|
senderr(error);
|
1994-05-13 10:02:48 +04:00
|
|
|
if (gate && rt_setgate(rt, rt_key(rt), gate))
|
1993-03-21 12:45:37 +03:00
|
|
|
senderr(EDQUOT);
|
2000-02-17 07:28:00 +03:00
|
|
|
/* new gateway could require new ifaddr, ifp;
|
|
|
|
flags may also be different; ifp may be specified
|
|
|
|
by ll sockaddr when protocol address is ambiguous */
|
|
|
|
if (ifpaddr && (ifa = ifa_ifwithnet(ifpaddr)) &&
|
|
|
|
(ifp = ifa->ifa_ifp) && (ifaaddr || gate))
|
|
|
|
ifa = ifaof_ifpforaddr(ifaaddr ? ifaaddr : gate,
|
|
|
|
ifp);
|
|
|
|
else if ((ifaaddr && (ifa = ifa_ifwithaddr(ifaaddr))) ||
|
|
|
|
(gate && (ifa = ifa_ifwithroute(rt->rt_flags,
|
|
|
|
rt_key(rt), gate))))
|
|
|
|
ifp = ifa->ifa_ifp;
|
|
|
|
if (ifa) {
|
2000-03-30 13:45:33 +04:00
|
|
|
struct ifaddr *oifa = rt->rt_ifa;
|
2000-02-17 07:28:00 +03:00
|
|
|
if (oifa != ifa) {
|
|
|
|
if (oifa && oifa->ifa_rtrequest)
|
2001-01-17 07:05:41 +03:00
|
|
|
oifa->ifa_rtrequest(RTM_DELETE, rt,
|
|
|
|
&info);
|
2000-02-17 07:28:00 +03:00
|
|
|
IFAFREE(rt->rt_ifa);
|
|
|
|
rt->rt_ifa = ifa;
|
|
|
|
IFAREF(rt->rt_ifa);
|
|
|
|
rt->rt_ifp = ifp;
|
|
|
|
}
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
rt_setmetrics(rtm->rtm_inits, &rtm->rtm_rmx,
|
1996-07-01 05:12:32 +04:00
|
|
|
&rt->rt_rmx);
|
2000-02-17 07:28:00 +03:00
|
|
|
if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
|
2001-01-17 07:05:41 +03:00
|
|
|
rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, &info);
|
1993-03-21 12:45:37 +03:00
|
|
|
if (genmask)
|
|
|
|
rt->rt_genmask = genmask;
|
|
|
|
/*
|
|
|
|
* Fall into
|
|
|
|
*/
|
|
|
|
case RTM_LOCK:
|
1994-05-13 10:02:48 +04:00
|
|
|
rt->rt_rmx.rmx_locks &= ~(rtm->rtm_inits);
|
1993-03-21 12:45:37 +03:00
|
|
|
rt->rt_rmx.rmx_locks |=
|
1996-07-01 05:12:32 +04:00
|
|
|
(rtm->rtm_inits & rtm->rtm_rmx.rmx_locks);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
default:
|
|
|
|
senderr(EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
|
|
|
flush:
|
|
|
|
if (rtm) {
|
|
|
|
if (error)
|
|
|
|
rtm->rtm_errno = error;
|
2005-02-27 01:45:09 +03:00
|
|
|
else
|
1993-03-21 12:45:37 +03:00
|
|
|
rtm->rtm_flags |= RTF_DONE;
|
|
|
|
}
|
2002-02-22 20:26:31 +03:00
|
|
|
family = dst ? dst->sa_family : 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
if (rt)
|
|
|
|
rtfree(rt);
|
|
|
|
{
|
2000-03-30 13:45:33 +04:00
|
|
|
struct rawcb *rp = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* Check to see if we don't want our own messages.
|
|
|
|
*/
|
|
|
|
if ((so->so_options & SO_USELOOPBACK) == 0) {
|
|
|
|
if (route_cb.any_count <= 1) {
|
|
|
|
if (rtm)
|
|
|
|
Free(rtm);
|
|
|
|
m_freem(m);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
/* There is another listener, so construct message */
|
|
|
|
rp = sotorawcb(so);
|
|
|
|
}
|
|
|
|
if (rtm) {
|
2001-06-04 12:57:58 +04:00
|
|
|
m_copyback(m, 0, rtm->rtm_msglen, (caddr_t)rtm);
|
|
|
|
if (m->m_pkthdr.len < rtm->rtm_msglen) {
|
2001-06-04 05:30:11 +04:00
|
|
|
m_freem(m);
|
|
|
|
m = NULL;
|
2001-06-04 12:57:58 +04:00
|
|
|
} else if (m->m_pkthdr.len > rtm->rtm_msglen)
|
2001-06-04 05:30:11 +04:00
|
|
|
m_adj(m, rtm->rtm_msglen - m->m_pkthdr.len);
|
1993-03-21 12:45:37 +03:00
|
|
|
Free(rtm);
|
|
|
|
}
|
|
|
|
if (rp)
|
|
|
|
rp->rcb_proto.sp_family = 0; /* Avoid us */
|
2002-02-22 20:26:31 +03:00
|
|
|
if (family)
|
|
|
|
route_proto.sp_protocol = family;
|
2001-06-04 05:30:11 +04:00
|
|
|
if (m)
|
|
|
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
1993-03-21 12:45:37 +03:00
|
|
|
if (rp)
|
|
|
|
rp->rcb_proto.sp_family = PF_ROUTE;
|
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1994-05-11 13:26:46 +04:00
|
|
|
void
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_setmetrics(u_long which, const struct rt_metrics *in, struct rt_metrics *out)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
|
|
|
#define metric(f, e) if (which & (f)) out->e = in->e;
|
|
|
|
metric(RTV_RPIPE, rmx_recvpipe);
|
|
|
|
metric(RTV_SPIPE, rmx_sendpipe);
|
|
|
|
metric(RTV_SSTHRESH, rmx_ssthresh);
|
|
|
|
metric(RTV_RTT, rmx_rtt);
|
|
|
|
metric(RTV_RTTVAR, rmx_rttvar);
|
|
|
|
metric(RTV_HOPCOUNT, rmx_hopcount);
|
|
|
|
metric(RTV_MTU, rmx_mtu);
|
|
|
|
metric(RTV_EXPIRE, rmx_expire);
|
|
|
|
#undef metric
|
|
|
|
}
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
#define ROUNDUP(a) \
|
1996-03-29 03:32:10 +03:00
|
|
|
((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
|
1994-05-13 10:02:48 +04:00
|
|
|
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
|
|
|
|
|
2000-09-28 05:14:06 +04:00
|
|
|
static int
|
2004-10-23 23:13:22 +04:00
|
|
|
rt_xaddrs(u_char rtmtype, const char *cp, const char *cplim, struct rt_addrinfo *rtinfo)
|
1994-05-13 10:02:48 +04:00
|
|
|
{
|
2004-04-22 01:03:43 +04:00
|
|
|
const struct sockaddr *sa = NULL; /* Quell compiler warning */
|
2000-03-30 13:45:33 +04:00
|
|
|
int i;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
for (i = 0; (i < RTAX_MAX) && (cp < cplim); i++) {
|
|
|
|
if ((rtinfo->rti_addrs & (1 << i)) == 0)
|
|
|
|
continue;
|
2005-05-30 01:22:52 +04:00
|
|
|
rtinfo->rti_info[i] = sa = (const struct sockaddr *)cp;
|
1994-05-13 10:02:48 +04:00
|
|
|
ADVANCE(cp, sa);
|
|
|
|
}
|
2000-11-10 06:37:42 +03:00
|
|
|
|
2004-10-23 23:13:22 +04:00
|
|
|
/* Check for extra addresses specified, except RTM_GET asking for interface info. */
|
|
|
|
if (rtmtype == RTM_GET) {
|
|
|
|
if (((rtinfo->rti_addrs & (~((1 << RTAX_IFP) | (1 << RTAX_IFA)))) & (~0 << i)) != 0)
|
|
|
|
return (1);
|
|
|
|
} else {
|
|
|
|
if ((rtinfo->rti_addrs & (~0 << i)) != 0)
|
|
|
|
return (1);
|
|
|
|
}
|
2000-11-10 06:37:42 +03:00
|
|
|
/* Check for bad data length. */
|
|
|
|
if (cp != cplim) {
|
2006-04-15 06:07:34 +04:00
|
|
|
if (i == RTAX_NETMASK + 1 && sa &&
|
2000-11-10 06:37:42 +03:00
|
|
|
cp - ROUNDUP(sa->sa_len) + sa->sa_len == cplim)
|
|
|
|
/*
|
|
|
|
* The last sockaddr was netmask.
|
|
|
|
* We accept this for now for the sake of old
|
|
|
|
* binaries or third party softwares.
|
|
|
|
*/
|
|
|
|
;
|
|
|
|
else
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
return (0);
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct mbuf *
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_msg1(int type, struct rt_addrinfo *rtinfo, caddr_t data, int datalen)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 13:45:33 +04:00
|
|
|
struct rt_msghdr *rtm;
|
|
|
|
struct mbuf *m;
|
|
|
|
int i;
|
2004-04-21 08:17:28 +04:00
|
|
|
const struct sockaddr *sa;
|
2001-06-04 12:57:58 +04:00
|
|
|
int len, dlen;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2001-06-04 12:57:58 +04:00
|
|
|
m = m_gethdr(M_DONTWAIT, MT_DATA);
|
|
|
|
if (m == 0)
|
|
|
|
return (m);
|
2003-02-26 09:31:08 +03:00
|
|
|
MCLAIM(m, &routedomain.dom_mowner);
|
1994-05-13 10:02:48 +04:00
|
|
|
switch (type) {
|
2001-06-04 12:57:58 +04:00
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
case RTM_DELADDR:
|
|
|
|
case RTM_NEWADDR:
|
2001-06-04 12:57:58 +04:00
|
|
|
len = sizeof(struct ifa_msghdr);
|
1994-05-13 10:02:48 +04:00
|
|
|
break;
|
|
|
|
|
1999-11-19 13:41:41 +03:00
|
|
|
#ifdef COMPAT_14
|
|
|
|
case RTM_OIFINFO:
|
2001-06-04 12:57:58 +04:00
|
|
|
len = sizeof(struct if_msghdr14);
|
1999-11-19 13:41:41 +03:00
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
case RTM_IFINFO:
|
2001-06-04 12:57:58 +04:00
|
|
|
len = sizeof(struct if_msghdr);
|
1994-05-13 10:02:48 +04:00
|
|
|
break;
|
|
|
|
|
2000-03-06 23:49:00 +03:00
|
|
|
case RTM_IFANNOUNCE:
|
2005-06-22 10:14:51 +04:00
|
|
|
case RTM_IEEE80211:
|
2001-06-04 12:57:58 +04:00
|
|
|
len = sizeof(struct if_announcemsghdr);
|
2000-03-06 23:49:00 +03:00
|
|
|
break;
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
default:
|
2001-06-04 12:57:58 +04:00
|
|
|
len = sizeof(struct rt_msghdr);
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
2001-06-04 12:57:58 +04:00
|
|
|
if (len > MHLEN + MLEN)
|
2000-02-11 09:11:03 +03:00
|
|
|
panic("rt_msg1: message too long");
|
2001-06-04 12:57:58 +04:00
|
|
|
else if (len > MHLEN) {
|
1999-11-19 13:41:41 +03:00
|
|
|
m->m_next = m_get(M_DONTWAIT, MT_DATA);
|
2001-06-04 12:57:58 +04:00
|
|
|
if (m->m_next == NULL) {
|
1999-11-19 13:41:41 +03:00
|
|
|
m_freem(m);
|
|
|
|
return (NULL);
|
|
|
|
}
|
2003-02-26 09:31:08 +03:00
|
|
|
MCLAIM(m->m_next, m->m_owner);
|
2001-06-04 12:57:58 +04:00
|
|
|
m->m_pkthdr.len = len;
|
|
|
|
m->m_len = MHLEN;
|
|
|
|
m->m_next->m_len = len - MHLEN;
|
|
|
|
} else {
|
|
|
|
m->m_pkthdr.len = m->m_len = len;
|
1999-11-19 13:41:41 +03:00
|
|
|
}
|
2001-06-04 12:57:58 +04:00
|
|
|
m->m_pkthdr.rcvif = 0;
|
1999-11-19 13:41:41 +03:00
|
|
|
m_copyback(m, 0, datalen, data);
|
1993-03-21 12:45:37 +03:00
|
|
|
rtm = mtod(m, struct rt_msghdr *);
|
1994-05-13 10:02:48 +04:00
|
|
|
for (i = 0; i < RTAX_MAX; i++) {
|
|
|
|
if ((sa = rtinfo->rti_info[i]) == NULL)
|
|
|
|
continue;
|
|
|
|
rtinfo->rti_addrs |= (1 << i);
|
|
|
|
dlen = ROUNDUP(sa->sa_len);
|
2005-05-30 01:22:52 +04:00
|
|
|
m_copyback(m, len, dlen, sa);
|
1994-05-13 10:02:48 +04:00
|
|
|
len += dlen;
|
|
|
|
}
|
2001-06-04 12:57:58 +04:00
|
|
|
if (m->m_pkthdr.len != len) {
|
|
|
|
m_freem(m);
|
|
|
|
return (NULL);
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
rtm->rtm_msglen = len;
|
|
|
|
rtm->rtm_version = RTM_VERSION;
|
|
|
|
rtm->rtm_type = type;
|
1994-05-13 10:02:48 +04:00
|
|
|
return (m);
|
|
|
|
}
|
|
|
|
|
1999-04-02 21:22:21 +04:00
|
|
|
/*
|
|
|
|
* rt_msg2
|
|
|
|
*
|
|
|
|
* fills 'cp' or 'w'.w_tmem with the routing socket message and
|
|
|
|
* returns the length of the message in 'lenp'.
|
|
|
|
*
|
|
|
|
* if walkarg is 0, cp is expected to be 0 or a buffer large enough to hold
|
|
|
|
* the message
|
|
|
|
* otherwise walkarg's w_needed is updated and if the user buffer is
|
|
|
|
* specified and w_needed indicates space exists the information is copied
|
|
|
|
* into the temp space (w_tmem). w_tmem is [re]allocated if necessary,
|
|
|
|
* if the allocation fails ENOBUFS is returned.
|
|
|
|
*/
|
1994-05-13 10:02:48 +04:00
|
|
|
static int
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_msg2(int type, struct rt_addrinfo *rtinfo, caddr_t cp, struct walkarg *w,
|
|
|
|
int *lenp)
|
1994-05-13 10:02:48 +04:00
|
|
|
{
|
2000-03-30 13:45:33 +04:00
|
|
|
int i;
|
1994-05-13 10:02:48 +04:00
|
|
|
int len, dlen, second_time = 0;
|
|
|
|
caddr_t cp0;
|
|
|
|
|
|
|
|
rtinfo->rti_addrs = 0;
|
|
|
|
again:
|
|
|
|
switch (type) {
|
|
|
|
|
|
|
|
case RTM_DELADDR:
|
|
|
|
case RTM_NEWADDR:
|
|
|
|
len = sizeof(struct ifa_msghdr);
|
|
|
|
break;
|
1999-11-19 13:41:41 +03:00
|
|
|
#ifdef COMPAT_14
|
|
|
|
case RTM_OIFINFO:
|
|
|
|
len = sizeof(struct if_msghdr14);
|
|
|
|
break;
|
|
|
|
#endif
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
case RTM_IFINFO:
|
|
|
|
len = sizeof(struct if_msghdr);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
len = sizeof(struct rt_msghdr);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1996-02-14 00:59:53 +03:00
|
|
|
if ((cp0 = cp) != NULL)
|
1994-05-13 10:02:48 +04:00
|
|
|
cp += len;
|
|
|
|
for (i = 0; i < RTAX_MAX; i++) {
|
2004-04-21 08:17:28 +04:00
|
|
|
const struct sockaddr *sa;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
if ((sa = rtinfo->rti_info[i]) == 0)
|
|
|
|
continue;
|
|
|
|
rtinfo->rti_addrs |= (1 << i);
|
|
|
|
dlen = ROUNDUP(sa->sa_len);
|
|
|
|
if (cp) {
|
1996-07-01 05:12:32 +04:00
|
|
|
bcopy(sa, cp, (unsigned)dlen);
|
1994-05-13 10:02:48 +04:00
|
|
|
cp += dlen;
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
len += dlen;
|
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
if (cp == 0 && w != NULL && !second_time) {
|
2000-03-30 13:45:33 +04:00
|
|
|
struct walkarg *rw = w;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
rw->w_needed += len;
|
|
|
|
if (rw->w_needed <= 0 && rw->w_where) {
|
|
|
|
if (rw->w_tmemsize < len) {
|
|
|
|
if (rw->w_tmem)
|
|
|
|
free(rw->w_tmem, M_RTABLE);
|
1996-02-14 00:59:53 +03:00
|
|
|
rw->w_tmem = (caddr_t) malloc(len, M_RTABLE,
|
1996-07-01 05:12:32 +04:00
|
|
|
M_NOWAIT);
|
1996-02-14 00:59:53 +03:00
|
|
|
if (rw->w_tmem)
|
1994-05-13 10:02:48 +04:00
|
|
|
rw->w_tmemsize = len;
|
|
|
|
}
|
|
|
|
if (rw->w_tmem) {
|
|
|
|
cp = rw->w_tmem;
|
|
|
|
second_time = 1;
|
|
|
|
goto again;
|
1999-04-02 21:22:21 +04:00
|
|
|
} else {
|
|
|
|
rw->w_tmemneeded = len;
|
|
|
|
return (ENOBUFS);
|
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
if (cp) {
|
2000-03-30 13:45:33 +04:00
|
|
|
struct rt_msghdr *rtm = (struct rt_msghdr *)cp0;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
rtm->rtm_version = RTM_VERSION;
|
|
|
|
rtm->rtm_type = type;
|
|
|
|
rtm->rtm_msglen = len;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1999-04-02 21:22:21 +04:00
|
|
|
if (lenp)
|
|
|
|
*lenp = len;
|
|
|
|
return (0);
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This routine is called to generate a message from the routing
|
2001-09-16 20:34:23 +04:00
|
|
|
* socket indicating that a redirect has occurred, a routing lookup
|
1994-05-13 10:02:48 +04:00
|
|
|
* has failed, or that a protocol has detected timeouts to a particular
|
|
|
|
* destination.
|
|
|
|
*/
|
|
|
|
void
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_missmsg(int type, struct rt_addrinfo *rtinfo, int flags, int error)
|
1994-05-13 10:02:48 +04:00
|
|
|
{
|
1999-11-19 13:41:41 +03:00
|
|
|
struct rt_msghdr rtm;
|
2000-03-30 13:45:33 +04:00
|
|
|
struct mbuf *m;
|
2004-04-21 08:17:28 +04:00
|
|
|
const struct sockaddr *sa = rtinfo->rti_info[RTAX_DST];
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
if (route_cb.any_count == 0)
|
1993-03-21 12:45:37 +03:00
|
|
|
return;
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&rtm, 0, sizeof(rtm));
|
1999-11-19 13:41:41 +03:00
|
|
|
rtm.rtm_flags = RTF_DONE | flags;
|
|
|
|
rtm.rtm_errno = error;
|
|
|
|
m = rt_msg1(type, rtinfo, (caddr_t)&rtm, sizeof(rtm));
|
1994-05-13 10:02:48 +04:00
|
|
|
if (m == 0)
|
|
|
|
return;
|
1999-11-19 13:41:41 +03:00
|
|
|
mtod(m, struct rt_msghdr *)->rtm_addrs = rtinfo->rti_addrs;
|
1994-05-13 10:02:48 +04:00
|
|
|
route_proto.sp_protocol = sa ? sa->sa_family : 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
1994-05-13 10:02:48 +04:00
|
|
|
* This routine is called to generate a message from the routing
|
|
|
|
* socket indicating that the status of a network interface has changed.
|
|
|
|
*/
|
|
|
|
void
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_ifmsg(struct ifnet *ifp)
|
1994-05-13 10:02:48 +04:00
|
|
|
{
|
1999-11-19 13:41:41 +03:00
|
|
|
struct if_msghdr ifm;
|
|
|
|
#ifdef COMPAT_14
|
|
|
|
struct if_msghdr14 oifm;
|
|
|
|
#endif
|
1994-05-13 10:02:48 +04:00
|
|
|
struct mbuf *m;
|
|
|
|
struct rt_addrinfo info;
|
|
|
|
|
|
|
|
if (route_cb.any_count == 0)
|
|
|
|
return;
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&info, 0, sizeof(info));
|
|
|
|
memset(&ifm, 0, sizeof(ifm));
|
1999-11-19 13:41:41 +03:00
|
|
|
ifm.ifm_index = ifp->if_index;
|
|
|
|
ifm.ifm_flags = ifp->if_flags;
|
|
|
|
ifm.ifm_data = ifp->if_data;
|
|
|
|
ifm.ifm_addrs = 0;
|
|
|
|
m = rt_msg1(RTM_IFINFO, &info, (caddr_t)&ifm, sizeof(ifm));
|
1994-05-13 10:02:48 +04:00
|
|
|
if (m == 0)
|
|
|
|
return;
|
|
|
|
route_proto.sp_protocol = 0;
|
|
|
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
1999-11-19 13:41:41 +03:00
|
|
|
#ifdef COMPAT_14
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&info, 0, sizeof(info));
|
|
|
|
memset(&oifm, 0, sizeof(oifm));
|
1999-11-19 13:41:41 +03:00
|
|
|
oifm.ifm_index = ifp->if_index;
|
|
|
|
oifm.ifm_flags = ifp->if_flags;
|
|
|
|
oifm.ifm_data.ifi_type = ifp->if_data.ifi_type;
|
|
|
|
oifm.ifm_data.ifi_addrlen = ifp->if_data.ifi_addrlen;
|
|
|
|
oifm.ifm_data.ifi_hdrlen = ifp->if_data.ifi_hdrlen;
|
|
|
|
oifm.ifm_data.ifi_mtu = ifp->if_data.ifi_mtu;
|
|
|
|
oifm.ifm_data.ifi_metric = ifp->if_data.ifi_metric;
|
|
|
|
oifm.ifm_data.ifi_baudrate = ifp->if_data.ifi_baudrate;
|
|
|
|
oifm.ifm_data.ifi_ipackets = ifp->if_data.ifi_ipackets;
|
|
|
|
oifm.ifm_data.ifi_ierrors = ifp->if_data.ifi_ierrors;
|
|
|
|
oifm.ifm_data.ifi_opackets = ifp->if_data.ifi_opackets;
|
|
|
|
oifm.ifm_data.ifi_oerrors = ifp->if_data.ifi_oerrors;
|
|
|
|
oifm.ifm_data.ifi_collisions = ifp->if_data.ifi_collisions;
|
|
|
|
oifm.ifm_data.ifi_ibytes = ifp->if_data.ifi_ibytes;
|
|
|
|
oifm.ifm_data.ifi_obytes = ifp->if_data.ifi_obytes;
|
|
|
|
oifm.ifm_data.ifi_imcasts = ifp->if_data.ifi_imcasts;
|
|
|
|
oifm.ifm_data.ifi_omcasts = ifp->if_data.ifi_omcasts;
|
|
|
|
oifm.ifm_data.ifi_iqdrops = ifp->if_data.ifi_iqdrops;
|
|
|
|
oifm.ifm_data.ifi_noproto = ifp->if_data.ifi_noproto;
|
|
|
|
oifm.ifm_data.ifi_lastchange = ifp->if_data.ifi_lastchange;
|
|
|
|
oifm.ifm_addrs = 0;
|
|
|
|
m = rt_msg1(RTM_OIFINFO, &info, (caddr_t)&oifm, sizeof(oifm));
|
|
|
|
if (m == 0)
|
|
|
|
return;
|
|
|
|
route_proto.sp_protocol = 0;
|
|
|
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
|
|
|
#endif
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is called to generate messages from the routing socket
|
|
|
|
* indicating a network interface has had addresses associated with it.
|
|
|
|
* if we ever reverse the logic and replace messages TO the routing
|
|
|
|
* socket indicate a request to configure interfaces, then it will
|
|
|
|
* be unnecessary as the routing socket will automatically generate
|
|
|
|
* copies of it.
|
|
|
|
*/
|
|
|
|
void
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_newaddrmsg(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt)
|
1994-05-13 10:02:48 +04:00
|
|
|
{
|
|
|
|
struct rt_addrinfo info;
|
1996-02-14 00:59:53 +03:00
|
|
|
struct sockaddr *sa = NULL;
|
1994-05-13 10:02:48 +04:00
|
|
|
int pass;
|
1996-02-14 00:59:53 +03:00
|
|
|
struct mbuf *m = NULL;
|
1994-05-13 10:02:48 +04:00
|
|
|
struct ifnet *ifp = ifa->ifa_ifp;
|
|
|
|
|
|
|
|
if (route_cb.any_count == 0)
|
|
|
|
return;
|
|
|
|
for (pass = 1; pass < 3; pass++) {
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&info, 0, sizeof(info));
|
1994-05-13 10:02:48 +04:00
|
|
|
if ((cmd == RTM_ADD && pass == 1) ||
|
|
|
|
(cmd == RTM_DELETE && pass == 2)) {
|
1999-11-19 13:41:41 +03:00
|
|
|
struct ifa_msghdr ifam;
|
1994-05-13 10:02:48 +04:00
|
|
|
int ncmd = cmd == RTM_ADD ? RTM_NEWADDR : RTM_DELADDR;
|
|
|
|
|
|
|
|
ifaaddr = sa = ifa->ifa_addr;
|
2001-11-05 21:02:15 +03:00
|
|
|
ifpaddr = TAILQ_FIRST(&ifp->if_addrlist)->ifa_addr;
|
1994-05-13 10:02:48 +04:00
|
|
|
netmask = ifa->ifa_netmask;
|
|
|
|
brdaddr = ifa->ifa_dstaddr;
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&ifam, 0, sizeof(ifam));
|
1999-11-19 13:41:41 +03:00
|
|
|
ifam.ifam_index = ifp->if_index;
|
|
|
|
ifam.ifam_metric = ifa->ifa_metric;
|
|
|
|
ifam.ifam_flags = ifa->ifa_flags;
|
|
|
|
m = rt_msg1(ncmd, &info, (caddr_t)&ifam, sizeof(ifam));
|
|
|
|
if (m == NULL)
|
1994-05-13 10:02:48 +04:00
|
|
|
continue;
|
1999-11-19 13:41:41 +03:00
|
|
|
mtod(m, struct ifa_msghdr *)->ifam_addrs =
|
|
|
|
info.rti_addrs;
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
|
|
|
if ((cmd == RTM_ADD && pass == 2) ||
|
|
|
|
(cmd == RTM_DELETE && pass == 1)) {
|
1999-11-19 13:41:41 +03:00
|
|
|
struct rt_msghdr rtm;
|
2005-02-27 01:45:09 +03:00
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
if (rt == 0)
|
|
|
|
continue;
|
|
|
|
netmask = rt_mask(rt);
|
|
|
|
dst = sa = rt_key(rt);
|
|
|
|
gate = rt->rt_gateway;
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&rtm, 0, sizeof(rtm));
|
1999-11-19 13:41:41 +03:00
|
|
|
rtm.rtm_index = ifp->if_index;
|
|
|
|
rtm.rtm_flags |= rt->rt_flags;
|
|
|
|
rtm.rtm_errno = error;
|
|
|
|
m = rt_msg1(cmd, &info, (caddr_t)&rtm, sizeof(rtm));
|
|
|
|
if (m == NULL)
|
1994-05-13 10:02:48 +04:00
|
|
|
continue;
|
1999-11-19 13:41:41 +03:00
|
|
|
mtod(m, struct rt_msghdr *)->rtm_addrs = info.rti_addrs;
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
|
|
|
route_proto.sp_protocol = sa ? sa->sa_family : 0;
|
|
|
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-06-22 10:14:51 +04:00
|
|
|
static struct mbuf *
|
|
|
|
rt_makeifannouncemsg(struct ifnet *ifp, int type, int what,
|
|
|
|
struct rt_addrinfo *info)
|
|
|
|
{
|
|
|
|
struct if_announcemsghdr ifan;
|
|
|
|
|
|
|
|
memset(info, 0, sizeof(*info));
|
|
|
|
memset(&ifan, 0, sizeof(ifan));
|
|
|
|
ifan.ifan_index = ifp->if_index;
|
|
|
|
strlcpy(ifan.ifan_name, ifp->if_xname, sizeof(ifan.ifan_name));
|
|
|
|
ifan.ifan_what = what;
|
|
|
|
return rt_msg1(type, info, (caddr_t)&ifan, sizeof(ifan));
|
|
|
|
}
|
|
|
|
|
2000-03-06 23:49:00 +03:00
|
|
|
/*
|
|
|
|
* This is called to generate routing socket messages indicating
|
|
|
|
* network interface arrival and departure.
|
|
|
|
*/
|
|
|
|
void
|
2004-04-22 01:03:43 +04:00
|
|
|
rt_ifannouncemsg(struct ifnet *ifp, int what)
|
2000-03-06 23:49:00 +03:00
|
|
|
{
|
|
|
|
struct mbuf *m;
|
|
|
|
struct rt_addrinfo info;
|
|
|
|
|
|
|
|
if (route_cb.any_count == 0)
|
|
|
|
return;
|
2005-06-22 10:14:51 +04:00
|
|
|
m = rt_makeifannouncemsg(ifp, RTM_IFANNOUNCE, what, &info);
|
|
|
|
if (m == NULL)
|
2000-03-06 23:49:00 +03:00
|
|
|
return;
|
|
|
|
route_proto.sp_protocol = 0;
|
|
|
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
|
|
|
}
|
|
|
|
|
2005-06-22 10:14:51 +04:00
|
|
|
/*
|
|
|
|
* This is called to generate routing socket messages indicating
|
|
|
|
* IEEE80211 wireless events.
|
|
|
|
* XXX we piggyback on the RTM_IFANNOUNCE msg format in a clumsy way.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
rt_ieee80211msg(struct ifnet *ifp, int what, void *data, size_t data_len)
|
|
|
|
{
|
|
|
|
struct mbuf *m;
|
|
|
|
struct rt_addrinfo info;
|
|
|
|
|
|
|
|
if (route_cb.any_count == 0)
|
|
|
|
return;
|
|
|
|
m = rt_makeifannouncemsg(ifp, RTM_IEEE80211, what, &info);
|
|
|
|
if (m == NULL)
|
|
|
|
return;
|
|
|
|
/*
|
|
|
|
* Append the ieee80211 data. Try to stick it in the
|
|
|
|
* mbuf containing the ifannounce msg; otherwise allocate
|
|
|
|
* a new mbuf and append.
|
|
|
|
*
|
|
|
|
* NB: we assume m is a single mbuf.
|
|
|
|
*/
|
|
|
|
if (data_len > M_TRAILINGSPACE(m)) {
|
|
|
|
struct mbuf *n = m_get(M_NOWAIT, MT_DATA);
|
|
|
|
if (n == NULL) {
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
(void)memcpy(mtod(n, void *), data, data_len);
|
|
|
|
n->m_len = data_len;
|
|
|
|
m->m_next = n;
|
|
|
|
} else if (data_len > 0) {
|
|
|
|
(void)memcpy(mtod(m, u_int8_t *) + m->m_len, data, data_len);
|
|
|
|
m->m_len += data_len;
|
|
|
|
}
|
|
|
|
if (m->m_flags & M_PKTHDR)
|
|
|
|
m->m_pkthdr.len += data_len;
|
|
|
|
mtod(m, struct if_announcemsghdr *)->ifan_msglen += data_len;
|
|
|
|
route_proto.sp_protocol = 0;
|
|
|
|
raw_input(m, &route_proto, &route_src, &route_dst);
|
|
|
|
}
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
/*
|
|
|
|
* This is used in dumping the kernel table via sysctl().
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
2000-04-15 21:51:27 +04:00
|
|
|
static int
|
2004-04-22 01:03:43 +04:00
|
|
|
sysctl_dumpentry(struct radix_node *rn, void *v)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 13:45:33 +04:00
|
|
|
struct walkarg *w = v;
|
|
|
|
struct rtentry *rt = (struct rtentry *)rn;
|
1994-05-13 10:02:48 +04:00
|
|
|
int error = 0, size;
|
|
|
|
struct rt_addrinfo info;
|
|
|
|
|
|
|
|
if (w->w_op == NET_RT_FLAGS && !(rt->rt_flags & w->w_arg))
|
|
|
|
return 0;
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&info, 0, sizeof(info));
|
1994-05-13 10:02:48 +04:00
|
|
|
dst = rt_key(rt);
|
|
|
|
gate = rt->rt_gateway;
|
|
|
|
netmask = rt_mask(rt);
|
|
|
|
genmask = rt->rt_genmask;
|
1995-08-19 11:48:14 +04:00
|
|
|
if (rt->rt_ifp) {
|
2001-11-05 21:02:15 +03:00
|
|
|
ifpaddr = TAILQ_FIRST(&rt->rt_ifp->if_addrlist)->ifa_addr;
|
1995-08-19 11:48:14 +04:00
|
|
|
ifaaddr = rt->rt_ifa->ifa_addr;
|
|
|
|
if (rt->rt_ifp->if_flags & IFF_POINTOPOINT)
|
|
|
|
brdaddr = rt->rt_ifa->ifa_dstaddr;
|
|
|
|
}
|
1999-04-02 21:22:21 +04:00
|
|
|
if ((error = rt_msg2(RTM_GET, &info, 0, w, &size)))
|
|
|
|
return (error);
|
|
|
|
if (w->w_where && w->w_tmem && w->w_needed <= 0) {
|
2000-03-30 13:45:33 +04:00
|
|
|
struct rt_msghdr *rtm = (struct rt_msghdr *)w->w_tmem;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
rtm->rtm_flags = rt->rt_flags;
|
|
|
|
rtm->rtm_use = rt->rt_use;
|
|
|
|
rtm->rtm_rmx = rt->rt_rmx;
|
2006-04-15 06:14:44 +04:00
|
|
|
KASSERT(rt->rt_ifp != NULL);
|
1994-05-13 10:02:48 +04:00
|
|
|
rtm->rtm_index = rt->rt_ifp->if_index;
|
|
|
|
rtm->rtm_errno = rtm->rtm_pid = rtm->rtm_seq = 0;
|
|
|
|
rtm->rtm_addrs = info.rti_addrs;
|
1996-07-01 05:12:32 +04:00
|
|
|
if ((error = copyout(rtm, w->w_where, size)) != 0)
|
1994-05-13 10:02:48 +04:00
|
|
|
w->w_where = NULL;
|
|
|
|
else
|
|
|
|
w->w_where += size;
|
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2000-04-15 21:51:27 +04:00
|
|
|
static int
|
2004-04-22 01:03:43 +04:00
|
|
|
sysctl_iflist(int af, struct walkarg *w, int type)
|
1994-05-13 10:02:48 +04:00
|
|
|
{
|
2000-03-30 13:45:33 +04:00
|
|
|
struct ifnet *ifp;
|
|
|
|
struct ifaddr *ifa;
|
1994-05-13 10:02:48 +04:00
|
|
|
struct rt_addrinfo info;
|
|
|
|
int len, error = 0;
|
|
|
|
|
2001-07-18 20:43:09 +04:00
|
|
|
memset(&info, 0, sizeof(info));
|
2005-01-25 00:25:09 +03:00
|
|
|
IFNET_FOREACH(ifp) {
|
1994-05-13 10:02:48 +04:00
|
|
|
if (w->w_arg && w->w_arg != ifp->if_index)
|
|
|
|
continue;
|
2001-11-05 21:02:15 +03:00
|
|
|
ifa = TAILQ_FIRST(&ifp->if_addrlist);
|
2006-02-22 01:01:17 +03:00
|
|
|
if (ifa == NULL)
|
|
|
|
continue;
|
1994-05-13 10:02:48 +04:00
|
|
|
ifpaddr = ifa->ifa_addr;
|
2003-05-02 07:15:23 +04:00
|
|
|
switch (type) {
|
1999-11-19 13:41:41 +03:00
|
|
|
case NET_RT_IFLIST:
|
|
|
|
error =
|
|
|
|
rt_msg2(RTM_IFINFO, &info, (caddr_t)0, w, &len);
|
|
|
|
break;
|
|
|
|
#ifdef COMPAT_14
|
|
|
|
case NET_RT_OIFLIST:
|
|
|
|
error =
|
|
|
|
rt_msg2(RTM_OIFINFO, &info, (caddr_t)0, w, &len);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
panic("sysctl_iflist(1)");
|
|
|
|
}
|
|
|
|
if (error)
|
1999-04-02 21:22:21 +04:00
|
|
|
return (error);
|
1994-05-13 10:02:48 +04:00
|
|
|
ifpaddr = 0;
|
1999-04-02 21:22:21 +04:00
|
|
|
if (w->w_where && w->w_tmem && w->w_needed <= 0) {
|
2003-05-02 07:15:23 +04:00
|
|
|
switch (type) {
|
1999-11-19 13:41:41 +03:00
|
|
|
case NET_RT_IFLIST: {
|
2000-03-30 13:45:33 +04:00
|
|
|
struct if_msghdr *ifm;
|
1999-11-19 13:41:41 +03:00
|
|
|
|
|
|
|
ifm = (struct if_msghdr *)w->w_tmem;
|
|
|
|
ifm->ifm_index = ifp->if_index;
|
|
|
|
ifm->ifm_flags = ifp->if_flags;
|
|
|
|
ifm->ifm_data = ifp->if_data;
|
|
|
|
ifm->ifm_addrs = info.rti_addrs;
|
|
|
|
error = copyout(ifm, w->w_where, len);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
w->w_where += len;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef COMPAT_14
|
|
|
|
case NET_RT_OIFLIST: {
|
2000-03-30 13:45:33 +04:00
|
|
|
struct if_msghdr14 *ifm;
|
1999-11-19 13:41:41 +03:00
|
|
|
|
|
|
|
ifm = (struct if_msghdr14 *)w->w_tmem;
|
|
|
|
ifm->ifm_index = ifp->if_index;
|
|
|
|
ifm->ifm_flags = ifp->if_flags;
|
|
|
|
ifm->ifm_data.ifi_type = ifp->if_data.ifi_type;
|
|
|
|
ifm->ifm_data.ifi_addrlen =
|
|
|
|
ifp->if_data.ifi_addrlen;
|
|
|
|
ifm->ifm_data.ifi_hdrlen =
|
|
|
|
ifp->if_data.ifi_hdrlen;
|
|
|
|
ifm->ifm_data.ifi_mtu = ifp->if_data.ifi_mtu;
|
|
|
|
ifm->ifm_data.ifi_metric =
|
|
|
|
ifp->if_data.ifi_metric;
|
|
|
|
ifm->ifm_data.ifi_baudrate =
|
|
|
|
ifp->if_data.ifi_baudrate;
|
|
|
|
ifm->ifm_data.ifi_ipackets =
|
|
|
|
ifp->if_data.ifi_ipackets;
|
|
|
|
ifm->ifm_data.ifi_ierrors =
|
|
|
|
ifp->if_data.ifi_ierrors;
|
|
|
|
ifm->ifm_data.ifi_opackets =
|
|
|
|
ifp->if_data.ifi_opackets;
|
|
|
|
ifm->ifm_data.ifi_oerrors =
|
|
|
|
ifp->if_data.ifi_oerrors;
|
|
|
|
ifm->ifm_data.ifi_collisions =
|
|
|
|
ifp->if_data.ifi_collisions;
|
|
|
|
ifm->ifm_data.ifi_ibytes =
|
|
|
|
ifp->if_data.ifi_ibytes;
|
|
|
|
ifm->ifm_data.ifi_obytes =
|
|
|
|
ifp->if_data.ifi_obytes;
|
|
|
|
ifm->ifm_data.ifi_imcasts =
|
|
|
|
ifp->if_data.ifi_imcasts;
|
|
|
|
ifm->ifm_data.ifi_omcasts =
|
|
|
|
ifp->if_data.ifi_omcasts;
|
|
|
|
ifm->ifm_data.ifi_iqdrops =
|
|
|
|
ifp->if_data.ifi_iqdrops;
|
|
|
|
ifm->ifm_data.ifi_noproto =
|
|
|
|
ifp->if_data.ifi_noproto;
|
|
|
|
ifm->ifm_data.ifi_lastchange =
|
|
|
|
ifp->if_data.ifi_lastchange;
|
|
|
|
ifm->ifm_addrs = info.rti_addrs;
|
|
|
|
error = copyout(ifm, w->w_where, len);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
w->w_where += len;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
panic("sysctl_iflist(2)");
|
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
2001-11-05 21:02:15 +03:00
|
|
|
while ((ifa = TAILQ_NEXT(ifa, ifa_list)) != NULL) {
|
1994-05-13 10:02:48 +04:00
|
|
|
if (af && af != ifa->ifa_addr->sa_family)
|
|
|
|
continue;
|
|
|
|
ifaaddr = ifa->ifa_addr;
|
|
|
|
netmask = ifa->ifa_netmask;
|
|
|
|
brdaddr = ifa->ifa_dstaddr;
|
1999-04-02 21:22:21 +04:00
|
|
|
if ((error = rt_msg2(RTM_NEWADDR, &info, 0, w, &len)))
|
|
|
|
return (error);
|
|
|
|
if (w->w_where && w->w_tmem && w->w_needed <= 0) {
|
2000-03-30 13:45:33 +04:00
|
|
|
struct ifa_msghdr *ifam;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
ifam = (struct ifa_msghdr *)w->w_tmem;
|
|
|
|
ifam->ifam_index = ifa->ifa_ifp->if_index;
|
|
|
|
ifam->ifam_flags = ifa->ifa_flags;
|
|
|
|
ifam->ifam_metric = ifa->ifa_metric;
|
|
|
|
ifam->ifam_addrs = info.rti_addrs;
|
1996-02-14 00:59:53 +03:00
|
|
|
error = copyout(w->w_tmem, w->w_where, len);
|
|
|
|
if (error)
|
1994-05-13 10:02:48 +04:00
|
|
|
return (error);
|
|
|
|
w->w_where += len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ifaaddr = netmask = brdaddr = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2000-04-15 21:51:27 +04:00
|
|
|
static int
|
Dynamic sysctl.
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.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_rtable(SYSCTLFN_ARGS)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
Dynamic sysctl.
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.
2003-12-04 22:38:21 +03:00
|
|
|
void *where = oldp;
|
|
|
|
size_t *given = oldlenp;
|
|
|
|
const void *new = newp;
|
2000-03-30 13:45:33 +04:00
|
|
|
struct radix_node_head *rnh;
|
1994-05-13 10:02:48 +04:00
|
|
|
int i, s, error = EINVAL;
|
|
|
|
u_char af;
|
1993-03-21 12:45:37 +03:00
|
|
|
struct walkarg w;
|
|
|
|
|
2003-12-29 01:36:37 +03:00
|
|
|
if (namelen == 1 && name[0] == CTL_QUERY)
|
2005-06-09 06:19:59 +04:00
|
|
|
return (sysctl_query(SYSCTLFN_CALL(rnode)));
|
2003-12-29 01:36:37 +03:00
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
if (new)
|
|
|
|
return (EPERM);
|
|
|
|
if (namelen != 3)
|
1993-03-21 12:45:37 +03:00
|
|
|
return (EINVAL);
|
1994-05-13 10:02:48 +04:00
|
|
|
af = name[0];
|
1999-04-02 21:22:21 +04:00
|
|
|
w.w_tmemneeded = 0;
|
|
|
|
w.w_tmemsize = 0;
|
|
|
|
w.w_tmem = NULL;
|
|
|
|
again:
|
|
|
|
/* we may return here if a later [re]alloc of the t_mem buffer fails */
|
|
|
|
if (w.w_tmemneeded) {
|
|
|
|
w.w_tmem = (caddr_t) malloc(w.w_tmemneeded, M_RTABLE, M_WAITOK);
|
|
|
|
w.w_tmemsize = w.w_tmemneeded;
|
|
|
|
w.w_tmemneeded = 0;
|
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
w.w_op = name[1];
|
|
|
|
w.w_arg = name[2];
|
1999-04-02 21:22:21 +04:00
|
|
|
w.w_given = *given;
|
|
|
|
w.w_needed = 0 - w.w_given;
|
|
|
|
w.w_where = where;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1995-08-13 03:59:09 +04:00
|
|
|
s = splsoftnet();
|
1994-05-13 10:02:48 +04:00
|
|
|
switch (w.w_op) {
|
|
|
|
|
|
|
|
case NET_RT_DUMP:
|
|
|
|
case NET_RT_FLAGS:
|
|
|
|
for (i = 1; i <= AF_MAX; i++)
|
|
|
|
if ((rnh = rt_tables[i]) && (af == 0 || af == i) &&
|
1996-02-14 00:59:53 +03:00
|
|
|
(error = (*rnh->rnh_walktree)(rnh,
|
1996-07-01 05:12:32 +04:00
|
|
|
sysctl_dumpentry, &w)))
|
1994-05-13 10:02:48 +04:00
|
|
|
break;
|
|
|
|
break;
|
|
|
|
|
1999-11-19 13:41:41 +03:00
|
|
|
#ifdef COMPAT_14
|
|
|
|
case NET_RT_OIFLIST:
|
|
|
|
error = sysctl_iflist(af, &w, w.w_op);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
case NET_RT_IFLIST:
|
1999-11-19 13:41:41 +03:00
|
|
|
error = sysctl_iflist(af, &w, w.w_op);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
splx(s);
|
1999-04-02 21:22:21 +04:00
|
|
|
|
|
|
|
/* check to see if we couldn't allocate memory with NOWAIT */
|
|
|
|
if (error == ENOBUFS && w.w_tmem == 0 && w.w_tmemneeded)
|
|
|
|
goto again;
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
if (w.w_tmem)
|
|
|
|
free(w.w_tmem, M_RTABLE);
|
1993-03-21 12:45:37 +03:00
|
|
|
w.w_needed += w.w_given;
|
1994-05-13 10:02:48 +04:00
|
|
|
if (where) {
|
1996-02-14 00:59:53 +03:00
|
|
|
*given = w.w_where - (caddr_t) where;
|
1994-05-13 10:02:48 +04:00
|
|
|
if (*given < w.w_needed)
|
|
|
|
return (ENOMEM);
|
|
|
|
} else {
|
|
|
|
*given = (11 * w.w_needed) / 10;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
return (error);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Definitions of protocols supported in the ROUTE domain.
|
|
|
|
*/
|
|
|
|
|
2004-04-22 05:01:40 +04:00
|
|
|
const struct protosw routesw[] = {
|
2004-04-22 01:03:43 +04:00
|
|
|
{
|
|
|
|
SOCK_RAW, &routedomain, 0, PR_ATOMIC|PR_ADDR,
|
|
|
|
raw_input, route_output, raw_ctlinput, 0,
|
|
|
|
route_usrreq,
|
|
|
|
raw_init, 0, 0, 0,
|
|
|
|
} };
|
|
|
|
|
|
|
|
struct domain routedomain = {
|
2006-09-03 09:08:18 +04:00
|
|
|
.dom_family = PF_ROUTE,
|
|
|
|
.dom_name = "route",
|
|
|
|
.dom_init = route_init,
|
|
|
|
.dom_protosw = routesw,
|
|
|
|
.dom_protoswNPROTOSW = &routesw[sizeof(routesw)/sizeof(routesw[0])],
|
1993-03-21 12:45:37 +03:00
|
|
|
};
|
|
|
|
|
Dynamic sysctl.
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.
2003-12-04 22:38:21 +03:00
|
|
|
SYSCTL_SETUP(sysctl_net_route_setup, "sysctl net.route subtree setup")
|
|
|
|
{
|
2006-05-28 03:08:11 +04:00
|
|
|
const struct sysctlnode *rnode = NULL;
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
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.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, "net", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, CTL_EOL);
|
|
|
|
|
2006-05-28 03:08:11 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, &rnode,
|
2004-03-24 18:34:46 +03:00
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_NODE, "route",
|
|
|
|
SYSCTL_DESCR("PF_ROUTE information"),
|
Dynamic sysctl.
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.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_ROUTE, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_NODE, "rtable",
|
|
|
|
SYSCTL_DESCR("Routing table information"),
|
Dynamic sysctl.
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.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_rtable, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_ROUTE, 0 /* any protocol */, CTL_EOL);
|
2006-05-28 03:08:11 +04:00
|
|
|
sysctl_createv(clog, 0, &rnode, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_STRUCT, "stats",
|
|
|
|
SYSCTL_DESCR("Routing statistics"),
|
|
|
|
NULL, 0, &rtstat, sizeof(rtstat),
|
|
|
|
CTL_CREATE, CTL_EOL);
|
Dynamic sysctl.
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.
2003-12-04 22:38:21 +03:00
|
|
|
}
|