]> git.proxmox.com Git - mirror_ubuntu-eoan-kernel.git/blame - include/net/ip6_fib.h
ipv6: Only create RTF_CACHE routes after encountering pmtu exception
[mirror_ubuntu-eoan-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;
42b18706 67 int 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 76
e715b6d3
FW
77struct mx6_config {
78 const u32 *mx;
79 DECLARE_BITMAP(mx_valid, RTAX_MAX);
80};
81
1da177e4
LT
82/*
83 * routing information
84 *
85 */
86
fd2c3ef7 87struct rt6key {
1da177e4
LT
88 struct in6_addr addr;
89 int plen;
90};
91
c71099ac
TG
92struct fib6_table;
93
fd2c3ef7 94struct rt6_info {
d8d1f30b 95 struct dst_entry dst;
1da177e4 96
bd2c77a0
YH
97 /*
98 * Tail elements of dst_entry (__refcnt etc.)
99 * and these elements (rarely used in hot path) are in
100 * the same cache line.
101 */
102 struct fib6_table *rt6i_table;
1da177e4
LT
103 struct fib6_node *rt6i_node;
104
105 struct in6_addr rt6i_gateway;
1da177e4 106
51ebd318
ND
107 /* Multipath routes:
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.
111 */
112 struct list_head rt6i_siblings;
113 unsigned int rt6i_nsiblings;
114
bd2c77a0 115 atomic_t rt6i_ref;
a47ed4cd 116
bd2c77a0
YH
117 /* These are in a separate cache line. */
118 struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
119 u32 rt6i_flags;
120 struct rt6key rt6i_src;
c3968a85 121 struct rt6key rt6i_prefsrc;
b4ce9277 122
bd2c77a0 123 struct inet6_dev *rt6i_idev;
b4ce9277 124
705f1c86 125 u32 rt6i_metric;
4b32b5ad 126 u32 rt6i_pmtu;
bd2c77a0
YH
127 /* more non-fragment space at head required */
128 unsigned short rt6i_nfheader_len;
bd2c77a0 129 u8 rt6i_protocol;
1da177e4
LT
130};
131
7a3025b1
YH
132static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
133{
134 return ((struct rt6_info *)dst)->rt6i_idev;
135}
136
1716a961
G
137static inline void rt6_clean_expires(struct rt6_info *rt)
138{
1716a961 139 rt->rt6i_flags &= ~RTF_EXPIRES;
01ba16d6 140 rt->dst.expires = 0;
1716a961
G
141}
142
143static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
144{
1716a961 145 rt->dst.expires = expires;
ecd98837 146 rt->rt6i_flags |= RTF_EXPIRES;
1716a961
G
147}
148
ecd98837 149static inline void rt6_update_expires(struct rt6_info *rt0, int timeout)
1716a961 150{
ecd98837
YH
151 struct rt6_info *rt;
152
153 for (rt = rt0; rt && !(rt->rt6i_flags & RTF_EXPIRES);
154 rt = (struct rt6_info *)rt->dst.from);
155 if (rt && rt != rt0)
156 rt0->dst.expires = rt->dst.expires;
157
158 dst_set_expires(&rt0->dst, timeout);
159 rt0->rt6i_flags |= RTF_EXPIRES;
1716a961 160}
1716a961 161
94e187c0
AW
162static inline void ip6_rt_put(struct rt6_info *rt)
163{
164 /* dst_release() accepts a NULL parameter.
165 * We rely on dst being first structure in struct rt6_info
166 */
167 BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
168 dst_release(&rt->dst);
169}
170
94b2cfe0
HFS
171enum fib6_walk_state {
172#ifdef CONFIG_IPV6_SUBTREES
173 FWS_S,
174#endif
175 FWS_L,
176 FWS_R,
177 FWS_C,
178 FWS_U
179};
180
181struct fib6_walker {
bbef49da 182 struct list_head lh;
1da177e4
LT
183 struct fib6_node *root, *node;
184 struct rt6_info *leaf;
94b2cfe0
HFS
185 enum fib6_walk_state state;
186 bool prune;
2bec5a36
PM
187 unsigned int skip;
188 unsigned int count;
94b2cfe0 189 int (*func)(struct fib6_walker *);
1da177e4
LT
190 void *args;
191};
192
1da177e4
LT
193struct rt6_statistics {
194 __u32 fib_nodes;
195 __u32 fib_route_nodes;
196 __u32 fib_rt_alloc; /* permanent routes */
197 __u32 fib_rt_entries; /* rt entries in table */
198 __u32 fib_rt_cache; /* cache routes */
199 __u32 fib_discarded_routes;
200};
201
202#define RTN_TL_ROOT 0x0001
203#define RTN_ROOT 0x0002 /* tree root node */
204#define RTN_RTINFO 0x0004 /* node with valid routing info */
205
206/*
207 * priority levels (or metrics)
208 *
209 */
210
1da177e4 211
c71099ac
TG
212struct fib6_table {
213 struct hlist_node tb6_hlist;
214 u32 tb6_id;
215 rwlock_t tb6_lock;
216 struct fib6_node tb6_root;
8e773277 217 struct inet_peer_base tb6_peers;
c71099ac
TG
218};
219
220#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
221#define RT6_TABLE_MAIN RT_TABLE_MAIN
c71099ac
TG
222#define RT6_TABLE_DFLT RT6_TABLE_MAIN
223#define RT6_TABLE_INFO RT6_TABLE_MAIN
224#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
225
226#ifdef CONFIG_IPV6_MULTIPLE_TABLES
227#define FIB6_TABLE_MIN 1
228#define FIB6_TABLE_MAX RT_TABLE_MAX
101367c2 229#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
c71099ac
TG
230#else
231#define FIB6_TABLE_MIN RT_TABLE_MAIN
232#define FIB6_TABLE_MAX FIB6_TABLE_MIN
101367c2 233#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
c71099ac
TG
234#endif
235
8ed67789
DL
236typedef struct rt6_info *(*pol_lookup_t)(struct net *,
237 struct fib6_table *,
4c9483b2 238 struct flowi6 *, int);
1da177e4
LT
239
240/*
241 * exported functions
242 */
243
5c3a0fd7
JP
244struct fib6_table *fib6_get_table(struct net *net, u32 id);
245struct fib6_table *fib6_new_table(struct net *net, u32 id);
246struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6,
247 int flags, pol_lookup_t lookup);
c71099ac 248
5c3a0fd7
JP
249struct fib6_node *fib6_lookup(struct fib6_node *root,
250 const struct in6_addr *daddr,
251 const struct in6_addr *saddr);
1da177e4 252
5c3a0fd7
JP
253struct fib6_node *fib6_locate(struct fib6_node *root,
254 const struct in6_addr *daddr, int dst_len,
255 const struct in6_addr *saddr, int src_len);
1da177e4 256
5c3a0fd7 257void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
0c3584d5 258 void *arg);
c71099ac 259
e715b6d3
FW
260int fib6_add(struct fib6_node *root, struct rt6_info *rt,
261 struct nl_info *info, struct mx6_config *mxc);
5c3a0fd7 262int fib6_del(struct rt6_info *rt, struct nl_info *info);
1da177e4 263
5c3a0fd7 264void inet6_rt_notify(int event, struct rt6_info *rt, struct nl_info *info);
1da177e4 265
5c3a0fd7 266void fib6_run_gc(unsigned long expires, struct net *net, bool force);
1da177e4 267
5c3a0fd7 268void fib6_gc_cleanup(void);
1da177e4 269
5c3a0fd7 270int fib6_init(void);
101367c2 271
8d2ca1d7
HFS
272int ipv6_route_open(struct inode *inode, struct file *file);
273
7e5449c2 274#ifdef CONFIG_IPV6_MULTIPLE_TABLES
5c3a0fd7
JP
275int fib6_rules_init(void);
276void fib6_rules_cleanup(void);
7e5449c2
DL
277#else
278static inline int fib6_rules_init(void)
279{
280 return 0;
281}
282static inline void fib6_rules_cleanup(void)
283{
284 return ;
285}
286#endif
1da177e4 287#endif