1 /*
2  * xfrm_policy.c
3  *
4  * Changes:
5  *	Mitsuru KANDA @USAGI
6  * 	Kazunori MIYAZAWA @USAGI
7  * 	Kunihiro Ishiguro <kunihiro@ipinfusion.com>
8  * 		IPv6 support
9  * 	Kazunori MIYAZAWA @USAGI
10  * 	YOSHIFUJI Hideaki
11  * 		Split up af-specific portion
12  *	Derek Atkins <derek@ihtfp.com>		Add the post_input processor
13  *
14  */
15 
16 #include <linux/err.h>
17 #include <linux/slab.h>
18 #include <linux/kmod.h>
19 #include <linux/list.h>
20 #include <linux/spinlock.h>
21 #include <linux/workqueue.h>
22 #include <linux/notifier.h>
23 #include <linux/netdevice.h>
24 #include <linux/netfilter.h>
25 #include <linux/module.h>
26 #include <linux/cache.h>
27 #include <linux/audit.h>
28 #include <net/dst.h>
29 #include <net/xfrm.h>
30 #include <net/ip.h>
31 #ifdef CONFIG_XFRM_STATISTICS
32 #include <net/snmp.h>
33 #endif
34 
35 #include "xfrm_hash.h"
36 
37 DEFINE_MUTEX(xfrm_cfg_mutex);
38 EXPORT_SYMBOL(xfrm_cfg_mutex);
39 
40 static DEFINE_SPINLOCK(xfrm_policy_sk_bundle_lock);
41 static struct dst_entry *xfrm_policy_sk_bundles;
42 static DEFINE_RWLOCK(xfrm_policy_lock);
43 
44 static DEFINE_RWLOCK(xfrm_policy_afinfo_lock);
45 static struct xfrm_policy_afinfo *xfrm_policy_afinfo[NPROTO];
46 
47 static struct kmem_cache *xfrm_dst_cache __read_mostly;
48 
49 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family);
50 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo);
51 static void xfrm_init_pmtu(struct dst_entry *dst);
52 static int stale_bundle(struct dst_entry *dst);
53 static int xfrm_bundle_ok(struct xfrm_dst *xdst, int family);
54 
55 
56 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
57 						int dir);
58 
59 static inline int
__xfrm4_selector_match(const struct xfrm_selector * sel,const struct flowi * fl)60 __xfrm4_selector_match(const struct xfrm_selector *sel, const struct flowi *fl)
61 {
62 	const struct flowi4 *fl4 = &fl->u.ip4;
63 
64 	return  addr_match(&fl4->daddr, &sel->daddr, sel->prefixlen_d) &&
65 		addr_match(&fl4->saddr, &sel->saddr, sel->prefixlen_s) &&
66 		!((xfrm_flowi_dport(fl, &fl4->uli) ^ sel->dport) & sel->dport_mask) &&
67 		!((xfrm_flowi_sport(fl, &fl4->uli) ^ sel->sport) & sel->sport_mask) &&
68 		(fl4->flowi4_proto == sel->proto || !sel->proto) &&
69 		(fl4->flowi4_oif == sel->ifindex || !sel->ifindex);
70 }
71 
72 static inline int
__xfrm6_selector_match(const struct xfrm_selector * sel,const struct flowi * fl)73 __xfrm6_selector_match(const struct xfrm_selector *sel, const struct flowi *fl)
74 {
75 	const struct flowi6 *fl6 = &fl->u.ip6;
76 
77 	return  addr_match(&fl6->daddr, &sel->daddr, sel->prefixlen_d) &&
78 		addr_match(&fl6->saddr, &sel->saddr, sel->prefixlen_s) &&
79 		!((xfrm_flowi_dport(fl, &fl6->uli) ^ sel->dport) & sel->dport_mask) &&
80 		!((xfrm_flowi_sport(fl, &fl6->uli) ^ sel->sport) & sel->sport_mask) &&
81 		(fl6->flowi6_proto == sel->proto || !sel->proto) &&
82 		(fl6->flowi6_oif == sel->ifindex || !sel->ifindex);
83 }
84 
xfrm_selector_match(const struct xfrm_selector * sel,const struct flowi * fl,unsigned short family)85 int xfrm_selector_match(const struct xfrm_selector *sel, const struct flowi *fl,
86 			unsigned short family)
87 {
88 	switch (family) {
89 	case AF_INET:
90 		return __xfrm4_selector_match(sel, fl);
91 	case AF_INET6:
92 		return __xfrm6_selector_match(sel, fl);
93 	}
94 	return 0;
95 }
96 
__xfrm_dst_lookup(struct net * net,int tos,const xfrm_address_t * saddr,const xfrm_address_t * daddr,int family)97 static inline struct dst_entry *__xfrm_dst_lookup(struct net *net, int tos,
98 						  const xfrm_address_t *saddr,
99 						  const xfrm_address_t *daddr,
100 						  int family)
101 {
102 	struct xfrm_policy_afinfo *afinfo;
103 	struct dst_entry *dst;
104 
105 	afinfo = xfrm_policy_get_afinfo(family);
106 	if (unlikely(afinfo == NULL))
107 		return ERR_PTR(-EAFNOSUPPORT);
108 
109 	dst = afinfo->dst_lookup(net, tos, saddr, daddr);
110 
111 	xfrm_policy_put_afinfo(afinfo);
112 
113 	return dst;
114 }
115 
xfrm_dst_lookup(struct xfrm_state * x,int tos,xfrm_address_t * prev_saddr,xfrm_address_t * prev_daddr,int family)116 static inline struct dst_entry *xfrm_dst_lookup(struct xfrm_state *x, int tos,
117 						xfrm_address_t *prev_saddr,
118 						xfrm_address_t *prev_daddr,
119 						int family)
120 {
121 	struct net *net = xs_net(x);
122 	xfrm_address_t *saddr = &x->props.saddr;
123 	xfrm_address_t *daddr = &x->id.daddr;
124 	struct dst_entry *dst;
125 
126 	if (x->type->flags & XFRM_TYPE_LOCAL_COADDR) {
127 		saddr = x->coaddr;
128 		daddr = prev_daddr;
129 	}
130 	if (x->type->flags & XFRM_TYPE_REMOTE_COADDR) {
131 		saddr = prev_saddr;
132 		daddr = x->coaddr;
133 	}
134 
135 	dst = __xfrm_dst_lookup(net, tos, saddr, daddr, family);
136 
137 	if (!IS_ERR(dst)) {
138 		if (prev_saddr != saddr)
139 			memcpy(prev_saddr, saddr,  sizeof(*prev_saddr));
140 		if (prev_daddr != daddr)
141 			memcpy(prev_daddr, daddr,  sizeof(*prev_daddr));
142 	}
143 
144 	return dst;
145 }
146 
make_jiffies(long secs)147 static inline unsigned long make_jiffies(long secs)
148 {
149 	if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
150 		return MAX_SCHEDULE_TIMEOUT-1;
151 	else
152 		return secs*HZ;
153 }
154 
xfrm_policy_timer(unsigned long data)155 static void xfrm_policy_timer(unsigned long data)
156 {
157 	struct xfrm_policy *xp = (struct xfrm_policy*)data;
158 	unsigned long now = get_seconds();
159 	long next = LONG_MAX;
160 	int warn = 0;
161 	int dir;
162 
163 	read_lock(&xp->lock);
164 
165 	if (unlikely(xp->walk.dead))
166 		goto out;
167 
168 	dir = xfrm_policy_id2dir(xp->index);
169 
170 	if (xp->lft.hard_add_expires_seconds) {
171 		long tmo = xp->lft.hard_add_expires_seconds +
172 			xp->curlft.add_time - now;
173 		if (tmo <= 0)
174 			goto expired;
175 		if (tmo < next)
176 			next = tmo;
177 	}
178 	if (xp->lft.hard_use_expires_seconds) {
179 		long tmo = xp->lft.hard_use_expires_seconds +
180 			(xp->curlft.use_time ? : xp->curlft.add_time) - now;
181 		if (tmo <= 0)
182 			goto expired;
183 		if (tmo < next)
184 			next = tmo;
185 	}
186 	if (xp->lft.soft_add_expires_seconds) {
187 		long tmo = xp->lft.soft_add_expires_seconds +
188 			xp->curlft.add_time - now;
189 		if (tmo <= 0) {
190 			warn = 1;
191 			tmo = XFRM_KM_TIMEOUT;
192 		}
193 		if (tmo < next)
194 			next = tmo;
195 	}
196 	if (xp->lft.soft_use_expires_seconds) {
197 		long tmo = xp->lft.soft_use_expires_seconds +
198 			(xp->curlft.use_time ? : xp->curlft.add_time) - now;
199 		if (tmo <= 0) {
200 			warn = 1;
201 			tmo = XFRM_KM_TIMEOUT;
202 		}
203 		if (tmo < next)
204 			next = tmo;
205 	}
206 
207 	if (warn)
208 		km_policy_expired(xp, dir, 0, 0);
209 	if (next != LONG_MAX &&
210 	    !mod_timer(&xp->timer, jiffies + make_jiffies(next)))
211 		xfrm_pol_hold(xp);
212 
213 out:
214 	read_unlock(&xp->lock);
215 	xfrm_pol_put(xp);
216 	return;
217 
218 expired:
219 	read_unlock(&xp->lock);
220 	if (!xfrm_policy_delete(xp, dir))
221 		km_policy_expired(xp, dir, 1, 0);
222 	xfrm_pol_put(xp);
223 }
224 
xfrm_policy_flo_get(struct flow_cache_object * flo)225 static struct flow_cache_object *xfrm_policy_flo_get(struct flow_cache_object *flo)
226 {
227 	struct xfrm_policy *pol = container_of(flo, struct xfrm_policy, flo);
228 
229 	if (unlikely(pol->walk.dead))
230 		flo = NULL;
231 	else
232 		xfrm_pol_hold(pol);
233 
234 	return flo;
235 }
236 
xfrm_policy_flo_check(struct flow_cache_object * flo)237 static int xfrm_policy_flo_check(struct flow_cache_object *flo)
238 {
239 	struct xfrm_policy *pol = container_of(flo, struct xfrm_policy, flo);
240 
241 	return !pol->walk.dead;
242 }
243 
xfrm_policy_flo_delete(struct flow_cache_object * flo)244 static void xfrm_policy_flo_delete(struct flow_cache_object *flo)
245 {
246 	xfrm_pol_put(container_of(flo, struct xfrm_policy, flo));
247 }
248 
249 static const struct flow_cache_ops xfrm_policy_fc_ops = {
250 	.get = xfrm_policy_flo_get,
251 	.check = xfrm_policy_flo_check,
252 	.delete = xfrm_policy_flo_delete,
253 };
254 
255 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
256  * SPD calls.
257  */
258 
xfrm_policy_alloc(struct net * net,gfp_t gfp)259 struct xfrm_policy *xfrm_policy_alloc(struct net *net, gfp_t gfp)
260 {
261 	struct xfrm_policy *policy;
262 
263 	policy = kzalloc(sizeof(struct xfrm_policy), gfp);
264 
265 	if (policy) {
266 		write_pnet(&policy->xp_net, net);
267 		INIT_LIST_HEAD(&policy->walk.all);
268 		INIT_HLIST_NODE(&policy->bydst);
269 		INIT_HLIST_NODE(&policy->byidx);
270 		rwlock_init(&policy->lock);
271 		atomic_set(&policy->refcnt, 1);
272 		setup_timer(&policy->timer, xfrm_policy_timer,
273 				(unsigned long)policy);
274 		policy->flo.ops = &xfrm_policy_fc_ops;
275 	}
276 	return policy;
277 }
278 EXPORT_SYMBOL(xfrm_policy_alloc);
279 
280 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
281 
xfrm_policy_destroy(struct xfrm_policy * policy)282 void xfrm_policy_destroy(struct xfrm_policy *policy)
283 {
284 	BUG_ON(!policy->walk.dead);
285 
286 	if (del_timer(&policy->timer))
287 		BUG();
288 
289 	security_xfrm_policy_free(policy->security);
290 	kfree(policy);
291 }
292 EXPORT_SYMBOL(xfrm_policy_destroy);
293 
294 /* Rule must be locked. Release descentant resources, announce
295  * entry dead. The rule must be unlinked from lists to the moment.
296  */
297 
xfrm_policy_kill(struct xfrm_policy * policy)298 static void xfrm_policy_kill(struct xfrm_policy *policy)
299 {
300 	policy->walk.dead = 1;
301 
302 	atomic_inc(&policy->genid);
303 
304 	if (del_timer(&policy->timer))
305 		xfrm_pol_put(policy);
306 
307 	xfrm_pol_put(policy);
308 }
309 
310 static unsigned int xfrm_policy_hashmax __read_mostly = 1 * 1024 * 1024;
311 
idx_hash(struct net * net,u32 index)312 static inline unsigned int idx_hash(struct net *net, u32 index)
313 {
314 	return __idx_hash(index, net->xfrm.policy_idx_hmask);
315 }
316 
policy_hash_bysel(struct net * net,const struct xfrm_selector * sel,unsigned short family,int dir)317 static struct hlist_head *policy_hash_bysel(struct net *net,
318 					    const struct xfrm_selector *sel,
319 					    unsigned short family, int dir)
320 {
321 	unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
322 	unsigned int hash = __sel_hash(sel, family, hmask);
323 
324 	return (hash == hmask + 1 ?
325 		&net->xfrm.policy_inexact[dir] :
326 		net->xfrm.policy_bydst[dir].table + hash);
327 }
328 
policy_hash_direct(struct net * net,const xfrm_address_t * daddr,const xfrm_address_t * saddr,unsigned short family,int dir)329 static struct hlist_head *policy_hash_direct(struct net *net,
330 					     const xfrm_address_t *daddr,
331 					     const xfrm_address_t *saddr,
332 					     unsigned short family, int dir)
333 {
334 	unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
335 	unsigned int hash = __addr_hash(daddr, saddr, family, hmask);
336 
337 	return net->xfrm.policy_bydst[dir].table + hash;
338 }
339 
xfrm_dst_hash_transfer(struct hlist_head * list,struct hlist_head * ndsttable,unsigned int nhashmask)340 static void xfrm_dst_hash_transfer(struct hlist_head *list,
341 				   struct hlist_head *ndsttable,
342 				   unsigned int nhashmask)
343 {
344 	struct hlist_node *entry, *tmp, *entry0 = NULL;
345 	struct xfrm_policy *pol;
346 	unsigned int h0 = 0;
347 
348 redo:
349 	hlist_for_each_entry_safe(pol, entry, tmp, list, bydst) {
350 		unsigned int h;
351 
352 		h = __addr_hash(&pol->selector.daddr, &pol->selector.saddr,
353 				pol->family, nhashmask);
354 		if (!entry0) {
355 			hlist_del(entry);
356 			hlist_add_head(&pol->bydst, ndsttable+h);
357 			h0 = h;
358 		} else {
359 			if (h != h0)
360 				continue;
361 			hlist_del(entry);
362 			hlist_add_after(entry0, &pol->bydst);
363 		}
364 		entry0 = entry;
365 	}
366 	if (!hlist_empty(list)) {
367 		entry0 = NULL;
368 		goto redo;
369 	}
370 }
371 
xfrm_idx_hash_transfer(struct hlist_head * list,struct hlist_head * nidxtable,unsigned int nhashmask)372 static void xfrm_idx_hash_transfer(struct hlist_head *list,
373 				   struct hlist_head *nidxtable,
374 				   unsigned int nhashmask)
375 {
376 	struct hlist_node *entry, *tmp;
377 	struct xfrm_policy *pol;
378 
379 	hlist_for_each_entry_safe(pol, entry, tmp, list, byidx) {
380 		unsigned int h;
381 
382 		h = __idx_hash(pol->index, nhashmask);
383 		hlist_add_head(&pol->byidx, nidxtable+h);
384 	}
385 }
386 
xfrm_new_hash_mask(unsigned int old_hmask)387 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask)
388 {
389 	return ((old_hmask + 1) << 1) - 1;
390 }
391 
xfrm_bydst_resize(struct net * net,int dir)392 static void xfrm_bydst_resize(struct net *net, int dir)
393 {
394 	unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
395 	unsigned int nhashmask = xfrm_new_hash_mask(hmask);
396 	unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
397 	struct hlist_head *odst = net->xfrm.policy_bydst[dir].table;
398 	struct hlist_head *ndst = xfrm_hash_alloc(nsize);
399 	int i;
400 
401 	if (!ndst)
402 		return;
403 
404 	write_lock_bh(&xfrm_policy_lock);
405 
406 	for (i = hmask; i >= 0; i--)
407 		xfrm_dst_hash_transfer(odst + i, ndst, nhashmask);
408 
409 	net->xfrm.policy_bydst[dir].table = ndst;
410 	net->xfrm.policy_bydst[dir].hmask = nhashmask;
411 
412 	write_unlock_bh(&xfrm_policy_lock);
413 
414 	xfrm_hash_free(odst, (hmask + 1) * sizeof(struct hlist_head));
415 }
416 
xfrm_byidx_resize(struct net * net,int total)417 static void xfrm_byidx_resize(struct net *net, int total)
418 {
419 	unsigned int hmask = net->xfrm.policy_idx_hmask;
420 	unsigned int nhashmask = xfrm_new_hash_mask(hmask);
421 	unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
422 	struct hlist_head *oidx = net->xfrm.policy_byidx;
423 	struct hlist_head *nidx = xfrm_hash_alloc(nsize);
424 	int i;
425 
426 	if (!nidx)
427 		return;
428 
429 	write_lock_bh(&xfrm_policy_lock);
430 
431 	for (i = hmask; i >= 0; i--)
432 		xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask);
433 
434 	net->xfrm.policy_byidx = nidx;
435 	net->xfrm.policy_idx_hmask = nhashmask;
436 
437 	write_unlock_bh(&xfrm_policy_lock);
438 
439 	xfrm_hash_free(oidx, (hmask + 1) * sizeof(struct hlist_head));
440 }
441 
xfrm_bydst_should_resize(struct net * net,int dir,int * total)442 static inline int xfrm_bydst_should_resize(struct net *net, int dir, int *total)
443 {
444 	unsigned int cnt = net->xfrm.policy_count[dir];
445 	unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
446 
447 	if (total)
448 		*total += cnt;
449 
450 	if ((hmask + 1) < xfrm_policy_hashmax &&
451 	    cnt > hmask)
452 		return 1;
453 
454 	return 0;
455 }
456 
xfrm_byidx_should_resize(struct net * net,int total)457 static inline int xfrm_byidx_should_resize(struct net *net, int total)
458 {
459 	unsigned int hmask = net->xfrm.policy_idx_hmask;
460 
461 	if ((hmask + 1) < xfrm_policy_hashmax &&
462 	    total > hmask)
463 		return 1;
464 
465 	return 0;
466 }
467 
xfrm_spd_getinfo(struct net * net,struct xfrmk_spdinfo * si)468 void xfrm_spd_getinfo(struct net *net, struct xfrmk_spdinfo *si)
469 {
470 	read_lock_bh(&xfrm_policy_lock);
471 	si->incnt = net->xfrm.policy_count[XFRM_POLICY_IN];
472 	si->outcnt = net->xfrm.policy_count[XFRM_POLICY_OUT];
473 	si->fwdcnt = net->xfrm.policy_count[XFRM_POLICY_FWD];
474 	si->inscnt = net->xfrm.policy_count[XFRM_POLICY_IN+XFRM_POLICY_MAX];
475 	si->outscnt = net->xfrm.policy_count[XFRM_POLICY_OUT+XFRM_POLICY_MAX];
476 	si->fwdscnt = net->xfrm.policy_count[XFRM_POLICY_FWD+XFRM_POLICY_MAX];
477 	si->spdhcnt = net->xfrm.policy_idx_hmask;
478 	si->spdhmcnt = xfrm_policy_hashmax;
479 	read_unlock_bh(&xfrm_policy_lock);
480 }
481 EXPORT_SYMBOL(xfrm_spd_getinfo);
482 
483 static DEFINE_MUTEX(hash_resize_mutex);
xfrm_hash_resize(struct work_struct * work)484 static void xfrm_hash_resize(struct work_struct *work)
485 {
486 	struct net *net = container_of(work, struct net, xfrm.policy_hash_work);
487 	int dir, total;
488 
489 	mutex_lock(&hash_resize_mutex);
490 
491 	total = 0;
492 	for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
493 		if (xfrm_bydst_should_resize(net, dir, &total))
494 			xfrm_bydst_resize(net, dir);
495 	}
496 	if (xfrm_byidx_should_resize(net, total))
497 		xfrm_byidx_resize(net, total);
498 
499 	mutex_unlock(&hash_resize_mutex);
500 }
501 
502 /* Generate new index... KAME seems to generate them ordered by cost
503  * of an absolute inpredictability of ordering of rules. This will not pass. */
xfrm_gen_index(struct net * net,int dir)504 static u32 xfrm_gen_index(struct net *net, int dir)
505 {
506 	static u32 idx_generator;
507 
508 	for (;;) {
509 		struct hlist_node *entry;
510 		struct hlist_head *list;
511 		struct xfrm_policy *p;
512 		u32 idx;
513 		int found;
514 
515 		idx = (idx_generator | dir);
516 		idx_generator += 8;
517 		if (idx == 0)
518 			idx = 8;
519 		list = net->xfrm.policy_byidx + idx_hash(net, idx);
520 		found = 0;
521 		hlist_for_each_entry(p, entry, list, byidx) {
522 			if (p->index == idx) {
523 				found = 1;
524 				break;
525 			}
526 		}
527 		if (!found)
528 			return idx;
529 	}
530 }
531 
selector_cmp(struct xfrm_selector * s1,struct xfrm_selector * s2)532 static inline int selector_cmp(struct xfrm_selector *s1, struct xfrm_selector *s2)
533 {
534 	u32 *p1 = (u32 *) s1;
535 	u32 *p2 = (u32 *) s2;
536 	int len = sizeof(struct xfrm_selector) / sizeof(u32);
537 	int i;
538 
539 	for (i = 0; i < len; i++) {
540 		if (p1[i] != p2[i])
541 			return 1;
542 	}
543 
544 	return 0;
545 }
546 
xfrm_policy_insert(int dir,struct xfrm_policy * policy,int excl)547 int xfrm_policy_insert(int dir, struct xfrm_policy *policy, int excl)
548 {
549 	struct net *net = xp_net(policy);
550 	struct xfrm_policy *pol;
551 	struct xfrm_policy *delpol;
552 	struct hlist_head *chain;
553 	struct hlist_node *entry, *newpos;
554 	u32 mark = policy->mark.v & policy->mark.m;
555 
556 	write_lock_bh(&xfrm_policy_lock);
557 	chain = policy_hash_bysel(net, &policy->selector, policy->family, dir);
558 	delpol = NULL;
559 	newpos = NULL;
560 	hlist_for_each_entry(pol, entry, chain, bydst) {
561 		if (pol->type == policy->type &&
562 		    !selector_cmp(&pol->selector, &policy->selector) &&
563 		    (mark & pol->mark.m) == pol->mark.v &&
564 		    xfrm_sec_ctx_match(pol->security, policy->security) &&
565 		    !WARN_ON(delpol)) {
566 			if (excl) {
567 				write_unlock_bh(&xfrm_policy_lock);
568 				return -EEXIST;
569 			}
570 			delpol = pol;
571 			if (policy->priority > pol->priority)
572 				continue;
573 		} else if (policy->priority >= pol->priority) {
574 			newpos = &pol->bydst;
575 			continue;
576 		}
577 		if (delpol)
578 			break;
579 	}
580 	if (newpos)
581 		hlist_add_after(newpos, &policy->bydst);
582 	else
583 		hlist_add_head(&policy->bydst, chain);
584 	xfrm_pol_hold(policy);
585 	net->xfrm.policy_count[dir]++;
586 	atomic_inc(&flow_cache_genid);
587 	if (delpol)
588 		__xfrm_policy_unlink(delpol, dir);
589 	policy->index = delpol ? delpol->index : xfrm_gen_index(net, dir);
590 	hlist_add_head(&policy->byidx, net->xfrm.policy_byidx+idx_hash(net, policy->index));
591 	policy->curlft.add_time = get_seconds();
592 	policy->curlft.use_time = 0;
593 	if (!mod_timer(&policy->timer, jiffies + HZ))
594 		xfrm_pol_hold(policy);
595 	list_add(&policy->walk.all, &net->xfrm.policy_all);
596 	write_unlock_bh(&xfrm_policy_lock);
597 
598 	if (delpol)
599 		xfrm_policy_kill(delpol);
600 	else if (xfrm_bydst_should_resize(net, dir, NULL))
601 		schedule_work(&net->xfrm.policy_hash_work);
602 
603 	return 0;
604 }
605 EXPORT_SYMBOL(xfrm_policy_insert);
606 
xfrm_policy_bysel_ctx(struct net * net,u32 mark,u8 type,int dir,struct xfrm_selector * sel,struct xfrm_sec_ctx * ctx,int delete,int * err)607 struct xfrm_policy *xfrm_policy_bysel_ctx(struct net *net, u32 mark, u8 type,
608 					  int dir, struct xfrm_selector *sel,
609 					  struct xfrm_sec_ctx *ctx, int delete,
610 					  int *err)
611 {
612 	struct xfrm_policy *pol, *ret;
613 	struct hlist_head *chain;
614 	struct hlist_node *entry;
615 
616 	*err = 0;
617 	write_lock_bh(&xfrm_policy_lock);
618 	chain = policy_hash_bysel(net, sel, sel->family, dir);
619 	ret = NULL;
620 	hlist_for_each_entry(pol, entry, chain, bydst) {
621 		if (pol->type == type &&
622 		    (mark & pol->mark.m) == pol->mark.v &&
623 		    !selector_cmp(sel, &pol->selector) &&
624 		    xfrm_sec_ctx_match(ctx, pol->security)) {
625 			xfrm_pol_hold(pol);
626 			if (delete) {
627 				*err = security_xfrm_policy_delete(
628 								pol->security);
629 				if (*err) {
630 					write_unlock_bh(&xfrm_policy_lock);
631 					return pol;
632 				}
633 				__xfrm_policy_unlink(pol, dir);
634 			}
635 			ret = pol;
636 			break;
637 		}
638 	}
639 	write_unlock_bh(&xfrm_policy_lock);
640 
641 	if (ret && delete)
642 		xfrm_policy_kill(ret);
643 	return ret;
644 }
645 EXPORT_SYMBOL(xfrm_policy_bysel_ctx);
646 
xfrm_policy_byid(struct net * net,u32 mark,u8 type,int dir,u32 id,int delete,int * err)647 struct xfrm_policy *xfrm_policy_byid(struct net *net, u32 mark, u8 type,
648 				     int dir, u32 id, int delete, int *err)
649 {
650 	struct xfrm_policy *pol, *ret;
651 	struct hlist_head *chain;
652 	struct hlist_node *entry;
653 
654 	*err = -ENOENT;
655 	if (xfrm_policy_id2dir(id) != dir)
656 		return NULL;
657 
658 	*err = 0;
659 	write_lock_bh(&xfrm_policy_lock);
660 	chain = net->xfrm.policy_byidx + idx_hash(net, id);
661 	ret = NULL;
662 	hlist_for_each_entry(pol, entry, chain, byidx) {
663 		if (pol->type == type && pol->index == id &&
664 		    (mark & pol->mark.m) == pol->mark.v) {
665 			xfrm_pol_hold(pol);
666 			if (delete) {
667 				*err = security_xfrm_policy_delete(
668 								pol->security);
669 				if (*err) {
670 					write_unlock_bh(&xfrm_policy_lock);
671 					return pol;
672 				}
673 				__xfrm_policy_unlink(pol, dir);
674 			}
675 			ret = pol;
676 			break;
677 		}
678 	}
679 	write_unlock_bh(&xfrm_policy_lock);
680 
681 	if (ret && delete)
682 		xfrm_policy_kill(ret);
683 	return ret;
684 }
685 EXPORT_SYMBOL(xfrm_policy_byid);
686 
687 #ifdef CONFIG_SECURITY_NETWORK_XFRM
688 static inline int
xfrm_policy_flush_secctx_check(struct net * net,u8 type,struct xfrm_audit * audit_info)689 xfrm_policy_flush_secctx_check(struct net *net, u8 type, struct xfrm_audit *audit_info)
690 {
691 	int dir, err = 0;
692 
693 	for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
694 		struct xfrm_policy *pol;
695 		struct hlist_node *entry;
696 		int i;
697 
698 		hlist_for_each_entry(pol, entry,
699 				     &net->xfrm.policy_inexact[dir], bydst) {
700 			if (pol->type != type)
701 				continue;
702 			err = security_xfrm_policy_delete(pol->security);
703 			if (err) {
704 				xfrm_audit_policy_delete(pol, 0,
705 							 audit_info->loginuid,
706 							 audit_info->sessionid,
707 							 audit_info->secid);
708 				return err;
709 			}
710 		}
711 		for (i = net->xfrm.policy_bydst[dir].hmask; i >= 0; i--) {
712 			hlist_for_each_entry(pol, entry,
713 					     net->xfrm.policy_bydst[dir].table + i,
714 					     bydst) {
715 				if (pol->type != type)
716 					continue;
717 				err = security_xfrm_policy_delete(
718 								pol->security);
719 				if (err) {
720 					xfrm_audit_policy_delete(pol, 0,
721 							audit_info->loginuid,
722 							audit_info->sessionid,
723 							audit_info->secid);
724 					return err;
725 				}
726 			}
727 		}
728 	}
729 	return err;
730 }
731 #else
732 static inline int
xfrm_policy_flush_secctx_check(struct net * net,u8 type,struct xfrm_audit * audit_info)733 xfrm_policy_flush_secctx_check(struct net *net, u8 type, struct xfrm_audit *audit_info)
734 {
735 	return 0;
736 }
737 #endif
738 
xfrm_policy_flush(struct net * net,u8 type,struct xfrm_audit * audit_info)739 int xfrm_policy_flush(struct net *net, u8 type, struct xfrm_audit *audit_info)
740 {
741 	int dir, err = 0, cnt = 0;
742 
743 	write_lock_bh(&xfrm_policy_lock);
744 
745 	err = xfrm_policy_flush_secctx_check(net, type, audit_info);
746 	if (err)
747 		goto out;
748 
749 	for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
750 		struct xfrm_policy *pol;
751 		struct hlist_node *entry;
752 		int i;
753 
754 	again1:
755 		hlist_for_each_entry(pol, entry,
756 				     &net->xfrm.policy_inexact[dir], bydst) {
757 			if (pol->type != type)
758 				continue;
759 			__xfrm_policy_unlink(pol, dir);
760 			write_unlock_bh(&xfrm_policy_lock);
761 			cnt++;
762 
763 			xfrm_audit_policy_delete(pol, 1, audit_info->loginuid,
764 						 audit_info->sessionid,
765 						 audit_info->secid);
766 
767 			xfrm_policy_kill(pol);
768 
769 			write_lock_bh(&xfrm_policy_lock);
770 			goto again1;
771 		}
772 
773 		for (i = net->xfrm.policy_bydst[dir].hmask; i >= 0; i--) {
774 	again2:
775 			hlist_for_each_entry(pol, entry,
776 					     net->xfrm.policy_bydst[dir].table + i,
777 					     bydst) {
778 				if (pol->type != type)
779 					continue;
780 				__xfrm_policy_unlink(pol, dir);
781 				write_unlock_bh(&xfrm_policy_lock);
782 				cnt++;
783 
784 				xfrm_audit_policy_delete(pol, 1,
785 							 audit_info->loginuid,
786 							 audit_info->sessionid,
787 							 audit_info->secid);
788 				xfrm_policy_kill(pol);
789 
790 				write_lock_bh(&xfrm_policy_lock);
791 				goto again2;
792 			}
793 		}
794 
795 	}
796 	if (!cnt)
797 		err = -ESRCH;
798 out:
799 	write_unlock_bh(&xfrm_policy_lock);
800 	return err;
801 }
802 EXPORT_SYMBOL(xfrm_policy_flush);
803 
xfrm_policy_walk(struct net * net,struct xfrm_policy_walk * walk,int (* func)(struct xfrm_policy *,int,int,void *),void * data)804 int xfrm_policy_walk(struct net *net, struct xfrm_policy_walk *walk,
805 		     int (*func)(struct xfrm_policy *, int, int, void*),
806 		     void *data)
807 {
808 	struct xfrm_policy *pol;
809 	struct xfrm_policy_walk_entry *x;
810 	int error = 0;
811 
812 	if (walk->type >= XFRM_POLICY_TYPE_MAX &&
813 	    walk->type != XFRM_POLICY_TYPE_ANY)
814 		return -EINVAL;
815 
816 	if (list_empty(&walk->walk.all) && walk->seq != 0)
817 		return 0;
818 
819 	write_lock_bh(&xfrm_policy_lock);
820 	if (list_empty(&walk->walk.all))
821 		x = list_first_entry(&net->xfrm.policy_all, struct xfrm_policy_walk_entry, all);
822 	else
823 		x = list_entry(&walk->walk.all, struct xfrm_policy_walk_entry, all);
824 	list_for_each_entry_from(x, &net->xfrm.policy_all, all) {
825 		if (x->dead)
826 			continue;
827 		pol = container_of(x, struct xfrm_policy, walk);
828 		if (walk->type != XFRM_POLICY_TYPE_ANY &&
829 		    walk->type != pol->type)
830 			continue;
831 		error = func(pol, xfrm_policy_id2dir(pol->index),
832 			     walk->seq, data);
833 		if (error) {
834 			list_move_tail(&walk->walk.all, &x->all);
835 			goto out;
836 		}
837 		walk->seq++;
838 	}
839 	if (walk->seq == 0) {
840 		error = -ENOENT;
841 		goto out;
842 	}
843 	list_del_init(&walk->walk.all);
844 out:
845 	write_unlock_bh(&xfrm_policy_lock);
846 	return error;
847 }
848 EXPORT_SYMBOL(xfrm_policy_walk);
849 
xfrm_policy_walk_init(struct xfrm_policy_walk * walk,u8 type)850 void xfrm_policy_walk_init(struct xfrm_policy_walk *walk, u8 type)
851 {
852 	INIT_LIST_HEAD(&walk->walk.all);
853 	walk->walk.dead = 1;
854 	walk->type = type;
855 	walk->seq = 0;
856 }
857 EXPORT_SYMBOL(xfrm_policy_walk_init);
858 
xfrm_policy_walk_done(struct xfrm_policy_walk * walk)859 void xfrm_policy_walk_done(struct xfrm_policy_walk *walk)
860 {
861 	if (list_empty(&walk->walk.all))
862 		return;
863 
864 	write_lock_bh(&xfrm_policy_lock);
865 	list_del(&walk->walk.all);
866 	write_unlock_bh(&xfrm_policy_lock);
867 }
868 EXPORT_SYMBOL(xfrm_policy_walk_done);
869 
870 /*
871  * Find policy to apply to this flow.
872  *
873  * Returns 0 if policy found, else an -errno.
874  */
xfrm_policy_match(const struct xfrm_policy * pol,const struct flowi * fl,u8 type,u16 family,int dir)875 static int xfrm_policy_match(const struct xfrm_policy *pol,
876 			     const struct flowi *fl,
877 			     u8 type, u16 family, int dir)
878 {
879 	const struct xfrm_selector *sel = &pol->selector;
880 	int match, ret = -ESRCH;
881 
882 	if (pol->family != family ||
883 	    (fl->flowi_mark & pol->mark.m) != pol->mark.v ||
884 	    pol->type != type)
885 		return ret;
886 
887 	match = xfrm_selector_match(sel, fl, family);
888 	if (match)
889 		ret = security_xfrm_policy_lookup(pol->security, fl->flowi_secid,
890 						  dir);
891 
892 	return ret;
893 }
894 
xfrm_policy_lookup_bytype(struct net * net,u8 type,const struct flowi * fl,u16 family,u8 dir)895 static struct xfrm_policy *xfrm_policy_lookup_bytype(struct net *net, u8 type,
896 						     const struct flowi *fl,
897 						     u16 family, u8 dir)
898 {
899 	int err;
900 	struct xfrm_policy *pol, *ret;
901 	const xfrm_address_t *daddr, *saddr;
902 	struct hlist_node *entry;
903 	struct hlist_head *chain;
904 	u32 priority = ~0U;
905 
906 	daddr = xfrm_flowi_daddr(fl, family);
907 	saddr = xfrm_flowi_saddr(fl, family);
908 	if (unlikely(!daddr || !saddr))
909 		return NULL;
910 
911 	read_lock_bh(&xfrm_policy_lock);
912 	chain = policy_hash_direct(net, daddr, saddr, family, dir);
913 	ret = NULL;
914 	hlist_for_each_entry(pol, entry, chain, bydst) {
915 		err = xfrm_policy_match(pol, fl, type, family, dir);
916 		if (err) {
917 			if (err == -ESRCH)
918 				continue;
919 			else {
920 				ret = ERR_PTR(err);
921 				goto fail;
922 			}
923 		} else {
924 			ret = pol;
925 			priority = ret->priority;
926 			break;
927 		}
928 	}
929 	chain = &net->xfrm.policy_inexact[dir];
930 	hlist_for_each_entry(pol, entry, chain, bydst) {
931 		err = xfrm_policy_match(pol, fl, type, family, dir);
932 		if (err) {
933 			if (err == -ESRCH)
934 				continue;
935 			else {
936 				ret = ERR_PTR(err);
937 				goto fail;
938 			}
939 		} else if (pol->priority < priority) {
940 			ret = pol;
941 			break;
942 		}
943 	}
944 	if (ret)
945 		xfrm_pol_hold(ret);
946 fail:
947 	read_unlock_bh(&xfrm_policy_lock);
948 
949 	return ret;
950 }
951 
952 static struct xfrm_policy *
__xfrm_policy_lookup(struct net * net,const struct flowi * fl,u16 family,u8 dir)953 __xfrm_policy_lookup(struct net *net, const struct flowi *fl, u16 family, u8 dir)
954 {
955 #ifdef CONFIG_XFRM_SUB_POLICY
956 	struct xfrm_policy *pol;
957 
958 	pol = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_SUB, fl, family, dir);
959 	if (pol != NULL)
960 		return pol;
961 #endif
962 	return xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN, fl, family, dir);
963 }
964 
965 static struct flow_cache_object *
xfrm_policy_lookup(struct net * net,const struct flowi * fl,u16 family,u8 dir,struct flow_cache_object * old_obj,void * ctx)966 xfrm_policy_lookup(struct net *net, const struct flowi *fl, u16 family,
967 		   u8 dir, struct flow_cache_object *old_obj, void *ctx)
968 {
969 	struct xfrm_policy *pol;
970 
971 	if (old_obj)
972 		xfrm_pol_put(container_of(old_obj, struct xfrm_policy, flo));
973 
974 	pol = __xfrm_policy_lookup(net, fl, family, dir);
975 	if (IS_ERR_OR_NULL(pol))
976 		return ERR_CAST(pol);
977 
978 	/* Resolver returns two references:
979 	 * one for cache and one for caller of flow_cache_lookup() */
980 	xfrm_pol_hold(pol);
981 
982 	return &pol->flo;
983 }
984 
policy_to_flow_dir(int dir)985 static inline int policy_to_flow_dir(int dir)
986 {
987 	if (XFRM_POLICY_IN == FLOW_DIR_IN &&
988 	    XFRM_POLICY_OUT == FLOW_DIR_OUT &&
989 	    XFRM_POLICY_FWD == FLOW_DIR_FWD)
990 		return dir;
991 	switch (dir) {
992 	default:
993 	case XFRM_POLICY_IN:
994 		return FLOW_DIR_IN;
995 	case XFRM_POLICY_OUT:
996 		return FLOW_DIR_OUT;
997 	case XFRM_POLICY_FWD:
998 		return FLOW_DIR_FWD;
999 	}
1000 }
1001 
xfrm_sk_policy_lookup(struct sock * sk,int dir,const struct flowi * fl)1002 static struct xfrm_policy *xfrm_sk_policy_lookup(struct sock *sk, int dir,
1003 						 const struct flowi *fl)
1004 {
1005 	struct xfrm_policy *pol;
1006 
1007 	read_lock_bh(&xfrm_policy_lock);
1008 	if ((pol = sk->sk_policy[dir]) != NULL) {
1009 		int match = xfrm_selector_match(&pol->selector, fl,
1010 						sk->sk_family);
1011 		int err = 0;
1012 
1013 		if (match) {
1014 			if ((sk->sk_mark & pol->mark.m) != pol->mark.v) {
1015 				pol = NULL;
1016 				goto out;
1017 			}
1018 			err = security_xfrm_policy_lookup(pol->security,
1019 						      fl->flowi_secid,
1020 						      policy_to_flow_dir(dir));
1021 			if (!err)
1022 				xfrm_pol_hold(pol);
1023 			else if (err == -ESRCH)
1024 				pol = NULL;
1025 			else
1026 				pol = ERR_PTR(err);
1027 		} else
1028 			pol = NULL;
1029 	}
1030 out:
1031 	read_unlock_bh(&xfrm_policy_lock);
1032 	return pol;
1033 }
1034 
__xfrm_policy_link(struct xfrm_policy * pol,int dir)1035 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir)
1036 {
1037 	struct net *net = xp_net(pol);
1038 	struct hlist_head *chain = policy_hash_bysel(net, &pol->selector,
1039 						     pol->family, dir);
1040 
1041 	list_add(&pol->walk.all, &net->xfrm.policy_all);
1042 	hlist_add_head(&pol->bydst, chain);
1043 	hlist_add_head(&pol->byidx, net->xfrm.policy_byidx+idx_hash(net, pol->index));
1044 	net->xfrm.policy_count[dir]++;
1045 	xfrm_pol_hold(pol);
1046 
1047 	if (xfrm_bydst_should_resize(net, dir, NULL))
1048 		schedule_work(&net->xfrm.policy_hash_work);
1049 }
1050 
__xfrm_policy_unlink(struct xfrm_policy * pol,int dir)1051 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
1052 						int dir)
1053 {
1054 	struct net *net = xp_net(pol);
1055 
1056 	if (hlist_unhashed(&pol->bydst))
1057 		return NULL;
1058 
1059 	hlist_del(&pol->bydst);
1060 	hlist_del(&pol->byidx);
1061 	list_del(&pol->walk.all);
1062 	net->xfrm.policy_count[dir]--;
1063 
1064 	return pol;
1065 }
1066 
xfrm_policy_delete(struct xfrm_policy * pol,int dir)1067 int xfrm_policy_delete(struct xfrm_policy *pol, int dir)
1068 {
1069 	write_lock_bh(&xfrm_policy_lock);
1070 	pol = __xfrm_policy_unlink(pol, dir);
1071 	write_unlock_bh(&xfrm_policy_lock);
1072 	if (pol) {
1073 		xfrm_policy_kill(pol);
1074 		return 0;
1075 	}
1076 	return -ENOENT;
1077 }
1078 EXPORT_SYMBOL(xfrm_policy_delete);
1079 
xfrm_sk_policy_insert(struct sock * sk,int dir,struct xfrm_policy * pol)1080 int xfrm_sk_policy_insert(struct sock *sk, int dir, struct xfrm_policy *pol)
1081 {
1082 	struct net *net = xp_net(pol);
1083 	struct xfrm_policy *old_pol;
1084 
1085 #ifdef CONFIG_XFRM_SUB_POLICY
1086 	if (pol && pol->type != XFRM_POLICY_TYPE_MAIN)
1087 		return -EINVAL;
1088 #endif
1089 
1090 	write_lock_bh(&xfrm_policy_lock);
1091 	old_pol = sk->sk_policy[dir];
1092 	sk->sk_policy[dir] = pol;
1093 	if (pol) {
1094 		pol->curlft.add_time = get_seconds();
1095 		pol->index = xfrm_gen_index(net, XFRM_POLICY_MAX+dir);
1096 		__xfrm_policy_link(pol, XFRM_POLICY_MAX+dir);
1097 	}
1098 	if (old_pol)
1099 		/* Unlinking succeeds always. This is the only function
1100 		 * allowed to delete or replace socket policy.
1101 		 */
1102 		__xfrm_policy_unlink(old_pol, XFRM_POLICY_MAX+dir);
1103 	write_unlock_bh(&xfrm_policy_lock);
1104 
1105 	if (old_pol) {
1106 		xfrm_policy_kill(old_pol);
1107 	}
1108 	return 0;
1109 }
1110 
clone_policy(const struct xfrm_policy * old,int dir)1111 static struct xfrm_policy *clone_policy(const struct xfrm_policy *old, int dir)
1112 {
1113 	struct xfrm_policy *newp = xfrm_policy_alloc(xp_net(old), GFP_ATOMIC);
1114 
1115 	if (newp) {
1116 		newp->selector = old->selector;
1117 		if (security_xfrm_policy_clone(old->security,
1118 					       &newp->security)) {
1119 			kfree(newp);
1120 			return NULL;  /* ENOMEM */
1121 		}
1122 		newp->lft = old->lft;
1123 		newp->curlft = old->curlft;
1124 		newp->mark = old->mark;
1125 		newp->action = old->action;
1126 		newp->flags = old->flags;
1127 		newp->xfrm_nr = old->xfrm_nr;
1128 		newp->index = old->index;
1129 		newp->type = old->type;
1130 		memcpy(newp->xfrm_vec, old->xfrm_vec,
1131 		       newp->xfrm_nr*sizeof(struct xfrm_tmpl));
1132 		write_lock_bh(&xfrm_policy_lock);
1133 		__xfrm_policy_link(newp, XFRM_POLICY_MAX+dir);
1134 		write_unlock_bh(&xfrm_policy_lock);
1135 		xfrm_pol_put(newp);
1136 	}
1137 	return newp;
1138 }
1139 
__xfrm_sk_clone_policy(struct sock * sk)1140 int __xfrm_sk_clone_policy(struct sock *sk)
1141 {
1142 	struct xfrm_policy *p0 = sk->sk_policy[0],
1143 			   *p1 = sk->sk_policy[1];
1144 
1145 	sk->sk_policy[0] = sk->sk_policy[1] = NULL;
1146 	if (p0 && (sk->sk_policy[0] = clone_policy(p0, 0)) == NULL)
1147 		return -ENOMEM;
1148 	if (p1 && (sk->sk_policy[1] = clone_policy(p1, 1)) == NULL)
1149 		return -ENOMEM;
1150 	return 0;
1151 }
1152 
1153 static int
xfrm_get_saddr(struct net * net,xfrm_address_t * local,xfrm_address_t * remote,unsigned short family)1154 xfrm_get_saddr(struct net *net, xfrm_address_t *local, xfrm_address_t *remote,
1155 	       unsigned short family)
1156 {
1157 	int err;
1158 	struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1159 
1160 	if (unlikely(afinfo == NULL))
1161 		return -EINVAL;
1162 	err = afinfo->get_saddr(net, local, remote);
1163 	xfrm_policy_put_afinfo(afinfo);
1164 	return err;
1165 }
1166 
1167 /* Resolve list of templates for the flow, given policy. */
1168 
1169 static int
xfrm_tmpl_resolve_one(struct xfrm_policy * policy,const struct flowi * fl,struct xfrm_state ** xfrm,unsigned short family)1170 xfrm_tmpl_resolve_one(struct xfrm_policy *policy, const struct flowi *fl,
1171 		      struct xfrm_state **xfrm, unsigned short family)
1172 {
1173 	struct net *net = xp_net(policy);
1174 	int nx;
1175 	int i, error;
1176 	xfrm_address_t *daddr = xfrm_flowi_daddr(fl, family);
1177 	xfrm_address_t *saddr = xfrm_flowi_saddr(fl, family);
1178 	xfrm_address_t tmp;
1179 
1180 	for (nx=0, i = 0; i < policy->xfrm_nr; i++) {
1181 		struct xfrm_state *x;
1182 		xfrm_address_t *remote = daddr;
1183 		xfrm_address_t *local  = saddr;
1184 		struct xfrm_tmpl *tmpl = &policy->xfrm_vec[i];
1185 
1186 		if (tmpl->mode == XFRM_MODE_TUNNEL ||
1187 		    tmpl->mode == XFRM_MODE_BEET) {
1188 			remote = &tmpl->id.daddr;
1189 			local = &tmpl->saddr;
1190 			if (xfrm_addr_any(local, tmpl->encap_family)) {
1191 				error = xfrm_get_saddr(net, &tmp, remote, tmpl->encap_family);
1192 				if (error)
1193 					goto fail;
1194 				local = &tmp;
1195 			}
1196 		}
1197 
1198 		x = xfrm_state_find(remote, local, fl, tmpl, policy, &error, family);
1199 
1200 		if (x && x->km.state == XFRM_STATE_VALID) {
1201 			xfrm[nx++] = x;
1202 			daddr = remote;
1203 			saddr = local;
1204 			continue;
1205 		}
1206 		if (x) {
1207 			error = (x->km.state == XFRM_STATE_ERROR ?
1208 				 -EINVAL : -EAGAIN);
1209 			xfrm_state_put(x);
1210 		}
1211 		else if (error == -ESRCH)
1212 			error = -EAGAIN;
1213 
1214 		if (!tmpl->optional)
1215 			goto fail;
1216 	}
1217 	return nx;
1218 
1219 fail:
1220 	for (nx--; nx>=0; nx--)
1221 		xfrm_state_put(xfrm[nx]);
1222 	return error;
1223 }
1224 
1225 static int
xfrm_tmpl_resolve(struct xfrm_policy ** pols,int npols,const struct flowi * fl,struct xfrm_state ** xfrm,unsigned short family)1226 xfrm_tmpl_resolve(struct xfrm_policy **pols, int npols, const struct flowi *fl,
1227 		  struct xfrm_state **xfrm, unsigned short family)
1228 {
1229 	struct xfrm_state *tp[XFRM_MAX_DEPTH];
1230 	struct xfrm_state **tpp = (npols > 1) ? tp : xfrm;
1231 	int cnx = 0;
1232 	int error;
1233 	int ret;
1234 	int i;
1235 
1236 	for (i = 0; i < npols; i++) {
1237 		if (cnx + pols[i]->xfrm_nr >= XFRM_MAX_DEPTH) {
1238 			error = -ENOBUFS;
1239 			goto fail;
1240 		}
1241 
1242 		ret = xfrm_tmpl_resolve_one(pols[i], fl, &tpp[cnx], family);
1243 		if (ret < 0) {
1244 			error = ret;
1245 			goto fail;
1246 		} else
1247 			cnx += ret;
1248 	}
1249 
1250 	/* found states are sorted for outbound processing */
1251 	if (npols > 1)
1252 		xfrm_state_sort(xfrm, tpp, cnx, family);
1253 
1254 	return cnx;
1255 
1256  fail:
1257 	for (cnx--; cnx>=0; cnx--)
1258 		xfrm_state_put(tpp[cnx]);
1259 	return error;
1260 
1261 }
1262 
1263 /* Check that the bundle accepts the flow and its components are
1264  * still valid.
1265  */
1266 
xfrm_get_tos(const struct flowi * fl,int family)1267 static inline int xfrm_get_tos(const struct flowi *fl, int family)
1268 {
1269 	struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1270 	int tos;
1271 
1272 	if (!afinfo)
1273 		return -EINVAL;
1274 
1275 	tos = afinfo->get_tos(fl);
1276 
1277 	xfrm_policy_put_afinfo(afinfo);
1278 
1279 	return tos;
1280 }
1281 
xfrm_bundle_flo_get(struct flow_cache_object * flo)1282 static struct flow_cache_object *xfrm_bundle_flo_get(struct flow_cache_object *flo)
1283 {
1284 	struct xfrm_dst *xdst = container_of(flo, struct xfrm_dst, flo);
1285 	struct dst_entry *dst = &xdst->u.dst;
1286 
1287 	if (xdst->route == NULL) {
1288 		/* Dummy bundle - if it has xfrms we were not
1289 		 * able to build bundle as template resolution failed.
1290 		 * It means we need to try again resolving. */
1291 		if (xdst->num_xfrms > 0)
1292 			return NULL;
1293 	} else {
1294 		/* Real bundle */
1295 		if (stale_bundle(dst))
1296 			return NULL;
1297 	}
1298 
1299 	dst_hold(dst);
1300 	return flo;
1301 }
1302 
xfrm_bundle_flo_check(struct flow_cache_object * flo)1303 static int xfrm_bundle_flo_check(struct flow_cache_object *flo)
1304 {
1305 	struct xfrm_dst *xdst = container_of(flo, struct xfrm_dst, flo);
1306 	struct dst_entry *dst = &xdst->u.dst;
1307 
1308 	if (!xdst->route)
1309 		return 0;
1310 	if (stale_bundle(dst))
1311 		return 0;
1312 
1313 	return 1;
1314 }
1315 
xfrm_bundle_flo_delete(struct flow_cache_object * flo)1316 static void xfrm_bundle_flo_delete(struct flow_cache_object *flo)
1317 {
1318 	struct xfrm_dst *xdst = container_of(flo, struct xfrm_dst, flo);
1319 	struct dst_entry *dst = &xdst->u.dst;
1320 
1321 	dst_free(dst);
1322 }
1323 
1324 static const struct flow_cache_ops xfrm_bundle_fc_ops = {
1325 	.get = xfrm_bundle_flo_get,
1326 	.check = xfrm_bundle_flo_check,
1327 	.delete = xfrm_bundle_flo_delete,
1328 };
1329 
xfrm_alloc_dst(struct net * net,int family)1330 static inline struct xfrm_dst *xfrm_alloc_dst(struct net *net, int family)
1331 {
1332 	struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1333 	struct dst_ops *dst_ops;
1334 	struct xfrm_dst *xdst;
1335 
1336 	if (!afinfo)
1337 		return ERR_PTR(-EINVAL);
1338 
1339 	switch (family) {
1340 	case AF_INET:
1341 		dst_ops = &net->xfrm.xfrm4_dst_ops;
1342 		break;
1343 #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
1344 	case AF_INET6:
1345 		dst_ops = &net->xfrm.xfrm6_dst_ops;
1346 		break;
1347 #endif
1348 	default:
1349 		BUG();
1350 	}
1351 	xdst = dst_alloc(dst_ops, 0);
1352 	xfrm_policy_put_afinfo(afinfo);
1353 
1354 	if (likely(xdst))
1355 		xdst->flo.ops = &xfrm_bundle_fc_ops;
1356 	else
1357 		xdst = ERR_PTR(-ENOBUFS);
1358 
1359 	return xdst;
1360 }
1361 
xfrm_init_path(struct xfrm_dst * path,struct dst_entry * dst,int nfheader_len)1362 static inline int xfrm_init_path(struct xfrm_dst *path, struct dst_entry *dst,
1363 				 int nfheader_len)
1364 {
1365 	struct xfrm_policy_afinfo *afinfo =
1366 		xfrm_policy_get_afinfo(dst->ops->family);
1367 	int err;
1368 
1369 	if (!afinfo)
1370 		return -EINVAL;
1371 
1372 	err = afinfo->init_path(path, dst, nfheader_len);
1373 
1374 	xfrm_policy_put_afinfo(afinfo);
1375 
1376 	return err;
1377 }
1378 
xfrm_fill_dst(struct xfrm_dst * xdst,struct net_device * dev,const struct flowi * fl)1379 static inline int xfrm_fill_dst(struct xfrm_dst *xdst, struct net_device *dev,
1380 				const struct flowi *fl)
1381 {
1382 	struct xfrm_policy_afinfo *afinfo =
1383 		xfrm_policy_get_afinfo(xdst->u.dst.ops->family);
1384 	int err;
1385 
1386 	if (!afinfo)
1387 		return -EINVAL;
1388 
1389 	err = afinfo->fill_dst(xdst, dev, fl);
1390 
1391 	xfrm_policy_put_afinfo(afinfo);
1392 
1393 	return err;
1394 }
1395 
1396 
1397 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
1398  * all the metrics... Shortly, bundle a bundle.
1399  */
1400 
xfrm_bundle_create(struct xfrm_policy * policy,struct xfrm_state ** xfrm,int nx,const struct flowi * fl,struct dst_entry * dst)1401 static struct dst_entry *xfrm_bundle_create(struct xfrm_policy *policy,
1402 					    struct xfrm_state **xfrm, int nx,
1403 					    const struct flowi *fl,
1404 					    struct dst_entry *dst)
1405 {
1406 	struct net *net = xp_net(policy);
1407 	unsigned long now = jiffies;
1408 	struct net_device *dev;
1409 	struct xfrm_mode *inner_mode;
1410 	struct dst_entry *dst_prev = NULL;
1411 	struct dst_entry *dst0 = NULL;
1412 	int i = 0;
1413 	int err;
1414 	int header_len = 0;
1415 	int nfheader_len = 0;
1416 	int trailer_len = 0;
1417 	int tos;
1418 	int family = policy->selector.family;
1419 	xfrm_address_t saddr, daddr;
1420 
1421 	xfrm_flowi_addr_get(fl, &saddr, &daddr, family);
1422 
1423 	tos = xfrm_get_tos(fl, family);
1424 	err = tos;
1425 	if (tos < 0)
1426 		goto put_states;
1427 
1428 	dst_hold(dst);
1429 
1430 	for (; i < nx; i++) {
1431 		struct xfrm_dst *xdst = xfrm_alloc_dst(net, family);
1432 		struct dst_entry *dst1 = &xdst->u.dst;
1433 
1434 		err = PTR_ERR(xdst);
1435 		if (IS_ERR(xdst)) {
1436 			dst_release(dst);
1437 			goto put_states;
1438 		}
1439 
1440 		if (xfrm[i]->sel.family == AF_UNSPEC) {
1441 			inner_mode = xfrm_ip2inner_mode(xfrm[i],
1442 							xfrm_af2proto(family));
1443 			if (!inner_mode) {
1444 				err = -EAFNOSUPPORT;
1445 				dst_release(dst);
1446 				goto put_states;
1447 			}
1448 		} else
1449 			inner_mode = xfrm[i]->inner_mode;
1450 
1451 		if (!dst_prev)
1452 			dst0 = dst1;
1453 		else {
1454 			dst_prev->child = dst_clone(dst1);
1455 			dst1->flags |= DST_NOHASH;
1456 		}
1457 
1458 		xdst->route = dst;
1459 		dst_copy_metrics(dst1, dst);
1460 
1461 		if (xfrm[i]->props.mode != XFRM_MODE_TRANSPORT) {
1462 			family = xfrm[i]->props.family;
1463 			dst = xfrm_dst_lookup(xfrm[i], tos, &saddr, &daddr,
1464 					      family);
1465 			err = PTR_ERR(dst);
1466 			if (IS_ERR(dst))
1467 				goto put_states;
1468 		} else
1469 			dst_hold(dst);
1470 
1471 		dst1->xfrm = xfrm[i];
1472 		xdst->xfrm_genid = xfrm[i]->genid;
1473 
1474 		dst1->obsolete = -1;
1475 		dst1->flags |= DST_HOST;
1476 		dst1->lastuse = now;
1477 
1478 		dst1->input = dst_discard;
1479 		dst1->output = inner_mode->afinfo->output;
1480 
1481 		dst1->next = dst_prev;
1482 		dst_prev = dst1;
1483 
1484 		header_len += xfrm[i]->props.header_len;
1485 		if (xfrm[i]->type->flags & XFRM_TYPE_NON_FRAGMENT)
1486 			nfheader_len += xfrm[i]->props.header_len;
1487 		trailer_len += xfrm[i]->props.trailer_len;
1488 	}
1489 
1490 	dst_prev->child = dst;
1491 	dst0->path = dst;
1492 
1493 	err = -ENODEV;
1494 	dev = dst->dev;
1495 	if (!dev)
1496 		goto free_dst;
1497 
1498 	/* Copy neighbour for reachability confirmation */
1499 	dst0->neighbour = neigh_clone(dst->neighbour);
1500 
1501 	xfrm_init_path((struct xfrm_dst *)dst0, dst, nfheader_len);
1502 	xfrm_init_pmtu(dst_prev);
1503 
1504 	for (dst_prev = dst0; dst_prev != dst; dst_prev = dst_prev->child) {
1505 		struct xfrm_dst *xdst = (struct xfrm_dst *)dst_prev;
1506 
1507 		err = xfrm_fill_dst(xdst, dev, fl);
1508 		if (err)
1509 			goto free_dst;
1510 
1511 		dst_prev->header_len = header_len;
1512 		dst_prev->trailer_len = trailer_len;
1513 		header_len -= xdst->u.dst.xfrm->props.header_len;
1514 		trailer_len -= xdst->u.dst.xfrm->props.trailer_len;
1515 	}
1516 
1517 out:
1518 	return dst0;
1519 
1520 put_states:
1521 	for (; i < nx; i++)
1522 		xfrm_state_put(xfrm[i]);
1523 free_dst:
1524 	if (dst0)
1525 		dst_free(dst0);
1526 	dst0 = ERR_PTR(err);
1527 	goto out;
1528 }
1529 
1530 static int inline
xfrm_dst_alloc_copy(void ** target,const void * src,int size)1531 xfrm_dst_alloc_copy(void **target, const void *src, int size)
1532 {
1533 	if (!*target) {
1534 		*target = kmalloc(size, GFP_ATOMIC);
1535 		if (!*target)
1536 			return -ENOMEM;
1537 	}
1538 	memcpy(*target, src, size);
1539 	return 0;
1540 }
1541 
1542 static int inline
xfrm_dst_update_parent(struct dst_entry * dst,const struct xfrm_selector * sel)1543 xfrm_dst_update_parent(struct dst_entry *dst, const struct xfrm_selector *sel)
1544 {
1545 #ifdef CONFIG_XFRM_SUB_POLICY
1546 	struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1547 	return xfrm_dst_alloc_copy((void **)&(xdst->partner),
1548 				   sel, sizeof(*sel));
1549 #else
1550 	return 0;
1551 #endif
1552 }
1553 
1554 static int inline
xfrm_dst_update_origin(struct dst_entry * dst,const struct flowi * fl)1555 xfrm_dst_update_origin(struct dst_entry *dst, const struct flowi *fl)
1556 {
1557 #ifdef CONFIG_XFRM_SUB_POLICY
1558 	struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1559 	return xfrm_dst_alloc_copy((void **)&(xdst->origin), fl, sizeof(*fl));
1560 #else
1561 	return 0;
1562 #endif
1563 }
1564 
xfrm_expand_policies(const struct flowi * fl,u16 family,struct xfrm_policy ** pols,int * num_pols,int * num_xfrms)1565 static int xfrm_expand_policies(const struct flowi *fl, u16 family,
1566 				struct xfrm_policy **pols,
1567 				int *num_pols, int *num_xfrms)
1568 {
1569 	int i;
1570 
1571 	if (*num_pols == 0 || !pols[0]) {
1572 		*num_pols = 0;
1573 		*num_xfrms = 0;
1574 		return 0;
1575 	}
1576 	if (IS_ERR(pols[0]))
1577 		return PTR_ERR(pols[0]);
1578 
1579 	*num_xfrms = pols[0]->xfrm_nr;
1580 
1581 #ifdef CONFIG_XFRM_SUB_POLICY
1582 	if (pols[0] && pols[0]->action == XFRM_POLICY_ALLOW &&
1583 	    pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
1584 		pols[1] = xfrm_policy_lookup_bytype(xp_net(pols[0]),
1585 						    XFRM_POLICY_TYPE_MAIN,
1586 						    fl, family,
1587 						    XFRM_POLICY_OUT);
1588 		if (pols[1]) {
1589 			if (IS_ERR(pols[1])) {
1590 				xfrm_pols_put(pols, *num_pols);
1591 				return PTR_ERR(pols[1]);
1592 			}
1593 			(*num_pols) ++;
1594 			(*num_xfrms) += pols[1]->xfrm_nr;
1595 		}
1596 	}
1597 #endif
1598 	for (i = 0; i < *num_pols; i++) {
1599 		if (pols[i]->action != XFRM_POLICY_ALLOW) {
1600 			*num_xfrms = -1;
1601 			break;
1602 		}
1603 	}
1604 
1605 	return 0;
1606 
1607 }
1608 
1609 static struct xfrm_dst *
xfrm_resolve_and_create_bundle(struct xfrm_policy ** pols,int num_pols,const struct flowi * fl,u16 family,struct dst_entry * dst_orig)1610 xfrm_resolve_and_create_bundle(struct xfrm_policy **pols, int num_pols,
1611 			       const struct flowi *fl, u16 family,
1612 			       struct dst_entry *dst_orig)
1613 {
1614 	struct net *net = xp_net(pols[0]);
1615 	struct xfrm_state *xfrm[XFRM_MAX_DEPTH];
1616 	struct dst_entry *dst;
1617 	struct xfrm_dst *xdst;
1618 	int err;
1619 
1620 	/* Try to instantiate a bundle */
1621 	err = xfrm_tmpl_resolve(pols, num_pols, fl, xfrm, family);
1622 	if (err <= 0) {
1623 		if (err != 0 && err != -EAGAIN)
1624 			XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
1625 		return ERR_PTR(err);
1626 	}
1627 
1628 	dst = xfrm_bundle_create(pols[0], xfrm, err, fl, dst_orig);
1629 	if (IS_ERR(dst)) {
1630 		XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLEGENERROR);
1631 		return ERR_CAST(dst);
1632 	}
1633 
1634 	xdst = (struct xfrm_dst *)dst;
1635 	xdst->num_xfrms = err;
1636 	if (num_pols > 1)
1637 		err = xfrm_dst_update_parent(dst, &pols[1]->selector);
1638 	else
1639 		err = xfrm_dst_update_origin(dst, fl);
1640 	if (unlikely(err)) {
1641 		dst_free(dst);
1642 		XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLECHECKERROR);
1643 		return ERR_PTR(err);
1644 	}
1645 
1646 	xdst->num_pols = num_pols;
1647 	memcpy(xdst->pols, pols, sizeof(struct xfrm_policy*) * num_pols);
1648 	xdst->policy_genid = atomic_read(&pols[0]->genid);
1649 
1650 	return xdst;
1651 }
1652 
1653 static struct flow_cache_object *
xfrm_bundle_lookup(struct net * net,const struct flowi * fl,u16 family,u8 dir,struct flow_cache_object * oldflo,void * ctx)1654 xfrm_bundle_lookup(struct net *net, const struct flowi *fl, u16 family, u8 dir,
1655 		   struct flow_cache_object *oldflo, void *ctx)
1656 {
1657 	struct dst_entry *dst_orig = (struct dst_entry *)ctx;
1658 	struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
1659 	struct xfrm_dst *xdst, *new_xdst;
1660 	int num_pols = 0, num_xfrms = 0, i, err, pol_dead;
1661 
1662 	/* Check if the policies from old bundle are usable */
1663 	xdst = NULL;
1664 	if (oldflo) {
1665 		xdst = container_of(oldflo, struct xfrm_dst, flo);
1666 		num_pols = xdst->num_pols;
1667 		num_xfrms = xdst->num_xfrms;
1668 		pol_dead = 0;
1669 		for (i = 0; i < num_pols; i++) {
1670 			pols[i] = xdst->pols[i];
1671 			pol_dead |= pols[i]->walk.dead;
1672 		}
1673 		if (pol_dead) {
1674 			dst_free(&xdst->u.dst);
1675 			xdst = NULL;
1676 			num_pols = 0;
1677 			num_xfrms = 0;
1678 			oldflo = NULL;
1679 		}
1680 	}
1681 
1682 	/* Resolve policies to use if we couldn't get them from
1683 	 * previous cache entry */
1684 	if (xdst == NULL) {
1685 		num_pols = 1;
1686 		pols[0] = __xfrm_policy_lookup(net, fl, family, dir);
1687 		err = xfrm_expand_policies(fl, family, pols,
1688 					   &num_pols, &num_xfrms);
1689 		if (err < 0)
1690 			goto inc_error;
1691 		if (num_pols == 0)
1692 			return NULL;
1693 		if (num_xfrms <= 0)
1694 			goto make_dummy_bundle;
1695 	}
1696 
1697 	new_xdst = xfrm_resolve_and_create_bundle(pols, num_pols, fl, family, dst_orig);
1698 	if (IS_ERR(new_xdst)) {
1699 		err = PTR_ERR(new_xdst);
1700 		if (err != -EAGAIN)
1701 			goto error;
1702 		if (oldflo == NULL)
1703 			goto make_dummy_bundle;
1704 		dst_hold(&xdst->u.dst);
1705 		return oldflo;
1706 	} else if (new_xdst == NULL) {
1707 		num_xfrms = 0;
1708 		if (oldflo == NULL)
1709 			goto make_dummy_bundle;
1710 		xdst->num_xfrms = 0;
1711 		dst_hold(&xdst->u.dst);
1712 		return oldflo;
1713 	}
1714 
1715 	/* Kill the previous bundle */
1716 	if (xdst) {
1717 		/* The policies were stolen for newly generated bundle */
1718 		xdst->num_pols = 0;
1719 		dst_free(&xdst->u.dst);
1720 	}
1721 
1722 	/* Flow cache does not have reference, it dst_free()'s,
1723 	 * but we do need to return one reference for original caller */
1724 	dst_hold(&new_xdst->u.dst);
1725 	return &new_xdst->flo;
1726 
1727 make_dummy_bundle:
1728 	/* We found policies, but there's no bundles to instantiate:
1729 	 * either because the policy blocks, has no transformations or
1730 	 * we could not build template (no xfrm_states).*/
1731 	xdst = xfrm_alloc_dst(net, family);
1732 	if (IS_ERR(xdst)) {
1733 		xfrm_pols_put(pols, num_pols);
1734 		return ERR_CAST(xdst);
1735 	}
1736 	xdst->num_pols = num_pols;
1737 	xdst->num_xfrms = num_xfrms;
1738 	memcpy(xdst->pols, pols, sizeof(struct xfrm_policy*) * num_pols);
1739 
1740 	dst_hold(&xdst->u.dst);
1741 	return &xdst->flo;
1742 
1743 inc_error:
1744 	XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
1745 error:
1746 	if (xdst != NULL)
1747 		dst_free(&xdst->u.dst);
1748 	else
1749 		xfrm_pols_put(pols, num_pols);
1750 	return ERR_PTR(err);
1751 }
1752 
make_blackhole(struct net * net,u16 family,struct dst_entry * dst_orig)1753 static struct dst_entry *make_blackhole(struct net *net, u16 family,
1754 					struct dst_entry *dst_orig)
1755 {
1756 	struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
1757 	struct dst_entry *ret;
1758 
1759 	if (!afinfo) {
1760 		dst_release(dst_orig);
1761 		ret = ERR_PTR(-EINVAL);
1762 	} else {
1763 		ret = afinfo->blackhole_route(net, dst_orig);
1764 	}
1765 	xfrm_policy_put_afinfo(afinfo);
1766 
1767 	return ret;
1768 }
1769 
1770 /* Main function: finds/creates a bundle for given flow.
1771  *
1772  * At the moment we eat a raw IP route. Mostly to speed up lookups
1773  * on interfaces with disabled IPsec.
1774  */
xfrm_lookup(struct net * net,struct dst_entry * dst_orig,const struct flowi * fl,struct sock * sk,int flags)1775 struct dst_entry *xfrm_lookup(struct net *net, struct dst_entry *dst_orig,
1776 			      const struct flowi *fl,
1777 			      struct sock *sk, int flags)
1778 {
1779 	struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
1780 	struct flow_cache_object *flo;
1781 	struct xfrm_dst *xdst;
1782 	struct dst_entry *dst, *route;
1783 	u16 family = dst_orig->ops->family;
1784 	u8 dir = policy_to_flow_dir(XFRM_POLICY_OUT);
1785 	int i, err, num_pols, num_xfrms = 0, drop_pols = 0;
1786 
1787 restart:
1788 	dst = NULL;
1789 	xdst = NULL;
1790 	route = NULL;
1791 
1792 	if (sk && sk->sk_policy[XFRM_POLICY_OUT]) {
1793 		num_pols = 1;
1794 		pols[0] = xfrm_sk_policy_lookup(sk, XFRM_POLICY_OUT, fl);
1795 		err = xfrm_expand_policies(fl, family, pols,
1796 					   &num_pols, &num_xfrms);
1797 		if (err < 0)
1798 			goto dropdst;
1799 
1800 		if (num_pols) {
1801 			if (num_xfrms <= 0) {
1802 				drop_pols = num_pols;
1803 				goto no_transform;
1804 			}
1805 
1806 			xdst = xfrm_resolve_and_create_bundle(
1807 					pols, num_pols, fl,
1808 					family, dst_orig);
1809 			if (IS_ERR(xdst)) {
1810 				xfrm_pols_put(pols, num_pols);
1811 				err = PTR_ERR(xdst);
1812 				goto dropdst;
1813 			} else if (xdst == NULL) {
1814 				num_xfrms = 0;
1815 				drop_pols = num_pols;
1816 				goto no_transform;
1817 			}
1818 
1819 			dst_hold(&xdst->u.dst);
1820 
1821 			spin_lock_bh(&xfrm_policy_sk_bundle_lock);
1822 			xdst->u.dst.next = xfrm_policy_sk_bundles;
1823 			xfrm_policy_sk_bundles = &xdst->u.dst;
1824 			spin_unlock_bh(&xfrm_policy_sk_bundle_lock);
1825 
1826 			route = xdst->route;
1827 		}
1828 	}
1829 
1830 	if (xdst == NULL) {
1831 		/* To accelerate a bit...  */
1832 		if ((dst_orig->flags & DST_NOXFRM) ||
1833 		    !net->xfrm.policy_count[XFRM_POLICY_OUT])
1834 			goto nopol;
1835 
1836 		flo = flow_cache_lookup(net, fl, family, dir,
1837 					xfrm_bundle_lookup, dst_orig);
1838 		if (flo == NULL)
1839 			goto nopol;
1840 		if (IS_ERR(flo)) {
1841 			err = PTR_ERR(flo);
1842 			goto dropdst;
1843 		}
1844 		xdst = container_of(flo, struct xfrm_dst, flo);
1845 
1846 		num_pols = xdst->num_pols;
1847 		num_xfrms = xdst->num_xfrms;
1848 		memcpy(pols, xdst->pols, sizeof(struct xfrm_policy*) * num_pols);
1849 		route = xdst->route;
1850 	}
1851 
1852 	dst = &xdst->u.dst;
1853 	if (route == NULL && num_xfrms > 0) {
1854 		/* The only case when xfrm_bundle_lookup() returns a
1855 		 * bundle with null route, is when the template could
1856 		 * not be resolved. It means policies are there, but
1857 		 * bundle could not be created, since we don't yet
1858 		 * have the xfrm_state's. We need to wait for KM to
1859 		 * negotiate new SA's or bail out with error.*/
1860 		if (net->xfrm.sysctl_larval_drop) {
1861 			/* EREMOTE tells the caller to generate
1862 			 * a one-shot blackhole route. */
1863 			dst_release(dst);
1864 			xfrm_pols_put(pols, drop_pols);
1865 			XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
1866 
1867 			return make_blackhole(net, family, dst_orig);
1868 		}
1869 		if (fl->flowi_flags & FLOWI_FLAG_CAN_SLEEP) {
1870 			DECLARE_WAITQUEUE(wait, current);
1871 
1872 			add_wait_queue(&net->xfrm.km_waitq, &wait);
1873 			set_current_state(TASK_INTERRUPTIBLE);
1874 			schedule();
1875 			set_current_state(TASK_RUNNING);
1876 			remove_wait_queue(&net->xfrm.km_waitq, &wait);
1877 
1878 			if (!signal_pending(current)) {
1879 				dst_release(dst);
1880 				goto restart;
1881 			}
1882 
1883 			err = -ERESTART;
1884 		} else
1885 			err = -EAGAIN;
1886 
1887 		XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
1888 		goto error;
1889 	}
1890 
1891 no_transform:
1892 	if (num_pols == 0)
1893 		goto nopol;
1894 
1895 	if ((flags & XFRM_LOOKUP_ICMP) &&
1896 	    !(pols[0]->flags & XFRM_POLICY_ICMP)) {
1897 		err = -ENOENT;
1898 		goto error;
1899 	}
1900 
1901 	for (i = 0; i < num_pols; i++)
1902 		pols[i]->curlft.use_time = get_seconds();
1903 
1904 	if (num_xfrms < 0) {
1905 		/* Prohibit the flow */
1906 		XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLBLOCK);
1907 		err = -EPERM;
1908 		goto error;
1909 	} else if (num_xfrms > 0) {
1910 		/* Flow transformed */
1911 		dst_release(dst_orig);
1912 	} else {
1913 		/* Flow passes untransformed */
1914 		dst_release(dst);
1915 		dst = dst_orig;
1916 	}
1917 ok:
1918 	xfrm_pols_put(pols, drop_pols);
1919 	return dst;
1920 
1921 nopol:
1922 	if (!(flags & XFRM_LOOKUP_ICMP)) {
1923 		dst = dst_orig;
1924 		goto ok;
1925 	}
1926 	err = -ENOENT;
1927 error:
1928 	dst_release(dst);
1929 dropdst:
1930 	dst_release(dst_orig);
1931 	xfrm_pols_put(pols, drop_pols);
1932 	return ERR_PTR(err);
1933 }
1934 EXPORT_SYMBOL(xfrm_lookup);
1935 
1936 static inline int
xfrm_secpath_reject(int idx,struct sk_buff * skb,const struct flowi * fl)1937 xfrm_secpath_reject(int idx, struct sk_buff *skb, const struct flowi *fl)
1938 {
1939 	struct xfrm_state *x;
1940 
1941 	if (!skb->sp || idx < 0 || idx >= skb->sp->len)
1942 		return 0;
1943 	x = skb->sp->xvec[idx];
1944 	if (!x->type->reject)
1945 		return 0;
1946 	return x->type->reject(x, skb, fl);
1947 }
1948 
1949 /* When skb is transformed back to its "native" form, we have to
1950  * check policy restrictions. At the moment we make this in maximally
1951  * stupid way. Shame on me. :-) Of course, connected sockets must
1952  * have policy cached at them.
1953  */
1954 
1955 static inline int
xfrm_state_ok(const struct xfrm_tmpl * tmpl,const struct xfrm_state * x,unsigned short family)1956 xfrm_state_ok(const struct xfrm_tmpl *tmpl, const struct xfrm_state *x,
1957 	      unsigned short family)
1958 {
1959 	if (xfrm_state_kern(x))
1960 		return tmpl->optional && !xfrm_state_addr_cmp(tmpl, x, tmpl->encap_family);
1961 	return	x->id.proto == tmpl->id.proto &&
1962 		(x->id.spi == tmpl->id.spi || !tmpl->id.spi) &&
1963 		(x->props.reqid == tmpl->reqid || !tmpl->reqid) &&
1964 		x->props.mode == tmpl->mode &&
1965 		(tmpl->allalgs || (tmpl->aalgos & (1<<x->props.aalgo)) ||
1966 		 !(xfrm_id_proto_match(tmpl->id.proto, IPSEC_PROTO_ANY))) &&
1967 		!(x->props.mode != XFRM_MODE_TRANSPORT &&
1968 		  xfrm_state_addr_cmp(tmpl, x, family));
1969 }
1970 
1971 /*
1972  * 0 or more than 0 is returned when validation is succeeded (either bypass
1973  * because of optional transport mode, or next index of the mathced secpath
1974  * state with the template.
1975  * -1 is returned when no matching template is found.
1976  * Otherwise "-2 - errored_index" is returned.
1977  */
1978 static inline int
xfrm_policy_ok(const struct xfrm_tmpl * tmpl,const struct sec_path * sp,int start,unsigned short family)1979 xfrm_policy_ok(const struct xfrm_tmpl *tmpl, const struct sec_path *sp, int start,
1980 	       unsigned short family)
1981 {
1982 	int idx = start;
1983 
1984 	if (tmpl->optional) {
1985 		if (tmpl->mode == XFRM_MODE_TRANSPORT)
1986 			return start;
1987 	} else
1988 		start = -1;
1989 	for (; idx < sp->len; idx++) {
1990 		if (xfrm_state_ok(tmpl, sp->xvec[idx], family))
1991 			return ++idx;
1992 		if (sp->xvec[idx]->props.mode != XFRM_MODE_TRANSPORT) {
1993 			if (start == -1)
1994 				start = -2-idx;
1995 			break;
1996 		}
1997 	}
1998 	return start;
1999 }
2000 
__xfrm_decode_session(struct sk_buff * skb,struct flowi * fl,unsigned int family,int reverse)2001 int __xfrm_decode_session(struct sk_buff *skb, struct flowi *fl,
2002 			  unsigned int family, int reverse)
2003 {
2004 	struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
2005 	int err;
2006 
2007 	if (unlikely(afinfo == NULL))
2008 		return -EAFNOSUPPORT;
2009 
2010 	afinfo->decode_session(skb, fl, reverse);
2011 	err = security_xfrm_decode_session(skb, &fl->flowi_secid);
2012 	xfrm_policy_put_afinfo(afinfo);
2013 	return err;
2014 }
2015 EXPORT_SYMBOL(__xfrm_decode_session);
2016 
secpath_has_nontransport(const struct sec_path * sp,int k,int * idxp)2017 static inline int secpath_has_nontransport(const struct sec_path *sp, int k, int *idxp)
2018 {
2019 	for (; k < sp->len; k++) {
2020 		if (sp->xvec[k]->props.mode != XFRM_MODE_TRANSPORT) {
2021 			*idxp = k;
2022 			return 1;
2023 		}
2024 	}
2025 
2026 	return 0;
2027 }
2028 
__xfrm_policy_check(struct sock * sk,int dir,struct sk_buff * skb,unsigned short family)2029 int __xfrm_policy_check(struct sock *sk, int dir, struct sk_buff *skb,
2030 			unsigned short family)
2031 {
2032 	struct net *net = dev_net(skb->dev);
2033 	struct xfrm_policy *pol;
2034 	struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
2035 	int npols = 0;
2036 	int xfrm_nr;
2037 	int pi;
2038 	int reverse;
2039 	struct flowi fl;
2040 	u8 fl_dir;
2041 	int xerr_idx = -1;
2042 
2043 	reverse = dir & ~XFRM_POLICY_MASK;
2044 	dir &= XFRM_POLICY_MASK;
2045 	fl_dir = policy_to_flow_dir(dir);
2046 
2047 	if (__xfrm_decode_session(skb, &fl, family, reverse) < 0) {
2048 		XFRM_INC_STATS(net, LINUX_MIB_XFRMINHDRERROR);
2049 		return 0;
2050 	}
2051 
2052 	nf_nat_decode_session(skb, &fl, family);
2053 
2054 	/* First, check used SA against their selectors. */
2055 	if (skb->sp) {
2056 		int i;
2057 
2058 		for (i=skb->sp->len-1; i>=0; i--) {
2059 			struct xfrm_state *x = skb->sp->xvec[i];
2060 			if (!xfrm_selector_match(&x->sel, &fl, family)) {
2061 				XFRM_INC_STATS(net, LINUX_MIB_XFRMINSTATEMISMATCH);
2062 				return 0;
2063 			}
2064 		}
2065 	}
2066 
2067 	pol = NULL;
2068 	if (sk && sk->sk_policy[dir]) {
2069 		pol = xfrm_sk_policy_lookup(sk, dir, &fl);
2070 		if (IS_ERR(pol)) {
2071 			XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
2072 			return 0;
2073 		}
2074 	}
2075 
2076 	if (!pol) {
2077 		struct flow_cache_object *flo;
2078 
2079 		flo = flow_cache_lookup(net, &fl, family, fl_dir,
2080 					xfrm_policy_lookup, NULL);
2081 		if (IS_ERR_OR_NULL(flo))
2082 			pol = ERR_CAST(flo);
2083 		else
2084 			pol = container_of(flo, struct xfrm_policy, flo);
2085 	}
2086 
2087 	if (IS_ERR(pol)) {
2088 		XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
2089 		return 0;
2090 	}
2091 
2092 	if (!pol) {
2093 		if (skb->sp && secpath_has_nontransport(skb->sp, 0, &xerr_idx)) {
2094 			xfrm_secpath_reject(xerr_idx, skb, &fl);
2095 			XFRM_INC_STATS(net, LINUX_MIB_XFRMINNOPOLS);
2096 			return 0;
2097 		}
2098 		return 1;
2099 	}
2100 
2101 	pol->curlft.use_time = get_seconds();
2102 
2103 	pols[0] = pol;
2104 	npols ++;
2105 #ifdef CONFIG_XFRM_SUB_POLICY
2106 	if (pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
2107 		pols[1] = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN,
2108 						    &fl, family,
2109 						    XFRM_POLICY_IN);
2110 		if (pols[1]) {
2111 			if (IS_ERR(pols[1])) {
2112 				XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
2113 				return 0;
2114 			}
2115 			pols[1]->curlft.use_time = get_seconds();
2116 			npols ++;
2117 		}
2118 	}
2119 #endif
2120 
2121 	if (pol->action == XFRM_POLICY_ALLOW) {
2122 		struct sec_path *sp;
2123 		static struct sec_path dummy;
2124 		struct xfrm_tmpl *tp[XFRM_MAX_DEPTH];
2125 		struct xfrm_tmpl *stp[XFRM_MAX_DEPTH];
2126 		struct xfrm_tmpl **tpp = tp;
2127 		int ti = 0;
2128 		int i, k;
2129 
2130 		if ((sp = skb->sp) == NULL)
2131 			sp = &dummy;
2132 
2133 		for (pi = 0; pi < npols; pi++) {
2134 			if (pols[pi] != pol &&
2135 			    pols[pi]->action != XFRM_POLICY_ALLOW) {
2136 				XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
2137 				goto reject;
2138 			}
2139 			if (ti + pols[pi]->xfrm_nr >= XFRM_MAX_DEPTH) {
2140 				XFRM_INC_STATS(net, LINUX_MIB_XFRMINBUFFERERROR);
2141 				goto reject_error;
2142 			}
2143 			for (i = 0; i < pols[pi]->xfrm_nr; i++)
2144 				tpp[ti++] = &pols[pi]->xfrm_vec[i];
2145 		}
2146 		xfrm_nr = ti;
2147 		if (npols > 1) {
2148 			xfrm_tmpl_sort(stp, tpp, xfrm_nr, family);
2149 			tpp = stp;
2150 		}
2151 
2152 		/* For each tunnel xfrm, find the first matching tmpl.
2153 		 * For each tmpl before that, find corresponding xfrm.
2154 		 * Order is _important_. Later we will implement
2155 		 * some barriers, but at the moment barriers
2156 		 * are implied between each two transformations.
2157 		 */
2158 		for (i = xfrm_nr-1, k = 0; i >= 0; i--) {
2159 			k = xfrm_policy_ok(tpp[i], sp, k, family);
2160 			if (k < 0) {
2161 				if (k < -1)
2162 					/* "-2 - errored_index" returned */
2163 					xerr_idx = -(2+k);
2164 				XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
2165 				goto reject;
2166 			}
2167 		}
2168 
2169 		if (secpath_has_nontransport(sp, k, &xerr_idx)) {
2170 			XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
2171 			goto reject;
2172 		}
2173 
2174 		xfrm_pols_put(pols, npols);
2175 		return 1;
2176 	}
2177 	XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
2178 
2179 reject:
2180 	xfrm_secpath_reject(xerr_idx, skb, &fl);
2181 reject_error:
2182 	xfrm_pols_put(pols, npols);
2183 	return 0;
2184 }
2185 EXPORT_SYMBOL(__xfrm_policy_check);
2186 
__xfrm_route_forward(struct sk_buff * skb,unsigned short family)2187 int __xfrm_route_forward(struct sk_buff *skb, unsigned short family)
2188 {
2189 	struct net *net = dev_net(skb->dev);
2190 	struct flowi fl;
2191 	struct dst_entry *dst;
2192 	int res = 1;
2193 
2194 	if (xfrm_decode_session(skb, &fl, family) < 0) {
2195 		XFRM_INC_STATS(net, LINUX_MIB_XFRMFWDHDRERROR);
2196 		return 0;
2197 	}
2198 
2199 	skb_dst_force(skb);
2200 
2201 	dst = xfrm_lookup(net, skb_dst(skb), &fl, NULL, 0);
2202 	if (IS_ERR(dst)) {
2203 		res = 0;
2204 		dst = NULL;
2205 	}
2206 	skb_dst_set(skb, dst);
2207 	return res;
2208 }
2209 EXPORT_SYMBOL(__xfrm_route_forward);
2210 
2211 /* Optimize later using cookies and generation ids. */
2212 
xfrm_dst_check(struct dst_entry * dst,u32 cookie)2213 static struct dst_entry *xfrm_dst_check(struct dst_entry *dst, u32 cookie)
2214 {
2215 	/* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
2216 	 * to "-1" to force all XFRM destinations to get validated by
2217 	 * dst_ops->check on every use.  We do this because when a
2218 	 * normal route referenced by an XFRM dst is obsoleted we do
2219 	 * not go looking around for all parent referencing XFRM dsts
2220 	 * so that we can invalidate them.  It is just too much work.
2221 	 * Instead we make the checks here on every use.  For example:
2222 	 *
2223 	 *	XFRM dst A --> IPv4 dst X
2224 	 *
2225 	 * X is the "xdst->route" of A (X is also the "dst->path" of A
2226 	 * in this example).  If X is marked obsolete, "A" will not
2227 	 * notice.  That's what we are validating here via the
2228 	 * stale_bundle() check.
2229 	 *
2230 	 * When a policy's bundle is pruned, we dst_free() the XFRM
2231 	 * dst which causes it's ->obsolete field to be set to a
2232 	 * positive non-zero integer.  If an XFRM dst has been pruned
2233 	 * like this, we want to force a new route lookup.
2234 	 */
2235 	if (dst->obsolete < 0 && !stale_bundle(dst))
2236 		return dst;
2237 
2238 	return NULL;
2239 }
2240 
stale_bundle(struct dst_entry * dst)2241 static int stale_bundle(struct dst_entry *dst)
2242 {
2243 	return !xfrm_bundle_ok((struct xfrm_dst *)dst, AF_UNSPEC);
2244 }
2245 
xfrm_dst_ifdown(struct dst_entry * dst,struct net_device * dev)2246 void xfrm_dst_ifdown(struct dst_entry *dst, struct net_device *dev)
2247 {
2248 	while ((dst = dst->child) && dst->xfrm && dst->dev == dev) {
2249 		dst->dev = dev_net(dev)->loopback_dev;
2250 		dev_hold(dst->dev);
2251 		dev_put(dev);
2252 	}
2253 }
2254 EXPORT_SYMBOL(xfrm_dst_ifdown);
2255 
xfrm_link_failure(struct sk_buff * skb)2256 static void xfrm_link_failure(struct sk_buff *skb)
2257 {
2258 	/* Impossible. Such dst must be popped before reaches point of failure. */
2259 }
2260 
xfrm_negative_advice(struct dst_entry * dst)2261 static struct dst_entry *xfrm_negative_advice(struct dst_entry *dst)
2262 {
2263 	if (dst) {
2264 		if (dst->obsolete) {
2265 			dst_release(dst);
2266 			dst = NULL;
2267 		}
2268 	}
2269 	return dst;
2270 }
2271 
__xfrm_garbage_collect(struct net * net)2272 static void __xfrm_garbage_collect(struct net *net)
2273 {
2274 	struct dst_entry *head, *next;
2275 
2276 	flow_cache_flush();
2277 
2278 	spin_lock_bh(&xfrm_policy_sk_bundle_lock);
2279 	head = xfrm_policy_sk_bundles;
2280 	xfrm_policy_sk_bundles = NULL;
2281 	spin_unlock_bh(&xfrm_policy_sk_bundle_lock);
2282 
2283 	while (head) {
2284 		next = head->next;
2285 		dst_free(head);
2286 		head = next;
2287 	}
2288 }
2289 
xfrm_init_pmtu(struct dst_entry * dst)2290 static void xfrm_init_pmtu(struct dst_entry *dst)
2291 {
2292 	do {
2293 		struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
2294 		u32 pmtu, route_mtu_cached;
2295 
2296 		pmtu = dst_mtu(dst->child);
2297 		xdst->child_mtu_cached = pmtu;
2298 
2299 		pmtu = xfrm_state_mtu(dst->xfrm, pmtu);
2300 
2301 		route_mtu_cached = dst_mtu(xdst->route);
2302 		xdst->route_mtu_cached = route_mtu_cached;
2303 
2304 		if (pmtu > route_mtu_cached)
2305 			pmtu = route_mtu_cached;
2306 
2307 		dst_metric_set(dst, RTAX_MTU, pmtu);
2308 	} while ((dst = dst->next));
2309 }
2310 
2311 /* Check that the bundle accepts the flow and its components are
2312  * still valid.
2313  */
2314 
xfrm_bundle_ok(struct xfrm_dst * first,int family)2315 static int xfrm_bundle_ok(struct xfrm_dst *first, int family)
2316 {
2317 	struct dst_entry *dst = &first->u.dst;
2318 	struct xfrm_dst *last;
2319 	u32 mtu;
2320 
2321 	if (!dst_check(dst->path, ((struct xfrm_dst *)dst)->path_cookie) ||
2322 	    (dst->dev && !netif_running(dst->dev)))
2323 		return 0;
2324 
2325 	last = NULL;
2326 
2327 	do {
2328 		struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
2329 
2330 		if (dst->xfrm->km.state != XFRM_STATE_VALID)
2331 			return 0;
2332 		if (xdst->xfrm_genid != dst->xfrm->genid)
2333 			return 0;
2334 		if (xdst->num_pols > 0 &&
2335 		    xdst->policy_genid != atomic_read(&xdst->pols[0]->genid))
2336 			return 0;
2337 
2338 		mtu = dst_mtu(dst->child);
2339 		if (xdst->child_mtu_cached != mtu) {
2340 			last = xdst;
2341 			xdst->child_mtu_cached = mtu;
2342 		}
2343 
2344 		if (!dst_check(xdst->route, xdst->route_cookie))
2345 			return 0;
2346 		mtu = dst_mtu(xdst->route);
2347 		if (xdst->route_mtu_cached != mtu) {
2348 			last = xdst;
2349 			xdst->route_mtu_cached = mtu;
2350 		}
2351 
2352 		dst = dst->child;
2353 	} while (dst->xfrm);
2354 
2355 	if (likely(!last))
2356 		return 1;
2357 
2358 	mtu = last->child_mtu_cached;
2359 	for (;;) {
2360 		dst = &last->u.dst;
2361 
2362 		mtu = xfrm_state_mtu(dst->xfrm, mtu);
2363 		if (mtu > last->route_mtu_cached)
2364 			mtu = last->route_mtu_cached;
2365 		dst_metric_set(dst, RTAX_MTU, mtu);
2366 
2367 		if (last == first)
2368 			break;
2369 
2370 		last = (struct xfrm_dst *)last->u.dst.next;
2371 		last->child_mtu_cached = mtu;
2372 	}
2373 
2374 	return 1;
2375 }
2376 
xfrm_default_advmss(const struct dst_entry * dst)2377 static unsigned int xfrm_default_advmss(const struct dst_entry *dst)
2378 {
2379 	return dst_metric_advmss(dst->path);
2380 }
2381 
xfrm_default_mtu(const struct dst_entry * dst)2382 static unsigned int xfrm_default_mtu(const struct dst_entry *dst)
2383 {
2384 	return dst_mtu(dst->path);
2385 }
2386 
xfrm_policy_register_afinfo(struct xfrm_policy_afinfo * afinfo)2387 int xfrm_policy_register_afinfo(struct xfrm_policy_afinfo *afinfo)
2388 {
2389 	struct net *net;
2390 	int err = 0;
2391 	if (unlikely(afinfo == NULL))
2392 		return -EINVAL;
2393 	if (unlikely(afinfo->family >= NPROTO))
2394 		return -EAFNOSUPPORT;
2395 	write_lock_bh(&xfrm_policy_afinfo_lock);
2396 	if (unlikely(xfrm_policy_afinfo[afinfo->family] != NULL))
2397 		err = -ENOBUFS;
2398 	else {
2399 		struct dst_ops *dst_ops = afinfo->dst_ops;
2400 		if (likely(dst_ops->kmem_cachep == NULL))
2401 			dst_ops->kmem_cachep = xfrm_dst_cache;
2402 		if (likely(dst_ops->check == NULL))
2403 			dst_ops->check = xfrm_dst_check;
2404 		if (likely(dst_ops->default_advmss == NULL))
2405 			dst_ops->default_advmss = xfrm_default_advmss;
2406 		if (likely(dst_ops->default_mtu == NULL))
2407 			dst_ops->default_mtu = xfrm_default_mtu;
2408 		if (likely(dst_ops->negative_advice == NULL))
2409 			dst_ops->negative_advice = xfrm_negative_advice;
2410 		if (likely(dst_ops->link_failure == NULL))
2411 			dst_ops->link_failure = xfrm_link_failure;
2412 		if (likely(afinfo->garbage_collect == NULL))
2413 			afinfo->garbage_collect = __xfrm_garbage_collect;
2414 		xfrm_policy_afinfo[afinfo->family] = afinfo;
2415 	}
2416 	write_unlock_bh(&xfrm_policy_afinfo_lock);
2417 
2418 	rtnl_lock();
2419 	for_each_net(net) {
2420 		struct dst_ops *xfrm_dst_ops;
2421 
2422 		switch (afinfo->family) {
2423 		case AF_INET:
2424 			xfrm_dst_ops = &net->xfrm.xfrm4_dst_ops;
2425 			break;
2426 #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
2427 		case AF_INET6:
2428 			xfrm_dst_ops = &net->xfrm.xfrm6_dst_ops;
2429 			break;
2430 #endif
2431 		default:
2432 			BUG();
2433 		}
2434 		*xfrm_dst_ops = *afinfo->dst_ops;
2435 	}
2436 	rtnl_unlock();
2437 
2438 	return err;
2439 }
2440 EXPORT_SYMBOL(xfrm_policy_register_afinfo);
2441 
xfrm_policy_unregister_afinfo(struct xfrm_policy_afinfo * afinfo)2442 int xfrm_policy_unregister_afinfo(struct xfrm_policy_afinfo *afinfo)
2443 {
2444 	int err = 0;
2445 	if (unlikely(afinfo == NULL))
2446 		return -EINVAL;
2447 	if (unlikely(afinfo->family >= NPROTO))
2448 		return -EAFNOSUPPORT;
2449 	write_lock_bh(&xfrm_policy_afinfo_lock);
2450 	if (likely(xfrm_policy_afinfo[afinfo->family] != NULL)) {
2451 		if (unlikely(xfrm_policy_afinfo[afinfo->family] != afinfo))
2452 			err = -EINVAL;
2453 		else {
2454 			struct dst_ops *dst_ops = afinfo->dst_ops;
2455 			xfrm_policy_afinfo[afinfo->family] = NULL;
2456 			dst_ops->kmem_cachep = NULL;
2457 			dst_ops->check = NULL;
2458 			dst_ops->negative_advice = NULL;
2459 			dst_ops->link_failure = NULL;
2460 			afinfo->garbage_collect = NULL;
2461 		}
2462 	}
2463 	write_unlock_bh(&xfrm_policy_afinfo_lock);
2464 	return err;
2465 }
2466 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo);
2467 
xfrm_dst_ops_init(struct net * net)2468 static void __net_init xfrm_dst_ops_init(struct net *net)
2469 {
2470 	struct xfrm_policy_afinfo *afinfo;
2471 
2472 	read_lock_bh(&xfrm_policy_afinfo_lock);
2473 	afinfo = xfrm_policy_afinfo[AF_INET];
2474 	if (afinfo)
2475 		net->xfrm.xfrm4_dst_ops = *afinfo->dst_ops;
2476 #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
2477 	afinfo = xfrm_policy_afinfo[AF_INET6];
2478 	if (afinfo)
2479 		net->xfrm.xfrm6_dst_ops = *afinfo->dst_ops;
2480 #endif
2481 	read_unlock_bh(&xfrm_policy_afinfo_lock);
2482 }
2483 
xfrm_policy_get_afinfo(unsigned short family)2484 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family)
2485 {
2486 	struct xfrm_policy_afinfo *afinfo;
2487 	if (unlikely(family >= NPROTO))
2488 		return NULL;
2489 	read_lock(&xfrm_policy_afinfo_lock);
2490 	afinfo = xfrm_policy_afinfo[family];
2491 	if (unlikely(!afinfo))
2492 		read_unlock(&xfrm_policy_afinfo_lock);
2493 	return afinfo;
2494 }
2495 
xfrm_policy_put_afinfo(struct xfrm_policy_afinfo * afinfo)2496 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo)
2497 {
2498 	read_unlock(&xfrm_policy_afinfo_lock);
2499 }
2500 
xfrm_dev_event(struct notifier_block * this,unsigned long event,void * ptr)2501 static int xfrm_dev_event(struct notifier_block *this, unsigned long event, void *ptr)
2502 {
2503 	struct net_device *dev = ptr;
2504 
2505 	switch (event) {
2506 	case NETDEV_DOWN:
2507 		__xfrm_garbage_collect(dev_net(dev));
2508 	}
2509 	return NOTIFY_DONE;
2510 }
2511 
2512 static struct notifier_block xfrm_dev_notifier = {
2513 	.notifier_call	= xfrm_dev_event,
2514 };
2515 
2516 #ifdef CONFIG_XFRM_STATISTICS
xfrm_statistics_init(struct net * net)2517 static int __net_init xfrm_statistics_init(struct net *net)
2518 {
2519 	int rv;
2520 
2521 	if (snmp_mib_init((void __percpu **)net->mib.xfrm_statistics,
2522 			  sizeof(struct linux_xfrm_mib),
2523 			  __alignof__(struct linux_xfrm_mib)) < 0)
2524 		return -ENOMEM;
2525 	rv = xfrm_proc_init(net);
2526 	if (rv < 0)
2527 		snmp_mib_free((void __percpu **)net->mib.xfrm_statistics);
2528 	return rv;
2529 }
2530 
xfrm_statistics_fini(struct net * net)2531 static void xfrm_statistics_fini(struct net *net)
2532 {
2533 	xfrm_proc_fini(net);
2534 	snmp_mib_free((void __percpu **)net->mib.xfrm_statistics);
2535 }
2536 #else
xfrm_statistics_init(struct net * net)2537 static int __net_init xfrm_statistics_init(struct net *net)
2538 {
2539 	return 0;
2540 }
2541 
xfrm_statistics_fini(struct net * net)2542 static void xfrm_statistics_fini(struct net *net)
2543 {
2544 }
2545 #endif
2546 
xfrm_policy_init(struct net * net)2547 static int __net_init xfrm_policy_init(struct net *net)
2548 {
2549 	unsigned int hmask, sz;
2550 	int dir;
2551 
2552 	if (net_eq(net, &init_net))
2553 		xfrm_dst_cache = kmem_cache_create("xfrm_dst_cache",
2554 					   sizeof(struct xfrm_dst),
2555 					   0, SLAB_HWCACHE_ALIGN|SLAB_PANIC,
2556 					   NULL);
2557 
2558 	hmask = 8 - 1;
2559 	sz = (hmask+1) * sizeof(struct hlist_head);
2560 
2561 	net->xfrm.policy_byidx = xfrm_hash_alloc(sz);
2562 	if (!net->xfrm.policy_byidx)
2563 		goto out_byidx;
2564 	net->xfrm.policy_idx_hmask = hmask;
2565 
2566 	for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
2567 		struct xfrm_policy_hash *htab;
2568 
2569 		net->xfrm.policy_count[dir] = 0;
2570 		INIT_HLIST_HEAD(&net->xfrm.policy_inexact[dir]);
2571 
2572 		htab = &net->xfrm.policy_bydst[dir];
2573 		htab->table = xfrm_hash_alloc(sz);
2574 		if (!htab->table)
2575 			goto out_bydst;
2576 		htab->hmask = hmask;
2577 	}
2578 
2579 	INIT_LIST_HEAD(&net->xfrm.policy_all);
2580 	INIT_WORK(&net->xfrm.policy_hash_work, xfrm_hash_resize);
2581 	if (net_eq(net, &init_net))
2582 		register_netdevice_notifier(&xfrm_dev_notifier);
2583 	return 0;
2584 
2585 out_bydst:
2586 	for (dir--; dir >= 0; dir--) {
2587 		struct xfrm_policy_hash *htab;
2588 
2589 		htab = &net->xfrm.policy_bydst[dir];
2590 		xfrm_hash_free(htab->table, sz);
2591 	}
2592 	xfrm_hash_free(net->xfrm.policy_byidx, sz);
2593 out_byidx:
2594 	return -ENOMEM;
2595 }
2596 
xfrm_policy_fini(struct net * net)2597 static void xfrm_policy_fini(struct net *net)
2598 {
2599 	struct xfrm_audit audit_info;
2600 	unsigned int sz;
2601 	int dir;
2602 
2603 	flush_work(&net->xfrm.policy_hash_work);
2604 #ifdef CONFIG_XFRM_SUB_POLICY
2605 	audit_info.loginuid = -1;
2606 	audit_info.sessionid = -1;
2607 	audit_info.secid = 0;
2608 	xfrm_policy_flush(net, XFRM_POLICY_TYPE_SUB, &audit_info);
2609 #endif
2610 	audit_info.loginuid = -1;
2611 	audit_info.sessionid = -1;
2612 	audit_info.secid = 0;
2613 	xfrm_policy_flush(net, XFRM_POLICY_TYPE_MAIN, &audit_info);
2614 
2615 	WARN_ON(!list_empty(&net->xfrm.policy_all));
2616 
2617 	for (dir = 0; dir < XFRM_POLICY_MAX * 2; dir++) {
2618 		struct xfrm_policy_hash *htab;
2619 
2620 		WARN_ON(!hlist_empty(&net->xfrm.policy_inexact[dir]));
2621 
2622 		htab = &net->xfrm.policy_bydst[dir];
2623 		sz = (htab->hmask + 1);
2624 		WARN_ON(!hlist_empty(htab->table));
2625 		xfrm_hash_free(htab->table, sz);
2626 	}
2627 
2628 	sz = (net->xfrm.policy_idx_hmask + 1) * sizeof(struct hlist_head);
2629 	WARN_ON(!hlist_empty(net->xfrm.policy_byidx));
2630 	xfrm_hash_free(net->xfrm.policy_byidx, sz);
2631 }
2632 
xfrm_net_init(struct net * net)2633 static int __net_init xfrm_net_init(struct net *net)
2634 {
2635 	int rv;
2636 
2637 	rv = xfrm_statistics_init(net);
2638 	if (rv < 0)
2639 		goto out_statistics;
2640 	rv = xfrm_state_init(net);
2641 	if (rv < 0)
2642 		goto out_state;
2643 	rv = xfrm_policy_init(net);
2644 	if (rv < 0)
2645 		goto out_policy;
2646 	xfrm_dst_ops_init(net);
2647 	rv = xfrm_sysctl_init(net);
2648 	if (rv < 0)
2649 		goto out_sysctl;
2650 	return 0;
2651 
2652 out_sysctl:
2653 	xfrm_policy_fini(net);
2654 out_policy:
2655 	xfrm_state_fini(net);
2656 out_state:
2657 	xfrm_statistics_fini(net);
2658 out_statistics:
2659 	return rv;
2660 }
2661 
xfrm_net_exit(struct net * net)2662 static void __net_exit xfrm_net_exit(struct net *net)
2663 {
2664 	xfrm_sysctl_fini(net);
2665 	xfrm_policy_fini(net);
2666 	xfrm_state_fini(net);
2667 	xfrm_statistics_fini(net);
2668 }
2669 
2670 static struct pernet_operations __net_initdata xfrm_net_ops = {
2671 	.init = xfrm_net_init,
2672 	.exit = xfrm_net_exit,
2673 };
2674 
xfrm_init(void)2675 void __init xfrm_init(void)
2676 {
2677 	register_pernet_subsys(&xfrm_net_ops);
2678 	xfrm_input_init();
2679 }
2680 
2681 #ifdef CONFIG_AUDITSYSCALL
xfrm_audit_common_policyinfo(struct xfrm_policy * xp,struct audit_buffer * audit_buf)2682 static void xfrm_audit_common_policyinfo(struct xfrm_policy *xp,
2683 					 struct audit_buffer *audit_buf)
2684 {
2685 	struct xfrm_sec_ctx *ctx = xp->security;
2686 	struct xfrm_selector *sel = &xp->selector;
2687 
2688 	if (ctx)
2689 		audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
2690 				 ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
2691 
2692 	switch(sel->family) {
2693 	case AF_INET:
2694 		audit_log_format(audit_buf, " src=%pI4", &sel->saddr.a4);
2695 		if (sel->prefixlen_s != 32)
2696 			audit_log_format(audit_buf, " src_prefixlen=%d",
2697 					 sel->prefixlen_s);
2698 		audit_log_format(audit_buf, " dst=%pI4", &sel->daddr.a4);
2699 		if (sel->prefixlen_d != 32)
2700 			audit_log_format(audit_buf, " dst_prefixlen=%d",
2701 					 sel->prefixlen_d);
2702 		break;
2703 	case AF_INET6:
2704 		audit_log_format(audit_buf, " src=%pI6", sel->saddr.a6);
2705 		if (sel->prefixlen_s != 128)
2706 			audit_log_format(audit_buf, " src_prefixlen=%d",
2707 					 sel->prefixlen_s);
2708 		audit_log_format(audit_buf, " dst=%pI6", sel->daddr.a6);
2709 		if (sel->prefixlen_d != 128)
2710 			audit_log_format(audit_buf, " dst_prefixlen=%d",
2711 					 sel->prefixlen_d);
2712 		break;
2713 	}
2714 }
2715 
xfrm_audit_policy_add(struct xfrm_policy * xp,int result,uid_t auid,u32 sessionid,u32 secid)2716 void xfrm_audit_policy_add(struct xfrm_policy *xp, int result,
2717 			   uid_t auid, u32 sessionid, u32 secid)
2718 {
2719 	struct audit_buffer *audit_buf;
2720 
2721 	audit_buf = xfrm_audit_start("SPD-add");
2722 	if (audit_buf == NULL)
2723 		return;
2724 	xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2725 	audit_log_format(audit_buf, " res=%u", result);
2726 	xfrm_audit_common_policyinfo(xp, audit_buf);
2727 	audit_log_end(audit_buf);
2728 }
2729 EXPORT_SYMBOL_GPL(xfrm_audit_policy_add);
2730 
xfrm_audit_policy_delete(struct xfrm_policy * xp,int result,uid_t auid,u32 sessionid,u32 secid)2731 void xfrm_audit_policy_delete(struct xfrm_policy *xp, int result,
2732 			      uid_t auid, u32 sessionid, u32 secid)
2733 {
2734 	struct audit_buffer *audit_buf;
2735 
2736 	audit_buf = xfrm_audit_start("SPD-delete");
2737 	if (audit_buf == NULL)
2738 		return;
2739 	xfrm_audit_helper_usrinfo(auid, sessionid, secid, audit_buf);
2740 	audit_log_format(audit_buf, " res=%u", result);
2741 	xfrm_audit_common_policyinfo(xp, audit_buf);
2742 	audit_log_end(audit_buf);
2743 }
2744 EXPORT_SYMBOL_GPL(xfrm_audit_policy_delete);
2745 #endif
2746 
2747 #ifdef CONFIG_XFRM_MIGRATE
xfrm_migrate_selector_match(const struct xfrm_selector * sel_cmp,const struct xfrm_selector * sel_tgt)2748 static int xfrm_migrate_selector_match(const struct xfrm_selector *sel_cmp,
2749 				       const struct xfrm_selector *sel_tgt)
2750 {
2751 	if (sel_cmp->proto == IPSEC_ULPROTO_ANY) {
2752 		if (sel_tgt->family == sel_cmp->family &&
2753 		    xfrm_addr_cmp(&sel_tgt->daddr, &sel_cmp->daddr,
2754 				  sel_cmp->family) == 0 &&
2755 		    xfrm_addr_cmp(&sel_tgt->saddr, &sel_cmp->saddr,
2756 				  sel_cmp->family) == 0 &&
2757 		    sel_tgt->prefixlen_d == sel_cmp->prefixlen_d &&
2758 		    sel_tgt->prefixlen_s == sel_cmp->prefixlen_s) {
2759 			return 1;
2760 		}
2761 	} else {
2762 		if (memcmp(sel_tgt, sel_cmp, sizeof(*sel_tgt)) == 0) {
2763 			return 1;
2764 		}
2765 	}
2766 	return 0;
2767 }
2768 
xfrm_migrate_policy_find(const struct xfrm_selector * sel,u8 dir,u8 type)2769 static struct xfrm_policy * xfrm_migrate_policy_find(const struct xfrm_selector *sel,
2770 						     u8 dir, u8 type)
2771 {
2772 	struct xfrm_policy *pol, *ret = NULL;
2773 	struct hlist_node *entry;
2774 	struct hlist_head *chain;
2775 	u32 priority = ~0U;
2776 
2777 	read_lock_bh(&xfrm_policy_lock);
2778 	chain = policy_hash_direct(&init_net, &sel->daddr, &sel->saddr, sel->family, dir);
2779 	hlist_for_each_entry(pol, entry, chain, bydst) {
2780 		if (xfrm_migrate_selector_match(sel, &pol->selector) &&
2781 		    pol->type == type) {
2782 			ret = pol;
2783 			priority = ret->priority;
2784 			break;
2785 		}
2786 	}
2787 	chain = &init_net.xfrm.policy_inexact[dir];
2788 	hlist_for_each_entry(pol, entry, chain, bydst) {
2789 		if (xfrm_migrate_selector_match(sel, &pol->selector) &&
2790 		    pol->type == type &&
2791 		    pol->priority < priority) {
2792 			ret = pol;
2793 			break;
2794 		}
2795 	}
2796 
2797 	if (ret)
2798 		xfrm_pol_hold(ret);
2799 
2800 	read_unlock_bh(&xfrm_policy_lock);
2801 
2802 	return ret;
2803 }
2804 
migrate_tmpl_match(const struct xfrm_migrate * m,const struct xfrm_tmpl * t)2805 static int migrate_tmpl_match(const struct xfrm_migrate *m, const struct xfrm_tmpl *t)
2806 {
2807 	int match = 0;
2808 
2809 	if (t->mode == m->mode && t->id.proto == m->proto &&
2810 	    (m->reqid == 0 || t->reqid == m->reqid)) {
2811 		switch (t->mode) {
2812 		case XFRM_MODE_TUNNEL:
2813 		case XFRM_MODE_BEET:
2814 			if (xfrm_addr_cmp(&t->id.daddr, &m->old_daddr,
2815 					  m->old_family) == 0 &&
2816 			    xfrm_addr_cmp(&t->saddr, &m->old_saddr,
2817 					  m->old_family) == 0) {
2818 				match = 1;
2819 			}
2820 			break;
2821 		case XFRM_MODE_TRANSPORT:
2822 			/* in case of transport mode, template does not store
2823 			   any IP addresses, hence we just compare mode and
2824 			   protocol */
2825 			match = 1;
2826 			break;
2827 		default:
2828 			break;
2829 		}
2830 	}
2831 	return match;
2832 }
2833 
2834 /* update endpoint address(es) of template(s) */
xfrm_policy_migrate(struct xfrm_policy * pol,struct xfrm_migrate * m,int num_migrate)2835 static int xfrm_policy_migrate(struct xfrm_policy *pol,
2836 			       struct xfrm_migrate *m, int num_migrate)
2837 {
2838 	struct xfrm_migrate *mp;
2839 	int i, j, n = 0;
2840 
2841 	write_lock_bh(&pol->lock);
2842 	if (unlikely(pol->walk.dead)) {
2843 		/* target policy has been deleted */
2844 		write_unlock_bh(&pol->lock);
2845 		return -ENOENT;
2846 	}
2847 
2848 	for (i = 0; i < pol->xfrm_nr; i++) {
2849 		for (j = 0, mp = m; j < num_migrate; j++, mp++) {
2850 			if (!migrate_tmpl_match(mp, &pol->xfrm_vec[i]))
2851 				continue;
2852 			n++;
2853 			if (pol->xfrm_vec[i].mode != XFRM_MODE_TUNNEL &&
2854 			    pol->xfrm_vec[i].mode != XFRM_MODE_BEET)
2855 				continue;
2856 			/* update endpoints */
2857 			memcpy(&pol->xfrm_vec[i].id.daddr, &mp->new_daddr,
2858 			       sizeof(pol->xfrm_vec[i].id.daddr));
2859 			memcpy(&pol->xfrm_vec[i].saddr, &mp->new_saddr,
2860 			       sizeof(pol->xfrm_vec[i].saddr));
2861 			pol->xfrm_vec[i].encap_family = mp->new_family;
2862 			/* flush bundles */
2863 			atomic_inc(&pol->genid);
2864 		}
2865 	}
2866 
2867 	write_unlock_bh(&pol->lock);
2868 
2869 	if (!n)
2870 		return -ENODATA;
2871 
2872 	return 0;
2873 }
2874 
xfrm_migrate_check(const struct xfrm_migrate * m,int num_migrate)2875 static int xfrm_migrate_check(const struct xfrm_migrate *m, int num_migrate)
2876 {
2877 	int i, j;
2878 
2879 	if (num_migrate < 1 || num_migrate > XFRM_MAX_DEPTH)
2880 		return -EINVAL;
2881 
2882 	for (i = 0; i < num_migrate; i++) {
2883 		if ((xfrm_addr_cmp(&m[i].old_daddr, &m[i].new_daddr,
2884 				   m[i].old_family) == 0) &&
2885 		    (xfrm_addr_cmp(&m[i].old_saddr, &m[i].new_saddr,
2886 				   m[i].old_family) == 0))
2887 			return -EINVAL;
2888 		if (xfrm_addr_any(&m[i].new_daddr, m[i].new_family) ||
2889 		    xfrm_addr_any(&m[i].new_saddr, m[i].new_family))
2890 			return -EINVAL;
2891 
2892 		/* check if there is any duplicated entry */
2893 		for (j = i + 1; j < num_migrate; j++) {
2894 			if (!memcmp(&m[i].old_daddr, &m[j].old_daddr,
2895 				    sizeof(m[i].old_daddr)) &&
2896 			    !memcmp(&m[i].old_saddr, &m[j].old_saddr,
2897 				    sizeof(m[i].old_saddr)) &&
2898 			    m[i].proto == m[j].proto &&
2899 			    m[i].mode == m[j].mode &&
2900 			    m[i].reqid == m[j].reqid &&
2901 			    m[i].old_family == m[j].old_family)
2902 				return -EINVAL;
2903 		}
2904 	}
2905 
2906 	return 0;
2907 }
2908 
xfrm_migrate(const struct xfrm_selector * sel,u8 dir,u8 type,struct xfrm_migrate * m,int num_migrate,struct xfrm_kmaddress * k)2909 int xfrm_migrate(const struct xfrm_selector *sel, u8 dir, u8 type,
2910 		 struct xfrm_migrate *m, int num_migrate,
2911 		 struct xfrm_kmaddress *k)
2912 {
2913 	int i, err, nx_cur = 0, nx_new = 0;
2914 	struct xfrm_policy *pol = NULL;
2915 	struct xfrm_state *x, *xc;
2916 	struct xfrm_state *x_cur[XFRM_MAX_DEPTH];
2917 	struct xfrm_state *x_new[XFRM_MAX_DEPTH];
2918 	struct xfrm_migrate *mp;
2919 
2920 	if ((err = xfrm_migrate_check(m, num_migrate)) < 0)
2921 		goto out;
2922 
2923 	/* Stage 1 - find policy */
2924 	if ((pol = xfrm_migrate_policy_find(sel, dir, type)) == NULL) {
2925 		err = -ENOENT;
2926 		goto out;
2927 	}
2928 
2929 	/* Stage 2 - find and update state(s) */
2930 	for (i = 0, mp = m; i < num_migrate; i++, mp++) {
2931 		if ((x = xfrm_migrate_state_find(mp))) {
2932 			x_cur[nx_cur] = x;
2933 			nx_cur++;
2934 			if ((xc = xfrm_state_migrate(x, mp))) {
2935 				x_new[nx_new] = xc;
2936 				nx_new++;
2937 			} else {
2938 				err = -ENODATA;
2939 				goto restore_state;
2940 			}
2941 		}
2942 	}
2943 
2944 	/* Stage 3 - update policy */
2945 	if ((err = xfrm_policy_migrate(pol, m, num_migrate)) < 0)
2946 		goto restore_state;
2947 
2948 	/* Stage 4 - delete old state(s) */
2949 	if (nx_cur) {
2950 		xfrm_states_put(x_cur, nx_cur);
2951 		xfrm_states_delete(x_cur, nx_cur);
2952 	}
2953 
2954 	/* Stage 5 - announce */
2955 	km_migrate(sel, dir, type, m, num_migrate, k);
2956 
2957 	xfrm_pol_put(pol);
2958 
2959 	return 0;
2960 out:
2961 	return err;
2962 
2963 restore_state:
2964 	if (pol)
2965 		xfrm_pol_put(pol);
2966 	if (nx_cur)
2967 		xfrm_states_put(x_cur, nx_cur);
2968 	if (nx_new)
2969 		xfrm_states_delete(x_new, nx_new);
2970 
2971 	return err;
2972 }
2973 EXPORT_SYMBOL(xfrm_migrate);
2974 #endif
2975