ip6_fib.h 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337
  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. #ifndef _IP6_FIB_H
  13. #define _IP6_FIB_H
  14. #include <linux/ipv6_route.h>
  15. #include <linux/rtnetlink.h>
  16. #include <linux/spinlock.h>
  17. #include <net/dst.h>
  18. #include <net/flow.h>
  19. #include <net/netlink.h>
  20. #include <net/inetpeer.h>
  21. #ifdef CONFIG_IPV6_MULTIPLE_TABLES
  22. #define FIB6_TABLE_HASHSZ 256
  23. #else
  24. #define FIB6_TABLE_HASHSZ 1
  25. #endif
  26. struct rt6_info;
  27. struct fib6_config {
  28. u32 fc_table;
  29. u32 fc_metric;
  30. int fc_dst_len;
  31. int fc_src_len;
  32. int fc_ifindex;
  33. u32 fc_flags;
  34. u32 fc_protocol;
  35. u32 fc_type; /* only 8 bits are used */
  36. struct in6_addr fc_dst;
  37. struct in6_addr fc_src;
  38. struct in6_addr fc_prefsrc;
  39. struct in6_addr fc_gateway;
  40. unsigned long fc_expires;
  41. struct nlattr *fc_mx;
  42. int fc_mx_len;
  43. int fc_mp_len;
  44. struct nlattr *fc_mp;
  45. struct nl_info fc_nlinfo;
  46. };
  47. struct fib6_node {
  48. struct fib6_node *parent;
  49. struct fib6_node *left;
  50. struct fib6_node *right;
  51. #ifdef CONFIG_IPV6_SUBTREES
  52. struct fib6_node *subtree;
  53. #endif
  54. struct rt6_info *leaf;
  55. __u16 fn_bit; /* bit key */
  56. __u16 fn_flags;
  57. __u32 fn_sernum;
  58. struct rt6_info *rr_ptr;
  59. };
  60. #ifndef CONFIG_IPV6_SUBTREES
  61. #define FIB6_SUBTREE(fn) NULL
  62. #else
  63. #define FIB6_SUBTREE(fn) ((fn)->subtree)
  64. #endif
  65. /*
  66. * routing information
  67. *
  68. */
  69. struct rt6key {
  70. struct in6_addr addr;
  71. int plen;
  72. };
  73. struct fib6_table;
  74. struct rt6_info {
  75. struct dst_entry dst;
  76. /*
  77. * Tail elements of dst_entry (__refcnt etc.)
  78. * and these elements (rarely used in hot path) are in
  79. * the same cache line.
  80. */
  81. struct fib6_table *rt6i_table;
  82. struct fib6_node *rt6i_node;
  83. struct in6_addr rt6i_gateway;
  84. /* Multipath routes:
  85. * siblings is a list of rt6_info that have the the same metric/weight,
  86. * destination, but not the same gateway. nsiblings is just a cache
  87. * to speed up lookup.
  88. */
  89. struct list_head rt6i_siblings;
  90. unsigned int rt6i_nsiblings;
  91. atomic_t rt6i_ref;
  92. /* These are in a separate cache line. */
  93. struct rt6key rt6i_dst ____cacheline_aligned_in_smp;
  94. u32 rt6i_flags;
  95. struct rt6key rt6i_src;
  96. struct rt6key rt6i_prefsrc;
  97. u32 rt6i_metric;
  98. struct inet6_dev *rt6i_idev;
  99. unsigned long _rt6i_peer;
  100. u32 rt6i_genid;
  101. /* more non-fragment space at head required */
  102. unsigned short rt6i_nfheader_len;
  103. u8 rt6i_protocol;
  104. };
  105. static inline struct inet_peer *rt6_peer_ptr(struct rt6_info *rt)
  106. {
  107. return inetpeer_ptr(rt->_rt6i_peer);
  108. }
  109. static inline bool rt6_has_peer(struct rt6_info *rt)
  110. {
  111. return inetpeer_ptr_is_peer(rt->_rt6i_peer);
  112. }
  113. static inline void __rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
  114. {
  115. __inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
  116. }
  117. static inline bool rt6_set_peer(struct rt6_info *rt, struct inet_peer *peer)
  118. {
  119. return inetpeer_ptr_set_peer(&rt->_rt6i_peer, peer);
  120. }
  121. static inline void rt6_init_peer(struct rt6_info *rt, struct inet_peer_base *base)
  122. {
  123. inetpeer_init_ptr(&rt->_rt6i_peer, base);
  124. }
  125. static inline void rt6_transfer_peer(struct rt6_info *rt, struct rt6_info *ort)
  126. {
  127. inetpeer_transfer_peer(&rt->_rt6i_peer, &ort->_rt6i_peer);
  128. }
  129. static inline struct inet6_dev *ip6_dst_idev(struct dst_entry *dst)
  130. {
  131. return ((struct rt6_info *)dst)->rt6i_idev;
  132. }
  133. static inline void rt6_clean_expires(struct rt6_info *rt)
  134. {
  135. if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from)
  136. dst_release(rt->dst.from);
  137. rt->rt6i_flags &= ~RTF_EXPIRES;
  138. rt->dst.from = NULL;
  139. }
  140. static inline void rt6_set_expires(struct rt6_info *rt, unsigned long expires)
  141. {
  142. if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from)
  143. dst_release(rt->dst.from);
  144. rt->rt6i_flags |= RTF_EXPIRES;
  145. rt->dst.expires = expires;
  146. }
  147. static inline void rt6_update_expires(struct rt6_info *rt, int timeout)
  148. {
  149. if (!(rt->rt6i_flags & RTF_EXPIRES)) {
  150. if (rt->dst.from)
  151. dst_release(rt->dst.from);
  152. /* dst_set_expires relies on expires == 0
  153. * if it has not been set previously.
  154. */
  155. rt->dst.expires = 0;
  156. }
  157. dst_set_expires(&rt->dst, timeout);
  158. rt->rt6i_flags |= RTF_EXPIRES;
  159. }
  160. static inline void rt6_set_from(struct rt6_info *rt, struct rt6_info *from)
  161. {
  162. struct dst_entry *new = (struct dst_entry *) from;
  163. if (!(rt->rt6i_flags & RTF_EXPIRES) && rt->dst.from) {
  164. if (new == rt->dst.from)
  165. return;
  166. dst_release(rt->dst.from);
  167. }
  168. rt->rt6i_flags &= ~RTF_EXPIRES;
  169. rt->dst.from = new;
  170. dst_hold(new);
  171. }
  172. static inline void ip6_rt_put(struct rt6_info *rt)
  173. {
  174. /* dst_release() accepts a NULL parameter.
  175. * We rely on dst being first structure in struct rt6_info
  176. */
  177. BUILD_BUG_ON(offsetof(struct rt6_info, dst) != 0);
  178. dst_release(&rt->dst);
  179. }
  180. struct fib6_walker_t {
  181. struct list_head lh;
  182. struct fib6_node *root, *node;
  183. struct rt6_info *leaf;
  184. unsigned char state;
  185. unsigned char prune;
  186. unsigned int skip;
  187. unsigned int count;
  188. int (*func)(struct fib6_walker_t *);
  189. void *args;
  190. };
  191. struct rt6_statistics {
  192. __u32 fib_nodes;
  193. __u32 fib_route_nodes;
  194. __u32 fib_rt_alloc; /* permanent routes */
  195. __u32 fib_rt_entries; /* rt entries in table */
  196. __u32 fib_rt_cache; /* cache routes */
  197. __u32 fib_discarded_routes;
  198. };
  199. #define RTN_TL_ROOT 0x0001
  200. #define RTN_ROOT 0x0002 /* tree root node */
  201. #define RTN_RTINFO 0x0004 /* node with valid routing info */
  202. /*
  203. * priority levels (or metrics)
  204. *
  205. */
  206. struct fib6_table {
  207. struct hlist_node tb6_hlist;
  208. u32 tb6_id;
  209. rwlock_t tb6_lock;
  210. struct fib6_node tb6_root;
  211. struct inet_peer_base tb6_peers;
  212. };
  213. #define RT6_TABLE_UNSPEC RT_TABLE_UNSPEC
  214. #define RT6_TABLE_MAIN RT_TABLE_MAIN
  215. #define RT6_TABLE_DFLT RT6_TABLE_MAIN
  216. #define RT6_TABLE_INFO RT6_TABLE_MAIN
  217. #define RT6_TABLE_PREFIX RT6_TABLE_MAIN
  218. #ifdef CONFIG_IPV6_MULTIPLE_TABLES
  219. #define FIB6_TABLE_MIN 1
  220. #define FIB6_TABLE_MAX RT_TABLE_MAX
  221. #define RT6_TABLE_LOCAL RT_TABLE_LOCAL
  222. #else
  223. #define FIB6_TABLE_MIN RT_TABLE_MAIN
  224. #define FIB6_TABLE_MAX FIB6_TABLE_MIN
  225. #define RT6_TABLE_LOCAL RT6_TABLE_MAIN
  226. #endif
  227. typedef struct rt6_info *(*pol_lookup_t)(struct net *,
  228. struct fib6_table *,
  229. struct flowi6 *, int);
  230. /*
  231. * exported functions
  232. */
  233. extern struct fib6_table *fib6_get_table(struct net *net, u32 id);
  234. extern struct fib6_table *fib6_new_table(struct net *net, u32 id);
  235. extern struct dst_entry *fib6_rule_lookup(struct net *net,
  236. struct flowi6 *fl6, int flags,
  237. pol_lookup_t lookup);
  238. extern struct fib6_node *fib6_lookup(struct fib6_node *root,
  239. const struct in6_addr *daddr,
  240. const struct in6_addr *saddr);
  241. struct fib6_node *fib6_locate(struct fib6_node *root,
  242. const struct in6_addr *daddr, int dst_len,
  243. const struct in6_addr *saddr, int src_len);
  244. extern void fib6_clean_all_ro(struct net *net,
  245. int (*func)(struct rt6_info *, void *arg),
  246. int prune, void *arg);
  247. extern void fib6_clean_all(struct net *net,
  248. int (*func)(struct rt6_info *, void *arg),
  249. int prune, void *arg);
  250. extern int fib6_add(struct fib6_node *root,
  251. struct rt6_info *rt,
  252. struct nl_info *info);
  253. extern int fib6_del(struct rt6_info *rt,
  254. struct nl_info *info);
  255. extern void inet6_rt_notify(int event, struct rt6_info *rt,
  256. struct nl_info *info);
  257. extern void fib6_run_gc(unsigned long expires,
  258. struct net *net);
  259. extern void fib6_gc_cleanup(void);
  260. extern int fib6_init(void);
  261. #ifdef CONFIG_IPV6_MULTIPLE_TABLES
  262. extern int fib6_rules_init(void);
  263. extern void fib6_rules_cleanup(void);
  264. #else
  265. static inline int fib6_rules_init(void)
  266. {
  267. return 0;
  268. }
  269. static inline void fib6_rules_cleanup(void)
  270. {
  271. return ;
  272. }
  273. #endif
  274. #endif