dst.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510
  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_FLAGS 0x3UL
  100. #define __DST_METRICS_PTR(Y) \
  101. ((u32 *)((Y) & ~DST_METRICS_FLAGS))
  102. #define DST_METRICS_PTR(X) __DST_METRICS_PTR((X)->_metrics)
  103. static inline bool dst_metrics_read_only(const struct dst_entry *dst)
  104. {
  105. return dst->_metrics & DST_METRICS_READ_ONLY;
  106. }
  107. void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old);
  108. static inline void dst_destroy_metrics_generic(struct dst_entry *dst)
  109. {
  110. unsigned long val = dst->_metrics;
  111. if (!(val & DST_METRICS_READ_ONLY))
  112. __dst_destroy_metrics_generic(dst, val);
  113. }
  114. static inline u32 *dst_metrics_write_ptr(struct dst_entry *dst)
  115. {
  116. unsigned long p = dst->_metrics;
  117. BUG_ON(!p);
  118. if (p & DST_METRICS_READ_ONLY)
  119. return dst->ops->cow_metrics(dst, p);
  120. return __DST_METRICS_PTR(p);
  121. }
  122. /* This may only be invoked before the entry has reached global
  123. * visibility.
  124. */
  125. static inline void dst_init_metrics(struct dst_entry *dst,
  126. const u32 *src_metrics,
  127. bool read_only)
  128. {
  129. dst->_metrics = ((unsigned long) src_metrics) |
  130. (read_only ? DST_METRICS_READ_ONLY : 0);
  131. }
  132. static inline void dst_copy_metrics(struct dst_entry *dest, const struct dst_entry *src)
  133. {
  134. u32 *dst_metrics = dst_metrics_write_ptr(dest);
  135. if (dst_metrics) {
  136. u32 *src_metrics = DST_METRICS_PTR(src);
  137. memcpy(dst_metrics, src_metrics, RTAX_MAX * sizeof(u32));
  138. }
  139. }
  140. static inline u32 *dst_metrics_ptr(struct dst_entry *dst)
  141. {
  142. return DST_METRICS_PTR(dst);
  143. }
  144. static inline u32
  145. dst_metric_raw(const struct dst_entry *dst, const int metric)
  146. {
  147. u32 *p = DST_METRICS_PTR(dst);
  148. return p[metric-1];
  149. }
  150. static inline u32
  151. dst_metric(const struct dst_entry *dst, const int metric)
  152. {
  153. WARN_ON_ONCE(metric == RTAX_HOPLIMIT ||
  154. metric == RTAX_ADVMSS ||
  155. metric == RTAX_MTU);
  156. return dst_metric_raw(dst, metric);
  157. }
  158. static inline u32
  159. dst_metric_advmss(const struct dst_entry *dst)
  160. {
  161. u32 advmss = dst_metric_raw(dst, RTAX_ADVMSS);
  162. if (!advmss)
  163. advmss = dst->ops->default_advmss(dst);
  164. return advmss;
  165. }
  166. static inline void dst_metric_set(struct dst_entry *dst, int metric, u32 val)
  167. {
  168. u32 *p = dst_metrics_write_ptr(dst);
  169. if (p)
  170. p[metric-1] = val;
  171. }
  172. static inline u32
  173. dst_feature(const struct dst_entry *dst, u32 feature)
  174. {
  175. return dst_metric(dst, RTAX_FEATURES) & feature;
  176. }
  177. static inline u32 dst_mtu(const struct dst_entry *dst)
  178. {
  179. return dst->ops->mtu(dst);
  180. }
  181. /* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
  182. static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
  183. {
  184. return msecs_to_jiffies(dst_metric(dst, metric));
  185. }
  186. static inline u32
  187. dst_allfrag(const struct dst_entry *dst)
  188. {
  189. int ret = dst_feature(dst, RTAX_FEATURE_ALLFRAG);
  190. return ret;
  191. }
  192. static inline int
  193. dst_metric_locked(const struct dst_entry *dst, int metric)
  194. {
  195. return dst_metric(dst, RTAX_LOCK) & (1<<metric);
  196. }
  197. static inline void dst_hold(struct dst_entry *dst)
  198. {
  199. /*
  200. * If your kernel compilation stops here, please check
  201. * __pad_to_align_refcnt declaration in struct dst_entry
  202. */
  203. BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
  204. atomic_inc(&dst->__refcnt);
  205. }
  206. static inline void dst_use(struct dst_entry *dst, unsigned long time)
  207. {
  208. dst_hold(dst);
  209. dst->__use++;
  210. dst->lastuse = time;
  211. }
  212. static inline void dst_use_noref(struct dst_entry *dst, unsigned long time)
  213. {
  214. dst->__use++;
  215. dst->lastuse = time;
  216. }
  217. static inline struct dst_entry *dst_clone(struct dst_entry *dst)
  218. {
  219. if (dst)
  220. atomic_inc(&dst->__refcnt);
  221. return dst;
  222. }
  223. 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. * @net: netns for packet i/o
  267. *
  268. * After decapsulation, packet is going to re-enter (netif_rx()) our stack,
  269. * so make some cleanups. (no accounting done)
  270. */
  271. static inline void __skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev,
  272. struct net *net)
  273. {
  274. skb->dev = dev;
  275. /*
  276. * Clear hash so that we can recalulate the hash for the
  277. * encapsulated packet, unless we have already determine the hash
  278. * over the L4 4-tuple.
  279. */
  280. skb_clear_hash_if_not_l4(skb);
  281. skb_set_queue_mapping(skb, 0);
  282. skb_scrub_packet(skb, !net_eq(net, dev_net(dev)));
  283. }
  284. /**
  285. * skb_tunnel_rx - prepare skb for rx reinsert
  286. * @skb: buffer
  287. * @dev: tunnel device
  288. *
  289. * After decapsulation, packet is going to re-enter (netif_rx()) our stack,
  290. * so make some cleanups, and perform accounting.
  291. * Note: this accounting is not SMP safe.
  292. */
  293. static inline void skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev,
  294. struct net *net)
  295. {
  296. /* TODO : stats should be SMP safe */
  297. dev->stats.rx_packets++;
  298. dev->stats.rx_bytes += skb->len;
  299. __skb_tunnel_rx(skb, dev, net);
  300. }
  301. int dst_discard_sk(struct sock *sk, struct sk_buff *skb);
  302. static inline int dst_discard(struct sk_buff *skb)
  303. {
  304. return dst_discard_sk(skb->sk, skb);
  305. }
  306. void *dst_alloc(struct dst_ops *ops, struct net_device *dev, int initial_ref,
  307. int initial_obsolete, unsigned short flags);
  308. void __dst_free(struct dst_entry *dst);
  309. struct dst_entry *dst_destroy(struct dst_entry *dst);
  310. static inline void dst_free(struct dst_entry *dst)
  311. {
  312. if (dst->obsolete > 0)
  313. return;
  314. if (!atomic_read(&dst->__refcnt)) {
  315. dst = dst_destroy(dst);
  316. if (!dst)
  317. return;
  318. }
  319. __dst_free(dst);
  320. }
  321. static inline void dst_rcu_free(struct rcu_head *head)
  322. {
  323. struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
  324. dst_free(dst);
  325. }
  326. static inline void dst_confirm(struct dst_entry *dst)
  327. {
  328. dst->pending_confirm = 1;
  329. }
  330. static inline int dst_neigh_output(struct dst_entry *dst, struct neighbour *n,
  331. struct sk_buff *skb)
  332. {
  333. const struct hh_cache *hh;
  334. if (dst->pending_confirm) {
  335. unsigned long now = jiffies;
  336. dst->pending_confirm = 0;
  337. /* avoid dirtying neighbour */
  338. if (n->confirmed != now)
  339. n->confirmed = now;
  340. }
  341. hh = &n->hh;
  342. if ((n->nud_state & NUD_CONNECTED) && hh->hh_len)
  343. return neigh_hh_output(hh, skb);
  344. else
  345. return n->output(n, skb);
  346. }
  347. static inline struct neighbour *dst_neigh_lookup(const struct dst_entry *dst, const void *daddr)
  348. {
  349. struct neighbour *n = dst->ops->neigh_lookup(dst, NULL, daddr);
  350. return IS_ERR(n) ? NULL : n;
  351. }
  352. static inline struct neighbour *dst_neigh_lookup_skb(const struct dst_entry *dst,
  353. struct sk_buff *skb)
  354. {
  355. struct neighbour *n = dst->ops->neigh_lookup(dst, skb, NULL);
  356. return IS_ERR(n) ? NULL : n;
  357. }
  358. static inline void dst_link_failure(struct sk_buff *skb)
  359. {
  360. struct dst_entry *dst = skb_dst(skb);
  361. if (dst && dst->ops && dst->ops->link_failure)
  362. dst->ops->link_failure(skb);
  363. }
  364. static inline void dst_set_expires(struct dst_entry *dst, int timeout)
  365. {
  366. unsigned long expires = jiffies + timeout;
  367. if (expires == 0)
  368. expires = 1;
  369. if (dst->expires == 0 || time_before(expires, dst->expires))
  370. dst->expires = expires;
  371. }
  372. /* Output packet to network from transport. */
  373. static inline int dst_output_sk(struct sock *sk, struct sk_buff *skb)
  374. {
  375. return skb_dst(skb)->output(sk, skb);
  376. }
  377. static inline int dst_output(struct sk_buff *skb)
  378. {
  379. return dst_output_sk(skb->sk, skb);
  380. }
  381. /* Input packet from network to transport. */
  382. static inline int dst_input(struct sk_buff *skb)
  383. {
  384. return skb_dst(skb)->input(skb);
  385. }
  386. static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
  387. {
  388. if (dst->obsolete)
  389. dst = dst->ops->check(dst, cookie);
  390. return dst;
  391. }
  392. void dst_init(void);
  393. /* Flags for xfrm_lookup flags argument. */
  394. enum {
  395. XFRM_LOOKUP_ICMP = 1 << 0,
  396. XFRM_LOOKUP_QUEUE = 1 << 1,
  397. XFRM_LOOKUP_KEEP_DST_REF = 1 << 2,
  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. static inline struct dst_entry *xfrm_lookup_route(struct net *net,
  409. struct dst_entry *dst_orig,
  410. const struct flowi *fl,
  411. struct sock *sk,
  412. int flags)
  413. {
  414. return dst_orig;
  415. }
  416. static inline struct xfrm_state *dst_xfrm(const struct dst_entry *dst)
  417. {
  418. return NULL;
  419. }
  420. #else
  421. struct dst_entry *xfrm_lookup(struct net *net, struct dst_entry *dst_orig,
  422. const struct flowi *fl, struct sock *sk,
  423. int flags);
  424. struct dst_entry *xfrm_lookup_route(struct net *net, struct dst_entry *dst_orig,
  425. const struct flowi *fl, struct sock *sk,
  426. int flags);
  427. /* skb attached with this dst needs transformation if dst->xfrm is valid */
  428. static inline struct xfrm_state *dst_xfrm(const struct dst_entry *dst)
  429. {
  430. return dst->xfrm;
  431. }
  432. #endif
  433. #endif /* _NET_DST_H */