SAFE public projects git trees. - safe/jmp/linux-2.6/blob - drivers/staging/batman-adv/originator.c

   1 /*
   2  * Copyright (C) 2009 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
  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 void originator_free(void)
  60 {
  61         unsigned long flags;
  62
  63         if (!orig_hash)
  64                 return;
  65
  66         cancel_delayed_work_sync(&purge_orig_wq);
  67
  68         spin_lock_irqsave(&orig_hash_lock, flags);
  69         hash_delete(orig_hash, free_orig_node);
  70         orig_hash = NULL;
  71         spin_unlock_irqrestore(&orig_hash_lock, flags);
  72 }
  73
  74 struct neigh_node *
  75 create_neighbor(struct orig_node *orig_node, struct orig_node *orig_neigh_node,
  76                 uint8_t *neigh, struct batman_if *if_incoming)
  77 {
  78         struct neigh_node *neigh_node;
  79
  80         bat_dbg(DBG_BATMAN, "Creating new last-hop neighbor of originator\n");
  81
  82         neigh_node = kmalloc(sizeof(struct neigh_node), GFP_ATOMIC);
  83         if (!neigh_node)
  84                 return NULL;
  85
  86         memset(neigh_node, 0, sizeof(struct neigh_node));
  87         INIT_LIST_HEAD(&neigh_node->list);
  88
  89         memcpy(neigh_node->addr, neigh, ETH_ALEN);
  90         neigh_node->orig_node = orig_neigh_node;
  91         neigh_node->if_incoming = if_incoming;
  92
  93         list_add_tail(&neigh_node->list, &orig_node->neigh_list);
  94         return neigh_node;
  95 }
  96
  97 void free_orig_node(void *data)
  98 {
  99         struct list_head *list_pos, *list_pos_tmp;
 100         struct neigh_node *neigh_node;
 101         struct orig_node *orig_node = (struct orig_node *)data;
 102
 103         /* for all neighbors towards this originator ... */
 104         list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
 105                 neigh_node = list_entry(list_pos, struct neigh_node, list);
 106
 107                 list_del(list_pos);
 108                 kfree(neigh_node);
 109         }
 110
 111         hna_global_del_orig(orig_node, "originator timed out");
 112
 113         kfree(orig_node->bcast_own);
 114         kfree(orig_node->bcast_own_sum);
 115         kfree(orig_node);
 116 }
 117
 118 /* this function finds or creates an originator entry for the given
 119  * address if it does not exits */
 120 struct orig_node *get_orig_node(uint8_t *addr)
 121 {
 122         struct orig_node *orig_node;
 123         struct hashtable_t *swaphash;
 124         char orig_str[ETH_STR_LEN];
 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         addr_to_string(orig_str, addr);
 133         bat_dbg(DBG_BATMAN, "Creating new originator: %s \n", orig_str);
 134
 135         orig_node = kmalloc(sizeof(struct orig_node), GFP_ATOMIC);
 136         if (!orig_node)
 137                 return NULL;
 138
 139         memset(orig_node, 0, sizeof(struct orig_node));
 140         INIT_LIST_HEAD(&orig_node->neigh_list);
 141
 142         memcpy(orig_node->orig, addr, ETH_ALEN);
 143         orig_node->router = NULL;
 144         orig_node->batman_if = NULL;
 145         orig_node->hna_buff = NULL;
 146
 147         size = num_ifs * sizeof(TYPE_OF_WORD) * NUM_WORDS;
 148
 149         orig_node->bcast_own = kmalloc(size, GFP_ATOMIC);
 150         if (!orig_node->bcast_own)
 151                 goto free_orig_node;
 152
 153         memset(orig_node->bcast_own, 0, size);
 154
 155         size = num_ifs * sizeof(uint8_t);
 156         orig_node->bcast_own_sum = kmalloc(size, GFP_ATOMIC);
 157         if (!orig_node->bcast_own_sum)
 158                 goto free_bcast_own;
 159
 160         memset(orig_node->bcast_own_sum, 0, size);
 161
 162         if (hash_add(orig_hash, orig_node) < 0)
 163                 goto free_bcast_own_sum;
 164
 165         if (orig_hash->elements * 4 > orig_hash->size) {
 166                 swaphash = hash_resize(orig_hash, orig_hash->size * 2);
 167
 168                 if (swaphash == NULL)
 169                         printk(KERN_ERR
 170                                "batman-adv:Couldn't resize orig hash table \n");
 171                 else
 172                         orig_hash = swaphash;
 173         }
 174
 175         return orig_node;
 176 free_bcast_own_sum:
 177         kfree(orig_node->bcast_own_sum);
 178 free_bcast_own:
 179         kfree(orig_node->bcast_own);
 180 free_orig_node:
 181         kfree(orig_node);
 182         return NULL;
 183 }
 184
 185 static bool purge_orig_neighbors(struct orig_node *orig_node,
 186                                  struct neigh_node **best_neigh_node)
 187 {
 188         struct list_head *list_pos, *list_pos_tmp;
 189         char neigh_str[ETH_STR_LEN], orig_str[ETH_STR_LEN];
 190         struct neigh_node *neigh_node;
 191         bool neigh_purged = false;
 192
 193         *best_neigh_node = NULL;
 194
 195
 196         /* for all neighbors towards this originator ... */
 197         list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
 198                 neigh_node = list_entry(list_pos, struct neigh_node, list);
 199
 200                 if (time_after(jiffies,
 201                                (neigh_node->last_valid +
 202                                 ((PURGE_TIMEOUT * HZ) / 1000)))) {
 203
 204                         addr_to_string(neigh_str, neigh_node->addr);
 205                         addr_to_string(orig_str, orig_node->orig);
 206                         bat_dbg(DBG_BATMAN, "neighbor timeout: originator %s, neighbor: %s, last_valid %lu\n", orig_str, neigh_str, (neigh_node->last_valid / HZ));
 207
 208                         neigh_purged = true;
 209                         list_del(list_pos);
 210                         kfree(neigh_node);
 211                 } else {
 212                         if ((*best_neigh_node == NULL) ||
 213                             (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
 214                                 *best_neigh_node = neigh_node;
 215                 }
 216         }
 217         return neigh_purged;
 218 }
 219
 220
 221 static bool purge_orig_node(struct orig_node *orig_node)
 222 {
 223         struct neigh_node *best_neigh_node;
 224         char orig_str[ETH_STR_LEN];
 225
 226         addr_to_string(orig_str, orig_node->orig);
 227
 228         if (time_after(jiffies,
 229                        (orig_node->last_valid +
 230                         ((2 * PURGE_TIMEOUT * HZ) / 1000)))) {
 231
 232                 bat_dbg(DBG_BATMAN,
 233                         "Originator timeout: originator %s, last_valid %lu\n",
 234                         orig_str, (orig_node->last_valid / HZ));
 235                 return true;
 236         } else {
 237                 if (purge_orig_neighbors(orig_node, &best_neigh_node))
 238                         update_routes(orig_node, best_neigh_node,
 239                                       orig_node->hna_buff,
 240                                       orig_node->hna_buff_len);
 241         }
 242         return false;
 243 }
 244
 245 void purge_orig(struct work_struct *work)
 246 {
 247         HASHIT(hashit);
 248         struct orig_node *orig_node;
 249         unsigned long flags;
 250
 251         spin_lock_irqsave(&orig_hash_lock, flags);
 252
 253         /* for all origins... */
 254         while (hash_iterate(orig_hash, &hashit)) {
 255                 orig_node = hashit.bucket->data;
 256                 if (purge_orig_node(orig_node)) {
 257                         hash_remove_bucket(orig_hash, &hashit);
 258                         free_orig_node(orig_node);
 259                 }
 260         }
 261
 262         spin_unlock_irqrestore(&orig_hash_lock, flags);
 263
 264         start_purge_timer();
 265 }
 266
 267