2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* INET An implementation of the TCP/IP protocol suite for the LINUX
|
|
|
|
* operating system. INET is implemented using the BSD Socket
|
|
|
|
* interface as the means of communication with the user level.
|
|
|
|
*
|
|
|
|
* ROUTE - implementation of the IP router.
|
|
|
|
*
|
2005-05-06 01:16:16 +02:00
|
|
|
* Authors: Ross Biro
|
2005-04-17 00:20:36 +02:00
|
|
|
* Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
|
|
|
|
* Alan Cox, <gw4pts@gw4pts.ampr.org>
|
|
|
|
* Linus Torvalds, <Linus.Torvalds@helsinki.fi>
|
|
|
|
* Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
|
|
|
|
*
|
|
|
|
* Fixes:
|
|
|
|
* Alan Cox : Verify area fixes.
|
|
|
|
* Alan Cox : cli() protects routing changes
|
|
|
|
* Rui Oliveira : ICMP routing table updates
|
|
|
|
* (rco@di.uminho.pt) Routing table insertion and update
|
|
|
|
* Linus Torvalds : Rewrote bits to be sensible
|
|
|
|
* Alan Cox : Added BSD route gw semantics
|
2007-02-09 15:24:47 +01:00
|
|
|
* Alan Cox : Super /proc >4K
|
2005-04-17 00:20:36 +02:00
|
|
|
* Alan Cox : MTU in route table
|
|
|
|
* Alan Cox : MSS actually. Also added the window
|
|
|
|
* clamper.
|
|
|
|
* Sam Lantinga : Fixed route matching in rt_del()
|
|
|
|
* Alan Cox : Routing cache support.
|
|
|
|
* Alan Cox : Removed compatibility cruft.
|
|
|
|
* Alan Cox : RTF_REJECT support.
|
|
|
|
* Alan Cox : TCP irtt support.
|
|
|
|
* Jonathan Naylor : Added Metric support.
|
|
|
|
* Miquel van Smoorenburg : BSD API fixes.
|
|
|
|
* Miquel van Smoorenburg : Metrics.
|
|
|
|
* Alan Cox : Use __u32 properly
|
|
|
|
* Alan Cox : Aligned routing errors more closely with BSD
|
|
|
|
* our system is still very different.
|
|
|
|
* Alan Cox : Faster /proc handling
|
|
|
|
* Alexey Kuznetsov : Massive rework to support tree based routing,
|
|
|
|
* routing caches and better behaviour.
|
2007-02-09 15:24:47 +01:00
|
|
|
*
|
2005-04-17 00:20:36 +02:00
|
|
|
* Olaf Erb : irtt wasn't being copied right.
|
|
|
|
* Bjorn Ekwall : Kerneld route support.
|
|
|
|
* Alan Cox : Multicast fixed (I hope)
|
|
|
|
* Pavel Krauz : Limited broadcast fixed
|
|
|
|
* Mike McLagan : Routing by source
|
|
|
|
* Alexey Kuznetsov : End of old history. Split to fib.c and
|
|
|
|
* route.c and rewritten from scratch.
|
|
|
|
* Andi Kleen : Load-limit warning messages.
|
|
|
|
* Vitaly E. Lavrov : Transparent proxy revived after year coma.
|
|
|
|
* Vitaly E. Lavrov : Race condition in ip_route_input_slow.
|
|
|
|
* Tobias Ringstrom : Uninitialized res.type in ip_route_output_slow.
|
|
|
|
* Vladimir V. Ivanov : IP rule info (flowid) is really useful.
|
|
|
|
* Marc Boucher : routing by fwmark
|
|
|
|
* Robert Olsson : Added rt_cache statistics
|
|
|
|
* Arnaldo C. Melo : Convert proc stuff to seq_file
|
2005-07-06 00:00:32 +02:00
|
|
|
* Eric Dumazet : hashed spinlocks and rt_check_expire() fixes.
|
2006-03-25 10:38:55 +01:00
|
|
|
* Ilia Sotnikov : Ignore TOS on PMTUD and Redirect
|
|
|
|
* Ilia Sotnikov : Removed TOS from hash calculations
|
2005-04-17 00:20:36 +02:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <linux/bitops.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/mm.h>
|
2005-07-05 23:58:19 +02:00
|
|
|
#include <linux/bootmem.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/socket.h>
|
|
|
|
#include <linux/sockios.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/in.h>
|
|
|
|
#include <linux/inet.h>
|
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/init.h>
|
2007-09-15 19:55:54 +02:00
|
|
|
#include <linux/workqueue.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <linux/inetdevice.h>
|
|
|
|
#include <linux/igmp.h>
|
|
|
|
#include <linux/pkt_sched.h>
|
|
|
|
#include <linux/mroute.h>
|
|
|
|
#include <linux/netfilter_ipv4.h>
|
|
|
|
#include <linux/random.h>
|
|
|
|
#include <linux/jhash.h>
|
|
|
|
#include <linux/rcupdate.h>
|
|
|
|
#include <linux/times.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 09:04:11 +01:00
|
|
|
#include <linux/slab.h>
|
2007-11-14 06:34:06 +01:00
|
|
|
#include <net/dst.h>
|
2007-09-12 12:01:34 +02:00
|
|
|
#include <net/net_namespace.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <net/protocol.h>
|
|
|
|
#include <net/ip.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/inetpeer.h>
|
|
|
|
#include <net/sock.h>
|
|
|
|
#include <net/ip_fib.h>
|
|
|
|
#include <net/arp.h>
|
|
|
|
#include <net/tcp.h>
|
|
|
|
#include <net/icmp.h>
|
|
|
|
#include <net/xfrm.h>
|
2006-07-31 05:43:36 +02:00
|
|
|
#include <net/netevent.h>
|
2007-03-22 19:55:17 +01:00
|
|
|
#include <net/rtnetlink.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_SYSCTL
|
|
|
|
#include <linux/sysctl.h>
|
|
|
|
#endif
|
2011-08-04 05:50:44 +02:00
|
|
|
#include <net/secure_seq.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-12 02:07:33 +01:00
|
|
|
#define RT_FL_TOS(oldflp4) \
|
2011-12-02 12:39:42 +01:00
|
|
|
((oldflp4)->flowi4_tos & (IPTOS_RT_MASK | RTO_ONLINK))
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
#define IP_MAX_MTU 0xFFF0
|
|
|
|
|
|
|
|
#define RT_GC_TIMEOUT (300*HZ)
|
|
|
|
|
|
|
|
static int ip_rt_max_size;
|
2008-03-23 01:43:59 +01:00
|
|
|
static int ip_rt_gc_timeout __read_mostly = RT_GC_TIMEOUT;
|
|
|
|
static int ip_rt_gc_min_interval __read_mostly = HZ / 2;
|
|
|
|
static int ip_rt_redirect_number __read_mostly = 9;
|
|
|
|
static int ip_rt_redirect_load __read_mostly = HZ / 50;
|
|
|
|
static int ip_rt_redirect_silence __read_mostly = ((HZ / 50) << (9 + 1));
|
|
|
|
static int ip_rt_error_cost __read_mostly = HZ;
|
|
|
|
static int ip_rt_error_burst __read_mostly = 5 * HZ;
|
|
|
|
static int ip_rt_gc_elasticity __read_mostly = 8;
|
|
|
|
static int ip_rt_mtu_expires __read_mostly = 10 * 60 * HZ;
|
|
|
|
static int ip_rt_min_pmtu __read_mostly = 512 + 20 + 20;
|
|
|
|
static int ip_rt_min_advmss __read_mostly = 256;
|
2008-10-27 20:28:25 +01:00
|
|
|
static int rt_chain_length_max __read_mostly = 20;
|
2011-11-26 13:13:44 +01:00
|
|
|
static int redirect_genid;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Interface to generic destination cache.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static struct dst_entry *ipv4_dst_check(struct dst_entry *dst, u32 cookie);
|
2010-12-13 21:52:14 +01:00
|
|
|
static unsigned int ipv4_default_advmss(const struct dst_entry *dst);
|
2011-11-23 03:12:51 +01:00
|
|
|
static unsigned int ipv4_mtu(const struct dst_entry *dst);
|
2005-04-17 00:20:36 +02:00
|
|
|
static void ipv4_dst_destroy(struct dst_entry *dst);
|
|
|
|
static struct dst_entry *ipv4_negative_advice(struct dst_entry *dst);
|
|
|
|
static void ipv4_link_failure(struct sk_buff *skb);
|
|
|
|
static void ip_rt_update_pmtu(struct dst_entry *dst, u32 mtu);
|
2008-01-18 12:56:57 +01:00
|
|
|
static int rt_garbage_collect(struct dst_ops *ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-11-11 08:14:07 +01:00
|
|
|
static void ipv4_dst_ifdown(struct dst_entry *dst, struct net_device *dev,
|
|
|
|
int how)
|
|
|
|
{
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
net: Implement read-only protection and COW'ing of metrics.
Routing metrics are now copy-on-write.
Initially a route entry points it's metrics at a read-only location.
If a routing table entry exists, it will point there. Else it will
point at the all zero metric place-holder called 'dst_default_metrics'.
The writeability state of the metrics is stored in the low bits of the
metrics pointer, we have two bits left to spare if we want to store
more states.
For the initial implementation, COW is implemented simply via kmalloc.
However future enhancements will change this to place the writable
metrics somewhere else, in order to increase sharing. Very likely
this "somewhere else" will be the inetpeer cache.
Note also that this means that metrics updates may transiently fail
if we cannot COW the metrics successfully.
But even by itself, this patch should decrease memory usage and
increase cache locality especially for routing workloads. In those
cases the read-only metric copies stay in place and never get written
to.
TCP workloads where metrics get updated, and those rare cases where
PMTU triggers occur, will take a very slight performance hit. But
that hit will be alleviated when the long-term writable metrics
move to a more sharable location.
Since the metrics storage went from a u32 array of RTAX_MAX entries to
what is essentially a pointer, some retooling of the dst_entry layout
was necessary.
Most importantly, we need to preserve the alignment of the reference
count so that it doesn't share cache lines with the read-mostly state,
as per Eric Dumazet's alignment assertion checks.
The only non-trivial bit here is the move of the 'flags' member into
the writeable cacheline. This is OK since we are always accessing the
flags around the same moment when we made a modification to the
reference count.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-01-27 05:51:05 +01:00
|
|
|
static u32 *ipv4_cow_metrics(struct dst_entry *dst, unsigned long old)
|
|
|
|
{
|
2011-01-27 23:58:42 +01:00
|
|
|
struct rtable *rt = (struct rtable *) dst;
|
|
|
|
struct inet_peer *peer;
|
|
|
|
u32 *p = NULL;
|
|
|
|
|
|
|
|
if (!rt->peer)
|
2011-05-19 00:42:43 +02:00
|
|
|
rt_bind_peer(rt, rt->rt_dst, 1);
|
net: Implement read-only protection and COW'ing of metrics.
Routing metrics are now copy-on-write.
Initially a route entry points it's metrics at a read-only location.
If a routing table entry exists, it will point there. Else it will
point at the all zero metric place-holder called 'dst_default_metrics'.
The writeability state of the metrics is stored in the low bits of the
metrics pointer, we have two bits left to spare if we want to store
more states.
For the initial implementation, COW is implemented simply via kmalloc.
However future enhancements will change this to place the writable
metrics somewhere else, in order to increase sharing. Very likely
this "somewhere else" will be the inetpeer cache.
Note also that this means that metrics updates may transiently fail
if we cannot COW the metrics successfully.
But even by itself, this patch should decrease memory usage and
increase cache locality especially for routing workloads. In those
cases the read-only metric copies stay in place and never get written
to.
TCP workloads where metrics get updated, and those rare cases where
PMTU triggers occur, will take a very slight performance hit. But
that hit will be alleviated when the long-term writable metrics
move to a more sharable location.
Since the metrics storage went from a u32 array of RTAX_MAX entries to
what is essentially a pointer, some retooling of the dst_entry layout
was necessary.
Most importantly, we need to preserve the alignment of the reference
count so that it doesn't share cache lines with the read-mostly state,
as per Eric Dumazet's alignment assertion checks.
The only non-trivial bit here is the move of the 'flags' member into
the writeable cacheline. This is OK since we are always accessing the
flags around the same moment when we made a modification to the
reference count.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-01-27 05:51:05 +01:00
|
|
|
|
2011-01-27 23:58:42 +01:00
|
|
|
peer = rt->peer;
|
|
|
|
if (peer) {
|
net: Implement read-only protection and COW'ing of metrics.
Routing metrics are now copy-on-write.
Initially a route entry points it's metrics at a read-only location.
If a routing table entry exists, it will point there. Else it will
point at the all zero metric place-holder called 'dst_default_metrics'.
The writeability state of the metrics is stored in the low bits of the
metrics pointer, we have two bits left to spare if we want to store
more states.
For the initial implementation, COW is implemented simply via kmalloc.
However future enhancements will change this to place the writable
metrics somewhere else, in order to increase sharing. Very likely
this "somewhere else" will be the inetpeer cache.
Note also that this means that metrics updates may transiently fail
if we cannot COW the metrics successfully.
But even by itself, this patch should decrease memory usage and
increase cache locality especially for routing workloads. In those
cases the read-only metric copies stay in place and never get written
to.
TCP workloads where metrics get updated, and those rare cases where
PMTU triggers occur, will take a very slight performance hit. But
that hit will be alleviated when the long-term writable metrics
move to a more sharable location.
Since the metrics storage went from a u32 array of RTAX_MAX entries to
what is essentially a pointer, some retooling of the dst_entry layout
was necessary.
Most importantly, we need to preserve the alignment of the reference
count so that it doesn't share cache lines with the read-mostly state,
as per Eric Dumazet's alignment assertion checks.
The only non-trivial bit here is the move of the 'flags' member into
the writeable cacheline. This is OK since we are always accessing the
flags around the same moment when we made a modification to the
reference count.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-01-27 05:51:05 +01:00
|
|
|
u32 *old_p = __DST_METRICS_PTR(old);
|
|
|
|
unsigned long prev, new;
|
|
|
|
|
2011-01-27 23:58:42 +01:00
|
|
|
p = peer->metrics;
|
|
|
|
if (inet_metrics_new(peer))
|
|
|
|
memcpy(p, old_p, sizeof(u32) * RTAX_MAX);
|
net: Implement read-only protection and COW'ing of metrics.
Routing metrics are now copy-on-write.
Initially a route entry points it's metrics at a read-only location.
If a routing table entry exists, it will point there. Else it will
point at the all zero metric place-holder called 'dst_default_metrics'.
The writeability state of the metrics is stored in the low bits of the
metrics pointer, we have two bits left to spare if we want to store
more states.
For the initial implementation, COW is implemented simply via kmalloc.
However future enhancements will change this to place the writable
metrics somewhere else, in order to increase sharing. Very likely
this "somewhere else" will be the inetpeer cache.
Note also that this means that metrics updates may transiently fail
if we cannot COW the metrics successfully.
But even by itself, this patch should decrease memory usage and
increase cache locality especially for routing workloads. In those
cases the read-only metric copies stay in place and never get written
to.
TCP workloads where metrics get updated, and those rare cases where
PMTU triggers occur, will take a very slight performance hit. But
that hit will be alleviated when the long-term writable metrics
move to a more sharable location.
Since the metrics storage went from a u32 array of RTAX_MAX entries to
what is essentially a pointer, some retooling of the dst_entry layout
was necessary.
Most importantly, we need to preserve the alignment of the reference
count so that it doesn't share cache lines with the read-mostly state,
as per Eric Dumazet's alignment assertion checks.
The only non-trivial bit here is the move of the 'flags' member into
the writeable cacheline. This is OK since we are always accessing the
flags around the same moment when we made a modification to the
reference count.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-01-27 05:51:05 +01:00
|
|
|
|
|
|
|
new = (unsigned long) p;
|
|
|
|
prev = cmpxchg(&dst->_metrics, old, new);
|
|
|
|
|
|
|
|
if (prev != old) {
|
|
|
|
p = __DST_METRICS_PTR(prev);
|
|
|
|
if (prev & DST_METRICS_READ_ONLY)
|
|
|
|
p = NULL;
|
|
|
|
} else {
|
|
|
|
if (rt->fi) {
|
|
|
|
fib_info_put(rt->fi);
|
|
|
|
rt->fi = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2011-07-18 09:40:17 +02:00
|
|
|
static struct neighbour *ipv4_neigh_lookup(const struct dst_entry *dst, const void *daddr);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static struct dst_ops ipv4_dst_ops = {
|
|
|
|
.family = AF_INET,
|
2009-02-01 09:45:17 +01:00
|
|
|
.protocol = cpu_to_be16(ETH_P_IP),
|
2005-04-17 00:20:36 +02:00
|
|
|
.gc = rt_garbage_collect,
|
|
|
|
.check = ipv4_dst_check,
|
2010-12-13 21:52:14 +01:00
|
|
|
.default_advmss = ipv4_default_advmss,
|
2011-11-23 03:12:51 +01:00
|
|
|
.mtu = ipv4_mtu,
|
net: Implement read-only protection and COW'ing of metrics.
Routing metrics are now copy-on-write.
Initially a route entry points it's metrics at a read-only location.
If a routing table entry exists, it will point there. Else it will
point at the all zero metric place-holder called 'dst_default_metrics'.
The writeability state of the metrics is stored in the low bits of the
metrics pointer, we have two bits left to spare if we want to store
more states.
For the initial implementation, COW is implemented simply via kmalloc.
However future enhancements will change this to place the writable
metrics somewhere else, in order to increase sharing. Very likely
this "somewhere else" will be the inetpeer cache.
Note also that this means that metrics updates may transiently fail
if we cannot COW the metrics successfully.
But even by itself, this patch should decrease memory usage and
increase cache locality especially for routing workloads. In those
cases the read-only metric copies stay in place and never get written
to.
TCP workloads where metrics get updated, and those rare cases where
PMTU triggers occur, will take a very slight performance hit. But
that hit will be alleviated when the long-term writable metrics
move to a more sharable location.
Since the metrics storage went from a u32 array of RTAX_MAX entries to
what is essentially a pointer, some retooling of the dst_entry layout
was necessary.
Most importantly, we need to preserve the alignment of the reference
count so that it doesn't share cache lines with the read-mostly state,
as per Eric Dumazet's alignment assertion checks.
The only non-trivial bit here is the move of the 'flags' member into
the writeable cacheline. This is OK since we are always accessing the
flags around the same moment when we made a modification to the
reference count.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-01-27 05:51:05 +01:00
|
|
|
.cow_metrics = ipv4_cow_metrics,
|
2005-04-17 00:20:36 +02:00
|
|
|
.destroy = ipv4_dst_destroy,
|
|
|
|
.ifdown = ipv4_dst_ifdown,
|
|
|
|
.negative_advice = ipv4_negative_advice,
|
|
|
|
.link_failure = ipv4_link_failure,
|
|
|
|
.update_pmtu = ip_rt_update_pmtu,
|
2008-05-20 23:32:14 +02:00
|
|
|
.local_out = __ip_local_out,
|
2011-07-18 09:40:17 +02:00
|
|
|
.neigh_lookup = ipv4_neigh_lookup,
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
#define ECN_OR_COST(class) TC_PRIO_##class
|
|
|
|
|
2007-07-10 00:32:57 +02:00
|
|
|
const __u8 ip_tos2prio[16] = {
|
2005-04-17 00:20:36 +02:00
|
|
|
TC_PRIO_BESTEFFORT,
|
2011-03-15 14:56:07 +01:00
|
|
|
ECN_OR_COST(BESTEFFORT),
|
2005-04-17 00:20:36 +02:00
|
|
|
TC_PRIO_BESTEFFORT,
|
|
|
|
ECN_OR_COST(BESTEFFORT),
|
|
|
|
TC_PRIO_BULK,
|
|
|
|
ECN_OR_COST(BULK),
|
|
|
|
TC_PRIO_BULK,
|
|
|
|
ECN_OR_COST(BULK),
|
|
|
|
TC_PRIO_INTERACTIVE,
|
|
|
|
ECN_OR_COST(INTERACTIVE),
|
|
|
|
TC_PRIO_INTERACTIVE,
|
|
|
|
ECN_OR_COST(INTERACTIVE),
|
|
|
|
TC_PRIO_INTERACTIVE_BULK,
|
|
|
|
ECN_OR_COST(INTERACTIVE_BULK),
|
|
|
|
TC_PRIO_INTERACTIVE_BULK,
|
|
|
|
ECN_OR_COST(INTERACTIVE_BULK)
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Route cache.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* The locking scheme is rather straight forward:
|
|
|
|
*
|
|
|
|
* 1) Read-Copy Update protects the buckets of the central route hash.
|
|
|
|
* 2) Only writers remove entries, and they hold the lock
|
|
|
|
* as they look at rtable reference counts.
|
|
|
|
* 3) Only readers acquire references to rtable entries,
|
|
|
|
* they do so with atomic increments and with the
|
|
|
|
* lock held.
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct rt_hash_bucket {
|
2010-10-25 23:02:07 +02:00
|
|
|
struct rtable __rcu *chain;
|
2005-07-05 23:55:24 +02:00
|
|
|
};
|
2008-10-27 20:28:25 +01:00
|
|
|
|
2006-07-03 09:24:54 +02:00
|
|
|
#if defined(CONFIG_SMP) || defined(CONFIG_DEBUG_SPINLOCK) || \
|
|
|
|
defined(CONFIG_PROVE_LOCKING)
|
2005-07-05 23:55:24 +02:00
|
|
|
/*
|
|
|
|
* Instead of using one spinlock for each rt_hash_bucket, we use a table of spinlocks
|
|
|
|
* The size of this table is a power of two and depends on the number of CPUS.
|
2006-07-03 09:24:59 +02:00
|
|
|
* (on lockdep we have a quite big spinlock_t, so keep the size down there)
|
2005-07-05 23:55:24 +02:00
|
|
|
*/
|
2006-07-03 09:24:59 +02:00
|
|
|
#ifdef CONFIG_LOCKDEP
|
|
|
|
# define RT_HASH_LOCK_SZ 256
|
2005-07-05 23:55:24 +02:00
|
|
|
#else
|
2006-07-03 09:24:59 +02:00
|
|
|
# if NR_CPUS >= 32
|
|
|
|
# define RT_HASH_LOCK_SZ 4096
|
|
|
|
# elif NR_CPUS >= 16
|
|
|
|
# define RT_HASH_LOCK_SZ 2048
|
|
|
|
# elif NR_CPUS >= 8
|
|
|
|
# define RT_HASH_LOCK_SZ 1024
|
|
|
|
# elif NR_CPUS >= 4
|
|
|
|
# define RT_HASH_LOCK_SZ 512
|
|
|
|
# else
|
|
|
|
# define RT_HASH_LOCK_SZ 256
|
|
|
|
# endif
|
2005-07-05 23:55:24 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
static spinlock_t *rt_hash_locks;
|
|
|
|
# define rt_hash_lock_addr(slot) &rt_hash_locks[(slot) & (RT_HASH_LOCK_SZ - 1)]
|
2007-12-06 06:15:05 +01:00
|
|
|
|
|
|
|
static __init void rt_hash_lock_init(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
rt_hash_locks = kmalloc(sizeof(spinlock_t) * RT_HASH_LOCK_SZ,
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!rt_hash_locks)
|
|
|
|
panic("IP: failed to allocate rt_hash_locks\n");
|
|
|
|
|
|
|
|
for (i = 0; i < RT_HASH_LOCK_SZ; i++)
|
|
|
|
spin_lock_init(&rt_hash_locks[i]);
|
|
|
|
}
|
2005-07-05 23:55:24 +02:00
|
|
|
#else
|
|
|
|
# define rt_hash_lock_addr(slot) NULL
|
2007-12-06 06:15:05 +01:00
|
|
|
|
|
|
|
static inline void rt_hash_lock_init(void)
|
|
|
|
{
|
|
|
|
}
|
2005-07-05 23:55:24 +02:00
|
|
|
#endif
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-03-23 01:43:59 +01:00
|
|
|
static struct rt_hash_bucket *rt_hash_table __read_mostly;
|
|
|
|
static unsigned rt_hash_mask __read_mostly;
|
|
|
|
static unsigned int rt_hash_log __read_mostly;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
[IPV4]: rt_cache_stat can be statically defined
Using __get_cpu_var(obj) is slightly faster than per_cpu_ptr(obj,
raw_smp_processor_id()).
1) Smaller code and memory use
For static and small objects, DEFINE_PER_CPU(type, object) is preferred over a
alloc_percpu() : Better and smaller code to access them, and no extra memory
(storing the pointer, and the percpu array of pointers)
x86_64 code before patch
mov 1237577(%rip),%rax # ffffffff803e5990 <rt_cache_stat>
not %rax # part of per_cpu machinery
mov %gs:0x3c,%edx # get cpu number
movslq %edx,%rdx # extend 32 bits cpu number to 64 bits
mov (%rax,%rdx,8),%rax # get the pointer for this cpu
incl 0x38(%rax)
x86_64 code after patch
mov $per_cpu__rt_cache_stat,%rdx
mov %gs:0x48,%rax # get percpu data offset
incl 0x38(%rax,%rdx,1)
2) False sharing avoidance for SMP :
For a small NR_CPUS, the array of per cpu pointers allocated in alloc_percpu()
can be <= 32 bytes. This let slab code gives a part of a cache line. If the
other part of this 64 bytes (or 128 bytes) cache line is used by a mostly
written object, we can have false sharing and expensive per_cpu_ptr() operations.
Size of rt_cache_stat is 64 bytes, so this patch is not a danger of a too big
increase of bss (in UP mode) or static per_cpu data for SMP
(PERCPU_ENOUGH_ROOM is currently 32768 bytes)
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2006-01-17 11:54:36 +01:00
|
|
|
static DEFINE_PER_CPU(struct rt_cache_stat, rt_cache_stat);
|
2010-05-20 00:07:23 +02:00
|
|
|
#define RT_CACHE_STAT_INC(field) __this_cpu_inc(rt_cache_stat.field)
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-07-06 04:04:09 +02:00
|
|
|
static inline unsigned int rt_hash(__be32 daddr, __be32 saddr, int idx,
|
2010-04-21 04:06:52 +02:00
|
|
|
int genid)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-04-21 04:06:52 +02:00
|
|
|
return jhash_3words((__force u32)daddr, (__force u32)saddr,
|
2008-07-06 04:04:09 +02:00
|
|
|
idx, genid)
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
& rt_hash_mask;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-07-06 04:04:32 +02:00
|
|
|
static inline int rt_genid(struct net *net)
|
|
|
|
{
|
|
|
|
return atomic_read(&net->ipv4.rt_genid);
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_PROC_FS
|
|
|
|
struct rt_cache_iter_state {
|
2008-02-29 05:50:55 +01:00
|
|
|
struct seq_net_private p;
|
2005-04-17 00:20:36 +02:00
|
|
|
int bucket;
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
int genid;
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
2008-03-25 18:36:06 +01:00
|
|
|
static struct rtable *rt_cache_get_first(struct seq_file *seq)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-03-25 18:36:06 +01:00
|
|
|
struct rt_cache_iter_state *st = seq->private;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct rtable *r = NULL;
|
|
|
|
|
|
|
|
for (st->bucket = rt_hash_mask; st->bucket >= 0; --st->bucket) {
|
2011-08-11 21:30:52 +02:00
|
|
|
if (!rcu_access_pointer(rt_hash_table[st->bucket].chain))
|
2008-08-28 10:11:25 +02:00
|
|
|
continue;
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_lock_bh();
|
2010-02-23 02:04:49 +01:00
|
|
|
r = rcu_dereference_bh(rt_hash_table[st->bucket].chain);
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
while (r) {
|
2010-06-11 08:31:35 +02:00
|
|
|
if (dev_net(r->dst.dev) == seq_file_net(seq) &&
|
2008-02-29 05:50:55 +01:00
|
|
|
r->rt_genid == st->genid)
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
return r;
|
2010-06-11 08:31:35 +02:00
|
|
|
r = rcu_dereference_bh(r->dst.rt_next);
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_unlock_bh();
|
|
|
|
}
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
return r;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-03-25 18:36:06 +01:00
|
|
|
static struct rtable *__rt_cache_get_next(struct seq_file *seq,
|
2008-02-29 05:50:33 +01:00
|
|
|
struct rtable *r)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-03-25 18:36:06 +01:00
|
|
|
struct rt_cache_iter_state *st = seq->private;
|
2008-08-28 10:11:25 +02:00
|
|
|
|
2010-10-25 23:02:07 +02:00
|
|
|
r = rcu_dereference_bh(r->dst.rt_next);
|
2005-04-17 00:20:36 +02:00
|
|
|
while (!r) {
|
|
|
|
rcu_read_unlock_bh();
|
2008-08-28 10:11:25 +02:00
|
|
|
do {
|
|
|
|
if (--st->bucket < 0)
|
|
|
|
return NULL;
|
2011-08-11 21:30:52 +02:00
|
|
|
} while (!rcu_access_pointer(rt_hash_table[st->bucket].chain));
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_lock_bh();
|
2010-10-25 23:02:07 +02:00
|
|
|
r = rcu_dereference_bh(rt_hash_table[st->bucket].chain);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2010-10-25 23:02:07 +02:00
|
|
|
return r;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-03-25 18:36:06 +01:00
|
|
|
static struct rtable *rt_cache_get_next(struct seq_file *seq,
|
2008-02-29 05:50:33 +01:00
|
|
|
struct rtable *r)
|
|
|
|
{
|
2008-03-25 18:36:06 +01:00
|
|
|
struct rt_cache_iter_state *st = seq->private;
|
|
|
|
while ((r = __rt_cache_get_next(seq, r)) != NULL) {
|
2010-06-11 08:31:35 +02:00
|
|
|
if (dev_net(r->dst.dev) != seq_file_net(seq))
|
2008-02-29 05:50:55 +01:00
|
|
|
continue;
|
2008-02-29 05:50:33 +01:00
|
|
|
if (r->rt_genid == st->genid)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2008-03-25 18:36:06 +01:00
|
|
|
static struct rtable *rt_cache_get_idx(struct seq_file *seq, loff_t pos)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-03-25 18:36:06 +01:00
|
|
|
struct rtable *r = rt_cache_get_first(seq);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (r)
|
2008-03-25 18:36:06 +01:00
|
|
|
while (pos && (r = rt_cache_get_next(seq, r)))
|
2005-04-17 00:20:36 +02:00
|
|
|
--pos;
|
|
|
|
return pos ? NULL : r;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *rt_cache_seq_start(struct seq_file *seq, loff_t *pos)
|
|
|
|
{
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
struct rt_cache_iter_state *st = seq->private;
|
|
|
|
if (*pos)
|
2008-03-25 18:36:06 +01:00
|
|
|
return rt_cache_get_idx(seq, *pos - 1);
|
2008-07-06 04:04:32 +02:00
|
|
|
st->genid = rt_genid(seq_file_net(seq));
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
return SEQ_START_TOKEN;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *rt_cache_seq_next(struct seq_file *seq, void *v, loff_t *pos)
|
|
|
|
{
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
struct rtable *r;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (v == SEQ_START_TOKEN)
|
2008-03-25 18:36:06 +01:00
|
|
|
r = rt_cache_get_first(seq);
|
2005-04-17 00:20:36 +02:00
|
|
|
else
|
2008-03-25 18:36:06 +01:00
|
|
|
r = rt_cache_get_next(seq, v);
|
2005-04-17 00:20:36 +02:00
|
|
|
++*pos;
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void rt_cache_seq_stop(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
if (v && v != SEQ_START_TOKEN)
|
|
|
|
rcu_read_unlock_bh();
|
|
|
|
}
|
|
|
|
|
|
|
|
static int rt_cache_seq_show(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
if (v == SEQ_START_TOKEN)
|
|
|
|
seq_printf(seq, "%-127s\n",
|
|
|
|
"Iface\tDestination\tGateway \tFlags\t\tRefCnt\tUse\t"
|
|
|
|
"Metric\tSource\t\tMTU\tWindow\tIRTT\tTOS\tHHRef\t"
|
|
|
|
"HHUptod\tSpecDst");
|
|
|
|
else {
|
|
|
|
struct rtable *r = v;
|
2011-07-18 08:09:49 +02:00
|
|
|
struct neighbour *n;
|
2011-11-29 21:05:55 +01:00
|
|
|
int len, HHUptod;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-11-29 21:05:55 +01:00
|
|
|
rcu_read_lock();
|
2011-12-02 17:52:08 +01:00
|
|
|
n = dst_get_neighbour_noref(&r->dst);
|
2011-11-29 21:05:55 +01:00
|
|
|
HHUptod = (n && (n->nud_state & NUD_CONNECTED)) ? 1 : 0;
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
2010-04-21 04:06:52 +02:00
|
|
|
seq_printf(seq, "%s\t%08X\t%08X\t%8X\t%d\t%u\t%d\t"
|
|
|
|
"%08X\t%d\t%u\t%u\t%02X\t%d\t%1d\t%08X%n",
|
2010-06-11 08:31:35 +02:00
|
|
|
r->dst.dev ? r->dst.dev->name : "*",
|
2010-04-21 04:06:52 +02:00
|
|
|
(__force u32)r->rt_dst,
|
|
|
|
(__force u32)r->rt_gateway,
|
2010-06-11 08:31:35 +02:00
|
|
|
r->rt_flags, atomic_read(&r->dst.__refcnt),
|
|
|
|
r->dst.__use, 0, (__force u32)r->rt_src,
|
2010-12-13 21:52:14 +01:00
|
|
|
dst_metric_advmss(&r->dst) + 40,
|
2010-06-11 08:31:35 +02:00
|
|
|
dst_metric(&r->dst, RTAX_WINDOW),
|
|
|
|
(int)((dst_metric(&r->dst, RTAX_RTT) >> 3) +
|
|
|
|
dst_metric(&r->dst, RTAX_RTTVAR)),
|
2011-05-04 04:45:15 +02:00
|
|
|
r->rt_key_tos,
|
2011-07-14 16:53:20 +02:00
|
|
|
-1,
|
2011-11-29 21:05:55 +01:00
|
|
|
HHUptod,
|
2008-04-24 10:02:16 +02:00
|
|
|
r->rt_spec_dst, &len);
|
|
|
|
|
|
|
|
seq_printf(seq, "%*s\n", 127 - len, "");
|
2007-02-09 15:24:47 +01:00
|
|
|
}
|
|
|
|
return 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2007-03-12 22:34:29 +01:00
|
|
|
static const struct seq_operations rt_cache_seq_ops = {
|
2005-04-17 00:20:36 +02:00
|
|
|
.start = rt_cache_seq_start,
|
|
|
|
.next = rt_cache_seq_next,
|
|
|
|
.stop = rt_cache_seq_stop,
|
|
|
|
.show = rt_cache_seq_show,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int rt_cache_seq_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2008-02-29 05:50:55 +01:00
|
|
|
return seq_open_net(inode, file, &rt_cache_seq_ops,
|
2007-10-10 11:29:29 +02:00
|
|
|
sizeof(struct rt_cache_iter_state));
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2007-02-12 09:55:35 +01:00
|
|
|
static const struct file_operations rt_cache_seq_fops = {
|
2005-04-17 00:20:36 +02:00
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = rt_cache_seq_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
2008-02-29 05:50:55 +01:00
|
|
|
.release = seq_release_net,
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static void *rt_cpu_seq_start(struct seq_file *seq, loff_t *pos)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
if (*pos == 0)
|
|
|
|
return SEQ_START_TOKEN;
|
|
|
|
|
2008-12-29 13:23:42 +01:00
|
|
|
for (cpu = *pos-1; cpu < nr_cpu_ids; ++cpu) {
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!cpu_possible(cpu))
|
|
|
|
continue;
|
|
|
|
*pos = cpu+1;
|
[IPV4]: rt_cache_stat can be statically defined
Using __get_cpu_var(obj) is slightly faster than per_cpu_ptr(obj,
raw_smp_processor_id()).
1) Smaller code and memory use
For static and small objects, DEFINE_PER_CPU(type, object) is preferred over a
alloc_percpu() : Better and smaller code to access them, and no extra memory
(storing the pointer, and the percpu array of pointers)
x86_64 code before patch
mov 1237577(%rip),%rax # ffffffff803e5990 <rt_cache_stat>
not %rax # part of per_cpu machinery
mov %gs:0x3c,%edx # get cpu number
movslq %edx,%rdx # extend 32 bits cpu number to 64 bits
mov (%rax,%rdx,8),%rax # get the pointer for this cpu
incl 0x38(%rax)
x86_64 code after patch
mov $per_cpu__rt_cache_stat,%rdx
mov %gs:0x48,%rax # get percpu data offset
incl 0x38(%rax,%rdx,1)
2) False sharing avoidance for SMP :
For a small NR_CPUS, the array of per cpu pointers allocated in alloc_percpu()
can be <= 32 bytes. This let slab code gives a part of a cache line. If the
other part of this 64 bytes (or 128 bytes) cache line is used by a mostly
written object, we can have false sharing and expensive per_cpu_ptr() operations.
Size of rt_cache_stat is 64 bytes, so this patch is not a danger of a too big
increase of bss (in UP mode) or static per_cpu data for SMP
(PERCPU_ENOUGH_ROOM is currently 32768 bytes)
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2006-01-17 11:54:36 +01:00
|
|
|
return &per_cpu(rt_cache_stat, cpu);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *rt_cpu_seq_next(struct seq_file *seq, void *v, loff_t *pos)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
|
2008-12-29 13:23:42 +01:00
|
|
|
for (cpu = *pos; cpu < nr_cpu_ids; ++cpu) {
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!cpu_possible(cpu))
|
|
|
|
continue;
|
|
|
|
*pos = cpu+1;
|
[IPV4]: rt_cache_stat can be statically defined
Using __get_cpu_var(obj) is slightly faster than per_cpu_ptr(obj,
raw_smp_processor_id()).
1) Smaller code and memory use
For static and small objects, DEFINE_PER_CPU(type, object) is preferred over a
alloc_percpu() : Better and smaller code to access them, and no extra memory
(storing the pointer, and the percpu array of pointers)
x86_64 code before patch
mov 1237577(%rip),%rax # ffffffff803e5990 <rt_cache_stat>
not %rax # part of per_cpu machinery
mov %gs:0x3c,%edx # get cpu number
movslq %edx,%rdx # extend 32 bits cpu number to 64 bits
mov (%rax,%rdx,8),%rax # get the pointer for this cpu
incl 0x38(%rax)
x86_64 code after patch
mov $per_cpu__rt_cache_stat,%rdx
mov %gs:0x48,%rax # get percpu data offset
incl 0x38(%rax,%rdx,1)
2) False sharing avoidance for SMP :
For a small NR_CPUS, the array of per cpu pointers allocated in alloc_percpu()
can be <= 32 bytes. This let slab code gives a part of a cache line. If the
other part of this 64 bytes (or 128 bytes) cache line is used by a mostly
written object, we can have false sharing and expensive per_cpu_ptr() operations.
Size of rt_cache_stat is 64 bytes, so this patch is not a danger of a too big
increase of bss (in UP mode) or static per_cpu data for SMP
(PERCPU_ENOUGH_ROOM is currently 32768 bytes)
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2006-01-17 11:54:36 +01:00
|
|
|
return &per_cpu(rt_cache_stat, cpu);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
return NULL;
|
2007-02-09 15:24:47 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void rt_cpu_seq_stop(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
static int rt_cpu_seq_show(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
struct rt_cache_stat *st = v;
|
|
|
|
|
|
|
|
if (v == SEQ_START_TOKEN) {
|
2005-04-28 21:16:08 +02:00
|
|
|
seq_printf(seq, "entries in_hit in_slow_tot in_slow_mc in_no_route in_brd in_martian_dst in_martian_src out_hit out_slow_tot out_slow_mc gc_total gc_ignored gc_goal_miss gc_dst_overflow in_hlist_search out_hlist_search\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
2007-02-09 15:24:47 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
seq_printf(seq,"%08x %08x %08x %08x %08x %08x %08x %08x "
|
|
|
|
" %08x %08x %08x %08x %08x %08x %08x %08x %08x \n",
|
2010-10-08 08:37:34 +02:00
|
|
|
dst_entries_get_slow(&ipv4_dst_ops),
|
2005-04-17 00:20:36 +02:00
|
|
|
st->in_hit,
|
|
|
|
st->in_slow_tot,
|
|
|
|
st->in_slow_mc,
|
|
|
|
st->in_no_route,
|
|
|
|
st->in_brd,
|
|
|
|
st->in_martian_dst,
|
|
|
|
st->in_martian_src,
|
|
|
|
|
|
|
|
st->out_hit,
|
|
|
|
st->out_slow_tot,
|
2007-02-09 15:24:47 +01:00
|
|
|
st->out_slow_mc,
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
st->gc_total,
|
|
|
|
st->gc_ignored,
|
|
|
|
st->gc_goal_miss,
|
|
|
|
st->gc_dst_overflow,
|
|
|
|
st->in_hlist_search,
|
|
|
|
st->out_hlist_search
|
|
|
|
);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-03-12 22:34:29 +01:00
|
|
|
static const struct seq_operations rt_cpu_seq_ops = {
|
2005-04-17 00:20:36 +02:00
|
|
|
.start = rt_cpu_seq_start,
|
|
|
|
.next = rt_cpu_seq_next,
|
|
|
|
.stop = rt_cpu_seq_stop,
|
|
|
|
.show = rt_cpu_seq_show,
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static int rt_cpu_seq_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return seq_open(file, &rt_cpu_seq_ops);
|
|
|
|
}
|
|
|
|
|
2007-02-12 09:55:35 +01:00
|
|
|
static const struct file_operations rt_cpu_seq_fops = {
|
2005-04-17 00:20:36 +02:00
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = rt_cpu_seq_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = seq_release,
|
|
|
|
};
|
|
|
|
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2009-11-26 00:40:35 +01:00
|
|
|
static int rt_acct_proc_show(struct seq_file *m, void *v)
|
2007-12-06 06:13:48 +01:00
|
|
|
{
|
2009-11-26 00:40:35 +01:00
|
|
|
struct ip_rt_acct *dst, *src;
|
|
|
|
unsigned int i, j;
|
|
|
|
|
|
|
|
dst = kcalloc(256, sizeof(struct ip_rt_acct), GFP_KERNEL);
|
|
|
|
if (!dst)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
for_each_possible_cpu(i) {
|
|
|
|
src = (struct ip_rt_acct *)per_cpu_ptr(ip_rt_acct, i);
|
|
|
|
for (j = 0; j < 256; j++) {
|
|
|
|
dst[j].o_bytes += src[j].o_bytes;
|
|
|
|
dst[j].o_packets += src[j].o_packets;
|
|
|
|
dst[j].i_bytes += src[j].i_bytes;
|
|
|
|
dst[j].i_packets += src[j].i_packets;
|
|
|
|
}
|
2007-12-06 06:13:48 +01:00
|
|
|
}
|
|
|
|
|
2009-11-26 00:40:35 +01:00
|
|
|
seq_write(m, dst, 256 * sizeof(struct ip_rt_acct));
|
|
|
|
kfree(dst);
|
|
|
|
return 0;
|
|
|
|
}
|
2007-12-06 06:13:48 +01:00
|
|
|
|
2009-11-26 00:40:35 +01:00
|
|
|
static int rt_acct_proc_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return single_open(file, rt_acct_proc_show, NULL);
|
2007-12-06 06:13:48 +01:00
|
|
|
}
|
2009-11-26 00:40:35 +01:00
|
|
|
|
|
|
|
static const struct file_operations rt_acct_proc_fops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = rt_acct_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
2007-12-06 06:13:48 +01:00
|
|
|
#endif
|
2007-12-06 06:14:28 +01:00
|
|
|
|
2008-02-29 05:51:18 +01:00
|
|
|
static int __net_init ip_rt_do_proc_init(struct net *net)
|
2007-12-06 06:14:28 +01:00
|
|
|
{
|
|
|
|
struct proc_dir_entry *pde;
|
|
|
|
|
|
|
|
pde = proc_net_fops_create(net, "rt_cache", S_IRUGO,
|
|
|
|
&rt_cache_seq_fops);
|
|
|
|
if (!pde)
|
|
|
|
goto err1;
|
|
|
|
|
2008-02-28 23:14:25 +01:00
|
|
|
pde = proc_create("rt_cache", S_IRUGO,
|
|
|
|
net->proc_net_stat, &rt_cpu_seq_fops);
|
2007-12-06 06:14:28 +01:00
|
|
|
if (!pde)
|
|
|
|
goto err2;
|
|
|
|
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2009-11-26 00:40:35 +01:00
|
|
|
pde = proc_create("rt_acct", 0, net->proc_net, &rt_acct_proc_fops);
|
2007-12-06 06:14:28 +01:00
|
|
|
if (!pde)
|
|
|
|
goto err3;
|
|
|
|
#endif
|
|
|
|
return 0;
|
|
|
|
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2007-12-06 06:14:28 +01:00
|
|
|
err3:
|
|
|
|
remove_proc_entry("rt_cache", net->proc_net_stat);
|
|
|
|
#endif
|
|
|
|
err2:
|
|
|
|
remove_proc_entry("rt_cache", net->proc_net);
|
|
|
|
err1:
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2008-02-29 05:51:18 +01:00
|
|
|
|
|
|
|
static void __net_exit ip_rt_do_proc_exit(struct net *net)
|
|
|
|
{
|
|
|
|
remove_proc_entry("rt_cache", net->proc_net_stat);
|
|
|
|
remove_proc_entry("rt_cache", net->proc_net);
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2008-02-29 05:51:18 +01:00
|
|
|
remove_proc_entry("rt_acct", net->proc_net);
|
2010-01-17 04:32:50 +01:00
|
|
|
#endif
|
2008-02-29 05:51:18 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct pernet_operations ip_rt_proc_ops __net_initdata = {
|
|
|
|
.init = ip_rt_do_proc_init,
|
|
|
|
.exit = ip_rt_do_proc_exit,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init ip_rt_proc_init(void)
|
|
|
|
{
|
|
|
|
return register_pernet_subsys(&ip_rt_proc_ops);
|
|
|
|
}
|
|
|
|
|
2007-12-06 06:14:28 +01:00
|
|
|
#else
|
2008-02-29 05:51:18 +01:00
|
|
|
static inline int ip_rt_proc_init(void)
|
2007-12-06 06:14:28 +01:00
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif /* CONFIG_PROC_FS */
|
2007-02-09 15:24:47 +01:00
|
|
|
|
2008-04-10 10:52:09 +02:00
|
|
|
static inline void rt_free(struct rtable *rt)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-06-11 08:31:35 +02:00
|
|
|
call_rcu_bh(&rt->dst.rcu_head, dst_rcu_free);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-04-10 10:52:09 +02:00
|
|
|
static inline void rt_drop(struct rtable *rt)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
ip_rt_put(rt);
|
2010-06-11 08:31:35 +02:00
|
|
|
call_rcu_bh(&rt->dst.rcu_head, dst_rcu_free);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-04-10 10:52:09 +02:00
|
|
|
static inline int rt_fast_clean(struct rtable *rth)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
/* Kill broadcast/multicast entries very aggresively, if they
|
|
|
|
collide in hash table with more useful entries */
|
|
|
|
return (rth->rt_flags & (RTCF_BROADCAST | RTCF_MULTICAST)) &&
|
2010-11-12 02:07:48 +01:00
|
|
|
rt_is_input_route(rth) && rth->dst.rt_next;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-04-10 10:52:09 +02:00
|
|
|
static inline int rt_valuable(struct rtable *rth)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
return (rth->rt_flags & (RTCF_REDIRECTED | RTCF_NOTIFY)) ||
|
2011-02-10 05:42:07 +01:00
|
|
|
(rth->peer && rth->peer->pmtu_expires);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int rt_may_expire(struct rtable *rth, unsigned long tmo1, unsigned long tmo2)
|
|
|
|
{
|
|
|
|
unsigned long age;
|
|
|
|
int ret = 0;
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
if (atomic_read(&rth->dst.__refcnt))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out;
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
age = jiffies - rth->dst.lastuse;
|
2005-04-17 00:20:36 +02:00
|
|
|
if ((age <= tmo1 && !rt_fast_clean(rth)) ||
|
|
|
|
(age <= tmo2 && rt_valuable(rth)))
|
|
|
|
goto out;
|
|
|
|
ret = 1;
|
|
|
|
out: return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Bits of score are:
|
|
|
|
* 31: very valuable
|
|
|
|
* 30: not quite useless
|
|
|
|
* 29..0: usage counter
|
|
|
|
*/
|
|
|
|
static inline u32 rt_score(struct rtable *rt)
|
|
|
|
{
|
2010-06-11 08:31:35 +02:00
|
|
|
u32 score = jiffies - rt->dst.lastuse;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
score = ~score & ~(3<<30);
|
|
|
|
|
|
|
|
if (rt_valuable(rt))
|
|
|
|
score |= (1<<31);
|
|
|
|
|
2010-11-12 02:07:48 +01:00
|
|
|
if (rt_is_output_route(rt) ||
|
2005-04-17 00:20:36 +02:00
|
|
|
!(rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST|RTCF_LOCAL)))
|
|
|
|
score |= (1<<30);
|
|
|
|
|
|
|
|
return score;
|
|
|
|
}
|
|
|
|
|
2008-10-27 20:28:25 +01:00
|
|
|
static inline bool rt_caching(const struct net *net)
|
|
|
|
{
|
|
|
|
return net->ipv4.current_rt_cache_rebuild_count <=
|
|
|
|
net->ipv4.sysctl_rt_cache_rebuild_count;
|
|
|
|
}
|
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
static inline bool compare_hash_inputs(const struct rtable *rt1,
|
|
|
|
const struct rtable *rt2)
|
2008-10-27 20:28:25 +01:00
|
|
|
{
|
2011-03-05 06:47:09 +01:00
|
|
|
return ((((__force u32)rt1->rt_key_dst ^ (__force u32)rt2->rt_key_dst) |
|
|
|
|
((__force u32)rt1->rt_key_src ^ (__force u32)rt2->rt_key_src) |
|
2011-08-09 06:01:16 +02:00
|
|
|
(rt1->rt_route_iif ^ rt2->rt_route_iif)) == 0);
|
2008-10-27 20:28:25 +01:00
|
|
|
}
|
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
static inline int compare_keys(struct rtable *rt1, struct rtable *rt2)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-03-05 06:47:09 +01:00
|
|
|
return (((__force u32)rt1->rt_key_dst ^ (__force u32)rt2->rt_key_dst) |
|
|
|
|
((__force u32)rt1->rt_key_src ^ (__force u32)rt2->rt_key_src) |
|
|
|
|
(rt1->rt_mark ^ rt2->rt_mark) |
|
2011-05-04 04:45:15 +02:00
|
|
|
(rt1->rt_key_tos ^ rt2->rt_key_tos) |
|
2011-08-08 07:20:20 +02:00
|
|
|
(rt1->rt_route_iif ^ rt2->rt_route_iif) |
|
2011-08-09 06:01:16 +02:00
|
|
|
(rt1->rt_oif ^ rt2->rt_oif)) == 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2008-01-23 08:50:25 +01:00
|
|
|
static inline int compare_netns(struct rtable *rt1, struct rtable *rt2)
|
|
|
|
{
|
2010-06-11 08:31:35 +02:00
|
|
|
return net_eq(dev_net(rt1->dst.dev), dev_net(rt2->dst.dev));
|
2008-01-23 08:50:25 +01:00
|
|
|
}
|
|
|
|
|
2008-07-06 04:04:32 +02:00
|
|
|
static inline int rt_is_expired(struct rtable *rth)
|
|
|
|
{
|
2010-06-11 08:31:35 +02:00
|
|
|
return rth->rt_genid != rt_genid(dev_net(rth->dst.dev));
|
2008-07-06 04:04:32 +02:00
|
|
|
}
|
|
|
|
|
2007-11-20 07:43:37 +01:00
|
|
|
/*
|
|
|
|
* Perform a full scan of hash table and free all entries.
|
|
|
|
* Can be called by a softirq or a process.
|
|
|
|
* In the later case, we want to be reschedule if necessary
|
|
|
|
*/
|
2010-12-20 06:11:20 +01:00
|
|
|
static void rt_do_flush(struct net *net, int process_context)
|
2007-11-20 07:43:37 +01:00
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
struct rtable *rth, *next;
|
|
|
|
|
|
|
|
for (i = 0; i <= rt_hash_mask; i++) {
|
2010-12-20 06:11:20 +01:00
|
|
|
struct rtable __rcu **pprev;
|
|
|
|
struct rtable *list;
|
|
|
|
|
2007-11-20 07:43:37 +01:00
|
|
|
if (process_context && need_resched())
|
|
|
|
cond_resched();
|
2011-08-11 21:30:52 +02:00
|
|
|
rth = rcu_access_pointer(rt_hash_table[i].chain);
|
2007-11-20 07:43:37 +01:00
|
|
|
if (!rth)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
spin_lock_bh(rt_hash_lock_addr(i));
|
2008-07-06 04:06:12 +02:00
|
|
|
|
2010-12-20 06:11:20 +01:00
|
|
|
list = NULL;
|
|
|
|
pprev = &rt_hash_table[i].chain;
|
|
|
|
rth = rcu_dereference_protected(*pprev,
|
2010-10-25 23:02:07 +02:00
|
|
|
lockdep_is_held(rt_hash_lock_addr(i)));
|
2008-07-06 04:06:12 +02:00
|
|
|
|
2010-12-20 06:11:20 +01:00
|
|
|
while (rth) {
|
|
|
|
next = rcu_dereference_protected(rth->dst.rt_next,
|
2010-10-25 23:02:07 +02:00
|
|
|
lockdep_is_held(rt_hash_lock_addr(i)));
|
2010-12-20 06:11:20 +01:00
|
|
|
|
|
|
|
if (!net ||
|
|
|
|
net_eq(dev_net(rth->dst.dev), net)) {
|
|
|
|
rcu_assign_pointer(*pprev, next);
|
|
|
|
rcu_assign_pointer(rth->dst.rt_next, list);
|
|
|
|
list = rth;
|
2008-07-06 04:06:12 +02:00
|
|
|
} else {
|
2010-12-20 06:11:20 +01:00
|
|
|
pprev = &rth->dst.rt_next;
|
2008-07-06 04:06:12 +02:00
|
|
|
}
|
2010-12-20 06:11:20 +01:00
|
|
|
rth = next;
|
2008-07-06 04:06:12 +02:00
|
|
|
}
|
2010-12-20 06:11:20 +01:00
|
|
|
|
2007-11-20 07:43:37 +01:00
|
|
|
spin_unlock_bh(rt_hash_lock_addr(i));
|
|
|
|
|
2010-12-20 06:11:20 +01:00
|
|
|
for (; list; list = next) {
|
|
|
|
next = rcu_dereference_protected(list->dst.rt_next, 1);
|
|
|
|
rt_free(list);
|
2007-11-20 07:43:37 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-10-27 20:28:25 +01:00
|
|
|
/*
|
|
|
|
* While freeing expired entries, we compute average chain length
|
|
|
|
* and standard deviation, using fixed-point arithmetic.
|
|
|
|
* This to have an estimation of rt_chain_length_max
|
|
|
|
* rt_chain_length_max = max(elasticity, AVG + 4*SD)
|
|
|
|
* We use 3 bits for frational part, and 29 (or 61) for magnitude.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define FRACT_BITS 3
|
|
|
|
#define ONE (1UL << FRACT_BITS)
|
|
|
|
|
2010-03-08 04:20:00 +01:00
|
|
|
/*
|
|
|
|
* Given a hash chain and an item in this hash chain,
|
|
|
|
* find if a previous entry has the same hash_inputs
|
|
|
|
* (but differs on tos, mark or oif)
|
|
|
|
* Returns 0 if an alias is found.
|
|
|
|
* Returns ONE if rth has no alias before itself.
|
|
|
|
*/
|
|
|
|
static int has_noalias(const struct rtable *head, const struct rtable *rth)
|
|
|
|
{
|
|
|
|
const struct rtable *aux = head;
|
|
|
|
|
|
|
|
while (aux != rth) {
|
2011-03-05 06:47:09 +01:00
|
|
|
if (compare_hash_inputs(aux, rth))
|
2010-03-08 04:20:00 +01:00
|
|
|
return 0;
|
2010-10-25 23:02:07 +02:00
|
|
|
aux = rcu_dereference_protected(aux->dst.rt_next, 1);
|
2010-03-08 04:20:00 +01:00
|
|
|
}
|
|
|
|
return ONE;
|
|
|
|
}
|
|
|
|
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
/*
|
2011-03-31 03:57:33 +02:00
|
|
|
* Perturbation of rt_genid by a small quantity [1..256]
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
* Using 8 bits of shuffling ensure we can call rt_cache_invalidate()
|
|
|
|
* many times (2^24) without giving recent rt_genid.
|
|
|
|
* Jenkins hash is strong enough that litle changes of rt_genid are OK.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2008-07-06 04:03:31 +02:00
|
|
|
static void rt_cache_invalidate(struct net *net)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
unsigned char shuffle;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
get_random_bytes(&shuffle, sizeof(shuffle));
|
2008-07-06 04:04:32 +02:00
|
|
|
atomic_add(shuffle + 1U, &net->ipv4.rt_genid);
|
2011-11-26 13:13:44 +01:00
|
|
|
redirect_genid++;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
/*
|
|
|
|
* delay < 0 : invalidate cache (fast : entries will be deleted later)
|
|
|
|
* delay >= 0 : invalidate & flush cache (can be long)
|
|
|
|
*/
|
2008-07-06 04:00:44 +02:00
|
|
|
void rt_cache_flush(struct net *net, int delay)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-07-06 04:03:31 +02:00
|
|
|
rt_cache_invalidate(net);
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
if (delay >= 0)
|
2010-12-20 06:11:20 +01:00
|
|
|
rt_do_flush(net, !in_softirq());
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2009-11-29 16:45:58 +01:00
|
|
|
/* Flush previous cache invalidated entries from the cache */
|
2010-12-20 06:11:20 +01:00
|
|
|
void rt_cache_flush_batch(struct net *net)
|
2009-11-29 16:45:58 +01:00
|
|
|
{
|
2010-12-20 06:11:20 +01:00
|
|
|
rt_do_flush(net, !in_softirq());
|
2009-11-29 16:45:58 +01:00
|
|
|
}
|
|
|
|
|
2008-10-27 20:28:25 +01:00
|
|
|
static void rt_emergency_hash_rebuild(struct net *net)
|
|
|
|
{
|
2010-05-08 10:57:52 +02:00
|
|
|
if (net_ratelimit())
|
2008-10-27 20:28:25 +01:00
|
|
|
printk(KERN_WARNING "Route hash chain too long!\n");
|
2010-05-08 10:57:52 +02:00
|
|
|
rt_cache_invalidate(net);
|
2008-10-27 20:28:25 +01:00
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
Short description of GC goals.
|
|
|
|
|
|
|
|
We want to build algorithm, which will keep routing cache
|
|
|
|
at some equilibrium point, when number of aged off entries
|
|
|
|
is kept approximately equal to newly generated ones.
|
|
|
|
|
|
|
|
Current expiration strength is variable "expire".
|
|
|
|
We try to adjust it dynamically, so that if networking
|
|
|
|
is idle expires is large enough to keep enough of warm entries,
|
|
|
|
and when load increases it reduces to limit cache size.
|
|
|
|
*/
|
|
|
|
|
2008-01-18 12:56:57 +01:00
|
|
|
static int rt_garbage_collect(struct dst_ops *ops)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
static unsigned long expire = RT_GC_TIMEOUT;
|
|
|
|
static unsigned long last_gc;
|
|
|
|
static int rover;
|
|
|
|
static int equilibrium;
|
2010-10-25 23:02:07 +02:00
|
|
|
struct rtable *rth;
|
|
|
|
struct rtable __rcu **rthp;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned long now = jiffies;
|
|
|
|
int goal;
|
2010-10-08 08:37:34 +02:00
|
|
|
int entries = dst_entries_get_fast(&ipv4_dst_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Garbage collection is pretty expensive,
|
|
|
|
* do not make it too frequently.
|
|
|
|
*/
|
|
|
|
|
|
|
|
RT_CACHE_STAT_INC(gc_total);
|
|
|
|
|
|
|
|
if (now - last_gc < ip_rt_gc_min_interval &&
|
2010-10-08 08:37:34 +02:00
|
|
|
entries < ip_rt_max_size) {
|
2005-04-17 00:20:36 +02:00
|
|
|
RT_CACHE_STAT_INC(gc_ignored);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2010-10-08 08:37:34 +02:00
|
|
|
entries = dst_entries_get_slow(&ipv4_dst_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
/* Calculate number of entries, which we want to expire now. */
|
2010-10-08 08:37:34 +02:00
|
|
|
goal = entries - (ip_rt_gc_elasticity << rt_hash_log);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (goal <= 0) {
|
|
|
|
if (equilibrium < ipv4_dst_ops.gc_thresh)
|
|
|
|
equilibrium = ipv4_dst_ops.gc_thresh;
|
2010-10-08 08:37:34 +02:00
|
|
|
goal = entries - equilibrium;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (goal > 0) {
|
2007-12-21 10:49:07 +01:00
|
|
|
equilibrium += min_t(unsigned int, goal >> 1, rt_hash_mask + 1);
|
2010-10-08 08:37:34 +02:00
|
|
|
goal = entries - equilibrium;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* We are in dangerous area. Try to reduce cache really
|
|
|
|
* aggressively.
|
|
|
|
*/
|
2007-12-21 10:49:07 +01:00
|
|
|
goal = max_t(unsigned int, goal >> 1, rt_hash_mask + 1);
|
2010-10-08 08:37:34 +02:00
|
|
|
equilibrium = entries - goal;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if (now - last_gc >= ip_rt_gc_min_interval)
|
|
|
|
last_gc = now;
|
|
|
|
|
|
|
|
if (goal <= 0) {
|
|
|
|
equilibrium += goal;
|
|
|
|
goto work_done;
|
|
|
|
}
|
|
|
|
|
|
|
|
do {
|
|
|
|
int i, k;
|
|
|
|
|
|
|
|
for (i = rt_hash_mask, k = rover; i >= 0; i--) {
|
|
|
|
unsigned long tmo = expire;
|
|
|
|
|
|
|
|
k = (k + 1) & rt_hash_mask;
|
|
|
|
rthp = &rt_hash_table[k].chain;
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_lock_bh(rt_hash_lock_addr(k));
|
2010-10-25 23:02:07 +02:00
|
|
|
while ((rth = rcu_dereference_protected(*rthp,
|
|
|
|
lockdep_is_held(rt_hash_lock_addr(k)))) != NULL) {
|
2008-07-06 04:04:32 +02:00
|
|
|
if (!rt_is_expired(rth) &&
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
!rt_may_expire(rth, tmo, expire)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
tmo >>= 1;
|
2010-06-11 08:31:35 +02:00
|
|
|
rthp = &rth->dst.rt_next;
|
2005-04-17 00:20:36 +02:00
|
|
|
continue;
|
|
|
|
}
|
2010-06-11 08:31:35 +02:00
|
|
|
*rthp = rth->dst.rt_next;
|
2005-04-17 00:20:36 +02:00
|
|
|
rt_free(rth);
|
|
|
|
goal--;
|
|
|
|
}
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_unlock_bh(rt_hash_lock_addr(k));
|
2005-04-17 00:20:36 +02:00
|
|
|
if (goal <= 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rover = k;
|
|
|
|
|
|
|
|
if (goal <= 0)
|
|
|
|
goto work_done;
|
|
|
|
|
|
|
|
/* Goal is not achieved. We stop process if:
|
|
|
|
|
|
|
|
- if expire reduced to zero. Otherwise, expire is halfed.
|
|
|
|
- if table is not full.
|
|
|
|
- if we are called from interrupt.
|
|
|
|
- jiffies check is just fallback/debug loop breaker.
|
|
|
|
We will not spin here for long time in any case.
|
|
|
|
*/
|
|
|
|
|
|
|
|
RT_CACHE_STAT_INC(gc_goal_miss);
|
|
|
|
|
|
|
|
if (expire == 0)
|
|
|
|
break;
|
|
|
|
|
|
|
|
expire >>= 1;
|
|
|
|
|
2010-10-08 08:37:34 +02:00
|
|
|
if (dst_entries_get_fast(&ipv4_dst_ops) < ip_rt_max_size)
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out;
|
|
|
|
} while (!in_softirq() && time_before_eq(jiffies, now));
|
|
|
|
|
2010-10-08 08:37:34 +02:00
|
|
|
if (dst_entries_get_fast(&ipv4_dst_ops) < ip_rt_max_size)
|
|
|
|
goto out;
|
|
|
|
if (dst_entries_get_slow(&ipv4_dst_ops) < ip_rt_max_size)
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out;
|
|
|
|
if (net_ratelimit())
|
|
|
|
printk(KERN_WARNING "dst cache overflow\n");
|
|
|
|
RT_CACHE_STAT_INC(gc_dst_overflow);
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
work_done:
|
|
|
|
expire += ip_rt_gc_min_interval;
|
|
|
|
if (expire > ip_rt_gc_timeout ||
|
2010-10-08 08:37:34 +02:00
|
|
|
dst_entries_get_fast(&ipv4_dst_ops) < ipv4_dst_ops.gc_thresh ||
|
|
|
|
dst_entries_get_slow(&ipv4_dst_ops) < ipv4_dst_ops.gc_thresh)
|
2005-04-17 00:20:36 +02:00
|
|
|
expire = ip_rt_gc_timeout;
|
|
|
|
out: return 0;
|
|
|
|
}
|
|
|
|
|
2010-03-08 04:20:00 +01:00
|
|
|
/*
|
|
|
|
* Returns number of entries in a hash chain that have different hash_inputs
|
|
|
|
*/
|
|
|
|
static int slow_chain_length(const struct rtable *head)
|
|
|
|
{
|
|
|
|
int length = 0;
|
|
|
|
const struct rtable *rth = head;
|
|
|
|
|
|
|
|
while (rth) {
|
|
|
|
length += has_noalias(head, rth);
|
2010-10-25 23:02:07 +02:00
|
|
|
rth = rcu_dereference_protected(rth->dst.rt_next, 1);
|
2010-03-08 04:20:00 +01:00
|
|
|
}
|
|
|
|
return length >> FRACT_BITS;
|
|
|
|
}
|
|
|
|
|
2011-07-18 09:40:17 +02:00
|
|
|
static struct neighbour *ipv4_neigh_lookup(const struct dst_entry *dst, const void *daddr)
|
2011-07-12 00:44:24 +02:00
|
|
|
{
|
2011-07-18 09:40:17 +02:00
|
|
|
static const __be32 inaddr_any = 0;
|
|
|
|
struct net_device *dev = dst->dev;
|
|
|
|
const __be32 *pkey = daddr;
|
2011-07-12 00:44:24 +02:00
|
|
|
struct neighbour *n;
|
|
|
|
|
|
|
|
if (dev->flags & (IFF_LOOPBACK | IFF_POINTOPOINT))
|
2011-07-18 09:40:17 +02:00
|
|
|
pkey = &inaddr_any;
|
|
|
|
|
2011-07-25 02:01:41 +02:00
|
|
|
n = __ipv4_neigh_lookup(&arp_tbl, dev, *(__force u32 *)pkey);
|
2011-07-18 09:40:17 +02:00
|
|
|
if (n)
|
|
|
|
return n;
|
2011-07-25 02:01:41 +02:00
|
|
|
return neigh_create(&arp_tbl, pkey, dev);
|
2011-07-18 09:40:17 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int rt_bind_neighbour(struct rtable *rt)
|
|
|
|
{
|
|
|
|
struct neighbour *n = ipv4_neigh_lookup(&rt->dst, &rt->rt_gateway);
|
2011-07-12 00:44:24 +02:00
|
|
|
if (IS_ERR(n))
|
|
|
|
return PTR_ERR(n);
|
2011-07-18 08:09:49 +02:00
|
|
|
dst_set_neighbour(&rt->dst, n);
|
2011-07-12 00:44:24 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-03-02 23:31:35 +01:00
|
|
|
static struct rtable *rt_intern_hash(unsigned hash, struct rtable *rt,
|
|
|
|
struct sk_buff *skb, int ifindex)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-10-25 23:02:07 +02:00
|
|
|
struct rtable *rth, *cand;
|
|
|
|
struct rtable __rcu **rthp, **candp;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned long now;
|
|
|
|
u32 min_score;
|
|
|
|
int chain_length;
|
|
|
|
int attempts = !in_softirq();
|
|
|
|
|
|
|
|
restart:
|
|
|
|
chain_length = 0;
|
|
|
|
min_score = ~(u32)0;
|
|
|
|
cand = NULL;
|
|
|
|
candp = NULL;
|
|
|
|
now = jiffies;
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
if (!rt_caching(dev_net(rt->dst.dev))) {
|
ipv4: fix NULL pointer + success return in route lookup path
Don't drop route if we're not caching
I recently got a report of an oops on a route lookup. Maxime was
testing what would happen if route caching was turned off (doing so by setting
making rt_caching always return 0), and found that it triggered an oops. I
looked at it and found that the problem stemmed from the fact that the route
lookup routines were returning success from their lookup paths (which is good),
but never set the **rp pointer to anything (which is bad). This happens because
in rt_intern_hash, if rt_caching returns false, we call rt_drop and return 0.
This almost emulates slient success. What we should be doing is assigning *rp =
rt and _not_ dropping the route. This way, during slow path lookups, when we
create a new route cache entry, we don't immediately discard it, rather we just
don't add it into the cache hash table, but we let this one lookup use it for
the purpose of this route request. Maxime has tested and reports it prevents
the oops. There is still a subsequent routing issue that I'm looking into
further, but I'm confident that, even if its related to this same path, this
patch makes sense to take.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-20 10:15:16 +02:00
|
|
|
/*
|
|
|
|
* If we're not caching, just tell the caller we
|
|
|
|
* were successful and don't touch the route. The
|
|
|
|
* caller hold the sole reference to the cache entry, and
|
|
|
|
* it will be released when the caller is done with it.
|
|
|
|
* If we drop it here, the callers have no way to resolve routes
|
|
|
|
* when we're not caching. Instead, just point *rp at rt, so
|
|
|
|
* the caller gets a single use out of the route
|
ipv4 routing: Ensure that route cache entries are usable and reclaimable with caching is off
When route caching is disabled (rt_caching returns false), We still use route
cache entries that are created and passed into rt_intern_hash once. These
routes need to be made usable for the one call path that holds a reference to
them, and they need to be reclaimed when they're finished with their use. To be
made usable, they need to be associated with a neighbor table entry (which they
currently are not), otherwise iproute_finish2 just discards the packet, since we
don't know which L2 peer to send the packet to. To do this binding, we need to
follow the path a bit higher up in rt_intern_hash, which calls
arp_bind_neighbour, but not assign the route entry to the hash table.
Currently, if caching is off, we simply assign the route to the rp pointer and
are reutrn success. This patch associates us with a neighbor entry first.
Secondly, we need to make sure that any single use routes like this are known to
the garbage collector when caching is off. If caching is off, and we try to
hash in a route, it will leak when its refcount reaches zero. To avoid this,
this patch calls rt_free on the route cache entry passed into rt_intern_hash.
This places us on the gc list for the route cache garbage collector, so that
when its refcount reaches zero, it will be reclaimed (Thanks to Alexey for this
suggestion).
I've tested this on a local system here, and with these patches in place, I'm
able to maintain routed connectivity to remote systems, even if I set
/proc/sys/net/ipv4/rt_cache_rebuild_count to -1, which forces rt_caching to
return false.
Signed-off-by: Neil Horman <nhorman@redhat.com>
Reported-by: Jarek Poplawski <jarkao2@gmail.com>
Reported-by: Maxime Bizon <mbizon@freebox.fr>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-22 12:18:53 +02:00
|
|
|
* Note that we do rt_free on this new route entry, so that
|
|
|
|
* once its refcount hits zero, we are still able to reap it
|
|
|
|
* (Thanks Alexey)
|
2010-10-15 07:44:11 +02:00
|
|
|
* Note: To avoid expensive rcu stuff for this uncached dst,
|
|
|
|
* we set DST_NOCACHE so that dst_release() can free dst without
|
|
|
|
* waiting a grace period.
|
ipv4: fix NULL pointer + success return in route lookup path
Don't drop route if we're not caching
I recently got a report of an oops on a route lookup. Maxime was
testing what would happen if route caching was turned off (doing so by setting
making rt_caching always return 0), and found that it triggered an oops. I
looked at it and found that the problem stemmed from the fact that the route
lookup routines were returning success from their lookup paths (which is good),
but never set the **rp pointer to anything (which is bad). This happens because
in rt_intern_hash, if rt_caching returns false, we call rt_drop and return 0.
This almost emulates slient success. What we should be doing is assigning *rp =
rt and _not_ dropping the route. This way, during slow path lookups, when we
create a new route cache entry, we don't immediately discard it, rather we just
don't add it into the cache hash table, but we let this one lookup use it for
the purpose of this route request. Maxime has tested and reports it prevents
the oops. There is still a subsequent routing issue that I'm looking into
further, but I'm confident that, even if its related to this same path, this
patch makes sense to take.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-20 10:15:16 +02:00
|
|
|
*/
|
ipv4 routing: Ensure that route cache entries are usable and reclaimable with caching is off
When route caching is disabled (rt_caching returns false), We still use route
cache entries that are created and passed into rt_intern_hash once. These
routes need to be made usable for the one call path that holds a reference to
them, and they need to be reclaimed when they're finished with their use. To be
made usable, they need to be associated with a neighbor table entry (which they
currently are not), otherwise iproute_finish2 just discards the packet, since we
don't know which L2 peer to send the packet to. To do this binding, we need to
follow the path a bit higher up in rt_intern_hash, which calls
arp_bind_neighbour, but not assign the route entry to the hash table.
Currently, if caching is off, we simply assign the route to the rp pointer and
are reutrn success. This patch associates us with a neighbor entry first.
Secondly, we need to make sure that any single use routes like this are known to
the garbage collector when caching is off. If caching is off, and we try to
hash in a route, it will leak when its refcount reaches zero. To avoid this,
this patch calls rt_free on the route cache entry passed into rt_intern_hash.
This places us on the gc list for the route cache garbage collector, so that
when its refcount reaches zero, it will be reclaimed (Thanks to Alexey for this
suggestion).
I've tested this on a local system here, and with these patches in place, I'm
able to maintain routed connectivity to remote systems, even if I set
/proc/sys/net/ipv4/rt_cache_rebuild_count to -1, which forces rt_caching to
return false.
Signed-off-by: Neil Horman <nhorman@redhat.com>
Reported-by: Jarek Poplawski <jarkao2@gmail.com>
Reported-by: Maxime Bizon <mbizon@freebox.fr>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-22 12:18:53 +02:00
|
|
|
|
net: introduce DST_NOCACHE flag
While doing stress tests with IP route cache disabled, and multi queue
devices, I noticed a very high contention on one rwlock used in
neighbour code.
When many cpus are trying to send frames (possibly using a high
performance multiqueue device) to the same neighbour, they fight for the
neigh->lock rwlock in order to call neigh_hh_init(), and fight on
hh->hh_refcnt (a pair of atomic_inc/atomic_dec_and_test())
But we dont need to call neigh_hh_init() for dst that are used only
once. It costs four atomic operations at least, on two contended cache
lines, plus the high contention on neigh->lock rwlock.
Introduce a new dst flag, DST_NOCACHE, that is set when dst was not
inserted in route cache.
With the stress test bench, sending 160000000 frames on one neighbour,
results are :
Before patch:
real 2m28.406s
user 0m11.781s
sys 36m17.964s
After patch:
real 1m26.532s
user 0m12.185s
sys 20m3.903s
Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2010-10-04 07:17:54 +02:00
|
|
|
rt->dst.flags |= DST_NOCACHE;
|
2010-11-12 02:07:48 +01:00
|
|
|
if (rt->rt_type == RTN_UNICAST || rt_is_output_route(rt)) {
|
2011-07-12 00:44:24 +02:00
|
|
|
int err = rt_bind_neighbour(rt);
|
ipv4 routing: Ensure that route cache entries are usable and reclaimable with caching is off
When route caching is disabled (rt_caching returns false), We still use route
cache entries that are created and passed into rt_intern_hash once. These
routes need to be made usable for the one call path that holds a reference to
them, and they need to be reclaimed when they're finished with their use. To be
made usable, they need to be associated with a neighbor table entry (which they
currently are not), otherwise iproute_finish2 just discards the packet, since we
don't know which L2 peer to send the packet to. To do this binding, we need to
follow the path a bit higher up in rt_intern_hash, which calls
arp_bind_neighbour, but not assign the route entry to the hash table.
Currently, if caching is off, we simply assign the route to the rp pointer and
are reutrn success. This patch associates us with a neighbor entry first.
Secondly, we need to make sure that any single use routes like this are known to
the garbage collector when caching is off. If caching is off, and we try to
hash in a route, it will leak when its refcount reaches zero. To avoid this,
this patch calls rt_free on the route cache entry passed into rt_intern_hash.
This places us on the gc list for the route cache garbage collector, so that
when its refcount reaches zero, it will be reclaimed (Thanks to Alexey for this
suggestion).
I've tested this on a local system here, and with these patches in place, I'm
able to maintain routed connectivity to remote systems, even if I set
/proc/sys/net/ipv4/rt_cache_rebuild_count to -1, which forces rt_caching to
return false.
Signed-off-by: Neil Horman <nhorman@redhat.com>
Reported-by: Jarek Poplawski <jarkao2@gmail.com>
Reported-by: Maxime Bizon <mbizon@freebox.fr>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-22 12:18:53 +02:00
|
|
|
if (err) {
|
|
|
|
if (net_ratelimit())
|
|
|
|
printk(KERN_WARNING
|
|
|
|
"Neighbour table failure & not caching routes.\n");
|
2010-10-15 07:44:11 +02:00
|
|
|
ip_rt_put(rt);
|
2011-03-02 23:31:35 +01:00
|
|
|
return ERR_PTR(err);
|
ipv4 routing: Ensure that route cache entries are usable and reclaimable with caching is off
When route caching is disabled (rt_caching returns false), We still use route
cache entries that are created and passed into rt_intern_hash once. These
routes need to be made usable for the one call path that holds a reference to
them, and they need to be reclaimed when they're finished with their use. To be
made usable, they need to be associated with a neighbor table entry (which they
currently are not), otherwise iproute_finish2 just discards the packet, since we
don't know which L2 peer to send the packet to. To do this binding, we need to
follow the path a bit higher up in rt_intern_hash, which calls
arp_bind_neighbour, but not assign the route entry to the hash table.
Currently, if caching is off, we simply assign the route to the rp pointer and
are reutrn success. This patch associates us with a neighbor entry first.
Secondly, we need to make sure that any single use routes like this are known to
the garbage collector when caching is off. If caching is off, and we try to
hash in a route, it will leak when its refcount reaches zero. To avoid this,
this patch calls rt_free on the route cache entry passed into rt_intern_hash.
This places us on the gc list for the route cache garbage collector, so that
when its refcount reaches zero, it will be reclaimed (Thanks to Alexey for this
suggestion).
I've tested this on a local system here, and with these patches in place, I'm
able to maintain routed connectivity to remote systems, even if I set
/proc/sys/net/ipv4/rt_cache_rebuild_count to -1, which forces rt_caching to
return false.
Signed-off-by: Neil Horman <nhorman@redhat.com>
Reported-by: Jarek Poplawski <jarkao2@gmail.com>
Reported-by: Maxime Bizon <mbizon@freebox.fr>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-22 12:18:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
goto skip_hashing;
|
2008-10-27 20:28:25 +01:00
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
rthp = &rt_hash_table[hash].chain;
|
|
|
|
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_lock_bh(rt_hash_lock_addr(hash));
|
2010-10-25 23:02:07 +02:00
|
|
|
while ((rth = rcu_dereference_protected(*rthp,
|
|
|
|
lockdep_is_held(rt_hash_lock_addr(hash)))) != NULL) {
|
2008-07-06 04:04:32 +02:00
|
|
|
if (rt_is_expired(rth)) {
|
2010-06-11 08:31:35 +02:00
|
|
|
*rthp = rth->dst.rt_next;
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
rt_free(rth);
|
|
|
|
continue;
|
|
|
|
}
|
2011-03-05 06:47:09 +01:00
|
|
|
if (compare_keys(rth, rt) && compare_netns(rth, rt)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/* Put it first */
|
2010-06-11 08:31:35 +02:00
|
|
|
*rthp = rth->dst.rt_next;
|
2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* Since lookup is lockfree, the deletion
|
|
|
|
* must be visible to another weakly ordered CPU before
|
|
|
|
* the insertion at the start of the hash chain.
|
|
|
|
*/
|
2010-06-11 08:31:35 +02:00
|
|
|
rcu_assign_pointer(rth->dst.rt_next,
|
2005-04-17 00:20:36 +02:00
|
|
|
rt_hash_table[hash].chain);
|
|
|
|
/*
|
|
|
|
* Since lookup is lockfree, the update writes
|
|
|
|
* must be ordered for consistency on SMP.
|
|
|
|
*/
|
|
|
|
rcu_assign_pointer(rt_hash_table[hash].chain, rth);
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
dst_use(&rth->dst, now);
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_unlock_bh(rt_hash_lock_addr(hash));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
rt_drop(rt);
|
2011-03-02 23:31:35 +01:00
|
|
|
if (skb)
|
2010-06-11 08:31:35 +02:00
|
|
|
skb_dst_set(skb, &rth->dst);
|
2011-03-02 23:31:35 +01:00
|
|
|
return rth;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
if (!atomic_read(&rth->dst.__refcnt)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
u32 score = rt_score(rth);
|
|
|
|
|
|
|
|
if (score <= min_score) {
|
|
|
|
cand = rth;
|
|
|
|
candp = rthp;
|
|
|
|
min_score = score;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
chain_length++;
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
rthp = &rth->dst.rt_next;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if (cand) {
|
|
|
|
/* ip_rt_gc_elasticity used to be average length of chain
|
|
|
|
* length, when exceeded gc becomes really aggressive.
|
|
|
|
*
|
|
|
|
* The second limit is less certain. At the moment it allows
|
|
|
|
* only 2 entries per bucket. We will see.
|
|
|
|
*/
|
|
|
|
if (chain_length > ip_rt_gc_elasticity) {
|
2010-06-11 08:31:35 +02:00
|
|
|
*candp = cand->dst.rt_next;
|
2005-04-17 00:20:36 +02:00
|
|
|
rt_free(cand);
|
|
|
|
}
|
2008-10-27 20:28:25 +01:00
|
|
|
} else {
|
2010-03-08 04:20:00 +01:00
|
|
|
if (chain_length > rt_chain_length_max &&
|
|
|
|
slow_chain_length(rt_hash_table[hash].chain) > rt_chain_length_max) {
|
2010-06-11 08:31:35 +02:00
|
|
|
struct net *net = dev_net(rt->dst.dev);
|
2008-10-27 20:28:25 +01:00
|
|
|
int num = ++net->ipv4.current_rt_cache_rebuild_count;
|
2010-03-24 08:43:17 +01:00
|
|
|
if (!rt_caching(net)) {
|
2008-10-27 20:28:25 +01:00
|
|
|
printk(KERN_WARNING "%s: %d rebuilds is over limit, route caching disabled\n",
|
2010-06-11 08:31:35 +02:00
|
|
|
rt->dst.dev->name, num);
|
2008-10-27 20:28:25 +01:00
|
|
|
}
|
2010-03-24 08:43:17 +01:00
|
|
|
rt_emergency_hash_rebuild(net);
|
2010-03-24 22:51:22 +01:00
|
|
|
spin_unlock_bh(rt_hash_lock_addr(hash));
|
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
hash = rt_hash(rt->rt_key_dst, rt->rt_key_src,
|
2010-03-24 22:51:22 +01:00
|
|
|
ifindex, rt_genid(net));
|
|
|
|
goto restart;
|
2008-10-27 20:28:25 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Try to bind route to arp only if it is output
|
|
|
|
route or unicast forwarding path.
|
|
|
|
*/
|
2010-11-12 02:07:48 +01:00
|
|
|
if (rt->rt_type == RTN_UNICAST || rt_is_output_route(rt)) {
|
2011-07-12 00:44:24 +02:00
|
|
|
int err = rt_bind_neighbour(rt);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (err) {
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_unlock_bh(rt_hash_lock_addr(hash));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (err != -ENOBUFS) {
|
|
|
|
rt_drop(rt);
|
2011-03-02 23:31:35 +01:00
|
|
|
return ERR_PTR(err);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Neighbour tables are full and nothing
|
|
|
|
can be released. Try to shrink route cache,
|
|
|
|
it is most likely it holds some neighbour records.
|
|
|
|
*/
|
|
|
|
if (attempts-- > 0) {
|
|
|
|
int saved_elasticity = ip_rt_gc_elasticity;
|
|
|
|
int saved_int = ip_rt_gc_min_interval;
|
|
|
|
ip_rt_gc_elasticity = 1;
|
|
|
|
ip_rt_gc_min_interval = 0;
|
2008-01-18 12:56:57 +01:00
|
|
|
rt_garbage_collect(&ipv4_dst_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
ip_rt_gc_min_interval = saved_int;
|
|
|
|
ip_rt_gc_elasticity = saved_elasticity;
|
|
|
|
goto restart;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (net_ratelimit())
|
2010-09-28 00:02:18 +02:00
|
|
|
printk(KERN_WARNING "ipv4: Neighbour table overflow.\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
rt_drop(rt);
|
2011-03-02 23:31:35 +01:00
|
|
|
return ERR_PTR(-ENOBUFS);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
rt->dst.rt_next = rt_hash_table[hash].chain;
|
2008-10-27 20:28:25 +01:00
|
|
|
|
2008-10-16 23:18:29 +02:00
|
|
|
/*
|
|
|
|
* Since lookup is lockfree, we must make sure
|
2011-03-31 03:57:33 +02:00
|
|
|
* previous writes to rt are committed to memory
|
2008-10-16 23:18:29 +02:00
|
|
|
* before making rt visible to other CPUS.
|
|
|
|
*/
|
net: fix rtable leak in net/ipv4/route.c
Alexander V. Lukyanov found a regression in 2.6.29 and made a complete
analysis found in http://bugzilla.kernel.org/show_bug.cgi?id=13339
Quoted here because its a perfect one :
begin_of_quotation
2.6.29 patch has introduced flexible route cache rebuilding. Unfortunately the
patch has at least one critical flaw, and another problem.
rt_intern_hash calculates rthi pointer, which is later used for new entry
insertion. The same loop calculates cand pointer which is used to clean the
list. If the pointers are the same, rtable leak occurs, as first the cand is
removed then the new entry is appended to it.
This leak leads to unregister_netdevice problem (usage count > 0).
Another problem of the patch is that it tries to insert the entries in certain
order, to facilitate counting of entries distinct by all but QoS parameters.
Unfortunately, referencing an existing rtable entry moves it to list beginning,
to speed up further lookups, so the carefully built order is destroyed.
For the first problem the simplest patch it to set rthi=0 when rthi==cand, but
it will also destroy the ordering.
end_of_quotation
Problematic commit is 1080d709fb9d8cd4392f93476ee46a9d6ea05a5b
(net: implement emergency route cache rebulds when gc_elasticity is exceeded)
Trying to keep dst_entries ordered is too complex and breaks the fact that
order should depend on the frequency of use for garbage collection.
A possible fix is to make rt_intern_hash() simpler, and only makes
rt_check_expire() a litle bit smarter, being able to cope with an arbitrary
entries order. The added loop is running on cache hot data, while cpu
is prefetching next object, so should be unnoticied.
Reported-and-analyzed-by: Alexander V. Lukyanov <lav@yar.ru>
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Acked-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-05-19 22:14:28 +02:00
|
|
|
rcu_assign_pointer(rt_hash_table[hash].chain, rt);
|
2008-10-27 20:28:25 +01:00
|
|
|
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_unlock_bh(rt_hash_lock_addr(hash));
|
ipv4: fix NULL pointer + success return in route lookup path
Don't drop route if we're not caching
I recently got a report of an oops on a route lookup. Maxime was
testing what would happen if route caching was turned off (doing so by setting
making rt_caching always return 0), and found that it triggered an oops. I
looked at it and found that the problem stemmed from the fact that the route
lookup routines were returning success from their lookup paths (which is good),
but never set the **rp pointer to anything (which is bad). This happens because
in rt_intern_hash, if rt_caching returns false, we call rt_drop and return 0.
This almost emulates slient success. What we should be doing is assigning *rp =
rt and _not_ dropping the route. This way, during slow path lookups, when we
create a new route cache entry, we don't immediately discard it, rather we just
don't add it into the cache hash table, but we let this one lookup use it for
the purpose of this route request. Maxime has tested and reports it prevents
the oops. There is still a subsequent routing issue that I'm looking into
further, but I'm confident that, even if its related to this same path, this
patch makes sense to take.
Signed-off-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-20 10:15:16 +02:00
|
|
|
|
ipv4 routing: Ensure that route cache entries are usable and reclaimable with caching is off
When route caching is disabled (rt_caching returns false), We still use route
cache entries that are created and passed into rt_intern_hash once. These
routes need to be made usable for the one call path that holds a reference to
them, and they need to be reclaimed when they're finished with their use. To be
made usable, they need to be associated with a neighbor table entry (which they
currently are not), otherwise iproute_finish2 just discards the packet, since we
don't know which L2 peer to send the packet to. To do this binding, we need to
follow the path a bit higher up in rt_intern_hash, which calls
arp_bind_neighbour, but not assign the route entry to the hash table.
Currently, if caching is off, we simply assign the route to the rp pointer and
are reutrn success. This patch associates us with a neighbor entry first.
Secondly, we need to make sure that any single use routes like this are known to
the garbage collector when caching is off. If caching is off, and we try to
hash in a route, it will leak when its refcount reaches zero. To avoid this,
this patch calls rt_free on the route cache entry passed into rt_intern_hash.
This places us on the gc list for the route cache garbage collector, so that
when its refcount reaches zero, it will be reclaimed (Thanks to Alexey for this
suggestion).
I've tested this on a local system here, and with these patches in place, I'm
able to maintain routed connectivity to remote systems, even if I set
/proc/sys/net/ipv4/rt_cache_rebuild_count to -1, which forces rt_caching to
return false.
Signed-off-by: Neil Horman <nhorman@redhat.com>
Reported-by: Jarek Poplawski <jarkao2@gmail.com>
Reported-by: Maxime Bizon <mbizon@freebox.fr>
Signed-off-by: David S. Miller <davem@davemloft.net>
2009-06-22 12:18:53 +02:00
|
|
|
skip_hashing:
|
2011-03-02 23:31:35 +01:00
|
|
|
if (skb)
|
2010-06-11 08:31:35 +02:00
|
|
|
skb_dst_set(skb, &rt->dst);
|
2011-03-02 23:31:35 +01:00
|
|
|
return rt;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
inet: Create a mechanism for upward inetpeer propagation into routes.
If we didn't have a routing cache, we would not be able to properly
propagate certain kinds of dynamic path attributes, for example
PMTU information and redirects.
The reason is that if we didn't have a routing cache, then there would
be no way to lookup all of the active cached routes hanging off of
sockets, tunnels, IPSEC bundles, etc.
Consider the case where we created a cached route, but no inetpeer
entry existed and also we were not asked to pre-COW the route metrics
and therefore did not force the creation a new inetpeer entry.
If we later get a PMTU message, or a redirect, and store this
information in a new inetpeer entry, there is no way to teach that
cached route about the newly existing inetpeer entry.
The facilities implemented here handle this problem.
First we create a generation ID. When we create a cached route of any
kind, we remember the generation ID at the time of attachment. Any
time we force-create an inetpeer entry in response to new path
information, we bump that generation ID.
The dst_ops->check() callback is where the knowledge of this event
is propagated. If the global generation ID does not equal the one
stored in the cached route, and the cached route has not attached
to an inetpeer yet, we look it up and attach if one is found. Now
that we've updated the cached route's information, we update the
route's generation ID too.
This clears the way for implementing PMTU and redirects directly in
the inetpeer cache. There is absolutely no need to consult cached
route information in order to maintain this information.
At this point nothing bumps the inetpeer genids, that comes in the
later changes which handle PMTUs and redirects using inetpeers.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-02-08 05:38:06 +01:00
|
|
|
static atomic_t __rt_peer_genid = ATOMIC_INIT(0);
|
|
|
|
|
|
|
|
static u32 rt_peer_genid(void)
|
|
|
|
{
|
|
|
|
return atomic_read(&__rt_peer_genid);
|
|
|
|
}
|
|
|
|
|
2011-05-19 00:42:43 +02:00
|
|
|
void rt_bind_peer(struct rtable *rt, __be32 daddr, int create)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct inet_peer *peer;
|
|
|
|
|
2011-05-19 00:42:43 +02:00
|
|
|
peer = inet_getpeer_v4(daddr, create);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-08-19 08:10:45 +02:00
|
|
|
if (peer && cmpxchg(&rt->peer, NULL, peer) != NULL)
|
2005-04-17 00:20:36 +02:00
|
|
|
inet_putpeer(peer);
|
inet: Create a mechanism for upward inetpeer propagation into routes.
If we didn't have a routing cache, we would not be able to properly
propagate certain kinds of dynamic path attributes, for example
PMTU information and redirects.
The reason is that if we didn't have a routing cache, then there would
be no way to lookup all of the active cached routes hanging off of
sockets, tunnels, IPSEC bundles, etc.
Consider the case where we created a cached route, but no inetpeer
entry existed and also we were not asked to pre-COW the route metrics
and therefore did not force the creation a new inetpeer entry.
If we later get a PMTU message, or a redirect, and store this
information in a new inetpeer entry, there is no way to teach that
cached route about the newly existing inetpeer entry.
The facilities implemented here handle this problem.
First we create a generation ID. When we create a cached route of any
kind, we remember the generation ID at the time of attachment. Any
time we force-create an inetpeer entry in response to new path
information, we bump that generation ID.
The dst_ops->check() callback is where the knowledge of this event
is propagated. If the global generation ID does not equal the one
stored in the cached route, and the cached route has not attached
to an inetpeer yet, we look it up and attach if one is found. Now
that we've updated the cached route's information, we update the
route's generation ID too.
This clears the way for implementing PMTU and redirects directly in
the inetpeer cache. There is absolutely no need to consult cached
route information in order to maintain this information.
At this point nothing bumps the inetpeer genids, that comes in the
later changes which handle PMTUs and redirects using inetpeers.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-02-08 05:38:06 +01:00
|
|
|
else
|
|
|
|
rt->rt_peer_genid = rt_peer_genid();
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Peer allocation may fail only in serious out-of-memory conditions. However
|
|
|
|
* we still can generate some output.
|
|
|
|
* Random ID selection looks a bit dangerous because we have no chances to
|
|
|
|
* select ID being unique in a reasonable period of time.
|
|
|
|
* But broken packet identifier may be better than no packet at all.
|
|
|
|
*/
|
|
|
|
static void ip_select_fb_ident(struct iphdr *iph)
|
|
|
|
{
|
|
|
|
static DEFINE_SPINLOCK(ip_fb_id_lock);
|
|
|
|
static u32 ip_fallback_id;
|
|
|
|
u32 salt;
|
|
|
|
|
|
|
|
spin_lock_bh(&ip_fb_id_lock);
|
2006-09-27 07:15:01 +02:00
|
|
|
salt = secure_ip_id((__force __be32)ip_fallback_id ^ iph->daddr);
|
2005-04-17 00:20:36 +02:00
|
|
|
iph->id = htons(salt & 0xFFFF);
|
|
|
|
ip_fallback_id = salt;
|
|
|
|
spin_unlock_bh(&ip_fb_id_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
void __ip_select_ident(struct iphdr *iph, struct dst_entry *dst, int more)
|
|
|
|
{
|
|
|
|
struct rtable *rt = (struct rtable *) dst;
|
|
|
|
|
|
|
|
if (rt) {
|
|
|
|
if (rt->peer == NULL)
|
2011-05-19 00:42:43 +02:00
|
|
|
rt_bind_peer(rt, rt->rt_dst, 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* If peer is attached to destination, it is never detached,
|
|
|
|
so that we need not to grab a lock to dereference it.
|
|
|
|
*/
|
|
|
|
if (rt->peer) {
|
|
|
|
iph->id = htons(inet_getid(rt->peer, more));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else
|
2007-02-09 15:24:47 +01:00
|
|
|
printk(KERN_DEBUG "rt_bind_peer(0) @%p\n",
|
2005-04-20 07:39:42 +02:00
|
|
|
__builtin_return_address(0));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
ip_select_fb_ident(iph);
|
|
|
|
}
|
2010-07-09 23:22:10 +02:00
|
|
|
EXPORT_SYMBOL(__ip_select_ident);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
static void rt_del(unsigned hash, struct rtable *rt)
|
|
|
|
{
|
2010-10-25 23:02:07 +02:00
|
|
|
struct rtable __rcu **rthp;
|
|
|
|
struct rtable *aux;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
rthp = &rt_hash_table[hash].chain;
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_lock_bh(rt_hash_lock_addr(hash));
|
2005-04-17 00:20:36 +02:00
|
|
|
ip_rt_put(rt);
|
2010-10-25 23:02:07 +02:00
|
|
|
while ((aux = rcu_dereference_protected(*rthp,
|
|
|
|
lockdep_is_held(rt_hash_lock_addr(hash)))) != NULL) {
|
2008-07-06 04:04:32 +02:00
|
|
|
if (aux == rt || rt_is_expired(aux)) {
|
2010-06-11 08:31:35 +02:00
|
|
|
*rthp = aux->dst.rt_next;
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
rt_free(aux);
|
|
|
|
continue;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2010-06-11 08:31:35 +02:00
|
|
|
rthp = &aux->dst.rt_next;
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
}
|
2005-07-05 23:55:24 +02:00
|
|
|
spin_unlock_bh(rt_hash_lock_addr(hash));
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-12-05 19:21:42 +01:00
|
|
|
static void check_peer_redir(struct dst_entry *dst, struct inet_peer *peer)
|
2011-11-18 21:24:32 +01:00
|
|
|
{
|
|
|
|
struct rtable *rt = (struct rtable *) dst;
|
|
|
|
__be32 orig_gw = rt->rt_gateway;
|
|
|
|
struct neighbour *n, *old_n;
|
|
|
|
|
|
|
|
dst_confirm(&rt->dst);
|
|
|
|
|
|
|
|
rt->rt_gateway = peer->redirect_learned.a4;
|
|
|
|
|
|
|
|
n = ipv4_neigh_lookup(&rt->dst, &rt->rt_gateway);
|
2011-12-05 19:21:42 +01:00
|
|
|
if (IS_ERR(n)) {
|
|
|
|
rt->rt_gateway = orig_gw;
|
|
|
|
return;
|
|
|
|
}
|
2011-11-18 21:24:32 +01:00
|
|
|
old_n = xchg(&rt->dst._neighbour, n);
|
|
|
|
if (old_n)
|
|
|
|
neigh_release(old_n);
|
2011-12-05 19:21:42 +01:00
|
|
|
if (!(n->nud_state & NUD_VALID)) {
|
|
|
|
neigh_event_send(n, NULL);
|
2011-11-18 21:24:32 +01:00
|
|
|
} else {
|
|
|
|
rt->rt_flags |= RTCF_REDIRECTED;
|
|
|
|
call_netevent_notifiers(NETEVENT_NEIGH_UPDATE, n);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-06-08 06:49:44 +02:00
|
|
|
/* called in rcu_read_lock() section */
|
2006-09-27 06:25:43 +02:00
|
|
|
void ip_rt_redirect(__be32 old_gw, __be32 daddr, __be32 new_gw,
|
|
|
|
__be32 saddr, struct net_device *dev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-10-24 08:56:38 +02:00
|
|
|
int s, i;
|
2010-06-08 06:49:44 +02:00
|
|
|
struct in_device *in_dev = __in_dev_get_rcu(dev);
|
2011-10-24 08:56:38 +02:00
|
|
|
__be32 skeys[2] = { saddr, 0 };
|
|
|
|
int ikeys[2] = { dev->ifindex, 0 };
|
2011-02-10 07:00:16 +01:00
|
|
|
struct inet_peer *peer;
|
2008-02-29 05:50:06 +01:00
|
|
|
struct net *net;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (!in_dev)
|
|
|
|
return;
|
|
|
|
|
2008-03-25 13:47:49 +01:00
|
|
|
net = dev_net(dev);
|
2009-11-23 19:41:23 +01:00
|
|
|
if (new_gw == old_gw || !IN_DEV_RX_REDIRECTS(in_dev) ||
|
|
|
|
ipv4_is_multicast(new_gw) || ipv4_is_lbcast(new_gw) ||
|
|
|
|
ipv4_is_zeronet(new_gw))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto reject_redirect;
|
|
|
|
|
|
|
|
if (!IN_DEV_SHARED_MEDIA(in_dev)) {
|
|
|
|
if (!inet_addr_onlink(in_dev, new_gw, old_gw))
|
|
|
|
goto reject_redirect;
|
|
|
|
if (IN_DEV_SEC_REDIRECTS(in_dev) && ip_fib_check_default(new_gw, dev))
|
|
|
|
goto reject_redirect;
|
|
|
|
} else {
|
2008-02-29 05:50:06 +01:00
|
|
|
if (inet_addr_type(net, new_gw) != RTN_UNICAST)
|
2005-04-17 00:20:36 +02:00
|
|
|
goto reject_redirect;
|
|
|
|
}
|
|
|
|
|
2011-10-24 08:56:38 +02:00
|
|
|
for (s = 0; s < 2; s++) {
|
|
|
|
for (i = 0; i < 2; i++) {
|
2011-11-18 21:24:32 +01:00
|
|
|
unsigned int hash;
|
|
|
|
struct rtable __rcu **rthp;
|
|
|
|
struct rtable *rt;
|
|
|
|
|
|
|
|
hash = rt_hash(daddr, skeys[s], ikeys[i], rt_genid(net));
|
|
|
|
|
|
|
|
rthp = &rt_hash_table[hash].chain;
|
|
|
|
|
|
|
|
while ((rt = rcu_dereference(*rthp)) != NULL) {
|
|
|
|
rthp = &rt->dst.rt_next;
|
|
|
|
|
|
|
|
if (rt->rt_key_dst != daddr ||
|
|
|
|
rt->rt_key_src != skeys[s] ||
|
|
|
|
rt->rt_oif != ikeys[i] ||
|
|
|
|
rt_is_input_route(rt) ||
|
|
|
|
rt_is_expired(rt) ||
|
|
|
|
!net_eq(dev_net(rt->dst.dev), net) ||
|
|
|
|
rt->dst.error ||
|
|
|
|
rt->dst.dev != dev ||
|
|
|
|
rt->rt_gateway != old_gw)
|
|
|
|
continue;
|
2007-02-09 15:24:47 +01:00
|
|
|
|
2011-11-18 21:24:32 +01:00
|
|
|
if (!rt->peer)
|
|
|
|
rt_bind_peer(rt, rt->rt_dst, 1);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-11-18 21:24:32 +01:00
|
|
|
peer = rt->peer;
|
|
|
|
if (peer) {
|
2011-11-26 13:13:44 +01:00
|
|
|
if (peer->redirect_learned.a4 != new_gw ||
|
|
|
|
peer->redirect_genid != redirect_genid) {
|
2011-11-18 21:24:32 +01:00
|
|
|
peer->redirect_learned.a4 = new_gw;
|
2011-11-26 13:13:44 +01:00
|
|
|
peer->redirect_genid = redirect_genid;
|
2011-11-18 21:24:32 +01:00
|
|
|
atomic_inc(&__rt_peer_genid);
|
|
|
|
}
|
|
|
|
check_peer_redir(&rt->dst, peer);
|
|
|
|
}
|
2011-10-24 08:56:38 +02:00
|
|
|
}
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
return;
|
|
|
|
|
|
|
|
reject_redirect:
|
|
|
|
#ifdef CONFIG_IP_ROUTE_VERBOSE
|
|
|
|
if (IN_DEV_LOG_MARTIANS(in_dev) && net_ratelimit())
|
2008-10-31 08:53:57 +01:00
|
|
|
printk(KERN_INFO "Redirect from %pI4 on %s about %pI4 ignored.\n"
|
|
|
|
" Advised path = %pI4 -> %pI4\n",
|
|
|
|
&old_gw, dev->name, &new_gw,
|
|
|
|
&saddr, &daddr);
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2010-06-08 06:49:44 +02:00
|
|
|
;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-06-08 08:07:07 +02:00
|
|
|
static bool peer_pmtu_expired(struct inet_peer *peer)
|
|
|
|
{
|
|
|
|
unsigned long orig = ACCESS_ONCE(peer->pmtu_expires);
|
|
|
|
|
|
|
|
return orig &&
|
|
|
|
time_after_eq(jiffies, orig) &&
|
|
|
|
cmpxchg(&peer->pmtu_expires, orig, 0) == orig;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool peer_pmtu_cleaned(struct inet_peer *peer)
|
|
|
|
{
|
|
|
|
unsigned long orig = ACCESS_ONCE(peer->pmtu_expires);
|
|
|
|
|
|
|
|
return orig &&
|
|
|
|
cmpxchg(&peer->pmtu_expires, orig, 0) == orig;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static struct dst_entry *ipv4_negative_advice(struct dst_entry *dst)
|
|
|
|
{
|
2008-03-06 03:30:47 +01:00
|
|
|
struct rtable *rt = (struct rtable *)dst;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct dst_entry *ret = dst;
|
|
|
|
|
|
|
|
if (rt) {
|
2010-03-19 00:20:20 +01:00
|
|
|
if (dst->obsolete > 0) {
|
2005-04-17 00:20:36 +02:00
|
|
|
ip_rt_put(rt);
|
|
|
|
ret = NULL;
|
2011-02-10 05:42:07 +01:00
|
|
|
} else if (rt->rt_flags & RTCF_REDIRECTED) {
|
2011-03-05 06:47:09 +01:00
|
|
|
unsigned hash = rt_hash(rt->rt_key_dst, rt->rt_key_src,
|
|
|
|
rt->rt_oif,
|
2008-07-06 04:04:32 +02:00
|
|
|
rt_genid(dev_net(dst->dev)));
|
2005-04-17 00:20:36 +02:00
|
|
|
rt_del(hash, rt);
|
|
|
|
ret = NULL;
|
2011-06-08 08:07:07 +02:00
|
|
|
} else if (rt->peer && peer_pmtu_expired(rt->peer)) {
|
|
|
|
dst_metric_set(dst, RTAX_MTU, rt->peer->pmtu_orig);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Algorithm:
|
|
|
|
* 1. The first ip_rt_redirect_number redirects are sent
|
|
|
|
* with exponential backoff, then we stop sending them at all,
|
|
|
|
* assuming that the host ignores our redirects.
|
|
|
|
* 2. If we did not see packets requiring redirects
|
|
|
|
* during ip_rt_redirect_silence, we assume that the host
|
|
|
|
* forgot redirected route and start to send redirects again.
|
|
|
|
*
|
|
|
|
* This algorithm is much cheaper and more intelligent than dumb load limiting
|
|
|
|
* in icmp.c.
|
|
|
|
*
|
|
|
|
* NOTE. Do not forget to inhibit load limiting for redirects (redundant)
|
|
|
|
* and "frag. need" (breaks PMTU discovery) in icmp.c.
|
|
|
|
*/
|
|
|
|
|
|
|
|
void ip_rt_send_redirect(struct sk_buff *skb)
|
|
|
|
{
|
2009-06-02 07:14:27 +02:00
|
|
|
struct rtable *rt = skb_rtable(skb);
|
2009-08-29 08:52:01 +02:00
|
|
|
struct in_device *in_dev;
|
2011-02-05 00:55:25 +01:00
|
|
|
struct inet_peer *peer;
|
2009-08-29 08:52:01 +02:00
|
|
|
int log_martians;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-08-29 08:52:01 +02:00
|
|
|
rcu_read_lock();
|
2010-06-11 08:31:35 +02:00
|
|
|
in_dev = __in_dev_get_rcu(rt->dst.dev);
|
2009-08-29 08:52:01 +02:00
|
|
|
if (!in_dev || !IN_DEV_TX_REDIRECTS(in_dev)) {
|
|
|
|
rcu_read_unlock();
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
2009-08-29 08:52:01 +02:00
|
|
|
}
|
|
|
|
log_martians = IN_DEV_LOG_MARTIANS(in_dev);
|
|
|
|
rcu_read_unlock();
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-02-05 00:55:25 +01:00
|
|
|
if (!rt->peer)
|
2011-05-19 00:42:43 +02:00
|
|
|
rt_bind_peer(rt, rt->rt_dst, 1);
|
2011-02-05 00:55:25 +01:00
|
|
|
peer = rt->peer;
|
|
|
|
if (!peer) {
|
|
|
|
icmp_send(skb, ICMP_REDIRECT, ICMP_REDIR_HOST, rt->rt_gateway);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/* No redirected packets during ip_rt_redirect_silence;
|
|
|
|
* reset the algorithm.
|
|
|
|
*/
|
2011-02-05 00:55:25 +01:00
|
|
|
if (time_after(jiffies, peer->rate_last + ip_rt_redirect_silence))
|
|
|
|
peer->rate_tokens = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* Too many ignored redirects; do not send anything
|
2010-06-11 08:31:35 +02:00
|
|
|
* set dst.rate_last to the last seen redirected packet.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2011-02-05 00:55:25 +01:00
|
|
|
if (peer->rate_tokens >= ip_rt_redirect_number) {
|
|
|
|
peer->rate_last = jiffies;
|
2009-08-29 08:52:01 +02:00
|
|
|
return;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for load limit; set rate_last to the latest sent
|
|
|
|
* redirect.
|
|
|
|
*/
|
2011-02-05 00:55:25 +01:00
|
|
|
if (peer->rate_tokens == 0 ||
|
2006-12-18 09:26:35 +01:00
|
|
|
time_after(jiffies,
|
2011-02-05 00:55:25 +01:00
|
|
|
(peer->rate_last +
|
|
|
|
(ip_rt_redirect_load << peer->rate_tokens)))) {
|
2005-04-17 00:20:36 +02:00
|
|
|
icmp_send(skb, ICMP_REDIRECT, ICMP_REDIR_HOST, rt->rt_gateway);
|
2011-02-05 00:55:25 +01:00
|
|
|
peer->rate_last = jiffies;
|
|
|
|
++peer->rate_tokens;
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_IP_ROUTE_VERBOSE
|
2009-08-29 08:52:01 +02:00
|
|
|
if (log_martians &&
|
2011-02-05 00:55:25 +01:00
|
|
|
peer->rate_tokens == ip_rt_redirect_number &&
|
2005-04-17 00:20:36 +02:00
|
|
|
net_ratelimit())
|
2008-10-31 08:53:57 +01:00
|
|
|
printk(KERN_WARNING "host %pI4/if%d ignores redirects for %pI4 to %pI4.\n",
|
2011-05-14 00:01:21 +02:00
|
|
|
&ip_hdr(skb)->saddr, rt->rt_iif,
|
2008-10-31 08:53:57 +01:00
|
|
|
&rt->rt_dst, &rt->rt_gateway);
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ip_error(struct sk_buff *skb)
|
|
|
|
{
|
2009-06-02 07:14:27 +02:00
|
|
|
struct rtable *rt = skb_rtable(skb);
|
2011-02-05 00:55:25 +01:00
|
|
|
struct inet_peer *peer;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned long now;
|
2011-02-05 00:55:25 +01:00
|
|
|
bool send;
|
2005-04-17 00:20:36 +02:00
|
|
|
int code;
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
switch (rt->dst.error) {
|
2011-07-01 11:43:07 +02:00
|
|
|
case EINVAL:
|
|
|
|
default:
|
|
|
|
goto out;
|
|
|
|
case EHOSTUNREACH:
|
|
|
|
code = ICMP_HOST_UNREACH;
|
|
|
|
break;
|
|
|
|
case ENETUNREACH:
|
|
|
|
code = ICMP_NET_UNREACH;
|
|
|
|
IP_INC_STATS_BH(dev_net(rt->dst.dev),
|
|
|
|
IPSTATS_MIB_INNOROUTES);
|
|
|
|
break;
|
|
|
|
case EACCES:
|
|
|
|
code = ICMP_PKT_FILTERED;
|
|
|
|
break;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-02-05 00:55:25 +01:00
|
|
|
if (!rt->peer)
|
2011-05-19 00:42:43 +02:00
|
|
|
rt_bind_peer(rt, rt->rt_dst, 1);
|
2011-02-05 00:55:25 +01:00
|
|
|
peer = rt->peer;
|
|
|
|
|
|
|
|
send = true;
|
|
|
|
if (peer) {
|
|
|
|
now = jiffies;
|
|
|
|
peer->rate_tokens += now - peer->rate_last;
|
|
|
|
if (peer->rate_tokens > ip_rt_error_burst)
|
|
|
|
peer->rate_tokens = ip_rt_error_burst;
|
|
|
|
peer->rate_last = now;
|
|
|
|
if (peer->rate_tokens >= ip_rt_error_cost)
|
|
|
|
peer->rate_tokens -= ip_rt_error_cost;
|
|
|
|
else
|
|
|
|
send = false;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-02-05 00:55:25 +01:00
|
|
|
if (send)
|
|
|
|
icmp_send(skb, ICMP_DEST_UNREACH, code, 0);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
out: kfree_skb(skb);
|
|
|
|
return 0;
|
2007-02-09 15:24:47 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The last two values are not from the RFC but
|
|
|
|
* are needed for AMPRnet AX.25 paths.
|
|
|
|
*/
|
|
|
|
|
2005-11-30 01:21:38 +01:00
|
|
|
static const unsigned short mtu_plateau[] =
|
2005-04-17 00:20:36 +02:00
|
|
|
{32000, 17914, 8166, 4352, 2002, 1492, 576, 296, 216, 128 };
|
|
|
|
|
2008-04-10 10:52:09 +02:00
|
|
|
static inline unsigned short guess_mtu(unsigned short old_mtu)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int i;
|
2007-02-09 15:24:47 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
for (i = 0; i < ARRAY_SIZE(mtu_plateau); i++)
|
|
|
|
if (old_mtu > mtu_plateau[i])
|
|
|
|
return mtu_plateau[i];
|
|
|
|
return 68;
|
|
|
|
}
|
|
|
|
|
2011-04-22 06:53:02 +02:00
|
|
|
unsigned short ip_rt_frag_needed(struct net *net, const struct iphdr *iph,
|
2008-04-29 12:32:25 +02:00
|
|
|
unsigned short new_mtu,
|
|
|
|
struct net_device *dev)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
unsigned short old_mtu = ntohs(iph->tot_len);
|
|
|
|
unsigned short est_mtu = 0;
|
2011-02-10 05:42:07 +01:00
|
|
|
struct inet_peer *peer;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
peer = inet_getpeer_v4(iph->daddr, 1);
|
|
|
|
if (peer) {
|
|
|
|
unsigned short mtu = new_mtu;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
if (new_mtu < 68 || new_mtu >= old_mtu) {
|
|
|
|
/* BSD 4.2 derived systems incorrectly adjust
|
|
|
|
* tot_len by the IP header length, and report
|
|
|
|
* a zero MTU in the ICMP message.
|
|
|
|
*/
|
|
|
|
if (mtu == 0 &&
|
|
|
|
old_mtu >= 68 + (iph->ihl << 2))
|
|
|
|
old_mtu -= iph->ihl << 2;
|
|
|
|
mtu = guess_mtu(old_mtu);
|
|
|
|
}
|
2008-04-29 12:32:25 +02:00
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
if (mtu < ip_rt_min_pmtu)
|
|
|
|
mtu = ip_rt_min_pmtu;
|
|
|
|
if (!peer->pmtu_expires || mtu < peer->pmtu_learned) {
|
2011-03-09 21:09:58 +01:00
|
|
|
unsigned long pmtu_expires;
|
|
|
|
|
|
|
|
pmtu_expires = jiffies + ip_rt_mtu_expires;
|
|
|
|
if (!pmtu_expires)
|
|
|
|
pmtu_expires = 1UL;
|
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
est_mtu = mtu;
|
|
|
|
peer->pmtu_learned = mtu;
|
2011-03-09 21:09:58 +01:00
|
|
|
peer->pmtu_expires = pmtu_expires;
|
2011-10-19 17:34:09 +02:00
|
|
|
atomic_inc(&__rt_peer_genid);
|
2011-02-10 05:42:07 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
inet_putpeer(peer);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
return est_mtu ? : new_mtu;
|
|
|
|
}
|
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
static void check_peer_pmtu(struct dst_entry *dst, struct inet_peer *peer)
|
|
|
|
{
|
2011-06-08 08:07:07 +02:00
|
|
|
unsigned long expires = ACCESS_ONCE(peer->pmtu_expires);
|
2011-02-10 05:42:07 +01:00
|
|
|
|
2011-06-08 08:07:07 +02:00
|
|
|
if (!expires)
|
|
|
|
return;
|
2011-03-09 21:09:58 +01:00
|
|
|
if (time_before(jiffies, expires)) {
|
2011-02-10 05:42:07 +01:00
|
|
|
u32 orig_dst_mtu = dst_mtu(dst);
|
|
|
|
if (peer->pmtu_learned < orig_dst_mtu) {
|
|
|
|
if (!peer->pmtu_orig)
|
|
|
|
peer->pmtu_orig = dst_metric_raw(dst, RTAX_MTU);
|
|
|
|
dst_metric_set(dst, RTAX_MTU, peer->pmtu_learned);
|
|
|
|
}
|
|
|
|
} else if (cmpxchg(&peer->pmtu_expires, expires, 0) == expires)
|
|
|
|
dst_metric_set(dst, RTAX_MTU, peer->pmtu_orig);
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static void ip_rt_update_pmtu(struct dst_entry *dst, u32 mtu)
|
|
|
|
{
|
2011-02-10 05:42:07 +01:00
|
|
|
struct rtable *rt = (struct rtable *) dst;
|
|
|
|
struct inet_peer *peer;
|
|
|
|
|
|
|
|
dst_confirm(dst);
|
|
|
|
|
|
|
|
if (!rt->peer)
|
2011-05-19 00:42:43 +02:00
|
|
|
rt_bind_peer(rt, rt->rt_dst, 1);
|
2011-02-10 05:42:07 +01:00
|
|
|
peer = rt->peer;
|
|
|
|
if (peer) {
|
2011-06-08 08:07:07 +02:00
|
|
|
unsigned long pmtu_expires = ACCESS_ONCE(peer->pmtu_expires);
|
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
if (mtu < ip_rt_min_pmtu)
|
2005-04-17 00:20:36 +02:00
|
|
|
mtu = ip_rt_min_pmtu;
|
2011-06-08 08:07:07 +02:00
|
|
|
if (!pmtu_expires || mtu < peer->pmtu_learned) {
|
2011-03-09 21:09:58 +01:00
|
|
|
|
|
|
|
pmtu_expires = jiffies + ip_rt_mtu_expires;
|
|
|
|
if (!pmtu_expires)
|
|
|
|
pmtu_expires = 1UL;
|
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
peer->pmtu_learned = mtu;
|
2011-03-09 21:09:58 +01:00
|
|
|
peer->pmtu_expires = pmtu_expires;
|
2011-02-10 05:42:07 +01:00
|
|
|
|
|
|
|
atomic_inc(&__rt_peer_genid);
|
|
|
|
rt->rt_peer_genid = rt_peer_genid();
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-03-09 21:09:58 +01:00
|
|
|
check_peer_pmtu(dst, peer);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-02-10 07:00:16 +01:00
|
|
|
|
2011-12-05 19:21:42 +01:00
|
|
|
static void ipv4_validate_peer(struct rtable *rt)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
inet: Create a mechanism for upward inetpeer propagation into routes.
If we didn't have a routing cache, we would not be able to properly
propagate certain kinds of dynamic path attributes, for example
PMTU information and redirects.
The reason is that if we didn't have a routing cache, then there would
be no way to lookup all of the active cached routes hanging off of
sockets, tunnels, IPSEC bundles, etc.
Consider the case where we created a cached route, but no inetpeer
entry existed and also we were not asked to pre-COW the route metrics
and therefore did not force the creation a new inetpeer entry.
If we later get a PMTU message, or a redirect, and store this
information in a new inetpeer entry, there is no way to teach that
cached route about the newly existing inetpeer entry.
The facilities implemented here handle this problem.
First we create a generation ID. When we create a cached route of any
kind, we remember the generation ID at the time of attachment. Any
time we force-create an inetpeer entry in response to new path
information, we bump that generation ID.
The dst_ops->check() callback is where the knowledge of this event
is propagated. If the global generation ID does not equal the one
stored in the cached route, and the cached route has not attached
to an inetpeer yet, we look it up and attach if one is found. Now
that we've updated the cached route's information, we update the
route's generation ID too.
This clears the way for implementing PMTU and redirects directly in
the inetpeer cache. There is absolutely no need to consult cached
route information in order to maintain this information.
At this point nothing bumps the inetpeer genids, that comes in the
later changes which handle PMTUs and redirects using inetpeers.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-02-08 05:38:06 +01:00
|
|
|
if (rt->rt_peer_genid != rt_peer_genid()) {
|
2011-02-10 05:42:07 +01:00
|
|
|
struct inet_peer *peer;
|
|
|
|
|
inet: Create a mechanism for upward inetpeer propagation into routes.
If we didn't have a routing cache, we would not be able to properly
propagate certain kinds of dynamic path attributes, for example
PMTU information and redirects.
The reason is that if we didn't have a routing cache, then there would
be no way to lookup all of the active cached routes hanging off of
sockets, tunnels, IPSEC bundles, etc.
Consider the case where we created a cached route, but no inetpeer
entry existed and also we were not asked to pre-COW the route metrics
and therefore did not force the creation a new inetpeer entry.
If we later get a PMTU message, or a redirect, and store this
information in a new inetpeer entry, there is no way to teach that
cached route about the newly existing inetpeer entry.
The facilities implemented here handle this problem.
First we create a generation ID. When we create a cached route of any
kind, we remember the generation ID at the time of attachment. Any
time we force-create an inetpeer entry in response to new path
information, we bump that generation ID.
The dst_ops->check() callback is where the knowledge of this event
is propagated. If the global generation ID does not equal the one
stored in the cached route, and the cached route has not attached
to an inetpeer yet, we look it up and attach if one is found. Now
that we've updated the cached route's information, we update the
route's generation ID too.
This clears the way for implementing PMTU and redirects directly in
the inetpeer cache. There is absolutely no need to consult cached
route information in order to maintain this information.
At this point nothing bumps the inetpeer genids, that comes in the
later changes which handle PMTUs and redirects using inetpeers.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-02-08 05:38:06 +01:00
|
|
|
if (!rt->peer)
|
2011-05-19 00:42:43 +02:00
|
|
|
rt_bind_peer(rt, rt->rt_dst, 0);
|
inet: Create a mechanism for upward inetpeer propagation into routes.
If we didn't have a routing cache, we would not be able to properly
propagate certain kinds of dynamic path attributes, for example
PMTU information and redirects.
The reason is that if we didn't have a routing cache, then there would
be no way to lookup all of the active cached routes hanging off of
sockets, tunnels, IPSEC bundles, etc.
Consider the case where we created a cached route, but no inetpeer
entry existed and also we were not asked to pre-COW the route metrics
and therefore did not force the creation a new inetpeer entry.
If we later get a PMTU message, or a redirect, and store this
information in a new inetpeer entry, there is no way to teach that
cached route about the newly existing inetpeer entry.
The facilities implemented here handle this problem.
First we create a generation ID. When we create a cached route of any
kind, we remember the generation ID at the time of attachment. Any
time we force-create an inetpeer entry in response to new path
information, we bump that generation ID.
The dst_ops->check() callback is where the knowledge of this event
is propagated. If the global generation ID does not equal the one
stored in the cached route, and the cached route has not attached
to an inetpeer yet, we look it up and attach if one is found. Now
that we've updated the cached route's information, we update the
route's generation ID too.
This clears the way for implementing PMTU and redirects directly in
the inetpeer cache. There is absolutely no need to consult cached
route information in order to maintain this information.
At this point nothing bumps the inetpeer genids, that comes in the
later changes which handle PMTUs and redirects using inetpeers.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-02-08 05:38:06 +01:00
|
|
|
|
2011-02-10 05:42:07 +01:00
|
|
|
peer = rt->peer;
|
2011-06-08 08:07:07 +02:00
|
|
|
if (peer) {
|
2011-12-01 19:38:59 +01:00
|
|
|
check_peer_pmtu(&rt->dst, peer);
|
2011-02-10 05:42:07 +01:00
|
|
|
|
2011-11-26 13:13:44 +01:00
|
|
|
if (peer->redirect_genid != redirect_genid)
|
|
|
|
peer->redirect_learned.a4 = 0;
|
2011-06-08 08:07:07 +02:00
|
|
|
if (peer->redirect_learned.a4 &&
|
2011-12-05 19:21:42 +01:00
|
|
|
peer->redirect_learned.a4 != rt->rt_gateway)
|
|
|
|
check_peer_redir(&rt->dst, peer);
|
2011-02-10 07:00:16 +01:00
|
|
|
}
|
|
|
|
|
inet: Create a mechanism for upward inetpeer propagation into routes.
If we didn't have a routing cache, we would not be able to properly
propagate certain kinds of dynamic path attributes, for example
PMTU information and redirects.
The reason is that if we didn't have a routing cache, then there would
be no way to lookup all of the active cached routes hanging off of
sockets, tunnels, IPSEC bundles, etc.
Consider the case where we created a cached route, but no inetpeer
entry existed and also we were not asked to pre-COW the route metrics
and therefore did not force the creation a new inetpeer entry.
If we later get a PMTU message, or a redirect, and store this
information in a new inetpeer entry, there is no way to teach that
cached route about the newly existing inetpeer entry.
The facilities implemented here handle this problem.
First we create a generation ID. When we create a cached route of any
kind, we remember the generation ID at the time of attachment. Any
time we force-create an inetpeer entry in response to new path
information, we bump that generation ID.
The dst_ops->check() callback is where the knowledge of this event
is propagated. If the global generation ID does not equal the one
stored in the cached route, and the cached route has not attached
to an inetpeer yet, we look it up and attach if one is found. Now
that we've updated the cached route's information, we update the
route's generation ID too.
This clears the way for implementing PMTU and redirects directly in
the inetpeer cache. There is absolutely no need to consult cached
route information in order to maintain this information.
At this point nothing bumps the inetpeer genids, that comes in the
later changes which handle PMTUs and redirects using inetpeers.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-02-08 05:38:06 +01:00
|
|
|
rt->rt_peer_genid = rt_peer_genid();
|
|
|
|
}
|
2011-12-01 19:38:59 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct dst_entry *ipv4_dst_check(struct dst_entry *dst, u32 cookie)
|
|
|
|
{
|
|
|
|
struct rtable *rt = (struct rtable *) dst;
|
|
|
|
|
|
|
|
if (rt_is_expired(rt))
|
|
|
|
return NULL;
|
2011-12-05 19:21:42 +01:00
|
|
|
ipv4_validate_peer(rt);
|
2010-03-19 00:20:20 +01:00
|
|
|
return dst;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void ipv4_dst_destroy(struct dst_entry *dst)
|
|
|
|
{
|
|
|
|
struct rtable *rt = (struct rtable *) dst;
|
|
|
|
struct inet_peer *peer = rt->peer;
|
|
|
|
|
net: Implement read-only protection and COW'ing of metrics.
Routing metrics are now copy-on-write.
Initially a route entry points it's metrics at a read-only location.
If a routing table entry exists, it will point there. Else it will
point at the all zero metric place-holder called 'dst_default_metrics'.
The writeability state of the metrics is stored in the low bits of the
metrics pointer, we have two bits left to spare if we want to store
more states.
For the initial implementation, COW is implemented simply via kmalloc.
However future enhancements will change this to place the writable
metrics somewhere else, in order to increase sharing. Very likely
this "somewhere else" will be the inetpeer cache.
Note also that this means that metrics updates may transiently fail
if we cannot COW the metrics successfully.
But even by itself, this patch should decrease memory usage and
increase cache locality especially for routing workloads. In those
cases the read-only metric copies stay in place and never get written
to.
TCP workloads where metrics get updated, and those rare cases where
PMTU triggers occur, will take a very slight performance hit. But
that hit will be alleviated when the long-term writable metrics
move to a more sharable location.
Since the metrics storage went from a u32 array of RTAX_MAX entries to
what is essentially a pointer, some retooling of the dst_entry layout
was necessary.
Most importantly, we need to preserve the alignment of the reference
count so that it doesn't share cache lines with the read-mostly state,
as per Eric Dumazet's alignment assertion checks.
The only non-trivial bit here is the move of the 'flags' member into
the writeable cacheline. This is OK since we are always accessing the
flags around the same moment when we made a modification to the
reference count.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-01-27 05:51:05 +01:00
|
|
|
if (rt->fi) {
|
|
|
|
fib_info_put(rt->fi);
|
|
|
|
rt->fi = NULL;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
if (peer) {
|
|
|
|
rt->peer = NULL;
|
|
|
|
inet_putpeer(peer);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void ipv4_link_failure(struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct rtable *rt;
|
|
|
|
|
|
|
|
icmp_send(skb, ICMP_DEST_UNREACH, ICMP_HOST_UNREACH, 0);
|
|
|
|
|
2009-06-02 07:14:27 +02:00
|
|
|
rt = skb_rtable(skb);
|
2011-06-08 08:07:07 +02:00
|
|
|
if (rt && rt->peer && peer_pmtu_cleaned(rt->peer))
|
|
|
|
dst_metric_set(&rt->dst, RTAX_MTU, rt->peer->pmtu_orig);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int ip_rt_bug(struct sk_buff *skb)
|
|
|
|
{
|
2008-10-31 08:53:57 +01:00
|
|
|
printk(KERN_DEBUG "ip_rt_bug: %pI4 -> %pI4, %s\n",
|
|
|
|
&ip_hdr(skb)->saddr, &ip_hdr(skb)->daddr,
|
2005-04-17 00:20:36 +02:00
|
|
|
skb->dev ? skb->dev->name : "?");
|
|
|
|
kfree_skb(skb);
|
2011-05-21 09:16:42 +02:00
|
|
|
WARN_ON(1);
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
We do not cache source address of outgoing interface,
|
|
|
|
because it is used only by IP RR, TS and SRR options,
|
|
|
|
so that it out of fast path.
|
|
|
|
|
|
|
|
BTW remember: "addr" is allowed to be not aligned
|
|
|
|
in IP options!
|
|
|
|
*/
|
|
|
|
|
2011-05-13 23:29:41 +02:00
|
|
|
void ip_rt_get_source(u8 *addr, struct sk_buff *skb, struct rtable *rt)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2006-09-27 06:27:54 +02:00
|
|
|
__be32 src;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-11-12 02:07:48 +01:00
|
|
|
if (rt_is_output_route(rt))
|
2011-05-14 00:01:21 +02:00
|
|
|
src = ip_hdr(skb)->saddr;
|
2010-10-05 12:41:36 +02:00
|
|
|
else {
|
2011-05-13 23:29:41 +02:00
|
|
|
struct fib_result res;
|
|
|
|
struct flowi4 fl4;
|
|
|
|
struct iphdr *iph;
|
|
|
|
|
|
|
|
iph = ip_hdr(skb);
|
|
|
|
|
|
|
|
memset(&fl4, 0, sizeof(fl4));
|
|
|
|
fl4.daddr = iph->daddr;
|
|
|
|
fl4.saddr = iph->saddr;
|
2011-07-23 04:00:41 +02:00
|
|
|
fl4.flowi4_tos = RT_TOS(iph->tos);
|
2011-05-13 23:29:41 +02:00
|
|
|
fl4.flowi4_oif = rt->dst.dev->ifindex;
|
|
|
|
fl4.flowi4_iif = skb->dev->ifindex;
|
|
|
|
fl4.flowi4_mark = skb->mark;
|
2011-03-05 06:47:09 +01:00
|
|
|
|
2010-10-05 12:41:36 +02:00
|
|
|
rcu_read_lock();
|
2011-03-12 02:07:33 +01:00
|
|
|
if (fib_lookup(dev_net(rt->dst.dev), &fl4, &res) == 0)
|
2011-03-25 01:42:21 +01:00
|
|
|
src = FIB_RES_PREFSRC(dev_net(rt->dst.dev), res);
|
2010-10-05 12:41:36 +02:00
|
|
|
else
|
|
|
|
src = inet_select_addr(rt->dst.dev, rt->rt_gateway,
|
2005-04-17 00:20:36 +02:00
|
|
|
RT_SCOPE_UNIVERSE);
|
2010-10-05 12:41:36 +02:00
|
|
|
rcu_read_unlock();
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
memcpy(addr, &src, 4);
|
|
|
|
}
|
|
|
|
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2005-04-17 00:20:36 +02:00
|
|
|
static void set_class_tag(struct rtable *rt, u32 tag)
|
|
|
|
{
|
2010-06-11 08:31:35 +02:00
|
|
|
if (!(rt->dst.tclassid & 0xFFFF))
|
|
|
|
rt->dst.tclassid |= tag & 0xFFFF;
|
|
|
|
if (!(rt->dst.tclassid & 0xFFFF0000))
|
|
|
|
rt->dst.tclassid |= tag & 0xFFFF0000;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2010-12-13 21:52:14 +01:00
|
|
|
static unsigned int ipv4_default_advmss(const struct dst_entry *dst)
|
|
|
|
{
|
|
|
|
unsigned int advmss = dst_metric_raw(dst, RTAX_ADVMSS);
|
|
|
|
|
|
|
|
if (advmss == 0) {
|
|
|
|
advmss = max_t(unsigned int, dst->dev->mtu - 40,
|
|
|
|
ip_rt_min_advmss);
|
|
|
|
if (advmss > 65535 - 40)
|
|
|
|
advmss = 65535 - 40;
|
|
|
|
}
|
|
|
|
return advmss;
|
|
|
|
}
|
|
|
|
|
2011-11-23 03:12:51 +01:00
|
|
|
static unsigned int ipv4_mtu(const struct dst_entry *dst)
|
2010-12-14 22:01:14 +01:00
|
|
|
{
|
2011-11-23 03:14:50 +01:00
|
|
|
const struct rtable *rt = (const struct rtable *) dst;
|
2011-11-23 03:13:31 +01:00
|
|
|
unsigned int mtu = dst_metric_raw(dst, RTAX_MTU);
|
|
|
|
|
2011-11-23 03:14:50 +01:00
|
|
|
if (mtu && rt_is_output_route(rt))
|
2011-11-23 03:13:31 +01:00
|
|
|
return mtu;
|
|
|
|
|
|
|
|
mtu = dst->dev->mtu;
|
2010-12-14 22:01:14 +01:00
|
|
|
|
|
|
|
if (unlikely(dst_metric_locked(dst, RTAX_MTU))) {
|
|
|
|
|
|
|
|
if (rt->rt_gateway != rt->rt_dst && mtu > 576)
|
|
|
|
mtu = 576;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mtu > IP_MAX_MTU)
|
|
|
|
mtu = IP_MAX_MTU;
|
|
|
|
|
|
|
|
return mtu;
|
|
|
|
}
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
static void rt_init_metrics(struct rtable *rt, const struct flowi4 *fl4,
|
2011-03-05 06:47:09 +01:00
|
|
|
struct fib_info *fi)
|
2011-01-28 07:01:53 +01:00
|
|
|
{
|
2011-02-04 23:37:30 +01:00
|
|
|
struct inet_peer *peer;
|
|
|
|
int create = 0;
|
2011-01-28 07:01:53 +01:00
|
|
|
|
2011-02-04 23:37:30 +01:00
|
|
|
/* If a peer entry exists for this destination, we must hook
|
|
|
|
* it up in order to get at cached metrics.
|
|
|
|
*/
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fl4 && (fl4->flowi4_flags & FLOWI_FLAG_PRECOW_METRICS))
|
2011-02-04 23:37:30 +01:00
|
|
|
create = 1;
|
|
|
|
|
2011-03-05 06:26:07 +01:00
|
|
|
rt->peer = peer = inet_getpeer_v4(rt->rt_dst, create);
|
2011-02-04 23:37:30 +01:00
|
|
|
if (peer) {
|
2011-03-05 06:26:07 +01:00
|
|
|
rt->rt_peer_genid = rt_peer_genid();
|
2011-01-28 07:01:53 +01:00
|
|
|
if (inet_metrics_new(peer))
|
|
|
|
memcpy(peer->metrics, fi->fib_metrics,
|
|
|
|
sizeof(u32) * RTAX_MAX);
|
|
|
|
dst_init_metrics(&rt->dst, peer->metrics, false);
|
2011-02-10 05:42:07 +01:00
|
|
|
|
2011-06-08 08:07:07 +02:00
|
|
|
check_peer_pmtu(&rt->dst, peer);
|
2011-11-26 13:13:44 +01:00
|
|
|
if (peer->redirect_genid != redirect_genid)
|
|
|
|
peer->redirect_learned.a4 = 0;
|
2011-02-10 07:00:16 +01:00
|
|
|
if (peer->redirect_learned.a4 &&
|
|
|
|
peer->redirect_learned.a4 != rt->rt_gateway) {
|
|
|
|
rt->rt_gateway = peer->redirect_learned.a4;
|
|
|
|
rt->rt_flags |= RTCF_REDIRECTED;
|
|
|
|
}
|
2011-02-04 23:37:30 +01:00
|
|
|
} else {
|
|
|
|
if (fi->fib_metrics != (u32 *) dst_default_metrics) {
|
|
|
|
rt->fi = fi;
|
|
|
|
atomic_inc(&fi->fib_clntref);
|
|
|
|
}
|
|
|
|
dst_init_metrics(&rt->dst, fi->fib_metrics, true);
|
2011-01-28 07:01:53 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
static void rt_set_nexthop(struct rtable *rt, const struct flowi4 *fl4,
|
2011-03-05 06:47:09 +01:00
|
|
|
const struct fib_result *res,
|
2011-02-17 06:44:24 +01:00
|
|
|
struct fib_info *fi, u16 type, u32 itag)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2010-12-09 06:16:57 +01:00
|
|
|
struct dst_entry *dst = &rt->dst;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (fi) {
|
|
|
|
if (FIB_RES_GW(*res) &&
|
|
|
|
FIB_RES_NH(*res).nh_scope == RT_SCOPE_LINK)
|
|
|
|
rt->rt_gateway = FIB_RES_GW(*res);
|
2011-04-28 23:48:42 +02:00
|
|
|
rt_init_metrics(rt, fl4, fi);
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2010-12-09 06:16:57 +01:00
|
|
|
dst->tclassid = FIB_RES_NH(*res).nh_tclassid;
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2010-12-14 22:01:14 +01:00
|
|
|
}
|
2010-12-09 06:16:57 +01:00
|
|
|
|
|
|
|
if (dst_mtu(dst) > IP_MAX_MTU)
|
|
|
|
dst_metric_set(dst, RTAX_MTU, IP_MAX_MTU);
|
2010-12-13 21:52:14 +01:00
|
|
|
if (dst_metric_raw(dst, RTAX_ADVMSS) > 65535 - 40)
|
2010-12-09 06:16:57 +01:00
|
|
|
dst_metric_set(dst, RTAX_ADVMSS, 65535 - 40);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_IP_MULTIPLE_TABLES
|
|
|
|
set_class_tag(rt, fib_rules_tclass(res));
|
|
|
|
#endif
|
|
|
|
set_class_tag(rt, itag);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2011-04-28 23:13:38 +02:00
|
|
|
static struct rtable *rt_dst_alloc(struct net_device *dev,
|
|
|
|
bool nopolicy, bool noxfrm)
|
2011-02-18 00:42:37 +01:00
|
|
|
{
|
2011-04-28 23:13:38 +02:00
|
|
|
return dst_alloc(&ipv4_dst_ops, dev, 1, -1,
|
|
|
|
DST_HOST |
|
|
|
|
(nopolicy ? DST_NOPOLICY : 0) |
|
|
|
|
(noxfrm ? DST_NOXFRM : 0));
|
2011-02-18 00:42:37 +01:00
|
|
|
}
|
|
|
|
|
2010-06-02 21:21:31 +02:00
|
|
|
/* called in rcu_read_lock() section */
|
2006-09-27 06:25:20 +02:00
|
|
|
static int ip_route_input_mc(struct sk_buff *skb, __be32 daddr, __be32 saddr,
|
2005-04-17 00:20:36 +02:00
|
|
|
u8 tos, struct net_device *dev, int our)
|
|
|
|
{
|
2010-06-02 21:21:31 +02:00
|
|
|
unsigned int hash;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct rtable *rth;
|
2006-09-27 06:27:54 +02:00
|
|
|
__be32 spec_dst;
|
2010-06-02 21:21:31 +02:00
|
|
|
struct in_device *in_dev = __in_dev_get_rcu(dev);
|
2005-04-17 00:20:36 +02:00
|
|
|
u32 itag = 0;
|
2010-06-02 14:05:27 +02:00
|
|
|
int err;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* Primary sanity checks. */
|
|
|
|
|
|
|
|
if (in_dev == NULL)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2008-01-21 12:18:08 +01:00
|
|
|
if (ipv4_is_multicast(saddr) || ipv4_is_lbcast(saddr) ||
|
2007-12-16 22:45:43 +01:00
|
|
|
ipv4_is_loopback(saddr) || skb->protocol != htons(ETH_P_IP))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto e_inval;
|
|
|
|
|
2007-12-16 22:45:43 +01:00
|
|
|
if (ipv4_is_zeronet(saddr)) {
|
|
|
|
if (!ipv4_is_local_multicast(daddr))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto e_inval;
|
|
|
|
spec_dst = inet_select_addr(dev, 0, RT_SCOPE_LINK);
|
2010-06-02 14:05:27 +02:00
|
|
|
} else {
|
2011-04-07 06:51:50 +02:00
|
|
|
err = fib_validate_source(skb, saddr, 0, tos, 0, dev, &spec_dst,
|
|
|
|
&itag);
|
2010-06-02 14:05:27 +02:00
|
|
|
if (err < 0)
|
|
|
|
goto e_err;
|
|
|
|
}
|
2011-04-28 23:13:38 +02:00
|
|
|
rth = rt_dst_alloc(init_net.loopback_dev,
|
|
|
|
IN_DEV_CONF_GET(in_dev, NOPOLICY), false);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!rth)
|
|
|
|
goto e_nobufs;
|
|
|
|
|
2011-04-28 23:31:47 +02:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
|
|
|
rth->dst.tclassid = itag;
|
|
|
|
#endif
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.output = ip_rt_bug;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
rth->rt_key_dst = daddr;
|
|
|
|
rth->rt_key_src = saddr;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_genid = rt_genid(dev_net(dev));
|
|
|
|
rth->rt_flags = RTCF_MULTICAST;
|
|
|
|
rth->rt_type = RTN_MULTICAST;
|
2011-05-04 04:45:15 +02:00
|
|
|
rth->rt_key_tos = tos;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_dst = daddr;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_src = saddr;
|
2011-04-07 23:04:08 +02:00
|
|
|
rth->rt_route_iif = dev->ifindex;
|
2011-03-05 06:47:09 +01:00
|
|
|
rth->rt_iif = dev->ifindex;
|
|
|
|
rth->rt_oif = 0;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_mark = skb->mark;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_gateway = daddr;
|
|
|
|
rth->rt_spec_dst= spec_dst;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_peer_genid = 0;
|
|
|
|
rth->peer = NULL;
|
|
|
|
rth->fi = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (our) {
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.input= ip_local_deliver;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_flags |= RTCF_LOCAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_IP_MROUTE
|
2007-12-16 22:45:43 +01:00
|
|
|
if (!ipv4_is_local_multicast(daddr) && IN_DEV_MFORWARD(in_dev))
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.input = ip_mr_input;
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
|
|
|
RT_CACHE_STAT_INC(in_slow_mc);
|
|
|
|
|
2008-07-06 04:04:32 +02:00
|
|
|
hash = rt_hash(daddr, saddr, dev->ifindex, rt_genid(dev_net(dev)));
|
2011-03-02 23:31:35 +01:00
|
|
|
rth = rt_intern_hash(hash, rth, skb, dev->ifindex);
|
2011-06-18 20:59:18 +02:00
|
|
|
return IS_ERR(rth) ? PTR_ERR(rth) : 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
e_nobufs:
|
|
|
|
return -ENOBUFS;
|
|
|
|
e_inval:
|
2010-06-02 21:21:31 +02:00
|
|
|
return -EINVAL;
|
2010-06-02 14:05:27 +02:00
|
|
|
e_err:
|
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void ip_handle_martian_source(struct net_device *dev,
|
|
|
|
struct in_device *in_dev,
|
|
|
|
struct sk_buff *skb,
|
2006-09-27 06:25:20 +02:00
|
|
|
__be32 daddr,
|
|
|
|
__be32 saddr)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
RT_CACHE_STAT_INC(in_martian_src);
|
|
|
|
#ifdef CONFIG_IP_ROUTE_VERBOSE
|
|
|
|
if (IN_DEV_LOG_MARTIANS(in_dev) && net_ratelimit()) {
|
|
|
|
/*
|
|
|
|
* RFC1812 recommendation, if source is martian,
|
|
|
|
* the only hint is MAC header.
|
|
|
|
*/
|
2008-10-31 08:53:57 +01:00
|
|
|
printk(KERN_WARNING "martian source %pI4 from %pI4, on dev %s\n",
|
|
|
|
&daddr, &saddr, dev->name);
|
2007-03-19 23:33:04 +01:00
|
|
|
if (dev->hard_header_len && skb_mac_header_was_set(skb)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
int i;
|
2007-03-19 23:33:04 +01:00
|
|
|
const unsigned char *p = skb_mac_header(skb);
|
2005-04-17 00:20:36 +02:00
|
|
|
printk(KERN_WARNING "ll header: ");
|
|
|
|
for (i = 0; i < dev->hard_header_len; i++, p++) {
|
|
|
|
printk("%02x", *p);
|
|
|
|
if (i < (dev->hard_header_len - 1))
|
|
|
|
printk(":");
|
|
|
|
}
|
|
|
|
printk("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2010-06-03 06:13:21 +02:00
|
|
|
/* called in rcu_read_lock() section */
|
2008-04-10 10:52:09 +02:00
|
|
|
static int __mkroute_input(struct sk_buff *skb,
|
2011-02-17 06:44:24 +01:00
|
|
|
const struct fib_result *res,
|
2008-04-10 10:52:09 +02:00
|
|
|
struct in_device *in_dev,
|
|
|
|
__be32 daddr, __be32 saddr, u32 tos,
|
|
|
|
struct rtable **result)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct rtable *rth;
|
|
|
|
int err;
|
|
|
|
struct in_device *out_dev;
|
2010-06-03 06:13:21 +02:00
|
|
|
unsigned int flags = 0;
|
2006-09-27 06:28:14 +02:00
|
|
|
__be32 spec_dst;
|
|
|
|
u32 itag;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* get a working reference to the output device */
|
2010-06-03 06:13:21 +02:00
|
|
|
out_dev = __in_dev_get_rcu(FIB_RES_DEV(*res));
|
2005-04-17 00:20:36 +02:00
|
|
|
if (out_dev == NULL) {
|
|
|
|
if (net_ratelimit())
|
|
|
|
printk(KERN_CRIT "Bug in ip_route_input" \
|
|
|
|
"_slow(). Please, report\n");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-04-07 06:51:50 +02:00
|
|
|
err = fib_validate_source(skb, saddr, daddr, tos, FIB_RES_OIF(*res),
|
|
|
|
in_dev->dev, &spec_dst, &itag);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (err < 0) {
|
2007-02-09 15:24:47 +01:00
|
|
|
ip_handle_martian_source(in_dev->dev, in_dev, skb, daddr,
|
2005-04-17 00:20:36 +02:00
|
|
|
saddr);
|
2007-02-09 15:24:47 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (err)
|
|
|
|
flags |= RTCF_DIRECTSRC;
|
|
|
|
|
2008-06-04 01:36:01 +02:00
|
|
|
if (out_dev == in_dev && err &&
|
2005-04-17 00:20:36 +02:00
|
|
|
(IN_DEV_SHARED_MEDIA(out_dev) ||
|
|
|
|
inet_addr_onlink(out_dev, saddr, FIB_RES_GW(*res))))
|
|
|
|
flags |= RTCF_DOREDIRECT;
|
|
|
|
|
|
|
|
if (skb->protocol != htons(ETH_P_IP)) {
|
|
|
|
/* Not IP (i.e. ARP). Do not create route, if it is
|
|
|
|
* invalid for proxy arp. DNAT routes are always valid.
|
2010-01-05 06:50:47 +01:00
|
|
|
*
|
|
|
|
* Proxy arp feature have been extended to allow, ARP
|
|
|
|
* replies back to the same interface, to support
|
|
|
|
* Private VLAN switch technologies. See arp.c.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2010-01-05 06:50:47 +01:00
|
|
|
if (out_dev == in_dev &&
|
|
|
|
IN_DEV_PROXY_ARP_PVLAN(in_dev) == 0) {
|
2005-04-17 00:20:36 +02:00
|
|
|
err = -EINVAL;
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-28 23:13:38 +02:00
|
|
|
rth = rt_dst_alloc(out_dev->dev,
|
|
|
|
IN_DEV_CONF_GET(in_dev, NOPOLICY),
|
2011-02-18 00:42:37 +01:00
|
|
|
IN_DEV_CONF_GET(out_dev, NOXFRM));
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!rth) {
|
|
|
|
err = -ENOBUFS;
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
rth->rt_key_dst = daddr;
|
|
|
|
rth->rt_key_src = saddr;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_genid = rt_genid(dev_net(rth->dst.dev));
|
|
|
|
rth->rt_flags = flags;
|
|
|
|
rth->rt_type = res->type;
|
2011-05-04 04:45:15 +02:00
|
|
|
rth->rt_key_tos = tos;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_dst = daddr;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_src = saddr;
|
2011-04-07 23:04:08 +02:00
|
|
|
rth->rt_route_iif = in_dev->dev->ifindex;
|
2011-03-05 06:47:09 +01:00
|
|
|
rth->rt_iif = in_dev->dev->ifindex;
|
|
|
|
rth->rt_oif = 0;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_mark = skb->mark;
|
|
|
|
rth->rt_gateway = daddr;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_spec_dst= spec_dst;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_peer_genid = 0;
|
|
|
|
rth->peer = NULL;
|
|
|
|
rth->fi = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.input = ip_forward;
|
|
|
|
rth->dst.output = ip_output;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
rt_set_nexthop(rth, NULL, res, res->fi, res->type, itag);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
*result = rth;
|
|
|
|
err = 0;
|
|
|
|
cleanup:
|
|
|
|
return err;
|
2007-02-09 15:24:47 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-04-10 10:52:09 +02:00
|
|
|
static int ip_mkroute_input(struct sk_buff *skb,
|
|
|
|
struct fib_result *res,
|
2011-03-12 02:07:33 +01:00
|
|
|
const struct flowi4 *fl4,
|
2008-04-10 10:52:09 +02:00
|
|
|
struct in_device *in_dev,
|
|
|
|
__be32 daddr, __be32 saddr, u32 tos)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2005-06-23 07:10:23 +02:00
|
|
|
struct rtable* rth = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
int err;
|
|
|
|
unsigned hash;
|
|
|
|
|
|
|
|
#ifdef CONFIG_IP_ROUTE_MULTIPATH
|
2011-03-11 01:23:24 +01:00
|
|
|
if (res->fi && res->fi->fib_nhs > 1)
|
2011-03-11 02:01:16 +01:00
|
|
|
fib_select_multipath(res);
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/* create a routing cache entry */
|
|
|
|
err = __mkroute_input(skb, res, in_dev, daddr, saddr, tos, &rth);
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
/* put it into the cache */
|
2011-03-12 02:07:33 +01:00
|
|
|
hash = rt_hash(daddr, saddr, fl4->flowi4_iif,
|
2010-06-11 08:31:35 +02:00
|
|
|
rt_genid(dev_net(rth->dst.dev)));
|
2011-03-12 02:07:33 +01:00
|
|
|
rth = rt_intern_hash(hash, rth, skb, fl4->flowi4_iif);
|
2011-03-02 23:31:35 +01:00
|
|
|
if (IS_ERR(rth))
|
|
|
|
return PTR_ERR(rth);
|
|
|
|
return 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* NOTE. We drop all the packets that has local source
|
|
|
|
* addresses, because every properly looped back packet
|
|
|
|
* must have correct destination already attached by output routine.
|
|
|
|
*
|
|
|
|
* Such approach solves two big problems:
|
|
|
|
* 1. Not simplex devices are handled properly.
|
|
|
|
* 2. IP spoofing attempts are filtered with 100% of guarantee.
|
2010-10-05 12:41:36 +02:00
|
|
|
* called with rcu_read_lock()
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
2006-09-27 06:25:20 +02:00
|
|
|
static int ip_route_input_slow(struct sk_buff *skb, __be32 daddr, __be32 saddr,
|
2005-04-17 00:20:36 +02:00
|
|
|
u8 tos, struct net_device *dev)
|
|
|
|
{
|
|
|
|
struct fib_result res;
|
2010-06-02 21:21:31 +02:00
|
|
|
struct in_device *in_dev = __in_dev_get_rcu(dev);
|
2011-03-12 02:07:33 +01:00
|
|
|
struct flowi4 fl4;
|
2005-04-17 00:20:36 +02:00
|
|
|
unsigned flags = 0;
|
|
|
|
u32 itag = 0;
|
|
|
|
struct rtable * rth;
|
|
|
|
unsigned hash;
|
2006-09-27 06:25:20 +02:00
|
|
|
__be32 spec_dst;
|
2005-04-17 00:20:36 +02:00
|
|
|
int err = -EINVAL;
|
2008-03-25 13:47:49 +01:00
|
|
|
struct net * net = dev_net(dev);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* IP on this device is disabled. */
|
|
|
|
|
|
|
|
if (!in_dev)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* Check for the most weird martians, which can be not detected
|
|
|
|
by fib_lookup.
|
|
|
|
*/
|
|
|
|
|
2008-01-21 12:18:08 +01:00
|
|
|
if (ipv4_is_multicast(saddr) || ipv4_is_lbcast(saddr) ||
|
2007-12-16 22:45:43 +01:00
|
|
|
ipv4_is_loopback(saddr))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto martian_source;
|
|
|
|
|
2010-10-17 17:11:22 +02:00
|
|
|
if (ipv4_is_lbcast(daddr) || (saddr == 0 && daddr == 0))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto brd_input;
|
|
|
|
|
|
|
|
/* Accept zero addresses only to limited broadcast;
|
|
|
|
* I even do not know to fix it or not. Waiting for complains :-)
|
|
|
|
*/
|
2007-12-16 22:45:43 +01:00
|
|
|
if (ipv4_is_zeronet(saddr))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto martian_source;
|
|
|
|
|
2010-10-17 17:11:22 +02:00
|
|
|
if (ipv4_is_zeronet(daddr) || ipv4_is_loopback(daddr))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto martian_destination;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now we are ready to route packet.
|
|
|
|
*/
|
2011-03-12 02:07:33 +01:00
|
|
|
fl4.flowi4_oif = 0;
|
|
|
|
fl4.flowi4_iif = dev->ifindex;
|
|
|
|
fl4.flowi4_mark = skb->mark;
|
|
|
|
fl4.flowi4_tos = tos;
|
|
|
|
fl4.flowi4_scope = RT_SCOPE_UNIVERSE;
|
|
|
|
fl4.daddr = daddr;
|
|
|
|
fl4.saddr = saddr;
|
|
|
|
err = fib_lookup(net, &fl4, &res);
|
2010-10-05 12:41:36 +02:00
|
|
|
if (err != 0) {
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!IN_DEV_FORWARD(in_dev))
|
2005-06-28 22:06:23 +02:00
|
|
|
goto e_hostunreach;
|
2005-04-17 00:20:36 +02:00
|
|
|
goto no_route;
|
|
|
|
}
|
|
|
|
|
|
|
|
RT_CACHE_STAT_INC(in_slow_tot);
|
|
|
|
|
|
|
|
if (res.type == RTN_BROADCAST)
|
|
|
|
goto brd_input;
|
|
|
|
|
|
|
|
if (res.type == RTN_LOCAL) {
|
2011-04-07 06:51:50 +02:00
|
|
|
err = fib_validate_source(skb, saddr, daddr, tos,
|
2010-10-05 12:41:36 +02:00
|
|
|
net->loopback_dev->ifindex,
|
2011-04-07 06:51:50 +02:00
|
|
|
dev, &spec_dst, &itag);
|
2010-06-02 14:05:27 +02:00
|
|
|
if (err < 0)
|
|
|
|
goto martian_source_keep_err;
|
|
|
|
if (err)
|
2005-04-17 00:20:36 +02:00
|
|
|
flags |= RTCF_DIRECTSRC;
|
|
|
|
spec_dst = daddr;
|
|
|
|
goto local_input;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!IN_DEV_FORWARD(in_dev))
|
2005-06-28 22:06:23 +02:00
|
|
|
goto e_hostunreach;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (res.type != RTN_UNICAST)
|
|
|
|
goto martian_destination;
|
|
|
|
|
2011-03-12 02:07:33 +01:00
|
|
|
err = ip_mkroute_input(skb, &res, &fl4, in_dev, daddr, saddr, tos);
|
2005-04-17 00:20:36 +02:00
|
|
|
out: return err;
|
|
|
|
|
|
|
|
brd_input:
|
|
|
|
if (skb->protocol != htons(ETH_P_IP))
|
|
|
|
goto e_inval;
|
|
|
|
|
2007-12-16 22:45:43 +01:00
|
|
|
if (ipv4_is_zeronet(saddr))
|
2005-04-17 00:20:36 +02:00
|
|
|
spec_dst = inet_select_addr(dev, 0, RT_SCOPE_LINK);
|
|
|
|
else {
|
2011-04-07 06:51:50 +02:00
|
|
|
err = fib_validate_source(skb, saddr, 0, tos, 0, dev, &spec_dst,
|
|
|
|
&itag);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (err < 0)
|
2010-06-02 14:05:27 +02:00
|
|
|
goto martian_source_keep_err;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (err)
|
|
|
|
flags |= RTCF_DIRECTSRC;
|
|
|
|
}
|
|
|
|
flags |= RTCF_BROADCAST;
|
|
|
|
res.type = RTN_BROADCAST;
|
|
|
|
RT_CACHE_STAT_INC(in_brd);
|
|
|
|
|
|
|
|
local_input:
|
2011-04-28 23:13:38 +02:00
|
|
|
rth = rt_dst_alloc(net->loopback_dev,
|
|
|
|
IN_DEV_CONF_GET(in_dev, NOPOLICY), false);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!rth)
|
|
|
|
goto e_nobufs;
|
|
|
|
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->dst.input= ip_local_deliver;
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.output= ip_rt_bug;
|
2011-04-28 23:31:47 +02:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
|
|
|
rth->dst.tclassid = itag;
|
|
|
|
#endif
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
rth->rt_key_dst = daddr;
|
|
|
|
rth->rt_key_src = saddr;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_genid = rt_genid(net);
|
|
|
|
rth->rt_flags = flags|RTCF_LOCAL;
|
|
|
|
rth->rt_type = res.type;
|
2011-05-04 04:45:15 +02:00
|
|
|
rth->rt_key_tos = tos;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_dst = daddr;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_src = saddr;
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.tclassid = itag;
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2011-04-07 23:04:08 +02:00
|
|
|
rth->rt_route_iif = dev->ifindex;
|
2011-03-05 06:47:09 +01:00
|
|
|
rth->rt_iif = dev->ifindex;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_oif = 0;
|
|
|
|
rth->rt_mark = skb->mark;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_gateway = daddr;
|
|
|
|
rth->rt_spec_dst= spec_dst;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_peer_genid = 0;
|
|
|
|
rth->peer = NULL;
|
|
|
|
rth->fi = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (res.type == RTN_UNREACHABLE) {
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.input= ip_error;
|
|
|
|
rth->dst.error= -err;
|
2005-04-17 00:20:36 +02:00
|
|
|
rth->rt_flags &= ~RTCF_LOCAL;
|
|
|
|
}
|
2011-03-12 02:07:33 +01:00
|
|
|
hash = rt_hash(daddr, saddr, fl4.flowi4_iif, rt_genid(net));
|
|
|
|
rth = rt_intern_hash(hash, rth, skb, fl4.flowi4_iif);
|
2011-03-02 23:31:35 +01:00
|
|
|
err = 0;
|
|
|
|
if (IS_ERR(rth))
|
|
|
|
err = PTR_ERR(rth);
|
2010-10-05 12:41:36 +02:00
|
|
|
goto out;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
no_route:
|
|
|
|
RT_CACHE_STAT_INC(in_no_route);
|
|
|
|
spec_dst = inet_select_addr(dev, 0, RT_SCOPE_UNIVERSE);
|
|
|
|
res.type = RTN_UNREACHABLE;
|
2007-12-07 10:07:24 +01:00
|
|
|
if (err == -ESRCH)
|
|
|
|
err = -ENETUNREACH;
|
2005-04-17 00:20:36 +02:00
|
|
|
goto local_input;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do not cache martian addresses: they should be logged (RFC1812)
|
|
|
|
*/
|
|
|
|
martian_destination:
|
|
|
|
RT_CACHE_STAT_INC(in_martian_dst);
|
|
|
|
#ifdef CONFIG_IP_ROUTE_VERBOSE
|
|
|
|
if (IN_DEV_LOG_MARTIANS(in_dev) && net_ratelimit())
|
2008-10-31 08:53:57 +01:00
|
|
|
printk(KERN_WARNING "martian destination %pI4 from %pI4, dev %s\n",
|
|
|
|
&daddr, &saddr, dev->name);
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2005-06-28 22:06:23 +02:00
|
|
|
|
|
|
|
e_hostunreach:
|
2007-02-09 15:24:47 +01:00
|
|
|
err = -EHOSTUNREACH;
|
2010-10-05 12:41:36 +02:00
|
|
|
goto out;
|
2005-06-28 22:06:23 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
e_inval:
|
|
|
|
err = -EINVAL;
|
2010-10-05 12:41:36 +02:00
|
|
|
goto out;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
e_nobufs:
|
|
|
|
err = -ENOBUFS;
|
2010-10-05 12:41:36 +02:00
|
|
|
goto out;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
martian_source:
|
2010-06-02 14:05:27 +02:00
|
|
|
err = -EINVAL;
|
|
|
|
martian_source_keep_err:
|
2005-04-17 00:20:36 +02:00
|
|
|
ip_handle_martian_source(dev, in_dev, skb, daddr, saddr);
|
2010-10-05 12:41:36 +02:00
|
|
|
goto out;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2010-05-10 13:32:55 +02:00
|
|
|
int ip_route_input_common(struct sk_buff *skb, __be32 daddr, __be32 saddr,
|
|
|
|
u8 tos, struct net_device *dev, bool noref)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct rtable * rth;
|
|
|
|
unsigned hash;
|
|
|
|
int iif = dev->ifindex;
|
2008-01-23 08:50:25 +01:00
|
|
|
struct net *net;
|
2010-06-02 21:21:31 +02:00
|
|
|
int res;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-03-25 13:47:49 +01:00
|
|
|
net = dev_net(dev);
|
2008-10-27 20:28:25 +01:00
|
|
|
|
2010-06-02 21:21:31 +02:00
|
|
|
rcu_read_lock();
|
|
|
|
|
2008-10-27 20:28:25 +01:00
|
|
|
if (!rt_caching(net))
|
|
|
|
goto skip_cache;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
tos &= IPTOS_RT_MASK;
|
2008-07-06 04:04:32 +02:00
|
|
|
hash = rt_hash(daddr, saddr, iif, rt_genid(net));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
for (rth = rcu_dereference(rt_hash_table[hash].chain); rth;
|
2010-06-11 08:31:35 +02:00
|
|
|
rth = rcu_dereference(rth->dst.rt_next)) {
|
2011-03-05 06:47:09 +01:00
|
|
|
if ((((__force u32)rth->rt_key_dst ^ (__force u32)daddr) |
|
|
|
|
((__force u32)rth->rt_key_src ^ (__force u32)saddr) |
|
2011-08-09 06:01:16 +02:00
|
|
|
(rth->rt_route_iif ^ iif) |
|
2011-05-04 04:45:15 +02:00
|
|
|
(rth->rt_key_tos ^ tos)) == 0 &&
|
2011-03-05 06:47:09 +01:00
|
|
|
rth->rt_mark == skb->mark &&
|
2010-06-11 08:31:35 +02:00
|
|
|
net_eq(dev_net(rth->dst.dev), net) &&
|
2008-07-06 04:04:32 +02:00
|
|
|
!rt_is_expired(rth)) {
|
2011-12-05 19:21:42 +01:00
|
|
|
ipv4_validate_peer(rth);
|
2010-05-10 13:32:55 +02:00
|
|
|
if (noref) {
|
2010-06-11 08:31:35 +02:00
|
|
|
dst_use_noref(&rth->dst, jiffies);
|
|
|
|
skb_dst_set_noref(skb, &rth->dst);
|
2010-05-10 13:32:55 +02:00
|
|
|
} else {
|
2010-06-11 08:31:35 +02:00
|
|
|
dst_use(&rth->dst, jiffies);
|
|
|
|
skb_dst_set(skb, &rth->dst);
|
2010-05-10 13:32:55 +02:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
RT_CACHE_STAT_INC(in_hit);
|
|
|
|
rcu_read_unlock();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
RT_CACHE_STAT_INC(in_hlist_search);
|
|
|
|
}
|
|
|
|
|
2008-10-27 20:28:25 +01:00
|
|
|
skip_cache:
|
2005-04-17 00:20:36 +02:00
|
|
|
/* Multicast recognition logic is moved from route cache to here.
|
|
|
|
The problem was that too many Ethernet cards have broken/missing
|
|
|
|
hardware multicast filters :-( As result the host on multicasting
|
|
|
|
network acquires a lot of useless route cache entries, sort of
|
|
|
|
SDR messages from all the world. Now we try to get rid of them.
|
|
|
|
Really, provided software IP multicast filter is organized
|
|
|
|
reasonably (at least, hashed), it does not result in a slowdown
|
|
|
|
comparing with route cache reject entries.
|
|
|
|
Note, that multicast routers are not affected, because
|
|
|
|
route cache entry is created eventually.
|
|
|
|
*/
|
2007-12-16 22:45:43 +01:00
|
|
|
if (ipv4_is_multicast(daddr)) {
|
2010-06-02 21:21:31 +02:00
|
|
|
struct in_device *in_dev = __in_dev_get_rcu(dev);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-02 21:21:31 +02:00
|
|
|
if (in_dev) {
|
2011-03-11 01:34:38 +01:00
|
|
|
int our = ip_check_mc_rcu(in_dev, daddr, saddr,
|
|
|
|
ip_hdr(skb)->protocol);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (our
|
|
|
|
#ifdef CONFIG_IP_MROUTE
|
2009-11-23 19:41:23 +01:00
|
|
|
||
|
|
|
|
(!ipv4_is_local_multicast(daddr) &&
|
|
|
|
IN_DEV_MFORWARD(in_dev))
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2009-11-23 19:41:23 +01:00
|
|
|
) {
|
2010-06-02 21:21:31 +02:00
|
|
|
int res = ip_route_input_mc(skb, daddr, saddr,
|
|
|
|
tos, dev, our);
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_unlock();
|
2010-06-02 21:21:31 +02:00
|
|
|
return res;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2010-06-02 21:21:31 +02:00
|
|
|
res = ip_route_input_slow(skb, daddr, saddr, tos, dev);
|
|
|
|
rcu_read_unlock();
|
|
|
|
return res;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2010-05-10 13:32:55 +02:00
|
|
|
EXPORT_SYMBOL(ip_route_input_common);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-10-05 12:41:36 +02:00
|
|
|
/* called with rcu_read_lock() */
|
2011-02-17 06:44:24 +01:00
|
|
|
static struct rtable *__mkroute_output(const struct fib_result *res,
|
2011-03-12 02:07:33 +01:00
|
|
|
const struct flowi4 *fl4,
|
2011-04-28 23:48:42 +02:00
|
|
|
__be32 orig_daddr, __be32 orig_saddr,
|
2011-12-02 12:39:42 +01:00
|
|
|
int orig_oif, __u8 orig_rtos,
|
|
|
|
struct net_device *dev_out,
|
2011-02-18 00:29:00 +01:00
|
|
|
unsigned int flags)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-02-17 06:44:24 +01:00
|
|
|
struct fib_info *fi = res->fi;
|
2011-02-18 00:29:00 +01:00
|
|
|
struct in_device *in_dev;
|
2011-02-17 06:44:24 +01:00
|
|
|
u16 type = res->type;
|
2011-02-18 00:29:00 +01:00
|
|
|
struct rtable *rth;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-12 02:07:33 +01:00
|
|
|
if (ipv4_is_loopback(fl4->saddr) && !(dev_out->flags & IFF_LOOPBACK))
|
2011-02-18 00:29:00 +01:00
|
|
|
return ERR_PTR(-EINVAL);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-12 02:07:33 +01:00
|
|
|
if (ipv4_is_lbcast(fl4->daddr))
|
2011-02-17 06:44:24 +01:00
|
|
|
type = RTN_BROADCAST;
|
2011-03-12 02:07:33 +01:00
|
|
|
else if (ipv4_is_multicast(fl4->daddr))
|
2011-02-17 06:44:24 +01:00
|
|
|
type = RTN_MULTICAST;
|
2011-03-12 02:07:33 +01:00
|
|
|
else if (ipv4_is_zeronet(fl4->daddr))
|
2011-02-18 00:29:00 +01:00
|
|
|
return ERR_PTR(-EINVAL);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (dev_out->flags & IFF_LOOPBACK)
|
|
|
|
flags |= RTCF_LOCAL;
|
|
|
|
|
2010-09-29 13:53:50 +02:00
|
|
|
in_dev = __in_dev_get_rcu(dev_out);
|
2010-10-05 12:41:36 +02:00
|
|
|
if (!in_dev)
|
2011-02-18 00:29:00 +01:00
|
|
|
return ERR_PTR(-EINVAL);
|
2010-10-05 12:41:36 +02:00
|
|
|
|
2011-02-17 06:44:24 +01:00
|
|
|
if (type == RTN_BROADCAST) {
|
2005-04-17 00:20:36 +02:00
|
|
|
flags |= RTCF_BROADCAST | RTCF_LOCAL;
|
2011-02-17 06:44:24 +01:00
|
|
|
fi = NULL;
|
|
|
|
} else if (type == RTN_MULTICAST) {
|
2010-09-29 13:53:50 +02:00
|
|
|
flags |= RTCF_MULTICAST | RTCF_LOCAL;
|
2011-04-28 23:48:42 +02:00
|
|
|
if (!ip_check_mc_rcu(in_dev, fl4->daddr, fl4->saddr,
|
|
|
|
fl4->flowi4_proto))
|
2005-04-17 00:20:36 +02:00
|
|
|
flags &= ~RTCF_LOCAL;
|
|
|
|
/* If multicast route do not exist use
|
2010-09-29 13:53:50 +02:00
|
|
|
* default one, but do not gateway in this case.
|
|
|
|
* Yes, it is hack.
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
2011-02-17 06:44:24 +01:00
|
|
|
if (fi && res->prefixlen < 4)
|
|
|
|
fi = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-04-28 23:13:38 +02:00
|
|
|
rth = rt_dst_alloc(dev_out,
|
|
|
|
IN_DEV_CONF_GET(in_dev, NOPOLICY),
|
2011-02-18 00:42:37 +01:00
|
|
|
IN_DEV_CONF_GET(in_dev, NOXFRM));
|
2010-10-07 16:48:38 +02:00
|
|
|
if (!rth)
|
2011-02-18 00:29:00 +01:00
|
|
|
return ERR_PTR(-ENOBUFS);
|
2010-10-07 16:48:38 +02:00
|
|
|
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->dst.output = ip_output;
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
rth->rt_key_dst = orig_daddr;
|
|
|
|
rth->rt_key_src = orig_saddr;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_genid = rt_genid(dev_net(dev_out));
|
|
|
|
rth->rt_flags = flags;
|
|
|
|
rth->rt_type = type;
|
2011-12-02 12:39:42 +01:00
|
|
|
rth->rt_key_tos = orig_rtos;
|
2011-03-12 02:07:33 +01:00
|
|
|
rth->rt_dst = fl4->daddr;
|
|
|
|
rth->rt_src = fl4->saddr;
|
2011-04-07 23:04:08 +02:00
|
|
|
rth->rt_route_iif = 0;
|
2011-04-28 23:48:42 +02:00
|
|
|
rth->rt_iif = orig_oif ? : dev_out->ifindex;
|
|
|
|
rth->rt_oif = orig_oif;
|
|
|
|
rth->rt_mark = fl4->flowi4_mark;
|
2011-03-12 02:07:33 +01:00
|
|
|
rth->rt_gateway = fl4->daddr;
|
|
|
|
rth->rt_spec_dst= fl4->saddr;
|
2011-04-28 23:31:47 +02:00
|
|
|
rth->rt_peer_genid = 0;
|
|
|
|
rth->peer = NULL;
|
|
|
|
rth->fi = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
RT_CACHE_STAT_INC(out_slow_tot);
|
|
|
|
|
|
|
|
if (flags & RTCF_LOCAL) {
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.input = ip_local_deliver;
|
2011-03-12 02:07:33 +01:00
|
|
|
rth->rt_spec_dst = fl4->daddr;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
if (flags & (RTCF_BROADCAST | RTCF_MULTICAST)) {
|
2011-03-12 02:07:33 +01:00
|
|
|
rth->rt_spec_dst = fl4->saddr;
|
2007-02-09 15:24:47 +01:00
|
|
|
if (flags & RTCF_LOCAL &&
|
2005-04-17 00:20:36 +02:00
|
|
|
!(dev_out->flags & IFF_LOOPBACK)) {
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.output = ip_mc_output;
|
2005-04-17 00:20:36 +02:00
|
|
|
RT_CACHE_STAT_INC(out_slow_mc);
|
|
|
|
}
|
|
|
|
#ifdef CONFIG_IP_MROUTE
|
2011-02-17 06:44:24 +01:00
|
|
|
if (type == RTN_MULTICAST) {
|
2005-04-17 00:20:36 +02:00
|
|
|
if (IN_DEV_MFORWARD(in_dev) &&
|
2011-04-28 23:48:42 +02:00
|
|
|
!ipv4_is_local_multicast(fl4->daddr)) {
|
2010-06-11 08:31:35 +02:00
|
|
|
rth->dst.input = ip_mr_input;
|
|
|
|
rth->dst.output = ip_mc_output;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
rt_set_nexthop(rth, fl4, res, fi, type, 0);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-02-18 00:29:00 +01:00
|
|
|
return rth;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Major route resolver routine.
|
2010-09-30 05:33:58 +02:00
|
|
|
* called with rcu_read_lock();
|
2005-04-17 00:20:36 +02:00
|
|
|
*/
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
static struct rtable *ip_route_output_slow(struct net *net, struct flowi4 *fl4)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct net_device *dev_out = NULL;
|
2011-12-02 12:39:42 +01:00
|
|
|
__u8 tos = RT_FL_TOS(fl4);
|
2011-04-28 23:48:42 +02:00
|
|
|
unsigned int flags = 0;
|
|
|
|
struct fib_result res;
|
2011-02-18 00:29:00 +01:00
|
|
|
struct rtable *rth;
|
2011-04-28 23:48:42 +02:00
|
|
|
__be32 orig_daddr;
|
|
|
|
__be32 orig_saddr;
|
|
|
|
int orig_oif;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
res.fi = NULL;
|
|
|
|
#ifdef CONFIG_IP_MULTIPLE_TABLES
|
|
|
|
res.r = NULL;
|
|
|
|
#endif
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
orig_daddr = fl4->daddr;
|
|
|
|
orig_saddr = fl4->saddr;
|
|
|
|
orig_oif = fl4->flowi4_oif;
|
|
|
|
|
|
|
|
fl4->flowi4_iif = net->loopback_dev->ifindex;
|
|
|
|
fl4->flowi4_tos = tos & IPTOS_RT_MASK;
|
|
|
|
fl4->flowi4_scope = ((tos & RTO_ONLINK) ?
|
|
|
|
RT_SCOPE_LINK : RT_SCOPE_UNIVERSE);
|
ipv4: Optimize flow initialization in output route lookup.
We burn a lot of useless cycles, cpu store buffer traffic, and
memory operations memset()'ing the on-stack flow used to perform
output route lookups in __ip_route_output_key().
Only the first half of the flow object members even matter for
output route lookups in this context, specifically:
FIB rules matching cares about:
dst, src, tos, iif, oif, mark
FIB trie lookup cares about:
dst
FIB semantic match cares about:
tos, scope, oif
Therefore only initialize these specific members and elide the
memset entirely.
On Niagara2 this kills about ~300 cycles from the output route
lookup path.
Likely, we can take things further, since all callers of output
route lookups essentially throw away the on-stack flow they use.
So they don't care if we use it as a scratch-pad to compute the
final flow key.
Signed-off-by: David S. Miller <davem@davemloft.net>
Acked-by: Eric Dumazet <eric.dumazet@gmail.com>
2011-03-05 06:24:47 +01:00
|
|
|
|
2011-02-18 00:37:09 +01:00
|
|
|
rcu_read_lock();
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fl4->saddr) {
|
2011-03-02 23:31:35 +01:00
|
|
|
rth = ERR_PTR(-EINVAL);
|
2011-04-28 23:48:42 +02:00
|
|
|
if (ipv4_is_multicast(fl4->saddr) ||
|
|
|
|
ipv4_is_lbcast(fl4->saddr) ||
|
|
|
|
ipv4_is_zeronet(fl4->saddr))
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* I removed check for oif == dev_out->oif here.
|
|
|
|
It was wrong for two reasons:
|
2008-01-23 07:04:30 +01:00
|
|
|
1. ip_dev_find(net, saddr) can return wrong iface, if saddr
|
|
|
|
is assigned to multiple interfaces.
|
2005-04-17 00:20:36 +02:00
|
|
|
2. Moreover, we are allowed to send packets with saddr
|
|
|
|
of another iface. --ANK
|
|
|
|
*/
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fl4->flowi4_oif == 0 &&
|
|
|
|
(ipv4_is_multicast(fl4->daddr) ||
|
|
|
|
ipv4_is_lbcast(fl4->daddr))) {
|
2008-10-01 16:28:28 +02:00
|
|
|
/* It is equivalent to inet_addr_type(saddr) == RTN_LOCAL */
|
2011-04-28 23:48:42 +02:00
|
|
|
dev_out = __ip_dev_find(net, fl4->saddr, false);
|
2008-10-01 16:28:28 +02:00
|
|
|
if (dev_out == NULL)
|
|
|
|
goto out;
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
/* Special hack: user can direct multicasts
|
|
|
|
and limited broadcast via necessary interface
|
|
|
|
without fiddling with IP_MULTICAST_IF or IP_PKTINFO.
|
|
|
|
This hack is not just for fun, it allows
|
|
|
|
vic,vat and friends to work.
|
|
|
|
They bind socket to loopback, set ttl to zero
|
|
|
|
and expect that it will work.
|
|
|
|
From the viewpoint of routing cache they are broken,
|
|
|
|
because we are not allowed to build multicast path
|
|
|
|
with loopback source addr (look, routing cache
|
|
|
|
cannot know, that ttl is zero, so that packet
|
|
|
|
will not leave this host and route is valid).
|
|
|
|
Luckily, this hack is good workaround.
|
|
|
|
*/
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
fl4->flowi4_oif = dev_out->ifindex;
|
2005-04-17 00:20:36 +02:00
|
|
|
goto make_route;
|
|
|
|
}
|
2008-10-01 16:28:28 +02:00
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
if (!(fl4->flowi4_flags & FLOWI_FLAG_ANYSRC)) {
|
2008-10-01 16:28:28 +02:00
|
|
|
/* It is equivalent to inet_addr_type(saddr) == RTN_LOCAL */
|
2011-04-28 23:48:42 +02:00
|
|
|
if (!__ip_dev_find(net, fl4->saddr, false))
|
2008-10-01 16:28:28 +02:00
|
|
|
goto out;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fl4->flowi4_oif) {
|
|
|
|
dev_out = dev_get_by_index_rcu(net, fl4->flowi4_oif);
|
2011-03-02 23:31:35 +01:00
|
|
|
rth = ERR_PTR(-ENODEV);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (dev_out == NULL)
|
|
|
|
goto out;
|
2005-10-03 23:35:55 +02:00
|
|
|
|
|
|
|
/* RACE: Check return value of inet_select_addr instead. */
|
2010-12-22 05:39:39 +01:00
|
|
|
if (!(dev_out->flags & IFF_UP) || !__in_dev_get_rcu(dev_out)) {
|
2011-03-02 23:31:35 +01:00
|
|
|
rth = ERR_PTR(-ENETUNREACH);
|
2010-12-22 05:39:39 +01:00
|
|
|
goto out;
|
|
|
|
}
|
2011-04-28 23:48:42 +02:00
|
|
|
if (ipv4_is_local_multicast(fl4->daddr) ||
|
|
|
|
ipv4_is_lbcast(fl4->daddr)) {
|
|
|
|
if (!fl4->saddr)
|
|
|
|
fl4->saddr = inet_select_addr(dev_out, 0,
|
|
|
|
RT_SCOPE_LINK);
|
2005-04-17 00:20:36 +02:00
|
|
|
goto make_route;
|
|
|
|
}
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fl4->saddr) {
|
|
|
|
if (ipv4_is_multicast(fl4->daddr))
|
|
|
|
fl4->saddr = inet_select_addr(dev_out, 0,
|
|
|
|
fl4->flowi4_scope);
|
|
|
|
else if (!fl4->daddr)
|
|
|
|
fl4->saddr = inet_select_addr(dev_out, 0,
|
|
|
|
RT_SCOPE_HOST);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
if (!fl4->daddr) {
|
|
|
|
fl4->daddr = fl4->saddr;
|
|
|
|
if (!fl4->daddr)
|
|
|
|
fl4->daddr = fl4->saddr = htonl(INADDR_LOOPBACK);
|
2008-01-23 07:06:19 +01:00
|
|
|
dev_out = net->loopback_dev;
|
2011-04-28 23:48:42 +02:00
|
|
|
fl4->flowi4_oif = net->loopback_dev->ifindex;
|
2005-04-17 00:20:36 +02:00
|
|
|
res.type = RTN_LOCAL;
|
|
|
|
flags |= RTCF_LOCAL;
|
|
|
|
goto make_route;
|
|
|
|
}
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fib_lookup(net, fl4, &res)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
res.fi = NULL;
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fl4->flowi4_oif) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/* Apparently, routing tables are wrong. Assume,
|
|
|
|
that the destination is on link.
|
|
|
|
|
|
|
|
WHY? DW.
|
|
|
|
Because we are allowed to send to iface
|
|
|
|
even if it has NO routes and NO assigned
|
|
|
|
addresses. When oif is specified, routing
|
|
|
|
tables are looked up with only one purpose:
|
|
|
|
to catch if destination is gatewayed, rather than
|
|
|
|
direct. Moreover, if MSG_DONTROUTE is set,
|
|
|
|
we send packet, ignoring both routing tables
|
|
|
|
and ifaddr state. --ANK
|
|
|
|
|
|
|
|
|
|
|
|
We could make it even if oif is unknown,
|
|
|
|
likely IPv6, but we do not.
|
|
|
|
*/
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
if (fl4->saddr == 0)
|
|
|
|
fl4->saddr = inet_select_addr(dev_out, 0,
|
|
|
|
RT_SCOPE_LINK);
|
2005-04-17 00:20:36 +02:00
|
|
|
res.type = RTN_UNICAST;
|
|
|
|
goto make_route;
|
|
|
|
}
|
2011-03-02 23:31:35 +01:00
|
|
|
rth = ERR_PTR(-ENETUNREACH);
|
2005-04-17 00:20:36 +02:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (res.type == RTN_LOCAL) {
|
2011-04-28 23:48:42 +02:00
|
|
|
if (!fl4->saddr) {
|
2011-01-03 21:24:20 +01:00
|
|
|
if (res.fi->fib_prefsrc)
|
2011-04-28 23:48:42 +02:00
|
|
|
fl4->saddr = res.fi->fib_prefsrc;
|
2011-01-03 21:24:20 +01:00
|
|
|
else
|
2011-04-28 23:48:42 +02:00
|
|
|
fl4->saddr = fl4->daddr;
|
2011-01-03 21:24:20 +01:00
|
|
|
}
|
2008-01-23 07:06:19 +01:00
|
|
|
dev_out = net->loopback_dev;
|
2011-04-28 23:48:42 +02:00
|
|
|
fl4->flowi4_oif = dev_out->ifindex;
|
2005-04-17 00:20:36 +02:00
|
|
|
res.fi = NULL;
|
|
|
|
flags |= RTCF_LOCAL;
|
|
|
|
goto make_route;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_IP_ROUTE_MULTIPATH
|
2011-04-28 23:48:42 +02:00
|
|
|
if (res.fi->fib_nhs > 1 && fl4->flowi4_oif == 0)
|
2011-03-11 02:01:16 +01:00
|
|
|
fib_select_multipath(&res);
|
2005-04-17 00:20:36 +02:00
|
|
|
else
|
|
|
|
#endif
|
2011-04-14 23:49:37 +02:00
|
|
|
if (!res.prefixlen &&
|
|
|
|
res.table->tb_num_default > 1 &&
|
2011-04-28 23:48:42 +02:00
|
|
|
res.type == RTN_UNICAST && !fl4->flowi4_oif)
|
2011-02-01 01:16:50 +01:00
|
|
|
fib_select_default(&res);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
if (!fl4->saddr)
|
|
|
|
fl4->saddr = FIB_RES_PREFSRC(net, res);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
dev_out = FIB_RES_DEV(res);
|
2011-04-28 23:48:42 +02:00
|
|
|
fl4->flowi4_oif = dev_out->ifindex;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
|
|
|
|
make_route:
|
2011-04-28 23:48:42 +02:00
|
|
|
rth = __mkroute_output(&res, fl4, orig_daddr, orig_saddr, orig_oif,
|
2011-12-02 12:39:42 +01:00
|
|
|
tos, dev_out, flags);
|
2011-03-02 23:31:35 +01:00
|
|
|
if (!IS_ERR(rth)) {
|
2011-02-18 00:29:00 +01:00
|
|
|
unsigned int hash;
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
hash = rt_hash(orig_daddr, orig_saddr, orig_oif,
|
2011-02-18 00:29:00 +01:00
|
|
|
rt_genid(dev_net(dev_out)));
|
2011-04-28 23:48:42 +02:00
|
|
|
rth = rt_intern_hash(hash, rth, NULL, orig_oif);
|
2011-02-18 00:29:00 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-02-18 00:37:09 +01:00
|
|
|
out:
|
|
|
|
rcu_read_unlock();
|
2011-03-02 23:31:35 +01:00
|
|
|
return rth;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2011-04-28 23:48:42 +02:00
|
|
|
struct rtable *__ip_route_output_key(struct net *net, struct flowi4 *flp4)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
struct rtable *rth;
|
2011-02-18 00:37:09 +01:00
|
|
|
unsigned int hash;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-10-27 20:28:25 +01:00
|
|
|
if (!rt_caching(net))
|
|
|
|
goto slow_output;
|
|
|
|
|
2011-03-12 07:12:47 +01:00
|
|
|
hash = rt_hash(flp4->daddr, flp4->saddr, flp4->flowi4_oif, rt_genid(net));
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
rcu_read_lock_bh();
|
2010-02-23 02:04:49 +01:00
|
|
|
for (rth = rcu_dereference_bh(rt_hash_table[hash].chain); rth;
|
2010-06-11 08:31:35 +02:00
|
|
|
rth = rcu_dereference_bh(rth->dst.rt_next)) {
|
2011-03-12 07:12:47 +01:00
|
|
|
if (rth->rt_key_dst == flp4->daddr &&
|
|
|
|
rth->rt_key_src == flp4->saddr &&
|
2010-11-12 02:07:48 +01:00
|
|
|
rt_is_output_route(rth) &&
|
2011-03-12 07:12:47 +01:00
|
|
|
rth->rt_oif == flp4->flowi4_oif &&
|
|
|
|
rth->rt_mark == flp4->flowi4_mark &&
|
2011-05-04 04:45:15 +02:00
|
|
|
!((rth->rt_key_tos ^ flp4->flowi4_tos) &
|
2008-01-23 08:50:25 +01:00
|
|
|
(IPTOS_RT_MASK | RTO_ONLINK)) &&
|
2010-06-11 08:31:35 +02:00
|
|
|
net_eq(dev_net(rth->dst.dev), net) &&
|
2008-07-06 04:04:32 +02:00
|
|
|
!rt_is_expired(rth)) {
|
2011-12-05 19:21:42 +01:00
|
|
|
ipv4_validate_peer(rth);
|
2010-06-11 08:31:35 +02:00
|
|
|
dst_use(&rth->dst, jiffies);
|
2005-04-17 00:20:36 +02:00
|
|
|
RT_CACHE_STAT_INC(out_hit);
|
|
|
|
rcu_read_unlock_bh();
|
2011-05-02 23:37:45 +02:00
|
|
|
if (!flp4->saddr)
|
|
|
|
flp4->saddr = rth->rt_src;
|
|
|
|
if (!flp4->daddr)
|
|
|
|
flp4->daddr = rth->rt_dst;
|
2011-03-02 23:31:35 +01:00
|
|
|
return rth;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
RT_CACHE_STAT_INC(out_hlist_search);
|
|
|
|
}
|
|
|
|
rcu_read_unlock_bh();
|
|
|
|
|
2008-10-27 20:28:25 +01:00
|
|
|
slow_output:
|
2011-03-12 07:12:47 +01:00
|
|
|
return ip_route_output_slow(net, flp4);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2005-08-10 05:12:12 +02:00
|
|
|
EXPORT_SYMBOL_GPL(__ip_route_output_key);
|
|
|
|
|
2010-09-08 23:35:43 +02:00
|
|
|
static struct dst_entry *ipv4_blackhole_dst_check(struct dst_entry *dst, u32 cookie)
|
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2011-11-23 03:12:51 +01:00
|
|
|
static unsigned int ipv4_blackhole_mtu(const struct dst_entry *dst)
|
2011-01-31 22:16:00 +01:00
|
|
|
{
|
2011-11-23 03:13:31 +01:00
|
|
|
unsigned int mtu = dst_metric_raw(dst, RTAX_MTU);
|
|
|
|
|
|
|
|
return mtu ? : dst->dev->mtu;
|
2011-01-31 22:16:00 +01:00
|
|
|
}
|
|
|
|
|
2007-05-25 03:17:54 +02:00
|
|
|
static void ipv4_rt_blackhole_update_pmtu(struct dst_entry *dst, u32 mtu)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-04-25 00:07:32 +02:00
|
|
|
static u32 *ipv4_rt_blackhole_cow_metrics(struct dst_entry *dst,
|
|
|
|
unsigned long old)
|
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2007-05-25 03:17:54 +02:00
|
|
|
static struct dst_ops ipv4_dst_blackhole_ops = {
|
|
|
|
.family = AF_INET,
|
2009-02-01 09:45:17 +01:00
|
|
|
.protocol = cpu_to_be16(ETH_P_IP),
|
2007-05-25 03:17:54 +02:00
|
|
|
.destroy = ipv4_dst_destroy,
|
2010-09-08 23:35:43 +02:00
|
|
|
.check = ipv4_blackhole_dst_check,
|
2011-11-23 03:12:51 +01:00
|
|
|
.mtu = ipv4_blackhole_mtu,
|
2011-02-18 20:39:01 +01:00
|
|
|
.default_advmss = ipv4_default_advmss,
|
2007-05-25 03:17:54 +02:00
|
|
|
.update_pmtu = ipv4_rt_blackhole_update_pmtu,
|
2011-04-25 00:07:32 +02:00
|
|
|
.cow_metrics = ipv4_rt_blackhole_cow_metrics,
|
2011-07-18 09:40:17 +02:00
|
|
|
.neigh_lookup = ipv4_neigh_lookup,
|
2007-05-25 03:17:54 +02:00
|
|
|
};
|
|
|
|
|
2011-03-01 23:59:04 +01:00
|
|
|
struct dst_entry *ipv4_blackhole_route(struct net *net, struct dst_entry *dst_orig)
|
2007-05-25 03:17:54 +02:00
|
|
|
{
|
2011-04-28 23:13:38 +02:00
|
|
|
struct rtable *rt = dst_alloc(&ipv4_dst_blackhole_ops, NULL, 1, 0, 0);
|
2011-03-01 23:59:04 +01:00
|
|
|
struct rtable *ort = (struct rtable *) dst_orig;
|
2007-05-25 03:17:54 +02:00
|
|
|
|
|
|
|
if (rt) {
|
2010-06-11 08:31:35 +02:00
|
|
|
struct dst_entry *new = &rt->dst;
|
2007-05-25 03:17:54 +02:00
|
|
|
|
|
|
|
new->__use = 1;
|
2007-11-14 06:34:06 +01:00
|
|
|
new->input = dst_discard;
|
|
|
|
new->output = dst_discard;
|
2010-12-09 06:16:57 +01:00
|
|
|
dst_copy_metrics(new, &ort->dst);
|
2007-05-25 03:17:54 +02:00
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
new->dev = ort->dst.dev;
|
2007-05-25 03:17:54 +02:00
|
|
|
if (new->dev)
|
|
|
|
dev_hold(new->dev);
|
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
rt->rt_key_dst = ort->rt_key_dst;
|
|
|
|
rt->rt_key_src = ort->rt_key_src;
|
2011-05-04 04:45:15 +02:00
|
|
|
rt->rt_key_tos = ort->rt_key_tos;
|
2011-04-07 23:04:08 +02:00
|
|
|
rt->rt_route_iif = ort->rt_route_iif;
|
2011-03-05 06:47:09 +01:00
|
|
|
rt->rt_iif = ort->rt_iif;
|
|
|
|
rt->rt_oif = ort->rt_oif;
|
|
|
|
rt->rt_mark = ort->rt_mark;
|
2007-05-25 03:17:54 +02:00
|
|
|
|
2008-07-06 04:04:32 +02:00
|
|
|
rt->rt_genid = rt_genid(net);
|
2007-05-25 03:17:54 +02:00
|
|
|
rt->rt_flags = ort->rt_flags;
|
|
|
|
rt->rt_type = ort->rt_type;
|
|
|
|
rt->rt_dst = ort->rt_dst;
|
|
|
|
rt->rt_src = ort->rt_src;
|
|
|
|
rt->rt_gateway = ort->rt_gateway;
|
|
|
|
rt->rt_spec_dst = ort->rt_spec_dst;
|
|
|
|
rt->peer = ort->peer;
|
|
|
|
if (rt->peer)
|
|
|
|
atomic_inc(&rt->peer->refcnt);
|
net: Implement read-only protection and COW'ing of metrics.
Routing metrics are now copy-on-write.
Initially a route entry points it's metrics at a read-only location.
If a routing table entry exists, it will point there. Else it will
point at the all zero metric place-holder called 'dst_default_metrics'.
The writeability state of the metrics is stored in the low bits of the
metrics pointer, we have two bits left to spare if we want to store
more states.
For the initial implementation, COW is implemented simply via kmalloc.
However future enhancements will change this to place the writable
metrics somewhere else, in order to increase sharing. Very likely
this "somewhere else" will be the inetpeer cache.
Note also that this means that metrics updates may transiently fail
if we cannot COW the metrics successfully.
But even by itself, this patch should decrease memory usage and
increase cache locality especially for routing workloads. In those
cases the read-only metric copies stay in place and never get written
to.
TCP workloads where metrics get updated, and those rare cases where
PMTU triggers occur, will take a very slight performance hit. But
that hit will be alleviated when the long-term writable metrics
move to a more sharable location.
Since the metrics storage went from a u32 array of RTAX_MAX entries to
what is essentially a pointer, some retooling of the dst_entry layout
was necessary.
Most importantly, we need to preserve the alignment of the reference
count so that it doesn't share cache lines with the read-mostly state,
as per Eric Dumazet's alignment assertion checks.
The only non-trivial bit here is the move of the 'flags' member into
the writeable cacheline. This is OK since we are always accessing the
flags around the same moment when we made a modification to the
reference count.
Signed-off-by: David S. Miller <davem@davemloft.net>
2011-01-27 05:51:05 +01:00
|
|
|
rt->fi = ort->fi;
|
|
|
|
if (rt->fi)
|
|
|
|
atomic_inc(&rt->fi->fib_clntref);
|
2007-05-25 03:17:54 +02:00
|
|
|
|
|
|
|
dst_free(new);
|
|
|
|
}
|
|
|
|
|
2011-03-01 23:59:04 +01:00
|
|
|
dst_release(dst_orig);
|
|
|
|
|
|
|
|
return rt ? &rt->dst : ERR_PTR(-ENOMEM);
|
2007-05-25 03:17:54 +02:00
|
|
|
}
|
|
|
|
|
2011-03-12 07:12:47 +01:00
|
|
|
struct rtable *ip_route_output_flow(struct net *net, struct flowi4 *flp4,
|
2011-03-02 23:31:35 +01:00
|
|
|
struct sock *sk)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-03-12 07:12:47 +01:00
|
|
|
struct rtable *rt = __ip_route_output_key(net, flp4);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-02 23:31:35 +01:00
|
|
|
if (IS_ERR(rt))
|
|
|
|
return rt;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-05-02 23:37:45 +02:00
|
|
|
if (flp4->flowi4_proto)
|
2011-03-12 07:12:47 +01:00
|
|
|
rt = (struct rtable *) xfrm_lookup(net, &rt->dst,
|
|
|
|
flowi4_to_flowi(flp4),
|
|
|
|
sk, 0);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-03-02 23:31:35 +01:00
|
|
|
return rt;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2005-08-10 05:12:12 +02:00
|
|
|
EXPORT_SYMBOL_GPL(ip_route_output_flow);
|
|
|
|
|
2009-01-22 05:56:23 +01:00
|
|
|
static int rt_fill_info(struct net *net,
|
|
|
|
struct sk_buff *skb, u32 pid, u32 seq, int event,
|
2005-06-19 07:54:12 +02:00
|
|
|
int nowait, unsigned int flags)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2009-06-02 07:14:27 +02:00
|
|
|
struct rtable *rt = skb_rtable(skb);
|
2005-04-17 00:20:36 +02:00
|
|
|
struct rtmsg *r;
|
2006-08-18 03:15:17 +02:00
|
|
|
struct nlmsghdr *nlh;
|
2011-10-11 03:12:02 +02:00
|
|
|
unsigned long expires = 0;
|
2011-06-08 08:07:07 +02:00
|
|
|
const struct inet_peer *peer = rt->peer;
|
2006-11-27 18:27:07 +01:00
|
|
|
u32 id = 0, ts = 0, tsage = 0, error;
|
2006-08-18 03:15:17 +02:00
|
|
|
|
|
|
|
nlh = nlmsg_put(skb, pid, seq, event, sizeof(*r), flags);
|
|
|
|
if (nlh == NULL)
|
2007-02-01 08:16:40 +01:00
|
|
|
return -EMSGSIZE;
|
2006-08-18 03:15:17 +02:00
|
|
|
|
|
|
|
r = nlmsg_data(nlh);
|
2005-04-17 00:20:36 +02:00
|
|
|
r->rtm_family = AF_INET;
|
|
|
|
r->rtm_dst_len = 32;
|
|
|
|
r->rtm_src_len = 0;
|
2011-05-04 04:45:15 +02:00
|
|
|
r->rtm_tos = rt->rt_key_tos;
|
2005-04-17 00:20:36 +02:00
|
|
|
r->rtm_table = RT_TABLE_MAIN;
|
2006-08-18 03:15:17 +02:00
|
|
|
NLA_PUT_U32(skb, RTA_TABLE, RT_TABLE_MAIN);
|
2005-04-17 00:20:36 +02:00
|
|
|
r->rtm_type = rt->rt_type;
|
|
|
|
r->rtm_scope = RT_SCOPE_UNIVERSE;
|
|
|
|
r->rtm_protocol = RTPROT_UNSPEC;
|
|
|
|
r->rtm_flags = (rt->rt_flags & ~0xFFFF) | RTM_F_CLONED;
|
|
|
|
if (rt->rt_flags & RTCF_NOTIFY)
|
|
|
|
r->rtm_flags |= RTM_F_NOTIFY;
|
2006-08-18 03:15:17 +02:00
|
|
|
|
2006-09-27 07:15:25 +02:00
|
|
|
NLA_PUT_BE32(skb, RTA_DST, rt->rt_dst);
|
2006-08-18 03:15:17 +02:00
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
if (rt->rt_key_src) {
|
2005-04-17 00:20:36 +02:00
|
|
|
r->rtm_src_len = 32;
|
2011-03-05 06:47:09 +01:00
|
|
|
NLA_PUT_BE32(skb, RTA_SRC, rt->rt_key_src);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2010-06-11 08:31:35 +02:00
|
|
|
if (rt->dst.dev)
|
|
|
|
NLA_PUT_U32(skb, RTA_OIF, rt->dst.dev->ifindex);
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2010-06-11 08:31:35 +02:00
|
|
|
if (rt->dst.tclassid)
|
|
|
|
NLA_PUT_U32(skb, RTA_FLOW, rt->dst.tclassid);
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2010-11-12 02:07:48 +01:00
|
|
|
if (rt_is_input_route(rt))
|
2006-09-27 07:15:25 +02:00
|
|
|
NLA_PUT_BE32(skb, RTA_PREFSRC, rt->rt_spec_dst);
|
2011-03-05 06:47:09 +01:00
|
|
|
else if (rt->rt_src != rt->rt_key_src)
|
2006-09-27 07:15:25 +02:00
|
|
|
NLA_PUT_BE32(skb, RTA_PREFSRC, rt->rt_src);
|
2006-08-18 03:15:17 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (rt->rt_dst != rt->rt_gateway)
|
2006-09-27 07:15:25 +02:00
|
|
|
NLA_PUT_BE32(skb, RTA_GATEWAY, rt->rt_gateway);
|
2006-08-18 03:15:17 +02:00
|
|
|
|
2010-12-09 06:16:57 +01:00
|
|
|
if (rtnetlink_put_metrics(skb, dst_metrics_ptr(&rt->dst)) < 0)
|
2006-08-18 03:15:17 +02:00
|
|
|
goto nla_put_failure;
|
|
|
|
|
2011-03-05 06:47:09 +01:00
|
|
|
if (rt->rt_mark)
|
|
|
|
NLA_PUT_BE32(skb, RTA_MARK, rt->rt_mark);
|
2010-07-21 00:03:14 +02:00
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
error = rt->dst.error;
|
2011-06-08 08:07:07 +02:00
|
|
|
if (peer) {
|
2010-06-16 06:52:13 +02:00
|
|
|
inet_peer_refcheck(rt->peer);
|
2011-06-08 08:07:07 +02:00
|
|
|
id = atomic_read(&peer->ip_id_count) & 0xffff;
|
|
|
|
if (peer->tcp_ts_stamp) {
|
|
|
|
ts = peer->tcp_ts;
|
|
|
|
tsage = get_seconds() - peer->tcp_ts_stamp;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2011-06-08 08:07:07 +02:00
|
|
|
expires = ACCESS_ONCE(peer->pmtu_expires);
|
2011-10-11 03:12:02 +02:00
|
|
|
if (expires) {
|
|
|
|
if (time_before(jiffies, expires))
|
|
|
|
expires -= jiffies;
|
|
|
|
else
|
|
|
|
expires = 0;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2006-08-18 03:15:17 +02:00
|
|
|
|
2010-11-12 02:07:48 +01:00
|
|
|
if (rt_is_input_route(rt)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_IP_MROUTE
|
2006-09-27 07:15:01 +02:00
|
|
|
__be32 dst = rt->rt_dst;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-12-16 22:45:43 +01:00
|
|
|
if (ipv4_is_multicast(dst) && !ipv4_is_local_multicast(dst) &&
|
2009-01-22 05:56:23 +01:00
|
|
|
IPV4_DEVCONF_ALL(net, MC_FORWARDING)) {
|
2011-05-04 21:18:54 +02:00
|
|
|
int err = ipmr_get_route(net, skb,
|
|
|
|
rt->rt_src, rt->rt_dst,
|
|
|
|
r, nowait);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (err <= 0) {
|
|
|
|
if (!nowait) {
|
|
|
|
if (err == 0)
|
|
|
|
return 0;
|
2006-08-18 03:15:17 +02:00
|
|
|
goto nla_put_failure;
|
2005-04-17 00:20:36 +02:00
|
|
|
} else {
|
|
|
|
if (err == -EMSGSIZE)
|
2006-08-18 03:15:17 +02:00
|
|
|
goto nla_put_failure;
|
2006-11-27 18:27:07 +01:00
|
|
|
error = err;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
#endif
|
2011-03-05 06:47:09 +01:00
|
|
|
NLA_PUT_U32(skb, RTA_IIF, rt->rt_iif);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
if (rtnl_put_cacheinfo(skb, &rt->dst, id, ts, tsage,
|
2006-11-27 18:27:07 +01:00
|
|
|
expires, error) < 0)
|
|
|
|
goto nla_put_failure;
|
2006-08-18 03:15:17 +02:00
|
|
|
|
|
|
|
return nlmsg_end(skb, nlh);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-08-18 03:15:17 +02:00
|
|
|
nla_put_failure:
|
2007-02-01 08:16:40 +01:00
|
|
|
nlmsg_cancel(skb, nlh);
|
|
|
|
return -EMSGSIZE;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2007-03-22 19:55:17 +01:00
|
|
|
static int inet_rtm_getroute(struct sk_buff *in_skb, struct nlmsghdr* nlh, void *arg)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2008-03-25 18:26:21 +01:00
|
|
|
struct net *net = sock_net(in_skb->sk);
|
2006-08-18 03:15:44 +02:00
|
|
|
struct rtmsg *rtm;
|
|
|
|
struct nlattr *tb[RTA_MAX+1];
|
2005-04-17 00:20:36 +02:00
|
|
|
struct rtable *rt = NULL;
|
2006-09-27 06:25:20 +02:00
|
|
|
__be32 dst = 0;
|
|
|
|
__be32 src = 0;
|
|
|
|
u32 iif;
|
2006-08-18 03:15:44 +02:00
|
|
|
int err;
|
2010-07-21 00:03:14 +02:00
|
|
|
int mark;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct sk_buff *skb;
|
|
|
|
|
2006-08-18 03:15:44 +02:00
|
|
|
err = nlmsg_parse(nlh, sizeof(*rtm), tb, RTA_MAX, rtm_ipv4_policy);
|
|
|
|
if (err < 0)
|
|
|
|
goto errout;
|
|
|
|
|
|
|
|
rtm = nlmsg_data(nlh);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
|
2006-08-18 03:15:44 +02:00
|
|
|
if (skb == NULL) {
|
|
|
|
err = -ENOBUFS;
|
|
|
|
goto errout;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* Reserve room for dummy headers, this skb can pass
|
|
|
|
through good chunk of routing engine.
|
|
|
|
*/
|
2007-03-19 23:30:44 +01:00
|
|
|
skb_reset_mac_header(skb);
|
2007-04-11 05:45:18 +02:00
|
|
|
skb_reset_network_header(skb);
|
2006-04-18 02:27:11 +02:00
|
|
|
|
|
|
|
/* Bugfix: need to give ip_route_input enough of an IP header to not gag. */
|
2007-04-21 07:47:35 +02:00
|
|
|
ip_hdr(skb)->protocol = IPPROTO_ICMP;
|
2005-04-17 00:20:36 +02:00
|
|
|
skb_reserve(skb, MAX_HEADER + sizeof(struct iphdr));
|
|
|
|
|
2006-09-27 07:15:25 +02:00
|
|
|
src = tb[RTA_SRC] ? nla_get_be32(tb[RTA_SRC]) : 0;
|
|
|
|
dst = tb[RTA_DST] ? nla_get_be32(tb[RTA_DST]) : 0;
|
2006-08-18 03:15:44 +02:00
|
|
|
iif = tb[RTA_IIF] ? nla_get_u32(tb[RTA_IIF]) : 0;
|
2010-07-21 00:03:14 +02:00
|
|
|
mark = tb[RTA_MARK] ? nla_get_u32(tb[RTA_MARK]) : 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
if (iif) {
|
2006-08-18 03:15:44 +02:00
|
|
|
struct net_device *dev;
|
|
|
|
|
2008-02-29 05:52:04 +01:00
|
|
|
dev = __dev_get_by_index(net, iif);
|
2006-08-18 03:15:44 +02:00
|
|
|
if (dev == NULL) {
|
|
|
|
err = -ENODEV;
|
|
|
|
goto errout_free;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
skb->protocol = htons(ETH_P_IP);
|
|
|
|
skb->dev = dev;
|
2010-07-21 00:03:14 +02:00
|
|
|
skb->mark = mark;
|
2005-04-17 00:20:36 +02:00
|
|
|
local_bh_disable();
|
|
|
|
err = ip_route_input(skb, dst, src, rtm->rtm_tos, dev);
|
|
|
|
local_bh_enable();
|
2006-08-18 03:15:44 +02:00
|
|
|
|
2009-06-02 07:14:27 +02:00
|
|
|
rt = skb_rtable(skb);
|
2010-06-11 08:31:35 +02:00
|
|
|
if (err == 0 && rt->dst.error)
|
|
|
|
err = -rt->dst.error;
|
2005-04-17 00:20:36 +02:00
|
|
|
} else {
|
2011-03-12 02:07:33 +01:00
|
|
|
struct flowi4 fl4 = {
|
|
|
|
.daddr = dst,
|
|
|
|
.saddr = src,
|
|
|
|
.flowi4_tos = rtm->rtm_tos,
|
|
|
|
.flowi4_oif = tb[RTA_OIF] ? nla_get_u32(tb[RTA_OIF]) : 0,
|
|
|
|
.flowi4_mark = mark,
|
2006-08-18 03:15:44 +02:00
|
|
|
};
|
2011-03-12 07:12:47 +01:00
|
|
|
rt = ip_route_output_key(net, &fl4);
|
2011-03-02 23:31:35 +01:00
|
|
|
|
|
|
|
err = 0;
|
|
|
|
if (IS_ERR(rt))
|
|
|
|
err = PTR_ERR(rt);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2006-08-18 03:15:44 +02:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
if (err)
|
2006-08-18 03:15:44 +02:00
|
|
|
goto errout_free;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-06-11 08:31:35 +02:00
|
|
|
skb_dst_set(skb, &rt->dst);
|
2005-04-17 00:20:36 +02:00
|
|
|
if (rtm->rtm_flags & RTM_F_NOTIFY)
|
|
|
|
rt->rt_flags |= RTCF_NOTIFY;
|
|
|
|
|
2009-01-22 05:56:23 +01:00
|
|
|
err = rt_fill_info(net, skb, NETLINK_CB(in_skb).pid, nlh->nlmsg_seq,
|
2008-02-29 05:52:04 +01:00
|
|
|
RTM_NEWROUTE, 0, 0);
|
2006-08-18 03:15:44 +02:00
|
|
|
if (err <= 0)
|
|
|
|
goto errout_free;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2008-02-29 05:52:04 +01:00
|
|
|
err = rtnl_unicast(skb, net, NETLINK_CB(in_skb).pid);
|
2006-08-18 03:15:44 +02:00
|
|
|
errout:
|
2006-08-15 09:30:25 +02:00
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-08-18 03:15:44 +02:00
|
|
|
errout_free:
|
2005-04-17 00:20:36 +02:00
|
|
|
kfree_skb(skb);
|
2006-08-18 03:15:44 +02:00
|
|
|
goto errout;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int ip_rt_dump(struct sk_buff *skb, struct netlink_callback *cb)
|
|
|
|
{
|
|
|
|
struct rtable *rt;
|
|
|
|
int h, s_h;
|
|
|
|
int idx, s_idx;
|
2008-02-29 05:52:04 +01:00
|
|
|
struct net *net;
|
|
|
|
|
2008-03-25 18:26:21 +01:00
|
|
|
net = sock_net(skb->sk);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
s_h = cb->args[0];
|
[IPV4] ROUTE: ip_rt_dump() is unecessary slow
I noticed "ip route list cache x.y.z.t" can be *very* slow.
While strace-ing -T it I also noticed that first part of route cache
is fetched quite fast :
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"p\0\0\0\30\0\2\0\254i\202
GXm\0\0\2 \0\376\0\0\2\0\2\0"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3772 <0.000047>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"\234\0\0\0\30\0\2\0\254i\
202GXm\0\0\2 \0\376\0\0\1\0\2"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3736 <0.000042>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"\204\0\0\0\30\0\2\0\254i\
202GXm\0\0\2 \0\376\0\0\1\0\2"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3740 <0.000055>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"\234\0\0\0\30\0\2\0\254i\
202GXm\0\0\2 \0\376\0\0\1\0\2"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3712 <0.000043>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"\204\0\0\0\30\0\2\0\254i\
202GXm\0\0\2 \0\376\0\0\1\0\2"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3732 <0.000053>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"p\0\0\0\30\0\2\0\254i\202
GXm\0\0\2 \0\376\0\0\2\0\2\0"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3708 <0.000052>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"p\0\0\0\30\0\2\0\254i\202
GXm\0\0\2 \0\376\0\0\2\0\2\0"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3680 <0.000041>
while the part at the end of the table is more expensive:
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"\204\0\0\0\30\0\2\0\254i\202GXm\0\0\2 \0\376\0\0\1\0\2"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3656 <0.003857>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"\204\0\0\0\30\0\2\0\254i\202GXm\0\0\2 \0\376\0\0\1\0\2"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3772 <0.003891>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"p\0\0\0\30\0\2\0\254i\202GXm\0\0\2 \0\376\0\0\2\0\2\0"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3712 <0.003765>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"p\0\0\0\30\0\2\0\254i\202GXm\0\0\2 \0\376\0\0\2\0\2\0"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3700 <0.003879>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"p\0\0\0\30\0\2\0\254i\202GXm\0\0\2 \0\376\0\0\2\0\2\0"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3676 <0.003797>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"p\0\0\0\30\0\2\0\254i\202GXm\0\0\2 \0\376\0\0\2\0\2\0"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3724 <0.003856>
recvmsg(3, {msg_name(12)={sa_family=AF_NETLINK, pid=0, groups=00000000}, msg_iov(1)=[{"\234\0\0\0\30\0\2\0\254i\202GXm\0\0\2 \0\376\0\0\1\0\2"..., 16384}], msg_controllen=0, msg_flags=0}, 0) = 3736 <0.003848>
The following patch corrects this performance/latency problem,
removing quadratic behavior.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-01-08 06:52:14 +01:00
|
|
|
if (s_h < 0)
|
|
|
|
s_h = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
s_idx = idx = cb->args[1];
|
2008-08-28 10:11:25 +02:00
|
|
|
for (h = s_h; h <= rt_hash_mask; h++, s_idx = 0) {
|
|
|
|
if (!rt_hash_table[h].chain)
|
|
|
|
continue;
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_lock_bh();
|
2010-02-23 02:04:49 +01:00
|
|
|
for (rt = rcu_dereference_bh(rt_hash_table[h].chain), idx = 0; rt;
|
2010-06-11 08:31:35 +02:00
|
|
|
rt = rcu_dereference_bh(rt->dst.rt_next), idx++) {
|
|
|
|
if (!net_eq(dev_net(rt->dst.dev), net) || idx < s_idx)
|
2005-04-17 00:20:36 +02:00
|
|
|
continue;
|
2008-07-06 04:04:32 +02:00
|
|
|
if (rt_is_expired(rt))
|
[IPV4] route cache: Introduce rt_genid for smooth cache invalidation
Current ip route cache implementation is not suited to large caches.
We can consume a lot of CPU when cache must be invalidated, since we
currently need to evict all cache entries, and this eviction is
sometimes asynchronous. min_delay & max_delay can somewhat control this
asynchronism behavior, but whole thing is a kludge, regularly triggering
infamous soft lockup messages. When entries are still in use, this also
consumes a lot of ram, filling dst_garbage.list.
A better scheme is to use a generation identifier on each entry,
so that cache invalidation can be performed by changing the table
identifier, without having to scan all entries.
No more delayed flushing, no more stalling when secret_interval expires.
Invalidated entries will then be freed at GC time (controled by
ip_rt_gc_timeout or stress), or when an invalidated entry is found
in a chain when an insert is done.
Thus we keep a normal equilibrium.
This patch :
- renames rt_hash_rnd to rt_genid (and makes it an atomic_t)
- Adds a new rt_genid field to 'struct rtable' (filling a hole on 64bit)
- Checks entry->rt_genid at appropriate places :
2008-02-01 02:05:09 +01:00
|
|
|
continue;
|
2010-06-11 08:31:35 +02:00
|
|
|
skb_dst_set_noref(skb, &rt->dst);
|
2009-01-22 05:56:23 +01:00
|
|
|
if (rt_fill_info(net, skb, NETLINK_CB(cb->skb).pid,
|
2007-02-09 15:24:47 +01:00
|
|
|
cb->nlh->nlmsg_seq, RTM_NEWROUTE,
|
2005-06-19 07:54:12 +02:00
|
|
|
1, NLM_F_MULTI) <= 0) {
|
2009-06-02 07:19:30 +02:00
|
|
|
skb_dst_drop(skb);
|
2005-04-17 00:20:36 +02:00
|
|
|
rcu_read_unlock_bh();
|
|
|
|
goto done;
|
|
|
|
}
|
2009-06-02 07:19:30 +02:00
|
|
|
skb_dst_drop(skb);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
rcu_read_unlock_bh();
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
cb->args[0] = h;
|
|
|
|
cb->args[1] = idx;
|
|
|
|
return skb->len;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ip_rt_multicast_event(struct in_device *in_dev)
|
|
|
|
{
|
2008-07-06 04:00:44 +02:00
|
|
|
rt_cache_flush(dev_net(in_dev->dev), 0);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_SYSCTL
|
2008-07-08 12:05:28 +02:00
|
|
|
static int ipv4_sysctl_rtcache_flush(ctl_table *__ctl, int write,
|
2009-09-24 00:57:19 +02:00
|
|
|
void __user *buffer,
|
2005-04-17 00:20:36 +02:00
|
|
|
size_t *lenp, loff_t *ppos)
|
|
|
|
{
|
|
|
|
if (write) {
|
2008-07-06 04:02:06 +02:00
|
|
|
int flush_delay;
|
2008-07-08 12:05:28 +02:00
|
|
|
ctl_table ctl;
|
2008-07-06 04:02:33 +02:00
|
|
|
struct net *net;
|
2008-07-06 04:02:06 +02:00
|
|
|
|
2008-07-08 12:05:28 +02:00
|
|
|
memcpy(&ctl, __ctl, sizeof(ctl));
|
|
|
|
ctl.data = &flush_delay;
|
2009-09-24 00:57:19 +02:00
|
|
|
proc_dointvec(&ctl, write, buffer, lenp, ppos);
|
2008-07-06 04:02:06 +02:00
|
|
|
|
2008-07-08 12:05:28 +02:00
|
|
|
net = (struct net *)__ctl->extra1;
|
2008-07-06 04:02:33 +02:00
|
|
|
rt_cache_flush(net, flush_delay);
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
2007-02-09 15:24:47 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2008-07-27 09:59:33 +02:00
|
|
|
static ctl_table ipv4_route_table[] = {
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
.procname = "gc_thresh",
|
|
|
|
.data = &ipv4_dst_ops.gc_thresh,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "max_size",
|
|
|
|
.data = &ip_rt_max_size,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
/* Deprecated. Use gc_min_interval_ms */
|
2007-02-09 15:24:47 +01:00
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
.procname = "gc_min_interval",
|
|
|
|
.data = &ip_rt_gc_min_interval,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec_jiffies,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "gc_min_interval_ms",
|
|
|
|
.data = &ip_rt_gc_min_interval,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec_ms_jiffies,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "gc_timeout",
|
|
|
|
.data = &ip_rt_gc_timeout,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec_jiffies,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "redirect_load",
|
|
|
|
.data = &ip_rt_redirect_load,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "redirect_number",
|
|
|
|
.data = &ip_rt_redirect_number,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "redirect_silence",
|
|
|
|
.data = &ip_rt_redirect_silence,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "error_cost",
|
|
|
|
.data = &ip_rt_error_cost,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "error_burst",
|
|
|
|
.data = &ip_rt_error_burst,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "gc_elasticity",
|
|
|
|
.data = &ip_rt_gc_elasticity,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "mtu_expires",
|
|
|
|
.data = &ip_rt_mtu_expires,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec_jiffies,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "min_pmtu",
|
|
|
|
.data = &ip_rt_min_pmtu,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
|
|
|
{
|
|
|
|
.procname = "min_adv_mss",
|
|
|
|
.data = &ip_rt_min_advmss,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = proc_dointvec,
|
2005-04-17 00:20:36 +02:00
|
|
|
},
|
2009-11-05 22:32:03 +01:00
|
|
|
{ }
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
2008-07-06 04:02:33 +02:00
|
|
|
|
2008-08-26 00:17:44 +02:00
|
|
|
static struct ctl_table empty[1];
|
|
|
|
|
|
|
|
static struct ctl_table ipv4_skeleton[] =
|
|
|
|
{
|
2009-11-05 22:32:03 +01:00
|
|
|
{ .procname = "route",
|
2008-08-27 11:35:18 +02:00
|
|
|
.mode = 0555, .child = ipv4_route_table},
|
2009-11-05 22:32:03 +01:00
|
|
|
{ .procname = "neigh",
|
2008-08-27 11:35:18 +02:00
|
|
|
.mode = 0555, .child = empty},
|
2008-08-26 00:17:44 +02:00
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
|
|
|
static __net_initdata struct ctl_path ipv4_path[] = {
|
2009-11-05 22:32:03 +01:00
|
|
|
{ .procname = "net", },
|
|
|
|
{ .procname = "ipv4", },
|
2008-07-06 04:02:33 +02:00
|
|
|
{ },
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ctl_table ipv4_route_flush_table[] = {
|
|
|
|
{
|
|
|
|
.procname = "flush",
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0200,
|
2008-11-04 03:21:05 +01:00
|
|
|
.proc_handler = ipv4_sysctl_rtcache_flush,
|
2008-07-06 04:02:33 +02:00
|
|
|
},
|
2009-11-05 22:32:03 +01:00
|
|
|
{ },
|
2008-07-06 04:02:33 +02:00
|
|
|
};
|
|
|
|
|
2008-08-26 00:17:44 +02:00
|
|
|
static __net_initdata struct ctl_path ipv4_route_path[] = {
|
2009-11-05 22:32:03 +01:00
|
|
|
{ .procname = "net", },
|
|
|
|
{ .procname = "ipv4", },
|
|
|
|
{ .procname = "route", },
|
2008-08-26 00:17:44 +02:00
|
|
|
{ },
|
|
|
|
};
|
|
|
|
|
2008-07-06 04:02:33 +02:00
|
|
|
static __net_init int sysctl_route_net_init(struct net *net)
|
|
|
|
{
|
|
|
|
struct ctl_table *tbl;
|
|
|
|
|
|
|
|
tbl = ipv4_route_flush_table;
|
2009-11-26 00:14:13 +01:00
|
|
|
if (!net_eq(net, &init_net)) {
|
2008-07-06 04:02:33 +02:00
|
|
|
tbl = kmemdup(tbl, sizeof(ipv4_route_flush_table), GFP_KERNEL);
|
|
|
|
if (tbl == NULL)
|
|
|
|
goto err_dup;
|
|
|
|
}
|
|
|
|
tbl[0].extra1 = net;
|
|
|
|
|
|
|
|
net->ipv4.route_hdr =
|
|
|
|
register_net_sysctl_table(net, ipv4_route_path, tbl);
|
|
|
|
if (net->ipv4.route_hdr == NULL)
|
|
|
|
goto err_reg;
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
err_reg:
|
|
|
|
if (tbl != ipv4_route_flush_table)
|
|
|
|
kfree(tbl);
|
|
|
|
err_dup:
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
static __net_exit void sysctl_route_net_exit(struct net *net)
|
|
|
|
{
|
|
|
|
struct ctl_table *tbl;
|
|
|
|
|
|
|
|
tbl = net->ipv4.route_hdr->ctl_table_arg;
|
|
|
|
unregister_net_sysctl_table(net->ipv4.route_hdr);
|
|
|
|
BUG_ON(tbl == ipv4_route_flush_table);
|
|
|
|
kfree(tbl);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __net_initdata struct pernet_operations sysctl_route_ops = {
|
|
|
|
.init = sysctl_route_net_init,
|
|
|
|
.exit = sysctl_route_net_exit,
|
|
|
|
};
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
|
|
|
|
2010-05-08 10:57:52 +02:00
|
|
|
static __net_init int rt_genid_init(struct net *net)
|
2008-07-06 04:02:59 +02:00
|
|
|
{
|
2010-05-08 10:57:52 +02:00
|
|
|
get_random_bytes(&net->ipv4.rt_genid,
|
|
|
|
sizeof(net->ipv4.rt_genid));
|
2011-03-25 01:42:21 +01:00
|
|
|
get_random_bytes(&net->ipv4.dev_addr_genid,
|
|
|
|
sizeof(net->ipv4.dev_addr_genid));
|
2008-07-06 04:02:59 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-05-08 10:57:52 +02:00
|
|
|
static __net_initdata struct pernet_operations rt_genid_ops = {
|
|
|
|
.init = rt_genid_init,
|
2008-07-06 04:02:59 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2010-02-16 16:20:26 +01:00
|
|
|
struct ip_rt_acct __percpu *ip_rt_acct __read_mostly;
|
2011-01-14 13:36:42 +01:00
|
|
|
#endif /* CONFIG_IP_ROUTE_CLASSID */
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
static __initdata unsigned long rhash_entries;
|
|
|
|
static int __init set_rhash_entries(char *str)
|
|
|
|
{
|
|
|
|
if (!str)
|
|
|
|
return 0;
|
|
|
|
rhash_entries = simple_strtoul(str, &str, 0);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
__setup("rhash_entries=", set_rhash_entries);
|
|
|
|
|
|
|
|
int __init ip_rt_init(void)
|
|
|
|
{
|
2005-07-05 23:58:19 +02:00
|
|
|
int rc = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-01-14 13:36:42 +01:00
|
|
|
#ifdef CONFIG_IP_ROUTE_CLASSID
|
2009-02-25 14:07:33 +01:00
|
|
|
ip_rt_acct = __alloc_percpu(256 * sizeof(struct ip_rt_acct), __alignof__(struct ip_rt_acct));
|
2005-04-17 00:20:36 +02:00
|
|
|
if (!ip_rt_acct)
|
|
|
|
panic("IP: failed to allocate ip_rt_acct\n");
|
|
|
|
#endif
|
|
|
|
|
2006-08-27 04:25:52 +02:00
|
|
|
ipv4_dst_ops.kmem_cachep =
|
|
|
|
kmem_cache_create("ip_dst_cache", sizeof(struct rtable), 0,
|
2007-07-20 03:11:58 +02:00
|
|
|
SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-05-25 03:17:54 +02:00
|
|
|
ipv4_dst_blackhole_ops.kmem_cachep = ipv4_dst_ops.kmem_cachep;
|
|
|
|
|
2010-10-08 08:37:34 +02:00
|
|
|
if (dst_entries_init(&ipv4_dst_ops) < 0)
|
|
|
|
panic("IP: failed to allocate ipv4_dst_ops counter\n");
|
|
|
|
|
|
|
|
if (dst_entries_init(&ipv4_dst_blackhole_ops) < 0)
|
|
|
|
panic("IP: failed to allocate ipv4_dst_blackhole_ops counter\n");
|
|
|
|
|
2005-07-05 23:58:19 +02:00
|
|
|
rt_hash_table = (struct rt_hash_bucket *)
|
|
|
|
alloc_large_system_hash("IP route cache",
|
|
|
|
sizeof(struct rt_hash_bucket),
|
|
|
|
rhash_entries,
|
2009-09-22 02:03:05 +02:00
|
|
|
(totalram_pages >= 128 * 1024) ?
|
[IPV4] tcp/route: Another look at hash table sizes
The tcp_ehash hash table gets too big on systems with really big memory.
It is worse on systems with pages larger than 4KB. It wastes memory that
could be better used. It also makes the netstat command slow because reading
/proc/net/tcp and /proc/net/tcp6 needs to go through the full hash table.
The default value should not be larger for larger page sizes. It seems
that the effect of page size is an unintended error dating back a long
time. I also wonder if the default value really should be a larger
fraction of memory for systems with more memory. While systems with
really big ram can afford more space for hash tables, it is not clear to
me that they benefit from increasing the allocation ratio for this table.
The amount of memory allocated is determined by net/ipv4/tcp.c:tcp_init and
mm/page_alloc.c:alloc_large_system_hash.
tcp_init calls alloc_large_system_hash passing parameters-
bucketsize=sizeof(struct tcp_ehash_bucket)
numentries=thash_entries
scale=(num_physpages >= 128 * 1024) ? (25-PAGE_SHIFT) : (27-PAGE_SHIFT)
limit=0
On i386, PAGE_SHIFT is 12 for a page size of 4K
On ia64, PAGE_SHIFT defaults to 14 for a page size of 16K
The num_physpages test above makes the allocation take a larger fraction
of the total memory on systems with larger memory. The threshold size
for a i386 system is 512MB. For an ia64 system with 16KB pages the
threshold is 2GB.
For smaller memory systems-
On i386, scale = (27 - 12) = 15
On ia64, scale = (27 - 14) = 13
For larger memory systems-
On i386, scale = (25 - 12) = 13
On ia64, scale = (25 - 14) = 11
For the rest of this discussion, I'll just track the larger memory case.
The default behavior has numentries=thash_entries=0, so the allocated
size is determined by either scale or by the default limit of 1/16 of
total memory.
In alloc_large_system_hash-
| numentries = (flags & HASH_HIGHMEM) ? nr_all_pages : nr_kernel_pages;
| numentries += (1UL << (20 - PAGE_SHIFT)) - 1;
| numentries >>= 20 - PAGE_SHIFT;
| numentries <<= 20 - PAGE_SHIFT;
At this point, numentries is pages for all of memory, rounded up to the
nearest megabyte boundary.
| /* limit to 1 bucket per 2^scale bytes of low memory */
| if (scale > PAGE_SHIFT)
| numentries >>= (scale - PAGE_SHIFT);
| else
| numentries <<= (PAGE_SHIFT - scale);
On i386, numentries >>= (13 - 12), so numentries is 1/8196 of
bytes of total memory.
On ia64, numentries <<= (14 - 11), so numentries is 1/2048 of
bytes of total memory.
| log2qty = long_log2(numentries);
|
| do {
| size = bucketsize << log2qty;
bucketsize is 16, so size is 16 times numentries, rounded
down to a power of two.
On i386, size is 1/512 of bytes of total memory.
On ia64, size is 1/128 of bytes of total memory.
For smaller systems the results are
On i386, size is 1/2048 of bytes of total memory.
On ia64, size is 1/512 of bytes of total memory.
The large page effect can be removed by just replacing
the use of PAGE_SHIFT with a constant of 12 in the calls to
alloc_large_system_hash. That makes them more like the other uses of
that function from fs/inode.c and fs/dcache.c
Signed-off-by: David S. Miller <davem@davemloft.net>
2005-11-30 01:12:55 +01:00
|
|
|
15 : 17,
|
2006-08-08 05:44:22 +02:00
|
|
|
0,
|
2005-07-05 23:58:19 +02:00
|
|
|
&rt_hash_log,
|
|
|
|
&rt_hash_mask,
|
2009-04-27 14:42:24 +02:00
|
|
|
rhash_entries ? 0 : 512 * 1024);
|
2005-07-05 23:55:24 +02:00
|
|
|
memset(rt_hash_table, 0, (rt_hash_mask + 1) * sizeof(struct rt_hash_bucket));
|
|
|
|
rt_hash_lock_init();
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
ipv4_dst_ops.gc_thresh = (rt_hash_mask + 1);
|
|
|
|
ip_rt_max_size = (rt_hash_mask + 1) * 16;
|
|
|
|
|
|
|
|
devinet_init();
|
|
|
|
ip_fib_init();
|
|
|
|
|
2008-02-29 05:51:18 +01:00
|
|
|
if (ip_rt_proc_init())
|
2007-12-06 06:14:28 +01:00
|
|
|
printk(KERN_ERR "Unable to create route proc files\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_XFRM
|
|
|
|
xfrm_init();
|
2009-07-31 03:52:15 +02:00
|
|
|
xfrm4_init(ip_rt_max_size);
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2011-06-10 03:27:09 +02:00
|
|
|
rtnl_register(PF_INET, RTM_GETROUTE, inet_rtm_getroute, NULL, NULL);
|
2007-03-22 19:55:17 +01:00
|
|
|
|
2008-07-06 04:02:33 +02:00
|
|
|
#ifdef CONFIG_SYSCTL
|
|
|
|
register_pernet_subsys(&sysctl_route_ops);
|
|
|
|
#endif
|
2010-05-08 10:57:52 +02:00
|
|
|
register_pernet_subsys(&rt_genid_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2008-07-30 12:32:52 +02:00
|
|
|
#ifdef CONFIG_SYSCTL
|
2008-07-27 09:59:33 +02:00
|
|
|
/*
|
|
|
|
* We really need to sanitize the damn ipv4 init order, then all
|
|
|
|
* this nonsense will go away.
|
|
|
|
*/
|
|
|
|
void __init ip_static_sysctl_init(void)
|
|
|
|
{
|
2008-08-26 00:17:44 +02:00
|
|
|
register_sysctl_paths(ipv4_path, ipv4_skeleton);
|
2008-07-27 09:59:33 +02:00
|
|
|
}
|
2008-07-30 12:32:52 +02:00
|
|
|
#endif
|