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