[NET]: Protocol Independant Policy Routing Rules Framework
[GitHub/mt8127/android_kernel_alcatel_ttab.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
16#ifdef __KERNEL__
17
18#include <linux/ipv6_route.h>
19
20#include <net/dst.h>
21#include <net/flow.h>
22#include <linux/rtnetlink.h>
23#include <linux/spinlock.h>
24
25struct rt6_info;
26
27struct fib6_node
28{
29 struct fib6_node *parent;
30 struct fib6_node *left;
31 struct fib6_node *right;
32
33 struct fib6_node *subtree;
34
35 struct rt6_info *leaf;
36
37 __u16 fn_bit; /* bit key */
38 __u16 fn_flags;
39 __u32 fn_sernum;
40};
41
42
43/*
44 * routing information
45 *
46 */
47
48struct rt6key
49{
50 struct in6_addr addr;
51 int plen;
52};
53
c71099ac
TG
54struct fib6_table;
55
1da177e4
LT
56struct rt6_info
57{
58 union {
59 struct dst_entry dst;
60 struct rt6_info *next;
61 } u;
62
63 struct inet6_dev *rt6i_idev;
64
65#define rt6i_dev u.dst.dev
66#define rt6i_nexthop u.dst.neighbour
67#define rt6i_expires u.dst.expires
68
69 struct fib6_node *rt6i_node;
70
71 struct in6_addr rt6i_gateway;
72
73 u32 rt6i_flags;
74 u32 rt6i_metric;
75 atomic_t rt6i_ref;
c71099ac 76 struct fib6_table *rt6i_table;
1da177e4
LT
77
78 struct rt6key rt6i_dst;
79 struct rt6key rt6i_src;
80
81 u8 rt6i_protocol;
82};
83
84struct fib6_walker_t
85{
86 struct fib6_walker_t *prev, *next;
87 struct fib6_node *root, *node;
88 struct rt6_info *leaf;
89 unsigned char state;
90 unsigned char prune;
91 int (*func)(struct fib6_walker_t *);
92 void *args;
93};
94
95extern struct fib6_walker_t fib6_walker_list;
96extern rwlock_t fib6_walker_lock;
97
98static inline void fib6_walker_link(struct fib6_walker_t *w)
99{
100 write_lock_bh(&fib6_walker_lock);
101 w->next = fib6_walker_list.next;
102 w->prev = &fib6_walker_list;
103 w->next->prev = w;
104 w->prev->next = w;
105 write_unlock_bh(&fib6_walker_lock);
106}
107
108static inline void fib6_walker_unlink(struct fib6_walker_t *w)
109{
110 write_lock_bh(&fib6_walker_lock);
111 w->next->prev = w->prev;
112 w->prev->next = w->next;
113 w->prev = w->next = w;
114 write_unlock_bh(&fib6_walker_lock);
115}
116
117struct rt6_statistics {
118 __u32 fib_nodes;
119 __u32 fib_route_nodes;
120 __u32 fib_rt_alloc; /* permanent routes */
121 __u32 fib_rt_entries; /* rt entries in table */
122 __u32 fib_rt_cache; /* cache routes */
123 __u32 fib_discarded_routes;
124};
125
126#define RTN_TL_ROOT 0x0001
127#define RTN_ROOT 0x0002 /* tree root node */
128#define RTN_RTINFO 0x0004 /* node with valid routing info */
129
130/*
131 * priority levels (or metrics)
132 *
133 */
134
135#define RTPRI_FIREWALL 8 /* Firewall control information */
136#define RTPRI_FLOW 16 /* Flow based forwarding rules */
137#define RTPRI_KERN_CTL 32 /* Kernel control routes */
138
139#define RTPRI_USER_MIN 256 /* Mimimum user priority */
140#define RTPRI_USER_MAX 1024 /* Maximum user priority */
141
142#define RTPRI_KERN_DFLT 4096 /* Kernel default routes */
143
144#define MAX_FLOW_BACKTRACE 32
145
146
147typedef void (*f_pnode)(struct fib6_node *fn, void *);
148
c71099ac
TG
149struct fib6_table {
150 struct hlist_node tb6_hlist;
151 u32 tb6_id;
152 rwlock_t tb6_lock;
153 struct fib6_node tb6_root;
154};
155
156#define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
157#define RT6_TABLE_MAIN RT_TABLE_MAIN
158#define RT6_TABLE_LOCAL RT6_TABLE_MAIN
159#define RT6_TABLE_DFLT RT6_TABLE_MAIN
160#define RT6_TABLE_INFO RT6_TABLE_MAIN
161#define RT6_TABLE_PREFIX RT6_TABLE_MAIN
162
163#ifdef CONFIG_IPV6_MULTIPLE_TABLES
164#define FIB6_TABLE_MIN 1
165#define FIB6_TABLE_MAX RT_TABLE_MAX
166#else
167#define FIB6_TABLE_MIN RT_TABLE_MAIN
168#define FIB6_TABLE_MAX FIB6_TABLE_MIN
169#endif
170
171#define RT6_F_STRICT 1
172#define RT6_F_HAS_SADDR 2
173
174typedef struct rt6_info *(*pol_lookup_t)(struct fib6_table *,
175 struct flowi *, int);
1da177e4
LT
176
177/*
178 * exported functions
179 */
180
c71099ac
TG
181extern struct fib6_table * fib6_get_table(u32 id);
182extern struct fib6_table * fib6_new_table(u32 id);
183extern struct dst_entry * fib6_rule_lookup(struct flowi *fl, int flags,
184 pol_lookup_t lookup);
185
1da177e4
LT
186extern struct fib6_node *fib6_lookup(struct fib6_node *root,
187 struct in6_addr *daddr,
188 struct in6_addr *saddr);
189
190struct fib6_node *fib6_locate(struct fib6_node *root,
191 struct in6_addr *daddr, int dst_len,
192 struct in6_addr *saddr, int src_len);
193
194extern void fib6_clean_tree(struct fib6_node *root,
195 int (*func)(struct rt6_info *, void *arg),
196 int prune, void *arg);
197
c71099ac
TG
198extern void fib6_clean_all(int (*func)(struct rt6_info *, void *arg),
199 int prune, void *arg);
200
1da177e4
LT
201extern int fib6_walk(struct fib6_walker_t *w);
202extern int fib6_walk_continue(struct fib6_walker_t *w);
203
204extern int fib6_add(struct fib6_node *root,
205 struct rt6_info *rt,
206 struct nlmsghdr *nlh,
0d51aa80
JHS
207 void *rtattr,
208 struct netlink_skb_parms *req);
1da177e4
LT
209
210extern int fib6_del(struct rt6_info *rt,
211 struct nlmsghdr *nlh,
0d51aa80
JHS
212 void *rtattr,
213 struct netlink_skb_parms *req);
1da177e4
LT
214
215extern void inet6_rt_notify(int event, struct rt6_info *rt,
0d51aa80
JHS
216 struct nlmsghdr *nlh,
217 struct netlink_skb_parms *req);
1da177e4
LT
218
219extern void fib6_run_gc(unsigned long dummy);
220
221extern void fib6_gc_cleanup(void);
222
223extern void fib6_init(void);
224#endif
225#endif