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/audit.h>
31 #ifdef CONFIG_XFRM_STATISTICS
35 #include "xfrm_hash.h"
37 DEFINE_MUTEX(xfrm_cfg_mutex);
38 EXPORT_SYMBOL(xfrm_cfg_mutex);
40 static DEFINE_RWLOCK(xfrm_policy_lock);
42 static DEFINE_RWLOCK(xfrm_policy_afinfo_lock);
43 static struct xfrm_policy_afinfo *xfrm_policy_afinfo[NPROTO];
45 static struct kmem_cache *xfrm_dst_cache __read_mostly;
47 static HLIST_HEAD(xfrm_policy_gc_list);
48 static DEFINE_SPINLOCK(xfrm_policy_gc_lock);
50 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family);
51 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo);
52 static void xfrm_init_pmtu(struct dst_entry *dst);
54 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
58 __xfrm4_selector_match(struct xfrm_selector *sel, struct flowi *fl)
60 return addr_match(&fl->fl4_dst, &sel->daddr, sel->prefixlen_d) &&
61 addr_match(&fl->fl4_src, &sel->saddr, sel->prefixlen_s) &&
62 !((xfrm_flowi_dport(fl) ^ sel->dport) & sel->dport_mask) &&
63 !((xfrm_flowi_sport(fl) ^ sel->sport) & sel->sport_mask) &&
64 (fl->proto == sel->proto || !sel->proto) &&
65 (fl->oif == sel->ifindex || !sel->ifindex);
69 __xfrm6_selector_match(struct xfrm_selector *sel, struct flowi *fl)
71 return addr_match(&fl->fl6_dst, &sel->daddr, sel->prefixlen_d) &&
72 addr_match(&fl->fl6_src, &sel->saddr, sel->prefixlen_s) &&
73 !((xfrm_flowi_dport(fl) ^ sel->dport) & sel->dport_mask) &&
74 !((xfrm_flowi_sport(fl) ^ sel->sport) & sel->sport_mask) &&
75 (fl->proto == sel->proto || !sel->proto) &&
76 (fl->oif == sel->ifindex || !sel->ifindex);
79 int xfrm_selector_match(struct xfrm_selector *sel, struct flowi *fl,
80 unsigned short family)
84 return __xfrm4_selector_match(sel, fl);
86 return __xfrm6_selector_match(sel, fl);
91 static inline struct dst_entry *__xfrm_dst_lookup(struct net *net, int tos,
92 xfrm_address_t *saddr,
93 xfrm_address_t *daddr,
96 struct xfrm_policy_afinfo *afinfo;
97 struct dst_entry *dst;
99 afinfo = xfrm_policy_get_afinfo(family);
100 if (unlikely(afinfo == NULL))
101 return ERR_PTR(-EAFNOSUPPORT);
103 dst = afinfo->dst_lookup(net, tos, saddr, daddr);
105 xfrm_policy_put_afinfo(afinfo);
110 static inline struct dst_entry *xfrm_dst_lookup(struct xfrm_state *x, int tos,
111 xfrm_address_t *prev_saddr,
112 xfrm_address_t *prev_daddr,
115 struct net *net = xs_net(x);
116 xfrm_address_t *saddr = &x->props.saddr;
117 xfrm_address_t *daddr = &x->id.daddr;
118 struct dst_entry *dst;
120 if (x->type->flags & XFRM_TYPE_LOCAL_COADDR) {
124 if (x->type->flags & XFRM_TYPE_REMOTE_COADDR) {
129 dst = __xfrm_dst_lookup(net, tos, saddr, daddr, family);
132 if (prev_saddr != saddr)
133 memcpy(prev_saddr, saddr, sizeof(*prev_saddr));
134 if (prev_daddr != daddr)
135 memcpy(prev_daddr, daddr, sizeof(*prev_daddr));
141 static inline unsigned long make_jiffies(long secs)
143 if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
144 return MAX_SCHEDULE_TIMEOUT-1;
149 static void xfrm_policy_timer(unsigned long data)
151 struct xfrm_policy *xp = (struct xfrm_policy*)data;
152 unsigned long now = get_seconds();
153 long next = LONG_MAX;
157 read_lock(&xp->lock);
162 dir = xfrm_policy_id2dir(xp->index);
164 if (xp->lft.hard_add_expires_seconds) {
165 long tmo = xp->lft.hard_add_expires_seconds +
166 xp->curlft.add_time - now;
172 if (xp->lft.hard_use_expires_seconds) {
173 long tmo = xp->lft.hard_use_expires_seconds +
174 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
180 if (xp->lft.soft_add_expires_seconds) {
181 long tmo = xp->lft.soft_add_expires_seconds +
182 xp->curlft.add_time - now;
185 tmo = XFRM_KM_TIMEOUT;
190 if (xp->lft.soft_use_expires_seconds) {
191 long tmo = xp->lft.soft_use_expires_seconds +
192 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
195 tmo = XFRM_KM_TIMEOUT;
202 km_policy_expired(xp, dir, 0, 0);
203 if (next != LONG_MAX &&
204 !mod_timer(&xp->timer, jiffies + make_jiffies(next)))
208 read_unlock(&xp->lock);
213 read_unlock(&xp->lock);
214 if (!xfrm_policy_delete(xp, dir))
215 km_policy_expired(xp, dir, 1, 0);
220 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
224 struct xfrm_policy *xfrm_policy_alloc(struct net *net, gfp_t gfp)
226 struct xfrm_policy *policy;
228 policy = kzalloc(sizeof(struct xfrm_policy), gfp);
231 write_pnet(&policy->xp_net, net);
232 INIT_LIST_HEAD(&policy->walk.all);
233 INIT_HLIST_NODE(&policy->bydst);
234 INIT_HLIST_NODE(&policy->byidx);
235 rwlock_init(&policy->lock);
236 atomic_set(&policy->refcnt, 1);
237 setup_timer(&policy->timer, xfrm_policy_timer,
238 (unsigned long)policy);
242 EXPORT_SYMBOL(xfrm_policy_alloc);
244 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
246 void xfrm_policy_destroy(struct xfrm_policy *policy)
248 BUG_ON(!policy->walk.dead);
250 BUG_ON(policy->bundles);
252 if (del_timer(&policy->timer))
255 security_xfrm_policy_free(policy->security);
258 EXPORT_SYMBOL(xfrm_policy_destroy);
260 static void xfrm_policy_gc_kill(struct xfrm_policy *policy)
262 struct dst_entry *dst;
264 while ((dst = policy->bundles) != NULL) {
265 policy->bundles = dst->next;
269 if (del_timer(&policy->timer))
270 atomic_dec(&policy->refcnt);
272 if (atomic_read(&policy->refcnt) > 1)
275 xfrm_pol_put(policy);
278 static void xfrm_policy_gc_task(struct work_struct *work)
280 struct xfrm_policy *policy;
281 struct hlist_node *entry, *tmp;
282 struct hlist_head gc_list;
284 spin_lock_bh(&xfrm_policy_gc_lock);
285 gc_list.first = xfrm_policy_gc_list.first;
286 INIT_HLIST_HEAD(&xfrm_policy_gc_list);
287 spin_unlock_bh(&xfrm_policy_gc_lock);
289 hlist_for_each_entry_safe(policy, entry, tmp, &gc_list, bydst)
290 xfrm_policy_gc_kill(policy);
292 static DECLARE_WORK(xfrm_policy_gc_work, xfrm_policy_gc_task);
294 /* Rule must be locked. Release descentant resources, announce
295 * entry dead. The rule must be unlinked from lists to the moment.
298 static void xfrm_policy_kill(struct xfrm_policy *policy)
302 write_lock_bh(&policy->lock);
303 dead = policy->walk.dead;
304 policy->walk.dead = 1;
305 write_unlock_bh(&policy->lock);
307 if (unlikely(dead)) {
312 spin_lock_bh(&xfrm_policy_gc_lock);
313 hlist_add_head(&policy->bydst, &xfrm_policy_gc_list);
314 spin_unlock_bh(&xfrm_policy_gc_lock);
316 schedule_work(&xfrm_policy_gc_work);
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 static struct hlist_head *policy_hash_bysel(struct net *net, struct xfrm_selector *sel, unsigned short family, int dir)
328 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
329 unsigned int hash = __sel_hash(sel, family, hmask);
331 return (hash == hmask + 1 ?
332 &net->xfrm.policy_inexact[dir] :
333 net->xfrm.policy_bydst[dir].table + hash);
336 static struct hlist_head *policy_hash_direct(struct net *net, xfrm_address_t *daddr, xfrm_address_t *saddr, unsigned short family, int dir)
338 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
339 unsigned int hash = __addr_hash(daddr, saddr, family, hmask);
341 return net->xfrm.policy_bydst[dir].table + hash;
344 static void xfrm_dst_hash_transfer(struct hlist_head *list,
345 struct hlist_head *ndsttable,
346 unsigned int nhashmask)
348 struct hlist_node *entry, *tmp, *entry0 = NULL;
349 struct xfrm_policy *pol;
353 hlist_for_each_entry_safe(pol, entry, tmp, list, bydst) {
356 h = __addr_hash(&pol->selector.daddr, &pol->selector.saddr,
357 pol->family, nhashmask);
360 hlist_add_head(&pol->bydst, ndsttable+h);
366 hlist_add_after(entry0, &pol->bydst);
370 if (!hlist_empty(list)) {
376 static void xfrm_idx_hash_transfer(struct hlist_head *list,
377 struct hlist_head *nidxtable,
378 unsigned int nhashmask)
380 struct hlist_node *entry, *tmp;
381 struct xfrm_policy *pol;
383 hlist_for_each_entry_safe(pol, entry, tmp, list, byidx) {
386 h = __idx_hash(pol->index, nhashmask);
387 hlist_add_head(&pol->byidx, nidxtable+h);
391 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask)
393 return ((old_hmask + 1) << 1) - 1;
396 static void xfrm_bydst_resize(struct net *net, int dir)
398 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
399 unsigned int nhashmask = xfrm_new_hash_mask(hmask);
400 unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
401 struct hlist_head *odst = net->xfrm.policy_bydst[dir].table;
402 struct hlist_head *ndst = xfrm_hash_alloc(nsize);
408 write_lock_bh(&xfrm_policy_lock);
410 for (i = hmask; i >= 0; i--)
411 xfrm_dst_hash_transfer(odst + i, ndst, nhashmask);
413 net->xfrm.policy_bydst[dir].table = ndst;
414 net->xfrm.policy_bydst[dir].hmask = nhashmask;
416 write_unlock_bh(&xfrm_policy_lock);
418 xfrm_hash_free(odst, (hmask + 1) * sizeof(struct hlist_head));
421 static void xfrm_byidx_resize(struct net *net, int total)
423 unsigned int hmask = net->xfrm.policy_idx_hmask;
424 unsigned int nhashmask = xfrm_new_hash_mask(hmask);
425 unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
426 struct hlist_head *oidx = net->xfrm.policy_byidx;
427 struct hlist_head *nidx = xfrm_hash_alloc(nsize);
433 write_lock_bh(&xfrm_policy_lock);
435 for (i = hmask; i >= 0; i--)
436 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask);
438 net->xfrm.policy_byidx = nidx;
439 net->xfrm.policy_idx_hmask = nhashmask;
441 write_unlock_bh(&xfrm_policy_lock);
443 xfrm_hash_free(oidx, (hmask + 1) * sizeof(struct hlist_head));
446 static inline int xfrm_bydst_should_resize(struct net *net, int dir, int *total)
448 unsigned int cnt = net->xfrm.policy_count[dir];
449 unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
454 if ((hmask + 1) < xfrm_policy_hashmax &&
461 static inline int xfrm_byidx_should_resize(struct net *net, int total)
463 unsigned int hmask = net->xfrm.policy_idx_hmask;
465 if ((hmask + 1) < xfrm_policy_hashmax &&
472 void xfrm_spd_getinfo(struct xfrmk_spdinfo *si)
474 read_lock_bh(&xfrm_policy_lock);
475 si->incnt = init_net.xfrm.policy_count[XFRM_POLICY_IN];
476 si->outcnt = init_net.xfrm.policy_count[XFRM_POLICY_OUT];
477 si->fwdcnt = init_net.xfrm.policy_count[XFRM_POLICY_FWD];
478 si->inscnt = init_net.xfrm.policy_count[XFRM_POLICY_IN+XFRM_POLICY_MAX];
479 si->outscnt = init_net.xfrm.policy_count[XFRM_POLICY_OUT+XFRM_POLICY_MAX];
480 si->fwdscnt = init_net.xfrm.policy_count[XFRM_POLICY_FWD+XFRM_POLICY_MAX];
481 si->spdhcnt = init_net.xfrm.policy_idx_hmask;
482 si->spdhmcnt = xfrm_policy_hashmax;
483 read_unlock_bh(&xfrm_policy_lock);
485 EXPORT_SYMBOL(xfrm_spd_getinfo);
487 static DEFINE_MUTEX(hash_resize_mutex);
488 static void xfrm_hash_resize(struct work_struct *work)
490 struct net *net = container_of(work, struct net, xfrm.policy_hash_work);
493 mutex_lock(&hash_resize_mutex);
496 for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
497 if (xfrm_bydst_should_resize(net, dir, &total))
498 xfrm_bydst_resize(net, dir);
500 if (xfrm_byidx_should_resize(net, total))
501 xfrm_byidx_resize(net, total);
503 mutex_unlock(&hash_resize_mutex);
506 /* Generate new index... KAME seems to generate them ordered by cost
507 * of an absolute inpredictability of ordering of rules. This will not pass. */
508 static u32 xfrm_gen_index(struct net *net, int dir)
510 static u32 idx_generator;
513 struct hlist_node *entry;
514 struct hlist_head *list;
515 struct xfrm_policy *p;
519 idx = (idx_generator | dir);
523 list = net->xfrm.policy_byidx + idx_hash(net, idx);
525 hlist_for_each_entry(p, entry, list, byidx) {
526 if (p->index == idx) {
536 static inline int selector_cmp(struct xfrm_selector *s1, struct xfrm_selector *s2)
538 u32 *p1 = (u32 *) s1;
539 u32 *p2 = (u32 *) s2;
540 int len = sizeof(struct xfrm_selector) / sizeof(u32);
543 for (i = 0; i < len; i++) {
551 int xfrm_policy_insert(int dir, struct xfrm_policy *policy, int excl)
553 struct net *net = xp_net(policy);
554 struct xfrm_policy *pol;
555 struct xfrm_policy *delpol;
556 struct hlist_head *chain;
557 struct hlist_node *entry, *newpos;
558 struct dst_entry *gc_list;
560 write_lock_bh(&xfrm_policy_lock);
561 chain = policy_hash_bysel(net, &policy->selector, policy->family, dir);
564 hlist_for_each_entry(pol, entry, chain, bydst) {
565 if (pol->type == policy->type &&
566 !selector_cmp(&pol->selector, &policy->selector) &&
567 xfrm_sec_ctx_match(pol->security, policy->security) &&
570 write_unlock_bh(&xfrm_policy_lock);
574 if (policy->priority > pol->priority)
576 } else if (policy->priority >= pol->priority) {
577 newpos = &pol->bydst;
584 hlist_add_after(newpos, &policy->bydst);
586 hlist_add_head(&policy->bydst, chain);
587 xfrm_pol_hold(policy);
588 net->xfrm.policy_count[dir]++;
589 atomic_inc(&flow_cache_genid);
591 __xfrm_policy_unlink(delpol, dir);
592 policy->index = delpol ? delpol->index : xfrm_gen_index(net, dir);
593 hlist_add_head(&policy->byidx, net->xfrm.policy_byidx+idx_hash(net, policy->index));
594 policy->curlft.add_time = get_seconds();
595 policy->curlft.use_time = 0;
596 if (!mod_timer(&policy->timer, jiffies + HZ))
597 xfrm_pol_hold(policy);
598 list_add(&policy->walk.all, &net->xfrm.policy_all);
599 write_unlock_bh(&xfrm_policy_lock);
602 xfrm_policy_kill(delpol);
603 else if (xfrm_bydst_should_resize(net, dir, NULL))
604 schedule_work(&net->xfrm.policy_hash_work);
606 read_lock_bh(&xfrm_policy_lock);
608 entry = &policy->bydst;
609 hlist_for_each_entry_continue(policy, entry, bydst) {
610 struct dst_entry *dst;
612 write_lock(&policy->lock);
613 dst = policy->bundles;
615 struct dst_entry *tail = dst;
618 tail->next = gc_list;
621 policy->bundles = NULL;
623 write_unlock(&policy->lock);
625 read_unlock_bh(&xfrm_policy_lock);
628 struct dst_entry *dst = gc_list;
636 EXPORT_SYMBOL(xfrm_policy_insert);
638 struct xfrm_policy *xfrm_policy_bysel_ctx(struct net *net, u8 type, int dir,
639 struct xfrm_selector *sel,
640 struct xfrm_sec_ctx *ctx, int delete,
643 struct xfrm_policy *pol, *ret;
644 struct hlist_head *chain;
645 struct hlist_node *entry;
648 write_lock_bh(&xfrm_policy_lock);
649 chain = policy_hash_bysel(net, sel, sel->family, dir);
651 hlist_for_each_entry(pol, entry, chain, bydst) {
652 if (pol->type == type &&
653 !selector_cmp(sel, &pol->selector) &&
654 xfrm_sec_ctx_match(ctx, pol->security)) {
657 *err = security_xfrm_policy_delete(
660 write_unlock_bh(&xfrm_policy_lock);
663 __xfrm_policy_unlink(pol, dir);
669 write_unlock_bh(&xfrm_policy_lock);
672 atomic_inc(&flow_cache_genid);
673 xfrm_policy_kill(ret);
677 EXPORT_SYMBOL(xfrm_policy_bysel_ctx);
679 struct xfrm_policy *xfrm_policy_byid(struct net *net, u8 type, int dir, u32 id,
680 int delete, int *err)
682 struct xfrm_policy *pol, *ret;
683 struct hlist_head *chain;
684 struct hlist_node *entry;
687 if (xfrm_policy_id2dir(id) != dir)
691 write_lock_bh(&xfrm_policy_lock);
692 chain = net->xfrm.policy_byidx + idx_hash(net, id);
694 hlist_for_each_entry(pol, entry, chain, byidx) {
695 if (pol->type == type && pol->index == id) {
698 *err = security_xfrm_policy_delete(
701 write_unlock_bh(&xfrm_policy_lock);
704 __xfrm_policy_unlink(pol, dir);
710 write_unlock_bh(&xfrm_policy_lock);
713 atomic_inc(&flow_cache_genid);
714 xfrm_policy_kill(ret);
718 EXPORT_SYMBOL(xfrm_policy_byid);
720 #ifdef CONFIG_SECURITY_NETWORK_XFRM
722 xfrm_policy_flush_secctx_check(struct net *net, u8 type, struct xfrm_audit *audit_info)
726 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
727 struct xfrm_policy *pol;
728 struct hlist_node *entry;
731 hlist_for_each_entry(pol, entry,
732 &net->xfrm.policy_inexact[dir], bydst) {
733 if (pol->type != type)
735 err = security_xfrm_policy_delete(pol->security);
737 xfrm_audit_policy_delete(pol, 0,
738 audit_info->loginuid,
739 audit_info->sessionid,
744 for (i = net->xfrm.policy_bydst[dir].hmask; i >= 0; i--) {
745 hlist_for_each_entry(pol, entry,
746 net->xfrm.policy_bydst[dir].table + i,
748 if (pol->type != type)
750 err = security_xfrm_policy_delete(
753 xfrm_audit_policy_delete(pol, 0,
754 audit_info->loginuid,
755 audit_info->sessionid,
766 xfrm_policy_flush_secctx_check(struct net *net, u8 type, struct xfrm_audit *audit_info)
772 int xfrm_policy_flush(struct net *net, u8 type, struct xfrm_audit *audit_info)
776 write_lock_bh(&xfrm_policy_lock);
778 err = xfrm_policy_flush_secctx_check(net, type, audit_info);
782 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
783 struct xfrm_policy *pol;
784 struct hlist_node *entry;
788 hlist_for_each_entry(pol, entry,
789 &net->xfrm.policy_inexact[dir], bydst) {
790 if (pol->type != type)
792 __xfrm_policy_unlink(pol, dir);
793 write_unlock_bh(&xfrm_policy_lock);
795 xfrm_audit_policy_delete(pol, 1, audit_info->loginuid,
796 audit_info->sessionid,
799 xfrm_policy_kill(pol);
801 write_lock_bh(&xfrm_policy_lock);
805 for (i = net->xfrm.policy_bydst[dir].hmask; i >= 0; i--) {
807 hlist_for_each_entry(pol, entry,
808 net->xfrm.policy_bydst[dir].table + i,
810 if (pol->type != type)
812 __xfrm_policy_unlink(pol, dir);
813 write_unlock_bh(&xfrm_policy_lock);
815 xfrm_audit_policy_delete(pol, 1,
816 audit_info->loginuid,
817 audit_info->sessionid,
819 xfrm_policy_kill(pol);
821 write_lock_bh(&xfrm_policy_lock);
827 atomic_inc(&flow_cache_genid);
829 write_unlock_bh(&xfrm_policy_lock);
832 EXPORT_SYMBOL(xfrm_policy_flush);
834 int xfrm_policy_walk(struct net *net, struct xfrm_policy_walk *walk,
835 int (*func)(struct xfrm_policy *, int, int, void*),
838 struct xfrm_policy *pol;
839 struct xfrm_policy_walk_entry *x;
842 if (walk->type >= XFRM_POLICY_TYPE_MAX &&
843 walk->type != XFRM_POLICY_TYPE_ANY)
846 if (list_empty(&walk->walk.all) && walk->seq != 0)
849 write_lock_bh(&xfrm_policy_lock);
850 if (list_empty(&walk->walk.all))
851 x = list_first_entry(&net->xfrm.policy_all, struct xfrm_policy_walk_entry, all);
853 x = list_entry(&walk->walk.all, struct xfrm_policy_walk_entry, all);
854 list_for_each_entry_from(x, &net->xfrm.policy_all, all) {
857 pol = container_of(x, struct xfrm_policy, walk);
858 if (walk->type != XFRM_POLICY_TYPE_ANY &&
859 walk->type != pol->type)
861 error = func(pol, xfrm_policy_id2dir(pol->index),
864 list_move_tail(&walk->walk.all, &x->all);
869 if (walk->seq == 0) {
873 list_del_init(&walk->walk.all);
875 write_unlock_bh(&xfrm_policy_lock);
878 EXPORT_SYMBOL(xfrm_policy_walk);
880 void xfrm_policy_walk_init(struct xfrm_policy_walk *walk, u8 type)
882 INIT_LIST_HEAD(&walk->walk.all);
887 EXPORT_SYMBOL(xfrm_policy_walk_init);
889 void xfrm_policy_walk_done(struct xfrm_policy_walk *walk)
891 if (list_empty(&walk->walk.all))
894 write_lock_bh(&xfrm_policy_lock);
895 list_del(&walk->walk.all);
896 write_unlock_bh(&xfrm_policy_lock);
898 EXPORT_SYMBOL(xfrm_policy_walk_done);
901 * Find policy to apply to this flow.
903 * Returns 0 if policy found, else an -errno.
905 static int xfrm_policy_match(struct xfrm_policy *pol, struct flowi *fl,
906 u8 type, u16 family, int dir)
908 struct xfrm_selector *sel = &pol->selector;
909 int match, ret = -ESRCH;
911 if (pol->family != family ||
915 match = xfrm_selector_match(sel, fl, family);
917 ret = security_xfrm_policy_lookup(pol->security, fl->secid,
923 static struct xfrm_policy *xfrm_policy_lookup_bytype(struct net *net, u8 type,
928 struct xfrm_policy *pol, *ret;
929 xfrm_address_t *daddr, *saddr;
930 struct hlist_node *entry;
931 struct hlist_head *chain;
934 daddr = xfrm_flowi_daddr(fl, family);
935 saddr = xfrm_flowi_saddr(fl, family);
936 if (unlikely(!daddr || !saddr))
939 read_lock_bh(&xfrm_policy_lock);
940 chain = policy_hash_direct(net, daddr, saddr, family, dir);
942 hlist_for_each_entry(pol, entry, chain, bydst) {
943 err = xfrm_policy_match(pol, fl, type, family, dir);
953 priority = ret->priority;
957 chain = &net->xfrm.policy_inexact[dir];
958 hlist_for_each_entry(pol, entry, chain, bydst) {
959 err = xfrm_policy_match(pol, fl, type, family, dir);
967 } else if (pol->priority < priority) {
975 read_unlock_bh(&xfrm_policy_lock);
980 static int xfrm_policy_lookup(struct net *net, struct flowi *fl, u16 family,
981 u8 dir, void **objp, atomic_t **obj_refp)
983 struct xfrm_policy *pol;
986 #ifdef CONFIG_XFRM_SUB_POLICY
987 pol = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_SUB, fl, family, dir);
995 pol = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN, fl, family, dir);
1000 #ifdef CONFIG_XFRM_SUB_POLICY
1003 if ((*objp = (void *) pol) != NULL)
1004 *obj_refp = &pol->refcnt;
1008 static inline int policy_to_flow_dir(int dir)
1010 if (XFRM_POLICY_IN == FLOW_DIR_IN &&
1011 XFRM_POLICY_OUT == FLOW_DIR_OUT &&
1012 XFRM_POLICY_FWD == FLOW_DIR_FWD)
1016 case XFRM_POLICY_IN:
1018 case XFRM_POLICY_OUT:
1019 return FLOW_DIR_OUT;
1020 case XFRM_POLICY_FWD:
1021 return FLOW_DIR_FWD;
1025 static struct xfrm_policy *xfrm_sk_policy_lookup(struct sock *sk, int dir, struct flowi *fl)
1027 struct xfrm_policy *pol;
1029 read_lock_bh(&xfrm_policy_lock);
1030 if ((pol = sk->sk_policy[dir]) != NULL) {
1031 int match = xfrm_selector_match(&pol->selector, fl,
1036 err = security_xfrm_policy_lookup(pol->security,
1038 policy_to_flow_dir(dir));
1041 else if (err == -ESRCH)
1048 read_unlock_bh(&xfrm_policy_lock);
1052 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir)
1054 struct net *net = xp_net(pol);
1055 struct hlist_head *chain = policy_hash_bysel(net, &pol->selector,
1058 list_add(&pol->walk.all, &net->xfrm.policy_all);
1059 hlist_add_head(&pol->bydst, chain);
1060 hlist_add_head(&pol->byidx, net->xfrm.policy_byidx+idx_hash(net, pol->index));
1061 net->xfrm.policy_count[dir]++;
1064 if (xfrm_bydst_should_resize(net, dir, NULL))
1065 schedule_work(&net->xfrm.policy_hash_work);
1068 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
1071 struct net *net = xp_net(pol);
1073 if (hlist_unhashed(&pol->bydst))
1076 hlist_del(&pol->bydst);
1077 hlist_del(&pol->byidx);
1078 list_del(&pol->walk.all);
1079 net->xfrm.policy_count[dir]--;
1084 int xfrm_policy_delete(struct xfrm_policy *pol, int dir)
1086 write_lock_bh(&xfrm_policy_lock);
1087 pol = __xfrm_policy_unlink(pol, dir);
1088 write_unlock_bh(&xfrm_policy_lock);
1090 if (dir < XFRM_POLICY_MAX)
1091 atomic_inc(&flow_cache_genid);
1092 xfrm_policy_kill(pol);
1097 EXPORT_SYMBOL(xfrm_policy_delete);
1099 int xfrm_sk_policy_insert(struct sock *sk, int dir, struct xfrm_policy *pol)
1101 struct net *net = xp_net(pol);
1102 struct xfrm_policy *old_pol;
1104 #ifdef CONFIG_XFRM_SUB_POLICY
1105 if (pol && pol->type != XFRM_POLICY_TYPE_MAIN)
1109 write_lock_bh(&xfrm_policy_lock);
1110 old_pol = sk->sk_policy[dir];
1111 sk->sk_policy[dir] = pol;
1113 pol->curlft.add_time = get_seconds();
1114 pol->index = xfrm_gen_index(net, XFRM_POLICY_MAX+dir);
1115 __xfrm_policy_link(pol, XFRM_POLICY_MAX+dir);
1118 __xfrm_policy_unlink(old_pol, XFRM_POLICY_MAX+dir);
1119 write_unlock_bh(&xfrm_policy_lock);
1122 xfrm_policy_kill(old_pol);
1127 static struct xfrm_policy *clone_policy(struct xfrm_policy *old, int dir)
1129 struct xfrm_policy *newp = xfrm_policy_alloc(xp_net(old), GFP_ATOMIC);
1132 newp->selector = old->selector;
1133 if (security_xfrm_policy_clone(old->security,
1136 return NULL; /* ENOMEM */
1138 newp->lft = old->lft;
1139 newp->curlft = old->curlft;
1140 newp->action = old->action;
1141 newp->flags = old->flags;
1142 newp->xfrm_nr = old->xfrm_nr;
1143 newp->index = old->index;
1144 newp->type = old->type;
1145 memcpy(newp->xfrm_vec, old->xfrm_vec,
1146 newp->xfrm_nr*sizeof(struct xfrm_tmpl));
1147 write_lock_bh(&xfrm_policy_lock);
1148 __xfrm_policy_link(newp, XFRM_POLICY_MAX+dir);
1149 write_unlock_bh(&xfrm_policy_lock);
1155 int __xfrm_sk_clone_policy(struct sock *sk)
1157 struct xfrm_policy *p0 = sk->sk_policy[0],
1158 *p1 = sk->sk_policy[1];
1160 sk->sk_policy[0] = sk->sk_policy[1] = NULL;
1161 if (p0 && (sk->sk_policy[0] = clone_policy(p0, 0)) == NULL)
1163 if (p1 && (sk->sk_policy[1] = clone_policy(p1, 1)) == NULL)
1169 xfrm_get_saddr(struct net *net, xfrm_address_t *local, xfrm_address_t *remote,
1170 unsigned short family)
1173 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1175 if (unlikely(afinfo == NULL))
1177 err = afinfo->get_saddr(net, local, remote);
1178 xfrm_policy_put_afinfo(afinfo);
1182 /* Resolve list of templates for the flow, given policy. */
1185 xfrm_tmpl_resolve_one(struct xfrm_policy *policy, struct flowi *fl,
1186 struct xfrm_state **xfrm,
1187 unsigned short family)
1189 struct net *net = xp_net(policy);
1192 xfrm_address_t *daddr = xfrm_flowi_daddr(fl, family);
1193 xfrm_address_t *saddr = xfrm_flowi_saddr(fl, family);
1196 for (nx=0, i = 0; i < policy->xfrm_nr; i++) {
1197 struct xfrm_state *x;
1198 xfrm_address_t *remote = daddr;
1199 xfrm_address_t *local = saddr;
1200 struct xfrm_tmpl *tmpl = &policy->xfrm_vec[i];
1202 if (tmpl->mode == XFRM_MODE_TUNNEL ||
1203 tmpl->mode == XFRM_MODE_BEET) {
1204 remote = &tmpl->id.daddr;
1205 local = &tmpl->saddr;
1206 family = tmpl->encap_family;
1207 if (xfrm_addr_any(local, family)) {
1208 error = xfrm_get_saddr(net, &tmp, remote, family);
1215 x = xfrm_state_find(remote, local, fl, tmpl, policy, &error, family);
1217 if (x && x->km.state == XFRM_STATE_VALID) {
1224 error = (x->km.state == XFRM_STATE_ERROR ?
1228 else if (error == -ESRCH)
1231 if (!tmpl->optional)
1237 for (nx--; nx>=0; nx--)
1238 xfrm_state_put(xfrm[nx]);
1243 xfrm_tmpl_resolve(struct xfrm_policy **pols, int npols, struct flowi *fl,
1244 struct xfrm_state **xfrm,
1245 unsigned short family)
1247 struct xfrm_state *tp[XFRM_MAX_DEPTH];
1248 struct xfrm_state **tpp = (npols > 1) ? tp : xfrm;
1254 for (i = 0; i < npols; i++) {
1255 if (cnx + pols[i]->xfrm_nr >= XFRM_MAX_DEPTH) {
1260 ret = xfrm_tmpl_resolve_one(pols[i], fl, &tpp[cnx], family);
1268 /* found states are sorted for outbound processing */
1270 xfrm_state_sort(xfrm, tpp, cnx, family);
1275 for (cnx--; cnx>=0; cnx--)
1276 xfrm_state_put(tpp[cnx]);
1281 /* Check that the bundle accepts the flow and its components are
1285 static struct dst_entry *
1286 xfrm_find_bundle(struct flowi *fl, struct xfrm_policy *policy, unsigned short family)
1288 struct dst_entry *x;
1289 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1290 if (unlikely(afinfo == NULL))
1291 return ERR_PTR(-EINVAL);
1292 x = afinfo->find_bundle(fl, policy);
1293 xfrm_policy_put_afinfo(afinfo);
1297 static inline int xfrm_get_tos(struct flowi *fl, int family)
1299 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1305 tos = afinfo->get_tos(fl);
1307 xfrm_policy_put_afinfo(afinfo);
1312 static inline struct xfrm_dst *xfrm_alloc_dst(int family)
1314 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1315 struct xfrm_dst *xdst;
1318 return ERR_PTR(-EINVAL);
1320 xdst = dst_alloc(afinfo->dst_ops) ?: ERR_PTR(-ENOBUFS);
1322 xfrm_policy_put_afinfo(afinfo);
1327 static inline int xfrm_init_path(struct xfrm_dst *path, struct dst_entry *dst,
1330 struct xfrm_policy_afinfo *afinfo =
1331 xfrm_policy_get_afinfo(dst->ops->family);
1337 err = afinfo->init_path(path, dst, nfheader_len);
1339 xfrm_policy_put_afinfo(afinfo);
1344 static inline int xfrm_fill_dst(struct xfrm_dst *xdst, struct net_device *dev)
1346 struct xfrm_policy_afinfo *afinfo =
1347 xfrm_policy_get_afinfo(xdst->u.dst.ops->family);
1353 err = afinfo->fill_dst(xdst, dev);
1355 xfrm_policy_put_afinfo(afinfo);
1360 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
1361 * all the metrics... Shortly, bundle a bundle.
1364 static struct dst_entry *xfrm_bundle_create(struct xfrm_policy *policy,
1365 struct xfrm_state **xfrm, int nx,
1367 struct dst_entry *dst)
1369 unsigned long now = jiffies;
1370 struct net_device *dev;
1371 struct dst_entry *dst_prev = NULL;
1372 struct dst_entry *dst0 = NULL;
1376 int nfheader_len = 0;
1377 int trailer_len = 0;
1379 int family = policy->selector.family;
1380 xfrm_address_t saddr, daddr;
1382 xfrm_flowi_addr_get(fl, &saddr, &daddr, family);
1384 tos = xfrm_get_tos(fl, family);
1391 for (; i < nx; i++) {
1392 struct xfrm_dst *xdst = xfrm_alloc_dst(family);
1393 struct dst_entry *dst1 = &xdst->u.dst;
1395 err = PTR_ERR(xdst);
1404 dst_prev->child = dst_clone(dst1);
1405 dst1->flags |= DST_NOHASH;
1409 memcpy(&dst1->metrics, &dst->metrics, sizeof(dst->metrics));
1411 if (xfrm[i]->props.mode != XFRM_MODE_TRANSPORT) {
1412 family = xfrm[i]->props.family;
1413 dst = xfrm_dst_lookup(xfrm[i], tos, &saddr, &daddr,
1421 dst1->xfrm = xfrm[i];
1422 xdst->genid = xfrm[i]->genid;
1424 dst1->obsolete = -1;
1425 dst1->flags |= DST_HOST;
1426 dst1->lastuse = now;
1428 dst1->input = dst_discard;
1429 dst1->output = xfrm[i]->outer_mode->afinfo->output;
1431 dst1->next = dst_prev;
1434 header_len += xfrm[i]->props.header_len;
1435 if (xfrm[i]->type->flags & XFRM_TYPE_NON_FRAGMENT)
1436 nfheader_len += xfrm[i]->props.header_len;
1437 trailer_len += xfrm[i]->props.trailer_len;
1440 dst_prev->child = dst;
1448 /* Copy neighbout for reachability confirmation */
1449 dst0->neighbour = neigh_clone(dst->neighbour);
1451 xfrm_init_path((struct xfrm_dst *)dst0, dst, nfheader_len);
1452 xfrm_init_pmtu(dst_prev);
1454 for (dst_prev = dst0; dst_prev != dst; dst_prev = dst_prev->child) {
1455 struct xfrm_dst *xdst = (struct xfrm_dst *)dst_prev;
1457 err = xfrm_fill_dst(xdst, dev);
1461 dst_prev->header_len = header_len;
1462 dst_prev->trailer_len = trailer_len;
1463 header_len -= xdst->u.dst.xfrm->props.header_len;
1464 trailer_len -= xdst->u.dst.xfrm->props.trailer_len;
1472 xfrm_state_put(xfrm[i]);
1476 dst0 = ERR_PTR(err);
1481 xfrm_dst_alloc_copy(void **target, void *src, int size)
1484 *target = kmalloc(size, GFP_ATOMIC);
1488 memcpy(*target, src, size);
1493 xfrm_dst_update_parent(struct dst_entry *dst, struct xfrm_selector *sel)
1495 #ifdef CONFIG_XFRM_SUB_POLICY
1496 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1497 return xfrm_dst_alloc_copy((void **)&(xdst->partner),
1505 xfrm_dst_update_origin(struct dst_entry *dst, struct flowi *fl)
1507 #ifdef CONFIG_XFRM_SUB_POLICY
1508 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1509 return xfrm_dst_alloc_copy((void **)&(xdst->origin), fl, sizeof(*fl));
1515 static int stale_bundle(struct dst_entry *dst);
1517 /* Main function: finds/creates a bundle for given flow.
1519 * At the moment we eat a raw IP route. Mostly to speed up lookups
1520 * on interfaces with disabled IPsec.
1522 int __xfrm_lookup(struct net *net, struct dst_entry **dst_p, struct flowi *fl,
1523 struct sock *sk, int flags)
1525 struct xfrm_policy *policy;
1526 struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
1531 struct xfrm_state *xfrm[XFRM_MAX_DEPTH];
1532 struct dst_entry *dst, *dst_orig = *dst_p;
1537 u8 dir = policy_to_flow_dir(XFRM_POLICY_OUT);
1540 genid = atomic_read(&flow_cache_genid);
1542 for (pi = 0; pi < ARRAY_SIZE(pols); pi++)
1548 if (sk && sk->sk_policy[XFRM_POLICY_OUT]) {
1549 policy = xfrm_sk_policy_lookup(sk, XFRM_POLICY_OUT, fl);
1550 err = PTR_ERR(policy);
1551 if (IS_ERR(policy)) {
1552 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
1558 /* To accelerate a bit... */
1559 if ((dst_orig->flags & DST_NOXFRM) ||
1560 !net->xfrm.policy_count[XFRM_POLICY_OUT])
1563 policy = flow_cache_lookup(net, fl, dst_orig->ops->family,
1564 dir, xfrm_policy_lookup);
1565 err = PTR_ERR(policy);
1566 if (IS_ERR(policy)) {
1567 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
1575 family = dst_orig->ops->family;
1578 xfrm_nr += pols[0]->xfrm_nr;
1581 if ((flags & XFRM_LOOKUP_ICMP) && !(policy->flags & XFRM_POLICY_ICMP))
1584 policy->curlft.use_time = get_seconds();
1586 switch (policy->action) {
1588 case XFRM_POLICY_BLOCK:
1589 /* Prohibit the flow */
1590 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLBLOCK);
1594 case XFRM_POLICY_ALLOW:
1595 #ifndef CONFIG_XFRM_SUB_POLICY
1596 if (policy->xfrm_nr == 0) {
1597 /* Flow passes not transformed. */
1598 xfrm_pol_put(policy);
1603 /* Try to find matching bundle.
1605 * LATER: help from flow cache. It is optional, this
1606 * is required only for output policy.
1608 dst = xfrm_find_bundle(fl, policy, family);
1610 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLECHECKERROR);
1618 #ifdef CONFIG_XFRM_SUB_POLICY
1619 if (pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
1620 pols[1] = xfrm_policy_lookup_bytype(net,
1621 XFRM_POLICY_TYPE_MAIN,
1625 if (IS_ERR(pols[1])) {
1626 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
1627 err = PTR_ERR(pols[1]);
1630 if (pols[1]->action == XFRM_POLICY_BLOCK) {
1631 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLBLOCK);
1636 xfrm_nr += pols[1]->xfrm_nr;
1641 * Because neither flowi nor bundle information knows about
1642 * transformation template size. On more than one policy usage
1643 * we can realize whether all of them is bypass or not after
1644 * they are searched. See above not-transformed bypass
1645 * is surrounded by non-sub policy configuration, too.
1648 /* Flow passes not transformed. */
1649 xfrm_pols_put(pols, npols);
1654 nx = xfrm_tmpl_resolve(pols, npols, fl, xfrm, family);
1656 if (unlikely(nx<0)) {
1658 if (err == -EAGAIN && net->xfrm.sysctl_larval_drop) {
1659 /* EREMOTE tells the caller to generate
1660 * a one-shot blackhole route.
1662 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
1663 xfrm_pol_put(policy);
1666 if (err == -EAGAIN && (flags & XFRM_LOOKUP_WAIT)) {
1667 DECLARE_WAITQUEUE(wait, current);
1669 add_wait_queue(&net->xfrm.km_waitq, &wait);
1670 set_current_state(TASK_INTERRUPTIBLE);
1672 set_current_state(TASK_RUNNING);
1673 remove_wait_queue(&net->xfrm.km_waitq, &wait);
1675 nx = xfrm_tmpl_resolve(pols, npols, fl, xfrm, family);
1677 if (nx == -EAGAIN && signal_pending(current)) {
1678 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
1682 if (nx == -EAGAIN ||
1683 genid != atomic_read(&flow_cache_genid)) {
1684 xfrm_pols_put(pols, npols);
1690 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
1695 /* Flow passes not transformed. */
1696 xfrm_pols_put(pols, npols);
1700 dst = xfrm_bundle_create(policy, xfrm, nx, fl, dst_orig);
1703 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLEGENERROR);
1707 for (pi = 0; pi < npols; pi++) {
1708 read_lock_bh(&pols[pi]->lock);
1709 pol_dead |= pols[pi]->walk.dead;
1710 read_unlock_bh(&pols[pi]->lock);
1713 write_lock_bh(&policy->lock);
1714 if (unlikely(pol_dead || stale_bundle(dst))) {
1715 /* Wow! While we worked on resolving, this
1716 * policy has gone. Retry. It is not paranoia,
1717 * we just cannot enlist new bundle to dead object.
1718 * We can't enlist stable bundles either.
1720 write_unlock_bh(&policy->lock);
1724 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLDEAD);
1726 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLECHECKERROR);
1727 err = -EHOSTUNREACH;
1732 err = xfrm_dst_update_parent(dst, &pols[1]->selector);
1734 err = xfrm_dst_update_origin(dst, fl);
1735 if (unlikely(err)) {
1736 write_unlock_bh(&policy->lock);
1738 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLECHECKERROR);
1742 dst->next = policy->bundles;
1743 policy->bundles = dst;
1745 write_unlock_bh(&policy->lock);
1748 dst_release(dst_orig);
1749 xfrm_pols_put(pols, npols);
1753 xfrm_pols_put(pols, npols);
1755 dst_release(dst_orig);
1761 if (flags & XFRM_LOOKUP_ICMP)
1765 EXPORT_SYMBOL(__xfrm_lookup);
1767 int xfrm_lookup(struct net *net, struct dst_entry **dst_p, struct flowi *fl,
1768 struct sock *sk, int flags)
1770 int err = __xfrm_lookup(net, dst_p, fl, sk, flags);
1772 if (err == -EREMOTE) {
1773 dst_release(*dst_p);
1780 EXPORT_SYMBOL(xfrm_lookup);
1783 xfrm_secpath_reject(int idx, struct sk_buff *skb, struct flowi *fl)
1785 struct xfrm_state *x;
1787 if (!skb->sp || idx < 0 || idx >= skb->sp->len)
1789 x = skb->sp->xvec[idx];
1790 if (!x->type->reject)
1792 return x->type->reject(x, skb, fl);
1795 /* When skb is transformed back to its "native" form, we have to
1796 * check policy restrictions. At the moment we make this in maximally
1797 * stupid way. Shame on me. :-) Of course, connected sockets must
1798 * have policy cached at them.
1802 xfrm_state_ok(struct xfrm_tmpl *tmpl, struct xfrm_state *x,
1803 unsigned short family)
1805 if (xfrm_state_kern(x))
1806 return tmpl->optional && !xfrm_state_addr_cmp(tmpl, x, tmpl->encap_family);
1807 return x->id.proto == tmpl->id.proto &&
1808 (x->id.spi == tmpl->id.spi || !tmpl->id.spi) &&
1809 (x->props.reqid == tmpl->reqid || !tmpl->reqid) &&
1810 x->props.mode == tmpl->mode &&
1811 (tmpl->allalgs || (tmpl->aalgos & (1<<x->props.aalgo)) ||
1812 !(xfrm_id_proto_match(tmpl->id.proto, IPSEC_PROTO_ANY))) &&
1813 !(x->props.mode != XFRM_MODE_TRANSPORT &&
1814 xfrm_state_addr_cmp(tmpl, x, family));
1818 * 0 or more than 0 is returned when validation is succeeded (either bypass
1819 * because of optional transport mode, or next index of the mathced secpath
1820 * state with the template.
1821 * -1 is returned when no matching template is found.
1822 * Otherwise "-2 - errored_index" is returned.
1825 xfrm_policy_ok(struct xfrm_tmpl *tmpl, struct sec_path *sp, int start,
1826 unsigned short family)
1830 if (tmpl->optional) {
1831 if (tmpl->mode == XFRM_MODE_TRANSPORT)
1835 for (; idx < sp->len; idx++) {
1836 if (xfrm_state_ok(tmpl, sp->xvec[idx], family))
1838 if (sp->xvec[idx]->props.mode != XFRM_MODE_TRANSPORT) {
1847 int __xfrm_decode_session(struct sk_buff *skb, struct flowi *fl,
1848 unsigned int family, int reverse)
1850 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1853 if (unlikely(afinfo == NULL))
1854 return -EAFNOSUPPORT;
1856 afinfo->decode_session(skb, fl, reverse);
1857 err = security_xfrm_decode_session(skb, &fl->secid);
1858 xfrm_policy_put_afinfo(afinfo);
1861 EXPORT_SYMBOL(__xfrm_decode_session);
1863 static inline int secpath_has_nontransport(struct sec_path *sp, int k, int *idxp)
1865 for (; k < sp->len; k++) {
1866 if (sp->xvec[k]->props.mode != XFRM_MODE_TRANSPORT) {
1875 int __xfrm_policy_check(struct sock *sk, int dir, struct sk_buff *skb,
1876 unsigned short family)
1878 struct net *net = dev_net(skb->dev);
1879 struct xfrm_policy *pol;
1880 struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
1889 reverse = dir & ~XFRM_POLICY_MASK;
1890 dir &= XFRM_POLICY_MASK;
1891 fl_dir = policy_to_flow_dir(dir);
1893 if (__xfrm_decode_session(skb, &fl, family, reverse) < 0) {
1894 XFRM_INC_STATS(net, LINUX_MIB_XFRMINHDRERROR);
1898 nf_nat_decode_session(skb, &fl, family);
1900 /* First, check used SA against their selectors. */
1904 for (i=skb->sp->len-1; i>=0; i--) {
1905 struct xfrm_state *x = skb->sp->xvec[i];
1906 if (!xfrm_selector_match(&x->sel, &fl, family)) {
1907 XFRM_INC_STATS(net, LINUX_MIB_XFRMINSTATEMISMATCH);
1914 if (sk && sk->sk_policy[dir]) {
1915 pol = xfrm_sk_policy_lookup(sk, dir, &fl);
1917 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
1923 pol = flow_cache_lookup(net, &fl, family, fl_dir,
1924 xfrm_policy_lookup);
1927 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
1932 if (skb->sp && secpath_has_nontransport(skb->sp, 0, &xerr_idx)) {
1933 xfrm_secpath_reject(xerr_idx, skb, &fl);
1934 XFRM_INC_STATS(net, LINUX_MIB_XFRMINNOPOLS);
1940 pol->curlft.use_time = get_seconds();
1944 #ifdef CONFIG_XFRM_SUB_POLICY
1945 if (pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
1946 pols[1] = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN,
1950 if (IS_ERR(pols[1])) {
1951 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
1954 pols[1]->curlft.use_time = get_seconds();
1960 if (pol->action == XFRM_POLICY_ALLOW) {
1961 struct sec_path *sp;
1962 static struct sec_path dummy;
1963 struct xfrm_tmpl *tp[XFRM_MAX_DEPTH];
1964 struct xfrm_tmpl *stp[XFRM_MAX_DEPTH];
1965 struct xfrm_tmpl **tpp = tp;
1969 if ((sp = skb->sp) == NULL)
1972 for (pi = 0; pi < npols; pi++) {
1973 if (pols[pi] != pol &&
1974 pols[pi]->action != XFRM_POLICY_ALLOW) {
1975 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
1978 if (ti + pols[pi]->xfrm_nr >= XFRM_MAX_DEPTH) {
1979 XFRM_INC_STATS(net, LINUX_MIB_XFRMINBUFFERERROR);
1982 for (i = 0; i < pols[pi]->xfrm_nr; i++)
1983 tpp[ti++] = &pols[pi]->xfrm_vec[i];
1987 xfrm_tmpl_sort(stp, tpp, xfrm_nr, family);
1991 /* For each tunnel xfrm, find the first matching tmpl.
1992 * For each tmpl before that, find corresponding xfrm.
1993 * Order is _important_. Later we will implement
1994 * some barriers, but at the moment barriers
1995 * are implied between each two transformations.
1997 for (i = xfrm_nr-1, k = 0; i >= 0; i--) {
1998 k = xfrm_policy_ok(tpp[i], sp, k, family);
2001 /* "-2 - errored_index" returned */
2003 XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
2008 if (secpath_has_nontransport(sp, k, &xerr_idx)) {
2009 XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
2013 xfrm_pols_put(pols, npols);
2016 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
2019 xfrm_secpath_reject(xerr_idx, skb, &fl);
2021 xfrm_pols_put(pols, npols);
2024 EXPORT_SYMBOL(__xfrm_policy_check);
2026 int __xfrm_route_forward(struct sk_buff *skb, unsigned short family)
2028 struct net *net = dev_net(skb->dev);
2031 if (xfrm_decode_session(skb, &fl, family) < 0) {
2032 /* XXX: we should have something like FWDHDRERROR here. */
2033 XFRM_INC_STATS(net, LINUX_MIB_XFRMINHDRERROR);
2037 return xfrm_lookup(net, &skb->dst, &fl, NULL, 0) == 0;
2039 EXPORT_SYMBOL(__xfrm_route_forward);
2041 /* Optimize later using cookies and generation ids. */
2043 static struct dst_entry *xfrm_dst_check(struct dst_entry *dst, u32 cookie)
2045 /* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
2046 * to "-1" to force all XFRM destinations to get validated by
2047 * dst_ops->check on every use. We do this because when a
2048 * normal route referenced by an XFRM dst is obsoleted we do
2049 * not go looking around for all parent referencing XFRM dsts
2050 * so that we can invalidate them. It is just too much work.
2051 * Instead we make the checks here on every use. For example:
2053 * XFRM dst A --> IPv4 dst X
2055 * X is the "xdst->route" of A (X is also the "dst->path" of A
2056 * in this example). If X is marked obsolete, "A" will not
2057 * notice. That's what we are validating here via the
2058 * stale_bundle() check.
2060 * When a policy's bundle is pruned, we dst_free() the XFRM
2061 * dst which causes it's ->obsolete field to be set to a
2062 * positive non-zero integer. If an XFRM dst has been pruned
2063 * like this, we want to force a new route lookup.
2065 if (dst->obsolete < 0 && !stale_bundle(dst))
2071 static int stale_bundle(struct dst_entry *dst)
2073 return !xfrm_bundle_ok(NULL, (struct xfrm_dst *)dst, NULL, AF_UNSPEC, 0);
2076 void xfrm_dst_ifdown(struct dst_entry *dst, struct net_device *dev)
2078 while ((dst = dst->child) && dst->xfrm && dst->dev == dev) {
2079 dst->dev = dev_net(dev)->loopback_dev;
2084 EXPORT_SYMBOL(xfrm_dst_ifdown);
2086 static void xfrm_link_failure(struct sk_buff *skb)
2088 /* Impossible. Such dst must be popped before reaches point of failure. */
2092 static struct dst_entry *xfrm_negative_advice(struct dst_entry *dst)
2095 if (dst->obsolete) {
2103 static void prune_one_bundle(struct xfrm_policy *pol, int (*func)(struct dst_entry *), struct dst_entry **gc_list_p)
2105 struct dst_entry *dst, **dstp;
2107 write_lock(&pol->lock);
2108 dstp = &pol->bundles;
2109 while ((dst=*dstp) != NULL) {
2112 dst->next = *gc_list_p;
2118 write_unlock(&pol->lock);
2121 static void xfrm_prune_bundles(struct net *net, int (*func)(struct dst_entry *))
2123 struct dst_entry *gc_list = NULL;
2126 read_lock_bh(&xfrm_policy_lock);
2127 for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
2128 struct xfrm_policy *pol;
2129 struct hlist_node *entry;
2130 struct hlist_head *table;
2133 hlist_for_each_entry(pol, entry,
2134 &net->xfrm.policy_inexact[dir], bydst)
2135 prune_one_bundle(pol, func, &gc_list);
2137 table = net->xfrm.policy_bydst[dir].table;
2138 for (i = net->xfrm.policy_bydst[dir].hmask; i >= 0; i--) {
2139 hlist_for_each_entry(pol, entry, table + i, bydst)
2140 prune_one_bundle(pol, func, &gc_list);
2143 read_unlock_bh(&xfrm_policy_lock);
2146 struct dst_entry *dst = gc_list;
2147 gc_list = dst->next;
2152 static int unused_bundle(struct dst_entry *dst)
2154 return !atomic_read(&dst->__refcnt);
2157 static void __xfrm_garbage_collect(struct net *net)
2159 xfrm_prune_bundles(net, unused_bundle);
2162 static int xfrm_flush_bundles(struct net *net)
2164 xfrm_prune_bundles(net, stale_bundle);
2168 static void xfrm_init_pmtu(struct dst_entry *dst)
2171 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
2172 u32 pmtu, route_mtu_cached;
2174 pmtu = dst_mtu(dst->child);
2175 xdst->child_mtu_cached = pmtu;
2177 pmtu = xfrm_state_mtu(dst->xfrm, pmtu);
2179 route_mtu_cached = dst_mtu(xdst->route);
2180 xdst->route_mtu_cached = route_mtu_cached;
2182 if (pmtu > route_mtu_cached)
2183 pmtu = route_mtu_cached;
2185 dst->metrics[RTAX_MTU-1] = pmtu;
2186 } while ((dst = dst->next));
2189 /* Check that the bundle accepts the flow and its components are
2193 int xfrm_bundle_ok(struct xfrm_policy *pol, struct xfrm_dst *first,
2194 struct flowi *fl, int family, int strict)
2196 struct dst_entry *dst = &first->u.dst;
2197 struct xfrm_dst *last;
2200 if (!dst_check(dst->path, ((struct xfrm_dst *)dst)->path_cookie) ||
2201 (dst->dev && !netif_running(dst->dev)))
2203 #ifdef CONFIG_XFRM_SUB_POLICY
2205 if (first->origin && !flow_cache_uli_match(first->origin, fl))
2207 if (first->partner &&
2208 !xfrm_selector_match(first->partner, fl, family))
2216 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
2218 if (fl && !xfrm_selector_match(&dst->xfrm->sel, fl, family))
2221 !security_xfrm_state_pol_flow_match(dst->xfrm, pol, fl))
2223 if (dst->xfrm->km.state != XFRM_STATE_VALID)
2225 if (xdst->genid != dst->xfrm->genid)
2229 !(dst->xfrm->outer_mode->flags & XFRM_MODE_FLAG_TUNNEL) &&
2230 !xfrm_state_addr_flow_check(dst->xfrm, fl, family))
2233 mtu = dst_mtu(dst->child);
2234 if (xdst->child_mtu_cached != mtu) {
2236 xdst->child_mtu_cached = mtu;
2239 if (!dst_check(xdst->route, xdst->route_cookie))
2241 mtu = dst_mtu(xdst->route);
2242 if (xdst->route_mtu_cached != mtu) {
2244 xdst->route_mtu_cached = mtu;
2248 } while (dst->xfrm);
2253 mtu = last->child_mtu_cached;
2257 mtu = xfrm_state_mtu(dst->xfrm, mtu);
2258 if (mtu > last->route_mtu_cached)
2259 mtu = last->route_mtu_cached;
2260 dst->metrics[RTAX_MTU-1] = mtu;
2265 last = (struct xfrm_dst *)last->u.dst.next;
2266 last->child_mtu_cached = mtu;
2272 EXPORT_SYMBOL(xfrm_bundle_ok);
2274 int xfrm_policy_register_afinfo(struct xfrm_policy_afinfo *afinfo)
2277 if (unlikely(afinfo == NULL))
2279 if (unlikely(afinfo->family >= NPROTO))
2280 return -EAFNOSUPPORT;
2281 write_lock_bh(&xfrm_policy_afinfo_lock);
2282 if (unlikely(xfrm_policy_afinfo[afinfo->family] != NULL))
2285 struct dst_ops *dst_ops = afinfo->dst_ops;
2286 if (likely(dst_ops->kmem_cachep == NULL))
2287 dst_ops->kmem_cachep = xfrm_dst_cache;
2288 if (likely(dst_ops->check == NULL))
2289 dst_ops->check = xfrm_dst_check;
2290 if (likely(dst_ops->negative_advice == NULL))
2291 dst_ops->negative_advice = xfrm_negative_advice;
2292 if (likely(dst_ops->link_failure == NULL))
2293 dst_ops->link_failure = xfrm_link_failure;
2294 if (likely(afinfo->garbage_collect == NULL))
2295 afinfo->garbage_collect = __xfrm_garbage_collect;
2296 xfrm_policy_afinfo[afinfo->family] = afinfo;
2298 write_unlock_bh(&xfrm_policy_afinfo_lock);
2301 EXPORT_SYMBOL(xfrm_policy_register_afinfo);
2303 int xfrm_policy_unregister_afinfo(struct xfrm_policy_afinfo *afinfo)
2306 if (unlikely(afinfo == NULL))
2308 if (unlikely(afinfo->family >= NPROTO))
2309 return -EAFNOSUPPORT;
2310 write_lock_bh(&xfrm_policy_afinfo_lock);
2311 if (likely(xfrm_policy_afinfo[afinfo->family] != NULL)) {
2312 if (unlikely(xfrm_policy_afinfo[afinfo->family] != afinfo))
2315 struct dst_ops *dst_ops = afinfo->dst_ops;
2316 xfrm_policy_afinfo[afinfo->family] = NULL;
2317 dst_ops->kmem_cachep = NULL;
2318 dst_ops->check = NULL;
2319 dst_ops->negative_advice = NULL;
2320 dst_ops->link_failure = NULL;
2321 afinfo->garbage_collect = NULL;
2324 write_unlock_bh(&xfrm_policy_afinfo_lock);
2327 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo);
2329 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family)
2331 struct xfrm_policy_afinfo *afinfo;
2332 if (unlikely(family >= NPROTO))
2334 read_lock(&xfrm_policy_afinfo_lock);
2335 afinfo = xfrm_policy_afinfo[family];
2336 if (unlikely(!afinfo))
2337 read_unlock(&xfrm_policy_afinfo_lock);
2341 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo)
2343 read_unlock(&xfrm_policy_afinfo_lock);
2346 static int xfrm_dev_event(struct notifier_block *this, unsigned long event, void *ptr)
2348 struct net_device *dev = ptr;
2352 xfrm_flush_bundles(dev_net(dev));
2357 static struct notifier_block xfrm_dev_notifier = {
2358 .notifier_call = xfrm_dev_event,
2361 #ifdef CONFIG_XFRM_STATISTICS
2362 static int __net_init xfrm_statistics_init(struct net *net)
2366 if (snmp_mib_init((void **)net->mib.xfrm_statistics,
2367 sizeof(struct linux_xfrm_mib)) < 0)
2369 rv = xfrm_proc_init(net);
2371 snmp_mib_free((void **)net->mib.xfrm_statistics);
2375 static void xfrm_statistics_fini(struct net *net)
2377 xfrm_proc_fini(net);
2378 snmp_mib_free((void **)net->mib.xfrm_statistics);
2381 static int __net_init xfrm_statistics_init(struct net *net)
2386 static void xfrm_statistics_fini(struct net *net)
2391 static int __net_init xfrm_policy_init(struct net *net)
2393 unsigned int hmask, sz;
2396 if (net_eq(net, &init_net))
2397 xfrm_dst_cache = kmem_cache_create("xfrm_dst_cache",
2398 sizeof(struct xfrm_dst),
2399 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC,
2403 sz = (hmask+1) * sizeof(struct hlist_head);
2405 net->xfrm.policy_byidx = xfrm_hash_alloc(sz);
2406 if (!net->xfrm.policy_byidx)
2408 net->xfrm.policy_idx_hmask = hmask;
2410 for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
2411 struct xfrm_policy_hash *htab;
2413 net->xfrm.policy_count[dir] = 0;
2414 INIT_HLIST_HEAD(&net->xfrm.policy_inexact[dir]);
2416 htab = &net->xfrm.policy_bydst[dir];
2417 htab->table = xfrm_hash_alloc(sz);
2420 htab->hmask = hmask;
2423 INIT_LIST_HEAD(&net->xfrm.policy_all);
2424 INIT_WORK(&net->xfrm.policy_hash_work, xfrm_hash_resize);
2425 if (net_eq(net, &init_net))
2426 register_netdevice_notifier(&xfrm_dev_notifier);
2430 for (dir--; dir >= 0; dir--) {
2431 struct xfrm_policy_hash *htab;
2433 htab = &net->xfrm.policy_bydst[dir];
2434 xfrm_hash_free(htab->table, sz);
2436 xfrm_hash_free(net->xfrm.policy_byidx, sz);
2441 static void xfrm_policy_fini(struct net *net)
2443 struct xfrm_audit audit_info;
2447 flush_work(&net->xfrm.policy_hash_work);
2448 #ifdef CONFIG_XFRM_SUB_POLICY
2449 audit_info.loginuid = -1;
2450 audit_info.sessionid = -1;
2451 audit_info.secid = 0;
2452 xfrm_policy_flush(net, XFRM_POLICY_TYPE_SUB, &audit_info);
2454 audit_info.loginuid = -1;
2455 audit_info.sessionid = -1;
2456 audit_info.secid = 0;
2457 xfrm_policy_flush(net, XFRM_POLICY_TYPE_MAIN, &audit_info);
2458 flush_work(&xfrm_policy_gc_work);
2460 WARN_ON(!list_empty(&net->xfrm.policy_all));
2462 for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
2463 struct xfrm_policy_hash *htab;
2465 WARN_ON(!hlist_empty(&net->xfrm.policy_inexact[dir]));
2467 htab = &net->xfrm.policy_bydst[dir];
2468 sz = (htab->hmask + 1);
2469 WARN_ON(!hlist_empty(htab->table));
2470 xfrm_hash_free(htab->table, sz);
2473 sz = (net->xfrm.policy_idx_hmask + 1) * sizeof(struct hlist_head);
2474 WARN_ON(!hlist_empty(net->xfrm.policy_byidx));
2475 xfrm_hash_free(net->xfrm.policy_byidx, sz);
2478 static int __net_init xfrm_net_init(struct net *net)
2482 rv = xfrm_statistics_init(net);
2484 goto out_statistics;
2485 rv = xfrm_state_init(net);
2488 rv = xfrm_policy_init(net);
2491 rv = xfrm_sysctl_init(net);
2497 xfrm_policy_fini(net);
2499 xfrm_state_fini(net);
2501 xfrm_statistics_fini(net);
2506 static void __net_exit xfrm_net_exit(struct net *net)
2508 xfrm_sysctl_fini(net);
2509 xfrm_policy_fini(net);
2510 xfrm_state_fini(net);
2511 xfrm_statistics_fini(net);
2514 static struct pernet_operations __net_initdata xfrm_net_ops = {
2515 .init = xfrm_net_init,
2516 .exit = xfrm_net_exit,
2519 void __init xfrm_init(void)
2521 register_pernet_subsys(&xfrm_net_ops);
2525 #ifdef CONFIG_AUDITSYSCALL
2526 static void xfrm_audit_common_policyinfo(struct xfrm_policy *xp,
2527 struct audit_buffer *audit_buf)
2529 struct xfrm_sec_ctx *ctx = xp->security;
2530 struct xfrm_selector *sel = &xp->selector;
2533 audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
2534 ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
2536 switch(sel->family) {
2538 audit_log_format(audit_buf, " src=%pI4", &sel->saddr.a4);
2539 if (sel->prefixlen_s != 32)
2540 audit_log_format(audit_buf, " src_prefixlen=%d",
2542 audit_log_format(audit_buf, " dst=%pI4", &sel->daddr.a4);
2543 if (sel->prefixlen_d != 32)
2544 audit_log_format(audit_buf, " dst_prefixlen=%d",
2548 audit_log_format(audit_buf, " src=%pI6", sel->saddr.a6);
2549 if (sel->prefixlen_s != 128)
2550 audit_log_format(audit_buf, " src_prefixlen=%d",
2552 audit_log_format(audit_buf, " dst=%pI6", sel->daddr.a6);
2553 if (sel->prefixlen_d != 128)
2554 audit_log_format(audit_buf, " dst_prefixlen=%d",
2560 void xfrm_audit_policy_add(struct xfrm_policy *xp, int result,
2561 uid_t auid, u32 sessionid, u32 secid)
2563 struct audit_buffer *audit_buf;
2565 audit_buf = xfrm_audit_start("SPD-add");
2566 if (audit_buf == NULL)
2568 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2569 audit_log_format(audit_buf, " res=%u", result);
2570 xfrm_audit_common_policyinfo(xp, audit_buf);
2571 audit_log_end(audit_buf);
2573 EXPORT_SYMBOL_GPL(xfrm_audit_policy_add);
2575 void xfrm_audit_policy_delete(struct xfrm_policy *xp, int result,
2576 uid_t auid, u32 sessionid, u32 secid)
2578 struct audit_buffer *audit_buf;
2580 audit_buf = xfrm_audit_start("SPD-delete");
2581 if (audit_buf == NULL)
2583 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2584 audit_log_format(audit_buf, " res=%u", result);
2585 xfrm_audit_common_policyinfo(xp, audit_buf);
2586 audit_log_end(audit_buf);
2588 EXPORT_SYMBOL_GPL(xfrm_audit_policy_delete);
2591 #ifdef CONFIG_XFRM_MIGRATE
2592 static int xfrm_migrate_selector_match(struct xfrm_selector *sel_cmp,
2593 struct xfrm_selector *sel_tgt)
2595 if (sel_cmp->proto == IPSEC_ULPROTO_ANY) {
2596 if (sel_tgt->family == sel_cmp->family &&
2597 xfrm_addr_cmp(&sel_tgt->daddr, &sel_cmp->daddr,
2598 sel_cmp->family) == 0 &&
2599 xfrm_addr_cmp(&sel_tgt->saddr, &sel_cmp->saddr,
2600 sel_cmp->family) == 0 &&
2601 sel_tgt->prefixlen_d == sel_cmp->prefixlen_d &&
2602 sel_tgt->prefixlen_s == sel_cmp->prefixlen_s) {
2606 if (memcmp(sel_tgt, sel_cmp, sizeof(*sel_tgt)) == 0) {
2613 static struct xfrm_policy * xfrm_migrate_policy_find(struct xfrm_selector *sel,
2616 struct xfrm_policy *pol, *ret = NULL;
2617 struct hlist_node *entry;
2618 struct hlist_head *chain;
2621 read_lock_bh(&xfrm_policy_lock);
2622 chain = policy_hash_direct(&init_net, &sel->daddr, &sel->saddr, sel->family, dir);
2623 hlist_for_each_entry(pol, entry, chain, bydst) {
2624 if (xfrm_migrate_selector_match(sel, &pol->selector) &&
2625 pol->type == type) {
2627 priority = ret->priority;
2631 chain = &init_net.xfrm.policy_inexact[dir];
2632 hlist_for_each_entry(pol, entry, chain, bydst) {
2633 if (xfrm_migrate_selector_match(sel, &pol->selector) &&
2634 pol->type == type &&
2635 pol->priority < priority) {
2644 read_unlock_bh(&xfrm_policy_lock);
2649 static int migrate_tmpl_match(struct xfrm_migrate *m, struct xfrm_tmpl *t)
2653 if (t->mode == m->mode && t->id.proto == m->proto &&
2654 (m->reqid == 0 || t->reqid == m->reqid)) {
2656 case XFRM_MODE_TUNNEL:
2657 case XFRM_MODE_BEET:
2658 if (xfrm_addr_cmp(&t->id.daddr, &m->old_daddr,
2659 m->old_family) == 0 &&
2660 xfrm_addr_cmp(&t->saddr, &m->old_saddr,
2661 m->old_family) == 0) {
2665 case XFRM_MODE_TRANSPORT:
2666 /* in case of transport mode, template does not store
2667 any IP addresses, hence we just compare mode and
2678 /* update endpoint address(es) of template(s) */
2679 static int xfrm_policy_migrate(struct xfrm_policy *pol,
2680 struct xfrm_migrate *m, int num_migrate)
2682 struct xfrm_migrate *mp;
2683 struct dst_entry *dst;
2686 write_lock_bh(&pol->lock);
2687 if (unlikely(pol->walk.dead)) {
2688 /* target policy has been deleted */
2689 write_unlock_bh(&pol->lock);
2693 for (i = 0; i < pol->xfrm_nr; i++) {
2694 for (j = 0, mp = m; j < num_migrate; j++, mp++) {
2695 if (!migrate_tmpl_match(mp, &pol->xfrm_vec[i]))
2698 if (pol->xfrm_vec[i].mode != XFRM_MODE_TUNNEL &&
2699 pol->xfrm_vec[i].mode != XFRM_MODE_BEET)
2701 /* update endpoints */
2702 memcpy(&pol->xfrm_vec[i].id.daddr, &mp->new_daddr,
2703 sizeof(pol->xfrm_vec[i].id.daddr));
2704 memcpy(&pol->xfrm_vec[i].saddr, &mp->new_saddr,
2705 sizeof(pol->xfrm_vec[i].saddr));
2706 pol->xfrm_vec[i].encap_family = mp->new_family;
2708 while ((dst = pol->bundles) != NULL) {
2709 pol->bundles = dst->next;
2715 write_unlock_bh(&pol->lock);
2723 static int xfrm_migrate_check(struct xfrm_migrate *m, int num_migrate)
2727 if (num_migrate < 1 || num_migrate > XFRM_MAX_DEPTH)
2730 for (i = 0; i < num_migrate; i++) {
2731 if ((xfrm_addr_cmp(&m[i].old_daddr, &m[i].new_daddr,
2732 m[i].old_family) == 0) &&
2733 (xfrm_addr_cmp(&m[i].old_saddr, &m[i].new_saddr,
2734 m[i].old_family) == 0))
2736 if (xfrm_addr_any(&m[i].new_daddr, m[i].new_family) ||
2737 xfrm_addr_any(&m[i].new_saddr, m[i].new_family))
2740 /* check if there is any duplicated entry */
2741 for (j = i + 1; j < num_migrate; j++) {
2742 if (!memcmp(&m[i].old_daddr, &m[j].old_daddr,
2743 sizeof(m[i].old_daddr)) &&
2744 !memcmp(&m[i].old_saddr, &m[j].old_saddr,
2745 sizeof(m[i].old_saddr)) &&
2746 m[i].proto == m[j].proto &&
2747 m[i].mode == m[j].mode &&
2748 m[i].reqid == m[j].reqid &&
2749 m[i].old_family == m[j].old_family)
2757 int xfrm_migrate(struct xfrm_selector *sel, u8 dir, u8 type,
2758 struct xfrm_migrate *m, int num_migrate,
2759 struct xfrm_kmaddress *k)
2761 int i, err, nx_cur = 0, nx_new = 0;
2762 struct xfrm_policy *pol = NULL;
2763 struct xfrm_state *x, *xc;
2764 struct xfrm_state *x_cur[XFRM_MAX_DEPTH];
2765 struct xfrm_state *x_new[XFRM_MAX_DEPTH];
2766 struct xfrm_migrate *mp;
2768 if ((err = xfrm_migrate_check(m, num_migrate)) < 0)
2771 /* Stage 1 - find policy */
2772 if ((pol = xfrm_migrate_policy_find(sel, dir, type)) == NULL) {
2777 /* Stage 2 - find and update state(s) */
2778 for (i = 0, mp = m; i < num_migrate; i++, mp++) {
2779 if ((x = xfrm_migrate_state_find(mp))) {
2782 if ((xc = xfrm_state_migrate(x, mp))) {
2792 /* Stage 3 - update policy */
2793 if ((err = xfrm_policy_migrate(pol, m, num_migrate)) < 0)
2796 /* Stage 4 - delete old state(s) */
2798 xfrm_states_put(x_cur, nx_cur);
2799 xfrm_states_delete(x_cur, nx_cur);
2802 /* Stage 5 - announce */
2803 km_migrate(sel, dir, type, m, num_migrate, k);
2815 xfrm_states_put(x_cur, nx_cur);
2817 xfrm_states_delete(x_new, nx_new);
2821 EXPORT_SYMBOL(xfrm_migrate);