Loading...
1/* SPDX-License-Identifier: GPL-2.0-or-later */
2/*
3 * Linux INET6 implementation
4 *
5 * Authors:
6 * Pedro Roque <roque@di.fc.ul.pt>
7 */
8
9#ifndef _IP6_FIB_H
10#define _IP6_FIB_H
11
12#include <linux/ipv6_route.h>
13#include <linux/rtnetlink.h>
14#include <linux/spinlock.h>
15#include <linux/notifier.h>
16#include <net/dst.h>
17#include <net/flow.h>
18#include <net/ip_fib.h>
19#include <net/netlink.h>
20#include <net/inetpeer.h>
21#include <net/fib_notifier.h>
22
23#ifdef CONFIG_IPV6_MULTIPLE_TABLES
24#define FIB6_TABLE_HASHSZ 256
25#else
26#define FIB6_TABLE_HASHSZ 1
27#endif
28
29#define RT6_DEBUG 2
30
31#if RT6_DEBUG >= 3
32#define RT6_TRACE(x...) pr_debug(x)
33#else
34#define RT6_TRACE(x...) do { ; } while (0)
35#endif
36
37struct rt6_info;
38struct fib6_info;
39
40struct fib6_config {
41 u32 fc_table;
42 u32 fc_metric;
43 int fc_dst_len;
44 int fc_src_len;
45 int fc_ifindex;
46 u32 fc_flags;
47 u32 fc_protocol;
48 u16 fc_type; /* only 8 bits are used */
49 u16 fc_delete_all_nh : 1,
50 fc_ignore_dev_down:1,
51 __unused : 14;
52 u32 fc_nh_id;
53
54 struct in6_addr fc_dst;
55 struct in6_addr fc_src;
56 struct in6_addr fc_prefsrc;
57 struct in6_addr fc_gateway;
58
59 unsigned long fc_expires;
60 struct nlattr *fc_mx;
61 int fc_mx_len;
62 int fc_mp_len;
63 struct nlattr *fc_mp;
64
65 struct nl_info fc_nlinfo;
66 struct nlattr *fc_encap;
67 u16 fc_encap_type;
68};
69
70struct fib6_node {
71 struct fib6_node __rcu *parent;
72 struct fib6_node __rcu *left;
73 struct fib6_node __rcu *right;
74#ifdef CONFIG_IPV6_SUBTREES
75 struct fib6_node __rcu *subtree;
76#endif
77 struct fib6_info __rcu *leaf;
78
79 __u16 fn_bit; /* bit key */
80 __u16 fn_flags;
81 int fn_sernum;
82 struct fib6_info __rcu *rr_ptr;
83 struct rcu_head rcu;
84};
85
86struct fib6_gc_args {
87 int timeout;
88 int more;
89};
90
91#ifndef CONFIG_IPV6_SUBTREES
92#define FIB6_SUBTREE(fn) NULL
93#else
94#define FIB6_SUBTREE(fn) (rcu_dereference_protected((fn)->subtree, 1))
95#endif
96
97/*
98 * routing information
99 *
100 */
101
102struct rt6key {
103 struct in6_addr addr;
104 int plen;
105};
106
107struct fib6_table;
108
109struct rt6_exception_bucket {
110 struct hlist_head chain;
111 int depth;
112};
113
114struct rt6_exception {
115 struct hlist_node hlist;
116 struct rt6_info *rt6i;
117 unsigned long stamp;
118 struct rcu_head rcu;
119};
120
121#define FIB6_EXCEPTION_BUCKET_SIZE_SHIFT 10
122#define FIB6_EXCEPTION_BUCKET_SIZE (1 << FIB6_EXCEPTION_BUCKET_SIZE_SHIFT)
123#define FIB6_MAX_DEPTH 5
124
125struct fib6_nh {
126 struct fib_nh_common nh_common;
127
128#ifdef CONFIG_IPV6_ROUTER_PREF
129 unsigned long last_probe;
130#endif
131
132 struct rt6_info * __percpu *rt6i_pcpu;
133 struct rt6_exception_bucket __rcu *rt6i_exception_bucket;
134};
135
136struct fib6_info {
137 struct fib6_table *fib6_table;
138 struct fib6_info __rcu *fib6_next;
139 struct fib6_node __rcu *fib6_node;
140
141 /* Multipath routes:
142 * siblings is a list of fib6_info that have the the same metric/weight,
143 * destination, but not the same gateway. nsiblings is just a cache
144 * to speed up lookup.
145 */
146 union {
147 struct list_head fib6_siblings;
148 struct list_head nh_list;
149 };
150 unsigned int fib6_nsiblings;
151
152 refcount_t fib6_ref;
153 unsigned long expires;
154 struct dst_metrics *fib6_metrics;
155#define fib6_pmtu fib6_metrics->metrics[RTAX_MTU-1]
156
157 struct rt6key fib6_dst;
158 u32 fib6_flags;
159 struct rt6key fib6_src;
160 struct rt6key fib6_prefsrc;
161
162 u32 fib6_metric;
163 u8 fib6_protocol;
164 u8 fib6_type;
165 u8 should_flush:1,
166 dst_nocount:1,
167 dst_nopolicy:1,
168 dst_host:1,
169 fib6_destroying:1,
170 unused:3;
171
172 struct rcu_head rcu;
173 struct nexthop *nh;
174 struct fib6_nh fib6_nh[0];
175};
176
177struct rt6_info {
178 struct dst_entry dst;
179 struct fib6_info __rcu *from;
180
181 struct rt6key rt6i_dst;
182 struct rt6key rt6i_src;
183 struct in6_addr rt6i_gateway;
184 struct inet6_dev *rt6i_idev;
185 u32 rt6i_flags;
186
187 struct list_head rt6i_uncached;
188 struct uncached_list *rt6i_uncached_list;
189
190 /* more non-fragment space at head required */
191 unsigned short rt6i_nfheader_len;
192};
193
194struct fib6_result {
195 struct fib6_nh *nh;
196 struct fib6_info *f6i;
197 u32 fib6_flags;
198 u8 fib6_type;
199 struct rt6_info *rt6;
200};
201
202#define for_each_fib6_node_rt_rcu(fn) \
203 for (rt = rcu_dereference((fn)->leaf); rt; \
204 rt = rcu_dereference(rt->fib6_next))
205
206#define for_each_fib6_walker_rt(w) \
207 for (rt = (w)->leaf; rt; \
208 rt = rcu_dereference_protected(rt->fib6_next, 1))
209
210static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
211{
212 return ((struct rt6_info *)dst)->rt6i_idev;
213}
214
215static inline void fib6_clean_expires(struct fib6_info *f6i)
216{
217 f6i->fib6_flags &= ~RTF_EXPIRES;
218 f6i->expires = 0;
219}
220
221static inline void fib6_set_expires(struct fib6_info *f6i,
222 unsigned long expires)
223{
224 f6i->expires = expires;
225 f6i->fib6_flags |= RTF_EXPIRES;
226}
227
228static inline bool fib6_check_expired(const struct fib6_info *f6i)
229{
230 if (f6i->fib6_flags & RTF_EXPIRES)
231 return time_after(jiffies, f6i->expires);
232 return false;
233}
234
235/* Function to safely get fn->sernum for passed in rt
236 * and store result in passed in cookie.
237 * Return true if we can get cookie safely
238 * Return false if not
239 */
240static inline bool fib6_get_cookie_safe(const struct fib6_info *f6i,
241 u32 *cookie)
242{
243 struct fib6_node *fn;
244 bool status = false;
245
246 fn = rcu_dereference(f6i->fib6_node);
247
248 if (fn) {
249 *cookie = fn->fn_sernum;
250 /* pairs with smp_wmb() in fib6_update_sernum_upto_root() */
251 smp_rmb();
252 status = true;
253 }
254
255 return status;
256}
257
258static inline u32 rt6_get_cookie(const struct rt6_info *rt)
259{
260 struct fib6_info *from;
261 u32 cookie = 0;
262
263 rcu_read_lock();
264
265 from = rcu_dereference(rt->from);
266 if (from)
267 fib6_get_cookie_safe(from, &cookie);
268
269 rcu_read_unlock();
270
271 return cookie;
272}
273
274static inline void ip6_rt_put(struct rt6_info *rt)
275{
276 /* dst_release() accepts a NULL parameter.
277 * We rely on dst being first structure in struct rt6_info
278 */
279 BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
280 dst_release(&rt->dst);
281}
282
283struct fib6_info *fib6_info_alloc(gfp_t gfp_flags, bool with_fib6_nh);
284void fib6_info_destroy_rcu(struct rcu_head *head);
285
286static inline void fib6_info_hold(struct fib6_info *f6i)
287{
288 refcount_inc(&f6i->fib6_ref);
289}
290
291static inline bool fib6_info_hold_safe(struct fib6_info *f6i)
292{
293 return refcount_inc_not_zero(&f6i->fib6_ref);
294}
295
296static inline void fib6_info_release(struct fib6_info *f6i)
297{
298 if (f6i && refcount_dec_and_test(&f6i->fib6_ref))
299 call_rcu(&f6i->rcu, fib6_info_destroy_rcu);
300}
301
302enum fib6_walk_state {
303#ifdef CONFIG_IPV6_SUBTREES
304 FWS_S,
305#endif
306 FWS_L,
307 FWS_R,
308 FWS_C,
309 FWS_U
310};
311
312struct fib6_walker {
313 struct list_head lh;
314 struct fib6_node *root, *node;
315 struct fib6_info *leaf;
316 enum fib6_walk_state state;
317 unsigned int skip;
318 unsigned int count;
319 unsigned int skip_in_node;
320 int (*func)(struct fib6_walker *);
321 void *args;
322};
323
324struct rt6_statistics {
325 __u32 fib_nodes; /* all fib6 nodes */
326 __u32 fib_route_nodes; /* intermediate nodes */
327 __u32 fib_rt_entries; /* rt entries in fib table */
328 __u32 fib_rt_cache; /* cached rt entries in exception table */
329 __u32 fib_discarded_routes; /* total number of routes delete */
330
331 /* The following stats are not protected by any lock */
332 atomic_t fib_rt_alloc; /* total number of routes alloced */
333 atomic_t fib_rt_uncache; /* rt entries in uncached list */
334};
335
336#define RTN_TL_ROOT 0x0001
337#define RTN_ROOT 0x0002 /* tree root node */
338#define RTN_RTINFO 0x0004 /* node with valid routing info */
339
340/*
341 * priority levels (or metrics)
342 *
343 */
344
345
346struct fib6_table {
347 struct hlist_node tb6_hlist;
348 u32 tb6_id;
349 spinlock_t tb6_lock;
350 struct fib6_node tb6_root;
351 struct inet_peer_base tb6_peers;
352 unsigned int flags;
353 unsigned int fib_seq;
354#define RT6_TABLE_HAS_DFLT_ROUTER BIT(0)
355};
356
357#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
358#define RT6_TABLE_MAIN RT_TABLE_MAIN
359#define RT6_TABLE_DFLT RT6_TABLE_MAIN
360#define RT6_TABLE_INFO RT6_TABLE_MAIN
361#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
362
363#ifdef CONFIG_IPV6_MULTIPLE_TABLES
364#define FIB6_TABLE_MIN 1
365#define FIB6_TABLE_MAX RT_TABLE_MAX
366#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
367#else
368#define FIB6_TABLE_MIN RT_TABLE_MAIN
369#define FIB6_TABLE_MAX FIB6_TABLE_MIN
370#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
371#endif
372
373typedef struct rt6_info *(*pol_lookup_t)(struct net *,
374 struct fib6_table *,
375 struct flowi6 *,
376 const struct sk_buff *, int);
377
378struct fib6_entry_notifier_info {
379 struct fib_notifier_info info; /* must be first */
380 struct fib6_info *rt;
381 unsigned int nsiblings;
382};
383
384/*
385 * exported functions
386 */
387
388struct fib6_table *fib6_get_table(struct net *net, u32 id);
389struct fib6_table *fib6_new_table(struct net *net, u32 id);
390struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
391 const struct sk_buff *skb,
392 int flags, pol_lookup_t lookup);
393
394/* called with rcu lock held; can return error pointer
395 * caller needs to select path
396 */
397int fib6_lookup(struct net *net, int oif, struct flowi6 *fl6,
398 struct fib6_result *res, int flags);
399
400/* called with rcu lock held; caller needs to select path */
401int fib6_table_lookup(struct net *net, struct fib6_table *table,
402 int oif, struct flowi6 *fl6, struct fib6_result *res,
403 int strict);
404
405void fib6_select_path(const struct net *net, struct fib6_result *res,
406 struct flowi6 *fl6, int oif, bool have_oif_match,
407 const struct sk_buff *skb, int strict);
408struct fib6_node *fib6_node_lookup(struct fib6_node *root,
409 const struct in6_addr *daddr,
410 const struct in6_addr *saddr);
411
412struct fib6_node *fib6_locate(struct fib6_node *root,
413 const struct in6_addr *daddr, int dst_len,
414 const struct in6_addr *saddr, int src_len,
415 bool exact_match);
416
417void fib6_clean_all(struct net *net, int (*func)(struct fib6_info *, void *arg),
418 void *arg);
419void fib6_clean_all_skip_notify(struct net *net,
420 int (*func)(struct fib6_info *, void *arg),
421 void *arg);
422
423int fib6_add(struct fib6_node *root, struct fib6_info *rt,
424 struct nl_info *info, struct netlink_ext_ack *extack);
425int fib6_del(struct fib6_info *rt, struct nl_info *info);
426
427static inline
428void rt6_get_prefsrc(const struct rt6_info *rt, struct in6_addr *addr)
429{
430 const struct fib6_info *from;
431
432 rcu_read_lock();
433
434 from = rcu_dereference(rt->from);
435 if (from) {
436 *addr = from->fib6_prefsrc.addr;
437 } else {
438 struct in6_addr in6_zero = {};
439
440 *addr = in6_zero;
441 }
442
443 rcu_read_unlock();
444}
445
446int fib6_nh_init(struct net *net, struct fib6_nh *fib6_nh,
447 struct fib6_config *cfg, gfp_t gfp_flags,
448 struct netlink_ext_ack *extack);
449void fib6_nh_release(struct fib6_nh *fib6_nh);
450
451int call_fib6_entry_notifiers(struct net *net,
452 enum fib_event_type event_type,
453 struct fib6_info *rt,
454 struct netlink_ext_ack *extack);
455int call_fib6_multipath_entry_notifiers(struct net *net,
456 enum fib_event_type event_type,
457 struct fib6_info *rt,
458 unsigned int nsiblings,
459 struct netlink_ext_ack *extack);
460void fib6_rt_update(struct net *net, struct fib6_info *rt,
461 struct nl_info *info);
462void inet6_rt_notify(int event, struct fib6_info *rt, struct nl_info *info,
463 unsigned int flags);
464
465void fib6_run_gc(unsigned long expires, struct net *net, bool force);
466
467void fib6_gc_cleanup(void);
468
469int fib6_init(void);
470
471struct ipv6_route_iter {
472 struct seq_net_private p;
473 struct fib6_walker w;
474 loff_t skip;
475 struct fib6_table *tbl;
476 int sernum;
477};
478
479extern const struct seq_operations ipv6_route_seq_ops;
480
481int call_fib6_notifier(struct notifier_block *nb, struct net *net,
482 enum fib_event_type event_type,
483 struct fib_notifier_info *info);
484int call_fib6_notifiers(struct net *net, enum fib_event_type event_type,
485 struct fib_notifier_info *info);
486
487int __net_init fib6_notifier_init(struct net *net);
488void __net_exit fib6_notifier_exit(struct net *net);
489
490unsigned int fib6_tables_seq_read(struct net *net);
491int fib6_tables_dump(struct net *net, struct notifier_block *nb);
492
493void fib6_update_sernum(struct net *net, struct fib6_info *rt);
494void fib6_update_sernum_upto_root(struct net *net, struct fib6_info *rt);
495void fib6_update_sernum_stub(struct net *net, struct fib6_info *f6i);
496
497void fib6_metric_set(struct fib6_info *f6i, int metric, u32 val);
498static inline bool fib6_metric_locked(struct fib6_info *f6i, int metric)
499{
500 return !!(f6i->fib6_metrics->metrics[RTAX_LOCK - 1] & (1 << metric));
501}
502
503#ifdef CONFIG_IPV6_MULTIPLE_TABLES
504int fib6_rules_init(void);
505void fib6_rules_cleanup(void);
506bool fib6_rule_default(const struct fib_rule *rule);
507int fib6_rules_dump(struct net *net, struct notifier_block *nb);
508unsigned int fib6_rules_seq_read(struct net *net);
509
510static inline bool fib6_rules_early_flow_dissect(struct net *net,
511 struct sk_buff *skb,
512 struct flowi6 *fl6,
513 struct flow_keys *flkeys)
514{
515 unsigned int flag = FLOW_DISSECTOR_F_STOP_AT_ENCAP;
516
517 if (!net->ipv6.fib6_rules_require_fldissect)
518 return false;
519
520 skb_flow_dissect_flow_keys(skb, flkeys, flag);
521 fl6->fl6_sport = flkeys->ports.src;
522 fl6->fl6_dport = flkeys->ports.dst;
523 fl6->flowi6_proto = flkeys->basic.ip_proto;
524
525 return true;
526}
527#else
528static inline int fib6_rules_init(void)
529{
530 return 0;
531}
532static inline void fib6_rules_cleanup(void)
533{
534 return ;
535}
536static inline bool fib6_rule_default(const struct fib_rule *rule)
537{
538 return true;
539}
540static inline int fib6_rules_dump(struct net *net, struct notifier_block *nb)
541{
542 return 0;
543}
544static inline unsigned int fib6_rules_seq_read(struct net *net)
545{
546 return 0;
547}
548static inline bool fib6_rules_early_flow_dissect(struct net *net,
549 struct sk_buff *skb,
550 struct flowi6 *fl6,
551 struct flow_keys *flkeys)
552{
553 return false;
554}
555#endif
556#endif
1/*
2 * Linux INET6 implementation
3 *
4 * Authors:
5 * Pedro Roque <roque@di.fc.ul.pt>
6 *
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.
11 */
12
13#ifndef _IP6_FIB_H
14#define _IP6_FIB_H
15
16#include <linux/ipv6_route.h>
17#include <linux/rtnetlink.h>
18#include <linux/spinlock.h>
19#include <net/dst.h>
20#include <net/flow.h>
21#include <net/netlink.h>
22#include <net/inetpeer.h>
23
24#ifdef CONFIG_IPV6_MULTIPLE_TABLES
25#define FIB6_TABLE_HASHSZ 256
26#else
27#define FIB6_TABLE_HASHSZ 1
28#endif
29
30struct rt6_info;
31
32struct fib6_config {
33 u32 fc_table;
34 u32 fc_metric;
35 int fc_dst_len;
36 int fc_src_len;
37 int fc_ifindex;
38 u32 fc_flags;
39 u32 fc_protocol;
40 u32 fc_type; /* only 8 bits are used */
41
42 struct in6_addr fc_dst;
43 struct in6_addr fc_src;
44 struct in6_addr fc_prefsrc;
45 struct in6_addr fc_gateway;
46
47 unsigned long fc_expires;
48 struct nlattr *fc_mx;
49 int fc_mx_len;
50 int fc_mp_len;
51 struct nlattr *fc_mp;
52
53 struct nl_info fc_nlinfo;
54};
55
56struct fib6_node {
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;
62#endif
63 struct rt6_info *leaf;
64
65 __u16 fn_bit; /* bit key */
66 __u16 fn_flags;
67 __u32 fn_sernum;
68 struct rt6_info *rr_ptr;
69};
70
71#ifndef CONFIG_IPV6_SUBTREES
72#define FIB6_SUBTREE(fn) NULL
73#else
74#define FIB6_SUBTREE(fn) ((fn)->subtree)
75#endif
76
77/*
78 * routing information
79 *
80 */
81
82struct rt6key {
83 struct in6_addr addr;
84 int plen;
85};
86
87struct fib6_table;
88
89struct rt6_info {
90 struct dst_entry dst;
91
92 /*
93 * Tail elements of dst_entry (__refcnt etc.)
94 * and these elements (rarely used in hot path) are in
95 * the same cache line.
96 */
97 struct fib6_table *rt6i_table;
98 struct fib6_node *rt6i_node;
99
100 struct in6_addr rt6i_gateway;
101
102 /* Multipath routes:
103 * siblings is a list of rt6_info that have the the same metric/weight,
104 * destination, but not the same gateway. nsiblings is just a cache
105 * to speed up lookup.
106 */
107 struct list_head rt6i_siblings;
108 unsigned int rt6i_nsiblings;
109
110 atomic_t rt6i_ref;
111
112 /* These are in a separate cache line. */
113 struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
114 u32 rt6i_flags;
115 struct rt6key rt6i_src;
116 struct rt6key rt6i_prefsrc;
117 u32 rt6i_metric;
118
119 struct inet6_dev *rt6i_idev;
120 unsigned long _rt6i_peer;
121
122 u32 rt6i_genid;
123
124 /* more non-fragment space at head required */
125 unsigned short rt6i_nfheader_len;
126
127 u8 rt6i_protocol;
128};
129
130static inline struct inet_peer *rt6_peer_ptr(struct rt6_info *rt)
131{
132 return inetpeer_ptr(rt->_rt6i_peer);
133}
134
135static inline bool rt6_has_peer(struct rt6_info *rt)
136{
137 return inetpeer_ptr_is_peer(rt->_rt6i_peer);
138}
139
140static inline void __rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
141{
142 __inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
143}
144
145static inline bool rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
146{
147 return inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
148}
149
150static inline void rt6_init_peer(struct rt6_info *rt, struct inet_peer_base *base)
151{
152 inetpeer_init_ptr(&rt->_rt6i_peer, base);
153}
154
155static inline void rt6_transfer_peer(struct rt6_info *rt, struct rt6_info *ort)
156{
157 inetpeer_transfer_peer(&rt->_rt6i_peer, &ort->_rt6i_peer);
158}
159
160static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
161{
162 return ((struct rt6_info *)dst)->rt6i_idev;
163}
164
165static inline void rt6_clean_expires(struct rt6_info *rt)
166{
167 rt->rt6i_flags &= ~RTF_EXPIRES;
168 rt->dst.expires = 0;
169}
170
171static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
172{
173 rt->dst.expires = expires;
174 rt->rt6i_flags |= RTF_EXPIRES;
175}
176
177static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
178{
179 struct rt6_info *rt;
180
181 for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
182 rt = (struct rt6_info *)rt->dst.from);
183 if (rt && rt != rt0)
184 rt0->dst.expires = rt->dst.expires;
185
186 dst_set_expires(&rt0->dst, timeout);
187 rt0->rt6i_flags |= RTF_EXPIRES;
188}
189
190static inline void rt6_set_from(struct rt6_info *rt, struct rt6_info *from)
191{
192 struct dst_entry *new = (struct dst_entry *) from;
193
194 rt->rt6i_flags &= ~RTF_EXPIRES;
195 dst_hold(new);
196 rt->dst.from = new;
197}
198
199static inline void ip6_rt_put(struct rt6_info *rt)
200{
201 /* dst_release() accepts a NULL parameter.
202 * We rely on dst being first structure in struct rt6_info
203 */
204 BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
205 dst_release(&rt->dst);
206}
207
208struct fib6_walker_t {
209 struct list_head lh;
210 struct fib6_node *root, *node;
211 struct rt6_info *leaf;
212 unsigned char state;
213 unsigned char prune;
214 unsigned int skip;
215 unsigned int count;
216 int (*func)(struct fib6_walker_t *);
217 void *args;
218};
219
220struct rt6_statistics {
221 __u32 fib_nodes;
222 __u32 fib_route_nodes;
223 __u32 fib_rt_alloc; /* permanent routes */
224 __u32 fib_rt_entries; /* rt entries in table */
225 __u32 fib_rt_cache; /* cache routes */
226 __u32 fib_discarded_routes;
227};
228
229#define RTN_TL_ROOT 0x0001
230#define RTN_ROOT 0x0002 /* tree root node */
231#define RTN_RTINFO 0x0004 /* node with valid routing info */
232
233/*
234 * priority levels (or metrics)
235 *
236 */
237
238
239struct fib6_table {
240 struct hlist_node tb6_hlist;
241 u32 tb6_id;
242 rwlock_t tb6_lock;
243 struct fib6_node tb6_root;
244 struct inet_peer_base tb6_peers;
245};
246
247#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
248#define RT6_TABLE_MAIN RT_TABLE_MAIN
249#define RT6_TABLE_DFLT RT6_TABLE_MAIN
250#define RT6_TABLE_INFO RT6_TABLE_MAIN
251#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
252
253#ifdef CONFIG_IPV6_MULTIPLE_TABLES
254#define FIB6_TABLE_MIN 1
255#define FIB6_TABLE_MAX RT_TABLE_MAX
256#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
257#else
258#define FIB6_TABLE_MIN RT_TABLE_MAIN
259#define FIB6_TABLE_MAX FIB6_TABLE_MIN
260#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
261#endif
262
263typedef struct rt6_info *(*pol_lookup_t)(struct net *,
264 struct fib6_table *,
265 struct flowi6 *, int);
266
267/*
268 * exported functions
269 */
270
271struct fib6_table *fib6_get_table(struct net *net, u32 id);
272struct fib6_table *fib6_new_table(struct net *net, u32 id);
273struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
274 int flags, pol_lookup_t lookup);
275
276struct fib6_node *fib6_lookup(struct fib6_node *root,
277 const struct in6_addr *daddr,
278 const struct in6_addr *saddr);
279
280struct fib6_node *fib6_locate(struct fib6_node *root,
281 const struct in6_addr *daddr, int dst_len,
282 const struct in6_addr *saddr, int src_len);
283
284void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
285 void *arg);
286
287int fib6_add(struct fib6_node *root, struct rt6_info *rt, struct nl_info *info,
288 struct nlattr *mx, int mx_len);
289
290int fib6_del(struct rt6_info *rt, struct nl_info *info);
291
292void inet6_rt_notify(int event, struct rt6_info *rt, struct nl_info *info);
293
294void fib6_run_gc(unsigned long expires, struct net *net, bool force);
295
296void fib6_gc_cleanup(void);
297
298int fib6_init(void);
299
300int ipv6_route_open(struct inode *inode, struct file *file);
301
302#ifdef CONFIG_IPV6_MULTIPLE_TABLES
303int fib6_rules_init(void);
304void fib6_rules_cleanup(void);
305#else
306static inline int fib6_rules_init(void)
307{
308 return 0;
309}
310static inline void fib6_rules_cleanup(void)
311{
312 return ;
313}
314#endif
315#endif