~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

TOMOYO Linux Cross Reference
Linux/net/core/dst.c

Version: ~ [ linux-5.16 ] ~ [ linux-5.15.13 ] ~ [ linux-5.14.21 ] ~ [ linux-5.13.19 ] ~ [ linux-5.12.19 ] ~ [ linux-5.11.22 ] ~ [ linux-5.10.90 ] ~ [ linux-5.9.16 ] ~ [ linux-5.8.18 ] ~ [ linux-5.7.19 ] ~ [ linux-5.6.19 ] ~ [ linux-5.5.19 ] ~ [ linux-5.4.170 ] ~ [ linux-5.3.18 ] ~ [ linux-5.2.21 ] ~ [ linux-5.1.21 ] ~ [ linux-5.0.21 ] ~ [ linux-4.20.17 ] ~ [ linux-4.19.224 ] ~ [ linux-4.18.20 ] ~ [ linux-4.17.19 ] ~ [ linux-4.16.18 ] ~ [ linux-4.15.18 ] ~ [ linux-4.14.261 ] ~ [ linux-4.13.16 ] ~ [ linux-4.12.14 ] ~ [ linux-4.11.12 ] ~ [ linux-4.10.17 ] ~ [ linux-4.9.296 ] ~ [ linux-4.8.17 ] ~ [ linux-4.7.10 ] ~ [ linux-4.6.7 ] ~ [ linux-4.5.7 ] ~ [ linux-4.4.298 ] ~ [ linux-4.3.6 ] ~ [ linux-4.2.8 ] ~ [ linux-4.1.52 ] ~ [ linux-4.0.9 ] ~ [ linux-3.18.140 ] ~ [ linux-3.16.85 ] ~ [ linux-3.14.79 ] ~ [ linux-3.12.74 ] ~ [ linux-3.10.108 ] ~ [ linux-2.6.32.71 ] ~ [ linux-2.6.0 ] ~ [ linux-2.4.37.11 ] ~ [ unix-v6-master ] ~ [ ccs-tools-1.8.5 ] ~ [ policy-sample ] ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  1 /*
  2  * net/core/dst.c       Protocol independent destination cache.
  3  *
  4  * Authors:             Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  5  *
  6  */
  7 
  8 #include <linux/bitops.h>
  9 #include <linux/errno.h>
 10 #include <linux/init.h>
 11 #include <linux/kernel.h>
 12 #include <linux/workqueue.h>
 13 #include <linux/mm.h>
 14 #include <linux/module.h>
 15 #include <linux/slab.h>
 16 #include <linux/netdevice.h>
 17 #include <linux/skbuff.h>
 18 #include <linux/string.h>
 19 #include <linux/types.h>
 20 #include <net/net_namespace.h>
 21 #include <linux/sched.h>
 22 #include <linux/prefetch.h>
 23 
 24 #include <net/dst.h>
 25 
 26 /*
 27  * Theory of operations:
 28  * 1) We use a list, protected by a spinlock, to add
 29  *    new entries from both BH and non-BH context.
 30  * 2) In order to keep spinlock held for a small delay,
 31  *    we use a second list where are stored long lived
 32  *    entries, that are handled by the garbage collect thread
 33  *    fired by a workqueue.
 34  * 3) This list is guarded by a mutex,
 35  *    so that the gc_task and dst_dev_event() can be synchronized.
 36  */
 37 
 38 /*
 39  * We want to keep lock & list close together
 40  * to dirty as few cache lines as possible in __dst_free().
 41  * As this is not a very strong hint, we dont force an alignment on SMP.
 42  */
 43 static struct {
 44         spinlock_t              lock;
 45         struct dst_entry        *list;
 46         unsigned long           timer_inc;
 47         unsigned long           timer_expires;
 48 } dst_garbage = {
 49         .lock = __SPIN_LOCK_UNLOCKED(dst_garbage.lock),
 50         .timer_inc = DST_GC_MAX,
 51 };
 52 static void dst_gc_task(struct work_struct *work);
 53 static void ___dst_free(struct dst_entry *dst);
 54 
 55 static DECLARE_DELAYED_WORK(dst_gc_work, dst_gc_task);
 56 
 57 static DEFINE_MUTEX(dst_gc_mutex);
 58 /*
 59  * long lived entries are maintained in this list, guarded by dst_gc_mutex
 60  */
 61 static struct dst_entry         *dst_busy_list;
 62 
 63 static void dst_gc_task(struct work_struct *work)
 64 {
 65         int    delayed = 0;
 66         int    work_performed = 0;
 67         unsigned long expires = ~0L;
 68         struct dst_entry *dst, *next, head;
 69         struct dst_entry *last = &head;
 70 
 71         mutex_lock(&dst_gc_mutex);
 72         next = dst_busy_list;
 73 
 74 loop:
 75         while ((dst = next) != NULL) {
 76                 next = dst->next;
 77                 prefetch(&next->next);
 78                 cond_resched();
 79                 if (likely(atomic_read(&dst->__refcnt))) {
 80                         last->next = dst;
 81                         last = dst;
 82                         delayed++;
 83                         continue;
 84                 }
 85                 work_performed++;
 86 
 87                 dst = dst_destroy(dst);
 88                 if (dst) {
 89                         /* NOHASH and still referenced. Unless it is already
 90                          * on gc list, invalidate it and add to gc list.
 91                          *
 92                          * Note: this is temporary. Actually, NOHASH dst's
 93                          * must be obsoleted when parent is obsoleted.
 94                          * But we do not have state "obsoleted, but
 95                          * referenced by parent", so it is right.
 96                          */
 97                         if (dst->obsolete > 0)
 98                                 continue;
 99 
100                         ___dst_free(dst);
101                         dst->next = next;
102                         next = dst;
103                 }
104         }
105 
106         spin_lock_bh(&dst_garbage.lock);
107         next = dst_garbage.list;
108         if (next) {
109                 dst_garbage.list = NULL;
110                 spin_unlock_bh(&dst_garbage.lock);
111                 goto loop;
112         }
113         last->next = NULL;
114         dst_busy_list = head.next;
115         if (!dst_busy_list)
116                 dst_garbage.timer_inc = DST_GC_MAX;
117         else {
118                 /*
119                  * if we freed less than 1/10 of delayed entries,
120                  * we can sleep longer.
121                  */
122                 if (work_performed <= delayed/10) {
123                         dst_garbage.timer_expires += dst_garbage.timer_inc;
124                         if (dst_garbage.timer_expires > DST_GC_MAX)
125                                 dst_garbage.timer_expires = DST_GC_MAX;
126                         dst_garbage.timer_inc += DST_GC_INC;
127                 } else {
128                         dst_garbage.timer_inc = DST_GC_INC;
129                         dst_garbage.timer_expires = DST_GC_MIN;
130                 }
131                 expires = dst_garbage.timer_expires;
132                 /*
133                  * if the next desired timer is more than 4 seconds in the
134                  * future then round the timer to whole seconds
135                  */
136                 if (expires > 4*HZ)
137                         expires = round_jiffies_relative(expires);
138                 schedule_delayed_work(&dst_gc_work, expires);
139         }
140 
141         spin_unlock_bh(&dst_garbage.lock);
142         mutex_unlock(&dst_gc_mutex);
143 }
144 
145 int dst_discard(struct sk_buff *skb)
146 {
147         kfree_skb(skb);
148         return 0;
149 }
150 EXPORT_SYMBOL(dst_discard);
151 
152 const u32 dst_default_metrics[RTAX_MAX + 1] = {
153         /* This initializer is needed to force linker to place this variable
154          * into const section. Otherwise it might end into bss section.
155          * We really want to avoid false sharing on this variable, and catch
156          * any writes on it.
157          */
158         [RTAX_MAX] = 0xdeadbeef,
159 };
160 
161 
162 void *dst_alloc(struct dst_ops *ops, struct net_device *dev,
163                 int initial_ref, int initial_obsolete, unsigned short flags)
164 {
165         struct dst_entry *dst;
166 
167         if (ops->gc && dst_entries_get_fast(ops) > ops->gc_thresh) {
168                 if (ops->gc(ops))
169                         return NULL;
170         }
171         dst = kmem_cache_alloc(ops->kmem_cachep, GFP_ATOMIC);
172         if (!dst)
173                 return NULL;
174         dst->child = NULL;
175         dst->dev = dev;
176         if (dev)
177                 dev_hold(dev);
178         dst->ops = ops;
179         dst_init_metrics(dst, dst_default_metrics, true);
180         dst->expires = 0UL;
181         dst->path = dst;
182         dst->from = NULL;
183 #ifdef CONFIG_XFRM
184         dst->xfrm = NULL;
185 #endif
186         dst->input = dst_discard;
187         dst->output = dst_discard;
188         dst->error = 0;
189         dst->obsolete = initial_obsolete;
190         dst->header_len = 0;
191         dst->trailer_len = 0;
192 #ifdef CONFIG_IP_ROUTE_CLASSID
193         dst->tclassid = 0;
194 #endif
195         atomic_set(&dst->__refcnt, initial_ref);
196         dst->__use = 0;
197         dst->lastuse = jiffies;
198         dst->flags = flags;
199         dst->pending_confirm = 0;
200         dst->next = NULL;
201         if (!(flags & DST_NOCOUNT))
202                 dst_entries_add(ops, 1);
203         return dst;
204 }
205 EXPORT_SYMBOL(dst_alloc);
206 
207 static void ___dst_free(struct dst_entry *dst)
208 {
209         /* The first case (dev==NULL) is required, when
210            protocol module is unloaded.
211          */
212         if (dst->dev == NULL || !(dst->dev->flags&IFF_UP))
213                 dst->input = dst->output = dst_discard;
214         dst->obsolete = DST_OBSOLETE_DEAD;
215 }
216 
217 void __dst_free(struct dst_entry *dst)
218 {
219         spin_lock_bh(&dst_garbage.lock);
220         ___dst_free(dst);
221         dst->next = dst_garbage.list;
222         dst_garbage.list = dst;
223         if (dst_garbage.timer_inc > DST_GC_INC) {
224                 dst_garbage.timer_inc = DST_GC_INC;
225                 dst_garbage.timer_expires = DST_GC_MIN;
226                 mod_delayed_work(system_wq, &dst_gc_work,
227                                  dst_garbage.timer_expires);
228         }
229         spin_unlock_bh(&dst_garbage.lock);
230 }
231 EXPORT_SYMBOL(__dst_free);
232 
233 struct dst_entry *dst_destroy(struct dst_entry * dst)
234 {
235         struct dst_entry *child;
236 
237         smp_rmb();
238 
239 again:
240         child = dst->child;
241 
242         if (!(dst->flags & DST_NOCOUNT))
243                 dst_entries_add(dst->ops, -1);
244 
245         if (dst->ops->destroy)
246                 dst->ops->destroy(dst);
247         if (dst->dev)
248                 dev_put(dst->dev);
249         kmem_cache_free(dst->ops->kmem_cachep, dst);
250 
251         dst = child;
252         if (dst) {
253                 int nohash = dst->flags & DST_NOHASH;
254 
255                 if (atomic_dec_and_test(&dst->__refcnt)) {
256                         /* We were real parent of this dst, so kill child. */
257                         if (nohash)
258                                 goto again;
259                 } else {
260                         /* Child is still referenced, return it for freeing. */
261                         if (nohash)
262                                 return dst;
263                         /* Child is still in his hash table */
264                 }
265         }
266         return NULL;
267 }
268 EXPORT_SYMBOL(dst_destroy);
269 
270 static void dst_destroy_rcu(struct rcu_head *head)
271 {
272         struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
273 
274         dst = dst_destroy(dst);
275         if (dst)
276                 __dst_free(dst);
277 }
278 
279 void dst_release(struct dst_entry *dst)
280 {
281         if (dst) {
282                 int newrefcnt;
283                 unsigned short nocache = dst->flags & DST_NOCACHE;
284 
285                 newrefcnt = atomic_dec_return(&dst->__refcnt);
286                 WARN_ON(newrefcnt < 0);
287                 if (!newrefcnt && unlikely(nocache))
288                         call_rcu(&dst->rcu_head, dst_destroy_rcu);
289         }
290 }
291 EXPORT_SYMBOL(dst_release);
292 
293 u32 *dst_cow_metrics_generic(struct dst_entry *dst, unsigned long old)
294 {
295         u32 *p = kmalloc(sizeof(u32) * RTAX_MAX, GFP_ATOMIC);
296 
297         if (p) {
298                 u32 *old_p = __DST_METRICS_PTR(old);
299                 unsigned long prev, new;
300 
301                 memcpy(p, old_p, sizeof(u32) * RTAX_MAX);
302 
303                 new = (unsigned long) p;
304                 prev = cmpxchg(&dst->_metrics, old, new);
305 
306                 if (prev != old) {
307                         kfree(p);
308                         p = __DST_METRICS_PTR(prev);
309                         if (prev & DST_METRICS_READ_ONLY)
310                                 p = NULL;
311                 }
312         }
313         return p;
314 }
315 EXPORT_SYMBOL(dst_cow_metrics_generic);
316 
317 /* Caller asserts that dst_metrics_read_only(dst) is false.  */
318 void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old)
319 {
320         unsigned long prev, new;
321 
322         new = ((unsigned long) dst_default_metrics) | DST_METRICS_READ_ONLY;
323         prev = cmpxchg(&dst->_metrics, old, new);
324         if (prev == old)
325                 kfree(__DST_METRICS_PTR(old));
326 }
327 EXPORT_SYMBOL(__dst_destroy_metrics_generic);
328 
329 /**
330  * __skb_dst_set_noref - sets skb dst, without a reference
331  * @skb: buffer
332  * @dst: dst entry
333  * @force: if force is set, use noref version even for DST_NOCACHE entries
334  *
335  * Sets skb dst, assuming a reference was not taken on dst
336  * skb_dst_drop() should not dst_release() this dst
337  */
338 void __skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst, bool force)
339 {
340         WARN_ON(!rcu_read_lock_held() && !rcu_read_lock_bh_held());
341         /* If dst not in cache, we must take a reference, because
342          * dst_release() will destroy dst as soon as its refcount becomes zero
343          */
344         if (unlikely((dst->flags & DST_NOCACHE) && !force)) {
345                 dst_hold(dst);
346                 skb_dst_set(skb, dst);
347         } else {
348                 skb->_skb_refdst = (unsigned long)dst | SKB_DST_NOREF;
349         }
350 }
351 EXPORT_SYMBOL(__skb_dst_set_noref);
352 
353 /* Dirty hack. We did it in 2.2 (in __dst_free),
354  * we have _very_ good reasons not to repeat
355  * this mistake in 2.3, but we have no choice
356  * now. _It_ _is_ _explicit_ _deliberate_
357  * _race_ _condition_.
358  *
359  * Commented and originally written by Alexey.
360  */
361 static void dst_ifdown(struct dst_entry *dst, struct net_device *dev,
362                        int unregister)
363 {
364         if (dst->ops->ifdown)
365                 dst->ops->ifdown(dst, dev, unregister);
366 
367         if (dev != dst->dev)
368                 return;
369 
370         if (!unregister) {
371                 dst->input = dst->output = dst_discard;
372         } else {
373                 dst->dev = dev_net(dst->dev)->loopback_dev;
374                 dev_hold(dst->dev);
375                 dev_put(dev);
376         }
377 }
378 
379 static int dst_dev_event(struct notifier_block *this, unsigned long event,
380                          void *ptr)
381 {
382         struct net_device *dev = netdev_notifier_info_to_dev(ptr);
383         struct dst_entry *dst, *last = NULL;
384 
385         switch (event) {
386         case NETDEV_UNREGISTER_FINAL:
387         case NETDEV_DOWN:
388                 mutex_lock(&dst_gc_mutex);
389                 for (dst = dst_busy_list; dst; dst = dst->next) {
390                         last = dst;
391                         dst_ifdown(dst, dev, event != NETDEV_DOWN);
392                 }
393 
394                 spin_lock_bh(&dst_garbage.lock);
395                 dst = dst_garbage.list;
396                 dst_garbage.list = NULL;
397                 spin_unlock_bh(&dst_garbage.lock);
398 
399                 if (last)
400                         last->next = dst;
401                 else
402                         dst_busy_list = dst;
403                 for (; dst; dst = dst->next)
404                         dst_ifdown(dst, dev, event != NETDEV_DOWN);
405                 mutex_unlock(&dst_gc_mutex);
406                 break;
407         }
408         return NOTIFY_DONE;
409 }
410 
411 static struct notifier_block dst_dev_notifier = {
412         .notifier_call  = dst_dev_event,
413         .priority = -10, /* must be called after other network notifiers */
414 };
415 
416 void __init dst_init(void)
417 {
418         register_netdevice_notifier(&dst_dev_notifier);
419 }
420 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

kernel.org | git.kernel.org | LWN.net | Project Home | Wiki (Japanese) | Wiki (English) | SVN repository | Mail admin

Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.

osdn.jp