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/slab.h>
17 #include <linux/kmod.h>
18 #include <linux/list.h>
19 #include <linux/spinlock.h>
20 #include <linux/workqueue.h>
21 #include <linux/notifier.h>
22 #include <linux/netdevice.h>
23 #include <linux/netfilter.h>
24 #include <linux/module.h>
25 #include <linux/cache.h>
28 #include <linux/audit.h>
29 #include <linux/cache.h>
31 #include "xfrm_hash.h"
33 int sysctl_xfrm_larval_drop __read_mostly
;
35 DEFINE_MUTEX(xfrm_cfg_mutex
);
36 EXPORT_SYMBOL(xfrm_cfg_mutex
);
38 static DEFINE_RWLOCK(xfrm_policy_lock
);
40 unsigned int xfrm_policy_count
[XFRM_POLICY_MAX
*2];
41 EXPORT_SYMBOL(xfrm_policy_count
);
43 static DEFINE_RWLOCK(xfrm_policy_afinfo_lock
);
44 static struct xfrm_policy_afinfo
*xfrm_policy_afinfo
[NPROTO
];
46 static struct kmem_cache
*xfrm_dst_cache __read_mostly
;
48 static struct work_struct xfrm_policy_gc_work
;
49 static HLIST_HEAD(xfrm_policy_gc_list
);
50 static DEFINE_SPINLOCK(xfrm_policy_gc_lock
);
52 static struct xfrm_policy_afinfo
*xfrm_policy_get_afinfo(unsigned short family
);
53 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo
*afinfo
);
54 static struct xfrm_policy_afinfo
*xfrm_policy_lock_afinfo(unsigned int family
);
55 static void xfrm_policy_unlock_afinfo(struct xfrm_policy_afinfo
*afinfo
);
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 int xfrm_register_type(struct xfrm_type
*type
, unsigned short family
)
93 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_lock_afinfo(family
);
94 struct xfrm_type
**typemap
;
97 if (unlikely(afinfo
== NULL
))
99 typemap
= afinfo
->type_map
;
101 if (likely(typemap
[type
->proto
] == NULL
))
102 typemap
[type
->proto
] = type
;
105 xfrm_policy_unlock_afinfo(afinfo
);
108 EXPORT_SYMBOL(xfrm_register_type
);
110 int xfrm_unregister_type(struct xfrm_type
*type
, unsigned short family
)
112 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_lock_afinfo(family
);
113 struct xfrm_type
**typemap
;
116 if (unlikely(afinfo
== NULL
))
117 return -EAFNOSUPPORT
;
118 typemap
= afinfo
->type_map
;
120 if (unlikely(typemap
[type
->proto
] != type
))
123 typemap
[type
->proto
] = NULL
;
124 xfrm_policy_unlock_afinfo(afinfo
);
127 EXPORT_SYMBOL(xfrm_unregister_type
);
129 struct xfrm_type
*xfrm_get_type(u8 proto
, unsigned short family
)
131 struct xfrm_policy_afinfo
*afinfo
;
132 struct xfrm_type
**typemap
;
133 struct xfrm_type
*type
;
134 int modload_attempted
= 0;
137 afinfo
= xfrm_policy_get_afinfo(family
);
138 if (unlikely(afinfo
== NULL
))
140 typemap
= afinfo
->type_map
;
142 type
= typemap
[proto
];
143 if (unlikely(type
&& !try_module_get(type
->owner
)))
145 if (!type
&& !modload_attempted
) {
146 xfrm_policy_put_afinfo(afinfo
);
147 request_module("xfrm-type-%d-%d",
148 (int) family
, (int) proto
);
149 modload_attempted
= 1;
153 xfrm_policy_put_afinfo(afinfo
);
157 int xfrm_dst_lookup(struct xfrm_dst
**dst
, struct flowi
*fl
,
158 unsigned short family
)
160 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
163 if (unlikely(afinfo
== NULL
))
164 return -EAFNOSUPPORT
;
166 if (likely(afinfo
->dst_lookup
!= NULL
))
167 err
= afinfo
->dst_lookup(dst
, fl
);
170 xfrm_policy_put_afinfo(afinfo
);
173 EXPORT_SYMBOL(xfrm_dst_lookup
);
175 void xfrm_put_type(struct xfrm_type
*type
)
177 module_put(type
->owner
);
180 int xfrm_register_mode(struct xfrm_mode
*mode
, int family
)
182 struct xfrm_policy_afinfo
*afinfo
;
183 struct xfrm_mode
**modemap
;
186 if (unlikely(mode
->encap
>= XFRM_MODE_MAX
))
189 afinfo
= xfrm_policy_lock_afinfo(family
);
190 if (unlikely(afinfo
== NULL
))
191 return -EAFNOSUPPORT
;
194 modemap
= afinfo
->mode_map
;
195 if (likely(modemap
[mode
->encap
] == NULL
)) {
196 modemap
[mode
->encap
] = mode
;
200 xfrm_policy_unlock_afinfo(afinfo
);
203 EXPORT_SYMBOL(xfrm_register_mode
);
205 int xfrm_unregister_mode(struct xfrm_mode
*mode
, int family
)
207 struct xfrm_policy_afinfo
*afinfo
;
208 struct xfrm_mode
**modemap
;
211 if (unlikely(mode
->encap
>= XFRM_MODE_MAX
))
214 afinfo
= xfrm_policy_lock_afinfo(family
);
215 if (unlikely(afinfo
== NULL
))
216 return -EAFNOSUPPORT
;
219 modemap
= afinfo
->mode_map
;
220 if (likely(modemap
[mode
->encap
] == mode
)) {
221 modemap
[mode
->encap
] = NULL
;
225 xfrm_policy_unlock_afinfo(afinfo
);
228 EXPORT_SYMBOL(xfrm_unregister_mode
);
230 struct xfrm_mode
*xfrm_get_mode(unsigned int encap
, int family
)
232 struct xfrm_policy_afinfo
*afinfo
;
233 struct xfrm_mode
*mode
;
234 int modload_attempted
= 0;
236 if (unlikely(encap
>= XFRM_MODE_MAX
))
240 afinfo
= xfrm_policy_get_afinfo(family
);
241 if (unlikely(afinfo
== NULL
))
244 mode
= afinfo
->mode_map
[encap
];
245 if (unlikely(mode
&& !try_module_get(mode
->owner
)))
247 if (!mode
&& !modload_attempted
) {
248 xfrm_policy_put_afinfo(afinfo
);
249 request_module("xfrm-mode-%d-%d", family
, encap
);
250 modload_attempted
= 1;
254 xfrm_policy_put_afinfo(afinfo
);
258 void xfrm_put_mode(struct xfrm_mode
*mode
)
260 module_put(mode
->owner
);
263 static inline unsigned long make_jiffies(long secs
)
265 if (secs
>= (MAX_SCHEDULE_TIMEOUT
-1)/HZ
)
266 return MAX_SCHEDULE_TIMEOUT
-1;
271 static void xfrm_policy_timer(unsigned long data
)
273 struct xfrm_policy
*xp
= (struct xfrm_policy
*)data
;
274 unsigned long now
= get_seconds();
275 long next
= LONG_MAX
;
279 read_lock(&xp
->lock
);
284 dir
= xfrm_policy_id2dir(xp
->index
);
286 if (xp
->lft
.hard_add_expires_seconds
) {
287 long tmo
= xp
->lft
.hard_add_expires_seconds
+
288 xp
->curlft
.add_time
- now
;
294 if (xp
->lft
.hard_use_expires_seconds
) {
295 long tmo
= xp
->lft
.hard_use_expires_seconds
+
296 (xp
->curlft
.use_time
? : xp
->curlft
.add_time
) - now
;
302 if (xp
->lft
.soft_add_expires_seconds
) {
303 long tmo
= xp
->lft
.soft_add_expires_seconds
+
304 xp
->curlft
.add_time
- now
;
307 tmo
= XFRM_KM_TIMEOUT
;
312 if (xp
->lft
.soft_use_expires_seconds
) {
313 long tmo
= xp
->lft
.soft_use_expires_seconds
+
314 (xp
->curlft
.use_time
? : xp
->curlft
.add_time
) - now
;
317 tmo
= XFRM_KM_TIMEOUT
;
324 km_policy_expired(xp
, dir
, 0, 0);
325 if (next
!= LONG_MAX
&&
326 !mod_timer(&xp
->timer
, jiffies
+ make_jiffies(next
)))
330 read_unlock(&xp
->lock
);
335 read_unlock(&xp
->lock
);
336 if (!xfrm_policy_delete(xp
, dir
))
337 km_policy_expired(xp
, dir
, 1, 0);
342 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
346 struct xfrm_policy
*xfrm_policy_alloc(gfp_t gfp
)
348 struct xfrm_policy
*policy
;
350 policy
= kzalloc(sizeof(struct xfrm_policy
), gfp
);
353 INIT_HLIST_NODE(&policy
->bydst
);
354 INIT_HLIST_NODE(&policy
->byidx
);
355 rwlock_init(&policy
->lock
);
356 atomic_set(&policy
->refcnt
, 1);
357 init_timer(&policy
->timer
);
358 policy
->timer
.data
= (unsigned long)policy
;
359 policy
->timer
.function
= xfrm_policy_timer
;
363 EXPORT_SYMBOL(xfrm_policy_alloc
);
365 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
367 void __xfrm_policy_destroy(struct xfrm_policy
*policy
)
369 BUG_ON(!policy
->dead
);
371 BUG_ON(policy
->bundles
);
373 if (del_timer(&policy
->timer
))
376 security_xfrm_policy_free(policy
);
379 EXPORT_SYMBOL(__xfrm_policy_destroy
);
381 static void xfrm_policy_gc_kill(struct xfrm_policy
*policy
)
383 struct dst_entry
*dst
;
385 while ((dst
= policy
->bundles
) != NULL
) {
386 policy
->bundles
= dst
->next
;
390 if (del_timer(&policy
->timer
))
391 atomic_dec(&policy
->refcnt
);
393 if (atomic_read(&policy
->refcnt
) > 1)
396 xfrm_pol_put(policy
);
399 static void xfrm_policy_gc_task(struct work_struct
*work
)
401 struct xfrm_policy
*policy
;
402 struct hlist_node
*entry
, *tmp
;
403 struct hlist_head gc_list
;
405 spin_lock_bh(&xfrm_policy_gc_lock
);
406 gc_list
.first
= xfrm_policy_gc_list
.first
;
407 INIT_HLIST_HEAD(&xfrm_policy_gc_list
);
408 spin_unlock_bh(&xfrm_policy_gc_lock
);
410 hlist_for_each_entry_safe(policy
, entry
, tmp
, &gc_list
, bydst
)
411 xfrm_policy_gc_kill(policy
);
414 /* Rule must be locked. Release descentant resources, announce
415 * entry dead. The rule must be unlinked from lists to the moment.
418 static void xfrm_policy_kill(struct xfrm_policy
*policy
)
422 write_lock_bh(&policy
->lock
);
425 write_unlock_bh(&policy
->lock
);
427 if (unlikely(dead
)) {
432 spin_lock(&xfrm_policy_gc_lock
);
433 hlist_add_head(&policy
->bydst
, &xfrm_policy_gc_list
);
434 spin_unlock(&xfrm_policy_gc_lock
);
436 schedule_work(&xfrm_policy_gc_work
);
439 struct xfrm_policy_hash
{
440 struct hlist_head
*table
;
444 static struct hlist_head xfrm_policy_inexact
[XFRM_POLICY_MAX
*2];
445 static struct xfrm_policy_hash xfrm_policy_bydst
[XFRM_POLICY_MAX
*2] __read_mostly
;
446 static struct hlist_head
*xfrm_policy_byidx __read_mostly
;
447 static unsigned int xfrm_idx_hmask __read_mostly
;
448 static unsigned int xfrm_policy_hashmax __read_mostly
= 1 * 1024 * 1024;
450 static inline unsigned int idx_hash(u32 index
)
452 return __idx_hash(index
, xfrm_idx_hmask
);
455 static struct hlist_head
*policy_hash_bysel(struct xfrm_selector
*sel
, unsigned short family
, int dir
)
457 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
458 unsigned int hash
= __sel_hash(sel
, family
, hmask
);
460 return (hash
== hmask
+ 1 ?
461 &xfrm_policy_inexact
[dir
] :
462 xfrm_policy_bydst
[dir
].table
+ hash
);
465 static struct hlist_head
*policy_hash_direct(xfrm_address_t
*daddr
, xfrm_address_t
*saddr
, unsigned short family
, int dir
)
467 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
468 unsigned int hash
= __addr_hash(daddr
, saddr
, family
, hmask
);
470 return xfrm_policy_bydst
[dir
].table
+ hash
;
473 static void xfrm_dst_hash_transfer(struct hlist_head
*list
,
474 struct hlist_head
*ndsttable
,
475 unsigned int nhashmask
)
477 struct hlist_node
*entry
, *tmp
;
478 struct xfrm_policy
*pol
;
480 hlist_for_each_entry_safe(pol
, entry
, tmp
, list
, bydst
) {
483 h
= __addr_hash(&pol
->selector
.daddr
, &pol
->selector
.saddr
,
484 pol
->family
, nhashmask
);
485 hlist_add_head(&pol
->bydst
, ndsttable
+h
);
489 static void xfrm_idx_hash_transfer(struct hlist_head
*list
,
490 struct hlist_head
*nidxtable
,
491 unsigned int nhashmask
)
493 struct hlist_node
*entry
, *tmp
;
494 struct xfrm_policy
*pol
;
496 hlist_for_each_entry_safe(pol
, entry
, tmp
, list
, byidx
) {
499 h
= __idx_hash(pol
->index
, nhashmask
);
500 hlist_add_head(&pol
->byidx
, nidxtable
+h
);
504 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask
)
506 return ((old_hmask
+ 1) << 1) - 1;
509 static void xfrm_bydst_resize(int dir
)
511 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
512 unsigned int nhashmask
= xfrm_new_hash_mask(hmask
);
513 unsigned int nsize
= (nhashmask
+ 1) * sizeof(struct hlist_head
);
514 struct hlist_head
*odst
= xfrm_policy_bydst
[dir
].table
;
515 struct hlist_head
*ndst
= xfrm_hash_alloc(nsize
);
521 write_lock_bh(&xfrm_policy_lock
);
523 for (i
= hmask
; i
>= 0; i
--)
524 xfrm_dst_hash_transfer(odst
+ i
, ndst
, nhashmask
);
526 xfrm_policy_bydst
[dir
].table
= ndst
;
527 xfrm_policy_bydst
[dir
].hmask
= nhashmask
;
529 write_unlock_bh(&xfrm_policy_lock
);
531 xfrm_hash_free(odst
, (hmask
+ 1) * sizeof(struct hlist_head
));
534 static void xfrm_byidx_resize(int total
)
536 unsigned int hmask
= xfrm_idx_hmask
;
537 unsigned int nhashmask
= xfrm_new_hash_mask(hmask
);
538 unsigned int nsize
= (nhashmask
+ 1) * sizeof(struct hlist_head
);
539 struct hlist_head
*oidx
= xfrm_policy_byidx
;
540 struct hlist_head
*nidx
= xfrm_hash_alloc(nsize
);
546 write_lock_bh(&xfrm_policy_lock
);
548 for (i
= hmask
; i
>= 0; i
--)
549 xfrm_idx_hash_transfer(oidx
+ i
, nidx
, nhashmask
);
551 xfrm_policy_byidx
= nidx
;
552 xfrm_idx_hmask
= nhashmask
;
554 write_unlock_bh(&xfrm_policy_lock
);
556 xfrm_hash_free(oidx
, (hmask
+ 1) * sizeof(struct hlist_head
));
559 static inline int xfrm_bydst_should_resize(int dir
, int *total
)
561 unsigned int cnt
= xfrm_policy_count
[dir
];
562 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
567 if ((hmask
+ 1) < xfrm_policy_hashmax
&&
574 static inline int xfrm_byidx_should_resize(int total
)
576 unsigned int hmask
= xfrm_idx_hmask
;
578 if ((hmask
+ 1) < xfrm_policy_hashmax
&&
585 void xfrm_spd_getinfo(struct xfrmk_spdinfo
*si
)
587 read_lock_bh(&xfrm_policy_lock
);
588 si
->incnt
= xfrm_policy_count
[XFRM_POLICY_IN
];
589 si
->outcnt
= xfrm_policy_count
[XFRM_POLICY_OUT
];
590 si
->fwdcnt
= xfrm_policy_count
[XFRM_POLICY_FWD
];
591 si
->inscnt
= xfrm_policy_count
[XFRM_POLICY_IN
+XFRM_POLICY_MAX
];
592 si
->outscnt
= xfrm_policy_count
[XFRM_POLICY_OUT
+XFRM_POLICY_MAX
];
593 si
->fwdscnt
= xfrm_policy_count
[XFRM_POLICY_FWD
+XFRM_POLICY_MAX
];
594 si
->spdhcnt
= xfrm_idx_hmask
;
595 si
->spdhmcnt
= xfrm_policy_hashmax
;
596 read_unlock_bh(&xfrm_policy_lock
);
598 EXPORT_SYMBOL(xfrm_spd_getinfo
);
600 static DEFINE_MUTEX(hash_resize_mutex
);
601 static void xfrm_hash_resize(struct work_struct
*__unused
)
605 mutex_lock(&hash_resize_mutex
);
608 for (dir
= 0; dir
< XFRM_POLICY_MAX
* 2; dir
++) {
609 if (xfrm_bydst_should_resize(dir
, &total
))
610 xfrm_bydst_resize(dir
);
612 if (xfrm_byidx_should_resize(total
))
613 xfrm_byidx_resize(total
);
615 mutex_unlock(&hash_resize_mutex
);
618 static DECLARE_WORK(xfrm_hash_work
, xfrm_hash_resize
);
620 /* Generate new index... KAME seems to generate them ordered by cost
621 * of an absolute inpredictability of ordering of rules. This will not pass. */
622 static u32
xfrm_gen_index(u8 type
, int dir
)
624 static u32 idx_generator
;
627 struct hlist_node
*entry
;
628 struct hlist_head
*list
;
629 struct xfrm_policy
*p
;
633 idx
= (idx_generator
| dir
);
637 list
= xfrm_policy_byidx
+ idx_hash(idx
);
639 hlist_for_each_entry(p
, entry
, list
, byidx
) {
640 if (p
->index
== idx
) {
650 static inline int selector_cmp(struct xfrm_selector
*s1
, struct xfrm_selector
*s2
)
652 u32
*p1
= (u32
*) s1
;
653 u32
*p2
= (u32
*) s2
;
654 int len
= sizeof(struct xfrm_selector
) / sizeof(u32
);
657 for (i
= 0; i
< len
; i
++) {
665 int xfrm_policy_insert(int dir
, struct xfrm_policy
*policy
, int excl
)
667 struct xfrm_policy
*pol
;
668 struct xfrm_policy
*delpol
;
669 struct hlist_head
*chain
;
670 struct hlist_node
*entry
, *newpos
;
671 struct dst_entry
*gc_list
;
673 write_lock_bh(&xfrm_policy_lock
);
674 chain
= policy_hash_bysel(&policy
->selector
, policy
->family
, dir
);
677 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
678 if (pol
->type
== policy
->type
&&
679 !selector_cmp(&pol
->selector
, &policy
->selector
) &&
680 xfrm_sec_ctx_match(pol
->security
, policy
->security
) &&
683 write_unlock_bh(&xfrm_policy_lock
);
687 if (policy
->priority
> pol
->priority
)
689 } else if (policy
->priority
>= pol
->priority
) {
690 newpos
= &pol
->bydst
;
697 hlist_add_after(newpos
, &policy
->bydst
);
699 hlist_add_head(&policy
->bydst
, chain
);
700 xfrm_pol_hold(policy
);
701 xfrm_policy_count
[dir
]++;
702 atomic_inc(&flow_cache_genid
);
704 hlist_del(&delpol
->bydst
);
705 hlist_del(&delpol
->byidx
);
706 xfrm_policy_count
[dir
]--;
708 policy
->index
= delpol
? delpol
->index
: xfrm_gen_index(policy
->type
, dir
);
709 hlist_add_head(&policy
->byidx
, xfrm_policy_byidx
+idx_hash(policy
->index
));
710 policy
->curlft
.add_time
= get_seconds();
711 policy
->curlft
.use_time
= 0;
712 if (!mod_timer(&policy
->timer
, jiffies
+ HZ
))
713 xfrm_pol_hold(policy
);
714 write_unlock_bh(&xfrm_policy_lock
);
717 xfrm_policy_kill(delpol
);
718 else if (xfrm_bydst_should_resize(dir
, NULL
))
719 schedule_work(&xfrm_hash_work
);
721 read_lock_bh(&xfrm_policy_lock
);
723 entry
= &policy
->bydst
;
724 hlist_for_each_entry_continue(policy
, entry
, bydst
) {
725 struct dst_entry
*dst
;
727 write_lock(&policy
->lock
);
728 dst
= policy
->bundles
;
730 struct dst_entry
*tail
= dst
;
733 tail
->next
= gc_list
;
736 policy
->bundles
= NULL
;
738 write_unlock(&policy
->lock
);
740 read_unlock_bh(&xfrm_policy_lock
);
743 struct dst_entry
*dst
= gc_list
;
751 EXPORT_SYMBOL(xfrm_policy_insert
);
753 struct xfrm_policy
*xfrm_policy_bysel_ctx(u8 type
, int dir
,
754 struct xfrm_selector
*sel
,
755 struct xfrm_sec_ctx
*ctx
, int delete,
758 struct xfrm_policy
*pol
, *ret
;
759 struct hlist_head
*chain
;
760 struct hlist_node
*entry
;
763 write_lock_bh(&xfrm_policy_lock
);
764 chain
= policy_hash_bysel(sel
, sel
->family
, dir
);
766 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
767 if (pol
->type
== type
&&
768 !selector_cmp(sel
, &pol
->selector
) &&
769 xfrm_sec_ctx_match(ctx
, pol
->security
)) {
772 *err
= security_xfrm_policy_delete(pol
);
774 write_unlock_bh(&xfrm_policy_lock
);
777 hlist_del(&pol
->bydst
);
778 hlist_del(&pol
->byidx
);
779 xfrm_policy_count
[dir
]--;
785 write_unlock_bh(&xfrm_policy_lock
);
788 atomic_inc(&flow_cache_genid
);
789 xfrm_policy_kill(ret
);
793 EXPORT_SYMBOL(xfrm_policy_bysel_ctx
);
795 struct xfrm_policy
*xfrm_policy_byid(u8 type
, int dir
, u32 id
, int delete,
798 struct xfrm_policy
*pol
, *ret
;
799 struct hlist_head
*chain
;
800 struct hlist_node
*entry
;
803 if (xfrm_policy_id2dir(id
) != dir
)
807 write_lock_bh(&xfrm_policy_lock
);
808 chain
= xfrm_policy_byidx
+ idx_hash(id
);
810 hlist_for_each_entry(pol
, entry
, chain
, byidx
) {
811 if (pol
->type
== type
&& pol
->index
== id
) {
814 *err
= security_xfrm_policy_delete(pol
);
816 write_unlock_bh(&xfrm_policy_lock
);
819 hlist_del(&pol
->bydst
);
820 hlist_del(&pol
->byidx
);
821 xfrm_policy_count
[dir
]--;
827 write_unlock_bh(&xfrm_policy_lock
);
830 atomic_inc(&flow_cache_genid
);
831 xfrm_policy_kill(ret
);
835 EXPORT_SYMBOL(xfrm_policy_byid
);
837 void xfrm_policy_flush(u8 type
, struct xfrm_audit
*audit_info
)
841 write_lock_bh(&xfrm_policy_lock
);
842 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
843 struct xfrm_policy
*pol
;
844 struct hlist_node
*entry
;
849 hlist_for_each_entry(pol
, entry
,
850 &xfrm_policy_inexact
[dir
], bydst
) {
851 if (pol
->type
!= type
)
853 hlist_del(&pol
->bydst
);
854 hlist_del(&pol
->byidx
);
855 write_unlock_bh(&xfrm_policy_lock
);
857 xfrm_audit_log(audit_info
->loginuid
, audit_info
->secid
,
858 AUDIT_MAC_IPSEC_DELSPD
, 1, pol
, NULL
);
860 xfrm_policy_kill(pol
);
863 write_lock_bh(&xfrm_policy_lock
);
867 for (i
= xfrm_policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
869 hlist_for_each_entry(pol
, entry
,
870 xfrm_policy_bydst
[dir
].table
+ i
,
872 if (pol
->type
!= type
)
874 hlist_del(&pol
->bydst
);
875 hlist_del(&pol
->byidx
);
876 write_unlock_bh(&xfrm_policy_lock
);
878 xfrm_audit_log(audit_info
->loginuid
,
880 AUDIT_MAC_IPSEC_DELSPD
, 1,
883 xfrm_policy_kill(pol
);
886 write_lock_bh(&xfrm_policy_lock
);
891 xfrm_policy_count
[dir
] -= killed
;
893 atomic_inc(&flow_cache_genid
);
894 write_unlock_bh(&xfrm_policy_lock
);
896 EXPORT_SYMBOL(xfrm_policy_flush
);
898 int xfrm_policy_walk(u8 type
, int (*func
)(struct xfrm_policy
*, int, int, void*),
901 struct xfrm_policy
*pol
, *last
= NULL
;
902 struct hlist_node
*entry
;
903 int dir
, last_dir
= 0, count
, error
;
905 read_lock_bh(&xfrm_policy_lock
);
908 for (dir
= 0; dir
< 2*XFRM_POLICY_MAX
; dir
++) {
909 struct hlist_head
*table
= xfrm_policy_bydst
[dir
].table
;
912 hlist_for_each_entry(pol
, entry
,
913 &xfrm_policy_inexact
[dir
], bydst
) {
914 if (pol
->type
!= type
)
917 error
= func(last
, last_dir
% XFRM_POLICY_MAX
,
926 for (i
= xfrm_policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
927 hlist_for_each_entry(pol
, entry
, table
+ i
, bydst
) {
928 if (pol
->type
!= type
)
931 error
= func(last
, last_dir
% XFRM_POLICY_MAX
,
946 error
= func(last
, last_dir
% XFRM_POLICY_MAX
, 0, data
);
948 read_unlock_bh(&xfrm_policy_lock
);
951 EXPORT_SYMBOL(xfrm_policy_walk
);
954 * Find policy to apply to this flow.
956 * Returns 0 if policy found, else an -errno.
958 static int xfrm_policy_match(struct xfrm_policy
*pol
, struct flowi
*fl
,
959 u8 type
, u16 family
, int dir
)
961 struct xfrm_selector
*sel
= &pol
->selector
;
962 int match
, ret
= -ESRCH
;
964 if (pol
->family
!= family
||
968 match
= xfrm_selector_match(sel
, fl
, family
);
970 ret
= security_xfrm_policy_lookup(pol
, fl
->secid
, dir
);
975 static struct xfrm_policy
*xfrm_policy_lookup_bytype(u8 type
, struct flowi
*fl
,
979 struct xfrm_policy
*pol
, *ret
;
980 xfrm_address_t
*daddr
, *saddr
;
981 struct hlist_node
*entry
;
982 struct hlist_head
*chain
;
985 daddr
= xfrm_flowi_daddr(fl
, family
);
986 saddr
= xfrm_flowi_saddr(fl
, family
);
987 if (unlikely(!daddr
|| !saddr
))
990 read_lock_bh(&xfrm_policy_lock
);
991 chain
= policy_hash_direct(daddr
, saddr
, family
, dir
);
993 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
994 err
= xfrm_policy_match(pol
, fl
, type
, family
, dir
);
1004 priority
= ret
->priority
;
1008 chain
= &xfrm_policy_inexact
[dir
];
1009 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
1010 err
= xfrm_policy_match(pol
, fl
, type
, family
, dir
);
1018 } else if (pol
->priority
< priority
) {
1026 read_unlock_bh(&xfrm_policy_lock
);
1031 static int xfrm_policy_lookup(struct flowi
*fl
, u16 family
, u8 dir
,
1032 void **objp
, atomic_t
**obj_refp
)
1034 struct xfrm_policy
*pol
;
1037 #ifdef CONFIG_XFRM_SUB_POLICY
1038 pol
= xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_SUB
, fl
, family
, dir
);
1046 pol
= xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN
, fl
, family
, dir
);
1051 #ifdef CONFIG_XFRM_SUB_POLICY
1054 if ((*objp
= (void *) pol
) != NULL
)
1055 *obj_refp
= &pol
->refcnt
;
1059 static inline int policy_to_flow_dir(int dir
)
1061 if (XFRM_POLICY_IN
== FLOW_DIR_IN
&&
1062 XFRM_POLICY_OUT
== FLOW_DIR_OUT
&&
1063 XFRM_POLICY_FWD
== FLOW_DIR_FWD
)
1067 case XFRM_POLICY_IN
:
1069 case XFRM_POLICY_OUT
:
1070 return FLOW_DIR_OUT
;
1071 case XFRM_POLICY_FWD
:
1072 return FLOW_DIR_FWD
;
1076 static struct xfrm_policy
*xfrm_sk_policy_lookup(struct sock
*sk
, int dir
, struct flowi
*fl
)
1078 struct xfrm_policy
*pol
;
1080 read_lock_bh(&xfrm_policy_lock
);
1081 if ((pol
= sk
->sk_policy
[dir
]) != NULL
) {
1082 int match
= xfrm_selector_match(&pol
->selector
, fl
,
1087 err
= security_xfrm_policy_lookup(pol
, fl
->secid
,
1088 policy_to_flow_dir(dir
));
1091 else if (err
== -ESRCH
)
1098 read_unlock_bh(&xfrm_policy_lock
);
1102 static void __xfrm_policy_link(struct xfrm_policy
*pol
, int dir
)
1104 struct hlist_head
*chain
= policy_hash_bysel(&pol
->selector
,
1107 hlist_add_head(&pol
->bydst
, chain
);
1108 hlist_add_head(&pol
->byidx
, xfrm_policy_byidx
+idx_hash(pol
->index
));
1109 xfrm_policy_count
[dir
]++;
1112 if (xfrm_bydst_should_resize(dir
, NULL
))
1113 schedule_work(&xfrm_hash_work
);
1116 static struct xfrm_policy
*__xfrm_policy_unlink(struct xfrm_policy
*pol
,
1119 if (hlist_unhashed(&pol
->bydst
))
1122 hlist_del(&pol
->bydst
);
1123 hlist_del(&pol
->byidx
);
1124 xfrm_policy_count
[dir
]--;
1129 int xfrm_policy_delete(struct xfrm_policy
*pol
, int dir
)
1131 write_lock_bh(&xfrm_policy_lock
);
1132 pol
= __xfrm_policy_unlink(pol
, dir
);
1133 write_unlock_bh(&xfrm_policy_lock
);
1135 if (dir
< XFRM_POLICY_MAX
)
1136 atomic_inc(&flow_cache_genid
);
1137 xfrm_policy_kill(pol
);
1142 EXPORT_SYMBOL(xfrm_policy_delete
);
1144 int xfrm_sk_policy_insert(struct sock
*sk
, int dir
, struct xfrm_policy
*pol
)
1146 struct xfrm_policy
*old_pol
;
1148 #ifdef CONFIG_XFRM_SUB_POLICY
1149 if (pol
&& pol
->type
!= XFRM_POLICY_TYPE_MAIN
)
1153 write_lock_bh(&xfrm_policy_lock
);
1154 old_pol
= sk
->sk_policy
[dir
];
1155 sk
->sk_policy
[dir
] = pol
;
1157 pol
->curlft
.add_time
= get_seconds();
1158 pol
->index
= xfrm_gen_index(pol
->type
, XFRM_POLICY_MAX
+dir
);
1159 __xfrm_policy_link(pol
, XFRM_POLICY_MAX
+dir
);
1162 __xfrm_policy_unlink(old_pol
, XFRM_POLICY_MAX
+dir
);
1163 write_unlock_bh(&xfrm_policy_lock
);
1166 xfrm_policy_kill(old_pol
);
1171 static struct xfrm_policy
*clone_policy(struct xfrm_policy
*old
, int dir
)
1173 struct xfrm_policy
*newp
= xfrm_policy_alloc(GFP_ATOMIC
);
1176 newp
->selector
= old
->selector
;
1177 if (security_xfrm_policy_clone(old
, newp
)) {
1179 return NULL
; /* ENOMEM */
1181 newp
->lft
= old
->lft
;
1182 newp
->curlft
= old
->curlft
;
1183 newp
->action
= old
->action
;
1184 newp
->flags
= old
->flags
;
1185 newp
->xfrm_nr
= old
->xfrm_nr
;
1186 newp
->index
= old
->index
;
1187 newp
->type
= old
->type
;
1188 memcpy(newp
->xfrm_vec
, old
->xfrm_vec
,
1189 newp
->xfrm_nr
*sizeof(struct xfrm_tmpl
));
1190 write_lock_bh(&xfrm_policy_lock
);
1191 __xfrm_policy_link(newp
, XFRM_POLICY_MAX
+dir
);
1192 write_unlock_bh(&xfrm_policy_lock
);
1198 int __xfrm_sk_clone_policy(struct sock
*sk
)
1200 struct xfrm_policy
*p0
= sk
->sk_policy
[0],
1201 *p1
= sk
->sk_policy
[1];
1203 sk
->sk_policy
[0] = sk
->sk_policy
[1] = NULL
;
1204 if (p0
&& (sk
->sk_policy
[0] = clone_policy(p0
, 0)) == NULL
)
1206 if (p1
&& (sk
->sk_policy
[1] = clone_policy(p1
, 1)) == NULL
)
1212 xfrm_get_saddr(xfrm_address_t
*local
, xfrm_address_t
*remote
,
1213 unsigned short family
)
1216 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1218 if (unlikely(afinfo
== NULL
))
1220 err
= afinfo
->get_saddr(local
, remote
);
1221 xfrm_policy_put_afinfo(afinfo
);
1225 /* Resolve list of templates for the flow, given policy. */
1228 xfrm_tmpl_resolve_one(struct xfrm_policy
*policy
, struct flowi
*fl
,
1229 struct xfrm_state
**xfrm
,
1230 unsigned short family
)
1234 xfrm_address_t
*daddr
= xfrm_flowi_daddr(fl
, family
);
1235 xfrm_address_t
*saddr
= xfrm_flowi_saddr(fl
, family
);
1238 for (nx
=0, i
= 0; i
< policy
->xfrm_nr
; i
++) {
1239 struct xfrm_state
*x
;
1240 xfrm_address_t
*remote
= daddr
;
1241 xfrm_address_t
*local
= saddr
;
1242 struct xfrm_tmpl
*tmpl
= &policy
->xfrm_vec
[i
];
1244 if (tmpl
->mode
== XFRM_MODE_TUNNEL
) {
1245 remote
= &tmpl
->id
.daddr
;
1246 local
= &tmpl
->saddr
;
1247 family
= tmpl
->encap_family
;
1248 if (xfrm_addr_any(local
, family
)) {
1249 error
= xfrm_get_saddr(&tmp
, remote
, family
);
1256 x
= xfrm_state_find(remote
, local
, fl
, tmpl
, policy
, &error
, family
);
1258 if (x
&& x
->km
.state
== XFRM_STATE_VALID
) {
1265 error
= (x
->km
.state
== XFRM_STATE_ERROR
?
1270 if (!tmpl
->optional
)
1276 for (nx
--; nx
>=0; nx
--)
1277 xfrm_state_put(xfrm
[nx
]);
1282 xfrm_tmpl_resolve(struct xfrm_policy
**pols
, int npols
, struct flowi
*fl
,
1283 struct xfrm_state
**xfrm
,
1284 unsigned short family
)
1286 struct xfrm_state
*tp
[XFRM_MAX_DEPTH
];
1287 struct xfrm_state
**tpp
= (npols
> 1) ? tp
: xfrm
;
1293 for (i
= 0; i
< npols
; i
++) {
1294 if (cnx
+ pols
[i
]->xfrm_nr
>= XFRM_MAX_DEPTH
) {
1299 ret
= xfrm_tmpl_resolve_one(pols
[i
], fl
, &tpp
[cnx
], family
);
1307 /* found states are sorted for outbound processing */
1309 xfrm_state_sort(xfrm
, tpp
, cnx
, family
);
1314 for (cnx
--; cnx
>=0; cnx
--)
1315 xfrm_state_put(tpp
[cnx
]);
1320 /* Check that the bundle accepts the flow and its components are
1324 static struct dst_entry
*
1325 xfrm_find_bundle(struct flowi
*fl
, struct xfrm_policy
*policy
, unsigned short family
)
1327 struct dst_entry
*x
;
1328 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1329 if (unlikely(afinfo
== NULL
))
1330 return ERR_PTR(-EINVAL
);
1331 x
= afinfo
->find_bundle(fl
, policy
);
1332 xfrm_policy_put_afinfo(afinfo
);
1336 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
1337 * all the metrics... Shortly, bundle a bundle.
1341 xfrm_bundle_create(struct xfrm_policy
*policy
, struct xfrm_state
**xfrm
, int nx
,
1342 struct flowi
*fl
, struct dst_entry
**dst_p
,
1343 unsigned short family
)
1346 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1347 if (unlikely(afinfo
== NULL
))
1349 err
= afinfo
->bundle_create(policy
, xfrm
, nx
, fl
, dst_p
);
1350 xfrm_policy_put_afinfo(afinfo
);
1355 xfrm_dst_alloc_copy(void **target
, void *src
, int size
)
1358 *target
= kmalloc(size
, GFP_ATOMIC
);
1362 memcpy(*target
, src
, size
);
1367 xfrm_dst_update_parent(struct dst_entry
*dst
, struct xfrm_selector
*sel
)
1369 #ifdef CONFIG_XFRM_SUB_POLICY
1370 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
1371 return xfrm_dst_alloc_copy((void **)&(xdst
->partner
),
1379 xfrm_dst_update_origin(struct dst_entry
*dst
, struct flowi
*fl
)
1381 #ifdef CONFIG_XFRM_SUB_POLICY
1382 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
1383 return xfrm_dst_alloc_copy((void **)&(xdst
->origin
), fl
, sizeof(*fl
));
1389 static int stale_bundle(struct dst_entry
*dst
);
1391 /* Main function: finds/creates a bundle for given flow.
1393 * At the moment we eat a raw IP route. Mostly to speed up lookups
1394 * on interfaces with disabled IPsec.
1396 int __xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
1397 struct sock
*sk
, int flags
)
1399 struct xfrm_policy
*policy
;
1400 struct xfrm_policy
*pols
[XFRM_POLICY_TYPE_MAX
];
1405 struct xfrm_state
*xfrm
[XFRM_MAX_DEPTH
];
1406 struct dst_entry
*dst
, *dst_orig
= *dst_p
;
1411 u8 dir
= policy_to_flow_dir(XFRM_POLICY_OUT
);
1414 genid
= atomic_read(&flow_cache_genid
);
1416 for (pi
= 0; pi
< ARRAY_SIZE(pols
); pi
++)
1422 if (sk
&& sk
->sk_policy
[1]) {
1423 policy
= xfrm_sk_policy_lookup(sk
, XFRM_POLICY_OUT
, fl
);
1425 return PTR_ERR(policy
);
1429 /* To accelerate a bit... */
1430 if ((dst_orig
->flags
& DST_NOXFRM
) ||
1431 !xfrm_policy_count
[XFRM_POLICY_OUT
])
1434 policy
= flow_cache_lookup(fl
, dst_orig
->ops
->family
,
1435 dir
, xfrm_policy_lookup
);
1437 return PTR_ERR(policy
);
1443 family
= dst_orig
->ops
->family
;
1444 policy
->curlft
.use_time
= get_seconds();
1447 xfrm_nr
+= pols
[0]->xfrm_nr
;
1449 switch (policy
->action
) {
1450 case XFRM_POLICY_BLOCK
:
1451 /* Prohibit the flow */
1455 case XFRM_POLICY_ALLOW
:
1456 #ifndef CONFIG_XFRM_SUB_POLICY
1457 if (policy
->xfrm_nr
== 0) {
1458 /* Flow passes not transformed. */
1459 xfrm_pol_put(policy
);
1464 /* Try to find matching bundle.
1466 * LATER: help from flow cache. It is optional, this
1467 * is required only for output policy.
1469 dst
= xfrm_find_bundle(fl
, policy
, family
);
1478 #ifdef CONFIG_XFRM_SUB_POLICY
1479 if (pols
[0]->type
!= XFRM_POLICY_TYPE_MAIN
) {
1480 pols
[1] = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN
,
1484 if (IS_ERR(pols
[1])) {
1485 err
= PTR_ERR(pols
[1]);
1488 if (pols
[1]->action
== XFRM_POLICY_BLOCK
) {
1493 xfrm_nr
+= pols
[1]->xfrm_nr
;
1498 * Because neither flowi nor bundle information knows about
1499 * transformation template size. On more than one policy usage
1500 * we can realize whether all of them is bypass or not after
1501 * they are searched. See above not-transformed bypass
1502 * is surrounded by non-sub policy configuration, too.
1505 /* Flow passes not transformed. */
1506 xfrm_pols_put(pols
, npols
);
1511 nx
= xfrm_tmpl_resolve(pols
, npols
, fl
, xfrm
, family
);
1513 if (unlikely(nx
<0)) {
1515 if (err
== -EAGAIN
&& sysctl_xfrm_larval_drop
) {
1516 /* EREMOTE tells the caller to generate
1517 * a one-shot blackhole route.
1519 xfrm_pol_put(policy
);
1522 if (err
== -EAGAIN
&& flags
) {
1523 DECLARE_WAITQUEUE(wait
, current
);
1525 add_wait_queue(&km_waitq
, &wait
);
1526 set_current_state(TASK_INTERRUPTIBLE
);
1528 set_current_state(TASK_RUNNING
);
1529 remove_wait_queue(&km_waitq
, &wait
);
1531 nx
= xfrm_tmpl_resolve(pols
, npols
, fl
, xfrm
, family
);
1533 if (nx
== -EAGAIN
&& signal_pending(current
)) {
1537 if (nx
== -EAGAIN
||
1538 genid
!= atomic_read(&flow_cache_genid
)) {
1539 xfrm_pols_put(pols
, npols
);
1548 /* Flow passes not transformed. */
1549 xfrm_pols_put(pols
, npols
);
1554 err
= xfrm_bundle_create(policy
, xfrm
, nx
, fl
, &dst
, family
);
1556 if (unlikely(err
)) {
1558 for (i
=0; i
<nx
; i
++)
1559 xfrm_state_put(xfrm
[i
]);
1563 for (pi
= 0; pi
< npols
; pi
++) {
1564 read_lock_bh(&pols
[pi
]->lock
);
1565 pol_dead
|= pols
[pi
]->dead
;
1566 read_unlock_bh(&pols
[pi
]->lock
);
1569 write_lock_bh(&policy
->lock
);
1570 if (unlikely(pol_dead
|| stale_bundle(dst
))) {
1571 /* Wow! While we worked on resolving, this
1572 * policy has gone. Retry. It is not paranoia,
1573 * we just cannot enlist new bundle to dead object.
1574 * We can't enlist stable bundles either.
1576 write_unlock_bh(&policy
->lock
);
1580 err
= -EHOSTUNREACH
;
1585 err
= xfrm_dst_update_parent(dst
, &pols
[1]->selector
);
1587 err
= xfrm_dst_update_origin(dst
, fl
);
1588 if (unlikely(err
)) {
1589 write_unlock_bh(&policy
->lock
);
1595 dst
->next
= policy
->bundles
;
1596 policy
->bundles
= dst
;
1598 write_unlock_bh(&policy
->lock
);
1601 dst_release(dst_orig
);
1602 xfrm_pols_put(pols
, npols
);
1606 dst_release(dst_orig
);
1607 xfrm_pols_put(pols
, npols
);
1611 EXPORT_SYMBOL(__xfrm_lookup
);
1613 int xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
1614 struct sock
*sk
, int flags
)
1616 int err
= __xfrm_lookup(dst_p
, fl
, sk
, flags
);
1618 if (err
== -EREMOTE
) {
1619 dst_release(*dst_p
);
1626 EXPORT_SYMBOL(xfrm_lookup
);
1629 xfrm_secpath_reject(int idx
, struct sk_buff
*skb
, struct flowi
*fl
)
1631 struct xfrm_state
*x
;
1634 if (!skb
->sp
|| idx
< 0 || idx
>= skb
->sp
->len
)
1636 x
= skb
->sp
->xvec
[idx
];
1637 if (!x
->type
->reject
)
1640 err
= x
->type
->reject(x
, skb
, fl
);
1645 /* When skb is transformed back to its "native" form, we have to
1646 * check policy restrictions. At the moment we make this in maximally
1647 * stupid way. Shame on me. :-) Of course, connected sockets must
1648 * have policy cached at them.
1652 xfrm_state_ok(struct xfrm_tmpl
*tmpl
, struct xfrm_state
*x
,
1653 unsigned short family
)
1655 if (xfrm_state_kern(x
))
1656 return tmpl
->optional
&& !xfrm_state_addr_cmp(tmpl
, x
, tmpl
->encap_family
);
1657 return x
->id
.proto
== tmpl
->id
.proto
&&
1658 (x
->id
.spi
== tmpl
->id
.spi
|| !tmpl
->id
.spi
) &&
1659 (x
->props
.reqid
== tmpl
->reqid
|| !tmpl
->reqid
) &&
1660 x
->props
.mode
== tmpl
->mode
&&
1661 ((tmpl
->aalgos
& (1<<x
->props
.aalgo
)) ||
1662 !(xfrm_id_proto_match(tmpl
->id
.proto
, IPSEC_PROTO_ANY
))) &&
1663 !(x
->props
.mode
!= XFRM_MODE_TRANSPORT
&&
1664 xfrm_state_addr_cmp(tmpl
, x
, family
));
1668 * 0 or more than 0 is returned when validation is succeeded (either bypass
1669 * because of optional transport mode, or next index of the mathced secpath
1670 * state with the template.
1671 * -1 is returned when no matching template is found.
1672 * Otherwise "-2 - errored_index" is returned.
1675 xfrm_policy_ok(struct xfrm_tmpl
*tmpl
, struct sec_path
*sp
, int start
,
1676 unsigned short family
)
1680 if (tmpl
->optional
) {
1681 if (tmpl
->mode
== XFRM_MODE_TRANSPORT
)
1685 for (; idx
< sp
->len
; idx
++) {
1686 if (xfrm_state_ok(tmpl
, sp
->xvec
[idx
], family
))
1688 if (sp
->xvec
[idx
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
1698 xfrm_decode_session(struct sk_buff
*skb
, struct flowi
*fl
, unsigned short family
)
1700 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1703 if (unlikely(afinfo
== NULL
))
1704 return -EAFNOSUPPORT
;
1706 afinfo
->decode_session(skb
, fl
);
1707 err
= security_xfrm_decode_session(skb
, &fl
->secid
);
1708 xfrm_policy_put_afinfo(afinfo
);
1711 EXPORT_SYMBOL(xfrm_decode_session
);
1713 static inline int secpath_has_nontransport(struct sec_path
*sp
, int k
, int *idxp
)
1715 for (; k
< sp
->len
; k
++) {
1716 if (sp
->xvec
[k
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
1725 int __xfrm_policy_check(struct sock
*sk
, int dir
, struct sk_buff
*skb
,
1726 unsigned short family
)
1728 struct xfrm_policy
*pol
;
1729 struct xfrm_policy
*pols
[XFRM_POLICY_TYPE_MAX
];
1734 u8 fl_dir
= policy_to_flow_dir(dir
);
1737 if (xfrm_decode_session(skb
, &fl
, family
) < 0)
1739 nf_nat_decode_session(skb
, &fl
, family
);
1741 /* First, check used SA against their selectors. */
1745 for (i
=skb
->sp
->len
-1; i
>=0; i
--) {
1746 struct xfrm_state
*x
= skb
->sp
->xvec
[i
];
1747 if (!xfrm_selector_match(&x
->sel
, &fl
, family
))
1753 if (sk
&& sk
->sk_policy
[dir
]) {
1754 pol
= xfrm_sk_policy_lookup(sk
, dir
, &fl
);
1760 pol
= flow_cache_lookup(&fl
, family
, fl_dir
,
1761 xfrm_policy_lookup
);
1767 if (skb
->sp
&& secpath_has_nontransport(skb
->sp
, 0, &xerr_idx
)) {
1768 xfrm_secpath_reject(xerr_idx
, skb
, &fl
);
1774 pol
->curlft
.use_time
= get_seconds();
1778 #ifdef CONFIG_XFRM_SUB_POLICY
1779 if (pols
[0]->type
!= XFRM_POLICY_TYPE_MAIN
) {
1780 pols
[1] = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN
,
1784 if (IS_ERR(pols
[1]))
1786 pols
[1]->curlft
.use_time
= get_seconds();
1792 if (pol
->action
== XFRM_POLICY_ALLOW
) {
1793 struct sec_path
*sp
;
1794 static struct sec_path dummy
;
1795 struct xfrm_tmpl
*tp
[XFRM_MAX_DEPTH
];
1796 struct xfrm_tmpl
*stp
[XFRM_MAX_DEPTH
];
1797 struct xfrm_tmpl
**tpp
= tp
;
1801 if ((sp
= skb
->sp
) == NULL
)
1804 for (pi
= 0; pi
< npols
; pi
++) {
1805 if (pols
[pi
] != pol
&&
1806 pols
[pi
]->action
!= XFRM_POLICY_ALLOW
)
1808 if (ti
+ pols
[pi
]->xfrm_nr
>= XFRM_MAX_DEPTH
)
1810 for (i
= 0; i
< pols
[pi
]->xfrm_nr
; i
++)
1811 tpp
[ti
++] = &pols
[pi
]->xfrm_vec
[i
];
1815 xfrm_tmpl_sort(stp
, tpp
, xfrm_nr
, family
);
1819 /* For each tunnel xfrm, find the first matching tmpl.
1820 * For each tmpl before that, find corresponding xfrm.
1821 * Order is _important_. Later we will implement
1822 * some barriers, but at the moment barriers
1823 * are implied between each two transformations.
1825 for (i
= xfrm_nr
-1, k
= 0; i
>= 0; i
--) {
1826 k
= xfrm_policy_ok(tpp
[i
], sp
, k
, family
);
1829 /* "-2 - errored_index" returned */
1835 if (secpath_has_nontransport(sp
, k
, &xerr_idx
))
1838 xfrm_pols_put(pols
, npols
);
1843 xfrm_secpath_reject(xerr_idx
, skb
, &fl
);
1845 xfrm_pols_put(pols
, npols
);
1848 EXPORT_SYMBOL(__xfrm_policy_check
);
1850 int __xfrm_route_forward(struct sk_buff
*skb
, unsigned short family
)
1854 if (xfrm_decode_session(skb
, &fl
, family
) < 0)
1857 return xfrm_lookup(&skb
->dst
, &fl
, NULL
, 0) == 0;
1859 EXPORT_SYMBOL(__xfrm_route_forward
);
1861 /* Optimize later using cookies and generation ids. */
1863 static struct dst_entry
*xfrm_dst_check(struct dst_entry
*dst
, u32 cookie
)
1865 /* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
1866 * to "-1" to force all XFRM destinations to get validated by
1867 * dst_ops->check on every use. We do this because when a
1868 * normal route referenced by an XFRM dst is obsoleted we do
1869 * not go looking around for all parent referencing XFRM dsts
1870 * so that we can invalidate them. It is just too much work.
1871 * Instead we make the checks here on every use. For example:
1873 * XFRM dst A --> IPv4 dst X
1875 * X is the "xdst->route" of A (X is also the "dst->path" of A
1876 * in this example). If X is marked obsolete, "A" will not
1877 * notice. That's what we are validating here via the
1878 * stale_bundle() check.
1880 * When a policy's bundle is pruned, we dst_free() the XFRM
1881 * dst which causes it's ->obsolete field to be set to a
1882 * positive non-zero integer. If an XFRM dst has been pruned
1883 * like this, we want to force a new route lookup.
1885 if (dst
->obsolete
< 0 && !stale_bundle(dst
))
1891 static int stale_bundle(struct dst_entry
*dst
)
1893 return !xfrm_bundle_ok(NULL
, (struct xfrm_dst
*)dst
, NULL
, AF_UNSPEC
, 0);
1896 void xfrm_dst_ifdown(struct dst_entry
*dst
, struct net_device
*dev
)
1898 while ((dst
= dst
->child
) && dst
->xfrm
&& dst
->dev
== dev
) {
1899 dst
->dev
= &loopback_dev
;
1900 dev_hold(&loopback_dev
);
1904 EXPORT_SYMBOL(xfrm_dst_ifdown
);
1906 static void xfrm_link_failure(struct sk_buff
*skb
)
1908 /* Impossible. Such dst must be popped before reaches point of failure. */
1912 static struct dst_entry
*xfrm_negative_advice(struct dst_entry
*dst
)
1915 if (dst
->obsolete
) {
1923 static void prune_one_bundle(struct xfrm_policy
*pol
, int (*func
)(struct dst_entry
*), struct dst_entry
**gc_list_p
)
1925 struct dst_entry
*dst
, **dstp
;
1927 write_lock(&pol
->lock
);
1928 dstp
= &pol
->bundles
;
1929 while ((dst
=*dstp
) != NULL
) {
1932 dst
->next
= *gc_list_p
;
1938 write_unlock(&pol
->lock
);
1941 static void xfrm_prune_bundles(int (*func
)(struct dst_entry
*))
1943 struct dst_entry
*gc_list
= NULL
;
1946 read_lock_bh(&xfrm_policy_lock
);
1947 for (dir
= 0; dir
< XFRM_POLICY_MAX
* 2; dir
++) {
1948 struct xfrm_policy
*pol
;
1949 struct hlist_node
*entry
;
1950 struct hlist_head
*table
;
1953 hlist_for_each_entry(pol
, entry
,
1954 &xfrm_policy_inexact
[dir
], bydst
)
1955 prune_one_bundle(pol
, func
, &gc_list
);
1957 table
= xfrm_policy_bydst
[dir
].table
;
1958 for (i
= xfrm_policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
1959 hlist_for_each_entry(pol
, entry
, table
+ i
, bydst
)
1960 prune_one_bundle(pol
, func
, &gc_list
);
1963 read_unlock_bh(&xfrm_policy_lock
);
1966 struct dst_entry
*dst
= gc_list
;
1967 gc_list
= dst
->next
;
1972 static int unused_bundle(struct dst_entry
*dst
)
1974 return !atomic_read(&dst
->__refcnt
);
1977 static void __xfrm_garbage_collect(void)
1979 xfrm_prune_bundles(unused_bundle
);
1982 static int xfrm_flush_bundles(void)
1984 xfrm_prune_bundles(stale_bundle
);
1988 void xfrm_init_pmtu(struct dst_entry
*dst
)
1991 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
1992 u32 pmtu
, route_mtu_cached
;
1994 pmtu
= dst_mtu(dst
->child
);
1995 xdst
->child_mtu_cached
= pmtu
;
1997 pmtu
= xfrm_state_mtu(dst
->xfrm
, pmtu
);
1999 route_mtu_cached
= dst_mtu(xdst
->route
);
2000 xdst
->route_mtu_cached
= route_mtu_cached
;
2002 if (pmtu
> route_mtu_cached
)
2003 pmtu
= route_mtu_cached
;
2005 dst
->metrics
[RTAX_MTU
-1] = pmtu
;
2006 } while ((dst
= dst
->next
));
2009 EXPORT_SYMBOL(xfrm_init_pmtu
);
2011 /* Check that the bundle accepts the flow and its components are
2015 int xfrm_bundle_ok(struct xfrm_policy
*pol
, struct xfrm_dst
*first
,
2016 struct flowi
*fl
, int family
, int strict
)
2018 struct dst_entry
*dst
= &first
->u
.dst
;
2019 struct xfrm_dst
*last
;
2022 if (!dst_check(dst
->path
, ((struct xfrm_dst
*)dst
)->path_cookie
) ||
2023 (dst
->dev
&& !netif_running(dst
->dev
)))
2025 #ifdef CONFIG_XFRM_SUB_POLICY
2027 if (first
->origin
&& !flow_cache_uli_match(first
->origin
, fl
))
2029 if (first
->partner
&&
2030 !xfrm_selector_match(first
->partner
, fl
, family
))
2038 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
2040 if (fl
&& !xfrm_selector_match(&dst
->xfrm
->sel
, fl
, family
))
2043 !security_xfrm_state_pol_flow_match(dst
->xfrm
, pol
, fl
))
2045 if (dst
->xfrm
->km
.state
!= XFRM_STATE_VALID
)
2047 if (xdst
->genid
!= dst
->xfrm
->genid
)
2050 if (strict
&& fl
&& dst
->xfrm
->props
.mode
!= XFRM_MODE_TUNNEL
&&
2051 !xfrm_state_addr_flow_check(dst
->xfrm
, fl
, family
))
2054 mtu
= dst_mtu(dst
->child
);
2055 if (xdst
->child_mtu_cached
!= mtu
) {
2057 xdst
->child_mtu_cached
= mtu
;
2060 if (!dst_check(xdst
->route
, xdst
->route_cookie
))
2062 mtu
= dst_mtu(xdst
->route
);
2063 if (xdst
->route_mtu_cached
!= mtu
) {
2065 xdst
->route_mtu_cached
= mtu
;
2069 } while (dst
->xfrm
);
2074 mtu
= last
->child_mtu_cached
;
2078 mtu
= xfrm_state_mtu(dst
->xfrm
, mtu
);
2079 if (mtu
> last
->route_mtu_cached
)
2080 mtu
= last
->route_mtu_cached
;
2081 dst
->metrics
[RTAX_MTU
-1] = mtu
;
2086 last
= last
->u
.next
;
2087 last
->child_mtu_cached
= mtu
;
2093 EXPORT_SYMBOL(xfrm_bundle_ok
);
2095 #ifdef CONFIG_AUDITSYSCALL
2096 /* Audit addition and deletion of SAs and ipsec policy */
2098 void xfrm_audit_log(uid_t auid
, u32 sid
, int type
, int result
,
2099 struct xfrm_policy
*xp
, struct xfrm_state
*x
)
2104 struct xfrm_sec_ctx
*sctx
= NULL
;
2105 struct audit_buffer
*audit_buf
;
2107 extern int audit_enabled
;
2109 if (audit_enabled
== 0)
2112 BUG_ON((type
== AUDIT_MAC_IPSEC_ADDSA
||
2113 type
== AUDIT_MAC_IPSEC_DELSA
) && !x
);
2114 BUG_ON((type
== AUDIT_MAC_IPSEC_ADDSPD
||
2115 type
== AUDIT_MAC_IPSEC_DELSPD
) && !xp
);
2117 audit_buf
= audit_log_start(current
->audit_context
, GFP_ATOMIC
, type
);
2118 if (audit_buf
== NULL
)
2122 case AUDIT_MAC_IPSEC_ADDSA
:
2123 audit_log_format(audit_buf
, "SAD add: auid=%u", auid
);
2125 case AUDIT_MAC_IPSEC_DELSA
:
2126 audit_log_format(audit_buf
, "SAD delete: auid=%u", auid
);
2128 case AUDIT_MAC_IPSEC_ADDSPD
:
2129 audit_log_format(audit_buf
, "SPD add: auid=%u", auid
);
2131 case AUDIT_MAC_IPSEC_DELSPD
:
2132 audit_log_format(audit_buf
, "SPD delete: auid=%u", auid
);
2139 security_secid_to_secctx(sid
, &secctx
, &secctx_len
) == 0)
2140 audit_log_format(audit_buf
, " subj=%s", secctx
);
2142 audit_log_task_context(audit_buf
);
2145 family
= xp
->selector
.family
;
2147 sctx
= xp
->security
;
2149 family
= x
->props
.family
;
2155 audit_log_format(audit_buf
,
2156 " sec_alg=%u sec_doi=%u sec_obj=%s",
2157 sctx
->ctx_alg
, sctx
->ctx_doi
, sctx
->ctx_str
);
2162 struct in_addr saddr
, daddr
;
2164 saddr
.s_addr
= xp
->selector
.saddr
.a4
;
2165 daddr
.s_addr
= xp
->selector
.daddr
.a4
;
2167 saddr
.s_addr
= x
->props
.saddr
.a4
;
2168 daddr
.s_addr
= x
->id
.daddr
.a4
;
2170 audit_log_format(audit_buf
,
2171 " src=%u.%u.%u.%u dst=%u.%u.%u.%u",
2172 NIPQUAD(saddr
), NIPQUAD(daddr
));
2177 struct in6_addr saddr6
, daddr6
;
2179 memcpy(&saddr6
, xp
->selector
.saddr
.a6
,
2180 sizeof(struct in6_addr
));
2181 memcpy(&daddr6
, xp
->selector
.daddr
.a6
,
2182 sizeof(struct in6_addr
));
2184 memcpy(&saddr6
, x
->props
.saddr
.a6
,
2185 sizeof(struct in6_addr
));
2186 memcpy(&daddr6
, x
->id
.daddr
.a6
,
2187 sizeof(struct in6_addr
));
2189 audit_log_format(audit_buf
,
2190 " src=" NIP6_FMT
" dst=" NIP6_FMT
,
2191 NIP6(saddr6
), NIP6(daddr6
));
2197 audit_log_format(audit_buf
, " spi=%lu(0x%lx) protocol=%s",
2198 (unsigned long)ntohl(x
->id
.spi
),
2199 (unsigned long)ntohl(x
->id
.spi
),
2200 x
->id
.proto
== IPPROTO_AH
? "AH" :
2201 (x
->id
.proto
== IPPROTO_ESP
?
2204 audit_log_format(audit_buf
, " res=%u", result
);
2205 audit_log_end(audit_buf
);
2208 EXPORT_SYMBOL(xfrm_audit_log
);
2209 #endif /* CONFIG_AUDITSYSCALL */
2211 int xfrm_policy_register_afinfo(struct xfrm_policy_afinfo
*afinfo
)
2214 if (unlikely(afinfo
== NULL
))
2216 if (unlikely(afinfo
->family
>= NPROTO
))
2217 return -EAFNOSUPPORT
;
2218 write_lock_bh(&xfrm_policy_afinfo_lock
);
2219 if (unlikely(xfrm_policy_afinfo
[afinfo
->family
] != NULL
))
2222 struct dst_ops
*dst_ops
= afinfo
->dst_ops
;
2223 if (likely(dst_ops
->kmem_cachep
== NULL
))
2224 dst_ops
->kmem_cachep
= xfrm_dst_cache
;
2225 if (likely(dst_ops
->check
== NULL
))
2226 dst_ops
->check
= xfrm_dst_check
;
2227 if (likely(dst_ops
->negative_advice
== NULL
))
2228 dst_ops
->negative_advice
= xfrm_negative_advice
;
2229 if (likely(dst_ops
->link_failure
== NULL
))
2230 dst_ops
->link_failure
= xfrm_link_failure
;
2231 if (likely(afinfo
->garbage_collect
== NULL
))
2232 afinfo
->garbage_collect
= __xfrm_garbage_collect
;
2233 xfrm_policy_afinfo
[afinfo
->family
] = afinfo
;
2235 write_unlock_bh(&xfrm_policy_afinfo_lock
);
2238 EXPORT_SYMBOL(xfrm_policy_register_afinfo
);
2240 int xfrm_policy_unregister_afinfo(struct xfrm_policy_afinfo
*afinfo
)
2243 if (unlikely(afinfo
== NULL
))
2245 if (unlikely(afinfo
->family
>= NPROTO
))
2246 return -EAFNOSUPPORT
;
2247 write_lock_bh(&xfrm_policy_afinfo_lock
);
2248 if (likely(xfrm_policy_afinfo
[afinfo
->family
] != NULL
)) {
2249 if (unlikely(xfrm_policy_afinfo
[afinfo
->family
] != afinfo
))
2252 struct dst_ops
*dst_ops
= afinfo
->dst_ops
;
2253 xfrm_policy_afinfo
[afinfo
->family
] = NULL
;
2254 dst_ops
->kmem_cachep
= NULL
;
2255 dst_ops
->check
= NULL
;
2256 dst_ops
->negative_advice
= NULL
;
2257 dst_ops
->link_failure
= NULL
;
2258 afinfo
->garbage_collect
= NULL
;
2261 write_unlock_bh(&xfrm_policy_afinfo_lock
);
2264 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo
);
2266 static struct xfrm_policy_afinfo
*xfrm_policy_get_afinfo(unsigned short family
)
2268 struct xfrm_policy_afinfo
*afinfo
;
2269 if (unlikely(family
>= NPROTO
))
2271 read_lock(&xfrm_policy_afinfo_lock
);
2272 afinfo
= xfrm_policy_afinfo
[family
];
2273 if (unlikely(!afinfo
))
2274 read_unlock(&xfrm_policy_afinfo_lock
);
2278 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo
*afinfo
)
2280 read_unlock(&xfrm_policy_afinfo_lock
);
2283 static struct xfrm_policy_afinfo
*xfrm_policy_lock_afinfo(unsigned int family
)
2285 struct xfrm_policy_afinfo
*afinfo
;
2286 if (unlikely(family
>= NPROTO
))
2288 write_lock_bh(&xfrm_policy_afinfo_lock
);
2289 afinfo
= xfrm_policy_afinfo
[family
];
2290 if (unlikely(!afinfo
))
2291 write_unlock_bh(&xfrm_policy_afinfo_lock
);
2295 static void xfrm_policy_unlock_afinfo(struct xfrm_policy_afinfo
*afinfo
)
2297 write_unlock_bh(&xfrm_policy_afinfo_lock
);
2300 static int xfrm_dev_event(struct notifier_block
*this, unsigned long event
, void *ptr
)
2304 xfrm_flush_bundles();
2309 static struct notifier_block xfrm_dev_notifier
= {
2315 static void __init
xfrm_policy_init(void)
2317 unsigned int hmask
, sz
;
2320 xfrm_dst_cache
= kmem_cache_create("xfrm_dst_cache",
2321 sizeof(struct xfrm_dst
),
2322 0, SLAB_HWCACHE_ALIGN
|SLAB_PANIC
,
2326 sz
= (hmask
+1) * sizeof(struct hlist_head
);
2328 xfrm_policy_byidx
= xfrm_hash_alloc(sz
);
2329 xfrm_idx_hmask
= hmask
;
2330 if (!xfrm_policy_byidx
)
2331 panic("XFRM: failed to allocate byidx hash\n");
2333 for (dir
= 0; dir
< XFRM_POLICY_MAX
* 2; dir
++) {
2334 struct xfrm_policy_hash
*htab
;
2336 INIT_HLIST_HEAD(&xfrm_policy_inexact
[dir
]);
2338 htab
= &xfrm_policy_bydst
[dir
];
2339 htab
->table
= xfrm_hash_alloc(sz
);
2340 htab
->hmask
= hmask
;
2342 panic("XFRM: failed to allocate bydst hash\n");
2345 INIT_WORK(&xfrm_policy_gc_work
, xfrm_policy_gc_task
);
2346 register_netdevice_notifier(&xfrm_dev_notifier
);
2349 void __init
xfrm_init(void)
2356 #ifdef CONFIG_XFRM_MIGRATE
2357 static int xfrm_migrate_selector_match(struct xfrm_selector
*sel_cmp
,
2358 struct xfrm_selector
*sel_tgt
)
2360 if (sel_cmp
->proto
== IPSEC_ULPROTO_ANY
) {
2361 if (sel_tgt
->family
== sel_cmp
->family
&&
2362 xfrm_addr_cmp(&sel_tgt
->daddr
, &sel_cmp
->daddr
,
2363 sel_cmp
->family
) == 0 &&
2364 xfrm_addr_cmp(&sel_tgt
->saddr
, &sel_cmp
->saddr
,
2365 sel_cmp
->family
) == 0 &&
2366 sel_tgt
->prefixlen_d
== sel_cmp
->prefixlen_d
&&
2367 sel_tgt
->prefixlen_s
== sel_cmp
->prefixlen_s
) {
2371 if (memcmp(sel_tgt
, sel_cmp
, sizeof(*sel_tgt
)) == 0) {
2378 static struct xfrm_policy
* xfrm_migrate_policy_find(struct xfrm_selector
*sel
,
2381 struct xfrm_policy
*pol
, *ret
= NULL
;
2382 struct hlist_node
*entry
;
2383 struct hlist_head
*chain
;
2386 read_lock_bh(&xfrm_policy_lock
);
2387 chain
= policy_hash_direct(&sel
->daddr
, &sel
->saddr
, sel
->family
, dir
);
2388 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
2389 if (xfrm_migrate_selector_match(sel
, &pol
->selector
) &&
2390 pol
->type
== type
) {
2392 priority
= ret
->priority
;
2396 chain
= &xfrm_policy_inexact
[dir
];
2397 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
2398 if (xfrm_migrate_selector_match(sel
, &pol
->selector
) &&
2399 pol
->type
== type
&&
2400 pol
->priority
< priority
) {
2409 read_unlock_bh(&xfrm_policy_lock
);
2414 static int migrate_tmpl_match(struct xfrm_migrate
*m
, struct xfrm_tmpl
*t
)
2418 if (t
->mode
== m
->mode
&& t
->id
.proto
== m
->proto
&&
2419 (m
->reqid
== 0 || t
->reqid
== m
->reqid
)) {
2421 case XFRM_MODE_TUNNEL
:
2422 case XFRM_MODE_BEET
:
2423 if (xfrm_addr_cmp(&t
->id
.daddr
, &m
->old_daddr
,
2424 m
->old_family
) == 0 &&
2425 xfrm_addr_cmp(&t
->saddr
, &m
->old_saddr
,
2426 m
->old_family
) == 0) {
2430 case XFRM_MODE_TRANSPORT
:
2431 /* in case of transport mode, template does not store
2432 any IP addresses, hence we just compare mode and
2443 /* update endpoint address(es) of template(s) */
2444 static int xfrm_policy_migrate(struct xfrm_policy
*pol
,
2445 struct xfrm_migrate
*m
, int num_migrate
)
2447 struct xfrm_migrate
*mp
;
2448 struct dst_entry
*dst
;
2451 write_lock_bh(&pol
->lock
);
2452 if (unlikely(pol
->dead
)) {
2453 /* target policy has been deleted */
2454 write_unlock_bh(&pol
->lock
);
2458 for (i
= 0; i
< pol
->xfrm_nr
; i
++) {
2459 for (j
= 0, mp
= m
; j
< num_migrate
; j
++, mp
++) {
2460 if (!migrate_tmpl_match(mp
, &pol
->xfrm_vec
[i
]))
2463 if (pol
->xfrm_vec
[i
].mode
!= XFRM_MODE_TUNNEL
)
2465 /* update endpoints */
2466 memcpy(&pol
->xfrm_vec
[i
].id
.daddr
, &mp
->new_daddr
,
2467 sizeof(pol
->xfrm_vec
[i
].id
.daddr
));
2468 memcpy(&pol
->xfrm_vec
[i
].saddr
, &mp
->new_saddr
,
2469 sizeof(pol
->xfrm_vec
[i
].saddr
));
2470 pol
->xfrm_vec
[i
].encap_family
= mp
->new_family
;
2472 while ((dst
= pol
->bundles
) != NULL
) {
2473 pol
->bundles
= dst
->next
;
2479 write_unlock_bh(&pol
->lock
);
2487 static int xfrm_migrate_check(struct xfrm_migrate
*m
, int num_migrate
)
2491 if (num_migrate
< 1 || num_migrate
> XFRM_MAX_DEPTH
)
2494 for (i
= 0; i
< num_migrate
; i
++) {
2495 if ((xfrm_addr_cmp(&m
[i
].old_daddr
, &m
[i
].new_daddr
,
2496 m
[i
].old_family
) == 0) &&
2497 (xfrm_addr_cmp(&m
[i
].old_saddr
, &m
[i
].new_saddr
,
2498 m
[i
].old_family
) == 0))
2500 if (xfrm_addr_any(&m
[i
].new_daddr
, m
[i
].new_family
) ||
2501 xfrm_addr_any(&m
[i
].new_saddr
, m
[i
].new_family
))
2504 /* check if there is any duplicated entry */
2505 for (j
= i
+ 1; j
< num_migrate
; j
++) {
2506 if (!memcmp(&m
[i
].old_daddr
, &m
[j
].old_daddr
,
2507 sizeof(m
[i
].old_daddr
)) &&
2508 !memcmp(&m
[i
].old_saddr
, &m
[j
].old_saddr
,
2509 sizeof(m
[i
].old_saddr
)) &&
2510 m
[i
].proto
== m
[j
].proto
&&
2511 m
[i
].mode
== m
[j
].mode
&&
2512 m
[i
].reqid
== m
[j
].reqid
&&
2513 m
[i
].old_family
== m
[j
].old_family
)
2521 int xfrm_migrate(struct xfrm_selector
*sel
, u8 dir
, u8 type
,
2522 struct xfrm_migrate
*m
, int num_migrate
)
2524 int i
, err
, nx_cur
= 0, nx_new
= 0;
2525 struct xfrm_policy
*pol
= NULL
;
2526 struct xfrm_state
*x
, *xc
;
2527 struct xfrm_state
*x_cur
[XFRM_MAX_DEPTH
];
2528 struct xfrm_state
*x_new
[XFRM_MAX_DEPTH
];
2529 struct xfrm_migrate
*mp
;
2531 if ((err
= xfrm_migrate_check(m
, num_migrate
)) < 0)
2534 /* Stage 1 - find policy */
2535 if ((pol
= xfrm_migrate_policy_find(sel
, dir
, type
)) == NULL
) {
2540 /* Stage 2 - find and update state(s) */
2541 for (i
= 0, mp
= m
; i
< num_migrate
; i
++, mp
++) {
2542 if ((x
= xfrm_migrate_state_find(mp
))) {
2545 if ((xc
= xfrm_state_migrate(x
, mp
))) {
2555 /* Stage 3 - update policy */
2556 if ((err
= xfrm_policy_migrate(pol
, m
, num_migrate
)) < 0)
2559 /* Stage 4 - delete old state(s) */
2561 xfrm_states_put(x_cur
, nx_cur
);
2562 xfrm_states_delete(x_cur
, nx_cur
);
2565 /* Stage 5 - announce */
2566 km_migrate(sel
, dir
, type
, m
, num_migrate
);
2578 xfrm_states_put(x_cur
, nx_cur
);
2580 xfrm_states_delete(x_new
, nx_new
);
2584 EXPORT_SYMBOL(xfrm_migrate
);