version 1.60, 1998/04/29 03:44:11 |
version 1.72, 1998/10/08 01:19:25 |
|
|
/* $NetBSD$ */ |
/* $NetBSD$ */ |
|
|
/*- |
|
* Copyright (c) 1998 The NetBSD Foundation, Inc. |
|
* All rights reserved. |
|
* |
|
* This code is derived from software contributed to The NetBSD Foundation |
|
* by Public Access Networks Corporation ("Panix"). It was developed under |
|
* contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon. |
|
* |
|
* 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 NetBSD |
|
* Foundation, Inc. and its contributors. |
|
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION OR CONTRIBUTORS |
|
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
* POSSIBILITY OF SUCH DAMAGE. |
|
*/ |
|
|
|
/* |
/* |
* Copyright (c) 1982, 1986, 1988, 1993 |
* Copyright (c) 1982, 1986, 1988, 1993 |
* The Regents of the University of California. All rights reserved. |
* The Regents of the University of California. All rights reserved. |
|
|
* @(#)ip_input.c 8.2 (Berkeley) 1/4/94 |
* @(#)ip_input.c 8.2 (Berkeley) 1/4/94 |
*/ |
*/ |
|
|
|
/*- |
|
* Copyright (c) 1998 The NetBSD Foundation, Inc. |
|
* All rights reserved. |
|
* |
|
* This code is derived from software contributed to The NetBSD Foundation |
|
* by Public Access Networks Corporation ("Panix"). It was developed under |
|
* contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon. |
|
* |
|
* 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 NetBSD |
|
* Foundation, Inc. and its contributors. |
|
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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. |
|
*/ |
|
|
|
#include "opt_gateway.h" |
|
#include "opt_pfil_hooks.h" |
#include "opt_mrouting.h" |
#include "opt_mrouting.h" |
|
|
#include <sys/param.h> |
#include <sys/param.h> |
|
|
#include <sys/time.h> |
#include <sys/time.h> |
#include <sys/kernel.h> |
#include <sys/kernel.h> |
#include <sys/proc.h> |
#include <sys/proc.h> |
|
#include <sys/pool.h> |
|
|
#include <vm/vm.h> |
#include <vm/vm.h> |
#include <sys/sysctl.h> |
#include <sys/sysctl.h> |
|
|
#define IPMTUDISC 0 |
#define IPMTUDISC 0 |
#endif |
#endif |
#ifndef IPMTUDISCTIMEOUT |
#ifndef IPMTUDISCTIMEOUT |
#define IPMTUDISCTIMEOUT (1 * 60) /* experimental short timeout value! */ |
#define IPMTUDISCTIMEOUT (10 * 60) /* as per RFC 1191 */ |
#endif |
#endif |
|
|
/* |
/* |
Line 158 int ipqmaxlen = IFQ_MAXLEN; |
|
Line 161 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; |
|
u_int16_t ip_id; |
|
int ip_defttl; |
|
struct ipqhead ipq; |
|
|
|
struct pool ipqent_pool; |
|
|
/* |
/* |
* We need to save the IP options in case a protocol wants to respond |
* We need to save the IP options in case a protocol wants to respond |
|
|
register struct protosw *pr; |
register struct protosw *pr; |
register int i; |
register int i; |
|
|
|
pool_init(&ipqent_pool, sizeof(struct ipqent), 0, 0, 0, "ipqepl", |
|
0, NULL, NULL, M_IPQ); |
|
|
pr = pffindproto(PF_INET, IPPROTO_RAW, SOCK_RAW); |
pr = pffindproto(PF_INET, IPPROTO_RAW, SOCK_RAW); |
if (pr == 0) |
if (pr == 0) |
panic("ip_init"); |
panic("ip_init"); |
|
|
m_adj(m, len - m->m_pkthdr.len); |
m_adj(m, len - m->m_pkthdr.len); |
} |
} |
|
|
|
/* |
|
* Assume that we can create a fast-forward IP flow entry |
|
* based on this packet. |
|
*/ |
|
m->m_flags |= M_CANFASTFWD; |
|
|
#ifdef PFIL_HOOKS |
#ifdef PFIL_HOOKS |
/* |
/* |
* Run through list of hooks for input packets. |
* Run through list of hooks for input packets. If there are any |
|
* filters which require that additional packets in the flow are |
|
* not fast-forwarded, they must clear the M_CANFASTFWD flag. |
|
* Note that filters must _never_ set this flag, as another filter |
|
* 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) |
for (pfh = pfil_hook_get(PFIL_IN); pfh; pfh = pfh->pfil_link.tqe_next) |
|
|
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; |
goto next; |
ip = mtod(m = m0, struct ip *); |
m = m0; |
|
if (m == NULL) |
|
goto next; |
|
ip = mtod(m, struct ip *); |
} |
} |
#endif /* PFIL_HOOKS */ |
#endif /* PFIL_HOOKS */ |
|
|
|
|
*/ |
*/ |
if (mff || ip->ip_off) { |
if (mff || ip->ip_off) { |
ipstat.ips_fragments++; |
ipstat.ips_fragments++; |
MALLOC(ipqe, struct ipqent *, sizeof (struct ipqent), |
ipqe = pool_get(&ipqent_pool, PR_NOWAIT); |
M_IPQ, M_NOWAIT); |
|
if (ipqe == NULL) { |
if (ipqe == NULL) { |
ipstat.ips_rcvmemdrop++; |
ipstat.ips_rcvmemdrop++; |
goto bad; |
goto bad; |
Line 590 ip_reass(ipqe, fp) |
|
Line 614 ip_reass(ipqe, fp) |
|
nq = q->ipqe_q.le_next; |
nq = q->ipqe_q.le_next; |
m_freem(q->ipqe_m); |
m_freem(q->ipqe_m); |
LIST_REMOVE(q, ipqe_q); |
LIST_REMOVE(q, ipqe_q); |
FREE(q, M_IPQ); |
pool_put(&ipqent_pool, q); |
} |
} |
|
|
insert: |
insert: |
|
|
m->m_next = 0; |
m->m_next = 0; |
m_cat(m, t); |
m_cat(m, t); |
nq = q->ipqe_q.le_next; |
nq = q->ipqe_q.le_next; |
FREE(q, M_IPQ); |
pool_put(&ipqent_pool, q); |
for (q = nq; q != NULL; q = nq) { |
for (q = nq; q != NULL; q = nq) { |
t = q->ipqe_m; |
t = q->ipqe_m; |
nq = q->ipqe_q.le_next; |
nq = q->ipqe_q.le_next; |
FREE(q, M_IPQ); |
pool_put(&ipqent_pool, q); |
m_cat(m, t); |
m_cat(m, t); |
} |
} |
|
|
|
|
dropfrag: |
dropfrag: |
ipstat.ips_fragdropped++; |
ipstat.ips_fragdropped++; |
m_freem(m); |
m_freem(m); |
FREE(ipqe, M_IPQ); |
pool_put(&ipqent_pool, ipqe); |
return (0); |
return (0); |
} |
} |
|
|
|
|
p = q->ipqe_q.le_next; |
p = q->ipqe_q.le_next; |
m_freem(q->ipqe_m); |
m_freem(q->ipqe_m); |
LIST_REMOVE(q, ipqe_q); |
LIST_REMOVE(q, ipqe_q); |
FREE(q, M_IPQ); |
pool_put(&ipqent_pool, q); |
} |
} |
LIST_REMOVE(fp, ipq_q); |
LIST_REMOVE(fp, ipq_q); |
FREE(fp, M_FTABLE); |
FREE(fp, M_FTABLE); |
|
|
ip_freef(fp); |
ip_freef(fp); |
} |
} |
} |
} |
|
#ifdef GATEWAY |
|
ipflow_slowtimo(); |
|
#endif |
splx(s); |
splx(s); |
} |
} |
|
|
|
|
break; |
break; |
|
|
case IPOPT_TS_TSANDADDR: |
case IPOPT_TS_TSANDADDR: |
if (ipt->ipt_ptr + 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; |
ipaddr.sin_addr = dst; |
ipaddr.sin_addr = dst; |
|
|
break; |
break; |
|
|
case IPOPT_TS_PRESPEC: |
case IPOPT_TS_PRESPEC: |
if (ipt->ipt_ptr + 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((caddr_t)sin, (caddr_t)&ipaddr.sin_addr, |
Line 1109 ip_forward(m, srcrt) |
|
Line 1136 ip_forward(m, srcrt) |
|
dest = 0; |
dest = 0; |
#ifdef DIAGNOSTIC |
#ifdef DIAGNOSTIC |
if (ipprintfs) |
if (ipprintfs) |
printf("forward: src %x dst %x ttl %x\n", |
printf("forward: src %2.2x dst %2.2x ttl %x\n", |
ip->ip_src.s_addr, ip->ip_dst.s_addr, ip->ip_ttl); |
ntohl(ip->ip_src.s_addr), |
|
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 || in_canforward(ip->ip_dst) == 0) { |
ipstat.ips_cantforward++; |
ipstat.ips_cantforward++; |
Line 1187 ip_forward(m, srcrt) |
|
Line 1215 ip_forward(m, srcrt) |
|
if (type) |
if (type) |
ipstat.ips_redirectsent++; |
ipstat.ips_redirectsent++; |
else { |
else { |
if (mcopy) |
if (mcopy) { |
|
#ifdef GATEWAY |
|
if (mcopy->m_flags & M_CANFASTFWD) |
|
ipflow_create(&ipforward_rt, mcopy); |
|
#endif |
m_freem(mcopy); |
m_freem(mcopy); |
|
} |
return; |
return; |
} |
} |
} |
} |
Line 1375 ip_sysctl(name, namelen, oldp, oldlenp, |
|
Line 1408 ip_sysctl(name, namelen, oldp, oldlenp, |
|
rt_timer_queue_change(ip_mtudisc_timeout_q, |
rt_timer_queue_change(ip_mtudisc_timeout_q, |
ip_mtudisc_timeout); |
ip_mtudisc_timeout); |
return (error); |
return (error); |
|
#ifdef GATEWAY |
|
case IPCTL_MAXFLOWS: |
|
{ |
|
int s; |
|
|
|
error = sysctl_int(oldp, oldlenp, newp, newlen, |
|
&ip_maxflows); |
|
s = splsoftnet(); |
|
ipflow_reap(0); |
|
splx(s); |
|
return (error); |
|
} |
|
#endif |
default: |
default: |
return (EOPNOTSUPP); |
return (EOPNOTSUPP); |
} |
} |