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 trailer_len
; /* space to reserve at tail */
55 unsigned int rate_tokens
;
56 unsigned long rate_last
; /* rate limiting for ICMP */
58 struct dst_entry
*path
;
60 struct neighbour
*neighbour
;
62 struct xfrm_state
*xfrm
;
64 int (*input
)(struct sk_buff
*);
65 int (*output
)(struct sk_buff
*);
69 u32 metrics
[RTAX_MAX
];
71 #ifdef CONFIG_NET_CLS_ROUTE
76 * __refcnt wants to be on a different cache line from
77 * input/output/ops or performance tanks badly
79 atomic_t __refcnt
; /* client references */
81 unsigned long lastuse
;
83 struct dst_entry
*next
;
84 struct rtable
*rt_next
;
85 struct rt6_info
*rt6_next
;
86 struct dn_route
*dn_next
;
93 unsigned short family
;
97 int (*gc
)(struct dst_ops
*ops
);
98 struct dst_entry
* (*check
)(struct dst_entry
*, __u32 cookie
);
99 void (*destroy
)(struct dst_entry
*);
100 void (*ifdown
)(struct dst_entry
*,
101 struct net_device
*dev
, int how
);
102 struct dst_entry
* (*negative_advice
)(struct dst_entry
*);
103 void (*link_failure
)(struct sk_buff
*);
104 void (*update_pmtu
)(struct dst_entry
*dst
, u32 mtu
);
105 int (*local_out
)(struct sk_buff
*skb
);
109 struct kmem_cache
*kmem_cachep
;
116 dst_metric(const struct dst_entry
*dst
, int metric
)
118 return dst
->metrics
[metric
-1];
121 static inline u32
dst_mtu(const struct dst_entry
*dst
)
123 u32 mtu
= dst_metric(dst
, RTAX_MTU
);
125 * Alexey put it here, so ask him about it :)
132 dst_allfrag(const struct dst_entry
*dst
)
134 int ret
= dst_metric(dst
, RTAX_FEATURES
) & RTAX_FEATURE_ALLFRAG
;
135 /* Yes, _exactly_. This is paranoia. */
141 dst_metric_locked(struct dst_entry
*dst
, int metric
)
143 return dst_metric(dst
, RTAX_LOCK
) & (1<<metric
);
146 static inline void dst_hold(struct dst_entry
* dst
)
148 atomic_inc(&dst
->__refcnt
);
151 static inline void dst_use(struct dst_entry
*dst
, unsigned long time
)
159 struct dst_entry
* dst_clone(struct dst_entry
* dst
)
162 atomic_inc(&dst
->__refcnt
);
166 extern void dst_release(struct dst_entry
*dst
);
168 /* Children define the path of the packet through the
169 * Linux networking. Thus, destinations are stackable.
172 static inline struct dst_entry
*dst_pop(struct dst_entry
*dst
)
174 struct dst_entry
*child
= dst_clone(dst
->child
);
180 extern int dst_discard(struct sk_buff
*skb
);
181 extern void * dst_alloc(struct dst_ops
* ops
);
182 extern void __dst_free(struct dst_entry
* dst
);
183 extern struct dst_entry
*dst_destroy(struct dst_entry
* dst
);
185 static inline void dst_free(struct dst_entry
* dst
)
187 if (dst
->obsolete
> 1)
189 if (!atomic_read(&dst
->__refcnt
)) {
190 dst
= dst_destroy(dst
);
197 static inline void dst_rcu_free(struct rcu_head
*head
)
199 struct dst_entry
*dst
= container_of(head
, struct dst_entry
, rcu_head
);
203 static inline void dst_confirm(struct dst_entry
*dst
)
206 neigh_confirm(dst
->neighbour
);
209 static inline void dst_negative_advice(struct dst_entry
**dst_p
)
211 struct dst_entry
* dst
= *dst_p
;
212 if (dst
&& dst
->ops
->negative_advice
)
213 *dst_p
= dst
->ops
->negative_advice(dst
);
216 static inline void dst_link_failure(struct sk_buff
*skb
)
218 struct dst_entry
* dst
= skb
->dst
;
219 if (dst
&& dst
->ops
&& dst
->ops
->link_failure
)
220 dst
->ops
->link_failure(skb
);
223 static inline void dst_set_expires(struct dst_entry
*dst
, int timeout
)
225 unsigned long expires
= jiffies
+ timeout
;
230 if (dst
->expires
== 0 || time_before(expires
, dst
->expires
))
231 dst
->expires
= expires
;
234 /* Output packet to network from transport. */
235 static inline int dst_output(struct sk_buff
*skb
)
237 return skb
->dst
->output(skb
);
240 /* Input packet from network to transport. */
241 static inline int dst_input(struct sk_buff
*skb
)
246 err
= skb
->dst
->input(skb
);
248 if (likely(err
== 0))
250 /* Oh, Jamal... Seems, I will not forgive you this mess. :-) */
251 if (unlikely(err
!= NET_XMIT_BYPASS
))
256 static inline struct dst_entry
*dst_check(struct dst_entry
*dst
, u32 cookie
)
259 dst
= dst
->ops
->check(dst
, cookie
);
263 extern void dst_init(void);
265 /* Flags for xfrm_lookup flags argument. */
267 XFRM_LOOKUP_WAIT
= 1 << 0,
268 XFRM_LOOKUP_ICMP
= 1 << 1,
273 static inline int xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
274 struct sock
*sk
, int flags
)
278 static inline int __xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
279 struct sock
*sk
, int flags
)
284 extern int xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
285 struct sock
*sk
, int flags
);
286 extern int __xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
287 struct sock
*sk
, int flags
);
291 #endif /* _NET_DST_H */