net/xfrm/xfrm_policy.c

   1 // SPDX-License-Identifier: GPL-2.0-only
   2 /*
   3  * xfrm_policy.c
   4  *
   5  * Changes:
   6  *      Mitsuru KANDA @USAGI
   7  *      Kazunori MIYAZAWA @USAGI
   8  *      Kunihiro Ishiguro <kunihiro@ipinfusion.com>
   9  *              IPv6 support
  10  *      Kazunori MIYAZAWA @USAGI
  11  *      YOSHIFUJI Hideaki
  12  *              Split up af-specific portion
  13  *      Derek Atkins <derek@ihtfp.com>          Add the post_input processor
  14  *
  15  */
  16
  17 #include <linux/err.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/netfilter.h>
  26 #include <linux/module.h>
  27 #include <linux/cache.h>
  28 #include <linux/cpu.h>
  29 #include <linux/audit.h>
  30 #include <linux/rhashtable.h>
  31 #include <linux/if_tunnel.h>
  32 #include <net/dst.h>
  33 #include <net/flow.h>
  34 #include <net/inet_ecn.h>
  35 #include <net/xfrm.h>
  36 #include <net/ip.h>
  37 #include <net/gre.h>
  38 #if IS_ENABLED(CONFIG_IPV6_MIP6)
  39 #include <net/mip6.h>
  40 #endif
  41 #ifdef CONFIG_XFRM_STATISTICS
  42 #include <net/snmp.h>
  43 #endif
  44
  45 #include "xfrm_hash.h"
  46
  47 #define XFRM_QUEUE_TMO_MIN ((unsigned)(HZ/10))
  48 #define XFRM_QUEUE_TMO_MAX ((unsigned)(60*HZ))
  49 #define XFRM_MAX_QUEUE_LEN      100
  50
  51 struct xfrm_flo {
  52         struct dst_entry *dst_orig;
  53         u8 flags;
  54 };
  55
  56 /* prefixes smaller than this are stored in lists, not trees. */
  57 #define INEXACT_PREFIXLEN_IPV4  16
  58 #define INEXACT_PREFIXLEN_IPV6  48
  59
  60 struct xfrm_pol_inexact_node {
  61         struct rb_node node;
  62         union {
  63                 xfrm_address_t addr;
  64                 struct rcu_head rcu;
  65         };
  66         u8 prefixlen;
  67
  68         struct rb_root root;
  69
  70         /* the policies matching this node, can be empty list */
  71         struct hlist_head hhead;
  72 };
  73
  74 /* xfrm inexact policy search tree:
  75  * xfrm_pol_inexact_bin = hash(dir,type,family,if_id);
  76  *  |
  77  * +---- root_d: sorted by daddr:prefix
  78  * |                 |
  79  * |        xfrm_pol_inexact_node
  80  * |                 |
  81  * |                 +- root: sorted by saddr/prefix
  82  * |                 |              |
  83  * |                 |         xfrm_pol_inexact_node
  84  * |                 |              |
  85  * |                 |              + root: unused
  86  * |                 |              |
  87  * |                 |              + hhead: saddr:daddr policies
  88  * |                 |
  89  * |                 +- coarse policies and all any:daddr policies
  90  * |
  91  * +---- root_s: sorted by saddr:prefix
  92  * |                 |
  93  * |        xfrm_pol_inexact_node
  94  * |                 |
  95  * |                 + root: unused
  96  * |                 |
  97  * |                 + hhead: saddr:any policies
  98  * |
  99  * +---- coarse policies and all any:any policies
 100  *
 101  * Lookups return four candidate lists:
 102  * 1. any:any list from top-level xfrm_pol_inexact_bin
 103  * 2. any:daddr list from daddr tree
 104  * 3. saddr:daddr list from 2nd level daddr tree
 105  * 4. saddr:any list from saddr tree
 106  *
 107  * This result set then needs to be searched for the policy with
 108  * the lowest priority.  If two results have same prio, youngest one wins.
 109  */
 110
 111 struct xfrm_pol_inexact_key {
 112         possible_net_t net;
 113         u32 if_id;
 114         u16 family;
 115         u8 dir, type;
 116 };
 117
 118 struct xfrm_pol_inexact_bin {
 119         struct xfrm_pol_inexact_key k;
 120         struct rhash_head head;
 121         /* list containing '*:*' policies */
 122         struct hlist_head hhead;
 123
 124         seqcount_t count;
 125         /* tree sorted by daddr/prefix */
 126         struct rb_root root_d;
 127
 128         /* tree sorted by saddr/prefix */
 129         struct rb_root root_s;
 130
 131         /* slow path below */
 132         struct list_head inexact_bins;
 133         struct rcu_head rcu;
 134 };
 135
 136 enum xfrm_pol_inexact_candidate_type {
 137         XFRM_POL_CAND_BOTH,
 138         XFRM_POL_CAND_SADDR,
 139         XFRM_POL_CAND_DADDR,
 140         XFRM_POL_CAND_ANY,
 141
 142         XFRM_POL_CAND_MAX,
 143 };
 144
 145 struct xfrm_pol_inexact_candidates {
 146         struct hlist_head *res[XFRM_POL_CAND_MAX];
 147 };
 148
 149 static DEFINE_SPINLOCK(xfrm_if_cb_lock);
 150 static struct xfrm_if_cb const __rcu *xfrm_if_cb __read_mostly;
 151
 152 static DEFINE_SPINLOCK(xfrm_policy_afinfo_lock);
 153 static struct xfrm_policy_afinfo const __rcu *xfrm_policy_afinfo[AF_INET6 + 1]
 154                                                 __read_mostly;
 155
 156 static struct kmem_cache *xfrm_dst_cache __ro_after_init;
 157 static __read_mostly seqcount_t xfrm_policy_hash_generation;
 158
 159 static struct rhashtable xfrm_policy_inexact_table;
 160 static const struct rhashtable_params xfrm_pol_inexact_params;
 161
 162 static void xfrm_init_pmtu(struct xfrm_dst **bundle, int nr);
 163 static int stale_bundle(struct dst_entry *dst);
 164 static int xfrm_bundle_ok(struct xfrm_dst *xdst);
 165 static void xfrm_policy_queue_process(struct timer_list *t);
 166
 167 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir);
 168 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
 169                                                 int dir);
 170
 171 static struct xfrm_pol_inexact_bin *
 172 xfrm_policy_inexact_lookup(struct net *net, u8 type, u16 family, u8 dir,
 173                            u32 if_id);
 174
 175 static struct xfrm_pol_inexact_bin *
 176 xfrm_policy_inexact_lookup_rcu(struct net *net,
 177                                u8 type, u16 family, u8 dir, u32 if_id);
 178 static struct xfrm_policy *
 179 xfrm_policy_insert_list(struct hlist_head *chain, struct xfrm_policy *policy,
 180                         bool excl);
 181 static void xfrm_policy_insert_inexact_list(struct hlist_head *chain,
 182                                             struct xfrm_policy *policy);
 183
 184 static bool
 185 xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand,
 186                                     struct xfrm_pol_inexact_bin *b,
 187                                     const xfrm_address_t *saddr,
 188                                     const xfrm_address_t *daddr);
 189
 190 static inline bool xfrm_pol_hold_rcu(struct xfrm_policy *policy)
 191 {
 192         return refcount_inc_not_zero(&policy->refcnt);
 193 }
 194
 195 static inline bool
 196 __xfrm4_selector_match(const struct xfrm_selector *sel, const struct flowi *fl)
 197 {
 198         const struct flowi4 *fl4 = &fl->u.ip4;
 199
 200         return  addr4_match(fl4->daddr, sel->daddr.a4, sel->prefixlen_d) &&
 201                 addr4_match(fl4->saddr, sel->saddr.a4, sel->prefixlen_s) &&
 202                 !((xfrm_flowi_dport(fl, &fl4->uli) ^ sel->dport) & sel->dport_mask) &&
 203                 !((xfrm_flowi_sport(fl, &fl4->uli) ^ sel->sport) & sel->sport_mask) &&
 204                 (fl4->flowi4_proto == sel->proto || !sel->proto) &&
 205                 (fl4->flowi4_oif == sel->ifindex || !sel->ifindex);
 206 }
 207
 208 static inline bool
 209 __xfrm6_selector_match(const struct xfrm_selector *sel, const struct flowi *fl)
 210 {
 211         const struct flowi6 *fl6 = &fl->u.ip6;
 212
 213         return  addr_match(&fl6->daddr, &sel->daddr, sel->prefixlen_d) &&
 214                 addr_match(&fl6->saddr, &sel->saddr, sel->prefixlen_s) &&
 215                 !((xfrm_flowi_dport(fl, &fl6->uli) ^ sel->dport) & sel->dport_mask) &&
 216                 !((xfrm_flowi_sport(fl, &fl6->uli) ^ sel->sport) & sel->sport_mask) &&
 217                 (fl6->flowi6_proto == sel->proto || !sel->proto) &&
 218                 (fl6->flowi6_oif == sel->ifindex || !sel->ifindex);
 219 }
 220
 221 bool xfrm_selector_match(const struct xfrm_selector *sel, const struct flowi *fl,
 222                          unsigned short family)
 223 {
 224         switch (family) {
 225         case AF_INET:
 226                 return __xfrm4_selector_match(sel, fl);
 227         case AF_INET6:
 228                 return __xfrm6_selector_match(sel, fl);
 229         }
 230         return false;
 231 }
 232
 233 static const struct xfrm_policy_afinfo *xfrm_policy_get_afinfo(unsigned short family)
 234 {
 235         const struct xfrm_policy_afinfo *afinfo;
 236
 237         if (unlikely(family >= ARRAY_SIZE(xfrm_policy_afinfo)))
 238                 return NULL;
 239         rcu_read_lock();
 240         afinfo = rcu_dereference(xfrm_policy_afinfo[family]);
 241         if (unlikely(!afinfo))
 242                 rcu_read_unlock();
 243         return afinfo;
 244 }
 245
 246 /* Called with rcu_read_lock(). */
 247 static const struct xfrm_if_cb *xfrm_if_get_cb(void)
 248 {
 249         return rcu_dereference(xfrm_if_cb);
 250 }
 251
 252 struct dst_entry *__xfrm_dst_lookup(struct net *net, int tos, int oif,
 253                                     const xfrm_address_t *saddr,
 254                                     const xfrm_address_t *daddr,
 255                                     int family, u32 mark)
 256 {
 257         const struct xfrm_policy_afinfo *afinfo;
 258         struct dst_entry *dst;
 259
 260         afinfo = xfrm_policy_get_afinfo(family);
 261         if (unlikely(afinfo == NULL))
 262                 return ERR_PTR(-EAFNOSUPPORT);
 263
 264         dst = afinfo->dst_lookup(net, tos, oif, saddr, daddr, mark);
 265
 266         rcu_read_unlock();
 267
 268         return dst;
 269 }
 270 EXPORT_SYMBOL(__xfrm_dst_lookup);
 271
 272 static inline struct dst_entry *xfrm_dst_lookup(struct xfrm_state *x,
 273                                                 int tos, int oif,
 274                                                 xfrm_address_t *prev_saddr,
 275                                                 xfrm_address_t *prev_daddr,
 276                                                 int family, u32 mark)
 277 {
 278         struct net *net = xs_net(x);
 279         xfrm_address_t *saddr = &x->props.saddr;
 280         xfrm_address_t *daddr = &x->id.daddr;
 281         struct dst_entry *dst;
 282
 283         if (x->type->flags & XFRM_TYPE_LOCAL_COADDR) {
 284                 saddr = x->coaddr;
 285                 daddr = prev_daddr;
 286         }
 287         if (x->type->flags & XFRM_TYPE_REMOTE_COADDR) {
 288                 saddr = prev_saddr;
 289                 daddr = x->coaddr;
 290         }
 291
 292         dst = __xfrm_dst_lookup(net, tos, oif, saddr, daddr, family, mark);
 293
 294         if (!IS_ERR(dst)) {
 295                 if (prev_saddr != saddr)
 296                         memcpy(prev_saddr, saddr,  sizeof(*prev_saddr));
 297                 if (prev_daddr != daddr)
 298                         memcpy(prev_daddr, daddr,  sizeof(*prev_daddr));
 299         }
 300
 301         return dst;
 302 }
 303
 304 static inline unsigned long make_jiffies(long secs)
 305 {
 306         if (secs >= (MAX_SCHEDULE_TIMEOUT-1)/HZ)
 307                 return MAX_SCHEDULE_TIMEOUT-1;
 308         else
 309                 return secs*HZ;
 310 }
 311
 312 static void xfrm_policy_timer(struct timer_list *t)
 313 {
 314         struct xfrm_policy *xp = from_timer(xp, t, timer);
 315         time64_t now = ktime_get_real_seconds();
 316         time64_t next = TIME64_MAX;
 317         int warn = 0;
 318         int dir;
 319
 320         read_lock(&xp->lock);
 321
 322         if (unlikely(xp->walk.dead))
 323                 goto out;
 324
 325         dir = xfrm_policy_id2dir(xp->index);
 326
 327         if (xp->lft.hard_add_expires_seconds) {
 328                 time64_t tmo = xp->lft.hard_add_expires_seconds +
 329                         xp->curlft.add_time - now;
 330                 if (tmo <= 0)
 331                         goto expired;
 332                 if (tmo < next)
 333                         next = tmo;
 334         }
 335         if (xp->lft.hard_use_expires_seconds) {
 336                 time64_t tmo = xp->lft.hard_use_expires_seconds +
 337                         (xp->curlft.use_time ? : xp->curlft.add_time) - now;
 338                 if (tmo <= 0)
 339                         goto expired;
 340                 if (tmo < next)
 341                         next = tmo;
 342         }
 343         if (xp->lft.soft_add_expires_seconds) {
 344                 time64_t tmo = xp->lft.soft_add_expires_seconds +
 345                         xp->curlft.add_time - now;
 346                 if (tmo <= 0) {
 347                         warn = 1;
 348                         tmo = XFRM_KM_TIMEOUT;
 349                 }
 350                 if (tmo < next)
 351                         next = tmo;
 352         }
 353         if (xp->lft.soft_use_expires_seconds) {
 354                 time64_t tmo = xp->lft.soft_use_expires_seconds +
 355                         (xp->curlft.use_time ? : xp->curlft.add_time) - now;
 356                 if (tmo <= 0) {
 357                         warn = 1;
 358                         tmo = XFRM_KM_TIMEOUT;
 359                 }
 360                 if (tmo < next)
 361                         next = tmo;
 362         }
 363
 364         if (warn)
 365                 km_policy_expired(xp, dir, 0, 0);
 366         if (next != TIME64_MAX &&
 367             !mod_timer(&xp->timer, jiffies + make_jiffies(next)))
 368                 xfrm_pol_hold(xp);
 369
 370 out:
 371         read_unlock(&xp->lock);
 372         xfrm_pol_put(xp);
 373         return;
 374
 375 expired:
 376         read_unlock(&xp->lock);
 377         if (!xfrm_policy_delete(xp, dir))
 378                 km_policy_expired(xp, dir, 1, 0);
 379         xfrm_pol_put(xp);
 380 }
 381
 382 /* Allocate xfrm_policy. Not used here, it is supposed to be used by pfkeyv2
 383  * SPD calls.
 384  */
 385
 386 struct xfrm_policy *xfrm_policy_alloc(struct net *net, gfp_t gfp)
 387 {
 388         struct xfrm_policy *policy;
 389
 390         policy = kzalloc(sizeof(struct xfrm_policy), gfp);
 391
 392         if (policy) {
 393                 write_pnet(&policy->xp_net, net);
 394                 INIT_LIST_HEAD(&policy->walk.all);
 395                 INIT_HLIST_NODE(&policy->bydst_inexact_list);
 396                 INIT_HLIST_NODE(&policy->bydst);
 397                 INIT_HLIST_NODE(&policy->byidx);
 398                 rwlock_init(&policy->lock);
 399                 refcount_set(&policy->refcnt, 1);
 400                 skb_queue_head_init(&policy->polq.hold_queue);
 401                 timer_setup(&policy->timer, xfrm_policy_timer, 0);
 402                 timer_setup(&policy->polq.hold_timer,
 403                             xfrm_policy_queue_process, 0);
 404         }
 405         return policy;
 406 }
 407 EXPORT_SYMBOL(xfrm_policy_alloc);
 408
 409 static void xfrm_policy_destroy_rcu(struct rcu_head *head)
 410 {
 411         struct xfrm_policy *policy = container_of(head, struct xfrm_policy, rcu);
 412
 413         security_xfrm_policy_free(policy->security);
 414         kfree(policy);
 415 }
 416
 417 /* Destroy xfrm_policy: descendant resources must be released to this moment. */
 418
 419 void xfrm_policy_destroy(struct xfrm_policy *policy)
 420 {
 421         BUG_ON(!policy->walk.dead);
 422
 423         if (del_timer(&policy->timer) || del_timer(&policy->polq.hold_timer))
 424                 BUG();
 425
 426         call_rcu(&policy->rcu, xfrm_policy_destroy_rcu);
 427 }
 428 EXPORT_SYMBOL(xfrm_policy_destroy);
 429
 430 /* Rule must be locked. Release descendant resources, announce
 431  * entry dead. The rule must be unlinked from lists to the moment.
 432  */
 433
 434 static void xfrm_policy_kill(struct xfrm_policy *policy)
 435 {
 436         write_lock_bh(&policy->lock);
 437         policy->walk.dead = 1;
 438         write_unlock_bh(&policy->lock);
 439
 440         atomic_inc(&policy->genid);
 441
 442         if (del_timer(&policy->polq.hold_timer))
 443                 xfrm_pol_put(policy);
 444         skb_queue_purge(&policy->polq.hold_queue);
 445
 446         if (del_timer(&policy->timer))
 447                 xfrm_pol_put(policy);
 448
 449         xfrm_pol_put(policy);
 450 }
 451
 452 static unsigned int xfrm_policy_hashmax __read_mostly = 1 * 1024 * 1024;
 453
 454 static inline unsigned int idx_hash(struct net *net, u32 index)
 455 {
 456         return __idx_hash(index, net->xfrm.policy_idx_hmask);
 457 }
 458
 459 /* calculate policy hash thresholds */
 460 static void __get_hash_thresh(struct net *net,
 461                               unsigned short family, int dir,
 462                               u8 *dbits, u8 *sbits)
 463 {
 464         switch (family) {
 465         case AF_INET:
 466                 *dbits = net->xfrm.policy_bydst[dir].dbits4;
 467                 *sbits = net->xfrm.policy_bydst[dir].sbits4;
 468                 break;
 469
 470         case AF_INET6:
 471                 *dbits = net->xfrm.policy_bydst[dir].dbits6;
 472                 *sbits = net->xfrm.policy_bydst[dir].sbits6;
 473                 break;
 474
 475         default:
 476                 *dbits = 0;
 477                 *sbits = 0;
 478         }
 479 }
 480
 481 static struct hlist_head *policy_hash_bysel(struct net *net,
 482                                             const struct xfrm_selector *sel,
 483                                             unsigned short family, int dir)
 484 {
 485         unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
 486         unsigned int hash;
 487         u8 dbits;
 488         u8 sbits;
 489
 490         __get_hash_thresh(net, family, dir, &dbits, &sbits);
 491         hash = __sel_hash(sel, family, hmask, dbits, sbits);
 492
 493         if (hash == hmask + 1)
 494                 return NULL;
 495
 496         return rcu_dereference_check(net->xfrm.policy_bydst[dir].table,
 497                      lockdep_is_held(&net->xfrm.xfrm_policy_lock)) + hash;
 498 }
 499
 500 static struct hlist_head *policy_hash_direct(struct net *net,
 501                                              const xfrm_address_t *daddr,
 502                                              const xfrm_address_t *saddr,
 503                                              unsigned short family, int dir)
 504 {
 505         unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
 506         unsigned int hash;
 507         u8 dbits;
 508         u8 sbits;
 509
 510         __get_hash_thresh(net, family, dir, &dbits, &sbits);
 511         hash = __addr_hash(daddr, saddr, family, hmask, dbits, sbits);
 512
 513         return rcu_dereference_check(net->xfrm.policy_bydst[dir].table,
 514                      lockdep_is_held(&net->xfrm.xfrm_policy_lock)) + hash;
 515 }
 516
 517 static void xfrm_dst_hash_transfer(struct net *net,
 518                                    struct hlist_head *list,
 519                                    struct hlist_head *ndsttable,
 520                                    unsigned int nhashmask,
 521                                    int dir)
 522 {
 523         struct hlist_node *tmp, *entry0 = NULL;
 524         struct xfrm_policy *pol;
 525         unsigned int h0 = 0;
 526         u8 dbits;
 527         u8 sbits;
 528
 529 redo:
 530         hlist_for_each_entry_safe(pol, tmp, list, bydst) {
 531                 unsigned int h;
 532
 533                 __get_hash_thresh(net, pol->family, dir, &dbits, &sbits);
 534                 h = __addr_hash(&pol->selector.daddr, &pol->selector.saddr,
 535                                 pol->family, nhashmask, dbits, sbits);
 536                 if (!entry0) {
 537                         hlist_del_rcu(&pol->bydst);
 538                         hlist_add_head_rcu(&pol->bydst, ndsttable + h);
 539                         h0 = h;
 540                 } else {
 541                         if (h != h0)
 542                                 continue;
 543                         hlist_del_rcu(&pol->bydst);
 544                         hlist_add_behind_rcu(&pol->bydst, entry0);
 545                 }
 546                 entry0 = &pol->bydst;
 547         }
 548         if (!hlist_empty(list)) {
 549                 entry0 = NULL;
 550                 goto redo;
 551         }
 552 }
 553
 554 static void xfrm_idx_hash_transfer(struct hlist_head *list,
 555                                    struct hlist_head *nidxtable,
 556                                    unsigned int nhashmask)
 557 {
 558         struct hlist_node *tmp;
 559         struct xfrm_policy *pol;
 560
 561         hlist_for_each_entry_safe(pol, tmp, list, byidx) {
 562                 unsigned int h;
 563
 564                 h = __idx_hash(pol->index, nhashmask);
 565                 hlist_add_head(&pol->byidx, nidxtable+h);
 566         }
 567 }
 568
 569 static unsigned long xfrm_new_hash_mask(unsigned int old_hmask)
 570 {
 571         return ((old_hmask + 1) << 1) - 1;
 572 }
 573
 574 static void xfrm_bydst_resize(struct net *net, int dir)
 575 {
 576         unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
 577         unsigned int nhashmask = xfrm_new_hash_mask(hmask);
 578         unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
 579         struct hlist_head *ndst = xfrm_hash_alloc(nsize);
 580         struct hlist_head *odst;
 581         int i;
 582
 583         if (!ndst)
 584                 return;
 585
 586         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
 587         write_seqcount_begin(&xfrm_policy_hash_generation);
 588
 589         odst = rcu_dereference_protected(net->xfrm.policy_bydst[dir].table,
 590                                 lockdep_is_held(&net->xfrm.xfrm_policy_lock));
 591
 592         for (i = hmask; i >= 0; i--)
 593                 xfrm_dst_hash_transfer(net, odst + i, ndst, nhashmask, dir);
 594
 595         rcu_assign_pointer(net->xfrm.policy_bydst[dir].table, ndst);
 596         net->xfrm.policy_bydst[dir].hmask = nhashmask;
 597
 598         write_seqcount_end(&xfrm_policy_hash_generation);
 599         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
 600
 601         synchronize_rcu();
 602
 603         xfrm_hash_free(odst, (hmask + 1) * sizeof(struct hlist_head));
 604 }
 605
 606 static void xfrm_byidx_resize(struct net *net, int total)
 607 {
 608         unsigned int hmask = net->xfrm.policy_idx_hmask;
 609         unsigned int nhashmask = xfrm_new_hash_mask(hmask);
 610         unsigned int nsize = (nhashmask + 1) * sizeof(struct hlist_head);
 611         struct hlist_head *oidx = net->xfrm.policy_byidx;
 612         struct hlist_head *nidx = xfrm_hash_alloc(nsize);
 613         int i;
 614
 615         if (!nidx)
 616                 return;
 617
 618         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
 619
 620         for (i = hmask; i >= 0; i--)
 621                 xfrm_idx_hash_transfer(oidx + i, nidx, nhashmask);
 622
 623         net->xfrm.policy_byidx = nidx;
 624         net->xfrm.policy_idx_hmask = nhashmask;
 625
 626         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
 627
 628         xfrm_hash_free(oidx, (hmask + 1) * sizeof(struct hlist_head));
 629 }
 630
 631 static inline int xfrm_bydst_should_resize(struct net *net, int dir, int *total)
 632 {
 633         unsigned int cnt = net->xfrm.policy_count[dir];
 634         unsigned int hmask = net->xfrm.policy_bydst[dir].hmask;
 635
 636         if (total)
 637                 *total += cnt;
 638
 639         if ((hmask + 1) < xfrm_policy_hashmax &&
 640             cnt > hmask)
 641                 return 1;
 642
 643         return 0;
 644 }
 645
 646 static inline int xfrm_byidx_should_resize(struct net *net, int total)
 647 {
 648         unsigned int hmask = net->xfrm.policy_idx_hmask;
 649
 650         if ((hmask + 1) < xfrm_policy_hashmax &&
 651             total > hmask)
 652                 return 1;
 653
 654         return 0;
 655 }
 656
 657 void xfrm_spd_getinfo(struct net *net, struct xfrmk_spdinfo *si)
 658 {
 659         si->incnt = net->xfrm.policy_count[XFRM_POLICY_IN];
 660         si->outcnt = net->xfrm.policy_count[XFRM_POLICY_OUT];
 661         si->fwdcnt = net->xfrm.policy_count[XFRM_POLICY_FWD];
 662         si->inscnt = net->xfrm.policy_count[XFRM_POLICY_IN+XFRM_POLICY_MAX];
 663         si->outscnt = net->xfrm.policy_count[XFRM_POLICY_OUT+XFRM_POLICY_MAX];
 664         si->fwdscnt = net->xfrm.policy_count[XFRM_POLICY_FWD+XFRM_POLICY_MAX];
 665         si->spdhcnt = net->xfrm.policy_idx_hmask;
 666         si->spdhmcnt = xfrm_policy_hashmax;
 667 }
 668 EXPORT_SYMBOL(xfrm_spd_getinfo);
 669
 670 static DEFINE_MUTEX(hash_resize_mutex);
 671 static void xfrm_hash_resize(struct work_struct *work)
 672 {
 673         struct net *net = container_of(work, struct net, xfrm.policy_hash_work);
 674         int dir, total;
 675
 676         mutex_lock(&hash_resize_mutex);
 677
 678         total = 0;
 679         for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
 680                 if (xfrm_bydst_should_resize(net, dir, &total))
 681                         xfrm_bydst_resize(net, dir);
 682         }
 683         if (xfrm_byidx_should_resize(net, total))
 684                 xfrm_byidx_resize(net, total);
 685
 686         mutex_unlock(&hash_resize_mutex);
 687 }
 688
 689 /* Make sure *pol can be inserted into fastbin.
 690  * Useful to check that later insert requests will be sucessful
 691  * (provided xfrm_policy_lock is held throughout).
 692  */
 693 static struct xfrm_pol_inexact_bin *
 694 xfrm_policy_inexact_alloc_bin(const struct xfrm_policy *pol, u8 dir)
 695 {
 696         struct xfrm_pol_inexact_bin *bin, *prev;
 697         struct xfrm_pol_inexact_key k = {
 698                 .family = pol->family,
 699                 .type = pol->type,
 700                 .dir = dir,
 701                 .if_id = pol->if_id,
 702         };
 703         struct net *net = xp_net(pol);
 704
 705         lockdep_assert_held(&net->xfrm.xfrm_policy_lock);
 706
 707         write_pnet(&k.net, net);
 708         bin = rhashtable_lookup_fast(&xfrm_policy_inexact_table, &k,
 709                                      xfrm_pol_inexact_params);
 710         if (bin)
 711                 return bin;
 712
 713         bin = kzalloc(sizeof(*bin), GFP_ATOMIC);
 714         if (!bin)
 715                 return NULL;
 716
 717         bin->k = k;
 718         INIT_HLIST_HEAD(&bin->hhead);
 719         bin->root_d = RB_ROOT;
 720         bin->root_s = RB_ROOT;
 721         seqcount_init(&bin->count);
 722
 723         prev = rhashtable_lookup_get_insert_key(&xfrm_policy_inexact_table,
 724                                                 &bin->k, &bin->head,
 725                                                 xfrm_pol_inexact_params);
 726         if (!prev) {
 727                 list_add(&bin->inexact_bins, &net->xfrm.inexact_bins);
 728                 return bin;
 729         }
 730
 731         kfree(bin);
 732
 733         return IS_ERR(prev) ? NULL : prev;
 734 }
 735
 736 static bool xfrm_pol_inexact_addr_use_any_list(const xfrm_address_t *addr,
 737                                                int family, u8 prefixlen)
 738 {
 739         if (xfrm_addr_any(addr, family))
 740                 return true;
 741
 742         if (family == AF_INET6 && prefixlen < INEXACT_PREFIXLEN_IPV6)
 743                 return true;
 744
 745         if (family == AF_INET && prefixlen < INEXACT_PREFIXLEN_IPV4)
 746                 return true;
 747
 748         return false;
 749 }
 750
 751 static bool
 752 xfrm_policy_inexact_insert_use_any_list(const struct xfrm_policy *policy)
 753 {
 754         const xfrm_address_t *addr;
 755         bool saddr_any, daddr_any;
 756         u8 prefixlen;
 757
 758         addr = &policy->selector.saddr;
 759         prefixlen = policy->selector.prefixlen_s;
 760
 761         saddr_any = xfrm_pol_inexact_addr_use_any_list(addr,
 762                                                        policy->family,
 763                                                        prefixlen);
 764         addr = &policy->selector.daddr;
 765         prefixlen = policy->selector.prefixlen_d;
 766         daddr_any = xfrm_pol_inexact_addr_use_any_list(addr,
 767                                                        policy->family,
 768                                                        prefixlen);
 769         return saddr_any && daddr_any;
 770 }
 771
 772 static void xfrm_pol_inexact_node_init(struct xfrm_pol_inexact_node *node,
 773                                        const xfrm_address_t *addr, u8 prefixlen)
 774 {
 775         node->addr = *addr;
 776         node->prefixlen = prefixlen;
 777 }
 778
 779 static struct xfrm_pol_inexact_node *
 780 xfrm_pol_inexact_node_alloc(const xfrm_address_t *addr, u8 prefixlen)
 781 {
 782         struct xfrm_pol_inexact_node *node;
 783
 784         node = kzalloc(sizeof(*node), GFP_ATOMIC);
 785         if (node)
 786                 xfrm_pol_inexact_node_init(node, addr, prefixlen);
 787
 788         return node;
 789 }
 790
 791 static int xfrm_policy_addr_delta(const xfrm_address_t *a,
 792                                   const xfrm_address_t *b,
 793                                   u8 prefixlen, u16 family)
 794 {
 795         u32 ma, mb, mask;
 796         unsigned int pdw, pbi;
 797         int delta = 0;
 798
 799         switch (family) {
 800         case AF_INET:
 801                 if (prefixlen == 0)
 802                         return 0;
 803                 mask = ~0U << (32 - prefixlen);
 804                 ma = ntohl(a->a4) & mask;
 805                 mb = ntohl(b->a4) & mask;
 806                 if (ma < mb)
 807                         delta = -1;
 808                 else if (ma > mb)
 809                         delta = 1;
 810                 break;
 811         case AF_INET6:
 812                 pdw = prefixlen >> 5;
 813                 pbi = prefixlen & 0x1f;
 814
 815                 if (pdw) {
 816                         delta = memcmp(a->a6, b->a6, pdw << 2);
 817                         if (delta)
 818                                 return delta;
 819                 }
 820                 if (pbi) {
 821                         mask = ~0U << (32 - pbi);
 822                         ma = ntohl(a->a6[pdw]) & mask;
 823                         mb = ntohl(b->a6[pdw]) & mask;
 824                         if (ma < mb)
 825                                 delta = -1;
 826                         else if (ma > mb)
 827                                 delta = 1;
 828                 }
 829                 break;
 830         default:
 831                 break;
 832         }
 833
 834         return delta;
 835 }
 836
 837 static void xfrm_policy_inexact_list_reinsert(struct net *net,
 838                                               struct xfrm_pol_inexact_node *n,
 839                                               u16 family)
 840 {
 841         unsigned int matched_s, matched_d;
 842         struct xfrm_policy *policy, *p;
 843
 844         matched_s = 0;
 845         matched_d = 0;
 846
 847         list_for_each_entry_reverse(policy, &net->xfrm.policy_all, walk.all) {
 848                 struct hlist_node *newpos = NULL;
 849                 bool matches_s, matches_d;
 850
 851                 if (!policy->bydst_reinsert)
 852                         continue;
 853
 854                 WARN_ON_ONCE(policy->family != family);
 855
 856                 policy->bydst_reinsert = false;
 857                 hlist_for_each_entry(p, &n->hhead, bydst) {
 858                         if (policy->priority > p->priority)
 859                                 newpos = &p->bydst;
 860                         else if (policy->priority == p->priority &&
 861                                  policy->pos > p->pos)
 862                                 newpos = &p->bydst;
 863                         else
 864                                 break;
 865                 }
 866
 867                 if (newpos)
 868                         hlist_add_behind_rcu(&policy->bydst, newpos);
 869                 else
 870                         hlist_add_head_rcu(&policy->bydst, &n->hhead);
 871
 872                 /* paranoia checks follow.
 873                  * Check that the reinserted policy matches at least
 874                  * saddr or daddr for current node prefix.
 875                  *
 876                  * Matching both is fine, matching saddr in one policy
 877                  * (but not daddr) and then matching only daddr in another
 878                  * is a bug.
 879                  */
 880                 matches_s = xfrm_policy_addr_delta(&policy->selector.saddr,
 881                                                    &n->addr,
 882                                                    n->prefixlen,
 883                                                    family) == 0;
 884                 matches_d = xfrm_policy_addr_delta(&policy->selector.daddr,
 885                                                    &n->addr,
 886                                                    n->prefixlen,
 887                                                    family) == 0;
 888                 if (matches_s && matches_d)
 889                         continue;
 890
 891                 WARN_ON_ONCE(!matches_s && !matches_d);
 892                 if (matches_s)
 893                         matched_s++;
 894                 if (matches_d)
 895                         matched_d++;
 896                 WARN_ON_ONCE(matched_s && matched_d);
 897         }
 898 }
 899
 900 static void xfrm_policy_inexact_node_reinsert(struct net *net,
 901                                               struct xfrm_pol_inexact_node *n,
 902                                               struct rb_root *new,
 903                                               u16 family)
 904 {
 905         struct xfrm_pol_inexact_node *node;
 906         struct rb_node **p, *parent;
 907
 908         /* we should not have another subtree here */
 909         WARN_ON_ONCE(!RB_EMPTY_ROOT(&n->root));
 910 restart:
 911         parent = NULL;
 912         p = &new->rb_node;
 913         while (*p) {
 914                 u8 prefixlen;
 915                 int delta;
 916
 917                 parent = *p;
 918                 node = rb_entry(*p, struct xfrm_pol_inexact_node, node);
 919
 920                 prefixlen = min(node->prefixlen, n->prefixlen);
 921
 922                 delta = xfrm_policy_addr_delta(&n->addr, &node->addr,
 923                                                prefixlen, family);
 924                 if (delta < 0) {
 925                         p = &parent->rb_left;
 926                 } else if (delta > 0) {
 927                         p = &parent->rb_right;
 928                 } else {
 929                         bool same_prefixlen = node->prefixlen == n->prefixlen;
 930                         struct xfrm_policy *tmp;
 931
 932                         hlist_for_each_entry(tmp, &n->hhead, bydst) {
 933                                 tmp->bydst_reinsert = true;
 934                                 hlist_del_rcu(&tmp->bydst);
 935                         }
 936
 937                         node->prefixlen = prefixlen;
 938
 939                         xfrm_policy_inexact_list_reinsert(net, node, family);
 940
 941                         if (same_prefixlen) {
 942                                 kfree_rcu(n, rcu);
 943                                 return;
 944                         }
 945
 946                         rb_erase(*p, new);
 947                         kfree_rcu(n, rcu);
 948                         n = node;
 949                         goto restart;
 950                 }
 951         }
 952
 953         rb_link_node_rcu(&n->node, parent, p);
 954         rb_insert_color(&n->node, new);
 955 }
 956
 957 /* merge nodes v and n */
 958 static void xfrm_policy_inexact_node_merge(struct net *net,
 959                                            struct xfrm_pol_inexact_node *v,
 960                                            struct xfrm_pol_inexact_node *n,
 961                                            u16 family)
 962 {
 963         struct xfrm_pol_inexact_node *node;
 964         struct xfrm_policy *tmp;
 965         struct rb_node *rnode;
 966
 967         /* To-be-merged node v has a subtree.
 968          *
 969          * Dismantle it and insert its nodes to n->root.
 970          */
 971         while ((rnode = rb_first(&v->root)) != NULL) {
 972                 node = rb_entry(rnode, struct xfrm_pol_inexact_node, node);
 973                 rb_erase(&node->node, &v->root);
 974                 xfrm_policy_inexact_node_reinsert(net, node, &n->root,
 975                                                   family);
 976         }
 977
 978         hlist_for_each_entry(tmp, &v->hhead, bydst) {
 979                 tmp->bydst_reinsert = true;
 980                 hlist_del_rcu(&tmp->bydst);
 981         }
 982
 983         xfrm_policy_inexact_list_reinsert(net, n, family);
 984 }
 985
 986 static struct xfrm_pol_inexact_node *
 987 xfrm_policy_inexact_insert_node(struct net *net,
 988                                 struct rb_root *root,
 989                                 xfrm_address_t *addr,
 990                                 u16 family, u8 prefixlen, u8 dir)
 991 {
 992         struct xfrm_pol_inexact_node *cached = NULL;
 993         struct rb_node **p, *parent = NULL;
 994         struct xfrm_pol_inexact_node *node;
 995
 996         p = &root->rb_node;
 997         while (*p) {
 998                 int delta;
 999
1000                 parent = *p;
1001                 node = rb_entry(*p, struct xfrm_pol_inexact_node, node);
1002
1003                 delta = xfrm_policy_addr_delta(addr, &node->addr,
1004                                                node->prefixlen,
1005                                                family);
1006                 if (delta == 0 && prefixlen >= node->prefixlen) {
1007                         WARN_ON_ONCE(cached); /* ipsec policies got lost */
1008                         return node;
1009                 }
1010
1011                 if (delta < 0)
1012                         p = &parent->rb_left;
1013                 else
1014                         p = &parent->rb_right;
1015
1016                 if (prefixlen < node->prefixlen) {
1017                         delta = xfrm_policy_addr_delta(addr, &node->addr,
1018                                                        prefixlen,
1019                                                        family);
1020                         if (delta)
1021                                 continue;
1022
1023                         /* This node is a subnet of the new prefix. It needs
1024                          * to be removed and re-inserted with the smaller
1025                          * prefix and all nodes that are now also covered
1026                          * by the reduced prefixlen.
1027                          */
1028                         rb_erase(&node->node, root);
1029
1030                         if (!cached) {
1031                                 xfrm_pol_inexact_node_init(node, addr,
1032                                                            prefixlen);
1033                                 cached = node;
1034                         } else {
1035                                 /* This node also falls within the new
1036                                  * prefixlen. Merge the to-be-reinserted
1037                                  * node and this one.
1038                                  */
1039                                 xfrm_policy_inexact_node_merge(net, node,
1040                                                                cached, family);
1041                                 kfree_rcu(node, rcu);
1042                         }
1043
1044                         /* restart */
1045                         p = &root->rb_node;
1046                         parent = NULL;
1047                 }
1048         }
1049
1050         node = cached;
1051         if (!node) {
1052                 node = xfrm_pol_inexact_node_alloc(addr, prefixlen);
1053                 if (!node)
1054                         return NULL;
1055         }
1056
1057         rb_link_node_rcu(&node->node, parent, p);
1058         rb_insert_color(&node->node, root);
1059
1060         return node;
1061 }
1062
1063 static void xfrm_policy_inexact_gc_tree(struct rb_root *r, bool rm)
1064 {
1065         struct xfrm_pol_inexact_node *node;
1066         struct rb_node *rn = rb_first(r);
1067
1068         while (rn) {
1069                 node = rb_entry(rn, struct xfrm_pol_inexact_node, node);
1070
1071                 xfrm_policy_inexact_gc_tree(&node->root, rm);
1072                 rn = rb_next(rn);
1073
1074                 if (!hlist_empty(&node->hhead) || !RB_EMPTY_ROOT(&node->root)) {
1075                         WARN_ON_ONCE(rm);
1076                         continue;
1077                 }
1078
1079                 rb_erase(&node->node, r);
1080                 kfree_rcu(node, rcu);
1081         }
1082 }
1083
1084 static void __xfrm_policy_inexact_prune_bin(struct xfrm_pol_inexact_bin *b, bool net_exit)
1085 {
1086         write_seqcount_begin(&b->count);
1087         xfrm_policy_inexact_gc_tree(&b->root_d, net_exit);
1088         xfrm_policy_inexact_gc_tree(&b->root_s, net_exit);
1089         write_seqcount_end(&b->count);
1090
1091         if (!RB_EMPTY_ROOT(&b->root_d) || !RB_EMPTY_ROOT(&b->root_s) ||
1092             !hlist_empty(&b->hhead)) {
1093                 WARN_ON_ONCE(net_exit);
1094                 return;
1095         }
1096
1097         if (rhashtable_remove_fast(&xfrm_policy_inexact_table, &b->head,
1098                                    xfrm_pol_inexact_params) == 0) {
1099                 list_del(&b->inexact_bins);
1100                 kfree_rcu(b, rcu);
1101         }
1102 }
1103
1104 static void xfrm_policy_inexact_prune_bin(struct xfrm_pol_inexact_bin *b)
1105 {
1106         struct net *net = read_pnet(&b->k.net);
1107
1108         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1109         __xfrm_policy_inexact_prune_bin(b, false);
1110         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1111 }
1112
1113 static void __xfrm_policy_inexact_flush(struct net *net)
1114 {
1115         struct xfrm_pol_inexact_bin *bin, *t;
1116
1117         lockdep_assert_held(&net->xfrm.xfrm_policy_lock);
1118
1119         list_for_each_entry_safe(bin, t, &net->xfrm.inexact_bins, inexact_bins)
1120                 __xfrm_policy_inexact_prune_bin(bin, false);
1121 }
1122
1123 static struct hlist_head *
1124 xfrm_policy_inexact_alloc_chain(struct xfrm_pol_inexact_bin *bin,
1125                                 struct xfrm_policy *policy, u8 dir)
1126 {
1127         struct xfrm_pol_inexact_node *n;
1128         struct net *net;
1129
1130         net = xp_net(policy);
1131         lockdep_assert_held(&net->xfrm.xfrm_policy_lock);
1132
1133         if (xfrm_policy_inexact_insert_use_any_list(policy))
1134                 return &bin->hhead;
1135
1136         if (xfrm_pol_inexact_addr_use_any_list(&policy->selector.daddr,
1137                                                policy->family,
1138                                                policy->selector.prefixlen_d)) {
1139                 write_seqcount_begin(&bin->count);
1140                 n = xfrm_policy_inexact_insert_node(net,
1141                                                     &bin->root_s,
1142                                                     &policy->selector.saddr,
1143                                                     policy->family,
1144                                                     policy->selector.prefixlen_s,
1145                                                     dir);
1146                 write_seqcount_end(&bin->count);
1147                 if (!n)
1148                         return NULL;
1149
1150                 return &n->hhead;
1151         }
1152
1153         /* daddr is fixed */
1154         write_seqcount_begin(&bin->count);
1155         n = xfrm_policy_inexact_insert_node(net,
1156                                             &bin->root_d,
1157                                             &policy->selector.daddr,
1158                                             policy->family,
1159                                             policy->selector.prefixlen_d, dir);
1160         write_seqcount_end(&bin->count);
1161         if (!n)
1162                 return NULL;
1163
1164         /* saddr is wildcard */
1165         if (xfrm_pol_inexact_addr_use_any_list(&policy->selector.saddr,
1166                                                policy->family,
1167                                                policy->selector.prefixlen_s))
1168                 return &n->hhead;
1169
1170         write_seqcount_begin(&bin->count);
1171         n = xfrm_policy_inexact_insert_node(net,
1172                                             &n->root,
1173                                             &policy->selector.saddr,
1174                                             policy->family,
1175                                             policy->selector.prefixlen_s, dir);
1176         write_seqcount_end(&bin->count);
1177         if (!n)
1178                 return NULL;
1179
1180         return &n->hhead;
1181 }
1182
1183 static struct xfrm_policy *
1184 xfrm_policy_inexact_insert(struct xfrm_policy *policy, u8 dir, int excl)
1185 {
1186         struct xfrm_pol_inexact_bin *bin;
1187         struct xfrm_policy *delpol;
1188         struct hlist_head *chain;
1189         struct net *net;
1190
1191         bin = xfrm_policy_inexact_alloc_bin(policy, dir);
1192         if (!bin)
1193                 return ERR_PTR(-ENOMEM);
1194
1195         net = xp_net(policy);
1196         lockdep_assert_held(&net->xfrm.xfrm_policy_lock);
1197
1198         chain = xfrm_policy_inexact_alloc_chain(bin, policy, dir);
1199         if (!chain) {
1200                 __xfrm_policy_inexact_prune_bin(bin, false);
1201                 return ERR_PTR(-ENOMEM);
1202         }
1203
1204         delpol = xfrm_policy_insert_list(chain, policy, excl);
1205         if (delpol && excl) {
1206                 __xfrm_policy_inexact_prune_bin(bin, false);
1207                 return ERR_PTR(-EEXIST);
1208         }
1209
1210         chain = &net->xfrm.policy_inexact[dir];
1211         xfrm_policy_insert_inexact_list(chain, policy);
1212
1213         if (delpol)
1214                 __xfrm_policy_inexact_prune_bin(bin, false);
1215
1216         return delpol;
1217 }
1218
1219 static void xfrm_hash_rebuild(struct work_struct *work)
1220 {
1221         struct net *net = container_of(work, struct net,
1222                                        xfrm.policy_hthresh.work);
1223         unsigned int hmask;
1224         struct xfrm_policy *pol;
1225         struct xfrm_policy *policy;
1226         struct hlist_head *chain;
1227         struct hlist_head *odst;
1228         struct hlist_node *newpos;
1229         int i;
1230         int dir;
1231         unsigned seq;
1232         u8 lbits4, rbits4, lbits6, rbits6;
1233
1234         mutex_lock(&hash_resize_mutex);
1235
1236         /* read selector prefixlen thresholds */
1237         do {
1238                 seq = read_seqbegin(&net->xfrm.policy_hthresh.lock);
1239
1240                 lbits4 = net->xfrm.policy_hthresh.lbits4;
1241                 rbits4 = net->xfrm.policy_hthresh.rbits4;
1242                 lbits6 = net->xfrm.policy_hthresh.lbits6;
1243                 rbits6 = net->xfrm.policy_hthresh.rbits6;
1244         } while (read_seqretry(&net->xfrm.policy_hthresh.lock, seq));
1245
1246         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1247         write_seqcount_begin(&xfrm_policy_hash_generation);
1248
1249         /* make sure that we can insert the indirect policies again before
1250          * we start with destructive action.
1251          */
1252         list_for_each_entry(policy, &net->xfrm.policy_all, walk.all) {
1253                 struct xfrm_pol_inexact_bin *bin;
1254                 u8 dbits, sbits;
1255
1256                 dir = xfrm_policy_id2dir(policy->index);
1257                 if (policy->walk.dead || dir >= XFRM_POLICY_MAX)
1258                         continue;
1259
1260                 if ((dir & XFRM_POLICY_MASK) == XFRM_POLICY_OUT) {
1261                         if (policy->family == AF_INET) {
1262                                 dbits = rbits4;
1263                                 sbits = lbits4;
1264                         } else {
1265                                 dbits = rbits6;
1266                                 sbits = lbits6;
1267                         }
1268                 } else {
1269                         if (policy->family == AF_INET) {
1270                                 dbits = lbits4;
1271                                 sbits = rbits4;
1272                         } else {
1273                                 dbits = lbits6;
1274                                 sbits = rbits6;
1275                         }
1276                 }
1277
1278                 if (policy->selector.prefixlen_d < dbits ||
1279                     policy->selector.prefixlen_s < sbits)
1280                         continue;
1281
1282                 bin = xfrm_policy_inexact_alloc_bin(policy, dir);
1283                 if (!bin)
1284                         goto out_unlock;
1285
1286                 if (!xfrm_policy_inexact_alloc_chain(bin, policy, dir))
1287                         goto out_unlock;
1288         }
1289
1290         /* reset the bydst and inexact table in all directions */
1291         for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
1292                 struct hlist_node *n;
1293
1294                 hlist_for_each_entry_safe(policy, n,
1295                                           &net->xfrm.policy_inexact[dir],
1296                                           bydst_inexact_list) {
1297                         hlist_del_rcu(&policy->bydst);
1298                         hlist_del_init(&policy->bydst_inexact_list);
1299                 }
1300
1301                 hmask = net->xfrm.policy_bydst[dir].hmask;
1302                 odst = net->xfrm.policy_bydst[dir].table;
1303                 for (i = hmask; i >= 0; i--) {
1304                         hlist_for_each_entry_safe(policy, n, odst + i, bydst)
1305                                 hlist_del_rcu(&policy->bydst);
1306                 }
1307                 if ((dir & XFRM_POLICY_MASK) == XFRM_POLICY_OUT) {
1308                         /* dir out => dst = remote, src = local */
1309                         net->xfrm.policy_bydst[dir].dbits4 = rbits4;
1310                         net->xfrm.policy_bydst[dir].sbits4 = lbits4;
1311                         net->xfrm.policy_bydst[dir].dbits6 = rbits6;
1312                         net->xfrm.policy_bydst[dir].sbits6 = lbits6;
1313                 } else {
1314                         /* dir in/fwd => dst = local, src = remote */
1315                         net->xfrm.policy_bydst[dir].dbits4 = lbits4;
1316                         net->xfrm.policy_bydst[dir].sbits4 = rbits4;
1317                         net->xfrm.policy_bydst[dir].dbits6 = lbits6;
1318                         net->xfrm.policy_bydst[dir].sbits6 = rbits6;
1319                 }
1320         }
1321
1322         /* re-insert all policies by order of creation */
1323         list_for_each_entry_reverse(policy, &net->xfrm.policy_all, walk.all) {
1324                 if (policy->walk.dead)
1325                         continue;
1326                 dir = xfrm_policy_id2dir(policy->index);
1327                 if (dir >= XFRM_POLICY_MAX) {
1328                         /* skip socket policies */
1329                         continue;
1330                 }
1331                 newpos = NULL;
1332                 chain = policy_hash_bysel(net, &policy->selector,
1333                                           policy->family, dir);
1334
1335                 if (!chain) {
1336                         void *p = xfrm_policy_inexact_insert(policy, dir, 0);
1337
1338                         WARN_ONCE(IS_ERR(p), "reinsert: %ld\n", PTR_ERR(p));
1339                         continue;
1340                 }
1341
1342                 hlist_for_each_entry(pol, chain, bydst) {
1343                         if (policy->priority >= pol->priority)
1344                                 newpos = &pol->bydst;
1345                         else
1346                                 break;
1347                 }
1348                 if (newpos)
1349                         hlist_add_behind_rcu(&policy->bydst, newpos);
1350                 else
1351                         hlist_add_head_rcu(&policy->bydst, chain);
1352         }
1353
1354 out_unlock:
1355         __xfrm_policy_inexact_flush(net);
1356         write_seqcount_end(&xfrm_policy_hash_generation);
1357         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1358
1359         mutex_unlock(&hash_resize_mutex);
1360 }
1361
1362 void xfrm_policy_hash_rebuild(struct net *net)
1363 {
1364         schedule_work(&net->xfrm.policy_hthresh.work);
1365 }
1366 EXPORT_SYMBOL(xfrm_policy_hash_rebuild);
1367
1368 /* Generate new index... KAME seems to generate them ordered by cost
1369  * of an absolute inpredictability of ordering of rules. This will not pass. */
1370 static u32 xfrm_gen_index(struct net *net, int dir, u32 index)
1371 {
1372         static u32 idx_generator;
1373
1374         for (;;) {
1375                 struct hlist_head *list;
1376                 struct xfrm_policy *p;
1377                 u32 idx;
1378                 int found;
1379
1380                 if (!index) {
1381                         idx = (idx_generator | dir);
1382                         idx_generator += 8;
1383                 } else {
1384                         idx = index;
1385                         index = 0;
1386                 }
1387
1388                 if (idx == 0)
1389                         idx = 8;
1390                 list = net->xfrm.policy_byidx + idx_hash(net, idx);
1391                 found = 0;
1392                 hlist_for_each_entry(p, list, byidx) {
1393                         if (p->index == idx) {
1394                                 found = 1;
1395                                 break;
1396                         }
1397                 }
1398                 if (!found)
1399                         return idx;
1400         }
1401 }
1402
1403 static inline int selector_cmp(struct xfrm_selector *s1, struct xfrm_selector *s2)
1404 {
1405         u32 *p1 = (u32 *) s1;
1406         u32 *p2 = (u32 *) s2;
1407         int len = sizeof(struct xfrm_selector) / sizeof(u32);
1408         int i;
1409
1410         for (i = 0; i < len; i++) {
1411                 if (p1[i] != p2[i])
1412                         return 1;
1413         }
1414
1415         return 0;
1416 }
1417
1418 static void xfrm_policy_requeue(struct xfrm_policy *old,
1419                                 struct xfrm_policy *new)
1420 {
1421         struct xfrm_policy_queue *pq = &old->polq;
1422         struct sk_buff_head list;
1423
1424         if (skb_queue_empty(&pq->hold_queue))
1425                 return;
1426
1427         __skb_queue_head_init(&list);
1428
1429         spin_lock_bh(&pq->hold_queue.lock);
1430         skb_queue_splice_init(&pq->hold_queue, &list);
1431         if (del_timer(&pq->hold_timer))
1432                 xfrm_pol_put(old);
1433         spin_unlock_bh(&pq->hold_queue.lock);
1434
1435         pq = &new->polq;
1436
1437         spin_lock_bh(&pq->hold_queue.lock);
1438         skb_queue_splice(&list, &pq->hold_queue);
1439         pq->timeout = XFRM_QUEUE_TMO_MIN;
1440         if (!mod_timer(&pq->hold_timer, jiffies))
1441                 xfrm_pol_hold(new);
1442         spin_unlock_bh(&pq->hold_queue.lock);
1443 }
1444
1445 static inline bool xfrm_policy_mark_match(const struct xfrm_mark *mark,
1446                                           struct xfrm_policy *pol)
1447 {
1448         return mark->v == pol->mark.v && mark->m == pol->mark.m;
1449 }
1450
1451 static u32 xfrm_pol_bin_key(const void *data, u32 len, u32 seed)
1452 {
1453         const struct xfrm_pol_inexact_key *k = data;
1454         u32 a = k->type << 24 | k->dir << 16 | k->family;
1455
1456         return jhash_3words(a, k->if_id, net_hash_mix(read_pnet(&k->net)),
1457                             seed);
1458 }
1459
1460 static u32 xfrm_pol_bin_obj(const void *data, u32 len, u32 seed)
1461 {
1462         const struct xfrm_pol_inexact_bin *b = data;
1463
1464         return xfrm_pol_bin_key(&b->k, 0, seed);
1465 }
1466
1467 static int xfrm_pol_bin_cmp(struct rhashtable_compare_arg *arg,
1468                             const void *ptr)
1469 {
1470         const struct xfrm_pol_inexact_key *key = arg->key;
1471         const struct xfrm_pol_inexact_bin *b = ptr;
1472         int ret;
1473
1474         if (!net_eq(read_pnet(&b->k.net), read_pnet(&key->net)))
1475                 return -1;
1476
1477         ret = b->k.dir ^ key->dir;
1478         if (ret)
1479                 return ret;
1480
1481         ret = b->k.type ^ key->type;
1482         if (ret)
1483                 return ret;
1484
1485         ret = b->k.family ^ key->family;
1486         if (ret)
1487                 return ret;
1488
1489         return b->k.if_id ^ key->if_id;
1490 }
1491
1492 static const struct rhashtable_params xfrm_pol_inexact_params = {
1493         .head_offset            = offsetof(struct xfrm_pol_inexact_bin, head),
1494         .hashfn                 = xfrm_pol_bin_key,
1495         .obj_hashfn             = xfrm_pol_bin_obj,
1496         .obj_cmpfn              = xfrm_pol_bin_cmp,
1497         .automatic_shrinking    = true,
1498 };
1499
1500 static void xfrm_policy_insert_inexact_list(struct hlist_head *chain,
1501                                             struct xfrm_policy *policy)
1502 {
1503         struct xfrm_policy *pol, *delpol = NULL;
1504         struct hlist_node *newpos = NULL;
1505         int i = 0;
1506
1507         hlist_for_each_entry(pol, chain, bydst_inexact_list) {
1508                 if (pol->type == policy->type &&
1509                     pol->if_id == policy->if_id &&
1510                     !selector_cmp(&pol->selector, &policy->selector) &&
1511                     xfrm_policy_mark_match(&policy->mark, pol) &&
1512                     xfrm_sec_ctx_match(pol->security, policy->security) &&
1513                     !WARN_ON(delpol)) {
1514                         delpol = pol;
1515                         if (policy->priority > pol->priority)
1516                                 continue;
1517                 } else if (policy->priority >= pol->priority) {
1518                         newpos = &pol->bydst_inexact_list;
1519                         continue;
1520                 }
1521                 if (delpol)
1522                         break;
1523         }
1524
1525         if (newpos)
1526                 hlist_add_behind_rcu(&policy->bydst_inexact_list, newpos);
1527         else
1528                 hlist_add_head_rcu(&policy->bydst_inexact_list, chain);
1529
1530         hlist_for_each_entry(pol, chain, bydst_inexact_list) {
1531                 pol->pos = i;
1532                 i++;
1533         }
1534 }
1535
1536 static struct xfrm_policy *xfrm_policy_insert_list(struct hlist_head *chain,
1537                                                    struct xfrm_policy *policy,
1538                                                    bool excl)
1539 {
1540         struct xfrm_policy *pol, *newpos = NULL, *delpol = NULL;
1541
1542         hlist_for_each_entry(pol, chain, bydst) {
1543                 if (pol->type == policy->type &&
1544                     pol->if_id == policy->if_id &&
1545                     !selector_cmp(&pol->selector, &policy->selector) &&
1546                     xfrm_policy_mark_match(&policy->mark, pol) &&
1547                     xfrm_sec_ctx_match(pol->security, policy->security) &&
1548                     !WARN_ON(delpol)) {
1549                         if (excl)
1550                                 return ERR_PTR(-EEXIST);
1551                         delpol = pol;
1552                         if (policy->priority > pol->priority)
1553                                 continue;
1554                 } else if (policy->priority >= pol->priority) {
1555                         newpos = pol;
1556                         continue;
1557                 }
1558                 if (delpol)
1559                         break;
1560         }
1561
1562         if (newpos)
1563                 hlist_add_behind_rcu(&policy->bydst, &newpos->bydst);
1564         else
1565                 hlist_add_head_rcu(&policy->bydst, chain);
1566
1567         return delpol;
1568 }
1569
1570 int xfrm_policy_insert(int dir, struct xfrm_policy *policy, int excl)
1571 {
1572         struct net *net = xp_net(policy);
1573         struct xfrm_policy *delpol;
1574         struct hlist_head *chain;
1575
1576         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1577         chain = policy_hash_bysel(net, &policy->selector, policy->family, dir);
1578         if (chain)
1579                 delpol = xfrm_policy_insert_list(chain, policy, excl);
1580         else
1581                 delpol = xfrm_policy_inexact_insert(policy, dir, excl);
1582
1583         if (IS_ERR(delpol)) {
1584                 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1585                 return PTR_ERR(delpol);
1586         }
1587
1588         __xfrm_policy_link(policy, dir);
1589
1590         /* After previous checking, family can either be AF_INET or AF_INET6 */
1591         if (policy->family == AF_INET)
1592                 rt_genid_bump_ipv4(net);
1593         else
1594                 rt_genid_bump_ipv6(net);
1595
1596         if (delpol) {
1597                 xfrm_policy_requeue(delpol, policy);
1598                 __xfrm_policy_unlink(delpol, dir);
1599         }
1600         policy->index = delpol ? delpol->index : xfrm_gen_index(net, dir, policy->index);
1601         hlist_add_head(&policy->byidx, net->xfrm.policy_byidx+idx_hash(net, policy->index));
1602         policy->curlft.add_time = ktime_get_real_seconds();
1603         policy->curlft.use_time = 0;
1604         if (!mod_timer(&policy->timer, jiffies + HZ))
1605                 xfrm_pol_hold(policy);
1606         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1607
1608         if (delpol)
1609                 xfrm_policy_kill(delpol);
1610         else if (xfrm_bydst_should_resize(net, dir, NULL))
1611                 schedule_work(&net->xfrm.policy_hash_work);
1612
1613         return 0;
1614 }
1615 EXPORT_SYMBOL(xfrm_policy_insert);
1616
1617 static struct xfrm_policy *
1618 __xfrm_policy_bysel_ctx(struct hlist_head *chain, const struct xfrm_mark *mark,
1619                         u32 if_id, u8 type, int dir, struct xfrm_selector *sel,
1620                         struct xfrm_sec_ctx *ctx)
1621 {
1622         struct xfrm_policy *pol;
1623
1624         if (!chain)
1625                 return NULL;
1626
1627         hlist_for_each_entry(pol, chain, bydst) {
1628                 if (pol->type == type &&
1629                     pol->if_id == if_id &&
1630                     xfrm_policy_mark_match(mark, pol) &&
1631                     !selector_cmp(sel, &pol->selector) &&
1632                     xfrm_sec_ctx_match(ctx, pol->security))
1633                         return pol;
1634         }
1635
1636         return NULL;
1637 }
1638
1639 struct xfrm_policy *
1640 xfrm_policy_bysel_ctx(struct net *net, const struct xfrm_mark *mark, u32 if_id,
1641                       u8 type, int dir, struct xfrm_selector *sel,
1642                       struct xfrm_sec_ctx *ctx, int delete, int *err)
1643 {
1644         struct xfrm_pol_inexact_bin *bin = NULL;
1645         struct xfrm_policy *pol, *ret = NULL;
1646         struct hlist_head *chain;
1647
1648         *err = 0;
1649         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1650         chain = policy_hash_bysel(net, sel, sel->family, dir);
1651         if (!chain) {
1652                 struct xfrm_pol_inexact_candidates cand;
1653                 int i;
1654
1655                 bin = xfrm_policy_inexact_lookup(net, type,
1656                                                  sel->family, dir, if_id);
1657                 if (!bin) {
1658                         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1659                         return NULL;
1660                 }
1661
1662                 if (!xfrm_policy_find_inexact_candidates(&cand, bin,
1663                                                          &sel->saddr,
1664                                                          &sel->daddr)) {
1665                         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1666                         return NULL;
1667                 }
1668
1669                 pol = NULL;
1670                 for (i = 0; i < ARRAY_SIZE(cand.res); i++) {
1671                         struct xfrm_policy *tmp;
1672
1673                         tmp = __xfrm_policy_bysel_ctx(cand.res[i], mark,
1674                                                       if_id, type, dir,
1675                                                       sel, ctx);
1676                         if (!tmp)
1677                                 continue;
1678
1679                         if (!pol || tmp->pos < pol->pos)
1680                                 pol = tmp;
1681                 }
1682         } else {
1683                 pol = __xfrm_policy_bysel_ctx(chain, mark, if_id, type, dir,
1684                                               sel, ctx);
1685         }
1686
1687         if (pol) {
1688                 xfrm_pol_hold(pol);
1689                 if (delete) {
1690                         *err = security_xfrm_policy_delete(pol->security);
1691                         if (*err) {
1692                                 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1693                                 return pol;
1694                         }
1695                         __xfrm_policy_unlink(pol, dir);
1696                 }
1697                 ret = pol;
1698         }
1699         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1700
1701         if (ret && delete)
1702                 xfrm_policy_kill(ret);
1703         if (bin && delete)
1704                 xfrm_policy_inexact_prune_bin(bin);
1705         return ret;
1706 }
1707 EXPORT_SYMBOL(xfrm_policy_bysel_ctx);
1708
1709 struct xfrm_policy *
1710 xfrm_policy_byid(struct net *net, const struct xfrm_mark *mark, u32 if_id,
1711                  u8 type, int dir, u32 id, int delete, int *err)
1712 {
1713         struct xfrm_policy *pol, *ret;
1714         struct hlist_head *chain;
1715
1716         *err = -ENOENT;
1717         if (xfrm_policy_id2dir(id) != dir)
1718                 return NULL;
1719
1720         *err = 0;
1721         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1722         chain = net->xfrm.policy_byidx + idx_hash(net, id);
1723         ret = NULL;
1724         hlist_for_each_entry(pol, chain, byidx) {
1725                 if (pol->type == type && pol->index == id &&
1726                     pol->if_id == if_id && xfrm_policy_mark_match(mark, pol)) {
1727                         xfrm_pol_hold(pol);
1728                         if (delete) {
1729                                 *err = security_xfrm_policy_delete(
1730                                                                 pol->security);
1731                                 if (*err) {
1732                                         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1733                                         return pol;
1734                                 }
1735                                 __xfrm_policy_unlink(pol, dir);
1736                         }
1737                         ret = pol;
1738                         break;
1739                 }
1740         }
1741         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1742
1743         if (ret && delete)
1744                 xfrm_policy_kill(ret);
1745         return ret;
1746 }
1747 EXPORT_SYMBOL(xfrm_policy_byid);
1748
1749 #ifdef CONFIG_SECURITY_NETWORK_XFRM
1750 static inline int
1751 xfrm_policy_flush_secctx_check(struct net *net, u8 type, bool task_valid)
1752 {
1753         struct xfrm_policy *pol;
1754         int err = 0;
1755
1756         list_for_each_entry(pol, &net->xfrm.policy_all, walk.all) {
1757                 if (pol->walk.dead ||
1758                     xfrm_policy_id2dir(pol->index) >= XFRM_POLICY_MAX ||
1759                     pol->type != type)
1760                         continue;
1761
1762                 err = security_xfrm_policy_delete(pol->security);
1763                 if (err) {
1764                         xfrm_audit_policy_delete(pol, 0, task_valid);
1765                         return err;
1766                 }
1767         }
1768         return err;
1769 }
1770 #else
1771 static inline int
1772 xfrm_policy_flush_secctx_check(struct net *net, u8 type, bool task_valid)
1773 {
1774         return 0;
1775 }
1776 #endif
1777
1778 int xfrm_policy_flush(struct net *net, u8 type, bool task_valid)
1779 {
1780         int dir, err = 0, cnt = 0;
1781         struct xfrm_policy *pol;
1782
1783         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1784
1785         err = xfrm_policy_flush_secctx_check(net, type, task_valid);
1786         if (err)
1787                 goto out;
1788
1789 again:
1790         list_for_each_entry(pol, &net->xfrm.policy_all, walk.all) {
1791                 dir = xfrm_policy_id2dir(pol->index);
1792                 if (pol->walk.dead ||
1793                     dir >= XFRM_POLICY_MAX ||
1794                     pol->type != type)
1795                         continue;
1796
1797                 __xfrm_policy_unlink(pol, dir);
1798                 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1799                 cnt++;
1800                 xfrm_audit_policy_delete(pol, 1, task_valid);
1801                 xfrm_policy_kill(pol);
1802                 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1803                 goto again;
1804         }
1805         if (cnt)
1806                 __xfrm_policy_inexact_flush(net);
1807         else
1808                 err = -ESRCH;
1809 out:
1810         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1811         return err;
1812 }
1813 EXPORT_SYMBOL(xfrm_policy_flush);
1814
1815 int xfrm_policy_walk(struct net *net, struct xfrm_policy_walk *walk,
1816                      int (*func)(struct xfrm_policy *, int, int, void*),
1817                      void *data)
1818 {
1819         struct xfrm_policy *pol;
1820         struct xfrm_policy_walk_entry *x;
1821         int error = 0;
1822
1823         if (walk->type >= XFRM_POLICY_TYPE_MAX &&
1824             walk->type != XFRM_POLICY_TYPE_ANY)
1825                 return -EINVAL;
1826
1827         if (list_empty(&walk->walk.all) && walk->seq != 0)
1828                 return 0;
1829
1830         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
1831         if (list_empty(&walk->walk.all))
1832                 x = list_first_entry(&net->xfrm.policy_all, struct xfrm_policy_walk_entry, all);
1833         else
1834                 x = list_first_entry(&walk->walk.all,
1835                                      struct xfrm_policy_walk_entry, all);
1836
1837         list_for_each_entry_from(x, &net->xfrm.policy_all, all) {
1838                 if (x->dead)
1839                         continue;
1840                 pol = container_of(x, struct xfrm_policy, walk);
1841                 if (walk->type != XFRM_POLICY_TYPE_ANY &&
1842                     walk->type != pol->type)
1843                         continue;
1844                 error = func(pol, xfrm_policy_id2dir(pol->index),
1845                              walk->seq, data);
1846                 if (error) {
1847                         list_move_tail(&walk->walk.all, &x->all);
1848                         goto out;
1849                 }
1850                 walk->seq++;
1851         }
1852         if (walk->seq == 0) {
1853                 error = -ENOENT;
1854                 goto out;
1855         }
1856         list_del_init(&walk->walk.all);
1857 out:
1858         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1859         return error;
1860 }
1861 EXPORT_SYMBOL(xfrm_policy_walk);
1862
1863 void xfrm_policy_walk_init(struct xfrm_policy_walk *walk, u8 type)
1864 {
1865         INIT_LIST_HEAD(&walk->walk.all);
1866         walk->walk.dead = 1;
1867         walk->type = type;
1868         walk->seq = 0;
1869 }
1870 EXPORT_SYMBOL(xfrm_policy_walk_init);
1871
1872 void xfrm_policy_walk_done(struct xfrm_policy_walk *walk, struct net *net)
1873 {
1874         if (list_empty(&walk->walk.all))
1875                 return;
1876
1877         spin_lock_bh(&net->xfrm.xfrm_policy_lock); /*FIXME where is net? */
1878         list_del(&walk->walk.all);
1879         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
1880 }
1881 EXPORT_SYMBOL(xfrm_policy_walk_done);
1882
1883 /*
1884  * Find policy to apply to this flow.
1885  *
1886  * Returns 0 if policy found, else an -errno.
1887  */
1888 static int xfrm_policy_match(const struct xfrm_policy *pol,
1889                              const struct flowi *fl,
1890                              u8 type, u16 family, int dir, u32 if_id)
1891 {
1892         const struct xfrm_selector *sel = &pol->selector;
1893         int ret = -ESRCH;
1894         bool match;
1895
1896         if (pol->family != family ||
1897             pol->if_id != if_id ||
1898             (fl->flowi_mark & pol->mark.m) != pol->mark.v ||
1899             pol->type != type)
1900                 return ret;
1901
1902         match = xfrm_selector_match(sel, fl, family);
1903         if (match)
1904                 ret = security_xfrm_policy_lookup(pol->security, fl->flowi_secid,
1905                                                   dir);
1906         return ret;
1907 }
1908
1909 static struct xfrm_pol_inexact_node *
1910 xfrm_policy_lookup_inexact_addr(const struct rb_root *r,
1911                                 seqcount_t *count,
1912                                 const xfrm_address_t *addr, u16 family)
1913 {
1914         const struct rb_node *parent;
1915         int seq;
1916
1917 again:
1918         seq = read_seqcount_begin(count);
1919
1920         parent = rcu_dereference_raw(r->rb_node);
1921         while (parent) {
1922                 struct xfrm_pol_inexact_node *node;
1923                 int delta;
1924
1925                 node = rb_entry(parent, struct xfrm_pol_inexact_node, node);
1926
1927                 delta = xfrm_policy_addr_delta(addr, &node->addr,
1928                                                node->prefixlen, family);
1929                 if (delta < 0) {
1930                         parent = rcu_dereference_raw(parent->rb_left);
1931                         continue;
1932                 } else if (delta > 0) {
1933                         parent = rcu_dereference_raw(parent->rb_right);
1934                         continue;
1935                 }
1936
1937                 return node;
1938         }
1939
1940         if (read_seqcount_retry(count, seq))
1941                 goto again;
1942
1943         return NULL;
1944 }
1945
1946 static bool
1947 xfrm_policy_find_inexact_candidates(struct xfrm_pol_inexact_candidates *cand,
1948                                     struct xfrm_pol_inexact_bin *b,
1949                                     const xfrm_address_t *saddr,
1950                                     const xfrm_address_t *daddr)
1951 {
1952         struct xfrm_pol_inexact_node *n;
1953         u16 family;
1954
1955         if (!b)
1956                 return false;
1957
1958         family = b->k.family;
1959         memset(cand, 0, sizeof(*cand));
1960         cand->res[XFRM_POL_CAND_ANY] = &b->hhead;
1961
1962         n = xfrm_policy_lookup_inexact_addr(&b->root_d, &b->count, daddr,
1963                                             family);
1964         if (n) {
1965                 cand->res[XFRM_POL_CAND_DADDR] = &n->hhead;
1966                 n = xfrm_policy_lookup_inexact_addr(&n->root, &b->count, saddr,
1967                                                     family);
1968                 if (n)
1969                         cand->res[XFRM_POL_CAND_BOTH] = &n->hhead;
1970         }
1971
1972         n = xfrm_policy_lookup_inexact_addr(&b->root_s, &b->count, saddr,
1973                                             family);
1974         if (n)
1975                 cand->res[XFRM_POL_CAND_SADDR] = &n->hhead;
1976
1977         return true;
1978 }
1979
1980 static struct xfrm_pol_inexact_bin *
1981 xfrm_policy_inexact_lookup_rcu(struct net *net, u8 type, u16 family,
1982                                u8 dir, u32 if_id)
1983 {
1984         struct xfrm_pol_inexact_key k = {
1985                 .family = family,
1986                 .type = type,
1987                 .dir = dir,
1988                 .if_id = if_id,
1989         };
1990
1991         write_pnet(&k.net, net);
1992
1993         return rhashtable_lookup(&xfrm_policy_inexact_table, &k,
1994                                  xfrm_pol_inexact_params);
1995 }
1996
1997 static struct xfrm_pol_inexact_bin *
1998 xfrm_policy_inexact_lookup(struct net *net, u8 type, u16 family,
1999                            u8 dir, u32 if_id)
2000 {
2001         struct xfrm_pol_inexact_bin *bin;
2002
2003         lockdep_assert_held(&net->xfrm.xfrm_policy_lock);
2004
2005         rcu_read_lock();
2006         bin = xfrm_policy_inexact_lookup_rcu(net, type, family, dir, if_id);
2007         rcu_read_unlock();
2008
2009         return bin;
2010 }
2011
2012 static struct xfrm_policy *
2013 __xfrm_policy_eval_candidates(struct hlist_head *chain,
2014                               struct xfrm_policy *prefer,
2015                               const struct flowi *fl,
2016                               u8 type, u16 family, int dir, u32 if_id)
2017 {
2018         u32 priority = prefer ? prefer->priority : ~0u;
2019         struct xfrm_policy *pol;
2020
2021         if (!chain)
2022                 return NULL;
2023
2024         hlist_for_each_entry_rcu(pol, chain, bydst) {
2025                 int err;
2026
2027                 if (pol->priority > priority)
2028                         break;
2029
2030                 err = xfrm_policy_match(pol, fl, type, family, dir, if_id);
2031                 if (err) {
2032                         if (err != -ESRCH)
2033                                 return ERR_PTR(err);
2034
2035                         continue;
2036                 }
2037
2038                 if (prefer) {
2039                         /* matches.  Is it older than *prefer? */
2040                         if (pol->priority == priority &&
2041                             prefer->pos < pol->pos)
2042                                 return prefer;
2043                 }
2044
2045                 return pol;
2046         }
2047
2048         return NULL;
2049 }
2050
2051 static struct xfrm_policy *
2052 xfrm_policy_eval_candidates(struct xfrm_pol_inexact_candidates *cand,
2053                             struct xfrm_policy *prefer,
2054                             const struct flowi *fl,
2055                             u8 type, u16 family, int dir, u32 if_id)
2056 {
2057         struct xfrm_policy *tmp;
2058         int i;
2059
2060         for (i = 0; i < ARRAY_SIZE(cand->res); i++) {
2061                 tmp = __xfrm_policy_eval_candidates(cand->res[i],
2062                                                     prefer,
2063                                                     fl, type, family, dir,
2064                                                     if_id);
2065                 if (!tmp)
2066                         continue;
2067
2068                 if (IS_ERR(tmp))
2069                         return tmp;
2070                 prefer = tmp;
2071         }
2072
2073         return prefer;
2074 }
2075
2076 static struct xfrm_policy *xfrm_policy_lookup_bytype(struct net *net, u8 type,
2077                                                      const struct flowi *fl,
2078                                                      u16 family, u8 dir,
2079                                                      u32 if_id)
2080 {
2081         struct xfrm_pol_inexact_candidates cand;
2082         const xfrm_address_t *daddr, *saddr;
2083         struct xfrm_pol_inexact_bin *bin;
2084         struct xfrm_policy *pol, *ret;
2085         struct hlist_head *chain;
2086         unsigned int sequence;
2087         int err;
2088
2089         daddr = xfrm_flowi_daddr(fl, family);
2090         saddr = xfrm_flowi_saddr(fl, family);
2091         if (unlikely(!daddr || !saddr))
2092                 return NULL;
2093
2094         rcu_read_lock();
2095  retry:
2096         do {
2097                 sequence = read_seqcount_begin(&xfrm_policy_hash_generation);
2098                 chain = policy_hash_direct(net, daddr, saddr, family, dir);
2099         } while (read_seqcount_retry(&xfrm_policy_hash_generation, sequence));
2100
2101         ret = NULL;
2102         hlist_for_each_entry_rcu(pol, chain, bydst) {
2103                 err = xfrm_policy_match(pol, fl, type, family, dir, if_id);
2104                 if (err) {
2105                         if (err == -ESRCH)
2106                                 continue;
2107                         else {
2108                                 ret = ERR_PTR(err);
2109                                 goto fail;
2110                         }
2111                 } else {
2112                         ret = pol;
2113                         break;
2114                 }
2115         }
2116         bin = xfrm_policy_inexact_lookup_rcu(net, type, family, dir, if_id);
2117         if (!bin || !xfrm_policy_find_inexact_candidates(&cand, bin, saddr,
2118                                                          daddr))
2119                 goto skip_inexact;
2120
2121         pol = xfrm_policy_eval_candidates(&cand, ret, fl, type,
2122                                           family, dir, if_id);
2123         if (pol) {
2124                 ret = pol;
2125                 if (IS_ERR(pol))
2126                         goto fail;
2127         }
2128
2129 skip_inexact:
2130         if (read_seqcount_retry(&xfrm_policy_hash_generation, sequence))
2131                 goto retry;
2132
2133         if (ret && !xfrm_pol_hold_rcu(ret))
2134                 goto retry;
2135 fail:
2136         rcu_read_unlock();
2137
2138         return ret;
2139 }
2140
2141 static struct xfrm_policy *xfrm_policy_lookup(struct net *net,
2142                                               const struct flowi *fl,
2143                                               u16 family, u8 dir, u32 if_id)
2144 {
2145 #ifdef CONFIG_XFRM_SUB_POLICY
2146         struct xfrm_policy *pol;
2147
2148         pol = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_SUB, fl, family,
2149                                         dir, if_id);
2150         if (pol != NULL)
2151                 return pol;
2152 #endif
2153         return xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN, fl, family,
2154                                          dir, if_id);
2155 }
2156
2157 static struct xfrm_policy *xfrm_sk_policy_lookup(const struct sock *sk, int dir,
2158                                                  const struct flowi *fl,
2159                                                  u16 family, u32 if_id)
2160 {
2161         struct xfrm_policy *pol;
2162
2163         rcu_read_lock();
2164  again:
2165         pol = rcu_dereference(sk->sk_policy[dir]);
2166         if (pol != NULL) {
2167                 bool match;
2168                 int err = 0;
2169
2170                 if (pol->family != family) {
2171                         pol = NULL;
2172                         goto out;
2173                 }
2174
2175                 match = xfrm_selector_match(&pol->selector, fl, family);
2176                 if (match) {
2177                         if ((sk->sk_mark & pol->mark.m) != pol->mark.v ||
2178                             pol->if_id != if_id) {
2179                                 pol = NULL;
2180                                 goto out;
2181                         }
2182                         err = security_xfrm_policy_lookup(pol->security,
2183                                                       fl->flowi_secid,
2184                                                       dir);
2185                         if (!err) {
2186                                 if (!xfrm_pol_hold_rcu(pol))
2187                                         goto again;
2188                         } else if (err == -ESRCH) {
2189                                 pol = NULL;
2190                         } else {
2191                                 pol = ERR_PTR(err);
2192                         }
2193                 } else
2194                         pol = NULL;
2195         }
2196 out:
2197         rcu_read_unlock();
2198         return pol;
2199 }
2200
2201 static void __xfrm_policy_link(struct xfrm_policy *pol, int dir)
2202 {
2203         struct net *net = xp_net(pol);
2204
2205         list_add(&pol->walk.all, &net->xfrm.policy_all);
2206         net->xfrm.policy_count[dir]++;
2207         xfrm_pol_hold(pol);
2208 }
2209
2210 static struct xfrm_policy *__xfrm_policy_unlink(struct xfrm_policy *pol,
2211                                                 int dir)
2212 {
2213         struct net *net = xp_net(pol);
2214
2215         if (list_empty(&pol->walk.all))
2216                 return NULL;
2217
2218         /* Socket policies are not hashed. */
2219         if (!hlist_unhashed(&pol->bydst)) {
2220                 hlist_del_rcu(&pol->bydst);
2221                 hlist_del_init(&pol->bydst_inexact_list);
2222                 hlist_del(&pol->byidx);
2223         }
2224
2225         list_del_init(&pol->walk.all);
2226         net->xfrm.policy_count[dir]--;
2227
2228         return pol;
2229 }
2230
2231 static void xfrm_sk_policy_link(struct xfrm_policy *pol, int dir)
2232 {
2233         __xfrm_policy_link(pol, XFRM_POLICY_MAX + dir);
2234 }
2235
2236 static void xfrm_sk_policy_unlink(struct xfrm_policy *pol, int dir)
2237 {
2238         __xfrm_policy_unlink(pol, XFRM_POLICY_MAX + dir);
2239 }
2240
2241 int xfrm_policy_delete(struct xfrm_policy *pol, int dir)
2242 {
2243         struct net *net = xp_net(pol);
2244
2245         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
2246         pol = __xfrm_policy_unlink(pol, dir);
2247         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
2248         if (pol) {
2249                 xfrm_policy_kill(pol);
2250                 return 0;
2251         }
2252         return -ENOENT;
2253 }
2254 EXPORT_SYMBOL(xfrm_policy_delete);
2255
2256 int xfrm_sk_policy_insert(struct sock *sk, int dir, struct xfrm_policy *pol)
2257 {
2258         struct net *net = sock_net(sk);
2259         struct xfrm_policy *old_pol;
2260
2261 #ifdef CONFIG_XFRM_SUB_POLICY
2262         if (pol && pol->type != XFRM_POLICY_TYPE_MAIN)
2263                 return -EINVAL;
2264 #endif
2265
2266         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
2267         old_pol = rcu_dereference_protected(sk->sk_policy[dir],
2268                                 lockdep_is_held(&net->xfrm.xfrm_policy_lock));
2269         if (pol) {
2270                 pol->curlft.add_time = ktime_get_real_seconds();
2271                 pol->index = xfrm_gen_index(net, XFRM_POLICY_MAX+dir, 0);
2272                 xfrm_sk_policy_link(pol, dir);
2273         }
2274         rcu_assign_pointer(sk->sk_policy[dir], pol);
2275         if (old_pol) {
2276                 if (pol)
2277                         xfrm_policy_requeue(old_pol, pol);
2278
2279                 /* Unlinking succeeds always. This is the only function
2280                  * allowed to delete or replace socket policy.
2281                  */
2282                 xfrm_sk_policy_unlink(old_pol, dir);
2283         }
2284         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
2285
2286         if (old_pol) {
2287                 xfrm_policy_kill(old_pol);
2288         }
2289         return 0;
2290 }
2291
2292 static struct xfrm_policy *clone_policy(const struct xfrm_policy *old, int dir)
2293 {
2294         struct xfrm_policy *newp = xfrm_policy_alloc(xp_net(old), GFP_ATOMIC);
2295         struct net *net = xp_net(old);
2296
2297         if (newp) {
2298                 newp->selector = old->selector;
2299                 if (security_xfrm_policy_clone(old->security,
2300                                                &newp->security)) {
2301                         kfree(newp);
2302                         return NULL;  /* ENOMEM */
2303                 }
2304                 newp->lft = old->lft;
2305                 newp->curlft = old->curlft;
2306                 newp->mark = old->mark;
2307                 newp->if_id = old->if_id;
2308                 newp->action = old->action;
2309                 newp->flags = old->flags;
2310                 newp->xfrm_nr = old->xfrm_nr;
2311                 newp->index = old->index;
2312                 newp->type = old->type;
2313                 newp->family = old->family;
2314                 memcpy(newp->xfrm_vec, old->xfrm_vec,
2315                        newp->xfrm_nr*sizeof(struct xfrm_tmpl));
2316                 spin_lock_bh(&net->xfrm.xfrm_policy_lock);
2317                 xfrm_sk_policy_link(newp, dir);
2318                 spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
2319                 xfrm_pol_put(newp);
2320         }
2321         return newp;
2322 }
2323
2324 int __xfrm_sk_clone_policy(struct sock *sk, const struct sock *osk)
2325 {
2326         const struct xfrm_policy *p;
2327         struct xfrm_policy *np;
2328         int i, ret = 0;
2329
2330         rcu_read_lock();
2331         for (i = 0; i < 2; i++) {
2332                 p = rcu_dereference(osk->sk_policy[i]);
2333                 if (p) {
2334                         np = clone_policy(p, i);
2335                         if (unlikely(!np)) {
2336                                 ret = -ENOMEM;
2337                                 break;
2338                         }
2339                         rcu_assign_pointer(sk->sk_policy[i], np);
2340                 }
2341         }
2342         rcu_read_unlock();
2343         return ret;
2344 }
2345
2346 static int
2347 xfrm_get_saddr(struct net *net, int oif, xfrm_address_t *local,
2348                xfrm_address_t *remote, unsigned short family, u32 mark)
2349 {
2350         int err;
2351         const struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
2352
2353         if (unlikely(afinfo == NULL))
2354                 return -EINVAL;
2355         err = afinfo->get_saddr(net, oif, local, remote, mark);
2356         rcu_read_unlock();
2357         return err;
2358 }
2359
2360 /* Resolve list of templates for the flow, given policy. */
2361
2362 static int
2363 xfrm_tmpl_resolve_one(struct xfrm_policy *policy, const struct flowi *fl,
2364                       struct xfrm_state **xfrm, unsigned short family)
2365 {
2366         struct net *net = xp_net(policy);
2367         int nx;
2368         int i, error;
2369         xfrm_address_t *daddr = xfrm_flowi_daddr(fl, family);
2370         xfrm_address_t *saddr = xfrm_flowi_saddr(fl, family);
2371         xfrm_address_t tmp;
2372
2373         for (nx = 0, i = 0; i < policy->xfrm_nr; i++) {
2374                 struct xfrm_state *x;
2375                 xfrm_address_t *remote = daddr;
2376                 xfrm_address_t *local  = saddr;
2377                 struct xfrm_tmpl *tmpl = &policy->xfrm_vec[i];
2378
2379                 if (tmpl->mode == XFRM_MODE_TUNNEL ||
2380                     tmpl->mode == XFRM_MODE_BEET) {
2381                         remote = &tmpl->id.daddr;
2382                         local = &tmpl->saddr;
2383                         if (xfrm_addr_any(local, tmpl->encap_family)) {
2384                                 error = xfrm_get_saddr(net, fl->flowi_oif,
2385                                                        &tmp, remote,
2386                                                        tmpl->encap_family, 0);
2387                                 if (error)
2388                                         goto fail;
2389                                 local = &tmp;
2390                         }
2391                 }
2392
2393                 x = xfrm_state_find(remote, local, fl, tmpl, policy, &error,
2394                                     family, policy->if_id);
2395
2396                 if (x && x->km.state == XFRM_STATE_VALID) {
2397                         xfrm[nx++] = x;
2398                         daddr = remote;
2399                         saddr = local;
2400                         continue;
2401                 }
2402                 if (x) {
2403                         error = (x->km.state == XFRM_STATE_ERROR ?
2404                                  -EINVAL : -EAGAIN);
2405                         xfrm_state_put(x);
2406                 } else if (error == -ESRCH) {
2407                         error = -EAGAIN;
2408                 }
2409
2410                 if (!tmpl->optional)
2411                         goto fail;
2412         }
2413         return nx;
2414
2415 fail:
2416         for (nx--; nx >= 0; nx--)
2417                 xfrm_state_put(xfrm[nx]);
2418         return error;
2419 }
2420
2421 static int
2422 xfrm_tmpl_resolve(struct xfrm_policy **pols, int npols, const struct flowi *fl,
2423                   struct xfrm_state **xfrm, unsigned short family)
2424 {
2425         struct xfrm_state *tp[XFRM_MAX_DEPTH];
2426         struct xfrm_state **tpp = (npols > 1) ? tp : xfrm;
2427         int cnx = 0;
2428         int error;
2429         int ret;
2430         int i;
2431
2432         for (i = 0; i < npols; i++) {
2433                 if (cnx + pols[i]->xfrm_nr >= XFRM_MAX_DEPTH) {
2434                         error = -ENOBUFS;
2435                         goto fail;
2436                 }
2437
2438                 ret = xfrm_tmpl_resolve_one(pols[i], fl, &tpp[cnx], family);
2439                 if (ret < 0) {
2440                         error = ret;
2441                         goto fail;
2442                 } else
2443                         cnx += ret;
2444         }
2445
2446         /* found states are sorted for outbound processing */
2447         if (npols > 1)
2448                 xfrm_state_sort(xfrm, tpp, cnx, family);
2449
2450         return cnx;
2451
2452  fail:
2453         for (cnx--; cnx >= 0; cnx--)
2454                 xfrm_state_put(tpp[cnx]);
2455         return error;
2456
2457 }
2458
2459 static int xfrm_get_tos(const struct flowi *fl, int family)
2460 {
2461         if (family == AF_INET)
2462                 return IPTOS_RT_MASK & fl->u.ip4.flowi4_tos;
2463
2464         return 0;
2465 }
2466
2467 static inline struct xfrm_dst *xfrm_alloc_dst(struct net *net, int family)
2468 {
2469         const struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
2470         struct dst_ops *dst_ops;
2471         struct xfrm_dst *xdst;
2472
2473         if (!afinfo)
2474                 return ERR_PTR(-EINVAL);
2475
2476         switch (family) {
2477         case AF_INET:
2478                 dst_ops = &net->xfrm.xfrm4_dst_ops;
2479                 break;
2480 #if IS_ENABLED(CONFIG_IPV6)
2481         case AF_INET6:
2482                 dst_ops = &net->xfrm.xfrm6_dst_ops;
2483                 break;
2484 #endif
2485         default:
2486                 BUG();
2487         }
2488         xdst = dst_alloc(dst_ops, NULL, 1, DST_OBSOLETE_NONE, 0);
2489
2490         if (likely(xdst)) {
2491                 struct dst_entry *dst = &xdst->u.dst;
2492
2493                 memset(dst + 1, 0, sizeof(*xdst) - sizeof(*dst));
2494         } else
2495                 xdst = ERR_PTR(-ENOBUFS);
2496
2497         rcu_read_unlock();
2498
2499         return xdst;
2500 }
2501
2502 static void xfrm_init_path(struct xfrm_dst *path, struct dst_entry *dst,
2503                            int nfheader_len)
2504 {
2505         if (dst->ops->family == AF_INET6) {
2506                 struct rt6_info *rt = (struct rt6_info *)dst;
2507                 path->path_cookie = rt6_get_cookie(rt);
2508                 path->u.rt6.rt6i_nfheader_len = nfheader_len;
2509         }
2510 }
2511
2512 static inline int xfrm_fill_dst(struct xfrm_dst *xdst, struct net_device *dev,
2513                                 const struct flowi *fl)
2514 {
2515         const struct xfrm_policy_afinfo *afinfo =
2516                 xfrm_policy_get_afinfo(xdst->u.dst.ops->family);
2517         int err;
2518
2519         if (!afinfo)
2520                 return -EINVAL;
2521
2522         err = afinfo->fill_dst(xdst, dev, fl);
2523
2524         rcu_read_unlock();
2525
2526         return err;
2527 }
2528
2529
2530 /* Allocate chain of dst_entry's, attach known xfrm's, calculate
2531  * all the metrics... Shortly, bundle a bundle.
2532  */
2533
2534 static struct dst_entry *xfrm_bundle_create(struct xfrm_policy *policy,
2535                                             struct xfrm_state **xfrm,
2536                                             struct xfrm_dst **bundle,
2537                                             int nx,
2538                                             const struct flowi *fl,
2539                                             struct dst_entry *dst)
2540 {
2541         const struct xfrm_state_afinfo *afinfo;
2542         const struct xfrm_mode *inner_mode;
2543         struct net *net = xp_net(policy);
2544         unsigned long now = jiffies;
2545         struct net_device *dev;
2546         struct xfrm_dst *xdst_prev = NULL;
2547         struct xfrm_dst *xdst0 = NULL;
2548         int i = 0;
2549         int err;
2550         int header_len = 0;
2551         int nfheader_len = 0;
2552         int trailer_len = 0;
2553         int tos;
2554         int family = policy->selector.family;
2555         xfrm_address_t saddr, daddr;
2556
2557         xfrm_flowi_addr_get(fl, &saddr, &daddr, family);
2558
2559         tos = xfrm_get_tos(fl, family);
2560
2561         dst_hold(dst);
2562
2563         for (; i < nx; i++) {
2564                 struct xfrm_dst *xdst = xfrm_alloc_dst(net, family);
2565                 struct dst_entry *dst1 = &xdst->u.dst;
2566
2567                 err = PTR_ERR(xdst);
2568                 if (IS_ERR(xdst)) {
2569                         dst_release(dst);
2570                         goto put_states;
2571                 }
2572
2573                 bundle[i] = xdst;
2574                 if (!xdst_prev)
2575                         xdst0 = xdst;
2576                 else
2577                         /* Ref count is taken during xfrm_alloc_dst()
2578                          * No need to do dst_clone() on dst1
2579                          */
2580                         xfrm_dst_set_child(xdst_prev, &xdst->u.dst);
2581
2582                 if (xfrm[i]->sel.family == AF_UNSPEC) {
2583                         inner_mode = xfrm_ip2inner_mode(xfrm[i],
2584                                                         xfrm_af2proto(family));
2585                         if (!inner_mode) {
2586                                 err = -EAFNOSUPPORT;
2587                                 dst_release(dst);
2588                                 goto put_states;
2589                         }
2590                 } else
2591                         inner_mode = &xfrm[i]->inner_mode;
2592
2593                 xdst->route = dst;
2594                 dst_copy_metrics(dst1, dst);
2595
2596                 if (xfrm[i]->props.mode != XFRM_MODE_TRANSPORT) {
2597                         __u32 mark = 0;
2598
2599                         if (xfrm[i]->props.smark.v || xfrm[i]->props.smark.m)
2600                                 mark = xfrm_smark_get(fl->flowi_mark, xfrm[i]);
2601
2602                         family = xfrm[i]->props.family;
2603                         dst = xfrm_dst_lookup(xfrm[i], tos, fl->flowi_oif,
2604                                               &saddr, &daddr, family, mark);
2605                         err = PTR_ERR(dst);
2606                         if (IS_ERR(dst))
2607                                 goto put_states;
2608                 } else
2609                         dst_hold(dst);
2610
2611                 dst1->xfrm = xfrm[i];
2612                 xdst->xfrm_genid = xfrm[i]->genid;
2613
2614                 dst1->obsolete = DST_OBSOLETE_FORCE_CHK;
2615                 dst1->flags |= DST_HOST;
2616                 dst1->lastuse = now;
2617
2618                 dst1->input = dst_discard;
2619
2620                 rcu_read_lock();
2621                 afinfo = xfrm_state_afinfo_get_rcu(inner_mode->family);
2622                 if (likely(afinfo))
2623                         dst1->output = afinfo->output;
2624                 else
2625                         dst1->output = dst_discard_out;
2626                 rcu_read_unlock();
2627
2628                 xdst_prev = xdst;
2629
2630                 header_len += xfrm[i]->props.header_len;
2631                 if (xfrm[i]->type->flags & XFRM_TYPE_NON_FRAGMENT)
2632                         nfheader_len += xfrm[i]->props.header_len;
2633                 trailer_len += xfrm[i]->props.trailer_len;
2634         }
2635
2636         xfrm_dst_set_child(xdst_prev, dst);
2637         xdst0->path = dst;
2638
2639         err = -ENODEV;
2640         dev = dst->dev;
2641         if (!dev)
2642                 goto free_dst;
2643
2644         xfrm_init_path(xdst0, dst, nfheader_len);
2645         xfrm_init_pmtu(bundle, nx);
2646
2647         for (xdst_prev = xdst0; xdst_prev != (struct xfrm_dst *)dst;
2648              xdst_prev = (struct xfrm_dst *) xfrm_dst_child(&xdst_prev->u.dst)) {
2649                 err = xfrm_fill_dst(xdst_prev, dev, fl);
2650                 if (err)
2651                         goto free_dst;
2652
2653                 xdst_prev->u.dst.header_len = header_len;
2654                 xdst_prev->u.dst.trailer_len = trailer_len;
2655                 header_len -= xdst_prev->u.dst.xfrm->props.header_len;
2656                 trailer_len -= xdst_prev->u.dst.xfrm->props.trailer_len;
2657         }
2658
2659         return &xdst0->u.dst;
2660
2661 put_states:
2662         for (; i < nx; i++)
2663                 xfrm_state_put(xfrm[i]);
2664 free_dst:
2665         if (xdst0)
2666                 dst_release_immediate(&xdst0->u.dst);
2667
2668         return ERR_PTR(err);
2669 }
2670
2671 static int xfrm_expand_policies(const struct flowi *fl, u16 family,
2672                                 struct xfrm_policy **pols,
2673                                 int *num_pols, int *num_xfrms)
2674 {
2675         int i;
2676
2677         if (*num_pols == 0 || !pols[0]) {
2678                 *num_pols = 0;
2679                 *num_xfrms = 0;
2680                 return 0;
2681         }
2682         if (IS_ERR(pols[0])) {
2683                 *num_pols = 0;
2684                 return PTR_ERR(pols[0]);
2685         }
2686
2687         *num_xfrms = pols[0]->xfrm_nr;
2688
2689 #ifdef CONFIG_XFRM_SUB_POLICY
2690         if (pols[0] && pols[0]->action == XFRM_POLICY_ALLOW &&
2691             pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
2692                 pols[1] = xfrm_policy_lookup_bytype(xp_net(pols[0]),
2693                                                     XFRM_POLICY_TYPE_MAIN,
2694                                                     fl, family,
2695                                                     XFRM_POLICY_OUT,
2696                                                     pols[0]->if_id);
2697                 if (pols[1]) {
2698                         if (IS_ERR(pols[1])) {
2699                                 xfrm_pols_put(pols, *num_pols);
2700                                 *num_pols = 0;
2701                                 return PTR_ERR(pols[1]);
2702                         }
2703                         (*num_pols)++;
2704                         (*num_xfrms) += pols[1]->xfrm_nr;
2705                 }
2706         }
2707 #endif
2708         for (i = 0; i < *num_pols; i++) {
2709                 if (pols[i]->action != XFRM_POLICY_ALLOW) {
2710                         *num_xfrms = -1;
2711                         break;
2712                 }
2713         }
2714
2715         return 0;
2716
2717 }
2718
2719 static struct xfrm_dst *
2720 xfrm_resolve_and_create_bundle(struct xfrm_policy **pols, int num_pols,
2721                                const struct flowi *fl, u16 family,
2722                                struct dst_entry *dst_orig)
2723 {
2724         struct net *net = xp_net(pols[0]);
2725         struct xfrm_state *xfrm[XFRM_MAX_DEPTH];
2726         struct xfrm_dst *bundle[XFRM_MAX_DEPTH];
2727         struct xfrm_dst *xdst;
2728         struct dst_entry *dst;
2729         int err;
2730
2731         /* Try to instantiate a bundle */
2732         err = xfrm_tmpl_resolve(pols, num_pols, fl, xfrm, family);
2733         if (err <= 0) {
2734                 if (err == 0)
2735                         return NULL;
2736
2737                 if (err != -EAGAIN)
2738                         XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
2739                 return ERR_PTR(err);
2740         }
2741
2742         dst = xfrm_bundle_create(pols[0], xfrm, bundle, err, fl, dst_orig);
2743         if (IS_ERR(dst)) {
2744                 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTBUNDLEGENERROR);
2745                 return ERR_CAST(dst);
2746         }
2747
2748         xdst = (struct xfrm_dst *)dst;
2749         xdst->num_xfrms = err;
2750         xdst->num_pols = num_pols;
2751         memcpy(xdst->pols, pols, sizeof(struct xfrm_policy *) * num_pols);
2752         xdst->policy_genid = atomic_read(&pols[0]->genid);
2753
2754         return xdst;
2755 }
2756
2757 static void xfrm_policy_queue_process(struct timer_list *t)
2758 {
2759         struct sk_buff *skb;
2760         struct sock *sk;
2761         struct dst_entry *dst;
2762         struct xfrm_policy *pol = from_timer(pol, t, polq.hold_timer);
2763         struct net *net = xp_net(pol);
2764         struct xfrm_policy_queue *pq = &pol->polq;
2765         struct flowi fl;
2766         struct sk_buff_head list;
2767
2768         spin_lock(&pq->hold_queue.lock);
2769         skb = skb_peek(&pq->hold_queue);
2770         if (!skb) {
2771                 spin_unlock(&pq->hold_queue.lock);
2772                 goto out;
2773         }
2774         dst = skb_dst(skb);
2775         sk = skb->sk;
2776         xfrm_decode_session(skb, &fl, dst->ops->family);
2777         spin_unlock(&pq->hold_queue.lock);
2778
2779         dst_hold(xfrm_dst_path(dst));
2780         dst = xfrm_lookup(net, xfrm_dst_path(dst), &fl, sk, XFRM_LOOKUP_QUEUE);
2781         if (IS_ERR(dst))
2782                 goto purge_queue;
2783
2784         if (dst->flags & DST_XFRM_QUEUE) {
2785                 dst_release(dst);
2786
2787                 if (pq->timeout >= XFRM_QUEUE_TMO_MAX)
2788                         goto purge_queue;
2789
2790                 pq->timeout = pq->timeout << 1;
2791                 if (!mod_timer(&pq->hold_timer, jiffies + pq->timeout))
2792                         xfrm_pol_hold(pol);
2793                 goto out;
2794         }
2795
2796         dst_release(dst);
2797
2798         __skb_queue_head_init(&list);
2799
2800         spin_lock(&pq->hold_queue.lock);
2801         pq->timeout = 0;
2802         skb_queue_splice_init(&pq->hold_queue, &list);
2803         spin_unlock(&pq->hold_queue.lock);
2804
2805         while (!skb_queue_empty(&list)) {
2806                 skb = __skb_dequeue(&list);
2807
2808                 xfrm_decode_session(skb, &fl, skb_dst(skb)->ops->family);
2809                 dst_hold(xfrm_dst_path(skb_dst(skb)));
2810                 dst = xfrm_lookup(net, xfrm_dst_path(skb_dst(skb)), &fl, skb->sk, 0);
2811                 if (IS_ERR(dst)) {
2812                         kfree_skb(skb);
2813                         continue;
2814                 }
2815
2816                 nf_reset_ct(skb);
2817                 skb_dst_drop(skb);
2818                 skb_dst_set(skb, dst);
2819
2820                 dst_output(net, skb->sk, skb);
2821         }
2822
2823 out:
2824         xfrm_pol_put(pol);
2825         return;
2826
2827 purge_queue:
2828         pq->timeout = 0;
2829         skb_queue_purge(&pq->hold_queue);
2830         xfrm_pol_put(pol);
2831 }
2832
2833 static int xdst_queue_output(struct net *net, struct sock *sk, struct sk_buff *skb)
2834 {
2835         unsigned long sched_next;
2836         struct dst_entry *dst = skb_dst(skb);
2837         struct xfrm_dst *xdst = (struct xfrm_dst *) dst;
2838         struct xfrm_policy *pol = xdst->pols[0];
2839         struct xfrm_policy_queue *pq = &pol->polq;
2840
2841         if (unlikely(skb_fclone_busy(sk, skb))) {
2842                 kfree_skb(skb);
2843                 return 0;
2844         }
2845
2846         if (pq->hold_queue.qlen > XFRM_MAX_QUEUE_LEN) {
2847                 kfree_skb(skb);
2848                 return -EAGAIN;
2849         }
2850
2851         skb_dst_force(skb);
2852
2853         spin_lock_bh(&pq->hold_queue.lock);
2854
2855         if (!pq->timeout)
2856                 pq->timeout = XFRM_QUEUE_TMO_MIN;
2857
2858         sched_next = jiffies + pq->timeout;
2859
2860         if (del_timer(&pq->hold_timer)) {
2861                 if (time_before(pq->hold_timer.expires, sched_next))
2862                         sched_next = pq->hold_timer.expires;
2863                 xfrm_pol_put(pol);
2864         }
2865
2866         __skb_queue_tail(&pq->hold_queue, skb);
2867         if (!mod_timer(&pq->hold_timer, sched_next))
2868                 xfrm_pol_hold(pol);
2869
2870         spin_unlock_bh(&pq->hold_queue.lock);
2871
2872         return 0;
2873 }
2874
2875 static struct xfrm_dst *xfrm_create_dummy_bundle(struct net *net,
2876                                                  struct xfrm_flo *xflo,
2877                                                  const struct flowi *fl,
2878                                                  int num_xfrms,
2879                                                  u16 family)
2880 {
2881         int err;
2882         struct net_device *dev;
2883         struct dst_entry *dst;
2884         struct dst_entry *dst1;
2885         struct xfrm_dst *xdst;
2886
2887         xdst = xfrm_alloc_dst(net, family);
2888         if (IS_ERR(xdst))
2889                 return xdst;
2890
2891         if (!(xflo->flags & XFRM_LOOKUP_QUEUE) ||
2892             net->xfrm.sysctl_larval_drop ||
2893             num_xfrms <= 0)
2894                 return xdst;
2895
2896         dst = xflo->dst_orig;
2897         dst1 = &xdst->u.dst;
2898         dst_hold(dst);
2899         xdst->route = dst;
2900
2901         dst_copy_metrics(dst1, dst);
2902
2903         dst1->obsolete = DST_OBSOLETE_FORCE_CHK;
2904         dst1->flags |= DST_HOST | DST_XFRM_QUEUE;
2905         dst1->lastuse = jiffies;
2906
2907         dst1->input = dst_discard;
2908         dst1->output = xdst_queue_output;
2909
2910         dst_hold(dst);
2911         xfrm_dst_set_child(xdst, dst);
2912         xdst->path = dst;
2913
2914         xfrm_init_path((struct xfrm_dst *)dst1, dst, 0);
2915
2916         err = -ENODEV;
2917         dev = dst->dev;
2918         if (!dev)
2919                 goto free_dst;
2920
2921         err = xfrm_fill_dst(xdst, dev, fl);
2922         if (err)
2923                 goto free_dst;
2924
2925 out:
2926         return xdst;
2927
2928 free_dst:
2929         dst_release(dst1);
2930         xdst = ERR_PTR(err);
2931         goto out;
2932 }
2933
2934 static struct xfrm_dst *xfrm_bundle_lookup(struct net *net,
2935                                            const struct flowi *fl,
2936                                            u16 family, u8 dir,
2937                                            struct xfrm_flo *xflo, u32 if_id)
2938 {
2939         struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
2940         int num_pols = 0, num_xfrms = 0, err;
2941         struct xfrm_dst *xdst;
2942
2943         /* Resolve policies to use if we couldn't get them from
2944          * previous cache entry */
2945         num_pols = 1;
2946         pols[0] = xfrm_policy_lookup(net, fl, family, dir, if_id);
2947         err = xfrm_expand_policies(fl, family, pols,
2948                                            &num_pols, &num_xfrms);
2949         if (err < 0)
2950                 goto inc_error;
2951         if (num_pols == 0)
2952                 return NULL;
2953         if (num_xfrms <= 0)
2954                 goto make_dummy_bundle;
2955
2956         xdst = xfrm_resolve_and_create_bundle(pols, num_pols, fl, family,
2957                                               xflo->dst_orig);
2958         if (IS_ERR(xdst)) {
2959                 err = PTR_ERR(xdst);
2960                 if (err == -EREMOTE) {
2961                         xfrm_pols_put(pols, num_pols);
2962                         return NULL;
2963                 }
2964
2965                 if (err != -EAGAIN)
2966                         goto error;
2967                 goto make_dummy_bundle;
2968         } else if (xdst == NULL) {
2969                 num_xfrms = 0;
2970                 goto make_dummy_bundle;
2971         }
2972
2973         return xdst;
2974
2975 make_dummy_bundle:
2976         /* We found policies, but there's no bundles to instantiate:
2977          * either because the policy blocks, has no transformations or
2978          * we could not build template (no xfrm_states).*/
2979         xdst = xfrm_create_dummy_bundle(net, xflo, fl, num_xfrms, family);
2980         if (IS_ERR(xdst)) {
2981                 xfrm_pols_put(pols, num_pols);
2982                 return ERR_CAST(xdst);
2983         }
2984         xdst->num_pols = num_pols;
2985         xdst->num_xfrms = num_xfrms;
2986         memcpy(xdst->pols, pols, sizeof(struct xfrm_policy *) * num_pols);
2987
2988         return xdst;
2989
2990 inc_error:
2991         XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLERROR);
2992 error:
2993         xfrm_pols_put(pols, num_pols);
2994         return ERR_PTR(err);
2995 }
2996
2997 static struct dst_entry *make_blackhole(struct net *net, u16 family,
2998                                         struct dst_entry *dst_orig)
2999 {
3000         const struct xfrm_policy_afinfo *afinfo = xfrm_policy_get_afinfo(family);
3001         struct dst_entry *ret;
3002
3003         if (!afinfo) {
3004                 dst_release(dst_orig);
3005                 return ERR_PTR(-EINVAL);
3006         } else {
3007                 ret = afinfo->blackhole_route(net, dst_orig);
3008         }
3009         rcu_read_unlock();
3010
3011         return ret;
3012 }
3013
3014 /* Finds/creates a bundle for given flow and if_id
3015  *
3016  * At the moment we eat a raw IP route. Mostly to speed up lookups
3017  * on interfaces with disabled IPsec.
3018  *
3019  * xfrm_lookup uses an if_id of 0 by default, and is provided for
3020  * compatibility
3021  */
3022 struct dst_entry *xfrm_lookup_with_ifid(struct net *net,
3023                                         struct dst_entry *dst_orig,
3024                                         const struct flowi *fl,
3025                                         const struct sock *sk,
3026                                         int flags, u32 if_id)
3027 {
3028         struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
3029         struct xfrm_dst *xdst;
3030         struct dst_entry *dst, *route;
3031         u16 family = dst_orig->ops->family;
3032         u8 dir = XFRM_POLICY_OUT;
3033         int i, err, num_pols, num_xfrms = 0, drop_pols = 0;
3034
3035         dst = NULL;
3036         xdst = NULL;
3037         route = NULL;
3038
3039         sk = sk_const_to_full_sk(sk);
3040         if (sk && sk->sk_policy[XFRM_POLICY_OUT]) {
3041                 num_pols = 1;
3042                 pols[0] = xfrm_sk_policy_lookup(sk, XFRM_POLICY_OUT, fl, family,
3043                                                 if_id);
3044                 err = xfrm_expand_policies(fl, family, pols,
3045                                            &num_pols, &num_xfrms);
3046                 if (err < 0)
3047                         goto dropdst;
3048
3049                 if (num_pols) {
3050                         if (num_xfrms <= 0) {
3051                                 drop_pols = num_pols;
3052                                 goto no_transform;
3053                         }
3054
3055                         xdst = xfrm_resolve_and_create_bundle(
3056                                         pols, num_pols, fl,
3057                                         family, dst_orig);
3058
3059                         if (IS_ERR(xdst)) {
3060                                 xfrm_pols_put(pols, num_pols);
3061                                 err = PTR_ERR(xdst);
3062                                 if (err == -EREMOTE)
3063                                         goto nopol;
3064
3065                                 goto dropdst;
3066                         } else if (xdst == NULL) {
3067                                 num_xfrms = 0;
3068                                 drop_pols = num_pols;
3069                                 goto no_transform;
3070                         }
3071
3072                         route = xdst->route;
3073                 }
3074         }
3075
3076         if (xdst == NULL) {
3077                 struct xfrm_flo xflo;
3078
3079                 xflo.dst_orig = dst_orig;
3080                 xflo.flags = flags;
3081
3082                 /* To accelerate a bit...  */
3083                 if (!if_id && ((dst_orig->flags & DST_NOXFRM) ||
3084                                !net->xfrm.policy_count[XFRM_POLICY_OUT]))
3085                         goto nopol;
3086
3087                 xdst = xfrm_bundle_lookup(net, fl, family, dir, &xflo, if_id);
3088                 if (xdst == NULL)
3089                         goto nopol;
3090                 if (IS_ERR(xdst)) {
3091                         err = PTR_ERR(xdst);
3092                         goto dropdst;
3093                 }
3094
3095                 num_pols = xdst->num_pols;
3096                 num_xfrms = xdst->num_xfrms;
3097                 memcpy(pols, xdst->pols, sizeof(struct xfrm_policy *) * num_pols);
3098                 route = xdst->route;
3099         }
3100
3101         dst = &xdst->u.dst;
3102         if (route == NULL && num_xfrms > 0) {
3103                 /* The only case when xfrm_bundle_lookup() returns a
3104                  * bundle with null route, is when the template could
3105                  * not be resolved. It means policies are there, but
3106                  * bundle could not be created, since we don't yet
3107                  * have the xfrm_state's. We need to wait for KM to
3108                  * negotiate new SA's or bail out with error.*/
3109                 if (net->xfrm.sysctl_larval_drop) {
3110                         XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
3111                         err = -EREMOTE;
3112                         goto error;
3113                 }
3114
3115                 err = -EAGAIN;
3116
3117                 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTNOSTATES);
3118                 goto error;
3119         }
3120
3121 no_transform:
3122         if (num_pols == 0)
3123                 goto nopol;
3124
3125         if ((flags & XFRM_LOOKUP_ICMP) &&
3126             !(pols[0]->flags & XFRM_POLICY_ICMP)) {
3127                 err = -ENOENT;
3128                 goto error;
3129         }
3130
3131         for (i = 0; i < num_pols; i++)
3132                 pols[i]->curlft.use_time = ktime_get_real_seconds();
3133
3134         if (num_xfrms < 0) {
3135                 /* Prohibit the flow */
3136                 XFRM_INC_STATS(net, LINUX_MIB_XFRMOUTPOLBLOCK);
3137                 err = -EPERM;
3138                 goto error;
3139         } else if (num_xfrms > 0) {
3140                 /* Flow transformed */
3141                 dst_release(dst_orig);
3142         } else {
3143                 /* Flow passes untransformed */
3144                 dst_release(dst);
3145                 dst = dst_orig;
3146         }
3147 ok:
3148         xfrm_pols_put(pols, drop_pols);
3149         if (dst && dst->xfrm &&
3150             dst->xfrm->props.mode == XFRM_MODE_TUNNEL)
3151                 dst->flags |= DST_XFRM_TUNNEL;
3152         return dst;
3153
3154 nopol:
3155         if (!(flags & XFRM_LOOKUP_ICMP)) {
3156                 dst = dst_orig;
3157                 goto ok;
3158         }
3159         err = -ENOENT;
3160 error:
3161         dst_release(dst);
3162 dropdst:
3163         if (!(flags & XFRM_LOOKUP_KEEP_DST_REF))
3164                 dst_release(dst_orig);
3165         xfrm_pols_put(pols, drop_pols);
3166         return ERR_PTR(err);
3167 }
3168 EXPORT_SYMBOL(xfrm_lookup_with_ifid);
3169
3170 /* Main function: finds/creates a bundle for given flow.
3171  *
3172  * At the moment we eat a raw IP route. Mostly to speed up lookups
3173  * on interfaces with disabled IPsec.
3174  */
3175 struct dst_entry *xfrm_lookup(struct net *net, struct dst_entry *dst_orig,
3176                               const struct flowi *fl, const struct sock *sk,
3177                               int flags)
3178 {
3179         return xfrm_lookup_with_ifid(net, dst_orig, fl, sk, flags, 0);
3180 }
3181 EXPORT_SYMBOL(xfrm_lookup);
3182
3183 /* Callers of xfrm_lookup_route() must ensure a call to dst_output().
3184  * Otherwise we may send out blackholed packets.
3185  */
3186 struct dst_entry *xfrm_lookup_route(struct net *net, struct dst_entry *dst_orig,
3187                                     const struct flowi *fl,
3188                                     const struct sock *sk, int flags)
3189 {
3190         struct dst_entry *dst = xfrm_lookup(net, dst_orig, fl, sk,
3191                                             flags | XFRM_LOOKUP_QUEUE |
3192                                             XFRM_LOOKUP_KEEP_DST_REF);
3193
3194         if (IS_ERR(dst) && PTR_ERR(dst) == -EREMOTE)
3195                 return make_blackhole(net, dst_orig->ops->family, dst_orig);
3196
3197         if (IS_ERR(dst))
3198                 dst_release(dst_orig);
3199
3200         return dst;
3201 }
3202 EXPORT_SYMBOL(xfrm_lookup_route);
3203
3204 static inline int
3205 xfrm_secpath_reject(int idx, struct sk_buff *skb, const struct flowi *fl)
3206 {
3207         struct sec_path *sp = skb_sec_path(skb);
3208         struct xfrm_state *x;
3209
3210         if (!sp || idx < 0 || idx >= sp->len)
3211                 return 0;
3212         x = sp->xvec[idx];
3213         if (!x->type->reject)
3214                 return 0;
3215         return x->type->reject(x, skb, fl);
3216 }
3217
3218 /* When skb is transformed back to its "native" form, we have to
3219  * check policy restrictions. At the moment we make this in maximally
3220  * stupid way. Shame on me. :-) Of course, connected sockets must
3221  * have policy cached at them.
3222  */
3223
3224 static inline int
3225 xfrm_state_ok(const struct xfrm_tmpl *tmpl, const struct xfrm_state *x,
3226               unsigned short family, u32 if_id)
3227 {
3228         if (xfrm_state_kern(x))
3229                 return tmpl->optional && !xfrm_state_addr_cmp(tmpl, x, tmpl->encap_family);
3230         return  x->id.proto == tmpl->id.proto &&
3231                 (x->id.spi == tmpl->id.spi || !tmpl->id.spi) &&
3232                 (x->props.reqid == tmpl->reqid || !tmpl->reqid) &&
3233                 x->props.mode == tmpl->mode &&
3234                 (tmpl->allalgs || (tmpl->aalgos & (1<<x->props.aalgo)) ||
3235                  !(xfrm_id_proto_match(tmpl->id.proto, IPSEC_PROTO_ANY))) &&
3236                 !(x->props.mode != XFRM_MODE_TRANSPORT &&
3237                   xfrm_state_addr_cmp(tmpl, x, family)) &&
3238                 (if_id == 0 || if_id == x->if_id);
3239 }
3240
3241 /*
3242  * 0 or more than 0 is returned when validation is succeeded (either bypass
3243  * because of optional transport mode, or next index of the mathced secpath
3244  * state with the template.
3245  * -1 is returned when no matching template is found.
3246  * Otherwise "-2 - errored_index" is returned.
3247  */
3248 static inline int
3249 xfrm_policy_ok(const struct xfrm_tmpl *tmpl, const struct sec_path *sp, int start,
3250                unsigned short family, u32 if_id)
3251 {
3252         int idx = start;
3253
3254         if (tmpl->optional) {
3255                 if (tmpl->mode == XFRM_MODE_TRANSPORT)
3256                         return start;
3257         } else
3258                 start = -1;
3259         for (; idx < sp->len; idx++) {
3260                 if (xfrm_state_ok(tmpl, sp->xvec[idx], family, if_id))
3261                         return ++idx;
3262                 if (sp->xvec[idx]->props.mode != XFRM_MODE_TRANSPORT) {
3263                         if (start == -1)
3264                                 start = -2-idx;
3265                         break;
3266                 }
3267         }
3268         return start;
3269 }
3270
3271 static void
3272 decode_session4(struct sk_buff *skb, struct flowi *fl, bool reverse)
3273 {
3274         const struct iphdr *iph = ip_hdr(skb);
3275         int ihl = iph->ihl;
3276         u8 *xprth = skb_network_header(skb) + ihl * 4;
3277         struct flowi4 *fl4 = &fl->u.ip4;
3278         int oif = 0;
3279
3280         if (skb_dst(skb) && skb_dst(skb)->dev)
3281                 oif = skb_dst(skb)->dev->ifindex;
3282
3283         memset(fl4, 0, sizeof(struct flowi4));
3284         fl4->flowi4_mark = skb->mark;
3285         fl4->flowi4_oif = reverse ? skb->skb_iif : oif;
3286
3287         fl4->flowi4_proto = iph->protocol;
3288         fl4->daddr = reverse ? iph->saddr : iph->daddr;
3289         fl4->saddr = reverse ? iph->daddr : iph->saddr;
3290         fl4->flowi4_tos = iph->tos & ~INET_ECN_MASK;
3291
3292         if (!ip_is_fragment(iph)) {
3293                 switch (iph->protocol) {
3294                 case IPPROTO_UDP:
3295                 case IPPROTO_UDPLITE:
3296                 case IPPROTO_TCP:
3297                 case IPPROTO_SCTP:
3298                 case IPPROTO_DCCP:
3299                         if (xprth + 4 < skb->data ||
3300                             pskb_may_pull(skb, xprth + 4 - skb->data)) {
3301                                 __be16 *ports;
3302
3303                                 xprth = skb_network_header(skb) + ihl * 4;
3304                                 ports = (__be16 *)xprth;
3305
3306                                 fl4->fl4_sport = ports[!!reverse];
3307                                 fl4->fl4_dport = ports[!reverse];
3308                         }
3309                         break;
3310                 case IPPROTO_ICMP:
3311                         if (xprth + 2 < skb->data ||
3312                             pskb_may_pull(skb, xprth + 2 - skb->data)) {
3313                                 u8 *icmp;
3314
3315                                 xprth = skb_network_header(skb) + ihl * 4;
3316                                 icmp = xprth;
3317
3318                                 fl4->fl4_icmp_type = icmp[0];
3319                                 fl4->fl4_icmp_code = icmp[1];
3320                         }
3321                         break;
3322                 case IPPROTO_ESP:
3323                         if (xprth + 4 < skb->data ||
3324                             pskb_may_pull(skb, xprth + 4 - skb->data)) {
3325                                 __be32 *ehdr;
3326
3327                                 xprth = skb_network_header(skb) + ihl * 4;
3328                                 ehdr = (__be32 *)xprth;
3329
3330                                 fl4->fl4_ipsec_spi = ehdr[0];
3331                         }
3332                         break;
3333                 case IPPROTO_AH:
3334                         if (xprth + 8 < skb->data ||
3335                             pskb_may_pull(skb, xprth + 8 - skb->data)) {
3336                                 __be32 *ah_hdr;
3337
3338                                 xprth = skb_network_header(skb) + ihl * 4;
3339                                 ah_hdr = (__be32 *)xprth;
3340
3341                                 fl4->fl4_ipsec_spi = ah_hdr[1];
3342                         }
3343                         break;
3344                 case IPPROTO_COMP:
3345                         if (xprth + 4 < skb->data ||
3346                             pskb_may_pull(skb, xprth + 4 - skb->data)) {
3347                                 __be16 *ipcomp_hdr;
3348
3349                                 xprth = skb_network_header(skb) + ihl * 4;
3350                                 ipcomp_hdr = (__be16 *)xprth;
3351
3352                                 fl4->fl4_ipsec_spi = htonl(ntohs(ipcomp_hdr[1]));
3353                         }
3354                         break;
3355                 case IPPROTO_GRE:
3356                         if (xprth + 12 < skb->data ||
3357                             pskb_may_pull(skb, xprth + 12 - skb->data)) {
3358                                 __be16 *greflags;
3359                                 __be32 *gre_hdr;
3360
3361                                 xprth = skb_network_header(skb) + ihl * 4;
3362                                 greflags = (__be16 *)xprth;
3363                                 gre_hdr = (__be32 *)xprth;
3364
3365                                 if (greflags[0] & GRE_KEY) {
3366                                         if (greflags[0] & GRE_CSUM)
3367                                                 gre_hdr++;
3368                                         fl4->fl4_gre_key = gre_hdr[1];
3369                                 }
3370                         }
3371                         break;
3372                 default:
3373                         fl4->fl4_ipsec_spi = 0;
3374                         break;
3375                 }
3376         }
3377 }
3378
3379 #if IS_ENABLED(CONFIG_IPV6)
3380 static void
3381 decode_session6(struct sk_buff *skb, struct flowi *fl, bool reverse)
3382 {
3383         struct flowi6 *fl6 = &fl->u.ip6;
3384         int onlyproto = 0;
3385         const struct ipv6hdr *hdr = ipv6_hdr(skb);
3386         u32 offset = sizeof(*hdr);
3387         struct ipv6_opt_hdr *exthdr;
3388         const unsigned char *nh = skb_network_header(skb);
3389         u16 nhoff = IP6CB(skb)->nhoff;
3390         int oif = 0;
3391         u8 nexthdr;
3392
3393         if (!nhoff)
3394                 nhoff = offsetof(struct ipv6hdr, nexthdr);
3395
3396         nexthdr = nh[nhoff];
3397
3398         if (skb_dst(skb) && skb_dst(skb)->dev)
3399                 oif = skb_dst(skb)->dev->ifindex;
3400
3401         memset(fl6, 0, sizeof(struct flowi6));
3402         fl6->flowi6_mark = skb->mark;
3403         fl6->flowi6_oif = reverse ? skb->skb_iif : oif;
3404
3405         fl6->daddr = reverse ? hdr->saddr : hdr->daddr;
3406         fl6->saddr = reverse ? hdr->daddr : hdr->saddr;
3407
3408         while (nh + offset + sizeof(*exthdr) < skb->data ||
3409                pskb_may_pull(skb, nh + offset + sizeof(*exthdr) - skb->data)) {
3410                 nh = skb_network_header(skb);
3411                 exthdr = (struct ipv6_opt_hdr *)(nh + offset);
3412
3413                 switch (nexthdr) {
3414                 case NEXTHDR_FRAGMENT:
3415                         onlyproto = 1;
3416                         /* fall through */
3417                 case NEXTHDR_ROUTING:
3418                 case NEXTHDR_HOP:
3419                 case NEXTHDR_DEST:
3420                         offset += ipv6_optlen(exthdr);
3421                         nexthdr = exthdr->nexthdr;
3422                         exthdr = (struct ipv6_opt_hdr *)(nh + offset);
3423                         break;
3424                 case IPPROTO_UDP:
3425                 case IPPROTO_UDPLITE:
3426                 case IPPROTO_TCP:
3427                 case IPPROTO_SCTP:
3428                 case IPPROTO_DCCP:
3429                         if (!onlyproto && (nh + offset + 4 < skb->data ||
3430                              pskb_may_pull(skb, nh + offset + 4 - skb->data))) {
3431                                 __be16 *ports;
3432
3433                                 nh = skb_network_header(skb);
3434                                 ports = (__be16 *)(nh + offset);
3435                                 fl6->fl6_sport = ports[!!reverse];
3436                                 fl6->fl6_dport = ports[!reverse];
3437                         }
3438                         fl6->flowi6_proto = nexthdr;
3439                         return;
3440                 case IPPROTO_ICMPV6:
3441                         if (!onlyproto && (nh + offset + 2 < skb->data ||
3442                             pskb_may_pull(skb, nh + offset + 2 - skb->data))) {
3443                                 u8 *icmp;
3444
3445                                 nh = skb_network_header(skb);
3446                                 icmp = (u8 *)(nh + offset);
3447                                 fl6->fl6_icmp_type = icmp[0];
3448                                 fl6->fl6_icmp_code = icmp[1];
3449                         }
3450                         fl6->flowi6_proto = nexthdr;
3451                         return;
3452                 case IPPROTO_GRE:
3453                         if (!onlyproto &&
3454                             (nh + offset + 12 < skb->data ||
3455                              pskb_may_pull(skb, nh + offset + 12 - skb->data))) {
3456                                 struct gre_base_hdr *gre_hdr;
3457                                 __be32 *gre_key;
3458
3459                                 nh = skb_network_header(skb);
3460                                 gre_hdr = (struct gre_base_hdr *)(nh + offset);
3461                                 gre_key = (__be32 *)(gre_hdr + 1);
3462
3463                                 if (gre_hdr->flags & GRE_KEY) {
3464                                         if (gre_hdr->flags & GRE_CSUM)
3465                                                 gre_key++;
3466                                         fl6->fl6_gre_key = *gre_key;
3467                                 }
3468                         }
3469                         fl6->flowi6_proto = nexthdr;
3470                         return;
3471
3472 #if IS_ENABLED(CONFIG_IPV6_MIP6)
3473                 case IPPROTO_MH:
3474                         offset += ipv6_optlen(exthdr);
3475                         if (!onlyproto && (nh + offset + 3 < skb->data ||
3476                             pskb_may_pull(skb, nh + offset + 3 - skb->data))) {
3477                                 struct ip6_mh *mh;
3478
3479                                 nh = skb_network_header(skb);
3480                                 mh = (struct ip6_mh *)(nh + offset);
3481                                 fl6->fl6_mh_type = mh->ip6mh_type;
3482                         }
3483                         fl6->flowi6_proto = nexthdr;
3484                         return;
3485 #endif
3486                 /* XXX Why are there these headers? */
3487                 case IPPROTO_AH:
3488                 case IPPROTO_ESP:
3489                 case IPPROTO_COMP:
3490                 default:
3491                         fl6->fl6_ipsec_spi = 0;
3492                         fl6->flowi6_proto = nexthdr;
3493                         return;
3494                 }
3495         }
3496 }
3497 #endif
3498
3499 int __xfrm_decode_session(struct sk_buff *skb, struct flowi *fl,
3500                           unsigned int family, int reverse)
3501 {
3502         switch (family) {
3503         case AF_INET:
3504                 decode_session4(skb, fl, reverse);
3505                 break;
3506 #if IS_ENABLED(CONFIG_IPV6)
3507         case AF_INET6:
3508                 decode_session6(skb, fl, reverse);
3509                 break;
3510 #endif
3511         default:
3512                 return -EAFNOSUPPORT;
3513         }
3514
3515         return security_xfrm_decode_session(skb, &fl->flowi_secid);
3516 }
3517 EXPORT_SYMBOL(__xfrm_decode_session);
3518
3519 static inline int secpath_has_nontransport(const struct sec_path *sp, int k, int *idxp)
3520 {
3521         for (; k < sp->len; k++) {
3522                 if (sp->xvec[k]->props.mode != XFRM_MODE_TRANSPORT) {
3523                         *idxp = k;
3524                         return 1;
3525                 }
3526         }
3527
3528         return 0;
3529 }
3530
3531 int __xfrm_policy_check(struct sock *sk, int dir, struct sk_buff *skb,
3532                         unsigned short family)
3533 {
3534         struct net *net = dev_net(skb->dev);
3535         struct xfrm_policy *pol;
3536         struct xfrm_policy *pols[XFRM_POLICY_TYPE_MAX];
3537         int npols = 0;
3538         int xfrm_nr;
3539         int pi;
3540         int reverse;
3541         struct flowi fl;
3542         int xerr_idx = -1;
3543         const struct xfrm_if_cb *ifcb;
3544         struct sec_path *sp;
3545         struct xfrm_if *xi;
3546         u32 if_id = 0;
3547
3548         rcu_read_lock();
3549         ifcb = xfrm_if_get_cb();
3550
3551         if (ifcb) {
3552                 xi = ifcb->decode_session(skb, family);
3553                 if (xi) {
3554                         if_id = xi->p.if_id;
3555                         net = xi->net;
3556                 }
3557         }
3558         rcu_read_unlock();
3559
3560         reverse = dir & ~XFRM_POLICY_MASK;
3561         dir &= XFRM_POLICY_MASK;
3562
3563         if (__xfrm_decode_session(skb, &fl, family, reverse) < 0) {
3564                 XFRM_INC_STATS(net, LINUX_MIB_XFRMINHDRERROR);
3565                 return 0;
3566         }
3567
3568         nf_nat_decode_session(skb, &fl, family);
3569
3570         /* First, check used SA against their selectors. */
3571         sp = skb_sec_path(skb);
3572         if (sp) {
3573                 int i;
3574
3575                 for (i = sp->len - 1; i >= 0; i--) {
3576                         struct xfrm_state *x = sp->xvec[i];
3577                         if (!xfrm_selector_match(&x->sel, &fl, family)) {
3578                                 XFRM_INC_STATS(net, LINUX_MIB_XFRMINSTATEMISMATCH);
3579                                 return 0;
3580                         }
3581                 }
3582         }
3583
3584         pol = NULL;
3585         sk = sk_to_full_sk(sk);
3586         if (sk && sk->sk_policy[dir]) {
3587                 pol = xfrm_sk_policy_lookup(sk, dir, &fl, family, if_id);
3588                 if (IS_ERR(pol)) {
3589                         XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
3590                         return 0;
3591                 }
3592         }
3593
3594         if (!pol)
3595                 pol = xfrm_policy_lookup(net, &fl, family, dir, if_id);
3596
3597         if (IS_ERR(pol)) {
3598                 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
3599                 return 0;
3600         }
3601
3602         if (!pol) {
3603                 if (sp && secpath_has_nontransport(sp, 0, &xerr_idx)) {
3604                         xfrm_secpath_reject(xerr_idx, skb, &fl);
3605                         XFRM_INC_STATS(net, LINUX_MIB_XFRMINNOPOLS);
3606                         return 0;
3607                 }
3608                 return 1;
3609         }
3610
3611         pol->curlft.use_time = ktime_get_real_seconds();
3612
3613         pols[0] = pol;
3614         npols++;
3615 #ifdef CONFIG_XFRM_SUB_POLICY
3616         if (pols[0]->type != XFRM_POLICY_TYPE_MAIN) {
3617                 pols[1] = xfrm_policy_lookup_bytype(net, XFRM_POLICY_TYPE_MAIN,
3618                                                     &fl, family,
3619                                                     XFRM_POLICY_IN, if_id);
3620                 if (pols[1]) {
3621                         if (IS_ERR(pols[1])) {
3622                                 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLERROR);
3623                                 xfrm_pol_put(pols[0]);
3624                                 return 0;
3625                         }
3626                         pols[1]->curlft.use_time = ktime_get_real_seconds();
3627                         npols++;
3628                 }
3629         }
3630 #endif
3631
3632         if (pol->action == XFRM_POLICY_ALLOW) {
3633                 static struct sec_path dummy;
3634                 struct xfrm_tmpl *tp[XFRM_MAX_DEPTH];
3635                 struct xfrm_tmpl *stp[XFRM_MAX_DEPTH];
3636                 struct xfrm_tmpl **tpp = tp;
3637                 int ti = 0;
3638                 int i, k;
3639
3640                 sp = skb_sec_path(skb);
3641                 if (!sp)
3642                         sp = &dummy;
3643
3644                 for (pi = 0; pi < npols; pi++) {
3645                         if (pols[pi] != pol &&
3646                             pols[pi]->action != XFRM_POLICY_ALLOW) {
3647                                 XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
3648                                 goto reject;
3649                         }
3650                         if (ti + pols[pi]->xfrm_nr >= XFRM_MAX_DEPTH) {
3651                                 XFRM_INC_STATS(net, LINUX_MIB_XFRMINBUFFERERROR);
3652                                 goto reject_error;
3653                         }
3654                         for (i = 0; i < pols[pi]->xfrm_nr; i++)
3655                                 tpp[ti++] = &pols[pi]->xfrm_vec[i];
3656                 }
3657                 xfrm_nr = ti;
3658                 if (npols > 1) {
3659                         xfrm_tmpl_sort(stp, tpp, xfrm_nr, family);
3660                         tpp = stp;
3661                 }
3662
3663                 /* For each tunnel xfrm, find the first matching tmpl.
3664                  * For each tmpl before that, find corresponding xfrm.
3665                  * Order is _important_. Later we will implement
3666                  * some barriers, but at the moment barriers
3667                  * are implied between each two transformations.
3668                  */
3669                 for (i = xfrm_nr-1, k = 0; i >= 0; i--) {
3670                         k = xfrm_policy_ok(tpp[i], sp, k, family, if_id);
3671                         if (k < 0) {
3672                                 if (k < -1)
3673                                         /* "-2 - errored_index" returned */
3674                                         xerr_idx = -(2+k);
3675                                 XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
3676                                 goto reject;
3677                         }
3678                 }
3679
3680                 if (secpath_has_nontransport(sp, k, &xerr_idx)) {
3681                         XFRM_INC_STATS(net, LINUX_MIB_XFRMINTMPLMISMATCH);
3682                         goto reject;
3683                 }
3684
3685                 xfrm_pols_put(pols, npols);
3686                 return 1;
3687         }
3688         XFRM_INC_STATS(net, LINUX_MIB_XFRMINPOLBLOCK);
3689
3690 reject:
3691         xfrm_secpath_reject(xerr_idx, skb, &fl);
3692 reject_error:
3693         xfrm_pols_put(pols, npols);
3694         return 0;
3695 }
3696 EXPORT_SYMBOL(__xfrm_policy_check);
3697
3698 int __xfrm_route_forward(struct sk_buff *skb, unsigned short family)
3699 {
3700         struct net *net = dev_net(skb->dev);
3701         struct flowi fl;
3702         struct dst_entry *dst;
3703         int res = 1;
3704
3705         if (xfrm_decode_session(skb, &fl, family) < 0) {
3706                 XFRM_INC_STATS(net, LINUX_MIB_XFRMFWDHDRERROR);
3707                 return 0;
3708         }
3709
3710         skb_dst_force(skb);
3711         if (!skb_dst(skb)) {
3712                 XFRM_INC_STATS(net, LINUX_MIB_XFRMFWDHDRERROR);
3713                 return 0;
3714         }
3715
3716         dst = xfrm_lookup(net, skb_dst(skb), &fl, NULL, XFRM_LOOKUP_QUEUE);
3717         if (IS_ERR(dst)) {
3718                 res = 0;
3719                 dst = NULL;
3720         }
3721         skb_dst_set(skb, dst);
3722         return res;
3723 }
3724 EXPORT_SYMBOL(__xfrm_route_forward);
3725
3726 /* Optimize later using cookies and generation ids. */
3727
3728 static struct dst_entry *xfrm_dst_check(struct dst_entry *dst, u32 cookie)
3729 {
3730         /* Code (such as __xfrm4_bundle_create()) sets dst->obsolete
3731          * to DST_OBSOLETE_FORCE_CHK to force all XFRM destinations to
3732          * get validated by dst_ops->check on every use.  We do this
3733          * because when a normal route referenced by an XFRM dst is
3734          * obsoleted we do not go looking around for all parent
3735          * referencing XFRM dsts so that we can invalidate them.  It
3736          * is just too much work.  Instead we make the checks here on
3737          * every use.  For example:
3738          *
3739          *      XFRM dst A --> IPv4 dst X
3740          *
3741          * X is the "xdst->route" of A (X is also the "dst->path" of A
3742          * in this example).  If X is marked obsolete, "A" will not
3743          * notice.  That's what we are validating here via the
3744          * stale_bundle() check.
3745          *
3746          * When a dst is removed from the fib tree, DST_OBSOLETE_DEAD will
3747          * be marked on it.
3748          * This will force stale_bundle() to fail on any xdst bundle with
3749          * this dst linked in it.
3750          */
3751         if (dst->obsolete < 0 && !stale_bundle(dst))
3752                 return dst;
3753
3754         return NULL;
3755 }
3756
3757 static int stale_bundle(struct dst_entry *dst)
3758 {
3759         return !xfrm_bundle_ok((struct xfrm_dst *)dst);
3760 }
3761
3762 void xfrm_dst_ifdown(struct dst_entry *dst, struct net_device *dev)
3763 {
3764         while ((dst = xfrm_dst_child(dst)) && dst->xfrm && dst->dev == dev) {
3765                 dst->dev = dev_net(dev)->loopback_dev;
3766                 dev_hold(dst->dev);
3767                 dev_put(dev);
3768         }
3769 }
3770 EXPORT_SYMBOL(xfrm_dst_ifdown);
3771
3772 static void xfrm_link_failure(struct sk_buff *skb)
3773 {
3774         /* Impossible. Such dst must be popped before reaches point of failure. */
3775 }
3776
3777 static struct dst_entry *xfrm_negative_advice(struct dst_entry *dst)
3778 {
3779         if (dst) {
3780                 if (dst->obsolete) {
3781                         dst_release(dst);
3782                         dst = NULL;
3783                 }
3784         }
3785         return dst;
3786 }
3787
3788 static void xfrm_init_pmtu(struct xfrm_dst **bundle, int nr)
3789 {
3790         while (nr--) {
3791                 struct xfrm_dst *xdst = bundle[nr];
3792                 u32 pmtu, route_mtu_cached;
3793                 struct dst_entry *dst;
3794
3795                 dst = &xdst->u.dst;
3796                 pmtu = dst_mtu(xfrm_dst_child(dst));
3797                 xdst->child_mtu_cached = pmtu;
3798
3799                 pmtu = xfrm_state_mtu(dst->xfrm, pmtu);
3800
3801                 route_mtu_cached = dst_mtu(xdst->route);
3802                 xdst->route_mtu_cached = route_mtu_cached;
3803
3804                 if (pmtu > route_mtu_cached)
3805                         pmtu = route_mtu_cached;
3806
3807                 dst_metric_set(dst, RTAX_MTU, pmtu);
3808         }
3809 }
3810
3811 /* Check that the bundle accepts the flow and its components are
3812  * still valid.
3813  */
3814
3815 static int xfrm_bundle_ok(struct xfrm_dst *first)
3816 {
3817         struct xfrm_dst *bundle[XFRM_MAX_DEPTH];
3818         struct dst_entry *dst = &first->u.dst;
3819         struct xfrm_dst *xdst;
3820         int start_from, nr;
3821         u32 mtu;
3822
3823         if (!dst_check(xfrm_dst_path(dst), ((struct xfrm_dst *)dst)->path_cookie) ||
3824             (dst->dev && !netif_running(dst->dev)))
3825                 return 0;
3826
3827         if (dst->flags & DST_XFRM_QUEUE)
3828                 return 1;
3829
3830         start_from = nr = 0;
3831         do {
3832                 struct xfrm_dst *xdst = (struct xfrm_dst *)dst;
3833
3834                 if (dst->xfrm->km.state != XFRM_STATE_VALID)
3835                         return 0;
3836                 if (xdst->xfrm_genid != dst->xfrm->genid)
3837                         return 0;
3838                 if (xdst->num_pols > 0 &&
3839                     xdst->policy_genid != atomic_read(&xdst->pols[0]->genid))
3840                         return 0;
3841
3842                 bundle[nr++] = xdst;
3843
3844                 mtu = dst_mtu(xfrm_dst_child(dst));
3845                 if (xdst->child_mtu_cached != mtu) {
3846                         start_from = nr;
3847                         xdst->child_mtu_cached = mtu;
3848                 }
3849
3850                 if (!dst_check(xdst->route, xdst->route_cookie))
3851                         return 0;
3852                 mtu = dst_mtu(xdst->route);
3853                 if (xdst->route_mtu_cached != mtu) {
3854                         start_from = nr;
3855                         xdst->route_mtu_cached = mtu;
3856                 }
3857
3858                 dst = xfrm_dst_child(dst);
3859         } while (dst->xfrm);
3860
3861         if (likely(!start_from))
3862                 return 1;
3863
3864         xdst = bundle[start_from - 1];
3865         mtu = xdst->child_mtu_cached;
3866         while (start_from--) {
3867                 dst = &xdst->u.dst;
3868
3869                 mtu = xfrm_state_mtu(dst->xfrm, mtu);
3870                 if (mtu > xdst->route_mtu_cached)
3871                         mtu = xdst->route_mtu_cached;
3872                 dst_metric_set(dst, RTAX_MTU, mtu);
3873                 if (!start_from)
3874                         break;
3875
3876                 xdst = bundle[start_from - 1];
3877                 xdst->child_mtu_cached = mtu;
3878         }
3879
3880         return 1;
3881 }
3882
3883 static unsigned int xfrm_default_advmss(const struct dst_entry *dst)
3884 {
3885         return dst_metric_advmss(xfrm_dst_path(dst));
3886 }
3887
3888 static unsigned int xfrm_mtu(const struct dst_entry *dst)
3889 {
3890         unsigned int mtu = dst_metric_raw(dst, RTAX_MTU);
3891
3892         return mtu ? : dst_mtu(xfrm_dst_path(dst));
3893 }
3894
3895 static const void *xfrm_get_dst_nexthop(const struct dst_entry *dst,
3896                                         const void *daddr)
3897 {
3898         while (dst->xfrm) {
3899                 const struct xfrm_state *xfrm = dst->xfrm;
3900
3901                 dst = xfrm_dst_child(dst);
3902
3903                 if (xfrm->props.mode == XFRM_MODE_TRANSPORT)
3904                         continue;
3905                 if (xfrm->type->flags & XFRM_TYPE_REMOTE_COADDR)
3906                         daddr = xfrm->coaddr;
3907                 else if (!(xfrm->type->flags & XFRM_TYPE_LOCAL_COADDR))
3908                         daddr = &xfrm->id.daddr;
3909         }
3910         return daddr;
3911 }
3912
3913 static struct neighbour *xfrm_neigh_lookup(const struct dst_entry *dst,
3914                                            struct sk_buff *skb,
3915                                            const void *daddr)
3916 {
3917         const struct dst_entry *path = xfrm_dst_path(dst);
3918
3919         if (!skb)
3920                 daddr = xfrm_get_dst_nexthop(dst, daddr);
3921         return path->ops->neigh_lookup(path, skb, daddr);
3922 }
3923
3924 static void xfrm_confirm_neigh(const struct dst_entry *dst, const void *daddr)
3925 {
3926         const struct dst_entry *path = xfrm_dst_path(dst);
3927
3928         daddr = xfrm_get_dst_nexthop(dst, daddr);
3929         path->ops->confirm_neigh(path, daddr);
3930 }
3931
3932 int xfrm_policy_register_afinfo(const struct xfrm_policy_afinfo *afinfo, int family)
3933 {
3934         int err = 0;
3935
3936         if (WARN_ON(family >= ARRAY_SIZE(xfrm_policy_afinfo)))
3937                 return -EAFNOSUPPORT;
3938
3939         spin_lock(&xfrm_policy_afinfo_lock);
3940         if (unlikely(xfrm_policy_afinfo[family] != NULL))
3941                 err = -EEXIST;
3942         else {
3943                 struct dst_ops *dst_ops = afinfo->dst_ops;
3944                 if (likely(dst_ops->kmem_cachep == NULL))
3945                         dst_ops->kmem_cachep = xfrm_dst_cache;
3946                 if (likely(dst_ops->check == NULL))
3947                         dst_ops->check = xfrm_dst_check;
3948                 if (likely(dst_ops->default_advmss == NULL))
3949                         dst_ops->default_advmss = xfrm_default_advmss;
3950                 if (likely(dst_ops->mtu == NULL))
3951                         dst_ops->mtu = xfrm_mtu;
3952                 if (likely(dst_ops->negative_advice == NULL))
3953                         dst_ops->negative_advice = xfrm_negative_advice;
3954                 if (likely(dst_ops->link_failure == NULL))
3955                         dst_ops->link_failure = xfrm_link_failure;
3956                 if (likely(dst_ops->neigh_lookup == NULL))
3957                         dst_ops->neigh_lookup = xfrm_neigh_lookup;
3958                 if (likely(!dst_ops->confirm_neigh))
3959                         dst_ops->confirm_neigh = xfrm_confirm_neigh;
3960                 rcu_assign_pointer(xfrm_policy_afinfo[family], afinfo);
3961         }
3962         spin_unlock(&xfrm_policy_afinfo_lock);
3963
3964         return err;
3965 }
3966 EXPORT_SYMBOL(xfrm_policy_register_afinfo);
3967
3968 void xfrm_policy_unregister_afinfo(const struct xfrm_policy_afinfo *afinfo)
3969 {
3970         struct dst_ops *dst_ops = afinfo->dst_ops;
3971         int i;
3972
3973         for (i = 0; i < ARRAY_SIZE(xfrm_policy_afinfo); i++) {
3974                 if (xfrm_policy_afinfo[i] != afinfo)
3975                         continue;
3976                 RCU_INIT_POINTER(xfrm_policy_afinfo[i], NULL);
3977                 break;
3978         }
3979
3980         synchronize_rcu();
3981
3982         dst_ops->kmem_cachep = NULL;
3983         dst_ops->check = NULL;
3984         dst_ops->negative_advice = NULL;
3985         dst_ops->link_failure = NULL;
3986 }
3987 EXPORT_SYMBOL(xfrm_policy_unregister_afinfo);
3988
3989 void xfrm_if_register_cb(const struct xfrm_if_cb *ifcb)
3990 {
3991         spin_lock(&xfrm_if_cb_lock);
3992         rcu_assign_pointer(xfrm_if_cb, ifcb);
3993         spin_unlock(&xfrm_if_cb_lock);
3994 }
3995 EXPORT_SYMBOL(xfrm_if_register_cb);
3996
3997 void xfrm_if_unregister_cb(void)
3998 {
3999         RCU_INIT_POINTER(xfrm_if_cb, NULL);
4000         synchronize_rcu();
4001 }
4002 EXPORT_SYMBOL(xfrm_if_unregister_cb);
4003
4004 #ifdef CONFIG_XFRM_STATISTICS
4005 static int __net_init xfrm_statistics_init(struct net *net)
4006 {
4007         int rv;
4008         net->mib.xfrm_statistics = alloc_percpu(struct linux_xfrm_mib);
4009         if (!net->mib.xfrm_statistics)
4010                 return -ENOMEM;
4011         rv = xfrm_proc_init(net);
4012         if (rv < 0)
4013                 free_percpu(net->mib.xfrm_statistics);
4014         return rv;
4015 }
4016
4017 static void xfrm_statistics_fini(struct net *net)
4018 {
4019         xfrm_proc_fini(net);
4020         free_percpu(net->mib.xfrm_statistics);
4021 }
4022 #else
4023 static int __net_init xfrm_statistics_init(struct net *net)
4024 {
4025         return 0;
4026 }
4027
4028 static void xfrm_statistics_fini(struct net *net)
4029 {
4030 }
4031 #endif
4032
4033 static int __net_init xfrm_policy_init(struct net *net)
4034 {
4035         unsigned int hmask, sz;
4036         int dir, err;
4037
4038         if (net_eq(net, &init_net)) {
4039                 xfrm_dst_cache = kmem_cache_create("xfrm_dst_cache",
4040                                            sizeof(struct xfrm_dst),
4041                                            0, SLAB_HWCACHE_ALIGN|SLAB_PANIC,
4042                                            NULL);
4043                 err = rhashtable_init(&xfrm_policy_inexact_table,
4044                                       &xfrm_pol_inexact_params);
4045                 BUG_ON(err);
4046         }
4047
4048         hmask = 8 - 1;
4049         sz = (hmask+1) * sizeof(struct hlist_head);
4050
4051         net->xfrm.policy_byidx = xfrm_hash_alloc(sz);
4052         if (!net->xfrm.policy_byidx)
4053                 goto out_byidx;
4054         net->xfrm.policy_idx_hmask = hmask;
4055
4056         for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
4057                 struct xfrm_policy_hash *htab;
4058
4059                 net->xfrm.policy_count[dir] = 0;
4060                 net->xfrm.policy_count[XFRM_POLICY_MAX + dir] = 0;
4061                 INIT_HLIST_HEAD(&net->xfrm.policy_inexact[dir]);
4062
4063                 htab = &net->xfrm.policy_bydst[dir];
4064                 htab->table = xfrm_hash_alloc(sz);
4065                 if (!htab->table)
4066                         goto out_bydst;
4067                 htab->hmask = hmask;
4068                 htab->dbits4 = 32;
4069                 htab->sbits4 = 32;
4070                 htab->dbits6 = 128;
4071                 htab->sbits6 = 128;
4072         }
4073         net->xfrm.policy_hthresh.lbits4 = 32;
4074         net->xfrm.policy_hthresh.rbits4 = 32;
4075         net->xfrm.policy_hthresh.lbits6 = 128;
4076         net->xfrm.policy_hthresh.rbits6 = 128;
4077
4078         seqlock_init(&net->xfrm.policy_hthresh.lock);
4079
4080         INIT_LIST_HEAD(&net->xfrm.policy_all);
4081         INIT_LIST_HEAD(&net->xfrm.inexact_bins);
4082         INIT_WORK(&net->xfrm.policy_hash_work, xfrm_hash_resize);
4083         INIT_WORK(&net->xfrm.policy_hthresh.work, xfrm_hash_rebuild);
4084         return 0;
4085
4086 out_bydst:
4087         for (dir--; dir >= 0; dir--) {
4088                 struct xfrm_policy_hash *htab;
4089
4090                 htab = &net->xfrm.policy_bydst[dir];
4091                 xfrm_hash_free(htab->table, sz);
4092         }
4093         xfrm_hash_free(net->xfrm.policy_byidx, sz);
4094 out_byidx:
4095         return -ENOMEM;
4096 }
4097
4098 static void xfrm_policy_fini(struct net *net)
4099 {
4100         struct xfrm_pol_inexact_bin *b, *t;
4101         unsigned int sz;
4102         int dir;
4103
4104         flush_work(&net->xfrm.policy_hash_work);
4105 #ifdef CONFIG_XFRM_SUB_POLICY
4106         xfrm_policy_flush(net, XFRM_POLICY_TYPE_SUB, false);
4107 #endif
4108         xfrm_policy_flush(net, XFRM_POLICY_TYPE_MAIN, false);
4109
4110         WARN_ON(!list_empty(&net->xfrm.policy_all));
4111
4112         for (dir = 0; dir < XFRM_POLICY_MAX; dir++) {
4113                 struct xfrm_policy_hash *htab;
4114
4115                 WARN_ON(!hlist_empty(&net->xfrm.policy_inexact[dir]));
4116
4117                 htab = &net->xfrm.policy_bydst[dir];
4118                 sz = (htab->hmask + 1) * sizeof(struct hlist_head);
4119                 WARN_ON(!hlist_empty(htab->table));
4120                 xfrm_hash_free(htab->table, sz);
4121         }
4122
4123         sz = (net->xfrm.policy_idx_hmask + 1) * sizeof(struct hlist_head);
4124         WARN_ON(!hlist_empty(net->xfrm.policy_byidx));
4125         xfrm_hash_free(net->xfrm.policy_byidx, sz);
4126
4127         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
4128         list_for_each_entry_safe(b, t, &net->xfrm.inexact_bins, inexact_bins)
4129                 __xfrm_policy_inexact_prune_bin(b, true);
4130         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
4131 }
4132
4133 static int __net_init xfrm_net_init(struct net *net)
4134 {
4135         int rv;
4136
4137         /* Initialize the per-net locks here */
4138         spin_lock_init(&net->xfrm.xfrm_state_lock);
4139         spin_lock_init(&net->xfrm.xfrm_policy_lock);
4140         mutex_init(&net->xfrm.xfrm_cfg_mutex);
4141
4142         rv = xfrm_statistics_init(net);
4143         if (rv < 0)
4144                 goto out_statistics;
4145         rv = xfrm_state_init(net);
4146         if (rv < 0)
4147                 goto out_state;
4148         rv = xfrm_policy_init(net);
4149         if (rv < 0)
4150                 goto out_policy;
4151         rv = xfrm_sysctl_init(net);
4152         if (rv < 0)
4153                 goto out_sysctl;
4154
4155         return 0;
4156
4157 out_sysctl:
4158         xfrm_policy_fini(net);
4159 out_policy:
4160         xfrm_state_fini(net);
4161 out_state:
4162         xfrm_statistics_fini(net);
4163 out_statistics:
4164         return rv;
4165 }
4166
4167 static void __net_exit xfrm_net_exit(struct net *net)
4168 {
4169         xfrm_sysctl_fini(net);
4170         xfrm_policy_fini(net);
4171         xfrm_state_fini(net);
4172         xfrm_statistics_fini(net);
4173 }
4174
4175 static struct pernet_operations __net_initdata xfrm_net_ops = {
4176         .init = xfrm_net_init,
4177         .exit = xfrm_net_exit,
4178 };
4179
4180 void __init xfrm_init(void)
4181 {
4182         register_pernet_subsys(&xfrm_net_ops);
4183         xfrm_dev_init();
4184         seqcount_init(&xfrm_policy_hash_generation);
4185         xfrm_input_init();
4186
4187         RCU_INIT_POINTER(xfrm_if_cb, NULL);
4188         synchronize_rcu();
4189 }
4190
4191 #ifdef CONFIG_AUDITSYSCALL
4192 static void xfrm_audit_common_policyinfo(struct xfrm_policy *xp,
4193                                          struct audit_buffer *audit_buf)
4194 {
4195         struct xfrm_sec_ctx *ctx = xp->security;
4196         struct xfrm_selector *sel = &xp->selector;
4197
4198         if (ctx)
4199                 audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
4200                                  ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
4201
4202         switch (sel->family) {
4203         case AF_INET:
4204                 audit_log_format(audit_buf, " src=%pI4", &sel->saddr.a4);
4205                 if (sel->prefixlen_s != 32)
4206                         audit_log_format(audit_buf, " src_prefixlen=%d",
4207                                          sel->prefixlen_s);
4208                 audit_log_format(audit_buf, " dst=%pI4", &sel->daddr.a4);
4209                 if (sel->prefixlen_d != 32)
4210                         audit_log_format(audit_buf, " dst_prefixlen=%d",
4211                                          sel->prefixlen_d);
4212                 break;
4213         case AF_INET6:
4214                 audit_log_format(audit_buf, " src=%pI6", sel->saddr.a6);
4215                 if (sel->prefixlen_s != 128)
4216                         audit_log_format(audit_buf, " src_prefixlen=%d",
4217                                          sel->prefixlen_s);
4218                 audit_log_format(audit_buf, " dst=%pI6", sel->daddr.a6);
4219                 if (sel->prefixlen_d != 128)
4220                         audit_log_format(audit_buf, " dst_prefixlen=%d",
4221                                          sel->prefixlen_d);
4222                 break;
4223         }
4224 }
4225
4226 void xfrm_audit_policy_add(struct xfrm_policy *xp, int result, bool task_valid)
4227 {
4228         struct audit_buffer *audit_buf;
4229
4230         audit_buf = xfrm_audit_start("SPD-add");
4231         if (audit_buf == NULL)
4232                 return;
4233         xfrm_audit_helper_usrinfo(task_valid, audit_buf);
4234         audit_log_format(audit_buf, " res=%u", result);
4235         xfrm_audit_common_policyinfo(xp, audit_buf);
4236         audit_log_end(audit_buf);
4237 }
4238 EXPORT_SYMBOL_GPL(xfrm_audit_policy_add);
4239
4240 void xfrm_audit_policy_delete(struct xfrm_policy *xp, int result,
4241                               bool task_valid)
4242 {
4243         struct audit_buffer *audit_buf;
4244
4245         audit_buf = xfrm_audit_start("SPD-delete");
4246         if (audit_buf == NULL)
4247                 return;
4248         xfrm_audit_helper_usrinfo(task_valid, audit_buf);
4249         audit_log_format(audit_buf, " res=%u", result);
4250         xfrm_audit_common_policyinfo(xp, audit_buf);
4251         audit_log_end(audit_buf);
4252 }
4253 EXPORT_SYMBOL_GPL(xfrm_audit_policy_delete);
4254 #endif
4255
4256 #ifdef CONFIG_XFRM_MIGRATE
4257 static bool xfrm_migrate_selector_match(const struct xfrm_selector *sel_cmp,
4258                                         const struct xfrm_selector *sel_tgt)
4259 {
4260         if (sel_cmp->proto == IPSEC_ULPROTO_ANY) {
4261                 if (sel_tgt->family == sel_cmp->family &&
4262                     xfrm_addr_equal(&sel_tgt->daddr, &sel_cmp->daddr,
4263                                     sel_cmp->family) &&
4264                     xfrm_addr_equal(&sel_tgt->saddr, &sel_cmp->saddr,
4265                                     sel_cmp->family) &&
4266                     sel_tgt->prefixlen_d == sel_cmp->prefixlen_d &&
4267                     sel_tgt->prefixlen_s == sel_cmp->prefixlen_s) {
4268                         return true;
4269                 }
4270         } else {
4271                 if (memcmp(sel_tgt, sel_cmp, sizeof(*sel_tgt)) == 0) {
4272                         return true;
4273                 }
4274         }
4275         return false;
4276 }
4277
4278 static struct xfrm_policy *xfrm_migrate_policy_find(const struct xfrm_selector *sel,
4279                                                     u8 dir, u8 type, struct net *net, u32 if_id)
4280 {
4281         struct xfrm_policy *pol, *ret = NULL;
4282         struct hlist_head *chain;
4283         u32 priority = ~0U;
4284
4285         spin_lock_bh(&net->xfrm.xfrm_policy_lock);
4286         chain = policy_hash_direct(net, &sel->daddr, &sel->saddr, sel->family, dir);
4287         hlist_for_each_entry(pol, chain, bydst) {
4288                 if ((if_id == 0 || pol->if_id == if_id) &&
4289                     xfrm_migrate_selector_match(sel, &pol->selector) &&
4290                     pol->type == type) {
4291                         ret = pol;
4292                         priority = ret->priority;
4293                         break;
4294                 }
4295         }
4296         chain = &net->xfrm.policy_inexact[dir];
4297         hlist_for_each_entry(pol, chain, bydst_inexact_list) {
4298                 if ((pol->priority >= priority) && ret)
4299                         break;
4300
4301                 if ((if_id == 0 || pol->if_id == if_id) &&
4302                     xfrm_migrate_selector_match(sel, &pol->selector) &&
4303                     pol->type == type) {
4304                         ret = pol;
4305                         break;
4306                 }
4307         }
4308
4309         xfrm_pol_hold(ret);
4310
4311         spin_unlock_bh(&net->xfrm.xfrm_policy_lock);
4312
4313         return ret;
4314 }
4315
4316 static int migrate_tmpl_match(const struct xfrm_migrate *m, const struct xfrm_tmpl *t)
4317 {
4318         int match = 0;
4319
4320         if (t->mode == m->mode && t->id.proto == m->proto &&
4321             (m->reqid == 0 || t->reqid == m->reqid)) {
4322                 switch (t->mode) {
4323                 case XFRM_MODE_TUNNEL:
4324                 case XFRM_MODE_BEET:
4325                         if (xfrm_addr_equal(&t->id.daddr, &m->old_daddr,
4326                                             m->old_family) &&
4327                             xfrm_addr_equal(&t->saddr, &m->old_saddr,
4328                                             m->old_family)) {
4329                                 match = 1;
4330                         }
4331                         break;
4332                 case XFRM_MODE_TRANSPORT:
4333                         /* in case of transport mode, template does not store
4334                            any IP addresses, hence we just compare mode and
4335                            protocol */
4336                         match = 1;
4337                         break;
4338                 default:
4339                         break;
4340                 }
4341         }
4342         return match;
4343 }
4344
4345 /* update endpoint address(es) of template(s) */
4346 static int xfrm_policy_migrate(struct xfrm_policy *pol,
4347                                struct xfrm_migrate *m, int num_migrate)
4348 {
4349         struct xfrm_migrate *mp;
4350         int i, j, n = 0;
4351
4352         write_lock_bh(&pol->lock);
4353         if (unlikely(pol->walk.dead)) {
4354                 /* target policy has been deleted */
4355                 write_unlock_bh(&pol->lock);
4356                 return -ENOENT;
4357         }
4358
4359         for (i = 0; i < pol->xfrm_nr; i++) {
4360                 for (j = 0, mp = m; j < num_migrate; j++, mp++) {
4361                         if (!migrate_tmpl_match(mp, &pol->xfrm_vec[i]))
4362                                 continue;
4363                         n++;
4364                         if (pol->xfrm_vec[i].mode != XFRM_MODE_TUNNEL &&
4365                             pol->xfrm_vec[i].mode != XFRM_MODE_BEET)
4366                                 continue;
4367                         /* update endpoints */
4368                         memcpy(&pol->xfrm_vec[i].id.daddr, &mp->new_daddr,
4369                                sizeof(pol->xfrm_vec[i].id.daddr));
4370                         memcpy(&pol->xfrm_vec[i].saddr, &mp->new_saddr,
4371                                sizeof(pol->xfrm_vec[i].saddr));
4372                         pol->xfrm_vec[i].encap_family = mp->new_family;
4373                         /* flush bundles */
4374                         atomic_inc(&pol->genid);
4375                 }
4376         }
4377
4378         write_unlock_bh(&pol->lock);
4379
4380         if (!n)
4381                 return -ENODATA;
4382
4383         return 0;
4384 }
4385
4386 static int xfrm_migrate_check(const struct xfrm_migrate *m, int num_migrate)
4387 {
4388         int i, j;
4389
4390         if (num_migrate < 1 || num_migrate > XFRM_MAX_DEPTH)
4391                 return -EINVAL;
4392
4393         for (i = 0; i < num_migrate; i++) {
4394                 if (xfrm_addr_any(&m[i].new_daddr, m[i].new_family) ||
4395                     xfrm_addr_any(&m[i].new_saddr, m[i].new_family))
4396                         return -EINVAL;
4397
4398                 /* check if there is any duplicated entry */
4399                 for (j = i + 1; j < num_migrate; j++) {
4400                         if (!memcmp(&m[i].old_daddr, &m[j].old_daddr,
4401                                     sizeof(m[i].old_daddr)) &&
4402                             !memcmp(&m[i].old_saddr, &m[j].old_saddr,
4403                                     sizeof(m[i].old_saddr)) &&
4404                             m[i].proto == m[j].proto &&
4405                             m[i].mode == m[j].mode &&
4406                             m[i].reqid == m[j].reqid &&
4407                             m[i].old_family == m[j].old_family)
4408                                 return -EINVAL;
4409                 }
4410         }
4411
4412         return 0;
4413 }
4414
4415 int xfrm_migrate(const struct xfrm_selector *sel, u8 dir, u8 type,
4416                  struct xfrm_migrate *m, int num_migrate,
4417                  struct xfrm_kmaddress *k, struct net *net,
4418                  struct xfrm_encap_tmpl *encap, u32 if_id)
4419 {
4420         int i, err, nx_cur = 0, nx_new = 0;
4421         struct xfrm_policy *pol = NULL;
4422         struct xfrm_state *x, *xc;
4423         struct xfrm_state *x_cur[XFRM_MAX_DEPTH];
4424         struct xfrm_state *x_new[XFRM_MAX_DEPTH];
4425         struct xfrm_migrate *mp;
4426
4427         /* Stage 0 - sanity checks */
4428         if ((err = xfrm_migrate_check(m, num_migrate)) < 0)
4429                 goto out;
4430
4431         if (dir >= XFRM_POLICY_MAX) {
4432                 err = -EINVAL;
4433                 goto out;
4434         }
4435
4436         /* Stage 1 - find policy */
4437         if ((pol = xfrm_migrate_policy_find(sel, dir, type, net, if_id)) == NULL) {
4438                 err = -ENOENT;
4439                 goto out;
4440         }
4441
4442         /* Stage 2 - find and update state(s) */
4443         for (i = 0, mp = m; i < num_migrate; i++, mp++) {
4444                 if ((x = xfrm_migrate_state_find(mp, net, if_id))) {
4445                         x_cur[nx_cur] = x;
4446                         nx_cur++;
4447                         xc = xfrm_state_migrate(x, mp, encap);
4448                         if (xc) {
4449                                 x_new[nx_new] = xc;
4450                                 nx_new++;
4451                         } else {
4452                                 err = -ENODATA;
4453                                 goto restore_state;
4454                         }
4455                 }
4456         }
4457
4458         /* Stage 3 - update policy */
4459         if ((err = xfrm_policy_migrate(pol, m, num_migrate)) < 0)
4460                 goto restore_state;
4461
4462         /* Stage 4 - delete old state(s) */
4463         if (nx_cur) {
4464                 xfrm_states_put(x_cur, nx_cur);
4465                 xfrm_states_delete(x_cur, nx_cur);
4466         }
4467
4468         /* Stage 5 - announce */
4469         km_migrate(sel, dir, type, m, num_migrate, k, encap);
4470
4471         xfrm_pol_put(pol);
4472
4473         return 0;
4474 out:
4475         return err;
4476
4477 restore_state:
4478         if (pol)
4479                 xfrm_pol_put(pol);
4480         if (nx_cur)
4481                 xfrm_states_put(x_cur, nx_cur);
4482         if (nx_new)
4483                 xfrm_states_delete(x_new, nx_new);
4484
4485         return err;
4486 }
4487 EXPORT_SYMBOL(xfrm_migrate);
4488 #endif