dst.h 13 KB

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