tjh.dev
Linux kernel mirror (for testing)
git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel
os
linux
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#define rt6i_dev dst.dev
90#define rt6i_nexthop dst.neighbour
91#define rt6i_expires dst.expires
92
93 /*
94 * Tail elements of dst_entry (__refcnt etc.)
95 * and these elements (rarely used in hot path) are in
96 * the same cache line.
97 */
98 struct fib6_table *rt6i_table;
99 struct fib6_node *rt6i_node;
100
101 struct in6_addr rt6i_gateway;
102
103 atomic_t rt6i_ref;
104
105 /* These are in a separate cache line. */
106 struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
107 u32 rt6i_flags;
108 struct rt6key rt6i_src;
109 struct rt6key rt6i_prefsrc;
110 u32 rt6i_metric;
111 u32 rt6i_peer_genid;
112
113 struct inet6_dev *rt6i_idev;
114 struct inet_peer *rt6i_peer;
115
116#ifdef CONFIG_XFRM
117 u32 rt6i_flow_cache_genid;
118#endif
119 /* more non-fragment space at head required */
120 unsigned short rt6i_nfheader_len;
121
122 u8 rt6i_protocol;
123};
124
125static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
126{
127 return ((struct rt6_info *)dst)->rt6i_idev;
128}
129
130struct fib6_walker_t {
131 struct list_head lh;
132 struct fib6_node *root, *node;
133 struct rt6_info *leaf;
134 unsigned char state;
135 unsigned char prune;
136 unsigned int skip;
137 unsigned int count;
138 int (*func)(struct fib6_walker_t *);
139 void *args;
140};
141
142struct rt6_statistics {
143 __u32 fib_nodes;
144 __u32 fib_route_nodes;
145 __u32 fib_rt_alloc; /* permanent routes */
146 __u32 fib_rt_entries; /* rt entries in table */
147 __u32 fib_rt_cache; /* cache routes */
148 __u32 fib_discarded_routes;
149};
150
151#define RTN_TL_ROOT 0x0001
152#define RTN_ROOT 0x0002 /* tree root node */
153#define RTN_RTINFO 0x0004 /* node with valid routing info */
154
155/*
156 * priority levels (or metrics)
157 *
158 */
159
160
161struct fib6_table {
162 struct hlist_node tb6_hlist;
163 u32 tb6_id;
164 rwlock_t tb6_lock;
165 struct fib6_node tb6_root;
166};
167
168#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
169#define RT6_TABLE_MAIN RT_TABLE_MAIN
170#define RT6_TABLE_DFLT RT6_TABLE_MAIN
171#define RT6_TABLE_INFO RT6_TABLE_MAIN
172#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
173
174#ifdef CONFIG_IPV6_MULTIPLE_TABLES
175#define FIB6_TABLE_MIN 1
176#define FIB6_TABLE_MAX RT_TABLE_MAX
177#define RT6_TABLE_LOCAL RT_TABLE_LOCAL
178#else
179#define FIB6_TABLE_MIN RT_TABLE_MAIN
180#define FIB6_TABLE_MAX FIB6_TABLE_MIN
181#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
182#endif
183
184typedef struct rt6_info *(*pol_lookup_t)(struct net *,
185 struct fib6_table *,
186 struct flowi6 *, int);
187
188/*
189 * exported functions
190 */
191
192extern struct fib6_table *fib6_get_table(struct net *net, u32 id);
193extern struct fib6_table *fib6_new_table(struct net *net, u32 id);
194extern struct dst_entry *fib6_rule_lookup(struct net *net,
195 struct flowi6 *fl6, int flags,
196 pol_lookup_t lookup);
197
198extern struct fib6_node *fib6_lookup(struct fib6_node *root,
199 const struct in6_addr *daddr,
200 const struct in6_addr *saddr);
201
202struct fib6_node *fib6_locate(struct fib6_node *root,
203 const struct in6_addr *daddr, int dst_len,
204 const struct in6_addr *saddr, int src_len);
205
206extern void fib6_clean_all(struct net *net,
207 int (*func)(struct rt6_info *, void *arg),
208 int prune, void *arg);
209
210extern int fib6_add(struct fib6_node *root,
211 struct rt6_info *rt,
212 struct nl_info *info);
213
214extern int fib6_del(struct rt6_info *rt,
215 struct nl_info *info);
216
217extern void inet6_rt_notify(int event, struct rt6_info *rt,
218 struct nl_info *info);
219
220extern void fib6_run_gc(unsigned long expires,
221 struct net *net);
222
223extern void fib6_gc_cleanup(void);
224
225extern int fib6_init(void);
226
227#ifdef CONFIG_IPV6_MULTIPLE_TABLES
228extern int fib6_rules_init(void);
229extern void fib6_rules_cleanup(void);
230#else
231static inline int fib6_rules_init(void)
232{
233 return 0;
234}
235static inline void fib6_rules_cleanup(void)
236{
237 return ;
238}
239#endif
240#endif