dst.h 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280
  1. /*
  2. * net/dst.h Protocol independent destination cache definitions.
  3. *
  4. * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  5. *
  6. */
  7. #ifndef _NET_DST_H
  8. #define _NET_DST_H
  9. #include <linux/netdevice.h>
  10. #include <linux/rtnetlink.h>
  11. #include <linux/rcupdate.h>
  12. #include <linux/jiffies.h>
  13. #include <net/neighbour.h>
  14. #include <asm/processor.h>
  15. /*
  16. * 0 - no debugging messages
  17. * 1 - rare events and bugs (default)
  18. * 2 - trace mode.
  19. */
  20. #define RT_CACHE_DEBUG 0
  21. #define DST_GC_MIN (HZ/10)
  22. #define DST_GC_INC (HZ/2)
  23. #define DST_GC_MAX (120*HZ)
  24. /* Each dst_entry has reference count and sits in some parent list(s).
  25. * When it is removed from parent list, it is "freed" (dst_free).
  26. * After this it enters dead state (dst->obsolete > 0) and if its refcnt
  27. * is zero, it can be destroyed immediately, otherwise it is added
  28. * to gc list and garbage collector periodically checks the refcnt.
  29. */
  30. struct sk_buff;
  31. struct dst_entry
  32. {
  33. struct rcu_head rcu_head;
  34. struct dst_entry *child;
  35. struct net_device *dev;
  36. short error;
  37. short obsolete;
  38. int flags;
  39. #define DST_HOST 1
  40. #define DST_NOXFRM 2
  41. #define DST_NOPOLICY 4
  42. #define DST_NOHASH 8
  43. unsigned long expires;
  44. unsigned short header_len; /* more space at head required */
  45. unsigned short nfheader_len; /* more non-fragment space at head required */
  46. unsigned short trailer_len; /* space to reserve at tail */
  47. u32 metrics[RTAX_MAX];
  48. struct dst_entry *path;
  49. unsigned long rate_last; /* rate limiting for ICMP */
  50. unsigned long rate_tokens;
  51. struct neighbour *neighbour;
  52. struct hh_cache *hh;
  53. struct xfrm_state *xfrm;
  54. int (*input)(struct sk_buff*);
  55. int (*output)(struct sk_buff*);
  56. #ifdef CONFIG_NET_CLS_ROUTE
  57. __u32 tclassid;
  58. #endif
  59. struct dst_ops *ops;
  60. unsigned long lastuse;
  61. atomic_t __refcnt; /* client references */
  62. int __use;
  63. union {
  64. struct dst_entry *next;
  65. struct rtable *rt_next;
  66. struct rt6_info *rt6_next;
  67. struct dn_route *dn_next;
  68. };
  69. char info[0];
  70. };
  71. struct dst_ops
  72. {
  73. unsigned short family;
  74. __be16 protocol;
  75. unsigned gc_thresh;
  76. int (*gc)(void);
  77. struct dst_entry * (*check)(struct dst_entry *, __u32 cookie);
  78. void (*destroy)(struct dst_entry *);
  79. void (*ifdown)(struct dst_entry *,
  80. struct net_device *dev, int how);
  81. struct dst_entry * (*negative_advice)(struct dst_entry *);
  82. void (*link_failure)(struct sk_buff *);
  83. void (*update_pmtu)(struct dst_entry *dst, u32 mtu);
  84. int entry_size;
  85. atomic_t entries;
  86. struct kmem_cache *kmem_cachep;
  87. };
  88. #ifdef __KERNEL__
  89. static inline u32
  90. dst_metric(const struct dst_entry *dst, int metric)
  91. {
  92. return dst->metrics[metric-1];
  93. }
  94. static inline u32 dst_mtu(const struct dst_entry *dst)
  95. {
  96. u32 mtu = dst_metric(dst, RTAX_MTU);
  97. /*
  98. * Alexey put it here, so ask him about it :)
  99. */
  100. barrier();
  101. return mtu;
  102. }
  103. static inline u32
  104. dst_allfrag(const struct dst_entry *dst)
  105. {
  106. int ret = dst_metric(dst, RTAX_FEATURES) & RTAX_FEATURE_ALLFRAG;
  107. /* Yes, _exactly_. This is paranoia. */
  108. barrier();
  109. return ret;
  110. }
  111. static inline int
  112. dst_metric_locked(struct dst_entry *dst, int metric)
  113. {
  114. return dst_metric(dst, RTAX_LOCK) & (1<<metric);
  115. }
  116. static inline void dst_hold(struct dst_entry * dst)
  117. {
  118. atomic_inc(&dst->__refcnt);
  119. }
  120. static inline
  121. struct dst_entry * dst_clone(struct dst_entry * dst)
  122. {
  123. if (dst)
  124. atomic_inc(&dst->__refcnt);
  125. return dst;
  126. }
  127. static inline
  128. void dst_release(struct dst_entry * dst)
  129. {
  130. if (dst) {
  131. WARN_ON(atomic_read(&dst->__refcnt) < 1);
  132. smp_mb__before_atomic_dec();
  133. atomic_dec(&dst->__refcnt);
  134. }
  135. }
  136. /* Children define the path of the packet through the
  137. * Linux networking. Thus, destinations are stackable.
  138. */
  139. static inline struct dst_entry *dst_pop(struct dst_entry *dst)
  140. {
  141. struct dst_entry *child = dst_clone(dst->child);
  142. dst_release(dst);
  143. return child;
  144. }
  145. extern void * dst_alloc(struct dst_ops * ops);
  146. extern void __dst_free(struct dst_entry * dst);
  147. extern struct dst_entry *dst_destroy(struct dst_entry * dst);
  148. static inline void dst_free(struct dst_entry * dst)
  149. {
  150. if (dst->obsolete > 1)
  151. return;
  152. if (!atomic_read(&dst->__refcnt)) {
  153. dst = dst_destroy(dst);
  154. if (!dst)
  155. return;
  156. }
  157. __dst_free(dst);
  158. }
  159. static inline void dst_rcu_free(struct rcu_head *head)
  160. {
  161. struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
  162. dst_free(dst);
  163. }
  164. static inline void dst_confirm(struct dst_entry *dst)
  165. {
  166. if (dst)
  167. neigh_confirm(dst->neighbour);
  168. }
  169. static inline void dst_negative_advice(struct dst_entry **dst_p)
  170. {
  171. struct dst_entry * dst = *dst_p;
  172. if (dst && dst->ops->negative_advice)
  173. *dst_p = dst->ops->negative_advice(dst);
  174. }
  175. static inline void dst_link_failure(struct sk_buff *skb)
  176. {
  177. struct dst_entry * dst = skb->dst;
  178. if (dst && dst->ops && dst->ops->link_failure)
  179. dst->ops->link_failure(skb);
  180. }
  181. static inline void dst_set_expires(struct dst_entry *dst, int timeout)
  182. {
  183. unsigned long expires = jiffies + timeout;
  184. if (expires == 0)
  185. expires = 1;
  186. if (dst->expires == 0 || time_before(expires, dst->expires))
  187. dst->expires = expires;
  188. }
  189. /* Output packet to network from transport. */
  190. static inline int dst_output(struct sk_buff *skb)
  191. {
  192. return skb->dst->output(skb);
  193. }
  194. /* Input packet from network to transport. */
  195. static inline int dst_input(struct sk_buff *skb)
  196. {
  197. int err;
  198. for (;;) {
  199. err = skb->dst->input(skb);
  200. if (likely(err == 0))
  201. return err;
  202. /* Oh, Jamal... Seems, I will not forgive you this mess. :-) */
  203. if (unlikely(err != NET_XMIT_BYPASS))
  204. return err;
  205. }
  206. }
  207. static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
  208. {
  209. if (dst->obsolete)
  210. dst = dst->ops->check(dst, cookie);
  211. return dst;
  212. }
  213. extern void dst_init(void);
  214. struct flowi;
  215. #ifndef CONFIG_XFRM
  216. static inline int xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
  217. struct sock *sk, int flags)
  218. {
  219. return 0;
  220. }
  221. static inline int __xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
  222. struct sock *sk, int flags)
  223. {
  224. return 0;
  225. }
  226. #else
  227. extern int xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
  228. struct sock *sk, int flags);
  229. extern int __xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
  230. struct sock *sk, int flags);
  231. #endif
  232. #endif
  233. #endif /* _NET_DST_H */