projects / deliverable / linux.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
xfrm: Const'ify xfrm_tmpl arg to xfrm_init_tempstate.
[deliverable/linux.git] / net / xfrm / xfrm_state.c
... / ...
CommitLineData
1/*
2 * xfrm_state.c
3 *
4 * Changes:
5 * Mitsuru KANDA @USAGI
6 * Kazunori MIYAZAWA @USAGI
7 * Kunihiro Ishiguro <kunihiro@ipinfusion.com>
8 * IPv6 support
9 * YOSHIFUJI Hideaki @USAGI
10 * Split up af-specific functions
11 * Derek Atkins <derek@ihtfp.com>
12 * Add UDP Encapsulation
13 *
14 */
15
16#include <linux/workqueue.h>
17#include <net/xfrm.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>
28
29#include "xfrm_hash.h"
30
31/* Each xfrm_state may be linked to two tables:
32
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)
36 */
37
38static DEFINE_SPINLOCK(xfrm_state_lock);
39
40static unsigned int xfrm_state_hashmax __read_mostly = 1 * 1024 * 1024;
41
42static struct xfrm_state_afinfo *xfrm_state_get_afinfo(unsigned int family);
43static void xfrm_state_put_afinfo(struct xfrm_state_afinfo *afinfo);
44
45#ifdef CONFIG_AUDITSYSCALL
46static void xfrm_audit_state_replay(struct xfrm_state *x,
47 struct sk_buff *skb, __be32 net_seq);
48#else
49#define xfrm_audit_state_replay(x, s, sq) do { ; } while (0)
50#endif /* CONFIG_AUDITSYSCALL */
51
52static inline unsigned int xfrm_dst_hash(struct net *net,
53 const xfrm_address_t *daddr,
54 const xfrm_address_t *saddr,
55 u32 reqid,
56 unsigned short family)
57{
58 return __xfrm_dst_hash(daddr, saddr, reqid, family, net->xfrm.state_hmask);
59}
60
61static 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)
65{
66 return __xfrm_src_hash(daddr, saddr, family, net->xfrm.state_hmask);
67}
68
69static inline unsigned int
70xfrm_spi_hash(struct net *net, const xfrm_address_t *daddr,
71 __be32 spi, u8 proto, unsigned short family)
72{
73 return __xfrm_spi_hash(daddr, spi, proto, family, net->xfrm.state_hmask);
74}
75
76static 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)
81{
82 struct hlist_node *entry, *tmp;
83 struct xfrm_state *x;
84
85 hlist_for_each_entry_safe(x, entry, tmp, list, bydst) {
86 unsigned int h;
87
88 h = __xfrm_dst_hash(&x->id.daddr, &x->props.saddr,
89 x->props.reqid, x->props.family,
90 nhashmask);
91 hlist_add_head(&x->bydst, ndsttable+h);
92
93 h = __xfrm_src_hash(&x->id.daddr, &x->props.saddr,
94 x->props.family,
95 nhashmask);
96 hlist_add_head(&x->bysrc, nsrctable+h);
97
98 if (x->id.spi) {
99 h = __xfrm_spi_hash(&x->id.daddr, x->id.spi,
100 x->id.proto, x->props.family,
101 nhashmask);
102 hlist_add_head(&x->byspi, nspitable+h);
103 }
104 }
105}
106
107static unsigned long xfrm_hash_new_size(unsigned int state_hmask)
108{
109 return ((state_hmask + 1) << 1) * sizeof(struct hlist_head);
110}
111
112static DEFINE_MUTEX(hash_resize_mutex);
113
114static void xfrm_hash_resize(struct work_struct *work)
115{
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;
120 int i;
121
122 mutex_lock(&hash_resize_mutex);
123
124 nsize = xfrm_hash_new_size(net->xfrm.state_hmask);
125 ndst = xfrm_hash_alloc(nsize);
126 if (!ndst)
127 goto out_unlock;
128 nsrc = xfrm_hash_alloc(nsize);
129 if (!nsrc) {
130 xfrm_hash_free(ndst, nsize);
131 goto out_unlock;
132 }
133 nspi = xfrm_hash_alloc(nsize);
134 if (!nspi) {
135 xfrm_hash_free(ndst, nsize);
136 xfrm_hash_free(nsrc, nsize);
137 goto out_unlock;
138 }
139
140 spin_lock_bh(&xfrm_state_lock);
141
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,
145 nhashmask);
146
147 odst = net->xfrm.state_bydst;
148 osrc = net->xfrm.state_bysrc;
149 ospi = net->xfrm.state_byspi;
150 ohashmask = net->xfrm.state_hmask;
151
152 net->xfrm.state_bydst = ndst;
153 net->xfrm.state_bysrc = nsrc;
154 net->xfrm.state_byspi = nspi;
155 net->xfrm.state_hmask = nhashmask;
156
157 spin_unlock_bh(&xfrm_state_lock);
158
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);
163
164out_unlock:
165 mutex_unlock(&hash_resize_mutex);
166}
167
168static DEFINE_RWLOCK(xfrm_state_afinfo_lock);
169static struct xfrm_state_afinfo *xfrm_state_afinfo[NPROTO];
170
171static DEFINE_SPINLOCK(xfrm_state_gc_lock);
172
173int __xfrm_state_delete(struct xfrm_state *x);
174
175int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol);
176void km_state_expired(struct xfrm_state *x, int hard, u32 pid);
177
178static struct xfrm_state_afinfo *xfrm_state_lock_afinfo(unsigned int family)
179{
180 struct xfrm_state_afinfo *afinfo;
181 if (unlikely(family >= NPROTO))
182 return NULL;
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);
187 return afinfo;
188}
189
190static void xfrm_state_unlock_afinfo(struct xfrm_state_afinfo *afinfo)
191 __releases(xfrm_state_afinfo_lock)
192{
193 write_unlock_bh(&xfrm_state_afinfo_lock);
194}
195
196int xfrm_register_type(const struct xfrm_type *type, unsigned short family)
197{
198 struct xfrm_state_afinfo *afinfo = xfrm_state_lock_afinfo(family);
199 const struct xfrm_type **typemap;
200 int err = 0;
201
202 if (unlikely(afinfo == NULL))
203 return -EAFNOSUPPORT;
204 typemap = afinfo->type_map;
205
206 if (likely(typemap[type->proto] == NULL))
207 typemap[type->proto] = type;
208 else
209 err = -EEXIST;
210 xfrm_state_unlock_afinfo(afinfo);
211 return err;
212}
213EXPORT_SYMBOL(xfrm_register_type);
214
215int xfrm_unregister_type(const struct xfrm_type *type, unsigned short family)
216{
217 struct xfrm_state_afinfo *afinfo = xfrm_state_lock_afinfo(family);
218 const struct xfrm_type **typemap;
219 int err = 0;
220
221 if (unlikely(afinfo == NULL))
222 return -EAFNOSUPPORT;
223 typemap = afinfo->type_map;
224
225 if (unlikely(typemap[type->proto] != type))
226 err = -ENOENT;
227 else
228 typemap[type->proto] = NULL;
229 xfrm_state_unlock_afinfo(afinfo);
230 return err;
231}
232EXPORT_SYMBOL(xfrm_unregister_type);
233
234static const struct xfrm_type *xfrm_get_type(u8 proto, unsigned short family)
235{
236 struct xfrm_state_afinfo *afinfo;
237 const struct xfrm_type **typemap;
238 const struct xfrm_type *type;
239 int modload_attempted = 0;
240
241retry:
242 afinfo = xfrm_state_get_afinfo(family);
243 if (unlikely(afinfo == NULL))
244 return NULL;
245 typemap = afinfo->type_map;
246
247 type = typemap[proto];
248 if (unlikely(type && !try_module_get(type->owner)))
249 type = NULL;
250 if (!type && !modload_attempted) {
251 xfrm_state_put_afinfo(afinfo);
252 request_module("xfrm-type-%d-%d", family, proto);
253 modload_attempted = 1;
254 goto retry;
255 }
256
257 xfrm_state_put_afinfo(afinfo);
258 return type;
259}
260
261static void xfrm_put_type(const struct xfrm_type *type)
262{
263 module_put(type->owner);
264}
265
266int xfrm_register_mode(struct xfrm_mode *mode, int family)
267{
268 struct xfrm_state_afinfo *afinfo;
269 struct xfrm_mode **modemap;
270 int err;
271
272 if (unlikely(mode->encap >= XFRM_MODE_MAX))
273 return -EINVAL;
274
275 afinfo = xfrm_state_lock_afinfo(family);
276 if (unlikely(afinfo == NULL))
277 return -EAFNOSUPPORT;
278
279 err = -EEXIST;
280 modemap = afinfo->mode_map;
281 if (modemap[mode->encap])
282 goto out;
283
284 err = -ENOENT;
285 if (!try_module_get(afinfo->owner))
286 goto out;
287
288 mode->afinfo = afinfo;
289 modemap[mode->encap] = mode;
290 err = 0;
291
292out:
293 xfrm_state_unlock_afinfo(afinfo);
294 return err;
295}
296EXPORT_SYMBOL(xfrm_register_mode);
297
298int xfrm_unregister_mode(struct xfrm_mode *mode, int family)
299{
300 struct xfrm_state_afinfo *afinfo;
301 struct xfrm_mode **modemap;
302 int err;
303
304 if (unlikely(mode->encap >= XFRM_MODE_MAX))
305 return -EINVAL;
306
307 afinfo = xfrm_state_lock_afinfo(family);
308 if (unlikely(afinfo == NULL))
309 return -EAFNOSUPPORT;
310
311 err = -ENOENT;
312 modemap = afinfo->mode_map;
313 if (likely(modemap[mode->encap] == mode)) {
314 modemap[mode->encap] = NULL;
315 module_put(mode->afinfo->owner);
316 err = 0;
317 }
318
319 xfrm_state_unlock_afinfo(afinfo);
320 return err;
321}
322EXPORT_SYMBOL(xfrm_unregister_mode);
323
324static struct xfrm_mode *xfrm_get_mode(unsigned int encap, int family)
325{
326 struct xfrm_state_afinfo *afinfo;
327 struct xfrm_mode *mode;
328 int modload_attempted = 0;
329
330 if (unlikely(encap >= XFRM_MODE_MAX))
331 return NULL;
332
333retry:
334 afinfo = xfrm_state_get_afinfo(family);
335 if (unlikely(afinfo == NULL))
336 return NULL;
337
338 mode = afinfo->mode_map[encap];
339 if (unlikely(mode && !try_module_get(mode->owner)))
340 mode = NULL;
341 if (!mode && !modload_attempted) {
342 xfrm_state_put_afinfo(afinfo);
343 request_module("xfrm-mode-%d-%d", family, encap);
344 modload_attempted = 1;
345 goto retry;
346 }
347
348 xfrm_state_put_afinfo(afinfo);
349 return mode;
350}
351
352static void xfrm_put_mode(struct xfrm_mode *mode)
353{
354 module_put(mode->owner);
355}
356
357static void xfrm_state_gc_destroy(struct xfrm_state *x)
358{
359 tasklet_hrtimer_cancel(&x->mtimer);
360 del_timer_sync(&x->rtimer);
361 kfree(x->aalg);
362 kfree(x->ealg);
363 kfree(x->calg);
364 kfree(x->encap);
365 kfree(x->coaddr);
366 if (x->inner_mode)
367 xfrm_put_mode(x->inner_mode);
368 if (x->inner_mode_iaf)
369 xfrm_put_mode(x->inner_mode_iaf);
370 if (x->outer_mode)
371 xfrm_put_mode(x->outer_mode);
372 if (x->type) {
373 x->type->destructor(x);
374 xfrm_put_type(x->type);
375 }
376 security_xfrm_state_free(x);
377 kfree(x);
378}
379
380static void xfrm_state_gc_task(struct work_struct *work)
381{
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;
386
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);
390
391 hlist_for_each_entry_safe(x, entry, tmp, &gc_list, gclist)
392 xfrm_state_gc_destroy(x);
393
394 wake_up(&net->xfrm.km_waitq);
395}
396
397static inline unsigned long make_jiffies(long secs)
398{
399 if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
400 return MAX_SCHEDULE_TIMEOUT-1;
401 else
402 return secs*HZ;
403}
404
405static enum hrtimer_restart xfrm_timer_handler(struct hrtimer * me)
406{
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;
412 int warn = 0;
413 int err = 0;
414
415 spin_lock(&x->lock);
416 if (x->km.state == XFRM_STATE_DEAD)
417 goto out;
418 if (x->km.state == XFRM_STATE_EXPIRED)
419 goto expired;
420 if (x->lft.hard_add_expires_seconds) {
421 long tmo = x->lft.hard_add_expires_seconds +
422 x->curlft.add_time - now;
423 if (tmo <= 0)
424 goto expired;
425 if (tmo < next)
426 next = tmo;
427 }
428 if (x->lft.hard_use_expires_seconds) {
429 long tmo = x->lft.hard_use_expires_seconds +
430 (x->curlft.use_time ? : now) - now;
431 if (tmo <= 0)
432 goto expired;
433 if (tmo < next)
434 next = tmo;
435 }
436 if (x->km.dying)
437 goto resched;
438 if (x->lft.soft_add_expires_seconds) {
439 long tmo = x->lft.soft_add_expires_seconds +
440 x->curlft.add_time - now;
441 if (tmo <= 0)
442 warn = 1;
443 else if (tmo < next)
444 next = tmo;
445 }
446 if (x->lft.soft_use_expires_seconds) {
447 long tmo = x->lft.soft_use_expires_seconds +
448 (x->curlft.use_time ? : now) - now;
449 if (tmo <= 0)
450 warn = 1;
451 else if (tmo < next)
452 next = tmo;
453 }
454
455 x->km.dying = warn;
456 if (warn)
457 km_state_expired(x, 0, 0);
458resched:
459 if (next != LONG_MAX){
460 tasklet_hrtimer_start(&x->mtimer, ktime_set(next, 0), HRTIMER_MODE_REL);
461 }
462
463 goto out;
464
465expired:
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);
469 next = 2;
470 goto resched;
471 }
472
473 err = __xfrm_state_delete(x);
474 if (!err && x->id.spi)
475 km_state_expired(x, 1, 0);
476
477 xfrm_audit_state_delete(x, err ? 0 : 1,
478 audit_get_loginuid(current),
479 audit_get_sessionid(current), 0);
480
481out:
482 spin_unlock(&x->lock);
483 return HRTIMER_NORESTART;
484}
485
486static void xfrm_replay_timer_handler(unsigned long data);
487
488struct xfrm_state *xfrm_state_alloc(struct net *net)
489{
490 struct xfrm_state *x;
491
492 x = kzalloc(sizeof(struct xfrm_state), GFP_ATOMIC);
493
494 if (x) {
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,
504 (unsigned long)x);
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);
515 }
516 return x;
517}
518EXPORT_SYMBOL(xfrm_state_alloc);
519
520void __xfrm_state_destroy(struct xfrm_state *x)
521{
522 struct net *net = xs_net(x);
523
524 WARN_ON(x->km.state != XFRM_STATE_DEAD);
525
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);
530}
531EXPORT_SYMBOL(__xfrm_state_destroy);
532
533int __xfrm_state_delete(struct xfrm_state *x)
534{
535 struct net *net = xs_net(x);
536 int err = -ESRCH;
537
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);
544 if (x->id.spi)
545 hlist_del(&x->byspi);
546 net->xfrm.state_num--;
547 spin_unlock(&xfrm_state_lock);
548
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.
552 */
553 xfrm_state_put(x);
554 err = 0;
555 }
556
557 return err;
558}
559EXPORT_SYMBOL(__xfrm_state_delete);
560
561int xfrm_state_delete(struct xfrm_state *x)
562{
563 int err;
564
565 spin_lock_bh(&x->lock);
566 err = __xfrm_state_delete(x);
567 spin_unlock_bh(&x->lock);
568
569 return err;
570}
571EXPORT_SYMBOL(xfrm_state_delete);
572
573#ifdef CONFIG_SECURITY_NETWORK_XFRM
574static inline int
575xfrm_state_flush_secctx_check(struct net *net, u8 proto, struct xfrm_audit *audit_info)
576{
577 int i, err = 0;
578
579 for (i = 0; i <= net->xfrm.state_hmask; i++) {
580 struct hlist_node *entry;
581 struct xfrm_state *x;
582
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,
589 audit_info->secid);
590 return err;
591 }
592 }
593 }
594
595 return err;
596}
597#else
598static inline int
599xfrm_state_flush_secctx_check(struct net *net, u8 proto, struct xfrm_audit *audit_info)
600{
601 return 0;
602}
603#endif
604
605int xfrm_state_flush(struct net *net, u8 proto, struct xfrm_audit *audit_info)
606{
607 int i, err = 0, cnt = 0;
608
609 spin_lock_bh(&xfrm_state_lock);
610 err = xfrm_state_flush_secctx_check(net, proto, audit_info);
611 if (err)
612 goto out;
613
614 err = -ESRCH;
615 for (i = 0; i <= net->xfrm.state_hmask; i++) {
616 struct hlist_node *entry;
617 struct xfrm_state *x;
618restart:
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)) {
622 xfrm_state_hold(x);
623 spin_unlock_bh(&xfrm_state_lock);
624
625 err = xfrm_state_delete(x);
626 xfrm_audit_state_delete(x, err ? 0 : 1,
627 audit_info->loginuid,
628 audit_info->sessionid,
629 audit_info->secid);
630 xfrm_state_put(x);
631 if (!err)
632 cnt++;
633
634 spin_lock_bh(&xfrm_state_lock);
635 goto restart;
636 }
637 }
638 }
639 if (cnt)
640 err = 0;
641
642out:
643 spin_unlock_bh(&xfrm_state_lock);
644 wake_up(&net->xfrm.km_waitq);
645 return err;
646}
647EXPORT_SYMBOL(xfrm_state_flush);
648
649void xfrm_sad_getinfo(struct net *net, struct xfrmk_sadinfo *si)
650{
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);
656}
657EXPORT_SYMBOL(xfrm_sad_getinfo);
658
659static int
660xfrm_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)
664{
665 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
666 if (!afinfo)
667 return -1;
668 afinfo->init_tempsel(&x->sel, fl);
669
670 if (family != tmpl->encap_family) {
671 xfrm_state_put_afinfo(afinfo);
672 afinfo = xfrm_state_get_afinfo(tmpl->encap_family);
673 if (!afinfo)
674 return -1;
675 }
676 afinfo->init_temprop(x, tmpl, daddr, saddr);
677 xfrm_state_put_afinfo(afinfo);
678 return 0;
679}
680
681static struct xfrm_state *__xfrm_state_lookup(struct net *net, u32 mark, xfrm_address_t *daddr, __be32 spi, u8 proto, unsigned short family)
682{
683 unsigned int h = xfrm_spi_hash(net, daddr, spi, proto, family);
684 struct xfrm_state *x;
685 struct hlist_node *entry;
686
687 hlist_for_each_entry(x, entry, net->xfrm.state_byspi+h, byspi) {
688 if (x->props.family != family ||
689 x->id.spi != spi ||
690 x->id.proto != proto ||
691 xfrm_addr_cmp(&x->id.daddr, daddr, family))
692 continue;
693
694 if ((mark & x->mark.m) != x->mark.v)
695 continue;
696 xfrm_state_hold(x);
697 return x;
698 }
699
700 return NULL;
701}
702
703static struct xfrm_state *__xfrm_state_lookup_byaddr(struct net *net, u32 mark, xfrm_address_t *daddr, xfrm_address_t *saddr, u8 proto, unsigned short family)
704{
705 unsigned int h = xfrm_src_hash(net, daddr, saddr, family);
706 struct xfrm_state *x;
707 struct hlist_node *entry;
708
709 hlist_for_each_entry(x, entry, net->xfrm.state_bysrc+h, bysrc) {
710 if (x->props.family != family ||
711 x->id.proto != proto ||
712 xfrm_addr_cmp(&x->id.daddr, daddr, family) ||
713 xfrm_addr_cmp(&x->props.saddr, saddr, family))
714 continue;
715
716 if ((mark & x->mark.m) != x->mark.v)
717 continue;
718 xfrm_state_hold(x);
719 return x;
720 }
721
722 return NULL;
723}
724
725static inline struct xfrm_state *
726__xfrm_state_locate(struct xfrm_state *x, int use_spi, int family)
727{
728 struct net *net = xs_net(x);
729 u32 mark = x->mark.v & x->mark.m;
730
731 if (use_spi)
732 return __xfrm_state_lookup(net, mark, &x->id.daddr,
733 x->id.spi, x->id.proto, family);
734 else
735 return __xfrm_state_lookup_byaddr(net, mark,
736 &x->id.daddr,
737 &x->props.saddr,
738 x->id.proto, family);
739}
740
741static void xfrm_hash_grow_check(struct net *net, int have_hash_collision)
742{
743 if (have_hash_collision &&
744 (net->xfrm.state_hmask + 1) < xfrm_state_hashmax &&
745 net->xfrm.state_num > net->xfrm.state_hmask)
746 schedule_work(&net->xfrm.state_hash_work);
747}
748
749static void xfrm_state_look_at(struct xfrm_policy *pol, struct xfrm_state *x,
750 const struct flowi *fl, unsigned short family,
751 xfrm_address_t *daddr, xfrm_address_t *saddr,
752 struct xfrm_state **best, int *acq_in_progress,
753 int *error)
754{
755 /* Resolution logic:
756 * 1. There is a valid state with matching selector. Done.
757 * 2. Valid state with inappropriate selector. Skip.
758 *
759 * Entering area of "sysdeps".
760 *
761 * 3. If state is not valid, selector is temporary, it selects
762 * only session which triggered previous resolution. Key
763 * manager will do something to install a state with proper
764 * selector.
765 */
766 if (x->km.state == XFRM_STATE_VALID) {
767 if ((x->sel.family &&
768 !xfrm_selector_match(&x->sel, fl, x->sel.family)) ||
769 !security_xfrm_state_pol_flow_match(x, pol, fl))
770 return;
771
772 if (!*best ||
773 (*best)->km.dying > x->km.dying ||
774 ((*best)->km.dying == x->km.dying &&
775 (*best)->curlft.add_time < x->curlft.add_time))
776 *best = x;
777 } else if (x->km.state == XFRM_STATE_ACQ) {
778 *acq_in_progress = 1;
779 } else if (x->km.state == XFRM_STATE_ERROR ||
780 x->km.state == XFRM_STATE_EXPIRED) {
781 if (xfrm_selector_match(&x->sel, fl, x->sel.family) &&
782 security_xfrm_state_pol_flow_match(x, pol, fl))
783 *error = -ESRCH;
784 }
785}
786
787struct xfrm_state *
788xfrm_state_find(xfrm_address_t *daddr, xfrm_address_t *saddr,
789 const struct flowi *fl, struct xfrm_tmpl *tmpl,
790 struct xfrm_policy *pol, int *err,
791 unsigned short family)
792{
793 static xfrm_address_t saddr_wildcard = { };
794 struct net *net = xp_net(pol);
795 unsigned int h, h_wildcard;
796 struct hlist_node *entry;
797 struct xfrm_state *x, *x0, *to_put;
798 int acquire_in_progress = 0;
799 int error = 0;
800 struct xfrm_state *best = NULL;
801 u32 mark = pol->mark.v & pol->mark.m;
802 unsigned short encap_family = tmpl->encap_family;
803
804 to_put = NULL;
805
806 spin_lock_bh(&xfrm_state_lock);
807 h = xfrm_dst_hash(net, daddr, saddr, tmpl->reqid, encap_family);
808 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
809 if (x->props.family == encap_family &&
810 x->props.reqid == tmpl->reqid &&
811 (mark & x->mark.m) == x->mark.v &&
812 !(x->props.flags & XFRM_STATE_WILDRECV) &&
813 xfrm_state_addr_check(x, daddr, saddr, encap_family) &&
814 tmpl->mode == x->props.mode &&
815 tmpl->id.proto == x->id.proto &&
816 (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
817 xfrm_state_look_at(pol, x, fl, encap_family, daddr, saddr,
818 &best, &acquire_in_progress, &error);
819 }
820 if (best)
821 goto found;
822
823 h_wildcard = xfrm_dst_hash(net, daddr, &saddr_wildcard, tmpl->reqid, encap_family);
824 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h_wildcard, bydst) {
825 if (x->props.family == encap_family &&
826 x->props.reqid == tmpl->reqid &&
827 (mark & x->mark.m) == x->mark.v &&
828 !(x->props.flags & XFRM_STATE_WILDRECV) &&
829 xfrm_state_addr_check(x, daddr, saddr, encap_family) &&
830 tmpl->mode == x->props.mode &&
831 tmpl->id.proto == x->id.proto &&
832 (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
833 xfrm_state_look_at(pol, x, fl, encap_family, daddr, saddr,
834 &best, &acquire_in_progress, &error);
835 }
836
837found:
838 x = best;
839 if (!x && !error && !acquire_in_progress) {
840 if (tmpl->id.spi &&
841 (x0 = __xfrm_state_lookup(net, mark, daddr, tmpl->id.spi,
842 tmpl->id.proto, encap_family)) != NULL) {
843 to_put = x0;
844 error = -EEXIST;
845 goto out;
846 }
847 x = xfrm_state_alloc(net);
848 if (x == NULL) {
849 error = -ENOMEM;
850 goto out;
851 }
852 /* Initialize temporary state matching only
853 * to current session. */
854 xfrm_init_tempstate(x, fl, tmpl, daddr, saddr, family);
855 memcpy(&x->mark, &pol->mark, sizeof(x->mark));
856
857 error = security_xfrm_state_alloc_acquire(x, pol->security, fl->secid);
858 if (error) {
859 x->km.state = XFRM_STATE_DEAD;
860 to_put = x;
861 x = NULL;
862 goto out;
863 }
864
865 if (km_query(x, tmpl, pol) == 0) {
866 x->km.state = XFRM_STATE_ACQ;
867 list_add(&x->km.all, &net->xfrm.state_all);
868 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
869 h = xfrm_src_hash(net, daddr, saddr, encap_family);
870 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
871 if (x->id.spi) {
872 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, encap_family);
873 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
874 }
875 x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
876 tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
877 net->xfrm.state_num++;
878 xfrm_hash_grow_check(net, x->bydst.next != NULL);
879 } else {
880 x->km.state = XFRM_STATE_DEAD;
881 to_put = x;
882 x = NULL;
883 error = -ESRCH;
884 }
885 }
886out:
887 if (x)
888 xfrm_state_hold(x);
889 else
890 *err = acquire_in_progress ? -EAGAIN : error;
891 spin_unlock_bh(&xfrm_state_lock);
892 if (to_put)
893 xfrm_state_put(to_put);
894 return x;
895}
896
897struct xfrm_state *
898xfrm_stateonly_find(struct net *net, u32 mark,
899 xfrm_address_t *daddr, xfrm_address_t *saddr,
900 unsigned short family, u8 mode, u8 proto, u32 reqid)
901{
902 unsigned int h;
903 struct xfrm_state *rx = NULL, *x = NULL;
904 struct hlist_node *entry;
905
906 spin_lock(&xfrm_state_lock);
907 h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
908 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
909 if (x->props.family == family &&
910 x->props.reqid == reqid &&
911 (mark & x->mark.m) == x->mark.v &&
912 !(x->props.flags & XFRM_STATE_WILDRECV) &&
913 xfrm_state_addr_check(x, daddr, saddr, family) &&
914 mode == x->props.mode &&
915 proto == x->id.proto &&
916 x->km.state == XFRM_STATE_VALID) {
917 rx = x;
918 break;
919 }
920 }
921
922 if (rx)
923 xfrm_state_hold(rx);
924 spin_unlock(&xfrm_state_lock);
925
926
927 return rx;
928}
929EXPORT_SYMBOL(xfrm_stateonly_find);
930
931static void __xfrm_state_insert(struct xfrm_state *x)
932{
933 struct net *net = xs_net(x);
934 unsigned int h;
935
936 list_add(&x->km.all, &net->xfrm.state_all);
937
938 h = xfrm_dst_hash(net, &x->id.daddr, &x->props.saddr,
939 x->props.reqid, x->props.family);
940 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
941
942 h = xfrm_src_hash(net, &x->id.daddr, &x->props.saddr, x->props.family);
943 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
944
945 if (x->id.spi) {
946 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto,
947 x->props.family);
948
949 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
950 }
951
952 tasklet_hrtimer_start(&x->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
953 if (x->replay_maxage)
954 mod_timer(&x->rtimer, jiffies + x->replay_maxage);
955
956 wake_up(&net->xfrm.km_waitq);
957
958 net->xfrm.state_num++;
959
960 xfrm_hash_grow_check(net, x->bydst.next != NULL);
961}
962
963/* xfrm_state_lock is held */
964static void __xfrm_state_bump_genids(struct xfrm_state *xnew)
965{
966 struct net *net = xs_net(xnew);
967 unsigned short family = xnew->props.family;
968 u32 reqid = xnew->props.reqid;
969 struct xfrm_state *x;
970 struct hlist_node *entry;
971 unsigned int h;
972 u32 mark = xnew->mark.v & xnew->mark.m;
973
974 h = xfrm_dst_hash(net, &xnew->id.daddr, &xnew->props.saddr, reqid, family);
975 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
976 if (x->props.family == family &&
977 x->props.reqid == reqid &&
978 (mark & x->mark.m) == x->mark.v &&
979 !xfrm_addr_cmp(&x->id.daddr, &xnew->id.daddr, family) &&
980 !xfrm_addr_cmp(&x->props.saddr, &xnew->props.saddr, family))
981 x->genid++;
982 }
983}
984
985void xfrm_state_insert(struct xfrm_state *x)
986{
987 spin_lock_bh(&xfrm_state_lock);
988 __xfrm_state_bump_genids(x);
989 __xfrm_state_insert(x);
990 spin_unlock_bh(&xfrm_state_lock);
991}
992EXPORT_SYMBOL(xfrm_state_insert);
993
994/* xfrm_state_lock is held */
995static 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)
996{
997 unsigned int h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
998 struct hlist_node *entry;
999 struct xfrm_state *x;
1000 u32 mark = m->v & m->m;
1001
1002 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+h, bydst) {
1003 if (x->props.reqid != reqid ||
1004 x->props.mode != mode ||
1005 x->props.family != family ||
1006 x->km.state != XFRM_STATE_ACQ ||
1007 x->id.spi != 0 ||
1008 x->id.proto != proto ||
1009 (mark & x->mark.m) != x->mark.v ||
1010 xfrm_addr_cmp(&x->id.daddr, daddr, family) ||
1011 xfrm_addr_cmp(&x->props.saddr, saddr, family))
1012 continue;
1013
1014 xfrm_state_hold(x);
1015 return x;
1016 }
1017
1018 if (!create)
1019 return NULL;
1020
1021 x = xfrm_state_alloc(net);
1022 if (likely(x)) {
1023 switch (family) {
1024 case AF_INET:
1025 x->sel.daddr.a4 = daddr->a4;
1026 x->sel.saddr.a4 = saddr->a4;
1027 x->sel.prefixlen_d = 32;
1028 x->sel.prefixlen_s = 32;
1029 x->props.saddr.a4 = saddr->a4;
1030 x->id.daddr.a4 = daddr->a4;
1031 break;
1032
1033 case AF_INET6:
1034 ipv6_addr_copy((struct in6_addr *)x->sel.daddr.a6,
1035 (struct in6_addr *)daddr);
1036 ipv6_addr_copy((struct in6_addr *)x->sel.saddr.a6,
1037 (struct in6_addr *)saddr);
1038 x->sel.prefixlen_d = 128;
1039 x->sel.prefixlen_s = 128;
1040 ipv6_addr_copy((struct in6_addr *)x->props.saddr.a6,
1041 (struct in6_addr *)saddr);
1042 ipv6_addr_copy((struct in6_addr *)x->id.daddr.a6,
1043 (struct in6_addr *)daddr);
1044 break;
1045 }
1046
1047 x->km.state = XFRM_STATE_ACQ;
1048 x->id.proto = proto;
1049 x->props.family = family;
1050 x->props.mode = mode;
1051 x->props.reqid = reqid;
1052 x->mark.v = m->v;
1053 x->mark.m = m->m;
1054 x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
1055 xfrm_state_hold(x);
1056 tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
1057 list_add(&x->km.all, &net->xfrm.state_all);
1058 hlist_add_head(&x->bydst, net->xfrm.state_bydst+h);
1059 h = xfrm_src_hash(net, daddr, saddr, family);
1060 hlist_add_head(&x->bysrc, net->xfrm.state_bysrc+h);
1061
1062 net->xfrm.state_num++;
1063
1064 xfrm_hash_grow_check(net, x->bydst.next != NULL);
1065 }
1066
1067 return x;
1068}
1069
1070static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq);
1071
1072int xfrm_state_add(struct xfrm_state *x)
1073{
1074 struct net *net = xs_net(x);
1075 struct xfrm_state *x1, *to_put;
1076 int family;
1077 int err;
1078 u32 mark = x->mark.v & x->mark.m;
1079 int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
1080
1081 family = x->props.family;
1082
1083 to_put = NULL;
1084
1085 spin_lock_bh(&xfrm_state_lock);
1086
1087 x1 = __xfrm_state_locate(x, use_spi, family);
1088 if (x1) {
1089 to_put = x1;
1090 x1 = NULL;
1091 err = -EEXIST;
1092 goto out;
1093 }
1094
1095 if (use_spi && x->km.seq) {
1096 x1 = __xfrm_find_acq_byseq(net, mark, x->km.seq);
1097 if (x1 && ((x1->id.proto != x->id.proto) ||
1098 xfrm_addr_cmp(&x1->id.daddr, &x->id.daddr, family))) {
1099 to_put = x1;
1100 x1 = NULL;
1101 }
1102 }
1103
1104 if (use_spi && !x1)
1105 x1 = __find_acq_core(net, &x->mark, family, x->props.mode,
1106 x->props.reqid, x->id.proto,
1107 &x->id.daddr, &x->props.saddr, 0);
1108
1109 __xfrm_state_bump_genids(x);
1110 __xfrm_state_insert(x);
1111 err = 0;
1112
1113out:
1114 spin_unlock_bh(&xfrm_state_lock);
1115
1116 if (x1) {
1117 xfrm_state_delete(x1);
1118 xfrm_state_put(x1);
1119 }
1120
1121 if (to_put)
1122 xfrm_state_put(to_put);
1123
1124 return err;
1125}
1126EXPORT_SYMBOL(xfrm_state_add);
1127
1128#ifdef CONFIG_XFRM_MIGRATE
1129static struct xfrm_state *xfrm_state_clone(struct xfrm_state *orig, int *errp)
1130{
1131 struct net *net = xs_net(orig);
1132 int err = -ENOMEM;
1133 struct xfrm_state *x = xfrm_state_alloc(net);
1134 if (!x)
1135 goto out;
1136
1137 memcpy(&x->id, &orig->id, sizeof(x->id));
1138 memcpy(&x->sel, &orig->sel, sizeof(x->sel));
1139 memcpy(&x->lft, &orig->lft, sizeof(x->lft));
1140 x->props.mode = orig->props.mode;
1141 x->props.replay_window = orig->props.replay_window;
1142 x->props.reqid = orig->props.reqid;
1143 x->props.family = orig->props.family;
1144 x->props.saddr = orig->props.saddr;
1145
1146 if (orig->aalg) {
1147 x->aalg = xfrm_algo_auth_clone(orig->aalg);
1148 if (!x->aalg)
1149 goto error;
1150 }
1151 x->props.aalgo = orig->props.aalgo;
1152
1153 if (orig->ealg) {
1154 x->ealg = xfrm_algo_clone(orig->ealg);
1155 if (!x->ealg)
1156 goto error;
1157 }
1158 x->props.ealgo = orig->props.ealgo;
1159
1160 if (orig->calg) {
1161 x->calg = xfrm_algo_clone(orig->calg);
1162 if (!x->calg)
1163 goto error;
1164 }
1165 x->props.calgo = orig->props.calgo;
1166
1167 if (orig->encap) {
1168 x->encap = kmemdup(orig->encap, sizeof(*x->encap), GFP_KERNEL);
1169 if (!x->encap)
1170 goto error;
1171 }
1172
1173 if (orig->coaddr) {
1174 x->coaddr = kmemdup(orig->coaddr, sizeof(*x->coaddr),
1175 GFP_KERNEL);
1176 if (!x->coaddr)
1177 goto error;
1178 }
1179
1180 memcpy(&x->mark, &orig->mark, sizeof(x->mark));
1181
1182 err = xfrm_init_state(x);
1183 if (err)
1184 goto error;
1185
1186 x->props.flags = orig->props.flags;
1187
1188 x->curlft.add_time = orig->curlft.add_time;
1189 x->km.state = orig->km.state;
1190 x->km.seq = orig->km.seq;
1191
1192 return x;
1193
1194 error:
1195 xfrm_state_put(x);
1196out:
1197 if (errp)
1198 *errp = err;
1199 return NULL;
1200}
1201
1202/* xfrm_state_lock is held */
1203struct xfrm_state * xfrm_migrate_state_find(struct xfrm_migrate *m)
1204{
1205 unsigned int h;
1206 struct xfrm_state *x;
1207 struct hlist_node *entry;
1208
1209 if (m->reqid) {
1210 h = xfrm_dst_hash(&init_net, &m->old_daddr, &m->old_saddr,
1211 m->reqid, m->old_family);
1212 hlist_for_each_entry(x, entry, init_net.xfrm.state_bydst+h, bydst) {
1213 if (x->props.mode != m->mode ||
1214 x->id.proto != m->proto)
1215 continue;
1216 if (m->reqid && x->props.reqid != m->reqid)
1217 continue;
1218 if (xfrm_addr_cmp(&x->id.daddr, &m->old_daddr,
1219 m->old_family) ||
1220 xfrm_addr_cmp(&x->props.saddr, &m->old_saddr,
1221 m->old_family))
1222 continue;
1223 xfrm_state_hold(x);
1224 return x;
1225 }
1226 } else {
1227 h = xfrm_src_hash(&init_net, &m->old_daddr, &m->old_saddr,
1228 m->old_family);
1229 hlist_for_each_entry(x, entry, init_net.xfrm.state_bysrc+h, bysrc) {
1230 if (x->props.mode != m->mode ||
1231 x->id.proto != m->proto)
1232 continue;
1233 if (xfrm_addr_cmp(&x->id.daddr, &m->old_daddr,
1234 m->old_family) ||
1235 xfrm_addr_cmp(&x->props.saddr, &m->old_saddr,
1236 m->old_family))
1237 continue;
1238 xfrm_state_hold(x);
1239 return x;
1240 }
1241 }
1242
1243 return NULL;
1244}
1245EXPORT_SYMBOL(xfrm_migrate_state_find);
1246
1247struct xfrm_state * xfrm_state_migrate(struct xfrm_state *x,
1248 struct xfrm_migrate *m)
1249{
1250 struct xfrm_state *xc;
1251 int err;
1252
1253 xc = xfrm_state_clone(x, &err);
1254 if (!xc)
1255 return NULL;
1256
1257 memcpy(&xc->id.daddr, &m->new_daddr, sizeof(xc->id.daddr));
1258 memcpy(&xc->props.saddr, &m->new_saddr, sizeof(xc->props.saddr));
1259
1260 /* add state */
1261 if (!xfrm_addr_cmp(&x->id.daddr, &m->new_daddr, m->new_family)) {
1262 /* a care is needed when the destination address of the
1263 state is to be updated as it is a part of triplet */
1264 xfrm_state_insert(xc);
1265 } else {
1266 if ((err = xfrm_state_add(xc)) < 0)
1267 goto error;
1268 }
1269
1270 return xc;
1271error:
1272 xfrm_state_put(xc);
1273 return NULL;
1274}
1275EXPORT_SYMBOL(xfrm_state_migrate);
1276#endif
1277
1278int xfrm_state_update(struct xfrm_state *x)
1279{
1280 struct xfrm_state *x1, *to_put;
1281 int err;
1282 int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
1283
1284 to_put = NULL;
1285
1286 spin_lock_bh(&xfrm_state_lock);
1287 x1 = __xfrm_state_locate(x, use_spi, x->props.family);
1288
1289 err = -ESRCH;
1290 if (!x1)
1291 goto out;
1292
1293 if (xfrm_state_kern(x1)) {
1294 to_put = x1;
1295 err = -EEXIST;
1296 goto out;
1297 }
1298
1299 if (x1->km.state == XFRM_STATE_ACQ) {
1300 __xfrm_state_insert(x);
1301 x = NULL;
1302 }
1303 err = 0;
1304
1305out:
1306 spin_unlock_bh(&xfrm_state_lock);
1307
1308 if (to_put)
1309 xfrm_state_put(to_put);
1310
1311 if (err)
1312 return err;
1313
1314 if (!x) {
1315 xfrm_state_delete(x1);
1316 xfrm_state_put(x1);
1317 return 0;
1318 }
1319
1320 err = -EINVAL;
1321 spin_lock_bh(&x1->lock);
1322 if (likely(x1->km.state == XFRM_STATE_VALID)) {
1323 if (x->encap && x1->encap)
1324 memcpy(x1->encap, x->encap, sizeof(*x1->encap));
1325 if (x->coaddr && x1->coaddr) {
1326 memcpy(x1->coaddr, x->coaddr, sizeof(*x1->coaddr));
1327 }
1328 if (!use_spi && memcmp(&x1->sel, &x->sel, sizeof(x1->sel)))
1329 memcpy(&x1->sel, &x->sel, sizeof(x1->sel));
1330 memcpy(&x1->lft, &x->lft, sizeof(x1->lft));
1331 x1->km.dying = 0;
1332
1333 tasklet_hrtimer_start(&x1->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
1334 if (x1->curlft.use_time)
1335 xfrm_state_check_expire(x1);
1336
1337 err = 0;
1338 }
1339 spin_unlock_bh(&x1->lock);
1340
1341 xfrm_state_put(x1);
1342
1343 return err;
1344}
1345EXPORT_SYMBOL(xfrm_state_update);
1346
1347int xfrm_state_check_expire(struct xfrm_state *x)
1348{
1349 if (!x->curlft.use_time)
1350 x->curlft.use_time = get_seconds();
1351
1352 if (x->km.state != XFRM_STATE_VALID)
1353 return -EINVAL;
1354
1355 if (x->curlft.bytes >= x->lft.hard_byte_limit ||
1356 x->curlft.packets >= x->lft.hard_packet_limit) {
1357 x->km.state = XFRM_STATE_EXPIRED;
1358 tasklet_hrtimer_start(&x->mtimer, ktime_set(0,0), HRTIMER_MODE_REL);
1359 return -EINVAL;
1360 }
1361
1362 if (!x->km.dying &&
1363 (x->curlft.bytes >= x->lft.soft_byte_limit ||
1364 x->curlft.packets >= x->lft.soft_packet_limit)) {
1365 x->km.dying = 1;
1366 km_state_expired(x, 0, 0);
1367 }
1368 return 0;
1369}
1370EXPORT_SYMBOL(xfrm_state_check_expire);
1371
1372struct xfrm_state *
1373xfrm_state_lookup(struct net *net, u32 mark, xfrm_address_t *daddr, __be32 spi,
1374 u8 proto, unsigned short family)
1375{
1376 struct xfrm_state *x;
1377
1378 spin_lock_bh(&xfrm_state_lock);
1379 x = __xfrm_state_lookup(net, mark, daddr, spi, proto, family);
1380 spin_unlock_bh(&xfrm_state_lock);
1381 return x;
1382}
1383EXPORT_SYMBOL(xfrm_state_lookup);
1384
1385struct xfrm_state *
1386xfrm_state_lookup_byaddr(struct net *net, u32 mark,
1387 xfrm_address_t *daddr, xfrm_address_t *saddr,
1388 u8 proto, unsigned short family)
1389{
1390 struct xfrm_state *x;
1391
1392 spin_lock_bh(&xfrm_state_lock);
1393 x = __xfrm_state_lookup_byaddr(net, mark, daddr, saddr, proto, family);
1394 spin_unlock_bh(&xfrm_state_lock);
1395 return x;
1396}
1397EXPORT_SYMBOL(xfrm_state_lookup_byaddr);
1398
1399struct xfrm_state *
1400xfrm_find_acq(struct net *net, struct xfrm_mark *mark, u8 mode, u32 reqid, u8 proto,
1401 xfrm_address_t *daddr, xfrm_address_t *saddr,
1402 int create, unsigned short family)
1403{
1404 struct xfrm_state *x;
1405
1406 spin_lock_bh(&xfrm_state_lock);
1407 x = __find_acq_core(net, mark, family, mode, reqid, proto, daddr, saddr, create);
1408 spin_unlock_bh(&xfrm_state_lock);
1409
1410 return x;
1411}
1412EXPORT_SYMBOL(xfrm_find_acq);
1413
1414#ifdef CONFIG_XFRM_SUB_POLICY
1415int
1416xfrm_tmpl_sort(struct xfrm_tmpl **dst, struct xfrm_tmpl **src, int n,
1417 unsigned short family)
1418{
1419 int err = 0;
1420 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
1421 if (!afinfo)
1422 return -EAFNOSUPPORT;
1423
1424 spin_lock_bh(&xfrm_state_lock);
1425 if (afinfo->tmpl_sort)
1426 err = afinfo->tmpl_sort(dst, src, n);
1427 spin_unlock_bh(&xfrm_state_lock);
1428 xfrm_state_put_afinfo(afinfo);
1429 return err;
1430}
1431EXPORT_SYMBOL(xfrm_tmpl_sort);
1432
1433int
1434xfrm_state_sort(struct xfrm_state **dst, struct xfrm_state **src, int n,
1435 unsigned short family)
1436{
1437 int err = 0;
1438 struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
1439 if (!afinfo)
1440 return -EAFNOSUPPORT;
1441
1442 spin_lock_bh(&xfrm_state_lock);
1443 if (afinfo->state_sort)
1444 err = afinfo->state_sort(dst, src, n);
1445 spin_unlock_bh(&xfrm_state_lock);
1446 xfrm_state_put_afinfo(afinfo);
1447 return err;
1448}
1449EXPORT_SYMBOL(xfrm_state_sort);
1450#endif
1451
1452/* Silly enough, but I'm lazy to build resolution list */
1453
1454static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
1455{
1456 int i;
1457
1458 for (i = 0; i <= net->xfrm.state_hmask; i++) {
1459 struct hlist_node *entry;
1460 struct xfrm_state *x;
1461
1462 hlist_for_each_entry(x, entry, net->xfrm.state_bydst+i, bydst) {
1463 if (x->km.seq == seq &&
1464 (mark & x->mark.m) == x->mark.v &&
1465 x->km.state == XFRM_STATE_ACQ) {
1466 xfrm_state_hold(x);
1467 return x;
1468 }
1469 }
1470 }
1471 return NULL;
1472}
1473
1474struct xfrm_state *xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
1475{
1476 struct xfrm_state *x;
1477
1478 spin_lock_bh(&xfrm_state_lock);
1479 x = __xfrm_find_acq_byseq(net, mark, seq);
1480 spin_unlock_bh(&xfrm_state_lock);
1481 return x;
1482}
1483EXPORT_SYMBOL(xfrm_find_acq_byseq);
1484
1485u32 xfrm_get_acqseq(void)
1486{
1487 u32 res;
1488 static atomic_t acqseq;
1489
1490 do {
1491 res = atomic_inc_return(&acqseq);
1492 } while (!res);
1493
1494 return res;
1495}
1496EXPORT_SYMBOL(xfrm_get_acqseq);
1497
1498int xfrm_alloc_spi(struct xfrm_state *x, u32 low, u32 high)
1499{
1500 struct net *net = xs_net(x);
1501 unsigned int h;
1502 struct xfrm_state *x0;
1503 int err = -ENOENT;
1504 __be32 minspi = htonl(low);
1505 __be32 maxspi = htonl(high);
1506 u32 mark = x->mark.v & x->mark.m;
1507
1508 spin_lock_bh(&x->lock);
1509 if (x->km.state == XFRM_STATE_DEAD)
1510 goto unlock;
1511
1512 err = 0;
1513 if (x->id.spi)
1514 goto unlock;
1515
1516 err = -ENOENT;
1517
1518 if (minspi == maxspi) {
1519 x0 = xfrm_state_lookup(net, mark, &x->id.daddr, minspi, x->id.proto, x->props.family);
1520 if (x0) {
1521 xfrm_state_put(x0);
1522 goto unlock;
1523 }
1524 x->id.spi = minspi;
1525 } else {
1526 u32 spi = 0;
1527 for (h=0; h<high-low+1; h++) {
1528 spi = low + net_random()%(high-low+1);
1529 x0 = xfrm_state_lookup(net, mark, &x->id.daddr, htonl(spi), x->id.proto, x->props.family);
1530 if (x0 == NULL) {
1531 x->id.spi = htonl(spi);
1532 break;
1533 }
1534 xfrm_state_put(x0);
1535 }
1536 }
1537 if (x->id.spi) {
1538 spin_lock_bh(&xfrm_state_lock);
1539 h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, x->props.family);
1540 hlist_add_head(&x->byspi, net->xfrm.state_byspi+h);
1541 spin_unlock_bh(&xfrm_state_lock);
1542
1543 err = 0;
1544 }
1545
1546unlock:
1547 spin_unlock_bh(&x->lock);
1548
1549 return err;
1550}
1551EXPORT_SYMBOL(xfrm_alloc_spi);
1552
1553int xfrm_state_walk(struct net *net, struct xfrm_state_walk *walk,
1554 int (*func)(struct xfrm_state *, int, void*),
1555 void *data)
1556{
1557 struct xfrm_state *state;
1558 struct xfrm_state_walk *x;
1559 int err = 0;
1560
1561 if (walk->seq != 0 && list_empty(&walk->all))
1562 return 0;
1563
1564 spin_lock_bh(&xfrm_state_lock);
1565 if (list_empty(&walk->all))
1566 x = list_first_entry(&net->xfrm.state_all, struct xfrm_state_walk, all);
1567 else
1568 x = list_entry(&walk->all, struct xfrm_state_walk, all);
1569 list_for_each_entry_from(x, &net->xfrm.state_all, all) {
1570 if (x->state == XFRM_STATE_DEAD)
1571 continue;
1572 state = container_of(x, struct xfrm_state, km);
1573 if (!xfrm_id_proto_match(state->id.proto, walk->proto))
1574 continue;
1575 err = func(state, walk->seq, data);
1576 if (err) {
1577 list_move_tail(&walk->all, &x->all);
1578 goto out;
1579 }
1580 walk->seq++;
1581 }
1582 if (walk->seq == 0) {
1583 err = -ENOENT;
1584 goto out;
1585 }
1586 list_del_init(&walk->all);
1587out:
1588 spin_unlock_bh(&xfrm_state_lock);
1589 return err;
1590}
1591EXPORT_SYMBOL(xfrm_state_walk);
1592
1593void xfrm_state_walk_init(struct xfrm_state_walk *walk, u8 proto)
1594{
1595 INIT_LIST_HEAD(&walk->all);
1596 walk->proto = proto;
1597 walk->state = XFRM_STATE_DEAD;
1598 walk->seq = 0;
1599}
1600EXPORT_SYMBOL(xfrm_state_walk_init);
1601
1602void xfrm_state_walk_done(struct xfrm_state_walk *walk)
1603{
1604 if (list_empty(&walk->all))
1605 return;
1606
1607 spin_lock_bh(&xfrm_state_lock);
1608 list_del(&walk->all);
1609 spin_unlock_bh(&xfrm_state_lock);
1610}
1611EXPORT_SYMBOL(xfrm_state_walk_done);
1612
1613
1614void xfrm_replay_notify(struct xfrm_state *x, int event)
1615{
1616 struct km_event c;
1617 /* we send notify messages in case
1618 * 1. we updated on of the sequence numbers, and the seqno difference
1619 * is at least x->replay_maxdiff, in this case we also update the
1620 * timeout of our timer function
1621 * 2. if x->replay_maxage has elapsed since last update,
1622 * and there were changes
1623 *
1624 * The state structure must be locked!
1625 */
1626
1627 switch (event) {
1628 case XFRM_REPLAY_UPDATE:
1629 if (x->replay_maxdiff &&
1630 (x->replay.seq - x->preplay.seq < x->replay_maxdiff) &&
1631 (x->replay.oseq - x->preplay.oseq < x->replay_maxdiff)) {
1632 if (x->xflags & XFRM_TIME_DEFER)
1633 event = XFRM_REPLAY_TIMEOUT;
1634 else
1635 return;
1636 }
1637
1638 break;
1639
1640 case XFRM_REPLAY_TIMEOUT:
1641 if ((x->replay.seq == x->preplay.seq) &&
1642 (x->replay.bitmap == x->preplay.bitmap) &&
1643 (x->replay.oseq == x->preplay.oseq)) {
1644 x->xflags |= XFRM_TIME_DEFER;
1645 return;
1646 }
1647
1648 break;
1649 }
1650
1651 memcpy(&x->preplay, &x->replay, sizeof(struct xfrm_replay_state));
1652 c.event = XFRM_MSG_NEWAE;
1653 c.data.aevent = event;
1654 km_state_notify(x, &c);
1655
1656 if (x->replay_maxage &&
1657 !mod_timer(&x->rtimer, jiffies + x->replay_maxage))
1658 x->xflags &= ~XFRM_TIME_DEFER;
1659}
1660
1661static void xfrm_replay_timer_handler(unsigned long data)
1662{
1663 struct xfrm_state *x = (struct xfrm_state*)data;
1664
1665 spin_lock(&x->lock);
1666
1667 if (x->km.state == XFRM_STATE_VALID) {
1668 if (xfrm_aevent_is_on(xs_net(x)))
1669 xfrm_replay_notify(x, XFRM_REPLAY_TIMEOUT);
1670 else
1671 x->xflags |= XFRM_TIME_DEFER;
1672 }
1673
1674 spin_unlock(&x->lock);
1675}
1676
1677int xfrm_replay_check(struct xfrm_state *x,
1678 struct sk_buff *skb, __be32 net_seq)
1679{
1680 u32 diff;
1681 u32 seq = ntohl(net_seq);
1682
1683 if (unlikely(seq == 0))
1684 goto err;
1685
1686 if (likely(seq > x->replay.seq))
1687 return 0;
1688
1689 diff = x->replay.seq - seq;
1690 if (diff >= min_t(unsigned int, x->props.replay_window,
1691 sizeof(x->replay.bitmap) * 8)) {
1692 x->stats.replay_window++;
1693 goto err;
1694 }
1695
1696 if (x->replay.bitmap & (1U << diff)) {
1697 x->stats.replay++;
1698 goto err;
1699 }
1700 return 0;
1701
1702err:
1703 xfrm_audit_state_replay(x, skb, net_seq);
1704 return -EINVAL;
1705}
1706
1707void xfrm_replay_advance(struct xfrm_state *x, __be32 net_seq)
1708{
1709 u32 diff;
1710 u32 seq = ntohl(net_seq);
1711
1712 if (seq > x->replay.seq) {
1713 diff = seq - x->replay.seq;
1714 if (diff < x->props.replay_window)
1715 x->replay.bitmap = ((x->replay.bitmap) << diff) | 1;
1716 else
1717 x->replay.bitmap = 1;
1718 x->replay.seq = seq;
1719 } else {
1720 diff = x->replay.seq - seq;
1721 x->replay.bitmap |= (1U << diff);
1722 }
1723
1724 if (xfrm_aevent_is_on(xs_net(x)))
1725 xfrm_replay_notify(x, XFRM_REPLAY_UPDATE);
1726}
1727
1728static LIST_HEAD(xfrm_km_list);
1729static DEFINE_RWLOCK(xfrm_km_lock);
1730
1731void km_policy_notify(struct xfrm_policy *xp, int dir, const struct km_event *c)
1732{
1733 struct xfrm_mgr *km;
1734
1735 read_lock(&xfrm_km_lock);
1736 list_for_each_entry(km, &xfrm_km_list, list)
1737 if (km->notify_policy)
1738 km->notify_policy(xp, dir, c);
1739 read_unlock(&xfrm_km_lock);
1740}
1741
1742void km_state_notify(struct xfrm_state *x, const struct km_event *c)
1743{
1744 struct xfrm_mgr *km;
1745 read_lock(&xfrm_km_lock);
1746 list_for_each_entry(km, &xfrm_km_list, list)
1747 if (km->notify)
1748 km->notify(x, c);
1749 read_unlock(&xfrm_km_lock);
1750}
1751
1752EXPORT_SYMBOL(km_policy_notify);
1753EXPORT_SYMBOL(km_state_notify);
1754
1755void km_state_expired(struct xfrm_state *x, int hard, u32 pid)
1756{
1757 struct net *net = xs_net(x);
1758 struct km_event c;
1759
1760 c.data.hard = hard;
1761 c.pid = pid;
1762 c.event = XFRM_MSG_EXPIRE;
1763 km_state_notify(x, &c);
1764
1765 if (hard)
1766 wake_up(&net->xfrm.km_waitq);
1767}
1768
1769EXPORT_SYMBOL(km_state_expired);
1770/*
1771 * We send to all registered managers regardless of failure
1772 * We are happy with one success
1773*/
1774int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol)
1775{
1776 int err = -EINVAL, acqret;
1777 struct xfrm_mgr *km;
1778
1779 read_lock(&xfrm_km_lock);
1780 list_for_each_entry(km, &xfrm_km_list, list) {
1781 acqret = km->acquire(x, t, pol, XFRM_POLICY_OUT);
1782 if (!acqret)
1783 err = acqret;
1784 }
1785 read_unlock(&xfrm_km_lock);
1786 return err;
1787}
1788EXPORT_SYMBOL(km_query);
1789
1790int km_new_mapping(struct xfrm_state *x, xfrm_address_t *ipaddr, __be16 sport)
1791{
1792 int err = -EINVAL;
1793 struct xfrm_mgr *km;
1794
1795 read_lock(&xfrm_km_lock);
1796 list_for_each_entry(km, &xfrm_km_list, list) {
1797 if (km->new_mapping)
1798 err = km->new_mapping(x, ipaddr, sport);
1799 if (!err)
1800 break;
1801 }
1802 read_unlock(&xfrm_km_lock);
1803 return err;
1804}
1805EXPORT_SYMBOL(km_new_mapping);
1806
1807void km_policy_expired(struct xfrm_policy *pol, int dir, int hard, u32 pid)
1808{
1809 struct net *net = xp_net(pol);
1810 struct km_event c;
1811
1812 c.data.hard = hard;
1813 c.pid = pid;
1814 c.event = XFRM_MSG_POLEXPIRE;
1815 km_policy_notify(pol, dir, &c);
1816
1817 if (hard)
1818 wake_up(&net->xfrm.km_waitq);
1819}
1820EXPORT_SYMBOL(km_policy_expired);
1821
1822#ifdef CONFIG_XFRM_MIGRATE
1823int km_migrate(const struct xfrm_selector *sel, u8 dir, u8 type,
1824 const struct xfrm_migrate *m, int num_migrate,
1825 const struct xfrm_kmaddress *k)
1826{
1827 int err = -EINVAL;
1828 int ret;
1829 struct xfrm_mgr *km;
1830
1831 read_lock(&xfrm_km_lock);
1832 list_for_each_entry(km, &xfrm_km_list, list) {
1833 if (km->migrate) {
1834 ret = km->migrate(sel, dir, type, m, num_migrate, k);
1835 if (!ret)
1836 err = ret;
1837 }
1838 }
1839 read_unlock(&xfrm_km_lock);
1840 return err;
1841}
1842EXPORT_SYMBOL(km_migrate);
1843#endif
1844
1845int km_report(struct net *net, u8 proto, struct xfrm_selector *sel, xfrm_address_t *addr)
1846{
1847 int err = -EINVAL;
1848 int ret;
1849 struct xfrm_mgr *km;
1850
1851 read_lock(&xfrm_km_lock);
1852 list_for_each_entry(km, &xfrm_km_list, list) {
1853 if (km->report) {
1854 ret = km->report(net, proto, sel, addr);
1855 if (!ret)
1856 err = ret;
1857 }
1858 }
1859 read_unlock(&xfrm_km_lock);
1860 return err;
1861}
1862EXPORT_SYMBOL(km_report);
1863
1864int xfrm_user_policy(struct sock *sk, int optname, u8 __user *optval, int optlen)
1865{
1866 int err;
1867 u8 *data;
1868 struct xfrm_mgr *km;
1869 struct xfrm_policy *pol = NULL;
1870
1871 if (optlen <= 0 || optlen > PAGE_SIZE)
1872 return -EMSGSIZE;
1873
1874 data = kmalloc(optlen, GFP_KERNEL);
1875 if (!data)
1876 return -ENOMEM;
1877
1878 err = -EFAULT;
1879 if (copy_from_user(data, optval, optlen))
1880 goto out;
1881
1882 err = -EINVAL;
1883 read_lock(&xfrm_km_lock);
1884 list_for_each_entry(km, &xfrm_km_list, list) {
1885 pol = km->compile_policy(sk, optname, data,
1886 optlen, &err);
1887 if (err >= 0)
1888 break;
1889 }
1890 read_unlock(&xfrm_km_lock);
1891
1892 if (err >= 0) {
1893 xfrm_sk_policy_insert(sk, err, pol);
1894 xfrm_pol_put(pol);
1895 err = 0;
1896 }
1897
1898out:
1899 kfree(data);
1900 return err;
1901}
1902EXPORT_SYMBOL(xfrm_user_policy);
1903
1904int xfrm_register_km(struct xfrm_mgr *km)
1905{
1906 write_lock_bh(&xfrm_km_lock);
1907 list_add_tail(&km->list, &xfrm_km_list);
1908 write_unlock_bh(&xfrm_km_lock);
1909 return 0;
1910}
1911EXPORT_SYMBOL(xfrm_register_km);
1912
1913int xfrm_unregister_km(struct xfrm_mgr *km)
1914{
1915 write_lock_bh(&xfrm_km_lock);
1916 list_del(&km->list);
1917 write_unlock_bh(&xfrm_km_lock);
1918 return 0;
1919}
1920EXPORT_SYMBOL(xfrm_unregister_km);
1921
1922int xfrm_state_register_afinfo(struct xfrm_state_afinfo *afinfo)
1923{
1924 int err = 0;
1925 if (unlikely(afinfo == NULL))
1926 return -EINVAL;
1927 if (unlikely(afinfo->family >= NPROTO))
1928 return -EAFNOSUPPORT;
1929 write_lock_bh(&xfrm_state_afinfo_lock);
1930 if (unlikely(xfrm_state_afinfo[afinfo->family] != NULL))
1931 err = -ENOBUFS;
1932 else
1933 xfrm_state_afinfo[afinfo->family] = afinfo;
1934 write_unlock_bh(&xfrm_state_afinfo_lock);
1935 return err;
1936}
1937EXPORT_SYMBOL(xfrm_state_register_afinfo);
1938
1939int xfrm_state_unregister_afinfo(struct xfrm_state_afinfo *afinfo)
1940{
1941 int err = 0;
1942 if (unlikely(afinfo == NULL))
1943 return -EINVAL;
1944 if (unlikely(afinfo->family >= NPROTO))
1945 return -EAFNOSUPPORT;
1946 write_lock_bh(&xfrm_state_afinfo_lock);
1947 if (likely(xfrm_state_afinfo[afinfo->family] != NULL)) {
1948 if (unlikely(xfrm_state_afinfo[afinfo->family] != afinfo))
1949 err = -EINVAL;
1950 else
1951 xfrm_state_afinfo[afinfo->family] = NULL;
1952 }
1953 write_unlock_bh(&xfrm_state_afinfo_lock);
1954 return err;
1955}
1956EXPORT_SYMBOL(xfrm_state_unregister_afinfo);
1957
1958static struct xfrm_state_afinfo *xfrm_state_get_afinfo(unsigned int family)
1959{
1960 struct xfrm_state_afinfo *afinfo;
1961 if (unlikely(family >= NPROTO))
1962 return NULL;
1963 read_lock(&xfrm_state_afinfo_lock);
1964 afinfo = xfrm_state_afinfo[family];
1965 if (unlikely(!afinfo))
1966 read_unlock(&xfrm_state_afinfo_lock);
1967 return afinfo;
1968}
1969
1970static void xfrm_state_put_afinfo(struct xfrm_state_afinfo *afinfo)
1971 __releases(xfrm_state_afinfo_lock)
1972{
1973 read_unlock(&xfrm_state_afinfo_lock);
1974}
1975
1976/* Temporarily located here until net/xfrm/xfrm_tunnel.c is created */
1977void xfrm_state_delete_tunnel(struct xfrm_state *x)
1978{
1979 if (x->tunnel) {
1980 struct xfrm_state *t = x->tunnel;
1981
1982 if (atomic_read(&t->tunnel_users) == 2)
1983 xfrm_state_delete(t);
1984 atomic_dec(&t->tunnel_users);
1985 xfrm_state_put(t);
1986 x->tunnel = NULL;
1987 }
1988}
1989EXPORT_SYMBOL(xfrm_state_delete_tunnel);
1990
1991int xfrm_state_mtu(struct xfrm_state *x, int mtu)
1992{
1993 int res;
1994
1995 spin_lock_bh(&x->lock);
1996 if (x->km.state == XFRM_STATE_VALID &&
1997 x->type && x->type->get_mtu)
1998 res = x->type->get_mtu(x, mtu);
1999 else
2000 res = mtu - x->props.header_len;
2001 spin_unlock_bh(&x->lock);
2002 return res;
2003}
2004
2005int xfrm_init_state(struct xfrm_state *x)
2006{
2007 struct xfrm_state_afinfo *afinfo;
2008 struct xfrm_mode *inner_mode;
2009 int family = x->props.family;
2010 int err;
2011
2012 err = -EAFNOSUPPORT;
2013 afinfo = xfrm_state_get_afinfo(family);
2014 if (!afinfo)
2015 goto error;
2016
2017 err = 0;
2018 if (afinfo->init_flags)
2019 err = afinfo->init_flags(x);
2020
2021 xfrm_state_put_afinfo(afinfo);
2022
2023 if (err)
2024 goto error;
2025
2026 err = -EPROTONOSUPPORT;
2027
2028 if (x->sel.family != AF_UNSPEC) {
2029 inner_mode = xfrm_get_mode(x->props.mode, x->sel.family);
2030 if (inner_mode == NULL)
2031 goto error;
2032
2033 if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL) &&
2034 family != x->sel.family) {
2035 xfrm_put_mode(inner_mode);
2036 goto error;
2037 }
2038
2039 x->inner_mode = inner_mode;
2040 } else {
2041 struct xfrm_mode *inner_mode_iaf;
2042 int iafamily = AF_INET;
2043
2044 inner_mode = xfrm_get_mode(x->props.mode, x->props.family);
2045 if (inner_mode == NULL)
2046 goto error;
2047
2048 if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL)) {
2049 xfrm_put_mode(inner_mode);
2050 goto error;
2051 }
2052 x->inner_mode = inner_mode;
2053
2054 if (x->props.family == AF_INET)
2055 iafamily = AF_INET6;
2056
2057 inner_mode_iaf = xfrm_get_mode(x->props.mode, iafamily);
2058 if (inner_mode_iaf) {
2059 if (inner_mode_iaf->flags & XFRM_MODE_FLAG_TUNNEL)
2060 x->inner_mode_iaf = inner_mode_iaf;
2061 else
2062 xfrm_put_mode(inner_mode_iaf);
2063 }
2064 }
2065
2066 x->type = xfrm_get_type(x->id.proto, family);
2067 if (x->type == NULL)
2068 goto error;
2069
2070 err = x->type->init_state(x);
2071 if (err)
2072 goto error;
2073
2074 x->outer_mode = xfrm_get_mode(x->props.mode, family);
2075 if (x->outer_mode == NULL)
2076 goto error;
2077
2078 x->km.state = XFRM_STATE_VALID;
2079
2080error:
2081 return err;
2082}
2083
2084EXPORT_SYMBOL(xfrm_init_state);
2085
2086int __net_init xfrm_state_init(struct net *net)
2087{
2088 unsigned int sz;
2089
2090 INIT_LIST_HEAD(&net->xfrm.state_all);
2091
2092 sz = sizeof(struct hlist_head) * 8;
2093
2094 net->xfrm.state_bydst = xfrm_hash_alloc(sz);
2095 if (!net->xfrm.state_bydst)
2096 goto out_bydst;
2097 net->xfrm.state_bysrc = xfrm_hash_alloc(sz);
2098 if (!net->xfrm.state_bysrc)
2099 goto out_bysrc;
2100 net->xfrm.state_byspi = xfrm_hash_alloc(sz);
2101 if (!net->xfrm.state_byspi)
2102 goto out_byspi;
2103 net->xfrm.state_hmask = ((sz / sizeof(struct hlist_head)) - 1);
2104
2105 net->xfrm.state_num = 0;
2106 INIT_WORK(&net->xfrm.state_hash_work, xfrm_hash_resize);
2107 INIT_HLIST_HEAD(&net->xfrm.state_gc_list);
2108 INIT_WORK(&net->xfrm.state_gc_work, xfrm_state_gc_task);
2109 init_waitqueue_head(&net->xfrm.km_waitq);
2110 return 0;
2111
2112out_byspi:
2113 xfrm_hash_free(net->xfrm.state_bysrc, sz);
2114out_bysrc:
2115 xfrm_hash_free(net->xfrm.state_bydst, sz);
2116out_bydst:
2117 return -ENOMEM;
2118}
2119
2120void xfrm_state_fini(struct net *net)
2121{
2122 struct xfrm_audit audit_info;
2123 unsigned int sz;
2124
2125 flush_work(&net->xfrm.state_hash_work);
2126 audit_info.loginuid = -1;
2127 audit_info.sessionid = -1;
2128 audit_info.secid = 0;
2129 xfrm_state_flush(net, IPSEC_PROTO_ANY, &audit_info);
2130 flush_work(&net->xfrm.state_gc_work);
2131
2132 WARN_ON(!list_empty(&net->xfrm.state_all));
2133
2134 sz = (net->xfrm.state_hmask + 1) * sizeof(struct hlist_head);
2135 WARN_ON(!hlist_empty(net->xfrm.state_byspi));
2136 xfrm_hash_free(net->xfrm.state_byspi, sz);
2137 WARN_ON(!hlist_empty(net->xfrm.state_bysrc));
2138 xfrm_hash_free(net->xfrm.state_bysrc, sz);
2139 WARN_ON(!hlist_empty(net->xfrm.state_bydst));
2140 xfrm_hash_free(net->xfrm.state_bydst, sz);
2141}
2142
2143#ifdef CONFIG_AUDITSYSCALL
2144static void xfrm_audit_helper_sainfo(struct xfrm_state *x,
2145 struct audit_buffer *audit_buf)
2146{
2147 struct xfrm_sec_ctx *ctx = x->security;
2148 u32 spi = ntohl(x->id.spi);
2149
2150 if (ctx)
2151 audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
2152 ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
2153
2154 switch(x->props.family) {
2155 case AF_INET:
2156 audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
2157 &x->props.saddr.a4, &x->id.daddr.a4);
2158 break;
2159 case AF_INET6:
2160 audit_log_format(audit_buf, " src=%pI6 dst=%pI6",
2161 x->props.saddr.a6, x->id.daddr.a6);
2162 break;
2163 }
2164
2165 audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
2166}
2167
2168static void xfrm_audit_helper_pktinfo(struct sk_buff *skb, u16 family,
2169 struct audit_buffer *audit_buf)
2170{
2171 struct iphdr *iph4;
2172 struct ipv6hdr *iph6;
2173
2174 switch (family) {
2175 case AF_INET:
2176 iph4 = ip_hdr(skb);
2177 audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
2178 &iph4->saddr, &iph4->daddr);
2179 break;
2180 case AF_INET6:
2181 iph6 = ipv6_hdr(skb);
2182 audit_log_format(audit_buf,
2183 " src=%pI6 dst=%pI6 flowlbl=0x%x%02x%02x",
2184 &iph6->saddr,&iph6->daddr,
2185 iph6->flow_lbl[0] & 0x0f,
2186 iph6->flow_lbl[1],
2187 iph6->flow_lbl[2]);
2188 break;
2189 }
2190}
2191
2192void xfrm_audit_state_add(struct xfrm_state *x, int result,
2193 uid_t auid, u32 sessionid, u32 secid)
2194{
2195 struct audit_buffer *audit_buf;
2196
2197 audit_buf = xfrm_audit_start("SAD-add");
2198 if (audit_buf == NULL)
2199 return;
2200 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2201 xfrm_audit_helper_sainfo(x, audit_buf);
2202 audit_log_format(audit_buf, " res=%u", result);
2203 audit_log_end(audit_buf);
2204}
2205EXPORT_SYMBOL_GPL(xfrm_audit_state_add);
2206
2207void xfrm_audit_state_delete(struct xfrm_state *x, int result,
2208 uid_t auid, u32 sessionid, u32 secid)
2209{
2210 struct audit_buffer *audit_buf;
2211
2212 audit_buf = xfrm_audit_start("SAD-delete");
2213 if (audit_buf == NULL)
2214 return;
2215 xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2216 xfrm_audit_helper_sainfo(x, audit_buf);
2217 audit_log_format(audit_buf, " res=%u", result);
2218 audit_log_end(audit_buf);
2219}
2220EXPORT_SYMBOL_GPL(xfrm_audit_state_delete);
2221
2222void xfrm_audit_state_replay_overflow(struct xfrm_state *x,
2223 struct sk_buff *skb)
2224{
2225 struct audit_buffer *audit_buf;
2226 u32 spi;
2227
2228 audit_buf = xfrm_audit_start("SA-replay-overflow");
2229 if (audit_buf == NULL)
2230 return;
2231 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2232 /* don't record the sequence number because it's inherent in this kind
2233 * of audit message */
2234 spi = ntohl(x->id.spi);
2235 audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
2236 audit_log_end(audit_buf);
2237}
2238EXPORT_SYMBOL_GPL(xfrm_audit_state_replay_overflow);
2239
2240static void xfrm_audit_state_replay(struct xfrm_state *x,
2241 struct sk_buff *skb, __be32 net_seq)
2242{
2243 struct audit_buffer *audit_buf;
2244 u32 spi;
2245
2246 audit_buf = xfrm_audit_start("SA-replayed-pkt");
2247 if (audit_buf == NULL)
2248 return;
2249 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2250 spi = ntohl(x->id.spi);
2251 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2252 spi, spi, ntohl(net_seq));
2253 audit_log_end(audit_buf);
2254}
2255
2256void xfrm_audit_state_notfound_simple(struct sk_buff *skb, u16 family)
2257{
2258 struct audit_buffer *audit_buf;
2259
2260 audit_buf = xfrm_audit_start("SA-notfound");
2261 if (audit_buf == NULL)
2262 return;
2263 xfrm_audit_helper_pktinfo(skb, family, audit_buf);
2264 audit_log_end(audit_buf);
2265}
2266EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound_simple);
2267
2268void xfrm_audit_state_notfound(struct sk_buff *skb, u16 family,
2269 __be32 net_spi, __be32 net_seq)
2270{
2271 struct audit_buffer *audit_buf;
2272 u32 spi;
2273
2274 audit_buf = xfrm_audit_start("SA-notfound");
2275 if (audit_buf == NULL)
2276 return;
2277 xfrm_audit_helper_pktinfo(skb, family, audit_buf);
2278 spi = ntohl(net_spi);
2279 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2280 spi, spi, ntohl(net_seq));
2281 audit_log_end(audit_buf);
2282}
2283EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound);
2284
2285void xfrm_audit_state_icvfail(struct xfrm_state *x,
2286 struct sk_buff *skb, u8 proto)
2287{
2288 struct audit_buffer *audit_buf;
2289 __be32 net_spi;
2290 __be32 net_seq;
2291
2292 audit_buf = xfrm_audit_start("SA-icv-failure");
2293 if (audit_buf == NULL)
2294 return;
2295 xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
2296 if (xfrm_parse_spi(skb, proto, &net_spi, &net_seq) == 0) {
2297 u32 spi = ntohl(net_spi);
2298 audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
2299 spi, spi, ntohl(net_seq));
2300 }
2301 audit_log_end(audit_buf);
2302}
2303EXPORT_SYMBOL_GPL(xfrm_audit_state_icvfail);
2304#endif /* CONFIG_AUDITSYSCALL */
Linux kernel - Deliverables
This page took 0.052196 seconds and 5 git commands to generate.