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