version 1.74, 1998/11/13 03:24:22 |
version 1.113, 2000/05/10 01:19:44 |
|
|
/* $NetBSD$ */ |
/* $NetBSD$ */ |
|
|
/* |
/* |
* Copyright (c) 1982, 1986, 1988, 1993 |
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. |
* The Regents of the University of California. All rights reserved. |
* All rights reserved. |
* |
* |
* Redistribution and use in source and binary forms, with or without |
* Redistribution and use in source and binary forms, with or without |
* modification, are permitted provided that the following conditions |
* modification, are permitted provided that the following conditions |
* are met: |
* are met: |
|
|
* 2. Redistributions in binary form must reproduce the above copyright |
* 2. Redistributions in binary form must reproduce the above copyright |
* notice, this list of conditions and the following disclaimer in the |
* notice, this list of conditions and the following disclaimer in the |
* documentation and/or other materials provided with the distribution. |
* documentation and/or other materials provided with the distribution. |
* 3. All advertising materials mentioning features or use of this software |
* 3. Neither the name of the project nor the names of its contributors |
* 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 |
* may be used to endorse or promote products derived from this software |
* without specific prior written permission. |
* without specific prior written permission. |
* |
* |
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
* 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 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
* SUCH DAMAGE. |
* SUCH DAMAGE. |
* |
|
* @(#)ip_input.c 8.2 (Berkeley) 1/4/94 |
|
*/ |
*/ |
|
|
/*- |
/*- |
|
|
* This code is derived from software contributed to The NetBSD Foundation |
* This code is derived from software contributed to The NetBSD Foundation |
* by Public Access Networks Corporation ("Panix"). It was developed under |
* by Public Access Networks Corporation ("Panix"). It was developed under |
* contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon. |
* contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon. |
* |
* |
* Redistribution and use in source and binary forms, with or without |
* Redistribution and use in source and binary forms, with or without |
* modification, are permitted provided that the following conditions |
* modification, are permitted provided that the following conditions |
* are met: |
* are met: |
* 1. Redistributions of source code must retain the above copyright |
* 1. Redistributions of source code must retain the above copyright |
* notice, this list of conditions and the following disclaimer. |
* notice, this list of conditions and the following disclaimer. |
|
|
* documentation and/or other materials provided with the distribution. |
* documentation and/or other materials provided with the distribution. |
* 3. All advertising materials mentioning features or use of this software |
* 3. All advertising materials mentioning features or use of this software |
* must display the following acknowledgement: |
* must display the following acknowledgement: |
* This product includes software developed by the NetBSD |
* This product includes software developed by the NetBSD |
* Foundation, Inc. and its contributors. |
* Foundation, Inc. and its contributors. |
* 4. Neither the name of The NetBSD Foundation nor the names of its |
* 4. Neither the name of The NetBSD Foundation nor the names of its |
* contributors may be used to endorse or promote products derived |
* contributors may be used to endorse or promote products derived |
* from this software without specific prior written permission. |
* from this software without specific prior written permission. |
* |
* |
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS |
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
|
* POSSIBILITY OF SUCH DAMAGE. |
* POSSIBILITY OF SUCH DAMAGE. |
*/ |
*/ |
|
|
|
/* |
|
* 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. |
|
* |
|
* @(#)ip_input.c 8.2 (Berkeley) 1/4/94 |
|
*/ |
|
|
#include "opt_gateway.h" |
#include "opt_gateway.h" |
#include "opt_pfil_hooks.h" |
#include "opt_pfil_hooks.h" |
|
#include "opt_ipsec.h" |
#include "opt_mrouting.h" |
#include "opt_mrouting.h" |
|
|
#include <sys/param.h> |
#include <sys/param.h> |
|
|
#include <netinet/in_var.h> |
#include <netinet/in_var.h> |
#include <netinet/ip_var.h> |
#include <netinet/ip_var.h> |
#include <netinet/ip_icmp.h> |
#include <netinet/ip_icmp.h> |
|
/* just for gif_ttl */ |
|
#include <netinet/in_gif.h> |
|
#include "gif.h" |
|
|
|
#ifdef MROUTING |
|
#include <netinet/ip_mroute.h> |
|
#endif |
|
|
|
#ifdef IPSEC |
|
#include <netinet6/ipsec.h> |
|
#include <netkey/key.h> |
|
#include <netkey/key_debug.h> |
|
#endif |
|
|
#ifndef IPFORWARDING |
#ifndef IPFORWARDING |
#ifdef GATEWAY |
#ifdef GATEWAY |
Line 155 int ipprintfs = 0; |
|
Line 198 int ipprintfs = 0; |
|
struct rttimer_queue *ip_mtudisc_timeout_q = NULL; |
struct rttimer_queue *ip_mtudisc_timeout_q = NULL; |
|
|
extern struct domain inetdomain; |
extern struct domain inetdomain; |
extern struct protosw inetsw[]; |
|
u_char ip_protox[IPPROTO_MAX]; |
|
int ipqmaxlen = IFQ_MAXLEN; |
int ipqmaxlen = IFQ_MAXLEN; |
struct in_ifaddrhead in_ifaddr; |
struct in_ifaddrhead in_ifaddr; |
struct in_ifaddrhashhead *in_ifaddrhashtbl; |
struct in_ifaddrhashhead *in_ifaddrhashtbl; |
struct ifqueue ipintrq; |
struct ifqueue ipintrq; |
struct ipstat ipstat; |
struct ipstat ipstat; |
u_int16_t ip_id; |
u_int16_t ip_id; |
int ip_defttl; |
|
struct ipqhead ipq; |
struct ipqhead ipq; |
|
int ipq_locked; |
|
|
|
static __inline int ipq_lock_try __P((void)); |
|
static __inline void ipq_unlock __P((void)); |
|
|
|
static __inline int |
|
ipq_lock_try() |
|
{ |
|
int s; |
|
|
|
s = splimp(); |
|
if (ipq_locked) { |
|
splx(s); |
|
return (0); |
|
} |
|
ipq_locked = 1; |
|
splx(s); |
|
return (1); |
|
} |
|
|
|
static __inline void |
|
ipq_unlock() |
|
{ |
|
int s; |
|
|
|
s = splimp(); |
|
ipq_locked = 0; |
|
splx(s); |
|
} |
|
|
|
#ifdef DIAGNOSTIC |
|
#define IPQ_LOCK() \ |
|
do { \ |
|
if (ipq_lock_try() == 0) { \ |
|
printf("%s:%d: ipq already locked\n", __FILE__, __LINE__); \ |
|
panic("ipq_lock"); \ |
|
} \ |
|
} while (0) |
|
#define IPQ_LOCK_CHECK() \ |
|
do { \ |
|
if (ipq_locked == 0) { \ |
|
printf("%s:%d: ipq lock not held\n", __FILE__, __LINE__); \ |
|
panic("ipq lock check"); \ |
|
} \ |
|
} while (0) |
|
#else |
|
#define IPQ_LOCK() (void) ipq_lock_try() |
|
#define IPQ_LOCK_CHECK() /* nothing */ |
|
#endif |
|
|
|
#define IPQ_UNLOCK() ipq_unlock() |
|
|
struct pool ipqent_pool; |
struct pool ipqent_pool; |
|
|
Line 192 static void save_rte __P((u_char *, stru |
|
Line 284 static void save_rte __P((u_char *, stru |
|
void |
void |
ip_init() |
ip_init() |
{ |
{ |
register struct protosw *pr; |
struct protosw *pr; |
register int i; |
int i; |
|
|
pool_init(&ipqent_pool, sizeof(struct ipqent), 0, 0, 0, "ipqepl", |
pool_init(&ipqent_pool, sizeof(struct ipqent), 0, 0, 0, "ipqepl", |
0, NULL, NULL, M_IPQ); |
0, NULL, NULL, M_IPQ); |
Line 226 struct sockaddr_in ipaddr = { sizeof(ipa |
|
Line 318 struct sockaddr_in ipaddr = { sizeof(ipa |
|
struct route ipforward_rt; |
struct route ipforward_rt; |
|
|
/* |
/* |
|
* IP software interrupt routine |
|
*/ |
|
void |
|
ipintr() |
|
{ |
|
int s; |
|
struct mbuf *m; |
|
|
|
while (1) { |
|
s = splimp(); |
|
IF_DEQUEUE(&ipintrq, m); |
|
splx(s); |
|
if (m == 0) |
|
return; |
|
ip_input(m); |
|
} |
|
} |
|
|
|
/* |
* Ip input routine. Checksum and byte swap header. If fragmented |
* Ip input routine. Checksum and byte swap header. If fragmented |
* try to reassemble. Process options. Pass to next level. |
* try to reassemble. Process options. Pass to next level. |
*/ |
*/ |
void |
void |
ipintr() |
ip_input(struct mbuf *m) |
{ |
{ |
register struct ip *ip = NULL; |
struct ip *ip = NULL; |
register struct mbuf *m; |
struct ipq *fp; |
register struct ipq *fp; |
struct in_ifaddr *ia; |
register struct in_ifaddr *ia; |
struct ifaddr *ifa; |
register struct ifaddr *ifa; |
|
struct ipqent *ipqe; |
struct ipqent *ipqe; |
int hlen = 0, mff, len, s; |
int hlen = 0, mff, len; |
|
int downmatch; |
#ifdef PFIL_HOOKS |
#ifdef PFIL_HOOKS |
struct packet_filter_hook *pfh; |
struct packet_filter_hook *pfh; |
struct mbuf *m0; |
struct mbuf *m0; |
int rv; |
int rv; |
#endif /* PFIL_HOOKS */ |
#endif /* PFIL_HOOKS */ |
|
|
next: |
|
/* |
|
* Get next datagram off input queue and get IP header |
|
* in first mbuf. |
|
*/ |
|
s = splimp(); |
|
IF_DEQUEUE(&ipintrq, m); |
|
splx(s); |
|
if (m == 0) |
|
return; |
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if ((m->m_flags & M_PKTHDR) == 0) |
if ((m->m_flags & M_PKTHDR) == 0) |
panic("ipintr no HDR"); |
panic("ipintr no HDR"); |
#endif |
#endif |
|
#ifdef IPSEC |
|
/* |
|
* should the inner packet be considered authentic? |
|
* see comment in ah4_input(). |
|
*/ |
|
if (m) { |
|
m->m_flags &= ~M_AUTHIPHDR; |
|
m->m_flags &= ~M_AUTHIPDGM; |
|
} |
|
#endif |
/* |
/* |
* If no IP addresses have been set yet but the interfaces |
* If no IP addresses have been set yet but the interfaces |
* are receiving, can't do anything with incoming packets yet. |
* are receiving, can't do anything with incoming packets yet. |
|
|
if (m->m_len < sizeof (struct ip) && |
if (m->m_len < sizeof (struct ip) && |
(m = m_pullup(m, sizeof (struct ip))) == 0) { |
(m = m_pullup(m, sizeof (struct ip))) == 0) { |
ipstat.ips_toosmall++; |
ipstat.ips_toosmall++; |
goto next; |
return; |
} |
} |
ip = mtod(m, struct ip *); |
ip = mtod(m, struct ip *); |
if (ip->ip_v != IPVERSION) { |
if (ip->ip_v != IPVERSION) { |
|
|
if (hlen > m->m_len) { |
if (hlen > m->m_len) { |
if ((m = m_pullup(m, hlen)) == 0) { |
if ((m = m_pullup(m, hlen)) == 0) { |
ipstat.ips_badhlen++; |
ipstat.ips_badhlen++; |
goto next; |
return; |
} |
} |
ip = mtod(m, struct ip *); |
ip = mtod(m, struct ip *); |
} |
} |
if ((ip->ip_sum = in_cksum(m, hlen)) != 0) { |
|
|
/* |
|
* RFC1122: packets with a multicast source address are |
|
* not allowed. |
|
*/ |
|
if (IN_MULTICAST(ip->ip_src.s_addr)) { |
|
/* XXX stat */ |
|
goto bad; |
|
} |
|
|
|
if (in_cksum(m, hlen) != 0) { |
ipstat.ips_badsum++; |
ipstat.ips_badsum++; |
goto bad; |
goto bad; |
} |
} |
|
|
* Convert fields to host representation. |
* Convert fields to host representation. |
*/ |
*/ |
NTOHS(ip->ip_len); |
NTOHS(ip->ip_len); |
NTOHS(ip->ip_id); |
|
NTOHS(ip->ip_off); |
NTOHS(ip->ip_off); |
len = ip->ip_len; |
len = ip->ip_len; |
|
|
/* |
/* |
|
* Check for additional length bogosity |
|
*/ |
|
if (len < hlen) { |
|
ipstat.ips_badlen++; |
|
goto bad; |
|
} |
|
|
|
/* |
* Check that the amount of data in the buffers |
* Check that the amount of data in the buffers |
* is as at least much as the IP header would have us expect. |
* is as at least much as the IP header would have us expect. |
* Trim mbufs if longer than we expect. |
* Trim mbufs if longer than we expect. |
|
|
m_adj(m, len - m->m_pkthdr.len); |
m_adj(m, len - m->m_pkthdr.len); |
} |
} |
|
|
|
#ifdef IPSEC |
|
/* ipflow (IP fast fowarding) is not compatible with IPsec. */ |
|
m->m_flags &= ~M_CANFASTFWD; |
|
#else |
/* |
/* |
* Assume that we can create a fast-forward IP flow entry |
* Assume that we can create a fast-forward IP flow entry |
* based on this packet. |
* based on this packet. |
*/ |
*/ |
m->m_flags |= M_CANFASTFWD; |
m->m_flags |= M_CANFASTFWD; |
|
#endif |
|
|
#ifdef PFIL_HOOKS |
#ifdef PFIL_HOOKS |
/* |
/* |
|
|
* in the list may have previously cleared it. |
* in the list may have previously cleared it. |
*/ |
*/ |
m0 = m; |
m0 = m; |
for (pfh = pfil_hook_get(PFIL_IN); pfh; pfh = pfh->pfil_link.tqe_next) |
pfh = pfil_hook_get(PFIL_IN, &inetsw[ip_protox[IPPROTO_IP]].pr_pfh); |
|
for (; pfh; pfh = pfh->pfil_link.tqe_next) |
if (pfh->pfil_func) { |
if (pfh->pfil_func) { |
rv = pfh->pfil_func(ip, hlen, m->m_pkthdr.rcvif, 0, &m0); |
rv = pfh->pfil_func(ip, hlen, |
|
m->m_pkthdr.rcvif, 0, &m0); |
if (rv) |
if (rv) |
goto next; |
return; |
m = m0; |
m = m0; |
if (m == NULL) |
if (m == NULL) |
goto next; |
return; |
ip = mtod(m, struct ip *); |
ip = mtod(m, struct ip *); |
} |
} |
#endif /* PFIL_HOOKS */ |
#endif /* PFIL_HOOKS */ |
|
|
*/ |
*/ |
ip_nhops = 0; /* for source routed packets */ |
ip_nhops = 0; /* for source routed packets */ |
if (hlen > sizeof (struct ip) && ip_dooptions(m)) |
if (hlen > sizeof (struct ip) && ip_dooptions(m)) |
goto next; |
return; |
|
|
/* |
/* |
* Check our list of addresses, to see if the packet is for us. |
* Check our list of addresses, to see if the packet is for us. |
*/ |
* |
INADDR_TO_IA(ip->ip_dst, ia); |
* Traditional 4.4BSD did not consult IFF_UP at all. |
if (ia != NULL) goto ours; |
* The behavior here is to treat addresses on !IFF_UP interface |
|
* as not mine. |
|
*/ |
|
downmatch = 0; |
|
for (ia = IN_IFADDR_HASH(ip->ip_dst.s_addr).lh_first; |
|
ia != NULL; |
|
ia = ia->ia_hash.le_next) { |
|
if (in_hosteq(ia->ia_addr.sin_addr, ip->ip_dst)) { |
|
if ((ia->ia_ifp->if_flags & IFF_UP) != 0) |
|
break; |
|
else |
|
downmatch++; |
|
} |
|
} |
|
if (ia != NULL) |
|
goto ours; |
if (m->m_pkthdr.rcvif->if_flags & IFF_BROADCAST) { |
if (m->m_pkthdr.rcvif->if_flags & IFF_BROADCAST) { |
for (ifa = m->m_pkthdr.rcvif->if_addrlist.tqh_first; |
for (ifa = m->m_pkthdr.rcvif->if_addrlist.tqh_first; |
ifa != NULL; ifa = ifa->ifa_list.tqe_next) { |
ifa != NULL; ifa = ifa->ifa_list.tqe_next) { |
|
|
if (m->m_flags & M_EXT) { |
if (m->m_flags & M_EXT) { |
if ((m = m_pullup(m, hlen)) == 0) { |
if ((m = m_pullup(m, hlen)) == 0) { |
ipstat.ips_toosmall++; |
ipstat.ips_toosmall++; |
goto next; |
return; |
} |
} |
ip = mtod(m, struct ip *); |
ip = mtod(m, struct ip *); |
} |
} |
|
|
* as expected when ip_mforward() is called from |
* as expected when ip_mforward() is called from |
* ip_output().) |
* ip_output().) |
*/ |
*/ |
ip->ip_id = htons(ip->ip_id); |
|
if (ip_mforward(m, m->m_pkthdr.rcvif) != 0) { |
if (ip_mforward(m, m->m_pkthdr.rcvif) != 0) { |
ipstat.ips_cantforward++; |
ipstat.ips_cantforward++; |
m_freem(m); |
m_freem(m); |
goto next; |
return; |
} |
} |
ip->ip_id = ntohs(ip->ip_id); |
|
|
|
/* |
/* |
* The process-level routing demon needs to receive |
* The process-level routing demon needs to receive |
|
|
if (inm == NULL) { |
if (inm == NULL) { |
ipstat.ips_cantforward++; |
ipstat.ips_cantforward++; |
m_freem(m); |
m_freem(m); |
goto next; |
return; |
} |
} |
goto ours; |
goto ours; |
} |
} |
|
|
if (ipforwarding == 0) { |
if (ipforwarding == 0) { |
ipstat.ips_cantforward++; |
ipstat.ips_cantforward++; |
m_freem(m); |
m_freem(m); |
} else |
} else { |
|
/* |
|
* If ip_dst matched any of my address on !IFF_UP interface, |
|
* and there's no IFF_UP interface that matches ip_dst, |
|
* send icmp unreach. Forwarding it will result in in-kernel |
|
* forwarding loop till TTL goes to 0. |
|
*/ |
|
if (downmatch) { |
|
icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_HOST, 0, 0); |
|
ipstat.ips_cantforward++; |
|
return; |
|
} |
ip_forward(m, 0); |
ip_forward(m, 0); |
goto next; |
} |
|
return; |
|
|
ours: |
ours: |
/* |
/* |
|
|
* Look for queue of fragments |
* Look for queue of fragments |
* of this datagram. |
* of this datagram. |
*/ |
*/ |
|
IPQ_LOCK(); |
for (fp = ipq.lh_first; fp != NULL; fp = fp->ipq_q.le_next) |
for (fp = ipq.lh_first; fp != NULL; fp = fp->ipq_q.le_next) |
if (ip->ip_id == fp->ipq_id && |
if (ip->ip_id == fp->ipq_id && |
in_hosteq(ip->ip_src, fp->ipq_src) && |
in_hosteq(ip->ip_src, fp->ipq_src) && |
|
|
*/ |
*/ |
if (ip->ip_len == 0 || (ip->ip_len & 0x7) != 0) { |
if (ip->ip_len == 0 || (ip->ip_len & 0x7) != 0) { |
ipstat.ips_badfrags++; |
ipstat.ips_badfrags++; |
|
IPQ_UNLOCK(); |
goto bad; |
goto bad; |
} |
} |
} |
} |
|
|
ipqe = pool_get(&ipqent_pool, PR_NOWAIT); |
ipqe = pool_get(&ipqent_pool, PR_NOWAIT); |
if (ipqe == NULL) { |
if (ipqe == NULL) { |
ipstat.ips_rcvmemdrop++; |
ipstat.ips_rcvmemdrop++; |
|
IPQ_UNLOCK(); |
goto bad; |
goto bad; |
} |
} |
ipqe->ipqe_mff = mff; |
ipqe->ipqe_mff = mff; |
ipqe->ipqe_m = m; |
ipqe->ipqe_m = m; |
ipqe->ipqe_ip = ip; |
ipqe->ipqe_ip = ip; |
m = ip_reass(ipqe, fp); |
m = ip_reass(ipqe, fp); |
if (m == 0) |
if (m == 0) { |
goto next; |
IPQ_UNLOCK(); |
|
return; |
|
} |
ipstat.ips_reassembled++; |
ipstat.ips_reassembled++; |
ip = mtod(m, struct ip *); |
ip = mtod(m, struct ip *); |
hlen = ip->ip_hl << 2; |
hlen = ip->ip_hl << 2; |
|
ip->ip_len += hlen; |
} else |
} else |
if (fp) |
if (fp) |
ip_freef(fp); |
ip_freef(fp); |
} else |
IPQ_UNLOCK(); |
ip->ip_len -= hlen; |
} |
|
|
/* |
/* |
* Switch out to protocol's input routine. |
* Switch out to protocol's input routine. |
*/ |
*/ |
|
#if IFA_STATS |
|
ia->ia_ifa.ifa_data.ifad_inbytes += ip->ip_len; |
|
#endif |
ipstat.ips_delivered++; |
ipstat.ips_delivered++; |
(*inetsw[ip_protox[ip->ip_p]].pr_input)(m, hlen); |
{ |
goto next; |
int off = hlen, nh = ip->ip_p; |
|
|
|
(*inetsw[ip_protox[nh]].pr_input)(m, off, nh); |
|
return; |
|
} |
bad: |
bad: |
m_freem(m); |
m_freem(m); |
goto next; |
|
} |
} |
|
|
/* |
/* |
|
|
*/ |
*/ |
struct mbuf * |
struct mbuf * |
ip_reass(ipqe, fp) |
ip_reass(ipqe, fp) |
register struct ipqent *ipqe; |
struct ipqent *ipqe; |
register struct ipq *fp; |
struct ipq *fp; |
{ |
{ |
register struct mbuf *m = ipqe->ipqe_m; |
struct mbuf *m = ipqe->ipqe_m; |
register struct ipqent *nq, *p, *q; |
struct ipqent *nq, *p, *q; |
struct ip *ip; |
struct ip *ip; |
struct mbuf *t; |
struct mbuf *t; |
int hlen = ipqe->ipqe_ip->ip_hl << 2; |
int hlen = ipqe->ipqe_ip->ip_hl << 2; |
int i, next; |
int i, next; |
|
|
|
IPQ_LOCK_CHECK(); |
|
|
/* |
/* |
* Presence of header sizes in mbufs |
* Presence of header sizes in mbufs |
* would confuse code below. |
* would confuse code below. |
|
|
m->m_data -= (ip->ip_hl << 2); |
m->m_data -= (ip->ip_hl << 2); |
/* some debugging cruft by sklower, below, will go away soon */ |
/* some debugging cruft by sklower, below, will go away soon */ |
if (m->m_flags & M_PKTHDR) { /* XXX this should be done elsewhere */ |
if (m->m_flags & M_PKTHDR) { /* XXX this should be done elsewhere */ |
register int plen = 0; |
int plen = 0; |
for (t = m; t; t = t->m_next) |
for (t = m; t; t = t->m_next) |
plen += t->m_len; |
plen += t->m_len; |
m->m_pkthdr.len = plen; |
m->m_pkthdr.len = plen; |
|
|
ip_freef(fp) |
ip_freef(fp) |
struct ipq *fp; |
struct ipq *fp; |
{ |
{ |
register struct ipqent *q, *p; |
struct ipqent *q, *p; |
|
|
|
IPQ_LOCK_CHECK(); |
|
|
for (q = fp->ipq_fragq.lh_first; q != NULL; q = p) { |
for (q = fp->ipq_fragq.lh_first; q != NULL; q = p) { |
p = q->ipqe_q.le_next; |
p = q->ipqe_q.le_next; |
|
|
void |
void |
ip_slowtimo() |
ip_slowtimo() |
{ |
{ |
register struct ipq *fp, *nfp; |
struct ipq *fp, *nfp; |
int s = splsoftnet(); |
int s = splsoftnet(); |
|
|
|
IPQ_LOCK(); |
for (fp = ipq.lh_first; fp != NULL; fp = nfp) { |
for (fp = ipq.lh_first; fp != NULL; fp = nfp) { |
nfp = fp->ipq_q.le_next; |
nfp = fp->ipq_q.le_next; |
if (--fp->ipq_ttl == 0) { |
if (--fp->ipq_ttl == 0) { |
|
|
ip_freef(fp); |
ip_freef(fp); |
} |
} |
} |
} |
|
IPQ_UNLOCK(); |
#ifdef GATEWAY |
#ifdef GATEWAY |
ipflow_slowtimo(); |
ipflow_slowtimo(); |
#endif |
#endif |
|
|
ip_drain() |
ip_drain() |
{ |
{ |
|
|
|
/* |
|
* We may be called from a device's interrupt context. If |
|
* the ipq is already busy, just bail out now. |
|
*/ |
|
if (ipq_lock_try() == 0) |
|
return; |
|
|
while (ipq.lh_first != NULL) { |
while (ipq.lh_first != NULL) { |
ipstat.ips_fragdropped++; |
ipstat.ips_fragdropped++; |
ip_freef(ipq.lh_first); |
ip_freef(ipq.lh_first); |
} |
} |
|
|
|
IPQ_UNLOCK(); |
} |
} |
|
|
/* |
/* |
|
|
ip_dooptions(m) |
ip_dooptions(m) |
struct mbuf *m; |
struct mbuf *m; |
{ |
{ |
register struct ip *ip = mtod(m, struct ip *); |
struct ip *ip = mtod(m, struct ip *); |
register u_char *cp; |
u_char *cp, *cp0; |
register struct ip_timestamp *ipt; |
struct ip_timestamp *ipt; |
register struct in_ifaddr *ia; |
struct in_ifaddr *ia; |
int opt, optlen, cnt, off, code, type = ICMP_PARAMPROB, forward = 0; |
int opt, optlen, cnt, off, code, type = ICMP_PARAMPROB, forward = 0; |
struct in_addr *sin, dst; |
struct in_addr dst; |
n_time ntime; |
n_time ntime; |
|
|
dst = ip->ip_dst; |
dst = ip->ip_dst; |
|
|
if (opt == IPOPT_NOP) |
if (opt == IPOPT_NOP) |
optlen = 1; |
optlen = 1; |
else { |
else { |
|
if (cnt < IPOPT_OLEN + sizeof(*cp)) { |
|
code = &cp[IPOPT_OLEN] - (u_char *)ip; |
|
goto bad; |
|
} |
optlen = cp[IPOPT_OLEN]; |
optlen = cp[IPOPT_OLEN]; |
if (optlen <= 0 || optlen > cnt) { |
if (optlen <= 0 || optlen > cnt) { |
code = &cp[IPOPT_OLEN] - (u_char *)ip; |
code = &cp[IPOPT_OLEN] - (u_char *)ip; |
|
Line 1017 ip_dooptions(m) |
|
break; |
break; |
} |
} |
off--; /* 0 origin */ |
off--; /* 0 origin */ |
if (off > optlen - sizeof(struct in_addr)) { |
if ((off + sizeof(struct in_addr)) > optlen) { |
/* |
/* |
* End of source route. Should be for us. |
* End of source route. Should be for us. |
*/ |
*/ |
|
Line 1029 ip_dooptions(m) |
|
*/ |
*/ |
bcopy((caddr_t)(cp + off), (caddr_t)&ipaddr.sin_addr, |
bcopy((caddr_t)(cp + off), (caddr_t)&ipaddr.sin_addr, |
sizeof(ipaddr.sin_addr)); |
sizeof(ipaddr.sin_addr)); |
if (opt == IPOPT_SSRR) { |
if (opt == IPOPT_SSRR) |
#define INA struct in_ifaddr * |
ia = ifatoia(ifa_ifwithaddr(sintosa(&ipaddr))); |
#define SA struct sockaddr * |
else |
ia = (INA)ifa_ifwithladdr((SA)&ipaddr); |
|
} else |
|
ia = ip_rtaddr(ipaddr.sin_addr); |
ia = ip_rtaddr(ipaddr.sin_addr); |
if (ia == 0) { |
if (ia == 0) { |
type = ICMP_UNREACH; |
type = ICMP_UNREACH; |
|
Line 1057 ip_dooptions(m) |
|
* If no space remains, ignore. |
* If no space remains, ignore. |
*/ |
*/ |
off--; /* 0 origin */ |
off--; /* 0 origin */ |
if (off > optlen - sizeof(struct in_addr)) |
if ((off + sizeof(struct in_addr)) > optlen) |
break; |
break; |
bcopy((caddr_t)(&ip->ip_dst), (caddr_t)&ipaddr.sin_addr, |
bcopy((caddr_t)(&ip->ip_dst), (caddr_t)&ipaddr.sin_addr, |
sizeof(ipaddr.sin_addr)); |
sizeof(ipaddr.sin_addr)); |
|
Line 1065 ip_dooptions(m) |
|
* locate outgoing interface; if we're the destination, |
* locate outgoing interface; if we're the destination, |
* use the incoming interface (should be same). |
* use the incoming interface (should be same). |
*/ |
*/ |
if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == 0 && |
if ((ia = ifatoia(ifa_ifwithaddr(sintosa(&ipaddr)))) |
(ia = ip_rtaddr(ipaddr.sin_addr)) == 0) { |
== NULL && |
|
(ia = ip_rtaddr(ipaddr.sin_addr)) == NULL) { |
type = ICMP_UNREACH; |
type = ICMP_UNREACH; |
code = ICMP_UNREACH_HOST; |
code = ICMP_UNREACH_HOST; |
goto bad; |
goto bad; |
|
Line 1087 ip_dooptions(m) |
|
goto bad; |
goto bad; |
break; |
break; |
} |
} |
sin = (struct in_addr *)(cp + ipt->ipt_ptr - 1); |
cp0 = (cp + ipt->ipt_ptr - 1); |
switch (ipt->ipt_flg) { |
switch (ipt->ipt_flg) { |
|
|
case IPOPT_TS_TSONLY: |
case IPOPT_TS_TSONLY: |
|
Line 1098 ip_dooptions(m) |
|
sizeof(struct in_addr) > ipt->ipt_len) |
sizeof(struct in_addr) > ipt->ipt_len) |
goto bad; |
goto bad; |
ipaddr.sin_addr = dst; |
ipaddr.sin_addr = dst; |
ia = (INA)ifaof_ifpforaddr((SA)&ipaddr, |
ia = ifatoia(ifaof_ifpforaddr(sintosa(&ipaddr), |
m->m_pkthdr.rcvif); |
m->m_pkthdr.rcvif)); |
if (ia == 0) |
if (ia == 0) |
continue; |
continue; |
bcopy((caddr_t)&ia->ia_addr.sin_addr, |
bcopy(&ia->ia_addr.sin_addr, |
(caddr_t)sin, sizeof(struct in_addr)); |
cp0, sizeof(struct in_addr)); |
ipt->ipt_ptr += sizeof(struct in_addr); |
ipt->ipt_ptr += sizeof(struct in_addr); |
break; |
break; |
|
|
|
Line 1111 ip_dooptions(m) |
|
if (ipt->ipt_ptr - 1 + sizeof(n_time) + |
if (ipt->ipt_ptr - 1 + sizeof(n_time) + |
sizeof(struct in_addr) > ipt->ipt_len) |
sizeof(struct in_addr) > ipt->ipt_len) |
goto bad; |
goto bad; |
bcopy((caddr_t)sin, (caddr_t)&ipaddr.sin_addr, |
bcopy(cp0, &ipaddr.sin_addr, |
sizeof(struct in_addr)); |
sizeof(struct in_addr)); |
if (ifa_ifwithaddr((SA)&ipaddr) == 0) |
if (ifatoia(ifa_ifwithaddr(sintosa(&ipaddr))) |
|
== NULL) |
continue; |
continue; |
ipt->ipt_ptr += sizeof(struct in_addr); |
ipt->ipt_ptr += sizeof(struct in_addr); |
break; |
break; |
|
Line 1123 ip_dooptions(m) |
|
goto bad; |
goto bad; |
} |
} |
ntime = iptime(); |
ntime = iptime(); |
bcopy((caddr_t)&ntime, (caddr_t)cp + ipt->ipt_ptr - 1, |
cp0 = (u_char *) &ntime; /* XXX grumble, GCC... */ |
|
bcopy(cp0, (caddr_t)cp + ipt->ipt_ptr - 1, |
sizeof(n_time)); |
sizeof(n_time)); |
ipt->ipt_ptr += sizeof(n_time); |
ipt->ipt_ptr += sizeof(n_time); |
} |
} |
|
Line 1140 ip_dooptions(m) |
|
} |
} |
return (0); |
return (0); |
bad: |
bad: |
ip->ip_len -= ip->ip_hl << 2; /* XXX icmp_error adds in hdr length */ |
|
icmp_error(m, type, code, 0, 0); |
icmp_error(m, type, code, 0, 0); |
ipstat.ips_badoptions++; |
ipstat.ips_badoptions++; |
return (1); |
return (1); |
Line 962 struct in_ifaddr * |
|
Line 1153 struct in_ifaddr * |
|
ip_rtaddr(dst) |
ip_rtaddr(dst) |
struct in_addr dst; |
struct in_addr dst; |
{ |
{ |
register struct sockaddr_in *sin; |
struct sockaddr_in *sin; |
|
|
sin = satosin(&ipforward_rt.ro_dst); |
sin = satosin(&ipforward_rt.ro_dst); |
|
|
Line 997 save_rte(option, dst) |
|
Line 1188 save_rte(option, dst) |
|
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (ipprintfs) |
if (ipprintfs) |
printf("save_rte: olen %d\n", olen); |
printf("save_rte: olen %d\n", olen); |
#endif |
#endif /* 0 */ |
if (olen > sizeof(ip_srcrt) - (1 + sizeof(dst))) |
if (olen > sizeof(ip_srcrt) - (1 + sizeof(dst))) |
return; |
return; |
bcopy((caddr_t)option, (caddr_t)ip_srcrt.srcopt, olen); |
bcopy((caddr_t)option, (caddr_t)ip_srcrt.srcopt, olen); |
Line 1013 save_rte(option, dst) |
|
Line 1204 save_rte(option, dst) |
|
struct mbuf * |
struct mbuf * |
ip_srcroute() |
ip_srcroute() |
{ |
{ |
register struct in_addr *p, *q; |
struct in_addr *p, *q; |
register struct mbuf *m; |
struct mbuf *m; |
|
|
if (ip_nhops == 0) |
if (ip_nhops == 0) |
return ((struct mbuf *)0); |
return ((struct mbuf *)0); |
|
|
*/ |
*/ |
void |
void |
ip_stripoptions(m, mopt) |
ip_stripoptions(m, mopt) |
register struct mbuf *m; |
struct mbuf *m; |
struct mbuf *mopt; |
struct mbuf *mopt; |
{ |
{ |
register int i; |
int i; |
struct ip *ip = mtod(m, struct ip *); |
struct ip *ip = mtod(m, struct ip *); |
register caddr_t opts; |
caddr_t opts; |
int olen; |
int olen; |
|
|
olen = (ip->ip_hl<<2) - sizeof (struct ip); |
olen = (ip->ip_hl << 2) - sizeof (struct ip); |
opts = (caddr_t)(ip + 1); |
opts = (caddr_t)(ip + 1); |
i = m->m_len - (sizeof (struct ip) + olen); |
i = m->m_len - (sizeof (struct ip) + olen); |
bcopy(opts + olen, opts, (unsigned)i); |
bcopy(opts + olen, opts, (unsigned)i); |
m->m_len -= olen; |
m->m_len -= olen; |
if (m->m_flags & M_PKTHDR) |
if (m->m_flags & M_PKTHDR) |
m->m_pkthdr.len -= olen; |
m->m_pkthdr.len -= olen; |
ip->ip_hl = sizeof(struct ip) >> 2; |
ip->ip_len -= olen; |
|
ip->ip_hl = sizeof (struct ip) >> 2; |
} |
} |
|
|
int inetctlerrmap[PRC_NCMDS] = { |
int inetctlerrmap[PRC_NCMDS] = { |
Line 1129 ip_forward(m, srcrt) |
|
Line 1321 ip_forward(m, srcrt) |
|
struct mbuf *m; |
struct mbuf *m; |
int srcrt; |
int srcrt; |
{ |
{ |
register struct ip *ip = mtod(m, struct ip *); |
struct ip *ip = mtod(m, struct ip *); |
register struct sockaddr_in *sin; |
struct sockaddr_in *sin; |
register struct rtentry *rt; |
struct rtentry *rt; |
int error, type = 0, code = 0; |
int error, type = 0, code = 0; |
struct mbuf *mcopy; |
struct mbuf *mcopy; |
n_long dest; |
n_long dest; |
struct ifnet *destifp; |
struct ifnet *destifp; |
|
#ifdef IPSEC |
|
struct ifnet dummyifp; |
|
#endif |
|
|
dest = 0; |
dest = 0; |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
Line 1144 ip_forward(m, srcrt) |
|
Line 1339 ip_forward(m, srcrt) |
|
ntohl(ip->ip_src.s_addr), |
ntohl(ip->ip_src.s_addr), |
ntohl(ip->ip_dst.s_addr), ip->ip_ttl); |
ntohl(ip->ip_dst.s_addr), ip->ip_ttl); |
#endif |
#endif |
if (m->m_flags & M_BCAST || in_canforward(ip->ip_dst) == 0) { |
if (m->m_flags & (M_BCAST|M_MCAST) || in_canforward(ip->ip_dst) == 0) { |
ipstat.ips_cantforward++; |
ipstat.ips_cantforward++; |
m_freem(m); |
m_freem(m); |
return; |
return; |
} |
} |
HTONS(ip->ip_id); |
|
if (ip->ip_ttl <= IPTTLDEC) { |
if (ip->ip_ttl <= IPTTLDEC) { |
icmp_error(m, ICMP_TIMXCEED, ICMP_TIMXCEED_INTRANS, dest, 0); |
icmp_error(m, ICMP_TIMXCEED, ICMP_TIMXCEED_INTRANS, dest, 0); |
return; |
return; |
Line 1196 ip_forward(m, srcrt) |
|
Line 1390 ip_forward(m, srcrt) |
|
if (rt->rt_ifa && |
if (rt->rt_ifa && |
(ip->ip_src.s_addr & ifatoia(rt->rt_ifa)->ia_subnetmask) == |
(ip->ip_src.s_addr & ifatoia(rt->rt_ifa)->ia_subnetmask) == |
ifatoia(rt->rt_ifa)->ia_subnet) { |
ifatoia(rt->rt_ifa)->ia_subnet) { |
if (rt->rt_flags & RTF_GATEWAY) |
if (rt->rt_flags & RTF_GATEWAY) |
dest = satosin(rt->rt_gateway)->sin_addr.s_addr; |
dest = satosin(rt->rt_gateway)->sin_addr.s_addr; |
else |
else |
dest = ip->ip_dst.s_addr; |
dest = ip->ip_dst.s_addr; |
/* Router requirements says to only send host redirects */ |
/* |
type = ICMP_REDIRECT; |
* Router requirements says to only send host |
code = ICMP_REDIRECT_HOST; |
* redirects. |
|
*/ |
|
type = ICMP_REDIRECT; |
|
code = ICMP_REDIRECT_HOST; |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (ipprintfs) |
if (ipprintfs) |
printf("redirect (%d) to %x\n", code, (u_int32_t)dest); |
printf("redirect (%d) to %x\n", code, |
|
(u_int32_t)dest); |
#endif |
#endif |
} |
} |
} |
} |
|
|
|
#ifdef IPSEC |
|
/* Don't lookup socket in forwading case */ |
|
ipsec_setsocket(m, NULL); |
|
#endif |
error = ip_output(m, (struct mbuf *)0, &ipforward_rt, |
error = ip_output(m, (struct mbuf *)0, &ipforward_rt, |
(IP_FORWARDING | (ip_directedbcast ? IP_ALLOWBROADCAST : 0)), 0); |
(IP_FORWARDING | (ip_directedbcast ? IP_ALLOWBROADCAST : 0)), 0); |
if (error) |
if (error) |
Line 1251 ip_forward(m, srcrt) |
|
Line 1453 ip_forward(m, srcrt) |
|
case EMSGSIZE: |
case EMSGSIZE: |
type = ICMP_UNREACH; |
type = ICMP_UNREACH; |
code = ICMP_UNREACH_NEEDFRAG; |
code = ICMP_UNREACH_NEEDFRAG; |
|
#ifndef IPSEC |
if (ipforward_rt.ro_rt) |
if (ipforward_rt.ro_rt) |
destifp = ipforward_rt.ro_rt->rt_ifp; |
destifp = ipforward_rt.ro_rt->rt_ifp; |
|
#else |
|
/* |
|
* If the packet is routed over IPsec tunnel, tell the |
|
* originator the tunnel MTU. |
|
* tunnel MTU = if MTU - sizeof(IP) - ESP/AH hdrsiz |
|
* XXX quickhack!!! |
|
*/ |
|
if (ipforward_rt.ro_rt) { |
|
struct secpolicy *sp; |
|
int ipsecerror; |
|
size_t ipsechdr; |
|
struct route *ro; |
|
|
|
sp = ipsec4_getpolicybyaddr(mcopy, |
|
IPSEC_DIR_OUTBOUND, |
|
IP_FORWARDING, |
|
&ipsecerror); |
|
|
|
if (sp == NULL) |
|
destifp = ipforward_rt.ro_rt->rt_ifp; |
|
else { |
|
/* count IPsec header size */ |
|
ipsechdr = ipsec4_hdrsiz(mcopy, |
|
IPSEC_DIR_OUTBOUND, |
|
NULL); |
|
|
|
/* |
|
* find the correct route for outer IPv4 |
|
* header, compute tunnel MTU. |
|
* |
|
* XXX BUG ALERT |
|
* The "dummyifp" code relies upon the fact |
|
* that icmp_error() touches only ifp->if_mtu. |
|
*/ |
|
/*XXX*/ |
|
destifp = NULL; |
|
if (sp->req != NULL |
|
&& sp->req->sav != NULL |
|
&& sp->req->sav->sah != NULL) { |
|
ro = &sp->req->sav->sah->sa_route; |
|
if (ro->ro_rt && ro->ro_rt->rt_ifp) { |
|
dummyifp.if_mtu = |
|
ro->ro_rt->rt_ifp->if_mtu; |
|
dummyifp.if_mtu -= ipsechdr; |
|
destifp = &dummyifp; |
|
} |
|
} |
|
|
|
key_freesp(sp); |
|
} |
|
} |
|
#endif /*IPSEC*/ |
ipstat.ips_cantfrag++; |
ipstat.ips_cantfrag++; |
break; |
break; |
|
|
Line 1266 ip_forward(m, srcrt) |
|
Line 1521 ip_forward(m, srcrt) |
|
|
|
void |
void |
ip_savecontrol(inp, mp, ip, m) |
ip_savecontrol(inp, mp, ip, m) |
register struct inpcb *inp; |
struct inpcb *inp; |
register struct mbuf **mp; |
struct mbuf **mp; |
register struct ip *ip; |
struct ip *ip; |
register struct mbuf *m; |
struct mbuf *m; |
{ |
{ |
|
|
if (inp->inp_socket->so_options & SO_TIMESTAMP) { |
if (inp->inp_socket->so_options & SO_TIMESTAMP) { |
Line 1333 ip_sysctl(name, namelen, oldp, oldlenp, |
|
Line 1588 ip_sysctl(name, namelen, oldp, oldlenp, |
|
void *newp; |
void *newp; |
size_t newlen; |
size_t newlen; |
{ |
{ |
extern int subnetsarelocal; |
extern int subnetsarelocal, hostzeroisbroadcast; |
|
|
int error, old; |
int error, old; |
|
|
Line 1425 ip_sysctl(name, namelen, oldp, oldlenp, |
|
Line 1680 ip_sysctl(name, namelen, oldp, oldlenp, |
|
return (error); |
return (error); |
} |
} |
#endif |
#endif |
|
case IPCTL_HOSTZEROBROADCAST: |
|
return (sysctl_int(oldp, oldlenp, newp, newlen, |
|
&hostzeroisbroadcast)); |
|
#if NGIF > 0 |
|
case IPCTL_GIF_TTL: |
|
return(sysctl_int(oldp, oldlenp, newp, newlen, |
|
&ip_gif_ttl)); |
|
#endif |
|
|
default: |
default: |
return (EOPNOTSUPP); |
return (EOPNOTSUPP); |
} |
} |