6 * Kazunori MIYAZAWA @USAGI
7 * Kunihiro Ishiguro <kunihiro@ipinfusion.com>
9 * Kazunori MIYAZAWA @USAGI
11 * Split up af-specific portion
12 * Derek Atkins <derek@ihtfp.com> Add the post_input processor
17 #include <linux/config.h>
18 #include <linux/slab.h>
19 #include <linux/kmod.h>
20 #include <linux/list.h>
21 #include <linux/spinlock.h>
22 #include <linux/workqueue.h>
23 #include <linux/notifier.h>
24 #include <linux/netdevice.h>
25 #include <linux/module.h>
29 DECLARE_MUTEX(xfrm_cfg_sem);
30 EXPORT_SYMBOL(xfrm_cfg_sem);
32 static DEFINE_RWLOCK(xfrm_policy_lock);
34 struct xfrm_policy *xfrm_policy_list[XFRM_POLICY_MAX*2];
35 EXPORT_SYMBOL(xfrm_policy_list);
37 static DEFINE_RWLOCK(xfrm_policy_afinfo_lock);
38 static struct xfrm_policy_afinfo *xfrm_policy_afinfo[NPROTO];
40 static kmem_cache_t *xfrm_dst_cache __read_mostly;
42 static struct work_struct xfrm_policy_gc_work;
43 static struct list_head xfrm_policy_gc_list =
44 LIST_HEAD_INIT(xfrm_policy_gc_list);
45 static DEFINE_SPINLOCK(xfrm_policy_gc_lock);
47 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family);
48 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo);
50 int xfrm_register_type(struct xfrm_type *type, unsigned short family)
52 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
53 struct xfrm_type_map *typemap;
56 if (unlikely(afinfo == NULL))
58 typemap = afinfo->type_map;
60 write_lock(&typemap->lock);
61 if (likely(typemap->map[type->proto] == NULL))
62 typemap->map[type->proto] = type;
65 write_unlock(&typemap->lock);
66 xfrm_policy_put_afinfo(afinfo);
69 EXPORT_SYMBOL(xfrm_register_type);
71 int xfrm_unregister_type(struct xfrm_type *type, unsigned short family)
73 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
74 struct xfrm_type_map *typemap;
77 if (unlikely(afinfo == NULL))
79 typemap = afinfo->type_map;
81 write_lock(&typemap->lock);
82 if (unlikely(typemap->map[type->proto] != type))
85 typemap->map[type->proto] = NULL;
86 write_unlock(&typemap->lock);
87 xfrm_policy_put_afinfo(afinfo);
90 EXPORT_SYMBOL(xfrm_unregister_type);
92 struct xfrm_type *xfrm_get_type(u8 proto, unsigned short family)
94 struct xfrm_policy_afinfo *afinfo;
95 struct xfrm_type_map *typemap;
96 struct xfrm_type *type;
97 int modload_attempted = 0;
100 afinfo = xfrm_policy_get_afinfo(family);
101 if (unlikely(afinfo == NULL))
103 typemap = afinfo->type_map;
105 read_lock(&typemap->lock);
106 type = typemap->map[proto];
107 if (unlikely(type && !try_module_get(type->owner)))
109 read_unlock(&typemap->lock);
110 if (!type && !modload_attempted) {
111 xfrm_policy_put_afinfo(afinfo);
112 request_module("xfrm-type-%d-%d",
113 (int) family, (int) proto);
114 modload_attempted = 1;
118 xfrm_policy_put_afinfo(afinfo);
122 int xfrm_dst_lookup(struct xfrm_dst **dst, struct flowi *fl,
123 unsigned short family)
125 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
128 if (unlikely(afinfo == NULL))
129 return -EAFNOSUPPORT;
131 if (likely(afinfo->dst_lookup != NULL))
132 err = afinfo->dst_lookup(dst, fl);
135 xfrm_policy_put_afinfo(afinfo);
138 EXPORT_SYMBOL(xfrm_dst_lookup);
140 void xfrm_put_type(struct xfrm_type *type)
142 module_put(type->owner);
145 static inline unsigned long make_jiffies(long secs)
147 if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
148 return MAX_SCHEDULE_TIMEOUT-1;
153 static void xfrm_policy_timer(unsigned long data)
155 struct xfrm_policy *xp = (struct xfrm_policy*)data;
156 unsigned long now = (unsigned long)xtime.tv_sec;
157 long next = LONG_MAX;
161 read_lock(&xp->lock);
166 dir = xfrm_policy_id2dir(xp->index);
168 if (xp->lft.hard_add_expires_seconds) {
169 long tmo = xp->lft.hard_add_expires_seconds +
170 xp->curlft.add_time - now;
176 if (xp->lft.hard_use_expires_seconds) {
177 long tmo = xp->lft.hard_use_expires_seconds +
178 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
184 if (xp->lft.soft_add_expires_seconds) {
185 long tmo = xp->lft.soft_add_expires_seconds +
186 xp->curlft.add_time - now;
189 tmo = XFRM_KM_TIMEOUT;
194 if (xp->lft.soft_use_expires_seconds) {
195 long tmo = xp->lft.soft_use_expires_seconds +
196 (xp->curlft.use_time ? : xp->curlft.add_time) - now;
199 tmo = XFRM_KM_TIMEOUT;
206 km_policy_expired(xp, dir, 0);
207 if (next != LONG_MAX &&
208 !mod_timer(&xp->timer, jiffies + make_jiffies(next)))
212 read_unlock(&xp->lock);
217 read_unlock(&xp->lock);
218 if (!xfrm_policy_delete(xp, dir))
219 km_policy_expired(xp, dir, 1);
224 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
228 struct xfrm_policy *xfrm_policy_alloc(gfp_t gfp)
230 struct xfrm_policy *policy;
232 policy = kmalloc(sizeof(struct xfrm_policy), gfp);
235 memset(policy, 0, sizeof(struct xfrm_policy));
236 atomic_set(&policy->refcnt, 1);
237 rwlock_init(&policy->lock);
238 init_timer(&policy->timer);
239 policy->timer.data = (unsigned long)policy;
240 policy->timer.function = xfrm_policy_timer;
244 EXPORT_SYMBOL(xfrm_policy_alloc);
246 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
248 void __xfrm_policy_destroy(struct xfrm_policy *policy)
256 if (del_timer(&policy->timer))
261 EXPORT_SYMBOL(__xfrm_policy_destroy);
263 static void xfrm_policy_gc_kill(struct xfrm_policy *policy)
265 struct dst_entry *dst;
267 while ((dst = policy->bundles) != NULL) {
268 policy->bundles = dst->next;
272 if (del_timer(&policy->timer))
273 atomic_dec(&policy->refcnt);
275 if (atomic_read(&policy->refcnt) > 1)
278 xfrm_pol_put(policy);
281 static void xfrm_policy_gc_task(void *data)
283 struct xfrm_policy *policy;
284 struct list_head *entry, *tmp;
285 struct list_head gc_list = LIST_HEAD_INIT(gc_list);
287 spin_lock_bh(&xfrm_policy_gc_lock);
288 list_splice_init(&xfrm_policy_gc_list, &gc_list);
289 spin_unlock_bh(&xfrm_policy_gc_lock);
291 list_for_each_safe(entry, tmp, &gc_list) {
292 policy = list_entry(entry, struct xfrm_policy, list);
293 xfrm_policy_gc_kill(policy);
297 /* Rule must be locked. Release descentant resources, announce
298 * entry dead. The rule must be unlinked from lists to the moment.
301 static void xfrm_policy_kill(struct xfrm_policy *policy)
305 write_lock_bh(&policy->lock);
308 write_unlock_bh(&policy->lock);
310 if (unlikely(dead)) {
315 spin_lock(&xfrm_policy_gc_lock);
316 list_add(&policy->list, &xfrm_policy_gc_list);
317 spin_unlock(&xfrm_policy_gc_lock);
319 schedule_work(&xfrm_policy_gc_work);
322 /* Generate new index... KAME seems to generate them ordered by cost
323 * of an absolute inpredictability of ordering of rules. This will not pass. */
324 static u32 xfrm_gen_index(int dir)
327 struct xfrm_policy *p;
328 static u32 idx_generator;
331 idx = (idx_generator | dir);
335 for (p = xfrm_policy_list[dir]; p; p = p->next) {
344 int xfrm_policy_insert(int dir, struct xfrm_policy *policy, int excl)
346 struct xfrm_policy *pol, **p;
347 struct xfrm_policy *delpol = NULL;
348 struct xfrm_policy **newpos = NULL;
349 struct dst_entry *gc_list;
351 write_lock_bh(&xfrm_policy_lock);
352 for (p = &xfrm_policy_list[dir]; (pol=*p)!=NULL;) {
353 if (!delpol && memcmp(&policy->selector, &pol->selector, sizeof(pol->selector)) == 0) {
355 write_unlock_bh(&xfrm_policy_lock);
360 if (policy->priority > pol->priority)
362 } else if (policy->priority >= pol->priority) {
374 xfrm_pol_hold(policy);
377 atomic_inc(&flow_cache_genid);
378 policy->index = delpol ? delpol->index : xfrm_gen_index(dir);
379 policy->curlft.add_time = (unsigned long)xtime.tv_sec;
380 policy->curlft.use_time = 0;
381 if (!mod_timer(&policy->timer, jiffies + HZ))
382 xfrm_pol_hold(policy);
383 write_unlock_bh(&xfrm_policy_lock);
386 xfrm_policy_kill(delpol);
388 read_lock_bh(&xfrm_policy_lock);
390 for (policy = policy->next; policy; policy = policy->next) {
391 struct dst_entry *dst;
393 write_lock(&policy->lock);
394 dst = policy->bundles;
396 struct dst_entry *tail = dst;
399 tail->next = gc_list;
402 policy->bundles = NULL;
404 write_unlock(&policy->lock);
406 read_unlock_bh(&xfrm_policy_lock);
409 struct dst_entry *dst = gc_list;
417 EXPORT_SYMBOL(xfrm_policy_insert);
419 struct xfrm_policy *xfrm_policy_bysel(int dir, struct xfrm_selector *sel,
422 struct xfrm_policy *pol, **p;
424 write_lock_bh(&xfrm_policy_lock);
425 for (p = &xfrm_policy_list[dir]; (pol=*p)!=NULL; p = &pol->next) {
426 if (memcmp(sel, &pol->selector, sizeof(*sel)) == 0) {
433 write_unlock_bh(&xfrm_policy_lock);
436 atomic_inc(&flow_cache_genid);
437 xfrm_policy_kill(pol);
441 EXPORT_SYMBOL(xfrm_policy_bysel);
443 struct xfrm_policy *xfrm_policy_byid(int dir, u32 id, int delete)
445 struct xfrm_policy *pol, **p;
447 write_lock_bh(&xfrm_policy_lock);
448 for (p = &xfrm_policy_list[dir]; (pol=*p)!=NULL; p = &pol->next) {
449 if (pol->index == id) {
456 write_unlock_bh(&xfrm_policy_lock);
459 atomic_inc(&flow_cache_genid);
460 xfrm_policy_kill(pol);
464 EXPORT_SYMBOL(xfrm_policy_byid);
466 void xfrm_policy_flush(void)
468 struct xfrm_policy *xp;
471 write_lock_bh(&xfrm_policy_lock);
472 for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
473 while ((xp = xfrm_policy_list[dir]) != NULL) {
474 xfrm_policy_list[dir] = xp->next;
475 write_unlock_bh(&xfrm_policy_lock);
477 xfrm_policy_kill(xp);
479 write_lock_bh(&xfrm_policy_lock);
482 atomic_inc(&flow_cache_genid);
483 write_unlock_bh(&xfrm_policy_lock);
485 EXPORT_SYMBOL(xfrm_policy_flush);
487 int xfrm_policy_walk(int (*func)(struct xfrm_policy *, int, int, void*),
490 struct xfrm_policy *xp;
495 read_lock_bh(&xfrm_policy_lock);
496 for (dir = 0; dir < 2*XFRM_POLICY_MAX; dir++) {
497 for (xp = xfrm_policy_list[dir]; xp; xp = xp->next)
506 for (dir = 0; dir < 2*XFRM_POLICY_MAX; dir++) {
507 for (xp = xfrm_policy_list[dir]; xp; xp = xp->next) {
508 error = func(xp, dir%XFRM_POLICY_MAX, --count, data);
515 read_unlock_bh(&xfrm_policy_lock);
518 EXPORT_SYMBOL(xfrm_policy_walk);
520 /* Find policy to apply to this flow. */
522 static void xfrm_policy_lookup(struct flowi *fl, u16 family, u8 dir,
523 void **objp, atomic_t **obj_refp)
525 struct xfrm_policy *pol;
527 read_lock_bh(&xfrm_policy_lock);
528 for (pol = xfrm_policy_list[dir]; pol; pol = pol->next) {
529 struct xfrm_selector *sel = &pol->selector;
532 if (pol->family != family)
535 match = xfrm_selector_match(sel, fl, family);
541 read_unlock_bh(&xfrm_policy_lock);
542 if ((*objp = (void *) pol) != NULL)
543 *obj_refp = &pol->refcnt;
546 static struct xfrm_policy *xfrm_sk_policy_lookup(struct sock *sk, int dir, struct flowi *fl)
548 struct xfrm_policy *pol;
550 read_lock_bh(&xfrm_policy_lock);
551 if ((pol = sk->sk_policy[dir]) != NULL) {
552 int match = xfrm_selector_match(&pol->selector, fl,
559 read_unlock_bh(&xfrm_policy_lock);
563 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir)
565 pol->next = xfrm_policy_list[dir];
566 xfrm_policy_list[dir] = pol;
570 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
573 struct xfrm_policy **polp;
575 for (polp = &xfrm_policy_list[dir];
576 *polp != NULL; polp = &(*polp)->next) {
585 int xfrm_policy_delete(struct xfrm_policy *pol, int dir)
587 write_lock_bh(&xfrm_policy_lock);
588 pol = __xfrm_policy_unlink(pol, dir);
589 write_unlock_bh(&xfrm_policy_lock);
591 if (dir < XFRM_POLICY_MAX)
592 atomic_inc(&flow_cache_genid);
593 xfrm_policy_kill(pol);
599 int xfrm_sk_policy_insert(struct sock *sk, int dir, struct xfrm_policy *pol)
601 struct xfrm_policy *old_pol;
603 write_lock_bh(&xfrm_policy_lock);
604 old_pol = sk->sk_policy[dir];
605 sk->sk_policy[dir] = pol;
607 pol->curlft.add_time = (unsigned long)xtime.tv_sec;
608 pol->index = xfrm_gen_index(XFRM_POLICY_MAX+dir);
609 __xfrm_policy_link(pol, XFRM_POLICY_MAX+dir);
612 __xfrm_policy_unlink(old_pol, XFRM_POLICY_MAX+dir);
613 write_unlock_bh(&xfrm_policy_lock);
616 xfrm_policy_kill(old_pol);
621 static struct xfrm_policy *clone_policy(struct xfrm_policy *old, int dir)
623 struct xfrm_policy *newp = xfrm_policy_alloc(GFP_ATOMIC);
626 newp->selector = old->selector;
627 newp->lft = old->lft;
628 newp->curlft = old->curlft;
629 newp->action = old->action;
630 newp->flags = old->flags;
631 newp->xfrm_nr = old->xfrm_nr;
632 newp->index = old->index;
633 memcpy(newp->xfrm_vec, old->xfrm_vec,
634 newp->xfrm_nr*sizeof(struct xfrm_tmpl));
635 write_lock_bh(&xfrm_policy_lock);
636 __xfrm_policy_link(newp, XFRM_POLICY_MAX+dir);
637 write_unlock_bh(&xfrm_policy_lock);
643 int __xfrm_sk_clone_policy(struct sock *sk)
645 struct xfrm_policy *p0 = sk->sk_policy[0],
646 *p1 = sk->sk_policy[1];
648 sk->sk_policy[0] = sk->sk_policy[1] = NULL;
649 if (p0 && (sk->sk_policy[0] = clone_policy(p0, 0)) == NULL)
651 if (p1 && (sk->sk_policy[1] = clone_policy(p1, 1)) == NULL)
656 /* Resolve list of templates for the flow, given policy. */
659 xfrm_tmpl_resolve(struct xfrm_policy *policy, struct flowi *fl,
660 struct xfrm_state **xfrm,
661 unsigned short family)
665 xfrm_address_t *daddr = xfrm_flowi_daddr(fl, family);
666 xfrm_address_t *saddr = xfrm_flowi_saddr(fl, family);
668 for (nx=0, i = 0; i < policy->xfrm_nr; i++) {
669 struct xfrm_state *x;
670 xfrm_address_t *remote = daddr;
671 xfrm_address_t *local = saddr;
672 struct xfrm_tmpl *tmpl = &policy->xfrm_vec[i];
675 remote = &tmpl->id.daddr;
676 local = &tmpl->saddr;
679 x = xfrm_state_find(remote, local, fl, tmpl, policy, &error, family);
681 if (x && x->km.state == XFRM_STATE_VALID) {
688 error = (x->km.state == XFRM_STATE_ERROR ?
699 for (nx--; nx>=0; nx--)
700 xfrm_state_put(xfrm[nx]);
704 /* Check that the bundle accepts the flow and its components are
708 static struct dst_entry *
709 xfrm_find_bundle(struct flowi *fl, struct xfrm_policy *policy, unsigned short family)
712 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
713 if (unlikely(afinfo == NULL))
714 return ERR_PTR(-EINVAL);
715 x = afinfo->find_bundle(fl, policy);
716 xfrm_policy_put_afinfo(afinfo);
720 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
721 * all the metrics... Shortly, bundle a bundle.
725 xfrm_bundle_create(struct xfrm_policy *policy, struct xfrm_state **xfrm, int nx,
726 struct flowi *fl, struct dst_entry **dst_p,
727 unsigned short family)
730 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
731 if (unlikely(afinfo == NULL))
733 err = afinfo->bundle_create(policy, xfrm, nx, fl, dst_p);
734 xfrm_policy_put_afinfo(afinfo);
738 static inline int policy_to_flow_dir(int dir)
740 if (XFRM_POLICY_IN == FLOW_DIR_IN &&
741 XFRM_POLICY_OUT == FLOW_DIR_OUT &&
742 XFRM_POLICY_FWD == FLOW_DIR_FWD)
748 case XFRM_POLICY_OUT:
750 case XFRM_POLICY_FWD:
755 static int stale_bundle(struct dst_entry *dst);
757 /* Main function: finds/creates a bundle for given flow.
759 * At the moment we eat a raw IP route. Mostly to speed up lookups
760 * on interfaces with disabled IPsec.
762 int xfrm_lookup(struct dst_entry **dst_p, struct flowi *fl,
763 struct sock *sk, int flags)
765 struct xfrm_policy *policy;
766 struct xfrm_state *xfrm[XFRM_MAX_DEPTH];
767 struct dst_entry *dst, *dst_orig = *dst_p;
771 u16 family = dst_orig->ops->family;
773 genid = atomic_read(&flow_cache_genid);
775 if (sk && sk->sk_policy[1])
776 policy = xfrm_sk_policy_lookup(sk, XFRM_POLICY_OUT, fl);
779 /* To accelerate a bit... */
780 if ((dst_orig->flags & DST_NOXFRM) || !xfrm_policy_list[XFRM_POLICY_OUT])
783 policy = flow_cache_lookup(fl, family,
784 policy_to_flow_dir(XFRM_POLICY_OUT),
791 policy->curlft.use_time = (unsigned long)xtime.tv_sec;
793 switch (policy->action) {
794 case XFRM_POLICY_BLOCK:
795 /* Prohibit the flow */
799 case XFRM_POLICY_ALLOW:
800 if (policy->xfrm_nr == 0) {
801 /* Flow passes not transformed. */
802 xfrm_pol_put(policy);
806 /* Try to find matching bundle.
808 * LATER: help from flow cache. It is optional, this
809 * is required only for output policy.
811 dst = xfrm_find_bundle(fl, policy, family);
820 nx = xfrm_tmpl_resolve(policy, fl, xfrm, family);
822 if (unlikely(nx<0)) {
824 if (err == -EAGAIN && flags) {
825 DECLARE_WAITQUEUE(wait, current);
827 add_wait_queue(&km_waitq, &wait);
828 set_current_state(TASK_INTERRUPTIBLE);
830 set_current_state(TASK_RUNNING);
831 remove_wait_queue(&km_waitq, &wait);
833 nx = xfrm_tmpl_resolve(policy, fl, xfrm, family);
835 if (nx == -EAGAIN && signal_pending(current)) {
840 genid != atomic_read(&flow_cache_genid)) {
841 xfrm_pol_put(policy);
850 /* Flow passes not transformed. */
851 xfrm_pol_put(policy);
856 err = xfrm_bundle_create(policy, xfrm, nx, fl, &dst, family);
861 xfrm_state_put(xfrm[i]);
865 write_lock_bh(&policy->lock);
866 if (unlikely(policy->dead || stale_bundle(dst))) {
867 /* Wow! While we worked on resolving, this
868 * policy has gone. Retry. It is not paranoia,
869 * we just cannot enlist new bundle to dead object.
870 * We can't enlist stable bundles either.
872 write_unlock_bh(&policy->lock);
874 xfrm_pol_put(policy);
879 dst->next = policy->bundles;
880 policy->bundles = dst;
882 write_unlock_bh(&policy->lock);
885 dst_release(dst_orig);
886 xfrm_pol_put(policy);
890 dst_release(dst_orig);
891 xfrm_pol_put(policy);
895 EXPORT_SYMBOL(xfrm_lookup);
897 /* When skb is transformed back to its "native" form, we have to
898 * check policy restrictions. At the moment we make this in maximally
899 * stupid way. Shame on me. :-) Of course, connected sockets must
900 * have policy cached at them.
904 xfrm_state_ok(struct xfrm_tmpl *tmpl, struct xfrm_state *x,
905 unsigned short family)
907 if (xfrm_state_kern(x))
908 return tmpl->optional && !xfrm_state_addr_cmp(tmpl, x, family);
909 return x->id.proto == tmpl->id.proto &&
910 (x->id.spi == tmpl->id.spi || !tmpl->id.spi) &&
911 (x->props.reqid == tmpl->reqid || !tmpl->reqid) &&
912 x->props.mode == tmpl->mode &&
913 (tmpl->aalgos & (1<<x->props.aalgo)) &&
914 !(x->props.mode && xfrm_state_addr_cmp(tmpl, x, family));
918 xfrm_policy_ok(struct xfrm_tmpl *tmpl, struct sec_path *sp, int start,
919 unsigned short family)
923 if (tmpl->optional) {
928 for (; idx < sp->len; idx++) {
929 if (xfrm_state_ok(tmpl, sp->x[idx].xvec, family))
931 if (sp->x[idx].xvec->props.mode)
938 _decode_session(struct sk_buff *skb, struct flowi *fl, unsigned short family)
940 struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
942 if (unlikely(afinfo == NULL))
943 return -EAFNOSUPPORT;
945 afinfo->decode_session(skb, fl);
946 xfrm_policy_put_afinfo(afinfo);
950 static inline int secpath_has_tunnel(struct sec_path *sp, int k)
952 for (; k < sp->len; k++) {
953 if (sp->x[k].xvec->props.mode)
960 int __xfrm_policy_check(struct sock *sk, int dir, struct sk_buff *skb,
961 unsigned short family)
963 struct xfrm_policy *pol;
966 if (_decode_session(skb, &fl, family) < 0)
969 /* First, check used SA against their selectors. */
973 for (i=skb->sp->len-1; i>=0; i--) {
974 struct sec_decap_state *xvec = &(skb->sp->x[i]);
975 if (!xfrm_selector_match(&xvec->xvec->sel, &fl, family))
978 /* If there is a post_input processor, try running it */
979 if (xvec->xvec->type->post_input &&
980 (xvec->xvec->type->post_input)(xvec->xvec,
988 if (sk && sk->sk_policy[dir])
989 pol = xfrm_sk_policy_lookup(sk, dir, &fl);
992 pol = flow_cache_lookup(&fl, family,
993 policy_to_flow_dir(dir),
997 return !skb->sp || !secpath_has_tunnel(skb->sp, 0);
999 pol->curlft.use_time = (unsigned long)xtime.tv_sec;
1001 if (pol->action == XFRM_POLICY_ALLOW) {
1002 struct sec_path *sp;
1003 static struct sec_path dummy;
1006 if ((sp = skb->sp) == NULL)
1009 /* For each tunnel xfrm, find the first matching tmpl.
1010 * For each tmpl before that, find corresponding xfrm.
1011 * Order is _important_. Later we will implement
1012 * some barriers, but at the moment barriers
1013 * are implied between each two transformations.
1015 for (i = pol->xfrm_nr-1, k = 0; i >= 0; i--) {
1016 k = xfrm_policy_ok(pol->xfrm_vec+i, sp, k, family);
1021 if (secpath_has_tunnel(sp, k))
1032 EXPORT_SYMBOL(__xfrm_policy_check);
1034 int __xfrm_route_forward(struct sk_buff *skb, unsigned short family)
1038 if (_decode_session(skb, &fl, family) < 0)
1041 return xfrm_lookup(&skb->dst, &fl, NULL, 0) == 0;
1043 EXPORT_SYMBOL(__xfrm_route_forward);
1045 static struct dst_entry *xfrm_dst_check(struct dst_entry *dst, u32 cookie)
1047 /* If it is marked obsolete, which is how we even get here,
1048 * then we have purged it from the policy bundle list and we
1049 * did that for a good reason.
1054 static int stale_bundle(struct dst_entry *dst)
1056 return !xfrm_bundle_ok((struct xfrm_dst *)dst, NULL, AF_UNSPEC);
1059 void xfrm_dst_ifdown(struct dst_entry *dst, struct net_device *dev)
1061 while ((dst = dst->child) && dst->xfrm && dst->dev == dev) {
1062 dst->dev = &loopback_dev;
1063 dev_hold(&loopback_dev);
1067 EXPORT_SYMBOL(xfrm_dst_ifdown);
1069 static void xfrm_link_failure(struct sk_buff *skb)
1071 /* Impossible. Such dst must be popped before reaches point of failure. */
1075 static struct dst_entry *xfrm_negative_advice(struct dst_entry *dst)
1078 if (dst->obsolete) {
1086 static void xfrm_prune_bundles(int (*func)(struct dst_entry *))
1089 struct xfrm_policy *pol;
1090 struct dst_entry *dst, **dstp, *gc_list = NULL;
1092 read_lock_bh(&xfrm_policy_lock);
1093 for (i=0; i<2*XFRM_POLICY_MAX; i++) {
1094 for (pol = xfrm_policy_list[i]; pol; pol = pol->next) {
1095 write_lock(&pol->lock);
1096 dstp = &pol->bundles;
1097 while ((dst=*dstp) != NULL) {
1100 dst->next = gc_list;
1106 write_unlock(&pol->lock);
1109 read_unlock_bh(&xfrm_policy_lock);
1113 gc_list = dst->next;
1118 static int unused_bundle(struct dst_entry *dst)
1120 return !atomic_read(&dst->__refcnt);
1123 static void __xfrm_garbage_collect(void)
1125 xfrm_prune_bundles(unused_bundle);
1128 int xfrm_flush_bundles(void)
1130 xfrm_prune_bundles(stale_bundle);
1134 static int always_true(struct dst_entry *dst)
1139 void xfrm_flush_all_bundles(void)
1141 xfrm_prune_bundles(always_true);
1144 void xfrm_init_pmtu(struct dst_entry *dst)
1147 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1148 u32 pmtu, route_mtu_cached;
1150 pmtu = dst_mtu(dst->child);
1151 xdst->child_mtu_cached = pmtu;
1153 pmtu = xfrm_state_mtu(dst->xfrm, pmtu);
1155 route_mtu_cached = dst_mtu(xdst->route);
1156 xdst->route_mtu_cached = route_mtu_cached;
1158 if (pmtu > route_mtu_cached)
1159 pmtu = route_mtu_cached;
1161 dst->metrics[RTAX_MTU-1] = pmtu;
1162 } while ((dst = dst->next));
1165 EXPORT_SYMBOL(xfrm_init_pmtu);
1167 /* Check that the bundle accepts the flow and its components are
1171 int xfrm_bundle_ok(struct xfrm_dst *first, struct flowi *fl, int family)
1173 struct dst_entry *dst = &first->u.dst;
1174 struct xfrm_dst *last;
1177 if (!dst_check(dst->path, ((struct xfrm_dst *)dst)->path_cookie) ||
1178 (dst->dev && !netif_running(dst->dev)))
1184 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
1186 if (fl && !xfrm_selector_match(&dst->xfrm->sel, fl, family))
1188 if (dst->xfrm->km.state != XFRM_STATE_VALID)
1191 mtu = dst_mtu(dst->child);
1192 if (xdst->child_mtu_cached != mtu) {
1194 xdst->child_mtu_cached = mtu;
1197 if (!dst_check(xdst->route, xdst->route_cookie))
1199 mtu = dst_mtu(xdst->route);
1200 if (xdst->route_mtu_cached != mtu) {
1202 xdst->route_mtu_cached = mtu;
1206 } while (dst->xfrm);
1211 mtu = last->child_mtu_cached;
1215 mtu = xfrm_state_mtu(dst->xfrm, mtu);
1216 if (mtu > last->route_mtu_cached)
1217 mtu = last->route_mtu_cached;
1218 dst->metrics[RTAX_MTU-1] = mtu;
1223 last = last->u.next;
1224 last->child_mtu_cached = mtu;
1230 EXPORT_SYMBOL(xfrm_bundle_ok);
1232 int xfrm_policy_register_afinfo(struct xfrm_policy_afinfo *afinfo)
1235 if (unlikely(afinfo == NULL))
1237 if (unlikely(afinfo->family >= NPROTO))
1238 return -EAFNOSUPPORT;
1239 write_lock(&xfrm_policy_afinfo_lock);
1240 if (unlikely(xfrm_policy_afinfo[afinfo->family] != NULL))
1243 struct dst_ops *dst_ops = afinfo->dst_ops;
1244 if (likely(dst_ops->kmem_cachep == NULL))
1245 dst_ops->kmem_cachep = xfrm_dst_cache;
1246 if (likely(dst_ops->check == NULL))
1247 dst_ops->check = xfrm_dst_check;
1248 if (likely(dst_ops->negative_advice == NULL))
1249 dst_ops->negative_advice = xfrm_negative_advice;
1250 if (likely(dst_ops->link_failure == NULL))
1251 dst_ops->link_failure = xfrm_link_failure;
1252 if (likely(afinfo->garbage_collect == NULL))
1253 afinfo->garbage_collect = __xfrm_garbage_collect;
1254 xfrm_policy_afinfo[afinfo->family] = afinfo;
1256 write_unlock(&xfrm_policy_afinfo_lock);
1259 EXPORT_SYMBOL(xfrm_policy_register_afinfo);
1261 int xfrm_policy_unregister_afinfo(struct xfrm_policy_afinfo *afinfo)
1264 if (unlikely(afinfo == NULL))
1266 if (unlikely(afinfo->family >= NPROTO))
1267 return -EAFNOSUPPORT;
1268 write_lock(&xfrm_policy_afinfo_lock);
1269 if (likely(xfrm_policy_afinfo[afinfo->family] != NULL)) {
1270 if (unlikely(xfrm_policy_afinfo[afinfo->family] != afinfo))
1273 struct dst_ops *dst_ops = afinfo->dst_ops;
1274 xfrm_policy_afinfo[afinfo->family] = NULL;
1275 dst_ops->kmem_cachep = NULL;
1276 dst_ops->check = NULL;
1277 dst_ops->negative_advice = NULL;
1278 dst_ops->link_failure = NULL;
1279 afinfo->garbage_collect = NULL;
1282 write_unlock(&xfrm_policy_afinfo_lock);
1285 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo);
1287 static struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family)
1289 struct xfrm_policy_afinfo *afinfo;
1290 if (unlikely(family >= NPROTO))
1292 read_lock(&xfrm_policy_afinfo_lock);
1293 afinfo = xfrm_policy_afinfo[family];
1294 if (likely(afinfo != NULL))
1295 read_lock(&afinfo->lock);
1296 read_unlock(&xfrm_policy_afinfo_lock);
1300 static void xfrm_policy_put_afinfo(struct xfrm_policy_afinfo *afinfo)
1302 if (unlikely(afinfo == NULL))
1304 read_unlock(&afinfo->lock);
1307 static int xfrm_dev_event(struct notifier_block *this, unsigned long event, void *ptr)
1311 xfrm_flush_bundles();
1316 static struct notifier_block xfrm_dev_notifier = {
1322 static void __init xfrm_policy_init(void)
1324 xfrm_dst_cache = kmem_cache_create("xfrm_dst_cache",
1325 sizeof(struct xfrm_dst),
1326 0, SLAB_HWCACHE_ALIGN,
1328 if (!xfrm_dst_cache)
1329 panic("XFRM: failed to allocate xfrm_dst_cache\n");
1331 INIT_WORK(&xfrm_policy_gc_work, xfrm_policy_gc_task, NULL);
1332 register_netdevice_notifier(&xfrm_dev_notifier);
1335 void __init xfrm_init(void)