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
;
57 struct fib6_node
*parent
;
58 struct fib6_node
*left
;
59 struct fib6_node
*right
;
60 #ifdef CONFIG_IPV6_SUBTREES
61 struct fib6_node
*subtree
;
63 struct rt6_info
*leaf
;
65 __u16 fn_bit
; /* bit key */
68 struct rt6_info
*rr_ptr
;
71 #ifndef CONFIG_IPV6_SUBTREES
72 #define FIB6_SUBTREE(fn) NULL
74 #define FIB6_SUBTREE(fn) ((fn)->subtree)
79 DECLARE_BITMAP(mx_valid
, RTAX_MAX
);
98 * Tail elements of dst_entry (__refcnt etc.)
99 * and these elements (rarely used in hot path) are in
100 * the same cache line.
102 struct fib6_table
*rt6i_table
;
103 struct fib6_node
*rt6i_node
;
105 struct in6_addr rt6i_gateway
;
108 * siblings is a list of rt6_info that have the the same metric/weight,
109 * destination, but not the same gateway. nsiblings is just a cache
110 * to speed up lookup.
112 struct list_head rt6i_siblings
;
113 unsigned int rt6i_nsiblings
;
117 /* These are in a separate cache line. */
118 struct rt6key rt6i_dst ____cacheline_aligned_in_smp
;
120 struct rt6key rt6i_src
;
121 struct rt6key rt6i_prefsrc
;
123 struct inet6_dev
*rt6i_idev
;
124 unsigned long _rt6i_peer
;
128 /* more non-fragment space at head required */
129 unsigned short rt6i_nfheader_len
;
133 static inline struct inet_peer
*rt6_peer_ptr(struct rt6_info
*rt
)
135 return inetpeer_ptr(rt
->_rt6i_peer
);
138 static inline bool rt6_has_peer(struct rt6_info
*rt
)
140 return inetpeer_ptr_is_peer(rt
->_rt6i_peer
);
143 static inline void __rt6_set_peer(struct rt6_info
*rt
, struct inet_peer
*peer
)
145 __inetpeer_ptr_set_peer(&rt
->_rt6i_peer
, peer
);
148 static inline bool rt6_set_peer(struct rt6_info
*rt
, struct inet_peer
*peer
)
150 return inetpeer_ptr_set_peer(&rt
->_rt6i_peer
, peer
);
153 static inline void rt6_init_peer(struct rt6_info
*rt
, struct inet_peer_base
*base
)
155 inetpeer_init_ptr(&rt
->_rt6i_peer
, base
);
158 static inline void rt6_transfer_peer(struct rt6_info
*rt
, struct rt6_info
*ort
)
160 inetpeer_transfer_peer(&rt
->_rt6i_peer
, &ort
->_rt6i_peer
);
163 static inline struct inet6_dev
*ip6_dst_idev(struct dst_entry
*dst
)
165 return ((struct rt6_info
*)dst
)->rt6i_idev
;
168 static inline void rt6_clean_expires(struct rt6_info
*rt
)
170 rt
->rt6i_flags
&= ~RTF_EXPIRES
;
174 static inline void rt6_set_expires(struct rt6_info
*rt
, unsigned long expires
)
176 rt
->dst
.expires
= expires
;
177 rt
->rt6i_flags
|= RTF_EXPIRES
;
180 static inline void rt6_update_expires(struct rt6_info
*rt0
, int timeout
)
184 for (rt
= rt0
; rt
&& !(rt
->rt6i_flags
& RTF_EXPIRES
);
185 rt
= (struct rt6_info
*)rt
->dst
.from
);
187 rt0
->dst
.expires
= rt
->dst
.expires
;
189 dst_set_expires(&rt0
->dst
, timeout
);
190 rt0
->rt6i_flags
|= RTF_EXPIRES
;
193 static inline void ip6_rt_put(struct rt6_info
*rt
)
195 /* dst_release() accepts a NULL parameter.
196 * We rely on dst being first structure in struct rt6_info
198 BUILD_BUG_ON(offsetof(struct rt6_info
, dst
) != 0);
199 dst_release(&rt
->dst
);
202 enum fib6_walk_state
{
203 #ifdef CONFIG_IPV6_SUBTREES
214 struct fib6_node
*root
, *node
;
215 struct rt6_info
*leaf
;
216 enum fib6_walk_state state
;
220 int (*func
)(struct fib6_walker
*);
224 struct rt6_statistics
{
226 __u32 fib_route_nodes
;
227 __u32 fib_rt_alloc
; /* permanent routes */
228 __u32 fib_rt_entries
; /* rt entries in table */
229 __u32 fib_rt_cache
; /* cache routes */
230 __u32 fib_discarded_routes
;
233 #define RTN_TL_ROOT 0x0001
234 #define RTN_ROOT 0x0002 /* tree root node */
235 #define RTN_RTINFO 0x0004 /* node with valid routing info */
238 * priority levels (or metrics)
244 struct hlist_node tb6_hlist
;
247 struct fib6_node tb6_root
;
248 struct inet_peer_base tb6_peers
;
251 #define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
252 #define RT6_TABLE_MAIN RT_TABLE_MAIN
253 #define RT6_TABLE_DFLT RT6_TABLE_MAIN
254 #define RT6_TABLE_INFO RT6_TABLE_MAIN
255 #define RT6_TABLE_PREFIX RT6_TABLE_MAIN
257 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
258 #define FIB6_TABLE_MIN 1
259 #define FIB6_TABLE_MAX RT_TABLE_MAX
260 #define RT6_TABLE_LOCAL RT_TABLE_LOCAL
262 #define FIB6_TABLE_MIN RT_TABLE_MAIN
263 #define FIB6_TABLE_MAX FIB6_TABLE_MIN
264 #define RT6_TABLE_LOCAL RT6_TABLE_MAIN
267 typedef struct rt6_info
*(*pol_lookup_t
)(struct net
*,
269 struct flowi6
*, int);
275 struct fib6_table
*fib6_get_table(struct net
*net
, u32 id
);
276 struct fib6_table
*fib6_new_table(struct net
*net
, u32 id
);
277 struct dst_entry
*fib6_rule_lookup(struct net
*net
, struct flowi6
*fl6
,
278 int flags
, pol_lookup_t lookup
);
280 struct fib6_node
*fib6_lookup(struct fib6_node
*root
,
281 const struct in6_addr
*daddr
,
282 const struct in6_addr
*saddr
);
284 struct fib6_node
*fib6_locate(struct fib6_node
*root
,
285 const struct in6_addr
*daddr
, int dst_len
,
286 const struct in6_addr
*saddr
, int src_len
);
288 void fib6_clean_all(struct net
*net
, int (*func
)(struct rt6_info
*, void *arg
),
291 int fib6_add(struct fib6_node
*root
, struct rt6_info
*rt
,
292 struct nl_info
*info
, struct mx6_config
*mxc
);
293 int fib6_del(struct rt6_info
*rt
, struct nl_info
*info
);
295 void inet6_rt_notify(int event
, struct rt6_info
*rt
, struct nl_info
*info
);
297 void fib6_run_gc(unsigned long expires
, struct net
*net
, bool force
);
299 void fib6_gc_cleanup(void);
303 int ipv6_route_open(struct inode
*inode
, struct file
*file
);
305 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
306 int fib6_rules_init(void);
307 void fib6_rules_cleanup(void);
309 static inline int fib6_rules_init(void)
313 static inline void fib6_rules_cleanup(void)