2 * Linux INET6 implementation
5 * Pedro Roque <roque@di.fc.ul.pt>
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
16 #include <linux/ipv6_route.h>
17 #include <linux/rtnetlink.h>
18 #include <linux/spinlock.h>
21 #include <net/netlink.h>
22 #include <net/inetpeer.h>
24 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
25 #define FIB6_TABLE_HASHSZ 256
27 #define FIB6_TABLE_HASHSZ 1
40 u32 fc_type; /* only 8 bits are used */
42 struct in6_addr fc_dst;
43 struct in6_addr fc_src;
44 struct in6_addr fc_prefsrc;
45 struct in6_addr fc_gateway;
47 unsigned long fc_expires;
53 struct nl_info fc_nlinfo;
54 struct nlattr *fc_encap;
59 struct fib6_node *parent;
60 struct fib6_node *left;
61 struct fib6_node *right;
62 #ifdef CONFIG_IPV6_SUBTREES
63 struct fib6_node *subtree;
65 struct rt6_info *leaf;
67 __u16 fn_bit; /* bit key */
70 struct rt6_info *rr_ptr;
73 #ifndef CONFIG_IPV6_SUBTREES
74 #define FIB6_SUBTREE(fn) NULL
76 #define FIB6_SUBTREE(fn) ((fn)->subtree)
81 DECLARE_BITMAP(mx_valid, RTAX_MAX);
100 * Tail elements of dst_entry (__refcnt etc.)
101 * and these elements (rarely used in hot path) are in
102 * the same cache line.
104 struct fib6_table *rt6i_table;
105 struct fib6_node *rt6i_node;
107 struct in6_addr rt6i_gateway;
110 * siblings is a list of rt6_info that have the the same metric/weight,
111 * destination, but not the same gateway. nsiblings is just a cache
112 * to speed up lookup.
114 struct list_head rt6i_siblings;
115 unsigned int rt6i_nsiblings;
119 /* These are in a separate cache line. */
120 struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
122 struct rt6key rt6i_src;
123 struct rt6key rt6i_prefsrc;
125 struct list_head rt6i_uncached;
126 struct uncached_list *rt6i_uncached_list;
128 struct inet6_dev *rt6i_idev;
129 struct rt6_info * __percpu *rt6i_pcpu;
133 /* more non-fragment space at head required */
134 unsigned short rt6i_nfheader_len;
138 static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
140 return ((struct rt6_info *)dst)->rt6i_idev;
143 static inline void rt6_clean_expires(struct rt6_info *rt)
145 rt->rt6i_flags &= ~RTF_EXPIRES;
149 static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
151 rt->dst.expires = expires;
152 rt->rt6i_flags |= RTF_EXPIRES;
155 static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
159 for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
160 rt = (struct rt6_info *)rt->dst.from);
162 rt0->dst.expires = rt->dst.expires;
164 dst_set_expires(&rt0->dst, timeout);
165 rt0->rt6i_flags |= RTF_EXPIRES;
168 static inline u32 rt6_get_cookie(const struct rt6_info *rt)
170 if (rt->rt6i_flags & RTF_PCPU || unlikely(rt->dst.flags & DST_NOCACHE))
171 rt = (struct rt6_info *)(rt->dst.from);
173 return rt->rt6i_node ? rt->rt6i_node->fn_sernum : 0;
176 static inline void ip6_rt_put(struct rt6_info *rt)
178 /* dst_release() accepts a NULL parameter.
179 * We rely on dst being first structure in struct rt6_info
181 BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
182 dst_release(&rt->dst);
185 enum fib6_walk_state {
186 #ifdef CONFIG_IPV6_SUBTREES
197 struct fib6_node *root, *node;
198 struct rt6_info *leaf;
199 enum fib6_walk_state state;
203 int (*func)(struct fib6_walker *);
207 struct rt6_statistics {
209 __u32 fib_route_nodes;
210 __u32 fib_rt_alloc; /* permanent routes */
211 __u32 fib_rt_entries; /* rt entries in table */
212 __u32 fib_rt_cache; /* cache routes */
213 __u32 fib_discarded_routes;
216 #define RTN_TL_ROOT 0x0001
217 #define RTN_ROOT 0x0002 /* tree root node */
218 #define RTN_RTINFO 0x0004 /* node with valid routing info */
221 * priority levels (or metrics)
227 struct hlist_node tb6_hlist;
230 struct fib6_node tb6_root;
231 struct inet_peer_base tb6_peers;
234 #define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
235 #define RT6_TABLE_MAIN RT_TABLE_MAIN
236 #define RT6_TABLE_DFLT RT6_TABLE_MAIN
237 #define RT6_TABLE_INFO RT6_TABLE_MAIN
238 #define RT6_TABLE_PREFIX RT6_TABLE_MAIN
240 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
241 #define FIB6_TABLE_MIN 1
242 #define FIB6_TABLE_MAX RT_TABLE_MAX
243 #define RT6_TABLE_LOCAL RT_TABLE_LOCAL
245 #define FIB6_TABLE_MIN RT_TABLE_MAIN
246 #define FIB6_TABLE_MAX FIB6_TABLE_MIN
247 #define RT6_TABLE_LOCAL RT6_TABLE_MAIN
250 typedef struct rt6_info *(*pol_lookup_t)(struct net *,
252 struct flowi6 *, int);
258 struct fib6_table *fib6_get_table(struct net *net, u32 id);
259 struct fib6_table *fib6_new_table(struct net *net, u32 id);
260 struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
261 int flags, pol_lookup_t lookup);
263 struct fib6_node *fib6_lookup(struct fib6_node *root,
264 const struct in6_addr *daddr,
265 const struct in6_addr *saddr);
267 struct fib6_node *fib6_locate(struct fib6_node *root,
268 const struct in6_addr *daddr, int dst_len,
269 const struct in6_addr *saddr, int src_len);
271 void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
274 int fib6_add(struct fib6_node *root, struct rt6_info *rt,
275 struct nl_info *info, struct mx6_config *mxc);
276 int fib6_del(struct rt6_info *rt, struct nl_info *info);
278 void inet6_rt_notify(int event, struct rt6_info *rt, struct nl_info *info);
280 void fib6_run_gc(unsigned long expires, struct net *net, bool force);
282 void fib6_gc_cleanup(void);
286 int ipv6_route_open(struct inode *inode, struct file *file);
288 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
289 int fib6_rules_init(void);
290 void fib6_rules_cleanup(void);
292 static inline int fib6_rules_init(void)
296 static inline void fib6_rules_cleanup(void)