• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * net/dst.h	Protocol independent destination cache definitions.
3  *
4  * Authors:	Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
5  *
6  */
7 
8 #ifndef _NET_DST_H
9 #define _NET_DST_H
10 
11 #include <net/dst_ops.h>
12 #include <linux/netdevice.h>
13 #include <linux/rtnetlink.h>
14 #include <linux/rcupdate.h>
15 #include <linux/bug.h>
16 #include <linux/jiffies.h>
17 #include <net/neighbour.h>
18 #include <asm/processor.h>
19 
20 #define DST_GC_MIN	(HZ/10)
21 #define DST_GC_INC	(HZ/2)
22 #define DST_GC_MAX	(120*HZ)
23 
24 /* Each dst_entry has reference count and sits in some parent list(s).
25  * When it is removed from parent list, it is "freed" (dst_free).
26  * After this it enters dead state (dst->obsolete > 0) and if its refcnt
27  * is zero, it can be destroyed immediately, otherwise it is added
28  * to gc list and garbage collector periodically checks the refcnt.
29  */
30 
31 struct sk_buff;
32 
33 struct dst_entry {
34 	struct rcu_head		rcu_head;
35 	struct dst_entry	*child;
36 	struct net_device       *dev;
37 	struct  dst_ops	        *ops;
38 	unsigned long		_metrics;
39 	unsigned long           expires;
40 	struct dst_entry	*path;
41 	struct dst_entry	*from;
42 #ifdef CONFIG_XFRM
43 	struct xfrm_state	*xfrm;
44 #else
45 	void			*__pad1;
46 #endif
47 	int			(*input)(struct sk_buff *);
48 	int			(*output)(struct sock *sk, struct sk_buff *skb);
49 
50 	unsigned short		flags;
51 #define DST_HOST		0x0001
52 #define DST_NOXFRM		0x0002
53 #define DST_NOPOLICY		0x0004
54 #define DST_NOHASH		0x0008
55 #define DST_NOCACHE		0x0010
56 #define DST_NOCOUNT		0x0020
57 #define DST_FAKE_RTABLE		0x0040
58 #define DST_XFRM_TUNNEL		0x0080
59 #define DST_XFRM_QUEUE		0x0100
60 
61 	unsigned short		pending_confirm;
62 
63 	short			error;
64 
65 	/* A non-zero value of dst->obsolete forces by-hand validation
66 	 * of the route entry.  Positive values are set by the generic
67 	 * dst layer to indicate that the entry has been forcefully
68 	 * destroyed.
69 	 *
70 	 * Negative values are used by the implementation layer code to
71 	 * force invocation of the dst_ops->check() method.
72 	 */
73 	short			obsolete;
74 #define DST_OBSOLETE_NONE	0
75 #define DST_OBSOLETE_DEAD	2
76 #define DST_OBSOLETE_FORCE_CHK	-1
77 #define DST_OBSOLETE_KILL	-2
78 	unsigned short		header_len;	/* more space at head required */
79 	unsigned short		trailer_len;	/* space to reserve at tail */
80 #ifdef CONFIG_IP_ROUTE_CLASSID
81 	__u32			tclassid;
82 #else
83 	__u32			__pad2;
84 #endif
85 
86 	/*
87 	 * Align __refcnt to a 64 bytes alignment
88 	 * (L1_CACHE_SIZE would be too much)
89 	 */
90 #ifdef CONFIG_64BIT
91 	long			__pad_to_align_refcnt[2];
92 #endif
93 	/*
94 	 * __refcnt wants to be on a different cache line from
95 	 * input/output/ops or performance tanks badly
96 	 */
97 	atomic_t		__refcnt;	/* client references	*/
98 	int			__use;
99 	unsigned long		lastuse;
100 	union {
101 		struct dst_entry	*next;
102 		struct rtable __rcu	*rt_next;
103 		struct rt6_info		*rt6_next;
104 		struct dn_route __rcu	*dn_next;
105 	};
106 };
107 
108 u32 *dst_cow_metrics_generic(struct dst_entry *dst, unsigned long old);
109 extern const u32 dst_default_metrics[];
110 
111 #define DST_METRICS_READ_ONLY		0x1UL
112 #define DST_METRICS_FORCE_OVERWRITE	0x2UL
113 #define DST_METRICS_FLAGS		0x3UL
114 #define __DST_METRICS_PTR(Y)	\
115 	((u32 *)((Y) & ~DST_METRICS_FLAGS))
116 #define DST_METRICS_PTR(X)	__DST_METRICS_PTR((X)->_metrics)
117 
dst_metrics_read_only(const struct dst_entry * dst)118 static inline bool dst_metrics_read_only(const struct dst_entry *dst)
119 {
120 	return dst->_metrics & DST_METRICS_READ_ONLY;
121 }
122 
dst_metrics_set_force_overwrite(struct dst_entry * dst)123 static inline void dst_metrics_set_force_overwrite(struct dst_entry *dst)
124 {
125 	dst->_metrics |= DST_METRICS_FORCE_OVERWRITE;
126 }
127 
128 void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old);
129 
dst_destroy_metrics_generic(struct dst_entry * dst)130 static inline void dst_destroy_metrics_generic(struct dst_entry *dst)
131 {
132 	unsigned long val = dst->_metrics;
133 	if (!(val & DST_METRICS_READ_ONLY))
134 		__dst_destroy_metrics_generic(dst, val);
135 }
136 
dst_metrics_write_ptr(struct dst_entry * dst)137 static inline u32 *dst_metrics_write_ptr(struct dst_entry *dst)
138 {
139 	unsigned long p = dst->_metrics;
140 
141 	BUG_ON(!p);
142 
143 	if (p & DST_METRICS_READ_ONLY)
144 		return dst->ops->cow_metrics(dst, p);
145 	return __DST_METRICS_PTR(p);
146 }
147 
148 /* This may only be invoked before the entry has reached global
149  * visibility.
150  */
dst_init_metrics(struct dst_entry * dst,const u32 * src_metrics,bool read_only)151 static inline void dst_init_metrics(struct dst_entry *dst,
152 				    const u32 *src_metrics,
153 				    bool read_only)
154 {
155 	dst->_metrics = ((unsigned long) src_metrics) |
156 		(read_only ? DST_METRICS_READ_ONLY : 0);
157 }
158 
dst_copy_metrics(struct dst_entry * dest,const struct dst_entry * src)159 static inline void dst_copy_metrics(struct dst_entry *dest, const struct dst_entry *src)
160 {
161 	u32 *dst_metrics = dst_metrics_write_ptr(dest);
162 
163 	if (dst_metrics) {
164 		u32 *src_metrics = DST_METRICS_PTR(src);
165 
166 		memcpy(dst_metrics, src_metrics, RTAX_MAX * sizeof(u32));
167 	}
168 }
169 
dst_metrics_ptr(struct dst_entry * dst)170 static inline u32 *dst_metrics_ptr(struct dst_entry *dst)
171 {
172 	return DST_METRICS_PTR(dst);
173 }
174 
175 static inline u32
dst_metric_raw(const struct dst_entry * dst,const int metric)176 dst_metric_raw(const struct dst_entry *dst, const int metric)
177 {
178 	u32 *p = DST_METRICS_PTR(dst);
179 
180 	return p[metric-1];
181 }
182 
183 static inline u32
dst_metric(const struct dst_entry * dst,const int metric)184 dst_metric(const struct dst_entry *dst, const int metric)
185 {
186 	WARN_ON_ONCE(metric == RTAX_HOPLIMIT ||
187 		     metric == RTAX_ADVMSS ||
188 		     metric == RTAX_MTU);
189 	return dst_metric_raw(dst, metric);
190 }
191 
192 static inline u32
dst_metric_advmss(const struct dst_entry * dst)193 dst_metric_advmss(const struct dst_entry *dst)
194 {
195 	u32 advmss = dst_metric_raw(dst, RTAX_ADVMSS);
196 
197 	if (!advmss)
198 		advmss = dst->ops->default_advmss(dst);
199 
200 	return advmss;
201 }
202 
dst_metric_set(struct dst_entry * dst,int metric,u32 val)203 static inline void dst_metric_set(struct dst_entry *dst, int metric, u32 val)
204 {
205 	u32 *p = dst_metrics_write_ptr(dst);
206 
207 	if (p)
208 		p[metric-1] = val;
209 }
210 
211 static inline u32
dst_feature(const struct dst_entry * dst,u32 feature)212 dst_feature(const struct dst_entry *dst, u32 feature)
213 {
214 	return dst_metric(dst, RTAX_FEATURES) & feature;
215 }
216 
dst_mtu(const struct dst_entry * dst)217 static inline u32 dst_mtu(const struct dst_entry *dst)
218 {
219 	return dst->ops->mtu(dst);
220 }
221 
222 /* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
dst_metric_rtt(const struct dst_entry * dst,int metric)223 static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
224 {
225 	return msecs_to_jiffies(dst_metric(dst, metric));
226 }
227 
228 static inline u32
dst_allfrag(const struct dst_entry * dst)229 dst_allfrag(const struct dst_entry *dst)
230 {
231 	int ret = dst_feature(dst,  RTAX_FEATURE_ALLFRAG);
232 	return ret;
233 }
234 
235 static inline int
dst_metric_locked(const struct dst_entry * dst,int metric)236 dst_metric_locked(const struct dst_entry *dst, int metric)
237 {
238 	return dst_metric(dst, RTAX_LOCK) & (1<<metric);
239 }
240 
dst_hold(struct dst_entry * dst)241 static inline void dst_hold(struct dst_entry *dst)
242 {
243 	/*
244 	 * If your kernel compilation stops here, please check
245 	 * __pad_to_align_refcnt declaration in struct dst_entry
246 	 */
247 	BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
248 	atomic_inc(&dst->__refcnt);
249 }
250 
dst_use(struct dst_entry * dst,unsigned long time)251 static inline void dst_use(struct dst_entry *dst, unsigned long time)
252 {
253 	dst_hold(dst);
254 	dst->__use++;
255 	dst->lastuse = time;
256 }
257 
dst_use_noref(struct dst_entry * dst,unsigned long time)258 static inline void dst_use_noref(struct dst_entry *dst, unsigned long time)
259 {
260 	dst->__use++;
261 	dst->lastuse = time;
262 }
263 
dst_clone(struct dst_entry * dst)264 static inline struct dst_entry *dst_clone(struct dst_entry *dst)
265 {
266 	if (dst)
267 		atomic_inc(&dst->__refcnt);
268 	return dst;
269 }
270 
271 void dst_release(struct dst_entry *dst);
272 
refdst_drop(unsigned long refdst)273 static inline void refdst_drop(unsigned long refdst)
274 {
275 	if (!(refdst & SKB_DST_NOREF))
276 		dst_release((struct dst_entry *)(refdst & SKB_DST_PTRMASK));
277 }
278 
279 /**
280  * skb_dst_drop - drops skb dst
281  * @skb: buffer
282  *
283  * Drops dst reference count if a reference was taken.
284  */
skb_dst_drop(struct sk_buff * skb)285 static inline void skb_dst_drop(struct sk_buff *skb)
286 {
287 	if (skb->_skb_refdst) {
288 		refdst_drop(skb->_skb_refdst);
289 		skb->_skb_refdst = 0UL;
290 	}
291 }
292 
skb_dst_copy(struct sk_buff * nskb,const struct sk_buff * oskb)293 static inline void skb_dst_copy(struct sk_buff *nskb, const struct sk_buff *oskb)
294 {
295 	nskb->_skb_refdst = oskb->_skb_refdst;
296 	if (!(nskb->_skb_refdst & SKB_DST_NOREF))
297 		dst_clone(skb_dst(nskb));
298 }
299 
300 /**
301  * skb_dst_force - makes sure skb dst is refcounted
302  * @skb: buffer
303  *
304  * If dst is not yet refcounted, let's do it
305  */
skb_dst_force(struct sk_buff * skb)306 static inline void skb_dst_force(struct sk_buff *skb)
307 {
308 	if (skb_dst_is_noref(skb)) {
309 		WARN_ON(!rcu_read_lock_held());
310 		skb->_skb_refdst &= ~SKB_DST_NOREF;
311 		dst_clone(skb_dst(skb));
312 	}
313 }
314 
315 /**
316  * dst_hold_safe - Take a reference on a dst if possible
317  * @dst: pointer to dst entry
318  *
319  * This helper returns false if it could not safely
320  * take a reference on a dst.
321  */
dst_hold_safe(struct dst_entry * dst)322 static inline bool dst_hold_safe(struct dst_entry *dst)
323 {
324 	if (dst->flags & DST_NOCACHE)
325 		return atomic_inc_not_zero(&dst->__refcnt);
326 	dst_hold(dst);
327 	return true;
328 }
329 
330 /**
331  * skb_dst_force_safe - makes sure skb dst is refcounted
332  * @skb: buffer
333  *
334  * If dst is not yet refcounted and not destroyed, grab a ref on it.
335  */
skb_dst_force_safe(struct sk_buff * skb)336 static inline void skb_dst_force_safe(struct sk_buff *skb)
337 {
338 	if (skb_dst_is_noref(skb)) {
339 		struct dst_entry *dst = skb_dst(skb);
340 
341 		if (!dst_hold_safe(dst))
342 			dst = NULL;
343 
344 		skb->_skb_refdst = (unsigned long)dst;
345 	}
346 }
347 
348 
349 /**
350  *	__skb_tunnel_rx - prepare skb for rx reinsert
351  *	@skb: buffer
352  *	@dev: tunnel device
353  *	@net: netns for packet i/o
354  *
355  *	After decapsulation, packet is going to re-enter (netif_rx()) our stack,
356  *	so make some cleanups. (no accounting done)
357  */
__skb_tunnel_rx(struct sk_buff * skb,struct net_device * dev,struct net * net)358 static inline void __skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev,
359 				   struct net *net)
360 {
361 	skb->dev = dev;
362 
363 	/*
364 	 * Clear hash so that we can recalulate the hash for the
365 	 * encapsulated packet, unless we have already determine the hash
366 	 * over the L4 4-tuple.
367 	 */
368 	skb_clear_hash_if_not_l4(skb);
369 	skb_set_queue_mapping(skb, 0);
370 	skb_scrub_packet(skb, !net_eq(net, dev_net(dev)));
371 }
372 
373 /**
374  *	skb_tunnel_rx - prepare skb for rx reinsert
375  *	@skb: buffer
376  *	@dev: tunnel device
377  *
378  *	After decapsulation, packet is going to re-enter (netif_rx()) our stack,
379  *	so make some cleanups, and perform accounting.
380  *	Note: this accounting is not SMP safe.
381  */
skb_tunnel_rx(struct sk_buff * skb,struct net_device * dev,struct net * net)382 static inline void skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev,
383 				 struct net *net)
384 {
385 	/* TODO : stats should be SMP safe */
386 	dev->stats.rx_packets++;
387 	dev->stats.rx_bytes += skb->len;
388 	__skb_tunnel_rx(skb, dev, net);
389 }
390 
391 /* Children define the path of the packet through the
392  * Linux networking.  Thus, destinations are stackable.
393  */
394 
skb_dst_pop(struct sk_buff * skb)395 static inline struct dst_entry *skb_dst_pop(struct sk_buff *skb)
396 {
397 	struct dst_entry *child = dst_clone(skb_dst(skb)->child);
398 
399 	skb_dst_drop(skb);
400 	return child;
401 }
402 
403 int dst_discard_sk(struct sock *sk, struct sk_buff *skb);
dst_discard(struct sk_buff * skb)404 static inline int dst_discard(struct sk_buff *skb)
405 {
406 	return dst_discard_sk(skb->sk, skb);
407 }
408 void *dst_alloc(struct dst_ops *ops, struct net_device *dev, int initial_ref,
409 		int initial_obsolete, unsigned short flags);
410 void __dst_free(struct dst_entry *dst);
411 struct dst_entry *dst_destroy(struct dst_entry *dst);
412 
dst_free(struct dst_entry * dst)413 static inline void dst_free(struct dst_entry *dst)
414 {
415 	if (dst->obsolete > 0)
416 		return;
417 	if (!atomic_read(&dst->__refcnt)) {
418 		dst = dst_destroy(dst);
419 		if (!dst)
420 			return;
421 	}
422 	__dst_free(dst);
423 }
424 
dst_rcu_free(struct rcu_head * head)425 static inline void dst_rcu_free(struct rcu_head *head)
426 {
427 	struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
428 	dst_free(dst);
429 }
430 
dst_confirm(struct dst_entry * dst)431 static inline void dst_confirm(struct dst_entry *dst)
432 {
433 	dst->pending_confirm = 1;
434 }
435 
dst_neigh_output(struct dst_entry * dst,struct neighbour * n,struct sk_buff * skb)436 static inline int dst_neigh_output(struct dst_entry *dst, struct neighbour *n,
437 				   struct sk_buff *skb)
438 {
439 	const struct hh_cache *hh;
440 
441 	if (dst->pending_confirm) {
442 		unsigned long now = jiffies;
443 
444 		dst->pending_confirm = 0;
445 		/* avoid dirtying neighbour */
446 		if (n->confirmed != now)
447 			n->confirmed = now;
448 	}
449 
450 	hh = &n->hh;
451 	if ((n->nud_state & NUD_CONNECTED) && hh->hh_len)
452 		return neigh_hh_output(hh, skb);
453 	else
454 		return n->output(n, skb);
455 }
456 
dst_neigh_lookup(const struct dst_entry * dst,const void * daddr)457 static inline struct neighbour *dst_neigh_lookup(const struct dst_entry *dst, const void *daddr)
458 {
459 	struct neighbour *n = dst->ops->neigh_lookup(dst, NULL, daddr);
460 	return IS_ERR(n) ? NULL : n;
461 }
462 
dst_neigh_lookup_skb(const struct dst_entry * dst,struct sk_buff * skb)463 static inline struct neighbour *dst_neigh_lookup_skb(const struct dst_entry *dst,
464 						     struct sk_buff *skb)
465 {
466 	struct neighbour *n =  dst->ops->neigh_lookup(dst, skb, NULL);
467 	return IS_ERR(n) ? NULL : n;
468 }
469 
dst_link_failure(struct sk_buff * skb)470 static inline void dst_link_failure(struct sk_buff *skb)
471 {
472 	struct dst_entry *dst = skb_dst(skb);
473 	if (dst && dst->ops && dst->ops->link_failure)
474 		dst->ops->link_failure(skb);
475 }
476 
dst_set_expires(struct dst_entry * dst,int timeout)477 static inline void dst_set_expires(struct dst_entry *dst, int timeout)
478 {
479 	unsigned long expires = jiffies + timeout;
480 
481 	if (expires == 0)
482 		expires = 1;
483 
484 	if (dst->expires == 0 || time_before(expires, dst->expires))
485 		dst->expires = expires;
486 }
487 
488 /* Output packet to network from transport.  */
dst_output_sk(struct sock * sk,struct sk_buff * skb)489 static inline int dst_output_sk(struct sock *sk, struct sk_buff *skb)
490 {
491 	return skb_dst(skb)->output(sk, skb);
492 }
dst_output(struct sk_buff * skb)493 static inline int dst_output(struct sk_buff *skb)
494 {
495 	return dst_output_sk(skb->sk, skb);
496 }
497 
498 /* Input packet from network to transport.  */
dst_input(struct sk_buff * skb)499 static inline int dst_input(struct sk_buff *skb)
500 {
501 	return skb_dst(skb)->input(skb);
502 }
503 
dst_check(struct dst_entry * dst,u32 cookie)504 static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
505 {
506 	if (dst->obsolete)
507 		dst = dst->ops->check(dst, cookie);
508 	return dst;
509 }
510 
511 void dst_init(void);
512 
513 /* Flags for xfrm_lookup flags argument. */
514 enum {
515 	XFRM_LOOKUP_ICMP = 1 << 0,
516 	XFRM_LOOKUP_QUEUE = 1 << 1,
517 	XFRM_LOOKUP_KEEP_DST_REF = 1 << 2,
518 };
519 
520 struct flowi;
521 #ifndef CONFIG_XFRM
xfrm_lookup(struct net * net,struct dst_entry * dst_orig,const struct flowi * fl,struct sock * sk,int flags)522 static inline struct dst_entry *xfrm_lookup(struct net *net,
523 					    struct dst_entry *dst_orig,
524 					    const struct flowi *fl, struct sock *sk,
525 					    int flags)
526 {
527 	return dst_orig;
528 }
529 
xfrm_lookup_route(struct net * net,struct dst_entry * dst_orig,const struct flowi * fl,struct sock * sk,int flags)530 static inline struct dst_entry *xfrm_lookup_route(struct net *net,
531 						  struct dst_entry *dst_orig,
532 						  const struct flowi *fl,
533 						  struct sock *sk,
534 						  int flags)
535 {
536 	return dst_orig;
537 }
538 
dst_xfrm(const struct dst_entry * dst)539 static inline struct xfrm_state *dst_xfrm(const struct dst_entry *dst)
540 {
541 	return NULL;
542 }
543 
544 #else
545 struct dst_entry *xfrm_lookup(struct net *net, struct dst_entry *dst_orig,
546 			      const struct flowi *fl, struct sock *sk,
547 			      int flags);
548 
549 struct dst_entry *xfrm_lookup_route(struct net *net, struct dst_entry *dst_orig,
550 				    const struct flowi *fl, struct sock *sk,
551 				    int flags);
552 
553 /* skb attached with this dst needs transformation if dst->xfrm is valid */
dst_xfrm(const struct dst_entry * dst)554 static inline struct xfrm_state *dst_xfrm(const struct dst_entry *dst)
555 {
556 	return dst->xfrm;
557 }
558 #endif
559 
560 #endif /* _NET_DST_H */
561