dst.h 14 KB

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