2009-09-16 19:23:04 +04:00
|
|
|
/* $NetBSD: udp6_usrreq.c,v 1.88 2009/09/16 15:23:05 pooka Exp $ */
|
2001-05-27 21:36:07 +04:00
|
|
|
/* $KAME: udp6_usrreq.c,v 1.86 2001/05/27 17:33:00 itojun Exp $ */
|
1999-07-04 01:24:45 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2000-04-17 20:26:07 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +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.
|
2000-04-17 20:26:07 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 1989, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1999-06-28 10:36:47 +04: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.
|
|
|
|
*
|
|
|
|
* @(#)udp_var.h 8.1 (Berkeley) 6/10/93
|
|
|
|
*/
|
|
|
|
|
2001-11-13 03:56:55 +03:00
|
|
|
#include <sys/cdefs.h>
|
2009-09-16 19:23:04 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: udp6_usrreq.c,v 1.88 2009/09/16 15:23:05 pooka Exp $");
|
1999-07-10 02:57:15 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/proc.h>
|
1999-08-05 20:01:07 +04:00
|
|
|
#include <sys/syslog.h>
|
2001-10-29 10:02:30 +03:00
|
|
|
#include <sys/sysctl.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/if_types.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.h>
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <netinet/in_systm.h>
|
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/ip_var.h>
|
|
|
|
#include <netinet/in_pcb.h>
|
|
|
|
#include <netinet/udp.h>
|
|
|
|
#include <netinet/udp_var.h>
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/ip6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/ip6_var.h>
|
2000-04-17 20:26:07 +04:00
|
|
|
#include <netinet6/in6_pcb.h>
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/icmp6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/udp6_var.h>
|
2008-04-15 08:43:25 +04:00
|
|
|
#include <netinet6/udp6_private.h>
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <netinet6/ip6protosw.h>
|
2005-08-10 17:06:49 +04:00
|
|
|
#include <netinet/in_offload.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#include "faith.h"
|
2001-05-08 14:15:13 +04:00
|
|
|
#if defined(NFAITH) && NFAITH > 0
|
|
|
|
#include <net/if_faith.h>
|
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
* UDP protocol implementation.
|
1999-06-28 10:36:47 +04:00
|
|
|
* Per RFC 768, August, 1980.
|
|
|
|
*/
|
|
|
|
|
2003-09-04 13:16:57 +04:00
|
|
|
extern struct inpcbtable udbtable;
|
2008-04-15 08:43:25 +04:00
|
|
|
|
|
|
|
percpu_t *udp6stat_percpu;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-11-01 23:33:56 +03:00
|
|
|
static void udp6_notify(struct in6pcb *, int);
|
2009-09-16 19:23:04 +04:00
|
|
|
static void sysctl_net_inet6_udp6_setup(struct sysctllog **);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
void
|
2008-02-27 22:54:27 +03:00
|
|
|
udp6_init(void)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2009-09-16 19:23:04 +04:00
|
|
|
|
|
|
|
sysctl_net_inet6_udp6_setup(NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Notify a udp user of an asynchronous error;
|
2000-04-17 20:26:07 +04:00
|
|
|
* just wake up so that he can collect error status.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
static void
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
udp6_notify(struct in6pcb *in6p, int errno)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
in6p->in6p_socket->so_error = errno;
|
|
|
|
sorwakeup(in6p->in6p_socket);
|
|
|
|
sowwakeup(in6p->in6p_socket);
|
|
|
|
}
|
|
|
|
|
2008-04-24 15:38:36 +04:00
|
|
|
void *
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
udp6_ctlinput(int cmd, const struct sockaddr *sa, void *d)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct udphdr uh;
|
2001-02-10 07:14:26 +03:00
|
|
|
struct ip6_hdr *ip6;
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
const struct sockaddr_in6 *sa6 = (const struct sockaddr_in6 *)sa;
|
1999-12-13 18:17:17 +03:00
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
2001-02-11 09:49:49 +03:00
|
|
|
void *cmdarg;
|
|
|
|
struct ip6ctlparam *ip6cp = NULL;
|
|
|
|
const struct sockaddr_in6 *sa6_src = NULL;
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
void (*notify)(struct in6pcb *, int) = udp6_notify;
|
2001-02-11 09:49:49 +03:00
|
|
|
struct udp_portonly {
|
|
|
|
u_int16_t uh_sport;
|
|
|
|
u_int16_t uh_dport;
|
|
|
|
} *uhp;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-08-09 14:55:29 +04:00
|
|
|
if (sa->sa_family != AF_INET6 ||
|
|
|
|
sa->sa_len != sizeof(struct sockaddr_in6))
|
2008-04-24 15:38:36 +04:00
|
|
|
return NULL;
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2000-02-28 19:10:52 +03:00
|
|
|
if ((unsigned)cmd >= PRC_NCMDS)
|
2008-04-24 15:38:36 +04:00
|
|
|
return NULL;
|
2000-02-28 19:10:52 +03:00
|
|
|
if (PRC_IS_REDIRECT(cmd))
|
|
|
|
notify = in6_rtchange, d = NULL;
|
|
|
|
else if (cmd == PRC_HOSTDEAD)
|
|
|
|
d = NULL;
|
2001-10-18 11:44:33 +04:00
|
|
|
else if (cmd == PRC_MSGSIZE) {
|
|
|
|
/* special code is present, see below */
|
|
|
|
notify = in6_rtchange;
|
|
|
|
}
|
2000-02-28 19:10:52 +03:00
|
|
|
else if (inet6ctlerrmap[cmd] == 0)
|
2008-04-24 15:38:36 +04:00
|
|
|
return NULL;
|
1999-07-31 22:41:15 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
/* if the parameter is from icmp6, decode it. */
|
|
|
|
if (d != NULL) {
|
2001-02-11 09:49:49 +03:00
|
|
|
ip6cp = (struct ip6ctlparam *)d;
|
1999-12-13 18:17:17 +03:00
|
|
|
m = ip6cp->ip6c_m;
|
|
|
|
ip6 = ip6cp->ip6c_ip6;
|
|
|
|
off = ip6cp->ip6c_off;
|
2001-02-11 09:49:49 +03:00
|
|
|
cmdarg = ip6cp->ip6c_cmdarg;
|
|
|
|
sa6_src = ip6cp->ip6c_src;
|
1999-12-13 18:17:17 +03:00
|
|
|
} else {
|
|
|
|
m = NULL;
|
|
|
|
ip6 = NULL;
|
2001-02-11 09:49:49 +03:00
|
|
|
cmdarg = NULL;
|
|
|
|
sa6_src = &sa6_any;
|
2003-10-25 12:26:14 +04:00
|
|
|
off = 0;
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (ip6) {
|
|
|
|
/*
|
|
|
|
* XXX: We assume that when IPV6 is non NULL,
|
|
|
|
* M and OFF are valid.
|
|
|
|
*/
|
1999-07-31 22:41:15 +04:00
|
|
|
|
2000-10-13 21:53:44 +04:00
|
|
|
/* check if we can safely examine src and dst ports */
|
2001-05-24 11:22:27 +04:00
|
|
|
if (m->m_pkthdr.len < off + sizeof(*uhp)) {
|
|
|
|
if (cmd == PRC_MSGSIZE)
|
|
|
|
icmp6_mtudisc_update((struct ip6ctlparam *)d, 0);
|
2008-04-24 15:38:36 +04:00
|
|
|
return NULL;
|
2001-05-24 11:22:27 +04:00
|
|
|
}
|
2000-10-13 21:53:44 +04:00
|
|
|
|
2009-03-18 19:00:08 +03:00
|
|
|
memset(&uh, 0, sizeof(uh));
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copydata(m, off, sizeof(*uhp), (void *)&uh);
|
2000-10-19 05:14:13 +04:00
|
|
|
|
|
|
|
if (cmd == PRC_MSGSIZE) {
|
2000-12-09 04:29:45 +03:00
|
|
|
int valid = 0;
|
2001-02-11 09:49:49 +03:00
|
|
|
|
2000-10-19 05:14:13 +04:00
|
|
|
/*
|
|
|
|
* Check to see if we have a valid UDP socket
|
|
|
|
* corresponding to the address in the ICMPv6 message
|
|
|
|
* payload.
|
|
|
|
*/
|
2003-09-04 13:16:57 +04:00
|
|
|
if (in6_pcblookup_connect(&udbtable, &sa6->sin6_addr,
|
2005-05-30 01:43:51 +04:00
|
|
|
uh.uh_dport, (const struct in6_addr *)&sa6_src->sin6_addr,
|
2001-02-11 09:49:49 +03:00
|
|
|
uh.uh_sport, 0))
|
2000-12-09 04:29:45 +03:00
|
|
|
valid++;
|
2000-10-19 05:14:13 +04:00
|
|
|
#if 0
|
|
|
|
/*
|
|
|
|
* As the use of sendto(2) is fairly popular,
|
|
|
|
* we may want to allow non-connected pcb too.
|
|
|
|
* But it could be too weak against attacks...
|
|
|
|
* We should at least check if the local address (= s)
|
|
|
|
* is really ours.
|
|
|
|
*/
|
2003-09-04 13:16:57 +04:00
|
|
|
else if (in6_pcblookup_bind(&udbtable, &sa6->sin6_addr,
|
|
|
|
uh.uh_dport, 0))
|
2000-12-09 04:29:45 +03:00
|
|
|
valid++;
|
2000-10-19 05:14:13 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
2001-02-11 09:49:49 +03:00
|
|
|
* Depending on the value of "valid" and routing table
|
|
|
|
* size (mtudisc_{hi,lo}wat), we will:
|
2001-10-15 13:51:15 +04:00
|
|
|
* - recalculate the new MTU and create the
|
2001-02-11 09:49:49 +03:00
|
|
|
* corresponding routing entry, or
|
|
|
|
* - ignore the MTU change notification.
|
2000-10-19 05:14:13 +04:00
|
|
|
*/
|
2000-12-09 04:29:45 +03:00
|
|
|
icmp6_mtudisc_update((struct ip6ctlparam *)d, valid);
|
2000-10-19 05:14:13 +04:00
|
|
|
|
2001-02-11 09:49:49 +03:00
|
|
|
/*
|
2006-05-05 04:03:21 +04:00
|
|
|
* regardless of if we called
|
|
|
|
* icmp6_mtudisc_update(), we need to call
|
|
|
|
* in6_pcbnotify(), to notify path MTU change
|
|
|
|
* to the userland (RFC3542), because some
|
|
|
|
* unconnected sockets may share the same
|
2001-02-11 09:49:49 +03:00
|
|
|
* destination and want to know the path MTU.
|
|
|
|
*/
|
2000-10-19 05:14:13 +04:00
|
|
|
}
|
|
|
|
|
2003-09-04 13:16:57 +04:00
|
|
|
(void) in6_pcbnotify(&udbtable, sa, uh.uh_dport,
|
2005-05-30 01:43:51 +04:00
|
|
|
(const struct sockaddr *)sa6_src, uh.uh_sport, cmd, cmdarg,
|
2001-02-11 09:49:49 +03:00
|
|
|
notify);
|
1999-06-28 10:36:47 +04:00
|
|
|
} else {
|
2003-09-04 13:16:57 +04:00
|
|
|
(void) in6_pcbnotify(&udbtable, sa, 0,
|
2005-05-30 01:43:51 +04:00
|
|
|
(const struct sockaddr *)sa6_src, 0, cmd, cmdarg, notify);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2008-04-24 15:38:36 +04:00
|
|
|
return NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
extern int udp6_sendspace;
|
|
|
|
extern int udp6_recvspace;
|
|
|
|
|
|
|
|
int
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
udp6_usrreq(struct socket *so, int req, struct mbuf *m, struct mbuf *addr6,
|
|
|
|
struct mbuf *control, struct lwp *l)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct in6pcb *in6p = sotoin6pcb(so);
|
|
|
|
int error = 0;
|
|
|
|
int s;
|
|
|
|
|
2000-04-17 20:26:07 +04:00
|
|
|
/*
|
1999-06-28 10:36:47 +04:00
|
|
|
* MAPPED_ADDR implementation info:
|
|
|
|
* Mapped addr support for PRU_CONTROL is not necessary.
|
|
|
|
* Because typical user of PRU_CONTROL is such as ifconfig,
|
|
|
|
* and they don't associate any addr to their socket. Then
|
|
|
|
* socket family is only hint about the PRU_CONTROL'ed address
|
|
|
|
* family, especially when getting addrs from kernel.
|
|
|
|
* So AF_INET socket need to be used to control AF_INET addrs,
|
|
|
|
* and AF_INET6 socket for AF_INET6 addrs.
|
|
|
|
*/
|
|
|
|
if (req == PRU_CONTROL)
|
2007-11-15 01:58:27 +03:00
|
|
|
return in6_control(so, (u_long)m, (void *)addr6,
|
|
|
|
(struct ifnet *)control, l);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-02-03 02:28:08 +03:00
|
|
|
if (req == PRU_PURGEIF) {
|
2008-04-24 15:38:36 +04:00
|
|
|
mutex_enter(softnet_lock);
|
2003-09-04 13:16:57 +04:00
|
|
|
in6_pcbpurgeif0(&udbtable, (struct ifnet *)control);
|
2000-02-03 02:28:08 +03:00
|
|
|
in6_purgeif((struct ifnet *)control);
|
2003-09-04 13:16:57 +04:00
|
|
|
in6_pcbpurgeif(&udbtable, (struct ifnet *)control);
|
2008-04-24 15:38:36 +04:00
|
|
|
mutex_exit(softnet_lock);
|
2007-11-15 01:58:27 +03:00
|
|
|
return 0;
|
2000-02-02 01:52:04 +03:00
|
|
|
}
|
|
|
|
|
2008-04-24 15:38:36 +04:00
|
|
|
if (req == PRU_ATTACH)
|
|
|
|
sosetlock(so);
|
|
|
|
else if (in6p == NULL) {
|
1999-06-28 10:36:47 +04:00
|
|
|
error = EINVAL;
|
|
|
|
goto release;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (req) {
|
|
|
|
case PRU_ATTACH:
|
|
|
|
/*
|
|
|
|
* MAPPED_ADDR implementation spec:
|
2000-04-17 20:26:07 +04:00
|
|
|
* Always attach for IPv6,
|
1999-06-28 10:36:47 +04:00
|
|
|
* and only when necessary for IPv4.
|
|
|
|
*/
|
1999-07-01 12:12:45 +04:00
|
|
|
if (in6p != NULL) {
|
1999-06-28 10:36:47 +04:00
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
2003-09-04 13:16:57 +04:00
|
|
|
error = in6_pcballoc(so, &udbtable);
|
1999-06-28 10:36:47 +04:00
|
|
|
splx(s);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
error = soreserve(so, udp6_sendspace, udp6_recvspace);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
in6p = sotoin6pcb(so);
|
|
|
|
in6p->in6p_cksum = -1; /* just to be sure */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_DETACH:
|
2003-09-04 13:16:57 +04:00
|
|
|
in6_pcbdetach(in6p);
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_BIND:
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
2006-07-24 02:06:03 +04:00
|
|
|
error = in6_pcbbind(in6p, addr6, l);
|
1999-06-28 10:36:47 +04:00
|
|
|
splx(s);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_CONNECT:
|
1999-12-13 18:17:17 +03:00
|
|
|
if (!IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_faddr)) {
|
1999-06-28 10:36:47 +04:00
|
|
|
error = EISCONN;
|
|
|
|
break;
|
|
|
|
}
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
2006-07-24 02:06:03 +04:00
|
|
|
error = in6_pcbconnect(in6p, addr6, l);
|
1999-06-28 10:36:47 +04:00
|
|
|
splx(s);
|
|
|
|
if (error == 0)
|
|
|
|
soisconnected(so);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_DISCONNECT:
|
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_faddr)) {
|
|
|
|
error = ENOTCONN;
|
|
|
|
break;
|
|
|
|
}
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
in6_pcbdisconnect(in6p);
|
2009-03-18 19:00:08 +03:00
|
|
|
memset((void *)&in6p->in6p_laddr, 0, sizeof(in6p->in6p_laddr));
|
1999-06-28 10:36:47 +04:00
|
|
|
splx(s);
|
|
|
|
so->so_state &= ~SS_ISCONNECTED; /* XXX */
|
2003-09-04 13:16:57 +04:00
|
|
|
in6_pcbstate(in6p, IN6P_BOUND); /* XXX */
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SHUTDOWN:
|
|
|
|
socantsendmore(so);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SEND:
|
2007-11-07 02:47:08 +03:00
|
|
|
s = splsoftnet();
|
|
|
|
error = udp6_output(in6p, m, addr6, control, l);
|
|
|
|
splx(s);
|
|
|
|
return error;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
case PRU_ABORT:
|
|
|
|
soisdisconnected(so);
|
2003-09-04 13:16:57 +04:00
|
|
|
in6_pcbdetach(in6p);
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SOCKADDR:
|
|
|
|
in6_setsockaddr(in6p, addr6);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_PEERADDR:
|
|
|
|
in6_setpeeraddr(in6p, addr6);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SENSE:
|
|
|
|
/*
|
|
|
|
* stat: don't bother with a blocksize
|
|
|
|
*/
|
2007-11-15 01:58:27 +03:00
|
|
|
return 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-11-15 01:58:27 +03:00
|
|
|
case PRU_LISTEN:
|
|
|
|
case PRU_CONNECT2:
|
|
|
|
case PRU_ACCEPT:
|
1999-06-28 10:36:47 +04:00
|
|
|
case PRU_SENDOOB:
|
|
|
|
case PRU_FASTTIMO:
|
|
|
|
case PRU_SLOWTIMO:
|
|
|
|
case PRU_PROTORCV:
|
|
|
|
case PRU_PROTOSEND:
|
|
|
|
error = EOPNOTSUPP;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_RCVD:
|
|
|
|
case PRU_RCVOOB:
|
2007-11-15 01:58:27 +03:00
|
|
|
return EOPNOTSUPP; /* do not free mbuf's */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
default:
|
|
|
|
panic("udp6_usrreq");
|
|
|
|
}
|
|
|
|
|
|
|
|
release:
|
2007-11-15 01:58:27 +03:00
|
|
|
if (control != NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(control);
|
2007-11-15 01:58:27 +03:00
|
|
|
if (m != NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(m);
|
2007-11-15 01:58:27 +03:00
|
|
|
return error;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2008-04-15 08:43:25 +04:00
|
|
|
static int
|
|
|
|
sysctl_net_inet6_udp6_stats(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
|
2008-05-04 11:22:14 +04:00
|
|
|
return (NETSTAT_SYSCTL(udp6stat_percpu, UDP6_NSTATS));
|
2008-04-15 08:43:25 +04:00
|
|
|
}
|
|
|
|
|
2009-09-16 19:23:04 +04:00
|
|
|
static void
|
|
|
|
sysctl_net_inet6_udp6_setup(struct sysctllog **clog)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
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);
|
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, "inet6", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET6, 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, "udp6",
|
|
|
|
SYSCTL_DESCR("UDPv6 related settings"),
|
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_INET6, IPPROTO_UDP, CTL_EOL);
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "sendspace",
|
|
|
|
SYSCTL_DESCR("Default UDP send buffer size"),
|
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, &udp6_sendspace, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_UDP, UDP6CTL_SENDSPACE,
|
|
|
|
CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "recvspace",
|
|
|
|
SYSCTL_DESCR("Default UDP receive buffer size"),
|
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, &udp6_recvspace, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_UDP, UDP6CTL_RECVSPACE,
|
|
|
|
CTL_EOL);
|
2004-12-15 07:25:19 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "do_loopback_cksum",
|
|
|
|
SYSCTL_DESCR("Perform UDP checksum on loopback"),
|
|
|
|
NULL, 0, &udp_do_loopback_cksum, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_UDP, UDP6CTL_LOOPBACKCKSUM,
|
|
|
|
CTL_EOL);
|
2005-03-09 08:07:19 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2005-03-11 09:16:15 +03:00
|
|
|
CTLTYPE_STRUCT, "pcblist",
|
2005-03-09 08:07:19 +03:00
|
|
|
SYSCTL_DESCR("UDP protocol control block list"),
|
|
|
|
sysctl_inpcblist, 0, &udbtable, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_UDP, CTL_CREATE,
|
|
|
|
CTL_EOL);
|
2005-08-29 01:01:02 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_STRUCT, "stats",
|
|
|
|
SYSCTL_DESCR("UDPv6 statistics"),
|
2008-04-15 08:43:25 +04:00
|
|
|
sysctl_net_inet6_udp6_stats, 0, NULL, 0,
|
2005-08-29 01:01:02 +04:00
|
|
|
CTL_NET, PF_INET6, IPPROTO_UDP, UDP6CTL_STATS,
|
|
|
|
CTL_EOL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2008-04-15 08:43:25 +04:00
|
|
|
|
|
|
|
void
|
|
|
|
udp6_statinc(u_int stat)
|
|
|
|
{
|
|
|
|
|
|
|
|
KASSERT(stat < UDP6_NSTATS);
|
|
|
|
UDP6_STATINC(stat);
|
|
|
|
}
|