dst.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451
  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. struct dst_ops *ops;
  37. unsigned long _metrics;
  38. unsigned long expires;
  39. struct dst_entry *path;
  40. struct neighbour *neighbour;
  41. struct hh_cache *hh;
  42. #ifdef CONFIG_XFRM
  43. struct xfrm_state *xfrm;
  44. #else
  45. void *__pad1;
  46. #endif
  47. int (*input)(struct sk_buff*);
  48. int (*output)(struct sk_buff*);
  49. short error;
  50. short obsolete;
  51. unsigned short header_len; /* more space at head required */
  52. unsigned short trailer_len; /* space to reserve at tail */
  53. #ifdef CONFIG_IP_ROUTE_CLASSID
  54. __u32 tclassid;
  55. #else
  56. __u32 __pad2;
  57. #endif
  58. /*
  59. * Align __refcnt to a 64 bytes alignment
  60. * (L1_CACHE_SIZE would be too much)
  61. */
  62. #ifdef CONFIG_64BIT
  63. long __pad_to_align_refcnt[1];
  64. #endif
  65. /*
  66. * __refcnt wants to be on a different cache line from
  67. * input/output/ops or performance tanks badly
  68. */
  69. atomic_t __refcnt; /* client references */
  70. int __use;
  71. unsigned long lastuse;
  72. unsigned long rate_last; /* rate limiting for ICMP */
  73. unsigned int rate_tokens;
  74. int flags;
  75. #define DST_HOST 0x0001
  76. #define DST_NOXFRM 0x0002
  77. #define DST_NOPOLICY 0x0004
  78. #define DST_NOHASH 0x0008
  79. #define DST_NOCACHE 0x0010
  80. union {
  81. struct dst_entry *next;
  82. struct rtable __rcu *rt_next;
  83. struct rt6_info *rt6_next;
  84. struct dn_route __rcu *dn_next;
  85. };
  86. };
  87. #ifdef __KERNEL__
  88. extern u32 *dst_cow_metrics_generic(struct dst_entry *dst, unsigned long old);
  89. #define DST_METRICS_READ_ONLY 0x1UL
  90. #define __DST_METRICS_PTR(Y) \
  91. ((u32 *)((Y) & ~DST_METRICS_READ_ONLY))
  92. #define DST_METRICS_PTR(X) __DST_METRICS_PTR((X)->_metrics)
  93. static inline bool dst_metrics_read_only(const struct dst_entry *dst)
  94. {
  95. return dst->_metrics & DST_METRICS_READ_ONLY;
  96. }
  97. extern void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old);
  98. static inline void dst_destroy_metrics_generic(struct dst_entry *dst)
  99. {
  100. unsigned long val = dst->_metrics;
  101. if (!(val & DST_METRICS_READ_ONLY))
  102. __dst_destroy_metrics_generic(dst, val);
  103. }
  104. static inline u32 *dst_metrics_write_ptr(struct dst_entry *dst)
  105. {
  106. unsigned long p = dst->_metrics;
  107. if (p & DST_METRICS_READ_ONLY)
  108. return dst->ops->cow_metrics(dst, p);
  109. return __DST_METRICS_PTR(p);
  110. }
  111. /* This may only be invoked before the entry has reached global
  112. * visibility.
  113. */
  114. static inline void dst_init_metrics(struct dst_entry *dst,
  115. const u32 *src_metrics,
  116. bool read_only)
  117. {
  118. dst->_metrics = ((unsigned long) src_metrics) |
  119. (read_only ? DST_METRICS_READ_ONLY : 0);
  120. }
  121. static inline void dst_copy_metrics(struct dst_entry *dest, const struct dst_entry *src)
  122. {
  123. u32 *dst_metrics = dst_metrics_write_ptr(dest);
  124. if (dst_metrics) {
  125. u32 *src_metrics = DST_METRICS_PTR(src);
  126. memcpy(dst_metrics, src_metrics, RTAX_MAX * sizeof(u32));
  127. }
  128. }
  129. static inline u32 *dst_metrics_ptr(struct dst_entry *dst)
  130. {
  131. return DST_METRICS_PTR(dst);
  132. }
  133. static inline u32
  134. dst_metric_raw(const struct dst_entry *dst, const int metric)
  135. {
  136. u32 *p = DST_METRICS_PTR(dst);
  137. return p[metric-1];
  138. }
  139. static inline u32
  140. dst_metric(const struct dst_entry *dst, const int metric)
  141. {
  142. WARN_ON_ONCE(metric == RTAX_HOPLIMIT ||
  143. metric == RTAX_ADVMSS ||
  144. metric == RTAX_MTU);
  145. return dst_metric_raw(dst, metric);
  146. }
  147. static inline u32
  148. dst_metric_advmss(const struct dst_entry *dst)
  149. {
  150. u32 advmss = dst_metric_raw(dst, RTAX_ADVMSS);
  151. if (!advmss)
  152. advmss = dst->ops->default_advmss(dst);
  153. return advmss;
  154. }
  155. static inline void dst_metric_set(struct dst_entry *dst, int metric, u32 val)
  156. {
  157. u32 *p = dst_metrics_write_ptr(dst);
  158. if (p)
  159. p[metric-1] = val;
  160. }
  161. static inline u32
  162. dst_feature(const struct dst_entry *dst, u32 feature)
  163. {
  164. return dst_metric(dst, RTAX_FEATURES) & feature;
  165. }
  166. static inline u32 dst_mtu(const struct dst_entry *dst)
  167. {
  168. u32 mtu = dst_metric_raw(dst, RTAX_MTU);
  169. if (!mtu)
  170. mtu = dst->ops->default_mtu(dst);
  171. return mtu;
  172. }
  173. /* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
  174. static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
  175. {
  176. return msecs_to_jiffies(dst_metric(dst, metric));
  177. }
  178. static inline void set_dst_metric_rtt(struct dst_entry *dst, int metric,
  179. unsigned long rtt)
  180. {
  181. dst_metric_set(dst, metric, jiffies_to_msecs(rtt));
  182. }
  183. static inline u32
  184. dst_allfrag(const struct dst_entry *dst)
  185. {
  186. int ret = dst_feature(dst, RTAX_FEATURE_ALLFRAG);
  187. /* Yes, _exactly_. This is paranoia. */
  188. barrier();
  189. return ret;
  190. }
  191. static inline int
  192. dst_metric_locked(const struct dst_entry *dst, int metric)
  193. {
  194. return dst_metric(dst, RTAX_LOCK) & (1<<metric);
  195. }
  196. static inline void dst_hold(struct dst_entry * dst)
  197. {
  198. /*
  199. * If your kernel compilation stops here, please check
  200. * __pad_to_align_refcnt declaration in struct dst_entry
  201. */
  202. BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
  203. atomic_inc(&dst->__refcnt);
  204. }
  205. static inline void dst_use(struct dst_entry *dst, unsigned long time)
  206. {
  207. dst_hold(dst);
  208. dst->__use++;
  209. dst->lastuse = time;
  210. }
  211. static inline void dst_use_noref(struct dst_entry *dst, unsigned long time)
  212. {
  213. dst->__use++;
  214. dst->lastuse = time;
  215. }
  216. static inline
  217. struct dst_entry * dst_clone(struct dst_entry * dst)
  218. {
  219. if (dst)
  220. atomic_inc(&dst->__refcnt);
  221. return dst;
  222. }
  223. extern void dst_release(struct dst_entry *dst);
  224. static inline void refdst_drop(unsigned long refdst)
  225. {
  226. if (!(refdst & SKB_DST_NOREF))
  227. dst_release((struct dst_entry *)(refdst & SKB_DST_PTRMASK));
  228. }
  229. /**
  230. * skb_dst_drop - drops skb dst
  231. * @skb: buffer
  232. *
  233. * Drops dst reference count if a reference was taken.
  234. */
  235. static inline void skb_dst_drop(struct sk_buff *skb)
  236. {
  237. if (skb->_skb_refdst) {
  238. refdst_drop(skb->_skb_refdst);
  239. skb->_skb_refdst = 0UL;
  240. }
  241. }
  242. static inline void skb_dst_copy(struct sk_buff *nskb, const struct sk_buff *oskb)
  243. {
  244. nskb->_skb_refdst = oskb->_skb_refdst;
  245. if (!(nskb->_skb_refdst & SKB_DST_NOREF))
  246. dst_clone(skb_dst(nskb));
  247. }
  248. /**
  249. * skb_dst_force - makes sure skb dst is refcounted
  250. * @skb: buffer
  251. *
  252. * If dst is not yet refcounted, let's do it
  253. */
  254. static inline void skb_dst_force(struct sk_buff *skb)
  255. {
  256. if (skb_dst_is_noref(skb)) {
  257. WARN_ON(!rcu_read_lock_held());
  258. skb->_skb_refdst &= ~SKB_DST_NOREF;
  259. dst_clone(skb_dst(skb));
  260. }
  261. }
  262. /**
  263. * __skb_tunnel_rx - prepare skb for rx reinsert
  264. * @skb: buffer
  265. * @dev: tunnel device
  266. *
  267. * After decapsulation, packet is going to re-enter (netif_rx()) our stack,
  268. * so make some cleanups. (no accounting done)
  269. */
  270. static inline void __skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev)
  271. {
  272. skb->dev = dev;
  273. skb->rxhash = 0;
  274. skb_set_queue_mapping(skb, 0);
  275. skb_dst_drop(skb);
  276. nf_reset(skb);
  277. }
  278. /**
  279. * skb_tunnel_rx - prepare skb for rx reinsert
  280. * @skb: buffer
  281. * @dev: tunnel device
  282. *
  283. * After decapsulation, packet is going to re-enter (netif_rx()) our stack,
  284. * so make some cleanups, and perform accounting.
  285. * Note: this accounting is not SMP safe.
  286. */
  287. static inline void skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev)
  288. {
  289. /* TODO : stats should be SMP safe */
  290. dev->stats.rx_packets++;
  291. dev->stats.rx_bytes += skb->len;
  292. __skb_tunnel_rx(skb, dev);
  293. }
  294. /* Children define the path of the packet through the
  295. * Linux networking. Thus, destinations are stackable.
  296. */
  297. static inline struct dst_entry *skb_dst_pop(struct sk_buff *skb)
  298. {
  299. struct dst_entry *child = skb_dst(skb)->child;
  300. skb_dst_drop(skb);
  301. return child;
  302. }
  303. extern int dst_discard(struct sk_buff *skb);
  304. extern void * dst_alloc(struct dst_ops * ops);
  305. extern void __dst_free(struct dst_entry * dst);
  306. extern struct dst_entry *dst_destroy(struct dst_entry * dst);
  307. static inline void dst_free(struct dst_entry * dst)
  308. {
  309. if (dst->obsolete > 1)
  310. return;
  311. if (!atomic_read(&dst->__refcnt)) {
  312. dst = dst_destroy(dst);
  313. if (!dst)
  314. return;
  315. }
  316. __dst_free(dst);
  317. }
  318. static inline void dst_rcu_free(struct rcu_head *head)
  319. {
  320. struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
  321. dst_free(dst);
  322. }
  323. static inline void dst_confirm(struct dst_entry *dst)
  324. {
  325. if (dst)
  326. neigh_confirm(dst->neighbour);
  327. }
  328. static inline void dst_link_failure(struct sk_buff *skb)
  329. {
  330. struct dst_entry *dst = skb_dst(skb);
  331. if (dst && dst->ops && dst->ops->link_failure)
  332. dst->ops->link_failure(skb);
  333. }
  334. static inline void dst_set_expires(struct dst_entry *dst, int timeout)
  335. {
  336. unsigned long expires = jiffies + timeout;
  337. if (expires == 0)
  338. expires = 1;
  339. if (dst->expires == 0 || time_before(expires, dst->expires))
  340. dst->expires = expires;
  341. }
  342. /* Output packet to network from transport. */
  343. static inline int dst_output(struct sk_buff *skb)
  344. {
  345. return skb_dst(skb)->output(skb);
  346. }
  347. /* Input packet from network to transport. */
  348. static inline int dst_input(struct sk_buff *skb)
  349. {
  350. return skb_dst(skb)->input(skb);
  351. }
  352. static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
  353. {
  354. if (dst->obsolete)
  355. dst = dst->ops->check(dst, cookie);
  356. return dst;
  357. }
  358. extern void dst_init(void);
  359. /* Flags for xfrm_lookup flags argument. */
  360. enum {
  361. XFRM_LOOKUP_WAIT = 1 << 0,
  362. XFRM_LOOKUP_ICMP = 1 << 1,
  363. };
  364. struct flowi;
  365. #ifndef CONFIG_XFRM
  366. static inline int xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  367. struct flowi *fl, struct sock *sk, int flags)
  368. {
  369. return 0;
  370. }
  371. static inline int __xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  372. struct flowi *fl, struct sock *sk, int flags)
  373. {
  374. return 0;
  375. }
  376. #else
  377. extern int xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  378. struct flowi *fl, struct sock *sk, int flags);
  379. extern int __xfrm_lookup(struct net *net, struct dst_entry **dst_p,
  380. struct flowi *fl, struct sock *sk, int flags);
  381. #endif
  382. #endif
  383. #endif /* _NET_DST_H */