1996-07-10 19:44:30 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 1988, 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.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* 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.
|
|
|
|
*
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1996-07-10 19:44:30 +00:00
|
|
|
*/
|
|
|
|
|
1998-01-08 23:42:31 +00:00
|
|
|
#include "opt_inet.h"
|
1998-05-25 10:37:48 +00:00
|
|
|
#include "opt_ipfw.h"
|
1998-06-12 02:48:47 +00:00
|
|
|
#include "opt_ipdivert.h"
|
1999-12-22 19:13:38 +00:00
|
|
|
#include "opt_ipsec.h"
|
1998-01-08 23:42:31 +00:00
|
|
|
|
|
|
|
#ifndef INET
|
1998-05-15 20:11:40 +00:00
|
|
|
#error "IPDIVERT requires INET."
|
1998-01-08 23:42:31 +00:00
|
|
|
#endif
|
|
|
|
|
1996-07-10 19:44:30 +00:00
|
|
|
#include <sys/param.h>
|
2000-08-03 14:09:52 +00:00
|
|
|
#include <sys/kernel.h>
|
1996-07-10 19:44:30 +00:00
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
2001-11-08 02:13:18 +00:00
|
|
|
#include <sys/proc.h>
|
1996-07-10 19:44:30 +00:00
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/socketvar.h>
|
2000-08-03 14:09:52 +00:00
|
|
|
#include <sys/sysctl.h>
|
1996-07-10 19:44:30 +00:00
|
|
|
#include <sys/systm.h>
|
1998-03-28 10:18:26 +00:00
|
|
|
|
2002-03-20 05:48:55 +00:00
|
|
|
#include <vm/uma.h>
|
1996-07-10 19:44:30 +00:00
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_systm.h>
|
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/in_pcb.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet/ip_var.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Divert sockets
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate enough space to hold a full IP packet
|
|
|
|
*/
|
|
|
|
#define DIVSNDQ (65536 + 100)
|
|
|
|
#define DIVRCVQ (65536 + 100)
|
|
|
|
|
|
|
|
/*
|
1999-12-06 00:43:07 +00:00
|
|
|
* A 16 bit cookie is passed to and from the user process.
|
|
|
|
* The user process can send it back to help the caller know
|
|
|
|
* something about where the packet originally came from.
|
1998-05-25 10:37:48 +00:00
|
|
|
*
|
1999-12-06 00:43:07 +00:00
|
|
|
* In the case of ipfw, then the cookie is the rule that sent
|
1998-06-06 19:39:10 +00:00
|
|
|
* us here. On reinjection is is the rule after which processing
|
1998-05-25 10:37:48 +00:00
|
|
|
* should continue. Leaving it the same will make processing start
|
|
|
|
* at the rule number after that which sent it here. Setting it to
|
|
|
|
* 0 will restart processing at the beginning.
|
1999-12-06 00:43:07 +00:00
|
|
|
*
|
|
|
|
* For divert_packet(), ip_divert_cookie is an input value only.
|
|
|
|
* For div_output(), ip_divert_cookie is an output value only.
|
1996-07-10 19:44:30 +00:00
|
|
|
*/
|
1998-06-06 20:45:28 +00:00
|
|
|
u_int16_t ip_divert_cookie;
|
1996-07-10 19:44:30 +00:00
|
|
|
|
|
|
|
/* Internal variables */
|
|
|
|
static struct inpcbhead divcb;
|
|
|
|
static struct inpcbinfo divcbinfo;
|
|
|
|
|
|
|
|
static u_long div_sendspace = DIVSNDQ; /* XXX sysctl ? */
|
|
|
|
static u_long div_recvspace = DIVRCVQ; /* XXX sysctl ? */
|
|
|
|
|
|
|
|
/* Optimization: have this preinitialized */
|
|
|
|
static struct sockaddr_in divsrc = { sizeof(divsrc), AF_INET };
|
|
|
|
|
|
|
|
/* Internal functions */
|
|
|
|
static int div_output(struct socket *so,
|
1997-09-13 15:40:55 +00:00
|
|
|
struct mbuf *m, struct sockaddr *addr, struct mbuf *control);
|
1996-07-10 19:44:30 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize divert connection block queue.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
div_init(void)
|
|
|
|
{
|
|
|
|
LIST_INIT(&divcb);
|
|
|
|
divcbinfo.listhead = &divcb;
|
|
|
|
/*
|
|
|
|
* XXX We don't use the hash list for divert IP, but it's easier
|
|
|
|
* to allocate a one entry hash list than it is to check all
|
|
|
|
* over the place for hashbase == NULL.
|
|
|
|
*/
|
1997-03-03 09:23:37 +00:00
|
|
|
divcbinfo.hashbase = hashinit(1, M_PCB, &divcbinfo.hashmask);
|
Improved connection establishment performance by doing local port lookups via
a hashed port list. In the new scheme, in_pcblookup() goes away and is
replaced by a new routine, in_pcblookup_local() for doing the local port
check. Note that this implementation is space inefficient in that the PCB
struct is now too large to fit into 128 bytes. I might deal with this in the
future by using the new zone allocator, but I wanted these changes to be
extensively tested in their current form first.
Also:
1) Fixed off-by-one errors in the port lookup loops in in_pcbbind().
2) Got rid of some unneeded rehashing. Adding a new routine, in_pcbinshash()
to do the initialial hash insertion.
3) Renamed in_pcblookuphash() to in_pcblookup_hash() for easier readability.
4) Added a new routine, in_pcbremlists() to remove the PCB from the various
hash lists.
5) Added/deleted comments where appropriate.
6) Removed unnecessary splnet() locking. In general, the PCB functions should
be called at splnet()...there are unfortunately a few exceptions, however.
7) Reorganized a few structs for better cache line behavior.
8) Killed my TCP_ACK_HACK kludge. It may come back in a different form in
the future, however.
These changes have been tested on wcarchive for more than a month. In tests
done here, connection establishment overhead is reduced by more than 50
times, thus getting rid of one of the major networking scalability problems.
Still to do: make tcp_fastimo/tcp_slowtimo scale well for systems with a
large number of connections. tcp_fastimo is easy; tcp_slowtimo is difficult.
WARNING: Anything that knows about inpcb and tcpcb structs will have to be
recompiled; at the very least, this includes netstat(1).
1998-01-27 09:15:13 +00:00
|
|
|
divcbinfo.porthashbase = hashinit(1, M_PCB, &divcbinfo.porthashmask);
|
2002-03-20 05:48:55 +00:00
|
|
|
divcbinfo.ipi_zone = uma_zcreate("divcb", sizeof(struct inpcb),
|
|
|
|
NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
|
|
|
|
uma_zone_set_max(divcbinfo.ipi_zone, maxsockets);
|
1996-07-10 19:44:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
1999-12-06 00:43:07 +00:00
|
|
|
* IPPROTO_DIVERT is not a real IP protocol; don't allow any packets
|
|
|
|
* with that protocol number to enter the system from the outside.
|
1996-07-10 19:44:30 +00:00
|
|
|
*/
|
|
|
|
void
|
2001-09-03 20:03:55 +00:00
|
|
|
div_input(struct mbuf *m, int off)
|
1999-12-06 00:43:07 +00:00
|
|
|
{
|
|
|
|
ipstat.ips_noproto++;
|
|
|
|
m_freem(m);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Divert a packet by passing it up to the divert socket at port 'port'.
|
|
|
|
*
|
|
|
|
* Setup generic address and protocol structures for div_input routine,
|
|
|
|
* then pass them along with mbuf chain.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
divert_packet(struct mbuf *m, int incoming, int port)
|
1996-07-10 19:44:30 +00:00
|
|
|
{
|
1997-06-02 05:02:37 +00:00
|
|
|
struct ip *ip;
|
|
|
|
struct inpcb *inp;
|
|
|
|
struct socket *sa;
|
1999-12-06 00:43:07 +00:00
|
|
|
u_int16_t nport;
|
1996-07-10 19:44:30 +00:00
|
|
|
|
|
|
|
/* Sanity check */
|
2001-12-10 08:09:49 +00:00
|
|
|
KASSERT(port != 0, ("%s: port=0", __func__));
|
1999-12-06 00:43:07 +00:00
|
|
|
|
|
|
|
/* Record and reset divert cookie */
|
|
|
|
divsrc.sin_port = ip_divert_cookie;
|
|
|
|
ip_divert_cookie = 0;
|
1997-06-02 05:02:37 +00:00
|
|
|
|
|
|
|
/* Assure header */
|
|
|
|
if (m->m_len < sizeof(struct ip) &&
|
|
|
|
(m = m_pullup(m, sizeof(struct ip))) == 0) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
ip = mtod(m, struct ip *);
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1998-07-06 09:06:58 +00:00
|
|
|
/*
|
1999-12-06 00:43:07 +00:00
|
|
|
* Record receive interface address, if any.
|
1998-07-06 09:06:58 +00:00
|
|
|
* But only for incoming packets.
|
|
|
|
*/
|
1996-07-10 19:44:30 +00:00
|
|
|
divsrc.sin_addr.s_addr = 0;
|
1999-12-06 00:43:07 +00:00
|
|
|
if (incoming) {
|
1996-07-10 19:44:30 +00:00
|
|
|
struct ifaddr *ifa;
|
|
|
|
|
1997-06-02 05:02:37 +00:00
|
|
|
/* Sanity check */
|
2001-12-10 08:09:49 +00:00
|
|
|
KASSERT((m->m_flags & M_PKTHDR), ("%s: !PKTHDR", __func__));
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1998-05-25 08:44:31 +00:00
|
|
|
/* Find IP address for receive interface */
|
2001-02-04 13:13:25 +00:00
|
|
|
TAILQ_FOREACH(ifa, &m->m_pkthdr.rcvif->if_addrhead, ifa_link) {
|
1996-07-10 19:44:30 +00:00
|
|
|
if (ifa->ifa_addr == NULL)
|
|
|
|
continue;
|
|
|
|
if (ifa->ifa_addr->sa_family != AF_INET)
|
|
|
|
continue;
|
|
|
|
divsrc.sin_addr =
|
|
|
|
((struct sockaddr_in *) ifa->ifa_addr)->sin_addr;
|
|
|
|
break;
|
|
|
|
}
|
1998-06-12 01:54:29 +00:00
|
|
|
}
|
1998-07-06 09:06:58 +00:00
|
|
|
/*
|
|
|
|
* Record the incoming interface name whenever we have one.
|
|
|
|
*/
|
1998-12-04 22:54:57 +00:00
|
|
|
bzero(&divsrc.sin_zero, sizeof(divsrc.sin_zero));
|
1998-06-12 01:54:29 +00:00
|
|
|
if (m->m_pkthdr.rcvif) {
|
1998-05-25 08:44:31 +00:00
|
|
|
/*
|
|
|
|
* Hide the actual interface name in there in the
|
|
|
|
* sin_zero array. XXX This needs to be moved to a
|
|
|
|
* different sockaddr type for divert, e.g.
|
|
|
|
* sockaddr_div with multiple fields like
|
|
|
|
* sockaddr_dl. Presently we have only 7 bytes
|
|
|
|
* but that will do for now as most interfaces
|
|
|
|
* are 4 or less + 2 or less bytes for unit.
|
|
|
|
* There is probably a faster way of doing this,
|
|
|
|
* possibly taking it from the sockaddr_dl on the iface.
|
|
|
|
* This solves the problem of a P2P link and a LAN interface
|
|
|
|
* having the same address, which can result in the wrong
|
|
|
|
* interface being assigned to the packet when fed back
|
|
|
|
* into the divert socket. Theoretically if the daemon saves
|
|
|
|
* and re-uses the sockaddr_in as suggested in the man pages,
|
|
|
|
* this iface name will come along for the ride.
|
|
|
|
* (see div_output for the other half of this.)
|
|
|
|
*/
|
1998-12-04 22:54:57 +00:00
|
|
|
snprintf(divsrc.sin_zero, sizeof(divsrc.sin_zero),
|
|
|
|
"%s%d", m->m_pkthdr.rcvif->if_name,
|
|
|
|
m->m_pkthdr.rcvif->if_unit);
|
1996-07-10 19:44:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Put packet on socket queue, if any */
|
|
|
|
sa = NULL;
|
1999-12-06 00:43:07 +00:00
|
|
|
nport = htons((u_int16_t)port);
|
2001-02-04 13:13:25 +00:00
|
|
|
LIST_FOREACH(inp, &divcb, inp_list) {
|
1999-12-06 00:43:07 +00:00
|
|
|
if (inp->inp_lport == nport)
|
1996-07-10 19:44:30 +00:00
|
|
|
sa = inp->inp_socket;
|
|
|
|
}
|
|
|
|
if (sa) {
|
|
|
|
if (sbappendaddr(&sa->so_rcv, (struct sockaddr *)&divsrc,
|
|
|
|
m, (struct mbuf *)0) == 0)
|
|
|
|
m_freem(m);
|
|
|
|
else
|
|
|
|
sorwakeup(sa);
|
|
|
|
} else {
|
|
|
|
m_freem(m);
|
|
|
|
ipstat.ips_noproto++;
|
|
|
|
ipstat.ips_delivered--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Deliver packet back into the IP processing machinery.
|
|
|
|
*
|
|
|
|
* If no address specified, or address is 0.0.0.0, send to ip_output();
|
|
|
|
* otherwise, send to ip_input() and mark as having been received on
|
|
|
|
* the interface with that address.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
div_output(so, m, addr, control)
|
|
|
|
struct socket *so;
|
|
|
|
register struct mbuf *m;
|
1997-09-13 15:40:55 +00:00
|
|
|
struct sockaddr *addr;
|
|
|
|
struct mbuf *control;
|
1996-07-10 19:44:30 +00:00
|
|
|
{
|
|
|
|
register struct inpcb *const inp = sotoinpcb(so);
|
|
|
|
register struct ip *const ip = mtod(m, struct ip *);
|
1998-05-25 07:41:23 +00:00
|
|
|
struct sockaddr_in *sin = (struct sockaddr_in *)addr;
|
1996-07-10 19:44:30 +00:00
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
if (control)
|
|
|
|
m_freem(control); /* XXX */
|
|
|
|
|
1998-06-12 01:54:29 +00:00
|
|
|
/* Loopback avoidance and state recovery */
|
1998-05-25 07:41:23 +00:00
|
|
|
if (sin) {
|
1998-06-12 01:54:29 +00:00
|
|
|
int len = 0;
|
|
|
|
char *c = sin->sin_zero;
|
1998-07-06 09:06:58 +00:00
|
|
|
|
1998-06-06 19:39:10 +00:00
|
|
|
ip_divert_cookie = sin->sin_port;
|
1998-06-12 01:54:29 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Find receive interface with the given name or IP address.
|
|
|
|
* The name is user supplied data so don't trust it's size or
|
|
|
|
* that it is zero terminated. The name has priority.
|
|
|
|
* We are presently assuming that the sockaddr_in
|
|
|
|
* has not been replaced by a sockaddr_div, so we limit it
|
|
|
|
* to 16 bytes in total. the name is stuffed (if it exists)
|
|
|
|
* in the sin_zero[] field.
|
|
|
|
*/
|
|
|
|
while (*c++ && (len++ < sizeof(sin->sin_zero)));
|
|
|
|
if ((len > 0) && (len < sizeof(sin->sin_zero)))
|
|
|
|
m->m_pkthdr.rcvif = ifunit(sin->sin_zero);
|
1998-05-25 10:37:48 +00:00
|
|
|
} else {
|
1998-06-06 19:39:10 +00:00
|
|
|
ip_divert_cookie = 0;
|
1998-05-25 10:37:48 +00:00
|
|
|
}
|
1996-07-10 19:44:30 +00:00
|
|
|
|
|
|
|
/* Reinject packet into the system as incoming or outgoing */
|
|
|
|
if (!sin || sin->sin_addr.s_addr == 0) {
|
1998-06-12 01:54:29 +00:00
|
|
|
/*
|
|
|
|
* Don't allow both user specified and setsockopt options,
|
|
|
|
* and don't allow packet length sizes that will crash
|
|
|
|
*/
|
1996-07-10 19:44:30 +00:00
|
|
|
if (((ip->ip_hl != (sizeof (*ip) >> 2)) && inp->inp_options) ||
|
|
|
|
((u_short)ntohs(ip->ip_len) > m->m_pkthdr.len)) {
|
|
|
|
error = EINVAL;
|
|
|
|
goto cantsend;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Convert fields to host order for ip_output() */
|
2002-02-18 20:35:27 +00:00
|
|
|
ip->ip_len = ntohs(ip->ip_len);
|
|
|
|
ip->ip_off = ntohs(ip->ip_off);
|
1996-07-10 19:44:30 +00:00
|
|
|
|
|
|
|
/* Send packet to output processing */
|
|
|
|
ipstat.ips_rawout++; /* XXX */
|
|
|
|
error = ip_output(m, inp->inp_options, &inp->inp_route,
|
|
|
|
(so->so_options & SO_DONTROUTE) |
|
2000-01-08 12:53:48 +00:00
|
|
|
IP_ALLOWBROADCAST | IP_RAWOUTPUT,
|
1999-12-22 19:13:38 +00:00
|
|
|
inp->inp_moptions);
|
1996-07-10 19:44:30 +00:00
|
|
|
} else {
|
1998-05-25 08:44:31 +00:00
|
|
|
struct ifaddr *ifa;
|
|
|
|
|
1998-06-12 01:54:29 +00:00
|
|
|
/* If no luck with the name above. check by IP address. */
|
|
|
|
if (m->m_pkthdr.rcvif == NULL) {
|
1999-02-08 05:48:46 +00:00
|
|
|
/*
|
|
|
|
* Make sure there are no distractions
|
|
|
|
* for ifa_ifwithaddr. Clear the port and the ifname.
|
|
|
|
* Maybe zap all 8 bytes at once using a 64bit write?
|
|
|
|
*/
|
|
|
|
bzero(sin->sin_zero, sizeof(sin->sin_zero));
|
|
|
|
/* *((u_int64_t *)sin->sin_zero) = 0; */ /* XXX ?? */
|
|
|
|
sin->sin_port = 0;
|
1998-05-25 08:44:31 +00:00
|
|
|
if (!(ifa = ifa_ifwithaddr((struct sockaddr *) sin))) {
|
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
goto cantsend;
|
|
|
|
}
|
|
|
|
m->m_pkthdr.rcvif = ifa->ifa_ifp;
|
1996-07-10 19:44:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Send packet to input processing */
|
|
|
|
ip_input(m);
|
|
|
|
}
|
|
|
|
|
1998-06-06 20:45:28 +00:00
|
|
|
/* paranoid: Reset for next time (and other packets) */
|
|
|
|
/* almost definitly already done in the ipfw filter but.. */
|
1998-06-06 19:39:10 +00:00
|
|
|
ip_divert_cookie = 0;
|
1996-07-10 19:44:30 +00:00
|
|
|
return error;
|
|
|
|
|
|
|
|
cantsend:
|
|
|
|
m_freem(m);
|
1999-12-06 00:43:07 +00:00
|
|
|
ip_divert_cookie = 0;
|
1996-07-10 19:44:30 +00:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
div_attach(struct socket *so, int proto, struct thread *td)
|
1996-07-10 19:44:30 +00:00
|
|
|
{
|
1997-05-24 17:23:11 +00:00
|
|
|
struct inpcb *inp;
|
1997-12-18 09:13:39 +00:00
|
|
|
int error, s;
|
1997-05-24 17:23:11 +00:00
|
|
|
|
|
|
|
inp = sotoinpcb(so);
|
|
|
|
if (inp)
|
|
|
|
panic("div_attach");
|
2002-04-01 21:31:13 +00:00
|
|
|
if (td && (error = suser(td)) != 0)
|
1997-05-24 17:23:11 +00:00
|
|
|
return error;
|
|
|
|
|
1999-12-22 19:13:38 +00:00
|
|
|
error = soreserve(so, div_sendspace, div_recvspace);
|
|
|
|
if (error)
|
|
|
|
return error;
|
1997-12-18 09:13:39 +00:00
|
|
|
s = splnet();
|
2001-09-12 08:38:13 +00:00
|
|
|
error = in_pcballoc(so, &divcbinfo, td);
|
1997-12-18 09:13:39 +00:00
|
|
|
splx(s);
|
|
|
|
if (error)
|
1997-05-24 17:23:11 +00:00
|
|
|
return error;
|
|
|
|
inp = (struct inpcb *)so->so_pcb;
|
|
|
|
inp->inp_ip_p = proto;
|
2000-08-03 14:09:52 +00:00
|
|
|
inp->inp_vflag |= INP_IPV4;
|
1997-05-24 17:23:11 +00:00
|
|
|
inp->inp_flags |= INP_HDRINCL;
|
|
|
|
/* The socket is always "connected" because
|
|
|
|
we always know "where" to send the packet */
|
|
|
|
so->so_state |= SS_ISCONNECTED;
|
|
|
|
return 0;
|
|
|
|
}
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
static int
|
|
|
|
div_detach(struct socket *so)
|
|
|
|
{
|
|
|
|
struct inpcb *inp;
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
inp = sotoinpcb(so);
|
|
|
|
if (inp == 0)
|
|
|
|
panic("div_detach");
|
|
|
|
in_pcbdetach(inp);
|
|
|
|
return 0;
|
|
|
|
}
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
static int
|
|
|
|
div_abort(struct socket *so)
|
|
|
|
{
|
|
|
|
soisdisconnected(so);
|
|
|
|
return div_detach(so);
|
|
|
|
}
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
static int
|
|
|
|
div_disconnect(struct socket *so)
|
|
|
|
{
|
|
|
|
if ((so->so_state & SS_ISCONNECTED) == 0)
|
|
|
|
return ENOTCONN;
|
|
|
|
return div_abort(so);
|
|
|
|
}
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
div_bind(struct socket *so, struct sockaddr *nam, struct thread *td)
|
1997-05-24 17:23:11 +00:00
|
|
|
{
|
|
|
|
struct inpcb *inp;
|
|
|
|
int s;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
s = splnet();
|
1997-06-01 15:58:44 +00:00
|
|
|
inp = sotoinpcb(so);
|
2000-05-02 23:53:46 +00:00
|
|
|
/* in_pcbbind assumes that the socket is a sockaddr_in
|
|
|
|
* and in_pcbbind requires a valid address. Since divert
|
|
|
|
* sockets don't we need to make sure the address is
|
|
|
|
* filled in properly.
|
|
|
|
* XXX -- divert should not be abusing in_pcbind
|
|
|
|
* and should probably have its own family.
|
|
|
|
*/
|
|
|
|
if (nam->sa_family != AF_INET) {
|
|
|
|
error = EAFNOSUPPORT;
|
|
|
|
} else {
|
|
|
|
((struct sockaddr_in *)nam)->sin_addr.s_addr = INADDR_ANY;
|
2001-09-12 08:38:13 +00:00
|
|
|
error = in_pcbbind(inp, nam, td);
|
2000-05-02 23:53:46 +00:00
|
|
|
}
|
1997-05-24 17:23:11 +00:00
|
|
|
splx(s);
|
2000-08-30 14:43:02 +00:00
|
|
|
return error;
|
1997-05-24 17:23:11 +00:00
|
|
|
}
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
static int
|
|
|
|
div_shutdown(struct socket *so)
|
|
|
|
{
|
|
|
|
socantsendmore(so);
|
|
|
|
return 0;
|
|
|
|
}
|
1996-07-10 19:44:30 +00:00
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
static int
|
1997-09-13 15:40:55 +00:00
|
|
|
div_send(struct socket *so, int flags, struct mbuf *m, struct sockaddr *nam,
|
2001-09-12 08:38:13 +00:00
|
|
|
struct mbuf *control, struct thread *td)
|
1997-05-24 17:23:11 +00:00
|
|
|
{
|
|
|
|
/* Packet must have a header (but that's about it) */
|
1999-12-22 19:13:38 +00:00
|
|
|
if (m->m_len < sizeof (struct ip) &&
|
1997-05-24 17:23:11 +00:00
|
|
|
(m = m_pullup(m, sizeof (struct ip))) == 0) {
|
|
|
|
ipstat.ips_toosmall++;
|
1996-07-10 19:44:30 +00:00
|
|
|
m_freem(m);
|
1997-05-24 17:23:11 +00:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Send packet */
|
|
|
|
return div_output(so, m, nam, control);
|
1996-07-10 19:44:30 +00:00
|
|
|
}
|
1997-05-24 17:23:11 +00:00
|
|
|
|
2000-08-03 14:09:52 +00:00
|
|
|
static int
|
|
|
|
div_pcblist(SYSCTL_HANDLER_ARGS)
|
|
|
|
{
|
|
|
|
int error, i, n, s;
|
|
|
|
struct inpcb *inp, **inp_list;
|
|
|
|
inp_gen_t gencnt;
|
|
|
|
struct xinpgen xig;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The process of preparing the TCB list is too time-consuming and
|
|
|
|
* resource-intensive to repeat twice on every request.
|
|
|
|
*/
|
|
|
|
if (req->oldptr == 0) {
|
|
|
|
n = divcbinfo.ipi_count;
|
|
|
|
req->oldidx = 2 * (sizeof xig)
|
|
|
|
+ (n + n/8) * sizeof(struct xinpcb);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (req->newptr != 0)
|
|
|
|
return EPERM;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* OK, now we're committed to doing something.
|
|
|
|
*/
|
|
|
|
s = splnet();
|
|
|
|
gencnt = divcbinfo.ipi_gencnt;
|
|
|
|
n = divcbinfo.ipi_count;
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
xig.xig_len = sizeof xig;
|
|
|
|
xig.xig_count = n;
|
|
|
|
xig.xig_gen = gencnt;
|
|
|
|
xig.xig_sogen = so_gencnt;
|
|
|
|
error = SYSCTL_OUT(req, &xig, sizeof xig);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
inp_list = malloc(n * sizeof *inp_list, M_TEMP, M_WAITOK);
|
|
|
|
if (inp_list == 0)
|
|
|
|
return ENOMEM;
|
|
|
|
|
|
|
|
s = splnet();
|
2001-02-04 13:13:25 +00:00
|
|
|
for (inp = LIST_FIRST(divcbinfo.listhead), i = 0; inp && i < n;
|
|
|
|
inp = LIST_NEXT(inp, inp_list)) {
|
2001-11-08 02:13:18 +00:00
|
|
|
if (inp->inp_gencnt <= gencnt && !prison_xinpcb(
|
|
|
|
req->td->td_proc, inp))
|
2000-08-03 14:09:52 +00:00
|
|
|
inp_list[i++] = inp;
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
n = i;
|
|
|
|
|
|
|
|
error = 0;
|
|
|
|
for (i = 0; i < n; i++) {
|
|
|
|
inp = inp_list[i];
|
|
|
|
if (inp->inp_gencnt <= gencnt) {
|
|
|
|
struct xinpcb xi;
|
|
|
|
xi.xi_len = sizeof xi;
|
|
|
|
/* XXX should avoid extra copy */
|
|
|
|
bcopy(inp, &xi.xi_inp, sizeof *inp);
|
|
|
|
if (inp->inp_socket)
|
|
|
|
sotoxsocket(inp->inp_socket, &xi.xi_socket);
|
|
|
|
error = SYSCTL_OUT(req, &xi, sizeof xi);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!error) {
|
|
|
|
/*
|
|
|
|
* Give the user an updated idea of our state.
|
|
|
|
* If the generation differs from what we told
|
|
|
|
* her before, she knows that something happened
|
|
|
|
* while we were processing this request, and it
|
|
|
|
* might be necessary to retry.
|
|
|
|
*/
|
|
|
|
s = splnet();
|
|
|
|
xig.xig_gen = divcbinfo.ipi_gencnt;
|
|
|
|
xig.xig_sogen = so_gencnt;
|
|
|
|
xig.xig_count = divcbinfo.ipi_count;
|
|
|
|
splx(s);
|
|
|
|
error = SYSCTL_OUT(req, &xig, sizeof xig);
|
|
|
|
}
|
|
|
|
free(inp_list, M_TEMP);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
SYSCTL_DECL(_net_inet_divert);
|
|
|
|
SYSCTL_PROC(_net_inet_divert, OID_AUTO, pcblist, CTLFLAG_RD, 0, 0,
|
|
|
|
div_pcblist, "S,xinpcb", "List of active divert sockets");
|
|
|
|
|
1997-05-24 17:23:11 +00:00
|
|
|
struct pr_usrreqs div_usrreqs = {
|
|
|
|
div_abort, pru_accept_notsupp, div_attach, div_bind,
|
|
|
|
pru_connect_notsupp, pru_connect2_notsupp, in_control, div_detach,
|
|
|
|
div_disconnect, pru_listen_notsupp, in_setpeeraddr, pru_rcvd_notsupp,
|
|
|
|
pru_rcvoob_notsupp, div_send, pru_sense_null, div_shutdown,
|
1997-09-14 03:10:42 +00:00
|
|
|
in_setsockaddr, sosend, soreceive, sopoll
|
1997-05-24 17:23:11 +00:00
|
|
|
};
|