git.oblomov.eu Git - linux-2.6/blob - net/decnet/dn_table.c

   1 /*
   2  * DECnet       An implementation of the DECnet protocol suite for the LINUX
   3  *              operating system.  DECnet is implemented using the  BSD Socket
   4  *              interface as the means of communication with the user level.
   5  *
   6  *              DECnet Routing Forwarding Information Base (Routing Tables)
   7  *
   8  * Author:      Steve Whitehouse <SteveW@ACM.org>
   9  *              Mostly copied from the IPv4 routing code
  10  *
  11  *
  12  * Changes:
  13  *
  14  */
  15 #include <linux/string.h>
  16 #include <linux/net.h>
  17 #include <linux/socket.h>
  18 #include <linux/sockios.h>
  19 #include <linux/init.h>
  20 #include <linux/skbuff.h>
  21 #include <linux/netlink.h>
  22 #include <linux/rtnetlink.h>
  23 #include <linux/proc_fs.h>
  24 #include <linux/netdevice.h>
  25 #include <linux/timer.h>
  26 #include <linux/spinlock.h>
  27 #include <asm/atomic.h>
  28 #include <asm/uaccess.h>
  29 #include <linux/route.h> /* RTF_xxx */
  30 #include <net/neighbour.h>
  31 #include <net/dst.h>
  32 #include <net/flow.h>
  33 #include <net/fib_rules.h>
  34 #include <net/dn.h>
  35 #include <net/dn_route.h>
  36 #include <net/dn_fib.h>
  37 #include <net/dn_neigh.h>
  38 #include <net/dn_dev.h>
  39
  40 struct dn_zone
  41 {
  42         struct dn_zone          *dz_next;
  43         struct dn_fib_node      **dz_hash;
  44         int                     dz_nent;
  45         int                     dz_divisor;
  46         u32                     dz_hashmask;
  47 #define DZ_HASHMASK(dz) ((dz)->dz_hashmask)
  48         int                     dz_order;
  49         __le16                  dz_mask;
  50 #define DZ_MASK(dz)     ((dz)->dz_mask)
  51 };
  52
  53 struct dn_hash
  54 {
  55         struct dn_zone  *dh_zones[17];
  56         struct dn_zone  *dh_zone_list;
  57 };
  58
  59 #define dz_key_0(key)           ((key).datum = 0)
  60 #define dz_prefix(key,dz)       ((key).datum)
  61
  62 #define for_nexthops(fi) { int nhsel; const struct dn_fib_nh *nh;\
  63         for(nhsel = 0, nh = (fi)->fib_nh; nhsel < (fi)->fib_nhs; nh++, nhsel++)
  64
  65 #define endfor_nexthops(fi) }
  66
  67 #define DN_MAX_DIVISOR 1024
  68 #define DN_S_ZOMBIE 1
  69 #define DN_S_ACCESSED 2
  70
  71 #define DN_FIB_SCAN(f, fp) \
  72 for( ; ((f) = *(fp)) != NULL; (fp) = &(f)->fn_next)
  73
  74 #define DN_FIB_SCAN_KEY(f, fp, key) \
  75 for( ; ((f) = *(fp)) != NULL && dn_key_eq((f)->fn_key, (key)); (fp) = &(f)->fn_next)
  76
  77 #define RT_TABLE_MIN 1
  78 #define DN_FIB_TABLE_HASHSZ 256
  79 static struct hlist_head dn_fib_table_hash[DN_FIB_TABLE_HASHSZ];
  80 static DEFINE_RWLOCK(dn_fib_tables_lock);
  81
  82 static struct kmem_cache *dn_hash_kmem __read_mostly;
  83 static int dn_fib_hash_zombies;
  84
  85 static inline dn_fib_idx_t dn_hash(dn_fib_key_t key, struct dn_zone *dz)
  86 {
  87         u16 h = dn_ntohs(key.datum)>>(16 - dz->dz_order);
  88         h ^= (h >> 10);
  89         h ^= (h >> 6);
  90         h &= DZ_HASHMASK(dz);
  91         return *(dn_fib_idx_t *)&h;
  92 }
  93
  94 static inline dn_fib_key_t dz_key(__le16 dst, struct dn_zone *dz)
  95 {
  96         dn_fib_key_t k;
  97         k.datum = dst & DZ_MASK(dz);
  98         return k;
  99 }
 100
 101 static inline struct dn_fib_node **dn_chain_p(dn_fib_key_t key, struct dn_zone *dz)
 102 {
 103         return &dz->dz_hash[dn_hash(key, dz).datum];
 104 }
 105
 106 static inline struct dn_fib_node *dz_chain(dn_fib_key_t key, struct dn_zone *dz)
 107 {
 108         return dz->dz_hash[dn_hash(key, dz).datum];
 109 }
 110
 111 static inline int dn_key_eq(dn_fib_key_t a, dn_fib_key_t b)
 112 {
 113         return a.datum == b.datum;
 114 }
 115
 116 static inline int dn_key_leq(dn_fib_key_t a, dn_fib_key_t b)
 117 {
 118         return a.datum <= b.datum;
 119 }
 120
 121 static inline void dn_rebuild_zone(struct dn_zone *dz,
 122                                    struct dn_fib_node **old_ht,
 123                                    int old_divisor)
 124 {
 125         int i;
 126         struct dn_fib_node *f, **fp, *next;
 127
 128         for(i = 0; i < old_divisor; i++) {
 129                 for(f = old_ht[i]; f; f = f->fn_next) {
 130                         next = f->fn_next;
 131                         for(fp = dn_chain_p(f->fn_key, dz);
 132                                 *fp && dn_key_leq((*fp)->fn_key, f->fn_key);
 133                                 fp = &(*fp)->fn_next)
 134                                 /* NOTHING */;
 135                         f->fn_next = *fp;
 136                         *fp = f;
 137                 }
 138         }
 139 }
 140
 141 static void dn_rehash_zone(struct dn_zone *dz)
 142 {
 143         struct dn_fib_node **ht, **old_ht;
 144         int old_divisor, new_divisor;
 145         u32 new_hashmask;
 146
 147         old_divisor = dz->dz_divisor;
 148
 149         switch(old_divisor) {
 150                 case 16:
 151                         new_divisor = 256;
 152                         new_hashmask = 0xFF;
 153                         break;
 154                 default:
 155                         printk(KERN_DEBUG "DECnet: dn_rehash_zone: BUG! %d\n", old_divisor);
 156                 case 256:
 157                         new_divisor = 1024;
 158                         new_hashmask = 0x3FF;
 159                         break;
 160         }
 161
 162         ht = kcalloc(new_divisor, sizeof(struct dn_fib_node*), GFP_KERNEL);
 163         if (ht == NULL)
 164                 return;
 165
 166         write_lock_bh(&dn_fib_tables_lock);
 167         old_ht = dz->dz_hash;
 168         dz->dz_hash = ht;
 169         dz->dz_hashmask = new_hashmask;
 170         dz->dz_divisor = new_divisor;
 171         dn_rebuild_zone(dz, old_ht, old_divisor);
 172         write_unlock_bh(&dn_fib_tables_lock);
 173         kfree(old_ht);
 174 }
 175
 176 static void dn_free_node(struct dn_fib_node *f)
 177 {
 178         dn_fib_release_info(DN_FIB_INFO(f));
 179         kmem_cache_free(dn_hash_kmem, f);
 180 }
 181
 182
 183 static struct dn_zone *dn_new_zone(struct dn_hash *table, int z)
 184 {
 185         int i;
 186         struct dn_zone *dz = kzalloc(sizeof(struct dn_zone), GFP_KERNEL);
 187         if (!dz)
 188                 return NULL;
 189
 190         if (z) {
 191                 dz->dz_divisor = 16;
 192                 dz->dz_hashmask = 0x0F;
 193         } else {
 194                 dz->dz_divisor = 1;
 195                 dz->dz_hashmask = 0;
 196         }
 197
 198         dz->dz_hash = kcalloc(dz->dz_divisor, sizeof(struct dn_fib_node *), GFP_KERNEL);
 199         if (!dz->dz_hash) {
 200                 kfree(dz);
 201                 return NULL;
 202         }
 203
 204         dz->dz_order = z;
 205         dz->dz_mask = dnet_make_mask(z);
 206
 207         for(i = z + 1; i <= 16; i++)
 208                 if (table->dh_zones[i])
 209                         break;
 210
 211         write_lock_bh(&dn_fib_tables_lock);
 212         if (i>16) {
 213                 dz->dz_next = table->dh_zone_list;
 214                 table->dh_zone_list = dz;
 215         } else {
 216                 dz->dz_next = table->dh_zones[i]->dz_next;
 217                 table->dh_zones[i]->dz_next = dz;
 218         }
 219         table->dh_zones[z] = dz;
 220         write_unlock_bh(&dn_fib_tables_lock);
 221         return dz;
 222 }
 223
 224
 225 static int dn_fib_nh_match(struct rtmsg *r, struct nlmsghdr *nlh, struct dn_kern_rta *rta, struct dn_fib_info *fi)
 226 {
 227         struct rtnexthop *nhp;
 228         int nhlen;
 229
 230         if (rta->rta_priority && *rta->rta_priority != fi->fib_priority)
 231                 return 1;
 232
 233         if (rta->rta_oif || rta->rta_gw) {
 234                 if ((!rta->rta_oif || *rta->rta_oif == fi->fib_nh->nh_oif) &&
 235                     (!rta->rta_gw  || memcmp(rta->rta_gw, &fi->fib_nh->nh_gw, 2) == 0))
 236                         return 0;
 237                 return 1;
 238         }
 239
 240         if (rta->rta_mp == NULL)
 241                 return 0;
 242
 243         nhp = RTA_DATA(rta->rta_mp);
 244         nhlen = RTA_PAYLOAD(rta->rta_mp);
 245
 246         for_nexthops(fi) {
 247                 int attrlen = nhlen - sizeof(struct rtnexthop);
 248                 __le16 gw;
 249
 250                 if (attrlen < 0 || (nhlen -= nhp->rtnh_len) < 0)
 251                         return -EINVAL;
 252                 if (nhp->rtnh_ifindex && nhp->rtnh_ifindex != nh->nh_oif)
 253                         return 1;
 254                 if (attrlen) {
 255                         gw = dn_fib_get_attr16(RTNH_DATA(nhp), attrlen, RTA_GATEWAY);
 256
 257                         if (gw && gw != nh->nh_gw)
 258                                 return 1;
 259                 }
 260                 nhp = RTNH_NEXT(nhp);
 261         } endfor_nexthops(fi);
 262
 263         return 0;
 264 }
 265
 266 static inline size_t dn_fib_nlmsg_size(struct dn_fib_info *fi)
 267 {
 268         size_t payload = NLMSG_ALIGN(sizeof(struct rtmsg))
 269                          + nla_total_size(4) /* RTA_TABLE */
 270                          + nla_total_size(2) /* RTA_DST */
 271                          + nla_total_size(4); /* RTA_PRIORITY */
 272
 273         /* space for nested metrics */
 274         payload += nla_total_size((RTAX_MAX * nla_total_size(4)));
 275
 276         if (fi->fib_nhs) {
 277                 /* Also handles the special case fib_nhs == 1 */
 278
 279                 /* each nexthop is packed in an attribute */
 280                 size_t nhsize = nla_total_size(sizeof(struct rtnexthop));
 281
 282                 /* may contain a gateway attribute */
 283                 nhsize += nla_total_size(4);
 284
 285                 /* all nexthops are packed in a nested attribute */
 286                 payload += nla_total_size(fi->fib_nhs * nhsize);
 287         }
 288
 289         return payload;
 290 }
 291
 292 static int dn_fib_dump_info(struct sk_buff *skb, u32 pid, u32 seq, int event,
 293                         u32 tb_id, u8 type, u8 scope, void *dst, int dst_len,
 294                         struct dn_fib_info *fi, unsigned int flags)
 295 {
 296         struct rtmsg *rtm;
 297         struct nlmsghdr *nlh;
 298         unsigned char *b = skb->tail;
 299
 300         nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*rtm), flags);
 301         rtm = NLMSG_DATA(nlh);
 302         rtm->rtm_family = AF_DECnet;
 303         rtm->rtm_dst_len = dst_len;
 304         rtm->rtm_src_len = 0;
 305         rtm->rtm_tos = 0;
 306         rtm->rtm_table = tb_id;
 307         RTA_PUT_U32(skb, RTA_TABLE, tb_id);
 308         rtm->rtm_flags = fi->fib_flags;
 309         rtm->rtm_scope = scope;
 310         rtm->rtm_type  = type;
 311         if (rtm->rtm_dst_len)
 312                 RTA_PUT(skb, RTA_DST, 2, dst);
 313         rtm->rtm_protocol = fi->fib_protocol;
 314         if (fi->fib_priority)
 315                 RTA_PUT(skb, RTA_PRIORITY, 4, &fi->fib_priority);
 316         if (rtnetlink_put_metrics(skb, fi->fib_metrics) < 0)
 317                 goto rtattr_failure;
 318         if (fi->fib_nhs == 1) {
 319                 if (fi->fib_nh->nh_gw)
 320                         RTA_PUT(skb, RTA_GATEWAY, 2, &fi->fib_nh->nh_gw);
 321                 if (fi->fib_nh->nh_oif)
 322                         RTA_PUT(skb, RTA_OIF, sizeof(int), &fi->fib_nh->nh_oif);
 323         }
 324         if (fi->fib_nhs > 1) {
 325                 struct rtnexthop *nhp;
 326                 struct rtattr *mp_head;
 327                 if (skb_tailroom(skb) <= RTA_SPACE(0))
 328                         goto rtattr_failure;
 329                 mp_head = (struct rtattr *)skb_put(skb, RTA_SPACE(0));
 330
 331                 for_nexthops(fi) {
 332                         if (skb_tailroom(skb) < RTA_ALIGN(RTA_ALIGN(sizeof(*nhp)) + 4))
 333                                 goto rtattr_failure;
 334                         nhp = (struct rtnexthop *)skb_put(skb, RTA_ALIGN(sizeof(*nhp)));
 335                         nhp->rtnh_flags = nh->nh_flags & 0xFF;
 336                         nhp->rtnh_hops = nh->nh_weight - 1;
 337                         nhp->rtnh_ifindex = nh->nh_oif;
 338                         if (nh->nh_gw)
 339                                 RTA_PUT(skb, RTA_GATEWAY, 2, &nh->nh_gw);
 340                         nhp->rtnh_len = skb->tail - (unsigned char *)nhp;
 341                 } endfor_nexthops(fi);
 342                 mp_head->rta_type = RTA_MULTIPATH;
 343                 mp_head->rta_len = skb->tail - (u8*)mp_head;
 344         }
 345
 346         nlh->nlmsg_len = skb->tail - b;
 347         return skb->len;
 348
 349
 350 nlmsg_failure:
 351 rtattr_failure:
 352         skb_trim(skb, b - skb->data);
 353         return -EMSGSIZE;
 354 }
 355
 356
 357 static void dn_rtmsg_fib(int event, struct dn_fib_node *f, int z, u32 tb_id,
 358                         struct nlmsghdr *nlh, struct netlink_skb_parms *req)
 359 {
 360         struct sk_buff *skb;
 361         u32 pid = req ? req->pid : 0;
 362         int err = -ENOBUFS;
 363
 364         skb = nlmsg_new(dn_fib_nlmsg_size(DN_FIB_INFO(f)), GFP_KERNEL);
 365         if (skb == NULL)
 366                 goto errout;
 367
 368         err = dn_fib_dump_info(skb, pid, nlh->nlmsg_seq, event, tb_id,
 369                                f->fn_type, f->fn_scope, &f->fn_key, z,
 370                                DN_FIB_INFO(f), 0);
 371         if (err < 0) {
 372                 /* -EMSGSIZE implies BUG in dn_fib_nlmsg_size() */
 373                 WARN_ON(err == -EMSGSIZE);
 374                 kfree_skb(skb);
 375                 goto errout;
 376         }
 377         err = rtnl_notify(skb, pid, RTNLGRP_DECnet_ROUTE, nlh, GFP_KERNEL);
 378 errout:
 379         if (err < 0)
 380                 rtnl_set_sk_err(RTNLGRP_DECnet_ROUTE, err);
 381 }
 382
 383 static __inline__ int dn_hash_dump_bucket(struct sk_buff *skb,
 384                                 struct netlink_callback *cb,
 385                                 struct dn_fib_table *tb,
 386                                 struct dn_zone *dz,
 387                                 struct dn_fib_node *f)
 388 {
 389         int i, s_i;
 390
 391         s_i = cb->args[4];
 392         for(i = 0; f; i++, f = f->fn_next) {
 393                 if (i < s_i)
 394                         continue;
 395                 if (f->fn_state & DN_S_ZOMBIE)
 396                         continue;
 397                 if (dn_fib_dump_info(skb, NETLINK_CB(cb->skb).pid,
 398                                 cb->nlh->nlmsg_seq,
 399                                 RTM_NEWROUTE,
 400                                 tb->n,
 401                                 (f->fn_state & DN_S_ZOMBIE) ? 0 : f->fn_type,
 402                                 f->fn_scope, &f->fn_key, dz->dz_order,
 403                                 f->fn_info, NLM_F_MULTI) < 0) {
 404                         cb->args[4] = i;
 405                         return -1;
 406                 }
 407         }
 408         cb->args[4] = i;
 409         return skb->len;
 410 }
 411
 412 static __inline__ int dn_hash_dump_zone(struct sk_buff *skb,
 413                                 struct netlink_callback *cb,
 414                                 struct dn_fib_table *tb,
 415                                 struct dn_zone *dz)
 416 {
 417         int h, s_h;
 418
 419         s_h = cb->args[3];
 420         for(h = 0; h < dz->dz_divisor; h++) {
 421                 if (h < s_h)
 422                         continue;
 423                 if (h > s_h)
 424                         memset(&cb->args[4], 0, sizeof(cb->args) - 4*sizeof(cb->args[0]));
 425                 if (dz->dz_hash == NULL || dz->dz_hash[h] == NULL)
 426                         continue;
 427                 if (dn_hash_dump_bucket(skb, cb, tb, dz, dz->dz_hash[h]) < 0) {
 428                         cb->args[3] = h;
 429                         return -1;
 430                 }
 431         }
 432         cb->args[3] = h;
 433         return skb->len;
 434 }
 435
 436 static int dn_fib_table_dump(struct dn_fib_table *tb, struct sk_buff *skb,
 437                                 struct netlink_callback *cb)
 438 {
 439         int m, s_m;
 440         struct dn_zone *dz;
 441         struct dn_hash *table = (struct dn_hash *)tb->data;
 442
 443         s_m = cb->args[2];
 444         read_lock(&dn_fib_tables_lock);
 445         for(dz = table->dh_zone_list, m = 0; dz; dz = dz->dz_next, m++) {
 446                 if (m < s_m)
 447                         continue;
 448                 if (m > s_m)
 449                         memset(&cb->args[3], 0, sizeof(cb->args) - 3*sizeof(cb->args[0]));
 450
 451                 if (dn_hash_dump_zone(skb, cb, tb, dz) < 0) {
 452                         cb->args[2] = m;
 453                         read_unlock(&dn_fib_tables_lock);
 454                         return -1;
 455                 }
 456         }
 457         read_unlock(&dn_fib_tables_lock);
 458         cb->args[2] = m;
 459
 460         return skb->len;
 461 }
 462
 463 int dn_fib_dump(struct sk_buff *skb, struct netlink_callback *cb)
 464 {
 465         unsigned int h, s_h;
 466         unsigned int e = 0, s_e;
 467         struct dn_fib_table *tb;
 468         struct hlist_node *node;
 469         int dumped = 0;
 470
 471         if (NLMSG_PAYLOAD(cb->nlh, 0) >= sizeof(struct rtmsg) &&
 472                 ((struct rtmsg *)NLMSG_DATA(cb->nlh))->rtm_flags&RTM_F_CLONED)
 473                         return dn_cache_dump(skb, cb);
 474
 475         s_h = cb->args[0];
 476         s_e = cb->args[1];
 477
 478         for (h = s_h; h < DN_FIB_TABLE_HASHSZ; h++, s_h = 0) {
 479                 e = 0;
 480                 hlist_for_each_entry(tb, node, &dn_fib_table_hash[h], hlist) {
 481                         if (e < s_e)
 482                                 goto next;
 483                         if (dumped)
 484                                 memset(&cb->args[2], 0, sizeof(cb->args) -
 485                                                  2 * sizeof(cb->args[0]));
 486                         if (tb->dump(tb, skb, cb) < 0)
 487                                 goto out;
 488                         dumped = 1;
 489 next:
 490                         e++;
 491                 }
 492         }
 493 out:
 494         cb->args[1] = e;
 495         cb->args[0] = h;
 496
 497         return skb->len;
 498 }
 499
 500 static int dn_fib_table_insert(struct dn_fib_table *tb, struct rtmsg *r, struct dn_kern_rta *rta, struct nlmsghdr *n, struct netlink_skb_parms *req)
 501 {
 502         struct dn_hash *table = (struct dn_hash *)tb->data;
 503         struct dn_fib_node *new_f, *f, **fp, **del_fp;
 504         struct dn_zone *dz;
 505         struct dn_fib_info *fi;
 506         int z = r->rtm_dst_len;
 507         int type = r->rtm_type;
 508         dn_fib_key_t key;
 509         int err;
 510
 511         if (z > 16)
 512                 return -EINVAL;
 513
 514         dz = table->dh_zones[z];
 515         if (!dz && !(dz = dn_new_zone(table, z)))
 516                 return -ENOBUFS;
 517
 518         dz_key_0(key);
 519         if (rta->rta_dst) {
 520                 __le16 dst;
 521                 memcpy(&dst, rta->rta_dst, 2);
 522                 if (dst & ~DZ_MASK(dz))
 523                         return -EINVAL;
 524                 key = dz_key(dst, dz);
 525         }
 526
 527         if ((fi = dn_fib_create_info(r, rta, n, &err)) == NULL)
 528                 return err;
 529
 530         if (dz->dz_nent > (dz->dz_divisor << 2) &&
 531                         dz->dz_divisor > DN_MAX_DIVISOR &&
 532                         (z==16 || (1<<z) > dz->dz_divisor))
 533                 dn_rehash_zone(dz);
 534
 535         fp = dn_chain_p(key, dz);
 536
 537         DN_FIB_SCAN(f, fp) {
 538                 if (dn_key_leq(key, f->fn_key))
 539                         break;
 540         }
 541
 542         del_fp = NULL;
 543
 544         if (f && (f->fn_state & DN_S_ZOMBIE) &&
 545                         dn_key_eq(f->fn_key, key)) {
 546                 del_fp = fp;
 547                 fp = &f->fn_next;
 548                 f = *fp;
 549                 goto create;
 550         }
 551
 552         DN_FIB_SCAN_KEY(f, fp, key) {
 553                 if (fi->fib_priority <= DN_FIB_INFO(f)->fib_priority)
 554                         break;
 555         }
 556
 557         if (f && dn_key_eq(f->fn_key, key) &&
 558                         fi->fib_priority == DN_FIB_INFO(f)->fib_priority) {
 559                 struct dn_fib_node **ins_fp;
 560
 561                 err = -EEXIST;
 562                 if (n->nlmsg_flags & NLM_F_EXCL)
 563                         goto out;
 564
 565                 if (n->nlmsg_flags & NLM_F_REPLACE) {
 566                         del_fp = fp;
 567                         fp = &f->fn_next;
 568                         f = *fp;
 569                         goto replace;
 570                 }
 571
 572                 ins_fp = fp;
 573                 err = -EEXIST;
 574
 575                 DN_FIB_SCAN_KEY(f, fp, key) {
 576                         if (fi->fib_priority != DN_FIB_INFO(f)->fib_priority)
 577                                 break;
 578                         if (f->fn_type == type && f->fn_scope == r->rtm_scope
 579                                         && DN_FIB_INFO(f) == fi)
 580                                 goto out;
 581                 }
 582
 583                 if (!(n->nlmsg_flags & NLM_F_APPEND)) {
 584                         fp = ins_fp;
 585                         f = *fp;
 586                 }
 587         }
 588
 589 create:
 590         err = -ENOENT;
 591         if (!(n->nlmsg_flags & NLM_F_CREATE))
 592                 goto out;
 593
 594 replace:
 595         err = -ENOBUFS;
 596         new_f = kmem_cache_alloc(dn_hash_kmem, GFP_KERNEL);
 597         if (new_f == NULL)
 598                 goto out;
 599
 600         memset(new_f, 0, sizeof(struct dn_fib_node));
 601
 602         new_f->fn_key = key;
 603         new_f->fn_type = type;
 604         new_f->fn_scope = r->rtm_scope;
 605         DN_FIB_INFO(new_f) = fi;
 606
 607         new_f->fn_next = f;
 608         write_lock_bh(&dn_fib_tables_lock);
 609         *fp = new_f;
 610         write_unlock_bh(&dn_fib_tables_lock);
 611         dz->dz_nent++;
 612
 613         if (del_fp) {
 614                 f = *del_fp;
 615                 write_lock_bh(&dn_fib_tables_lock);
 616                 *del_fp = f->fn_next;
 617                 write_unlock_bh(&dn_fib_tables_lock);
 618
 619                 if (!(f->fn_state & DN_S_ZOMBIE))
 620                         dn_rtmsg_fib(RTM_DELROUTE, f, z, tb->n, n, req);
 621                 if (f->fn_state & DN_S_ACCESSED)
 622                         dn_rt_cache_flush(-1);
 623                 dn_free_node(f);
 624                 dz->dz_nent--;
 625         } else {
 626                 dn_rt_cache_flush(-1);
 627         }
 628
 629         dn_rtmsg_fib(RTM_NEWROUTE, new_f, z, tb->n, n, req);
 630
 631         return 0;
 632 out:
 633         dn_fib_release_info(fi);
 634         return err;
 635 }
 636
 637
 638 static int dn_fib_table_delete(struct dn_fib_table *tb, struct rtmsg *r, struct dn_kern_rta *rta, struct nlmsghdr *n, struct netlink_skb_parms *req)
 639 {
 640         struct dn_hash *table = (struct dn_hash*)tb->data;
 641         struct dn_fib_node **fp, **del_fp, *f;
 642         int z = r->rtm_dst_len;
 643         struct dn_zone *dz;
 644         dn_fib_key_t key;
 645         int matched;
 646
 647
 648         if (z > 16)
 649                 return -EINVAL;
 650
 651         if ((dz = table->dh_zones[z]) == NULL)
 652                 return -ESRCH;
 653
 654         dz_key_0(key);
 655         if (rta->rta_dst) {
 656                 __le16 dst;
 657                 memcpy(&dst, rta->rta_dst, 2);
 658                 if (dst & ~DZ_MASK(dz))
 659                         return -EINVAL;
 660                 key = dz_key(dst, dz);
 661         }
 662
 663         fp = dn_chain_p(key, dz);
 664
 665         DN_FIB_SCAN(f, fp) {
 666                 if (dn_key_eq(f->fn_key, key))
 667                         break;
 668                 if (dn_key_leq(key, f->fn_key))
 669                         return -ESRCH;
 670         }
 671
 672         matched = 0;
 673         del_fp = NULL;
 674         DN_FIB_SCAN_KEY(f, fp, key) {
 675                 struct dn_fib_info *fi = DN_FIB_INFO(f);
 676
 677                 if (f->fn_state & DN_S_ZOMBIE)
 678                         return -ESRCH;
 679
 680                 matched++;
 681
 682                 if (del_fp == NULL &&
 683                                 (!r->rtm_type || f->fn_type == r->rtm_type) &&
 684                                 (r->rtm_scope == RT_SCOPE_NOWHERE || f->fn_scope == r->rtm_scope) &&
 685                                 (!r->rtm_protocol ||
 686                                         fi->fib_protocol == r->rtm_protocol) &&
 687                                 dn_fib_nh_match(r, n, rta, fi) == 0)
 688                         del_fp = fp;
 689         }
 690
 691         if (del_fp) {
 692                 f = *del_fp;
 693                 dn_rtmsg_fib(RTM_DELROUTE, f, z, tb->n, n, req);
 694
 695                 if (matched != 1) {
 696                         write_lock_bh(&dn_fib_tables_lock);
 697                         *del_fp = f->fn_next;
 698                         write_unlock_bh(&dn_fib_tables_lock);
 699
 700                         if (f->fn_state & DN_S_ACCESSED)
 701                                 dn_rt_cache_flush(-1);
 702                         dn_free_node(f);
 703                         dz->dz_nent--;
 704                 } else {
 705                         f->fn_state |= DN_S_ZOMBIE;
 706                         if (f->fn_state & DN_S_ACCESSED) {
 707                                 f->fn_state &= ~DN_S_ACCESSED;
 708                                 dn_rt_cache_flush(-1);
 709                         }
 710                         if (++dn_fib_hash_zombies > 128)
 711                                 dn_fib_flush();
 712                 }
 713
 714                 return 0;
 715         }
 716
 717         return -ESRCH;
 718 }
 719
 720 static inline int dn_flush_list(struct dn_fib_node **fp, int z, struct dn_hash *table)
 721 {
 722         int found = 0;
 723         struct dn_fib_node *f;
 724
 725         while((f = *fp) != NULL) {
 726                 struct dn_fib_info *fi = DN_FIB_INFO(f);
 727
 728                 if (fi && ((f->fn_state & DN_S_ZOMBIE) || (fi->fib_flags & RTNH_F_DEAD))) {
 729                         write_lock_bh(&dn_fib_tables_lock);
 730                         *fp = f->fn_next;
 731                         write_unlock_bh(&dn_fib_tables_lock);
 732
 733                         dn_free_node(f);
 734                         found++;
 735                         continue;
 736                 }
 737                 fp = &f->fn_next;
 738         }
 739
 740         return found;
 741 }
 742
 743 static int dn_fib_table_flush(struct dn_fib_table *tb)
 744 {
 745         struct dn_hash *table = (struct dn_hash *)tb->data;
 746         struct dn_zone *dz;
 747         int found = 0;
 748
 749         dn_fib_hash_zombies = 0;
 750         for(dz = table->dh_zone_list; dz; dz = dz->dz_next) {
 751                 int i;
 752                 int tmp = 0;
 753                 for(i = dz->dz_divisor-1; i >= 0; i--)
 754                         tmp += dn_flush_list(&dz->dz_hash[i], dz->dz_order, table);
 755                 dz->dz_nent -= tmp;
 756                 found += tmp;
 757         }
 758
 759         return found;
 760 }
 761
 762 static int dn_fib_table_lookup(struct dn_fib_table *tb, const struct flowi *flp, struct dn_fib_res *res)
 763 {
 764         int err;
 765         struct dn_zone *dz;
 766         struct dn_hash *t = (struct dn_hash *)tb->data;
 767
 768         read_lock(&dn_fib_tables_lock);
 769         for(dz = t->dh_zone_list; dz; dz = dz->dz_next) {
 770                 struct dn_fib_node *f;
 771                 dn_fib_key_t k = dz_key(flp->fld_dst, dz);
 772
 773                 for(f = dz_chain(k, dz); f; f = f->fn_next) {
 774                         if (!dn_key_eq(k, f->fn_key)) {
 775                                 if (dn_key_leq(k, f->fn_key))
 776                                         break;
 777                                 else
 778                                         continue;
 779                         }
 780
 781                         f->fn_state |= DN_S_ACCESSED;
 782
 783                         if (f->fn_state&DN_S_ZOMBIE)
 784                                 continue;
 785
 786                         if (f->fn_scope < flp->fld_scope)
 787                                 continue;
 788
 789                         err = dn_fib_semantic_match(f->fn_type, DN_FIB_INFO(f), flp, res);
 790
 791                         if (err == 0) {
 792                                 res->type = f->fn_type;
 793                                 res->scope = f->fn_scope;
 794                                 res->prefixlen = dz->dz_order;
 795                                 goto out;
 796                         }
 797                         if (err < 0)
 798                                 goto out;
 799                 }
 800         }
 801         err = 1;
 802 out:
 803         read_unlock(&dn_fib_tables_lock);
 804         return err;
 805 }
 806
 807
 808 struct dn_fib_table *dn_fib_get_table(u32 n, int create)
 809 {
 810         struct dn_fib_table *t;
 811         struct hlist_node *node;
 812         unsigned int h;
 813
 814         if (n < RT_TABLE_MIN)
 815                 return NULL;
 816
 817         if (n > RT_TABLE_MAX)
 818                 return NULL;
 819
 820         h = n & (DN_FIB_TABLE_HASHSZ - 1);
 821         rcu_read_lock();
 822         hlist_for_each_entry_rcu(t, node, &dn_fib_table_hash[h], hlist) {
 823                 if (t->n == n) {
 824                         rcu_read_unlock();
 825                         return t;
 826                 }
 827         }
 828         rcu_read_unlock();
 829
 830         if (!create)
 831                 return NULL;
 832
 833         if (in_interrupt() && net_ratelimit()) {
 834                 printk(KERN_DEBUG "DECnet: BUG! Attempt to create routing table from interrupt\n");
 835                 return NULL;
 836         }
 837
 838         t = kzalloc(sizeof(struct dn_fib_table) + sizeof(struct dn_hash),
 839                     GFP_KERNEL);
 840         if (t == NULL)
 841                 return NULL;
 842
 843         t->n = n;
 844         t->insert = dn_fib_table_insert;
 845         t->delete = dn_fib_table_delete;
 846         t->lookup = dn_fib_table_lookup;
 847         t->flush  = dn_fib_table_flush;
 848         t->dump = dn_fib_table_dump;
 849         hlist_add_head_rcu(&t->hlist, &dn_fib_table_hash[h]);
 850
 851         return t;
 852 }
 853
 854 struct dn_fib_table *dn_fib_empty_table(void)
 855 {
 856         u32 id;
 857
 858         for(id = RT_TABLE_MIN; id <= RT_TABLE_MAX; id++)
 859                 if (dn_fib_get_table(id, 0) == NULL)
 860                         return dn_fib_get_table(id, 1);
 861         return NULL;
 862 }
 863
 864 void dn_fib_flush(void)
 865 {
 866         int flushed = 0;
 867         struct dn_fib_table *tb;
 868         struct hlist_node *node;
 869         unsigned int h;
 870
 871         for (h = 0; h < DN_FIB_TABLE_HASHSZ; h++) {
 872                 hlist_for_each_entry(tb, node, &dn_fib_table_hash[h], hlist)
 873                         flushed += tb->flush(tb);
 874         }
 875
 876         if (flushed)
 877                 dn_rt_cache_flush(-1);
 878 }
 879
 880 void __init dn_fib_table_init(void)
 881 {
 882         dn_hash_kmem = kmem_cache_create("dn_fib_info_cache",
 883                                         sizeof(struct dn_fib_info),
 884                                         0, SLAB_HWCACHE_ALIGN,
 885                                         NULL, NULL);
 886 }
 887
 888 void __exit dn_fib_table_cleanup(void)
 889 {
 890         struct dn_fib_table *t;
 891         struct hlist_node *node, *next;
 892         unsigned int h;
 893
 894         write_lock(&dn_fib_tables_lock);
 895         for (h = 0; h < DN_FIB_TABLE_HASHSZ; h++) {
 896                 hlist_for_each_entry_safe(t, node, next, &dn_fib_table_hash[h],
 897                                           hlist) {
 898                         hlist_del(&t->hlist);
 899                         kfree(t);
 900                 }
 901         }
 902         write_unlock(&dn_fib_tables_lock);
 903 }