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>
32 #ifdef CONFIG_XFRM_STATISTICS
36 #include "xfrm_hash.h"
38 #define XFRM_QUEUE_TMO_MIN ((unsigned)(HZ/10))
39 #define XFRM_QUEUE_TMO_MAX ((unsigned)(60*HZ))
40 #define XFRM_MAX_QUEUE_LEN 100
43 struct dst_entry
*dst_orig
;
47 static DEFINE_SPINLOCK(xfrm_policy_afinfo_lock
);
48 static struct xfrm_policy_afinfo __rcu
*xfrm_policy_afinfo
[AF_INET6
+ 1]
51 static struct kmem_cache
*xfrm_dst_cache __read_mostly
;
52 static __read_mostly seqcount_t xfrm_policy_hash_generation
;
54 static void xfrm_init_pmtu(struct dst_entry
*dst
);
55 static int stale_bundle(struct dst_entry
*dst
);
56 static int xfrm_bundle_ok(struct xfrm_dst
*xdst
);
57 static void xfrm_policy_queue_process(unsigned long arg
);
59 static void __xfrm_policy_link(struct xfrm_policy
*pol
, int dir
);
60 static struct xfrm_policy
*__xfrm_policy_unlink(struct xfrm_policy
*pol
,
63 static inline bool xfrm_pol_hold_rcu(struct xfrm_policy
*policy
)
65 return atomic_inc_not_zero(&policy
->refcnt
);
69 __xfrm4_selector_match(const struct xfrm_selector
*sel
, const struct flowi
*fl
)
71 const struct flowi4
*fl4
= &fl
->u
.ip4
;
73 return addr4_match(fl4
->daddr
, sel
->daddr
.a4
, sel
->prefixlen_d
) &&
74 addr4_match(fl4
->saddr
, sel
->saddr
.a4
, sel
->prefixlen_s
) &&
75 !((xfrm_flowi_dport(fl
, &fl4
->uli
) ^ sel
->dport
) & sel
->dport_mask
) &&
76 !((xfrm_flowi_sport(fl
, &fl4
->uli
) ^ sel
->sport
) & sel
->sport_mask
) &&
77 (fl4
->flowi4_proto
== sel
->proto
|| !sel
->proto
) &&
78 (fl4
->flowi4_oif
== sel
->ifindex
|| !sel
->ifindex
);
82 __xfrm6_selector_match(const struct xfrm_selector
*sel
, const struct flowi
*fl
)
84 const struct flowi6
*fl6
= &fl
->u
.ip6
;
86 return addr_match(&fl6
->daddr
, &sel
->daddr
, sel
->prefixlen_d
) &&
87 addr_match(&fl6
->saddr
, &sel
->saddr
, sel
->prefixlen_s
) &&
88 !((xfrm_flowi_dport(fl
, &fl6
->uli
) ^ sel
->dport
) & sel
->dport_mask
) &&
89 !((xfrm_flowi_sport(fl
, &fl6
->uli
) ^ sel
->sport
) & sel
->sport_mask
) &&
90 (fl6
->flowi6_proto
== sel
->proto
|| !sel
->proto
) &&
91 (fl6
->flowi6_oif
== sel
->ifindex
|| !sel
->ifindex
);
94 bool xfrm_selector_match(const struct xfrm_selector
*sel
, const struct flowi
*fl
,
95 unsigned short family
)
99 return __xfrm4_selector_match(sel
, fl
);
101 return __xfrm6_selector_match(sel
, fl
);
106 static const struct xfrm_policy_afinfo
*xfrm_policy_get_afinfo(unsigned short family
)
108 const struct xfrm_policy_afinfo
*afinfo
;
110 if (unlikely(family
>= ARRAY_SIZE(xfrm_policy_afinfo
)))
113 afinfo
= rcu_dereference(xfrm_policy_afinfo
[family
]);
114 if (unlikely(!afinfo
))
119 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo
*afinfo
)
124 static inline struct dst_entry
*__xfrm_dst_lookup(struct net
*net
,
126 const xfrm_address_t
*saddr
,
127 const xfrm_address_t
*daddr
,
130 struct xfrm_policy_afinfo
*afinfo
;
131 struct dst_entry
*dst
;
133 afinfo
= xfrm_policy_get_afinfo(family
);
134 if (unlikely(afinfo
== NULL
))
135 return ERR_PTR(-EAFNOSUPPORT
);
137 dst
= afinfo
->dst_lookup(net
, tos
, oif
, saddr
, daddr
);
139 xfrm_policy_put_afinfo(afinfo
);
144 static inline struct dst_entry
*xfrm_dst_lookup(struct xfrm_state
*x
,
146 xfrm_address_t
*prev_saddr
,
147 xfrm_address_t
*prev_daddr
,
150 struct net
*net
= xs_net(x
);
151 xfrm_address_t
*saddr
= &x
->props
.saddr
;
152 xfrm_address_t
*daddr
= &x
->id
.daddr
;
153 struct dst_entry
*dst
;
155 if (x
->type
->flags
& XFRM_TYPE_LOCAL_COADDR
) {
159 if (x
->type
->flags
& XFRM_TYPE_REMOTE_COADDR
) {
164 dst
= __xfrm_dst_lookup(net
, tos
, oif
, saddr
, daddr
, family
);
167 if (prev_saddr
!= saddr
)
168 memcpy(prev_saddr
, saddr
, sizeof(*prev_saddr
));
169 if (prev_daddr
!= daddr
)
170 memcpy(prev_daddr
, daddr
, sizeof(*prev_daddr
));
176 static inline unsigned long make_jiffies(long secs
)
178 if (secs
>= (MAX_SCHEDULE_TIMEOUT
-1)/HZ
)
179 return MAX_SCHEDULE_TIMEOUT
-1;
184 static void xfrm_policy_timer(unsigned long data
)
186 struct xfrm_policy
*xp
= (struct xfrm_policy
*)data
;
187 unsigned long now
= get_seconds();
188 long next
= LONG_MAX
;
192 read_lock(&xp
->lock
);
194 if (unlikely(xp
->walk
.dead
))
197 dir
= xfrm_policy_id2dir(xp
->index
);
199 if (xp
->lft
.hard_add_expires_seconds
) {
200 long tmo
= xp
->lft
.hard_add_expires_seconds
+
201 xp
->curlft
.add_time
- now
;
207 if (xp
->lft
.hard_use_expires_seconds
) {
208 long tmo
= xp
->lft
.hard_use_expires_seconds
+
209 (xp
->curlft
.use_time
? : xp
->curlft
.add_time
) - now
;
215 if (xp
->lft
.soft_add_expires_seconds
) {
216 long tmo
= xp
->lft
.soft_add_expires_seconds
+
217 xp
->curlft
.add_time
- now
;
220 tmo
= XFRM_KM_TIMEOUT
;
225 if (xp
->lft
.soft_use_expires_seconds
) {
226 long tmo
= xp
->lft
.soft_use_expires_seconds
+
227 (xp
->curlft
.use_time
? : xp
->curlft
.add_time
) - now
;
230 tmo
= XFRM_KM_TIMEOUT
;
237 km_policy_expired(xp
, dir
, 0, 0);
238 if (next
!= LONG_MAX
&&
239 !mod_timer(&xp
->timer
, jiffies
+ make_jiffies(next
)))
243 read_unlock(&xp
->lock
);
248 read_unlock(&xp
->lock
);
249 if (!xfrm_policy_delete(xp
, dir
))
250 km_policy_expired(xp
, dir
, 1, 0);
254 static struct flow_cache_object
*xfrm_policy_flo_get(struct flow_cache_object
*flo
)
256 struct xfrm_policy
*pol
= container_of(flo
, struct xfrm_policy
, flo
);
258 if (unlikely(pol
->walk
.dead
))
266 static int xfrm_policy_flo_check(struct flow_cache_object
*flo
)
268 struct xfrm_policy
*pol
= container_of(flo
, struct xfrm_policy
, flo
);
270 return !pol
->walk
.dead
;
273 static void xfrm_policy_flo_delete(struct flow_cache_object
*flo
)
275 xfrm_pol_put(container_of(flo
, struct xfrm_policy
, flo
));
278 static const struct flow_cache_ops xfrm_policy_fc_ops
= {
279 .get
= xfrm_policy_flo_get
,
280 .check
= xfrm_policy_flo_check
,
281 .delete = xfrm_policy_flo_delete
,
284 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
288 struct xfrm_policy
*xfrm_policy_alloc(struct net
*net
, gfp_t gfp
)
290 struct xfrm_policy
*policy
;
292 policy
= kzalloc(sizeof(struct xfrm_policy
), gfp
);
295 write_pnet(&policy
->xp_net
, net
);
296 INIT_LIST_HEAD(&policy
->walk
.all
);
297 INIT_HLIST_NODE(&policy
->bydst
);
298 INIT_HLIST_NODE(&policy
->byidx
);
299 rwlock_init(&policy
->lock
);
300 atomic_set(&policy
->refcnt
, 1);
301 skb_queue_head_init(&policy
->polq
.hold_queue
);
302 setup_timer(&policy
->timer
, xfrm_policy_timer
,
303 (unsigned long)policy
);
304 setup_timer(&policy
->polq
.hold_timer
, xfrm_policy_queue_process
,
305 (unsigned long)policy
);
306 policy
->flo
.ops
= &xfrm_policy_fc_ops
;
310 EXPORT_SYMBOL(xfrm_policy_alloc
);
312 static void xfrm_policy_destroy_rcu(struct rcu_head
*head
)
314 struct xfrm_policy
*policy
= container_of(head
, struct xfrm_policy
, rcu
);
316 security_xfrm_policy_free(policy
->security
);
320 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
322 void xfrm_policy_destroy(struct xfrm_policy
*policy
)
324 BUG_ON(!policy
->walk
.dead
);
326 if (del_timer(&policy
->timer
) || del_timer(&policy
->polq
.hold_timer
))
329 call_rcu(&policy
->rcu
, xfrm_policy_destroy_rcu
);
331 EXPORT_SYMBOL(xfrm_policy_destroy
);
333 /* Rule must be locked. Release descendant resources, announce
334 * entry dead. The rule must be unlinked from lists to the moment.
337 static void xfrm_policy_kill(struct xfrm_policy
*policy
)
339 policy
->walk
.dead
= 1;
341 atomic_inc(&policy
->genid
);
343 if (del_timer(&policy
->polq
.hold_timer
))
344 xfrm_pol_put(policy
);
345 skb_queue_purge(&policy
->polq
.hold_queue
);
347 if (del_timer(&policy
->timer
))
348 xfrm_pol_put(policy
);
350 xfrm_pol_put(policy
);
353 static unsigned int xfrm_policy_hashmax __read_mostly
= 1 * 1024 * 1024;
355 static inline unsigned int idx_hash(struct net
*net
, u32 index
)
357 return __idx_hash(index
, net
->xfrm
.policy_idx_hmask
);
360 /* calculate policy hash thresholds */
361 static void __get_hash_thresh(struct net
*net
,
362 unsigned short family
, int dir
,
363 u8
*dbits
, u8
*sbits
)
367 *dbits
= net
->xfrm
.policy_bydst
[dir
].dbits4
;
368 *sbits
= net
->xfrm
.policy_bydst
[dir
].sbits4
;
372 *dbits
= net
->xfrm
.policy_bydst
[dir
].dbits6
;
373 *sbits
= net
->xfrm
.policy_bydst
[dir
].sbits6
;
382 static struct hlist_head
*policy_hash_bysel(struct net
*net
,
383 const struct xfrm_selector
*sel
,
384 unsigned short family
, int dir
)
386 unsigned int hmask
= net
->xfrm
.policy_bydst
[dir
].hmask
;
391 __get_hash_thresh(net
, family
, dir
, &dbits
, &sbits
);
392 hash
= __sel_hash(sel
, family
, hmask
, dbits
, sbits
);
394 if (hash
== hmask
+ 1)
395 return &net
->xfrm
.policy_inexact
[dir
];
397 return rcu_dereference_check(net
->xfrm
.policy_bydst
[dir
].table
,
398 lockdep_is_held(&net
->xfrm
.xfrm_policy_lock
)) + hash
;
401 static struct hlist_head
*policy_hash_direct(struct net
*net
,
402 const xfrm_address_t
*daddr
,
403 const xfrm_address_t
*saddr
,
404 unsigned short family
, int dir
)
406 unsigned int hmask
= net
->xfrm
.policy_bydst
[dir
].hmask
;
411 __get_hash_thresh(net
, family
, dir
, &dbits
, &sbits
);
412 hash
= __addr_hash(daddr
, saddr
, family
, hmask
, dbits
, sbits
);
414 return rcu_dereference_check(net
->xfrm
.policy_bydst
[dir
].table
,
415 lockdep_is_held(&net
->xfrm
.xfrm_policy_lock
)) + hash
;
418 static void xfrm_dst_hash_transfer(struct net
*net
,
419 struct hlist_head
*list
,
420 struct hlist_head
*ndsttable
,
421 unsigned int nhashmask
,
424 struct hlist_node
*tmp
, *entry0
= NULL
;
425 struct xfrm_policy
*pol
;
431 hlist_for_each_entry_safe(pol
, tmp
, list
, bydst
) {
434 __get_hash_thresh(net
, pol
->family
, dir
, &dbits
, &sbits
);
435 h
= __addr_hash(&pol
->selector
.daddr
, &pol
->selector
.saddr
,
436 pol
->family
, nhashmask
, dbits
, sbits
);
438 hlist_del_rcu(&pol
->bydst
);
439 hlist_add_head_rcu(&pol
->bydst
, ndsttable
+ h
);
444 hlist_del_rcu(&pol
->bydst
);
445 hlist_add_behind_rcu(&pol
->bydst
, entry0
);
447 entry0
= &pol
->bydst
;
449 if (!hlist_empty(list
)) {
455 static void xfrm_idx_hash_transfer(struct hlist_head
*list
,
456 struct hlist_head
*nidxtable
,
457 unsigned int nhashmask
)
459 struct hlist_node
*tmp
;
460 struct xfrm_policy
*pol
;
462 hlist_for_each_entry_safe(pol
, tmp
, list
, byidx
) {
465 h
= __idx_hash(pol
->index
, nhashmask
);
466 hlist_add_head(&pol
->byidx
, nidxtable
+h
);
470 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask
)
472 return ((old_hmask
+ 1) << 1) - 1;
475 static void xfrm_bydst_resize(struct net
*net
, int dir
)
477 unsigned int hmask
= net
->xfrm
.policy_bydst
[dir
].hmask
;
478 unsigned int nhashmask
= xfrm_new_hash_mask(hmask
);
479 unsigned int nsize
= (nhashmask
+ 1) * sizeof(struct hlist_head
);
480 struct hlist_head
*ndst
= xfrm_hash_alloc(nsize
);
481 struct hlist_head
*odst
;
487 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
488 write_seqcount_begin(&xfrm_policy_hash_generation
);
490 odst
= rcu_dereference_protected(net
->xfrm
.policy_bydst
[dir
].table
,
491 lockdep_is_held(&net
->xfrm
.xfrm_policy_lock
));
493 odst
= rcu_dereference_protected(net
->xfrm
.policy_bydst
[dir
].table
,
494 lockdep_is_held(&net
->xfrm
.xfrm_policy_lock
));
496 for (i
= hmask
; i
>= 0; i
--)
497 xfrm_dst_hash_transfer(net
, odst
+ i
, ndst
, nhashmask
, dir
);
499 rcu_assign_pointer(net
->xfrm
.policy_bydst
[dir
].table
, ndst
);
500 net
->xfrm
.policy_bydst
[dir
].hmask
= nhashmask
;
502 write_seqcount_end(&xfrm_policy_hash_generation
);
503 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
507 xfrm_hash_free(odst
, (hmask
+ 1) * sizeof(struct hlist_head
));
510 static void xfrm_byidx_resize(struct net
*net
, int total
)
512 unsigned int hmask
= net
->xfrm
.policy_idx_hmask
;
513 unsigned int nhashmask
= xfrm_new_hash_mask(hmask
);
514 unsigned int nsize
= (nhashmask
+ 1) * sizeof(struct hlist_head
);
515 struct hlist_head
*oidx
= net
->xfrm
.policy_byidx
;
516 struct hlist_head
*nidx
= xfrm_hash_alloc(nsize
);
522 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
524 for (i
= hmask
; i
>= 0; i
--)
525 xfrm_idx_hash_transfer(oidx
+ i
, nidx
, nhashmask
);
527 net
->xfrm
.policy_byidx
= nidx
;
528 net
->xfrm
.policy_idx_hmask
= nhashmask
;
530 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
532 xfrm_hash_free(oidx
, (hmask
+ 1) * sizeof(struct hlist_head
));
535 static inline int xfrm_bydst_should_resize(struct net
*net
, int dir
, int *total
)
537 unsigned int cnt
= net
->xfrm
.policy_count
[dir
];
538 unsigned int hmask
= net
->xfrm
.policy_bydst
[dir
].hmask
;
543 if ((hmask
+ 1) < xfrm_policy_hashmax
&&
550 static inline int xfrm_byidx_should_resize(struct net
*net
, int total
)
552 unsigned int hmask
= net
->xfrm
.policy_idx_hmask
;
554 if ((hmask
+ 1) < xfrm_policy_hashmax
&&
561 void xfrm_spd_getinfo(struct net
*net
, struct xfrmk_spdinfo
*si
)
563 si
->incnt
= net
->xfrm
.policy_count
[XFRM_POLICY_IN
];
564 si
->outcnt
= net
->xfrm
.policy_count
[XFRM_POLICY_OUT
];
565 si
->fwdcnt
= net
->xfrm
.policy_count
[XFRM_POLICY_FWD
];
566 si
->inscnt
= net
->xfrm
.policy_count
[XFRM_POLICY_IN
+XFRM_POLICY_MAX
];
567 si
->outscnt
= net
->xfrm
.policy_count
[XFRM_POLICY_OUT
+XFRM_POLICY_MAX
];
568 si
->fwdscnt
= net
->xfrm
.policy_count
[XFRM_POLICY_FWD
+XFRM_POLICY_MAX
];
569 si
->spdhcnt
= net
->xfrm
.policy_idx_hmask
;
570 si
->spdhmcnt
= xfrm_policy_hashmax
;
572 EXPORT_SYMBOL(xfrm_spd_getinfo
);
574 static DEFINE_MUTEX(hash_resize_mutex
);
575 static void xfrm_hash_resize(struct work_struct
*work
)
577 struct net
*net
= container_of(work
, struct net
, xfrm
.policy_hash_work
);
580 mutex_lock(&hash_resize_mutex
);
583 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
584 if (xfrm_bydst_should_resize(net
, dir
, &total
))
585 xfrm_bydst_resize(net
, dir
);
587 if (xfrm_byidx_should_resize(net
, total
))
588 xfrm_byidx_resize(net
, total
);
590 mutex_unlock(&hash_resize_mutex
);
593 static void xfrm_hash_rebuild(struct work_struct
*work
)
595 struct net
*net
= container_of(work
, struct net
,
596 xfrm
.policy_hthresh
.work
);
598 struct xfrm_policy
*pol
;
599 struct xfrm_policy
*policy
;
600 struct hlist_head
*chain
;
601 struct hlist_head
*odst
;
602 struct hlist_node
*newpos
;
606 u8 lbits4
, rbits4
, lbits6
, rbits6
;
608 mutex_lock(&hash_resize_mutex
);
610 /* read selector prefixlen thresholds */
612 seq
= read_seqbegin(&net
->xfrm
.policy_hthresh
.lock
);
614 lbits4
= net
->xfrm
.policy_hthresh
.lbits4
;
615 rbits4
= net
->xfrm
.policy_hthresh
.rbits4
;
616 lbits6
= net
->xfrm
.policy_hthresh
.lbits6
;
617 rbits6
= net
->xfrm
.policy_hthresh
.rbits6
;
618 } while (read_seqretry(&net
->xfrm
.policy_hthresh
.lock
, seq
));
620 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
622 /* reset the bydst and inexact table in all directions */
623 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
624 INIT_HLIST_HEAD(&net
->xfrm
.policy_inexact
[dir
]);
625 hmask
= net
->xfrm
.policy_bydst
[dir
].hmask
;
626 odst
= net
->xfrm
.policy_bydst
[dir
].table
;
627 for (i
= hmask
; i
>= 0; i
--)
628 INIT_HLIST_HEAD(odst
+ i
);
629 if ((dir
& XFRM_POLICY_MASK
) == XFRM_POLICY_OUT
) {
630 /* dir out => dst = remote, src = local */
631 net
->xfrm
.policy_bydst
[dir
].dbits4
= rbits4
;
632 net
->xfrm
.policy_bydst
[dir
].sbits4
= lbits4
;
633 net
->xfrm
.policy_bydst
[dir
].dbits6
= rbits6
;
634 net
->xfrm
.policy_bydst
[dir
].sbits6
= lbits6
;
636 /* dir in/fwd => dst = local, src = remote */
637 net
->xfrm
.policy_bydst
[dir
].dbits4
= lbits4
;
638 net
->xfrm
.policy_bydst
[dir
].sbits4
= rbits4
;
639 net
->xfrm
.policy_bydst
[dir
].dbits6
= lbits6
;
640 net
->xfrm
.policy_bydst
[dir
].sbits6
= rbits6
;
644 /* re-insert all policies by order of creation */
645 list_for_each_entry_reverse(policy
, &net
->xfrm
.policy_all
, walk
.all
) {
646 if (xfrm_policy_id2dir(policy
->index
) >= XFRM_POLICY_MAX
) {
647 /* skip socket policies */
651 chain
= policy_hash_bysel(net
, &policy
->selector
,
653 xfrm_policy_id2dir(policy
->index
));
654 hlist_for_each_entry(pol
, chain
, bydst
) {
655 if (policy
->priority
>= pol
->priority
)
656 newpos
= &pol
->bydst
;
661 hlist_add_behind(&policy
->bydst
, newpos
);
663 hlist_add_head(&policy
->bydst
, chain
);
666 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
668 mutex_unlock(&hash_resize_mutex
);
671 void xfrm_policy_hash_rebuild(struct net
*net
)
673 schedule_work(&net
->xfrm
.policy_hthresh
.work
);
675 EXPORT_SYMBOL(xfrm_policy_hash_rebuild
);
677 /* Generate new index... KAME seems to generate them ordered by cost
678 * of an absolute inpredictability of ordering of rules. This will not pass. */
679 static u32
xfrm_gen_index(struct net
*net
, int dir
, u32 index
)
681 static u32 idx_generator
;
684 struct hlist_head
*list
;
685 struct xfrm_policy
*p
;
690 idx
= (idx_generator
| dir
);
699 list
= net
->xfrm
.policy_byidx
+ idx_hash(net
, idx
);
701 hlist_for_each_entry(p
, list
, byidx
) {
702 if (p
->index
== idx
) {
712 static inline int selector_cmp(struct xfrm_selector
*s1
, struct xfrm_selector
*s2
)
714 u32
*p1
= (u32
*) s1
;
715 u32
*p2
= (u32
*) s2
;
716 int len
= sizeof(struct xfrm_selector
) / sizeof(u32
);
719 for (i
= 0; i
< len
; i
++) {
727 static void xfrm_policy_requeue(struct xfrm_policy
*old
,
728 struct xfrm_policy
*new)
730 struct xfrm_policy_queue
*pq
= &old
->polq
;
731 struct sk_buff_head list
;
733 if (skb_queue_empty(&pq
->hold_queue
))
736 __skb_queue_head_init(&list
);
738 spin_lock_bh(&pq
->hold_queue
.lock
);
739 skb_queue_splice_init(&pq
->hold_queue
, &list
);
740 if (del_timer(&pq
->hold_timer
))
742 spin_unlock_bh(&pq
->hold_queue
.lock
);
746 spin_lock_bh(&pq
->hold_queue
.lock
);
747 skb_queue_splice(&list
, &pq
->hold_queue
);
748 pq
->timeout
= XFRM_QUEUE_TMO_MIN
;
749 if (!mod_timer(&pq
->hold_timer
, jiffies
))
751 spin_unlock_bh(&pq
->hold_queue
.lock
);
754 static bool xfrm_policy_mark_match(struct xfrm_policy
*policy
,
755 struct xfrm_policy
*pol
)
757 u32 mark
= policy
->mark
.v
& policy
->mark
.m
;
759 if (policy
->mark
.v
== pol
->mark
.v
&& policy
->mark
.m
== pol
->mark
.m
)
762 if ((mark
& pol
->mark
.m
) == pol
->mark
.v
&&
763 policy
->priority
== pol
->priority
)
769 int xfrm_policy_insert(int dir
, struct xfrm_policy
*policy
, int excl
)
771 struct net
*net
= xp_net(policy
);
772 struct xfrm_policy
*pol
;
773 struct xfrm_policy
*delpol
;
774 struct hlist_head
*chain
;
775 struct hlist_node
*newpos
;
777 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
778 chain
= policy_hash_bysel(net
, &policy
->selector
, policy
->family
, dir
);
781 hlist_for_each_entry(pol
, chain
, bydst
) {
782 if (pol
->type
== policy
->type
&&
783 !selector_cmp(&pol
->selector
, &policy
->selector
) &&
784 xfrm_policy_mark_match(policy
, pol
) &&
785 xfrm_sec_ctx_match(pol
->security
, policy
->security
) &&
788 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
792 if (policy
->priority
> pol
->priority
)
794 } else if (policy
->priority
>= pol
->priority
) {
795 newpos
= &pol
->bydst
;
802 hlist_add_behind(&policy
->bydst
, newpos
);
804 hlist_add_head(&policy
->bydst
, chain
);
805 __xfrm_policy_link(policy
, dir
);
806 atomic_inc(&net
->xfrm
.flow_cache_genid
);
808 /* After previous checking, family can either be AF_INET or AF_INET6 */
809 if (policy
->family
== AF_INET
)
810 rt_genid_bump_ipv4(net
);
812 rt_genid_bump_ipv6(net
);
815 xfrm_policy_requeue(delpol
, policy
);
816 __xfrm_policy_unlink(delpol
, dir
);
818 policy
->index
= delpol
? delpol
->index
: xfrm_gen_index(net
, dir
, policy
->index
);
819 hlist_add_head(&policy
->byidx
, net
->xfrm
.policy_byidx
+idx_hash(net
, policy
->index
));
820 policy
->curlft
.add_time
= get_seconds();
821 policy
->curlft
.use_time
= 0;
822 if (!mod_timer(&policy
->timer
, jiffies
+ HZ
))
823 xfrm_pol_hold(policy
);
824 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
827 xfrm_policy_kill(delpol
);
828 else if (xfrm_bydst_should_resize(net
, dir
, NULL
))
829 schedule_work(&net
->xfrm
.policy_hash_work
);
833 EXPORT_SYMBOL(xfrm_policy_insert
);
835 struct xfrm_policy
*xfrm_policy_bysel_ctx(struct net
*net
, u32 mark
, u8 type
,
836 int dir
, struct xfrm_selector
*sel
,
837 struct xfrm_sec_ctx
*ctx
, int delete,
840 struct xfrm_policy
*pol
, *ret
;
841 struct hlist_head
*chain
;
844 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
845 chain
= policy_hash_bysel(net
, sel
, sel
->family
, dir
);
847 hlist_for_each_entry(pol
, chain
, bydst
) {
848 if (pol
->type
== type
&&
849 (mark
& pol
->mark
.m
) == pol
->mark
.v
&&
850 !selector_cmp(sel
, &pol
->selector
) &&
851 xfrm_sec_ctx_match(ctx
, pol
->security
)) {
854 *err
= security_xfrm_policy_delete(
857 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
860 __xfrm_policy_unlink(pol
, dir
);
866 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
869 xfrm_policy_kill(ret
);
872 EXPORT_SYMBOL(xfrm_policy_bysel_ctx
);
874 struct xfrm_policy
*xfrm_policy_byid(struct net
*net
, u32 mark
, u8 type
,
875 int dir
, u32 id
, int delete, int *err
)
877 struct xfrm_policy
*pol
, *ret
;
878 struct hlist_head
*chain
;
881 if (xfrm_policy_id2dir(id
) != dir
)
885 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
886 chain
= net
->xfrm
.policy_byidx
+ idx_hash(net
, id
);
888 hlist_for_each_entry(pol
, chain
, byidx
) {
889 if (pol
->type
== type
&& pol
->index
== id
&&
890 (mark
& pol
->mark
.m
) == pol
->mark
.v
) {
893 *err
= security_xfrm_policy_delete(
896 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
899 __xfrm_policy_unlink(pol
, dir
);
905 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
908 xfrm_policy_kill(ret
);
911 EXPORT_SYMBOL(xfrm_policy_byid
);
913 #ifdef CONFIG_SECURITY_NETWORK_XFRM
915 xfrm_policy_flush_secctx_check(struct net
*net
, u8 type
, bool task_valid
)
919 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
920 struct xfrm_policy
*pol
;
923 hlist_for_each_entry(pol
,
924 &net
->xfrm
.policy_inexact
[dir
], bydst
) {
925 if (pol
->type
!= type
)
927 err
= security_xfrm_policy_delete(pol
->security
);
929 xfrm_audit_policy_delete(pol
, 0, task_valid
);
933 for (i
= net
->xfrm
.policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
934 hlist_for_each_entry(pol
,
935 net
->xfrm
.policy_bydst
[dir
].table
+ i
,
937 if (pol
->type
!= type
)
939 err
= security_xfrm_policy_delete(
942 xfrm_audit_policy_delete(pol
, 0,
953 xfrm_policy_flush_secctx_check(struct net
*net
, u8 type
, bool task_valid
)
959 int xfrm_policy_flush(struct net
*net
, u8 type
, bool task_valid
)
961 int dir
, err
= 0, cnt
= 0;
963 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
965 err
= xfrm_policy_flush_secctx_check(net
, type
, task_valid
);
969 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
970 struct xfrm_policy
*pol
;
974 hlist_for_each_entry(pol
,
975 &net
->xfrm
.policy_inexact
[dir
], bydst
) {
976 if (pol
->type
!= type
)
978 __xfrm_policy_unlink(pol
, dir
);
979 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
982 xfrm_audit_policy_delete(pol
, 1, task_valid
);
984 xfrm_policy_kill(pol
);
986 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
990 for (i
= net
->xfrm
.policy_bydst
[dir
].hmask
; i
>= 0; i
--) {
992 hlist_for_each_entry(pol
,
993 net
->xfrm
.policy_bydst
[dir
].table
+ i
,
995 if (pol
->type
!= type
)
997 __xfrm_policy_unlink(pol
, dir
);
998 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
1001 xfrm_audit_policy_delete(pol
, 1, task_valid
);
1002 xfrm_policy_kill(pol
);
1004 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
1013 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
1016 EXPORT_SYMBOL(xfrm_policy_flush
);
1018 int xfrm_policy_walk(struct net
*net
, struct xfrm_policy_walk
*walk
,
1019 int (*func
)(struct xfrm_policy
*, int, int, void*),
1022 struct xfrm_policy
*pol
;
1023 struct xfrm_policy_walk_entry
*x
;
1026 if (walk
->type
>= XFRM_POLICY_TYPE_MAX
&&
1027 walk
->type
!= XFRM_POLICY_TYPE_ANY
)
1030 if (list_empty(&walk
->walk
.all
) && walk
->seq
!= 0)
1033 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
1034 if (list_empty(&walk
->walk
.all
))
1035 x
= list_first_entry(&net
->xfrm
.policy_all
, struct xfrm_policy_walk_entry
, all
);
1037 x
= list_first_entry(&walk
->walk
.all
,
1038 struct xfrm_policy_walk_entry
, all
);
1040 list_for_each_entry_from(x
, &net
->xfrm
.policy_all
, all
) {
1043 pol
= container_of(x
, struct xfrm_policy
, walk
);
1044 if (walk
->type
!= XFRM_POLICY_TYPE_ANY
&&
1045 walk
->type
!= pol
->type
)
1047 error
= func(pol
, xfrm_policy_id2dir(pol
->index
),
1050 list_move_tail(&walk
->walk
.all
, &x
->all
);
1055 if (walk
->seq
== 0) {
1059 list_del_init(&walk
->walk
.all
);
1061 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
1064 EXPORT_SYMBOL(xfrm_policy_walk
);
1066 void xfrm_policy_walk_init(struct xfrm_policy_walk
*walk
, u8 type
)
1068 INIT_LIST_HEAD(&walk
->walk
.all
);
1069 walk
->walk
.dead
= 1;
1073 EXPORT_SYMBOL(xfrm_policy_walk_init
);
1075 void xfrm_policy_walk_done(struct xfrm_policy_walk
*walk
, struct net
*net
)
1077 if (list_empty(&walk
->walk
.all
))
1080 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
); /*FIXME where is net? */
1081 list_del(&walk
->walk
.all
);
1082 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
1084 EXPORT_SYMBOL(xfrm_policy_walk_done
);
1087 * Find policy to apply to this flow.
1089 * Returns 0 if policy found, else an -errno.
1091 static int xfrm_policy_match(const struct xfrm_policy
*pol
,
1092 const struct flowi
*fl
,
1093 u8 type
, u16 family
, int dir
)
1095 const struct xfrm_selector
*sel
= &pol
->selector
;
1099 if (pol
->family
!= family
||
1100 (fl
->flowi_mark
& pol
->mark
.m
) != pol
->mark
.v
||
1104 match
= xfrm_selector_match(sel
, fl
, family
);
1106 ret
= security_xfrm_policy_lookup(pol
->security
, fl
->flowi_secid
,
1112 static struct xfrm_policy
*xfrm_policy_lookup_bytype(struct net
*net
, u8 type
,
1113 const struct flowi
*fl
,
1117 struct xfrm_policy
*pol
, *ret
;
1118 const xfrm_address_t
*daddr
, *saddr
;
1119 struct hlist_head
*chain
;
1120 unsigned int sequence
;
1123 daddr
= xfrm_flowi_daddr(fl
, family
);
1124 saddr
= xfrm_flowi_saddr(fl
, family
);
1125 if (unlikely(!daddr
|| !saddr
))
1131 sequence
= read_seqcount_begin(&xfrm_policy_hash_generation
);
1132 chain
= policy_hash_direct(net
, daddr
, saddr
, family
, dir
);
1133 } while (read_seqcount_retry(&xfrm_policy_hash_generation
, sequence
));
1137 hlist_for_each_entry_rcu(pol
, chain
, bydst
) {
1138 err
= xfrm_policy_match(pol
, fl
, type
, family
, dir
);
1148 priority
= ret
->priority
;
1152 chain
= &net
->xfrm
.policy_inexact
[dir
];
1153 hlist_for_each_entry_rcu(pol
, chain
, bydst
) {
1154 if ((pol
->priority
>= priority
) && ret
)
1157 err
= xfrm_policy_match(pol
, fl
, type
, family
, dir
);
1171 if (read_seqcount_retry(&xfrm_policy_hash_generation
, sequence
))
1174 if (ret
&& !xfrm_pol_hold_rcu(ret
))
1182 static struct xfrm_policy
*
1183 __xfrm_policy_lookup(struct net
*net
, const struct flowi
*fl
, u16 family
, u8 dir
)
1185 #ifdef CONFIG_XFRM_SUB_POLICY
1186 struct xfrm_policy
*pol
;
1188 pol
= xfrm_policy_lookup_bytype(net
, XFRM_POLICY_TYPE_SUB
, fl
, family
, dir
);
1192 return xfrm_policy_lookup_bytype(net
, XFRM_POLICY_TYPE_MAIN
, fl
, family
, dir
);
1195 static int flow_to_policy_dir(int dir
)
1197 if (XFRM_POLICY_IN
== FLOW_DIR_IN
&&
1198 XFRM_POLICY_OUT
== FLOW_DIR_OUT
&&
1199 XFRM_POLICY_FWD
== FLOW_DIR_FWD
)
1205 return XFRM_POLICY_IN
;
1207 return XFRM_POLICY_OUT
;
1209 return XFRM_POLICY_FWD
;
1213 static struct flow_cache_object
*
1214 xfrm_policy_lookup(struct net
*net
, const struct flowi
*fl
, u16 family
,
1215 u8 dir
, struct flow_cache_object
*old_obj
, void *ctx
)
1217 struct xfrm_policy
*pol
;
1220 xfrm_pol_put(container_of(old_obj
, struct xfrm_policy
, flo
));
1222 pol
= __xfrm_policy_lookup(net
, fl
, family
, flow_to_policy_dir(dir
));
1223 if (IS_ERR_OR_NULL(pol
))
1224 return ERR_CAST(pol
);
1226 /* Resolver returns two references:
1227 * one for cache and one for caller of flow_cache_lookup() */
1233 static inline int policy_to_flow_dir(int dir
)
1235 if (XFRM_POLICY_IN
== FLOW_DIR_IN
&&
1236 XFRM_POLICY_OUT
== FLOW_DIR_OUT
&&
1237 XFRM_POLICY_FWD
== FLOW_DIR_FWD
)
1241 case XFRM_POLICY_IN
:
1243 case XFRM_POLICY_OUT
:
1244 return FLOW_DIR_OUT
;
1245 case XFRM_POLICY_FWD
:
1246 return FLOW_DIR_FWD
;
1250 static struct xfrm_policy
*xfrm_sk_policy_lookup(const struct sock
*sk
, int dir
,
1251 const struct flowi
*fl
)
1253 struct xfrm_policy
*pol
;
1257 pol
= rcu_dereference(sk
->sk_policy
[dir
]);
1259 bool match
= xfrm_selector_match(&pol
->selector
, fl
,
1264 if ((sk
->sk_mark
& pol
->mark
.m
) != pol
->mark
.v
) {
1268 err
= security_xfrm_policy_lookup(pol
->security
,
1270 policy_to_flow_dir(dir
));
1272 if (!xfrm_pol_hold_rcu(pol
))
1274 } else if (err
== -ESRCH
) {
1287 static void __xfrm_policy_link(struct xfrm_policy
*pol
, int dir
)
1289 struct net
*net
= xp_net(pol
);
1291 list_add(&pol
->walk
.all
, &net
->xfrm
.policy_all
);
1292 net
->xfrm
.policy_count
[dir
]++;
1296 static struct xfrm_policy
*__xfrm_policy_unlink(struct xfrm_policy
*pol
,
1299 struct net
*net
= xp_net(pol
);
1301 if (list_empty(&pol
->walk
.all
))
1304 /* Socket policies are not hashed. */
1305 if (!hlist_unhashed(&pol
->bydst
)) {
1306 hlist_del_rcu(&pol
->bydst
);
1307 hlist_del(&pol
->byidx
);
1310 list_del_init(&pol
->walk
.all
);
1311 net
->xfrm
.policy_count
[dir
]--;
1316 static void xfrm_sk_policy_link(struct xfrm_policy
*pol
, int dir
)
1318 __xfrm_policy_link(pol
, XFRM_POLICY_MAX
+ dir
);
1321 static void xfrm_sk_policy_unlink(struct xfrm_policy
*pol
, int dir
)
1323 __xfrm_policy_unlink(pol
, XFRM_POLICY_MAX
+ dir
);
1326 int xfrm_policy_delete(struct xfrm_policy
*pol
, int dir
)
1328 struct net
*net
= xp_net(pol
);
1330 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
1331 pol
= __xfrm_policy_unlink(pol
, dir
);
1332 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
1334 xfrm_policy_kill(pol
);
1339 EXPORT_SYMBOL(xfrm_policy_delete
);
1341 int xfrm_sk_policy_insert(struct sock
*sk
, int dir
, struct xfrm_policy
*pol
)
1343 struct net
*net
= xp_net(pol
);
1344 struct xfrm_policy
*old_pol
;
1346 #ifdef CONFIG_XFRM_SUB_POLICY
1347 if (pol
&& pol
->type
!= XFRM_POLICY_TYPE_MAIN
)
1351 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
1352 old_pol
= rcu_dereference_protected(sk
->sk_policy
[dir
],
1353 lockdep_is_held(&net
->xfrm
.xfrm_policy_lock
));
1355 pol
->curlft
.add_time
= get_seconds();
1356 pol
->index
= xfrm_gen_index(net
, XFRM_POLICY_MAX
+dir
, 0);
1357 xfrm_sk_policy_link(pol
, dir
);
1359 rcu_assign_pointer(sk
->sk_policy
[dir
], pol
);
1362 xfrm_policy_requeue(old_pol
, pol
);
1364 /* Unlinking succeeds always. This is the only function
1365 * allowed to delete or replace socket policy.
1367 xfrm_sk_policy_unlink(old_pol
, dir
);
1369 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
1372 xfrm_policy_kill(old_pol
);
1377 static struct xfrm_policy
*clone_policy(const struct xfrm_policy
*old
, int dir
)
1379 struct xfrm_policy
*newp
= xfrm_policy_alloc(xp_net(old
), GFP_ATOMIC
);
1380 struct net
*net
= xp_net(old
);
1383 newp
->selector
= old
->selector
;
1384 if (security_xfrm_policy_clone(old
->security
,
1387 return NULL
; /* ENOMEM */
1389 newp
->lft
= old
->lft
;
1390 newp
->curlft
= old
->curlft
;
1391 newp
->mark
= old
->mark
;
1392 newp
->action
= old
->action
;
1393 newp
->flags
= old
->flags
;
1394 newp
->xfrm_nr
= old
->xfrm_nr
;
1395 newp
->index
= old
->index
;
1396 newp
->type
= old
->type
;
1397 memcpy(newp
->xfrm_vec
, old
->xfrm_vec
,
1398 newp
->xfrm_nr
*sizeof(struct xfrm_tmpl
));
1399 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
1400 xfrm_sk_policy_link(newp
, dir
);
1401 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
1407 int __xfrm_sk_clone_policy(struct sock
*sk
, const struct sock
*osk
)
1409 const struct xfrm_policy
*p
;
1410 struct xfrm_policy
*np
;
1414 for (i
= 0; i
< 2; i
++) {
1415 p
= rcu_dereference(osk
->sk_policy
[i
]);
1417 np
= clone_policy(p
, i
);
1418 if (unlikely(!np
)) {
1422 rcu_assign_pointer(sk
->sk_policy
[i
], np
);
1430 xfrm_get_saddr(struct net
*net
, int oif
, xfrm_address_t
*local
,
1431 xfrm_address_t
*remote
, unsigned short family
)
1434 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1436 if (unlikely(afinfo
== NULL
))
1438 err
= afinfo
->get_saddr(net
, oif
, local
, remote
);
1439 xfrm_policy_put_afinfo(afinfo
);
1443 /* Resolve list of templates for the flow, given policy. */
1446 xfrm_tmpl_resolve_one(struct xfrm_policy
*policy
, const struct flowi
*fl
,
1447 struct xfrm_state
**xfrm
, unsigned short family
)
1449 struct net
*net
= xp_net(policy
);
1452 xfrm_address_t
*daddr
= xfrm_flowi_daddr(fl
, family
);
1453 xfrm_address_t
*saddr
= xfrm_flowi_saddr(fl
, family
);
1456 for (nx
= 0, i
= 0; i
< policy
->xfrm_nr
; i
++) {
1457 struct xfrm_state
*x
;
1458 xfrm_address_t
*remote
= daddr
;
1459 xfrm_address_t
*local
= saddr
;
1460 struct xfrm_tmpl
*tmpl
= &policy
->xfrm_vec
[i
];
1462 if (tmpl
->mode
== XFRM_MODE_TUNNEL
||
1463 tmpl
->mode
== XFRM_MODE_BEET
) {
1464 remote
= &tmpl
->id
.daddr
;
1465 local
= &tmpl
->saddr
;
1466 if (xfrm_addr_any(local
, tmpl
->encap_family
)) {
1467 error
= xfrm_get_saddr(net
, fl
->flowi_oif
,
1469 tmpl
->encap_family
);
1476 x
= xfrm_state_find(remote
, local
, fl
, tmpl
, policy
, &error
, family
);
1478 if (x
&& x
->km
.state
== XFRM_STATE_VALID
) {
1485 error
= (x
->km
.state
== XFRM_STATE_ERROR
?
1488 } else if (error
== -ESRCH
) {
1492 if (!tmpl
->optional
)
1498 for (nx
--; nx
>= 0; nx
--)
1499 xfrm_state_put(xfrm
[nx
]);
1504 xfrm_tmpl_resolve(struct xfrm_policy
**pols
, int npols
, const struct flowi
*fl
,
1505 struct xfrm_state
**xfrm
, unsigned short family
)
1507 struct xfrm_state
*tp
[XFRM_MAX_DEPTH
];
1508 struct xfrm_state
**tpp
= (npols
> 1) ? tp
: xfrm
;
1514 for (i
= 0; i
< npols
; i
++) {
1515 if (cnx
+ pols
[i
]->xfrm_nr
>= XFRM_MAX_DEPTH
) {
1520 ret
= xfrm_tmpl_resolve_one(pols
[i
], fl
, &tpp
[cnx
], family
);
1528 /* found states are sorted for outbound processing */
1530 xfrm_state_sort(xfrm
, tpp
, cnx
, family
);
1535 for (cnx
--; cnx
>= 0; cnx
--)
1536 xfrm_state_put(tpp
[cnx
]);
1541 static int xfrm_get_tos(const struct flowi
*fl
, int family
)
1543 struct xfrm_policy_afinfo
*afinfo
;
1546 afinfo
= xfrm_policy_get_afinfo(family
);
1547 tos
= afinfo
? afinfo
->get_tos(fl
) : 0;
1549 xfrm_policy_put_afinfo(afinfo
);
1554 static struct flow_cache_object
*xfrm_bundle_flo_get(struct flow_cache_object
*flo
)
1556 struct xfrm_dst
*xdst
= container_of(flo
, struct xfrm_dst
, flo
);
1557 struct dst_entry
*dst
= &xdst
->u
.dst
;
1559 if (xdst
->route
== NULL
) {
1560 /* Dummy bundle - if it has xfrms we were not
1561 * able to build bundle as template resolution failed.
1562 * It means we need to try again resolving. */
1563 if (xdst
->num_xfrms
> 0)
1565 } else if (dst
->flags
& DST_XFRM_QUEUE
) {
1569 if (stale_bundle(dst
))
1577 static int xfrm_bundle_flo_check(struct flow_cache_object
*flo
)
1579 struct xfrm_dst
*xdst
= container_of(flo
, struct xfrm_dst
, flo
);
1580 struct dst_entry
*dst
= &xdst
->u
.dst
;
1584 if (stale_bundle(dst
))
1590 static void xfrm_bundle_flo_delete(struct flow_cache_object
*flo
)
1592 struct xfrm_dst
*xdst
= container_of(flo
, struct xfrm_dst
, flo
);
1593 struct dst_entry
*dst
= &xdst
->u
.dst
;
1598 static const struct flow_cache_ops xfrm_bundle_fc_ops
= {
1599 .get
= xfrm_bundle_flo_get
,
1600 .check
= xfrm_bundle_flo_check
,
1601 .delete = xfrm_bundle_flo_delete
,
1604 static inline struct xfrm_dst
*xfrm_alloc_dst(struct net
*net
, int family
)
1606 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
1607 struct dst_ops
*dst_ops
;
1608 struct xfrm_dst
*xdst
;
1611 return ERR_PTR(-EINVAL
);
1615 dst_ops
= &net
->xfrm
.xfrm4_dst_ops
;
1617 #if IS_ENABLED(CONFIG_IPV6)
1619 dst_ops
= &net
->xfrm
.xfrm6_dst_ops
;
1625 xdst
= dst_alloc(dst_ops
, NULL
, 0, DST_OBSOLETE_NONE
, 0);
1628 struct dst_entry
*dst
= &xdst
->u
.dst
;
1630 memset(dst
+ 1, 0, sizeof(*xdst
) - sizeof(*dst
));
1631 xdst
->flo
.ops
= &xfrm_bundle_fc_ops
;
1633 xdst
= ERR_PTR(-ENOBUFS
);
1635 xfrm_policy_put_afinfo(afinfo
);
1640 static inline int xfrm_init_path(struct xfrm_dst
*path
, struct dst_entry
*dst
,
1643 struct xfrm_policy_afinfo
*afinfo
=
1644 xfrm_policy_get_afinfo(dst
->ops
->family
);
1650 err
= afinfo
->init_path(path
, dst
, nfheader_len
);
1652 xfrm_policy_put_afinfo(afinfo
);
1657 static inline int xfrm_fill_dst(struct xfrm_dst
*xdst
, struct net_device
*dev
,
1658 const struct flowi
*fl
)
1660 struct xfrm_policy_afinfo
*afinfo
=
1661 xfrm_policy_get_afinfo(xdst
->u
.dst
.ops
->family
);
1667 err
= afinfo
->fill_dst(xdst
, dev
, fl
);
1669 xfrm_policy_put_afinfo(afinfo
);
1675 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
1676 * all the metrics... Shortly, bundle a bundle.
1679 static struct dst_entry
*xfrm_bundle_create(struct xfrm_policy
*policy
,
1680 struct xfrm_state
**xfrm
, int nx
,
1681 const struct flowi
*fl
,
1682 struct dst_entry
*dst
)
1684 struct net
*net
= xp_net(policy
);
1685 unsigned long now
= jiffies
;
1686 struct net_device
*dev
;
1687 struct xfrm_mode
*inner_mode
;
1688 struct dst_entry
*dst_prev
= NULL
;
1689 struct dst_entry
*dst0
= NULL
;
1693 int nfheader_len
= 0;
1694 int trailer_len
= 0;
1696 int family
= policy
->selector
.family
;
1697 xfrm_address_t saddr
, daddr
;
1699 xfrm_flowi_addr_get(fl
, &saddr
, &daddr
, family
);
1701 tos
= xfrm_get_tos(fl
, family
);
1705 for (; i
< nx
; i
++) {
1706 struct xfrm_dst
*xdst
= xfrm_alloc_dst(net
, family
);
1707 struct dst_entry
*dst1
= &xdst
->u
.dst
;
1709 err
= PTR_ERR(xdst
);
1715 if (xfrm
[i
]->sel
.family
== AF_UNSPEC
) {
1716 inner_mode
= xfrm_ip2inner_mode(xfrm
[i
],
1717 xfrm_af2proto(family
));
1719 err
= -EAFNOSUPPORT
;
1724 inner_mode
= xfrm
[i
]->inner_mode
;
1729 dst_prev
->child
= dst_clone(dst1
);
1730 dst1
->flags
|= DST_NOHASH
;
1734 dst_copy_metrics(dst1
, dst
);
1736 if (xfrm
[i
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
1737 family
= xfrm
[i
]->props
.family
;
1738 dst
= xfrm_dst_lookup(xfrm
[i
], tos
, fl
->flowi_oif
,
1739 &saddr
, &daddr
, family
);
1746 dst1
->xfrm
= xfrm
[i
];
1747 xdst
->xfrm_genid
= xfrm
[i
]->genid
;
1749 dst1
->obsolete
= DST_OBSOLETE_FORCE_CHK
;
1750 dst1
->flags
|= DST_HOST
;
1751 dst1
->lastuse
= now
;
1753 dst1
->input
= dst_discard
;
1754 dst1
->output
= inner_mode
->afinfo
->output
;
1756 dst1
->next
= dst_prev
;
1759 header_len
+= xfrm
[i
]->props
.header_len
;
1760 if (xfrm
[i
]->type
->flags
& XFRM_TYPE_NON_FRAGMENT
)
1761 nfheader_len
+= xfrm
[i
]->props
.header_len
;
1762 trailer_len
+= xfrm
[i
]->props
.trailer_len
;
1765 dst_prev
->child
= dst
;
1773 xfrm_init_path((struct xfrm_dst
*)dst0
, dst
, nfheader_len
);
1774 xfrm_init_pmtu(dst_prev
);
1776 for (dst_prev
= dst0
; dst_prev
!= dst
; dst_prev
= dst_prev
->child
) {
1777 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst_prev
;
1779 err
= xfrm_fill_dst(xdst
, dev
, fl
);
1783 dst_prev
->header_len
= header_len
;
1784 dst_prev
->trailer_len
= trailer_len
;
1785 header_len
-= xdst
->u
.dst
.xfrm
->props
.header_len
;
1786 trailer_len
-= xdst
->u
.dst
.xfrm
->props
.trailer_len
;
1794 xfrm_state_put(xfrm
[i
]);
1798 dst0
= ERR_PTR(err
);
1802 #ifdef CONFIG_XFRM_SUB_POLICY
1803 static int xfrm_dst_alloc_copy(void **target
, const void *src
, int size
)
1806 *target
= kmalloc(size
, GFP_ATOMIC
);
1811 memcpy(*target
, src
, size
);
1816 static int xfrm_dst_update_parent(struct dst_entry
*dst
,
1817 const struct xfrm_selector
*sel
)
1819 #ifdef CONFIG_XFRM_SUB_POLICY
1820 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
1821 return xfrm_dst_alloc_copy((void **)&(xdst
->partner
),
1828 static int xfrm_dst_update_origin(struct dst_entry
*dst
,
1829 const struct flowi
*fl
)
1831 #ifdef CONFIG_XFRM_SUB_POLICY
1832 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
1833 return xfrm_dst_alloc_copy((void **)&(xdst
->origin
), fl
, sizeof(*fl
));
1839 static int xfrm_expand_policies(const struct flowi
*fl
, u16 family
,
1840 struct xfrm_policy
**pols
,
1841 int *num_pols
, int *num_xfrms
)
1845 if (*num_pols
== 0 || !pols
[0]) {
1850 if (IS_ERR(pols
[0]))
1851 return PTR_ERR(pols
[0]);
1853 *num_xfrms
= pols
[0]->xfrm_nr
;
1855 #ifdef CONFIG_XFRM_SUB_POLICY
1856 if (pols
[0] && pols
[0]->action
== XFRM_POLICY_ALLOW
&&
1857 pols
[0]->type
!= XFRM_POLICY_TYPE_MAIN
) {
1858 pols
[1] = xfrm_policy_lookup_bytype(xp_net(pols
[0]),
1859 XFRM_POLICY_TYPE_MAIN
,
1863 if (IS_ERR(pols
[1])) {
1864 xfrm_pols_put(pols
, *num_pols
);
1865 return PTR_ERR(pols
[1]);
1868 (*num_xfrms
) += pols
[1]->xfrm_nr
;
1872 for (i
= 0; i
< *num_pols
; i
++) {
1873 if (pols
[i
]->action
!= XFRM_POLICY_ALLOW
) {
1883 static struct xfrm_dst
*
1884 xfrm_resolve_and_create_bundle(struct xfrm_policy
**pols
, int num_pols
,
1885 const struct flowi
*fl
, u16 family
,
1886 struct dst_entry
*dst_orig
)
1888 struct net
*net
= xp_net(pols
[0]);
1889 struct xfrm_state
*xfrm
[XFRM_MAX_DEPTH
];
1890 struct dst_entry
*dst
;
1891 struct xfrm_dst
*xdst
;
1894 /* Try to instantiate a bundle */
1895 err
= xfrm_tmpl_resolve(pols
, num_pols
, fl
, xfrm
, family
);
1897 if (err
!= 0 && err
!= -EAGAIN
)
1898 XFRM_INC_STATS(net
, LINUX_MIB_XFRMOUTPOLERROR
);
1899 return ERR_PTR(err
);
1902 dst
= xfrm_bundle_create(pols
[0], xfrm
, err
, fl
, dst_orig
);
1904 XFRM_INC_STATS(net
, LINUX_MIB_XFRMOUTBUNDLEGENERROR
);
1905 return ERR_CAST(dst
);
1908 xdst
= (struct xfrm_dst
*)dst
;
1909 xdst
->num_xfrms
= err
;
1911 err
= xfrm_dst_update_parent(dst
, &pols
[1]->selector
);
1913 err
= xfrm_dst_update_origin(dst
, fl
);
1914 if (unlikely(err
)) {
1916 XFRM_INC_STATS(net
, LINUX_MIB_XFRMOUTBUNDLECHECKERROR
);
1917 return ERR_PTR(err
);
1920 xdst
->num_pols
= num_pols
;
1921 memcpy(xdst
->pols
, pols
, sizeof(struct xfrm_policy
*) * num_pols
);
1922 xdst
->policy_genid
= atomic_read(&pols
[0]->genid
);
1927 static void xfrm_policy_queue_process(unsigned long arg
)
1929 struct sk_buff
*skb
;
1931 struct dst_entry
*dst
;
1932 struct xfrm_policy
*pol
= (struct xfrm_policy
*)arg
;
1933 struct net
*net
= xp_net(pol
);
1934 struct xfrm_policy_queue
*pq
= &pol
->polq
;
1936 struct sk_buff_head list
;
1938 spin_lock(&pq
->hold_queue
.lock
);
1939 skb
= skb_peek(&pq
->hold_queue
);
1941 spin_unlock(&pq
->hold_queue
.lock
);
1946 xfrm_decode_session(skb
, &fl
, dst
->ops
->family
);
1947 spin_unlock(&pq
->hold_queue
.lock
);
1949 dst_hold(dst
->path
);
1950 dst
= xfrm_lookup(net
, dst
->path
, &fl
, sk
, 0);
1954 if (dst
->flags
& DST_XFRM_QUEUE
) {
1957 if (pq
->timeout
>= XFRM_QUEUE_TMO_MAX
)
1960 pq
->timeout
= pq
->timeout
<< 1;
1961 if (!mod_timer(&pq
->hold_timer
, jiffies
+ pq
->timeout
))
1968 __skb_queue_head_init(&list
);
1970 spin_lock(&pq
->hold_queue
.lock
);
1972 skb_queue_splice_init(&pq
->hold_queue
, &list
);
1973 spin_unlock(&pq
->hold_queue
.lock
);
1975 while (!skb_queue_empty(&list
)) {
1976 skb
= __skb_dequeue(&list
);
1978 xfrm_decode_session(skb
, &fl
, skb_dst(skb
)->ops
->family
);
1979 dst_hold(skb_dst(skb
)->path
);
1980 dst
= xfrm_lookup(net
, skb_dst(skb
)->path
, &fl
, skb
->sk
, 0);
1988 skb_dst_set(skb
, dst
);
1990 dst_output(net
, skb
->sk
, skb
);
1999 skb_queue_purge(&pq
->hold_queue
);
2003 static int xdst_queue_output(struct net
*net
, struct sock
*sk
, struct sk_buff
*skb
)
2005 unsigned long sched_next
;
2006 struct dst_entry
*dst
= skb_dst(skb
);
2007 struct xfrm_dst
*xdst
= (struct xfrm_dst
*) dst
;
2008 struct xfrm_policy
*pol
= xdst
->pols
[0];
2009 struct xfrm_policy_queue
*pq
= &pol
->polq
;
2011 if (unlikely(skb_fclone_busy(sk
, skb
))) {
2016 if (pq
->hold_queue
.qlen
> XFRM_MAX_QUEUE_LEN
) {
2023 spin_lock_bh(&pq
->hold_queue
.lock
);
2026 pq
->timeout
= XFRM_QUEUE_TMO_MIN
;
2028 sched_next
= jiffies
+ pq
->timeout
;
2030 if (del_timer(&pq
->hold_timer
)) {
2031 if (time_before(pq
->hold_timer
.expires
, sched_next
))
2032 sched_next
= pq
->hold_timer
.expires
;
2036 __skb_queue_tail(&pq
->hold_queue
, skb
);
2037 if (!mod_timer(&pq
->hold_timer
, sched_next
))
2040 spin_unlock_bh(&pq
->hold_queue
.lock
);
2045 static struct xfrm_dst
*xfrm_create_dummy_bundle(struct net
*net
,
2046 struct xfrm_flo
*xflo
,
2047 const struct flowi
*fl
,
2052 struct net_device
*dev
;
2053 struct dst_entry
*dst
;
2054 struct dst_entry
*dst1
;
2055 struct xfrm_dst
*xdst
;
2057 xdst
= xfrm_alloc_dst(net
, family
);
2061 if (!(xflo
->flags
& XFRM_LOOKUP_QUEUE
) ||
2062 net
->xfrm
.sysctl_larval_drop
||
2066 dst
= xflo
->dst_orig
;
2067 dst1
= &xdst
->u
.dst
;
2071 dst_copy_metrics(dst1
, dst
);
2073 dst1
->obsolete
= DST_OBSOLETE_FORCE_CHK
;
2074 dst1
->flags
|= DST_HOST
| DST_XFRM_QUEUE
;
2075 dst1
->lastuse
= jiffies
;
2077 dst1
->input
= dst_discard
;
2078 dst1
->output
= xdst_queue_output
;
2084 xfrm_init_path((struct xfrm_dst
*)dst1
, dst
, 0);
2091 err
= xfrm_fill_dst(xdst
, dev
, fl
);
2100 xdst
= ERR_PTR(err
);
2104 static struct flow_cache_object
*
2105 xfrm_bundle_lookup(struct net
*net
, const struct flowi
*fl
, u16 family
, u8 dir
,
2106 struct flow_cache_object
*oldflo
, void *ctx
)
2108 struct xfrm_flo
*xflo
= (struct xfrm_flo
*)ctx
;
2109 struct xfrm_policy
*pols
[XFRM_POLICY_TYPE_MAX
];
2110 struct xfrm_dst
*xdst
, *new_xdst
;
2111 int num_pols
= 0, num_xfrms
= 0, i
, err
, pol_dead
;
2113 /* Check if the policies from old bundle are usable */
2116 xdst
= container_of(oldflo
, struct xfrm_dst
, flo
);
2117 num_pols
= xdst
->num_pols
;
2118 num_xfrms
= xdst
->num_xfrms
;
2120 for (i
= 0; i
< num_pols
; i
++) {
2121 pols
[i
] = xdst
->pols
[i
];
2122 pol_dead
|= pols
[i
]->walk
.dead
;
2125 dst_free(&xdst
->u
.dst
);
2133 /* Resolve policies to use if we couldn't get them from
2134 * previous cache entry */
2137 pols
[0] = __xfrm_policy_lookup(net
, fl
, family
,
2138 flow_to_policy_dir(dir
));
2139 err
= xfrm_expand_policies(fl
, family
, pols
,
2140 &num_pols
, &num_xfrms
);
2146 goto make_dummy_bundle
;
2149 new_xdst
= xfrm_resolve_and_create_bundle(pols
, num_pols
, fl
, family
,
2151 if (IS_ERR(new_xdst
)) {
2152 err
= PTR_ERR(new_xdst
);
2156 goto make_dummy_bundle
;
2157 dst_hold(&xdst
->u
.dst
);
2159 } else if (new_xdst
== NULL
) {
2162 goto make_dummy_bundle
;
2163 xdst
->num_xfrms
= 0;
2164 dst_hold(&xdst
->u
.dst
);
2168 /* Kill the previous bundle */
2170 /* The policies were stolen for newly generated bundle */
2172 dst_free(&xdst
->u
.dst
);
2175 /* Flow cache does not have reference, it dst_free()'s,
2176 * but we do need to return one reference for original caller */
2177 dst_hold(&new_xdst
->u
.dst
);
2178 return &new_xdst
->flo
;
2181 /* We found policies, but there's no bundles to instantiate:
2182 * either because the policy blocks, has no transformations or
2183 * we could not build template (no xfrm_states).*/
2184 xdst
= xfrm_create_dummy_bundle(net
, xflo
, fl
, num_xfrms
, family
);
2186 xfrm_pols_put(pols
, num_pols
);
2187 return ERR_CAST(xdst
);
2189 xdst
->num_pols
= num_pols
;
2190 xdst
->num_xfrms
= num_xfrms
;
2191 memcpy(xdst
->pols
, pols
, sizeof(struct xfrm_policy
*) * num_pols
);
2193 dst_hold(&xdst
->u
.dst
);
2197 XFRM_INC_STATS(net
, LINUX_MIB_XFRMOUTPOLERROR
);
2200 dst_free(&xdst
->u
.dst
);
2202 xfrm_pols_put(pols
, num_pols
);
2203 return ERR_PTR(err
);
2206 static struct dst_entry
*make_blackhole(struct net
*net
, u16 family
,
2207 struct dst_entry
*dst_orig
)
2209 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
2210 struct dst_entry
*ret
;
2213 dst_release(dst_orig
);
2214 return ERR_PTR(-EINVAL
);
2216 ret
= afinfo
->blackhole_route(net
, dst_orig
);
2218 xfrm_policy_put_afinfo(afinfo
);
2223 /* Main function: finds/creates a bundle for given flow.
2225 * At the moment we eat a raw IP route. Mostly to speed up lookups
2226 * on interfaces with disabled IPsec.
2228 struct dst_entry
*xfrm_lookup(struct net
*net
, struct dst_entry
*dst_orig
,
2229 const struct flowi
*fl
,
2230 const struct sock
*sk
, int flags
)
2232 struct xfrm_policy
*pols
[XFRM_POLICY_TYPE_MAX
];
2233 struct flow_cache_object
*flo
;
2234 struct xfrm_dst
*xdst
;
2235 struct dst_entry
*dst
, *route
;
2236 u16 family
= dst_orig
->ops
->family
;
2237 u8 dir
= policy_to_flow_dir(XFRM_POLICY_OUT
);
2238 int i
, err
, num_pols
, num_xfrms
= 0, drop_pols
= 0;
2244 sk
= sk_const_to_full_sk(sk
);
2245 if (sk
&& sk
->sk_policy
[XFRM_POLICY_OUT
]) {
2247 pols
[0] = xfrm_sk_policy_lookup(sk
, XFRM_POLICY_OUT
, fl
);
2248 err
= xfrm_expand_policies(fl
, family
, pols
,
2249 &num_pols
, &num_xfrms
);
2254 if (num_xfrms
<= 0) {
2255 drop_pols
= num_pols
;
2259 xdst
= xfrm_resolve_and_create_bundle(
2263 xfrm_pols_put(pols
, num_pols
);
2264 err
= PTR_ERR(xdst
);
2266 } else if (xdst
== NULL
) {
2268 drop_pols
= num_pols
;
2272 dst_hold(&xdst
->u
.dst
);
2273 xdst
->u
.dst
.flags
|= DST_NOCACHE
;
2274 route
= xdst
->route
;
2279 struct xfrm_flo xflo
;
2281 xflo
.dst_orig
= dst_orig
;
2284 /* To accelerate a bit... */
2285 if ((dst_orig
->flags
& DST_NOXFRM
) ||
2286 !net
->xfrm
.policy_count
[XFRM_POLICY_OUT
])
2289 flo
= flow_cache_lookup(net
, fl
, family
, dir
,
2290 xfrm_bundle_lookup
, &xflo
);
2297 xdst
= container_of(flo
, struct xfrm_dst
, flo
);
2299 num_pols
= xdst
->num_pols
;
2300 num_xfrms
= xdst
->num_xfrms
;
2301 memcpy(pols
, xdst
->pols
, sizeof(struct xfrm_policy
*) * num_pols
);
2302 route
= xdst
->route
;
2306 if (route
== NULL
&& num_xfrms
> 0) {
2307 /* The only case when xfrm_bundle_lookup() returns a
2308 * bundle with null route, is when the template could
2309 * not be resolved. It means policies are there, but
2310 * bundle could not be created, since we don't yet
2311 * have the xfrm_state's. We need to wait for KM to
2312 * negotiate new SA's or bail out with error.*/
2313 if (net
->xfrm
.sysctl_larval_drop
) {
2314 XFRM_INC_STATS(net
, LINUX_MIB_XFRMOUTNOSTATES
);
2321 XFRM_INC_STATS(net
, LINUX_MIB_XFRMOUTNOSTATES
);
2329 if ((flags
& XFRM_LOOKUP_ICMP
) &&
2330 !(pols
[0]->flags
& XFRM_POLICY_ICMP
)) {
2335 for (i
= 0; i
< num_pols
; i
++)
2336 pols
[i
]->curlft
.use_time
= get_seconds();
2338 if (num_xfrms
< 0) {
2339 /* Prohibit the flow */
2340 XFRM_INC_STATS(net
, LINUX_MIB_XFRMOUTPOLBLOCK
);
2343 } else if (num_xfrms
> 0) {
2344 /* Flow transformed */
2345 dst_release(dst_orig
);
2347 /* Flow passes untransformed */
2352 xfrm_pols_put(pols
, drop_pols
);
2353 if (dst
&& dst
->xfrm
&&
2354 dst
->xfrm
->props
.mode
== XFRM_MODE_TUNNEL
)
2355 dst
->flags
|= DST_XFRM_TUNNEL
;
2359 if (!(flags
& XFRM_LOOKUP_ICMP
)) {
2367 if (!(flags
& XFRM_LOOKUP_KEEP_DST_REF
))
2368 dst_release(dst_orig
);
2369 xfrm_pols_put(pols
, drop_pols
);
2370 return ERR_PTR(err
);
2372 EXPORT_SYMBOL(xfrm_lookup
);
2374 /* Callers of xfrm_lookup_route() must ensure a call to dst_output().
2375 * Otherwise we may send out blackholed packets.
2377 struct dst_entry
*xfrm_lookup_route(struct net
*net
, struct dst_entry
*dst_orig
,
2378 const struct flowi
*fl
,
2379 const struct sock
*sk
, int flags
)
2381 struct dst_entry
*dst
= xfrm_lookup(net
, dst_orig
, fl
, sk
,
2382 flags
| XFRM_LOOKUP_QUEUE
|
2383 XFRM_LOOKUP_KEEP_DST_REF
);
2385 if (IS_ERR(dst
) && PTR_ERR(dst
) == -EREMOTE
)
2386 return make_blackhole(net
, dst_orig
->ops
->family
, dst_orig
);
2390 EXPORT_SYMBOL(xfrm_lookup_route
);
2393 xfrm_secpath_reject(int idx
, struct sk_buff
*skb
, const struct flowi
*fl
)
2395 struct xfrm_state
*x
;
2397 if (!skb
->sp
|| idx
< 0 || idx
>= skb
->sp
->len
)
2399 x
= skb
->sp
->xvec
[idx
];
2400 if (!x
->type
->reject
)
2402 return x
->type
->reject(x
, skb
, fl
);
2405 /* When skb is transformed back to its "native" form, we have to
2406 * check policy restrictions. At the moment we make this in maximally
2407 * stupid way. Shame on me. :-) Of course, connected sockets must
2408 * have policy cached at them.
2412 xfrm_state_ok(const struct xfrm_tmpl
*tmpl
, const struct xfrm_state
*x
,
2413 unsigned short family
)
2415 if (xfrm_state_kern(x
))
2416 return tmpl
->optional
&& !xfrm_state_addr_cmp(tmpl
, x
, tmpl
->encap_family
);
2417 return x
->id
.proto
== tmpl
->id
.proto
&&
2418 (x
->id
.spi
== tmpl
->id
.spi
|| !tmpl
->id
.spi
) &&
2419 (x
->props
.reqid
== tmpl
->reqid
|| !tmpl
->reqid
) &&
2420 x
->props
.mode
== tmpl
->mode
&&
2421 (tmpl
->allalgs
|| (tmpl
->aalgos
& (1<<x
->props
.aalgo
)) ||
2422 !(xfrm_id_proto_match(tmpl
->id
.proto
, IPSEC_PROTO_ANY
))) &&
2423 !(x
->props
.mode
!= XFRM_MODE_TRANSPORT
&&
2424 xfrm_state_addr_cmp(tmpl
, x
, family
));
2428 * 0 or more than 0 is returned when validation is succeeded (either bypass
2429 * because of optional transport mode, or next index of the mathced secpath
2430 * state with the template.
2431 * -1 is returned when no matching template is found.
2432 * Otherwise "-2 - errored_index" is returned.
2435 xfrm_policy_ok(const struct xfrm_tmpl
*tmpl
, const struct sec_path
*sp
, int start
,
2436 unsigned short family
)
2440 if (tmpl
->optional
) {
2441 if (tmpl
->mode
== XFRM_MODE_TRANSPORT
)
2445 for (; idx
< sp
->len
; idx
++) {
2446 if (xfrm_state_ok(tmpl
, sp
->xvec
[idx
], family
))
2448 if (sp
->xvec
[idx
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
2457 int __xfrm_decode_session(struct sk_buff
*skb
, struct flowi
*fl
,
2458 unsigned int family
, int reverse
)
2460 struct xfrm_policy_afinfo
*afinfo
= xfrm_policy_get_afinfo(family
);
2463 if (unlikely(afinfo
== NULL
))
2464 return -EAFNOSUPPORT
;
2466 afinfo
->decode_session(skb
, fl
, reverse
);
2467 err
= security_xfrm_decode_session(skb
, &fl
->flowi_secid
);
2468 xfrm_policy_put_afinfo(afinfo
);
2471 EXPORT_SYMBOL(__xfrm_decode_session
);
2473 static inline int secpath_has_nontransport(const struct sec_path
*sp
, int k
, int *idxp
)
2475 for (; k
< sp
->len
; k
++) {
2476 if (sp
->xvec
[k
]->props
.mode
!= XFRM_MODE_TRANSPORT
) {
2485 int __xfrm_policy_check(struct sock
*sk
, int dir
, struct sk_buff
*skb
,
2486 unsigned short family
)
2488 struct net
*net
= dev_net(skb
->dev
);
2489 struct xfrm_policy
*pol
;
2490 struct xfrm_policy
*pols
[XFRM_POLICY_TYPE_MAX
];
2499 reverse
= dir
& ~XFRM_POLICY_MASK
;
2500 dir
&= XFRM_POLICY_MASK
;
2501 fl_dir
= policy_to_flow_dir(dir
);
2503 if (__xfrm_decode_session(skb
, &fl
, family
, reverse
) < 0) {
2504 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINHDRERROR
);
2508 nf_nat_decode_session(skb
, &fl
, family
);
2510 /* First, check used SA against their selectors. */
2514 for (i
= skb
->sp
->len
-1; i
>= 0; i
--) {
2515 struct xfrm_state
*x
= skb
->sp
->xvec
[i
];
2516 if (!xfrm_selector_match(&x
->sel
, &fl
, family
)) {
2517 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINSTATEMISMATCH
);
2524 sk
= sk_to_full_sk(sk
);
2525 if (sk
&& sk
->sk_policy
[dir
]) {
2526 pol
= xfrm_sk_policy_lookup(sk
, dir
, &fl
);
2528 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINPOLERROR
);
2534 struct flow_cache_object
*flo
;
2536 flo
= flow_cache_lookup(net
, &fl
, family
, fl_dir
,
2537 xfrm_policy_lookup
, NULL
);
2538 if (IS_ERR_OR_NULL(flo
))
2539 pol
= ERR_CAST(flo
);
2541 pol
= container_of(flo
, struct xfrm_policy
, flo
);
2545 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINPOLERROR
);
2550 if (skb
->sp
&& secpath_has_nontransport(skb
->sp
, 0, &xerr_idx
)) {
2551 xfrm_secpath_reject(xerr_idx
, skb
, &fl
);
2552 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINNOPOLS
);
2558 pol
->curlft
.use_time
= get_seconds();
2562 #ifdef CONFIG_XFRM_SUB_POLICY
2563 if (pols
[0]->type
!= XFRM_POLICY_TYPE_MAIN
) {
2564 pols
[1] = xfrm_policy_lookup_bytype(net
, XFRM_POLICY_TYPE_MAIN
,
2568 if (IS_ERR(pols
[1])) {
2569 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINPOLERROR
);
2572 pols
[1]->curlft
.use_time
= get_seconds();
2578 if (pol
->action
== XFRM_POLICY_ALLOW
) {
2579 struct sec_path
*sp
;
2580 static struct sec_path dummy
;
2581 struct xfrm_tmpl
*tp
[XFRM_MAX_DEPTH
];
2582 struct xfrm_tmpl
*stp
[XFRM_MAX_DEPTH
];
2583 struct xfrm_tmpl
**tpp
= tp
;
2587 if ((sp
= skb
->sp
) == NULL
)
2590 for (pi
= 0; pi
< npols
; pi
++) {
2591 if (pols
[pi
] != pol
&&
2592 pols
[pi
]->action
!= XFRM_POLICY_ALLOW
) {
2593 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINPOLBLOCK
);
2596 if (ti
+ pols
[pi
]->xfrm_nr
>= XFRM_MAX_DEPTH
) {
2597 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINBUFFERERROR
);
2600 for (i
= 0; i
< pols
[pi
]->xfrm_nr
; i
++)
2601 tpp
[ti
++] = &pols
[pi
]->xfrm_vec
[i
];
2605 xfrm_tmpl_sort(stp
, tpp
, xfrm_nr
, family
, net
);
2609 /* For each tunnel xfrm, find the first matching tmpl.
2610 * For each tmpl before that, find corresponding xfrm.
2611 * Order is _important_. Later we will implement
2612 * some barriers, but at the moment barriers
2613 * are implied between each two transformations.
2615 for (i
= xfrm_nr
-1, k
= 0; i
>= 0; i
--) {
2616 k
= xfrm_policy_ok(tpp
[i
], sp
, k
, family
);
2619 /* "-2 - errored_index" returned */
2621 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINTMPLMISMATCH
);
2626 if (secpath_has_nontransport(sp
, k
, &xerr_idx
)) {
2627 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINTMPLMISMATCH
);
2631 xfrm_pols_put(pols
, npols
);
2634 XFRM_INC_STATS(net
, LINUX_MIB_XFRMINPOLBLOCK
);
2637 xfrm_secpath_reject(xerr_idx
, skb
, &fl
);
2639 xfrm_pols_put(pols
, npols
);
2642 EXPORT_SYMBOL(__xfrm_policy_check
);
2644 int __xfrm_route_forward(struct sk_buff
*skb
, unsigned short family
)
2646 struct net
*net
= dev_net(skb
->dev
);
2648 struct dst_entry
*dst
;
2651 if (xfrm_decode_session(skb
, &fl
, family
) < 0) {
2652 XFRM_INC_STATS(net
, LINUX_MIB_XFRMFWDHDRERROR
);
2658 dst
= xfrm_lookup(net
, skb_dst(skb
), &fl
, NULL
, XFRM_LOOKUP_QUEUE
);
2663 skb_dst_set(skb
, dst
);
2666 EXPORT_SYMBOL(__xfrm_route_forward
);
2668 /* Optimize later using cookies and generation ids. */
2670 static struct dst_entry
*xfrm_dst_check(struct dst_entry
*dst
, u32 cookie
)
2672 /* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
2673 * to DST_OBSOLETE_FORCE_CHK to force all XFRM destinations to
2674 * get validated by dst_ops->check on every use. We do this
2675 * because when a normal route referenced by an XFRM dst is
2676 * obsoleted we do not go looking around for all parent
2677 * referencing XFRM dsts so that we can invalidate them. It
2678 * is just too much work. Instead we make the checks here on
2679 * every use. For example:
2681 * XFRM dst A --> IPv4 dst X
2683 * X is the "xdst->route" of A (X is also the "dst->path" of A
2684 * in this example). If X is marked obsolete, "A" will not
2685 * notice. That's what we are validating here via the
2686 * stale_bundle() check.
2688 * When a policy's bundle is pruned, we dst_free() the XFRM
2689 * dst which causes it's ->obsolete field to be set to
2690 * DST_OBSOLETE_DEAD. If an XFRM dst has been pruned like
2691 * this, we want to force a new route lookup.
2693 if (dst
->obsolete
< 0 && !stale_bundle(dst
))
2699 static int stale_bundle(struct dst_entry
*dst
)
2701 return !xfrm_bundle_ok((struct xfrm_dst
*)dst
);
2704 void xfrm_dst_ifdown(struct dst_entry
*dst
, struct net_device
*dev
)
2706 while ((dst
= dst
->child
) && dst
->xfrm
&& dst
->dev
== dev
) {
2707 dst
->dev
= dev_net(dev
)->loopback_dev
;
2712 EXPORT_SYMBOL(xfrm_dst_ifdown
);
2714 static void xfrm_link_failure(struct sk_buff
*skb
)
2716 /* Impossible. Such dst must be popped before reaches point of failure. */
2719 static struct dst_entry
*xfrm_negative_advice(struct dst_entry
*dst
)
2722 if (dst
->obsolete
) {
2730 void xfrm_garbage_collect(struct net
*net
)
2732 flow_cache_flush(net
);
2734 EXPORT_SYMBOL(xfrm_garbage_collect
);
2736 void xfrm_garbage_collect_deferred(struct net
*net
)
2738 flow_cache_flush_deferred(net
);
2740 EXPORT_SYMBOL(xfrm_garbage_collect_deferred
);
2742 static void xfrm_init_pmtu(struct dst_entry
*dst
)
2745 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
2746 u32 pmtu
, route_mtu_cached
;
2748 pmtu
= dst_mtu(dst
->child
);
2749 xdst
->child_mtu_cached
= pmtu
;
2751 pmtu
= xfrm_state_mtu(dst
->xfrm
, pmtu
);
2753 route_mtu_cached
= dst_mtu(xdst
->route
);
2754 xdst
->route_mtu_cached
= route_mtu_cached
;
2756 if (pmtu
> route_mtu_cached
)
2757 pmtu
= route_mtu_cached
;
2759 dst_metric_set(dst
, RTAX_MTU
, pmtu
);
2760 } while ((dst
= dst
->next
));
2763 /* Check that the bundle accepts the flow and its components are
2767 static int xfrm_bundle_ok(struct xfrm_dst
*first
)
2769 struct dst_entry
*dst
= &first
->u
.dst
;
2770 struct xfrm_dst
*last
;
2773 if (!dst_check(dst
->path
, ((struct xfrm_dst
*)dst
)->path_cookie
) ||
2774 (dst
->dev
&& !netif_running(dst
->dev
)))
2777 if (dst
->flags
& DST_XFRM_QUEUE
)
2783 struct xfrm_dst
*xdst
= (struct xfrm_dst
*)dst
;
2785 if (dst
->xfrm
->km
.state
!= XFRM_STATE_VALID
)
2787 if (xdst
->xfrm_genid
!= dst
->xfrm
->genid
)
2789 if (xdst
->num_pols
> 0 &&
2790 xdst
->policy_genid
!= atomic_read(&xdst
->pols
[0]->genid
))
2793 mtu
= dst_mtu(dst
->child
);
2794 if (xdst
->child_mtu_cached
!= mtu
) {
2796 xdst
->child_mtu_cached
= mtu
;
2799 if (!dst_check(xdst
->route
, xdst
->route_cookie
))
2801 mtu
= dst_mtu(xdst
->route
);
2802 if (xdst
->route_mtu_cached
!= mtu
) {
2804 xdst
->route_mtu_cached
= mtu
;
2808 } while (dst
->xfrm
);
2813 mtu
= last
->child_mtu_cached
;
2817 mtu
= xfrm_state_mtu(dst
->xfrm
, mtu
);
2818 if (mtu
> last
->route_mtu_cached
)
2819 mtu
= last
->route_mtu_cached
;
2820 dst_metric_set(dst
, RTAX_MTU
, mtu
);
2825 last
= (struct xfrm_dst
*)last
->u
.dst
.next
;
2826 last
->child_mtu_cached
= mtu
;
2832 static unsigned int xfrm_default_advmss(const struct dst_entry
*dst
)
2834 return dst_metric_advmss(dst
->path
);
2837 static unsigned int xfrm_mtu(const struct dst_entry
*dst
)
2839 unsigned int mtu
= dst_metric_raw(dst
, RTAX_MTU
);
2841 return mtu
? : dst_mtu(dst
->path
);
2844 static struct neighbour
*xfrm_neigh_lookup(const struct dst_entry
*dst
,
2845 struct sk_buff
*skb
,
2848 return dst
->path
->ops
->neigh_lookup(dst
, skb
, daddr
);
2851 int xfrm_policy_register_afinfo(const struct xfrm_policy_afinfo
*afinfo
, int family
)
2855 if (WARN_ON(family
>= ARRAY_SIZE(xfrm_policy_afinfo
)))
2856 return -EAFNOSUPPORT
;
2858 spin_lock(&xfrm_policy_afinfo_lock
);
2859 if (unlikely(xfrm_policy_afinfo
[family
] != NULL
))
2862 struct dst_ops
*dst_ops
= afinfo
->dst_ops
;
2863 if (likely(dst_ops
->kmem_cachep
== NULL
))
2864 dst_ops
->kmem_cachep
= xfrm_dst_cache
;
2865 if (likely(dst_ops
->check
== NULL
))
2866 dst_ops
->check
= xfrm_dst_check
;
2867 if (likely(dst_ops
->default_advmss
== NULL
))
2868 dst_ops
->default_advmss
= xfrm_default_advmss
;
2869 if (likely(dst_ops
->mtu
== NULL
))
2870 dst_ops
->mtu
= xfrm_mtu
;
2871 if (likely(dst_ops
->negative_advice
== NULL
))
2872 dst_ops
->negative_advice
= xfrm_negative_advice
;
2873 if (likely(dst_ops
->link_failure
== NULL
))
2874 dst_ops
->link_failure
= xfrm_link_failure
;
2875 if (likely(dst_ops
->neigh_lookup
== NULL
))
2876 dst_ops
->neigh_lookup
= xfrm_neigh_lookup
;
2877 rcu_assign_pointer(xfrm_policy_afinfo
[family
], afinfo
);
2879 spin_unlock(&xfrm_policy_afinfo_lock
);
2883 EXPORT_SYMBOL(xfrm_policy_register_afinfo
);
2885 void xfrm_policy_unregister_afinfo(const struct xfrm_policy_afinfo
*afinfo
)
2887 struct dst_ops
*dst_ops
= afinfo
->dst_ops
;
2890 for (i
= 0; i
< ARRAY_SIZE(xfrm_policy_afinfo
); i
++) {
2891 if (xfrm_policy_afinfo
[i
] != afinfo
)
2893 RCU_INIT_POINTER(xfrm_policy_afinfo
[i
], NULL
);
2899 dst_ops
->kmem_cachep
= NULL
;
2900 dst_ops
->check
= NULL
;
2901 dst_ops
->negative_advice
= NULL
;
2902 dst_ops
->link_failure
= NULL
;
2904 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo
);
2906 static int xfrm_dev_event(struct notifier_block
*this, unsigned long event
, void *ptr
)
2908 struct net_device
*dev
= netdev_notifier_info_to_dev(ptr
);
2912 xfrm_garbage_collect(dev_net(dev
));
2917 static struct notifier_block xfrm_dev_notifier
= {
2918 .notifier_call
= xfrm_dev_event
,
2921 #ifdef CONFIG_XFRM_STATISTICS
2922 static int __net_init
xfrm_statistics_init(struct net
*net
)
2925 net
->mib
.xfrm_statistics
= alloc_percpu(struct linux_xfrm_mib
);
2926 if (!net
->mib
.xfrm_statistics
)
2928 rv
= xfrm_proc_init(net
);
2930 free_percpu(net
->mib
.xfrm_statistics
);
2934 static void xfrm_statistics_fini(struct net
*net
)
2936 xfrm_proc_fini(net
);
2937 free_percpu(net
->mib
.xfrm_statistics
);
2940 static int __net_init
xfrm_statistics_init(struct net
*net
)
2945 static void xfrm_statistics_fini(struct net
*net
)
2950 static int __net_init
xfrm_policy_init(struct net
*net
)
2952 unsigned int hmask
, sz
;
2955 if (net_eq(net
, &init_net
))
2956 xfrm_dst_cache
= kmem_cache_create("xfrm_dst_cache",
2957 sizeof(struct xfrm_dst
),
2958 0, SLAB_HWCACHE_ALIGN
|SLAB_PANIC
,
2962 sz
= (hmask
+1) * sizeof(struct hlist_head
);
2964 net
->xfrm
.policy_byidx
= xfrm_hash_alloc(sz
);
2965 if (!net
->xfrm
.policy_byidx
)
2967 net
->xfrm
.policy_idx_hmask
= hmask
;
2969 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
2970 struct xfrm_policy_hash
*htab
;
2972 net
->xfrm
.policy_count
[dir
] = 0;
2973 net
->xfrm
.policy_count
[XFRM_POLICY_MAX
+ dir
] = 0;
2974 INIT_HLIST_HEAD(&net
->xfrm
.policy_inexact
[dir
]);
2976 htab
= &net
->xfrm
.policy_bydst
[dir
];
2977 htab
->table
= xfrm_hash_alloc(sz
);
2980 htab
->hmask
= hmask
;
2986 net
->xfrm
.policy_hthresh
.lbits4
= 32;
2987 net
->xfrm
.policy_hthresh
.rbits4
= 32;
2988 net
->xfrm
.policy_hthresh
.lbits6
= 128;
2989 net
->xfrm
.policy_hthresh
.rbits6
= 128;
2991 seqlock_init(&net
->xfrm
.policy_hthresh
.lock
);
2993 INIT_LIST_HEAD(&net
->xfrm
.policy_all
);
2994 INIT_WORK(&net
->xfrm
.policy_hash_work
, xfrm_hash_resize
);
2995 INIT_WORK(&net
->xfrm
.policy_hthresh
.work
, xfrm_hash_rebuild
);
2996 if (net_eq(net
, &init_net
))
2997 register_netdevice_notifier(&xfrm_dev_notifier
);
3001 for (dir
--; dir
>= 0; dir
--) {
3002 struct xfrm_policy_hash
*htab
;
3004 htab
= &net
->xfrm
.policy_bydst
[dir
];
3005 xfrm_hash_free(htab
->table
, sz
);
3007 xfrm_hash_free(net
->xfrm
.policy_byidx
, sz
);
3012 static void xfrm_policy_fini(struct net
*net
)
3017 flush_work(&net
->xfrm
.policy_hash_work
);
3018 #ifdef CONFIG_XFRM_SUB_POLICY
3019 xfrm_policy_flush(net
, XFRM_POLICY_TYPE_SUB
, false);
3021 xfrm_policy_flush(net
, XFRM_POLICY_TYPE_MAIN
, false);
3023 WARN_ON(!list_empty(&net
->xfrm
.policy_all
));
3025 for (dir
= 0; dir
< XFRM_POLICY_MAX
; dir
++) {
3026 struct xfrm_policy_hash
*htab
;
3028 WARN_ON(!hlist_empty(&net
->xfrm
.policy_inexact
[dir
]));
3030 htab
= &net
->xfrm
.policy_bydst
[dir
];
3031 sz
= (htab
->hmask
+ 1) * sizeof(struct hlist_head
);
3032 WARN_ON(!hlist_empty(htab
->table
));
3033 xfrm_hash_free(htab
->table
, sz
);
3036 sz
= (net
->xfrm
.policy_idx_hmask
+ 1) * sizeof(struct hlist_head
);
3037 WARN_ON(!hlist_empty(net
->xfrm
.policy_byidx
));
3038 xfrm_hash_free(net
->xfrm
.policy_byidx
, sz
);
3041 static int __net_init
xfrm_net_init(struct net
*net
)
3045 rv
= xfrm_statistics_init(net
);
3047 goto out_statistics
;
3048 rv
= xfrm_state_init(net
);
3051 rv
= xfrm_policy_init(net
);
3054 rv
= xfrm_sysctl_init(net
);
3057 rv
= flow_cache_init(net
);
3061 /* Initialize the per-net locks here */
3062 spin_lock_init(&net
->xfrm
.xfrm_state_lock
);
3063 spin_lock_init(&net
->xfrm
.xfrm_policy_lock
);
3064 mutex_init(&net
->xfrm
.xfrm_cfg_mutex
);
3069 xfrm_sysctl_fini(net
);
3071 xfrm_policy_fini(net
);
3073 xfrm_state_fini(net
);
3075 xfrm_statistics_fini(net
);
3080 static void __net_exit
xfrm_net_exit(struct net
*net
)
3082 flow_cache_fini(net
);
3083 xfrm_sysctl_fini(net
);
3084 xfrm_policy_fini(net
);
3085 xfrm_state_fini(net
);
3086 xfrm_statistics_fini(net
);
3089 static struct pernet_operations __net_initdata xfrm_net_ops
= {
3090 .init
= xfrm_net_init
,
3091 .exit
= xfrm_net_exit
,
3094 void __init
xfrm_init(void)
3096 flow_cache_hp_init();
3097 register_pernet_subsys(&xfrm_net_ops
);
3098 seqcount_init(&xfrm_policy_hash_generation
);
3102 #ifdef CONFIG_AUDITSYSCALL
3103 static void xfrm_audit_common_policyinfo(struct xfrm_policy
*xp
,
3104 struct audit_buffer
*audit_buf
)
3106 struct xfrm_sec_ctx
*ctx
= xp
->security
;
3107 struct xfrm_selector
*sel
= &xp
->selector
;
3110 audit_log_format(audit_buf
, " sec_alg=%u sec_doi=%u sec_obj=%s",
3111 ctx
->ctx_alg
, ctx
->ctx_doi
, ctx
->ctx_str
);
3113 switch (sel
->family
) {
3115 audit_log_format(audit_buf
, " src=%pI4", &sel
->saddr
.a4
);
3116 if (sel
->prefixlen_s
!= 32)
3117 audit_log_format(audit_buf
, " src_prefixlen=%d",
3119 audit_log_format(audit_buf
, " dst=%pI4", &sel
->daddr
.a4
);
3120 if (sel
->prefixlen_d
!= 32)
3121 audit_log_format(audit_buf
, " dst_prefixlen=%d",
3125 audit_log_format(audit_buf
, " src=%pI6", sel
->saddr
.a6
);
3126 if (sel
->prefixlen_s
!= 128)
3127 audit_log_format(audit_buf
, " src_prefixlen=%d",
3129 audit_log_format(audit_buf
, " dst=%pI6", sel
->daddr
.a6
);
3130 if (sel
->prefixlen_d
!= 128)
3131 audit_log_format(audit_buf
, " dst_prefixlen=%d",
3137 void xfrm_audit_policy_add(struct xfrm_policy
*xp
, int result
, bool task_valid
)
3139 struct audit_buffer
*audit_buf
;
3141 audit_buf
= xfrm_audit_start("SPD-add");
3142 if (audit_buf
== NULL
)
3144 xfrm_audit_helper_usrinfo(task_valid
, audit_buf
);
3145 audit_log_format(audit_buf
, " res=%u", result
);
3146 xfrm_audit_common_policyinfo(xp
, audit_buf
);
3147 audit_log_end(audit_buf
);
3149 EXPORT_SYMBOL_GPL(xfrm_audit_policy_add
);
3151 void xfrm_audit_policy_delete(struct xfrm_policy
*xp
, int result
,
3154 struct audit_buffer
*audit_buf
;
3156 audit_buf
= xfrm_audit_start("SPD-delete");
3157 if (audit_buf
== NULL
)
3159 xfrm_audit_helper_usrinfo(task_valid
, audit_buf
);
3160 audit_log_format(audit_buf
, " res=%u", result
);
3161 xfrm_audit_common_policyinfo(xp
, audit_buf
);
3162 audit_log_end(audit_buf
);
3164 EXPORT_SYMBOL_GPL(xfrm_audit_policy_delete
);
3167 #ifdef CONFIG_XFRM_MIGRATE
3168 static bool xfrm_migrate_selector_match(const struct xfrm_selector
*sel_cmp
,
3169 const struct xfrm_selector
*sel_tgt
)
3171 if (sel_cmp
->proto
== IPSEC_ULPROTO_ANY
) {
3172 if (sel_tgt
->family
== sel_cmp
->family
&&
3173 xfrm_addr_equal(&sel_tgt
->daddr
, &sel_cmp
->daddr
,
3175 xfrm_addr_equal(&sel_tgt
->saddr
, &sel_cmp
->saddr
,
3177 sel_tgt
->prefixlen_d
== sel_cmp
->prefixlen_d
&&
3178 sel_tgt
->prefixlen_s
== sel_cmp
->prefixlen_s
) {
3182 if (memcmp(sel_tgt
, sel_cmp
, sizeof(*sel_tgt
)) == 0) {
3189 static struct xfrm_policy
*xfrm_migrate_policy_find(const struct xfrm_selector
*sel
,
3190 u8 dir
, u8 type
, struct net
*net
)
3192 struct xfrm_policy
*pol
, *ret
= NULL
;
3193 struct hlist_head
*chain
;
3196 spin_lock_bh(&net
->xfrm
.xfrm_policy_lock
);
3197 chain
= policy_hash_direct(net
, &sel
->daddr
, &sel
->saddr
, sel
->family
, dir
);
3198 hlist_for_each_entry(pol
, chain
, bydst
) {
3199 if (xfrm_migrate_selector_match(sel
, &pol
->selector
) &&
3200 pol
->type
== type
) {
3202 priority
= ret
->priority
;
3206 chain
= &net
->xfrm
.policy_inexact
[dir
];
3207 hlist_for_each_entry(pol
, chain
, bydst
) {
3208 if ((pol
->priority
>= priority
) && ret
)
3211 if (xfrm_migrate_selector_match(sel
, &pol
->selector
) &&
3212 pol
->type
== type
) {
3220 spin_unlock_bh(&net
->xfrm
.xfrm_policy_lock
);
3225 static int migrate_tmpl_match(const struct xfrm_migrate
*m
, const struct xfrm_tmpl
*t
)
3229 if (t
->mode
== m
->mode
&& t
->id
.proto
== m
->proto
&&
3230 (m
->reqid
== 0 || t
->reqid
== m
->reqid
)) {
3232 case XFRM_MODE_TUNNEL
:
3233 case XFRM_MODE_BEET
:
3234 if (xfrm_addr_equal(&t
->id
.daddr
, &m
->old_daddr
,
3236 xfrm_addr_equal(&t
->saddr
, &m
->old_saddr
,
3241 case XFRM_MODE_TRANSPORT
:
3242 /* in case of transport mode, template does not store
3243 any IP addresses, hence we just compare mode and
3254 /* update endpoint address(es) of template(s) */
3255 static int xfrm_policy_migrate(struct xfrm_policy
*pol
,
3256 struct xfrm_migrate
*m
, int num_migrate
)
3258 struct xfrm_migrate
*mp
;
3261 write_lock_bh(&pol
->lock
);
3262 if (unlikely(pol
->walk
.dead
)) {
3263 /* target policy has been deleted */
3264 write_unlock_bh(&pol
->lock
);
3268 for (i
= 0; i
< pol
->xfrm_nr
; i
++) {
3269 for (j
= 0, mp
= m
; j
< num_migrate
; j
++, mp
++) {
3270 if (!migrate_tmpl_match(mp
, &pol
->xfrm_vec
[i
]))
3273 if (pol
->xfrm_vec
[i
].mode
!= XFRM_MODE_TUNNEL
&&
3274 pol
->xfrm_vec
[i
].mode
!= XFRM_MODE_BEET
)
3276 /* update endpoints */
3277 memcpy(&pol
->xfrm_vec
[i
].id
.daddr
, &mp
->new_daddr
,
3278 sizeof(pol
->xfrm_vec
[i
].id
.daddr
));
3279 memcpy(&pol
->xfrm_vec
[i
].saddr
, &mp
->new_saddr
,
3280 sizeof(pol
->xfrm_vec
[i
].saddr
));
3281 pol
->xfrm_vec
[i
].encap_family
= mp
->new_family
;
3283 atomic_inc(&pol
->genid
);
3287 write_unlock_bh(&pol
->lock
);
3295 static int xfrm_migrate_check(const struct xfrm_migrate
*m
, int num_migrate
)
3299 if (num_migrate
< 1 || num_migrate
> XFRM_MAX_DEPTH
)
3302 for (i
= 0; i
< num_migrate
; i
++) {
3303 if (xfrm_addr_equal(&m
[i
].old_daddr
, &m
[i
].new_daddr
,
3305 xfrm_addr_equal(&m
[i
].old_saddr
, &m
[i
].new_saddr
,
3308 if (xfrm_addr_any(&m
[i
].new_daddr
, m
[i
].new_family
) ||
3309 xfrm_addr_any(&m
[i
].new_saddr
, m
[i
].new_family
))
3312 /* check if there is any duplicated entry */
3313 for (j
= i
+ 1; j
< num_migrate
; j
++) {
3314 if (!memcmp(&m
[i
].old_daddr
, &m
[j
].old_daddr
,
3315 sizeof(m
[i
].old_daddr
)) &&
3316 !memcmp(&m
[i
].old_saddr
, &m
[j
].old_saddr
,
3317 sizeof(m
[i
].old_saddr
)) &&
3318 m
[i
].proto
== m
[j
].proto
&&
3319 m
[i
].mode
== m
[j
].mode
&&
3320 m
[i
].reqid
== m
[j
].reqid
&&
3321 m
[i
].old_family
== m
[j
].old_family
)
3329 int xfrm_migrate(const struct xfrm_selector
*sel
, u8 dir
, u8 type
,
3330 struct xfrm_migrate
*m
, int num_migrate
,
3331 struct xfrm_kmaddress
*k
, struct net
*net
)
3333 int i
, err
, nx_cur
= 0, nx_new
= 0;
3334 struct xfrm_policy
*pol
= NULL
;
3335 struct xfrm_state
*x
, *xc
;
3336 struct xfrm_state
*x_cur
[XFRM_MAX_DEPTH
];
3337 struct xfrm_state
*x_new
[XFRM_MAX_DEPTH
];
3338 struct xfrm_migrate
*mp
;
3340 if ((err
= xfrm_migrate_check(m
, num_migrate
)) < 0)
3343 /* Stage 1 - find policy */
3344 if ((pol
= xfrm_migrate_policy_find(sel
, dir
, type
, net
)) == NULL
) {
3349 /* Stage 2 - find and update state(s) */
3350 for (i
= 0, mp
= m
; i
< num_migrate
; i
++, mp
++) {
3351 if ((x
= xfrm_migrate_state_find(mp
, net
))) {
3354 if ((xc
= xfrm_state_migrate(x
, mp
))) {
3364 /* Stage 3 - update policy */
3365 if ((err
= xfrm_policy_migrate(pol
, m
, num_migrate
)) < 0)
3368 /* Stage 4 - delete old state(s) */
3370 xfrm_states_put(x_cur
, nx_cur
);
3371 xfrm_states_delete(x_cur
, nx_cur
);
3374 /* Stage 5 - announce */
3375 km_migrate(sel
, dir
, type
, m
, num_migrate
, k
);
3387 xfrm_states_put(x_cur
, nx_cur
);
3389 xfrm_states_delete(x_new
, nx_new
);
3393 EXPORT_SYMBOL(xfrm_migrate
);