dst.h 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371
  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 <net/dst_ops.h>
  10. #include <linux/netdevice.h>
  11. #include <linux/rtnetlink.h>
  12. #include <linux/rcupdate.h>
  13. #include <linux/jiffies.h>
  14. #include <net/neighbour.h>
  15. #include <asm/processor.h>
  16. /*
  17. * 0 - no debugging messages
  18. * 1 - rare events and bugs (default)
  19. * 2 - trace mode.
  20. */
  21. #define RT_CACHE_DEBUG 0
  22. #define DST_GC_MIN (HZ/10)
  23. #define DST_GC_INC (HZ/2)
  24. #define DST_GC_MAX (120*HZ)
  25. /* Each dst_entry has reference count and sits in some parent list(s).
  26. * When it is removed from parent list, it is "freed" (dst_free).
  27. * After this it enters dead state (dst->obsolete > 0) and if its refcnt
  28. * is zero, it can be destroyed immediately, otherwise it is added
  29. * to gc list and garbage collector periodically checks the refcnt.
  30. */
  31. struct sk_buff;
  32. struct dst_entry {
  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 0x0001
  40. #define DST_NOXFRM 0x0002
  41. #define DST_NOPOLICY 0x0004
  42. #define DST_NOHASH 0x0008
  43. #define DST_NOCACHE 0x0010
  44. unsigned long expires;
  45. unsigned short header_len; /* more space at head required */
  46. unsigned short trailer_len; /* space to reserve at tail */
  47. unsigned int rate_tokens;
  48. unsigned long rate_last; /* rate limiting for ICMP */
  49. struct dst_entry *path;
  50. struct neighbour *neighbour;
  51. struct hh_cache *hh;
  52. #ifdef CONFIG_XFRM
  53. struct xfrm_state *xfrm;
  54. #else
  55. void *__pad1;
  56. #endif
  57. int (*input)(struct sk_buff*);
  58. int (*output)(struct sk_buff*);
  59. struct dst_ops *ops;
  60. u32 metrics[RTAX_MAX];
  61. #ifdef CONFIG_NET_CLS_ROUTE
  62. __u32 tclassid;
  63. #else
  64. __u32 __pad2;
  65. #endif
  66. /*
  67. * Align __refcnt to a 64 bytes alignment
  68. * (L1_CACHE_SIZE would be too much)
  69. */
  70. #ifdef CONFIG_64BIT
  71. long __pad_to_align_refcnt[1];
  72. #endif
  73. /*
  74. * __refcnt wants to be on a different cache line from
  75. * input/output/ops or performance tanks badly
  76. */
  77. atomic_t __refcnt; /* client references */
  78. int __use;
  79. unsigned long lastuse;
  80. union {
  81. struct dst_entry *next;
  82. struct rtable __rcu *rt_next;
  83. struct rt6_info *rt6_next;
  84. struct dn_route *dn_next;
  85. };
  86. };
  87. #ifdef __KERNEL__
  88. static inline u32
  89. dst_metric(const struct dst_entry *dst, int metric)
  90. {
  91. return dst->metrics[metric-1];
  92. }
  93. static inline u32
  94. dst_feature(const struct dst_entry *dst, u32 feature)
  95. {
  96. return dst_metric(dst, RTAX_FEATURES) & feature;
  97. }
  98. static inline u32 dst_mtu(const struct dst_entry *dst)
  99. {
  100. u32 mtu = dst_metric(dst, RTAX_MTU);
  101. /*
  102. * Alexey put it here, so ask him about it :)
  103. */
  104. barrier();
  105. return mtu;
  106. }
  107. /* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
  108. static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
  109. {
  110. return msecs_to_jiffies(dst_metric(dst, metric));
  111. }
  112. static inline void set_dst_metric_rtt(struct dst_entry *dst, int metric,
  113. unsigned long rtt)
  114. {
  115. dst->metrics[metric-1] = jiffies_to_msecs(rtt);
  116. }
  117. static inline u32
  118. dst_allfrag(const struct dst_entry *dst)
  119. {
  120. int ret = dst_feature(dst, RTAX_FEATURE_ALLFRAG);
  121. /* Yes, _exactly_. This is paranoia. */
  122. barrier();
  123. return ret;
  124. }
  125. static inline int
  126. dst_metric_locked(struct dst_entry *dst, int metric)
  127. {
  128. return dst_metric(dst, RTAX_LOCK) & (1<<metric);
  129. }
  130. static inline void dst_hold(struct dst_entry * dst)
  131. {
  132. /*
  133. * If your kernel compilation stops here, please check
  134. * __pad_to_align_refcnt declaration in struct dst_entry
  135. */
  136. BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
  137. atomic_inc(&dst->__refcnt);
  138. }
  139. static inline void dst_use(struct dst_entry *dst, unsigned long time)
  140. {
  141. dst_hold(dst);
  142. dst->__use++;
  143. dst->lastuse = time;
  144. }
  145. static inline void dst_use_noref(struct dst_entry *dst, unsigned long time)
  146. {
  147. dst->__use++;
  148. dst->lastuse = time;
  149. }
  150. static inline
  151. struct dst_entry * dst_clone(struct dst_entry * dst)
  152. {
  153. if (dst)
  154. atomic_inc(&dst->__refcnt);
  155. return dst;
  156. }
  157. extern void dst_release(struct dst_entry *dst);
  158. static inline void refdst_drop(unsigned long refdst)
  159. {
  160. if (!(refdst & SKB_DST_NOREF))
  161. dst_release((struct dst_entry *)(refdst & SKB_DST_PTRMASK));
  162. }
  163. /**
  164. * skb_dst_drop - drops skb dst
  165. * @skb: buffer
  166. *
  167. * Drops dst reference count if a reference was taken.
  168. */
  169. static inline void skb_dst_drop(struct sk_buff *skb)
  170. {
  171. if (skb->_skb_refdst) {
  172. refdst_drop(skb->_skb_refdst);
  173. skb->_skb_refdst = 0UL;
  174. }
  175. }
  176. static inline void skb_dst_copy(struct sk_buff *nskb, const struct sk_buff *oskb)
  177. {
  178. nskb->_skb_refdst = oskb->_skb_refdst;
  179. if (!(nskb->_skb_refdst & SKB_DST_NOREF))
  180. dst_clone(skb_dst(nskb));
  181. }
  182. /**
  183. * skb_dst_force - makes sure skb dst is refcounted
  184. * @skb: buffer
  185. *
  186. * If dst is not yet refcounted, let's do it
  187. */
  188. static inline void skb_dst_force(struct sk_buff *skb)
  189. {
  190. if (skb_dst_is_noref(skb)) {
  191. WARN_ON(!rcu_read_lock_held());
  192. skb->_skb_refdst &= ~SKB_DST_NOREF;
  193. dst_clone(skb_dst(skb));
  194. }
  195. }
  196. /**
  197. * __skb_tunnel_rx - prepare skb for rx reinsert
  198. * @skb: buffer
  199. * @dev: tunnel device
  200. *
  201. * After decapsulation, packet is going to re-enter (netif_rx()) our stack,
  202. * so make some cleanups. (no accounting done)
  203. */
  204. static inline void __skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev)
  205. {
  206. skb->dev = dev;
  207. skb->rxhash = 0;
  208. skb_set_queue_mapping(skb, 0);
  209. skb_dst_drop(skb);
  210. nf_reset(skb);
  211. }
  212. /**
  213. * skb_tunnel_rx - prepare skb for rx reinsert
  214. * @skb: buffer
  215. * @dev: tunnel device
  216. *
  217. * After decapsulation, packet is going to re-enter (netif_rx()) our stack,
  218. * so make some cleanups, and perform accounting.
  219. * Note: this accounting is not SMP safe.
  220. */
  221. static inline void skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev)
  222. {
  223. /* TODO : stats should be SMP safe */
  224. dev->stats.rx_packets++;
  225. dev->stats.rx_bytes += skb->len;
  226. __skb_tunnel_rx(skb, dev);
  227. }
  228. /* Children define the path of the packet through the
  229. * Linux networking. Thus, destinations are stackable.
  230. */
  231. static inline struct dst_entry *skb_dst_pop(struct sk_buff *skb)
  232. {
  233. struct dst_entry *child = skb_dst(skb)->child;
  234. skb_dst_drop(skb);
  235. return child;
  236. }
  237. extern int dst_discard(struct sk_buff *skb);
  238. extern void * dst_alloc(struct dst_ops * ops);
  239. extern void __dst_free(struct dst_entry * dst);
  240. extern struct dst_entry *dst_destroy(struct dst_entry * dst);
  241. static inline void dst_free(struct dst_entry * dst)
  242. {
  243. if (dst->obsolete > 1)
  244. return;
  245. if (!atomic_read(&dst->__refcnt)) {
  246. dst = dst_destroy(dst);
  247. if (!dst)
  248. return;
  249. }
  250. __dst_free(dst);
  251. }
  252. static inline void dst_rcu_free(struct rcu_head *head)
  253. {
  254. struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
  255. dst_free(dst);
  256. }
  257. static inline void dst_confirm(struct dst_entry *dst)
  258. {
  259. if (dst)
  260. neigh_confirm(dst->neighbour);
  261. }
  262. static inline void dst_link_failure(struct sk_buff *skb)
  263. {
  264. struct dst_entry *dst = skb_dst(skb);
  265. if (dst && dst->ops && dst->ops->link_failure)
  266. dst->ops->link_failure(skb);
  267. }
  268. static inline void dst_set_expires(struct dst_entry *dst, int timeout)
  269. {
  270. unsigned long expires = jiffies + timeout;
  271. if (expires == 0)
  272. expires = 1;
  273. if (dst->expires == 0 || time_before(expires, dst->expires))
  274. dst->expires = expires;
  275. }
  276. /* Output packet to network from transport. */
  277. static inline int dst_output(struct sk_buff *skb)
  278. {
  279. return skb_dst(skb)->output(skb);
  280. }
  281. /* Input packet from network to transport. */
  282. static inline int dst_input(struct sk_buff *skb)
  283. {
  284. return skb_dst(skb)->input(skb);
  285. }
  286. static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
  287. {
  288. if (dst->obsolete)
  289. dst = dst->ops->check(dst, cookie);
  290. return dst;
  291. }
  292. extern void dst_init(void);
  293. /* Flags for xfrm_lookup flags argument. */
  294. enum {
  295. XFRM_LOOKUP_WAIT = 1 << 0,
  296. XFRM_LOOKUP_ICMP = 1 << 1,
  297. };
  298. struct flowi;
  299. #ifndef CONFIG_XFRM
  300. static inline int xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  301. struct flowi *fl, struct sock *sk, int flags)
  302. {
  303. return 0;
  304. }
  305. static inline int __xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  306. struct flowi *fl, struct sock *sk, int flags)
  307. {
  308. return 0;
  309. }
  310. #else
  311. extern int xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  312. struct flowi *fl, struct sock *sk, int flags);
  313. extern int __xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  314. struct flowi *fl, struct sock *sk, int flags);
  315. #endif
  316. #endif
  317. #endif /* _NET_DST_H */