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 int sysctl_xfrm_larval_drop __read_mostly = 1;
39 #ifdef CONFIG_XFRM_STATISTICS
40 DEFINE_SNMP_STAT(struct linux_xfrm_mib, xfrm_statistics) __read_mostly;
41 EXPORT_SYMBOL(xfrm_statistics);
44 DEFINE_MUTEX(xfrm_cfg_mutex);
45 EXPORT_SYMBOL(xfrm_cfg_mutex);
47 static DEFINE_RWLOCK(xfrm_policy_lock);
49 static struct list_head xfrm_policy_all;
50 unsigned int xfrm_policy_count[XFRM_POLICY_MAX*2];
51 EXPORT_SYMBOL(xfrm_policy_count);
53 static DEFINE_RWLOCK(xfrm_policy_afinfo_lock);
54 static struct xfrm_policy_afinfo *xfrm_policy_afinfo[NPROTO];
56 static struct kmem_cache *xfrm_dst_cache __read_mostly;
58 static HLIST_HEAD(xfrm_policy_gc_list);
59 static DEFINE_SPINLOCK(xfrm_policy_gc_lock);
61 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family);
62 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo);
63 static void xfrm_init_pmtu(struct dst_entry *dst);
66 __xfrm4_selector_match(struct xfrm_selector *sel, struct flowi *fl)
68 return addr_match(&fl->fl4_dst, &sel->daddr, sel->prefixlen_d) &&
69 addr_match(&fl->fl4_src, &sel->saddr, sel->prefixlen_s) &&
70 !((xfrm_flowi_dport(fl) ^ sel->dport) & sel->dport_mask) &&
71 !((xfrm_flowi_sport(fl) ^ sel->sport) & sel->sport_mask) &&
72 (fl->proto == sel->proto || !sel->proto) &&
73 (fl->oif == sel->ifindex || !sel->ifindex);
77 __xfrm6_selector_match(struct xfrm_selector *sel, struct flowi *fl)
79 return addr_match(&fl->fl6_dst, &sel->daddr, sel->prefixlen_d) &&
80 addr_match(&fl->fl6_src, &sel->saddr, sel->prefixlen_s) &&
81 !((xfrm_flowi_dport(fl) ^ sel->dport) & sel->dport_mask) &&
82 !((xfrm_flowi_sport(fl) ^ sel->sport) & sel->sport_mask) &&
83 (fl->proto == sel->proto || !sel->proto) &&
84 (fl->oif == sel->ifindex || !sel->ifindex);
87 int xfrm_selector_match(struct xfrm_selector *sel, struct flowi *fl,
88 unsigned short family)
92 return __xfrm4_selector_match(sel, fl);
94 return __xfrm6_selector_match(sel, fl);
99 static inline struct dst_entry *__xfrm_dst_lookup(int tos,
100 xfrm_address_t *saddr,
101 xfrm_address_t *daddr,
104 struct xfrm_policy_afinfo *afinfo;
105 struct dst_entry *dst;
107 afinfo = xfrm_policy_get_afinfo(family);
108 if (unlikely(afinfo == NULL))
109 return ERR_PTR(-EAFNOSUPPORT);
111 dst = afinfo->dst_lookup(tos, saddr, daddr);
113 xfrm_policy_put_afinfo(afinfo);
118 static inline struct dst_entry *xfrm_dst_lookup(struct xfrm_state *x, int tos,
119 xfrm_address_t *prev_saddr,
120 xfrm_address_t *prev_daddr,
123 xfrm_address_t *saddr = &x->props.saddr;
124 xfrm_address_t *daddr = &x->id.daddr;
125 struct dst_entry *dst;
127 if (x->type->flags & XFRM_TYPE_LOCAL_COADDR) {
131 if (x->type->flags & XFRM_TYPE_REMOTE_COADDR) {
136 dst = __xfrm_dst_lookup(tos, saddr, daddr, family);
139 if (prev_saddr != saddr)
140 memcpy(prev_saddr, saddr, sizeof(*prev_saddr));
141 if (prev_daddr != daddr)
142 memcpy(prev_daddr, daddr, sizeof(*prev_daddr));
148 static inline unsigned long make_jiffies(long secs)
150 if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
151 return MAX_SCHEDULE_TIMEOUT-1;
156 static void xfrm_policy_timer(unsigned long data)
158 struct xfrm_policy *xp = (struct xfrm_policy*)data;
159 unsigned long now = get_seconds();
160 long next = LONG_MAX;
164 read_lock(&xp->lock);
169 dir = xfrm_policy_id2dir(xp->index);
171 if (xp->lft.hard_add_expires_seconds) {
172 long tmo = xp->lft.hard_add_expires_seconds +
173 xp->curlft.add_time - now;
179 if (xp->lft.hard_use_expires_seconds) {
180 long tmo = xp->lft.hard_use_expires_seconds +
181 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
187 if (xp->lft.soft_add_expires_seconds) {
188 long tmo = xp->lft.soft_add_expires_seconds +
189 xp->curlft.add_time - now;
192 tmo = XFRM_KM_TIMEOUT;
197 if (xp->lft.soft_use_expires_seconds) {
198 long tmo = xp->lft.soft_use_expires_seconds +
199 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
202 tmo = XFRM_KM_TIMEOUT;
209 km_policy_expired(xp, dir, 0, 0);
210 if (next != LONG_MAX &&
211 !mod_timer(&xp->timer, jiffies + make_jiffies(next)))
215 read_unlock(&xp->lock);
220 read_unlock(&xp->lock);
221 if (!xfrm_policy_delete(xp, dir))
222 km_policy_expired(xp, dir, 1, 0);
227 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
231 struct xfrm_policy *xfrm_policy_alloc(struct net *net, gfp_t gfp)
233 struct xfrm_policy *policy;
235 policy = kzalloc(sizeof(struct xfrm_policy), gfp);
238 write_pnet(&policy->xp_net, net);
239 INIT_LIST_HEAD(&policy->walk.all);
240 INIT_HLIST_NODE(&policy->bydst);
241 INIT_HLIST_NODE(&policy->byidx);
242 rwlock_init(&policy->lock);
243 atomic_set(&policy->refcnt, 1);
244 setup_timer(&policy->timer, xfrm_policy_timer,
245 (unsigned long)policy);
249 EXPORT_SYMBOL(xfrm_policy_alloc);
251 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
253 void xfrm_policy_destroy(struct xfrm_policy *policy)
255 BUG_ON(!policy->walk.dead);
257 BUG_ON(policy->bundles);
259 if (del_timer(&policy->timer))
262 security_xfrm_policy_free(policy->security);
265 EXPORT_SYMBOL(xfrm_policy_destroy);
267 static void xfrm_policy_gc_kill(struct xfrm_policy *policy)
269 struct dst_entry *dst;
271 while ((dst = policy->bundles) != NULL) {
272 policy->bundles = dst->next;
276 if (del_timer(&policy->timer))
277 atomic_dec(&policy->refcnt);
279 if (atomic_read(&policy->refcnt) > 1)
282 xfrm_pol_put(policy);
285 static void xfrm_policy_gc_task(struct work_struct *work)
287 struct xfrm_policy *policy;
288 struct hlist_node *entry, *tmp;
289 struct hlist_head gc_list;
291 spin_lock_bh(&xfrm_policy_gc_lock);
292 gc_list.first = xfrm_policy_gc_list.first;
293 INIT_HLIST_HEAD(&xfrm_policy_gc_list);
294 spin_unlock_bh(&xfrm_policy_gc_lock);
296 hlist_for_each_entry_safe(policy, entry, tmp, &gc_list, bydst)
297 xfrm_policy_gc_kill(policy);
299 static DECLARE_WORK(xfrm_policy_gc_work, xfrm_policy_gc_task);
301 /* Rule must be locked. Release descentant resources, announce
302 * entry dead. The rule must be unlinked from lists to the moment.
305 static void xfrm_policy_kill(struct xfrm_policy *policy)
309 write_lock_bh(&policy->lock);
310 dead = policy->walk.dead;
311 policy->walk.dead = 1;
312 write_unlock_bh(&policy->lock);
314 if (unlikely(dead)) {
319 spin_lock_bh(&xfrm_policy_gc_lock);
320 hlist_add_head(&policy->bydst, &xfrm_policy_gc_list);
321 spin_unlock_bh(&xfrm_policy_gc_lock);
323 schedule_work(&xfrm_policy_gc_work);
326 struct xfrm_policy_hash {
327 struct hlist_head *table;
331 static struct hlist_head xfrm_policy_inexact[XFRM_POLICY_MAX*2];
332 static struct xfrm_policy_hash xfrm_policy_bydst[XFRM_POLICY_MAX*2] __read_mostly;
333 static struct hlist_head *xfrm_policy_byidx __read_mostly;
334 static unsigned int xfrm_idx_hmask __read_mostly;
335 static unsigned int xfrm_policy_hashmax __read_mostly = 1 * 1024 * 1024;
337 static inline unsigned int idx_hash(u32 index)
339 return __idx_hash(index, xfrm_idx_hmask);
342 static struct hlist_head *policy_hash_bysel(struct xfrm_selector *sel, unsigned short family, int dir)
344 unsigned int hmask = xfrm_policy_bydst[dir].hmask;
345 unsigned int hash = __sel_hash(sel, family, hmask);
347 return (hash == hmask + 1 ?
348 &xfrm_policy_inexact[dir] :
349 xfrm_policy_bydst[dir].table + hash);
352 static struct hlist_head *policy_hash_direct(xfrm_address_t *daddr, xfrm_address_t *saddr, unsigned short family, int dir)
354 unsigned int hmask = xfrm_policy_bydst[dir].hmask;
355 unsigned int hash = __addr_hash(daddr, saddr, family, hmask);
357 return xfrm_policy_bydst[dir].table + hash;
360 static void xfrm_dst_hash_transfer(struct hlist_head *list,
361 struct hlist_head *ndsttable,
362 unsigned int nhashmask)
364 struct hlist_node *entry, *tmp, *entry0 = NULL;
365 struct xfrm_policy *pol;
369 hlist_for_each_entry_safe(pol, entry, tmp, list, bydst) {
372 h = __addr_hash(&pol->selector.daddr, &pol->selector.saddr,
373 pol->family, nhashmask);
376 hlist_add_head(&pol->bydst, ndsttable+h);
382 hlist_add_after(entry0, &pol->bydst);
386 if (!hlist_empty(list)) {
392 static void xfrm_idx_hash_transfer(struct hlist_head *list,
393 struct hlist_head *nidxtable,
394 unsigned int nhashmask)
396 struct hlist_node *entry, *tmp;
397 struct xfrm_policy *pol;
399 hlist_for_each_entry_safe(pol, entry, tmp, list, byidx) {
402 h = __idx_hash(pol->index, nhashmask);
403 hlist_add_head(&pol->byidx, nidxtable+h);
407 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask)
409 return ((old_hmask + 1) << 1) - 1;
412 static void xfrm_bydst_resize(int dir)
414 unsigned int hmask = xfrm_policy_bydst[dir].hmask;
415 unsigned int nhashmask = xfrm_new_hash_mask(hmask);
416 unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
417 struct hlist_head *odst = xfrm_policy_bydst[dir].table;
418 struct hlist_head *ndst = xfrm_hash_alloc(nsize);
424 write_lock_bh(&xfrm_policy_lock);
426 for (i = hmask; i >= 0; i--)
427 xfrm_dst_hash_transfer(odst + i, ndst, nhashmask);
429 xfrm_policy_bydst[dir].table = ndst;
430 xfrm_policy_bydst[dir].hmask = nhashmask;
432 write_unlock_bh(&xfrm_policy_lock);
434 xfrm_hash_free(odst, (hmask + 1) * sizeof(struct hlist_head));
437 static void xfrm_byidx_resize(int total)
439 unsigned int hmask = xfrm_idx_hmask;
440 unsigned int nhashmask = xfrm_new_hash_mask(hmask);
441 unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
442 struct hlist_head *oidx = xfrm_policy_byidx;
443 struct hlist_head *nidx = xfrm_hash_alloc(nsize);
449 write_lock_bh(&xfrm_policy_lock);
451 for (i = hmask; i >= 0; i--)
452 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask);
454 xfrm_policy_byidx = nidx;
455 xfrm_idx_hmask = nhashmask;
457 write_unlock_bh(&xfrm_policy_lock);
459 xfrm_hash_free(oidx, (hmask + 1) * sizeof(struct hlist_head));
462 static inline int xfrm_bydst_should_resize(int dir, int *total)
464 unsigned int cnt = xfrm_policy_count[dir];
465 unsigned int hmask = xfrm_policy_bydst[dir].hmask;
470 if ((hmask + 1) < xfrm_policy_hashmax &&
477 static inline int xfrm_byidx_should_resize(int total)
479 unsigned int hmask = xfrm_idx_hmask;
481 if ((hmask + 1) < xfrm_policy_hashmax &&
488 void xfrm_spd_getinfo(struct xfrmk_spdinfo *si)
490 read_lock_bh(&xfrm_policy_lock);
491 si->incnt = xfrm_policy_count[XFRM_POLICY_IN];
492 si->outcnt = xfrm_policy_count[XFRM_POLICY_OUT];
493 si->fwdcnt = xfrm_policy_count[XFRM_POLICY_FWD];
494 si->inscnt = xfrm_policy_count[XFRM_POLICY_IN+XFRM_POLICY_MAX];
495 si->outscnt = xfrm_policy_count[XFRM_POLICY_OUT+XFRM_POLICY_MAX];
496 si->fwdscnt = xfrm_policy_count[XFRM_POLICY_FWD+XFRM_POLICY_MAX];
497 si->spdhcnt = xfrm_idx_hmask;
498 si->spdhmcnt = xfrm_policy_hashmax;
499 read_unlock_bh(&xfrm_policy_lock);
501 EXPORT_SYMBOL(xfrm_spd_getinfo);
503 static DEFINE_MUTEX(hash_resize_mutex);
504 static void xfrm_hash_resize(struct work_struct *__unused)
508 mutex_lock(&hash_resize_mutex);
511 for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
512 if (xfrm_bydst_should_resize(dir, &total))
513 xfrm_bydst_resize(dir);
515 if (xfrm_byidx_should_resize(total))
516 xfrm_byidx_resize(total);
518 mutex_unlock(&hash_resize_mutex);
521 static DECLARE_WORK(xfrm_hash_work, xfrm_hash_resize);
523 /* Generate new index... KAME seems to generate them ordered by cost
524 * of an absolute inpredictability of ordering of rules. This will not pass. */
525 static u32 xfrm_gen_index(int dir)
527 static u32 idx_generator;
530 struct hlist_node *entry;
531 struct hlist_head *list;
532 struct xfrm_policy *p;
536 idx = (idx_generator | dir);
540 list = xfrm_policy_byidx + idx_hash(idx);
542 hlist_for_each_entry(p, entry, list, byidx) {
543 if (p->index == idx) {
553 static inline int selector_cmp(struct xfrm_selector *s1, struct xfrm_selector *s2)
555 u32 *p1 = (u32 *) s1;
556 u32 *p2 = (u32 *) s2;
557 int len = sizeof(struct xfrm_selector) / sizeof(u32);
560 for (i = 0; i < len; i++) {
568 int xfrm_policy_insert(int dir, struct xfrm_policy *policy, int excl)
570 struct xfrm_policy *pol;
571 struct xfrm_policy *delpol;
572 struct hlist_head *chain;
573 struct hlist_node *entry, *newpos;
574 struct dst_entry *gc_list;
576 write_lock_bh(&xfrm_policy_lock);
577 chain = policy_hash_bysel(&policy->selector, policy->family, dir);
580 hlist_for_each_entry(pol, entry, chain, bydst) {
581 if (pol->type == policy->type &&
582 !selector_cmp(&pol->selector, &policy->selector) &&
583 xfrm_sec_ctx_match(pol->security, policy->security) &&
586 write_unlock_bh(&xfrm_policy_lock);
590 if (policy->priority > pol->priority)
592 } else if (policy->priority >= pol->priority) {
593 newpos = &pol->bydst;
600 hlist_add_after(newpos, &policy->bydst);
602 hlist_add_head(&policy->bydst, chain);
603 xfrm_pol_hold(policy);
604 xfrm_policy_count[dir]++;
605 atomic_inc(&flow_cache_genid);
607 hlist_del(&delpol->bydst);
608 hlist_del(&delpol->byidx);
609 list_del(&delpol->walk.all);
610 xfrm_policy_count[dir]--;
612 policy->index = delpol ? delpol->index : xfrm_gen_index(dir);
613 hlist_add_head(&policy->byidx, xfrm_policy_byidx+idx_hash(policy->index));
614 policy->curlft.add_time = get_seconds();
615 policy->curlft.use_time = 0;
616 if (!mod_timer(&policy->timer, jiffies + HZ))
617 xfrm_pol_hold(policy);
618 list_add(&policy->walk.all, &xfrm_policy_all);
619 write_unlock_bh(&xfrm_policy_lock);
622 xfrm_policy_kill(delpol);
623 else if (xfrm_bydst_should_resize(dir, NULL))
624 schedule_work(&xfrm_hash_work);
626 read_lock_bh(&xfrm_policy_lock);
628 entry = &policy->bydst;
629 hlist_for_each_entry_continue(policy, entry, bydst) {
630 struct dst_entry *dst;
632 write_lock(&policy->lock);
633 dst = policy->bundles;
635 struct dst_entry *tail = dst;
638 tail->next = gc_list;
641 policy->bundles = NULL;
643 write_unlock(&policy->lock);
645 read_unlock_bh(&xfrm_policy_lock);
648 struct dst_entry *dst = gc_list;
656 EXPORT_SYMBOL(xfrm_policy_insert);
658 struct xfrm_policy *xfrm_policy_bysel_ctx(u8 type, int dir,
659 struct xfrm_selector *sel,
660 struct xfrm_sec_ctx *ctx, int delete,
663 struct xfrm_policy *pol, *ret;
664 struct hlist_head *chain;
665 struct hlist_node *entry;
668 write_lock_bh(&xfrm_policy_lock);
669 chain = policy_hash_bysel(sel, sel->family, dir);
671 hlist_for_each_entry(pol, entry, chain, bydst) {
672 if (pol->type == type &&
673 !selector_cmp(sel, &pol->selector) &&
674 xfrm_sec_ctx_match(ctx, pol->security)) {
677 *err = security_xfrm_policy_delete(
680 write_unlock_bh(&xfrm_policy_lock);
683 hlist_del(&pol->bydst);
684 hlist_del(&pol->byidx);
685 list_del(&pol->walk.all);
686 xfrm_policy_count[dir]--;
692 write_unlock_bh(&xfrm_policy_lock);
695 atomic_inc(&flow_cache_genid);
696 xfrm_policy_kill(ret);
700 EXPORT_SYMBOL(xfrm_policy_bysel_ctx);
702 struct xfrm_policy *xfrm_policy_byid(u8 type, int dir, u32 id, int delete,
705 struct xfrm_policy *pol, *ret;
706 struct hlist_head *chain;
707 struct hlist_node *entry;
710 if (xfrm_policy_id2dir(id) != dir)
714 write_lock_bh(&xfrm_policy_lock);
715 chain = xfrm_policy_byidx + idx_hash(id);
717 hlist_for_each_entry(pol, entry, chain, byidx) {
718 if (pol->type == type && pol->index == id) {
721 *err = security_xfrm_policy_delete(
724 write_unlock_bh(&xfrm_policy_lock);
727 hlist_del(&pol->bydst);
728 hlist_del(&pol->byidx);
729 list_del(&pol->walk.all);
730 xfrm_policy_count[dir]--;
736 write_unlock_bh(&xfrm_policy_lock);
739 atomic_inc(&flow_cache_genid);
740 xfrm_policy_kill(ret);
744 EXPORT_SYMBOL(xfrm_policy_byid);
746 #ifdef CONFIG_SECURITY_NETWORK_XFRM
748 xfrm_policy_flush_secctx_check(u8 type, struct xfrm_audit *audit_info)
752 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
753 struct xfrm_policy *pol;
754 struct hlist_node *entry;
757 hlist_for_each_entry(pol, entry,
758 &xfrm_policy_inexact[dir], bydst) {
759 if (pol->type != type)
761 err = security_xfrm_policy_delete(pol->security);
763 xfrm_audit_policy_delete(pol, 0,
764 audit_info->loginuid,
765 audit_info->sessionid,
770 for (i = xfrm_policy_bydst[dir].hmask; i >= 0; i--) {
771 hlist_for_each_entry(pol, entry,
772 xfrm_policy_bydst[dir].table + i,
774 if (pol->type != type)
776 err = security_xfrm_policy_delete(
779 xfrm_audit_policy_delete(pol, 0,
780 audit_info->loginuid,
781 audit_info->sessionid,
792 xfrm_policy_flush_secctx_check(u8 type, struct xfrm_audit *audit_info)
798 int xfrm_policy_flush(u8 type, struct xfrm_audit *audit_info)
802 write_lock_bh(&xfrm_policy_lock);
804 err = xfrm_policy_flush_secctx_check(type, audit_info);
808 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
809 struct xfrm_policy *pol;
810 struct hlist_node *entry;
815 hlist_for_each_entry(pol, entry,
816 &xfrm_policy_inexact[dir], bydst) {
817 if (pol->type != type)
819 hlist_del(&pol->bydst);
820 hlist_del(&pol->byidx);
821 write_unlock_bh(&xfrm_policy_lock);
823 xfrm_audit_policy_delete(pol, 1, audit_info->loginuid,
824 audit_info->sessionid,
827 xfrm_policy_kill(pol);
830 write_lock_bh(&xfrm_policy_lock);
834 for (i = xfrm_policy_bydst[dir].hmask; i >= 0; i--) {
836 hlist_for_each_entry(pol, entry,
837 xfrm_policy_bydst[dir].table + i,
839 if (pol->type != type)
841 hlist_del(&pol->bydst);
842 hlist_del(&pol->byidx);
843 list_del(&pol->walk.all);
844 write_unlock_bh(&xfrm_policy_lock);
846 xfrm_audit_policy_delete(pol, 1,
847 audit_info->loginuid,
848 audit_info->sessionid,
850 xfrm_policy_kill(pol);
853 write_lock_bh(&xfrm_policy_lock);
858 xfrm_policy_count[dir] -= killed;
860 atomic_inc(&flow_cache_genid);
862 write_unlock_bh(&xfrm_policy_lock);
865 EXPORT_SYMBOL(xfrm_policy_flush);
867 int xfrm_policy_walk(struct xfrm_policy_walk *walk,
868 int (*func)(struct xfrm_policy *, int, int, void*),
871 struct xfrm_policy *pol;
872 struct xfrm_policy_walk_entry *x;
875 if (walk->type >= XFRM_POLICY_TYPE_MAX &&
876 walk->type != XFRM_POLICY_TYPE_ANY)
879 if (list_empty(&walk->walk.all) && walk->seq != 0)
882 write_lock_bh(&xfrm_policy_lock);
883 if (list_empty(&walk->walk.all))
884 x = list_first_entry(&xfrm_policy_all, struct xfrm_policy_walk_entry, all);
886 x = list_entry(&walk->walk.all, struct xfrm_policy_walk_entry, all);
887 list_for_each_entry_from(x, &xfrm_policy_all, all) {
890 pol = container_of(x, struct xfrm_policy, walk);
891 if (walk->type != XFRM_POLICY_TYPE_ANY &&
892 walk->type != pol->type)
894 error = func(pol, xfrm_policy_id2dir(pol->index),
897 list_move_tail(&walk->walk.all, &x->all);
902 if (walk->seq == 0) {
906 list_del_init(&walk->walk.all);
908 write_unlock_bh(&xfrm_policy_lock);
911 EXPORT_SYMBOL(xfrm_policy_walk);
913 void xfrm_policy_walk_init(struct xfrm_policy_walk *walk, u8 type)
915 INIT_LIST_HEAD(&walk->walk.all);
920 EXPORT_SYMBOL(xfrm_policy_walk_init);
922 void xfrm_policy_walk_done(struct xfrm_policy_walk *walk)
924 if (list_empty(&walk->walk.all))
927 write_lock_bh(&xfrm_policy_lock);
928 list_del(&walk->walk.all);
929 write_unlock_bh(&xfrm_policy_lock);
931 EXPORT_SYMBOL(xfrm_policy_walk_done);
934 * Find policy to apply to this flow.
936 * Returns 0 if policy found, else an -errno.
938 static int xfrm_policy_match(struct xfrm_policy *pol, struct flowi *fl,
939 u8 type, u16 family, int dir)
941 struct xfrm_selector *sel = &pol->selector;
942 int match, ret = -ESRCH;
944 if (pol->family != family ||
948 match = xfrm_selector_match(sel, fl, family);
950 ret = security_xfrm_policy_lookup(pol->security, fl->secid,
956 static struct xfrm_policy *xfrm_policy_lookup_bytype(u8 type, struct flowi *fl,
960 struct xfrm_policy *pol, *ret;
961 xfrm_address_t *daddr, *saddr;
962 struct hlist_node *entry;
963 struct hlist_head *chain;
966 daddr = xfrm_flowi_daddr(fl, family);
967 saddr = xfrm_flowi_saddr(fl, family);
968 if (unlikely(!daddr || !saddr))
971 read_lock_bh(&xfrm_policy_lock);
972 chain = policy_hash_direct(daddr, saddr, family, dir);
974 hlist_for_each_entry(pol, entry, chain, bydst) {
975 err = xfrm_policy_match(pol, fl, type, family, dir);
985 priority = ret->priority;
989 chain = &xfrm_policy_inexact[dir];
990 hlist_for_each_entry(pol, entry, chain, bydst) {
991 err = xfrm_policy_match(pol, fl, type, family, dir);
999 } else if (pol->priority < priority) {
1007 read_unlock_bh(&xfrm_policy_lock);
1012 static int xfrm_policy_lookup(struct flowi *fl, u16 family, u8 dir,
1013 void **objp, atomic_t **obj_refp)
1015 struct xfrm_policy *pol;
1018 #ifdef CONFIG_XFRM_SUB_POLICY
1019 pol = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_SUB, fl, family, dir);
1027 pol = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN, fl, family, dir);
1032 #ifdef CONFIG_XFRM_SUB_POLICY
1035 if ((*objp = (void *) pol) != NULL)
1036 *obj_refp = &pol->refcnt;
1040 static inline int policy_to_flow_dir(int dir)
1042 if (XFRM_POLICY_IN == FLOW_DIR_IN &&
1043 XFRM_POLICY_OUT == FLOW_DIR_OUT &&
1044 XFRM_POLICY_FWD == FLOW_DIR_FWD)
1048 case XFRM_POLICY_IN:
1050 case XFRM_POLICY_OUT:
1051 return FLOW_DIR_OUT;
1052 case XFRM_POLICY_FWD:
1053 return FLOW_DIR_FWD;
1057 static struct xfrm_policy *xfrm_sk_policy_lookup(struct sock *sk, int dir, struct flowi *fl)
1059 struct xfrm_policy *pol;
1061 read_lock_bh(&xfrm_policy_lock);
1062 if ((pol = sk->sk_policy[dir]) != NULL) {
1063 int match = xfrm_selector_match(&pol->selector, fl,
1068 err = security_xfrm_policy_lookup(pol->security,
1070 policy_to_flow_dir(dir));
1073 else if (err == -ESRCH)
1080 read_unlock_bh(&xfrm_policy_lock);
1084 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir)
1086 struct hlist_head *chain = policy_hash_bysel(&pol->selector,
1089 list_add(&pol->walk.all, &xfrm_policy_all);
1090 hlist_add_head(&pol->bydst, chain);
1091 hlist_add_head(&pol->byidx, xfrm_policy_byidx+idx_hash(pol->index));
1092 xfrm_policy_count[dir]++;
1095 if (xfrm_bydst_should_resize(dir, NULL))
1096 schedule_work(&xfrm_hash_work);
1099 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
1102 if (hlist_unhashed(&pol->bydst))
1105 hlist_del(&pol->bydst);
1106 hlist_del(&pol->byidx);
1107 list_del(&pol->walk.all);
1108 xfrm_policy_count[dir]--;
1113 int xfrm_policy_delete(struct xfrm_policy *pol, int dir)
1115 write_lock_bh(&xfrm_policy_lock);
1116 pol = __xfrm_policy_unlink(pol, dir);
1117 write_unlock_bh(&xfrm_policy_lock);
1119 if (dir < XFRM_POLICY_MAX)
1120 atomic_inc(&flow_cache_genid);
1121 xfrm_policy_kill(pol);
1126 EXPORT_SYMBOL(xfrm_policy_delete);
1128 int xfrm_sk_policy_insert(struct sock *sk, int dir, struct xfrm_policy *pol)
1130 struct xfrm_policy *old_pol;
1132 #ifdef CONFIG_XFRM_SUB_POLICY
1133 if (pol && pol->type != XFRM_POLICY_TYPE_MAIN)
1137 write_lock_bh(&xfrm_policy_lock);
1138 old_pol = sk->sk_policy[dir];
1139 sk->sk_policy[dir] = pol;
1141 pol->curlft.add_time = get_seconds();
1142 pol->index = xfrm_gen_index(XFRM_POLICY_MAX+dir);
1143 __xfrm_policy_link(pol, XFRM_POLICY_MAX+dir);
1146 __xfrm_policy_unlink(old_pol, XFRM_POLICY_MAX+dir);
1147 write_unlock_bh(&xfrm_policy_lock);
1150 xfrm_policy_kill(old_pol);
1155 static struct xfrm_policy *clone_policy(struct xfrm_policy *old, int dir)
1157 struct xfrm_policy *newp = xfrm_policy_alloc(xp_net(old), GFP_ATOMIC);
1160 newp->selector = old->selector;
1161 if (security_xfrm_policy_clone(old->security,
1164 return NULL; /* ENOMEM */
1166 newp->lft = old->lft;
1167 newp->curlft = old->curlft;
1168 newp->action = old->action;
1169 newp->flags = old->flags;
1170 newp->xfrm_nr = old->xfrm_nr;
1171 newp->index = old->index;
1172 newp->type = old->type;
1173 memcpy(newp->xfrm_vec, old->xfrm_vec,
1174 newp->xfrm_nr*sizeof(struct xfrm_tmpl));
1175 write_lock_bh(&xfrm_policy_lock);
1176 __xfrm_policy_link(newp, XFRM_POLICY_MAX+dir);
1177 write_unlock_bh(&xfrm_policy_lock);
1183 int __xfrm_sk_clone_policy(struct sock *sk)
1185 struct xfrm_policy *p0 = sk->sk_policy[0],
1186 *p1 = sk->sk_policy[1];
1188 sk->sk_policy[0] = sk->sk_policy[1] = NULL;
1189 if (p0 && (sk->sk_policy[0] = clone_policy(p0, 0)) == NULL)
1191 if (p1 && (sk->sk_policy[1] = clone_policy(p1, 1)) == NULL)
1197 xfrm_get_saddr(xfrm_address_t *local, xfrm_address_t *remote,
1198 unsigned short family)
1201 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1203 if (unlikely(afinfo == NULL))
1205 err = afinfo->get_saddr(local, remote);
1206 xfrm_policy_put_afinfo(afinfo);
1210 /* Resolve list of templates for the flow, given policy. */
1213 xfrm_tmpl_resolve_one(struct xfrm_policy *policy, struct flowi *fl,
1214 struct xfrm_state **xfrm,
1215 unsigned short family)
1219 xfrm_address_t *daddr = xfrm_flowi_daddr(fl, family);
1220 xfrm_address_t *saddr = xfrm_flowi_saddr(fl, family);
1223 for (nx=0, i = 0; i < policy->xfrm_nr; i++) {
1224 struct xfrm_state *x;
1225 xfrm_address_t *remote = daddr;
1226 xfrm_address_t *local = saddr;
1227 struct xfrm_tmpl *tmpl = &policy->xfrm_vec[i];
1229 if (tmpl->mode == XFRM_MODE_TUNNEL ||
1230 tmpl->mode == XFRM_MODE_BEET) {
1231 remote = &tmpl->id.daddr;
1232 local = &tmpl->saddr;
1233 family = tmpl->encap_family;
1234 if (xfrm_addr_any(local, family)) {
1235 error = xfrm_get_saddr(&tmp, remote, family);
1242 x = xfrm_state_find(remote, local, fl, tmpl, policy, &error, family);
1244 if (x && x->km.state == XFRM_STATE_VALID) {
1251 error = (x->km.state == XFRM_STATE_ERROR ?
1255 else if (error == -ESRCH)
1258 if (!tmpl->optional)
1264 for (nx--; nx>=0; nx--)
1265 xfrm_state_put(xfrm[nx]);
1270 xfrm_tmpl_resolve(struct xfrm_policy **pols, int npols, struct flowi *fl,
1271 struct xfrm_state **xfrm,
1272 unsigned short family)
1274 struct xfrm_state *tp[XFRM_MAX_DEPTH];
1275 struct xfrm_state **tpp = (npols > 1) ? tp : xfrm;
1281 for (i = 0; i < npols; i++) {
1282 if (cnx + pols[i]->xfrm_nr >= XFRM_MAX_DEPTH) {
1287 ret = xfrm_tmpl_resolve_one(pols[i], fl, &tpp[cnx], family);
1295 /* found states are sorted for outbound processing */
1297 xfrm_state_sort(xfrm, tpp, cnx, family);
1302 for (cnx--; cnx>=0; cnx--)
1303 xfrm_state_put(tpp[cnx]);
1308 /* Check that the bundle accepts the flow and its components are
1312 static struct dst_entry *
1313 xfrm_find_bundle(struct flowi *fl, struct xfrm_policy *policy, unsigned short family)
1315 struct dst_entry *x;
1316 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1317 if (unlikely(afinfo == NULL))
1318 return ERR_PTR(-EINVAL);
1319 x = afinfo->find_bundle(fl, policy);
1320 xfrm_policy_put_afinfo(afinfo);
1324 static inline int xfrm_get_tos(struct flowi *fl, int family)
1326 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1332 tos = afinfo->get_tos(fl);
1334 xfrm_policy_put_afinfo(afinfo);
1339 static inline struct xfrm_dst *xfrm_alloc_dst(int family)
1341 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1342 struct xfrm_dst *xdst;
1345 return ERR_PTR(-EINVAL);
1347 xdst = dst_alloc(afinfo->dst_ops) ?: ERR_PTR(-ENOBUFS);
1349 xfrm_policy_put_afinfo(afinfo);
1354 static inline int xfrm_init_path(struct xfrm_dst *path, struct dst_entry *dst,
1357 struct xfrm_policy_afinfo *afinfo =
1358 xfrm_policy_get_afinfo(dst->ops->family);
1364 err = afinfo->init_path(path, dst, nfheader_len);
1366 xfrm_policy_put_afinfo(afinfo);
1371 static inline int xfrm_fill_dst(struct xfrm_dst *xdst, struct net_device *dev)
1373 struct xfrm_policy_afinfo *afinfo =
1374 xfrm_policy_get_afinfo(xdst->u.dst.ops->family);
1380 err = afinfo->fill_dst(xdst, dev);
1382 xfrm_policy_put_afinfo(afinfo);
1387 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
1388 * all the metrics... Shortly, bundle a bundle.
1391 static struct dst_entry *xfrm_bundle_create(struct xfrm_policy *policy,
1392 struct xfrm_state **xfrm, int nx,
1394 struct dst_entry *dst)
1396 unsigned long now = jiffies;
1397 struct net_device *dev;
1398 struct dst_entry *dst_prev = NULL;
1399 struct dst_entry *dst0 = NULL;
1403 int nfheader_len = 0;
1404 int trailer_len = 0;
1406 int family = policy->selector.family;
1407 xfrm_address_t saddr, daddr;
1409 xfrm_flowi_addr_get(fl, &saddr, &daddr, family);
1411 tos = xfrm_get_tos(fl, family);
1418 for (; i < nx; i++) {
1419 struct xfrm_dst *xdst = xfrm_alloc_dst(family);
1420 struct dst_entry *dst1 = &xdst->u.dst;
1422 err = PTR_ERR(xdst);
1431 dst_prev->child = dst_clone(dst1);
1432 dst1->flags |= DST_NOHASH;
1436 memcpy(&dst1->metrics, &dst->metrics, sizeof(dst->metrics));
1438 if (xfrm[i]->props.mode != XFRM_MODE_TRANSPORT) {
1439 family = xfrm[i]->props.family;
1440 dst = xfrm_dst_lookup(xfrm[i], tos, &saddr, &daddr,
1448 dst1->xfrm = xfrm[i];
1449 xdst->genid = xfrm[i]->genid;
1451 dst1->obsolete = -1;
1452 dst1->flags |= DST_HOST;
1453 dst1->lastuse = now;
1455 dst1->input = dst_discard;
1456 dst1->output = xfrm[i]->outer_mode->afinfo->output;
1458 dst1->next = dst_prev;
1461 header_len += xfrm[i]->props.header_len;
1462 if (xfrm[i]->type->flags & XFRM_TYPE_NON_FRAGMENT)
1463 nfheader_len += xfrm[i]->props.header_len;
1464 trailer_len += xfrm[i]->props.trailer_len;
1467 dst_prev->child = dst;
1475 /* Copy neighbout for reachability confirmation */
1476 dst0->neighbour = neigh_clone(dst->neighbour);
1478 xfrm_init_path((struct xfrm_dst *)dst0, dst, nfheader_len);
1479 xfrm_init_pmtu(dst_prev);
1481 for (dst_prev = dst0; dst_prev != dst; dst_prev = dst_prev->child) {
1482 struct xfrm_dst *xdst = (struct xfrm_dst *)dst_prev;
1484 err = xfrm_fill_dst(xdst, dev);
1488 dst_prev->header_len = header_len;
1489 dst_prev->trailer_len = trailer_len;
1490 header_len -= xdst->u.dst.xfrm->props.header_len;
1491 trailer_len -= xdst->u.dst.xfrm->props.trailer_len;
1499 xfrm_state_put(xfrm[i]);
1503 dst0 = ERR_PTR(err);
1508 xfrm_dst_alloc_copy(void **target, void *src, int size)
1511 *target = kmalloc(size, GFP_ATOMIC);
1515 memcpy(*target, src, size);
1520 xfrm_dst_update_parent(struct dst_entry *dst, struct xfrm_selector *sel)
1522 #ifdef CONFIG_XFRM_SUB_POLICY
1523 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1524 return xfrm_dst_alloc_copy((void **)&(xdst->partner),
1532 xfrm_dst_update_origin(struct dst_entry *dst, struct flowi *fl)
1534 #ifdef CONFIG_XFRM_SUB_POLICY
1535 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1536 return xfrm_dst_alloc_copy((void **)&(xdst->origin), fl, sizeof(*fl));
1542 static int stale_bundle(struct dst_entry *dst);
1544 /* Main function: finds/creates a bundle for given flow.
1546 * At the moment we eat a raw IP route. Mostly to speed up lookups
1547 * on interfaces with disabled IPsec.
1549 int __xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
1550 struct sock *sk, int flags)
1552 struct xfrm_policy *policy;
1553 struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
1558 struct xfrm_state *xfrm[XFRM_MAX_DEPTH];
1559 struct dst_entry *dst, *dst_orig = *dst_p;
1564 u8 dir = policy_to_flow_dir(XFRM_POLICY_OUT);
1567 genid = atomic_read(&flow_cache_genid);
1569 for (pi = 0; pi < ARRAY_SIZE(pols); pi++)
1575 if (sk && sk->sk_policy[XFRM_POLICY_OUT]) {
1576 policy = xfrm_sk_policy_lookup(sk, XFRM_POLICY_OUT, fl);
1577 err = PTR_ERR(policy);
1578 if (IS_ERR(policy)) {
1579 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLERROR);
1585 /* To accelerate a bit... */
1586 if ((dst_orig->flags & DST_NOXFRM) ||
1587 !xfrm_policy_count[XFRM_POLICY_OUT])
1590 policy = flow_cache_lookup(fl, dst_orig->ops->family,
1591 dir, xfrm_policy_lookup);
1592 err = PTR_ERR(policy);
1593 if (IS_ERR(policy)) {
1594 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLERROR);
1602 family = dst_orig->ops->family;
1605 xfrm_nr += pols[0]->xfrm_nr;
1608 if ((flags & XFRM_LOOKUP_ICMP) && !(policy->flags & XFRM_POLICY_ICMP))
1611 policy->curlft.use_time = get_seconds();
1613 switch (policy->action) {
1615 case XFRM_POLICY_BLOCK:
1616 /* Prohibit the flow */
1617 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLBLOCK);
1621 case XFRM_POLICY_ALLOW:
1622 #ifndef CONFIG_XFRM_SUB_POLICY
1623 if (policy->xfrm_nr == 0) {
1624 /* Flow passes not transformed. */
1625 xfrm_pol_put(policy);
1630 /* Try to find matching bundle.
1632 * LATER: help from flow cache. It is optional, this
1633 * is required only for output policy.
1635 dst = xfrm_find_bundle(fl, policy, family);
1637 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLECHECKERROR);
1645 #ifdef CONFIG_XFRM_SUB_POLICY
1646 if (pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
1647 pols[1] = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN,
1651 if (IS_ERR(pols[1])) {
1652 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLERROR);
1653 err = PTR_ERR(pols[1]);
1656 if (pols[1]->action == XFRM_POLICY_BLOCK) {
1657 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLBLOCK);
1662 xfrm_nr += pols[1]->xfrm_nr;
1667 * Because neither flowi nor bundle information knows about
1668 * transformation template size. On more than one policy usage
1669 * we can realize whether all of them is bypass or not after
1670 * they are searched. See above not-transformed bypass
1671 * is surrounded by non-sub policy configuration, too.
1674 /* Flow passes not transformed. */
1675 xfrm_pols_put(pols, npols);
1680 nx = xfrm_tmpl_resolve(pols, npols, fl, xfrm, family);
1682 if (unlikely(nx<0)) {
1684 if (err == -EAGAIN && sysctl_xfrm_larval_drop) {
1685 /* EREMOTE tells the caller to generate
1686 * a one-shot blackhole route.
1688 XFRM_INC_STATS(LINUX_MIB_XFRMOUTNOSTATES);
1689 xfrm_pol_put(policy);
1692 if (err == -EAGAIN && (flags & XFRM_LOOKUP_WAIT)) {
1693 DECLARE_WAITQUEUE(wait, current);
1695 add_wait_queue(&init_net.xfrm.km_waitq, &wait);
1696 set_current_state(TASK_INTERRUPTIBLE);
1698 set_current_state(TASK_RUNNING);
1699 remove_wait_queue(&init_net.xfrm.km_waitq, &wait);
1701 nx = xfrm_tmpl_resolve(pols, npols, fl, xfrm, family);
1703 if (nx == -EAGAIN && signal_pending(current)) {
1704 XFRM_INC_STATS(LINUX_MIB_XFRMOUTNOSTATES);
1708 if (nx == -EAGAIN ||
1709 genid != atomic_read(&flow_cache_genid)) {
1710 xfrm_pols_put(pols, npols);
1716 XFRM_INC_STATS(LINUX_MIB_XFRMOUTNOSTATES);
1721 /* Flow passes not transformed. */
1722 xfrm_pols_put(pols, npols);
1726 dst = xfrm_bundle_create(policy, xfrm, nx, fl, dst_orig);
1729 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLEGENERROR);
1733 for (pi = 0; pi < npols; pi++) {
1734 read_lock_bh(&pols[pi]->lock);
1735 pol_dead |= pols[pi]->walk.dead;
1736 read_unlock_bh(&pols[pi]->lock);
1739 write_lock_bh(&policy->lock);
1740 if (unlikely(pol_dead || stale_bundle(dst))) {
1741 /* Wow! While we worked on resolving, this
1742 * policy has gone. Retry. It is not paranoia,
1743 * we just cannot enlist new bundle to dead object.
1744 * We can't enlist stable bundles either.
1746 write_unlock_bh(&policy->lock);
1750 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLDEAD);
1752 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLECHECKERROR);
1753 err = -EHOSTUNREACH;
1758 err = xfrm_dst_update_parent(dst, &pols[1]->selector);
1760 err = xfrm_dst_update_origin(dst, fl);
1761 if (unlikely(err)) {
1762 write_unlock_bh(&policy->lock);
1764 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLECHECKERROR);
1768 dst->next = policy->bundles;
1769 policy->bundles = dst;
1771 write_unlock_bh(&policy->lock);
1774 dst_release(dst_orig);
1775 xfrm_pols_put(pols, npols);
1779 xfrm_pols_put(pols, npols);
1781 dst_release(dst_orig);
1787 if (flags & XFRM_LOOKUP_ICMP)
1791 EXPORT_SYMBOL(__xfrm_lookup);
1793 int xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
1794 struct sock *sk, int flags)
1796 int err = __xfrm_lookup(dst_p, fl, sk, flags);
1798 if (err == -EREMOTE) {
1799 dst_release(*dst_p);
1806 EXPORT_SYMBOL(xfrm_lookup);
1809 xfrm_secpath_reject(int idx, struct sk_buff *skb, struct flowi *fl)
1811 struct xfrm_state *x;
1813 if (!skb->sp || idx < 0 || idx >= skb->sp->len)
1815 x = skb->sp->xvec[idx];
1816 if (!x->type->reject)
1818 return x->type->reject(x, skb, fl);
1821 /* When skb is transformed back to its "native" form, we have to
1822 * check policy restrictions. At the moment we make this in maximally
1823 * stupid way. Shame on me. :-) Of course, connected sockets must
1824 * have policy cached at them.
1828 xfrm_state_ok(struct xfrm_tmpl *tmpl, struct xfrm_state *x,
1829 unsigned short family)
1831 if (xfrm_state_kern(x))
1832 return tmpl->optional && !xfrm_state_addr_cmp(tmpl, x, tmpl->encap_family);
1833 return x->id.proto == tmpl->id.proto &&
1834 (x->id.spi == tmpl->id.spi || !tmpl->id.spi) &&
1835 (x->props.reqid == tmpl->reqid || !tmpl->reqid) &&
1836 x->props.mode == tmpl->mode &&
1837 (tmpl->allalgs || (tmpl->aalgos & (1<<x->props.aalgo)) ||
1838 !(xfrm_id_proto_match(tmpl->id.proto, IPSEC_PROTO_ANY))) &&
1839 !(x->props.mode != XFRM_MODE_TRANSPORT &&
1840 xfrm_state_addr_cmp(tmpl, x, family));
1844 * 0 or more than 0 is returned when validation is succeeded (either bypass
1845 * because of optional transport mode, or next index of the mathced secpath
1846 * state with the template.
1847 * -1 is returned when no matching template is found.
1848 * Otherwise "-2 - errored_index" is returned.
1851 xfrm_policy_ok(struct xfrm_tmpl *tmpl, struct sec_path *sp, int start,
1852 unsigned short family)
1856 if (tmpl->optional) {
1857 if (tmpl->mode == XFRM_MODE_TRANSPORT)
1861 for (; idx < sp->len; idx++) {
1862 if (xfrm_state_ok(tmpl, sp->xvec[idx], family))
1864 if (sp->xvec[idx]->props.mode != XFRM_MODE_TRANSPORT) {
1873 int __xfrm_decode_session(struct sk_buff *skb, struct flowi *fl,
1874 unsigned int family, int reverse)
1876 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1879 if (unlikely(afinfo == NULL))
1880 return -EAFNOSUPPORT;
1882 afinfo->decode_session(skb, fl, reverse);
1883 err = security_xfrm_decode_session(skb, &fl->secid);
1884 xfrm_policy_put_afinfo(afinfo);
1887 EXPORT_SYMBOL(__xfrm_decode_session);
1889 static inline int secpath_has_nontransport(struct sec_path *sp, int k, int *idxp)
1891 for (; k < sp->len; k++) {
1892 if (sp->xvec[k]->props.mode != XFRM_MODE_TRANSPORT) {
1901 int __xfrm_policy_check(struct sock *sk, int dir, struct sk_buff *skb,
1902 unsigned short family)
1904 struct xfrm_policy *pol;
1905 struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
1914 reverse = dir & ~XFRM_POLICY_MASK;
1915 dir &= XFRM_POLICY_MASK;
1916 fl_dir = policy_to_flow_dir(dir);
1918 if (__xfrm_decode_session(skb, &fl, family, reverse) < 0) {
1919 XFRM_INC_STATS(LINUX_MIB_XFRMINHDRERROR);
1923 nf_nat_decode_session(skb, &fl, family);
1925 /* First, check used SA against their selectors. */
1929 for (i=skb->sp->len-1; i>=0; i--) {
1930 struct xfrm_state *x = skb->sp->xvec[i];
1931 if (!xfrm_selector_match(&x->sel, &fl, family)) {
1932 XFRM_INC_STATS(LINUX_MIB_XFRMINSTATEMISMATCH);
1939 if (sk && sk->sk_policy[dir]) {
1940 pol = xfrm_sk_policy_lookup(sk, dir, &fl);
1942 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLERROR);
1948 pol = flow_cache_lookup(&fl, family, fl_dir,
1949 xfrm_policy_lookup);
1952 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLERROR);
1957 if (skb->sp && secpath_has_nontransport(skb->sp, 0, &xerr_idx)) {
1958 xfrm_secpath_reject(xerr_idx, skb, &fl);
1959 XFRM_INC_STATS(LINUX_MIB_XFRMINNOPOLS);
1965 pol->curlft.use_time = get_seconds();
1969 #ifdef CONFIG_XFRM_SUB_POLICY
1970 if (pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
1971 pols[1] = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN,
1975 if (IS_ERR(pols[1])) {
1976 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLERROR);
1979 pols[1]->curlft.use_time = get_seconds();
1985 if (pol->action == XFRM_POLICY_ALLOW) {
1986 struct sec_path *sp;
1987 static struct sec_path dummy;
1988 struct xfrm_tmpl *tp[XFRM_MAX_DEPTH];
1989 struct xfrm_tmpl *stp[XFRM_MAX_DEPTH];
1990 struct xfrm_tmpl **tpp = tp;
1994 if ((sp = skb->sp) == NULL)
1997 for (pi = 0; pi < npols; pi++) {
1998 if (pols[pi] != pol &&
1999 pols[pi]->action != XFRM_POLICY_ALLOW) {
2000 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLBLOCK);
2003 if (ti + pols[pi]->xfrm_nr >= XFRM_MAX_DEPTH) {
2004 XFRM_INC_STATS(LINUX_MIB_XFRMINBUFFERERROR);
2007 for (i = 0; i < pols[pi]->xfrm_nr; i++)
2008 tpp[ti++] = &pols[pi]->xfrm_vec[i];
2012 xfrm_tmpl_sort(stp, tpp, xfrm_nr, family);
2016 /* For each tunnel xfrm, find the first matching tmpl.
2017 * For each tmpl before that, find corresponding xfrm.
2018 * Order is _important_. Later we will implement
2019 * some barriers, but at the moment barriers
2020 * are implied between each two transformations.
2022 for (i = xfrm_nr-1, k = 0; i >= 0; i--) {
2023 k = xfrm_policy_ok(tpp[i], sp, k, family);
2026 /* "-2 - errored_index" returned */
2028 XFRM_INC_STATS(LINUX_MIB_XFRMINTMPLMISMATCH);
2033 if (secpath_has_nontransport(sp, k, &xerr_idx)) {
2034 XFRM_INC_STATS(LINUX_MIB_XFRMINTMPLMISMATCH);
2038 xfrm_pols_put(pols, npols);
2041 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLBLOCK);
2044 xfrm_secpath_reject(xerr_idx, skb, &fl);
2046 xfrm_pols_put(pols, npols);
2049 EXPORT_SYMBOL(__xfrm_policy_check);
2051 int __xfrm_route_forward(struct sk_buff *skb, unsigned short family)
2055 if (xfrm_decode_session(skb, &fl, family) < 0) {
2056 /* XXX: we should have something like FWDHDRERROR here. */
2057 XFRM_INC_STATS(LINUX_MIB_XFRMINHDRERROR);
2061 return xfrm_lookup(&skb->dst, &fl, NULL, 0) == 0;
2063 EXPORT_SYMBOL(__xfrm_route_forward);
2065 /* Optimize later using cookies and generation ids. */
2067 static struct dst_entry *xfrm_dst_check(struct dst_entry *dst, u32 cookie)
2069 /* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
2070 * to "-1" to force all XFRM destinations to get validated by
2071 * dst_ops->check on every use. We do this because when a
2072 * normal route referenced by an XFRM dst is obsoleted we do
2073 * not go looking around for all parent referencing XFRM dsts
2074 * so that we can invalidate them. It is just too much work.
2075 * Instead we make the checks here on every use. For example:
2077 * XFRM dst A --> IPv4 dst X
2079 * X is the "xdst->route" of A (X is also the "dst->path" of A
2080 * in this example). If X is marked obsolete, "A" will not
2081 * notice. That's what we are validating here via the
2082 * stale_bundle() check.
2084 * When a policy's bundle is pruned, we dst_free() the XFRM
2085 * dst which causes it's ->obsolete field to be set to a
2086 * positive non-zero integer. If an XFRM dst has been pruned
2087 * like this, we want to force a new route lookup.
2089 if (dst->obsolete < 0 && !stale_bundle(dst))
2095 static int stale_bundle(struct dst_entry *dst)
2097 return !xfrm_bundle_ok(NULL, (struct xfrm_dst *)dst, NULL, AF_UNSPEC, 0);
2100 void xfrm_dst_ifdown(struct dst_entry *dst, struct net_device *dev)
2102 while ((dst = dst->child) && dst->xfrm && dst->dev == dev) {
2103 dst->dev = dev_net(dev)->loopback_dev;
2108 EXPORT_SYMBOL(xfrm_dst_ifdown);
2110 static void xfrm_link_failure(struct sk_buff *skb)
2112 /* Impossible. Such dst must be popped before reaches point of failure. */
2116 static struct dst_entry *xfrm_negative_advice(struct dst_entry *dst)
2119 if (dst->obsolete) {
2127 static void prune_one_bundle(struct xfrm_policy *pol, int (*func)(struct dst_entry *), struct dst_entry **gc_list_p)
2129 struct dst_entry *dst, **dstp;
2131 write_lock(&pol->lock);
2132 dstp = &pol->bundles;
2133 while ((dst=*dstp) != NULL) {
2136 dst->next = *gc_list_p;
2142 write_unlock(&pol->lock);
2145 static void xfrm_prune_bundles(int (*func)(struct dst_entry *))
2147 struct dst_entry *gc_list = NULL;
2150 read_lock_bh(&xfrm_policy_lock);
2151 for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
2152 struct xfrm_policy *pol;
2153 struct hlist_node *entry;
2154 struct hlist_head *table;
2157 hlist_for_each_entry(pol, entry,
2158 &xfrm_policy_inexact[dir], bydst)
2159 prune_one_bundle(pol, func, &gc_list);
2161 table = xfrm_policy_bydst[dir].table;
2162 for (i = xfrm_policy_bydst[dir].hmask; i >= 0; i--) {
2163 hlist_for_each_entry(pol, entry, table + i, bydst)
2164 prune_one_bundle(pol, func, &gc_list);
2167 read_unlock_bh(&xfrm_policy_lock);
2170 struct dst_entry *dst = gc_list;
2171 gc_list = dst->next;
2176 static int unused_bundle(struct dst_entry *dst)
2178 return !atomic_read(&dst->__refcnt);
2181 static void __xfrm_garbage_collect(void)
2183 xfrm_prune_bundles(unused_bundle);
2186 static int xfrm_flush_bundles(void)
2188 xfrm_prune_bundles(stale_bundle);
2192 static void xfrm_init_pmtu(struct dst_entry *dst)
2195 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
2196 u32 pmtu, route_mtu_cached;
2198 pmtu = dst_mtu(dst->child);
2199 xdst->child_mtu_cached = pmtu;
2201 pmtu = xfrm_state_mtu(dst->xfrm, pmtu);
2203 route_mtu_cached = dst_mtu(xdst->route);
2204 xdst->route_mtu_cached = route_mtu_cached;
2206 if (pmtu > route_mtu_cached)
2207 pmtu = route_mtu_cached;
2209 dst->metrics[RTAX_MTU-1] = pmtu;
2210 } while ((dst = dst->next));
2213 /* Check that the bundle accepts the flow and its components are
2217 int xfrm_bundle_ok(struct xfrm_policy *pol, struct xfrm_dst *first,
2218 struct flowi *fl, int family, int strict)
2220 struct dst_entry *dst = &first->u.dst;
2221 struct xfrm_dst *last;
2224 if (!dst_check(dst->path, ((struct xfrm_dst *)dst)->path_cookie) ||
2225 (dst->dev && !netif_running(dst->dev)))
2227 #ifdef CONFIG_XFRM_SUB_POLICY
2229 if (first->origin && !flow_cache_uli_match(first->origin, fl))
2231 if (first->partner &&
2232 !xfrm_selector_match(first->partner, fl, family))
2240 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
2242 if (fl && !xfrm_selector_match(&dst->xfrm->sel, fl, family))
2245 !security_xfrm_state_pol_flow_match(dst->xfrm, pol, fl))
2247 if (dst->xfrm->km.state != XFRM_STATE_VALID)
2249 if (xdst->genid != dst->xfrm->genid)
2253 !(dst->xfrm->outer_mode->flags & XFRM_MODE_FLAG_TUNNEL) &&
2254 !xfrm_state_addr_flow_check(dst->xfrm, fl, family))
2257 mtu = dst_mtu(dst->child);
2258 if (xdst->child_mtu_cached != mtu) {
2260 xdst->child_mtu_cached = mtu;
2263 if (!dst_check(xdst->route, xdst->route_cookie))
2265 mtu = dst_mtu(xdst->route);
2266 if (xdst->route_mtu_cached != mtu) {
2268 xdst->route_mtu_cached = mtu;
2272 } while (dst->xfrm);
2277 mtu = last->child_mtu_cached;
2281 mtu = xfrm_state_mtu(dst->xfrm, mtu);
2282 if (mtu > last->route_mtu_cached)
2283 mtu = last->route_mtu_cached;
2284 dst->metrics[RTAX_MTU-1] = mtu;
2289 last = (struct xfrm_dst *)last->u.dst.next;
2290 last->child_mtu_cached = mtu;
2296 EXPORT_SYMBOL(xfrm_bundle_ok);
2298 int xfrm_policy_register_afinfo(struct xfrm_policy_afinfo *afinfo)
2301 if (unlikely(afinfo == NULL))
2303 if (unlikely(afinfo->family >= NPROTO))
2304 return -EAFNOSUPPORT;
2305 write_lock_bh(&xfrm_policy_afinfo_lock);
2306 if (unlikely(xfrm_policy_afinfo[afinfo->family] != NULL))
2309 struct dst_ops *dst_ops = afinfo->dst_ops;
2310 if (likely(dst_ops->kmem_cachep == NULL))
2311 dst_ops->kmem_cachep = xfrm_dst_cache;
2312 if (likely(dst_ops->check == NULL))
2313 dst_ops->check = xfrm_dst_check;
2314 if (likely(dst_ops->negative_advice == NULL))
2315 dst_ops->negative_advice = xfrm_negative_advice;
2316 if (likely(dst_ops->link_failure == NULL))
2317 dst_ops->link_failure = xfrm_link_failure;
2318 if (likely(afinfo->garbage_collect == NULL))
2319 afinfo->garbage_collect = __xfrm_garbage_collect;
2320 xfrm_policy_afinfo[afinfo->family] = afinfo;
2322 write_unlock_bh(&xfrm_policy_afinfo_lock);
2325 EXPORT_SYMBOL(xfrm_policy_register_afinfo);
2327 int xfrm_policy_unregister_afinfo(struct xfrm_policy_afinfo *afinfo)
2330 if (unlikely(afinfo == NULL))
2332 if (unlikely(afinfo->family >= NPROTO))
2333 return -EAFNOSUPPORT;
2334 write_lock_bh(&xfrm_policy_afinfo_lock);
2335 if (likely(xfrm_policy_afinfo[afinfo->family] != NULL)) {
2336 if (unlikely(xfrm_policy_afinfo[afinfo->family] != afinfo))
2339 struct dst_ops *dst_ops = afinfo->dst_ops;
2340 xfrm_policy_afinfo[afinfo->family] = NULL;
2341 dst_ops->kmem_cachep = NULL;
2342 dst_ops->check = NULL;
2343 dst_ops->negative_advice = NULL;
2344 dst_ops->link_failure = NULL;
2345 afinfo->garbage_collect = NULL;
2348 write_unlock_bh(&xfrm_policy_afinfo_lock);
2351 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo);
2353 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family)
2355 struct xfrm_policy_afinfo *afinfo;
2356 if (unlikely(family >= NPROTO))
2358 read_lock(&xfrm_policy_afinfo_lock);
2359 afinfo = xfrm_policy_afinfo[family];
2360 if (unlikely(!afinfo))
2361 read_unlock(&xfrm_policy_afinfo_lock);
2365 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo)
2367 read_unlock(&xfrm_policy_afinfo_lock);
2370 static int xfrm_dev_event(struct notifier_block *this, unsigned long event, void *ptr)
2372 struct net_device *dev = ptr;
2374 if (!net_eq(dev_net(dev), &init_net))
2379 xfrm_flush_bundles();
2384 static struct notifier_block xfrm_dev_notifier = {
2385 .notifier_call = xfrm_dev_event,
2388 #ifdef CONFIG_XFRM_STATISTICS
2389 static int __init xfrm_statistics_init(void)
2391 if (snmp_mib_init((void **)xfrm_statistics,
2392 sizeof(struct linux_xfrm_mib)) < 0)
2398 static int __net_init xfrm_policy_init(struct net *net)
2400 unsigned int hmask, sz;
2403 if (net_eq(net, &init_net))
2404 xfrm_dst_cache = kmem_cache_create("xfrm_dst_cache",
2405 sizeof(struct xfrm_dst),
2406 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC,
2410 sz = (hmask+1) * sizeof(struct hlist_head);
2412 xfrm_policy_byidx = xfrm_hash_alloc(sz);
2413 xfrm_idx_hmask = hmask;
2414 if (!xfrm_policy_byidx)
2415 panic("XFRM: failed to allocate byidx hash\n");
2417 for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
2418 struct xfrm_policy_hash *htab;
2420 INIT_HLIST_HEAD(&xfrm_policy_inexact[dir]);
2422 htab = &xfrm_policy_bydst[dir];
2423 htab->table = xfrm_hash_alloc(sz);
2424 htab->hmask = hmask;
2426 panic("XFRM: failed to allocate bydst hash\n");
2429 INIT_LIST_HEAD(&xfrm_policy_all);
2430 if (net_eq(net, &init_net))
2431 register_netdevice_notifier(&xfrm_dev_notifier);
2435 static void xfrm_policy_fini(struct net *net)
2439 static int __net_init xfrm_net_init(struct net *net)
2443 rv = xfrm_state_init(net);
2446 rv = xfrm_policy_init(net);
2452 xfrm_state_fini(net);
2457 static void __net_exit xfrm_net_exit(struct net *net)
2459 xfrm_policy_fini(net);
2460 xfrm_state_fini(net);
2463 static struct pernet_operations __net_initdata xfrm_net_ops = {
2464 .init = xfrm_net_init,
2465 .exit = xfrm_net_exit,
2468 void __init xfrm_init(void)
2470 register_pernet_subsys(&xfrm_net_ops);
2471 #ifdef CONFIG_XFRM_STATISTICS
2472 xfrm_statistics_init();
2475 #ifdef CONFIG_XFRM_STATISTICS
2480 #ifdef CONFIG_AUDITSYSCALL
2481 static void xfrm_audit_common_policyinfo(struct xfrm_policy *xp,
2482 struct audit_buffer *audit_buf)
2484 struct xfrm_sec_ctx *ctx = xp->security;
2485 struct xfrm_selector *sel = &xp->selector;
2488 audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
2489 ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
2491 switch(sel->family) {
2493 audit_log_format(audit_buf, " src=%pI4", &sel->saddr.a4);
2494 if (sel->prefixlen_s != 32)
2495 audit_log_format(audit_buf, " src_prefixlen=%d",
2497 audit_log_format(audit_buf, " dst=%pI4", &sel->daddr.a4);
2498 if (sel->prefixlen_d != 32)
2499 audit_log_format(audit_buf, " dst_prefixlen=%d",
2503 audit_log_format(audit_buf, " src=%pI6", sel->saddr.a6);
2504 if (sel->prefixlen_s != 128)
2505 audit_log_format(audit_buf, " src_prefixlen=%d",
2507 audit_log_format(audit_buf, " dst=%pI6", sel->daddr.a6);
2508 if (sel->prefixlen_d != 128)
2509 audit_log_format(audit_buf, " dst_prefixlen=%d",
2515 void xfrm_audit_policy_add(struct xfrm_policy *xp, int result,
2516 uid_t auid, u32 sessionid, u32 secid)
2518 struct audit_buffer *audit_buf;
2520 audit_buf = xfrm_audit_start("SPD-add");
2521 if (audit_buf == NULL)
2523 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2524 audit_log_format(audit_buf, " res=%u", result);
2525 xfrm_audit_common_policyinfo(xp, audit_buf);
2526 audit_log_end(audit_buf);
2528 EXPORT_SYMBOL_GPL(xfrm_audit_policy_add);
2530 void xfrm_audit_policy_delete(struct xfrm_policy *xp, int result,
2531 uid_t auid, u32 sessionid, u32 secid)
2533 struct audit_buffer *audit_buf;
2535 audit_buf = xfrm_audit_start("SPD-delete");
2536 if (audit_buf == NULL)
2538 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2539 audit_log_format(audit_buf, " res=%u", result);
2540 xfrm_audit_common_policyinfo(xp, audit_buf);
2541 audit_log_end(audit_buf);
2543 EXPORT_SYMBOL_GPL(xfrm_audit_policy_delete);
2546 #ifdef CONFIG_XFRM_MIGRATE
2547 static int xfrm_migrate_selector_match(struct xfrm_selector *sel_cmp,
2548 struct xfrm_selector *sel_tgt)
2550 if (sel_cmp->proto == IPSEC_ULPROTO_ANY) {
2551 if (sel_tgt->family == sel_cmp->family &&
2552 xfrm_addr_cmp(&sel_tgt->daddr, &sel_cmp->daddr,
2553 sel_cmp->family) == 0 &&
2554 xfrm_addr_cmp(&sel_tgt->saddr, &sel_cmp->saddr,
2555 sel_cmp->family) == 0 &&
2556 sel_tgt->prefixlen_d == sel_cmp->prefixlen_d &&
2557 sel_tgt->prefixlen_s == sel_cmp->prefixlen_s) {
2561 if (memcmp(sel_tgt, sel_cmp, sizeof(*sel_tgt)) == 0) {
2568 static struct xfrm_policy * xfrm_migrate_policy_find(struct xfrm_selector *sel,
2571 struct xfrm_policy *pol, *ret = NULL;
2572 struct hlist_node *entry;
2573 struct hlist_head *chain;
2576 read_lock_bh(&xfrm_policy_lock);
2577 chain = policy_hash_direct(&sel->daddr, &sel->saddr, sel->family, dir);
2578 hlist_for_each_entry(pol, entry, chain, bydst) {
2579 if (xfrm_migrate_selector_match(sel, &pol->selector) &&
2580 pol->type == type) {
2582 priority = ret->priority;
2586 chain = &xfrm_policy_inexact[dir];
2587 hlist_for_each_entry(pol, entry, chain, bydst) {
2588 if (xfrm_migrate_selector_match(sel, &pol->selector) &&
2589 pol->type == type &&
2590 pol->priority < priority) {
2599 read_unlock_bh(&xfrm_policy_lock);
2604 static int migrate_tmpl_match(struct xfrm_migrate *m, struct xfrm_tmpl *t)
2608 if (t->mode == m->mode && t->id.proto == m->proto &&
2609 (m->reqid == 0 || t->reqid == m->reqid)) {
2611 case XFRM_MODE_TUNNEL:
2612 case XFRM_MODE_BEET:
2613 if (xfrm_addr_cmp(&t->id.daddr, &m->old_daddr,
2614 m->old_family) == 0 &&
2615 xfrm_addr_cmp(&t->saddr, &m->old_saddr,
2616 m->old_family) == 0) {
2620 case XFRM_MODE_TRANSPORT:
2621 /* in case of transport mode, template does not store
2622 any IP addresses, hence we just compare mode and
2633 /* update endpoint address(es) of template(s) */
2634 static int xfrm_policy_migrate(struct xfrm_policy *pol,
2635 struct xfrm_migrate *m, int num_migrate)
2637 struct xfrm_migrate *mp;
2638 struct dst_entry *dst;
2641 write_lock_bh(&pol->lock);
2642 if (unlikely(pol->walk.dead)) {
2643 /* target policy has been deleted */
2644 write_unlock_bh(&pol->lock);
2648 for (i = 0; i < pol->xfrm_nr; i++) {
2649 for (j = 0, mp = m; j < num_migrate; j++, mp++) {
2650 if (!migrate_tmpl_match(mp, &pol->xfrm_vec[i]))
2653 if (pol->xfrm_vec[i].mode != XFRM_MODE_TUNNEL &&
2654 pol->xfrm_vec[i].mode != XFRM_MODE_BEET)
2656 /* update endpoints */
2657 memcpy(&pol->xfrm_vec[i].id.daddr, &mp->new_daddr,
2658 sizeof(pol->xfrm_vec[i].id.daddr));
2659 memcpy(&pol->xfrm_vec[i].saddr, &mp->new_saddr,
2660 sizeof(pol->xfrm_vec[i].saddr));
2661 pol->xfrm_vec[i].encap_family = mp->new_family;
2663 while ((dst = pol->bundles) != NULL) {
2664 pol->bundles = dst->next;
2670 write_unlock_bh(&pol->lock);
2678 static int xfrm_migrate_check(struct xfrm_migrate *m, int num_migrate)
2682 if (num_migrate < 1 || num_migrate > XFRM_MAX_DEPTH)
2685 for (i = 0; i < num_migrate; i++) {
2686 if ((xfrm_addr_cmp(&m[i].old_daddr, &m[i].new_daddr,
2687 m[i].old_family) == 0) &&
2688 (xfrm_addr_cmp(&m[i].old_saddr, &m[i].new_saddr,
2689 m[i].old_family) == 0))
2691 if (xfrm_addr_any(&m[i].new_daddr, m[i].new_family) ||
2692 xfrm_addr_any(&m[i].new_saddr, m[i].new_family))
2695 /* check if there is any duplicated entry */
2696 for (j = i + 1; j < num_migrate; j++) {
2697 if (!memcmp(&m[i].old_daddr, &m[j].old_daddr,
2698 sizeof(m[i].old_daddr)) &&
2699 !memcmp(&m[i].old_saddr, &m[j].old_saddr,
2700 sizeof(m[i].old_saddr)) &&
2701 m[i].proto == m[j].proto &&
2702 m[i].mode == m[j].mode &&
2703 m[i].reqid == m[j].reqid &&
2704 m[i].old_family == m[j].old_family)
2712 int xfrm_migrate(struct xfrm_selector *sel, u8 dir, u8 type,
2713 struct xfrm_migrate *m, int num_migrate,
2714 struct xfrm_kmaddress *k)
2716 int i, err, nx_cur = 0, nx_new = 0;
2717 struct xfrm_policy *pol = NULL;
2718 struct xfrm_state *x, *xc;
2719 struct xfrm_state *x_cur[XFRM_MAX_DEPTH];
2720 struct xfrm_state *x_new[XFRM_MAX_DEPTH];
2721 struct xfrm_migrate *mp;
2723 if ((err = xfrm_migrate_check(m, num_migrate)) < 0)
2726 /* Stage 1 - find policy */
2727 if ((pol = xfrm_migrate_policy_find(sel, dir, type)) == NULL) {
2732 /* Stage 2 - find and update state(s) */
2733 for (i = 0, mp = m; i < num_migrate; i++, mp++) {
2734 if ((x = xfrm_migrate_state_find(mp))) {
2737 if ((xc = xfrm_state_migrate(x, mp))) {
2747 /* Stage 3 - update policy */
2748 if ((err = xfrm_policy_migrate(pol, m, num_migrate)) < 0)
2751 /* Stage 4 - delete old state(s) */
2753 xfrm_states_put(x_cur, nx_cur);
2754 xfrm_states_delete(x_cur, nx_cur);
2757 /* Stage 5 - announce */
2758 km_migrate(sel, dir, type, m, num_migrate, k);
2770 xfrm_states_put(x_cur, nx_cur);
2772 xfrm_states_delete(x_new, nx_new);
2776 EXPORT_SYMBOL(xfrm_migrate);