blob: f96c4ba4dd328d59fdd1cc7be70fac7b85931f73 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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
Arnaldo Carvalho de Melo14c85022005-12-27 02:43:12 -020011#include <linux/netdevice.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070012#include <linux/rtnetlink.h>
13#include <linux/rcupdate.h>
14#include <linux/jiffies.h>
15#include <net/neighbour.h>
16#include <asm/processor.h>
17
18/*
19 * 0 - no debugging messages
20 * 1 - rare events and bugs (default)
21 * 2 - trace mode.
22 */
23#define RT_CACHE_DEBUG 0
24
25#define DST_GC_MIN (HZ/10)
26#define DST_GC_INC (HZ/2)
27#define DST_GC_MAX (120*HZ)
28
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.
34 */
35
36struct sk_buff;
37
38struct dst_entry
39{
Eric Dumazet1e19e022007-02-09 16:26:55 -080040 struct rcu_head rcu_head;
Linus Torvalds1da177e2005-04-16 15:20:36 -070041 struct dst_entry *child;
42 struct net_device *dev;
Herbert Xuc4d54112005-04-19 20:46:37 -070043 short error;
44 short obsolete;
Linus Torvalds1da177e2005-04-16 15:20:36 -070045 int flags;
46#define DST_HOST 1
47#define DST_NOXFRM 2
48#define DST_NOPOLICY 4
49#define DST_NOHASH 8
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 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
Eric Dumazet69a73822008-01-22 06:18:34 -080055 unsigned int rate_tokens;
Zhang Yanminf1dd9c32008-03-12 22:52:37 -070056 unsigned long rate_last; /* rate limiting for ICMP */
Eric Dumazet69a73822008-01-22 06:18:34 -080057
Zhang Yanminf1dd9c32008-03-12 22:52:37 -070058 struct dst_entry *path;
Linus Torvalds1da177e2005-04-16 15:20:36 -070059
Linus Torvalds1da177e2005-04-16 15:20:36 -070060 struct neighbour *neighbour;
61 struct hh_cache *hh;
Alexey Dobriyandef8b4f2008-10-28 13:24:06 -070062#ifdef CONFIG_XFRM
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 struct xfrm_state *xfrm;
Alexey Dobriyandef8b4f2008-10-28 13:24:06 -070064#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070065 int (*input)(struct sk_buff*);
66 int (*output)(struct sk_buff*);
67
Linus Torvalds1da177e2005-04-16 15:20:36 -070068 struct dst_ops *ops;
Zhang Yanminf1dd9c32008-03-12 22:52:37 -070069
70 u32 metrics[RTAX_MAX];
71
72#ifdef CONFIG_NET_CLS_ROUTE
73 __u32 tclassid;
74#endif
75
76 /*
77 * __refcnt wants to be on a different cache line from
78 * input/output/ops or performance tanks badly
79 */
Eric Dumazet1e19e022007-02-09 16:26:55 -080080 atomic_t __refcnt; /* client references */
81 int __use;
Zhang Yanminf1dd9c32008-03-12 22:52:37 -070082 unsigned long lastuse;
Eric Dumazet1e19e022007-02-09 16:26:55 -080083 union {
84 struct dst_entry *next;
85 struct rtable *rt_next;
86 struct rt6_info *rt6_next;
87 struct dn_route *dn_next;
88 };
Linus Torvalds1da177e2005-04-16 15:20:36 -070089};
90
91
92struct dst_ops
93{
94 unsigned short family;
Al Virod77072e2006-09-28 14:20:34 -070095 __be16 protocol;
Linus Torvalds1da177e2005-04-16 15:20:36 -070096 unsigned gc_thresh;
97
Daniel Lezcano569d3642008-01-18 03:56:57 -080098 int (*gc)(struct dst_ops *ops);
Linus Torvalds1da177e2005-04-16 15:20:36 -070099 struct dst_entry * (*check)(struct dst_entry *, __u32 cookie);
100 void (*destroy)(struct dst_entry *);
101 void (*ifdown)(struct dst_entry *,
102 struct net_device *dev, int how);
103 struct dst_entry * (*negative_advice)(struct dst_entry *);
104 void (*link_failure)(struct sk_buff *);
105 void (*update_pmtu)(struct dst_entry *dst, u32 mtu);
Herbert Xu862b82c2007-11-13 21:43:11 -0800106 int (*local_out)(struct sk_buff *skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107 int entry_size;
108
109 atomic_t entries;
Christoph Lametere18b8902006-12-06 20:33:20 -0800110 struct kmem_cache *kmem_cachep;
Daniel Lezcanod4fa26f2008-01-18 03:58:07 -0800111 struct net *dst_net;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112};
113
114#ifdef __KERNEL__
115
116static inline u32
117dst_metric(const struct dst_entry *dst, int metric)
118{
119 return dst->metrics[metric-1];
120}
121
122static inline u32 dst_mtu(const struct dst_entry *dst)
123{
124 u32 mtu = dst_metric(dst, RTAX_MTU);
125 /*
126 * Alexey put it here, so ask him about it :)
127 */
128 barrier();
129 return mtu;
130}
131
Stephen Hemmingerc1e20f72008-07-18 23:02:15 -0700132/* RTT metrics are stored in milliseconds for user ABI, but used as jiffies */
133static inline unsigned long dst_metric_rtt(const struct dst_entry *dst, int metric)
134{
135 return msecs_to_jiffies(dst_metric(dst, metric));
136}
137
138static inline void set_dst_metric_rtt(struct dst_entry *dst, int metric,
139 unsigned long rtt)
140{
141 dst->metrics[metric-1] = jiffies_to_msecs(rtt);
142}
143
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144static inline u32
145dst_allfrag(const struct dst_entry *dst)
146{
147 int ret = dst_metric(dst, RTAX_FEATURES) & RTAX_FEATURE_ALLFRAG;
148 /* Yes, _exactly_. This is paranoia. */
149 barrier();
150 return ret;
151}
152
153static inline int
154dst_metric_locked(struct dst_entry *dst, int metric)
155{
156 return dst_metric(dst, RTAX_LOCK) & (1<<metric);
157}
158
159static inline void dst_hold(struct dst_entry * dst)
160{
161 atomic_inc(&dst->__refcnt);
162}
163
Pavel Emelyanov03f49f32007-11-10 21:28:34 -0800164static 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
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171static inline
172struct dst_entry * dst_clone(struct dst_entry * dst)
173{
174 if (dst)
175 atomic_inc(&dst->__refcnt);
176 return dst;
177}
178
Ilpo Järvinen8d330862008-03-27 17:53:31 -0700179extern void dst_release(struct dst_entry *dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180
181/* Children define the path of the packet through the
182 * Linux networking. Thus, destinations are stackable.
183 */
184
185static inline struct dst_entry *dst_pop(struct dst_entry *dst)
186{
187 struct dst_entry *child = dst_clone(dst->child);
188
189 dst_release(dst);
190 return child;
191}
192
Herbert Xu352e5122007-11-13 21:34:06 -0800193extern int dst_discard(struct sk_buff *skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194extern void * dst_alloc(struct dst_ops * ops);
195extern void __dst_free(struct dst_entry * dst);
196extern struct dst_entry *dst_destroy(struct dst_entry * dst);
197
198static inline void dst_free(struct dst_entry * dst)
199{
200 if (dst->obsolete > 1)
201 return;
202 if (!atomic_read(&dst->__refcnt)) {
203 dst = dst_destroy(dst);
204 if (!dst)
205 return;
206 }
207 __dst_free(dst);
208}
209
210static inline void dst_rcu_free(struct rcu_head *head)
211{
212 struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
213 dst_free(dst);
214}
215
216static inline void dst_confirm(struct dst_entry *dst)
217{
218 if (dst)
219 neigh_confirm(dst->neighbour);
220}
221
222static inline void dst_negative_advice(struct dst_entry **dst_p)
223{
224 struct dst_entry * dst = *dst_p;
225 if (dst && dst->ops->negative_advice)
226 *dst_p = dst->ops->negative_advice(dst);
227}
228
229static inline void dst_link_failure(struct sk_buff *skb)
230{
231 struct dst_entry * dst = skb->dst;
232 if (dst && dst->ops && dst->ops->link_failure)
233 dst->ops->link_failure(skb);
234}
235
236static inline void dst_set_expires(struct dst_entry *dst, int timeout)
237{
238 unsigned long expires = jiffies + timeout;
239
240 if (expires == 0)
241 expires = 1;
242
243 if (dst->expires == 0 || time_before(expires, dst->expires))
244 dst->expires = expires;
245}
246
247/* Output packet to network from transport. */
248static inline int dst_output(struct sk_buff *skb)
249{
Patrick McHardy16a66772006-01-06 23:01:48 -0800250 return skb->dst->output(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251}
252
253/* Input packet from network to transport. */
254static inline int dst_input(struct sk_buff *skb)
255{
David S. Millercc6533e2008-08-04 23:04:08 -0700256 return skb->dst->input(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257}
258
259static inline struct dst_entry *dst_check(struct dst_entry *dst, u32 cookie)
260{
261 if (dst->obsolete)
262 dst = dst->ops->check(dst, cookie);
263 return dst;
264}
265
266extern void dst_init(void);
267
Herbert Xu815f4e52007-12-12 10:36:59 -0800268/* Flags for xfrm_lookup flags argument. */
269enum {
270 XFRM_LOOKUP_WAIT = 1 << 0,
Herbert Xu8b7817f2007-12-12 10:44:43 -0800271 XFRM_LOOKUP_ICMP = 1 << 1,
Herbert Xu815f4e52007-12-12 10:36:59 -0800272};
273
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274struct flowi;
275#ifndef CONFIG_XFRM
276static inline int xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
277 struct sock *sk, int flags)
278{
279 return 0;
280}
David S. Miller14e50e52007-05-24 18:17:54 -0700281static inline int __xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
282 struct sock *sk, int flags)
283{
284 return 0;
285}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286#else
287extern int xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
288 struct sock *sk, int flags);
David S. Miller14e50e52007-05-24 18:17:54 -0700289extern int __xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
290 struct sock *sk, int flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291#endif
292#endif
293
294#endif /* _NET_DST_H */