dst.h 11 KB

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