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
;
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_bytype
[XFRM_POLICY_TYPE_MAX
];
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 struct work_struct xfrm_policy_gc_work
;
59 static HLIST_HEAD(xfrm_policy_gc_list
);
60 static DEFINE_SPINLOCK(xfrm_policy_gc_lock
);
62 static struct xfrm_policy_afinfo
*xfrm_policy_get_afinfo(unsigned short family
);
63 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo
*afinfo
);
64 static void xfrm_init_pmtu(struct dst_entry
*dst
);
67 __xfrm4_selector_match(struct xfrm_selector
*sel
, struct flowi
*fl
)
69 return addr_match(&fl
->fl4_dst
, &sel
->daddr
, sel
->prefixlen_d
) &&
70 addr_match(&fl
->fl4_src
, &sel
->saddr
, sel
->prefixlen_s
) &&
71 !((xfrm_flowi_dport(fl
) ^ sel
->dport
) & sel
->dport_mask
) &&
72 !((xfrm_flowi_sport(fl
) ^ sel
->sport
) & sel
->sport_mask
) &&
73 (fl
->proto
== sel
->proto
|| !sel
->proto
) &&
74 (fl
->oif
== sel
->ifindex
|| !sel
->ifindex
);
78 __xfrm6_selector_match(struct xfrm_selector
*sel
, struct flowi
*fl
)
80 return addr_match(&fl
->fl6_dst
, &sel
->daddr
, sel
->prefixlen_d
) &&
81 addr_match(&fl
->fl6_src
, &sel
->saddr
, sel
->prefixlen_s
) &&
82 !((xfrm_flowi_dport(fl
) ^ sel
->dport
) & sel
->dport_mask
) &&
83 !((xfrm_flowi_sport(fl
) ^ sel
->sport
) & sel
->sport_mask
) &&
84 (fl
->proto
== sel
->proto
|| !sel
->proto
) &&
85 (fl
->oif
== sel
->ifindex
|| !sel
->ifindex
);
88 int xfrm_selector_match(struct xfrm_selector
*sel
, struct flowi
*fl
,
89 unsigned short family
)
93 return __xfrm4_selector_match(sel
, fl
);
95 return __xfrm6_selector_match(sel
, fl
);
100 static inline struct dst_entry
*__xfrm_dst_lookup(int tos
,
101 xfrm_address_t
*saddr
,
102 xfrm_address_t
*daddr
,
105 struct xfrm_policy_afinfo
*afinfo
;
106 struct dst_entry
*dst
;
108 afinfo
= xfrm_policy_get_afinfo(family
);
109 if (unlikely(afinfo
== NULL
))
110 return ERR_PTR(-EAFNOSUPPORT
);
112 dst
= afinfo
->dst_lookup(tos
, saddr
, daddr
);
114 xfrm_policy_put_afinfo(afinfo
);
119 static inline struct dst_entry
*xfrm_dst_lookup(struct xfrm_state
*x
, int tos
,
120 xfrm_address_t
*prev_saddr
,
121 xfrm_address_t
*prev_daddr
,
124 xfrm_address_t
*saddr
= &x
->props
.saddr
;
125 xfrm_address_t
*daddr
= &x
->id
.daddr
;
126 struct dst_entry
*dst
;
128 if (x
->type
->flags
& XFRM_TYPE_LOCAL_COADDR
) {
132 if (x
->type
->flags
& XFRM_TYPE_REMOTE_COADDR
) {
137 dst
= __xfrm_dst_lookup(tos
, saddr
, daddr
, family
);
140 if (prev_saddr
!= saddr
)
141 memcpy(prev_saddr
, saddr
, sizeof(*prev_saddr
));
142 if (prev_daddr
!= daddr
)
143 memcpy(prev_daddr
, daddr
, sizeof(*prev_daddr
));
149 static inline unsigned long make_jiffies(long secs
)
151 if (secs
>= (MAX_SCHEDULE_TIMEOUT
-1)/HZ
)
152 return MAX_SCHEDULE_TIMEOUT
-1;
157 static void xfrm_policy_timer(unsigned long data
)
159 struct xfrm_policy
*xp
= (struct xfrm_policy
*)data
;
160 unsigned long now
= get_seconds();
161 long next
= LONG_MAX
;
165 read_lock(&xp
->lock
);
170 dir
= xfrm_policy_id2dir(xp
->index
);
172 if (xp
->lft
.hard_add_expires_seconds
) {
173 long tmo
= xp
->lft
.hard_add_expires_seconds
+
174 xp
->curlft
.add_time
- now
;
180 if (xp
->lft
.hard_use_expires_seconds
) {
181 long tmo
= xp
->lft
.hard_use_expires_seconds
+
182 (xp
->curlft
.use_time
? : xp
->curlft
.add_time
) - now
;
188 if (xp
->lft
.soft_add_expires_seconds
) {
189 long tmo
= xp
->lft
.soft_add_expires_seconds
+
190 xp
->curlft
.add_time
- now
;
193 tmo
= XFRM_KM_TIMEOUT
;
198 if (xp
->lft
.soft_use_expires_seconds
) {
199 long tmo
= xp
->lft
.soft_use_expires_seconds
+
200 (xp
->curlft
.use_time
? : xp
->curlft
.add_time
) - now
;
203 tmo
= XFRM_KM_TIMEOUT
;
210 km_policy_expired(xp
, dir
, 0, 0);
211 if (next
!= LONG_MAX
&&
212 !mod_timer(&xp
->timer
, jiffies
+ make_jiffies(next
)))
216 read_unlock(&xp
->lock
);
221 read_unlock(&xp
->lock
);
222 if (!xfrm_policy_delete(xp
, dir
))
223 km_policy_expired(xp
, dir
, 1, 0);
228 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
232 struct xfrm_policy
*xfrm_policy_alloc(gfp_t gfp
)
234 struct xfrm_policy
*policy
;
236 policy
= kzalloc(sizeof(struct xfrm_policy
), gfp
);
239 INIT_LIST_HEAD(&policy
->bytype
);
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
->dead
);
257 BUG_ON(policy
->bundles
);
259 if (del_timer(&policy
->timer
))
262 write_lock_bh(&xfrm_policy_lock
);
263 list_del(&policy
->bytype
);
264 write_unlock_bh(&xfrm_policy_lock
);
266 security_xfrm_policy_free(policy
->security
);
269 EXPORT_SYMBOL(xfrm_policy_destroy
);
271 static void xfrm_policy_gc_kill(struct xfrm_policy
*policy
)
273 struct dst_entry
*dst
;
275 while ((dst
= policy
->bundles
) != NULL
) {
276 policy
->bundles
= dst
->next
;
280 if (del_timer(&policy
->timer
))
281 atomic_dec(&policy
->refcnt
);
283 if (atomic_read(&policy
->refcnt
) > 1)
286 xfrm_pol_put(policy
);
289 static void xfrm_policy_gc_task(struct work_struct
*work
)
291 struct xfrm_policy
*policy
;
292 struct hlist_node
*entry
, *tmp
;
293 struct hlist_head gc_list
;
295 spin_lock_bh(&xfrm_policy_gc_lock
);
296 gc_list
.first
= xfrm_policy_gc_list
.first
;
297 INIT_HLIST_HEAD(&xfrm_policy_gc_list
);
298 spin_unlock_bh(&xfrm_policy_gc_lock
);
300 hlist_for_each_entry_safe(policy
, entry
, tmp
, &gc_list
, bydst
)
301 xfrm_policy_gc_kill(policy
);
304 /* Rule must be locked. Release descentant resources, announce
305 * entry dead. The rule must be unlinked from lists to the moment.
308 static void xfrm_policy_kill(struct xfrm_policy
*policy
)
312 write_lock_bh(&policy
->lock
);
315 write_unlock_bh(&policy
->lock
);
317 if (unlikely(dead
)) {
322 spin_lock(&xfrm_policy_gc_lock
);
323 hlist_add_head(&policy
->bydst
, &xfrm_policy_gc_list
);
324 spin_unlock(&xfrm_policy_gc_lock
);
326 schedule_work(&xfrm_policy_gc_work
);
329 struct xfrm_policy_hash
{
330 struct hlist_head
*table
;
334 static struct hlist_head xfrm_policy_inexact
[XFRM_POLICY_MAX
*2];
335 static struct xfrm_policy_hash xfrm_policy_bydst
[XFRM_POLICY_MAX
*2] __read_mostly
;
336 static struct hlist_head
*xfrm_policy_byidx __read_mostly
;
337 static unsigned int xfrm_idx_hmask __read_mostly
;
338 static unsigned int xfrm_policy_hashmax __read_mostly
= 1 * 1024 * 1024;
340 static inline unsigned int idx_hash(u32 index
)
342 return __idx_hash(index
, xfrm_idx_hmask
);
345 static struct hlist_head
*policy_hash_bysel(struct xfrm_selector
*sel
, unsigned short family
, int dir
)
347 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
348 unsigned int hash
= __sel_hash(sel
, family
, hmask
);
350 return (hash
== hmask
+ 1 ?
351 &xfrm_policy_inexact
[dir
] :
352 xfrm_policy_bydst
[dir
].table
+ hash
);
355 static struct hlist_head
*policy_hash_direct(xfrm_address_t
*daddr
, xfrm_address_t
*saddr
, unsigned short family
, int dir
)
357 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
358 unsigned int hash
= __addr_hash(daddr
, saddr
, family
, hmask
);
360 return xfrm_policy_bydst
[dir
].table
+ hash
;
363 static void xfrm_dst_hash_transfer(struct hlist_head
*list
,
364 struct hlist_head
*ndsttable
,
365 unsigned int nhashmask
)
367 struct hlist_node
*entry
, *tmp
, *entry0
= NULL
;
368 struct xfrm_policy
*pol
;
372 hlist_for_each_entry_safe(pol
, entry
, tmp
, list
, bydst
) {
375 h
= __addr_hash(&pol
->selector
.daddr
, &pol
->selector
.saddr
,
376 pol
->family
, nhashmask
);
379 hlist_add_head(&pol
->bydst
, ndsttable
+h
);
385 hlist_add_after(entry0
, &pol
->bydst
);
389 if (!hlist_empty(list
)) {
395 static void xfrm_idx_hash_transfer(struct hlist_head
*list
,
396 struct hlist_head
*nidxtable
,
397 unsigned int nhashmask
)
399 struct hlist_node
*entry
, *tmp
;
400 struct xfrm_policy
*pol
;
402 hlist_for_each_entry_safe(pol
, entry
, tmp
, list
, byidx
) {
405 h
= __idx_hash(pol
->index
, nhashmask
);
406 hlist_add_head(&pol
->byidx
, nidxtable
+h
);
410 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask
)
412 return ((old_hmask
+ 1) << 1) - 1;
415 static void xfrm_bydst_resize(int dir
)
417 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
418 unsigned int nhashmask
= xfrm_new_hash_mask(hmask
);
419 unsigned int nsize
= (nhashmask
+ 1) * sizeof(struct hlist_head
);
420 struct hlist_head
*odst
= xfrm_policy_bydst
[dir
].table
;
421 struct hlist_head
*ndst
= xfrm_hash_alloc(nsize
);
427 write_lock_bh(&xfrm_policy_lock
);
429 for (i
= hmask
; i
>= 0; i
--)
430 xfrm_dst_hash_transfer(odst
+ i
, ndst
, nhashmask
);
432 xfrm_policy_bydst
[dir
].table
= ndst
;
433 xfrm_policy_bydst
[dir
].hmask
= nhashmask
;
435 write_unlock_bh(&xfrm_policy_lock
);
437 xfrm_hash_free(odst
, (hmask
+ 1) * sizeof(struct hlist_head
));
440 static void xfrm_byidx_resize(int total
)
442 unsigned int hmask
= xfrm_idx_hmask
;
443 unsigned int nhashmask
= xfrm_new_hash_mask(hmask
);
444 unsigned int nsize
= (nhashmask
+ 1) * sizeof(struct hlist_head
);
445 struct hlist_head
*oidx
= xfrm_policy_byidx
;
446 struct hlist_head
*nidx
= xfrm_hash_alloc(nsize
);
452 write_lock_bh(&xfrm_policy_lock
);
454 for (i
= hmask
; i
>= 0; i
--)
455 xfrm_idx_hash_transfer(oidx
+ i
, nidx
, nhashmask
);
457 xfrm_policy_byidx
= nidx
;
458 xfrm_idx_hmask
= nhashmask
;
460 write_unlock_bh(&xfrm_policy_lock
);
462 xfrm_hash_free(oidx
, (hmask
+ 1) * sizeof(struct hlist_head
));
465 static inline int xfrm_bydst_should_resize(int dir
, int *total
)
467 unsigned int cnt
= xfrm_policy_count
[dir
];
468 unsigned int hmask
= xfrm_policy_bydst
[dir
].hmask
;
473 if ((hmask
+ 1) < xfrm_policy_hashmax
&&
480 static inline int xfrm_byidx_should_resize(int total
)
482 unsigned int hmask
= xfrm_idx_hmask
;
484 if ((hmask
+ 1) < xfrm_policy_hashmax
&&
491 void xfrm_spd_getinfo(struct xfrmk_spdinfo
*si
)
493 read_lock_bh(&xfrm_policy_lock
);
494 si
->incnt
= xfrm_policy_count
[XFRM_POLICY_IN
];
495 si
->outcnt
= xfrm_policy_count
[XFRM_POLICY_OUT
];
496 si
->fwdcnt
= xfrm_policy_count
[XFRM_POLICY_FWD
];
497 si
->inscnt
= xfrm_policy_count
[XFRM_POLICY_IN
+XFRM_POLICY_MAX
];
498 si
->outscnt
= xfrm_policy_count
[XFRM_POLICY_OUT
+XFRM_POLICY_MAX
];
499 si
->fwdscnt
= xfrm_policy_count
[XFRM_POLICY_FWD
+XFRM_POLICY_MAX
];
500 si
->spdhcnt
= xfrm_idx_hmask
;
501 si
->spdhmcnt
= xfrm_policy_hashmax
;
502 read_unlock_bh(&xfrm_policy_lock
);
504 EXPORT_SYMBOL(xfrm_spd_getinfo
);
506 static DEFINE_MUTEX(hash_resize_mutex
);
507 static void xfrm_hash_resize(struct work_struct
*__unused
)
511 mutex_lock(&hash_resize_mutex
);
514 for (dir
= 0; dir
< XFRM_POLICY_MAX
* 2; dir
++) {
515 if (xfrm_bydst_should_resize(dir
, &total
))
516 xfrm_bydst_resize(dir
);
518 if (xfrm_byidx_should_resize(total
))
519 xfrm_byidx_resize(total
);
521 mutex_unlock(&hash_resize_mutex
);
524 static DECLARE_WORK(xfrm_hash_work
, xfrm_hash_resize
);
526 /* Generate new index... KAME seems to generate them ordered by cost
527 * of an absolute inpredictability of ordering of rules. This will not pass. */
528 static u32
xfrm_gen_index(u8 type
, int dir
)
530 static u32 idx_generator
;
533 struct hlist_node
*entry
;
534 struct hlist_head
*list
;
535 struct xfrm_policy
*p
;
539 idx
= (idx_generator
| dir
);
543 list
= xfrm_policy_byidx
+ idx_hash(idx
);
545 hlist_for_each_entry(p
, entry
, list
, byidx
) {
546 if (p
->index
== idx
) {
556 static inline int selector_cmp(struct xfrm_selector
*s1
, struct xfrm_selector
*s2
)
558 u32
*p1
= (u32
*) s1
;
559 u32
*p2
= (u32
*) s2
;
560 int len
= sizeof(struct xfrm_selector
) / sizeof(u32
);
563 for (i
= 0; i
< len
; i
++) {
571 int xfrm_policy_insert(int dir
, struct xfrm_policy
*policy
, int excl
)
573 struct xfrm_policy
*pol
;
574 struct xfrm_policy
*delpol
;
575 struct hlist_head
*chain
;
576 struct hlist_node
*entry
, *newpos
;
577 struct dst_entry
*gc_list
;
579 write_lock_bh(&xfrm_policy_lock
);
580 chain
= policy_hash_bysel(&policy
->selector
, policy
->family
, dir
);
583 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
584 if (pol
->type
== policy
->type
&&
585 !selector_cmp(&pol
->selector
, &policy
->selector
) &&
586 xfrm_sec_ctx_match(pol
->security
, policy
->security
) &&
589 write_unlock_bh(&xfrm_policy_lock
);
593 if (policy
->priority
> pol
->priority
)
595 } else if (policy
->priority
>= pol
->priority
) {
596 newpos
= &pol
->bydst
;
603 hlist_add_after(newpos
, &policy
->bydst
);
605 hlist_add_head(&policy
->bydst
, chain
);
606 xfrm_pol_hold(policy
);
607 xfrm_policy_count
[dir
]++;
608 atomic_inc(&flow_cache_genid
);
610 hlist_del(&delpol
->bydst
);
611 hlist_del(&delpol
->byidx
);
612 xfrm_policy_count
[dir
]--;
614 policy
->index
= delpol
? delpol
->index
: xfrm_gen_index(policy
->type
, dir
);
615 hlist_add_head(&policy
->byidx
, xfrm_policy_byidx
+idx_hash(policy
->index
));
616 policy
->curlft
.add_time
= get_seconds();
617 policy
->curlft
.use_time
= 0;
618 if (!mod_timer(&policy
->timer
, jiffies
+ HZ
))
619 xfrm_pol_hold(policy
);
620 list_add_tail(&policy
->bytype
, &xfrm_policy_bytype
[policy
->type
]);
621 write_unlock_bh(&xfrm_policy_lock
);
624 xfrm_policy_kill(delpol
);
625 else if (xfrm_bydst_should_resize(dir
, NULL
))
626 schedule_work(&xfrm_hash_work
);
628 read_lock_bh(&xfrm_policy_lock
);
630 entry
= &policy
->bydst
;
631 hlist_for_each_entry_continue(policy
, entry
, bydst
) {
632 struct dst_entry
*dst
;
634 write_lock(&policy
->lock
);
635 dst
= policy
->bundles
;
637 struct dst_entry
*tail
= dst
;
640 tail
->next
= gc_list
;
643 policy
->bundles
= NULL
;
645 write_unlock(&policy
->lock
);
647 read_unlock_bh(&xfrm_policy_lock
);
650 struct dst_entry
*dst
= gc_list
;
658 EXPORT_SYMBOL(xfrm_policy_insert
);
660 struct xfrm_policy
*xfrm_policy_bysel_ctx(u8 type
, int dir
,
661 struct xfrm_selector
*sel
,
662 struct xfrm_sec_ctx
*ctx
, int delete,
665 struct xfrm_policy
*pol
, *ret
;
666 struct hlist_head
*chain
;
667 struct hlist_node
*entry
;
670 write_lock_bh(&xfrm_policy_lock
);
671 chain
= policy_hash_bysel(sel
, sel
->family
, dir
);
673 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
674 if (pol
->type
== type
&&
675 !selector_cmp(sel
, &pol
->selector
) &&
676 xfrm_sec_ctx_match(ctx
, pol
->security
)) {
679 *err
= security_xfrm_policy_delete(
682 write_unlock_bh(&xfrm_policy_lock
);
685 hlist_del(&pol
->bydst
);
686 hlist_del(&pol
->byidx
);
687 xfrm_policy_count
[dir
]--;
693 write_unlock_bh(&xfrm_policy_lock
);
696 atomic_inc(&flow_cache_genid
);
697 xfrm_policy_kill(ret
);
701 EXPORT_SYMBOL(xfrm_policy_bysel_ctx
);
703 struct xfrm_policy
*xfrm_policy_byid(u8 type
, int dir
, u32 id
, int delete,
706 struct xfrm_policy
*pol
, *ret
;
707 struct hlist_head
*chain
;
708 struct hlist_node
*entry
;
711 if (xfrm_policy_id2dir(id
) != dir
)
715 write_lock_bh(&xfrm_policy_lock
);
716 chain
= xfrm_policy_byidx
+ idx_hash(id
);
718 hlist_for_each_entry(pol
, entry
, chain
, byidx
) {
719 if (pol
->type
== type
&& pol
->index
== id
) {
722 *err
= security_xfrm_policy_delete(
725 write_unlock_bh(&xfrm_policy_lock
);
728 hlist_del(&pol
->bydst
);
729 hlist_del(&pol
->byidx
);
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
,
769 for (i
= xfrm_policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
770 hlist_for_each_entry(pol
, entry
,
771 xfrm_policy_bydst
[dir
].table
+ i
,
773 if (pol
->type
!= type
)
775 err
= security_xfrm_policy_delete(
778 xfrm_audit_policy_delete(pol
, 0,
779 audit_info
->loginuid
,
790 xfrm_policy_flush_secctx_check(u8 type
, struct xfrm_audit
*audit_info
)
796 int xfrm_policy_flush(u8 type
, struct xfrm_audit
*audit_info
)
800 write_lock_bh(&xfrm_policy_lock
);
802 err
= xfrm_policy_flush_secctx_check(type
, audit_info
);
806 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
807 struct xfrm_policy
*pol
;
808 struct hlist_node
*entry
;
813 hlist_for_each_entry(pol
, entry
,
814 &xfrm_policy_inexact
[dir
], bydst
) {
815 if (pol
->type
!= type
)
817 hlist_del(&pol
->bydst
);
818 hlist_del(&pol
->byidx
);
819 write_unlock_bh(&xfrm_policy_lock
);
821 xfrm_audit_policy_delete(pol
, 1, audit_info
->loginuid
,
824 xfrm_policy_kill(pol
);
827 write_lock_bh(&xfrm_policy_lock
);
831 for (i
= xfrm_policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
833 hlist_for_each_entry(pol
, entry
,
834 xfrm_policy_bydst
[dir
].table
+ i
,
836 if (pol
->type
!= type
)
838 hlist_del(&pol
->bydst
);
839 hlist_del(&pol
->byidx
);
840 write_unlock_bh(&xfrm_policy_lock
);
842 xfrm_audit_policy_delete(pol
, 1,
843 audit_info
->loginuid
,
845 xfrm_policy_kill(pol
);
848 write_lock_bh(&xfrm_policy_lock
);
853 xfrm_policy_count
[dir
] -= killed
;
855 atomic_inc(&flow_cache_genid
);
857 write_unlock_bh(&xfrm_policy_lock
);
860 EXPORT_SYMBOL(xfrm_policy_flush
);
862 int xfrm_policy_walk(struct xfrm_policy_walk
*walk
,
863 int (*func
)(struct xfrm_policy
*, int, int, void*),
866 struct xfrm_policy
*old
, *pol
, *last
= NULL
;
869 if (walk
->type
>= XFRM_POLICY_TYPE_MAX
&&
870 walk
->type
!= XFRM_POLICY_TYPE_ANY
)
873 if (walk
->policy
== NULL
&& walk
->count
!= 0)
876 old
= pol
= walk
->policy
;
878 read_lock_bh(&xfrm_policy_lock
);
880 for (; walk
->cur_type
< XFRM_POLICY_TYPE_MAX
; walk
->cur_type
++) {
881 if (walk
->type
!= walk
->cur_type
&&
882 walk
->type
!= XFRM_POLICY_TYPE_ANY
)
886 pol
= list_first_entry(&xfrm_policy_bytype
[walk
->cur_type
],
887 struct xfrm_policy
, bytype
);
889 list_for_each_entry_from(pol
, &xfrm_policy_bytype
[walk
->cur_type
], bytype
) {
893 error
= func(last
, xfrm_policy_id2dir(last
->index
),
906 if (walk
->count
== 0) {
911 error
= func(last
, xfrm_policy_id2dir(last
->index
), 0, data
);
913 read_unlock_bh(&xfrm_policy_lock
);
918 EXPORT_SYMBOL(xfrm_policy_walk
);
921 * Find policy to apply to this flow.
923 * Returns 0 if policy found, else an -errno.
925 static int xfrm_policy_match(struct xfrm_policy
*pol
, struct flowi
*fl
,
926 u8 type
, u16 family
, int dir
)
928 struct xfrm_selector
*sel
= &pol
->selector
;
929 int match
, ret
= -ESRCH
;
931 if (pol
->family
!= family
||
935 match
= xfrm_selector_match(sel
, fl
, family
);
937 ret
= security_xfrm_policy_lookup(pol
->security
, fl
->secid
,
943 static struct xfrm_policy
*xfrm_policy_lookup_bytype(u8 type
, struct flowi
*fl
,
947 struct xfrm_policy
*pol
, *ret
;
948 xfrm_address_t
*daddr
, *saddr
;
949 struct hlist_node
*entry
;
950 struct hlist_head
*chain
;
953 daddr
= xfrm_flowi_daddr(fl
, family
);
954 saddr
= xfrm_flowi_saddr(fl
, family
);
955 if (unlikely(!daddr
|| !saddr
))
958 read_lock_bh(&xfrm_policy_lock
);
959 chain
= policy_hash_direct(daddr
, saddr
, family
, dir
);
961 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
962 err
= xfrm_policy_match(pol
, fl
, type
, family
, dir
);
972 priority
= ret
->priority
;
976 chain
= &xfrm_policy_inexact
[dir
];
977 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
978 err
= xfrm_policy_match(pol
, fl
, type
, family
, dir
);
986 } else if (pol
->priority
< priority
) {
994 read_unlock_bh(&xfrm_policy_lock
);
999 static int xfrm_policy_lookup(struct flowi
*fl
, u16 family
, u8 dir
,
1000 void **objp
, atomic_t
**obj_refp
)
1002 struct xfrm_policy
*pol
;
1005 #ifdef CONFIG_XFRM_SUB_POLICY
1006 pol
= xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_SUB
, fl
, family
, dir
);
1014 pol
= xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN
, fl
, family
, dir
);
1019 #ifdef CONFIG_XFRM_SUB_POLICY
1022 if ((*objp
= (void *) pol
) != NULL
)
1023 *obj_refp
= &pol
->refcnt
;
1027 static inline int policy_to_flow_dir(int dir
)
1029 if (XFRM_POLICY_IN
== FLOW_DIR_IN
&&
1030 XFRM_POLICY_OUT
== FLOW_DIR_OUT
&&
1031 XFRM_POLICY_FWD
== FLOW_DIR_FWD
)
1035 case XFRM_POLICY_IN
:
1037 case XFRM_POLICY_OUT
:
1038 return FLOW_DIR_OUT
;
1039 case XFRM_POLICY_FWD
:
1040 return FLOW_DIR_FWD
;
1044 static struct xfrm_policy
*xfrm_sk_policy_lookup(struct sock
*sk
, int dir
, struct flowi
*fl
)
1046 struct xfrm_policy
*pol
;
1048 read_lock_bh(&xfrm_policy_lock
);
1049 if ((pol
= sk
->sk_policy
[dir
]) != NULL
) {
1050 int match
= xfrm_selector_match(&pol
->selector
, fl
,
1055 err
= security_xfrm_policy_lookup(pol
->security
,
1057 policy_to_flow_dir(dir
));
1060 else if (err
== -ESRCH
)
1067 read_unlock_bh(&xfrm_policy_lock
);
1071 static void __xfrm_policy_link(struct xfrm_policy
*pol
, int dir
)
1073 struct hlist_head
*chain
= policy_hash_bysel(&pol
->selector
,
1076 hlist_add_head(&pol
->bydst
, chain
);
1077 hlist_add_head(&pol
->byidx
, xfrm_policy_byidx
+idx_hash(pol
->index
));
1078 xfrm_policy_count
[dir
]++;
1081 if (xfrm_bydst_should_resize(dir
, NULL
))
1082 schedule_work(&xfrm_hash_work
);
1085 static struct xfrm_policy
*__xfrm_policy_unlink(struct xfrm_policy
*pol
,
1088 if (hlist_unhashed(&pol
->bydst
))
1091 hlist_del(&pol
->bydst
);
1092 hlist_del(&pol
->byidx
);
1093 xfrm_policy_count
[dir
]--;
1098 int xfrm_policy_delete(struct xfrm_policy
*pol
, int dir
)
1100 write_lock_bh(&xfrm_policy_lock
);
1101 pol
= __xfrm_policy_unlink(pol
, dir
);
1102 write_unlock_bh(&xfrm_policy_lock
);
1104 if (dir
< XFRM_POLICY_MAX
)
1105 atomic_inc(&flow_cache_genid
);
1106 xfrm_policy_kill(pol
);
1111 EXPORT_SYMBOL(xfrm_policy_delete
);
1113 int xfrm_sk_policy_insert(struct sock
*sk
, int dir
, struct xfrm_policy
*pol
)
1115 struct xfrm_policy
*old_pol
;
1117 #ifdef CONFIG_XFRM_SUB_POLICY
1118 if (pol
&& pol
->type
!= XFRM_POLICY_TYPE_MAIN
)
1122 write_lock_bh(&xfrm_policy_lock
);
1123 old_pol
= sk
->sk_policy
[dir
];
1124 sk
->sk_policy
[dir
] = pol
;
1126 pol
->curlft
.add_time
= get_seconds();
1127 pol
->index
= xfrm_gen_index(pol
->type
, XFRM_POLICY_MAX
+dir
);
1128 __xfrm_policy_link(pol
, XFRM_POLICY_MAX
+dir
);
1131 __xfrm_policy_unlink(old_pol
, XFRM_POLICY_MAX
+dir
);
1132 write_unlock_bh(&xfrm_policy_lock
);
1135 xfrm_policy_kill(old_pol
);
1140 static struct xfrm_policy
*clone_policy(struct xfrm_policy
*old
, int dir
)
1142 struct xfrm_policy
*newp
= xfrm_policy_alloc(GFP_ATOMIC
);
1145 newp
->selector
= old
->selector
;
1146 if (security_xfrm_policy_clone(old
->security
,
1149 return NULL
; /* ENOMEM */
1151 newp
->lft
= old
->lft
;
1152 newp
->curlft
= old
->curlft
;
1153 newp
->action
= old
->action
;
1154 newp
->flags
= old
->flags
;
1155 newp
->xfrm_nr
= old
->xfrm_nr
;
1156 newp
->index
= old
->index
;
1157 newp
->type
= old
->type
;
1158 memcpy(newp
->xfrm_vec
, old
->xfrm_vec
,
1159 newp
->xfrm_nr
*sizeof(struct xfrm_tmpl
));
1160 write_lock_bh(&xfrm_policy_lock
);
1161 __xfrm_policy_link(newp
, XFRM_POLICY_MAX
+dir
);
1162 write_unlock_bh(&xfrm_policy_lock
);
1168 int __xfrm_sk_clone_policy(struct sock
*sk
)
1170 struct xfrm_policy
*p0
= sk
->sk_policy
[0],
1171 *p1
= sk
->sk_policy
[1];
1173 sk
->sk_policy
[0] = sk
->sk_policy
[1] = NULL
;
1174 if (p0
&& (sk
->sk_policy
[0] = clone_policy(p0
, 0)) == NULL
)
1176 if (p1
&& (sk
->sk_policy
[1] = clone_policy(p1
, 1)) == NULL
)
1182 xfrm_get_saddr(xfrm_address_t
*local
, xfrm_address_t
*remote
,
1183 unsigned short family
)
1186 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1188 if (unlikely(afinfo
== NULL
))
1190 err
= afinfo
->get_saddr(local
, remote
);
1191 xfrm_policy_put_afinfo(afinfo
);
1195 /* Resolve list of templates for the flow, given policy. */
1198 xfrm_tmpl_resolve_one(struct xfrm_policy
*policy
, struct flowi
*fl
,
1199 struct xfrm_state
**xfrm
,
1200 unsigned short family
)
1204 xfrm_address_t
*daddr
= xfrm_flowi_daddr(fl
, family
);
1205 xfrm_address_t
*saddr
= xfrm_flowi_saddr(fl
, family
);
1208 for (nx
=0, i
= 0; i
< policy
->xfrm_nr
; i
++) {
1209 struct xfrm_state
*x
;
1210 xfrm_address_t
*remote
= daddr
;
1211 xfrm_address_t
*local
= saddr
;
1212 struct xfrm_tmpl
*tmpl
= &policy
->xfrm_vec
[i
];
1214 if (tmpl
->mode
== XFRM_MODE_TUNNEL
||
1215 tmpl
->mode
== XFRM_MODE_BEET
) {
1216 remote
= &tmpl
->id
.daddr
;
1217 local
= &tmpl
->saddr
;
1218 family
= tmpl
->encap_family
;
1219 if (xfrm_addr_any(local
, family
)) {
1220 error
= xfrm_get_saddr(&tmp
, remote
, family
);
1227 x
= xfrm_state_find(remote
, local
, fl
, tmpl
, policy
, &error
, family
);
1229 if (x
&& x
->km
.state
== XFRM_STATE_VALID
) {
1236 error
= (x
->km
.state
== XFRM_STATE_ERROR
?
1241 if (!tmpl
->optional
)
1247 for (nx
--; nx
>=0; nx
--)
1248 xfrm_state_put(xfrm
[nx
]);
1253 xfrm_tmpl_resolve(struct xfrm_policy
**pols
, int npols
, struct flowi
*fl
,
1254 struct xfrm_state
**xfrm
,
1255 unsigned short family
)
1257 struct xfrm_state
*tp
[XFRM_MAX_DEPTH
];
1258 struct xfrm_state
**tpp
= (npols
> 1) ? tp
: xfrm
;
1264 for (i
= 0; i
< npols
; i
++) {
1265 if (cnx
+ pols
[i
]->xfrm_nr
>= XFRM_MAX_DEPTH
) {
1270 ret
= xfrm_tmpl_resolve_one(pols
[i
], fl
, &tpp
[cnx
], family
);
1278 /* found states are sorted for outbound processing */
1280 xfrm_state_sort(xfrm
, tpp
, cnx
, family
);
1285 for (cnx
--; cnx
>=0; cnx
--)
1286 xfrm_state_put(tpp
[cnx
]);
1291 /* Check that the bundle accepts the flow and its components are
1295 static struct dst_entry
*
1296 xfrm_find_bundle(struct flowi
*fl
, struct xfrm_policy
*policy
, unsigned short family
)
1298 struct dst_entry
*x
;
1299 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1300 if (unlikely(afinfo
== NULL
))
1301 return ERR_PTR(-EINVAL
);
1302 x
= afinfo
->find_bundle(fl
, policy
);
1303 xfrm_policy_put_afinfo(afinfo
);
1307 static inline int xfrm_get_tos(struct flowi
*fl
, int family
)
1309 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1315 tos
= afinfo
->get_tos(fl
);
1317 xfrm_policy_put_afinfo(afinfo
);
1322 static inline struct xfrm_dst
*xfrm_alloc_dst(int family
)
1324 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1325 struct xfrm_dst
*xdst
;
1328 return ERR_PTR(-EINVAL
);
1330 xdst
= dst_alloc(afinfo
->dst_ops
) ?: ERR_PTR(-ENOBUFS
);
1332 xfrm_policy_put_afinfo(afinfo
);
1337 static inline int xfrm_init_path(struct xfrm_dst
*path
, struct dst_entry
*dst
,
1340 struct xfrm_policy_afinfo
*afinfo
=
1341 xfrm_policy_get_afinfo(dst
->ops
->family
);
1347 err
= afinfo
->init_path(path
, dst
, nfheader_len
);
1349 xfrm_policy_put_afinfo(afinfo
);
1354 static inline int xfrm_fill_dst(struct xfrm_dst
*xdst
, struct net_device
*dev
)
1356 struct xfrm_policy_afinfo
*afinfo
=
1357 xfrm_policy_get_afinfo(xdst
->u
.dst
.ops
->family
);
1363 err
= afinfo
->fill_dst(xdst
, dev
);
1365 xfrm_policy_put_afinfo(afinfo
);
1370 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
1371 * all the metrics... Shortly, bundle a bundle.
1374 static struct dst_entry
*xfrm_bundle_create(struct xfrm_policy
*policy
,
1375 struct xfrm_state
**xfrm
, int nx
,
1377 struct dst_entry
*dst
)
1379 unsigned long now
= jiffies
;
1380 struct net_device
*dev
;
1381 struct dst_entry
*dst_prev
= NULL
;
1382 struct dst_entry
*dst0
= NULL
;
1386 int nfheader_len
= 0;
1387 int trailer_len
= 0;
1389 int family
= policy
->selector
.family
;
1390 xfrm_address_t saddr
, daddr
;
1392 xfrm_flowi_addr_get(fl
, &saddr
, &daddr
, family
);
1394 tos
= xfrm_get_tos(fl
, family
);
1401 for (; i
< nx
; i
++) {
1402 struct xfrm_dst
*xdst
= xfrm_alloc_dst(family
);
1403 struct dst_entry
*dst1
= &xdst
->u
.dst
;
1405 err
= PTR_ERR(xdst
);
1414 dst_prev
->child
= dst_clone(dst1
);
1415 dst1
->flags
|= DST_NOHASH
;
1419 memcpy(&dst1
->metrics
, &dst
->metrics
, sizeof(dst
->metrics
));
1421 if (xfrm
[i
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
1422 family
= xfrm
[i
]->props
.family
;
1423 dst
= xfrm_dst_lookup(xfrm
[i
], tos
, &saddr
, &daddr
,
1431 dst1
->xfrm
= xfrm
[i
];
1432 xdst
->genid
= xfrm
[i
]->genid
;
1434 dst1
->obsolete
= -1;
1435 dst1
->flags
|= DST_HOST
;
1436 dst1
->lastuse
= now
;
1438 dst1
->input
= dst_discard
;
1439 dst1
->output
= xfrm
[i
]->outer_mode
->afinfo
->output
;
1441 dst1
->next
= dst_prev
;
1444 header_len
+= xfrm
[i
]->props
.header_len
;
1445 if (xfrm
[i
]->type
->flags
& XFRM_TYPE_NON_FRAGMENT
)
1446 nfheader_len
+= xfrm
[i
]->props
.header_len
;
1447 trailer_len
+= xfrm
[i
]->props
.trailer_len
;
1450 dst_prev
->child
= dst
;
1458 /* Copy neighbout for reachability confirmation */
1459 dst0
->neighbour
= neigh_clone(dst
->neighbour
);
1461 xfrm_init_path((struct xfrm_dst
*)dst0
, dst
, nfheader_len
);
1462 xfrm_init_pmtu(dst_prev
);
1464 for (dst_prev
= dst0
; dst_prev
!= dst
; dst_prev
= dst_prev
->child
) {
1465 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst_prev
;
1467 err
= xfrm_fill_dst(xdst
, dev
);
1471 dst_prev
->header_len
= header_len
;
1472 dst_prev
->trailer_len
= trailer_len
;
1473 header_len
-= xdst
->u
.dst
.xfrm
->props
.header_len
;
1474 trailer_len
-= xdst
->u
.dst
.xfrm
->props
.trailer_len
;
1482 xfrm_state_put(xfrm
[i
]);
1486 dst0
= ERR_PTR(err
);
1491 xfrm_dst_alloc_copy(void **target
, void *src
, int size
)
1494 *target
= kmalloc(size
, GFP_ATOMIC
);
1498 memcpy(*target
, src
, size
);
1503 xfrm_dst_update_parent(struct dst_entry
*dst
, struct xfrm_selector
*sel
)
1505 #ifdef CONFIG_XFRM_SUB_POLICY
1506 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
1507 return xfrm_dst_alloc_copy((void **)&(xdst
->partner
),
1515 xfrm_dst_update_origin(struct dst_entry
*dst
, struct flowi
*fl
)
1517 #ifdef CONFIG_XFRM_SUB_POLICY
1518 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
1519 return xfrm_dst_alloc_copy((void **)&(xdst
->origin
), fl
, sizeof(*fl
));
1525 static int stale_bundle(struct dst_entry
*dst
);
1527 /* Main function: finds/creates a bundle for given flow.
1529 * At the moment we eat a raw IP route. Mostly to speed up lookups
1530 * on interfaces with disabled IPsec.
1532 int __xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
1533 struct sock
*sk
, int flags
)
1535 struct xfrm_policy
*policy
;
1536 struct xfrm_policy
*pols
[XFRM_POLICY_TYPE_MAX
];
1541 struct xfrm_state
*xfrm
[XFRM_MAX_DEPTH
];
1542 struct dst_entry
*dst
, *dst_orig
= *dst_p
;
1547 u8 dir
= policy_to_flow_dir(XFRM_POLICY_OUT
);
1550 genid
= atomic_read(&flow_cache_genid
);
1552 for (pi
= 0; pi
< ARRAY_SIZE(pols
); pi
++)
1558 if (sk
&& sk
->sk_policy
[XFRM_POLICY_OUT
]) {
1559 policy
= xfrm_sk_policy_lookup(sk
, XFRM_POLICY_OUT
, fl
);
1560 err
= PTR_ERR(policy
);
1561 if (IS_ERR(policy
)) {
1562 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLERROR
);
1568 /* To accelerate a bit... */
1569 if ((dst_orig
->flags
& DST_NOXFRM
) ||
1570 !xfrm_policy_count
[XFRM_POLICY_OUT
])
1573 policy
= flow_cache_lookup(fl
, dst_orig
->ops
->family
,
1574 dir
, xfrm_policy_lookup
);
1575 err
= PTR_ERR(policy
);
1576 if (IS_ERR(policy
)) {
1577 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLERROR
);
1585 family
= dst_orig
->ops
->family
;
1588 xfrm_nr
+= pols
[0]->xfrm_nr
;
1591 if ((flags
& XFRM_LOOKUP_ICMP
) && !(policy
->flags
& XFRM_POLICY_ICMP
))
1594 policy
->curlft
.use_time
= get_seconds();
1596 switch (policy
->action
) {
1598 case XFRM_POLICY_BLOCK
:
1599 /* Prohibit the flow */
1600 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLBLOCK
);
1604 case XFRM_POLICY_ALLOW
:
1605 #ifndef CONFIG_XFRM_SUB_POLICY
1606 if (policy
->xfrm_nr
== 0) {
1607 /* Flow passes not transformed. */
1608 xfrm_pol_put(policy
);
1613 /* Try to find matching bundle.
1615 * LATER: help from flow cache. It is optional, this
1616 * is required only for output policy.
1618 dst
= xfrm_find_bundle(fl
, policy
, family
);
1620 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLECHECKERROR
);
1628 #ifdef CONFIG_XFRM_SUB_POLICY
1629 if (pols
[0]->type
!= XFRM_POLICY_TYPE_MAIN
) {
1630 pols
[1] = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN
,
1634 if (IS_ERR(pols
[1])) {
1635 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLERROR
);
1636 err
= PTR_ERR(pols
[1]);
1639 if (pols
[1]->action
== XFRM_POLICY_BLOCK
) {
1640 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLBLOCK
);
1645 xfrm_nr
+= pols
[1]->xfrm_nr
;
1650 * Because neither flowi nor bundle information knows about
1651 * transformation template size. On more than one policy usage
1652 * we can realize whether all of them is bypass or not after
1653 * they are searched. See above not-transformed bypass
1654 * is surrounded by non-sub policy configuration, too.
1657 /* Flow passes not transformed. */
1658 xfrm_pols_put(pols
, npols
);
1663 nx
= xfrm_tmpl_resolve(pols
, npols
, fl
, xfrm
, family
);
1665 if (unlikely(nx
<0)) {
1667 if (err
== -EAGAIN
&& sysctl_xfrm_larval_drop
) {
1668 /* EREMOTE tells the caller to generate
1669 * a one-shot blackhole route.
1671 XFRM_INC_STATS(LINUX_MIB_XFRMOUTNOSTATES
);
1672 xfrm_pol_put(policy
);
1675 if (err
== -EAGAIN
&& (flags
& XFRM_LOOKUP_WAIT
)) {
1676 DECLARE_WAITQUEUE(wait
, current
);
1678 add_wait_queue(&km_waitq
, &wait
);
1679 set_current_state(TASK_INTERRUPTIBLE
);
1681 set_current_state(TASK_RUNNING
);
1682 remove_wait_queue(&km_waitq
, &wait
);
1684 nx
= xfrm_tmpl_resolve(pols
, npols
, fl
, xfrm
, family
);
1686 if (nx
== -EAGAIN
&& signal_pending(current
)) {
1687 XFRM_INC_STATS(LINUX_MIB_XFRMOUTNOSTATES
);
1691 if (nx
== -EAGAIN
||
1692 genid
!= atomic_read(&flow_cache_genid
)) {
1693 xfrm_pols_put(pols
, npols
);
1699 XFRM_INC_STATS(LINUX_MIB_XFRMOUTNOSTATES
);
1704 /* Flow passes not transformed. */
1705 xfrm_pols_put(pols
, npols
);
1709 dst
= xfrm_bundle_create(policy
, xfrm
, nx
, fl
, dst_orig
);
1712 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLEGENERROR
);
1716 for (pi
= 0; pi
< npols
; pi
++) {
1717 read_lock_bh(&pols
[pi
]->lock
);
1718 pol_dead
|= pols
[pi
]->dead
;
1719 read_unlock_bh(&pols
[pi
]->lock
);
1722 write_lock_bh(&policy
->lock
);
1723 if (unlikely(pol_dead
|| stale_bundle(dst
))) {
1724 /* Wow! While we worked on resolving, this
1725 * policy has gone. Retry. It is not paranoia,
1726 * we just cannot enlist new bundle to dead object.
1727 * We can't enlist stable bundles either.
1729 write_unlock_bh(&policy
->lock
);
1734 XFRM_INC_STATS(LINUX_MIB_XFRMOUTPOLDEAD
);
1736 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLECHECKERROR
);
1737 err
= -EHOSTUNREACH
;
1742 err
= xfrm_dst_update_parent(dst
, &pols
[1]->selector
);
1744 err
= xfrm_dst_update_origin(dst
, fl
);
1745 if (unlikely(err
)) {
1746 write_unlock_bh(&policy
->lock
);
1749 XFRM_INC_STATS(LINUX_MIB_XFRMOUTBUNDLECHECKERROR
);
1753 dst
->next
= policy
->bundles
;
1754 policy
->bundles
= dst
;
1756 write_unlock_bh(&policy
->lock
);
1759 dst_release(dst_orig
);
1760 xfrm_pols_put(pols
, npols
);
1764 xfrm_pols_put(pols
, npols
);
1766 dst_release(dst_orig
);
1772 if (flags
& XFRM_LOOKUP_ICMP
)
1776 EXPORT_SYMBOL(__xfrm_lookup
);
1778 int xfrm_lookup(struct dst_entry
**dst_p
, struct flowi
*fl
,
1779 struct sock
*sk
, int flags
)
1781 int err
= __xfrm_lookup(dst_p
, fl
, sk
, flags
);
1783 if (err
== -EREMOTE
) {
1784 dst_release(*dst_p
);
1791 EXPORT_SYMBOL(xfrm_lookup
);
1794 xfrm_secpath_reject(int idx
, struct sk_buff
*skb
, struct flowi
*fl
)
1796 struct xfrm_state
*x
;
1798 if (!skb
->sp
|| idx
< 0 || idx
>= skb
->sp
->len
)
1800 x
= skb
->sp
->xvec
[idx
];
1801 if (!x
->type
->reject
)
1803 return x
->type
->reject(x
, skb
, fl
);
1806 /* When skb is transformed back to its "native" form, we have to
1807 * check policy restrictions. At the moment we make this in maximally
1808 * stupid way. Shame on me. :-) Of course, connected sockets must
1809 * have policy cached at them.
1813 xfrm_state_ok(struct xfrm_tmpl
*tmpl
, struct xfrm_state
*x
,
1814 unsigned short family
)
1816 if (xfrm_state_kern(x
))
1817 return tmpl
->optional
&& !xfrm_state_addr_cmp(tmpl
, x
, tmpl
->encap_family
);
1818 return x
->id
.proto
== tmpl
->id
.proto
&&
1819 (x
->id
.spi
== tmpl
->id
.spi
|| !tmpl
->id
.spi
) &&
1820 (x
->props
.reqid
== tmpl
->reqid
|| !tmpl
->reqid
) &&
1821 x
->props
.mode
== tmpl
->mode
&&
1822 ((tmpl
->aalgos
& (1<<x
->props
.aalgo
)) ||
1823 !(xfrm_id_proto_match(tmpl
->id
.proto
, IPSEC_PROTO_ANY
))) &&
1824 !(x
->props
.mode
!= XFRM_MODE_TRANSPORT
&&
1825 xfrm_state_addr_cmp(tmpl
, x
, family
));
1829 * 0 or more than 0 is returned when validation is succeeded (either bypass
1830 * because of optional transport mode, or next index of the mathced secpath
1831 * state with the template.
1832 * -1 is returned when no matching template is found.
1833 * Otherwise "-2 - errored_index" is returned.
1836 xfrm_policy_ok(struct xfrm_tmpl
*tmpl
, struct sec_path
*sp
, int start
,
1837 unsigned short family
)
1841 if (tmpl
->optional
) {
1842 if (tmpl
->mode
== XFRM_MODE_TRANSPORT
)
1846 for (; idx
< sp
->len
; idx
++) {
1847 if (xfrm_state_ok(tmpl
, sp
->xvec
[idx
], family
))
1849 if (sp
->xvec
[idx
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
1858 int __xfrm_decode_session(struct sk_buff
*skb
, struct flowi
*fl
,
1859 unsigned int family
, int reverse
)
1861 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1864 if (unlikely(afinfo
== NULL
))
1865 return -EAFNOSUPPORT
;
1867 afinfo
->decode_session(skb
, fl
, reverse
);
1868 err
= security_xfrm_decode_session(skb
, &fl
->secid
);
1869 xfrm_policy_put_afinfo(afinfo
);
1872 EXPORT_SYMBOL(__xfrm_decode_session
);
1874 static inline int secpath_has_nontransport(struct sec_path
*sp
, int k
, int *idxp
)
1876 for (; k
< sp
->len
; k
++) {
1877 if (sp
->xvec
[k
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
1886 int __xfrm_policy_check(struct sock
*sk
, int dir
, struct sk_buff
*skb
,
1887 unsigned short family
)
1889 struct xfrm_policy
*pol
;
1890 struct xfrm_policy
*pols
[XFRM_POLICY_TYPE_MAX
];
1899 reverse
= dir
& ~XFRM_POLICY_MASK
;
1900 dir
&= XFRM_POLICY_MASK
;
1901 fl_dir
= policy_to_flow_dir(dir
);
1903 if (__xfrm_decode_session(skb
, &fl
, family
, reverse
) < 0) {
1904 XFRM_INC_STATS(LINUX_MIB_XFRMINHDRERROR
);
1908 nf_nat_decode_session(skb
, &fl
, family
);
1910 /* First, check used SA against their selectors. */
1914 for (i
=skb
->sp
->len
-1; i
>=0; i
--) {
1915 struct xfrm_state
*x
= skb
->sp
->xvec
[i
];
1916 if (!xfrm_selector_match(&x
->sel
, &fl
, family
)) {
1917 XFRM_INC_STATS(LINUX_MIB_XFRMINSTATEMISMATCH
);
1924 if (sk
&& sk
->sk_policy
[dir
]) {
1925 pol
= xfrm_sk_policy_lookup(sk
, dir
, &fl
);
1927 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLERROR
);
1933 pol
= flow_cache_lookup(&fl
, family
, fl_dir
,
1934 xfrm_policy_lookup
);
1937 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLERROR
);
1942 if (skb
->sp
&& secpath_has_nontransport(skb
->sp
, 0, &xerr_idx
)) {
1943 xfrm_secpath_reject(xerr_idx
, skb
, &fl
);
1944 XFRM_INC_STATS(LINUX_MIB_XFRMINNOPOLS
);
1950 pol
->curlft
.use_time
= get_seconds();
1954 #ifdef CONFIG_XFRM_SUB_POLICY
1955 if (pols
[0]->type
!= XFRM_POLICY_TYPE_MAIN
) {
1956 pols
[1] = xfrm_policy_lookup_bytype(XFRM_POLICY_TYPE_MAIN
,
1960 if (IS_ERR(pols
[1])) {
1961 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLERROR
);
1964 pols
[1]->curlft
.use_time
= get_seconds();
1970 if (pol
->action
== XFRM_POLICY_ALLOW
) {
1971 struct sec_path
*sp
;
1972 static struct sec_path dummy
;
1973 struct xfrm_tmpl
*tp
[XFRM_MAX_DEPTH
];
1974 struct xfrm_tmpl
*stp
[XFRM_MAX_DEPTH
];
1975 struct xfrm_tmpl
**tpp
= tp
;
1979 if ((sp
= skb
->sp
) == NULL
)
1982 for (pi
= 0; pi
< npols
; pi
++) {
1983 if (pols
[pi
] != pol
&&
1984 pols
[pi
]->action
!= XFRM_POLICY_ALLOW
) {
1985 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLBLOCK
);
1988 if (ti
+ pols
[pi
]->xfrm_nr
>= XFRM_MAX_DEPTH
) {
1989 XFRM_INC_STATS(LINUX_MIB_XFRMINBUFFERERROR
);
1992 for (i
= 0; i
< pols
[pi
]->xfrm_nr
; i
++)
1993 tpp
[ti
++] = &pols
[pi
]->xfrm_vec
[i
];
1997 xfrm_tmpl_sort(stp
, tpp
, xfrm_nr
, family
);
2001 /* For each tunnel xfrm, find the first matching tmpl.
2002 * For each tmpl before that, find corresponding xfrm.
2003 * Order is _important_. Later we will implement
2004 * some barriers, but at the moment barriers
2005 * are implied between each two transformations.
2007 for (i
= xfrm_nr
-1, k
= 0; i
>= 0; i
--) {
2008 k
= xfrm_policy_ok(tpp
[i
], sp
, k
, family
);
2011 /* "-2 - errored_index" returned */
2013 XFRM_INC_STATS(LINUX_MIB_XFRMINTMPLMISMATCH
);
2018 if (secpath_has_nontransport(sp
, k
, &xerr_idx
)) {
2019 XFRM_INC_STATS(LINUX_MIB_XFRMINTMPLMISMATCH
);
2023 xfrm_pols_put(pols
, npols
);
2026 XFRM_INC_STATS(LINUX_MIB_XFRMINPOLBLOCK
);
2029 xfrm_secpath_reject(xerr_idx
, skb
, &fl
);
2031 xfrm_pols_put(pols
, npols
);
2034 EXPORT_SYMBOL(__xfrm_policy_check
);
2036 int __xfrm_route_forward(struct sk_buff
*skb
, unsigned short family
)
2040 if (xfrm_decode_session(skb
, &fl
, family
) < 0) {
2041 /* XXX: we should have something like FWDHDRERROR here. */
2042 XFRM_INC_STATS(LINUX_MIB_XFRMINHDRERROR
);
2046 return xfrm_lookup(&skb
->dst
, &fl
, NULL
, 0) == 0;
2048 EXPORT_SYMBOL(__xfrm_route_forward
);
2050 /* Optimize later using cookies and generation ids. */
2052 static struct dst_entry
*xfrm_dst_check(struct dst_entry
*dst
, u32 cookie
)
2054 /* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
2055 * to "-1" to force all XFRM destinations to get validated by
2056 * dst_ops->check on every use. We do this because when a
2057 * normal route referenced by an XFRM dst is obsoleted we do
2058 * not go looking around for all parent referencing XFRM dsts
2059 * so that we can invalidate them. It is just too much work.
2060 * Instead we make the checks here on every use. For example:
2062 * XFRM dst A --> IPv4 dst X
2064 * X is the "xdst->route" of A (X is also the "dst->path" of A
2065 * in this example). If X is marked obsolete, "A" will not
2066 * notice. That's what we are validating here via the
2067 * stale_bundle() check.
2069 * When a policy's bundle is pruned, we dst_free() the XFRM
2070 * dst which causes it's ->obsolete field to be set to a
2071 * positive non-zero integer. If an XFRM dst has been pruned
2072 * like this, we want to force a new route lookup.
2074 if (dst
->obsolete
< 0 && !stale_bundle(dst
))
2080 static int stale_bundle(struct dst_entry
*dst
)
2082 return !xfrm_bundle_ok(NULL
, (struct xfrm_dst
*)dst
, NULL
, AF_UNSPEC
, 0);
2085 void xfrm_dst_ifdown(struct dst_entry
*dst
, struct net_device
*dev
)
2087 while ((dst
= dst
->child
) && dst
->xfrm
&& dst
->dev
== dev
) {
2088 dst
->dev
= dev_net(dev
)->loopback_dev
;
2093 EXPORT_SYMBOL(xfrm_dst_ifdown
);
2095 static void xfrm_link_failure(struct sk_buff
*skb
)
2097 /* Impossible. Such dst must be popped before reaches point of failure. */
2101 static struct dst_entry
*xfrm_negative_advice(struct dst_entry
*dst
)
2104 if (dst
->obsolete
) {
2112 static void prune_one_bundle(struct xfrm_policy
*pol
, int (*func
)(struct dst_entry
*), struct dst_entry
**gc_list_p
)
2114 struct dst_entry
*dst
, **dstp
;
2116 write_lock(&pol
->lock
);
2117 dstp
= &pol
->bundles
;
2118 while ((dst
=*dstp
) != NULL
) {
2121 dst
->next
= *gc_list_p
;
2127 write_unlock(&pol
->lock
);
2130 static void xfrm_prune_bundles(int (*func
)(struct dst_entry
*))
2132 struct dst_entry
*gc_list
= NULL
;
2135 read_lock_bh(&xfrm_policy_lock
);
2136 for (dir
= 0; dir
< XFRM_POLICY_MAX
* 2; dir
++) {
2137 struct xfrm_policy
*pol
;
2138 struct hlist_node
*entry
;
2139 struct hlist_head
*table
;
2142 hlist_for_each_entry(pol
, entry
,
2143 &xfrm_policy_inexact
[dir
], bydst
)
2144 prune_one_bundle(pol
, func
, &gc_list
);
2146 table
= xfrm_policy_bydst
[dir
].table
;
2147 for (i
= xfrm_policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
2148 hlist_for_each_entry(pol
, entry
, table
+ i
, bydst
)
2149 prune_one_bundle(pol
, func
, &gc_list
);
2152 read_unlock_bh(&xfrm_policy_lock
);
2155 struct dst_entry
*dst
= gc_list
;
2156 gc_list
= dst
->next
;
2161 static int unused_bundle(struct dst_entry
*dst
)
2163 return !atomic_read(&dst
->__refcnt
);
2166 static void __xfrm_garbage_collect(void)
2168 xfrm_prune_bundles(unused_bundle
);
2171 static int xfrm_flush_bundles(void)
2173 xfrm_prune_bundles(stale_bundle
);
2177 static void xfrm_init_pmtu(struct dst_entry
*dst
)
2180 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
2181 u32 pmtu
, route_mtu_cached
;
2183 pmtu
= dst_mtu(dst
->child
);
2184 xdst
->child_mtu_cached
= pmtu
;
2186 pmtu
= xfrm_state_mtu(dst
->xfrm
, pmtu
);
2188 route_mtu_cached
= dst_mtu(xdst
->route
);
2189 xdst
->route_mtu_cached
= route_mtu_cached
;
2191 if (pmtu
> route_mtu_cached
)
2192 pmtu
= route_mtu_cached
;
2194 dst
->metrics
[RTAX_MTU
-1] = pmtu
;
2195 } while ((dst
= dst
->next
));
2198 /* Check that the bundle accepts the flow and its components are
2202 int xfrm_bundle_ok(struct xfrm_policy
*pol
, struct xfrm_dst
*first
,
2203 struct flowi
*fl
, int family
, int strict
)
2205 struct dst_entry
*dst
= &first
->u
.dst
;
2206 struct xfrm_dst
*last
;
2209 if (!dst_check(dst
->path
, ((struct xfrm_dst
*)dst
)->path_cookie
) ||
2210 (dst
->dev
&& !netif_running(dst
->dev
)))
2212 #ifdef CONFIG_XFRM_SUB_POLICY
2214 if (first
->origin
&& !flow_cache_uli_match(first
->origin
, fl
))
2216 if (first
->partner
&&
2217 !xfrm_selector_match(first
->partner
, fl
, family
))
2225 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
2227 if (fl
&& !xfrm_selector_match(&dst
->xfrm
->sel
, fl
, family
))
2230 !security_xfrm_state_pol_flow_match(dst
->xfrm
, pol
, fl
))
2232 if (dst
->xfrm
->km
.state
!= XFRM_STATE_VALID
)
2234 if (xdst
->genid
!= dst
->xfrm
->genid
)
2238 !(dst
->xfrm
->outer_mode
->flags
& XFRM_MODE_FLAG_TUNNEL
) &&
2239 !xfrm_state_addr_flow_check(dst
->xfrm
, fl
, family
))
2242 mtu
= dst_mtu(dst
->child
);
2243 if (xdst
->child_mtu_cached
!= mtu
) {
2245 xdst
->child_mtu_cached
= mtu
;
2248 if (!dst_check(xdst
->route
, xdst
->route_cookie
))
2250 mtu
= dst_mtu(xdst
->route
);
2251 if (xdst
->route_mtu_cached
!= mtu
) {
2253 xdst
->route_mtu_cached
= mtu
;
2257 } while (dst
->xfrm
);
2262 mtu
= last
->child_mtu_cached
;
2266 mtu
= xfrm_state_mtu(dst
->xfrm
, mtu
);
2267 if (mtu
> last
->route_mtu_cached
)
2268 mtu
= last
->route_mtu_cached
;
2269 dst
->metrics
[RTAX_MTU
-1] = mtu
;
2274 last
= (struct xfrm_dst
*)last
->u
.dst
.next
;
2275 last
->child_mtu_cached
= mtu
;
2281 EXPORT_SYMBOL(xfrm_bundle_ok
);
2283 int xfrm_policy_register_afinfo(struct xfrm_policy_afinfo
*afinfo
)
2286 if (unlikely(afinfo
== NULL
))
2288 if (unlikely(afinfo
->family
>= NPROTO
))
2289 return -EAFNOSUPPORT
;
2290 write_lock_bh(&xfrm_policy_afinfo_lock
);
2291 if (unlikely(xfrm_policy_afinfo
[afinfo
->family
] != NULL
))
2294 struct dst_ops
*dst_ops
= afinfo
->dst_ops
;
2295 if (likely(dst_ops
->kmem_cachep
== NULL
))
2296 dst_ops
->kmem_cachep
= xfrm_dst_cache
;
2297 if (likely(dst_ops
->check
== NULL
))
2298 dst_ops
->check
= xfrm_dst_check
;
2299 if (likely(dst_ops
->negative_advice
== NULL
))
2300 dst_ops
->negative_advice
= xfrm_negative_advice
;
2301 if (likely(dst_ops
->link_failure
== NULL
))
2302 dst_ops
->link_failure
= xfrm_link_failure
;
2303 if (likely(afinfo
->garbage_collect
== NULL
))
2304 afinfo
->garbage_collect
= __xfrm_garbage_collect
;
2305 xfrm_policy_afinfo
[afinfo
->family
] = afinfo
;
2307 write_unlock_bh(&xfrm_policy_afinfo_lock
);
2310 EXPORT_SYMBOL(xfrm_policy_register_afinfo
);
2312 int xfrm_policy_unregister_afinfo(struct xfrm_policy_afinfo
*afinfo
)
2315 if (unlikely(afinfo
== NULL
))
2317 if (unlikely(afinfo
->family
>= NPROTO
))
2318 return -EAFNOSUPPORT
;
2319 write_lock_bh(&xfrm_policy_afinfo_lock
);
2320 if (likely(xfrm_policy_afinfo
[afinfo
->family
] != NULL
)) {
2321 if (unlikely(xfrm_policy_afinfo
[afinfo
->family
] != afinfo
))
2324 struct dst_ops
*dst_ops
= afinfo
->dst_ops
;
2325 xfrm_policy_afinfo
[afinfo
->family
] = NULL
;
2326 dst_ops
->kmem_cachep
= NULL
;
2327 dst_ops
->check
= NULL
;
2328 dst_ops
->negative_advice
= NULL
;
2329 dst_ops
->link_failure
= NULL
;
2330 afinfo
->garbage_collect
= NULL
;
2333 write_unlock_bh(&xfrm_policy_afinfo_lock
);
2336 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo
);
2338 static struct xfrm_policy_afinfo
*xfrm_policy_get_afinfo(unsigned short family
)
2340 struct xfrm_policy_afinfo
*afinfo
;
2341 if (unlikely(family
>= NPROTO
))
2343 read_lock(&xfrm_policy_afinfo_lock
);
2344 afinfo
= xfrm_policy_afinfo
[family
];
2345 if (unlikely(!afinfo
))
2346 read_unlock(&xfrm_policy_afinfo_lock
);
2350 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo
*afinfo
)
2352 read_unlock(&xfrm_policy_afinfo_lock
);
2355 static int xfrm_dev_event(struct notifier_block
*this, unsigned long event
, void *ptr
)
2357 struct net_device
*dev
= ptr
;
2359 if (dev_net(dev
) != &init_net
)
2364 xfrm_flush_bundles();
2369 static struct notifier_block xfrm_dev_notifier
= {
2375 #ifdef CONFIG_XFRM_STATISTICS
2376 static int __init
xfrm_statistics_init(void)
2378 if (snmp_mib_init((void **)xfrm_statistics
,
2379 sizeof(struct linux_xfrm_mib
)) < 0)
2385 static void __init
xfrm_policy_init(void)
2387 unsigned int hmask
, sz
;
2390 xfrm_dst_cache
= kmem_cache_create("xfrm_dst_cache",
2391 sizeof(struct xfrm_dst
),
2392 0, SLAB_HWCACHE_ALIGN
|SLAB_PANIC
,
2396 sz
= (hmask
+1) * sizeof(struct hlist_head
);
2398 xfrm_policy_byidx
= xfrm_hash_alloc(sz
);
2399 xfrm_idx_hmask
= hmask
;
2400 if (!xfrm_policy_byidx
)
2401 panic("XFRM: failed to allocate byidx hash\n");
2403 for (dir
= 0; dir
< XFRM_POLICY_MAX
* 2; dir
++) {
2404 struct xfrm_policy_hash
*htab
;
2406 INIT_HLIST_HEAD(&xfrm_policy_inexact
[dir
]);
2408 htab
= &xfrm_policy_bydst
[dir
];
2409 htab
->table
= xfrm_hash_alloc(sz
);
2410 htab
->hmask
= hmask
;
2412 panic("XFRM: failed to allocate bydst hash\n");
2415 for (dir
= 0; dir
< XFRM_POLICY_TYPE_MAX
; dir
++)
2416 INIT_LIST_HEAD(&xfrm_policy_bytype
[dir
]);
2418 INIT_WORK(&xfrm_policy_gc_work
, xfrm_policy_gc_task
);
2419 register_netdevice_notifier(&xfrm_dev_notifier
);
2422 void __init
xfrm_init(void)
2424 #ifdef CONFIG_XFRM_STATISTICS
2425 xfrm_statistics_init();
2430 #ifdef CONFIG_XFRM_STATISTICS
2435 #ifdef CONFIG_AUDITSYSCALL
2436 static void xfrm_audit_common_policyinfo(struct xfrm_policy
*xp
,
2437 struct audit_buffer
*audit_buf
)
2439 struct xfrm_sec_ctx
*ctx
= xp
->security
;
2440 struct xfrm_selector
*sel
= &xp
->selector
;
2443 audit_log_format(audit_buf
, " sec_alg=%u sec_doi=%u sec_obj=%s",
2444 ctx
->ctx_alg
, ctx
->ctx_doi
, ctx
->ctx_str
);
2446 switch(sel
->family
) {
2448 audit_log_format(audit_buf
, " src=" NIPQUAD_FMT
,
2449 NIPQUAD(sel
->saddr
.a4
));
2450 if (sel
->prefixlen_s
!= 32)
2451 audit_log_format(audit_buf
, " src_prefixlen=%d",
2453 audit_log_format(audit_buf
, " dst=" NIPQUAD_FMT
,
2454 NIPQUAD(sel
->daddr
.a4
));
2455 if (sel
->prefixlen_d
!= 32)
2456 audit_log_format(audit_buf
, " dst_prefixlen=%d",
2460 audit_log_format(audit_buf
, " src=" NIP6_FMT
,
2461 NIP6(*(struct in6_addr
*)sel
->saddr
.a6
));
2462 if (sel
->prefixlen_s
!= 128)
2463 audit_log_format(audit_buf
, " src_prefixlen=%d",
2465 audit_log_format(audit_buf
, " dst=" NIP6_FMT
,
2466 NIP6(*(struct in6_addr
*)sel
->daddr
.a6
));
2467 if (sel
->prefixlen_d
!= 128)
2468 audit_log_format(audit_buf
, " dst_prefixlen=%d",
2474 void xfrm_audit_policy_add(struct xfrm_policy
*xp
, int result
,
2475 u32 auid
, u32 secid
)
2477 struct audit_buffer
*audit_buf
;
2479 audit_buf
= xfrm_audit_start("SPD-add");
2480 if (audit_buf
== NULL
)
2482 xfrm_audit_helper_usrinfo(auid
, secid
, audit_buf
);
2483 audit_log_format(audit_buf
, " res=%u", result
);
2484 xfrm_audit_common_policyinfo(xp
, audit_buf
);
2485 audit_log_end(audit_buf
);
2487 EXPORT_SYMBOL_GPL(xfrm_audit_policy_add
);
2489 void xfrm_audit_policy_delete(struct xfrm_policy
*xp
, int result
,
2490 u32 auid
, u32 secid
)
2492 struct audit_buffer
*audit_buf
;
2494 audit_buf
= xfrm_audit_start("SPD-delete");
2495 if (audit_buf
== NULL
)
2497 xfrm_audit_helper_usrinfo(auid
, secid
, audit_buf
);
2498 audit_log_format(audit_buf
, " res=%u", result
);
2499 xfrm_audit_common_policyinfo(xp
, audit_buf
);
2500 audit_log_end(audit_buf
);
2502 EXPORT_SYMBOL_GPL(xfrm_audit_policy_delete
);
2505 #ifdef CONFIG_XFRM_MIGRATE
2506 static int xfrm_migrate_selector_match(struct xfrm_selector
*sel_cmp
,
2507 struct xfrm_selector
*sel_tgt
)
2509 if (sel_cmp
->proto
== IPSEC_ULPROTO_ANY
) {
2510 if (sel_tgt
->family
== sel_cmp
->family
&&
2511 xfrm_addr_cmp(&sel_tgt
->daddr
, &sel_cmp
->daddr
,
2512 sel_cmp
->family
) == 0 &&
2513 xfrm_addr_cmp(&sel_tgt
->saddr
, &sel_cmp
->saddr
,
2514 sel_cmp
->family
) == 0 &&
2515 sel_tgt
->prefixlen_d
== sel_cmp
->prefixlen_d
&&
2516 sel_tgt
->prefixlen_s
== sel_cmp
->prefixlen_s
) {
2520 if (memcmp(sel_tgt
, sel_cmp
, sizeof(*sel_tgt
)) == 0) {
2527 static struct xfrm_policy
* xfrm_migrate_policy_find(struct xfrm_selector
*sel
,
2530 struct xfrm_policy
*pol
, *ret
= NULL
;
2531 struct hlist_node
*entry
;
2532 struct hlist_head
*chain
;
2535 read_lock_bh(&xfrm_policy_lock
);
2536 chain
= policy_hash_direct(&sel
->daddr
, &sel
->saddr
, sel
->family
, dir
);
2537 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
2538 if (xfrm_migrate_selector_match(sel
, &pol
->selector
) &&
2539 pol
->type
== type
) {
2541 priority
= ret
->priority
;
2545 chain
= &xfrm_policy_inexact
[dir
];
2546 hlist_for_each_entry(pol
, entry
, chain
, bydst
) {
2547 if (xfrm_migrate_selector_match(sel
, &pol
->selector
) &&
2548 pol
->type
== type
&&
2549 pol
->priority
< priority
) {
2558 read_unlock_bh(&xfrm_policy_lock
);
2563 static int migrate_tmpl_match(struct xfrm_migrate
*m
, struct xfrm_tmpl
*t
)
2567 if (t
->mode
== m
->mode
&& t
->id
.proto
== m
->proto
&&
2568 (m
->reqid
== 0 || t
->reqid
== m
->reqid
)) {
2570 case XFRM_MODE_TUNNEL
:
2571 case XFRM_MODE_BEET
:
2572 if (xfrm_addr_cmp(&t
->id
.daddr
, &m
->old_daddr
,
2573 m
->old_family
) == 0 &&
2574 xfrm_addr_cmp(&t
->saddr
, &m
->old_saddr
,
2575 m
->old_family
) == 0) {
2579 case XFRM_MODE_TRANSPORT
:
2580 /* in case of transport mode, template does not store
2581 any IP addresses, hence we just compare mode and
2592 /* update endpoint address(es) of template(s) */
2593 static int xfrm_policy_migrate(struct xfrm_policy
*pol
,
2594 struct xfrm_migrate
*m
, int num_migrate
)
2596 struct xfrm_migrate
*mp
;
2597 struct dst_entry
*dst
;
2600 write_lock_bh(&pol
->lock
);
2601 if (unlikely(pol
->dead
)) {
2602 /* target policy has been deleted */
2603 write_unlock_bh(&pol
->lock
);
2607 for (i
= 0; i
< pol
->xfrm_nr
; i
++) {
2608 for (j
= 0, mp
= m
; j
< num_migrate
; j
++, mp
++) {
2609 if (!migrate_tmpl_match(mp
, &pol
->xfrm_vec
[i
]))
2612 if (pol
->xfrm_vec
[i
].mode
!= XFRM_MODE_TUNNEL
&&
2613 pol
->xfrm_vec
[i
].mode
!= XFRM_MODE_BEET
)
2615 /* update endpoints */
2616 memcpy(&pol
->xfrm_vec
[i
].id
.daddr
, &mp
->new_daddr
,
2617 sizeof(pol
->xfrm_vec
[i
].id
.daddr
));
2618 memcpy(&pol
->xfrm_vec
[i
].saddr
, &mp
->new_saddr
,
2619 sizeof(pol
->xfrm_vec
[i
].saddr
));
2620 pol
->xfrm_vec
[i
].encap_family
= mp
->new_family
;
2622 while ((dst
= pol
->bundles
) != NULL
) {
2623 pol
->bundles
= dst
->next
;
2629 write_unlock_bh(&pol
->lock
);
2637 static int xfrm_migrate_check(struct xfrm_migrate
*m
, int num_migrate
)
2641 if (num_migrate
< 1 || num_migrate
> XFRM_MAX_DEPTH
)
2644 for (i
= 0; i
< num_migrate
; i
++) {
2645 if ((xfrm_addr_cmp(&m
[i
].old_daddr
, &m
[i
].new_daddr
,
2646 m
[i
].old_family
) == 0) &&
2647 (xfrm_addr_cmp(&m
[i
].old_saddr
, &m
[i
].new_saddr
,
2648 m
[i
].old_family
) == 0))
2650 if (xfrm_addr_any(&m
[i
].new_daddr
, m
[i
].new_family
) ||
2651 xfrm_addr_any(&m
[i
].new_saddr
, m
[i
].new_family
))
2654 /* check if there is any duplicated entry */
2655 for (j
= i
+ 1; j
< num_migrate
; j
++) {
2656 if (!memcmp(&m
[i
].old_daddr
, &m
[j
].old_daddr
,
2657 sizeof(m
[i
].old_daddr
)) &&
2658 !memcmp(&m
[i
].old_saddr
, &m
[j
].old_saddr
,
2659 sizeof(m
[i
].old_saddr
)) &&
2660 m
[i
].proto
== m
[j
].proto
&&
2661 m
[i
].mode
== m
[j
].mode
&&
2662 m
[i
].reqid
== m
[j
].reqid
&&
2663 m
[i
].old_family
== m
[j
].old_family
)
2671 int xfrm_migrate(struct xfrm_selector
*sel
, u8 dir
, u8 type
,
2672 struct xfrm_migrate
*m
, int num_migrate
)
2674 int i
, err
, nx_cur
= 0, nx_new
= 0;
2675 struct xfrm_policy
*pol
= NULL
;
2676 struct xfrm_state
*x
, *xc
;
2677 struct xfrm_state
*x_cur
[XFRM_MAX_DEPTH
];
2678 struct xfrm_state
*x_new
[XFRM_MAX_DEPTH
];
2679 struct xfrm_migrate
*mp
;
2681 if ((err
= xfrm_migrate_check(m
, num_migrate
)) < 0)
2684 /* Stage 1 - find policy */
2685 if ((pol
= xfrm_migrate_policy_find(sel
, dir
, type
)) == NULL
) {
2690 /* Stage 2 - find and update state(s) */
2691 for (i
= 0, mp
= m
; i
< num_migrate
; i
++, mp
++) {
2692 if ((x
= xfrm_migrate_state_find(mp
))) {
2695 if ((xc
= xfrm_state_migrate(x
, mp
))) {
2705 /* Stage 3 - update policy */
2706 if ((err
= xfrm_policy_migrate(pol
, m
, num_migrate
)) < 0)
2709 /* Stage 4 - delete old state(s) */
2711 xfrm_states_put(x_cur
, nx_cur
);
2712 xfrm_states_delete(x_cur
, nx_cur
);
2715 /* Stage 5 - announce */
2716 km_migrate(sel
, dir
, type
, m
, num_migrate
);
2728 xfrm_states_put(x_cur
, nx_cur
);
2730 xfrm_states_delete(x_new
, nx_new
);
2734 EXPORT_SYMBOL(xfrm_migrate
);