Loading...
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 struct nlattr *fc_encap;
55 u16 fc_encap_type;
56};
57
58struct fib6_node {
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;
64#endif
65 struct rt6_info *leaf;
66
67 __u16 fn_bit; /* bit key */
68 __u16 fn_flags;
69 int fn_sernum;
70 struct rt6_info *rr_ptr;
71};
72
73#ifndef CONFIG_IPV6_SUBTREES
74#define FIB6_SUBTREE(fn) NULL
75#else
76#define FIB6_SUBTREE(fn) ((fn)->subtree)
77#endif
78
79struct mx6_config {
80 const u32 *mx;
81 DECLARE_BITMAP(mx_valid, RTAX_MAX);
82};
83
84/*
85 * routing information
86 *
87 */
88
89struct rt6key {
90 struct in6_addr addr;
91 int plen;
92};
93
94struct fib6_table;
95
96struct rt6_info {
97 struct dst_entry dst;
98
99 /*
100 * Tail elements of dst_entry (__refcnt etc.)
101 * and these elements (rarely used in hot path) are in
102 * the same cache line.
103 */
104 struct fib6_table *rt6i_table;
105 struct fib6_node *rt6i_node;
106
107 struct in6_addr rt6i_gateway;
108
109 /* Multipath routes:
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.
113 */
114 struct list_head rt6i_siblings;
115 unsigned int rt6i_nsiblings;
116
117 atomic_t rt6i_ref;
118
119 /* These are in a separate cache line. */
120 struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
121 u32 rt6i_flags;
122 struct rt6key rt6i_src;
123 struct rt6key rt6i_prefsrc;
124
125 struct list_head rt6i_uncached;
126 struct uncached_list *rt6i_uncached_list;
127
128 struct inet6_dev *rt6i_idev;
129 struct rt6_info * __percpu *rt6i_pcpu;
130
131 u32 rt6i_metric;
132 u32 rt6i_pmtu;
133 /* more non-fragment space at head required */
134 unsigned short rt6i_nfheader_len;
135 u8 rt6i_protocol;
136};
137
138static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
139{
140 return ((struct rt6_info *)dst)->rt6i_idev;
141}
142
143static inline void rt6_clean_expires(struct rt6_info *rt)
144{
145 rt->rt6i_flags &= ~RTF_EXPIRES;
146 rt->dst.expires = 0;
147}
148
149static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
150{
151 rt->dst.expires = expires;
152 rt->rt6i_flags |= RTF_EXPIRES;
153}
154
155static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
156{
157 struct rt6_info *rt;
158
159 for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
160 rt = (struct rt6_info *)rt->dst.from);
161 if (rt && rt != rt0)
162 rt0->dst.expires = rt->dst.expires;
163
164 dst_set_expires(&rt0->dst, timeout);
165 rt0->rt6i_flags |= RTF_EXPIRES;
166}
167
168static inline u32 rt6_get_cookie(const struct rt6_info *rt)
169{
170 if (rt->rt6i_flags & RTF_PCPU ||
171 (unlikely(rt->dst.flags & DST_NOCACHE) && rt->dst.from))
172 rt = (struct rt6_info *)(rt->dst.from);
173
174 return rt->rt6i_node ? rt->rt6i_node->fn_sernum : 0;
175}
176
177static inline void ip6_rt_put(struct rt6_info *rt)
178{
179 /* dst_release() accepts a NULL parameter.
180 * We rely on dst being first structure in struct rt6_info
181 */
182 BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
183 dst_release(&rt->dst);
184}
185
186enum fib6_walk_state {
187#ifdef CONFIG_IPV6_SUBTREES
188 FWS_S,
189#endif
190 FWS_L,
191 FWS_R,
192 FWS_C,
193 FWS_U
194};
195
196struct fib6_walker {
197 struct list_head lh;
198 struct fib6_node *root, *node;
199 struct rt6_info *leaf;
200 enum fib6_walk_state state;
201 bool prune;
202 unsigned int skip;
203 unsigned int count;
204 int (*func)(struct fib6_walker *);
205 void *args;
206};
207
208struct rt6_statistics {
209 __u32 fib_nodes;
210 __u32 fib_route_nodes;
211 __u32 fib_rt_alloc; /* permanent routes */
212 __u32 fib_rt_entries; /* rt entries in table */
213 __u32 fib_rt_cache; /* cache routes */
214 __u32 fib_discarded_routes;
215};
216
217#define RTN_TL_ROOT 0x0001
218#define RTN_ROOT 0x0002 /* tree root node */
219#define RTN_RTINFO 0x0004 /* node with valid routing info */
220
221/*
222 * priority levels (or metrics)
223 *
224 */
225
226
227struct fib6_table {
228 struct hlist_node tb6_hlist;
229 u32 tb6_id;
230 rwlock_t tb6_lock;
231 struct fib6_node tb6_root;
232 struct inet_peer_base tb6_peers;
233};
234
235#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
236#define RT6_TABLE_MAIN RT_TABLE_MAIN
237#define RT6_TABLE_DFLT RT6_TABLE_MAIN
238#define RT6_TABLE_INFO RT6_TABLE_MAIN
239#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
240
241#ifdef CONFIG_IPV6_MULTIPLE_TABLES
242#define FIB6_TABLE_MIN 1
243#define FIB6_TABLE_MAX RT_TABLE_MAX
244#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
245#else
246#define FIB6_TABLE_MIN RT_TABLE_MAIN
247#define FIB6_TABLE_MAX FIB6_TABLE_MIN
248#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
249#endif
250
251typedef struct rt6_info *(*pol_lookup_t)(struct net *,
252 struct fib6_table *,
253 struct flowi6 *, int);
254
255/*
256 * exported functions
257 */
258
259struct fib6_table *fib6_get_table(struct net *net, u32 id);
260struct fib6_table *fib6_new_table(struct net *net, u32 id);
261struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
262 int flags, pol_lookup_t lookup);
263
264struct fib6_node *fib6_lookup(struct fib6_node *root,
265 const struct in6_addr *daddr,
266 const struct in6_addr *saddr);
267
268struct fib6_node *fib6_locate(struct fib6_node *root,
269 const struct in6_addr *daddr, int dst_len,
270 const struct in6_addr *saddr, int src_len);
271
272void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
273 void *arg);
274
275int fib6_add(struct fib6_node *root, struct rt6_info *rt,
276 struct nl_info *info, struct mx6_config *mxc);
277int fib6_del(struct rt6_info *rt, struct nl_info *info);
278
279void inet6_rt_notify(int event, struct rt6_info *rt, struct nl_info *info,
280 unsigned int flags);
281
282void fib6_run_gc(unsigned long expires, struct net *net, bool force);
283
284void fib6_gc_cleanup(void);
285
286int fib6_init(void);
287
288int ipv6_route_open(struct inode *inode, struct file *file);
289
290#ifdef CONFIG_IPV6_MULTIPLE_TABLES
291int fib6_rules_init(void);
292void fib6_rules_cleanup(void);
293#else
294static inline int fib6_rules_init(void)
295{
296 return 0;
297}
298static inline void fib6_rules_cleanup(void)
299{
300 return ;
301}
302#endif
303#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
41 struct in6_addr fc_dst;
42 struct in6_addr fc_src;
43 struct in6_addr fc_prefsrc;
44 struct in6_addr fc_gateway;
45
46 unsigned long fc_expires;
47 struct nlattr *fc_mx;
48 int fc_mx_len;
49
50 struct nl_info fc_nlinfo;
51};
52
53struct fib6_node {
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;
59#endif
60 struct rt6_info *leaf;
61
62 __u16 fn_bit; /* bit key */
63 __u16 fn_flags;
64 __u32 fn_sernum;
65 struct rt6_info *rr_ptr;
66};
67
68#ifndef CONFIG_IPV6_SUBTREES
69#define FIB6_SUBTREE(fn) NULL
70#else
71#define FIB6_SUBTREE(fn) ((fn)->subtree)
72#endif
73
74/*
75 * routing information
76 *
77 */
78
79struct rt6key {
80 struct in6_addr addr;
81 int plen;
82};
83
84struct fib6_table;
85
86struct rt6_info {
87 struct dst_entry dst;
88
89 /*
90 * Tail elements of dst_entry (__refcnt etc.)
91 * and these elements (rarely used in hot path) are in
92 * the same cache line.
93 */
94 struct fib6_table *rt6i_table;
95 struct fib6_node *rt6i_node;
96
97 struct in6_addr rt6i_gateway;
98
99 atomic_t rt6i_ref;
100
101 /* These are in a separate cache line. */
102 struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
103 u32 rt6i_flags;
104 struct rt6key rt6i_src;
105 struct rt6key rt6i_prefsrc;
106 u32 rt6i_metric;
107 u32 rt6i_peer_genid;
108
109 struct inet6_dev *rt6i_idev;
110 struct inet_peer *rt6i_peer;
111
112#ifdef CONFIG_XFRM
113 u32 rt6i_flow_cache_genid;
114#endif
115 /* more non-fragment space at head required */
116 unsigned short rt6i_nfheader_len;
117
118 u8 rt6i_protocol;
119};
120
121static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
122{
123 return ((struct rt6_info *)dst)->rt6i_idev;
124}
125
126static inline void rt6_clean_expires(struct rt6_info *rt)
127{
128 if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from)
129 dst_release(rt->dst.from);
130
131 rt->rt6i_flags &= ~RTF_EXPIRES;
132 rt->dst.from = NULL;
133}
134
135static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
136{
137 if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from)
138 dst_release(rt->dst.from);
139
140 rt->rt6i_flags |= RTF_EXPIRES;
141 rt->dst.expires = expires;
142}
143
144static inline void rt6_update_expires(struct rt6_info *rt, int timeout)
145{
146 if (!(rt->rt6i_flags & RTF_EXPIRES)) {
147 if (rt->dst.from)
148 dst_release(rt->dst.from);
149 /* dst_set_expires relies on expires == 0
150 * if it has not been set previously.
151 */
152 rt->dst.expires = 0;
153 }
154
155 dst_set_expires(&rt->dst, timeout);
156 rt->rt6i_flags |= RTF_EXPIRES;
157}
158
159static inline void rt6_set_from(struct rt6_info *rt, struct rt6_info *from)
160{
161 struct dst_entry *new = (struct dst_entry *) from;
162
163 if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from) {
164 if (new == rt->dst.from)
165 return;
166 dst_release(rt->dst.from);
167 }
168
169 rt->rt6i_flags &= ~RTF_EXPIRES;
170 rt->dst.from = new;
171 dst_hold(new);
172}
173
174struct fib6_walker_t {
175 struct list_head lh;
176 struct fib6_node *root, *node;
177 struct rt6_info *leaf;
178 unsigned char state;
179 unsigned char prune;
180 unsigned int skip;
181 unsigned int count;
182 int (*func)(struct fib6_walker_t *);
183 void *args;
184};
185
186struct rt6_statistics {
187 __u32 fib_nodes;
188 __u32 fib_route_nodes;
189 __u32 fib_rt_alloc; /* permanent routes */
190 __u32 fib_rt_entries; /* rt entries in table */
191 __u32 fib_rt_cache; /* cache routes */
192 __u32 fib_discarded_routes;
193};
194
195#define RTN_TL_ROOT 0x0001
196#define RTN_ROOT 0x0002 /* tree root node */
197#define RTN_RTINFO 0x0004 /* node with valid routing info */
198
199/*
200 * priority levels (or metrics)
201 *
202 */
203
204
205struct fib6_table {
206 struct hlist_node tb6_hlist;
207 u32 tb6_id;
208 rwlock_t tb6_lock;
209 struct fib6_node tb6_root;
210};
211
212#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
213#define RT6_TABLE_MAIN RT_TABLE_MAIN
214#define RT6_TABLE_DFLT RT6_TABLE_MAIN
215#define RT6_TABLE_INFO RT6_TABLE_MAIN
216#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
217
218#ifdef CONFIG_IPV6_MULTIPLE_TABLES
219#define FIB6_TABLE_MIN 1
220#define FIB6_TABLE_MAX RT_TABLE_MAX
221#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
222#else
223#define FIB6_TABLE_MIN RT_TABLE_MAIN
224#define FIB6_TABLE_MAX FIB6_TABLE_MIN
225#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
226#endif
227
228typedef struct rt6_info *(*pol_lookup_t)(struct net *,
229 struct fib6_table *,
230 struct flowi6 *, int);
231
232/*
233 * exported functions
234 */
235
236extern struct fib6_table *fib6_get_table(struct net *net, u32 id);
237extern struct fib6_table *fib6_new_table(struct net *net, u32 id);
238extern struct dst_entry *fib6_rule_lookup(struct net *net,
239 struct flowi6 *fl6, int flags,
240 pol_lookup_t lookup);
241
242extern struct fib6_node *fib6_lookup(struct fib6_node *root,
243 const struct in6_addr *daddr,
244 const struct in6_addr *saddr);
245
246struct fib6_node *fib6_locate(struct fib6_node *root,
247 const struct in6_addr *daddr, int dst_len,
248 const struct in6_addr *saddr, int src_len);
249
250extern void fib6_clean_all_ro(struct net *net,
251 int (*func)(struct rt6_info *, void *arg),
252 int prune, void *arg);
253
254extern void fib6_clean_all(struct net *net,
255 int (*func)(struct rt6_info *, void *arg),
256 int prune, void *arg);
257
258extern int fib6_add(struct fib6_node *root,
259 struct rt6_info *rt,
260 struct nl_info *info);
261
262extern int fib6_del(struct rt6_info *rt,
263 struct nl_info *info);
264
265extern void inet6_rt_notify(int event, struct rt6_info *rt,
266 struct nl_info *info);
267
268extern void fib6_run_gc(unsigned long expires,
269 struct net *net);
270
271extern void fib6_gc_cleanup(void);
272
273extern int fib6_init(void);
274
275#ifdef CONFIG_IPV6_MULTIPLE_TABLES
276extern int fib6_rules_init(void);
277extern void fib6_rules_cleanup(void);
278#else
279static inline int fib6_rules_init(void)
280{
281 return 0;
282}
283static inline void fib6_rules_cleanup(void)
284{
285 return ;
286}
287#endif
288#endif