2004-03-31 11:54:00 +04:00
|
|
|
/* $NetBSD: udp_usrreq.c,v 1.117 2004/03/31 07:54:00 itojun Exp $ */
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2002-06-09 20:33:36 +04: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.
|
2002-06-09 20:33:36 +04: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
|
|
|
/*
|
1998-01-05 13:31:44 +03:00
|
|
|
* Copyright (c) 1982, 1986, 1988, 1990, 1993, 1995
|
1994-05-13 10:02:48 +04:00
|
|
|
* 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-01-05 13:31:44 +03:00
|
|
|
* @(#)udp_usrreq.c 8.6 (Berkeley) 5/23/95
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
1999-07-10 02:57:15 +04:00
|
|
|
|
2001-11-13 03:32:34 +03:00
|
|
|
#include <sys/cdefs.h>
|
2004-03-31 11:54:00 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: udp_usrreq.c,v 1.117 2004/03/31 07:54:00 itojun Exp $");
|
2001-11-13 03:32:34 +03:00
|
|
|
|
2001-05-31 23:56:13 +04:00
|
|
|
#include "opt_inet.h"
|
1999-07-10 02:57:15 +04:00
|
|
|
#include "opt_ipsec.h"
|
2001-06-02 20:17:09 +04:00
|
|
|
#include "opt_inet_csum.h"
|
2000-03-22 23:58:25 +03:00
|
|
|
#include "opt_ipkdb.h"
|
2003-06-23 15:00:59 +04:00
|
|
|
#include "opt_mbuftrace.h"
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1993-12-18 03:40:47 +03: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>
|
1994-05-13 10:02:48 +04:00
|
|
|
#include <sys/errno.h>
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <sys/stat.h>
|
1996-02-14 02:40:59 +03:00
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/proc.h>
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <sys/domain.h>
|
1996-02-14 02:40:59 +03:00
|
|
|
#include <sys/sysctl.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_systm.h>
|
1995-04-13 10:35:38 +04:00
|
|
|
#include <netinet/in_var.h>
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/in_pcb.h>
|
|
|
|
#include <netinet/ip_var.h>
|
|
|
|
#include <netinet/ip_icmp.h>
|
|
|
|
#include <netinet/udp.h>
|
|
|
|
#include <netinet/udp_var.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
#ifdef INET6
|
|
|
|
#include <netinet/ip6.h>
|
|
|
|
#include <netinet/icmp6.h>
|
|
|
|
#include <netinet6/ip6_var.h>
|
|
|
|
#include <netinet6/in6_pcb.h>
|
|
|
|
#include <netinet6/udp6_var.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef INET6
|
|
|
|
/* always need ip6.h for IP6_EXTHDR_GET */
|
|
|
|
#include <netinet/ip6.h>
|
|
|
|
#endif
|
|
|
|
|
2001-05-08 14:15:13 +04:00
|
|
|
#include "faith.h"
|
|
|
|
#if defined(NFAITH) && NFAITH > 0
|
|
|
|
#include <net/if_faith.h>
|
|
|
|
#endif
|
|
|
|
|
1996-02-14 02:40:59 +03:00
|
|
|
#include <machine/stdarg.h>
|
|
|
|
|
2003-08-15 07:42:00 +04:00
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
#include <netipsec/ipsec.h>
|
|
|
|
#ifdef INET6
|
|
|
|
#include <netipsec/ipsec6.h>
|
|
|
|
#endif
|
|
|
|
#endif /* FAST_IPSEC*/
|
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef IPSEC
|
|
|
|
#include <netinet6/ipsec.h>
|
|
|
|
#include <netkey/key.h>
|
|
|
|
#endif /*IPSEC*/
|
|
|
|
|
2000-03-22 23:58:25 +03:00
|
|
|
#ifdef IPKDB
|
|
|
|
#include <ipkdb/ipkdb.h>
|
|
|
|
#endif
|
|
|
|
|
1994-01-09 02:19:48 +03:00
|
|
|
/*
|
|
|
|
* UDP protocol implementation.
|
|
|
|
* Per RFC 768, August, 1980.
|
|
|
|
*/
|
|
|
|
#ifndef COMPAT_42
|
|
|
|
int udpcksum = 1;
|
|
|
|
#else
|
|
|
|
int udpcksum = 0; /* XXX */
|
|
|
|
#endif
|
|
|
|
|
2002-05-13 00:33:50 +04:00
|
|
|
struct inpcbtable udbtable;
|
|
|
|
struct udpstat udpstat;
|
|
|
|
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-12-13 18:17:17 +03:00
|
|
|
static void udp4_sendup __P((struct mbuf *, int, struct sockaddr *,
|
|
|
|
struct socket *));
|
|
|
|
static int udp4_realinput __P((struct sockaddr_in *, struct sockaddr_in *,
|
|
|
|
struct mbuf *, int));
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
#ifdef INET6
|
|
|
|
static void udp6_sendup __P((struct mbuf *, int, struct sockaddr *,
|
|
|
|
struct socket *));
|
|
|
|
static int udp6_realinput __P((int, struct sockaddr_in6 *,
|
|
|
|
struct sockaddr_in6 *, struct mbuf *, int));
|
|
|
|
#endif
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1994-05-13 10:02:48 +04:00
|
|
|
static void udp_notify __P((struct inpcb *, int));
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1994-01-09 02:17:18 +03:00
|
|
|
|
1996-01-31 06:49:23 +03:00
|
|
|
#ifndef UDBHASHSIZE
|
|
|
|
#define UDBHASHSIZE 128
|
|
|
|
#endif
|
|
|
|
int udbhashsize = UDBHASHSIZE;
|
|
|
|
|
2003-02-26 09:31:08 +03:00
|
|
|
#ifdef MBUFTRACE
|
|
|
|
struct mowner udp_mowner = { "udp" };
|
|
|
|
struct mowner udp_rx_mowner = { "udp", "rx" };
|
|
|
|
struct mowner udp_tx_mowner = { "udp", "tx" };
|
|
|
|
#endif
|
|
|
|
|
2001-06-02 20:17:09 +04:00
|
|
|
#ifdef UDP_CSUM_COUNTERS
|
|
|
|
#include <sys/device.h>
|
|
|
|
|
|
|
|
struct evcnt udp_hwcsum_bad = EVCNT_INITIALIZER(EVCNT_TYPE_MISC,
|
|
|
|
NULL, "udp", "hwcsum bad");
|
|
|
|
struct evcnt udp_hwcsum_ok = EVCNT_INITIALIZER(EVCNT_TYPE_MISC,
|
|
|
|
NULL, "udp", "hwcsum ok");
|
|
|
|
struct evcnt udp_hwcsum_data = EVCNT_INITIALIZER(EVCNT_TYPE_MISC,
|
|
|
|
NULL, "udp", "hwcsum data");
|
|
|
|
struct evcnt udp_swcsum = EVCNT_INITIALIZER(EVCNT_TYPE_MISC,
|
|
|
|
NULL, "udp", "swcsum");
|
|
|
|
|
|
|
|
#define UDP_CSUM_COUNTER_INCR(ev) (ev)->ev_count++
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
#define UDP_CSUM_COUNTER_INCR(ev) /* nothing */
|
|
|
|
|
|
|
|
#endif /* UDP_CSUM_COUNTERS */
|
|
|
|
|
1994-01-09 02:17:18 +03:00
|
|
|
void
|
1993-03-21 12:45:37 +03:00
|
|
|
udp_init()
|
|
|
|
{
|
1995-06-12 04:46:47 +04:00
|
|
|
|
1996-09-15 22:11:06 +04:00
|
|
|
in_pcbinit(&udbtable, udbhashsize, udbhashsize);
|
2001-06-02 20:17:09 +04:00
|
|
|
|
|
|
|
#ifdef UDP_CSUM_COUNTERS
|
|
|
|
evcnt_attach_static(&udp_hwcsum_bad);
|
|
|
|
evcnt_attach_static(&udp_hwcsum_ok);
|
|
|
|
evcnt_attach_static(&udp_hwcsum_data);
|
|
|
|
evcnt_attach_static(&udp_swcsum);
|
|
|
|
#endif /* UDP_CSUM_COUNTERS */
|
2003-02-26 09:31:08 +03:00
|
|
|
|
|
|
|
MOWNER_ATTACH(&udp_tx_mowner);
|
|
|
|
MOWNER_ATTACH(&udp_rx_mowner);
|
|
|
|
MOWNER_ATTACH(&udp_mowner);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-12-13 18:17:17 +03:00
|
|
|
void
|
|
|
|
#if __STDC__
|
|
|
|
udp_input(struct mbuf *m, ...)
|
|
|
|
#else
|
|
|
|
udp_input(m, va_alist)
|
|
|
|
struct mbuf *m;
|
|
|
|
va_dcl
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
struct sockaddr_in src, dst;
|
|
|
|
struct ip *ip;
|
|
|
|
struct udphdr *uh;
|
2003-01-20 02:57:01 +03:00
|
|
|
int iphlen;
|
1999-12-13 18:17:17 +03:00
|
|
|
int len;
|
|
|
|
int n;
|
2002-08-14 04:23:27 +04:00
|
|
|
u_int16_t ip_len;
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
va_start(ap, m);
|
|
|
|
iphlen = va_arg(ap, int);
|
2003-01-20 02:57:01 +03:00
|
|
|
(void)va_arg(ap, int); /* ignore value, advance ap */
|
1999-12-13 18:17:17 +03:00
|
|
|
va_end(ap);
|
|
|
|
|
2003-02-26 09:31:08 +03:00
|
|
|
MCLAIM(m, &udp_rx_mowner);
|
1999-12-13 18:17:17 +03:00
|
|
|
udpstat.udps_ipackets++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get IP and UDP header together in first mbuf.
|
|
|
|
*/
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
IP6_EXTHDR_GET(uh, struct udphdr *, m, iphlen, sizeof(struct udphdr));
|
|
|
|
if (uh == NULL) {
|
|
|
|
udpstat.udps_hdrops++;
|
|
|
|
return;
|
|
|
|
}
|
Changes to allow the IPv4 and IPv6 layers to align headers themseves,
as necessary:
* Implement a new mbuf utility routine, m_copyup(), is is like
m_pullup(), except that it always prepends and copies, rather
than only doing so if the desired length is larger than m->m_len.
m_copyup() also allows an offset into the destination mbuf, which
allows space for packet headers, in the forwarding case.
* Add *_HDR_ALIGNED_P() macros for IP, IPv6, ICMP, and IGMP. These
macros expand to 1 if __NO_STRICT_ALIGNMENT is defined, so that
architectures which do not have strict alignment constraints don't
pay for the test or visit the new align-if-needed path.
* Use the new macros to check if a header needs to be aligned, or to
assert that it already is, as appropriate.
Note: This code is still somewhat experimental. However, the new
code path won't be visited if individual device drivers continue
to guarantee that packets are delivered to layer 3 already properly
aligned (which are rules that are already in use).
2002-07-01 02:40:32 +04:00
|
|
|
KASSERT(UDP_HDR_ALIGNED_P(uh));
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2000-01-31 13:39:26 +03:00
|
|
|
/* destination port of 0 is illegal, based on RFC768. */
|
|
|
|
if (uh->uh_dport == 0)
|
|
|
|
goto bad;
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
/*
|
|
|
|
* Make mbuf data length reflect UDP length.
|
|
|
|
* If not enough data to reflect UDP length, drop.
|
|
|
|
*/
|
2002-08-14 04:23:27 +04:00
|
|
|
ip_len = ntohs(ip->ip_len);
|
1999-12-13 18:17:17 +03:00
|
|
|
len = ntohs((u_int16_t)uh->uh_ulen);
|
2002-08-14 04:23:27 +04:00
|
|
|
if (ip_len != iphlen + len) {
|
|
|
|
if (ip_len < iphlen + len || len < sizeof(struct udphdr)) {
|
1999-12-13 18:17:17 +03:00
|
|
|
udpstat.udps_badlen++;
|
|
|
|
goto bad;
|
|
|
|
}
|
2002-08-14 04:23:27 +04:00
|
|
|
m_adj(m, iphlen + len - ip_len);
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Checksum extended UDP header and data.
|
|
|
|
*/
|
|
|
|
if (uh->uh_sum) {
|
2001-06-02 20:17:09 +04:00
|
|
|
switch (m->m_pkthdr.csum_flags &
|
2003-10-18 17:05:45 +04:00
|
|
|
((m->m_pkthdr.rcvif->if_csum_flags_rx & M_CSUM_UDPv4) |
|
|
|
|
M_CSUM_TCP_UDP_BAD | M_CSUM_DATA)) {
|
2001-06-02 20:17:09 +04:00
|
|
|
case M_CSUM_UDPv4|M_CSUM_TCP_UDP_BAD:
|
|
|
|
UDP_CSUM_COUNTER_INCR(&udp_hwcsum_bad);
|
|
|
|
goto badcsum;
|
|
|
|
|
2003-08-21 18:49:49 +04:00
|
|
|
case M_CSUM_UDPv4|M_CSUM_DATA: {
|
|
|
|
u_int32_t hw_csum = m->m_pkthdr.csum_data;
|
2001-06-02 20:17:09 +04:00
|
|
|
UDP_CSUM_COUNTER_INCR(&udp_hwcsum_data);
|
2003-08-21 18:49:49 +04:00
|
|
|
if (m->m_pkthdr.csum_flags & M_CSUM_NO_PSEUDOHDR)
|
2003-10-18 17:05:45 +04:00
|
|
|
hw_csum = in_cksum_phdr(ip->ip_src.s_addr,
|
|
|
|
ip->ip_dst.s_addr,
|
2004-03-10 21:50:45 +03:00
|
|
|
htons(hw_csum + len + IPPROTO_UDP));
|
2003-08-21 18:49:49 +04:00
|
|
|
if ((hw_csum ^ 0xffff) != 0)
|
2001-06-02 20:17:09 +04:00
|
|
|
goto badcsum;
|
|
|
|
break;
|
2003-08-21 18:49:49 +04:00
|
|
|
}
|
2001-06-02 20:17:09 +04:00
|
|
|
|
|
|
|
case M_CSUM_UDPv4:
|
|
|
|
/* Checksum was okay. */
|
|
|
|
UDP_CSUM_COUNTER_INCR(&udp_hwcsum_ok);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
/* Need to compute it ourselves. */
|
|
|
|
UDP_CSUM_COUNTER_INCR(&udp_swcsum);
|
|
|
|
if (in4_cksum(m, IPPROTO_UDP, iphlen, len) != 0)
|
|
|
|
goto badcsum;
|
|
|
|
break;
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* construct source and dst sockaddrs. */
|
|
|
|
bzero(&src, sizeof(src));
|
|
|
|
src.sin_family = AF_INET;
|
|
|
|
src.sin_len = sizeof(struct sockaddr_in);
|
|
|
|
bcopy(&ip->ip_src, &src.sin_addr, sizeof(src.sin_addr));
|
|
|
|
src.sin_port = uh->uh_sport;
|
|
|
|
bzero(&dst, sizeof(dst));
|
|
|
|
dst.sin_family = AF_INET;
|
|
|
|
dst.sin_len = sizeof(struct sockaddr_in);
|
|
|
|
bcopy(&ip->ip_dst, &dst.sin_addr, sizeof(dst.sin_addr));
|
|
|
|
dst.sin_port = uh->uh_dport;
|
|
|
|
|
|
|
|
n = udp4_realinput(&src, &dst, m, iphlen);
|
|
|
|
#ifdef INET6
|
|
|
|
if (IN_MULTICAST(ip->ip_dst.s_addr) || n == 0) {
|
|
|
|
struct sockaddr_in6 src6, dst6;
|
|
|
|
|
|
|
|
bzero(&src6, sizeof(src6));
|
|
|
|
src6.sin6_family = AF_INET6;
|
|
|
|
src6.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
src6.sin6_addr.s6_addr[10] = src6.sin6_addr.s6_addr[11] = 0xff;
|
|
|
|
bcopy(&ip->ip_src, &src6.sin6_addr.s6_addr[12],
|
|
|
|
sizeof(ip->ip_src));
|
|
|
|
src6.sin6_port = uh->uh_sport;
|
|
|
|
bzero(&dst6, sizeof(dst6));
|
|
|
|
dst6.sin6_family = AF_INET6;
|
|
|
|
dst6.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
dst6.sin6_addr.s6_addr[10] = dst6.sin6_addr.s6_addr[11] = 0xff;
|
|
|
|
bcopy(&ip->ip_dst, &dst6.sin6_addr.s6_addr[12],
|
|
|
|
sizeof(ip->ip_dst));
|
|
|
|
dst6.sin6_port = uh->uh_dport;
|
|
|
|
|
|
|
|
n += udp6_realinput(AF_INET, &src6, &dst6, m, iphlen);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (n == 0) {
|
|
|
|
if (m->m_flags & (M_BCAST | M_MCAST)) {
|
|
|
|
udpstat.udps_noportbcast++;
|
|
|
|
goto bad;
|
|
|
|
}
|
2000-02-11 13:43:36 +03:00
|
|
|
udpstat.udps_noport++;
|
2000-03-22 23:58:25 +03:00
|
|
|
#ifdef IPKDB
|
1999-12-13 18:17:17 +03:00
|
|
|
if (checkipkdb(&ip->ip_src, uh->uh_sport, uh->uh_dport,
|
|
|
|
m, iphlen + sizeof(struct udphdr),
|
|
|
|
m->m_pkthdr.len - iphlen - sizeof(struct udphdr))) {
|
|
|
|
/*
|
|
|
|
* It was a debugger connect packet,
|
|
|
|
* just drop it now
|
|
|
|
*/
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_PORT, 0, 0);
|
|
|
|
m = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
bad:
|
|
|
|
if (m)
|
|
|
|
m_freem(m);
|
2001-06-02 20:17:09 +04:00
|
|
|
return;
|
|
|
|
|
|
|
|
badcsum:
|
|
|
|
m_freem(m);
|
|
|
|
udpstat.udps_badsum++;
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
int
|
|
|
|
udp6_input(mp, offp, proto)
|
|
|
|
struct mbuf **mp;
|
|
|
|
int *offp, proto;
|
|
|
|
{
|
|
|
|
struct mbuf *m = *mp;
|
|
|
|
int off = *offp;
|
|
|
|
struct sockaddr_in6 src, dst;
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
struct udphdr *uh;
|
|
|
|
u_int32_t plen, ulen;
|
|
|
|
|
2001-05-08 14:15:13 +04:00
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
#if defined(NFAITH) && 0 < NFAITH
|
2001-05-08 14:15:13 +04:00
|
|
|
if (faithprefix(&ip6->ip6_dst)) {
|
|
|
|
/* send icmp6 host unreach? */
|
|
|
|
m_freem(m);
|
|
|
|
return IPPROTO_DONE;
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
udp6stat.udp6s_ipackets++;
|
|
|
|
|
|
|
|
/* check for jumbogram is done in ip6_input. we can trust pkthdr.len */
|
|
|
|
plen = m->m_pkthdr.len - off;
|
|
|
|
IP6_EXTHDR_GET(uh, struct udphdr *, m, off, sizeof(struct udphdr));
|
|
|
|
if (uh == NULL) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return IPPROTO_DONE;
|
|
|
|
}
|
Changes to allow the IPv4 and IPv6 layers to align headers themseves,
as necessary:
* Implement a new mbuf utility routine, m_copyup(), is is like
m_pullup(), except that it always prepends and copies, rather
than only doing so if the desired length is larger than m->m_len.
m_copyup() also allows an offset into the destination mbuf, which
allows space for packet headers, in the forwarding case.
* Add *_HDR_ALIGNED_P() macros for IP, IPv6, ICMP, and IGMP. These
macros expand to 1 if __NO_STRICT_ALIGNMENT is defined, so that
architectures which do not have strict alignment constraints don't
pay for the test or visit the new align-if-needed path.
* Use the new macros to check if a header needs to be aligned, or to
assert that it already is, as appropriate.
Note: This code is still somewhat experimental. However, the new
code path won't be visited if individual device drivers continue
to guarantee that packets are delivered to layer 3 already properly
aligned (which are rules that are already in use).
2002-07-01 02:40:32 +04:00
|
|
|
KASSERT(UDP_HDR_ALIGNED_P(uh));
|
1999-12-13 18:17:17 +03:00
|
|
|
ulen = ntohs((u_short)uh->uh_ulen);
|
2000-07-07 19:54:16 +04:00
|
|
|
/*
|
|
|
|
* RFC2675 section 4: jumbograms will have 0 in the UDP header field,
|
|
|
|
* iff payload length > 0xffff.
|
|
|
|
*/
|
1999-12-13 18:17:17 +03:00
|
|
|
if (ulen == 0 && plen > 0xffff)
|
|
|
|
ulen = plen;
|
|
|
|
|
|
|
|
if (plen != ulen) {
|
|
|
|
udp6stat.udp6s_badlen++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
2000-01-31 13:39:26 +03:00
|
|
|
/* destination port of 0 is illegal, based on RFC768. */
|
|
|
|
if (uh->uh_dport == 0)
|
|
|
|
goto bad;
|
|
|
|
|
1999-12-22 07:03:01 +03:00
|
|
|
/* Be proactive about malicious use of IPv4 mapped address */
|
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_V4MAPPED(&ip6->ip6_dst)) {
|
|
|
|
/* XXX stat */
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
/*
|
|
|
|
* Checksum extended UDP header and data.
|
|
|
|
*/
|
2004-03-31 11:54:00 +04:00
|
|
|
if (uh->uh_sum == 0) {
|
1999-12-13 18:17:17 +03:00
|
|
|
udp6stat.udp6s_nosum++;
|
2004-03-31 11:54:00 +04:00
|
|
|
goto bad;
|
|
|
|
} else if (in6_cksum(m, IPPROTO_UDP, off, ulen) != 0) {
|
1999-12-13 18:17:17 +03:00
|
|
|
udp6stat.udp6s_badsum++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Construct source and dst sockaddrs.
|
|
|
|
* Note that ifindex (s6_addr16[1]) is already filled.
|
|
|
|
*/
|
|
|
|
bzero(&src, sizeof(src));
|
|
|
|
src.sin6_family = AF_INET6;
|
|
|
|
src.sin6_len = sizeof(struct sockaddr_in6);
|
2000-07-07 19:54:16 +04:00
|
|
|
/* KAME hack: recover scopeid */
|
|
|
|
(void)in6_recoverscope(&src, &ip6->ip6_src, m->m_pkthdr.rcvif);
|
1999-12-13 18:17:17 +03:00
|
|
|
src.sin6_port = uh->uh_sport;
|
|
|
|
bzero(&dst, sizeof(dst));
|
|
|
|
dst.sin6_family = AF_INET6;
|
|
|
|
dst.sin6_len = sizeof(struct sockaddr_in6);
|
2000-07-07 19:54:16 +04:00
|
|
|
/* KAME hack: recover scopeid */
|
|
|
|
(void)in6_recoverscope(&dst, &ip6->ip6_dst, m->m_pkthdr.rcvif);
|
1999-12-13 18:17:17 +03:00
|
|
|
dst.sin6_port = uh->uh_dport;
|
|
|
|
|
|
|
|
if (udp6_realinput(AF_INET6, &src, &dst, m, off) == 0) {
|
|
|
|
if (m->m_flags & M_MCAST) {
|
|
|
|
udp6stat.udp6s_noportmcast++;
|
|
|
|
goto bad;
|
|
|
|
}
|
2000-02-11 13:43:36 +03:00
|
|
|
udp6stat.udp6s_noport++;
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_error(m, ICMP6_DST_UNREACH, ICMP6_DST_UNREACH_NOPORT, 0);
|
|
|
|
m = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
bad:
|
|
|
|
if (m)
|
|
|
|
m_freem(m);
|
|
|
|
return IPPROTO_DONE;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-12-13 18:17:17 +03:00
|
|
|
static void
|
|
|
|
udp4_sendup(m, off, src, so)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off; /* offset of data portion */
|
|
|
|
struct sockaddr *src;
|
|
|
|
struct socket *so;
|
|
|
|
{
|
|
|
|
struct mbuf *opts = NULL;
|
|
|
|
struct mbuf *n;
|
|
|
|
struct inpcb *inp = NULL;
|
|
|
|
|
|
|
|
if (!so)
|
|
|
|
return;
|
|
|
|
switch (so->so_proto->pr_domain->dom_family) {
|
|
|
|
case AF_INET:
|
|
|
|
inp = sotoinpcb(so);
|
|
|
|
break;
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2003-08-15 07:42:00 +04:00
|
|
|
#if defined(IPSEC) || defined(FAST_IPSEC)
|
1999-12-13 18:17:17 +03:00
|
|
|
/* check AH/ESP integrity. */
|
|
|
|
if (so != NULL && ipsec4_in_reject_so(m, so)) {
|
|
|
|
ipsecstat.in_polvio++;
|
2003-09-12 13:55:22 +04:00
|
|
|
if ((n = m_copy(m, 0, M_COPYALL)) != NULL)
|
|
|
|
icmp_error(n, ICMP_UNREACH, ICMP_UNREACH_ADMIN_PROHIBIT,
|
|
|
|
0, 0);
|
1999-12-13 18:17:17 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif /*IPSEC*/
|
|
|
|
|
|
|
|
if ((n = m_copy(m, 0, M_COPYALL)) != NULL) {
|
|
|
|
if (inp && (inp->inp_flags & INP_CONTROLOPTS
|
|
|
|
|| so->so_options & SO_TIMESTAMP)) {
|
|
|
|
struct ip *ip = mtod(n, struct ip *);
|
|
|
|
ip_savecontrol(inp, &opts, ip, n);
|
|
|
|
}
|
|
|
|
|
|
|
|
m_adj(n, off);
|
|
|
|
if (sbappendaddr(&so->so_rcv, src, n,
|
|
|
|
opts) == 0) {
|
|
|
|
m_freem(n);
|
|
|
|
if (opts)
|
|
|
|
m_freem(opts);
|
2001-07-17 06:44:00 +04:00
|
|
|
udpstat.udps_fullsock++;
|
1999-12-13 18:17:17 +03:00
|
|
|
} else
|
|
|
|
sorwakeup(so);
|
|
|
|
}
|
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
static void
|
|
|
|
udp6_sendup(m, off, src, so)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off; /* offset of data portion */
|
|
|
|
struct sockaddr *src;
|
|
|
|
struct socket *so;
|
|
|
|
{
|
|
|
|
struct mbuf *opts = NULL;
|
|
|
|
struct mbuf *n;
|
|
|
|
struct in6pcb *in6p = NULL;
|
|
|
|
|
|
|
|
if (!so)
|
|
|
|
return;
|
|
|
|
if (so->so_proto->pr_domain->dom_family != AF_INET6)
|
|
|
|
return;
|
|
|
|
in6p = sotoin6pcb(so);
|
|
|
|
|
2003-08-15 07:42:00 +04:00
|
|
|
#if defined(IPSEC) || defined(FAST_IPSEC)
|
1999-12-13 18:17:17 +03:00
|
|
|
/* check AH/ESP integrity. */
|
|
|
|
if (so != NULL && ipsec6_in_reject_so(m, so)) {
|
|
|
|
ipsec6stat.in_polvio++;
|
2003-09-25 04:59:31 +04:00
|
|
|
if ((n = m_copy(m, 0, M_COPYALL)) != NULL)
|
2003-09-12 13:55:22 +04:00
|
|
|
icmp6_error(n, ICMP6_DST_UNREACH,
|
|
|
|
ICMP6_DST_UNREACH_ADMIN, 0);
|
1999-12-13 18:17:17 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif /*IPSEC*/
|
|
|
|
|
|
|
|
if ((n = m_copy(m, 0, M_COPYALL)) != NULL) {
|
|
|
|
if (in6p && (in6p->in6p_flags & IN6P_CONTROLOPTS
|
|
|
|
|| in6p->in6p_socket->so_options & SO_TIMESTAMP)) {
|
|
|
|
struct ip6_hdr *ip6 = mtod(n, struct ip6_hdr *);
|
|
|
|
ip6_savecontrol(in6p, &opts, ip6, n);
|
|
|
|
}
|
|
|
|
|
|
|
|
m_adj(n, off);
|
|
|
|
if (sbappendaddr(&so->so_rcv, src, n, opts) == 0) {
|
|
|
|
m_freem(n);
|
|
|
|
if (opts)
|
|
|
|
m_freem(opts);
|
|
|
|
udp6stat.udp6s_fullsock++;
|
|
|
|
} else
|
|
|
|
sorwakeup(so);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1999-12-13 18:17:17 +03:00
|
|
|
static int
|
|
|
|
udp4_realinput(src, dst, m, off)
|
|
|
|
struct sockaddr_in *src;
|
|
|
|
struct sockaddr_in *dst;
|
|
|
|
struct mbuf *m;
|
|
|
|
int off; /* offset of udphdr */
|
|
|
|
{
|
|
|
|
u_int16_t *sport, *dport;
|
|
|
|
int rcvcnt;
|
|
|
|
struct in_addr *src4, *dst4;
|
2003-09-04 13:16:57 +04:00
|
|
|
struct inpcb_hdr *inph;
|
1999-12-13 18:17:17 +03:00
|
|
|
struct inpcb *inp;
|
|
|
|
|
|
|
|
rcvcnt = 0;
|
|
|
|
off += sizeof(struct udphdr); /* now, offset of payload */
|
|
|
|
|
|
|
|
if (src->sin_family != AF_INET || dst->sin_family != AF_INET)
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
src4 = &src->sin_addr;
|
|
|
|
sport = &src->sin_port;
|
|
|
|
dst4 = &dst->sin_addr;
|
|
|
|
dport = &dst->sin_port;
|
|
|
|
|
2000-12-04 14:23:04 +03:00
|
|
|
if (IN_MULTICAST(dst4->s_addr) ||
|
1999-12-13 18:17:17 +03:00
|
|
|
in_broadcast(*dst4, m->m_pkthdr.rcvif)) {
|
|
|
|
/*
|
|
|
|
* Deliver a multicast or broadcast datagram to *all* sockets
|
|
|
|
* for which the local and remote addresses and ports match
|
|
|
|
* those of the incoming datagram. This allows more than
|
|
|
|
* one process to receive multi/broadcasts on the same port.
|
|
|
|
* (This really ought to be done for unicast datagrams as
|
|
|
|
* well, but that would cause problems with existing
|
|
|
|
* applications that open both address-specific sockets and
|
|
|
|
* a wildcard socket listening to the same port -- they would
|
|
|
|
* end up receiving duplicates of every unicast datagram.
|
|
|
|
* Those applications open the multiple sockets to overcome an
|
|
|
|
* inadequacy of the UDP socket interface, but for backwards
|
|
|
|
* compatibility we avoid the problem here rather than
|
|
|
|
* fixing the interface. Maybe 4.5BSD will remedy this?)
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2001-12-21 05:51:08 +03:00
|
|
|
* KAME note: traditionally we dropped udpiphdr from mbuf here.
|
2000-08-30 19:04:45 +04:00
|
|
|
* we need udpiphdr for IPsec processing so we do that later.
|
1999-12-13 18:17:17 +03:00
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* Locate pcb(s) for datagram.
|
|
|
|
*/
|
2003-09-04 13:16:57 +04:00
|
|
|
CIRCLEQ_FOREACH(inph, &udbtable.inpt_queue, inph_queue) {
|
|
|
|
inp = (struct inpcb *)inph;
|
|
|
|
if (inp->inp_af != AF_INET)
|
|
|
|
continue;
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
if (inp->inp_lport != *dport)
|
|
|
|
continue;
|
|
|
|
if (!in_nullhost(inp->inp_laddr)) {
|
|
|
|
if (!in_hosteq(inp->inp_laddr, *dst4))
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (!in_nullhost(inp->inp_faddr)) {
|
|
|
|
if (!in_hosteq(inp->inp_faddr, *src4) ||
|
|
|
|
inp->inp_fport != *sport)
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
udp4_sendup(m, off, (struct sockaddr *)src,
|
|
|
|
inp->inp_socket);
|
|
|
|
rcvcnt++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Don't look for additional matches if this one does
|
|
|
|
* not have either the SO_REUSEPORT or SO_REUSEADDR
|
|
|
|
* socket options set. This heuristic avoids searching
|
|
|
|
* through all pcbs in the common case of a non-shared
|
|
|
|
* port. It assumes that an application will never
|
|
|
|
* clear these options after setting them.
|
|
|
|
*/
|
|
|
|
if ((inp->inp_socket->so_options &
|
|
|
|
(SO_REUSEPORT|SO_REUSEADDR)) == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Locate pcb for datagram.
|
|
|
|
*/
|
|
|
|
inp = in_pcblookup_connect(&udbtable, *src4, *sport, *dst4, *dport);
|
|
|
|
if (inp == 0) {
|
|
|
|
++udpstat.udps_pcbhashmiss;
|
|
|
|
inp = in_pcblookup_bind(&udbtable, *dst4, *dport);
|
2001-07-25 10:05:16 +04:00
|
|
|
if (inp == 0)
|
1999-12-13 18:17:17 +03:00
|
|
|
return rcvcnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
udp4_sendup(m, off, (struct sockaddr *)src, inp->inp_socket);
|
|
|
|
rcvcnt++;
|
|
|
|
}
|
|
|
|
|
|
|
|
bad:
|
|
|
|
return rcvcnt;
|
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
static int
|
|
|
|
udp6_realinput(af, src, dst, m, off)
|
|
|
|
int af; /* af on packet */
|
|
|
|
struct sockaddr_in6 *src;
|
|
|
|
struct sockaddr_in6 *dst;
|
|
|
|
struct mbuf *m;
|
|
|
|
int off; /* offset of udphdr */
|
|
|
|
{
|
2001-06-28 03:40:50 +04:00
|
|
|
u_int16_t sport, dport;
|
1999-12-13 18:17:17 +03:00
|
|
|
int rcvcnt;
|
2001-06-28 03:40:50 +04:00
|
|
|
struct in6_addr src6, dst6;
|
|
|
|
const struct in_addr *dst4;
|
2003-09-04 13:16:57 +04:00
|
|
|
struct inpcb_hdr *inph;
|
1999-12-13 18:17:17 +03:00
|
|
|
struct in6pcb *in6p;
|
|
|
|
|
|
|
|
rcvcnt = 0;
|
|
|
|
off += sizeof(struct udphdr); /* now, offset of payload */
|
|
|
|
|
|
|
|
if (af != AF_INET && af != AF_INET6)
|
|
|
|
goto bad;
|
|
|
|
if (src->sin6_family != AF_INET6 || dst->sin6_family != AF_INET6)
|
|
|
|
goto bad;
|
|
|
|
|
2001-06-28 03:40:50 +04:00
|
|
|
in6_embedscope(&src6, src, NULL, NULL);
|
|
|
|
sport = src->sin6_port;
|
|
|
|
in6_embedscope(&dst6, dst, NULL, NULL);
|
|
|
|
dport = dst->sin6_port;
|
2001-11-02 05:37:50 +03:00
|
|
|
dst4 = (struct in_addr *)&dst->sin6_addr.s6_addr[12];
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2001-06-28 03:40:50 +04:00
|
|
|
if (IN6_IS_ADDR_MULTICAST(&dst6) ||
|
|
|
|
(af == AF_INET && IN_MULTICAST(dst4->s_addr))) {
|
1999-12-13 18:17:17 +03:00
|
|
|
/*
|
|
|
|
* Deliver a multicast or broadcast datagram to *all* sockets
|
|
|
|
* for which the local and remote addresses and ports match
|
|
|
|
* those of the incoming datagram. This allows more than
|
|
|
|
* one process to receive multi/broadcasts on the same port.
|
|
|
|
* (This really ought to be done for unicast datagrams as
|
|
|
|
* well, but that would cause problems with existing
|
|
|
|
* applications that open both address-specific sockets and
|
|
|
|
* a wildcard socket listening to the same port -- they would
|
|
|
|
* end up receiving duplicates of every unicast datagram.
|
|
|
|
* Those applications open the multiple sockets to overcome an
|
|
|
|
* inadequacy of the UDP socket interface, but for backwards
|
|
|
|
* compatibility we avoid the problem here rather than
|
|
|
|
* fixing the interface. Maybe 4.5BSD will remedy this?)
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2001-12-21 05:51:08 +03:00
|
|
|
* KAME note: traditionally we dropped udpiphdr from mbuf here.
|
2000-08-30 19:04:45 +04:00
|
|
|
* we need udpiphdr for IPsec processing so we do that later.
|
1999-12-13 18:17:17 +03:00
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* Locate pcb(s) for datagram.
|
|
|
|
*/
|
2003-09-04 13:16:57 +04:00
|
|
|
CIRCLEQ_FOREACH(inph, &udbtable.inpt_queue, inph_queue) {
|
|
|
|
in6p = (struct in6pcb *)inph;
|
|
|
|
if (in6p->in6p_af != AF_INET6)
|
|
|
|
continue;
|
|
|
|
|
2001-06-28 03:40:50 +04:00
|
|
|
if (in6p->in6p_lport != dport)
|
1999-12-13 18:17:17 +03:00
|
|
|
continue;
|
|
|
|
if (!IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_laddr)) {
|
2001-11-07 09:30:50 +03:00
|
|
|
if (!IN6_ARE_ADDR_EQUAL(&in6p->in6p_laddr, &dst6))
|
1999-12-13 18:17:17 +03:00
|
|
|
continue;
|
2001-12-21 05:51:08 +03:00
|
|
|
} else {
|
2001-06-28 03:40:50 +04:00
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&dst6) &&
|
2001-10-15 13:51:15 +04:00
|
|
|
(in6p->in6p_flags & IN6P_IPV6_V6ONLY))
|
2000-01-06 09:41:18 +03:00
|
|
|
continue;
|
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
if (!IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_faddr)) {
|
2001-06-28 03:40:50 +04:00
|
|
|
if (!IN6_ARE_ADDR_EQUAL(&in6p->in6p_faddr,
|
|
|
|
&src6) || in6p->in6p_fport != sport)
|
1999-12-13 18:17:17 +03:00
|
|
|
continue;
|
2001-12-21 05:51:08 +03:00
|
|
|
} else {
|
2001-06-28 03:40:50 +04:00
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&src6) &&
|
2001-10-15 13:51:15 +04:00
|
|
|
(in6p->in6p_flags & IN6P_IPV6_V6ONLY))
|
2000-01-06 09:41:18 +03:00
|
|
|
continue;
|
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
udp6_sendup(m, off, (struct sockaddr *)src,
|
|
|
|
in6p->in6p_socket);
|
|
|
|
rcvcnt++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Don't look for additional matches if this one does
|
|
|
|
* not have either the SO_REUSEPORT or SO_REUSEADDR
|
|
|
|
* socket options set. This heuristic avoids searching
|
|
|
|
* through all pcbs in the common case of a non-shared
|
|
|
|
* port. It assumes that an application will never
|
|
|
|
* clear these options after setting them.
|
|
|
|
*/
|
|
|
|
if ((in6p->in6p_socket->so_options &
|
|
|
|
(SO_REUSEPORT|SO_REUSEADDR)) == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Locate pcb for datagram.
|
|
|
|
*/
|
2003-09-04 13:16:57 +04:00
|
|
|
in6p = in6_pcblookup_connect(&udbtable, &src6, sport,
|
2001-06-28 03:40:50 +04:00
|
|
|
&dst6, dport, 0);
|
1999-12-13 18:17:17 +03:00
|
|
|
if (in6p == 0) {
|
|
|
|
++udpstat.udps_pcbhashmiss;
|
2003-09-04 13:16:57 +04:00
|
|
|
in6p = in6_pcblookup_bind(&udbtable, &dst6, dport, 0);
|
2001-07-25 10:05:16 +04:00
|
|
|
if (in6p == 0)
|
1999-12-13 18:17:17 +03:00
|
|
|
return rcvcnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
udp6_sendup(m, off, (struct sockaddr *)src, in6p->in6p_socket);
|
|
|
|
rcvcnt++;
|
|
|
|
}
|
|
|
|
|
|
|
|
bad:
|
|
|
|
return rcvcnt;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2000-10-17 07:06:42 +04:00
|
|
|
#ifdef INET
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* Notify a udp user of an asynchronous error;
|
|
|
|
* just wake up so that he can collect error status.
|
|
|
|
*/
|
1994-01-09 02:17:18 +03:00
|
|
|
static void
|
1993-03-21 12:45:37 +03:00
|
|
|
udp_notify(inp, errno)
|
2000-03-30 16:51:13 +04:00
|
|
|
struct inpcb *inp;
|
1994-01-09 02:17:18 +03:00
|
|
|
int errno;
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
1996-09-09 18:51:07 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
inp->inp_socket->so_error = errno;
|
|
|
|
sorwakeup(inp->inp_socket);
|
|
|
|
sowwakeup(inp->inp_socket);
|
|
|
|
}
|
|
|
|
|
1996-02-14 02:40:59 +03:00
|
|
|
void *
|
|
|
|
udp_ctlinput(cmd, sa, v)
|
1993-03-21 12:45:37 +03:00
|
|
|
int cmd;
|
|
|
|
struct sockaddr *sa;
|
1996-02-14 02:40:59 +03:00
|
|
|
void *v;
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct ip *ip = v;
|
|
|
|
struct udphdr *uh;
|
1995-06-12 04:46:47 +04:00
|
|
|
void (*notify) __P((struct inpcb *, int)) = udp_notify;
|
1995-06-12 10:48:54 +04:00
|
|
|
int errno;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
if (sa->sa_family != AF_INET
|
|
|
|
|| sa->sa_len != sizeof(struct sockaddr_in))
|
1999-08-09 14:55:29 +04:00
|
|
|
return NULL;
|
1995-06-12 10:46:34 +04:00
|
|
|
if ((unsigned)cmd >= PRC_NCMDS)
|
1996-02-14 02:40:59 +03:00
|
|
|
return NULL;
|
1995-06-12 10:46:34 +04:00
|
|
|
errno = inetctlerrmap[cmd];
|
1995-06-12 04:46:47 +04:00
|
|
|
if (PRC_IS_REDIRECT(cmd))
|
1995-06-12 10:24:21 +04:00
|
|
|
notify = in_rtchange, ip = 0;
|
1995-06-12 04:46:47 +04:00
|
|
|
else if (cmd == PRC_HOSTDEAD)
|
1995-06-12 10:24:21 +04:00
|
|
|
ip = 0;
|
1995-06-26 12:46:16 +04:00
|
|
|
else if (errno == 0)
|
1996-02-14 02:40:59 +03:00
|
|
|
return NULL;
|
1995-06-12 10:24:21 +04:00
|
|
|
if (ip) {
|
1993-03-21 12:45:37 +03:00
|
|
|
uh = (struct udphdr *)((caddr_t)ip + (ip->ip_hl << 2));
|
1996-09-09 18:51:07 +04:00
|
|
|
in_pcbnotify(&udbtable, satosin(sa)->sin_addr, uh->uh_dport,
|
|
|
|
ip->ip_src, uh->uh_sport, errno, notify);
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
/* XXX mapped address case */
|
1995-06-12 10:24:21 +04:00
|
|
|
} else
|
1996-09-09 18:51:07 +04:00
|
|
|
in_pcbnotifyall(&udbtable, satosin(sa)->sin_addr, errno,
|
|
|
|
notify);
|
1996-02-14 02:40:59 +03:00
|
|
|
return NULL;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
1994-01-09 02:17:18 +03:00
|
|
|
int
|
1996-02-14 02:40:59 +03:00
|
|
|
#if __STDC__
|
|
|
|
udp_output(struct mbuf *m, ...)
|
|
|
|
#else
|
|
|
|
udp_output(m, va_alist)
|
|
|
|
struct mbuf *m;
|
|
|
|
va_dcl
|
|
|
|
#endif
|
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct inpcb *inp;
|
|
|
|
struct udpiphdr *ui;
|
|
|
|
int len = m->m_pkthdr.len;
|
1996-05-23 20:22:32 +04:00
|
|
|
int error = 0;
|
1996-02-14 02:40:59 +03:00
|
|
|
va_list ap;
|
|
|
|
|
2003-02-26 09:31:08 +03:00
|
|
|
MCLAIM(m, &udp_tx_mowner);
|
1996-02-14 02:40:59 +03:00
|
|
|
va_start(ap, m);
|
1996-05-23 20:22:32 +04:00
|
|
|
inp = va_arg(ap, struct inpcb *);
|
1996-02-14 02:40:59 +03:00
|
|
|
va_end(ap);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Calculate data length and get a mbuf
|
|
|
|
* for UDP and IP headers.
|
|
|
|
*/
|
1994-05-13 10:02:48 +04:00
|
|
|
M_PREPEND(m, sizeof(struct udpiphdr), M_DONTWAIT);
|
|
|
|
if (m == 0) {
|
|
|
|
error = ENOBUFS;
|
|
|
|
goto release;
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1996-10-25 10:35:16 +04:00
|
|
|
/*
|
|
|
|
* Compute the packet length of the IP header, and
|
|
|
|
* punt if the length looks bogus.
|
|
|
|
*/
|
2002-08-14 04:23:27 +04:00
|
|
|
if (len + sizeof(struct udpiphdr) > IP_MAXPACKET) {
|
1996-10-25 10:35:16 +04:00
|
|
|
error = EMSGSIZE;
|
|
|
|
goto release;
|
|
|
|
}
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* Fill in mbuf with extended UDP header
|
|
|
|
* and addresses and length put into network format.
|
|
|
|
*/
|
|
|
|
ui = mtod(m, struct udpiphdr *);
|
|
|
|
ui->ui_pr = IPPROTO_UDP;
|
|
|
|
ui->ui_src = inp->inp_laddr;
|
|
|
|
ui->ui_dst = inp->inp_faddr;
|
|
|
|
ui->ui_sport = inp->inp_lport;
|
|
|
|
ui->ui_dport = inp->inp_fport;
|
2001-06-02 20:17:09 +04:00
|
|
|
ui->ui_ulen = htons((u_int16_t)len + sizeof(struct udphdr));
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
/*
|
2001-06-02 20:17:09 +04:00
|
|
|
* Set up checksum and output datagram.
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
|
|
|
if (udpcksum) {
|
2001-06-02 20:17:09 +04:00
|
|
|
/*
|
|
|
|
* XXX Cache pseudo-header checksum part for
|
|
|
|
* XXX "connected" UDP sockets.
|
|
|
|
*/
|
|
|
|
ui->ui_sum = in_cksum_phdr(ui->ui_src.s_addr,
|
|
|
|
ui->ui_dst.s_addr, htons((u_int16_t)len +
|
|
|
|
sizeof(struct udphdr) + IPPROTO_UDP));
|
|
|
|
m->m_pkthdr.csum_flags = M_CSUM_UDPv4;
|
|
|
|
m->m_pkthdr.csum_data = offsetof(struct udphdr, uh_sum);
|
|
|
|
} else
|
|
|
|
ui->ui_sum = 0;
|
2002-08-14 04:23:27 +04:00
|
|
|
((struct ip *)ui)->ip_len = htons(sizeof (struct udpiphdr) + len);
|
1993-03-21 12:45:37 +03:00
|
|
|
((struct ip *)ui)->ip_ttl = inp->inp_ip.ip_ttl; /* XXX */
|
|
|
|
((struct ip *)ui)->ip_tos = inp->inp_ip.ip_tos; /* XXX */
|
|
|
|
udpstat.udps_opackets++;
|
1999-07-01 12:12:45 +04:00
|
|
|
|
1996-05-23 20:22:32 +04:00
|
|
|
return (ip_output(m, inp->inp_options, &inp->inp_route,
|
1994-02-10 21:46:04 +03:00
|
|
|
inp->inp_socket->so_options & (SO_DONTROUTE | SO_BROADCAST),
|
2003-08-23 01:53:01 +04:00
|
|
|
inp->inp_moptions, inp->inp_socket));
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
release:
|
|
|
|
m_freem(m);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1997-07-29 02:19:53 +04:00
|
|
|
int udp_sendspace = 9216; /* really max datagram size */
|
|
|
|
int udp_recvspace = 40 * (1024 + sizeof(struct sockaddr_in));
|
1993-03-21 12:45:37 +03:00
|
|
|
/* 40 1K datagrams */
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
1994-01-09 02:17:18 +03:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
udp_usrreq(so, req, m, nam, control, p)
|
1993-03-21 12:45:37 +03:00
|
|
|
struct socket *so;
|
|
|
|
int req;
|
1996-05-23 20:22:32 +04:00
|
|
|
struct mbuf *m, *nam, *control;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct inpcb *inp;
|
1993-03-21 12:45:37 +03:00
|
|
|
int s;
|
2000-03-30 16:51:13 +04:00
|
|
|
int error = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
if (req == PRU_CONTROL)
|
1996-05-23 20:22:32 +04:00
|
|
|
return (in_control(so, (long)m, (caddr_t)nam,
|
1996-05-22 17:54:55 +04:00
|
|
|
(struct ifnet *)control, p));
|
1996-05-23 20:22:32 +04:00
|
|
|
|
2000-02-03 02:28:08 +03:00
|
|
|
if (req == PRU_PURGEIF) {
|
2001-07-03 12:06:19 +04:00
|
|
|
in_pcbpurgeif0(&udbtable, (struct ifnet *)control);
|
2000-02-03 02:28:08 +03:00
|
|
|
in_purgeif((struct ifnet *)control);
|
|
|
|
in_pcbpurgeif(&udbtable, (struct ifnet *)control);
|
2000-02-02 01:52:04 +03:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1996-05-23 20:22:32 +04:00
|
|
|
s = splsoftnet();
|
|
|
|
inp = sotoinpcb(so);
|
1996-05-23 21:03:27 +04:00
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (req != PRU_SEND && req != PRU_SENDOOB && control)
|
|
|
|
panic("udp_usrreq: unexpected control mbuf");
|
|
|
|
#endif
|
1996-05-23 20:22:32 +04:00
|
|
|
if (inp == 0 && req != PRU_ATTACH) {
|
1993-03-21 12:45:37 +03:00
|
|
|
error = EINVAL;
|
|
|
|
goto release;
|
|
|
|
}
|
1996-05-23 20:22:32 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* Note: need to block udp_input while changing
|
|
|
|
* the udp pcb queue and/or pcb addresses.
|
|
|
|
*/
|
|
|
|
switch (req) {
|
|
|
|
|
|
|
|
case PRU_ATTACH:
|
1996-05-23 20:22:32 +04:00
|
|
|
if (inp != 0) {
|
|
|
|
error = EISCONN;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
}
|
2003-02-26 09:31:08 +03:00
|
|
|
#ifdef MBUFTRACE
|
|
|
|
so->so_mowner = &udp_mowner;
|
|
|
|
so->so_rcv.sb_mowner = &udp_rx_mowner;
|
|
|
|
so->so_snd.sb_mowner = &udp_tx_mowner;
|
|
|
|
#endif
|
1996-05-23 20:22:32 +04:00
|
|
|
if (so->so_snd.sb_hiwat == 0 || so->so_rcv.sb_hiwat == 0) {
|
|
|
|
error = soreserve(so, udp_sendspace, udp_recvspace);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
}
|
1995-06-12 04:46:47 +04:00
|
|
|
error = in_pcballoc(so, &udbtable);
|
1993-03-21 12:45:37 +03:00
|
|
|
if (error)
|
|
|
|
break;
|
1996-05-23 20:22:32 +04:00
|
|
|
inp = sotoinpcb(so);
|
|
|
|
inp->inp_ip.ip_ttl = ip_defttl;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_DETACH:
|
1996-05-23 20:22:32 +04:00
|
|
|
in_pcbdetach(inp);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_BIND:
|
1996-05-23 20:22:32 +04:00
|
|
|
error = in_pcbbind(inp, nam, p);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_LISTEN:
|
|
|
|
error = EOPNOTSUPP;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_CONNECT:
|
1996-05-23 20:22:32 +04:00
|
|
|
error = in_pcbconnect(inp, nam);
|
|
|
|
if (error)
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
1996-05-23 20:22:32 +04:00
|
|
|
soisconnected(so);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_CONNECT2:
|
|
|
|
error = EOPNOTSUPP;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_DISCONNECT:
|
1996-05-23 20:22:32 +04:00
|
|
|
/*soisdisconnected(so);*/
|
|
|
|
so->so_state &= ~SS_ISCONNECTED; /* XXX */
|
1993-03-21 12:45:37 +03:00
|
|
|
in_pcbdisconnect(inp);
|
1996-09-09 18:51:07 +04:00
|
|
|
inp->inp_laddr = zeroin_addr; /* XXX */
|
1996-09-15 22:11:06 +04:00
|
|
|
in_pcbstate(inp, INP_BOUND); /* XXX */
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SHUTDOWN:
|
|
|
|
socantsendmore(so);
|
|
|
|
break;
|
|
|
|
|
1996-05-23 20:22:32 +04:00
|
|
|
case PRU_RCVD:
|
|
|
|
error = EOPNOTSUPP;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
1996-05-23 20:22:32 +04:00
|
|
|
case PRU_SEND:
|
1996-05-23 21:03:27 +04:00
|
|
|
if (control && control->m_len) {
|
|
|
|
m_freem(control);
|
|
|
|
m_freem(m);
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
1996-05-23 20:22:32 +04:00
|
|
|
{
|
1996-09-15 22:11:06 +04:00
|
|
|
struct in_addr laddr; /* XXX */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1996-05-23 20:22:32 +04:00
|
|
|
if (nam) {
|
1996-09-15 22:11:06 +04:00
|
|
|
laddr = inp->inp_laddr; /* XXX */
|
1996-05-23 20:22:32 +04:00
|
|
|
if ((so->so_state & SS_ISCONNECTED) != 0) {
|
|
|
|
error = EISCONN;
|
1996-05-23 21:03:27 +04:00
|
|
|
goto die;
|
1996-05-23 20:22:32 +04:00
|
|
|
}
|
|
|
|
error = in_pcbconnect(inp, nam);
|
2003-06-15 06:49:32 +04:00
|
|
|
if (error)
|
|
|
|
goto die;
|
1996-05-23 20:22:32 +04:00
|
|
|
} else {
|
|
|
|
if ((so->so_state & SS_ISCONNECTED) == 0) {
|
|
|
|
error = ENOTCONN;
|
1996-05-23 21:03:27 +04:00
|
|
|
goto die;
|
1996-05-23 20:22:32 +04:00
|
|
|
}
|
|
|
|
}
|
1996-05-23 21:05:45 +04:00
|
|
|
error = udp_output(m, inp);
|
2003-06-15 06:49:32 +04:00
|
|
|
m = NULL;
|
1996-05-23 20:22:32 +04:00
|
|
|
if (nam) {
|
|
|
|
in_pcbdisconnect(inp);
|
1996-09-15 22:11:06 +04:00
|
|
|
inp->inp_laddr = laddr; /* XXX */
|
|
|
|
in_pcbstate(inp, INP_BOUND); /* XXX */
|
1996-05-23 20:22:32 +04:00
|
|
|
}
|
2003-06-15 06:49:32 +04:00
|
|
|
die:
|
|
|
|
if (m)
|
|
|
|
m_freem(m);
|
1996-05-23 20:22:32 +04:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_SENSE:
|
|
|
|
/*
|
|
|
|
* stat: don't bother with a blocksize.
|
|
|
|
*/
|
1996-05-23 20:22:32 +04:00
|
|
|
splx(s);
|
1993-03-21 12:45:37 +03:00
|
|
|
return (0);
|
|
|
|
|
1996-05-23 20:22:32 +04:00
|
|
|
case PRU_RCVOOB:
|
|
|
|
error = EOPNOTSUPP;
|
|
|
|
break;
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
case PRU_SENDOOB:
|
1996-05-23 21:03:27 +04:00
|
|
|
m_freem(control);
|
1996-05-23 20:22:32 +04:00
|
|
|
m_freem(m);
|
1993-03-21 12:45:37 +03:00
|
|
|
error = EOPNOTSUPP;
|
|
|
|
break;
|
|
|
|
|
1996-05-23 20:22:32 +04:00
|
|
|
case PRU_SOCKADDR:
|
|
|
|
in_setsockaddr(inp, nam);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRU_PEERADDR:
|
|
|
|
in_setpeeraddr(inp, nam);
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
default:
|
|
|
|
panic("udp_usrreq");
|
|
|
|
}
|
|
|
|
|
|
|
|
release:
|
|
|
|
splx(s);
|
1996-05-23 20:22:32 +04:00
|
|
|
return (error);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Sysctl for udp variables.
|
|
|
|
*/
|
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_inet_udp_setup, "sysctl net.inet.udp subtree setup")
|
1994-05-13 10:02:48 +04: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
|
|
|
|
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, "inet", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET, 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, "udp", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET, IPPROTO_UDP, CTL_EOL);
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
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_INT, "checksum", NULL,
|
|
|
|
NULL, 0, &udpcksum, 0,
|
|
|
|
CTL_NET, PF_INET, IPPROTO_UDP, UDPCTL_CHECKSUM,
|
|
|
|
CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
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_INT, "sendspace", NULL,
|
|
|
|
NULL, 0, &udp_sendspace, 0,
|
|
|
|
CTL_NET, PF_INET, IPPROTO_UDP, UDPCTL_SENDSPACE,
|
|
|
|
CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
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_INT, "recvspace", NULL,
|
|
|
|
NULL, 0, &udp_recvspace, 0,
|
|
|
|
CTL_NET, PF_INET, IPPROTO_UDP, UDPCTL_RECVSPACE,
|
|
|
|
CTL_EOL);
|
1994-05-13 10:02:48 +04:00
|
|
|
}
|
2000-10-17 07:06:42 +04:00
|
|
|
#endif
|