2003-11-14 21:02:22 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2003 Andre Oppermann, Internet Business Solutions AG
|
|
|
|
* 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. The name of the author may not be used to endorse or promote
|
|
|
|
* products derived from this software without specific prior written
|
|
|
|
* permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
|
|
|
|
*
|
|
|
|
* $FreeBSD$
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ip_fastforward gets its speed from processing the forwarded packet to
|
|
|
|
* completion (if_output on the other side) without any queues or netisr's.
|
|
|
|
* The receiving interface DMAs the packet into memory, the upper half of
|
|
|
|
* driver calls ip_fastforward, we do our routing table lookup and directly
|
|
|
|
* send it off to the outgoing interface which DMAs the packet to the
|
|
|
|
* network card. The only part of the packet we touch with the CPU is the
|
2003-11-15 17:03:37 +00:00
|
|
|
* IP header (unless there are complex firewall rules touching other parts
|
|
|
|
* of the packet, but that is up to you). We are essentially limited by bus
|
|
|
|
* bandwidth and how fast the network card/driver can set up receives and
|
|
|
|
* transmits.
|
2003-11-14 21:02:22 +00:00
|
|
|
*
|
|
|
|
* We handle basic errors, ip header errors, checksum errors,
|
|
|
|
* destination unreachable, fragmentation and fragmentation needed and
|
|
|
|
* report them via icmp to the sender.
|
|
|
|
*
|
|
|
|
* Else if something is not pure IPv4 unicast forwarding we fall back to
|
|
|
|
* the normal ip_input processing path. We should only be called from
|
|
|
|
* interfaces connected to the outside world.
|
|
|
|
*
|
|
|
|
* Firewalling is fully supported including divert, ipfw fwd and ipfilter
|
|
|
|
* ipnat and address rewrite.
|
|
|
|
*
|
|
|
|
* IPSEC is not supported if this host is a tunnel broker. IPSEC is
|
|
|
|
* supported for connections to/from local host.
|
|
|
|
*
|
|
|
|
* We try to do the least expensive (in CPU ops) checks and operations
|
|
|
|
* first to catch junk with as little overhead as possible.
|
|
|
|
*
|
|
|
|
* We take full advantage of hardware support for ip checksum and
|
|
|
|
* fragmentation offloading.
|
|
|
|
*
|
|
|
|
* We don't do ICMP redirect in the fast forwarding path. I have had my own
|
|
|
|
* cases where two core routers with Zebra routing suite would send millions
|
|
|
|
* ICMP redirects to connected hosts if the router to dest was not the default
|
|
|
|
* gateway. In one case it was filling the routing table of a host with close
|
|
|
|
* 300'000 cloned redirect entries until it ran out of kernel memory. However
|
|
|
|
* the networking code proved very robust and it didn't crash or went ill
|
|
|
|
* otherwise.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Many thanks to Matt Thomas of NetBSD for basic structure of ip_flow.c which
|
|
|
|
* is being followed here.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "opt_ipfw.h"
|
|
|
|
#include "opt_ipdn.h"
|
|
|
|
#include "opt_ipdivert.h"
|
|
|
|
#include "opt_ipfilter.h"
|
|
|
|
#include "opt_ipstealth.h"
|
|
|
|
#include "opt_mac.h"
|
|
|
|
#include "opt_pfil_hooks.h"
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/mac.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/sysctl.h>
|
|
|
|
|
|
|
|
#include <net/pfil.h>
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/if_types.h>
|
|
|
|
#include <net/if_var.h>
|
|
|
|
#include <net/if_dl.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_systm.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/ip_var.h>
|
|
|
|
#include <netinet/ip_icmp.h>
|
|
|
|
|
|
|
|
#include <machine/in_cksum.h>
|
|
|
|
|
|
|
|
#include <netinet/ip_fw.h>
|
|
|
|
#include <netinet/ip_dummynet.h>
|
|
|
|
|
|
|
|
static int ipfastforward_active = 0;
|
|
|
|
SYSCTL_INT(_net_inet_ip, OID_AUTO, fastforwarding, CTLFLAG_RW,
|
|
|
|
&ipfastforward_active, 0, "Enable fast IP forwarding");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to forward a packet based on the destination address.
|
|
|
|
* This is a fast path optimized for the plain forwarding case.
|
|
|
|
* If the packet is handled (and consumed) here then we return 1;
|
|
|
|
* otherwise 0 is returned and the packet should be delivered
|
|
|
|
* to ip_input for full processing.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip_fastforward(struct mbuf *m)
|
|
|
|
{
|
|
|
|
struct ip *ip;
|
|
|
|
struct mbuf *m0 = NULL;
|
|
|
|
#ifdef IPDIVERT
|
|
|
|
struct ip *tip;
|
|
|
|
struct mbuf *teem = NULL;
|
|
|
|
#endif
|
|
|
|
struct mbuf *tag = NULL;
|
|
|
|
struct route ro;
|
|
|
|
struct sockaddr_in *dst = NULL;
|
|
|
|
struct in_ifaddr *ia = NULL;
|
|
|
|
struct ifaddr *ifa = NULL;
|
|
|
|
struct ifnet *ifp = NULL;
|
|
|
|
struct ip_fw_args args;
|
|
|
|
in_addr_t odest, dest;
|
|
|
|
u_short sum;
|
|
|
|
int error = 0;
|
|
|
|
int hlen, ipfw, mtu;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Are we active and forwarding packets?
|
|
|
|
*/
|
|
|
|
if (!ipfastforward_active || !ipforwarding)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If there is any MT_TAG we fall back to ip_input because we can't
|
|
|
|
* handle TAGs here. Should never happen as we get directly called
|
|
|
|
* from the if_output routines.
|
|
|
|
*/
|
|
|
|
if (m->m_type == MT_TAG) {
|
|
|
|
KASSERT(0, ("%s: packet with MT_TAG not expected", __func__));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
M_ASSERTVALID(m);
|
|
|
|
M_ASSERTPKTHDR(m);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 1: check for packet drop conditions (and sanity checks)
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is entire packet big enough?
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len < sizeof(struct ip)) {
|
|
|
|
ipstat.ips_tooshort++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is first mbuf large enough for ip header and is header present?
|
|
|
|
*/
|
|
|
|
if (m->m_len < sizeof (struct ip) &&
|
|
|
|
(m = m_pullup(m, sizeof (struct ip))) == 0) {
|
|
|
|
ipstat.ips_toosmall++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is it IPv4?
|
|
|
|
*/
|
|
|
|
if (ip->ip_v != IPVERSION) {
|
|
|
|
ipstat.ips_badvers++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is IP header length correct and is it in first mbuf?
|
|
|
|
*/
|
|
|
|
hlen = ip->ip_hl << 2;
|
|
|
|
if (hlen < sizeof(struct ip)) { /* minimum header length */
|
|
|
|
ipstat.ips_badlen++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
if (hlen > m->m_len) {
|
|
|
|
if ((m = m_pullup(m, hlen)) == 0) {
|
|
|
|
ipstat.ips_badhlen++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Checksum correct?
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.csum_flags & CSUM_IP_CHECKED)
|
|
|
|
sum = !(m->m_pkthdr.csum_flags & CSUM_IP_VALID);
|
|
|
|
else {
|
|
|
|
if (hlen == sizeof(struct ip))
|
|
|
|
sum = in_cksum_hdr(ip);
|
|
|
|
else
|
|
|
|
sum = in_cksum(m, hlen);
|
|
|
|
}
|
|
|
|
if (sum) {
|
|
|
|
ipstat.ips_badsum++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
m->m_pkthdr.csum_flags |= (CSUM_IP_CHECKED | CSUM_IP_VALID);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert to host representation
|
|
|
|
*/
|
|
|
|
ip->ip_len = ntohs(ip->ip_len);
|
|
|
|
ip->ip_off = ntohs(ip->ip_off);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is IP length longer than packet we have got?
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len < ip->ip_len) {
|
|
|
|
ipstat.ips_tooshort++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is packet longer than IP header tells us? If yes, truncate packet.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len > ip->ip_len) {
|
|
|
|
if (m->m_len == m->m_pkthdr.len) {
|
|
|
|
m->m_len = ip->ip_len;
|
|
|
|
m->m_pkthdr.len = ip->ip_len;
|
|
|
|
} else
|
|
|
|
m_adj(m, ip->ip_len - m->m_pkthdr.len);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is packet from or to 127/8?
|
|
|
|
*/
|
|
|
|
if ((ntohl(ip->ip_dst.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET ||
|
|
|
|
(ntohl(ip->ip_src.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET) {
|
|
|
|
ipstat.ips_badaddr++;
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 2: fallback conditions to normal ip_input path processing
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Only IP packets without options
|
|
|
|
*/
|
|
|
|
if (ip->ip_hl != (sizeof(struct ip) >> 2))
|
|
|
|
goto fallback;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Only unicast IP, not from loopback, no L2 or IP broadcast,
|
|
|
|
* no multicast, no INADDR_ANY
|
|
|
|
*
|
|
|
|
* XXX: Probably some of these checks could be direct drop
|
|
|
|
* conditions. However it is not clear whether there are some
|
|
|
|
* hacks or obscure behaviours which make it neccessary to
|
|
|
|
* let ip_input handle it. We play safe here and let ip_input
|
|
|
|
* deal with it until it is proven that we can directly drop it.
|
|
|
|
*/
|
|
|
|
if ((m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) ||
|
|
|
|
ntohl(ip->ip_src.s_addr) == (u_long)INADDR_BROADCAST ||
|
|
|
|
ntohl(ip->ip_dst.s_addr) == (u_long)INADDR_BROADCAST ||
|
|
|
|
IN_MULTICAST(ntohl(ip->ip_src.s_addr)) ||
|
|
|
|
IN_MULTICAST(ntohl(ip->ip_dst.s_addr)) ||
|
|
|
|
ip->ip_dst.s_addr == INADDR_ANY )
|
|
|
|
goto fallback;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Is it for a local address on this host?
|
|
|
|
*/
|
|
|
|
LIST_FOREACH(ia, INADDR_HASH(ip->ip_dst.s_addr), ia_hash) {
|
|
|
|
if (IA_SIN(ia)->sin_addr.s_addr == ip->ip_dst.s_addr)
|
|
|
|
goto fallback;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Or is it for a local IP broadcast address on this host?
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.rcvif->if_flags & IFF_BROADCAST) {
|
|
|
|
TAILQ_FOREACH(ifa, &m->m_pkthdr.rcvif->if_addrhead, ifa_link) {
|
|
|
|
if (ifa->ifa_addr->sa_family != AF_INET)
|
|
|
|
continue;
|
|
|
|
ia = ifatoia(ifa);
|
|
|
|
if (ia->ia_netbroadcast.s_addr == ip->ip_dst.s_addr)
|
|
|
|
goto fallback;
|
|
|
|
if (satosin(&ia->ia_broadaddr)->sin_addr.s_addr ==
|
|
|
|
ip->ip_dst.s_addr)
|
|
|
|
goto fallback;
|
|
|
|
continue;
|
|
|
|
fallback:
|
|
|
|
/* return packet back to netisr for slow processing */
|
|
|
|
ip->ip_len = htons(ip->ip_len);
|
|
|
|
ip->ip_off = htons(ip->ip_off);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ipstat.ips_total++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 3: incoming packet firewall processing
|
|
|
|
*/
|
|
|
|
|
|
|
|
odest = dest = ip->ip_dst.s_addr;
|
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
/*
|
|
|
|
* Run through list of ipfilter hooks for input packets
|
|
|
|
*/
|
|
|
|
if (pfil_run_hooks(&inet_pfil_hook, &m, m->m_pkthdr.rcvif, PFIL_IN) ||
|
|
|
|
m == NULL)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
M_ASSERTVALID(m);
|
|
|
|
M_ASSERTPKTHDR(m);
|
|
|
|
|
|
|
|
ip = mtod(m, struct ip *); /* m may have changed by pfil hook */
|
|
|
|
dest = ip->ip_dst.s_addr;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Run through ipfw for input packets
|
|
|
|
*/
|
|
|
|
if (fw_enable && IPFW_LOADED) {
|
|
|
|
bzero(&args, sizeof(args));
|
|
|
|
args.m = m;
|
|
|
|
|
|
|
|
ipfw = ip_fw_chk_ptr(&args);
|
|
|
|
m = args.m;
|
|
|
|
|
|
|
|
M_ASSERTVALID(m);
|
|
|
|
M_ASSERTPKTHDR(m);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Packet denied, drop it
|
|
|
|
*/
|
|
|
|
if ((ipfw & IP_FW_PORT_DENY_FLAG) || m == NULL)
|
|
|
|
goto drop;
|
|
|
|
/*
|
|
|
|
* Send packet to the appropriate pipe
|
|
|
|
*/
|
|
|
|
if (DUMMYNET_LOADED && (ipfw & IP_FW_PORT_DYNT_FLAG) != 0) {
|
|
|
|
ip_dn_io_ptr(m, ipfw & 0xffff, DN_TO_IP_IN, &args);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
#ifdef IPDIVERT
|
|
|
|
/*
|
|
|
|
* Divert packet
|
|
|
|
*/
|
|
|
|
if (ipfw != 0 && (ipfw & IP_FW_PORT_DYNT_FLAG) == 0) {
|
|
|
|
/*
|
|
|
|
* See if this is a fragment
|
|
|
|
*/
|
|
|
|
if (ip->ip_off & (IP_MF | IP_OFFMASK)) {
|
|
|
|
MGETHDR(tag, M_DONTWAIT, MT_TAG);
|
|
|
|
if (tag == NULL)
|
|
|
|
goto drop;
|
|
|
|
tag->m_flags = PACKET_TAG_DIVERT;
|
2003-11-16 12:50:33 +00:00
|
|
|
tag->m_data = (caddr_t)(intptr_t)args.divert_rule;
|
2003-11-14 21:02:22 +00:00
|
|
|
tag->m_next = m;
|
|
|
|
/* XXX: really bloody hack, see ip_input */
|
|
|
|
tag->m_nextpkt = (struct mbuf *)1;
|
|
|
|
m = tag;
|
|
|
|
tag = NULL;
|
|
|
|
|
|
|
|
goto droptoours;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Tee packet
|
|
|
|
*/
|
|
|
|
if ((ipfw & IP_FW_PORT_TEE_FLAG) != 0)
|
|
|
|
teem = m_dup(m, M_DONTWAIT);
|
|
|
|
else
|
|
|
|
teem = m;
|
|
|
|
if (teem == NULL)
|
|
|
|
goto passin;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Delayed checksums are not compatible
|
|
|
|
*/
|
|
|
|
if (teem->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
|
|
|
|
in_delayed_cksum(teem);
|
|
|
|
teem->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Restore packet header fields to original values
|
|
|
|
*/
|
|
|
|
tip = mtod(teem, struct ip *);
|
|
|
|
tip->ip_len = htons(tip->ip_len);
|
|
|
|
tip->ip_off = htons(tip->ip_off);
|
|
|
|
/*
|
|
|
|
* Deliver packet to divert input routine
|
|
|
|
*/
|
|
|
|
divert_packet(teem, 0, ipfw & 0xffff, args.divert_rule);
|
|
|
|
/*
|
|
|
|
* If this was not tee, we are done
|
|
|
|
*/
|
|
|
|
if ((ipfw & IP_FW_PORT_TEE_FLAG) == 0)
|
|
|
|
return 1;
|
|
|
|
/* Continue if it was tee */
|
|
|
|
goto passin;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (ipfw == 0 && args.next_hop != NULL) {
|
|
|
|
dest = args.next_hop->sin_addr.s_addr;
|
|
|
|
goto passin;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Let through or not?
|
|
|
|
*/
|
|
|
|
if (ipfw != 0)
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
passin:
|
|
|
|
ip = mtod(m, struct ip *); /* if m changed during fw processing */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Destination address changed?
|
|
|
|
*/
|
|
|
|
if (odest != dest) {
|
|
|
|
/*
|
|
|
|
* Is it now for a local address on this host?
|
|
|
|
*/
|
|
|
|
LIST_FOREACH(ia, INADDR_HASH(ip->ip_dst.s_addr), ia_hash) {
|
|
|
|
if (IA_SIN(ia)->sin_addr.s_addr == ip->ip_dst.s_addr)
|
|
|
|
goto forwardlocal;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Go on with new destination address
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 4: decrement TTL and look up route
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check TTL
|
|
|
|
*/
|
|
|
|
#ifdef IPSTEALTH
|
|
|
|
if (!ipstealth) {
|
|
|
|
#endif
|
|
|
|
if (ip->ip_ttl <= IPTTLDEC) {
|
|
|
|
icmp_error(m, ICMP_TIMXCEED, ICMP_TIMXCEED_INTRANS, NULL, NULL);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decrement the TTL and incrementally change the checksum.
|
|
|
|
* Don't bother doing this with hw checksum offloading.
|
|
|
|
*/
|
|
|
|
ip->ip_ttl -= IPTTLDEC;
|
|
|
|
if (ip->ip_sum >= (u_int16_t) ~htons(IPTTLDEC << 8))
|
|
|
|
ip->ip_sum -= ~htons(IPTTLDEC << 8);
|
|
|
|
else
|
|
|
|
ip->ip_sum += htons(IPTTLDEC << 8);
|
|
|
|
#ifdef IPSTEALTH
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find route to destination.
|
|
|
|
*/
|
|
|
|
bzero(&ro, sizeof(ro));
|
|
|
|
dst = (struct sockaddr_in *)&ro.ro_dst;
|
|
|
|
dst->sin_family = AF_INET;
|
|
|
|
dst->sin_len = sizeof(*dst);
|
|
|
|
dst->sin_addr.s_addr = dest;
|
|
|
|
rtalloc_ign(&ro, (RTF_PRCLONING | RTF_CLONING));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Route there and interface still up?
|
|
|
|
*/
|
|
|
|
if (ro.ro_rt &&
|
|
|
|
(ro.ro_rt->rt_flags & RTF_UP) &&
|
|
|
|
(ro.ro_rt->rt_ifp->if_flags & IFF_UP)) {
|
|
|
|
ia = ifatoia(ro.ro_rt->rt_ifa);
|
|
|
|
ifp = ro.ro_rt->rt_ifp;
|
|
|
|
if (ro.ro_rt->rt_flags & RTF_GATEWAY)
|
|
|
|
dst = (struct sockaddr_in *)ro.ro_rt->rt_gateway;
|
|
|
|
} else {
|
|
|
|
ipstat.ips_noroute++;
|
|
|
|
ipstat.ips_cantforward++;
|
|
|
|
icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_HOST, NULL, NULL);
|
|
|
|
if (ro.ro_rt)
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 5: outgoing firewall packet processing
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
/*
|
|
|
|
* Run through list of hooks for output packets.
|
|
|
|
*/
|
|
|
|
if (pfil_run_hooks(&inet_pfil_hook, &m, ifp, PFIL_OUT) || m == NULL) {
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
M_ASSERTVALID(m);
|
|
|
|
M_ASSERTPKTHDR(m);
|
|
|
|
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
dest = ip->ip_dst.s_addr;
|
|
|
|
#endif
|
|
|
|
if (fw_enable && IPFW_LOADED && !args.next_hop) {
|
2003-11-15 17:03:37 +00:00
|
|
|
bzero(&args, sizeof(args));
|
2003-11-14 21:02:22 +00:00
|
|
|
args.m = m;
|
|
|
|
args.oif = ifp;
|
|
|
|
|
|
|
|
ipfw = ip_fw_chk_ptr(&args);
|
|
|
|
m = args.m;
|
|
|
|
|
|
|
|
M_ASSERTVALID(m);
|
|
|
|
M_ASSERTPKTHDR(m);
|
|
|
|
|
|
|
|
if ((ipfw & IP_FW_PORT_DENY_FLAG) || m == NULL) {
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
if (DUMMYNET_LOADED && (ipfw & IP_FW_PORT_DYNT_FLAG) != 0) {
|
|
|
|
/*
|
|
|
|
* XXX note: if the ifp or rt entry are deleted
|
|
|
|
* while a pkt is in dummynet, we are in trouble!
|
|
|
|
*/
|
|
|
|
args.ro = &ro; /* dummynet does not save it */
|
|
|
|
args.dst = dst;
|
|
|
|
|
|
|
|
ip_dn_io_ptr(m, ipfw & 0xffff, DN_TO_IP_OUT, &args);
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
#ifdef IPDIVERT
|
|
|
|
if (ipfw != 0 && (ipfw & IP_FW_PORT_DYNT_FLAG) == 0) {
|
|
|
|
/*
|
|
|
|
* See if this is a fragment
|
|
|
|
*/
|
|
|
|
if (ip->ip_off & (IP_MF | IP_OFFMASK)) {
|
|
|
|
MGETHDR(tag, M_DONTWAIT, MT_TAG);
|
|
|
|
if (tag == NULL) {
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
tag->m_flags = PACKET_TAG_DIVERT;
|
2003-11-16 12:50:33 +00:00
|
|
|
tag->m_data = (caddr_t)(intptr_t)args.divert_rule;
|
2003-11-14 21:02:22 +00:00
|
|
|
tag->m_next = m;
|
|
|
|
/* XXX: really bloody hack, see ip_input */
|
|
|
|
tag->m_nextpkt = (struct mbuf *)1;
|
|
|
|
m = tag;
|
|
|
|
tag = NULL;
|
|
|
|
|
|
|
|
goto droptoours;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Tee packet
|
|
|
|
*/
|
|
|
|
if ((ipfw & IP_FW_PORT_TEE_FLAG) != 0)
|
|
|
|
teem = m_dup(m, M_DONTWAIT);
|
|
|
|
else
|
|
|
|
teem = m;
|
|
|
|
if (teem == NULL)
|
|
|
|
goto passout;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Delayed checksums are not compatible with divert
|
|
|
|
*/
|
|
|
|
if (teem->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
|
|
|
|
in_delayed_cksum(teem);
|
|
|
|
teem->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Restore packet header fields to original values
|
|
|
|
*/
|
|
|
|
tip = mtod(teem, struct ip *);
|
|
|
|
tip->ip_len = htons(tip->ip_len);
|
|
|
|
tip->ip_off = htons(tip->ip_off);
|
|
|
|
/*
|
|
|
|
* Deliver packet to divert input routine
|
|
|
|
*/
|
|
|
|
divert_packet(teem, 0, ipfw & 0xffff, args.divert_rule);
|
|
|
|
/*
|
|
|
|
* If this was not tee, we are done
|
|
|
|
*/
|
|
|
|
if ((ipfw & IP_FW_PORT_TEE_FLAG) == 0) {
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
/* Continue if it was tee */
|
|
|
|
goto passout;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (ipfw == 0 && args.next_hop != NULL) {
|
|
|
|
dest = args.next_hop->sin_addr.s_addr;
|
|
|
|
goto passout;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Let through or not?
|
|
|
|
*/
|
|
|
|
if (ipfw != 0)
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
passout:
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Destination address changed?
|
|
|
|
*/
|
|
|
|
if (odest != dest) {
|
|
|
|
/*
|
|
|
|
* Is it now for a local address on this host?
|
|
|
|
*/
|
|
|
|
LIST_FOREACH(ia, INADDR_HASH(ip->ip_dst.s_addr), ia_hash) {
|
|
|
|
if (IA_SIN(ia)->sin_addr.s_addr == ip->ip_dst.s_addr) {
|
|
|
|
forwardlocal:
|
|
|
|
if (args.next_hop) {
|
|
|
|
/* XXX leak */
|
|
|
|
MGETHDR(tag, M_DONTWAIT, MT_TAG);
|
|
|
|
if (tag == NULL) {
|
|
|
|
if (ro.ro_rt)
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
tag->m_flags = PACKET_TAG_IPFORWARD;
|
|
|
|
tag->m_data = (caddr_t)args.next_hop;
|
|
|
|
tag->m_next = m;
|
|
|
|
/* XXX: really bloody hack,
|
|
|
|
* see ip_input */
|
|
|
|
tag->m_nextpkt = (struct mbuf *)1;
|
|
|
|
m = tag;
|
|
|
|
tag = NULL;
|
|
|
|
}
|
|
|
|
#ifdef IPDIVERT
|
|
|
|
droptoours: /* Used for DIVERT */
|
|
|
|
#endif
|
|
|
|
MGETHDR(tag, M_DONTWAIT, MT_TAG);
|
|
|
|
if (tag == NULL) {
|
|
|
|
if (ro.ro_rt)
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
tag->m_flags = PACKET_TAG_IPFASTFWD_OURS;
|
|
|
|
tag->m_data = NULL;
|
|
|
|
tag->m_next = m;
|
|
|
|
/* XXX: really bloody hack, see ip_input */
|
|
|
|
tag->m_nextpkt = (struct mbuf *)1;
|
|
|
|
m = tag;
|
|
|
|
tag = NULL;
|
|
|
|
|
|
|
|
/* ip still points to the real packet */
|
|
|
|
ip->ip_len = htons(ip->ip_len);
|
|
|
|
ip->ip_off = htons(ip->ip_off);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return packet for processing by ip_input
|
|
|
|
*/
|
|
|
|
if (ro.ro_rt)
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Redo route lookup with new destination address
|
|
|
|
*/
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
bzero(&ro, sizeof(ro));
|
|
|
|
dst = (struct sockaddr_in *)&ro.ro_dst;
|
|
|
|
dst->sin_family = AF_INET;
|
|
|
|
dst->sin_len = sizeof(*dst);
|
|
|
|
dst->sin_addr.s_addr = dest;
|
|
|
|
rtalloc_ign(&ro, (RTF_PRCLONING | RTF_CLONING));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Route there and interface still up?
|
|
|
|
*/
|
|
|
|
if (ro.ro_rt &&
|
|
|
|
(ro.ro_rt->rt_flags & RTF_UP) &&
|
|
|
|
(ro.ro_rt->rt_ifp->if_flags & IFF_UP)) {
|
|
|
|
ia = ifatoia(ro.ro_rt->rt_ifa);
|
|
|
|
ifp = ro.ro_rt->rt_ifp;
|
|
|
|
if (ro.ro_rt->rt_flags & RTF_GATEWAY)
|
|
|
|
dst = (struct sockaddr_in *)ro.ro_rt->rt_gateway;
|
|
|
|
} else {
|
|
|
|
ipstat.ips_noroute++;
|
|
|
|
ipstat.ips_cantforward++;
|
|
|
|
icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_HOST,
|
|
|
|
NULL, NULL);
|
|
|
|
if (ro.ro_rt)
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 6: send off the packet
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if packet fits MTU or if hardware will fragement for us
|
|
|
|
*/
|
|
|
|
if (ro.ro_rt->rt_rmx.rmx_mtu)
|
|
|
|
mtu = min(ro.ro_rt->rt_rmx.rmx_mtu, ifp->if_mtu);
|
|
|
|
else
|
|
|
|
mtu = ifp->if_mtu;
|
|
|
|
|
|
|
|
if (ip->ip_len <= mtu ||
|
|
|
|
(ifp->if_hwassist & CSUM_FRAGMENT && (ip->ip_off & IP_DF) == 0)) {
|
|
|
|
/*
|
|
|
|
* Restore packet header fields to original values
|
|
|
|
*/
|
|
|
|
ip->ip_len = htons(ip->ip_len);
|
|
|
|
ip->ip_off = htons(ip->ip_off);
|
|
|
|
/*
|
|
|
|
* Send off the packet via outgoing interface
|
|
|
|
*/
|
|
|
|
error = (*ifp->if_output)(ifp, m,
|
|
|
|
(struct sockaddr *)dst, ro.ro_rt);
|
|
|
|
if (ia) {
|
|
|
|
ia->ia_ifa.if_opackets++;
|
|
|
|
ia->ia_ifa.if_obytes += m->m_pkthdr.len;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Handle EMSGSIZE with icmp reply
|
|
|
|
* needfrag for TCP MTU discovery
|
|
|
|
*/
|
|
|
|
if (ip->ip_off & IP_DF) {
|
|
|
|
icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_NEEDFRAG,
|
|
|
|
NULL, ifp);
|
|
|
|
ipstat.ips_cantfrag++;
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 1;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* We have to fragement the packet
|
|
|
|
*/
|
|
|
|
m->m_pkthdr.csum_flags |= CSUM_IP;
|
|
|
|
if (ip_fragment(ip, &m, mtu, ifp->if_hwassist,
|
|
|
|
(~ifp->if_hwassist & CSUM_DELAY_IP))) {
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
goto drop;
|
|
|
|
}
|
|
|
|
KASSERT(m != NULL, ("null mbuf and no error"));
|
|
|
|
/*
|
|
|
|
* Send off the fragments via outgoing interface
|
|
|
|
*/
|
|
|
|
error = 0;
|
|
|
|
do {
|
|
|
|
m0 = m->m_nextpkt;
|
|
|
|
m->m_nextpkt = NULL;
|
|
|
|
|
|
|
|
error = (*ifp->if_output)(ifp, m,
|
|
|
|
(struct sockaddr *)dst, ro.ro_rt);
|
|
|
|
if (error)
|
|
|
|
break;
|
|
|
|
} while ((m = m0) != NULL);
|
|
|
|
if (error) {
|
|
|
|
/* Reclaim remaining fragments */
|
|
|
|
for (; m; m = m0) {
|
|
|
|
m0 = m->m_nextpkt;
|
|
|
|
m->m_nextpkt = NULL;
|
|
|
|
m_freem(m);
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
ipstat.ips_fragmented++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (error != 0)
|
|
|
|
ipstat.ips_odropped++;
|
|
|
|
else {
|
|
|
|
ro.ro_rt->rt_rmx.rmx_pksent++;
|
|
|
|
ipstat.ips_forward++;
|
|
|
|
ipstat.ips_fastforward++;
|
|
|
|
}
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return 1;
|
|
|
|
drop:
|
|
|
|
if (m)
|
|
|
|
m_freem(m);
|
|
|
|
return 1;
|
|
|
|
}
|