6 * Kazunori MIYAZAWA @USAGI
7 * Kunihiro Ishiguro <kunihiro@ipinfusion.com>
9 * YOSHIFUJI Hideaki @USAGI
10 * Split up af-specific functions
11 * Derek Atkins <derek@ihtfp.com>
12 * Add UDP Encapsulation
16 #include <linux/workqueue.h>
18 #include <linux/pfkeyv2.h>
19 #include <linux/ipsec.h>
20 #include <linux/module.h>
21 #include <linux/cache.h>
22 #include <linux/audit.h>
23 #include <asm/uaccess.h>
24 #include <linux/ktime.h>
25 #include <linux/interrupt.h>
26 #include <linux/kernel.h>
28 #include "xfrm_hash.h"
30 /* Each xfrm_state may be linked to two tables:
32 1. Hash table by (spi,daddr,ah/esp) to find SA by SPI. (input,ctl)
33 2. Hash table by (daddr,family,reqid) to find what SAs exist for given
34 destination/tunnel endpoint. (output)
37 static DEFINE_SPINLOCK(xfrm_state_lock);
39 static unsigned int xfrm_state_hashmax __read_mostly = 1 * 1024 * 1024;
40 static unsigned int xfrm_state_genid;
42 static struct xfrm_state_afinfo *xfrm_state_get_afinfo(unsigned int family);
43 static void xfrm_state_put_afinfo(struct xfrm_state_afinfo *afinfo);
45 #ifdef CONFIG_AUDITSYSCALL
46 static void xfrm_audit_state_replay(struct xfrm_state *x,
47 struct sk_buff *skb, __be32 net_seq);
49 #define xfrm_audit_state_replay(x, s, sq) do { ; } while (0)
50 #endif /* CONFIG_AUDITSYSCALL */
52 static inline unsigned int xfrm_dst_hash(struct net *net,
53 xfrm_address_t *daddr,
54 xfrm_address_t *saddr,
56 unsigned short family)
58 return __xfrm_dst_hash(daddr, saddr, reqid, family, net->xfrm.state_hmask);
61 static inline unsigned int xfrm_src_hash(struct net *net,
62 xfrm_address_t *daddr,
63 xfrm_address_t *saddr,
64 unsigned short family)
66 return __xfrm_src_hash(daddr, saddr, family, net->xfrm.state_hmask);
69 static inline unsigned int
70 xfrm_spi_hash(struct net *net, xfrm_address_t *daddr, __be32 spi, u8 proto, unsigned short family)
72 return __xfrm_spi_hash(daddr, spi, proto, family, net->xfrm.state_hmask);
75 static void xfrm_hash_transfer(struct hlist_head *list,
76 struct hlist_head *ndsttable,
77 struct hlist_head *nsrctable,
78 struct hlist_head *nspitable,
79 unsigned int nhashmask)
81 struct hlist_node *entry, *tmp;
84 hlist_for_each_entry_safe(x, entry, tmp, list, bydst) {
87 h = __xfrm_dst_hash(&x->id.daddr, &x->props.saddr,
88 x->props.reqid, x->props.family,
90 hlist_add_head(&x->bydst, ndsttable+h);
92 h = __xfrm_src_hash(&x->id.daddr, &x->props.saddr,
95 hlist_add_head(&x->bysrc, nsrctable+h);
98 h = __xfrm_spi_hash(&x->id.daddr, x->id.spi,
99 x->id.proto, x->props.family,
101 hlist_add_head(&x->byspi, nspitable+h);
106 static unsigned long xfrm_hash_new_size(unsigned int state_hmask)
108 return ((state_hmask + 1) << 1) * sizeof(struct hlist_head);
111 static DEFINE_MUTEX(hash_resize_mutex);
113 static void xfrm_hash_resize(struct work_struct *work)
115 struct net *net = container_of(work, struct net, xfrm.state_hash_work);
116 struct hlist_head *ndst, *nsrc, *nspi, *odst, *osrc, *ospi;
117 unsigned long nsize, osize;
118 unsigned int nhashmask, ohashmask;
121 mutex_lock(&hash_resize_mutex);
123 nsize = xfrm_hash_new_size(net->xfrm.state_hmask);
124 ndst = xfrm_hash_alloc(nsize);
127 nsrc = xfrm_hash_alloc(nsize);
129 xfrm_hash_free(ndst, nsize);
132 nspi = xfrm_hash_alloc(nsize);
134 xfrm_hash_free(ndst, nsize);
135 xfrm_hash_free(nsrc, nsize);
139 spin_lock_bh(&xfrm_state_lock);
141 nhashmask = (nsize / sizeof(struct hlist_head)) - 1U;
142 for (i = net->xfrm.state_hmask; i >= 0; i--)
143 xfrm_hash_transfer(net->xfrm.state_bydst+i, ndst, nsrc, nspi,
146 odst = net->xfrm.state_bydst;
147 osrc = net->xfrm.state_bysrc;
148 ospi = net->xfrm.state_byspi;
149 ohashmask = net->xfrm.state_hmask;
151 net->xfrm.state_bydst = ndst;
152 net->xfrm.state_bysrc = nsrc;
153 net->xfrm.state_byspi = nspi;
154 net->xfrm.state_hmask = nhashmask;
156 spin_unlock_bh(&xfrm_state_lock);
158 osize = (ohashmask + 1) * sizeof(struct hlist_head);
159 xfrm_hash_free(odst, osize);
160 xfrm_hash_free(osrc, osize);
161 xfrm_hash_free(ospi, osize);
164 mutex_unlock(&hash_resize_mutex);
167 static DEFINE_RWLOCK(xfrm_state_afinfo_lock);
168 static struct xfrm_state_afinfo *xfrm_state_afinfo[NPROTO];
170 static DEFINE_SPINLOCK(xfrm_state_gc_lock);
172 int __xfrm_state_delete(struct xfrm_state *x);
174 int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol);
175 void km_state_expired(struct xfrm_state *x, int hard, u32 pid);
177 static struct xfrm_state_afinfo *xfrm_state_lock_afinfo(unsigned int family)
179 struct xfrm_state_afinfo *afinfo;
180 if (unlikely(family >= NPROTO))
182 write_lock_bh(&xfrm_state_afinfo_lock);
183 afinfo = xfrm_state_afinfo[family];
184 if (unlikely(!afinfo))
185 write_unlock_bh(&xfrm_state_afinfo_lock);
189 static void xfrm_state_unlock_afinfo(struct xfrm_state_afinfo *afinfo)
190 __releases(xfrm_state_afinfo_lock)
192 write_unlock_bh(&xfrm_state_afinfo_lock);
195 int xfrm_register_type(const struct xfrm_type *type, unsigned short family)
197 struct xfrm_state_afinfo *afinfo = xfrm_state_lock_afinfo(family);
198 const struct xfrm_type **typemap;
201 if (unlikely(afinfo == NULL))
202 return -EAFNOSUPPORT;
203 typemap = afinfo->type_map;
205 if (likely(typemap[type->proto] == NULL))
206 typemap[type->proto] = type;
209 xfrm_state_unlock_afinfo(afinfo);
212 EXPORT_SYMBOL(xfrm_register_type);
214 int xfrm_unregister_type(const struct xfrm_type *type, unsigned short family)
216 struct xfrm_state_afinfo *afinfo = xfrm_state_lock_afinfo(family);
217 const struct xfrm_type **typemap;
220 if (unlikely(afinfo == NULL))
221 return -EAFNOSUPPORT;
222 typemap = afinfo->type_map;
224 if (unlikely(typemap[type->proto] != type))
227 typemap[type->proto] = NULL;
228 xfrm_state_unlock_afinfo(afinfo);
231 EXPORT_SYMBOL(xfrm_unregister_type);
233 static const struct xfrm_type *xfrm_get_type(u8 proto, unsigned short family)
235 struct xfrm_state_afinfo *afinfo;
236 const struct xfrm_type **typemap;
237 const struct xfrm_type *type;
238 int modload_attempted = 0;
241 afinfo = xfrm_state_get_afinfo(family);
242 if (unlikely(afinfo == NULL))
244 typemap = afinfo->type_map;
246 type = typemap[proto];
247 if (unlikely(type && !try_module_get(type->owner)))
249 if (!type && !modload_attempted) {
250 xfrm_state_put_afinfo(afinfo);
251 request_module("xfrm-type-%d-%d", family, proto);
252 modload_attempted = 1;
256 xfrm_state_put_afinfo(afinfo);
260 static void xfrm_put_type(const struct xfrm_type *type)
262 module_put(type->owner);
265 int xfrm_register_mode(struct xfrm_mode *mode, int family)
267 struct xfrm_state_afinfo *afinfo;
268 struct xfrm_mode **modemap;
271 if (unlikely(mode->encap >= XFRM_MODE_MAX))
274 afinfo = xfrm_state_lock_afinfo(family);
275 if (unlikely(afinfo == NULL))
276 return -EAFNOSUPPORT;
279 modemap = afinfo->mode_map;
280 if (modemap[mode->encap])
284 if (!try_module_get(afinfo->owner))
287 mode->afinfo = afinfo;
288 modemap[mode->encap] = mode;
292 xfrm_state_unlock_afinfo(afinfo);
295 EXPORT_SYMBOL(xfrm_register_mode);
297 int xfrm_unregister_mode(struct xfrm_mode *mode, int family)
299 struct xfrm_state_afinfo *afinfo;
300 struct xfrm_mode **modemap;
303 if (unlikely(mode->encap >= XFRM_MODE_MAX))
306 afinfo = xfrm_state_lock_afinfo(family);
307 if (unlikely(afinfo == NULL))
308 return -EAFNOSUPPORT;
311 modemap = afinfo->mode_map;
312 if (likely(modemap[mode->encap] == mode)) {
313 modemap[mode->encap] = NULL;
314 module_put(mode->afinfo->owner);
318 xfrm_state_unlock_afinfo(afinfo);
321 EXPORT_SYMBOL(xfrm_unregister_mode);
323 static struct xfrm_mode *xfrm_get_mode(unsigned int encap, int family)
325 struct xfrm_state_afinfo *afinfo;
326 struct xfrm_mode *mode;
327 int modload_attempted = 0;
329 if (unlikely(encap >= XFRM_MODE_MAX))
333 afinfo = xfrm_state_get_afinfo(family);
334 if (unlikely(afinfo == NULL))
337 mode = afinfo->mode_map[encap];
338 if (unlikely(mode && !try_module_get(mode->owner)))
340 if (!mode && !modload_attempted) {
341 xfrm_state_put_afinfo(afinfo);
342 request_module("xfrm-mode-%d-%d", family, encap);
343 modload_attempted = 1;
347 xfrm_state_put_afinfo(afinfo);
351 static void xfrm_put_mode(struct xfrm_mode *mode)
353 module_put(mode->owner);
356 static void xfrm_state_gc_destroy(struct xfrm_state *x)
358 tasklet_hrtimer_cancel(&x->mtimer);
359 del_timer_sync(&x->rtimer);
366 xfrm_put_mode(x->inner_mode);
367 if (x->inner_mode_iaf)
368 xfrm_put_mode(x->inner_mode_iaf);
370 xfrm_put_mode(x->outer_mode);
372 x->type->destructor(x);
373 xfrm_put_type(x->type);
375 security_xfrm_state_free(x);
379 static void xfrm_state_gc_task(struct work_struct *work)
381 struct net *net = container_of(work, struct net, xfrm.state_gc_work);
382 struct xfrm_state *x;
383 struct hlist_node *entry, *tmp;
384 struct hlist_head gc_list;
386 spin_lock_bh(&xfrm_state_gc_lock);
387 hlist_move_list(&net->xfrm.state_gc_list, &gc_list);
388 spin_unlock_bh(&xfrm_state_gc_lock);
390 hlist_for_each_entry_safe(x, entry, tmp, &gc_list, gclist)
391 xfrm_state_gc_destroy(x);
393 wake_up(&net->xfrm.km_waitq);
396 static inline unsigned long make_jiffies(long secs)
398 if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
399 return MAX_SCHEDULE_TIMEOUT-1;
404 static enum hrtimer_restart xfrm_timer_handler(struct hrtimer * me)
406 struct tasklet_hrtimer *thr = container_of(me, struct tasklet_hrtimer, timer);
407 struct xfrm_state *x = container_of(thr, struct xfrm_state, mtimer);
408 struct net *net = xs_net(x);
409 unsigned long now = get_seconds();
410 long next = LONG_MAX;
415 if (x->km.state == XFRM_STATE_DEAD)
417 if (x->km.state == XFRM_STATE_EXPIRED)
419 if (x->lft.hard_add_expires_seconds) {
420 long tmo = x->lft.hard_add_expires_seconds +
421 x->curlft.add_time - now;
427 if (x->lft.hard_use_expires_seconds) {
428 long tmo = x->lft.hard_use_expires_seconds +
429 (x->curlft.use_time ? : now) - now;
437 if (x->lft.soft_add_expires_seconds) {
438 long tmo = x->lft.soft_add_expires_seconds +
439 x->curlft.add_time - now;
445 if (x->lft.soft_use_expires_seconds) {
446 long tmo = x->lft.soft_use_expires_seconds +
447 (x->curlft.use_time ? : now) - now;
456 km_state_expired(x, 0, 0);
458 if (next != LONG_MAX){
459 tasklet_hrtimer_start(&x->mtimer, ktime_set(next, 0), HRTIMER_MODE_REL);
465 if (x->km.state == XFRM_STATE_ACQ && x->id.spi == 0) {
466 x->km.state = XFRM_STATE_EXPIRED;
467 wake_up(&net->xfrm.km_waitq);
472 err = __xfrm_state_delete(x);
473 if (!err && x->id.spi)
474 km_state_expired(x, 1, 0);
476 xfrm_audit_state_delete(x, err ? 0 : 1,
477 audit_get_loginuid(current),
478 audit_get_sessionid(current), 0);
481 spin_unlock(&x->lock);
482 return HRTIMER_NORESTART;
485 static void xfrm_replay_timer_handler(unsigned long data);
487 struct xfrm_state *xfrm_state_alloc(struct net *net)
489 struct xfrm_state *x;
491 x = kzalloc(sizeof(struct xfrm_state), GFP_ATOMIC);
494 write_pnet(&x->xs_net, net);
495 atomic_set(&x->refcnt, 1);
496 atomic_set(&x->tunnel_users, 0);
497 INIT_LIST_HEAD(&x->km.all);
498 INIT_HLIST_NODE(&x->bydst);
499 INIT_HLIST_NODE(&x->bysrc);
500 INIT_HLIST_NODE(&x->byspi);
501 tasklet_hrtimer_init(&x->mtimer, xfrm_timer_handler, CLOCK_REALTIME, HRTIMER_MODE_ABS);
502 setup_timer(&x->rtimer, xfrm_replay_timer_handler,
504 x->curlft.add_time = get_seconds();
505 x->lft.soft_byte_limit = XFRM_INF;
506 x->lft.soft_packet_limit = XFRM_INF;
507 x->lft.hard_byte_limit = XFRM_INF;
508 x->lft.hard_packet_limit = XFRM_INF;
509 x->replay_maxage = 0;
510 x->replay_maxdiff = 0;
511 x->inner_mode = NULL;
512 x->inner_mode_iaf = NULL;
513 spin_lock_init(&x->lock);
517 EXPORT_SYMBOL(xfrm_state_alloc);
519 void __xfrm_state_destroy(struct xfrm_state *x)
521 struct net *net = xs_net(x);
523 WARN_ON(x->km.state != XFRM_STATE_DEAD);
525 spin_lock_bh(&xfrm_state_gc_lock);
526 hlist_add_head(&x->gclist, &net->xfrm.state_gc_list);
527 spin_unlock_bh(&xfrm_state_gc_lock);
528 schedule_work(&net->xfrm.state_gc_work);
530 EXPORT_SYMBOL(__xfrm_state_destroy);
532 int __xfrm_state_delete(struct xfrm_state *x)
534 struct net *net = xs_net(x);
537 if (x->km.state != XFRM_STATE_DEAD) {
538 x->km.state = XFRM_STATE_DEAD;
539 spin_lock(&xfrm_state_lock);
540 list_del(&x->km.all);
541 hlist_del(&x->bydst);
542 hlist_del(&x->bysrc);
544 hlist_del(&x->byspi);
545 net->xfrm.state_num--;
546 spin_unlock(&xfrm_state_lock);
548 /* All xfrm_state objects are created by xfrm_state_alloc.
549 * The xfrm_state_alloc call gives a reference, and that
550 * is what we are dropping here.
558 EXPORT_SYMBOL(__xfrm_state_delete);
560 int xfrm_state_delete(struct xfrm_state *x)
564 spin_lock_bh(&x->lock);
565 err = __xfrm_state_delete(x);
566 spin_unlock_bh(&x->lock);
570 EXPORT_SYMBOL(xfrm_state_delete);
572 #ifdef CONFIG_SECURITY_NETWORK_XFRM
574 xfrm_state_flush_secctx_check(struct net *net, u8 proto, struct xfrm_audit *audit_info)
578 for (i = 0; i <= net->xfrm.state_hmask; i++) {
579 struct hlist_node *entry;
580 struct xfrm_state *x;
582 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+i, bydst) {
583 if (xfrm_id_proto_match(x->id.proto, proto) &&
584 (err = security_xfrm_state_delete(x)) != 0) {
585 xfrm_audit_state_delete(x, 0,
586 audit_info->loginuid,
587 audit_info->sessionid,
598 xfrm_state_flush_secctx_check(struct net *net, u8 proto, struct xfrm_audit *audit_info)
604 int xfrm_state_flush(struct net *net, u8 proto, struct xfrm_audit *audit_info)
606 int i, err = 0, cnt = 0;
608 spin_lock_bh(&xfrm_state_lock);
609 err = xfrm_state_flush_secctx_check(net, proto, audit_info);
614 for (i = 0; i <= net->xfrm.state_hmask; i++) {
615 struct hlist_node *entry;
616 struct xfrm_state *x;
618 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+i, bydst) {
619 if (!xfrm_state_kern(x) &&
620 xfrm_id_proto_match(x->id.proto, proto)) {
622 spin_unlock_bh(&xfrm_state_lock);
624 err = xfrm_state_delete(x);
625 xfrm_audit_state_delete(x, err ? 0 : 1,
626 audit_info->loginuid,
627 audit_info->sessionid,
633 spin_lock_bh(&xfrm_state_lock);
642 spin_unlock_bh(&xfrm_state_lock);
643 wake_up(&net->xfrm.km_waitq);
646 EXPORT_SYMBOL(xfrm_state_flush);
648 void xfrm_sad_getinfo(struct net *net, struct xfrmk_sadinfo *si)
650 spin_lock_bh(&xfrm_state_lock);
651 si->sadcnt = net->xfrm.state_num;
652 si->sadhcnt = net->xfrm.state_hmask;
653 si->sadhmcnt = xfrm_state_hashmax;
654 spin_unlock_bh(&xfrm_state_lock);
656 EXPORT_SYMBOL(xfrm_sad_getinfo);
659 xfrm_init_tempsel(struct xfrm_state *x, struct flowi *fl,
660 struct xfrm_tmpl *tmpl,
661 xfrm_address_t *daddr, xfrm_address_t *saddr,
662 unsigned short family)
664 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
667 afinfo->init_tempsel(x, fl, tmpl, daddr, saddr);
668 xfrm_state_put_afinfo(afinfo);
672 static struct xfrm_state *__xfrm_state_lookup(struct net *net, xfrm_address_t *daddr, __be32 spi, u8 proto, unsigned short family)
674 unsigned int h = xfrm_spi_hash(net, daddr, spi, proto, family);
675 struct xfrm_state *x;
676 struct hlist_node *entry;
678 hlist_for_each_entry(x, entry, net->xfrm.state_byspi+h, byspi) {
679 if (x->props.family != family ||
681 x->id.proto != proto ||
682 xfrm_addr_cmp(&x->id.daddr, daddr, family))
692 static struct xfrm_state *__xfrm_state_lookup_byaddr(struct net *net, xfrm_address_t *daddr, xfrm_address_t *saddr, u8 proto, unsigned short family)
694 unsigned int h = xfrm_src_hash(net, daddr, saddr, family);
695 struct xfrm_state *x;
696 struct hlist_node *entry;
698 hlist_for_each_entry(x, entry, net->xfrm.state_bysrc+h, bysrc) {
699 if (x->props.family != family ||
700 x->id.proto != proto ||
701 xfrm_addr_cmp(&x->id.daddr, daddr, family) ||
702 xfrm_addr_cmp(&x->props.saddr, saddr, family))
712 static inline struct xfrm_state *
713 __xfrm_state_locate(struct xfrm_state *x, int use_spi, int family)
715 struct net *net = xs_net(x);
718 return __xfrm_state_lookup(net, &x->id.daddr, x->id.spi,
719 x->id.proto, family);
721 return __xfrm_state_lookup_byaddr(net, &x->id.daddr,
723 x->id.proto, family);
726 static void xfrm_hash_grow_check(struct net *net, int have_hash_collision)
728 if (have_hash_collision &&
729 (net->xfrm.state_hmask + 1) < xfrm_state_hashmax &&
730 net->xfrm.state_num > net->xfrm.state_hmask)
731 schedule_work(&net->xfrm.state_hash_work);
734 static void xfrm_state_look_at(struct xfrm_policy *pol, struct xfrm_state *x,
735 struct flowi *fl, unsigned short family,
736 xfrm_address_t *daddr, xfrm_address_t *saddr,
737 struct xfrm_state **best, int *acq_in_progress,
741 * 1. There is a valid state with matching selector. Done.
742 * 2. Valid state with inappropriate selector. Skip.
744 * Entering area of "sysdeps".
746 * 3. If state is not valid, selector is temporary, it selects
747 * only session which triggered previous resolution. Key
748 * manager will do something to install a state with proper
751 if (x->km.state == XFRM_STATE_VALID) {
752 if ((x->sel.family &&
753 !xfrm_selector_match(&x->sel, fl, x->sel.family)) ||
754 !security_xfrm_state_pol_flow_match(x, pol, fl))
758 (*best)->km.dying > x->km.dying ||
759 ((*best)->km.dying == x->km.dying &&
760 (*best)->curlft.add_time < x->curlft.add_time))
762 } else if (x->km.state == XFRM_STATE_ACQ) {
763 *acq_in_progress = 1;
764 } else if (x->km.state == XFRM_STATE_ERROR ||
765 x->km.state == XFRM_STATE_EXPIRED) {
766 if (xfrm_selector_match(&x->sel, fl, x->sel.family) &&
767 security_xfrm_state_pol_flow_match(x, pol, fl))
773 xfrm_state_find(xfrm_address_t *daddr, xfrm_address_t *saddr,
774 struct flowi *fl, struct xfrm_tmpl *tmpl,
775 struct xfrm_policy *pol, int *err,
776 unsigned short family)
778 static xfrm_address_t saddr_wildcard = { };
779 struct net *net = xp_net(pol);
780 unsigned int h, h_wildcard;
781 struct hlist_node *entry;
782 struct xfrm_state *x, *x0, *to_put;
783 int acquire_in_progress = 0;
785 struct xfrm_state *best = NULL;
789 spin_lock_bh(&xfrm_state_lock);
790 h = xfrm_dst_hash(net, daddr, saddr, tmpl->reqid, family);
791 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
792 if (x->props.family == family &&
793 x->props.reqid == tmpl->reqid &&
794 !(x->props.flags & XFRM_STATE_WILDRECV) &&
795 xfrm_state_addr_check(x, daddr, saddr, family) &&
796 tmpl->mode == x->props.mode &&
797 tmpl->id.proto == x->id.proto &&
798 (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
799 xfrm_state_look_at(pol, x, fl, family, daddr, saddr,
800 &best, &acquire_in_progress, &error);
805 h_wildcard = xfrm_dst_hash(net, daddr, &saddr_wildcard, tmpl->reqid, family);
806 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h_wildcard, bydst) {
807 if (x->props.family == family &&
808 x->props.reqid == tmpl->reqid &&
809 !(x->props.flags & XFRM_STATE_WILDRECV) &&
810 xfrm_state_addr_check(x, daddr, saddr, family) &&
811 tmpl->mode == x->props.mode &&
812 tmpl->id.proto == x->id.proto &&
813 (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
814 xfrm_state_look_at(pol, x, fl, family, daddr, saddr,
815 &best, &acquire_in_progress, &error);
820 if (!x && !error && !acquire_in_progress) {
822 (x0 = __xfrm_state_lookup(net, daddr, tmpl->id.spi,
823 tmpl->id.proto, family)) != NULL) {
828 x = xfrm_state_alloc(net);
833 /* Initialize temporary selector matching only
834 * to current session. */
835 xfrm_init_tempsel(x, fl, tmpl, daddr, saddr, family);
837 error = security_xfrm_state_alloc_acquire(x, pol->security, fl->secid);
839 x->km.state = XFRM_STATE_DEAD;
845 if (km_query(x, tmpl, pol) == 0) {
846 x->km.state = XFRM_STATE_ACQ;
847 list_add(&x->km.all, &net->xfrm.state_all);
848 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
849 h = xfrm_src_hash(net, daddr, saddr, family);
850 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
852 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, family);
853 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
855 x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
856 tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
857 net->xfrm.state_num++;
858 xfrm_hash_grow_check(net, x->bydst.next != NULL);
860 x->km.state = XFRM_STATE_DEAD;
870 *err = acquire_in_progress ? -EAGAIN : error;
871 spin_unlock_bh(&xfrm_state_lock);
873 xfrm_state_put(to_put);
878 xfrm_stateonly_find(struct net *net,
879 xfrm_address_t *daddr, xfrm_address_t *saddr,
880 unsigned short family, u8 mode, u8 proto, u32 reqid)
883 struct xfrm_state *rx = NULL, *x = NULL;
884 struct hlist_node *entry;
886 spin_lock(&xfrm_state_lock);
887 h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
888 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
889 if (x->props.family == family &&
890 x->props.reqid == reqid &&
891 !(x->props.flags & XFRM_STATE_WILDRECV) &&
892 xfrm_state_addr_check(x, daddr, saddr, family) &&
893 mode == x->props.mode &&
894 proto == x->id.proto &&
895 x->km.state == XFRM_STATE_VALID) {
903 spin_unlock(&xfrm_state_lock);
908 EXPORT_SYMBOL(xfrm_stateonly_find);
910 static void __xfrm_state_insert(struct xfrm_state *x)
912 struct net *net = xs_net(x);
915 x->genid = ++xfrm_state_genid;
917 list_add(&x->km.all, &net->xfrm.state_all);
919 h = xfrm_dst_hash(net, &x->id.daddr, &x->props.saddr,
920 x->props.reqid, x->props.family);
921 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
923 h = xfrm_src_hash(net, &x->id.daddr, &x->props.saddr, x->props.family);
924 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
927 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto,
930 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
933 tasklet_hrtimer_start(&x->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
934 if (x->replay_maxage)
935 mod_timer(&x->rtimer, jiffies + x->replay_maxage);
937 wake_up(&net->xfrm.km_waitq);
939 net->xfrm.state_num++;
941 xfrm_hash_grow_check(net, x->bydst.next != NULL);
944 /* xfrm_state_lock is held */
945 static void __xfrm_state_bump_genids(struct xfrm_state *xnew)
947 struct net *net = xs_net(xnew);
948 unsigned short family = xnew->props.family;
949 u32 reqid = xnew->props.reqid;
950 struct xfrm_state *x;
951 struct hlist_node *entry;
954 h = xfrm_dst_hash(net, &xnew->id.daddr, &xnew->props.saddr, reqid, family);
955 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
956 if (x->props.family == family &&
957 x->props.reqid == reqid &&
958 !xfrm_addr_cmp(&x->id.daddr, &xnew->id.daddr, family) &&
959 !xfrm_addr_cmp(&x->props.saddr, &xnew->props.saddr, family))
960 x->genid = xfrm_state_genid;
964 void xfrm_state_insert(struct xfrm_state *x)
966 spin_lock_bh(&xfrm_state_lock);
967 __xfrm_state_bump_genids(x);
968 __xfrm_state_insert(x);
969 spin_unlock_bh(&xfrm_state_lock);
971 EXPORT_SYMBOL(xfrm_state_insert);
973 /* xfrm_state_lock is held */
974 static struct xfrm_state *__find_acq_core(struct net *net, unsigned short family, u8 mode, u32 reqid, u8 proto, xfrm_address_t *daddr, xfrm_address_t *saddr, int create)
976 unsigned int h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
977 struct hlist_node *entry;
978 struct xfrm_state *x;
980 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
981 if (x->props.reqid != reqid ||
982 x->props.mode != mode ||
983 x->props.family != family ||
984 x->km.state != XFRM_STATE_ACQ ||
986 x->id.proto != proto ||
987 xfrm_addr_cmp(&x->id.daddr, daddr, family) ||
988 xfrm_addr_cmp(&x->props.saddr, saddr, family))
998 x = xfrm_state_alloc(net);
1002 x->sel.daddr.a4 = daddr->a4;
1003 x->sel.saddr.a4 = saddr->a4;
1004 x->sel.prefixlen_d = 32;
1005 x->sel.prefixlen_s = 32;
1006 x->props.saddr.a4 = saddr->a4;
1007 x->id.daddr.a4 = daddr->a4;
1011 ipv6_addr_copy((struct in6_addr *)x->sel.daddr.a6,
1012 (struct in6_addr *)daddr);
1013 ipv6_addr_copy((struct in6_addr *)x->sel.saddr.a6,
1014 (struct in6_addr *)saddr);
1015 x->sel.prefixlen_d = 128;
1016 x->sel.prefixlen_s = 128;
1017 ipv6_addr_copy((struct in6_addr *)x->props.saddr.a6,
1018 (struct in6_addr *)saddr);
1019 ipv6_addr_copy((struct in6_addr *)x->id.daddr.a6,
1020 (struct in6_addr *)daddr);
1024 x->km.state = XFRM_STATE_ACQ;
1025 x->id.proto = proto;
1026 x->props.family = family;
1027 x->props.mode = mode;
1028 x->props.reqid = reqid;
1029 x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
1031 tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
1032 list_add(&x->km.all, &net->xfrm.state_all);
1033 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
1034 h = xfrm_src_hash(net, daddr, saddr, family);
1035 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
1037 net->xfrm.state_num++;
1039 xfrm_hash_grow_check(net, x->bydst.next != NULL);
1045 static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 seq);
1047 int xfrm_state_add(struct xfrm_state *x)
1049 struct net *net = xs_net(x);
1050 struct xfrm_state *x1, *to_put;
1053 int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
1055 family = x->props.family;
1059 spin_lock_bh(&xfrm_state_lock);
1061 x1 = __xfrm_state_locate(x, use_spi, family);
1069 if (use_spi && x->km.seq) {
1070 x1 = __xfrm_find_acq_byseq(net, x->km.seq);
1071 if (x1 && ((x1->id.proto != x->id.proto) ||
1072 xfrm_addr_cmp(&x1->id.daddr, &x->id.daddr, family))) {
1079 x1 = __find_acq_core(net, family, x->props.mode, x->props.reqid,
1081 &x->id.daddr, &x->props.saddr, 0);
1083 __xfrm_state_bump_genids(x);
1084 __xfrm_state_insert(x);
1088 spin_unlock_bh(&xfrm_state_lock);
1091 xfrm_state_delete(x1);
1096 xfrm_state_put(to_put);
1100 EXPORT_SYMBOL(xfrm_state_add);
1102 #ifdef CONFIG_XFRM_MIGRATE
1103 static struct xfrm_state *xfrm_state_clone(struct xfrm_state *orig, int *errp)
1105 struct net *net = xs_net(orig);
1107 struct xfrm_state *x = xfrm_state_alloc(net);
1111 memcpy(&x->id, &orig->id, sizeof(x->id));
1112 memcpy(&x->sel, &orig->sel, sizeof(x->sel));
1113 memcpy(&x->lft, &orig->lft, sizeof(x->lft));
1114 x->props.mode = orig->props.mode;
1115 x->props.replay_window = orig->props.replay_window;
1116 x->props.reqid = orig->props.reqid;
1117 x->props.family = orig->props.family;
1118 x->props.saddr = orig->props.saddr;
1121 x->aalg = xfrm_algo_auth_clone(orig->aalg);
1125 x->props.aalgo = orig->props.aalgo;
1128 x->ealg = xfrm_algo_clone(orig->ealg);
1132 x->props.ealgo = orig->props.ealgo;
1135 x->calg = xfrm_algo_clone(orig->calg);
1139 x->props.calgo = orig->props.calgo;
1142 x->encap = kmemdup(orig->encap, sizeof(*x->encap), GFP_KERNEL);
1148 x->coaddr = kmemdup(orig->coaddr, sizeof(*x->coaddr),
1154 err = xfrm_init_state(x);
1158 x->props.flags = orig->props.flags;
1160 x->curlft.add_time = orig->curlft.add_time;
1161 x->km.state = orig->km.state;
1162 x->km.seq = orig->km.seq;
1180 /* xfrm_state_lock is held */
1181 struct xfrm_state * xfrm_migrate_state_find(struct xfrm_migrate *m)
1184 struct xfrm_state *x;
1185 struct hlist_node *entry;
1188 h = xfrm_dst_hash(&init_net, &m->old_daddr, &m->old_saddr,
1189 m->reqid, m->old_family);
1190 hlist_for_each_entry(x, entry, init_net.xfrm.state_bydst+h, bydst) {
1191 if (x->props.mode != m->mode ||
1192 x->id.proto != m->proto)
1194 if (m->reqid && x->props.reqid != m->reqid)
1196 if (xfrm_addr_cmp(&x->id.daddr, &m->old_daddr,
1198 xfrm_addr_cmp(&x->props.saddr, &m->old_saddr,
1205 h = xfrm_src_hash(&init_net, &m->old_daddr, &m->old_saddr,
1207 hlist_for_each_entry(x, entry, init_net.xfrm.state_bysrc+h, bysrc) {
1208 if (x->props.mode != m->mode ||
1209 x->id.proto != m->proto)
1211 if (xfrm_addr_cmp(&x->id.daddr, &m->old_daddr,
1213 xfrm_addr_cmp(&x->props.saddr, &m->old_saddr,
1223 EXPORT_SYMBOL(xfrm_migrate_state_find);
1225 struct xfrm_state * xfrm_state_migrate(struct xfrm_state *x,
1226 struct xfrm_migrate *m)
1228 struct xfrm_state *xc;
1231 xc = xfrm_state_clone(x, &err);
1235 memcpy(&xc->id.daddr, &m->new_daddr, sizeof(xc->id.daddr));
1236 memcpy(&xc->props.saddr, &m->new_saddr, sizeof(xc->props.saddr));
1239 if (!xfrm_addr_cmp(&x->id.daddr, &m->new_daddr, m->new_family)) {
1240 /* a care is needed when the destination address of the
1241 state is to be updated as it is a part of triplet */
1242 xfrm_state_insert(xc);
1244 if ((err = xfrm_state_add(xc)) < 0)
1253 EXPORT_SYMBOL(xfrm_state_migrate);
1256 int xfrm_state_update(struct xfrm_state *x)
1258 struct xfrm_state *x1, *to_put;
1260 int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
1264 spin_lock_bh(&xfrm_state_lock);
1265 x1 = __xfrm_state_locate(x, use_spi, x->props.family);
1271 if (xfrm_state_kern(x1)) {
1277 if (x1->km.state == XFRM_STATE_ACQ) {
1278 __xfrm_state_insert(x);
1284 spin_unlock_bh(&xfrm_state_lock);
1287 xfrm_state_put(to_put);
1293 xfrm_state_delete(x1);
1299 spin_lock_bh(&x1->lock);
1300 if (likely(x1->km.state == XFRM_STATE_VALID)) {
1301 if (x->encap && x1->encap)
1302 memcpy(x1->encap, x->encap, sizeof(*x1->encap));
1303 if (x->coaddr && x1->coaddr) {
1304 memcpy(x1->coaddr, x->coaddr, sizeof(*x1->coaddr));
1306 if (!use_spi && memcmp(&x1->sel, &x->sel, sizeof(x1->sel)))
1307 memcpy(&x1->sel, &x->sel, sizeof(x1->sel));
1308 memcpy(&x1->lft, &x->lft, sizeof(x1->lft));
1311 tasklet_hrtimer_start(&x1->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
1312 if (x1->curlft.use_time)
1313 xfrm_state_check_expire(x1);
1317 spin_unlock_bh(&x1->lock);
1323 EXPORT_SYMBOL(xfrm_state_update);
1325 int xfrm_state_check_expire(struct xfrm_state *x)
1327 if (!x->curlft.use_time)
1328 x->curlft.use_time = get_seconds();
1330 if (x->km.state != XFRM_STATE_VALID)
1333 if (x->curlft.bytes >= x->lft.hard_byte_limit ||
1334 x->curlft.packets >= x->lft.hard_packet_limit) {
1335 x->km.state = XFRM_STATE_EXPIRED;
1336 tasklet_hrtimer_start(&x->mtimer, ktime_set(0,0), HRTIMER_MODE_REL);
1341 (x->curlft.bytes >= x->lft.soft_byte_limit ||
1342 x->curlft.packets >= x->lft.soft_packet_limit)) {
1344 km_state_expired(x, 0, 0);
1348 EXPORT_SYMBOL(xfrm_state_check_expire);
1351 xfrm_state_lookup(struct net *net, xfrm_address_t *daddr, __be32 spi, u8 proto,
1352 unsigned short family)
1354 struct xfrm_state *x;
1356 spin_lock_bh(&xfrm_state_lock);
1357 x = __xfrm_state_lookup(net, daddr, spi, proto, family);
1358 spin_unlock_bh(&xfrm_state_lock);
1361 EXPORT_SYMBOL(xfrm_state_lookup);
1364 xfrm_state_lookup_byaddr(struct net *net,
1365 xfrm_address_t *daddr, xfrm_address_t *saddr,
1366 u8 proto, unsigned short family)
1368 struct xfrm_state *x;
1370 spin_lock_bh(&xfrm_state_lock);
1371 x = __xfrm_state_lookup_byaddr(net, daddr, saddr, proto, family);
1372 spin_unlock_bh(&xfrm_state_lock);
1375 EXPORT_SYMBOL(xfrm_state_lookup_byaddr);
1378 xfrm_find_acq(struct net *net, u8 mode, u32 reqid, u8 proto,
1379 xfrm_address_t *daddr, xfrm_address_t *saddr,
1380 int create, unsigned short family)
1382 struct xfrm_state *x;
1384 spin_lock_bh(&xfrm_state_lock);
1385 x = __find_acq_core(net, family, mode, reqid, proto, daddr, saddr, create);
1386 spin_unlock_bh(&xfrm_state_lock);
1390 EXPORT_SYMBOL(xfrm_find_acq);
1392 #ifdef CONFIG_XFRM_SUB_POLICY
1394 xfrm_tmpl_sort(struct xfrm_tmpl **dst, struct xfrm_tmpl **src, int n,
1395 unsigned short family)
1398 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
1400 return -EAFNOSUPPORT;
1402 spin_lock_bh(&xfrm_state_lock);
1403 if (afinfo->tmpl_sort)
1404 err = afinfo->tmpl_sort(dst, src, n);
1405 spin_unlock_bh(&xfrm_state_lock);
1406 xfrm_state_put_afinfo(afinfo);
1409 EXPORT_SYMBOL(xfrm_tmpl_sort);
1412 xfrm_state_sort(struct xfrm_state **dst, struct xfrm_state **src, int n,
1413 unsigned short family)
1416 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
1418 return -EAFNOSUPPORT;
1420 spin_lock_bh(&xfrm_state_lock);
1421 if (afinfo->state_sort)
1422 err = afinfo->state_sort(dst, src, n);
1423 spin_unlock_bh(&xfrm_state_lock);
1424 xfrm_state_put_afinfo(afinfo);
1427 EXPORT_SYMBOL(xfrm_state_sort);
1430 /* Silly enough, but I'm lazy to build resolution list */
1432 static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 seq)
1436 for (i = 0; i <= net->xfrm.state_hmask; i++) {
1437 struct hlist_node *entry;
1438 struct xfrm_state *x;
1440 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+i, bydst) {
1441 if (x->km.seq == seq &&
1442 x->km.state == XFRM_STATE_ACQ) {
1451 struct xfrm_state *xfrm_find_acq_byseq(struct net *net, u32 seq)
1453 struct xfrm_state *x;
1455 spin_lock_bh(&xfrm_state_lock);
1456 x = __xfrm_find_acq_byseq(net, seq);
1457 spin_unlock_bh(&xfrm_state_lock);
1460 EXPORT_SYMBOL(xfrm_find_acq_byseq);
1462 u32 xfrm_get_acqseq(void)
1466 static DEFINE_SPINLOCK(acqseq_lock);
1468 spin_lock_bh(&acqseq_lock);
1469 res = (++acqseq ? : ++acqseq);
1470 spin_unlock_bh(&acqseq_lock);
1473 EXPORT_SYMBOL(xfrm_get_acqseq);
1475 int xfrm_alloc_spi(struct xfrm_state *x, u32 low, u32 high)
1477 struct net *net = xs_net(x);
1479 struct xfrm_state *x0;
1481 __be32 minspi = htonl(low);
1482 __be32 maxspi = htonl(high);
1484 spin_lock_bh(&x->lock);
1485 if (x->km.state == XFRM_STATE_DEAD)
1494 if (minspi == maxspi) {
1495 x0 = xfrm_state_lookup(net, &x->id.daddr, minspi, x->id.proto, x->props.family);
1503 for (h=0; h<high-low+1; h++) {
1504 spi = low + net_random()%(high-low+1);
1505 x0 = xfrm_state_lookup(net, &x->id.daddr, htonl(spi), x->id.proto, x->props.family);
1507 x->id.spi = htonl(spi);
1514 spin_lock_bh(&xfrm_state_lock);
1515 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, x->props.family);
1516 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
1517 spin_unlock_bh(&xfrm_state_lock);
1523 spin_unlock_bh(&x->lock);
1527 EXPORT_SYMBOL(xfrm_alloc_spi);
1529 int xfrm_state_walk(struct net *net, struct xfrm_state_walk *walk,
1530 int (*func)(struct xfrm_state *, int, void*),
1533 struct xfrm_state *state;
1534 struct xfrm_state_walk *x;
1537 if (walk->seq != 0 && list_empty(&walk->all))
1540 spin_lock_bh(&xfrm_state_lock);
1541 if (list_empty(&walk->all))
1542 x = list_first_entry(&net->xfrm.state_all, struct xfrm_state_walk, all);
1544 x = list_entry(&walk->all, struct xfrm_state_walk, all);
1545 list_for_each_entry_from(x, &net->xfrm.state_all, all) {
1546 if (x->state == XFRM_STATE_DEAD)
1548 state = container_of(x, struct xfrm_state, km);
1549 if (!xfrm_id_proto_match(state->id.proto, walk->proto))
1551 err = func(state, walk->seq, data);
1553 list_move_tail(&walk->all, &x->all);
1558 if (walk->seq == 0) {
1562 list_del_init(&walk->all);
1564 spin_unlock_bh(&xfrm_state_lock);
1567 EXPORT_SYMBOL(xfrm_state_walk);
1569 void xfrm_state_walk_init(struct xfrm_state_walk *walk, u8 proto)
1571 INIT_LIST_HEAD(&walk->all);
1572 walk->proto = proto;
1573 walk->state = XFRM_STATE_DEAD;
1576 EXPORT_SYMBOL(xfrm_state_walk_init);
1578 void xfrm_state_walk_done(struct xfrm_state_walk *walk)
1580 if (list_empty(&walk->all))
1583 spin_lock_bh(&xfrm_state_lock);
1584 list_del(&walk->all);
1585 spin_unlock_bh(&xfrm_state_lock);
1587 EXPORT_SYMBOL(xfrm_state_walk_done);
1590 void xfrm_replay_notify(struct xfrm_state *x, int event)
1593 /* we send notify messages in case
1594 * 1. we updated on of the sequence numbers, and the seqno difference
1595 * is at least x->replay_maxdiff, in this case we also update the
1596 * timeout of our timer function
1597 * 2. if x->replay_maxage has elapsed since last update,
1598 * and there were changes
1600 * The state structure must be locked!
1604 case XFRM_REPLAY_UPDATE:
1605 if (x->replay_maxdiff &&
1606 (x->replay.seq - x->preplay.seq < x->replay_maxdiff) &&
1607 (x->replay.oseq - x->preplay.oseq < x->replay_maxdiff)) {
1608 if (x->xflags & XFRM_TIME_DEFER)
1609 event = XFRM_REPLAY_TIMEOUT;
1616 case XFRM_REPLAY_TIMEOUT:
1617 if ((x->replay.seq == x->preplay.seq) &&
1618 (x->replay.bitmap == x->preplay.bitmap) &&
1619 (x->replay.oseq == x->preplay.oseq)) {
1620 x->xflags |= XFRM_TIME_DEFER;
1627 memcpy(&x->preplay, &x->replay, sizeof(struct xfrm_replay_state));
1628 c.event = XFRM_MSG_NEWAE;
1629 c.data.aevent = event;
1630 km_state_notify(x, &c);
1632 if (x->replay_maxage &&
1633 !mod_timer(&x->rtimer, jiffies + x->replay_maxage))
1634 x->xflags &= ~XFRM_TIME_DEFER;
1637 static void xfrm_replay_timer_handler(unsigned long data)
1639 struct xfrm_state *x = (struct xfrm_state*)data;
1641 spin_lock(&x->lock);
1643 if (x->km.state == XFRM_STATE_VALID) {
1644 if (xfrm_aevent_is_on(xs_net(x)))
1645 xfrm_replay_notify(x, XFRM_REPLAY_TIMEOUT);
1647 x->xflags |= XFRM_TIME_DEFER;
1650 spin_unlock(&x->lock);
1653 int xfrm_replay_check(struct xfrm_state *x,
1654 struct sk_buff *skb, __be32 net_seq)
1657 u32 seq = ntohl(net_seq);
1659 if (unlikely(seq == 0))
1662 if (likely(seq > x->replay.seq))
1665 diff = x->replay.seq - seq;
1666 if (diff >= min_t(unsigned int, x->props.replay_window,
1667 sizeof(x->replay.bitmap) * 8)) {
1668 x->stats.replay_window++;
1672 if (x->replay.bitmap & (1U << diff)) {
1679 xfrm_audit_state_replay(x, skb, net_seq);
1683 void xfrm_replay_advance(struct xfrm_state *x, __be32 net_seq)
1686 u32 seq = ntohl(net_seq);
1688 if (seq > x->replay.seq) {
1689 diff = seq - x->replay.seq;
1690 if (diff < x->props.replay_window)
1691 x->replay.bitmap = ((x->replay.bitmap) << diff) | 1;
1693 x->replay.bitmap = 1;
1694 x->replay.seq = seq;
1696 diff = x->replay.seq - seq;
1697 x->replay.bitmap |= (1U << diff);
1700 if (xfrm_aevent_is_on(xs_net(x)))
1701 xfrm_replay_notify(x, XFRM_REPLAY_UPDATE);
1704 static LIST_HEAD(xfrm_km_list);
1705 static DEFINE_RWLOCK(xfrm_km_lock);
1707 void km_policy_notify(struct xfrm_policy *xp, int dir, struct km_event *c)
1709 struct xfrm_mgr *km;
1711 read_lock(&xfrm_km_lock);
1712 list_for_each_entry(km, &xfrm_km_list, list)
1713 if (km->notify_policy)
1714 km->notify_policy(xp, dir, c);
1715 read_unlock(&xfrm_km_lock);
1718 void km_state_notify(struct xfrm_state *x, struct km_event *c)
1720 struct xfrm_mgr *km;
1721 read_lock(&xfrm_km_lock);
1722 list_for_each_entry(km, &xfrm_km_list, list)
1725 read_unlock(&xfrm_km_lock);
1728 EXPORT_SYMBOL(km_policy_notify);
1729 EXPORT_SYMBOL(km_state_notify);
1731 void km_state_expired(struct xfrm_state *x, int hard, u32 pid)
1733 struct net *net = xs_net(x);
1738 c.event = XFRM_MSG_EXPIRE;
1739 km_state_notify(x, &c);
1742 wake_up(&net->xfrm.km_waitq);
1745 EXPORT_SYMBOL(km_state_expired);
1747 * We send to all registered managers regardless of failure
1748 * We are happy with one success
1750 int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol)
1752 int err = -EINVAL, acqret;
1753 struct xfrm_mgr *km;
1755 read_lock(&xfrm_km_lock);
1756 list_for_each_entry(km, &xfrm_km_list, list) {
1757 acqret = km->acquire(x, t, pol, XFRM_POLICY_OUT);
1761 read_unlock(&xfrm_km_lock);
1764 EXPORT_SYMBOL(km_query);
1766 int km_new_mapping(struct xfrm_state *x, xfrm_address_t *ipaddr, __be16 sport)
1769 struct xfrm_mgr *km;
1771 read_lock(&xfrm_km_lock);
1772 list_for_each_entry(km, &xfrm_km_list, list) {
1773 if (km->new_mapping)
1774 err = km->new_mapping(x, ipaddr, sport);
1778 read_unlock(&xfrm_km_lock);
1781 EXPORT_SYMBOL(km_new_mapping);
1783 void km_policy_expired(struct xfrm_policy *pol, int dir, int hard, u32 pid)
1785 struct net *net = xp_net(pol);
1790 c.event = XFRM_MSG_POLEXPIRE;
1791 km_policy_notify(pol, dir, &c);
1794 wake_up(&net->xfrm.km_waitq);
1796 EXPORT_SYMBOL(km_policy_expired);
1798 #ifdef CONFIG_XFRM_MIGRATE
1799 int km_migrate(struct xfrm_selector *sel, u8 dir, u8 type,
1800 struct xfrm_migrate *m, int num_migrate,
1801 struct xfrm_kmaddress *k)
1805 struct xfrm_mgr *km;
1807 read_lock(&xfrm_km_lock);
1808 list_for_each_entry(km, &xfrm_km_list, list) {
1810 ret = km->migrate(sel, dir, type, m, num_migrate, k);
1815 read_unlock(&xfrm_km_lock);
1818 EXPORT_SYMBOL(km_migrate);
1821 int km_report(struct net *net, u8 proto, struct xfrm_selector *sel, xfrm_address_t *addr)
1825 struct xfrm_mgr *km;
1827 read_lock(&xfrm_km_lock);
1828 list_for_each_entry(km, &xfrm_km_list, list) {
1830 ret = km->report(net, proto, sel, addr);
1835 read_unlock(&xfrm_km_lock);
1838 EXPORT_SYMBOL(km_report);
1840 int xfrm_user_policy(struct sock *sk, int optname, u8 __user *optval, int optlen)
1844 struct xfrm_mgr *km;
1845 struct xfrm_policy *pol = NULL;
1847 if (optlen <= 0 || optlen > PAGE_SIZE)
1850 data = kmalloc(optlen, GFP_KERNEL);
1855 if (copy_from_user(data, optval, optlen))
1859 read_lock(&xfrm_km_lock);
1860 list_for_each_entry(km, &xfrm_km_list, list) {
1861 pol = km->compile_policy(sk, optname, data,
1866 read_unlock(&xfrm_km_lock);
1869 xfrm_sk_policy_insert(sk, err, pol);
1878 EXPORT_SYMBOL(xfrm_user_policy);
1880 int xfrm_register_km(struct xfrm_mgr *km)
1882 write_lock_bh(&xfrm_km_lock);
1883 list_add_tail(&km->list, &xfrm_km_list);
1884 write_unlock_bh(&xfrm_km_lock);
1887 EXPORT_SYMBOL(xfrm_register_km);
1889 int xfrm_unregister_km(struct xfrm_mgr *km)
1891 write_lock_bh(&xfrm_km_lock);
1892 list_del(&km->list);
1893 write_unlock_bh(&xfrm_km_lock);
1896 EXPORT_SYMBOL(xfrm_unregister_km);
1898 int xfrm_state_register_afinfo(struct xfrm_state_afinfo *afinfo)
1901 if (unlikely(afinfo == NULL))
1903 if (unlikely(afinfo->family >= NPROTO))
1904 return -EAFNOSUPPORT;
1905 write_lock_bh(&xfrm_state_afinfo_lock);
1906 if (unlikely(xfrm_state_afinfo[afinfo->family] != NULL))
1909 xfrm_state_afinfo[afinfo->family] = afinfo;
1910 write_unlock_bh(&xfrm_state_afinfo_lock);
1913 EXPORT_SYMBOL(xfrm_state_register_afinfo);
1915 int xfrm_state_unregister_afinfo(struct xfrm_state_afinfo *afinfo)
1918 if (unlikely(afinfo == NULL))
1920 if (unlikely(afinfo->family >= NPROTO))
1921 return -EAFNOSUPPORT;
1922 write_lock_bh(&xfrm_state_afinfo_lock);
1923 if (likely(xfrm_state_afinfo[afinfo->family] != NULL)) {
1924 if (unlikely(xfrm_state_afinfo[afinfo->family] != afinfo))
1927 xfrm_state_afinfo[afinfo->family] = NULL;
1929 write_unlock_bh(&xfrm_state_afinfo_lock);
1932 EXPORT_SYMBOL(xfrm_state_unregister_afinfo);
1934 static struct xfrm_state_afinfo *xfrm_state_get_afinfo(unsigned int family)
1936 struct xfrm_state_afinfo *afinfo;
1937 if (unlikely(family >= NPROTO))
1939 read_lock(&xfrm_state_afinfo_lock);
1940 afinfo = xfrm_state_afinfo[family];
1941 if (unlikely(!afinfo))
1942 read_unlock(&xfrm_state_afinfo_lock);
1946 static void xfrm_state_put_afinfo(struct xfrm_state_afinfo *afinfo)
1947 __releases(xfrm_state_afinfo_lock)
1949 read_unlock(&xfrm_state_afinfo_lock);
1952 /* Temporarily located here until net/xfrm/xfrm_tunnel.c is created */
1953 void xfrm_state_delete_tunnel(struct xfrm_state *x)
1956 struct xfrm_state *t = x->tunnel;
1958 if (atomic_read(&t->tunnel_users) == 2)
1959 xfrm_state_delete(t);
1960 atomic_dec(&t->tunnel_users);
1965 EXPORT_SYMBOL(xfrm_state_delete_tunnel);
1967 int xfrm_state_mtu(struct xfrm_state *x, int mtu)
1971 spin_lock_bh(&x->lock);
1972 if (x->km.state == XFRM_STATE_VALID &&
1973 x->type && x->type->get_mtu)
1974 res = x->type->get_mtu(x, mtu);
1976 res = mtu - x->props.header_len;
1977 spin_unlock_bh(&x->lock);
1981 int xfrm_init_state(struct xfrm_state *x)
1983 struct xfrm_state_afinfo *afinfo;
1984 struct xfrm_mode *inner_mode;
1985 int family = x->props.family;
1988 err = -EAFNOSUPPORT;
1989 afinfo = xfrm_state_get_afinfo(family);
1994 if (afinfo->init_flags)
1995 err = afinfo->init_flags(x);
1997 xfrm_state_put_afinfo(afinfo);
2002 err = -EPROTONOSUPPORT;
2004 if (x->sel.family != AF_UNSPEC) {
2005 inner_mode = xfrm_get_mode(x->props.mode, x->sel.family);
2006 if (inner_mode == NULL)
2009 if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL) &&
2010 family != x->sel.family) {
2011 xfrm_put_mode(inner_mode);
2015 x->inner_mode = inner_mode;
2017 struct xfrm_mode *inner_mode_iaf;
2018 int iafamily = AF_INET;
2020 inner_mode = xfrm_get_mode(x->props.mode, x->props.family);
2021 if (inner_mode == NULL)
2024 if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL)) {
2025 xfrm_put_mode(inner_mode);
2028 x->inner_mode = inner_mode;
2030 if (x->props.family == AF_INET)
2031 iafamily = AF_INET6;
2033 inner_mode_iaf = xfrm_get_mode(x->props.mode, iafamily);
2034 if (inner_mode_iaf) {
2035 if (inner_mode_iaf->flags & XFRM_MODE_FLAG_TUNNEL)
2036 x->inner_mode_iaf = inner_mode_iaf;
2038 xfrm_put_mode(inner_mode_iaf);
2042 x->type = xfrm_get_type(x->id.proto, family);
2043 if (x->type == NULL)
2046 err = x->type->init_state(x);
2050 x->outer_mode = xfrm_get_mode(x->props.mode, family);
2051 if (x->outer_mode == NULL)
2054 x->km.state = XFRM_STATE_VALID;
2060 EXPORT_SYMBOL(xfrm_init_state);
2062 int __net_init xfrm_state_init(struct net *net)
2066 INIT_LIST_HEAD(&net->xfrm.state_all);
2068 sz = sizeof(struct hlist_head) * 8;
2070 net->xfrm.state_bydst = xfrm_hash_alloc(sz);
2071 if (!net->xfrm.state_bydst)
2073 net->xfrm.state_bysrc = xfrm_hash_alloc(sz);
2074 if (!net->xfrm.state_bysrc)
2076 net->xfrm.state_byspi = xfrm_hash_alloc(sz);
2077 if (!net->xfrm.state_byspi)
2079 net->xfrm.state_hmask = ((sz / sizeof(struct hlist_head)) - 1);
2081 net->xfrm.state_num = 0;
2082 INIT_WORK(&net->xfrm.state_hash_work, xfrm_hash_resize);
2083 INIT_HLIST_HEAD(&net->xfrm.state_gc_list);
2084 INIT_WORK(&net->xfrm.state_gc_work, xfrm_state_gc_task);
2085 init_waitqueue_head(&net->xfrm.km_waitq);
2089 xfrm_hash_free(net->xfrm.state_bysrc, sz);
2091 xfrm_hash_free(net->xfrm.state_bydst, sz);
2096 void xfrm_state_fini(struct net *net)
2098 struct xfrm_audit audit_info;
2101 flush_work(&net->xfrm.state_hash_work);
2102 audit_info.loginuid = -1;
2103 audit_info.sessionid = -1;
2104 audit_info.secid = 0;
2105 xfrm_state_flush(net, IPSEC_PROTO_ANY, &audit_info);
2106 flush_work(&net->xfrm.state_gc_work);
2108 WARN_ON(!list_empty(&net->xfrm.state_all));
2110 sz = (net->xfrm.state_hmask + 1) * sizeof(struct hlist_head);
2111 WARN_ON(!hlist_empty(net->xfrm.state_byspi));
2112 xfrm_hash_free(net->xfrm.state_byspi, sz);
2113 WARN_ON(!hlist_empty(net->xfrm.state_bysrc));
2114 xfrm_hash_free(net->xfrm.state_bysrc, sz);
2115 WARN_ON(!hlist_empty(net->xfrm.state_bydst));
2116 xfrm_hash_free(net->xfrm.state_bydst, sz);
2119 #ifdef CONFIG_AUDITSYSCALL
2120 static void xfrm_audit_helper_sainfo(struct xfrm_state *x,
2121 struct audit_buffer *audit_buf)
2123 struct xfrm_sec_ctx *ctx = x->security;
2124 u32 spi = ntohl(x->id.spi);
2127 audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
2128 ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
2130 switch(x->props.family) {
2132 audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
2133 &x->props.saddr.a4, &x->id.daddr.a4);
2136 audit_log_format(audit_buf, " src=%pI6 dst=%pI6",
2137 x->props.saddr.a6, x->id.daddr.a6);
2141 audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
2144 static void xfrm_audit_helper_pktinfo(struct sk_buff *skb, u16 family,
2145 struct audit_buffer *audit_buf)
2148 struct ipv6hdr *iph6;
2153 audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
2154 &iph4->saddr, &iph4->daddr);
2157 iph6 = ipv6_hdr(skb);
2158 audit_log_format(audit_buf,
2159 " src=%pI6 dst=%pI6 flowlbl=0x%x%02x%02x",
2160 &iph6->saddr,&iph6->daddr,
2161 iph6->flow_lbl[0] & 0x0f,
2168 void xfrm_audit_state_add(struct xfrm_state *x, int result,
2169 uid_t auid, u32 sessionid, u32 secid)
2171 struct audit_buffer *audit_buf;
2173 audit_buf = xfrm_audit_start("SAD-add");
2174 if (audit_buf == NULL)
2176 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2177 xfrm_audit_helper_sainfo(x, audit_buf);
2178 audit_log_format(audit_buf, " res=%u", result);
2179 audit_log_end(audit_buf);
2181 EXPORT_SYMBOL_GPL(xfrm_audit_state_add);
2183 void xfrm_audit_state_delete(struct xfrm_state *x, int result,
2184 uid_t auid, u32 sessionid, u32 secid)
2186 struct audit_buffer *audit_buf;
2188 audit_buf = xfrm_audit_start("SAD-delete");
2189 if (audit_buf == NULL)
2191 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2192 xfrm_audit_helper_sainfo(x, audit_buf);
2193 audit_log_format(audit_buf, " res=%u", result);
2194 audit_log_end(audit_buf);
2196 EXPORT_SYMBOL_GPL(xfrm_audit_state_delete);
2198 void xfrm_audit_state_replay_overflow(struct xfrm_state *x,
2199 struct sk_buff *skb)
2201 struct audit_buffer *audit_buf;
2204 audit_buf = xfrm_audit_start("SA-replay-overflow");
2205 if (audit_buf == NULL)
2207 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2208 /* don't record the sequence number because it's inherent in this kind
2209 * of audit message */
2210 spi = ntohl(x->id.spi);
2211 audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
2212 audit_log_end(audit_buf);
2214 EXPORT_SYMBOL_GPL(xfrm_audit_state_replay_overflow);
2216 static void xfrm_audit_state_replay(struct xfrm_state *x,
2217 struct sk_buff *skb, __be32 net_seq)
2219 struct audit_buffer *audit_buf;
2222 audit_buf = xfrm_audit_start("SA-replayed-pkt");
2223 if (audit_buf == NULL)
2225 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2226 spi = ntohl(x->id.spi);
2227 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2228 spi, spi, ntohl(net_seq));
2229 audit_log_end(audit_buf);
2232 void xfrm_audit_state_notfound_simple(struct sk_buff *skb, u16 family)
2234 struct audit_buffer *audit_buf;
2236 audit_buf = xfrm_audit_start("SA-notfound");
2237 if (audit_buf == NULL)
2239 xfrm_audit_helper_pktinfo(skb, family, audit_buf);
2240 audit_log_end(audit_buf);
2242 EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound_simple);
2244 void xfrm_audit_state_notfound(struct sk_buff *skb, u16 family,
2245 __be32 net_spi, __be32 net_seq)
2247 struct audit_buffer *audit_buf;
2250 audit_buf = xfrm_audit_start("SA-notfound");
2251 if (audit_buf == NULL)
2253 xfrm_audit_helper_pktinfo(skb, family, audit_buf);
2254 spi = ntohl(net_spi);
2255 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2256 spi, spi, ntohl(net_seq));
2257 audit_log_end(audit_buf);
2259 EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound);
2261 void xfrm_audit_state_icvfail(struct xfrm_state *x,
2262 struct sk_buff *skb, u8 proto)
2264 struct audit_buffer *audit_buf;
2268 audit_buf = xfrm_audit_start("SA-icv-failure");
2269 if (audit_buf == NULL)
2271 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2272 if (xfrm_parse_spi(skb, proto, &net_spi, &net_seq) == 0) {
2273 u32 spi = ntohl(net_spi);
2274 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2275 spi, spi, ntohl(net_seq));
2277 audit_log_end(audit_buf);
2279 EXPORT_SYMBOL_GPL(xfrm_audit_state_icvfail);
2280 #endif /* CONFIG_AUDITSYSCALL */