drivers/staging/batman-adv/originator.c

   1 /*
   2  * Copyright (C) 2009-2010 B.A.T.M.A.N. contributors:
   3  *
   4  * Marek Lindner, Simon Wunderlich
   5  *
   6  * This program is free software; you can redistribute it and/or
   7  * modify it under the terms of version 2 of the GNU General Public
   8  * License as published by the Free Software Foundation.
   9  *
  10  * This program is distributed in the hope that it will be useful, but
  11  * WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13  * General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU General Public License
  16  * along with this program; if not, write to the Free Software
  17  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  18  * 02110-1301, USA
  19  *
  20  */
  21
  22 /* increase the reference counter for this originator */
  23
  24 #include "main.h"
  25 #include "originator.h"
  26 #include "hash.h"
  27 #include "translation-table.h"
  28 #include "routing.h"
  29 #include "hard-interface.h"
  30
  31 static DECLARE_DELAYED_WORK(purge_orig_wq, purge_orig);
  32
  33 static void start_purge_timer(void)
  34 {
  35         queue_delayed_work(bat_event_workqueue, &purge_orig_wq, 1 * HZ);
  36 }
  37
  38 int originator_init(void)
  39 {
  40         unsigned long flags;
  41         if (orig_hash)
  42                 return 1;
  43
  44         spin_lock_irqsave(&orig_hash_lock, flags);
  45         orig_hash = hash_new(128, compare_orig, choose_orig);
  46
  47         if (!orig_hash)
  48                 goto err;
  49
  50         spin_unlock_irqrestore(&orig_hash_lock, flags);
  51         start_purge_timer();
  52         return 1;
  53
  54 err:
  55         spin_unlock_irqrestore(&orig_hash_lock, flags);
  56         return 0;
  57 }
  58
  59 struct neigh_node *
  60 create_neighbor(struct orig_node *orig_node, struct orig_node *orig_neigh_node,
  61                 uint8_t *neigh, struct batman_if *if_incoming)
  62 {
  63         struct neigh_node *neigh_node;
  64
  65         bat_dbg(DBG_BATMAN, "Creating new last-hop neighbor of originator\n");
  66
  67         neigh_node = kzalloc(sizeof(struct neigh_node), GFP_ATOMIC);
  68         if (!neigh_node)
  69                 return NULL;
  70
  71         INIT_LIST_HEAD(&neigh_node->list);
  72
  73         memcpy(neigh_node->addr, neigh, ETH_ALEN);
  74         neigh_node->orig_node = orig_neigh_node;
  75         neigh_node->if_incoming = if_incoming;
  76
  77         list_add_tail(&neigh_node->list, &orig_node->neigh_list);
  78         return neigh_node;
  79 }
  80
  81 static void free_orig_node(void *data)
  82 {
  83         struct list_head *list_pos, *list_pos_tmp;
  84         struct neigh_node *neigh_node;
  85         struct orig_node *orig_node = (struct orig_node *)data;
  86
  87         /* for all neighbors towards this originator ... */
  88         list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
  89                 neigh_node = list_entry(list_pos, struct neigh_node, list);
  90
  91                 list_del(list_pos);
  92                 kfree(neigh_node);
  93         }
  94
  95         hna_global_del_orig(orig_node, "originator timed out");
  96
  97         kfree(orig_node->bcast_own);
  98         kfree(orig_node->bcast_own_sum);
  99         kfree(orig_node);
 100 }
 101
 102 void originator_free(void)
 103 {
 104         unsigned long flags;
 105
 106         if (!orig_hash)
 107                 return;
 108
 109         cancel_delayed_work_sync(&purge_orig_wq);
 110
 111         spin_lock_irqsave(&orig_hash_lock, flags);
 112         hash_delete(orig_hash, free_orig_node);
 113         orig_hash = NULL;
 114         spin_unlock_irqrestore(&orig_hash_lock, flags);
 115 }
 116
 117 /* this function finds or creates an originator entry for the given
 118  * address if it does not exits */
 119 struct orig_node *get_orig_node(uint8_t *addr)
 120 {
 121         /* FIXME: each batman_if will be attached to a softif */
 122         struct bat_priv *bat_priv = netdev_priv(soft_device);
 123         struct orig_node *orig_node;
 124         struct hashtable_t *swaphash;
 125         int size;
 126
 127         orig_node = ((struct orig_node *)hash_find(orig_hash, addr));
 128
 129         if (orig_node != NULL)
 130                 return orig_node;
 131
 132         bat_dbg(DBG_BATMAN, "Creating new originator: %pM\n", addr);
 133
 134         orig_node = kzalloc(sizeof(struct orig_node), GFP_ATOMIC);
 135         if (!orig_node)
 136                 return NULL;
 137
 138         INIT_LIST_HEAD(&orig_node->neigh_list);
 139
 140         memcpy(orig_node->orig, addr, ETH_ALEN);
 141         orig_node->router = NULL;
 142         orig_node->hna_buff = NULL;
 143         orig_node->bcast_seqno_reset = jiffies - 1
 144                                         - msecs_to_jiffies(RESET_PROTECTION_MS);
 145         orig_node->batman_seqno_reset = jiffies - 1
 146                                         - msecs_to_jiffies(RESET_PROTECTION_MS);
 147
 148         size = bat_priv->num_ifaces * sizeof(TYPE_OF_WORD) * NUM_WORDS;
 149
 150         orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
 151         if (!orig_node->bcast_own)
 152                 goto free_orig_node;
 153
 154         size = bat_priv->num_ifaces * sizeof(uint8_t);
 155         orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
 156         if (!orig_node->bcast_own_sum)
 157                 goto free_bcast_own;
 158
 159         if (hash_add(orig_hash, orig_node) < 0)
 160                 goto free_bcast_own_sum;
 161
 162         if (orig_hash->elements * 4 > orig_hash->size) {
 163                 swaphash = hash_resize(orig_hash, orig_hash->size * 2);
 164
 165                 if (swaphash == NULL)
 166                         printk(KERN_ERR
 167                                "batman-adv:Couldn't resize orig hash table\n");
 168                 else
 169                         orig_hash = swaphash;
 170         }
 171
 172         return orig_node;
 173 free_bcast_own_sum:
 174         kfree(orig_node->bcast_own_sum);
 175 free_bcast_own:
 176         kfree(orig_node->bcast_own);
 177 free_orig_node:
 178         kfree(orig_node);
 179         return NULL;
 180 }
 181
 182 static bool purge_orig_neighbors(struct orig_node *orig_node,
 183                                  struct neigh_node **best_neigh_node)
 184 {
 185         struct list_head *list_pos, *list_pos_tmp;
 186         struct neigh_node *neigh_node;
 187         bool neigh_purged = false;
 188
 189         *best_neigh_node = NULL;
 190
 191         /* for all neighbors towards this originator ... */
 192         list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
 193                 neigh_node = list_entry(list_pos, struct neigh_node, list);
 194
 195                 if ((time_after(jiffies,
 196                                (neigh_node->last_valid +
 197                                 ((PURGE_TIMEOUT * HZ) / 1000)))) ||
 198                     (neigh_node->if_incoming->if_status ==
 199                                                 IF_TO_BE_REMOVED)) {
 200
 201                         if (neigh_node->if_incoming->if_status ==
 202                                                         IF_TO_BE_REMOVED)
 203                                 bat_dbg(DBG_BATMAN,
 204                                         "neighbor purge: originator %pM, "
 205                                         "neighbor: %pM, iface: %s\n",
 206                                         orig_node->orig, neigh_node->addr,
 207                                         neigh_node->if_incoming->dev);
 208                         else
 209                                 bat_dbg(DBG_BATMAN,
 210                                         "neighbor timeout: originator %pM, "
 211                                         "neighbor: %pM, last_valid: %lu\n",
 212                                         orig_node->orig, neigh_node->addr,
 213                                         (neigh_node->last_valid / HZ));
 214
 215                         neigh_purged = true;
 216                         list_del(list_pos);
 217                         kfree(neigh_node);
 218                 } else {
 219                         if ((*best_neigh_node == NULL) ||
 220                             (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
 221                                 *best_neigh_node = neigh_node;
 222                 }
 223         }
 224         return neigh_purged;
 225 }
 226
 227 static bool purge_orig_node(struct orig_node *orig_node)
 228 {
 229         struct neigh_node *best_neigh_node;
 230
 231         if (time_after(jiffies,
 232                        (orig_node->last_valid +
 233                         ((2 * PURGE_TIMEOUT * HZ) / 1000)))) {
 234
 235                 bat_dbg(DBG_BATMAN,
 236                         "Originator timeout: originator %pM, last_valid %lu\n",
 237                         orig_node->orig, (orig_node->last_valid / HZ));
 238                 return true;
 239         } else {
 240                 if (purge_orig_neighbors(orig_node, &best_neigh_node))
 241                         update_routes(orig_node, best_neigh_node,
 242                                       orig_node->hna_buff,
 243                                       orig_node->hna_buff_len);
 244         }
 245
 246         return false;
 247 }
 248
 249 void purge_orig(struct work_struct *work)
 250 {
 251         HASHIT(hashit);
 252         struct orig_node *orig_node;
 253         unsigned long flags;
 254
 255         spin_lock_irqsave(&orig_hash_lock, flags);
 256
 257         /* for all origins... */
 258         while (hash_iterate(orig_hash, &hashit)) {
 259                 orig_node = hashit.bucket->data;
 260                 if (purge_orig_node(orig_node)) {
 261                         hash_remove_bucket(orig_hash, &hashit);
 262                         free_orig_node(orig_node);
 263                 }
 264         }
 265
 266         spin_unlock_irqrestore(&orig_hash_lock, flags);
 267
 268         /* if work == NULL we were not called by the timer
 269          * and thus do not need to re-arm the timer */
 270         if (work)
 271                 start_purge_timer();
 272 }
 273
 274 int orig_seq_print_text(struct seq_file *seq, void *offset)
 275 {
 276         HASHIT(hashit);
 277         struct net_device *net_dev = (struct net_device *)seq->private;
 278         struct bat_priv *bat_priv = netdev_priv(net_dev);
 279         struct orig_node *orig_node;
 280         struct neigh_node *neigh_node;
 281         int batman_count = 0;
 282         unsigned long flags;
 283         char orig_str[ETH_STR_LEN], router_str[ETH_STR_LEN];
 284
 285         if ((!bat_priv->primary_if) ||
 286             (bat_priv->primary_if->if_status != IF_ACTIVE)) {
 287                 if (!bat_priv->primary_if)
 288                         return seq_printf(seq, "BATMAN mesh %s disabled - "
 289                                      "please specify interfaces to enable it\n",
 290                                      net_dev->name);
 291
 292                 return seq_printf(seq, "BATMAN mesh %s "
 293                                   "disabled - primary interface not active\n",
 294                                   net_dev->name);
 295         }
 296
 297         rcu_read_lock();
 298         seq_printf(seq, "  %-14s (%s/%i) %17s [%10s]: %20s "
 299                    "... [B.A.T.M.A.N. adv %s%s, MainIF/MAC: %s/%s (%s)]\n",
 300                    "Originator", "#", TQ_MAX_VALUE, "Nexthop", "outgoingIF",
 301                    "Potential nexthops", SOURCE_VERSION, REVISION_VERSION_STR,
 302                    bat_priv->primary_if->dev, bat_priv->primary_if->addr_str,
 303                    net_dev->name);
 304         rcu_read_unlock();
 305
 306         spin_lock_irqsave(&orig_hash_lock, flags);
 307
 308         while (hash_iterate(orig_hash, &hashit)) {
 309
 310                 orig_node = hashit.bucket->data;
 311
 312                 if (!orig_node->router)
 313                         continue;
 314
 315                 if (orig_node->router->tq_avg == 0)
 316                         continue;
 317
 318                 addr_to_string(orig_str, orig_node->orig);
 319                 addr_to_string(router_str, orig_node->router->addr);
 320
 321                 seq_printf(seq, "%-17s  (%3i) %17s [%10s]:",
 322                            orig_str, orig_node->router->tq_avg, router_str,
 323                            orig_node->router->if_incoming->dev);
 324
 325                 list_for_each_entry(neigh_node, &orig_node->neigh_list, list) {
 326                         addr_to_string(orig_str, neigh_node->addr);
 327                         seq_printf(seq, " %17s (%3i)", orig_str,
 328                                            neigh_node->tq_avg);
 329                 }
 330
 331                 seq_printf(seq, "\n");
 332                 batman_count++;
 333         }
 334
 335         spin_unlock_irqrestore(&orig_hash_lock, flags);
 336
 337         if ((batman_count == 0))
 338                 seq_printf(seq, "No batman nodes in range ...\n");
 339
 340         return 0;
 341 }
 342
 343 static int orig_node_add_if(struct orig_node *orig_node, int max_if_num)
 344 {
 345         void *data_ptr;
 346
 347         data_ptr = kmalloc(max_if_num * sizeof(TYPE_OF_WORD) * NUM_WORDS,
 348                            GFP_ATOMIC);
 349         if (!data_ptr) {
 350                 printk(KERN_ERR
 351                        "batman-adv:Can't resize orig: out of memory\n");
 352                 return -1;
 353         }
 354
 355         memcpy(data_ptr, orig_node->bcast_own,
 356                (max_if_num - 1) * sizeof(TYPE_OF_WORD) * NUM_WORDS);
 357         kfree(orig_node->bcast_own);
 358         orig_node->bcast_own = data_ptr;
 359
 360         data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
 361         if (!data_ptr) {
 362                 printk(KERN_ERR
 363                        "batman-adv:Can't resize orig: out of memory\n");
 364                 return -1;
 365         }
 366
 367         memcpy(data_ptr, orig_node->bcast_own_sum,
 368                (max_if_num - 1) * sizeof(uint8_t));
 369         kfree(orig_node->bcast_own_sum);
 370         orig_node->bcast_own_sum = data_ptr;
 371
 372         return 0;
 373 }
 374
 375 int orig_hash_add_if(struct batman_if *batman_if, int max_if_num)
 376 {
 377         struct orig_node *orig_node;
 378         HASHIT(hashit);
 379
 380         /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
 381          * if_num */
 382         spin_lock(&orig_hash_lock);
 383
 384         while (hash_iterate(orig_hash, &hashit)) {
 385                 orig_node = hashit.bucket->data;
 386
 387                 if (orig_node_add_if(orig_node, max_if_num) == -1)
 388                         goto err;
 389         }
 390
 391         spin_unlock(&orig_hash_lock);
 392         return 0;
 393
 394 err:
 395         spin_unlock(&orig_hash_lock);
 396         return -ENOMEM;
 397 }
 398
 399 static int orig_node_del_if(struct orig_node *orig_node,
 400                      int max_if_num, int del_if_num)
 401 {
 402         void *data_ptr = NULL;
 403         int chunk_size;
 404
 405         /* last interface was removed */
 406         if (max_if_num == 0)
 407                 goto free_bcast_own;
 408
 409         chunk_size = sizeof(TYPE_OF_WORD) * NUM_WORDS;
 410         data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
 411         if (!data_ptr) {
 412                 printk(KERN_ERR
 413                        "batman-adv:Can't resize orig: out of memory\n");
 414                 return -1;
 415         }
 416
 417         /* copy first part */
 418         memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
 419
 420         /* copy second part */
 421         memcpy(data_ptr,
 422                orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
 423                (max_if_num - del_if_num) * chunk_size);
 424
 425 free_bcast_own:
 426         kfree(orig_node->bcast_own);
 427         orig_node->bcast_own = data_ptr;
 428
 429         if (max_if_num == 0)
 430                 goto free_own_sum;
 431
 432         data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
 433         if (!data_ptr) {
 434                 printk(KERN_ERR
 435                        "batman-adv:Can't resize orig: out of memory\n");
 436                 return -1;
 437         }
 438
 439         memcpy(data_ptr, orig_node->bcast_own_sum,
 440                del_if_num * sizeof(uint8_t));
 441
 442         memcpy(data_ptr,
 443                orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
 444                (max_if_num - del_if_num) * sizeof(uint8_t));
 445
 446 free_own_sum:
 447         kfree(orig_node->bcast_own_sum);
 448         orig_node->bcast_own_sum = data_ptr;
 449
 450         return 0;
 451 }
 452
 453 int orig_hash_del_if(struct batman_if *batman_if, int max_if_num)
 454 {
 455         struct batman_if *batman_if_tmp;
 456         struct orig_node *orig_node;
 457         HASHIT(hashit);
 458         int ret;
 459
 460         /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
 461          * if_num */
 462         spin_lock(&orig_hash_lock);
 463
 464         while (hash_iterate(orig_hash, &hashit)) {
 465                 orig_node = hashit.bucket->data;
 466
 467                 ret = orig_node_del_if(orig_node, max_if_num,
 468                                        batman_if->if_num);
 469
 470                 if (ret == -1)
 471                         goto err;
 472         }
 473
 474         /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
 475         rcu_read_lock();
 476         list_for_each_entry_rcu(batman_if_tmp, &if_list, list) {
 477                 if (batman_if_tmp->if_status == IF_NOT_IN_USE)
 478                         continue;
 479
 480                 if (batman_if == batman_if_tmp)
 481                         continue;
 482
 483                 if (batman_if_tmp->if_num > batman_if->if_num)
 484                         batman_if_tmp->if_num--;
 485         }
 486         rcu_read_unlock();
 487
 488         batman_if->if_num = -1;
 489         spin_unlock(&orig_hash_lock);
 490         return 0;
 491
 492 err:
 493         spin_unlock(&orig_hash_lock);
 494         return -ENOMEM;
 495 }