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 struct rt6_info; 26 27 struct fib6_config 28 { 29 u32 fc_table; 30 u32 fc_metric; 31 int fc_dst_len; 32 int fc_src_len; 33 int fc_ifindex; 34 u32 fc_flags; 35 u32 fc_protocol; 36 37 struct in6_addr fc_dst; 38 struct in6_addr fc_src; 39 struct in6_addr fc_gateway; 40 41 unsigned long fc_expires; 42 struct nlattr *fc_mx; 43 int fc_mx_len; 44 45 struct nl_info fc_nlinfo; 46 }; 47 48 struct fib6_node 49 { 50 struct fib6_node *parent; 51 struct fib6_node *left; 52 struct fib6_node *right; 53 #ifdef CONFIG_IPV6_SUBTREES 54 struct fib6_node *subtree; 55 #endif 56 struct rt6_info *leaf; 57 58 __u16 fn_bit; /* bit key */ 59 __u16 fn_flags; 60 __u32 fn_sernum; 61 }; 62 63 #ifndef CONFIG_IPV6_SUBTREES 64 #define FIB6_SUBTREE(fn) NULL 65 #else 66 #define FIB6_SUBTREE(fn) ((fn)->subtree) 67 #endif 68 69 /* 70 * routing information 71 * 72 */ 73 74 struct rt6key 75 { 76 struct in6_addr addr; 77 int plen; 78 }; 79 80 struct fib6_table; 81 82 struct rt6_info 83 { 84 union { 85 struct dst_entry dst; 86 } u; 87 88 struct inet6_dev *rt6i_idev; 89 90 #define rt6i_dev u.dst.dev 91 #define rt6i_nexthop u.dst.neighbour 92 #define rt6i_expires u.dst.expires 93 94 struct fib6_node *rt6i_node; 95 96 struct in6_addr rt6i_gateway; 97 98 u32 rt6i_flags; 99 u32 rt6i_metric; 100 atomic_t rt6i_ref; 101 struct fib6_table *rt6i_table; 102 103 struct rt6key rt6i_dst; 104 struct rt6key rt6i_src; 105 106 u8 rt6i_protocol; 107 }; 108 109 static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst) 110 { 111 return ((struct rt6_info *)dst)->rt6i_idev; 112 } 113 114 struct fib6_walker_t 115 { 116 struct fib6_walker_t *prev, *next; 117 struct fib6_node *root, *node; 118 struct rt6_info *leaf; 119 unsigned char state; 120 unsigned char prune; 121 int (*func)(struct fib6_walker_t *); 122 void *args; 123 }; 124 125 struct rt6_statistics { 126 __u32 fib_nodes; 127 __u32 fib_route_nodes; 128 __u32 fib_rt_alloc; /* permanent routes */ 129 __u32 fib_rt_entries; /* rt entries in table */ 130 __u32 fib_rt_cache; /* cache routes */ 131 __u32 fib_discarded_routes; 132 }; 133 134 #define RTN_TL_ROOT 0x0001 135 #define RTN_ROOT 0x0002 /* tree root node */ 136 #define RTN_RTINFO 0x0004 /* node with valid routing info */ 137 138 /* 139 * priority levels (or metrics) 140 * 141 */ 142 143 #define RTPRI_FIREWALL 8 /* Firewall control information */ 144 #define RTPRI_FLOW 16 /* Flow based forwarding rules */ 145 #define RTPRI_KERN_CTL 32 /* Kernel control routes */ 146 147 #define RTPRI_USER_MIN 256 /* Mimimum user priority */ 148 #define RTPRI_USER_MAX 1024 /* Maximum user priority */ 149 150 #define RTPRI_KERN_DFLT 4096 /* Kernel default routes */ 151 152 #define MAX_FLOW_BACKTRACE 32 153 154 155 typedef void (*f_pnode)(struct fib6_node *fn, void *); 156 157 struct fib6_table { 158 struct hlist_node tb6_hlist; 159 u32 tb6_id; 160 rwlock_t tb6_lock; 161 struct fib6_node tb6_root; 162 }; 163 164 #define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC 165 #define RT6_TABLE_MAIN RT_TABLE_MAIN 166 #define RT6_TABLE_DFLT RT6_TABLE_MAIN 167 #define RT6_TABLE_INFO RT6_TABLE_MAIN 168 #define RT6_TABLE_PREFIX RT6_TABLE_MAIN 169 170 #ifdef CONFIG_IPV6_MULTIPLE_TABLES 171 #define FIB6_TABLE_MIN 1 172 #define FIB6_TABLE_MAX RT_TABLE_MAX 173 #define RT6_TABLE_LOCAL RT_TABLE_LOCAL 174 #else 175 #define FIB6_TABLE_MIN RT_TABLE_MAIN 176 #define FIB6_TABLE_MAX FIB6_TABLE_MIN 177 #define RT6_TABLE_LOCAL RT6_TABLE_MAIN 178 #endif 179 180 typedef struct rt6_info *(*pol_lookup_t)(struct fib6_table *, 181 struct flowi *, int); 182 183 /* 184 * exported functions 185 */ 186 187 extern struct fib6_table * fib6_get_table(u32 id); 188 extern struct fib6_table * fib6_new_table(u32 id); 189 extern struct dst_entry * fib6_rule_lookup(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(int (*func)(struct rt6_info *, void *arg), 201 int prune, void *arg); 202 203 extern int fib6_add(struct fib6_node *root, 204 struct rt6_info *rt, 205 struct nl_info *info); 206 207 extern int fib6_del(struct rt6_info *rt, 208 struct nl_info *info); 209 210 extern void inet6_rt_notify(int event, struct rt6_info *rt, 211 struct nl_info *info); 212 213 extern void fib6_run_gc(unsigned long dummy); 214 215 extern void fib6_gc_cleanup(void); 216 217 extern void fib6_init(void); 218 219 extern void fib6_rules_init(void); 220 extern void fib6_rules_cleanup(void); 221 extern int fib6_rules_dump(struct sk_buff *, 222 struct netlink_callback *); 223 224 #endif 225 #endif 226