dst.h 12 KB

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