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