dst.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487
  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. void *__pad0;
  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. /* A non-zero value of dst->obsolete forces by-hand validation
  60. * of the route entry. Positive values are set by the generic
  61. * dst layer to indicate that the entry has been forcefully
  62. * destroyed.
  63. *
  64. * Negative values are used by the implementation layer code to
  65. * force invocation of the dst_ops->check() method.
  66. */
  67. short obsolete;
  68. #define DST_OBSOLETE_NONE 0
  69. #define DST_OBSOLETE_DEAD 2
  70. #define DST_OBSOLETE_FORCE_CHK -1
  71. #define DST_OBSOLETE_KILL -2
  72. unsigned short header_len; /* more space at head required */
  73. unsigned short trailer_len; /* space to reserve at tail */
  74. #ifdef CONFIG_IP_ROUTE_CLASSID
  75. __u32 tclassid;
  76. #else
  77. __u32 __pad2;
  78. #endif
  79. /*
  80. * Align __refcnt to a 64 bytes alignment
  81. * (L1_CACHE_SIZE would be too much)
  82. */
  83. #ifdef CONFIG_64BIT
  84. long __pad_to_align_refcnt[2];
  85. #endif
  86. /*
  87. * __refcnt wants to be on a different cache line from
  88. * input/output/ops or performance tanks badly
  89. */
  90. atomic_t __refcnt; /* client references */
  91. int __use;
  92. unsigned long lastuse;
  93. union {
  94. struct dst_entry *next;
  95. struct rtable __rcu *rt_next;
  96. struct rt6_info *rt6_next;
  97. struct dn_route __rcu *dn_next;
  98. };
  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 u32
  190. dst_allfrag(const struct dst_entry *dst)
  191. {
  192. int ret = dst_feature(dst, RTAX_FEATURE_ALLFRAG);
  193. return ret;
  194. }
  195. static inline int
  196. dst_metric_locked(const struct dst_entry *dst, int metric)
  197. {
  198. return dst_metric(dst, RTAX_LOCK) & (1<<metric);
  199. }
  200. static inline void dst_hold(struct dst_entry *dst)
  201. {
  202. /*
  203. * If your kernel compilation stops here, please check
  204. * __pad_to_align_refcnt declaration in struct dst_entry
  205. */
  206. BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
  207. atomic_inc(&dst->__refcnt);
  208. }
  209. static inline void dst_use(struct dst_entry *dst, unsigned long time)
  210. {
  211. dst_hold(dst);
  212. dst->__use++;
  213. dst->lastuse = time;
  214. }
  215. static inline void dst_use_noref(struct dst_entry *dst, unsigned long time)
  216. {
  217. dst->__use++;
  218. dst->lastuse = time;
  219. }
  220. static inline 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. /*
  277. * Clear rxhash so that we can recalulate the hash for the
  278. * encapsulated packet, unless we have already determine the hash
  279. * over the L4 4-tuple.
  280. */
  281. if (!skb->l4_rxhash)
  282. skb->rxhash = 0;
  283. skb_set_queue_mapping(skb, 0);
  284. skb_dst_drop(skb);
  285. nf_reset(skb);
  286. }
  287. /**
  288. * skb_tunnel_rx - prepare skb for rx reinsert
  289. * @skb: buffer
  290. * @dev: tunnel device
  291. *
  292. * After decapsulation, packet is going to re-enter (netif_rx()) our stack,
  293. * so make some cleanups, and perform accounting.
  294. * Note: this accounting is not SMP safe.
  295. */
  296. static inline void skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev)
  297. {
  298. /* TODO : stats should be SMP safe */
  299. dev->stats.rx_packets++;
  300. dev->stats.rx_bytes += skb->len;
  301. __skb_tunnel_rx(skb, dev);
  302. }
  303. /* Children define the path of the packet through the
  304. * Linux networking. Thus, destinations are stackable.
  305. */
  306. static inline struct dst_entry *skb_dst_pop(struct sk_buff *skb)
  307. {
  308. struct dst_entry *child = dst_clone(skb_dst(skb)->child);
  309. skb_dst_drop(skb);
  310. return child;
  311. }
  312. extern int dst_discard(struct sk_buff *skb);
  313. extern void *dst_alloc(struct dst_ops *ops, struct net_device *dev,
  314. int initial_ref, int initial_obsolete,
  315. unsigned short flags);
  316. extern void __dst_free(struct dst_entry *dst);
  317. extern struct dst_entry *dst_destroy(struct dst_entry *dst);
  318. static inline void dst_free(struct dst_entry *dst)
  319. {
  320. if (dst->obsolete > 0)
  321. return;
  322. if (!atomic_read(&dst->__refcnt)) {
  323. dst = dst_destroy(dst);
  324. if (!dst)
  325. return;
  326. }
  327. __dst_free(dst);
  328. }
  329. static inline void dst_rcu_free(struct rcu_head *head)
  330. {
  331. struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
  332. dst_free(dst);
  333. }
  334. static inline void dst_confirm(struct dst_entry *dst)
  335. {
  336. dst->pending_confirm = 1;
  337. }
  338. static inline int dst_neigh_output(struct dst_entry *dst, struct neighbour *n,
  339. struct sk_buff *skb)
  340. {
  341. const struct hh_cache *hh;
  342. if (dst->pending_confirm) {
  343. unsigned long now = jiffies;
  344. dst->pending_confirm = 0;
  345. /* avoid dirtying neighbour */
  346. if (n->confirmed != now)
  347. n->confirmed = now;
  348. }
  349. hh = &n->hh;
  350. if ((n->nud_state & NUD_CONNECTED) && hh->hh_len)
  351. return neigh_hh_output(hh, skb);
  352. else
  353. return n->output(n, skb);
  354. }
  355. static inline struct neighbour *dst_neigh_lookup(const struct dst_entry *dst, const void *daddr)
  356. {
  357. return dst->ops->neigh_lookup(dst, NULL, daddr);
  358. }
  359. static inline struct neighbour *dst_neigh_lookup_skb(const struct dst_entry *dst,
  360. struct sk_buff *skb)
  361. {
  362. return dst->ops->neigh_lookup(dst, skb, NULL);
  363. }
  364. static inline void dst_link_failure(struct sk_buff *skb)
  365. {
  366. struct dst_entry *dst = skb_dst(skb);
  367. if (dst && dst->ops && dst->ops->link_failure)
  368. dst->ops->link_failure(skb);
  369. }
  370. static inline void dst_set_expires(struct dst_entry *dst, int timeout)
  371. {
  372. unsigned long expires = jiffies + timeout;
  373. if (expires == 0)
  374. expires = 1;
  375. if (dst->expires == 0 || time_before(expires, dst->expires))
  376. dst->expires = expires;
  377. }
  378. /* Output packet to network from transport. */
  379. static inline int dst_output(struct sk_buff *skb)
  380. {
  381. return skb_dst(skb)->output(skb);
  382. }
  383. /* Input packet from network to transport. */
  384. static inline int dst_input(struct sk_buff *skb)
  385. {
  386. return skb_dst(skb)->input(skb);
  387. }
  388. static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
  389. {
  390. if (dst->obsolete)
  391. dst = dst->ops->check(dst, cookie);
  392. return dst;
  393. }
  394. extern void dst_init(void);
  395. /* Flags for xfrm_lookup flags argument. */
  396. enum {
  397. XFRM_LOOKUP_ICMP = 1 << 0,
  398. };
  399. struct flowi;
  400. #ifndef CONFIG_XFRM
  401. static inline struct dst_entry *xfrm_lookup(struct net *net,
  402. struct dst_entry *dst_orig,
  403. const struct flowi *fl, struct sock *sk,
  404. int flags)
  405. {
  406. return dst_orig;
  407. }
  408. #else
  409. extern struct dst_entry *xfrm_lookup(struct net *net, struct dst_entry *dst_orig,
  410. const struct flowi *fl, struct sock *sk,
  411. int flags);
  412. #endif
  413. #endif /* _NET_DST_H */