]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - include/net/ip6_fib.h
net: validate_xmit_vlan() is static
[mirror_ubuntu-bionic-kernel.git] / include / net / ip6_fib.h
CommitLineData
1da177e4
LT
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
1da177e4 16#include <linux/ipv6_route.h>
1da177e4
LT
17#include <linux/rtnetlink.h>
18#include <linux/spinlock.h>
86872cb5
TG
19#include <net/dst.h>
20#include <net/flow.h>
21#include <net/netlink.h>
b3419363 22#include <net/inetpeer.h>
1da177e4 23
a33bc5c1
NH
24#ifdef CONFIG_IPV6_MULTIPLE_TABLES
25#define FIB6_TABLE_HASHSZ 256
26#else
27#define FIB6_TABLE_HASHSZ 1
28#endif
29
1da177e4
LT
30struct rt6_info;
31
fd2c3ef7 32struct fib6_config {
86872cb5
TG
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;
ef2c7d7b 40 u32 fc_type; /* only 8 bits are used */
86872cb5
TG
41
42 struct in6_addr fc_dst;
43 struct in6_addr fc_src;
c3968a85 44 struct in6_addr fc_prefsrc;
86872cb5
TG
45 struct in6_addr fc_gateway;
46
47 unsigned long fc_expires;
48 struct nlattr *fc_mx;
49 int fc_mx_len;
51ebd318
ND
50 int fc_mp_len;
51 struct nlattr *fc_mp;
86872cb5
TG
52
53 struct nl_info fc_nlinfo;
54};
55
fd2c3ef7 56struct fib6_node {
1da177e4
LT
57 struct fib6_node *parent;
58 struct fib6_node *left;
59 struct fib6_node *right;
8bce65b9 60#ifdef CONFIG_IPV6_SUBTREES
1da177e4 61 struct fib6_node *subtree;
8bce65b9 62#endif
1da177e4
LT
63 struct rt6_info *leaf;
64
65 __u16 fn_bit; /* bit key */
66 __u16 fn_flags;
67 __u32 fn_sernum;
f11e6659 68 struct rt6_info *rr_ptr;
1da177e4
LT
69};
70
7fc33165
YH
71#ifndef CONFIG_IPV6_SUBTREES
72#define FIB6_SUBTREE(fn) NULL
73#else
74#define FIB6_SUBTREE(fn) ((fn)->subtree)
75#endif
1da177e4
LT
76
77/*
78 * routing information
79 *
80 */
81
fd2c3ef7 82struct rt6key {
1da177e4
LT
83 struct in6_addr addr;
84 int plen;
85};
86
c71099ac
TG
87struct fib6_table;
88
fd2c3ef7 89struct rt6_info {
d8d1f30b 90 struct dst_entry dst;
1da177e4 91
bd2c77a0
YH
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;
1da177e4
LT
98 struct fib6_node *rt6i_node;
99
100 struct in6_addr rt6i_gateway;
1da177e4 101
51ebd318
ND
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
bd2c77a0 110 atomic_t rt6i_ref;
a47ed4cd 111
bd2c77a0
YH
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;
c3968a85 116 struct rt6key rt6i_prefsrc;
b4ce9277 117
bd2c77a0 118 struct inet6_dev *rt6i_idev;
97bab73f 119 unsigned long _rt6i_peer;
b4ce9277 120
705f1c86 121 u32 rt6i_metric;
bd2c77a0
YH
122 /* more non-fragment space at head required */
123 unsigned short rt6i_nfheader_len;
bd2c77a0 124 u8 rt6i_protocol;
1da177e4
LT
125};
126
97bab73f
DM
127static inline struct inet_peer *rt6_peer_ptr(struct rt6_info *rt)
128{
129 return inetpeer_ptr(rt->_rt6i_peer);
130}
131
132static inline bool rt6_has_peer(struct rt6_info *rt)
133{
134 return inetpeer_ptr_is_peer(rt->_rt6i_peer);
135}
136
137static inline void __rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
138{
139 __inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
140}
141
142static inline bool rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
143{
144 return inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
145}
146
147static inline void rt6_init_peer(struct rt6_info *rt, struct inet_peer_base *base)
148{
149 inetpeer_init_ptr(&rt->_rt6i_peer, base);
150}
151
152static inline void rt6_transfer_peer(struct rt6_info *rt, struct rt6_info *ort)
153{
154 inetpeer_transfer_peer(&rt->_rt6i_peer, &ort->_rt6i_peer);
155}
156
7a3025b1
YH
157static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
158{
159 return ((struct rt6_info *)dst)->rt6i_idev;
160}
161
1716a961
G
162static inline void rt6_clean_expires(struct rt6_info *rt)
163{
1716a961 164 rt->rt6i_flags &= ~RTF_EXPIRES;
01ba16d6 165 rt->dst.expires = 0;
1716a961
G
166}
167
168static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
169{
1716a961 170 rt->dst.expires = expires;
ecd98837 171 rt->rt6i_flags |= RTF_EXPIRES;
1716a961
G
172}
173
ecd98837 174static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
1716a961 175{
ecd98837
YH
176 struct rt6_info *rt;
177
178 for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
179 rt = (struct rt6_info *)rt->dst.from);
180 if (rt && rt != rt0)
181 rt0->dst.expires = rt->dst.expires;
182
183 dst_set_expires(&rt0->dst, timeout);
184 rt0->rt6i_flags |= RTF_EXPIRES;
1716a961
G
185}
186
187static inline void rt6_set_from(struct rt6_info *rt, struct rt6_info *from)
188{
189 struct dst_entry *new = (struct dst_entry *) from;
190
1716a961 191 rt->rt6i_flags &= ~RTF_EXPIRES;
1716a961 192 dst_hold(new);
ecd98837 193 rt->dst.from = new;
1716a961
G
194}
195
94e187c0
AW
196static inline void ip6_rt_put(struct rt6_info *rt)
197{
198 /* dst_release() accepts a NULL parameter.
199 * We rely on dst being first structure in struct rt6_info
200 */
201 BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
202 dst_release(&rt->dst);
203}
204
fd2c3ef7 205struct fib6_walker_t {
bbef49da 206 struct list_head lh;
1da177e4
LT
207 struct fib6_node *root, *node;
208 struct rt6_info *leaf;
209 unsigned char state;
210 unsigned char prune;
2bec5a36
PM
211 unsigned int skip;
212 unsigned int count;
1da177e4
LT
213 int (*func)(struct fib6_walker_t *);
214 void *args;
215};
216
1da177e4
LT
217struct rt6_statistics {
218 __u32 fib_nodes;
219 __u32 fib_route_nodes;
220 __u32 fib_rt_alloc; /* permanent routes */
221 __u32 fib_rt_entries; /* rt entries in table */
222 __u32 fib_rt_cache; /* cache routes */
223 __u32 fib_discarded_routes;
224};
225
226#define RTN_TL_ROOT 0x0001
227#define RTN_ROOT 0x0002 /* tree root node */
228#define RTN_RTINFO 0x0004 /* node with valid routing info */
229
230/*
231 * priority levels (or metrics)
232 *
233 */
234
1da177e4 235
c71099ac
TG
236struct fib6_table {
237 struct hlist_node tb6_hlist;
238 u32 tb6_id;
239 rwlock_t tb6_lock;
240 struct fib6_node tb6_root;
8e773277 241 struct inet_peer_base tb6_peers;
c71099ac
TG
242};
243
244#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
245#define RT6_TABLE_MAIN RT_TABLE_MAIN
c71099ac
TG
246#define RT6_TABLE_DFLT RT6_TABLE_MAIN
247#define RT6_TABLE_INFO RT6_TABLE_MAIN
248#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
249
250#ifdef CONFIG_IPV6_MULTIPLE_TABLES
251#define FIB6_TABLE_MIN 1
252#define FIB6_TABLE_MAX RT_TABLE_MAX
101367c2 253#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
c71099ac
TG
254#else
255#define FIB6_TABLE_MIN RT_TABLE_MAIN
256#define FIB6_TABLE_MAX FIB6_TABLE_MIN
101367c2 257#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
c71099ac
TG
258#endif
259
8ed67789
DL
260typedef struct rt6_info *(*pol_lookup_t)(struct net *,
261 struct fib6_table *,
4c9483b2 262 struct flowi6 *, int);
1da177e4
LT
263
264/*
265 * exported functions
266 */
267
5c3a0fd7
JP
268struct fib6_table *fib6_get_table(struct net *net, u32 id);
269struct fib6_table *fib6_new_table(struct net *net, u32 id);
270struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
271 int flags, pol_lookup_t lookup);
c71099ac 272
5c3a0fd7
JP
273struct fib6_node *fib6_lookup(struct fib6_node *root,
274 const struct in6_addr *daddr,
275 const struct in6_addr *saddr);
1da177e4 276
5c3a0fd7
JP
277struct fib6_node *fib6_locate(struct fib6_node *root,
278 const struct in6_addr *daddr, int dst_len,
279 const struct in6_addr *saddr, int src_len);
1da177e4 280
5c3a0fd7 281void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
0c3584d5 282 void *arg);
c71099ac 283
e5fd387a
MK
284int fib6_add(struct fib6_node *root, struct rt6_info *rt, struct nl_info *info,
285 struct nlattr *mx, int mx_len);
1da177e4 286
5c3a0fd7 287int fib6_del(struct rt6_info *rt, struct nl_info *info);
1da177e4 288
5c3a0fd7 289void inet6_rt_notify(int event, struct rt6_info *rt, struct nl_info *info);
1da177e4 290
5c3a0fd7 291void fib6_run_gc(unsigned long expires, struct net *net, bool force);
1da177e4 292
5c3a0fd7 293void fib6_gc_cleanup(void);
1da177e4 294
5c3a0fd7 295int fib6_init(void);
101367c2 296
8d2ca1d7
HFS
297int ipv6_route_open(struct inode *inode, struct file *file);
298
7e5449c2 299#ifdef CONFIG_IPV6_MULTIPLE_TABLES
5c3a0fd7
JP
300int fib6_rules_init(void);
301void fib6_rules_cleanup(void);
7e5449c2
DL
302#else
303static inline int fib6_rules_init(void)
304{
305 return 0;
306}
307static inline void fib6_rules_cleanup(void)
308{
309 return ;
310}
311#endif
1da177e4 312#endif