]> bbs.cooldavid.org Git - net-next-2.6.git/blame - include/net/dst.h
net: sk_dst_cache RCUification
[net-next-2.6.git] / include / net / dst.h
CommitLineData
1da177e4
LT
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
86393e52 11#include <net/dst_ops.h>
14c85021 12#include <linux/netdevice.h>
1da177e4
LT
13#include <linux/rtnetlink.h>
14#include <linux/rcupdate.h>
15#include <linux/jiffies.h>
16#include <net/neighbour.h>
17#include <asm/processor.h>
18
19/*
20 * 0 - no debugging messages
21 * 1 - rare events and bugs (default)
22 * 2 - trace mode.
23 */
24#define RT_CACHE_DEBUG 0
25
26#define DST_GC_MIN (HZ/10)
27#define DST_GC_INC (HZ/2)
28#define DST_GC_MAX (120*HZ)
29
30/* Each dst_entry has reference count and sits in some parent list(s).
31 * When it is removed from parent list, it is "freed" (dst_free).
32 * After this it enters dead state (dst->obsolete > 0) and if its refcnt
33 * is zero, it can be destroyed immediately, otherwise it is added
34 * to gc list and garbage collector periodically checks the refcnt.
35 */
36
37struct sk_buff;
38
fd2c3ef7 39struct dst_entry {
1e19e02c 40 struct rcu_head rcu_head;
1da177e4
LT
41 struct dst_entry *child;
42 struct net_device *dev;
c4d54110
HX
43 short error;
44 short obsolete;
1da177e4
LT
45 int flags;
46#define DST_HOST 1
47#define DST_NOXFRM 2
48#define DST_NOPOLICY 4
49#define DST_NOHASH 8
1da177e4
LT
50 unsigned long expires;
51
52 unsigned short header_len; /* more space at head required */
53 unsigned short trailer_len; /* space to reserve at tail */
54
69a73829 55 unsigned int rate_tokens;
f1dd9c37 56 unsigned long rate_last; /* rate limiting for ICMP */
69a73829 57
f1dd9c37 58 struct dst_entry *path;
1da177e4 59
1da177e4
LT
60 struct neighbour *neighbour;
61 struct hh_cache *hh;
def8b4fa 62#ifdef CONFIG_XFRM
1da177e4 63 struct xfrm_state *xfrm;
5635c10d
ED
64#else
65 void *__pad1;
def8b4fa 66#endif
1da177e4
LT
67 int (*input)(struct sk_buff*);
68 int (*output)(struct sk_buff*);
69
1da177e4 70 struct dst_ops *ops;
f1dd9c37
ZY
71
72 u32 metrics[RTAX_MAX];
73
74#ifdef CONFIG_NET_CLS_ROUTE
75 __u32 tclassid;
5635c10d
ED
76#else
77 __u32 __pad2;
f1dd9c37
ZY
78#endif
79
5635c10d
ED
80
81 /*
82 * Align __refcnt to a 64 bytes alignment
83 * (L1_CACHE_SIZE would be too much)
84 */
85#ifdef CONFIG_64BIT
5635c10d
ED
86 long __pad_to_align_refcnt[1];
87#endif
f1dd9c37
ZY
88 /*
89 * __refcnt wants to be on a different cache line from
90 * input/output/ops or performance tanks badly
91 */
1e19e02c
ED
92 atomic_t __refcnt; /* client references */
93 int __use;
f1dd9c37 94 unsigned long lastuse;
1e19e02c
ED
95 union {
96 struct dst_entry *next;
97 struct rtable *rt_next;
98 struct rt6_info *rt6_next;
99 struct dn_route *dn_next;
100 };
1da177e4
LT
101};
102
1da177e4
LT
103#ifdef __KERNEL__
104
105static inline u32
106dst_metric(const struct dst_entry *dst, int metric)
107{
108 return dst->metrics[metric-1];
109}
110
0c3adfb8
GBY
111static inline u32
112dst_feature(const struct dst_entry *dst, u32 feature)
113{
bb5b7c11 114 return dst_metric(dst, RTAX_FEATURES) & feature;
0c3adfb8
GBY
115}
116
1da177e4
LT
117static inline u32 dst_mtu(const struct dst_entry *dst)
118{
119 u32 mtu = dst_metric(dst, RTAX_MTU);
120 /*
121 * Alexey put it here, so ask him about it :)
122 */
123 barrier();
124 return mtu;
125}
126
c1e20f7c
SH
127/* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
128static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
129{
130 return msecs_to_jiffies(dst_metric(dst, metric));
131}
132
133static inline void set_dst_metric_rtt(struct dst_entry *dst, int metric,
134 unsigned long rtt)
135{
136 dst->metrics[metric-1] = jiffies_to_msecs(rtt);
137}
138
1da177e4
LT
139static inline u32
140dst_allfrag(const struct dst_entry *dst)
141{
0c3adfb8 142 int ret = dst_feature(dst, RTAX_FEATURE_ALLFRAG);
1da177e4
LT
143 /* Yes, _exactly_. This is paranoia. */
144 barrier();
145 return ret;
146}
147
148static inline int
149dst_metric_locked(struct dst_entry *dst, int metric)
150{
151 return dst_metric(dst, RTAX_LOCK) & (1<<metric);
152}
153
154static inline void dst_hold(struct dst_entry * dst)
155{
5635c10d
ED
156 /*
157 * If your kernel compilation stops here, please check
158 * __pad_to_align_refcnt declaration in struct dst_entry
159 */
160 BUILD_BUG_ON(offsetof(struct dst_entry, __refcnt) & 63);
1da177e4
LT
161 atomic_inc(&dst->__refcnt);
162}
163
03f49f34
PE
164static inline void dst_use(struct dst_entry *dst, unsigned long time)
165{
166 dst_hold(dst);
167 dst->__use++;
168 dst->lastuse = time;
169}
170
1da177e4
LT
171static inline
172struct dst_entry * dst_clone(struct dst_entry * dst)
173{
174 if (dst)
175 atomic_inc(&dst->__refcnt);
176 return dst;
177}
178
8d330868 179extern void dst_release(struct dst_entry *dst);
adf30907
ED
180static inline void skb_dst_drop(struct sk_buff *skb)
181{
182 if (skb->_skb_dst)
183 dst_release(skb_dst(skb));
184 skb->_skb_dst = 0UL;
185}
1da177e4
LT
186
187/* Children define the path of the packet through the
188 * Linux networking. Thus, destinations are stackable.
189 */
190
191static inline struct dst_entry *dst_pop(struct dst_entry *dst)
192{
193 struct dst_entry *child = dst_clone(dst->child);
194
195 dst_release(dst);
196 return child;
197}
198
352e512c 199extern int dst_discard(struct sk_buff *skb);
1da177e4
LT
200extern void * dst_alloc(struct dst_ops * ops);
201extern void __dst_free(struct dst_entry * dst);
202extern struct dst_entry *dst_destroy(struct dst_entry * dst);
203
204static inline void dst_free(struct dst_entry * dst)
205{
206 if (dst->obsolete > 1)
207 return;
208 if (!atomic_read(&dst->__refcnt)) {
209 dst = dst_destroy(dst);
210 if (!dst)
211 return;
212 }
213 __dst_free(dst);
214}
215
216static inline void dst_rcu_free(struct rcu_head *head)
217{
218 struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
219 dst_free(dst);
220}
221
222static inline void dst_confirm(struct dst_entry *dst)
223{
224 if (dst)
225 neigh_confirm(dst->neighbour);
226}
227
1da177e4
LT
228static inline void dst_link_failure(struct sk_buff *skb)
229{
adf30907 230 struct dst_entry *dst = skb_dst(skb);
1da177e4
LT
231 if (dst && dst->ops && dst->ops->link_failure)
232 dst->ops->link_failure(skb);
233}
234
235static inline void dst_set_expires(struct dst_entry *dst, int timeout)
236{
237 unsigned long expires = jiffies + timeout;
238
239 if (expires == 0)
240 expires = 1;
241
242 if (dst->expires == 0 || time_before(expires, dst->expires))
243 dst->expires = expires;
244}
245
246/* Output packet to network from transport. */
247static inline int dst_output(struct sk_buff *skb)
248{
adf30907 249 return skb_dst(skb)->output(skb);
1da177e4
LT
250}
251
252/* Input packet from network to transport. */
253static inline int dst_input(struct sk_buff *skb)
254{
adf30907 255 return skb_dst(skb)->input(skb);
1da177e4
LT
256}
257
258static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
259{
260 if (dst->obsolete)
261 dst = dst->ops->check(dst, cookie);
262 return dst;
263}
264
265extern void dst_init(void);
266
815f4e57
HX
267/* Flags for xfrm_lookup flags argument. */
268enum {
269 XFRM_LOOKUP_WAIT = 1 << 0,
8b7817f3 270 XFRM_LOOKUP_ICMP = 1 << 1,
815f4e57
HX
271};
272
1da177e4
LT
273struct flowi;
274#ifndef CONFIG_XFRM
52479b62
AD
275static inline int xfrm_lookup(struct net *net, struct dst_entry **dst_p,
276 struct flowi *fl, struct sock *sk, int flags)
1da177e4
LT
277{
278 return 0;
279}
52479b62
AD
280static inline int __xfrm_lookup(struct net *net, struct dst_entry **dst_p,
281 struct flowi *fl, struct sock *sk, int flags)
14e50e57
DM
282{
283 return 0;
284}
1da177e4 285#else
52479b62
AD
286extern int xfrm_lookup(struct net *net, struct dst_entry **dst_p,
287 struct flowi *fl, struct sock *sk, int flags);
288extern int __xfrm_lookup(struct net *net, struct dst_entry **dst_p,
289 struct flowi *fl, struct sock *sk, int flags);
1da177e4
LT
290#endif
291#endif
292
293#endif /* _NET_DST_H */