6 * Kazunori MIYAZAWA @USAGI
7 * Kunihiro Ishiguro <kunihiro@ipinfusion.com>
9 * Kazunori MIYAZAWA @USAGI
11 * Split up af-specific portion
12 * Derek Atkins <derek@ihtfp.com> Add the post_input processor
16 #include <linux/err.h>
17 #include <linux/slab.h>
18 #include <linux/kmod.h>
19 #include <linux/list.h>
20 #include <linux/spinlock.h>
21 #include <linux/workqueue.h>
22 #include <linux/notifier.h>
23 #include <linux/netdevice.h>
24 #include <linux/netfilter.h>
25 #include <linux/module.h>
26 #include <linux/cache.h>
27 #include <linux/cpu.h>
28 #include <linux/audit.h>
33 #ifdef CONFIG_XFRM_STATISTICS
37 #include "xfrm_hash.h"
39 #define XFRM_QUEUE_TMO_MIN ((unsigned)(HZ/10))
40 #define XFRM_QUEUE_TMO_MAX ((unsigned)(60*HZ))
41 #define XFRM_MAX_QUEUE_LEN 100
44 struct dst_entry *dst_orig;
48 static DEFINE_PER_CPU(struct xfrm_dst *, xfrm_last_dst);
49 static struct work_struct *xfrm_pcpu_work __read_mostly;
50 static DEFINE_SPINLOCK(xfrm_policy_afinfo_lock);
51 static struct xfrm_policy_afinfo const __rcu *xfrm_policy_afinfo[AF_INET6 + 1]
54 static struct kmem_cache *xfrm_dst_cache __read_mostly;
55 static __read_mostly seqcount_t xfrm_policy_hash_generation;
57 static void xfrm_init_pmtu(struct xfrm_dst **bundle, int nr);
58 static int stale_bundle(struct dst_entry *dst);
59 static int xfrm_bundle_ok(struct xfrm_dst *xdst);
60 static void xfrm_policy_queue_process(struct timer_list *t);
62 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir);
63 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
66 static inline bool xfrm_pol_hold_rcu(struct xfrm_policy *policy)
68 return refcount_inc_not_zero(&policy->refcnt);
72 __xfrm4_selector_match(const struct xfrm_selector *sel, const struct flowi *fl)
74 const struct flowi4 *fl4 = &fl->u.ip4;
76 return addr4_match(fl4->daddr, sel->daddr.a4, sel->prefixlen_d) &&
77 addr4_match(fl4->saddr, sel->saddr.a4, sel->prefixlen_s) &&
78 !((xfrm_flowi_dport(fl, &fl4->uli) ^ sel->dport) & sel->dport_mask) &&
79 !((xfrm_flowi_sport(fl, &fl4->uli) ^ sel->sport) & sel->sport_mask) &&
80 (fl4->flowi4_proto == sel->proto || !sel->proto) &&
81 (fl4->flowi4_oif == sel->ifindex || !sel->ifindex);
85 __xfrm6_selector_match(const struct xfrm_selector *sel, const struct flowi *fl)
87 const struct flowi6 *fl6 = &fl->u.ip6;
89 return addr_match(&fl6->daddr, &sel->daddr, sel->prefixlen_d) &&
90 addr_match(&fl6->saddr, &sel->saddr, sel->prefixlen_s) &&
91 !((xfrm_flowi_dport(fl, &fl6->uli) ^ sel->dport) & sel->dport_mask) &&
92 !((xfrm_flowi_sport(fl, &fl6->uli) ^ sel->sport) & sel->sport_mask) &&
93 (fl6->flowi6_proto == sel->proto || !sel->proto) &&
94 (fl6->flowi6_oif == sel->ifindex || !sel->ifindex);
97 bool xfrm_selector_match(const struct xfrm_selector *sel, const struct flowi *fl,
98 unsigned short family)
102 return __xfrm4_selector_match(sel, fl);
104 return __xfrm6_selector_match(sel, fl);
109 static const struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family)
111 const struct xfrm_policy_afinfo *afinfo;
113 if (unlikely(family >= ARRAY_SIZE(xfrm_policy_afinfo)))
116 afinfo = rcu_dereference(xfrm_policy_afinfo[family]);
117 if (unlikely(!afinfo))
122 struct dst_entry *__xfrm_dst_lookup(struct net *net, int tos, int oif,
123 const xfrm_address_t *saddr,
124 const xfrm_address_t *daddr,
125 int family, u32 mark)
127 const struct xfrm_policy_afinfo *afinfo;
128 struct dst_entry *dst;
130 afinfo = xfrm_policy_get_afinfo(family);
131 if (unlikely(afinfo == NULL))
132 return ERR_PTR(-EAFNOSUPPORT);
134 dst = afinfo->dst_lookup(net, tos, oif, saddr, daddr, mark);
140 EXPORT_SYMBOL(__xfrm_dst_lookup);
142 static inline struct dst_entry *xfrm_dst_lookup(struct xfrm_state *x,
144 xfrm_address_t *prev_saddr,
145 xfrm_address_t *prev_daddr,
146 int family, u32 mark)
148 struct net *net = xs_net(x);
149 xfrm_address_t *saddr = &x->props.saddr;
150 xfrm_address_t *daddr = &x->id.daddr;
151 struct dst_entry *dst;
153 if (x->type->flags & XFRM_TYPE_LOCAL_COADDR) {
157 if (x->type->flags & XFRM_TYPE_REMOTE_COADDR) {
162 dst = __xfrm_dst_lookup(net, tos, oif, saddr, daddr, family, mark);
165 if (prev_saddr != saddr)
166 memcpy(prev_saddr, saddr, sizeof(*prev_saddr));
167 if (prev_daddr != daddr)
168 memcpy(prev_daddr, daddr, sizeof(*prev_daddr));
174 static inline unsigned long make_jiffies(long secs)
176 if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
177 return MAX_SCHEDULE_TIMEOUT-1;
182 static void xfrm_policy_timer(struct timer_list *t)
184 struct xfrm_policy *xp = from_timer(xp, t, timer);
185 unsigned long now = get_seconds();
186 long next = LONG_MAX;
190 read_lock(&xp->lock);
192 if (unlikely(xp->walk.dead))
195 dir = xfrm_policy_id2dir(xp->index);
197 if (xp->lft.hard_add_expires_seconds) {
198 long tmo = xp->lft.hard_add_expires_seconds +
199 xp->curlft.add_time - now;
205 if (xp->lft.hard_use_expires_seconds) {
206 long tmo = xp->lft.hard_use_expires_seconds +
207 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
213 if (xp->lft.soft_add_expires_seconds) {
214 long tmo = xp->lft.soft_add_expires_seconds +
215 xp->curlft.add_time - now;
218 tmo = XFRM_KM_TIMEOUT;
223 if (xp->lft.soft_use_expires_seconds) {
224 long tmo = xp->lft.soft_use_expires_seconds +
225 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
228 tmo = XFRM_KM_TIMEOUT;
235 km_policy_expired(xp, dir, 0, 0);
236 if (next != LONG_MAX &&
237 !mod_timer(&xp->timer, jiffies + make_jiffies(next)))
241 read_unlock(&xp->lock);
246 read_unlock(&xp->lock);
247 if (!xfrm_policy_delete(xp, dir))
248 km_policy_expired(xp, dir, 1, 0);
252 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
256 struct xfrm_policy *xfrm_policy_alloc(struct net *net, gfp_t gfp)
258 struct xfrm_policy *policy;
260 policy = kzalloc(sizeof(struct xfrm_policy), gfp);
263 write_pnet(&policy->xp_net, net);
264 INIT_LIST_HEAD(&policy->walk.all);
265 INIT_HLIST_NODE(&policy->bydst);
266 INIT_HLIST_NODE(&policy->byidx);
267 rwlock_init(&policy->lock);
268 refcount_set(&policy->refcnt, 1);
269 skb_queue_head_init(&policy->polq.hold_queue);
270 timer_setup(&policy->timer, xfrm_policy_timer, 0);
271 timer_setup(&policy->polq.hold_timer,
272 xfrm_policy_queue_process, 0);
276 EXPORT_SYMBOL(xfrm_policy_alloc);
278 static void xfrm_policy_destroy_rcu(struct rcu_head *head)
280 struct xfrm_policy *policy = container_of(head, struct xfrm_policy, rcu);
282 security_xfrm_policy_free(policy->security);
286 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
288 void xfrm_policy_destroy(struct xfrm_policy *policy)
290 BUG_ON(!policy->walk.dead);
292 if (del_timer(&policy->timer) || del_timer(&policy->polq.hold_timer))
295 call_rcu(&policy->rcu, xfrm_policy_destroy_rcu);
297 EXPORT_SYMBOL(xfrm_policy_destroy);
299 /* Rule must be locked. Release descendant resources, announce
300 * entry dead. The rule must be unlinked from lists to the moment.
303 static void xfrm_policy_kill(struct xfrm_policy *policy)
305 policy->walk.dead = 1;
307 atomic_inc(&policy->genid);
309 if (del_timer(&policy->polq.hold_timer))
310 xfrm_pol_put(policy);
311 skb_queue_purge(&policy->polq.hold_queue);
313 if (del_timer(&policy->timer))
314 xfrm_pol_put(policy);
316 xfrm_pol_put(policy);
319 static unsigned int xfrm_policy_hashmax __read_mostly = 1 * 1024 * 1024;
321 static inline unsigned int idx_hash(struct net *net, u32 index)
323 return __idx_hash(index, net->xfrm.policy_idx_hmask);
326 /* calculate policy hash thresholds */
327 static void __get_hash_thresh(struct net *net,
328 unsigned short family, int dir,
329 u8 *dbits, u8 *sbits)
333 *dbits = net->xfrm.policy_bydst[dir].dbits4;
334 *sbits = net->xfrm.policy_bydst[dir].sbits4;
338 *dbits = net->xfrm.policy_bydst[dir].dbits6;
339 *sbits = net->xfrm.policy_bydst[dir].sbits6;
348 static struct hlist_head *policy_hash_bysel(struct net *net,
349 const struct xfrm_selector *sel,
350 unsigned short family, int dir)
352 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
357 __get_hash_thresh(net, family, dir, &dbits, &sbits);
358 hash = __sel_hash(sel, family, hmask, dbits, sbits);
360 if (hash == hmask + 1)
361 return &net->xfrm.policy_inexact[dir];
363 return rcu_dereference_check(net->xfrm.policy_bydst[dir].table,
364 lockdep_is_held(&net->xfrm.xfrm_policy_lock)) + hash;
367 static struct hlist_head *policy_hash_direct(struct net *net,
368 const xfrm_address_t *daddr,
369 const xfrm_address_t *saddr,
370 unsigned short family, int dir)
372 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
377 __get_hash_thresh(net, family, dir, &dbits, &sbits);
378 hash = __addr_hash(daddr, saddr, family, hmask, dbits, sbits);
380 return rcu_dereference_check(net->xfrm.policy_bydst[dir].table,
381 lockdep_is_held(&net->xfrm.xfrm_policy_lock)) + hash;
384 static void xfrm_dst_hash_transfer(struct net *net,
385 struct hlist_head *list,
386 struct hlist_head *ndsttable,
387 unsigned int nhashmask,
390 struct hlist_node *tmp, *entry0 = NULL;
391 struct xfrm_policy *pol;
397 hlist_for_each_entry_safe(pol, tmp, list, bydst) {
400 __get_hash_thresh(net, pol->family, dir, &dbits, &sbits);
401 h = __addr_hash(&pol->selector.daddr, &pol->selector.saddr,
402 pol->family, nhashmask, dbits, sbits);
404 hlist_del_rcu(&pol->bydst);
405 hlist_add_head_rcu(&pol->bydst, ndsttable + h);
410 hlist_del_rcu(&pol->bydst);
411 hlist_add_behind_rcu(&pol->bydst, entry0);
413 entry0 = &pol->bydst;
415 if (!hlist_empty(list)) {
421 static void xfrm_idx_hash_transfer(struct hlist_head *list,
422 struct hlist_head *nidxtable,
423 unsigned int nhashmask)
425 struct hlist_node *tmp;
426 struct xfrm_policy *pol;
428 hlist_for_each_entry_safe(pol, tmp, list, byidx) {
431 h = __idx_hash(pol->index, nhashmask);
432 hlist_add_head(&pol->byidx, nidxtable+h);
436 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask)
438 return ((old_hmask + 1) << 1) - 1;
441 static void xfrm_bydst_resize(struct net *net, int dir)
443 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
444 unsigned int nhashmask = xfrm_new_hash_mask(hmask);
445 unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
446 struct hlist_head *ndst = xfrm_hash_alloc(nsize);
447 struct hlist_head *odst;
453 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
454 write_seqcount_begin(&xfrm_policy_hash_generation);
456 odst = rcu_dereference_protected(net->xfrm.policy_bydst[dir].table,
457 lockdep_is_held(&net->xfrm.xfrm_policy_lock));
459 odst = rcu_dereference_protected(net->xfrm.policy_bydst[dir].table,
460 lockdep_is_held(&net->xfrm.xfrm_policy_lock));
462 for (i = hmask; i >= 0; i--)
463 xfrm_dst_hash_transfer(net, odst + i, ndst, nhashmask, dir);
465 rcu_assign_pointer(net->xfrm.policy_bydst[dir].table, ndst);
466 net->xfrm.policy_bydst[dir].hmask = nhashmask;
468 write_seqcount_end(&xfrm_policy_hash_generation);
469 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
473 xfrm_hash_free(odst, (hmask + 1) * sizeof(struct hlist_head));
476 static void xfrm_byidx_resize(struct net *net, int total)
478 unsigned int hmask = net->xfrm.policy_idx_hmask;
479 unsigned int nhashmask = xfrm_new_hash_mask(hmask);
480 unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
481 struct hlist_head *oidx = net->xfrm.policy_byidx;
482 struct hlist_head *nidx = xfrm_hash_alloc(nsize);
488 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
490 for (i = hmask; i >= 0; i--)
491 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask);
493 net->xfrm.policy_byidx = nidx;
494 net->xfrm.policy_idx_hmask = nhashmask;
496 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
498 xfrm_hash_free(oidx, (hmask + 1) * sizeof(struct hlist_head));
501 static inline int xfrm_bydst_should_resize(struct net *net, int dir, int *total)
503 unsigned int cnt = net->xfrm.policy_count[dir];
504 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
509 if ((hmask + 1) < xfrm_policy_hashmax &&
516 static inline int xfrm_byidx_should_resize(struct net *net, int total)
518 unsigned int hmask = net->xfrm.policy_idx_hmask;
520 if ((hmask + 1) < xfrm_policy_hashmax &&
527 void xfrm_spd_getinfo(struct net *net, struct xfrmk_spdinfo *si)
529 si->incnt = net->xfrm.policy_count[XFRM_POLICY_IN];
530 si->outcnt = net->xfrm.policy_count[XFRM_POLICY_OUT];
531 si->fwdcnt = net->xfrm.policy_count[XFRM_POLICY_FWD];
532 si->inscnt = net->xfrm.policy_count[XFRM_POLICY_IN+XFRM_POLICY_MAX];
533 si->outscnt = net->xfrm.policy_count[XFRM_POLICY_OUT+XFRM_POLICY_MAX];
534 si->fwdscnt = net->xfrm.policy_count[XFRM_POLICY_FWD+XFRM_POLICY_MAX];
535 si->spdhcnt = net->xfrm.policy_idx_hmask;
536 si->spdhmcnt = xfrm_policy_hashmax;
538 EXPORT_SYMBOL(xfrm_spd_getinfo);
540 static DEFINE_MUTEX(hash_resize_mutex);
541 static void xfrm_hash_resize(struct work_struct *work)
543 struct net *net = container_of(work, struct net, xfrm.policy_hash_work);
546 mutex_lock(&hash_resize_mutex);
549 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
550 if (xfrm_bydst_should_resize(net, dir, &total))
551 xfrm_bydst_resize(net, dir);
553 if (xfrm_byidx_should_resize(net, total))
554 xfrm_byidx_resize(net, total);
556 mutex_unlock(&hash_resize_mutex);
559 static void xfrm_hash_rebuild(struct work_struct *work)
561 struct net *net = container_of(work, struct net,
562 xfrm.policy_hthresh.work);
564 struct xfrm_policy *pol;
565 struct xfrm_policy *policy;
566 struct hlist_head *chain;
567 struct hlist_head *odst;
568 struct hlist_node *newpos;
572 u8 lbits4, rbits4, lbits6, rbits6;
574 mutex_lock(&hash_resize_mutex);
576 /* read selector prefixlen thresholds */
578 seq = read_seqbegin(&net->xfrm.policy_hthresh.lock);
580 lbits4 = net->xfrm.policy_hthresh.lbits4;
581 rbits4 = net->xfrm.policy_hthresh.rbits4;
582 lbits6 = net->xfrm.policy_hthresh.lbits6;
583 rbits6 = net->xfrm.policy_hthresh.rbits6;
584 } while (read_seqretry(&net->xfrm.policy_hthresh.lock, seq));
586 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
588 /* reset the bydst and inexact table in all directions */
589 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
590 INIT_HLIST_HEAD(&net->xfrm.policy_inexact[dir]);
591 hmask = net->xfrm.policy_bydst[dir].hmask;
592 odst = net->xfrm.policy_bydst[dir].table;
593 for (i = hmask; i >= 0; i--)
594 INIT_HLIST_HEAD(odst + i);
595 if ((dir & XFRM_POLICY_MASK) == XFRM_POLICY_OUT) {
596 /* dir out => dst = remote, src = local */
597 net->xfrm.policy_bydst[dir].dbits4 = rbits4;
598 net->xfrm.policy_bydst[dir].sbits4 = lbits4;
599 net->xfrm.policy_bydst[dir].dbits6 = rbits6;
600 net->xfrm.policy_bydst[dir].sbits6 = lbits6;
602 /* dir in/fwd => dst = local, src = remote */
603 net->xfrm.policy_bydst[dir].dbits4 = lbits4;
604 net->xfrm.policy_bydst[dir].sbits4 = rbits4;
605 net->xfrm.policy_bydst[dir].dbits6 = lbits6;
606 net->xfrm.policy_bydst[dir].sbits6 = rbits6;
610 /* re-insert all policies by order of creation */
611 list_for_each_entry_reverse(policy, &net->xfrm.policy_all, walk.all) {
612 if (policy->walk.dead ||
613 xfrm_policy_id2dir(policy->index) >= XFRM_POLICY_MAX) {
614 /* skip socket policies */
618 chain = policy_hash_bysel(net, &policy->selector,
620 xfrm_policy_id2dir(policy->index));
621 hlist_for_each_entry(pol, chain, bydst) {
622 if (policy->priority >= pol->priority)
623 newpos = &pol->bydst;
628 hlist_add_behind(&policy->bydst, newpos);
630 hlist_add_head(&policy->bydst, chain);
633 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
635 mutex_unlock(&hash_resize_mutex);
638 void xfrm_policy_hash_rebuild(struct net *net)
640 schedule_work(&net->xfrm.policy_hthresh.work);
642 EXPORT_SYMBOL(xfrm_policy_hash_rebuild);
644 /* Generate new index... KAME seems to generate them ordered by cost
645 * of an absolute inpredictability of ordering of rules. This will not pass. */
646 static u32 xfrm_gen_index(struct net *net, int dir, u32 index)
648 static u32 idx_generator;
651 struct hlist_head *list;
652 struct xfrm_policy *p;
657 idx = (idx_generator | dir);
666 list = net->xfrm.policy_byidx + idx_hash(net, idx);
668 hlist_for_each_entry(p, list, byidx) {
669 if (p->index == idx) {
679 static inline int selector_cmp(struct xfrm_selector *s1, struct xfrm_selector *s2)
681 u32 *p1 = (u32 *) s1;
682 u32 *p2 = (u32 *) s2;
683 int len = sizeof(struct xfrm_selector) / sizeof(u32);
686 for (i = 0; i < len; i++) {
694 static void xfrm_policy_requeue(struct xfrm_policy *old,
695 struct xfrm_policy *new)
697 struct xfrm_policy_queue *pq = &old->polq;
698 struct sk_buff_head list;
700 if (skb_queue_empty(&pq->hold_queue))
703 __skb_queue_head_init(&list);
705 spin_lock_bh(&pq->hold_queue.lock);
706 skb_queue_splice_init(&pq->hold_queue, &list);
707 if (del_timer(&pq->hold_timer))
709 spin_unlock_bh(&pq->hold_queue.lock);
713 spin_lock_bh(&pq->hold_queue.lock);
714 skb_queue_splice(&list, &pq->hold_queue);
715 pq->timeout = XFRM_QUEUE_TMO_MIN;
716 if (!mod_timer(&pq->hold_timer, jiffies))
718 spin_unlock_bh(&pq->hold_queue.lock);
721 static bool xfrm_policy_mark_match(struct xfrm_policy *policy,
722 struct xfrm_policy *pol)
724 u32 mark = policy->mark.v & policy->mark.m;
726 if (policy->mark.v == pol->mark.v && policy->mark.m == pol->mark.m)
729 if ((mark & pol->mark.m) == pol->mark.v &&
730 policy->priority == pol->priority)
736 int xfrm_policy_insert(int dir, struct xfrm_policy *policy, int excl)
738 struct net *net = xp_net(policy);
739 struct xfrm_policy *pol;
740 struct xfrm_policy *delpol;
741 struct hlist_head *chain;
742 struct hlist_node *newpos;
744 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
745 chain = policy_hash_bysel(net, &policy->selector, policy->family, dir);
748 hlist_for_each_entry(pol, chain, bydst) {
749 if (pol->type == policy->type &&
750 !selector_cmp(&pol->selector, &policy->selector) &&
751 xfrm_policy_mark_match(policy, pol) &&
752 xfrm_sec_ctx_match(pol->security, policy->security) &&
755 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
759 if (policy->priority > pol->priority)
761 } else if (policy->priority >= pol->priority) {
762 newpos = &pol->bydst;
769 hlist_add_behind(&policy->bydst, newpos);
771 hlist_add_head(&policy->bydst, chain);
772 __xfrm_policy_link(policy, dir);
774 /* After previous checking, family can either be AF_INET or AF_INET6 */
775 if (policy->family == AF_INET)
776 rt_genid_bump_ipv4(net);
778 rt_genid_bump_ipv6(net);
781 xfrm_policy_requeue(delpol, policy);
782 __xfrm_policy_unlink(delpol, dir);
784 policy->index = delpol ? delpol->index : xfrm_gen_index(net, dir, policy->index);
785 hlist_add_head(&policy->byidx, net->xfrm.policy_byidx+idx_hash(net, policy->index));
786 policy->curlft.add_time = get_seconds();
787 policy->curlft.use_time = 0;
788 if (!mod_timer(&policy->timer, jiffies + HZ))
789 xfrm_pol_hold(policy);
790 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
793 xfrm_policy_kill(delpol);
794 else if (xfrm_bydst_should_resize(net, dir, NULL))
795 schedule_work(&net->xfrm.policy_hash_work);
799 EXPORT_SYMBOL(xfrm_policy_insert);
801 struct xfrm_policy *xfrm_policy_bysel_ctx(struct net *net, u32 mark, u8 type,
802 int dir, struct xfrm_selector *sel,
803 struct xfrm_sec_ctx *ctx, int delete,
806 struct xfrm_policy *pol, *ret;
807 struct hlist_head *chain;
810 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
811 chain = policy_hash_bysel(net, sel, sel->family, dir);
813 hlist_for_each_entry(pol, chain, bydst) {
814 if (pol->type == type &&
815 (mark & pol->mark.m) == pol->mark.v &&
816 !selector_cmp(sel, &pol->selector) &&
817 xfrm_sec_ctx_match(ctx, pol->security)) {
820 *err = security_xfrm_policy_delete(
823 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
826 __xfrm_policy_unlink(pol, dir);
832 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
835 xfrm_policy_kill(ret);
838 EXPORT_SYMBOL(xfrm_policy_bysel_ctx);
840 struct xfrm_policy *xfrm_policy_byid(struct net *net, u32 mark, u8 type,
841 int dir, u32 id, int delete, int *err)
843 struct xfrm_policy *pol, *ret;
844 struct hlist_head *chain;
847 if (xfrm_policy_id2dir(id) != dir)
851 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
852 chain = net->xfrm.policy_byidx + idx_hash(net, id);
854 hlist_for_each_entry(pol, chain, byidx) {
855 if (pol->type == type && pol->index == id &&
856 (mark & pol->mark.m) == pol->mark.v) {
859 *err = security_xfrm_policy_delete(
862 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
865 __xfrm_policy_unlink(pol, dir);
871 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
874 xfrm_policy_kill(ret);
877 EXPORT_SYMBOL(xfrm_policy_byid);
879 #ifdef CONFIG_SECURITY_NETWORK_XFRM
881 xfrm_policy_flush_secctx_check(struct net *net, u8 type, bool task_valid)
885 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
886 struct xfrm_policy *pol;
889 hlist_for_each_entry(pol,
890 &net->xfrm.policy_inexact[dir], bydst) {
891 if (pol->type != type)
893 err = security_xfrm_policy_delete(pol->security);
895 xfrm_audit_policy_delete(pol, 0, task_valid);
899 for (i = net->xfrm.policy_bydst[dir].hmask; i >= 0; i--) {
900 hlist_for_each_entry(pol,
901 net->xfrm.policy_bydst[dir].table + i,
903 if (pol->type != type)
905 err = security_xfrm_policy_delete(
908 xfrm_audit_policy_delete(pol, 0,
919 xfrm_policy_flush_secctx_check(struct net *net, u8 type, bool task_valid)
925 int xfrm_policy_flush(struct net *net, u8 type, bool task_valid)
927 int dir, err = 0, cnt = 0;
929 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
931 err = xfrm_policy_flush_secctx_check(net, type, task_valid);
935 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
936 struct xfrm_policy *pol;
940 hlist_for_each_entry(pol,
941 &net->xfrm.policy_inexact[dir], bydst) {
942 if (pol->type != type)
944 __xfrm_policy_unlink(pol, dir);
945 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
948 xfrm_audit_policy_delete(pol, 1, task_valid);
950 xfrm_policy_kill(pol);
952 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
956 for (i = net->xfrm.policy_bydst[dir].hmask; i >= 0; i--) {
958 hlist_for_each_entry(pol,
959 net->xfrm.policy_bydst[dir].table + i,
961 if (pol->type != type)
963 __xfrm_policy_unlink(pol, dir);
964 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
967 xfrm_audit_policy_delete(pol, 1, task_valid);
968 xfrm_policy_kill(pol);
970 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
979 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
982 EXPORT_SYMBOL(xfrm_policy_flush);
984 int xfrm_policy_walk(struct net *net, struct xfrm_policy_walk *walk,
985 int (*func)(struct xfrm_policy *, int, int, void*),
988 struct xfrm_policy *pol;
989 struct xfrm_policy_walk_entry *x;
992 if (walk->type >= XFRM_POLICY_TYPE_MAX &&
993 walk->type != XFRM_POLICY_TYPE_ANY)
996 if (list_empty(&walk->walk.all) && walk->seq != 0)
999 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1000 if (list_empty(&walk->walk.all))
1001 x = list_first_entry(&net->xfrm.policy_all, struct xfrm_policy_walk_entry, all);
1003 x = list_first_entry(&walk->walk.all,
1004 struct xfrm_policy_walk_entry, all);
1006 list_for_each_entry_from(x, &net->xfrm.policy_all, all) {
1009 pol = container_of(x, struct xfrm_policy, walk);
1010 if (walk->type != XFRM_POLICY_TYPE_ANY &&
1011 walk->type != pol->type)
1013 error = func(pol, xfrm_policy_id2dir(pol->index),
1016 list_move_tail(&walk->walk.all, &x->all);
1021 if (walk->seq == 0) {
1025 list_del_init(&walk->walk.all);
1027 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1030 EXPORT_SYMBOL(xfrm_policy_walk);
1032 void xfrm_policy_walk_init(struct xfrm_policy_walk *walk, u8 type)
1034 INIT_LIST_HEAD(&walk->walk.all);
1035 walk->walk.dead = 1;
1039 EXPORT_SYMBOL(xfrm_policy_walk_init);
1041 void xfrm_policy_walk_done(struct xfrm_policy_walk *walk, struct net *net)
1043 if (list_empty(&walk->walk.all))
1046 spin_lock_bh(&net->xfrm.xfrm_policy_lock); /*FIXME where is net? */
1047 list_del(&walk->walk.all);
1048 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1050 EXPORT_SYMBOL(xfrm_policy_walk_done);
1053 * Find policy to apply to this flow.
1055 * Returns 0 if policy found, else an -errno.
1057 static int xfrm_policy_match(const struct xfrm_policy *pol,
1058 const struct flowi *fl,
1059 u8 type, u16 family, int dir)
1061 const struct xfrm_selector *sel = &pol->selector;
1065 if (pol->family != family ||
1066 (fl->flowi_mark & pol->mark.m) != pol->mark.v ||
1070 match = xfrm_selector_match(sel, fl, family);
1072 ret = security_xfrm_policy_lookup(pol->security, fl->flowi_secid,
1078 static struct xfrm_policy *xfrm_policy_lookup_bytype(struct net *net, u8 type,
1079 const struct flowi *fl,
1083 struct xfrm_policy *pol, *ret;
1084 const xfrm_address_t *daddr, *saddr;
1085 struct hlist_head *chain;
1086 unsigned int sequence;
1089 daddr = xfrm_flowi_daddr(fl, family);
1090 saddr = xfrm_flowi_saddr(fl, family);
1091 if (unlikely(!daddr || !saddr))
1097 sequence = read_seqcount_begin(&xfrm_policy_hash_generation);
1098 chain = policy_hash_direct(net, daddr, saddr, family, dir);
1099 } while (read_seqcount_retry(&xfrm_policy_hash_generation, sequence));
1103 hlist_for_each_entry_rcu(pol, chain, bydst) {
1104 err = xfrm_policy_match(pol, fl, type, family, dir);
1114 priority = ret->priority;
1118 chain = &net->xfrm.policy_inexact[dir];
1119 hlist_for_each_entry_rcu(pol, chain, bydst) {
1120 if ((pol->priority >= priority) && ret)
1123 err = xfrm_policy_match(pol, fl, type, family, dir);
1137 if (read_seqcount_retry(&xfrm_policy_hash_generation, sequence))
1140 if (ret && !xfrm_pol_hold_rcu(ret))
1148 static struct xfrm_policy *
1149 xfrm_policy_lookup(struct net *net, const struct flowi *fl, u16 family, u8 dir)
1151 #ifdef CONFIG_XFRM_SUB_POLICY
1152 struct xfrm_policy *pol;
1154 pol = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_SUB, fl, family, dir);
1158 return xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN, fl, family, dir);
1161 static struct xfrm_policy *xfrm_sk_policy_lookup(const struct sock *sk, int dir,
1162 const struct flowi *fl, u16 family)
1164 struct xfrm_policy *pol;
1168 pol = rcu_dereference(sk->sk_policy[dir]);
1173 if (pol->family != family) {
1178 match = xfrm_selector_match(&pol->selector, fl, family);
1180 if ((sk->sk_mark & pol->mark.m) != pol->mark.v) {
1184 err = security_xfrm_policy_lookup(pol->security,
1188 if (!xfrm_pol_hold_rcu(pol))
1190 } else if (err == -ESRCH) {
1203 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir)
1205 struct net *net = xp_net(pol);
1207 list_add(&pol->walk.all, &net->xfrm.policy_all);
1208 net->xfrm.policy_count[dir]++;
1212 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
1215 struct net *net = xp_net(pol);
1217 if (list_empty(&pol->walk.all))
1220 /* Socket policies are not hashed. */
1221 if (!hlist_unhashed(&pol->bydst)) {
1222 hlist_del_rcu(&pol->bydst);
1223 hlist_del(&pol->byidx);
1226 list_del_init(&pol->walk.all);
1227 net->xfrm.policy_count[dir]--;
1232 static void xfrm_sk_policy_link(struct xfrm_policy *pol, int dir)
1234 __xfrm_policy_link(pol, XFRM_POLICY_MAX + dir);
1237 static void xfrm_sk_policy_unlink(struct xfrm_policy *pol, int dir)
1239 __xfrm_policy_unlink(pol, XFRM_POLICY_MAX + dir);
1242 int xfrm_policy_delete(struct xfrm_policy *pol, int dir)
1244 struct net *net = xp_net(pol);
1246 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1247 pol = __xfrm_policy_unlink(pol, dir);
1248 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1250 xfrm_policy_kill(pol);
1255 EXPORT_SYMBOL(xfrm_policy_delete);
1257 int xfrm_sk_policy_insert(struct sock *sk, int dir, struct xfrm_policy *pol)
1259 struct net *net = sock_net(sk);
1260 struct xfrm_policy *old_pol;
1262 #ifdef CONFIG_XFRM_SUB_POLICY
1263 if (pol && pol->type != XFRM_POLICY_TYPE_MAIN)
1267 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1268 old_pol = rcu_dereference_protected(sk->sk_policy[dir],
1269 lockdep_is_held(&net->xfrm.xfrm_policy_lock));
1271 pol->curlft.add_time = get_seconds();
1272 pol->index = xfrm_gen_index(net, XFRM_POLICY_MAX+dir, 0);
1273 xfrm_sk_policy_link(pol, dir);
1275 rcu_assign_pointer(sk->sk_policy[dir], pol);
1278 xfrm_policy_requeue(old_pol, pol);
1280 /* Unlinking succeeds always. This is the only function
1281 * allowed to delete or replace socket policy.
1283 xfrm_sk_policy_unlink(old_pol, dir);
1285 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1288 xfrm_policy_kill(old_pol);
1293 static struct xfrm_policy *clone_policy(const struct xfrm_policy *old, int dir)
1295 struct xfrm_policy *newp = xfrm_policy_alloc(xp_net(old), GFP_ATOMIC);
1296 struct net *net = xp_net(old);
1299 newp->selector = old->selector;
1300 if (security_xfrm_policy_clone(old->security,
1303 return NULL; /* ENOMEM */
1305 newp->lft = old->lft;
1306 newp->curlft = old->curlft;
1307 newp->mark = old->mark;
1308 newp->action = old->action;
1309 newp->flags = old->flags;
1310 newp->xfrm_nr = old->xfrm_nr;
1311 newp->index = old->index;
1312 newp->type = old->type;
1313 newp->family = old->family;
1314 memcpy(newp->xfrm_vec, old->xfrm_vec,
1315 newp->xfrm_nr*sizeof(struct xfrm_tmpl));
1316 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1317 xfrm_sk_policy_link(newp, dir);
1318 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1324 int __xfrm_sk_clone_policy(struct sock *sk, const struct sock *osk)
1326 const struct xfrm_policy *p;
1327 struct xfrm_policy *np;
1331 for (i = 0; i < 2; i++) {
1332 p = rcu_dereference(osk->sk_policy[i]);
1334 np = clone_policy(p, i);
1335 if (unlikely(!np)) {
1339 rcu_assign_pointer(sk->sk_policy[i], np);
1347 xfrm_get_saddr(struct net *net, int oif, xfrm_address_t *local,
1348 xfrm_address_t *remote, unsigned short family, u32 mark)
1351 const struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1353 if (unlikely(afinfo == NULL))
1355 err = afinfo->get_saddr(net, oif, local, remote, mark);
1360 /* Resolve list of templates for the flow, given policy. */
1363 xfrm_tmpl_resolve_one(struct xfrm_policy *policy, const struct flowi *fl,
1364 struct xfrm_state **xfrm, unsigned short family)
1366 struct net *net = xp_net(policy);
1369 xfrm_address_t *daddr = xfrm_flowi_daddr(fl, family);
1370 xfrm_address_t *saddr = xfrm_flowi_saddr(fl, family);
1373 for (nx = 0, i = 0; i < policy->xfrm_nr; i++) {
1374 struct xfrm_state *x;
1375 xfrm_address_t *remote = daddr;
1376 xfrm_address_t *local = saddr;
1377 struct xfrm_tmpl *tmpl = &policy->xfrm_vec[i];
1379 if (tmpl->mode == XFRM_MODE_TUNNEL ||
1380 tmpl->mode == XFRM_MODE_BEET) {
1381 remote = &tmpl->id.daddr;
1382 local = &tmpl->saddr;
1383 if (xfrm_addr_any(local, tmpl->encap_family)) {
1384 error = xfrm_get_saddr(net, fl->flowi_oif,
1386 tmpl->encap_family, 0);
1393 x = xfrm_state_find(remote, local, fl, tmpl, policy, &error, family);
1395 if (x && x->km.state == XFRM_STATE_VALID) {
1402 error = (x->km.state == XFRM_STATE_ERROR ?
1405 } else if (error == -ESRCH) {
1409 if (!tmpl->optional)
1415 for (nx--; nx >= 0; nx--)
1416 xfrm_state_put(xfrm[nx]);
1421 xfrm_tmpl_resolve(struct xfrm_policy **pols, int npols, const struct flowi *fl,
1422 struct xfrm_state **xfrm, unsigned short family)
1424 struct xfrm_state *tp[XFRM_MAX_DEPTH];
1425 struct xfrm_state **tpp = (npols > 1) ? tp : xfrm;
1431 for (i = 0; i < npols; i++) {
1432 if (cnx + pols[i]->xfrm_nr >= XFRM_MAX_DEPTH) {
1437 ret = xfrm_tmpl_resolve_one(pols[i], fl, &tpp[cnx], family);
1445 /* found states are sorted for outbound processing */
1447 xfrm_state_sort(xfrm, tpp, cnx, family);
1452 for (cnx--; cnx >= 0; cnx--)
1453 xfrm_state_put(tpp[cnx]);
1458 static int xfrm_get_tos(const struct flowi *fl, int family)
1460 const struct xfrm_policy_afinfo *afinfo;
1463 afinfo = xfrm_policy_get_afinfo(family);
1464 tos = afinfo ? afinfo->get_tos(fl) : 0;
1471 static inline struct xfrm_dst *xfrm_alloc_dst(struct net *net, int family)
1473 const struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1474 struct dst_ops *dst_ops;
1475 struct xfrm_dst *xdst;
1478 return ERR_PTR(-EINVAL);
1482 dst_ops = &net->xfrm.xfrm4_dst_ops;
1484 #if IS_ENABLED(CONFIG_IPV6)
1486 dst_ops = &net->xfrm.xfrm6_dst_ops;
1492 xdst = dst_alloc(dst_ops, NULL, 1, DST_OBSOLETE_NONE, 0);
1495 struct dst_entry *dst = &xdst->u.dst;
1497 memset(dst + 1, 0, sizeof(*xdst) - sizeof(*dst));
1499 xdst = ERR_PTR(-ENOBUFS);
1506 static inline int xfrm_init_path(struct xfrm_dst *path, struct dst_entry *dst,
1509 const struct xfrm_policy_afinfo *afinfo =
1510 xfrm_policy_get_afinfo(dst->ops->family);
1516 err = afinfo->init_path(path, dst, nfheader_len);
1523 static inline int xfrm_fill_dst(struct xfrm_dst *xdst, struct net_device *dev,
1524 const struct flowi *fl)
1526 const struct xfrm_policy_afinfo *afinfo =
1527 xfrm_policy_get_afinfo(xdst->u.dst.ops->family);
1533 err = afinfo->fill_dst(xdst, dev, fl);
1541 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
1542 * all the metrics... Shortly, bundle a bundle.
1545 static struct dst_entry *xfrm_bundle_create(struct xfrm_policy *policy,
1546 struct xfrm_state **xfrm,
1547 struct xfrm_dst **bundle,
1549 const struct flowi *fl,
1550 struct dst_entry *dst)
1552 struct net *net = xp_net(policy);
1553 unsigned long now = jiffies;
1554 struct net_device *dev;
1555 struct xfrm_mode *inner_mode;
1556 struct xfrm_dst *xdst_prev = NULL;
1557 struct xfrm_dst *xdst0 = NULL;
1561 int nfheader_len = 0;
1562 int trailer_len = 0;
1564 int family = policy->selector.family;
1565 xfrm_address_t saddr, daddr;
1567 xfrm_flowi_addr_get(fl, &saddr, &daddr, family);
1569 tos = xfrm_get_tos(fl, family);
1573 for (; i < nx; i++) {
1574 struct xfrm_dst *xdst = xfrm_alloc_dst(net, family);
1575 struct dst_entry *dst1 = &xdst->u.dst;
1577 err = PTR_ERR(xdst);
1587 /* Ref count is taken during xfrm_alloc_dst()
1588 * No need to do dst_clone() on dst1
1590 xfrm_dst_set_child(xdst_prev, &xdst->u.dst);
1592 if (xfrm[i]->sel.family == AF_UNSPEC) {
1593 inner_mode = xfrm_ip2inner_mode(xfrm[i],
1594 xfrm_af2proto(family));
1596 err = -EAFNOSUPPORT;
1601 inner_mode = xfrm[i]->inner_mode;
1604 dst_copy_metrics(dst1, dst);
1606 if (xfrm[i]->props.mode != XFRM_MODE_TRANSPORT) {
1607 family = xfrm[i]->props.family;
1608 dst = xfrm_dst_lookup(xfrm[i], tos, fl->flowi_oif,
1609 &saddr, &daddr, family,
1610 xfrm[i]->props.output_mark);
1617 dst1->xfrm = xfrm[i];
1618 xdst->xfrm_genid = xfrm[i]->genid;
1620 dst1->obsolete = DST_OBSOLETE_FORCE_CHK;
1621 dst1->flags |= DST_HOST;
1622 dst1->lastuse = now;
1624 dst1->input = dst_discard;
1625 dst1->output = inner_mode->afinfo->output;
1629 header_len += xfrm[i]->props.header_len;
1630 if (xfrm[i]->type->flags & XFRM_TYPE_NON_FRAGMENT)
1631 nfheader_len += xfrm[i]->props.header_len;
1632 trailer_len += xfrm[i]->props.trailer_len;
1635 xfrm_dst_set_child(xdst_prev, dst);
1643 xfrm_init_path(xdst0, dst, nfheader_len);
1644 xfrm_init_pmtu(bundle, nx);
1646 for (xdst_prev = xdst0; xdst_prev != (struct xfrm_dst *)dst;
1647 xdst_prev = (struct xfrm_dst *) xfrm_dst_child(&xdst_prev->u.dst)) {
1648 err = xfrm_fill_dst(xdst_prev, dev, fl);
1652 xdst_prev->u.dst.header_len = header_len;
1653 xdst_prev->u.dst.trailer_len = trailer_len;
1654 header_len -= xdst_prev->u.dst.xfrm->props.header_len;
1655 trailer_len -= xdst_prev->u.dst.xfrm->props.trailer_len;
1659 return &xdst0->u.dst;
1663 xfrm_state_put(xfrm[i]);
1666 dst_release_immediate(&xdst0->u.dst);
1667 xdst0 = ERR_PTR(err);
1671 static int xfrm_expand_policies(const struct flowi *fl, u16 family,
1672 struct xfrm_policy **pols,
1673 int *num_pols, int *num_xfrms)
1677 if (*num_pols == 0 || !pols[0]) {
1682 if (IS_ERR(pols[0]))
1683 return PTR_ERR(pols[0]);
1685 *num_xfrms = pols[0]->xfrm_nr;
1687 #ifdef CONFIG_XFRM_SUB_POLICY
1688 if (pols[0] && pols[0]->action == XFRM_POLICY_ALLOW &&
1689 pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
1690 pols[1] = xfrm_policy_lookup_bytype(xp_net(pols[0]),
1691 XFRM_POLICY_TYPE_MAIN,
1695 if (IS_ERR(pols[1])) {
1696 xfrm_pols_put(pols, *num_pols);
1697 return PTR_ERR(pols[1]);
1700 (*num_xfrms) += pols[1]->xfrm_nr;
1704 for (i = 0; i < *num_pols; i++) {
1705 if (pols[i]->action != XFRM_POLICY_ALLOW) {
1715 static void xfrm_last_dst_update(struct xfrm_dst *xdst, struct xfrm_dst *old)
1717 this_cpu_write(xfrm_last_dst, xdst);
1719 dst_release(&old->u.dst);
1722 static void __xfrm_pcpu_work_fn(void)
1724 struct xfrm_dst *old;
1726 old = this_cpu_read(xfrm_last_dst);
1727 if (old && !xfrm_bundle_ok(old))
1728 xfrm_last_dst_update(NULL, old);
1731 static void xfrm_pcpu_work_fn(struct work_struct *work)
1735 __xfrm_pcpu_work_fn();
1740 void xfrm_policy_cache_flush(void)
1742 struct xfrm_dst *old;
1750 for_each_possible_cpu(cpu) {
1751 old = per_cpu(xfrm_last_dst, cpu);
1752 if (old && !xfrm_bundle_ok(old)) {
1753 if (smp_processor_id() == cpu) {
1754 __xfrm_pcpu_work_fn();
1770 for_each_possible_cpu(cpu) {
1771 bool bundle_release;
1774 old = per_cpu(xfrm_last_dst, cpu);
1775 bundle_release = old && !xfrm_bundle_ok(old);
1778 if (!bundle_release)
1781 if (cpu_online(cpu)) {
1782 schedule_work_on(cpu, &xfrm_pcpu_work[cpu]);
1787 old = per_cpu(xfrm_last_dst, cpu);
1788 if (old && !xfrm_bundle_ok(old)) {
1789 per_cpu(xfrm_last_dst, cpu) = NULL;
1790 dst_release(&old->u.dst);
1798 static bool xfrm_xdst_can_reuse(struct xfrm_dst *xdst,
1799 struct xfrm_state * const xfrm[],
1802 const struct dst_entry *dst = &xdst->u.dst;
1805 if (xdst->num_xfrms != num)
1808 for (i = 0; i < num; i++) {
1809 if (!dst || dst->xfrm != xfrm[i])
1811 dst = xfrm_dst_child(dst);
1814 return xfrm_bundle_ok(xdst);
1817 static struct xfrm_dst *
1818 xfrm_resolve_and_create_bundle(struct xfrm_policy **pols, int num_pols,
1819 const struct flowi *fl, u16 family,
1820 struct dst_entry *dst_orig)
1822 struct net *net = xp_net(pols[0]);
1823 struct xfrm_state *xfrm[XFRM_MAX_DEPTH];
1824 struct xfrm_dst *bundle[XFRM_MAX_DEPTH];
1825 struct xfrm_dst *xdst, *old;
1826 struct dst_entry *dst;
1829 /* Try to instantiate a bundle */
1830 err = xfrm_tmpl_resolve(pols, num_pols, fl, xfrm, family);
1832 if (err != 0 && err != -EAGAIN)
1833 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
1834 return ERR_PTR(err);
1837 xdst = this_cpu_read(xfrm_last_dst);
1839 xdst->u.dst.dev == dst_orig->dev &&
1840 xdst->num_pols == num_pols &&
1841 memcmp(xdst->pols, pols,
1842 sizeof(struct xfrm_policy *) * num_pols) == 0 &&
1843 xfrm_xdst_can_reuse(xdst, xfrm, err)) {
1844 dst_hold(&xdst->u.dst);
1845 xfrm_pols_put(pols, num_pols);
1847 xfrm_state_put(xfrm[--err]);
1853 dst = xfrm_bundle_create(pols[0], xfrm, bundle, err, fl, dst_orig);
1855 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLEGENERROR);
1856 return ERR_CAST(dst);
1859 xdst = (struct xfrm_dst *)dst;
1860 xdst->num_xfrms = err;
1861 xdst->num_pols = num_pols;
1862 memcpy(xdst->pols, pols, sizeof(struct xfrm_policy *) * num_pols);
1863 xdst->policy_genid = atomic_read(&pols[0]->genid);
1865 atomic_set(&xdst->u.dst.__refcnt, 2);
1866 xfrm_last_dst_update(xdst, old);
1871 static void xfrm_policy_queue_process(struct timer_list *t)
1873 struct sk_buff *skb;
1875 struct dst_entry *dst;
1876 struct xfrm_policy *pol = from_timer(pol, t, polq.hold_timer);
1877 struct net *net = xp_net(pol);
1878 struct xfrm_policy_queue *pq = &pol->polq;
1880 struct sk_buff_head list;
1882 spin_lock(&pq->hold_queue.lock);
1883 skb = skb_peek(&pq->hold_queue);
1885 spin_unlock(&pq->hold_queue.lock);
1890 xfrm_decode_session(skb, &fl, dst->ops->family);
1891 spin_unlock(&pq->hold_queue.lock);
1893 dst_hold(xfrm_dst_path(dst));
1894 dst = xfrm_lookup(net, xfrm_dst_path(dst), &fl, sk, 0);
1898 if (dst->flags & DST_XFRM_QUEUE) {
1901 if (pq->timeout >= XFRM_QUEUE_TMO_MAX)
1904 pq->timeout = pq->timeout << 1;
1905 if (!mod_timer(&pq->hold_timer, jiffies + pq->timeout))
1912 __skb_queue_head_init(&list);
1914 spin_lock(&pq->hold_queue.lock);
1916 skb_queue_splice_init(&pq->hold_queue, &list);
1917 spin_unlock(&pq->hold_queue.lock);
1919 while (!skb_queue_empty(&list)) {
1920 skb = __skb_dequeue(&list);
1922 xfrm_decode_session(skb, &fl, skb_dst(skb)->ops->family);
1923 dst_hold(xfrm_dst_path(skb_dst(skb)));
1924 dst = xfrm_lookup(net, xfrm_dst_path(skb_dst(skb)), &fl, skb->sk, 0);
1932 skb_dst_set(skb, dst);
1934 dst_output(net, skb->sk, skb);
1943 skb_queue_purge(&pq->hold_queue);
1947 static int xdst_queue_output(struct net *net, struct sock *sk, struct sk_buff *skb)
1949 unsigned long sched_next;
1950 struct dst_entry *dst = skb_dst(skb);
1951 struct xfrm_dst *xdst = (struct xfrm_dst *) dst;
1952 struct xfrm_policy *pol = xdst->pols[0];
1953 struct xfrm_policy_queue *pq = &pol->polq;
1955 if (unlikely(skb_fclone_busy(sk, skb))) {
1960 if (pq->hold_queue.qlen > XFRM_MAX_QUEUE_LEN) {
1967 spin_lock_bh(&pq->hold_queue.lock);
1970 pq->timeout = XFRM_QUEUE_TMO_MIN;
1972 sched_next = jiffies + pq->timeout;
1974 if (del_timer(&pq->hold_timer)) {
1975 if (time_before(pq->hold_timer.expires, sched_next))
1976 sched_next = pq->hold_timer.expires;
1980 __skb_queue_tail(&pq->hold_queue, skb);
1981 if (!mod_timer(&pq->hold_timer, sched_next))
1984 spin_unlock_bh(&pq->hold_queue.lock);
1989 static struct xfrm_dst *xfrm_create_dummy_bundle(struct net *net,
1990 struct xfrm_flo *xflo,
1991 const struct flowi *fl,
1996 struct net_device *dev;
1997 struct dst_entry *dst;
1998 struct dst_entry *dst1;
1999 struct xfrm_dst *xdst;
2001 xdst = xfrm_alloc_dst(net, family);
2005 if (!(xflo->flags & XFRM_LOOKUP_QUEUE) ||
2006 net->xfrm.sysctl_larval_drop ||
2010 dst = xflo->dst_orig;
2011 dst1 = &xdst->u.dst;
2015 dst_copy_metrics(dst1, dst);
2017 dst1->obsolete = DST_OBSOLETE_FORCE_CHK;
2018 dst1->flags |= DST_HOST | DST_XFRM_QUEUE;
2019 dst1->lastuse = jiffies;
2021 dst1->input = dst_discard;
2022 dst1->output = xdst_queue_output;
2025 xfrm_dst_set_child(xdst, dst);
2028 xfrm_init_path((struct xfrm_dst *)dst1, dst, 0);
2035 err = xfrm_fill_dst(xdst, dev, fl);
2044 xdst = ERR_PTR(err);
2048 static struct xfrm_dst *
2049 xfrm_bundle_lookup(struct net *net, const struct flowi *fl, u16 family, u8 dir, struct xfrm_flo *xflo)
2051 struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
2052 int num_pols = 0, num_xfrms = 0, err;
2053 struct xfrm_dst *xdst;
2055 /* Resolve policies to use if we couldn't get them from
2056 * previous cache entry */
2058 pols[0] = xfrm_policy_lookup(net, fl, family, dir);
2059 err = xfrm_expand_policies(fl, family, pols,
2060 &num_pols, &num_xfrms);
2066 goto make_dummy_bundle;
2069 xdst = xfrm_resolve_and_create_bundle(pols, num_pols, fl, family,
2074 err = PTR_ERR(xdst);
2077 goto make_dummy_bundle;
2078 } else if (xdst == NULL) {
2080 goto make_dummy_bundle;
2086 /* We found policies, but there's no bundles to instantiate:
2087 * either because the policy blocks, has no transformations or
2088 * we could not build template (no xfrm_states).*/
2089 xdst = xfrm_create_dummy_bundle(net, xflo, fl, num_xfrms, family);
2091 xfrm_pols_put(pols, num_pols);
2092 return ERR_CAST(xdst);
2094 xdst->num_pols = num_pols;
2095 xdst->num_xfrms = num_xfrms;
2096 memcpy(xdst->pols, pols, sizeof(struct xfrm_policy *) * num_pols);
2101 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
2103 xfrm_pols_put(pols, num_pols);
2104 return ERR_PTR(err);
2107 static struct dst_entry *make_blackhole(struct net *net, u16 family,
2108 struct dst_entry *dst_orig)
2110 const struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
2111 struct dst_entry *ret;
2114 dst_release(dst_orig);
2115 return ERR_PTR(-EINVAL);
2117 ret = afinfo->blackhole_route(net, dst_orig);
2124 /* Main function: finds/creates a bundle for given flow.
2126 * At the moment we eat a raw IP route. Mostly to speed up lookups
2127 * on interfaces with disabled IPsec.
2129 struct dst_entry *xfrm_lookup(struct net *net, struct dst_entry *dst_orig,
2130 const struct flowi *fl,
2131 const struct sock *sk, int flags)
2133 struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
2134 struct xfrm_dst *xdst;
2135 struct dst_entry *dst, *route;
2136 u16 family = dst_orig->ops->family;
2137 u8 dir = XFRM_POLICY_OUT;
2138 int i, err, num_pols, num_xfrms = 0, drop_pols = 0;
2144 sk = sk_const_to_full_sk(sk);
2145 if (sk && sk->sk_policy[XFRM_POLICY_OUT]) {
2147 pols[0] = xfrm_sk_policy_lookup(sk, XFRM_POLICY_OUT, fl, family);
2148 err = xfrm_expand_policies(fl, family, pols,
2149 &num_pols, &num_xfrms);
2154 if (num_xfrms <= 0) {
2155 drop_pols = num_pols;
2160 xdst = xfrm_resolve_and_create_bundle(
2166 xfrm_pols_put(pols, num_pols);
2167 err = PTR_ERR(xdst);
2169 } else if (xdst == NULL) {
2171 drop_pols = num_pols;
2175 route = xdst->route;
2180 struct xfrm_flo xflo;
2182 xflo.dst_orig = dst_orig;
2185 /* To accelerate a bit... */
2186 if ((dst_orig->flags & DST_NOXFRM) ||
2187 !net->xfrm.policy_count[XFRM_POLICY_OUT])
2190 xdst = xfrm_bundle_lookup(net, fl, family, dir, &xflo);
2194 err = PTR_ERR(xdst);
2198 num_pols = xdst->num_pols;
2199 num_xfrms = xdst->num_xfrms;
2200 memcpy(pols, xdst->pols, sizeof(struct xfrm_policy *) * num_pols);
2201 route = xdst->route;
2205 if (route == NULL && num_xfrms > 0) {
2206 /* The only case when xfrm_bundle_lookup() returns a
2207 * bundle with null route, is when the template could
2208 * not be resolved. It means policies are there, but
2209 * bundle could not be created, since we don't yet
2210 * have the xfrm_state's. We need to wait for KM to
2211 * negotiate new SA's or bail out with error.*/
2212 if (net->xfrm.sysctl_larval_drop) {
2213 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
2220 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
2228 if ((flags & XFRM_LOOKUP_ICMP) &&
2229 !(pols[0]->flags & XFRM_POLICY_ICMP)) {
2234 for (i = 0; i < num_pols; i++)
2235 pols[i]->curlft.use_time = get_seconds();
2237 if (num_xfrms < 0) {
2238 /* Prohibit the flow */
2239 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLBLOCK);
2242 } else if (num_xfrms > 0) {
2243 /* Flow transformed */
2244 dst_release(dst_orig);
2246 /* Flow passes untransformed */
2251 xfrm_pols_put(pols, drop_pols);
2252 if (dst && dst->xfrm &&
2253 dst->xfrm->props.mode == XFRM_MODE_TUNNEL)
2254 dst->flags |= DST_XFRM_TUNNEL;
2258 if (!(flags & XFRM_LOOKUP_ICMP)) {
2266 if (!(flags & XFRM_LOOKUP_KEEP_DST_REF))
2267 dst_release(dst_orig);
2268 xfrm_pols_put(pols, drop_pols);
2269 return ERR_PTR(err);
2271 EXPORT_SYMBOL(xfrm_lookup);
2273 /* Callers of xfrm_lookup_route() must ensure a call to dst_output().
2274 * Otherwise we may send out blackholed packets.
2276 struct dst_entry *xfrm_lookup_route(struct net *net, struct dst_entry *dst_orig,
2277 const struct flowi *fl,
2278 const struct sock *sk, int flags)
2280 struct dst_entry *dst = xfrm_lookup(net, dst_orig, fl, sk,
2281 flags | XFRM_LOOKUP_QUEUE |
2282 XFRM_LOOKUP_KEEP_DST_REF);
2284 if (IS_ERR(dst) && PTR_ERR(dst) == -EREMOTE)
2285 return make_blackhole(net, dst_orig->ops->family, dst_orig);
2289 EXPORT_SYMBOL(xfrm_lookup_route);
2292 xfrm_secpath_reject(int idx, struct sk_buff *skb, const struct flowi *fl)
2294 struct xfrm_state *x;
2296 if (!skb->sp || idx < 0 || idx >= skb->sp->len)
2298 x = skb->sp->xvec[idx];
2299 if (!x->type->reject)
2301 return x->type->reject(x, skb, fl);
2304 /* When skb is transformed back to its "native" form, we have to
2305 * check policy restrictions. At the moment we make this in maximally
2306 * stupid way. Shame on me. :-) Of course, connected sockets must
2307 * have policy cached at them.
2311 xfrm_state_ok(const struct xfrm_tmpl *tmpl, const struct xfrm_state *x,
2312 unsigned short family)
2314 if (xfrm_state_kern(x))
2315 return tmpl->optional && !xfrm_state_addr_cmp(tmpl, x, tmpl->encap_family);
2316 return x->id.proto == tmpl->id.proto &&
2317 (x->id.spi == tmpl->id.spi || !tmpl->id.spi) &&
2318 (x->props.reqid == tmpl->reqid || !tmpl->reqid) &&
2319 x->props.mode == tmpl->mode &&
2320 (tmpl->allalgs || (tmpl->aalgos & (1<<x->props.aalgo)) ||
2321 !(xfrm_id_proto_match(tmpl->id.proto, IPSEC_PROTO_ANY))) &&
2322 !(x->props.mode != XFRM_MODE_TRANSPORT &&
2323 xfrm_state_addr_cmp(tmpl, x, family));
2327 * 0 or more than 0 is returned when validation is succeeded (either bypass
2328 * because of optional transport mode, or next index of the mathced secpath
2329 * state with the template.
2330 * -1 is returned when no matching template is found.
2331 * Otherwise "-2 - errored_index" is returned.
2334 xfrm_policy_ok(const struct xfrm_tmpl *tmpl, const struct sec_path *sp, int start,
2335 unsigned short family)
2339 if (tmpl->optional) {
2340 if (tmpl->mode == XFRM_MODE_TRANSPORT)
2344 for (; idx < sp->len; idx++) {
2345 if (xfrm_state_ok(tmpl, sp->xvec[idx], family))
2347 if (sp->xvec[idx]->props.mode != XFRM_MODE_TRANSPORT) {
2356 int __xfrm_decode_session(struct sk_buff *skb, struct flowi *fl,
2357 unsigned int family, int reverse)
2359 const struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
2362 if (unlikely(afinfo == NULL))
2363 return -EAFNOSUPPORT;
2365 afinfo->decode_session(skb, fl, reverse);
2366 err = security_xfrm_decode_session(skb, &fl->flowi_secid);
2370 EXPORT_SYMBOL(__xfrm_decode_session);
2372 static inline int secpath_has_nontransport(const struct sec_path *sp, int k, int *idxp)
2374 for (; k < sp->len; k++) {
2375 if (sp->xvec[k]->props.mode != XFRM_MODE_TRANSPORT) {
2384 int __xfrm_policy_check(struct sock *sk, int dir, struct sk_buff *skb,
2385 unsigned short family)
2387 struct net *net = dev_net(skb->dev);
2388 struct xfrm_policy *pol;
2389 struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
2397 reverse = dir & ~XFRM_POLICY_MASK;
2398 dir &= XFRM_POLICY_MASK;
2400 if (__xfrm_decode_session(skb, &fl, family, reverse) < 0) {
2401 XFRM_INC_STATS(net, LINUX_MIB_XFRMINHDRERROR);
2405 nf_nat_decode_session(skb, &fl, family);
2407 /* First, check used SA against their selectors. */
2411 for (i = skb->sp->len-1; i >= 0; i--) {
2412 struct xfrm_state *x = skb->sp->xvec[i];
2413 if (!xfrm_selector_match(&x->sel, &fl, family)) {
2414 XFRM_INC_STATS(net, LINUX_MIB_XFRMINSTATEMISMATCH);
2421 sk = sk_to_full_sk(sk);
2422 if (sk && sk->sk_policy[dir]) {
2423 pol = xfrm_sk_policy_lookup(sk, dir, &fl, family);
2425 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
2431 pol = xfrm_policy_lookup(net, &fl, family, dir);
2434 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
2439 if (skb->sp && secpath_has_nontransport(skb->sp, 0, &xerr_idx)) {
2440 xfrm_secpath_reject(xerr_idx, skb, &fl);
2441 XFRM_INC_STATS(net, LINUX_MIB_XFRMINNOPOLS);
2447 pol->curlft.use_time = get_seconds();
2451 #ifdef CONFIG_XFRM_SUB_POLICY
2452 if (pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
2453 pols[1] = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN,
2457 if (IS_ERR(pols[1])) {
2458 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
2461 pols[1]->curlft.use_time = get_seconds();
2467 if (pol->action == XFRM_POLICY_ALLOW) {
2468 struct sec_path *sp;
2469 static struct sec_path dummy;
2470 struct xfrm_tmpl *tp[XFRM_MAX_DEPTH];
2471 struct xfrm_tmpl *stp[XFRM_MAX_DEPTH];
2472 struct xfrm_tmpl **tpp = tp;
2476 if ((sp = skb->sp) == NULL)
2479 for (pi = 0; pi < npols; pi++) {
2480 if (pols[pi] != pol &&
2481 pols[pi]->action != XFRM_POLICY_ALLOW) {
2482 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
2485 if (ti + pols[pi]->xfrm_nr >= XFRM_MAX_DEPTH) {
2486 XFRM_INC_STATS(net, LINUX_MIB_XFRMINBUFFERERROR);
2489 for (i = 0; i < pols[pi]->xfrm_nr; i++)
2490 tpp[ti++] = &pols[pi]->xfrm_vec[i];
2494 xfrm_tmpl_sort(stp, tpp, xfrm_nr, family, net);
2498 /* For each tunnel xfrm, find the first matching tmpl.
2499 * For each tmpl before that, find corresponding xfrm.
2500 * Order is _important_. Later we will implement
2501 * some barriers, but at the moment barriers
2502 * are implied between each two transformations.
2504 for (i = xfrm_nr-1, k = 0; i >= 0; i--) {
2505 k = xfrm_policy_ok(tpp[i], sp, k, family);
2508 /* "-2 - errored_index" returned */
2510 XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
2515 if (secpath_has_nontransport(sp, k, &xerr_idx)) {
2516 XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
2520 xfrm_pols_put(pols, npols);
2523 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
2526 xfrm_secpath_reject(xerr_idx, skb, &fl);
2528 xfrm_pols_put(pols, npols);
2531 EXPORT_SYMBOL(__xfrm_policy_check);
2533 int __xfrm_route_forward(struct sk_buff *skb, unsigned short family)
2535 struct net *net = dev_net(skb->dev);
2537 struct dst_entry *dst;
2540 if (xfrm_decode_session(skb, &fl, family) < 0) {
2541 XFRM_INC_STATS(net, LINUX_MIB_XFRMFWDHDRERROR);
2547 dst = xfrm_lookup(net, skb_dst(skb), &fl, NULL, XFRM_LOOKUP_QUEUE);
2552 skb_dst_set(skb, dst);
2555 EXPORT_SYMBOL(__xfrm_route_forward);
2557 /* Optimize later using cookies and generation ids. */
2559 static struct dst_entry *xfrm_dst_check(struct dst_entry *dst, u32 cookie)
2561 /* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
2562 * to DST_OBSOLETE_FORCE_CHK to force all XFRM destinations to
2563 * get validated by dst_ops->check on every use. We do this
2564 * because when a normal route referenced by an XFRM dst is
2565 * obsoleted we do not go looking around for all parent
2566 * referencing XFRM dsts so that we can invalidate them. It
2567 * is just too much work. Instead we make the checks here on
2568 * every use. For example:
2570 * XFRM dst A --> IPv4 dst X
2572 * X is the "xdst->route" of A (X is also the "dst->path" of A
2573 * in this example). If X is marked obsolete, "A" will not
2574 * notice. That's what we are validating here via the
2575 * stale_bundle() check.
2577 * When a dst is removed from the fib tree, DST_OBSOLETE_DEAD will
2579 * This will force stale_bundle() to fail on any xdst bundle with
2580 * this dst linked in it.
2582 if (dst->obsolete < 0 && !stale_bundle(dst))
2588 static int stale_bundle(struct dst_entry *dst)
2590 return !xfrm_bundle_ok((struct xfrm_dst *)dst);
2593 void xfrm_dst_ifdown(struct dst_entry *dst, struct net_device *dev)
2595 while ((dst = xfrm_dst_child(dst)) && dst->xfrm && dst->dev == dev) {
2596 dst->dev = dev_net(dev)->loopback_dev;
2601 EXPORT_SYMBOL(xfrm_dst_ifdown);
2603 static void xfrm_link_failure(struct sk_buff *skb)
2605 /* Impossible. Such dst must be popped before reaches point of failure. */
2608 static struct dst_entry *xfrm_negative_advice(struct dst_entry *dst)
2611 if (dst->obsolete) {
2619 static void xfrm_init_pmtu(struct xfrm_dst **bundle, int nr)
2622 struct xfrm_dst *xdst = bundle[nr];
2623 u32 pmtu, route_mtu_cached;
2624 struct dst_entry *dst;
2627 pmtu = dst_mtu(xfrm_dst_child(dst));
2628 xdst->child_mtu_cached = pmtu;
2630 pmtu = xfrm_state_mtu(dst->xfrm, pmtu);
2632 route_mtu_cached = dst_mtu(xdst->route);
2633 xdst->route_mtu_cached = route_mtu_cached;
2635 if (pmtu > route_mtu_cached)
2636 pmtu = route_mtu_cached;
2638 dst_metric_set(dst, RTAX_MTU, pmtu);
2642 /* Check that the bundle accepts the flow and its components are
2646 static int xfrm_bundle_ok(struct xfrm_dst *first)
2648 struct xfrm_dst *bundle[XFRM_MAX_DEPTH];
2649 struct dst_entry *dst = &first->u.dst;
2650 struct xfrm_dst *xdst;
2654 if (!dst_check(xfrm_dst_path(dst), ((struct xfrm_dst *)dst)->path_cookie) ||
2655 (dst->dev && !netif_running(dst->dev)))
2658 if (dst->flags & DST_XFRM_QUEUE)
2661 start_from = nr = 0;
2663 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
2665 if (dst->xfrm->km.state != XFRM_STATE_VALID)
2667 if (xdst->xfrm_genid != dst->xfrm->genid)
2669 if (xdst->num_pols > 0 &&
2670 xdst->policy_genid != atomic_read(&xdst->pols[0]->genid))
2673 bundle[nr++] = xdst;
2675 mtu = dst_mtu(xfrm_dst_child(dst));
2676 if (xdst->child_mtu_cached != mtu) {
2678 xdst->child_mtu_cached = mtu;
2681 if (!dst_check(xdst->route, xdst->route_cookie))
2683 mtu = dst_mtu(xdst->route);
2684 if (xdst->route_mtu_cached != mtu) {
2686 xdst->route_mtu_cached = mtu;
2689 dst = xfrm_dst_child(dst);
2690 } while (dst->xfrm);
2692 if (likely(!start_from))
2695 xdst = bundle[start_from - 1];
2696 mtu = xdst->child_mtu_cached;
2697 while (start_from--) {
2700 mtu = xfrm_state_mtu(dst->xfrm, mtu);
2701 if (mtu > xdst->route_mtu_cached)
2702 mtu = xdst->route_mtu_cached;
2703 dst_metric_set(dst, RTAX_MTU, mtu);
2707 xdst = bundle[start_from - 1];
2708 xdst->child_mtu_cached = mtu;
2714 static unsigned int xfrm_default_advmss(const struct dst_entry *dst)
2716 return dst_metric_advmss(xfrm_dst_path(dst));
2719 static unsigned int xfrm_mtu(const struct dst_entry *dst)
2721 unsigned int mtu = dst_metric_raw(dst, RTAX_MTU);
2723 return mtu ? : dst_mtu(xfrm_dst_path(dst));
2726 static const void *xfrm_get_dst_nexthop(const struct dst_entry *dst,
2730 const struct xfrm_state *xfrm = dst->xfrm;
2732 if (xfrm->props.mode == XFRM_MODE_TRANSPORT)
2734 if (xfrm->type->flags & XFRM_TYPE_REMOTE_COADDR)
2735 daddr = xfrm->coaddr;
2736 else if (!(xfrm->type->flags & XFRM_TYPE_LOCAL_COADDR))
2737 daddr = &xfrm->id.daddr;
2739 dst = xfrm_dst_child(dst);
2744 static struct neighbour *xfrm_neigh_lookup(const struct dst_entry *dst,
2745 struct sk_buff *skb,
2748 const struct dst_entry *path = xfrm_dst_path(dst);
2751 daddr = xfrm_get_dst_nexthop(dst, daddr);
2752 return path->ops->neigh_lookup(path, skb, daddr);
2755 static void xfrm_confirm_neigh(const struct dst_entry *dst, const void *daddr)
2757 const struct dst_entry *path = xfrm_dst_path(dst);
2759 daddr = xfrm_get_dst_nexthop(dst, daddr);
2760 path->ops->confirm_neigh(path, daddr);
2763 int xfrm_policy_register_afinfo(const struct xfrm_policy_afinfo *afinfo, int family)
2767 if (WARN_ON(family >= ARRAY_SIZE(xfrm_policy_afinfo)))
2768 return -EAFNOSUPPORT;
2770 spin_lock(&xfrm_policy_afinfo_lock);
2771 if (unlikely(xfrm_policy_afinfo[family] != NULL))
2774 struct dst_ops *dst_ops = afinfo->dst_ops;
2775 if (likely(dst_ops->kmem_cachep == NULL))
2776 dst_ops->kmem_cachep = xfrm_dst_cache;
2777 if (likely(dst_ops->check == NULL))
2778 dst_ops->check = xfrm_dst_check;
2779 if (likely(dst_ops->default_advmss == NULL))
2780 dst_ops->default_advmss = xfrm_default_advmss;
2781 if (likely(dst_ops->mtu == NULL))
2782 dst_ops->mtu = xfrm_mtu;
2783 if (likely(dst_ops->negative_advice == NULL))
2784 dst_ops->negative_advice = xfrm_negative_advice;
2785 if (likely(dst_ops->link_failure == NULL))
2786 dst_ops->link_failure = xfrm_link_failure;
2787 if (likely(dst_ops->neigh_lookup == NULL))
2788 dst_ops->neigh_lookup = xfrm_neigh_lookup;
2789 if (likely(!dst_ops->confirm_neigh))
2790 dst_ops->confirm_neigh = xfrm_confirm_neigh;
2791 rcu_assign_pointer(xfrm_policy_afinfo[family], afinfo);
2793 spin_unlock(&xfrm_policy_afinfo_lock);
2797 EXPORT_SYMBOL(xfrm_policy_register_afinfo);
2799 void xfrm_policy_unregister_afinfo(const struct xfrm_policy_afinfo *afinfo)
2801 struct dst_ops *dst_ops = afinfo->dst_ops;
2804 for (i = 0; i < ARRAY_SIZE(xfrm_policy_afinfo); i++) {
2805 if (xfrm_policy_afinfo[i] != afinfo)
2807 RCU_INIT_POINTER(xfrm_policy_afinfo[i], NULL);
2813 dst_ops->kmem_cachep = NULL;
2814 dst_ops->check = NULL;
2815 dst_ops->negative_advice = NULL;
2816 dst_ops->link_failure = NULL;
2818 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo);
2820 #ifdef CONFIG_XFRM_STATISTICS
2821 static int __net_init xfrm_statistics_init(struct net *net)
2824 net->mib.xfrm_statistics = alloc_percpu(struct linux_xfrm_mib);
2825 if (!net->mib.xfrm_statistics)
2827 rv = xfrm_proc_init(net);
2829 free_percpu(net->mib.xfrm_statistics);
2833 static void xfrm_statistics_fini(struct net *net)
2835 xfrm_proc_fini(net);
2836 free_percpu(net->mib.xfrm_statistics);
2839 static int __net_init xfrm_statistics_init(struct net *net)
2844 static void xfrm_statistics_fini(struct net *net)
2849 static int __net_init xfrm_policy_init(struct net *net)
2851 unsigned int hmask, sz;
2854 if (net_eq(net, &init_net))
2855 xfrm_dst_cache = kmem_cache_create("xfrm_dst_cache",
2856 sizeof(struct xfrm_dst),
2857 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC,
2861 sz = (hmask+1) * sizeof(struct hlist_head);
2863 net->xfrm.policy_byidx = xfrm_hash_alloc(sz);
2864 if (!net->xfrm.policy_byidx)
2866 net->xfrm.policy_idx_hmask = hmask;
2868 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
2869 struct xfrm_policy_hash *htab;
2871 net->xfrm.policy_count[dir] = 0;
2872 net->xfrm.policy_count[XFRM_POLICY_MAX + dir] = 0;
2873 INIT_HLIST_HEAD(&net->xfrm.policy_inexact[dir]);
2875 htab = &net->xfrm.policy_bydst[dir];
2876 htab->table = xfrm_hash_alloc(sz);
2879 htab->hmask = hmask;
2885 net->xfrm.policy_hthresh.lbits4 = 32;
2886 net->xfrm.policy_hthresh.rbits4 = 32;
2887 net->xfrm.policy_hthresh.lbits6 = 128;
2888 net->xfrm.policy_hthresh.rbits6 = 128;
2890 seqlock_init(&net->xfrm.policy_hthresh.lock);
2892 INIT_LIST_HEAD(&net->xfrm.policy_all);
2893 INIT_WORK(&net->xfrm.policy_hash_work, xfrm_hash_resize);
2894 INIT_WORK(&net->xfrm.policy_hthresh.work, xfrm_hash_rebuild);
2895 if (net_eq(net, &init_net))
2900 for (dir--; dir >= 0; dir--) {
2901 struct xfrm_policy_hash *htab;
2903 htab = &net->xfrm.policy_bydst[dir];
2904 xfrm_hash_free(htab->table, sz);
2906 xfrm_hash_free(net->xfrm.policy_byidx, sz);
2911 static void xfrm_policy_fini(struct net *net)
2916 flush_work(&net->xfrm.policy_hash_work);
2917 #ifdef CONFIG_XFRM_SUB_POLICY
2918 xfrm_policy_flush(net, XFRM_POLICY_TYPE_SUB, false);
2920 xfrm_policy_flush(net, XFRM_POLICY_TYPE_MAIN, false);
2922 WARN_ON(!list_empty(&net->xfrm.policy_all));
2924 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
2925 struct xfrm_policy_hash *htab;
2927 WARN_ON(!hlist_empty(&net->xfrm.policy_inexact[dir]));
2929 htab = &net->xfrm.policy_bydst[dir];
2930 sz = (htab->hmask + 1) * sizeof(struct hlist_head);
2931 WARN_ON(!hlist_empty(htab->table));
2932 xfrm_hash_free(htab->table, sz);
2935 sz = (net->xfrm.policy_idx_hmask + 1) * sizeof(struct hlist_head);
2936 WARN_ON(!hlist_empty(net->xfrm.policy_byidx));
2937 xfrm_hash_free(net->xfrm.policy_byidx, sz);
2940 static int __net_init xfrm_net_init(struct net *net)
2944 /* Initialize the per-net locks here */
2945 spin_lock_init(&net->xfrm.xfrm_state_lock);
2946 spin_lock_init(&net->xfrm.xfrm_policy_lock);
2947 mutex_init(&net->xfrm.xfrm_cfg_mutex);
2949 rv = xfrm_statistics_init(net);
2951 goto out_statistics;
2952 rv = xfrm_state_init(net);
2955 rv = xfrm_policy_init(net);
2958 rv = xfrm_sysctl_init(net);
2965 xfrm_policy_fini(net);
2967 xfrm_state_fini(net);
2969 xfrm_statistics_fini(net);
2974 static void __net_exit xfrm_net_exit(struct net *net)
2976 xfrm_sysctl_fini(net);
2977 xfrm_policy_fini(net);
2978 xfrm_state_fini(net);
2979 xfrm_statistics_fini(net);
2982 static struct pernet_operations __net_initdata xfrm_net_ops = {
2983 .init = xfrm_net_init,
2984 .exit = xfrm_net_exit,
2987 void __init xfrm_init(void)
2991 xfrm_pcpu_work = kmalloc_array(NR_CPUS, sizeof(*xfrm_pcpu_work),
2993 BUG_ON(!xfrm_pcpu_work);
2995 for (i = 0; i < NR_CPUS; i++)
2996 INIT_WORK(&xfrm_pcpu_work[i], xfrm_pcpu_work_fn);
2998 register_pernet_subsys(&xfrm_net_ops);
2999 seqcount_init(&xfrm_policy_hash_generation);
3003 #ifdef CONFIG_AUDITSYSCALL
3004 static void xfrm_audit_common_policyinfo(struct xfrm_policy *xp,
3005 struct audit_buffer *audit_buf)
3007 struct xfrm_sec_ctx *ctx = xp->security;
3008 struct xfrm_selector *sel = &xp->selector;
3011 audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
3012 ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
3014 switch (sel->family) {
3016 audit_log_format(audit_buf, " src=%pI4", &sel->saddr.a4);
3017 if (sel->prefixlen_s != 32)
3018 audit_log_format(audit_buf, " src_prefixlen=%d",
3020 audit_log_format(audit_buf, " dst=%pI4", &sel->daddr.a4);
3021 if (sel->prefixlen_d != 32)
3022 audit_log_format(audit_buf, " dst_prefixlen=%d",
3026 audit_log_format(audit_buf, " src=%pI6", sel->saddr.a6);
3027 if (sel->prefixlen_s != 128)
3028 audit_log_format(audit_buf, " src_prefixlen=%d",
3030 audit_log_format(audit_buf, " dst=%pI6", sel->daddr.a6);
3031 if (sel->prefixlen_d != 128)
3032 audit_log_format(audit_buf, " dst_prefixlen=%d",
3038 void xfrm_audit_policy_add(struct xfrm_policy *xp, int result, bool task_valid)
3040 struct audit_buffer *audit_buf;
3042 audit_buf = xfrm_audit_start("SPD-add");
3043 if (audit_buf == NULL)
3045 xfrm_audit_helper_usrinfo(task_valid, audit_buf);
3046 audit_log_format(audit_buf, " res=%u", result);
3047 xfrm_audit_common_policyinfo(xp, audit_buf);
3048 audit_log_end(audit_buf);
3050 EXPORT_SYMBOL_GPL(xfrm_audit_policy_add);
3052 void xfrm_audit_policy_delete(struct xfrm_policy *xp, int result,
3055 struct audit_buffer *audit_buf;
3057 audit_buf = xfrm_audit_start("SPD-delete");
3058 if (audit_buf == NULL)
3060 xfrm_audit_helper_usrinfo(task_valid, audit_buf);
3061 audit_log_format(audit_buf, " res=%u", result);
3062 xfrm_audit_common_policyinfo(xp, audit_buf);
3063 audit_log_end(audit_buf);
3065 EXPORT_SYMBOL_GPL(xfrm_audit_policy_delete);
3068 #ifdef CONFIG_XFRM_MIGRATE
3069 static bool xfrm_migrate_selector_match(const struct xfrm_selector *sel_cmp,
3070 const struct xfrm_selector *sel_tgt)
3072 if (sel_cmp->proto == IPSEC_ULPROTO_ANY) {
3073 if (sel_tgt->family == sel_cmp->family &&
3074 xfrm_addr_equal(&sel_tgt->daddr, &sel_cmp->daddr,
3076 xfrm_addr_equal(&sel_tgt->saddr, &sel_cmp->saddr,
3078 sel_tgt->prefixlen_d == sel_cmp->prefixlen_d &&
3079 sel_tgt->prefixlen_s == sel_cmp->prefixlen_s) {
3083 if (memcmp(sel_tgt, sel_cmp, sizeof(*sel_tgt)) == 0) {
3090 static struct xfrm_policy *xfrm_migrate_policy_find(const struct xfrm_selector *sel,
3091 u8 dir, u8 type, struct net *net)
3093 struct xfrm_policy *pol, *ret = NULL;
3094 struct hlist_head *chain;
3097 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
3098 chain = policy_hash_direct(net, &sel->daddr, &sel->saddr, sel->family, dir);
3099 hlist_for_each_entry(pol, chain, bydst) {
3100 if (xfrm_migrate_selector_match(sel, &pol->selector) &&
3101 pol->type == type) {
3103 priority = ret->priority;
3107 chain = &net->xfrm.policy_inexact[dir];
3108 hlist_for_each_entry(pol, chain, bydst) {
3109 if ((pol->priority >= priority) && ret)
3112 if (xfrm_migrate_selector_match(sel, &pol->selector) &&
3113 pol->type == type) {
3121 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
3126 static int migrate_tmpl_match(const struct xfrm_migrate *m, const struct xfrm_tmpl *t)
3130 if (t->mode == m->mode && t->id.proto == m->proto &&
3131 (m->reqid == 0 || t->reqid == m->reqid)) {
3133 case XFRM_MODE_TUNNEL:
3134 case XFRM_MODE_BEET:
3135 if (xfrm_addr_equal(&t->id.daddr, &m->old_daddr,
3137 xfrm_addr_equal(&t->saddr, &m->old_saddr,
3142 case XFRM_MODE_TRANSPORT:
3143 /* in case of transport mode, template does not store
3144 any IP addresses, hence we just compare mode and
3155 /* update endpoint address(es) of template(s) */
3156 static int xfrm_policy_migrate(struct xfrm_policy *pol,
3157 struct xfrm_migrate *m, int num_migrate)
3159 struct xfrm_migrate *mp;
3162 write_lock_bh(&pol->lock);
3163 if (unlikely(pol->walk.dead)) {
3164 /* target policy has been deleted */
3165 write_unlock_bh(&pol->lock);
3169 for (i = 0; i < pol->xfrm_nr; i++) {
3170 for (j = 0, mp = m; j < num_migrate; j++, mp++) {
3171 if (!migrate_tmpl_match(mp, &pol->xfrm_vec[i]))
3174 if (pol->xfrm_vec[i].mode != XFRM_MODE_TUNNEL &&
3175 pol->xfrm_vec[i].mode != XFRM_MODE_BEET)
3177 /* update endpoints */
3178 memcpy(&pol->xfrm_vec[i].id.daddr, &mp->new_daddr,
3179 sizeof(pol->xfrm_vec[i].id.daddr));
3180 memcpy(&pol->xfrm_vec[i].saddr, &mp->new_saddr,
3181 sizeof(pol->xfrm_vec[i].saddr));
3182 pol->xfrm_vec[i].encap_family = mp->new_family;
3184 atomic_inc(&pol->genid);
3188 write_unlock_bh(&pol->lock);
3196 static int xfrm_migrate_check(const struct xfrm_migrate *m, int num_migrate)
3200 if (num_migrate < 1 || num_migrate > XFRM_MAX_DEPTH)
3203 for (i = 0; i < num_migrate; i++) {
3204 if (xfrm_addr_any(&m[i].new_daddr, m[i].new_family) ||
3205 xfrm_addr_any(&m[i].new_saddr, m[i].new_family))
3208 /* check if there is any duplicated entry */
3209 for (j = i + 1; j < num_migrate; j++) {
3210 if (!memcmp(&m[i].old_daddr, &m[j].old_daddr,
3211 sizeof(m[i].old_daddr)) &&
3212 !memcmp(&m[i].old_saddr, &m[j].old_saddr,
3213 sizeof(m[i].old_saddr)) &&
3214 m[i].proto == m[j].proto &&
3215 m[i].mode == m[j].mode &&
3216 m[i].reqid == m[j].reqid &&
3217 m[i].old_family == m[j].old_family)
3225 int xfrm_migrate(const struct xfrm_selector *sel, u8 dir, u8 type,
3226 struct xfrm_migrate *m, int num_migrate,
3227 struct xfrm_kmaddress *k, struct net *net,
3228 struct xfrm_encap_tmpl *encap)
3230 int i, err, nx_cur = 0, nx_new = 0;
3231 struct xfrm_policy *pol = NULL;
3232 struct xfrm_state *x, *xc;
3233 struct xfrm_state *x_cur[XFRM_MAX_DEPTH];
3234 struct xfrm_state *x_new[XFRM_MAX_DEPTH];
3235 struct xfrm_migrate *mp;
3237 /* Stage 0 - sanity checks */
3238 if ((err = xfrm_migrate_check(m, num_migrate)) < 0)
3241 if (dir >= XFRM_POLICY_MAX) {
3246 /* Stage 1 - find policy */
3247 if ((pol = xfrm_migrate_policy_find(sel, dir, type, net)) == NULL) {
3252 /* Stage 2 - find and update state(s) */
3253 for (i = 0, mp = m; i < num_migrate; i++, mp++) {
3254 if ((x = xfrm_migrate_state_find(mp, net))) {
3257 xc = xfrm_state_migrate(x, mp, encap);
3268 /* Stage 3 - update policy */
3269 if ((err = xfrm_policy_migrate(pol, m, num_migrate)) < 0)
3272 /* Stage 4 - delete old state(s) */
3274 xfrm_states_put(x_cur, nx_cur);
3275 xfrm_states_delete(x_cur, nx_cur);
3278 /* Stage 5 - announce */
3279 km_migrate(sel, dir, type, m, num_migrate, k, encap);
3291 xfrm_states_put(x_cur, nx_cur);
3293 xfrm_states_delete(x_new, nx_new);
3297 EXPORT_SYMBOL(xfrm_migrate);