2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Linux INET6 implementation
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Pedro Roque <roque@di.fc.ul.pt>
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _IP6_FIB_H
|
|
|
|
#define _IP6_FIB_H
|
|
|
|
|
|
|
|
#include <linux/ipv6_route.h>
|
|
|
|
#include <linux/rtnetlink.h>
|
|
|
|
#include <linux/spinlock.h>
|
2006-08-22 14:01:08 +07:00
|
|
|
#include <net/dst.h>
|
|
|
|
#include <net/flow.h>
|
|
|
|
#include <net/netlink.h>
|
2010-12-01 03:27:11 +07:00
|
|
|
#include <net/inetpeer.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2009-07-31 08:52:15 +07:00
|
|
|
#ifdef CONFIG_IPV6_MULTIPLE_TABLES
|
|
|
|
#define FIB6_TABLE_HASHSZ 256
|
|
|
|
#else
|
|
|
|
#define FIB6_TABLE_HASHSZ 1
|
|
|
|
#endif
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
struct rt6_info;
|
|
|
|
|
2009-11-03 10:26:03 +07:00
|
|
|
struct fib6_config {
|
2006-08-22 14:01:08 +07:00
|
|
|
u32 fc_table;
|
|
|
|
u32 fc_metric;
|
|
|
|
int fc_dst_len;
|
|
|
|
int fc_src_len;
|
|
|
|
int fc_ifindex;
|
|
|
|
u32 fc_flags;
|
|
|
|
u32 fc_protocol;
|
2012-09-05 09:12:42 +07:00
|
|
|
u32 fc_type; /* only 8 bits are used */
|
2006-08-22 14:01:08 +07:00
|
|
|
|
|
|
|
struct in6_addr fc_dst;
|
|
|
|
struct in6_addr fc_src;
|
2011-04-14 04:10:57 +07:00
|
|
|
struct in6_addr fc_prefsrc;
|
2006-08-22 14:01:08 +07:00
|
|
|
struct in6_addr fc_gateway;
|
|
|
|
|
|
|
|
unsigned long fc_expires;
|
|
|
|
struct nlattr *fc_mx;
|
|
|
|
int fc_mx_len;
|
2012-10-22 10:42:09 +07:00
|
|
|
int fc_mp_len;
|
|
|
|
struct nlattr *fc_mp;
|
2006-08-22 14:01:08 +07:00
|
|
|
|
|
|
|
struct nl_info fc_nlinfo;
|
2015-07-21 15:43:48 +07:00
|
|
|
struct nlattr *fc_encap;
|
|
|
|
u16 fc_encap_type;
|
2006-08-22 14:01:08 +07:00
|
|
|
};
|
|
|
|
|
2009-11-03 10:26:03 +07:00
|
|
|
struct fib6_node {
|
2005-04-17 05:20:36 +07:00
|
|
|
struct fib6_node *parent;
|
|
|
|
struct fib6_node *left;
|
|
|
|
struct fib6_node *right;
|
2006-12-14 07:38:29 +07:00
|
|
|
#ifdef CONFIG_IPV6_SUBTREES
|
2005-04-17 05:20:36 +07:00
|
|
|
struct fib6_node *subtree;
|
2006-12-14 07:38:29 +07:00
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
struct rt6_info *leaf;
|
|
|
|
|
|
|
|
__u16 fn_bit; /* bit key */
|
|
|
|
__u16 fn_flags;
|
2014-10-07 00:58:35 +07:00
|
|
|
int fn_sernum;
|
[IPV6]: Fix routing round-robin locking.
As per RFC2461, section 6.3.6, item #2, when no routers on the
matching list are known to be reachable or probably reachable we
do round robin on those available routes so that we make sure
to probe as many of them as possible to detect when one becomes
reachable faster.
Each routing table has a rwlock protecting the tree and the linked
list of routes at each leaf. The round robin code executes during
lookup and thus with the rwlock taken as a reader. A small local
spinlock tries to provide protection but this does not work at all
for two reasons:
1) The round-robin list manipulation, as coded, goes like this (with
read lock held):
walk routes finding head and tail
spin_lock();
rotate list using head and tail
spin_unlock();
While one thread is rotating the list, another thread can
end up with stale values of head and tail and then proceed
to corrupt the list when it gets the lock. This ends up causing
the OOPS in fib6_add() later onthat many people have been hitting.
2) All the other code paths that run with the rwlock held as
a reader do not expect the list to change on them, they
expect it to remain completely fixed while they hold the
lock in that way.
So, simply stated, it is impossible to implement this correctly using
a manipulation of the list without violating the rwlock locking
semantics.
Reimplement using a per-fib6_node round-robin pointer. This way we
don't need to manipulate the list at all, and since the round-robin
pointer can only ever point to real existing entries we don't need
to perform any locking on the changing of the round-robin pointer
itself. We only need to reset the round-robin pointer to NULL when
the entry it is pointing to is removed.
The idea is from Thomas Graf and it is very similar to how this
was implemented before the advanced router selection code when in.
Signed-off-by: David S. Miller <davem@davemloft.net>
2007-03-25 10:36:25 +07:00
|
|
|
struct rt6_info *rr_ptr;
|
2005-04-17 05:20:36 +07:00
|
|
|
};
|
|
|
|
|
2006-08-24 07:22:24 +07:00
|
|
|
#ifndef CONFIG_IPV6_SUBTREES
|
|
|
|
#define FIB6_SUBTREE(fn) NULL
|
|
|
|
#else
|
|
|
|
#define FIB6_SUBTREE(fn) ((fn)->subtree)
|
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2015-01-06 05:57:44 +07:00
|
|
|
struct mx6_config {
|
|
|
|
const u32 *mx;
|
|
|
|
DECLARE_BITMAP(mx_valid, RTAX_MAX);
|
|
|
|
};
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* routing information
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2009-11-03 10:26:03 +07:00
|
|
|
struct rt6key {
|
2005-04-17 05:20:36 +07:00
|
|
|
struct in6_addr addr;
|
|
|
|
int plen;
|
|
|
|
};
|
|
|
|
|
2006-08-05 13:20:06 +07:00
|
|
|
struct fib6_table;
|
|
|
|
|
2009-11-03 10:26:03 +07:00
|
|
|
struct rt6_info {
|
2010-06-11 13:31:35 +07:00
|
|
|
struct dst_entry dst;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2010-04-01 05:24:22 +07:00
|
|
|
/*
|
|
|
|
* Tail elements of dst_entry (__refcnt etc.)
|
|
|
|
* and these elements (rarely used in hot path) are in
|
|
|
|
* the same cache line.
|
|
|
|
*/
|
|
|
|
struct fib6_table *rt6i_table;
|
2005-04-17 05:20:36 +07:00
|
|
|
struct fib6_node *rt6i_node;
|
|
|
|
|
|
|
|
struct in6_addr rt6i_gateway;
|
|
|
|
|
2012-10-22 10:42:09 +07:00
|
|
|
/* Multipath routes:
|
|
|
|
* siblings is a list of rt6_info that have the the same metric/weight,
|
|
|
|
* destination, but not the same gateway. nsiblings is just a cache
|
|
|
|
* to speed up lookup.
|
|
|
|
*/
|
|
|
|
struct list_head rt6i_siblings;
|
|
|
|
unsigned int rt6i_nsiblings;
|
|
|
|
|
2010-04-01 05:24:22 +07:00
|
|
|
atomic_t rt6i_ref;
|
2007-09-06 17:31:25 +07:00
|
|
|
|
2010-04-01 05:24:22 +07:00
|
|
|
/* These are in a separate cache line. */
|
|
|
|
struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
|
|
|
|
u32 rt6i_flags;
|
|
|
|
struct rt6key rt6i_src;
|
2011-04-14 04:10:57 +07:00
|
|
|
struct rt6key rt6i_prefsrc;
|
2007-11-14 12:33:32 +07:00
|
|
|
|
2015-05-23 10:56:04 +07:00
|
|
|
struct list_head rt6i_uncached;
|
|
|
|
struct uncached_list *rt6i_uncached_list;
|
|
|
|
|
2010-04-01 05:24:22 +07:00
|
|
|
struct inet6_dev *rt6i_idev;
|
2015-05-23 10:56:06 +07:00
|
|
|
struct rt6_info * __percpu *rt6i_pcpu;
|
2007-11-14 12:33:32 +07:00
|
|
|
|
2014-09-28 05:46:06 +07:00
|
|
|
u32 rt6i_metric;
|
ipv6: Stop rt6_info from using inet_peer's metrics
inet_peer is indexed by the dst address alone. However, the fib6 tree
could have multiple routing entries (rt6_info) for the same dst. For
example,
1. A /128 dst via multiple gateways.
2. A RTF_CACHE route cloned from a /128 route.
In the above cases, all of them will share the same metrics and
step on each other.
This patch will steer away from inet_peer's metrics and use
dst_cow_metrics_generic() for everything.
Change Highlights:
1. Remove rt6_cow_metrics() which currently acquires metrics from
inet_peer for DST_HOST route (i.e. /128 route).
2. Add rt6i_pmtu to take care of the pmtu update to avoid creating a
full size metrics just to override the RTAX_MTU.
3. After (2), the RTF_CACHE route can also share the metrics with its
dst.from route, by:
dst_init_metrics(&cache_rt->dst, dst_metrics_ptr(cache_rt->dst.from), true);
4. Stop creating RTF_CACHE route by cloning another RTF_CACHE route. Instead,
directly clone from rt->dst.
[ Currently, cloning from another RTF_CACHE is only possible during
rt6_do_redirect(). Also, the old clone is removed from the tree
immediately after the new clone is added. ]
In case of cloning from an older redirect RTF_CACHE, it should work as
before.
In case of cloning from an older pmtu RTF_CACHE, this patch will forget
the pmtu and re-learn it (if there is any) from the redirected route.
The _rt6i_peer and DST_METRICS_FORCE_OVERWRITE will be removed
in the next cleanup patch.
Signed-off-by: Martin KaFai Lau <kafai@fb.com>
Reviewed-by: Hannes Frederic Sowa <hannes@stressinduktion.org>
Cc: Steffen Klassert <steffen.klassert@secunet.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-04-29 03:03:06 +07:00
|
|
|
u32 rt6i_pmtu;
|
2010-04-01 05:24:22 +07:00
|
|
|
/* more non-fragment space at head required */
|
|
|
|
unsigned short rt6i_nfheader_len;
|
|
|
|
u8 rt6i_protocol;
|
2005-04-17 05:20:36 +07:00
|
|
|
};
|
|
|
|
|
2006-10-13 14:17:25 +07:00
|
|
|
static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
|
|
|
|
{
|
|
|
|
return ((struct rt6_info *)dst)->rt6i_idev;
|
|
|
|
}
|
|
|
|
|
2012-04-06 07:13:10 +07:00
|
|
|
static inline void rt6_clean_expires(struct rt6_info *rt)
|
|
|
|
{
|
|
|
|
rt->rt6i_flags &= ~RTF_EXPIRES;
|
2013-10-24 15:14:27 +07:00
|
|
|
rt->dst.expires = 0;
|
2012-04-06 07:13:10 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
|
|
|
|
{
|
|
|
|
rt->dst.expires = expires;
|
ipv6: fix race condition regarding dst->expires and dst->from.
Eric Dumazet wrote:
| Some strange crashes happen in rt6_check_expired(), with access
| to random addresses.
|
| At first glance, it looks like the RTF_EXPIRES and
| stuff added in commit 1716a96101c49186b
| (ipv6: fix problem with expired dst cache)
| are racy : same dst could be manipulated at the same time
| on different cpus.
|
| At some point, our stack believes rt->dst.from contains a dst pointer,
| while its really a jiffie value (as rt->dst.expires shares the same area
| of memory)
|
| rt6_update_expires() should be fixed, or am I missing something ?
|
| CC Neil because of https://bugzilla.redhat.com/show_bug.cgi?id=892060
Because we do not have any locks for dst_entry, we cannot change
essential structure in the entry; e.g., we cannot change reference
to other entity.
To fix this issue, split 'from' and 'expires' field in dst_entry
out of union. Once it is 'from' is assigned in the constructor,
keep the reference until the very last stage of the life time of
the object.
Of course, it is unsafe to change 'from', so make rt6_set_from simple
just for fresh entries.
Reported-by: Eric Dumazet <eric.dumazet@gmail.com>
Reported-by: Neil Horman <nhorman@tuxdriver.com>
CC: Gao Feng <gaofeng@cn.fujitsu.com>
Signed-off-by: YOSHIFUJI Hideaki <yoshfuji@linux-ipv6.org>
Reviewed-by: Eric Dumazet <edumazet@google.com>
Reported-by: Steinar H. Gunderson <sesse@google.com>
Reviewed-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2013-02-20 07:29:08 +07:00
|
|
|
rt->rt6i_flags |= RTF_EXPIRES;
|
2012-04-06 07:13:10 +07:00
|
|
|
}
|
|
|
|
|
ipv6: fix race condition regarding dst->expires and dst->from.
Eric Dumazet wrote:
| Some strange crashes happen in rt6_check_expired(), with access
| to random addresses.
|
| At first glance, it looks like the RTF_EXPIRES and
| stuff added in commit 1716a96101c49186b
| (ipv6: fix problem with expired dst cache)
| are racy : same dst could be manipulated at the same time
| on different cpus.
|
| At some point, our stack believes rt->dst.from contains a dst pointer,
| while its really a jiffie value (as rt->dst.expires shares the same area
| of memory)
|
| rt6_update_expires() should be fixed, or am I missing something ?
|
| CC Neil because of https://bugzilla.redhat.com/show_bug.cgi?id=892060
Because we do not have any locks for dst_entry, we cannot change
essential structure in the entry; e.g., we cannot change reference
to other entity.
To fix this issue, split 'from' and 'expires' field in dst_entry
out of union. Once it is 'from' is assigned in the constructor,
keep the reference until the very last stage of the life time of
the object.
Of course, it is unsafe to change 'from', so make rt6_set_from simple
just for fresh entries.
Reported-by: Eric Dumazet <eric.dumazet@gmail.com>
Reported-by: Neil Horman <nhorman@tuxdriver.com>
CC: Gao Feng <gaofeng@cn.fujitsu.com>
Signed-off-by: YOSHIFUJI Hideaki <yoshfuji@linux-ipv6.org>
Reviewed-by: Eric Dumazet <edumazet@google.com>
Reported-by: Steinar H. Gunderson <sesse@google.com>
Reviewed-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2013-02-20 07:29:08 +07:00
|
|
|
static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
|
2012-04-06 07:13:10 +07:00
|
|
|
{
|
ipv6: fix race condition regarding dst->expires and dst->from.
Eric Dumazet wrote:
| Some strange crashes happen in rt6_check_expired(), with access
| to random addresses.
|
| At first glance, it looks like the RTF_EXPIRES and
| stuff added in commit 1716a96101c49186b
| (ipv6: fix problem with expired dst cache)
| are racy : same dst could be manipulated at the same time
| on different cpus.
|
| At some point, our stack believes rt->dst.from contains a dst pointer,
| while its really a jiffie value (as rt->dst.expires shares the same area
| of memory)
|
| rt6_update_expires() should be fixed, or am I missing something ?
|
| CC Neil because of https://bugzilla.redhat.com/show_bug.cgi?id=892060
Because we do not have any locks for dst_entry, we cannot change
essential structure in the entry; e.g., we cannot change reference
to other entity.
To fix this issue, split 'from' and 'expires' field in dst_entry
out of union. Once it is 'from' is assigned in the constructor,
keep the reference until the very last stage of the life time of
the object.
Of course, it is unsafe to change 'from', so make rt6_set_from simple
just for fresh entries.
Reported-by: Eric Dumazet <eric.dumazet@gmail.com>
Reported-by: Neil Horman <nhorman@tuxdriver.com>
CC: Gao Feng <gaofeng@cn.fujitsu.com>
Signed-off-by: YOSHIFUJI Hideaki <yoshfuji@linux-ipv6.org>
Reviewed-by: Eric Dumazet <edumazet@google.com>
Reported-by: Steinar H. Gunderson <sesse@google.com>
Reviewed-by: Neil Horman <nhorman@tuxdriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2013-02-20 07:29:08 +07:00
|
|
|
struct rt6_info *rt;
|
|
|
|
|
|
|
|
for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
|
|
|
|
rt = (struct rt6_info *)rt->dst.from);
|
|
|
|
if (rt && rt != rt0)
|
|
|
|
rt0->dst.expires = rt->dst.expires;
|
|
|
|
|
|
|
|
dst_set_expires(&rt0->dst, timeout);
|
|
|
|
rt0->rt6i_flags |= RTF_EXPIRES;
|
2012-04-06 07:13:10 +07:00
|
|
|
}
|
2015-05-23 10:56:01 +07:00
|
|
|
|
|
|
|
static inline u32 rt6_get_cookie(const struct rt6_info *rt)
|
|
|
|
{
|
2015-11-12 02:51:08 +07:00
|
|
|
if (rt->rt6i_flags & RTF_PCPU ||
|
|
|
|
(unlikely(rt->dst.flags & DST_NOCACHE) && rt->dst.from))
|
2015-05-23 10:56:03 +07:00
|
|
|
rt = (struct rt6_info *)(rt->dst.from);
|
|
|
|
|
2015-05-23 10:56:01 +07:00
|
|
|
return rt->rt6i_node ? rt->rt6i_node->fn_sernum : 0;
|
|
|
|
}
|
2012-04-06 07:13:10 +07:00
|
|
|
|
2012-10-29 07:13:19 +07:00
|
|
|
static inline void ip6_rt_put(struct rt6_info *rt)
|
|
|
|
{
|
|
|
|
/* dst_release() accepts a NULL parameter.
|
|
|
|
* We rely on dst being first structure in struct rt6_info
|
|
|
|
*/
|
|
|
|
BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
|
|
|
|
dst_release(&rt->dst);
|
|
|
|
}
|
|
|
|
|
2014-10-07 00:58:34 +07:00
|
|
|
enum fib6_walk_state {
|
|
|
|
#ifdef CONFIG_IPV6_SUBTREES
|
|
|
|
FWS_S,
|
|
|
|
#endif
|
|
|
|
FWS_L,
|
|
|
|
FWS_R,
|
|
|
|
FWS_C,
|
|
|
|
FWS_U
|
|
|
|
};
|
|
|
|
|
|
|
|
struct fib6_walker {
|
2010-02-18 15:13:30 +07:00
|
|
|
struct list_head lh;
|
2005-04-17 05:20:36 +07:00
|
|
|
struct fib6_node *root, *node;
|
|
|
|
struct rt6_info *leaf;
|
2014-10-07 00:58:34 +07:00
|
|
|
enum fib6_walk_state state;
|
|
|
|
bool prune;
|
2010-02-08 12:19:03 +07:00
|
|
|
unsigned int skip;
|
|
|
|
unsigned int count;
|
2014-10-07 00:58:34 +07:00
|
|
|
int (*func)(struct fib6_walker *);
|
2005-04-17 05:20:36 +07:00
|
|
|
void *args;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct rt6_statistics {
|
|
|
|
__u32 fib_nodes;
|
|
|
|
__u32 fib_route_nodes;
|
|
|
|
__u32 fib_rt_alloc; /* permanent routes */
|
|
|
|
__u32 fib_rt_entries; /* rt entries in table */
|
|
|
|
__u32 fib_rt_cache; /* cache routes */
|
|
|
|
__u32 fib_discarded_routes;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define RTN_TL_ROOT 0x0001
|
|
|
|
#define RTN_ROOT 0x0002 /* tree root node */
|
|
|
|
#define RTN_RTINFO 0x0004 /* node with valid routing info */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* priority levels (or metrics)
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2006-08-05 13:20:06 +07:00
|
|
|
struct fib6_table {
|
|
|
|
struct hlist_node tb6_hlist;
|
|
|
|
u32 tb6_id;
|
|
|
|
rwlock_t tb6_lock;
|
|
|
|
struct fib6_node tb6_root;
|
2012-06-11 14:01:52 +07:00
|
|
|
struct inet_peer_base tb6_peers;
|
2016-10-25 00:52:35 +07:00
|
|
|
unsigned int flags;
|
|
|
|
#define RT6_TABLE_HAS_DFLT_ROUTER BIT(0)
|
2006-08-05 13:20:06 +07:00
|
|
|
};
|
|
|
|
|
|
|
|
#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
|
|
|
|
#define RT6_TABLE_MAIN RT_TABLE_MAIN
|
|
|
|
#define RT6_TABLE_DFLT RT6_TABLE_MAIN
|
|
|
|
#define RT6_TABLE_INFO RT6_TABLE_MAIN
|
|
|
|
#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
|
|
|
|
|
|
|
|
#ifdef CONFIG_IPV6_MULTIPLE_TABLES
|
|
|
|
#define FIB6_TABLE_MIN 1
|
|
|
|
#define FIB6_TABLE_MAX RT_TABLE_MAX
|
2006-08-04 17:39:02 +07:00
|
|
|
#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
|
2006-08-05 13:20:06 +07:00
|
|
|
#else
|
|
|
|
#define FIB6_TABLE_MIN RT_TABLE_MAIN
|
|
|
|
#define FIB6_TABLE_MAX FIB6_TABLE_MIN
|
2006-08-04 17:39:02 +07:00
|
|
|
#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
|
2006-08-05 13:20:06 +07:00
|
|
|
#endif
|
|
|
|
|
2008-03-05 04:48:30 +07:00
|
|
|
typedef struct rt6_info *(*pol_lookup_t)(struct net *,
|
|
|
|
struct fib6_table *,
|
2011-03-13 04:22:43 +07:00
|
|
|
struct flowi6 *, int);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* exported functions
|
|
|
|
*/
|
|
|
|
|
2013-09-22 00:22:42 +07:00
|
|
|
struct fib6_table *fib6_get_table(struct net *net, u32 id);
|
|
|
|
struct fib6_table *fib6_new_table(struct net *net, u32 id);
|
|
|
|
struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
|
|
|
|
int flags, pol_lookup_t lookup);
|
2006-08-05 13:20:06 +07:00
|
|
|
|
2013-09-22 00:22:42 +07:00
|
|
|
struct fib6_node *fib6_lookup(struct fib6_node *root,
|
|
|
|
const struct in6_addr *daddr,
|
|
|
|
const struct in6_addr *saddr);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2013-09-22 00:22:42 +07:00
|
|
|
struct fib6_node *fib6_locate(struct fib6_node *root,
|
|
|
|
const struct in6_addr *daddr, int dst_len,
|
|
|
|
const struct in6_addr *saddr, int src_len);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2013-09-22 00:22:42 +07:00
|
|
|
void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
|
2013-12-27 15:32:38 +07:00
|
|
|
void *arg);
|
2006-08-05 13:20:06 +07:00
|
|
|
|
2015-01-06 05:57:44 +07:00
|
|
|
int fib6_add(struct fib6_node *root, struct rt6_info *rt,
|
|
|
|
struct nl_info *info, struct mx6_config *mxc);
|
2013-09-22 00:22:42 +07:00
|
|
|
int fib6_del(struct rt6_info *rt, struct nl_info *info);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2015-09-14 00:18:33 +07:00
|
|
|
void inet6_rt_notify(int event, struct rt6_info *rt, struct nl_info *info,
|
|
|
|
unsigned int flags);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2013-09-22 00:22:42 +07:00
|
|
|
void fib6_run_gc(unsigned long expires, struct net *net, bool force);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2013-09-22 00:22:42 +07:00
|
|
|
void fib6_gc_cleanup(void);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2013-09-22 00:22:42 +07:00
|
|
|
int fib6_init(void);
|
2006-08-04 17:39:02 +07:00
|
|
|
|
2013-09-21 21:55:59 +07:00
|
|
|
int ipv6_route_open(struct inode *inode, struct file *file);
|
|
|
|
|
2007-12-08 15:14:54 +07:00
|
|
|
#ifdef CONFIG_IPV6_MULTIPLE_TABLES
|
2013-09-22 00:22:42 +07:00
|
|
|
int fib6_rules_init(void);
|
|
|
|
void fib6_rules_cleanup(void);
|
2007-12-08 15:14:54 +07:00
|
|
|
#else
|
|
|
|
static inline int fib6_rules_init(void)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
static inline void fib6_rules_cleanup(void)
|
|
|
|
{
|
|
|
|
return ;
|
|
|
|
}
|
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif
|