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 u16 fc_type
; /* only 8 bits are used */
41 u16 fc_delete_all_nh
: 1,
44 struct in6_addr fc_dst
;
45 struct in6_addr fc_src
;
46 struct in6_addr fc_prefsrc
;
47 struct in6_addr fc_gateway
;
49 unsigned long fc_expires
;
55 struct nl_info fc_nlinfo
;
56 struct nlattr
*fc_encap
;
61 struct fib6_node
*parent
;
62 struct fib6_node
*left
;
63 struct fib6_node
*right
;
64 #ifdef CONFIG_IPV6_SUBTREES
65 struct fib6_node
*subtree
;
67 struct rt6_info
*leaf
;
69 __u16 fn_bit
; /* bit key */
72 struct rt6_info
*rr_ptr
;
75 #ifndef CONFIG_IPV6_SUBTREES
76 #define FIB6_SUBTREE(fn) NULL
78 #define FIB6_SUBTREE(fn) ((fn)->subtree)
83 DECLARE_BITMAP(mx_valid
, RTAX_MAX
);
102 * Tail elements of dst_entry (__refcnt etc.)
103 * and these elements (rarely used in hot path) are in
104 * the same cache line.
106 struct fib6_table
*rt6i_table
;
107 struct fib6_node
*rt6i_node
;
109 struct in6_addr rt6i_gateway
;
112 * siblings is a list of rt6_info that have the the same metric/weight,
113 * destination, but not the same gateway. nsiblings is just a cache
114 * to speed up lookup.
116 struct list_head rt6i_siblings
;
117 unsigned int rt6i_nsiblings
;
121 /* These are in a separate cache line. */
122 struct rt6key rt6i_dst ____cacheline_aligned_in_smp
;
124 struct rt6key rt6i_src
;
125 struct rt6key rt6i_prefsrc
;
127 struct list_head rt6i_uncached
;
128 struct uncached_list
*rt6i_uncached_list
;
130 struct inet6_dev
*rt6i_idev
;
131 struct rt6_info
* __percpu
*rt6i_pcpu
;
135 /* more non-fragment space at head required */
136 unsigned short rt6i_nfheader_len
;
140 static inline struct inet6_dev
*ip6_dst_idev(struct dst_entry
*dst
)
142 return ((struct rt6_info
*)dst
)->rt6i_idev
;
145 static inline void rt6_clean_expires(struct rt6_info
*rt
)
147 rt
->rt6i_flags
&= ~RTF_EXPIRES
;
151 static inline void rt6_set_expires(struct rt6_info
*rt
, unsigned long expires
)
153 rt
->dst
.expires
= expires
;
154 rt
->rt6i_flags
|= RTF_EXPIRES
;
157 static inline void rt6_update_expires(struct rt6_info
*rt0
, int timeout
)
161 for (rt
= rt0
; rt
&& !(rt
->rt6i_flags
& RTF_EXPIRES
);
162 rt
= (struct rt6_info
*)rt
->dst
.from
);
164 rt0
->dst
.expires
= rt
->dst
.expires
;
166 dst_set_expires(&rt0
->dst
, timeout
);
167 rt0
->rt6i_flags
|= RTF_EXPIRES
;
170 static inline u32
rt6_get_cookie(const struct rt6_info
*rt
)
172 if (rt
->rt6i_flags
& RTF_PCPU
||
173 (unlikely(!list_empty(&rt
->rt6i_uncached
)) && rt
->dst
.from
))
174 rt
= (struct rt6_info
*)(rt
->dst
.from
);
176 return rt
->rt6i_node
? rt
->rt6i_node
->fn_sernum
: 0;
179 static inline void ip6_rt_put(struct rt6_info
*rt
)
181 /* dst_release() accepts a NULL parameter.
182 * We rely on dst being first structure in struct rt6_info
184 BUILD_BUG_ON(offsetof(struct rt6_info
, dst
) != 0);
185 dst_release(&rt
->dst
);
188 enum fib6_walk_state
{
189 #ifdef CONFIG_IPV6_SUBTREES
200 struct fib6_node
*root
, *node
;
201 struct rt6_info
*leaf
;
202 enum fib6_walk_state state
;
206 int (*func
)(struct fib6_walker
*);
210 struct rt6_statistics
{
212 __u32 fib_route_nodes
;
213 __u32 fib_rt_alloc
; /* permanent routes */
214 __u32 fib_rt_entries
; /* rt entries in table */
215 __u32 fib_rt_cache
; /* cache routes */
216 __u32 fib_discarded_routes
;
219 #define RTN_TL_ROOT 0x0001
220 #define RTN_ROOT 0x0002 /* tree root node */
221 #define RTN_RTINFO 0x0004 /* node with valid routing info */
224 * priority levels (or metrics)
230 struct hlist_node tb6_hlist
;
233 struct fib6_node tb6_root
;
234 struct inet_peer_base tb6_peers
;
236 #define RT6_TABLE_HAS_DFLT_ROUTER BIT(0)
239 #define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
240 #define RT6_TABLE_MAIN RT_TABLE_MAIN
241 #define RT6_TABLE_DFLT RT6_TABLE_MAIN
242 #define RT6_TABLE_INFO RT6_TABLE_MAIN
243 #define RT6_TABLE_PREFIX RT6_TABLE_MAIN
245 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
246 #define FIB6_TABLE_MIN 1
247 #define FIB6_TABLE_MAX RT_TABLE_MAX
248 #define RT6_TABLE_LOCAL RT_TABLE_LOCAL
250 #define FIB6_TABLE_MIN RT_TABLE_MAIN
251 #define FIB6_TABLE_MAX FIB6_TABLE_MIN
252 #define RT6_TABLE_LOCAL RT6_TABLE_MAIN
255 typedef struct rt6_info
*(*pol_lookup_t
)(struct net
*,
257 struct flowi6
*, int);
263 struct fib6_table
*fib6_get_table(struct net
*net
, u32 id
);
264 struct fib6_table
*fib6_new_table(struct net
*net
, u32 id
);
265 struct dst_entry
*fib6_rule_lookup(struct net
*net
, struct flowi6
*fl6
,
266 int flags
, pol_lookup_t lookup
);
268 struct fib6_node
*fib6_lookup(struct fib6_node
*root
,
269 const struct in6_addr
*daddr
,
270 const struct in6_addr
*saddr
);
272 struct fib6_node
*fib6_locate(struct fib6_node
*root
,
273 const struct in6_addr
*daddr
, int dst_len
,
274 const struct in6_addr
*saddr
, int src_len
);
276 void fib6_clean_all(struct net
*net
, int (*func
)(struct rt6_info
*, void *arg
),
279 int fib6_add(struct fib6_node
*root
, struct rt6_info
*rt
,
280 struct nl_info
*info
, struct mx6_config
*mxc
,
281 struct netlink_ext_ack
*extack
);
282 int fib6_del(struct rt6_info
*rt
, struct nl_info
*info
);
284 void inet6_rt_notify(int event
, struct rt6_info
*rt
, struct nl_info
*info
,
287 void fib6_run_gc(unsigned long expires
, struct net
*net
, bool force
);
289 void fib6_gc_cleanup(void);
293 int ipv6_route_open(struct inode
*inode
, struct file
*file
);
295 #ifdef CONFIG_IPV6_MULTIPLE_TABLES
296 int fib6_rules_init(void);
297 void fib6_rules_cleanup(void);
299 static inline int fib6_rules_init(void)
303 static inline void fib6_rules_cleanup(void)