dst.h 11 KB

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