2 * net/dst.h Protocol independent destination cache definitions.
4 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
11 #include <linux/netdevice.h>
12 #include <linux/rtnetlink.h>
13 #include <linux/rcupdate.h>
14 #include <linux/jiffies.h>
15 #include <net/neighbour.h>
16 #include <asm/processor.h>
19 * 0 - no debugging messages
20 * 1 - rare events and bugs (default)
23 #define RT_CACHE_DEBUG 0
25 #define DST_GC_MIN (HZ/10)
26 #define DST_GC_INC (HZ/2)
27 #define DST_GC_MAX (120*HZ)
29 /* Each dst_entry has reference count and sits in some parent list(s).
30 * When it is removed from parent list, it is "freed" (dst_free).
31 * After this it enters dead state (dst->obsolete > 0) and if its refcnt
32 * is zero, it can be destroyed immediately, otherwise it is added
33 * to gc list and garbage collector periodically checks the refcnt.
40 struct rcu_head rcu_head
;
41 struct dst_entry
*child
;
42 struct net_device
*dev
;
48 #define DST_NOPOLICY 4
50 unsigned long expires
;
52 unsigned short header_len
; /* more space at head required */
53 unsigned short nfheader_len
; /* more non-fragment space at head required */
54 unsigned short trailer_len
; /* space to reserve at tail */
56 u32 metrics
[RTAX_MAX
];
57 struct dst_entry
*path
;
59 unsigned long rate_last
; /* rate limiting for ICMP */
60 unsigned long rate_tokens
;
62 struct neighbour
*neighbour
;
64 struct xfrm_state
*xfrm
;
66 int (*input
)(struct sk_buff
*);
67 int (*output
)(struct sk_buff
*);
69 #ifdef CONFIG_NET_CLS_ROUTE
75 unsigned long lastuse
;
76 atomic_t __refcnt
; /* client references */
79 struct dst_entry
*next
;
80 struct rtable
*rt_next
;
81 struct rt6_info
*rt6_next
;
82 struct dn_route
*dn_next
;
90 unsigned short family
;
95 struct dst_entry
* (*check
)(struct dst_entry
*, __u32 cookie
);
96 void (*destroy
)(struct dst_entry
*);
97 void (*ifdown
)(struct dst_entry
*,
98 struct net_device
*dev
, int how
);
99 struct dst_entry
* (*negative_advice
)(struct dst_entry
*);
100 void (*link_failure
)(struct sk_buff
*);
101 void (*update_pmtu
)(struct dst_entry
*dst
, u32 mtu
);
105 struct kmem_cache
*kmem_cachep
;
111 dst_metric(const struct dst_entry
*dst
, int metric
)
113 return dst
->metrics
[metric
-1];
116 static inline u32
dst_mtu(const struct dst_entry
*dst
)
118 u32 mtu
= dst_metric(dst
, RTAX_MTU
);
120 * Alexey put it here, so ask him about it :)
127 dst_allfrag(const struct dst_entry
*dst
)
129 int ret
= dst_metric(dst
, RTAX_FEATURES
) & RTAX_FEATURE_ALLFRAG
;
130 /* Yes, _exactly_. This is paranoia. */
136 dst_metric_locked(struct dst_entry
*dst
, int metric
)
138 return dst_metric(dst
, RTAX_LOCK
) & (1<<metric
);
141 static inline void dst_hold(struct dst_entry
* dst
)
143 atomic_inc(&dst
->__refcnt
);
146 static inline void dst_use(struct dst_entry
*dst
, unsigned long time
)
154 struct dst_entry
* dst_clone(struct dst_entry
* dst
)
157 atomic_inc(&dst
->__refcnt
);
162 void dst_release(struct dst_entry
* dst
)
165 WARN_ON(atomic_read(&dst
->__refcnt
) < 1);
166 smp_mb__before_atomic_dec();
167 atomic_dec(&dst
->__refcnt
);
171 /* Children define the path of the packet through the
172 * Linux networking. Thus, destinations are stackable.
175 static inline struct dst_entry
*dst_pop(struct dst_entry
*dst
)
177 struct dst_entry
*child
= dst_clone(dst
->child
);
183 extern void * dst_alloc(struct dst_ops
* ops
);
184 extern void __dst_free(struct dst_entry
* dst
);
185 extern struct dst_entry
*dst_destroy(struct dst_entry
* dst
);
187 static inline void dst_free(struct dst_entry
* dst
)
189 if (dst
->obsolete
> 1)
191 if (!atomic_read(&dst
->__refcnt
)) {
192 dst
= dst_destroy(dst
);
199 static inline void dst_rcu_free(struct rcu_head
*head
)
201 struct dst_entry
*dst
= container_of(head
, struct dst_entry
, rcu_head
);
205 static inline void dst_confirm(struct dst_entry
*dst
)
208 neigh_confirm(dst
->neighbour
);
211 static inline void dst_negative_advice(struct dst_entry
**dst_p
)
213 struct dst_entry
* dst
= *dst_p
;
214 if (dst
&& dst
->ops
->negative_advice
)
215 *dst_p
= dst
->ops
->negative_advice(dst
);
218 static inline void dst_link_failure(struct sk_buff
*skb
)
220 struct dst_entry
* dst
= skb
->dst
;
221 if (dst
&& dst
->ops
&& dst
->ops
->link_failure
)
222 dst
->ops
->link_failure(skb
);
225 static inline void dst_set_expires(struct dst_entry
*dst
, int timeout
)
227 unsigned long expires
= jiffies
+ timeout
;
232 if (dst
->expires
== 0 || time_before(expires
, dst
->expires
))
233 dst
->expires
= expires
;
236 /* Output packet to network from transport. */
237 static inline int dst_output(struct sk_buff
*skb
)
239 return skb
->dst
->output(skb
);
242 /* Input packet from network to transport. */
243 static inline int dst_input(struct sk_buff
*skb
)
248 err
= skb
->dst
->input(skb
);
250 if (likely(err
== 0))
252 /* Oh, Jamal... Seems, I will not forgive you this mess. :-) */
253 if (unlikely(err
!= NET_XMIT_BYPASS
))
258 static inline struct dst_entry
*dst_check(struct dst_entry
*dst
, u32 cookie
)
261 dst
= dst
->ops
->check(dst
, cookie
);
265 extern void dst_init(void);
269 static inline int xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
270 struct sock
*sk
, int flags
)
274 static inline int __xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
275 struct sock
*sk
, int flags
)
280 extern int xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
281 struct sock
*sk
, int flags
);
282 extern int __xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
283 struct sock
*sk
, int flags
);
287 #endif /* _NET_DST_H */