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 #include <linux/rtnetlink.h> 20 #include <linux/spinlock.h> 21 #include <net/dst.h> 22 #include <net/flow.h> 23 #include <net/netlink.h> 24 25 #ifdef CONFIG_IPV6_MULTIPLE_TABLES 26 #define FIB6_TABLE_HASHSZ 256 27 #else 28 #define FIB6_TABLE_HASHSZ 1 29 #endif 30 31 struct rt6_info; 32 33 struct fib6_config { 34 u32 fc_table; 35 u32 fc_metric; 36 int fc_dst_len; 37 int fc_src_len; 38 int fc_ifindex; 39 u32 fc_flags; 40 u32 fc_protocol; 41 42 struct in6_addr fc_dst; 43 struct in6_addr fc_src; 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 53 struct 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 79 struct rt6key { 80 struct in6_addr addr; 81 int plen; 82 }; 83 84 struct fib6_table; 85 86 struct rt6_info { 87 union { 88 struct dst_entry dst; 89 } u; 90 91 struct inet6_dev *rt6i_idev; 92 93 #define rt6i_dev u.dst.dev 94 #define rt6i_nexthop u.dst.neighbour 95 #define rt6i_expires u.dst.expires 96 97 struct fib6_node *rt6i_node; 98 99 struct in6_addr rt6i_gateway; 100 101 u32 rt6i_flags; 102 u32 rt6i_metric; 103 atomic_t rt6i_ref; 104 105 /* more non-fragment space at head required */ 106 unsigned short rt6i_nfheader_len; 107 108 u8 rt6i_protocol; 109 110 struct fib6_table *rt6i_table; 111 112 struct rt6key rt6i_dst; 113 114 #ifdef CONFIG_XFRM 115 u32 rt6i_flow_cache_genid; 116 #endif 117 118 struct rt6key rt6i_src; 119 }; 120 121 static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst) 122 { 123 return ((struct rt6_info *)dst)->rt6i_idev; 124 } 125 126 struct fib6_walker_t { 127 struct fib6_walker_t *prev, *next; 128 struct fib6_node *root, *node; 129 struct rt6_info *leaf; 130 unsigned char state; 131 unsigned char prune; 132 int (*func)(struct fib6_walker_t *); 133 void *args; 134 }; 135 136 struct rt6_statistics { 137 __u32 fib_nodes; 138 __u32 fib_route_nodes; 139 __u32 fib_rt_alloc; /* permanent routes */ 140 __u32 fib_rt_entries; /* rt entries in table */ 141 __u32 fib_rt_cache; /* cache routes */ 142 __u32 fib_discarded_routes; 143 }; 144 145 #define RTN_TL_ROOT 0x0001 146 #define RTN_ROOT 0x0002 /* tree root node */ 147 #define RTN_RTINFO 0x0004 /* node with valid routing info */ 148 149 /* 150 * priority levels (or metrics) 151 * 152 */ 153 154 155 struct fib6_table { 156 struct hlist_node tb6_hlist; 157 u32 tb6_id; 158 rwlock_t tb6_lock; 159 struct fib6_node tb6_root; 160 }; 161 162 #define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC 163 #define RT6_TABLE_MAIN RT_TABLE_MAIN 164 #define RT6_TABLE_DFLT RT6_TABLE_MAIN 165 #define RT6_TABLE_INFO RT6_TABLE_MAIN 166 #define RT6_TABLE_PREFIX RT6_TABLE_MAIN 167 168 #ifdef CONFIG_IPV6_MULTIPLE_TABLES 169 #define FIB6_TABLE_MIN 1 170 #define FIB6_TABLE_MAX RT_TABLE_MAX 171 #define RT6_TABLE_LOCAL RT_TABLE_LOCAL 172 #else 173 #define FIB6_TABLE_MIN RT_TABLE_MAIN 174 #define FIB6_TABLE_MAX FIB6_TABLE_MIN 175 #define RT6_TABLE_LOCAL RT6_TABLE_MAIN 176 #endif 177 178 typedef struct rt6_info *(*pol_lookup_t)(struct net *, 179 struct fib6_table *, 180 struct flowi *, int); 181 182 /* 183 * exported functions 184 */ 185 186 extern struct fib6_table *fib6_get_table(struct net *net, u32 id); 187 extern struct fib6_table *fib6_new_table(struct net *net, u32 id); 188 extern struct dst_entry *fib6_rule_lookup(struct net *net, 189 struct flowi *fl, int flags, 190 pol_lookup_t lookup); 191 192 extern struct fib6_node *fib6_lookup(struct fib6_node *root, 193 struct in6_addr *daddr, 194 struct in6_addr *saddr); 195 196 struct fib6_node *fib6_locate(struct fib6_node *root, 197 struct in6_addr *daddr, int dst_len, 198 struct in6_addr *saddr, int src_len); 199 200 extern void fib6_clean_all(struct net *net, 201 int (*func)(struct rt6_info *, void *arg), 202 int prune, void *arg); 203 204 extern int fib6_add(struct fib6_node *root, 205 struct rt6_info *rt, 206 struct nl_info *info); 207 208 extern int fib6_del(struct rt6_info *rt, 209 struct nl_info *info); 210 211 extern void inet6_rt_notify(int event, struct rt6_info *rt, 212 struct nl_info *info); 213 214 extern void fib6_run_gc(unsigned long expires, 215 struct net *net); 216 217 extern void fib6_gc_cleanup(void); 218 219 extern int fib6_init(void); 220 221 #ifdef CONFIG_IPV6_MULTIPLE_TABLES 222 extern int fib6_rules_init(void); 223 extern void fib6_rules_cleanup(void); 224 #else 225 static inline int fib6_rules_init(void) 226 { 227 return 0; 228 } 229 static inline void fib6_rules_cleanup(void) 230 { 231 return ; 232 } 233 #endif 234 #endif 235 #endif 236