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