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