2 * Linux INET6 implementation
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
41 struct in6_addr fc_dst;
42 struct in6_addr fc_src;
43 struct in6_addr fc_prefsrc;
44 struct in6_addr fc_gateway;
46 unsigned long fc_expires;
50 struct nl_info fc_nlinfo;
54 struct fib6_node *parent;
55 struct fib6_node *left;
56 struct fib6_node *right;
57 #ifdef CONFIG_IPV6_SUBTREES
58 struct fib6_node *subtree;
60 struct rt6_info *leaf;
62 __u16 fn_bit; /* bit key */
65 struct rt6_info *rr_ptr;
68 #ifndef CONFIG_IPV6_SUBTREES
69 #define FIB6_SUBTREE(fn) NULL
71 #define FIB6_SUBTREE(fn) ((fn)->subtree)
92 * Tail elements of dst_entry (__refcnt etc.)
93 * and these elements (rarely used in hot path) are in
94 * the same cache line.
96 struct fib6_table *rt6i_table;
97 struct fib6_node *rt6i_node;
99 struct in6_addr rt6i_gateway;
103 /* These are in a separate cache line. */
104 struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
106 struct rt6key rt6i_src;
107 struct rt6key rt6i_prefsrc;
111 struct inet6_dev *rt6i_idev;
112 unsigned long _rt6i_peer;
115 u32 rt6i_flow_cache_genid;
117 /* more non-fragment space at head required */
118 unsigned short rt6i_nfheader_len;
123 static inline struct inet_peer *rt6_peer_ptr(struct rt6_info *rt)
125 return inetpeer_ptr(rt->_rt6i_peer);
128 static inline bool rt6_has_peer(struct rt6_info *rt)
130 return inetpeer_ptr_is_peer(rt->_rt6i_peer);
133 static inline void __rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
135 __inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
138 static inline bool rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
140 return inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
143 static inline void rt6_init_peer(struct rt6_info *rt, struct inet_peer_base *base)
145 inetpeer_init_ptr(&rt->_rt6i_peer, base);
148 static inline void rt6_transfer_peer(struct rt6_info *rt, struct rt6_info *ort)
150 inetpeer_transfer_peer(&rt->_rt6i_peer, &ort->_rt6i_peer);
153 static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
155 return ((struct rt6_info *)dst)->rt6i_idev;
158 static inline void rt6_clean_expires(struct rt6_info *rt)
160 if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from)
161 dst_release(rt->dst.from);
163 rt->rt6i_flags &= ~RTF_EXPIRES;
167 static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
169 if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from)
170 dst_release(rt->dst.from);
172 rt->rt6i_flags |= RTF_EXPIRES;
173 rt->dst.expires = expires;
176 static inline void rt6_update_expires(struct rt6_info *rt, int timeout)
178 if (!(rt->rt6i_flags & RTF_EXPIRES)) {
180 dst_release(rt->dst.from);
181 /* dst_set_expires relies on expires == 0
182 * if it has not been set previously.
187 dst_set_expires(&rt->dst, timeout);
188 rt->rt6i_flags |= RTF_EXPIRES;
191 static inline void rt6_set_from(struct rt6_info *rt, struct rt6_info *from)
193 struct dst_entry *new = (struct dst_entry *) from;
195 if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from) {
196 if (new == rt->dst.from)
198 dst_release(rt->dst.from);
201 rt->rt6i_flags &= ~RTF_EXPIRES;
206 struct fib6_walker_t {
208 struct fib6_node *root, *node;
209 struct rt6_info *leaf;
214 int (*func)(struct fib6_walker_t *);
218 struct rt6_statistics {
220 __u32 fib_route_nodes;
221 __u32 fib_rt_alloc; /* permanent routes */
222 __u32 fib_rt_entries; /* rt entries in table */
223 __u32 fib_rt_cache; /* cache routes */
224 __u32 fib_discarded_routes;
227 #define RTN_TL_ROOT 0x0001
228 #define RTN_ROOT 0x0002 /* tree root node */
229 #define RTN_RTINFO 0x0004 /* node with valid routing info */
232 * priority levels (or metrics)
238 struct hlist_node tb6_hlist;
241 struct fib6_node tb6_root;
242 struct inet_peer_base tb6_peers;
245 #define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
246 #define RT6_TABLE_MAIN RT_TABLE_MAIN
247 #define RT6_TABLE_DFLT RT6_TABLE_MAIN
248 #define RT6_TABLE_INFO RT6_TABLE_MAIN
249 #define RT6_TABLE_PREFIX RT6_TABLE_MAIN
251 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
252 #define FIB6_TABLE_MIN 1
253 #define FIB6_TABLE_MAX RT_TABLE_MAX
254 #define RT6_TABLE_LOCAL RT_TABLE_LOCAL
256 #define FIB6_TABLE_MIN RT_TABLE_MAIN
257 #define FIB6_TABLE_MAX FIB6_TABLE_MIN
258 #define RT6_TABLE_LOCAL RT6_TABLE_MAIN
261 typedef struct rt6_info *(*pol_lookup_t)(struct net *,
263 struct flowi6 *, int);
269 extern struct fib6_table *fib6_get_table(struct net *net, u32 id);
270 extern struct fib6_table *fib6_new_table(struct net *net, u32 id);
271 extern struct dst_entry *fib6_rule_lookup(struct net *net,
272 struct flowi6 *fl6, int flags,
273 pol_lookup_t lookup);
275 extern struct fib6_node *fib6_lookup(struct fib6_node *root,
276 const struct in6_addr *daddr,
277 const struct in6_addr *saddr);
279 struct fib6_node *fib6_locate(struct fib6_node *root,
280 const struct in6_addr *daddr, int dst_len,
281 const struct in6_addr *saddr, int src_len);
283 extern void fib6_clean_all_ro(struct net *net,
284 int (*func)(struct rt6_info *, void *arg),
285 int prune, void *arg);
287 extern void fib6_clean_all(struct net *net,
288 int (*func)(struct rt6_info *, void *arg),
289 int prune, void *arg);
291 extern int fib6_add(struct fib6_node *root,
293 struct nl_info *info);
295 extern int fib6_del(struct rt6_info *rt,
296 struct nl_info *info);
298 extern void inet6_rt_notify(int event, struct rt6_info *rt,
299 struct nl_info *info);
301 extern void fib6_run_gc(unsigned long expires,
304 extern void fib6_gc_cleanup(void);
306 extern int fib6_init(void);
308 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
309 extern int fib6_rules_init(void);
310 extern void fib6_rules_cleanup(void);
312 static inline int fib6_rules_init(void)
316 static inline void fib6_rules_cleanup(void)