6 * Kazunori MIYAZAWA @USAGI
9 * YOSHIFUJI Hideaki @USAGI
10 * Split up af-specific functions
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/slab.h>
26 #include <linux/interrupt.h>
27 #include <linux/kernel.h>
29 #include "xfrm_hash.h"
31 /* Each xfrm_state may be linked to two tables:
33 1. Hash table by (spi,daddr,ah/esp) to find SA by SPI. (input,ctl)
34 2. Hash table by (daddr,family,reqid) to find what SAs exist for given
35 destination/tunnel endpoint. (output)
38 static DEFINE_SPINLOCK(xfrm_state_lock);
40 static unsigned int xfrm_state_hashmax __read_mostly = 1 * 1024 * 1024;
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 const xfrm_address_t *daddr,
54 const 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 const xfrm_address_t *daddr,
63 const 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, const xfrm_address_t *daddr,
71 __be32 spi, u8 proto, unsigned short family)
73 return __xfrm_spi_hash(daddr, spi, proto, family, net->xfrm.state_hmask);
76 static void xfrm_hash_transfer(struct hlist_head *list,
77 struct hlist_head *ndsttable,
78 struct hlist_head *nsrctable,
79 struct hlist_head *nspitable,
80 unsigned int nhashmask)
82 struct hlist_node *entry, *tmp;
85 hlist_for_each_entry_safe(x, entry, tmp, list, bydst) {
88 h = __xfrm_dst_hash(&x->id.daddr, &x->props.saddr,
89 x->props.reqid, x->props.family,
91 hlist_add_head(&x->bydst, ndsttable+h);
93 h = __xfrm_src_hash(&x->id.daddr, &x->props.saddr,
96 hlist_add_head(&x->bysrc, nsrctable+h);
99 h = __xfrm_spi_hash(&x->id.daddr, x->id.spi,
100 x->id.proto, x->props.family,
102 hlist_add_head(&x->byspi, nspitable+h);
107 static unsigned long xfrm_hash_new_size(unsigned int state_hmask)
109 return ((state_hmask + 1) << 1) * sizeof(struct hlist_head);
112 static DEFINE_MUTEX(hash_resize_mutex);
114 static void xfrm_hash_resize(struct work_struct *work)
116 struct net *net = container_of(work, struct net, xfrm.state_hash_work);
117 struct hlist_head *ndst, *nsrc, *nspi, *odst, *osrc, *ospi;
118 unsigned long nsize, osize;
119 unsigned int nhashmask, ohashmask;
122 mutex_lock(&hash_resize_mutex);
124 nsize = xfrm_hash_new_size(net->xfrm.state_hmask);
125 ndst = xfrm_hash_alloc(nsize);
128 nsrc = xfrm_hash_alloc(nsize);
130 xfrm_hash_free(ndst, nsize);
133 nspi = xfrm_hash_alloc(nsize);
135 xfrm_hash_free(ndst, nsize);
136 xfrm_hash_free(nsrc, nsize);
140 spin_lock_bh(&xfrm_state_lock);
142 nhashmask = (nsize / sizeof(struct hlist_head)) - 1U;
143 for (i = net->xfrm.state_hmask; i >= 0; i--)
144 xfrm_hash_transfer(net->xfrm.state_bydst+i, ndst, nsrc, nspi,
147 odst = net->xfrm.state_bydst;
148 osrc = net->xfrm.state_bysrc;
149 ospi = net->xfrm.state_byspi;
150 ohashmask = net->xfrm.state_hmask;
152 net->xfrm.state_bydst = ndst;
153 net->xfrm.state_bysrc = nsrc;
154 net->xfrm.state_byspi = nspi;
155 net->xfrm.state_hmask = nhashmask;
157 spin_unlock_bh(&xfrm_state_lock);
159 osize = (ohashmask + 1) * sizeof(struct hlist_head);
160 xfrm_hash_free(odst, osize);
161 xfrm_hash_free(osrc, osize);
162 xfrm_hash_free(ospi, osize);
165 mutex_unlock(&hash_resize_mutex);
168 static DEFINE_RWLOCK(xfrm_state_afinfo_lock);
169 static struct xfrm_state_afinfo *xfrm_state_afinfo[NPROTO];
171 static DEFINE_SPINLOCK(xfrm_state_gc_lock);
173 int __xfrm_state_delete(struct xfrm_state *x);
175 int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol);
176 void km_state_expired(struct xfrm_state *x, int hard, u32 pid);
178 static struct xfrm_state_afinfo *xfrm_state_lock_afinfo(unsigned int family)
180 struct xfrm_state_afinfo *afinfo;
181 if (unlikely(family >= NPROTO))
183 write_lock_bh(&xfrm_state_afinfo_lock);
184 afinfo = xfrm_state_afinfo[family];
185 if (unlikely(!afinfo))
186 write_unlock_bh(&xfrm_state_afinfo_lock);
190 static void xfrm_state_unlock_afinfo(struct xfrm_state_afinfo *afinfo)
191 __releases(xfrm_state_afinfo_lock)
193 write_unlock_bh(&xfrm_state_afinfo_lock);
196 int xfrm_register_type(const struct xfrm_type *type, unsigned short family)
198 struct xfrm_state_afinfo *afinfo = xfrm_state_lock_afinfo(family);
199 const struct xfrm_type **typemap;
202 if (unlikely(afinfo == NULL))
203 return -EAFNOSUPPORT;
204 typemap = afinfo->type_map;
206 if (likely(typemap[type->proto] == NULL))
207 typemap[type->proto] = type;
210 xfrm_state_unlock_afinfo(afinfo);
213 EXPORT_SYMBOL(xfrm_register_type);
215 int xfrm_unregister_type(const struct xfrm_type *type, unsigned short family)
217 struct xfrm_state_afinfo *afinfo = xfrm_state_lock_afinfo(family);
218 const struct xfrm_type **typemap;
221 if (unlikely(afinfo == NULL))
222 return -EAFNOSUPPORT;
223 typemap = afinfo->type_map;
225 if (unlikely(typemap[type->proto] != type))
228 typemap[type->proto] = NULL;
229 xfrm_state_unlock_afinfo(afinfo);
232 EXPORT_SYMBOL(xfrm_unregister_type);
234 static const struct xfrm_type *xfrm_get_type(u8 proto, unsigned short family)
236 struct xfrm_state_afinfo *afinfo;
237 const struct xfrm_type **typemap;
238 const struct xfrm_type *type;
239 int modload_attempted = 0;
242 afinfo = xfrm_state_get_afinfo(family);
243 if (unlikely(afinfo == NULL))
245 typemap = afinfo->type_map;
247 type = typemap[proto];
248 if (unlikely(type && !try_module_get(type->owner)))
250 if (!type && !modload_attempted) {
251 xfrm_state_put_afinfo(afinfo);
252 request_module("xfrm-type-%d-%d", family, proto);
253 modload_attempted = 1;
257 xfrm_state_put_afinfo(afinfo);
261 static void xfrm_put_type(const struct xfrm_type *type)
263 module_put(type->owner);
266 int xfrm_register_mode(struct xfrm_mode *mode, int family)
268 struct xfrm_state_afinfo *afinfo;
269 struct xfrm_mode **modemap;
272 if (unlikely(mode->encap >= XFRM_MODE_MAX))
275 afinfo = xfrm_state_lock_afinfo(family);
276 if (unlikely(afinfo == NULL))
277 return -EAFNOSUPPORT;
280 modemap = afinfo->mode_map;
281 if (modemap[mode->encap])
285 if (!try_module_get(afinfo->owner))
288 mode->afinfo = afinfo;
289 modemap[mode->encap] = mode;
293 xfrm_state_unlock_afinfo(afinfo);
296 EXPORT_SYMBOL(xfrm_register_mode);
298 int xfrm_unregister_mode(struct xfrm_mode *mode, int family)
300 struct xfrm_state_afinfo *afinfo;
301 struct xfrm_mode **modemap;
304 if (unlikely(mode->encap >= XFRM_MODE_MAX))
307 afinfo = xfrm_state_lock_afinfo(family);
308 if (unlikely(afinfo == NULL))
309 return -EAFNOSUPPORT;
312 modemap = afinfo->mode_map;
313 if (likely(modemap[mode->encap] == mode)) {
314 modemap[mode->encap] = NULL;
315 module_put(mode->afinfo->owner);
319 xfrm_state_unlock_afinfo(afinfo);
322 EXPORT_SYMBOL(xfrm_unregister_mode);
324 static struct xfrm_mode *xfrm_get_mode(unsigned int encap, int family)
326 struct xfrm_state_afinfo *afinfo;
327 struct xfrm_mode *mode;
328 int modload_attempted = 0;
330 if (unlikely(encap >= XFRM_MODE_MAX))
334 afinfo = xfrm_state_get_afinfo(family);
335 if (unlikely(afinfo == NULL))
338 mode = afinfo->mode_map[encap];
339 if (unlikely(mode && !try_module_get(mode->owner)))
341 if (!mode && !modload_attempted) {
342 xfrm_state_put_afinfo(afinfo);
343 request_module("xfrm-mode-%d-%d", family, encap);
344 modload_attempted = 1;
348 xfrm_state_put_afinfo(afinfo);
352 static void xfrm_put_mode(struct xfrm_mode *mode)
354 module_put(mode->owner);
357 static void xfrm_state_gc_destroy(struct xfrm_state *x)
359 tasklet_hrtimer_cancel(&x->mtimer);
360 del_timer_sync(&x->rtimer);
367 xfrm_put_mode(x->inner_mode);
368 if (x->inner_mode_iaf)
369 xfrm_put_mode(x->inner_mode_iaf);
371 xfrm_put_mode(x->outer_mode);
373 x->type->destructor(x);
374 xfrm_put_type(x->type);
376 security_xfrm_state_free(x);
380 static void xfrm_state_gc_task(struct work_struct *work)
382 struct net *net = container_of(work, struct net, xfrm.state_gc_work);
383 struct xfrm_state *x;
384 struct hlist_node *entry, *tmp;
385 struct hlist_head gc_list;
387 spin_lock_bh(&xfrm_state_gc_lock);
388 hlist_move_list(&net->xfrm.state_gc_list, &gc_list);
389 spin_unlock_bh(&xfrm_state_gc_lock);
391 hlist_for_each_entry_safe(x, entry, tmp, &gc_list, gclist)
392 xfrm_state_gc_destroy(x);
394 wake_up(&net->xfrm.km_waitq);
397 static inline unsigned long make_jiffies(long secs)
399 if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
400 return MAX_SCHEDULE_TIMEOUT-1;
405 static enum hrtimer_restart xfrm_timer_handler(struct hrtimer * me)
407 struct tasklet_hrtimer *thr = container_of(me, struct tasklet_hrtimer, timer);
408 struct xfrm_state *x = container_of(thr, struct xfrm_state, mtimer);
409 struct net *net = xs_net(x);
410 unsigned long now = get_seconds();
411 long next = LONG_MAX;
416 if (x->km.state == XFRM_STATE_DEAD)
418 if (x->km.state == XFRM_STATE_EXPIRED)
420 if (x->lft.hard_add_expires_seconds) {
421 long tmo = x->lft.hard_add_expires_seconds +
422 x->curlft.add_time - now;
428 if (x->lft.hard_use_expires_seconds) {
429 long tmo = x->lft.hard_use_expires_seconds +
430 (x->curlft.use_time ? : now) - now;
438 if (x->lft.soft_add_expires_seconds) {
439 long tmo = x->lft.soft_add_expires_seconds +
440 x->curlft.add_time - now;
446 if (x->lft.soft_use_expires_seconds) {
447 long tmo = x->lft.soft_use_expires_seconds +
448 (x->curlft.use_time ? : now) - now;
457 km_state_expired(x, 0, 0);
459 if (next != LONG_MAX){
460 tasklet_hrtimer_start(&x->mtimer, ktime_set(next, 0), HRTIMER_MODE_REL);
466 if (x->km.state == XFRM_STATE_ACQ && x->id.spi == 0) {
467 x->km.state = XFRM_STATE_EXPIRED;
468 wake_up(&net->xfrm.km_waitq);
473 err = __xfrm_state_delete(x);
474 if (!err && x->id.spi)
475 km_state_expired(x, 1, 0);
477 xfrm_audit_state_delete(x, err ? 0 : 1,
478 audit_get_loginuid(current),
479 audit_get_sessionid(current), 0);
482 spin_unlock(&x->lock);
483 return HRTIMER_NORESTART;
486 static void xfrm_replay_timer_handler(unsigned long data);
488 struct xfrm_state *xfrm_state_alloc(struct net *net)
490 struct xfrm_state *x;
492 x = kzalloc(sizeof(struct xfrm_state), GFP_ATOMIC);
495 write_pnet(&x->xs_net, net);
496 atomic_set(&x->refcnt, 1);
497 atomic_set(&x->tunnel_users, 0);
498 INIT_LIST_HEAD(&x->km.all);
499 INIT_HLIST_NODE(&x->bydst);
500 INIT_HLIST_NODE(&x->bysrc);
501 INIT_HLIST_NODE(&x->byspi);
502 tasklet_hrtimer_init(&x->mtimer, xfrm_timer_handler, CLOCK_REALTIME, HRTIMER_MODE_ABS);
503 setup_timer(&x->rtimer, xfrm_replay_timer_handler,
505 x->curlft.add_time = get_seconds();
506 x->lft.soft_byte_limit = XFRM_INF;
507 x->lft.soft_packet_limit = XFRM_INF;
508 x->lft.hard_byte_limit = XFRM_INF;
509 x->lft.hard_packet_limit = XFRM_INF;
510 x->replay_maxage = 0;
511 x->replay_maxdiff = 0;
512 x->inner_mode = NULL;
513 x->inner_mode_iaf = NULL;
514 spin_lock_init(&x->lock);
518 EXPORT_SYMBOL(xfrm_state_alloc);
520 void __xfrm_state_destroy(struct xfrm_state *x)
522 struct net *net = xs_net(x);
524 WARN_ON(x->km.state != XFRM_STATE_DEAD);
526 spin_lock_bh(&xfrm_state_gc_lock);
527 hlist_add_head(&x->gclist, &net->xfrm.state_gc_list);
528 spin_unlock_bh(&xfrm_state_gc_lock);
529 schedule_work(&net->xfrm.state_gc_work);
531 EXPORT_SYMBOL(__xfrm_state_destroy);
533 int __xfrm_state_delete(struct xfrm_state *x)
535 struct net *net = xs_net(x);
538 if (x->km.state != XFRM_STATE_DEAD) {
539 x->km.state = XFRM_STATE_DEAD;
540 spin_lock(&xfrm_state_lock);
541 list_del(&x->km.all);
542 hlist_del(&x->bydst);
543 hlist_del(&x->bysrc);
545 hlist_del(&x->byspi);
546 net->xfrm.state_num--;
547 spin_unlock(&xfrm_state_lock);
549 /* All xfrm_state objects are created by xfrm_state_alloc.
550 * The xfrm_state_alloc call gives a reference, and that
551 * is what we are dropping here.
559 EXPORT_SYMBOL(__xfrm_state_delete);
561 int xfrm_state_delete(struct xfrm_state *x)
565 spin_lock_bh(&x->lock);
566 err = __xfrm_state_delete(x);
567 spin_unlock_bh(&x->lock);
571 EXPORT_SYMBOL(xfrm_state_delete);
573 #ifdef CONFIG_SECURITY_NETWORK_XFRM
575 xfrm_state_flush_secctx_check(struct net *net, u8 proto, struct xfrm_audit *audit_info)
579 for (i = 0; i <= net->xfrm.state_hmask; i++) {
580 struct hlist_node *entry;
581 struct xfrm_state *x;
583 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+i, bydst) {
584 if (xfrm_id_proto_match(x->id.proto, proto) &&
585 (err = security_xfrm_state_delete(x)) != 0) {
586 xfrm_audit_state_delete(x, 0,
587 audit_info->loginuid,
588 audit_info->sessionid,
599 xfrm_state_flush_secctx_check(struct net *net, u8 proto, struct xfrm_audit *audit_info)
605 int xfrm_state_flush(struct net *net, u8 proto, struct xfrm_audit *audit_info)
607 int i, err = 0, cnt = 0;
609 spin_lock_bh(&xfrm_state_lock);
610 err = xfrm_state_flush_secctx_check(net, proto, audit_info);
615 for (i = 0; i <= net->xfrm.state_hmask; i++) {
616 struct hlist_node *entry;
617 struct xfrm_state *x;
619 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+i, bydst) {
620 if (!xfrm_state_kern(x) &&
621 xfrm_id_proto_match(x->id.proto, proto)) {
623 spin_unlock_bh(&xfrm_state_lock);
625 err = xfrm_state_delete(x);
626 xfrm_audit_state_delete(x, err ? 0 : 1,
627 audit_info->loginuid,
628 audit_info->sessionid,
634 spin_lock_bh(&xfrm_state_lock);
643 spin_unlock_bh(&xfrm_state_lock);
644 wake_up(&net->xfrm.km_waitq);
647 EXPORT_SYMBOL(xfrm_state_flush);
649 void xfrm_sad_getinfo(struct net *net, struct xfrmk_sadinfo *si)
651 spin_lock_bh(&xfrm_state_lock);
652 si->sadcnt = net->xfrm.state_num;
653 si->sadhcnt = net->xfrm.state_hmask;
654 si->sadhmcnt = xfrm_state_hashmax;
655 spin_unlock_bh(&xfrm_state_lock);
657 EXPORT_SYMBOL(xfrm_sad_getinfo);
660 xfrm_init_tempstate(struct xfrm_state *x, const struct flowi *fl,
661 const struct xfrm_tmpl *tmpl,
662 xfrm_address_t *daddr, xfrm_address_t *saddr,
663 unsigned short family)
665 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
668 afinfo->init_tempsel(&x->sel, fl);
670 if (family != tmpl->encap_family) {
671 xfrm_state_put_afinfo(afinfo);
672 afinfo = xfrm_state_get_afinfo(tmpl->encap_family);
676 afinfo->init_temprop(x, tmpl, daddr, saddr);
677 xfrm_state_put_afinfo(afinfo);
681 static struct xfrm_state *__xfrm_state_lookup(struct net *net, u32 mark,
682 const xfrm_address_t *daddr,
683 __be32 spi, u8 proto,
684 unsigned short family)
686 unsigned int h = xfrm_spi_hash(net, daddr, spi, proto, family);
687 struct xfrm_state *x;
688 struct hlist_node *entry;
690 hlist_for_each_entry(x, entry, net->xfrm.state_byspi+h, byspi) {
691 if (x->props.family != family ||
693 x->id.proto != proto ||
694 xfrm_addr_cmp(&x->id.daddr, daddr, family))
697 if ((mark & x->mark.m) != x->mark.v)
706 static struct xfrm_state *__xfrm_state_lookup_byaddr(struct net *net, u32 mark,
707 const xfrm_address_t *daddr,
708 const xfrm_address_t *saddr,
709 u8 proto, unsigned short family)
711 unsigned int h = xfrm_src_hash(net, daddr, saddr, family);
712 struct xfrm_state *x;
713 struct hlist_node *entry;
715 hlist_for_each_entry(x, entry, net->xfrm.state_bysrc+h, bysrc) {
716 if (x->props.family != family ||
717 x->id.proto != proto ||
718 xfrm_addr_cmp(&x->id.daddr, daddr, family) ||
719 xfrm_addr_cmp(&x->props.saddr, saddr, family))
722 if ((mark & x->mark.m) != x->mark.v)
731 static inline struct xfrm_state *
732 __xfrm_state_locate(struct xfrm_state *x, int use_spi, int family)
734 struct net *net = xs_net(x);
735 u32 mark = x->mark.v & x->mark.m;
738 return __xfrm_state_lookup(net, mark, &x->id.daddr,
739 x->id.spi, x->id.proto, family);
741 return __xfrm_state_lookup_byaddr(net, mark,
744 x->id.proto, family);
747 static void xfrm_hash_grow_check(struct net *net, int have_hash_collision)
749 if (have_hash_collision &&
750 (net->xfrm.state_hmask + 1) < xfrm_state_hashmax &&
751 net->xfrm.state_num > net->xfrm.state_hmask)
752 schedule_work(&net->xfrm.state_hash_work);
755 static void xfrm_state_look_at(struct xfrm_policy *pol, struct xfrm_state *x,
756 const struct flowi *fl, unsigned short family,
757 xfrm_address_t *daddr, xfrm_address_t *saddr,
758 struct xfrm_state **best, int *acq_in_progress,
762 * 1. There is a valid state with matching selector. Done.
763 * 2. Valid state with inappropriate selector. Skip.
765 * Entering area of "sysdeps".
767 * 3. If state is not valid, selector is temporary, it selects
768 * only session which triggered previous resolution. Key
769 * manager will do something to install a state with proper
772 if (x->km.state == XFRM_STATE_VALID) {
773 if ((x->sel.family &&
774 !xfrm_selector_match(&x->sel, fl, x->sel.family)) ||
775 !security_xfrm_state_pol_flow_match(x, pol, fl))
779 (*best)->km.dying > x->km.dying ||
780 ((*best)->km.dying == x->km.dying &&
781 (*best)->curlft.add_time < x->curlft.add_time))
783 } else if (x->km.state == XFRM_STATE_ACQ) {
784 *acq_in_progress = 1;
785 } else if (x->km.state == XFRM_STATE_ERROR ||
786 x->km.state == XFRM_STATE_EXPIRED) {
787 if (xfrm_selector_match(&x->sel, fl, x->sel.family) &&
788 security_xfrm_state_pol_flow_match(x, pol, fl))
794 xfrm_state_find(xfrm_address_t *daddr, xfrm_address_t *saddr,
795 const struct flowi *fl, struct xfrm_tmpl *tmpl,
796 struct xfrm_policy *pol, int *err,
797 unsigned short family)
799 static xfrm_address_t saddr_wildcard = { };
800 struct net *net = xp_net(pol);
801 unsigned int h, h_wildcard;
802 struct hlist_node *entry;
803 struct xfrm_state *x, *x0, *to_put;
804 int acquire_in_progress = 0;
806 struct xfrm_state *best = NULL;
807 u32 mark = pol->mark.v & pol->mark.m;
808 unsigned short encap_family = tmpl->encap_family;
812 spin_lock_bh(&xfrm_state_lock);
813 h = xfrm_dst_hash(net, daddr, saddr, tmpl->reqid, encap_family);
814 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
815 if (x->props.family == encap_family &&
816 x->props.reqid == tmpl->reqid &&
817 (mark & x->mark.m) == x->mark.v &&
818 !(x->props.flags & XFRM_STATE_WILDRECV) &&
819 xfrm_state_addr_check(x, daddr, saddr, encap_family) &&
820 tmpl->mode == x->props.mode &&
821 tmpl->id.proto == x->id.proto &&
822 (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
823 xfrm_state_look_at(pol, x, fl, encap_family, daddr, saddr,
824 &best, &acquire_in_progress, &error);
829 h_wildcard = xfrm_dst_hash(net, daddr, &saddr_wildcard, tmpl->reqid, encap_family);
830 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h_wildcard, bydst) {
831 if (x->props.family == encap_family &&
832 x->props.reqid == tmpl->reqid &&
833 (mark & x->mark.m) == x->mark.v &&
834 !(x->props.flags & XFRM_STATE_WILDRECV) &&
835 xfrm_state_addr_check(x, daddr, saddr, encap_family) &&
836 tmpl->mode == x->props.mode &&
837 tmpl->id.proto == x->id.proto &&
838 (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
839 xfrm_state_look_at(pol, x, fl, encap_family, daddr, saddr,
840 &best, &acquire_in_progress, &error);
845 if (!x && !error && !acquire_in_progress) {
847 (x0 = __xfrm_state_lookup(net, mark, daddr, tmpl->id.spi,
848 tmpl->id.proto, encap_family)) != NULL) {
853 x = xfrm_state_alloc(net);
858 /* Initialize temporary state matching only
859 * to current session. */
860 xfrm_init_tempstate(x, fl, tmpl, daddr, saddr, family);
861 memcpy(&x->mark, &pol->mark, sizeof(x->mark));
863 error = security_xfrm_state_alloc_acquire(x, pol->security, fl->secid);
865 x->km.state = XFRM_STATE_DEAD;
871 if (km_query(x, tmpl, pol) == 0) {
872 x->km.state = XFRM_STATE_ACQ;
873 list_add(&x->km.all, &net->xfrm.state_all);
874 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
875 h = xfrm_src_hash(net, daddr, saddr, encap_family);
876 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
878 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, encap_family);
879 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
881 x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
882 tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
883 net->xfrm.state_num++;
884 xfrm_hash_grow_check(net, x->bydst.next != NULL);
886 x->km.state = XFRM_STATE_DEAD;
896 *err = acquire_in_progress ? -EAGAIN : error;
897 spin_unlock_bh(&xfrm_state_lock);
899 xfrm_state_put(to_put);
904 xfrm_stateonly_find(struct net *net, u32 mark,
905 xfrm_address_t *daddr, xfrm_address_t *saddr,
906 unsigned short family, u8 mode, u8 proto, u32 reqid)
909 struct xfrm_state *rx = NULL, *x = NULL;
910 struct hlist_node *entry;
912 spin_lock(&xfrm_state_lock);
913 h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
914 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
915 if (x->props.family == family &&
916 x->props.reqid == reqid &&
917 (mark & x->mark.m) == x->mark.v &&
918 !(x->props.flags & XFRM_STATE_WILDRECV) &&
919 xfrm_state_addr_check(x, daddr, saddr, family) &&
920 mode == x->props.mode &&
921 proto == x->id.proto &&
922 x->km.state == XFRM_STATE_VALID) {
930 spin_unlock(&xfrm_state_lock);
935 EXPORT_SYMBOL(xfrm_stateonly_find);
937 static void __xfrm_state_insert(struct xfrm_state *x)
939 struct net *net = xs_net(x);
942 list_add(&x->km.all, &net->xfrm.state_all);
944 h = xfrm_dst_hash(net, &x->id.daddr, &x->props.saddr,
945 x->props.reqid, x->props.family);
946 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
948 h = xfrm_src_hash(net, &x->id.daddr, &x->props.saddr, x->props.family);
949 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
952 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto,
955 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
958 tasklet_hrtimer_start(&x->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
959 if (x->replay_maxage)
960 mod_timer(&x->rtimer, jiffies + x->replay_maxage);
962 wake_up(&net->xfrm.km_waitq);
964 net->xfrm.state_num++;
966 xfrm_hash_grow_check(net, x->bydst.next != NULL);
969 /* xfrm_state_lock is held */
970 static void __xfrm_state_bump_genids(struct xfrm_state *xnew)
972 struct net *net = xs_net(xnew);
973 unsigned short family = xnew->props.family;
974 u32 reqid = xnew->props.reqid;
975 struct xfrm_state *x;
976 struct hlist_node *entry;
978 u32 mark = xnew->mark.v & xnew->mark.m;
980 h = xfrm_dst_hash(net, &xnew->id.daddr, &xnew->props.saddr, reqid, family);
981 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
982 if (x->props.family == family &&
983 x->props.reqid == reqid &&
984 (mark & x->mark.m) == x->mark.v &&
985 !xfrm_addr_cmp(&x->id.daddr, &xnew->id.daddr, family) &&
986 !xfrm_addr_cmp(&x->props.saddr, &xnew->props.saddr, family))
991 void xfrm_state_insert(struct xfrm_state *x)
993 spin_lock_bh(&xfrm_state_lock);
994 __xfrm_state_bump_genids(x);
995 __xfrm_state_insert(x);
996 spin_unlock_bh(&xfrm_state_lock);
998 EXPORT_SYMBOL(xfrm_state_insert);
1000 /* xfrm_state_lock is held */
1001 static struct xfrm_state *__find_acq_core(struct net *net, struct xfrm_mark *m, unsigned short family, u8 mode, u32 reqid, u8 proto, xfrm_address_t *daddr, xfrm_address_t *saddr, int create)
1003 unsigned int h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
1004 struct hlist_node *entry;
1005 struct xfrm_state *x;
1006 u32 mark = m->v & m->m;
1008 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
1009 if (x->props.reqid != reqid ||
1010 x->props.mode != mode ||
1011 x->props.family != family ||
1012 x->km.state != XFRM_STATE_ACQ ||
1014 x->id.proto != proto ||
1015 (mark & x->mark.m) != x->mark.v ||
1016 xfrm_addr_cmp(&x->id.daddr, daddr, family) ||
1017 xfrm_addr_cmp(&x->props.saddr, saddr, family))
1027 x = xfrm_state_alloc(net);
1031 x->sel.daddr.a4 = daddr->a4;
1032 x->sel.saddr.a4 = saddr->a4;
1033 x->sel.prefixlen_d = 32;
1034 x->sel.prefixlen_s = 32;
1035 x->props.saddr.a4 = saddr->a4;
1036 x->id.daddr.a4 = daddr->a4;
1040 ipv6_addr_copy((struct in6_addr *)x->sel.daddr.a6,
1041 (struct in6_addr *)daddr);
1042 ipv6_addr_copy((struct in6_addr *)x->sel.saddr.a6,
1043 (struct in6_addr *)saddr);
1044 x->sel.prefixlen_d = 128;
1045 x->sel.prefixlen_s = 128;
1046 ipv6_addr_copy((struct in6_addr *)x->props.saddr.a6,
1047 (struct in6_addr *)saddr);
1048 ipv6_addr_copy((struct in6_addr *)x->id.daddr.a6,
1049 (struct in6_addr *)daddr);
1053 x->km.state = XFRM_STATE_ACQ;
1054 x->id.proto = proto;
1055 x->props.family = family;
1056 x->props.mode = mode;
1057 x->props.reqid = reqid;
1060 x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
1062 tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
1063 list_add(&x->km.all, &net->xfrm.state_all);
1064 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
1065 h = xfrm_src_hash(net, daddr, saddr, family);
1066 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
1068 net->xfrm.state_num++;
1070 xfrm_hash_grow_check(net, x->bydst.next != NULL);
1076 static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq);
1078 int xfrm_state_add(struct xfrm_state *x)
1080 struct net *net = xs_net(x);
1081 struct xfrm_state *x1, *to_put;
1084 u32 mark = x->mark.v & x->mark.m;
1085 int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
1087 family = x->props.family;
1091 spin_lock_bh(&xfrm_state_lock);
1093 x1 = __xfrm_state_locate(x, use_spi, family);
1101 if (use_spi && x->km.seq) {
1102 x1 = __xfrm_find_acq_byseq(net, mark, x->km.seq);
1103 if (x1 && ((x1->id.proto != x->id.proto) ||
1104 xfrm_addr_cmp(&x1->id.daddr, &x->id.daddr, family))) {
1111 x1 = __find_acq_core(net, &x->mark, family, x->props.mode,
1112 x->props.reqid, x->id.proto,
1113 &x->id.daddr, &x->props.saddr, 0);
1115 __xfrm_state_bump_genids(x);
1116 __xfrm_state_insert(x);
1120 spin_unlock_bh(&xfrm_state_lock);
1123 xfrm_state_delete(x1);
1128 xfrm_state_put(to_put);
1132 EXPORT_SYMBOL(xfrm_state_add);
1134 #ifdef CONFIG_XFRM_MIGRATE
1135 static struct xfrm_state *xfrm_state_clone(struct xfrm_state *orig, int *errp)
1137 struct net *net = xs_net(orig);
1139 struct xfrm_state *x = xfrm_state_alloc(net);
1143 memcpy(&x->id, &orig->id, sizeof(x->id));
1144 memcpy(&x->sel, &orig->sel, sizeof(x->sel));
1145 memcpy(&x->lft, &orig->lft, sizeof(x->lft));
1146 x->props.mode = orig->props.mode;
1147 x->props.replay_window = orig->props.replay_window;
1148 x->props.reqid = orig->props.reqid;
1149 x->props.family = orig->props.family;
1150 x->props.saddr = orig->props.saddr;
1153 x->aalg = xfrm_algo_auth_clone(orig->aalg);
1157 x->props.aalgo = orig->props.aalgo;
1160 x->ealg = xfrm_algo_clone(orig->ealg);
1164 x->props.ealgo = orig->props.ealgo;
1167 x->calg = xfrm_algo_clone(orig->calg);
1171 x->props.calgo = orig->props.calgo;
1174 x->encap = kmemdup(orig->encap, sizeof(*x->encap), GFP_KERNEL);
1180 x->coaddr = kmemdup(orig->coaddr, sizeof(*x->coaddr),
1186 memcpy(&x->mark, &orig->mark, sizeof(x->mark));
1188 err = xfrm_init_state(x);
1192 x->props.flags = orig->props.flags;
1194 x->curlft.add_time = orig->curlft.add_time;
1195 x->km.state = orig->km.state;
1196 x->km.seq = orig->km.seq;
1208 /* xfrm_state_lock is held */
1209 struct xfrm_state * xfrm_migrate_state_find(struct xfrm_migrate *m)
1212 struct xfrm_state *x;
1213 struct hlist_node *entry;
1216 h = xfrm_dst_hash(&init_net, &m->old_daddr, &m->old_saddr,
1217 m->reqid, m->old_family);
1218 hlist_for_each_entry(x, entry, init_net.xfrm.state_bydst+h, bydst) {
1219 if (x->props.mode != m->mode ||
1220 x->id.proto != m->proto)
1222 if (m->reqid && x->props.reqid != m->reqid)
1224 if (xfrm_addr_cmp(&x->id.daddr, &m->old_daddr,
1226 xfrm_addr_cmp(&x->props.saddr, &m->old_saddr,
1233 h = xfrm_src_hash(&init_net, &m->old_daddr, &m->old_saddr,
1235 hlist_for_each_entry(x, entry, init_net.xfrm.state_bysrc+h, bysrc) {
1236 if (x->props.mode != m->mode ||
1237 x->id.proto != m->proto)
1239 if (xfrm_addr_cmp(&x->id.daddr, &m->old_daddr,
1241 xfrm_addr_cmp(&x->props.saddr, &m->old_saddr,
1251 EXPORT_SYMBOL(xfrm_migrate_state_find);
1253 struct xfrm_state * xfrm_state_migrate(struct xfrm_state *x,
1254 struct xfrm_migrate *m)
1256 struct xfrm_state *xc;
1259 xc = xfrm_state_clone(x, &err);
1263 memcpy(&xc->id.daddr, &m->new_daddr, sizeof(xc->id.daddr));
1264 memcpy(&xc->props.saddr, &m->new_saddr, sizeof(xc->props.saddr));
1267 if (!xfrm_addr_cmp(&x->id.daddr, &m->new_daddr, m->new_family)) {
1268 /* a care is needed when the destination address of the
1269 state is to be updated as it is a part of triplet */
1270 xfrm_state_insert(xc);
1272 if ((err = xfrm_state_add(xc)) < 0)
1281 EXPORT_SYMBOL(xfrm_state_migrate);
1284 int xfrm_state_update(struct xfrm_state *x)
1286 struct xfrm_state *x1, *to_put;
1288 int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
1292 spin_lock_bh(&xfrm_state_lock);
1293 x1 = __xfrm_state_locate(x, use_spi, x->props.family);
1299 if (xfrm_state_kern(x1)) {
1305 if (x1->km.state == XFRM_STATE_ACQ) {
1306 __xfrm_state_insert(x);
1312 spin_unlock_bh(&xfrm_state_lock);
1315 xfrm_state_put(to_put);
1321 xfrm_state_delete(x1);
1327 spin_lock_bh(&x1->lock);
1328 if (likely(x1->km.state == XFRM_STATE_VALID)) {
1329 if (x->encap && x1->encap)
1330 memcpy(x1->encap, x->encap, sizeof(*x1->encap));
1331 if (x->coaddr && x1->coaddr) {
1332 memcpy(x1->coaddr, x->coaddr, sizeof(*x1->coaddr));
1334 if (!use_spi && memcmp(&x1->sel, &x->sel, sizeof(x1->sel)))
1335 memcpy(&x1->sel, &x->sel, sizeof(x1->sel));
1336 memcpy(&x1->lft, &x->lft, sizeof(x1->lft));
1339 tasklet_hrtimer_start(&x1->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
1340 if (x1->curlft.use_time)
1341 xfrm_state_check_expire(x1);
1345 spin_unlock_bh(&x1->lock);
1351 EXPORT_SYMBOL(xfrm_state_update);
1353 int xfrm_state_check_expire(struct xfrm_state *x)
1355 if (!x->curlft.use_time)
1356 x->curlft.use_time = get_seconds();
1358 if (x->km.state != XFRM_STATE_VALID)
1361 if (x->curlft.bytes >= x->lft.hard_byte_limit ||
1362 x->curlft.packets >= x->lft.hard_packet_limit) {
1363 x->km.state = XFRM_STATE_EXPIRED;
1364 tasklet_hrtimer_start(&x->mtimer, ktime_set(0,0), HRTIMER_MODE_REL);
1369 (x->curlft.bytes >= x->lft.soft_byte_limit ||
1370 x->curlft.packets >= x->lft.soft_packet_limit)) {
1372 km_state_expired(x, 0, 0);
1376 EXPORT_SYMBOL(xfrm_state_check_expire);
1379 xfrm_state_lookup(struct net *net, u32 mark, xfrm_address_t *daddr, __be32 spi,
1380 u8 proto, unsigned short family)
1382 struct xfrm_state *x;
1384 spin_lock_bh(&xfrm_state_lock);
1385 x = __xfrm_state_lookup(net, mark, daddr, spi, proto, family);
1386 spin_unlock_bh(&xfrm_state_lock);
1389 EXPORT_SYMBOL(xfrm_state_lookup);
1392 xfrm_state_lookup_byaddr(struct net *net, u32 mark,
1393 xfrm_address_t *daddr, xfrm_address_t *saddr,
1394 u8 proto, unsigned short family)
1396 struct xfrm_state *x;
1398 spin_lock_bh(&xfrm_state_lock);
1399 x = __xfrm_state_lookup_byaddr(net, mark, daddr, saddr, proto, family);
1400 spin_unlock_bh(&xfrm_state_lock);
1403 EXPORT_SYMBOL(xfrm_state_lookup_byaddr);
1406 xfrm_find_acq(struct net *net, struct xfrm_mark *mark, u8 mode, u32 reqid, u8 proto,
1407 xfrm_address_t *daddr, xfrm_address_t *saddr,
1408 int create, unsigned short family)
1410 struct xfrm_state *x;
1412 spin_lock_bh(&xfrm_state_lock);
1413 x = __find_acq_core(net, mark, family, mode, reqid, proto, daddr, saddr, create);
1414 spin_unlock_bh(&xfrm_state_lock);
1418 EXPORT_SYMBOL(xfrm_find_acq);
1420 #ifdef CONFIG_XFRM_SUB_POLICY
1422 xfrm_tmpl_sort(struct xfrm_tmpl **dst, struct xfrm_tmpl **src, int n,
1423 unsigned short family)
1426 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
1428 return -EAFNOSUPPORT;
1430 spin_lock_bh(&xfrm_state_lock);
1431 if (afinfo->tmpl_sort)
1432 err = afinfo->tmpl_sort(dst, src, n);
1433 spin_unlock_bh(&xfrm_state_lock);
1434 xfrm_state_put_afinfo(afinfo);
1437 EXPORT_SYMBOL(xfrm_tmpl_sort);
1440 xfrm_state_sort(struct xfrm_state **dst, struct xfrm_state **src, int n,
1441 unsigned short family)
1444 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
1446 return -EAFNOSUPPORT;
1448 spin_lock_bh(&xfrm_state_lock);
1449 if (afinfo->state_sort)
1450 err = afinfo->state_sort(dst, src, n);
1451 spin_unlock_bh(&xfrm_state_lock);
1452 xfrm_state_put_afinfo(afinfo);
1455 EXPORT_SYMBOL(xfrm_state_sort);
1458 /* Silly enough, but I'm lazy to build resolution list */
1460 static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
1464 for (i = 0; i <= net->xfrm.state_hmask; i++) {
1465 struct hlist_node *entry;
1466 struct xfrm_state *x;
1468 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+i, bydst) {
1469 if (x->km.seq == seq &&
1470 (mark & x->mark.m) == x->mark.v &&
1471 x->km.state == XFRM_STATE_ACQ) {
1480 struct xfrm_state *xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
1482 struct xfrm_state *x;
1484 spin_lock_bh(&xfrm_state_lock);
1485 x = __xfrm_find_acq_byseq(net, mark, seq);
1486 spin_unlock_bh(&xfrm_state_lock);
1489 EXPORT_SYMBOL(xfrm_find_acq_byseq);
1491 u32 xfrm_get_acqseq(void)
1494 static atomic_t acqseq;
1497 res = atomic_inc_return(&acqseq);
1502 EXPORT_SYMBOL(xfrm_get_acqseq);
1504 int xfrm_alloc_spi(struct xfrm_state *x, u32 low, u32 high)
1506 struct net *net = xs_net(x);
1508 struct xfrm_state *x0;
1510 __be32 minspi = htonl(low);
1511 __be32 maxspi = htonl(high);
1512 u32 mark = x->mark.v & x->mark.m;
1514 spin_lock_bh(&x->lock);
1515 if (x->km.state == XFRM_STATE_DEAD)
1524 if (minspi == maxspi) {
1525 x0 = xfrm_state_lookup(net, mark, &x->id.daddr, minspi, x->id.proto, x->props.family);
1533 for (h=0; h<high-low+1; h++) {
1534 spi = low + net_random()%(high-low+1);
1535 x0 = xfrm_state_lookup(net, mark, &x->id.daddr, htonl(spi), x->id.proto, x->props.family);
1537 x->id.spi = htonl(spi);
1544 spin_lock_bh(&xfrm_state_lock);
1545 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, x->props.family);
1546 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
1547 spin_unlock_bh(&xfrm_state_lock);
1553 spin_unlock_bh(&x->lock);
1557 EXPORT_SYMBOL(xfrm_alloc_spi);
1559 int xfrm_state_walk(struct net *net, struct xfrm_state_walk *walk,
1560 int (*func)(struct xfrm_state *, int, void*),
1563 struct xfrm_state *state;
1564 struct xfrm_state_walk *x;
1567 if (walk->seq != 0 && list_empty(&walk->all))
1570 spin_lock_bh(&xfrm_state_lock);
1571 if (list_empty(&walk->all))
1572 x = list_first_entry(&net->xfrm.state_all, struct xfrm_state_walk, all);
1574 x = list_entry(&walk->all, struct xfrm_state_walk, all);
1575 list_for_each_entry_from(x, &net->xfrm.state_all, all) {
1576 if (x->state == XFRM_STATE_DEAD)
1578 state = container_of(x, struct xfrm_state, km);
1579 if (!xfrm_id_proto_match(state->id.proto, walk->proto))
1581 err = func(state, walk->seq, data);
1583 list_move_tail(&walk->all, &x->all);
1588 if (walk->seq == 0) {
1592 list_del_init(&walk->all);
1594 spin_unlock_bh(&xfrm_state_lock);
1597 EXPORT_SYMBOL(xfrm_state_walk);
1599 void xfrm_state_walk_init(struct xfrm_state_walk *walk, u8 proto)
1601 INIT_LIST_HEAD(&walk->all);
1602 walk->proto = proto;
1603 walk->state = XFRM_STATE_DEAD;
1606 EXPORT_SYMBOL(xfrm_state_walk_init);
1608 void xfrm_state_walk_done(struct xfrm_state_walk *walk)
1610 if (list_empty(&walk->all))
1613 spin_lock_bh(&xfrm_state_lock);
1614 list_del(&walk->all);
1615 spin_unlock_bh(&xfrm_state_lock);
1617 EXPORT_SYMBOL(xfrm_state_walk_done);
1620 void xfrm_replay_notify(struct xfrm_state *x, int event)
1623 /* we send notify messages in case
1624 * 1. we updated on of the sequence numbers, and the seqno difference
1625 * is at least x->replay_maxdiff, in this case we also update the
1626 * timeout of our timer function
1627 * 2. if x->replay_maxage has elapsed since last update,
1628 * and there were changes
1630 * The state structure must be locked!
1634 case XFRM_REPLAY_UPDATE:
1635 if (x->replay_maxdiff &&
1636 (x->replay.seq - x->preplay.seq < x->replay_maxdiff) &&
1637 (x->replay.oseq - x->preplay.oseq < x->replay_maxdiff)) {
1638 if (x->xflags & XFRM_TIME_DEFER)
1639 event = XFRM_REPLAY_TIMEOUT;
1646 case XFRM_REPLAY_TIMEOUT:
1647 if ((x->replay.seq == x->preplay.seq) &&
1648 (x->replay.bitmap == x->preplay.bitmap) &&
1649 (x->replay.oseq == x->preplay.oseq)) {
1650 x->xflags |= XFRM_TIME_DEFER;
1657 memcpy(&x->preplay, &x->replay, sizeof(struct xfrm_replay_state));
1658 c.event = XFRM_MSG_NEWAE;
1659 c.data.aevent = event;
1660 km_state_notify(x, &c);
1662 if (x->replay_maxage &&
1663 !mod_timer(&x->rtimer, jiffies + x->replay_maxage))
1664 x->xflags &= ~XFRM_TIME_DEFER;
1667 static void xfrm_replay_timer_handler(unsigned long data)
1669 struct xfrm_state *x = (struct xfrm_state*)data;
1671 spin_lock(&x->lock);
1673 if (x->km.state == XFRM_STATE_VALID) {
1674 if (xfrm_aevent_is_on(xs_net(x)))
1675 xfrm_replay_notify(x, XFRM_REPLAY_TIMEOUT);
1677 x->xflags |= XFRM_TIME_DEFER;
1680 spin_unlock(&x->lock);
1683 int xfrm_replay_check(struct xfrm_state *x,
1684 struct sk_buff *skb, __be32 net_seq)
1687 u32 seq = ntohl(net_seq);
1689 if (unlikely(seq == 0))
1692 if (likely(seq > x->replay.seq))
1695 diff = x->replay.seq - seq;
1696 if (diff >= min_t(unsigned int, x->props.replay_window,
1697 sizeof(x->replay.bitmap) * 8)) {
1698 x->stats.replay_window++;
1702 if (x->replay.bitmap & (1U << diff)) {
1709 xfrm_audit_state_replay(x, skb, net_seq);
1713 void xfrm_replay_advance(struct xfrm_state *x, __be32 net_seq)
1716 u32 seq = ntohl(net_seq);
1718 if (seq > x->replay.seq) {
1719 diff = seq - x->replay.seq;
1720 if (diff < x->props.replay_window)
1721 x->replay.bitmap = ((x->replay.bitmap) << diff) | 1;
1723 x->replay.bitmap = 1;
1724 x->replay.seq = seq;
1726 diff = x->replay.seq - seq;
1727 x->replay.bitmap |= (1U << diff);
1730 if (xfrm_aevent_is_on(xs_net(x)))
1731 xfrm_replay_notify(x, XFRM_REPLAY_UPDATE);
1734 static LIST_HEAD(xfrm_km_list);
1735 static DEFINE_RWLOCK(xfrm_km_lock);
1737 void km_policy_notify(struct xfrm_policy *xp, int dir, const struct km_event *c)
1739 struct xfrm_mgr *km;
1741 read_lock(&xfrm_km_lock);
1742 list_for_each_entry(km, &xfrm_km_list, list)
1743 if (km->notify_policy)
1744 km->notify_policy(xp, dir, c);
1745 read_unlock(&xfrm_km_lock);
1748 void km_state_notify(struct xfrm_state *x, const struct km_event *c)
1750 struct xfrm_mgr *km;
1751 read_lock(&xfrm_km_lock);
1752 list_for_each_entry(km, &xfrm_km_list, list)
1755 read_unlock(&xfrm_km_lock);
1758 EXPORT_SYMBOL(km_policy_notify);
1759 EXPORT_SYMBOL(km_state_notify);
1761 void km_state_expired(struct xfrm_state *x, int hard, u32 pid)
1763 struct net *net = xs_net(x);
1768 c.event = XFRM_MSG_EXPIRE;
1769 km_state_notify(x, &c);
1772 wake_up(&net->xfrm.km_waitq);
1775 EXPORT_SYMBOL(km_state_expired);
1777 * We send to all registered managers regardless of failure
1778 * We are happy with one success
1780 int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol)
1782 int err = -EINVAL, acqret;
1783 struct xfrm_mgr *km;
1785 read_lock(&xfrm_km_lock);
1786 list_for_each_entry(km, &xfrm_km_list, list) {
1787 acqret = km->acquire(x, t, pol, XFRM_POLICY_OUT);
1791 read_unlock(&xfrm_km_lock);
1794 EXPORT_SYMBOL(km_query);
1796 int km_new_mapping(struct xfrm_state *x, xfrm_address_t *ipaddr, __be16 sport)
1799 struct xfrm_mgr *km;
1801 read_lock(&xfrm_km_lock);
1802 list_for_each_entry(km, &xfrm_km_list, list) {
1803 if (km->new_mapping)
1804 err = km->new_mapping(x, ipaddr, sport);
1808 read_unlock(&xfrm_km_lock);
1811 EXPORT_SYMBOL(km_new_mapping);
1813 void km_policy_expired(struct xfrm_policy *pol, int dir, int hard, u32 pid)
1815 struct net *net = xp_net(pol);
1820 c.event = XFRM_MSG_POLEXPIRE;
1821 km_policy_notify(pol, dir, &c);
1824 wake_up(&net->xfrm.km_waitq);
1826 EXPORT_SYMBOL(km_policy_expired);
1828 #ifdef CONFIG_XFRM_MIGRATE
1829 int km_migrate(const struct xfrm_selector *sel, u8 dir, u8 type,
1830 const struct xfrm_migrate *m, int num_migrate,
1831 const struct xfrm_kmaddress *k)
1835 struct xfrm_mgr *km;
1837 read_lock(&xfrm_km_lock);
1838 list_for_each_entry(km, &xfrm_km_list, list) {
1840 ret = km->migrate(sel, dir, type, m, num_migrate, k);
1845 read_unlock(&xfrm_km_lock);
1848 EXPORT_SYMBOL(km_migrate);
1851 int km_report(struct net *net, u8 proto, struct xfrm_selector *sel, xfrm_address_t *addr)
1855 struct xfrm_mgr *km;
1857 read_lock(&xfrm_km_lock);
1858 list_for_each_entry(km, &xfrm_km_list, list) {
1860 ret = km->report(net, proto, sel, addr);
1865 read_unlock(&xfrm_km_lock);
1868 EXPORT_SYMBOL(km_report);
1870 int xfrm_user_policy(struct sock *sk, int optname, u8 __user *optval, int optlen)
1874 struct xfrm_mgr *km;
1875 struct xfrm_policy *pol = NULL;
1877 if (optlen <= 0 || optlen > PAGE_SIZE)
1880 data = kmalloc(optlen, GFP_KERNEL);
1885 if (copy_from_user(data, optval, optlen))
1889 read_lock(&xfrm_km_lock);
1890 list_for_each_entry(km, &xfrm_km_list, list) {
1891 pol = km->compile_policy(sk, optname, data,
1896 read_unlock(&xfrm_km_lock);
1899 xfrm_sk_policy_insert(sk, err, pol);
1908 EXPORT_SYMBOL(xfrm_user_policy);
1910 int xfrm_register_km(struct xfrm_mgr *km)
1912 write_lock_bh(&xfrm_km_lock);
1913 list_add_tail(&km->list, &xfrm_km_list);
1914 write_unlock_bh(&xfrm_km_lock);
1917 EXPORT_SYMBOL(xfrm_register_km);
1919 int xfrm_unregister_km(struct xfrm_mgr *km)
1921 write_lock_bh(&xfrm_km_lock);
1922 list_del(&km->list);
1923 write_unlock_bh(&xfrm_km_lock);
1926 EXPORT_SYMBOL(xfrm_unregister_km);
1928 int xfrm_state_register_afinfo(struct xfrm_state_afinfo *afinfo)
1931 if (unlikely(afinfo == NULL))
1933 if (unlikely(afinfo->family >= NPROTO))
1934 return -EAFNOSUPPORT;
1935 write_lock_bh(&xfrm_state_afinfo_lock);
1936 if (unlikely(xfrm_state_afinfo[afinfo->family] != NULL))
1939 xfrm_state_afinfo[afinfo->family] = afinfo;
1940 write_unlock_bh(&xfrm_state_afinfo_lock);
1943 EXPORT_SYMBOL(xfrm_state_register_afinfo);
1945 int xfrm_state_unregister_afinfo(struct xfrm_state_afinfo *afinfo)
1948 if (unlikely(afinfo == NULL))
1950 if (unlikely(afinfo->family >= NPROTO))
1951 return -EAFNOSUPPORT;
1952 write_lock_bh(&xfrm_state_afinfo_lock);
1953 if (likely(xfrm_state_afinfo[afinfo->family] != NULL)) {
1954 if (unlikely(xfrm_state_afinfo[afinfo->family] != afinfo))
1957 xfrm_state_afinfo[afinfo->family] = NULL;
1959 write_unlock_bh(&xfrm_state_afinfo_lock);
1962 EXPORT_SYMBOL(xfrm_state_unregister_afinfo);
1964 static struct xfrm_state_afinfo *xfrm_state_get_afinfo(unsigned int family)
1966 struct xfrm_state_afinfo *afinfo;
1967 if (unlikely(family >= NPROTO))
1969 read_lock(&xfrm_state_afinfo_lock);
1970 afinfo = xfrm_state_afinfo[family];
1971 if (unlikely(!afinfo))
1972 read_unlock(&xfrm_state_afinfo_lock);
1976 static void xfrm_state_put_afinfo(struct xfrm_state_afinfo *afinfo)
1977 __releases(xfrm_state_afinfo_lock)
1979 read_unlock(&xfrm_state_afinfo_lock);
1982 /* Temporarily located here until net/xfrm/xfrm_tunnel.c is created */
1983 void xfrm_state_delete_tunnel(struct xfrm_state *x)
1986 struct xfrm_state *t = x->tunnel;
1988 if (atomic_read(&t->tunnel_users) == 2)
1989 xfrm_state_delete(t);
1990 atomic_dec(&t->tunnel_users);
1995 EXPORT_SYMBOL(xfrm_state_delete_tunnel);
1997 int xfrm_state_mtu(struct xfrm_state *x, int mtu)
2001 spin_lock_bh(&x->lock);
2002 if (x->km.state == XFRM_STATE_VALID &&
2003 x->type && x->type->get_mtu)
2004 res = x->type->get_mtu(x, mtu);
2006 res = mtu - x->props.header_len;
2007 spin_unlock_bh(&x->lock);
2011 int xfrm_init_state(struct xfrm_state *x)
2013 struct xfrm_state_afinfo *afinfo;
2014 struct xfrm_mode *inner_mode;
2015 int family = x->props.family;
2018 err = -EAFNOSUPPORT;
2019 afinfo = xfrm_state_get_afinfo(family);
2024 if (afinfo->init_flags)
2025 err = afinfo->init_flags(x);
2027 xfrm_state_put_afinfo(afinfo);
2032 err = -EPROTONOSUPPORT;
2034 if (x->sel.family != AF_UNSPEC) {
2035 inner_mode = xfrm_get_mode(x->props.mode, x->sel.family);
2036 if (inner_mode == NULL)
2039 if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL) &&
2040 family != x->sel.family) {
2041 xfrm_put_mode(inner_mode);
2045 x->inner_mode = inner_mode;
2047 struct xfrm_mode *inner_mode_iaf;
2048 int iafamily = AF_INET;
2050 inner_mode = xfrm_get_mode(x->props.mode, x->props.family);
2051 if (inner_mode == NULL)
2054 if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL)) {
2055 xfrm_put_mode(inner_mode);
2058 x->inner_mode = inner_mode;
2060 if (x->props.family == AF_INET)
2061 iafamily = AF_INET6;
2063 inner_mode_iaf = xfrm_get_mode(x->props.mode, iafamily);
2064 if (inner_mode_iaf) {
2065 if (inner_mode_iaf->flags & XFRM_MODE_FLAG_TUNNEL)
2066 x->inner_mode_iaf = inner_mode_iaf;
2068 xfrm_put_mode(inner_mode_iaf);
2072 x->type = xfrm_get_type(x->id.proto, family);
2073 if (x->type == NULL)
2076 err = x->type->init_state(x);
2080 x->outer_mode = xfrm_get_mode(x->props.mode, family);
2081 if (x->outer_mode == NULL)
2084 x->km.state = XFRM_STATE_VALID;
2090 EXPORT_SYMBOL(xfrm_init_state);
2092 int __net_init xfrm_state_init(struct net *net)
2096 INIT_LIST_HEAD(&net->xfrm.state_all);
2098 sz = sizeof(struct hlist_head) * 8;
2100 net->xfrm.state_bydst = xfrm_hash_alloc(sz);
2101 if (!net->xfrm.state_bydst)
2103 net->xfrm.state_bysrc = xfrm_hash_alloc(sz);
2104 if (!net->xfrm.state_bysrc)
2106 net->xfrm.state_byspi = xfrm_hash_alloc(sz);
2107 if (!net->xfrm.state_byspi)
2109 net->xfrm.state_hmask = ((sz / sizeof(struct hlist_head)) - 1);
2111 net->xfrm.state_num = 0;
2112 INIT_WORK(&net->xfrm.state_hash_work, xfrm_hash_resize);
2113 INIT_HLIST_HEAD(&net->xfrm.state_gc_list);
2114 INIT_WORK(&net->xfrm.state_gc_work, xfrm_state_gc_task);
2115 init_waitqueue_head(&net->xfrm.km_waitq);
2119 xfrm_hash_free(net->xfrm.state_bysrc, sz);
2121 xfrm_hash_free(net->xfrm.state_bydst, sz);
2126 void xfrm_state_fini(struct net *net)
2128 struct xfrm_audit audit_info;
2131 flush_work(&net->xfrm.state_hash_work);
2132 audit_info.loginuid = -1;
2133 audit_info.sessionid = -1;
2134 audit_info.secid = 0;
2135 xfrm_state_flush(net, IPSEC_PROTO_ANY, &audit_info);
2136 flush_work(&net->xfrm.state_gc_work);
2138 WARN_ON(!list_empty(&net->xfrm.state_all));
2140 sz = (net->xfrm.state_hmask + 1) * sizeof(struct hlist_head);
2141 WARN_ON(!hlist_empty(net->xfrm.state_byspi));
2142 xfrm_hash_free(net->xfrm.state_byspi, sz);
2143 WARN_ON(!hlist_empty(net->xfrm.state_bysrc));
2144 xfrm_hash_free(net->xfrm.state_bysrc, sz);
2145 WARN_ON(!hlist_empty(net->xfrm.state_bydst));
2146 xfrm_hash_free(net->xfrm.state_bydst, sz);
2149 #ifdef CONFIG_AUDITSYSCALL
2150 static void xfrm_audit_helper_sainfo(struct xfrm_state *x,
2151 struct audit_buffer *audit_buf)
2153 struct xfrm_sec_ctx *ctx = x->security;
2154 u32 spi = ntohl(x->id.spi);
2157 audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
2158 ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
2160 switch(x->props.family) {
2162 audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
2163 &x->props.saddr.a4, &x->id.daddr.a4);
2166 audit_log_format(audit_buf, " src=%pI6 dst=%pI6",
2167 x->props.saddr.a6, x->id.daddr.a6);
2171 audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
2174 static void xfrm_audit_helper_pktinfo(struct sk_buff *skb, u16 family,
2175 struct audit_buffer *audit_buf)
2178 struct ipv6hdr *iph6;
2183 audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
2184 &iph4->saddr, &iph4->daddr);
2187 iph6 = ipv6_hdr(skb);
2188 audit_log_format(audit_buf,
2189 " src=%pI6 dst=%pI6 flowlbl=0x%x%02x%02x",
2190 &iph6->saddr,&iph6->daddr,
2191 iph6->flow_lbl[0] & 0x0f,
2198 void xfrm_audit_state_add(struct xfrm_state *x, int result,
2199 uid_t auid, u32 sessionid, u32 secid)
2201 struct audit_buffer *audit_buf;
2203 audit_buf = xfrm_audit_start("SAD-add");
2204 if (audit_buf == NULL)
2206 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2207 xfrm_audit_helper_sainfo(x, audit_buf);
2208 audit_log_format(audit_buf, " res=%u", result);
2209 audit_log_end(audit_buf);
2211 EXPORT_SYMBOL_GPL(xfrm_audit_state_add);
2213 void xfrm_audit_state_delete(struct xfrm_state *x, int result,
2214 uid_t auid, u32 sessionid, u32 secid)
2216 struct audit_buffer *audit_buf;
2218 audit_buf = xfrm_audit_start("SAD-delete");
2219 if (audit_buf == NULL)
2221 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2222 xfrm_audit_helper_sainfo(x, audit_buf);
2223 audit_log_format(audit_buf, " res=%u", result);
2224 audit_log_end(audit_buf);
2226 EXPORT_SYMBOL_GPL(xfrm_audit_state_delete);
2228 void xfrm_audit_state_replay_overflow(struct xfrm_state *x,
2229 struct sk_buff *skb)
2231 struct audit_buffer *audit_buf;
2234 audit_buf = xfrm_audit_start("SA-replay-overflow");
2235 if (audit_buf == NULL)
2237 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2238 /* don't record the sequence number because it's inherent in this kind
2239 * of audit message */
2240 spi = ntohl(x->id.spi);
2241 audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
2242 audit_log_end(audit_buf);
2244 EXPORT_SYMBOL_GPL(xfrm_audit_state_replay_overflow);
2246 static void xfrm_audit_state_replay(struct xfrm_state *x,
2247 struct sk_buff *skb, __be32 net_seq)
2249 struct audit_buffer *audit_buf;
2252 audit_buf = xfrm_audit_start("SA-replayed-pkt");
2253 if (audit_buf == NULL)
2255 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2256 spi = ntohl(x->id.spi);
2257 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2258 spi, spi, ntohl(net_seq));
2259 audit_log_end(audit_buf);
2262 void xfrm_audit_state_notfound_simple(struct sk_buff *skb, u16 family)
2264 struct audit_buffer *audit_buf;
2266 audit_buf = xfrm_audit_start("SA-notfound");
2267 if (audit_buf == NULL)
2269 xfrm_audit_helper_pktinfo(skb, family, audit_buf);
2270 audit_log_end(audit_buf);
2272 EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound_simple);
2274 void xfrm_audit_state_notfound(struct sk_buff *skb, u16 family,
2275 __be32 net_spi, __be32 net_seq)
2277 struct audit_buffer *audit_buf;
2280 audit_buf = xfrm_audit_start("SA-notfound");
2281 if (audit_buf == NULL)
2283 xfrm_audit_helper_pktinfo(skb, family, audit_buf);
2284 spi = ntohl(net_spi);
2285 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2286 spi, spi, ntohl(net_seq));
2287 audit_log_end(audit_buf);
2289 EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound);
2291 void xfrm_audit_state_icvfail(struct xfrm_state *x,
2292 struct sk_buff *skb, u8 proto)
2294 struct audit_buffer *audit_buf;
2298 audit_buf = xfrm_audit_start("SA-icv-failure");
2299 if (audit_buf == NULL)
2301 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2302 if (xfrm_parse_spi(skb, proto, &net_spi, &net_seq) == 0) {
2303 u32 spi = ntohl(net_spi);
2304 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2305 spi, spi, ntohl(net_seq));
2307 audit_log_end(audit_buf);
2309 EXPORT_SYMBOL_GPL(xfrm_audit_state_icvfail);
2310 #endif /* CONFIG_AUDITSYSCALL */