net/batman-adv/originator.c

   1 /* Copyright (C) 2009-2016  B.A.T.M.A.N. contributors:
   2  *
   3  * Marek Lindner, Simon Wunderlich
   4  *
   5  * This program is free software; you can redistribute it and/or
   6  * modify it under the terms of version 2 of the GNU General Public
   7  * License as published by the Free Software Foundation.
   8  *
   9  * This program is distributed in the hope that it will be useful, but
  10  * WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12  * General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU General Public License
  15  * along with this program; if not, see <http://www.gnu.org/licenses/>.
  16  */
  17
  18 #include "originator.h"
  19 #include "main.h"
  20
  21 #include <linux/atomic.h>
  22 #include <linux/errno.h>
  23 #include <linux/etherdevice.h>
  24 #include <linux/fs.h>
  25 #include <linux/jiffies.h>
  26 #include <linux/kernel.h>
  27 #include <linux/kref.h>
  28 #include <linux/list.h>
  29 #include <linux/lockdep.h>
  30 #include <linux/netdevice.h>
  31 #include <linux/rculist.h>
  32 #include <linux/seq_file.h>
  33 #include <linux/slab.h>
  34 #include <linux/spinlock.h>
  35 #include <linux/workqueue.h>
  36
  37 #include "distributed-arp-table.h"
  38 #include "fragmentation.h"
  39 #include "gateway_client.h"
  40 #include "hard-interface.h"
  41 #include "hash.h"
  42 #include "multicast.h"
  43 #include "network-coding.h"
  44 #include "routing.h"
  45 #include "translation-table.h"
  46
  47 /* hash class keys */
  48 static struct lock_class_key batadv_orig_hash_lock_class_key;
  49
  50 static void batadv_purge_orig(struct work_struct *work);
  51
  52 /**
  53  * batadv_compare_orig - comparing function used in the originator hash table
  54  * @node: node in the local table
  55  * @data2: second object to compare the node to
  56  *
  57  * Return: 1 if they are the same originator
  58  */
  59 int batadv_compare_orig(const struct hlist_node *node, const void *data2)
  60 {
  61         const void *data1 = container_of(node, struct batadv_orig_node,
  62                                          hash_entry);
  63
  64         return batadv_compare_eth(data1, data2);
  65 }
  66
  67 /**
  68  * batadv_orig_node_vlan_get - get an orig_node_vlan object
  69  * @orig_node: the originator serving the VLAN
  70  * @vid: the VLAN identifier
  71  *
  72  * Return: the vlan object identified by vid and belonging to orig_node or NULL
  73  * if it does not exist.
  74  */
  75 struct batadv_orig_node_vlan *
  76 batadv_orig_node_vlan_get(struct batadv_orig_node *orig_node,
  77                           unsigned short vid)
  78 {
  79         struct batadv_orig_node_vlan *vlan = NULL, *tmp;
  80
  81         rcu_read_lock();
  82         hlist_for_each_entry_rcu(tmp, &orig_node->vlan_list, list) {
  83                 if (tmp->vid != vid)
  84                         continue;
  85
  86                 if (!kref_get_unless_zero(&tmp->refcount))
  87                         continue;
  88
  89                 vlan = tmp;
  90
  91                 break;
  92         }
  93         rcu_read_unlock();
  94
  95         return vlan;
  96 }
  97
  98 /**
  99  * batadv_orig_node_vlan_new - search and possibly create an orig_node_vlan
 100  *  object
 101  * @orig_node: the originator serving the VLAN
 102  * @vid: the VLAN identifier
 103  *
 104  * Return: NULL in case of failure or the vlan object identified by vid and
 105  * belonging to orig_node otherwise. The object is created and added to the list
 106  * if it does not exist.
 107  *
 108  * The object is returned with refcounter increased by 1.
 109  */
 110 struct batadv_orig_node_vlan *
 111 batadv_orig_node_vlan_new(struct batadv_orig_node *orig_node,
 112                           unsigned short vid)
 113 {
 114         struct batadv_orig_node_vlan *vlan;
 115
 116         spin_lock_bh(&orig_node->vlan_list_lock);
 117
 118         /* first look if an object for this vid already exists */
 119         vlan = batadv_orig_node_vlan_get(orig_node, vid);
 120         if (vlan)
 121                 goto out;
 122
 123         vlan = kzalloc(sizeof(*vlan), GFP_ATOMIC);
 124         if (!vlan)
 125                 goto out;
 126
 127         kref_init(&vlan->refcount);
 128         kref_get(&vlan->refcount);
 129         vlan->vid = vid;
 130
 131         hlist_add_head_rcu(&vlan->list, &orig_node->vlan_list);
 132
 133 out:
 134         spin_unlock_bh(&orig_node->vlan_list_lock);
 135
 136         return vlan;
 137 }
 138
 139 /**
 140  * batadv_orig_node_vlan_release - release originator-vlan object from lists
 141  *  and queue for free after rcu grace period
 142  * @ref: kref pointer of the originator-vlan object
 143  */
 144 static void batadv_orig_node_vlan_release(struct kref *ref)
 145 {
 146         struct batadv_orig_node_vlan *orig_vlan;
 147
 148         orig_vlan = container_of(ref, struct batadv_orig_node_vlan, refcount);
 149
 150         kfree_rcu(orig_vlan, rcu);
 151 }
 152
 153 /**
 154  * batadv_orig_node_vlan_put - decrement the refcounter and possibly release
 155  *  the originator-vlan object
 156  * @orig_vlan: the originator-vlan object to release
 157  */
 158 void batadv_orig_node_vlan_put(struct batadv_orig_node_vlan *orig_vlan)
 159 {
 160         kref_put(&orig_vlan->refcount, batadv_orig_node_vlan_release);
 161 }
 162
 163 int batadv_originator_init(struct batadv_priv *bat_priv)
 164 {
 165         if (bat_priv->orig_hash)
 166                 return 0;
 167
 168         bat_priv->orig_hash = batadv_hash_new(1024);
 169
 170         if (!bat_priv->orig_hash)
 171                 goto err;
 172
 173         batadv_hash_set_lock_class(bat_priv->orig_hash,
 174                                    &batadv_orig_hash_lock_class_key);
 175
 176         INIT_DELAYED_WORK(&bat_priv->orig_work, batadv_purge_orig);
 177         queue_delayed_work(batadv_event_workqueue,
 178                            &bat_priv->orig_work,
 179                            msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
 180
 181         return 0;
 182
 183 err:
 184         return -ENOMEM;
 185 }
 186
 187 /**
 188  * batadv_neigh_ifinfo_release - release neigh_ifinfo from lists and queue for
 189  *  free after rcu grace period
 190  * @ref: kref pointer of the neigh_ifinfo
 191  */
 192 static void batadv_neigh_ifinfo_release(struct kref *ref)
 193 {
 194         struct batadv_neigh_ifinfo *neigh_ifinfo;
 195
 196         neigh_ifinfo = container_of(ref, struct batadv_neigh_ifinfo, refcount);
 197
 198         if (neigh_ifinfo->if_outgoing != BATADV_IF_DEFAULT)
 199                 batadv_hardif_put(neigh_ifinfo->if_outgoing);
 200
 201         kfree_rcu(neigh_ifinfo, rcu);
 202 }
 203
 204 /**
 205  * batadv_neigh_ifinfo_put - decrement the refcounter and possibly release
 206  *  the neigh_ifinfo
 207  * @neigh_ifinfo: the neigh_ifinfo object to release
 208  */
 209 void batadv_neigh_ifinfo_put(struct batadv_neigh_ifinfo *neigh_ifinfo)
 210 {
 211         kref_put(&neigh_ifinfo->refcount, batadv_neigh_ifinfo_release);
 212 }
 213
 214 /**
 215  * batadv_hardif_neigh_release - release hardif neigh node from lists and
 216  *  queue for free after rcu grace period
 217  * @ref: kref pointer of the neigh_node
 218  */
 219 static void batadv_hardif_neigh_release(struct kref *ref)
 220 {
 221         struct batadv_hardif_neigh_node *hardif_neigh;
 222
 223         hardif_neigh = container_of(ref, struct batadv_hardif_neigh_node,
 224                                     refcount);
 225
 226         spin_lock_bh(&hardif_neigh->if_incoming->neigh_list_lock);
 227         hlist_del_init_rcu(&hardif_neigh->list);
 228         spin_unlock_bh(&hardif_neigh->if_incoming->neigh_list_lock);
 229
 230         batadv_hardif_put(hardif_neigh->if_incoming);
 231         kfree_rcu(hardif_neigh, rcu);
 232 }
 233
 234 /**
 235  * batadv_hardif_neigh_put - decrement the hardif neighbors refcounter
 236  *  and possibly release it
 237  * @hardif_neigh: hardif neigh neighbor to free
 238  */
 239 void batadv_hardif_neigh_put(struct batadv_hardif_neigh_node *hardif_neigh)
 240 {
 241         kref_put(&hardif_neigh->refcount, batadv_hardif_neigh_release);
 242 }
 243
 244 /**
 245  * batadv_neigh_node_release - release neigh_node from lists and queue for
 246  *  free after rcu grace period
 247  * @ref: kref pointer of the neigh_node
 248  */
 249 static void batadv_neigh_node_release(struct kref *ref)
 250 {
 251         struct hlist_node *node_tmp;
 252         struct batadv_neigh_node *neigh_node;
 253         struct batadv_hardif_neigh_node *hardif_neigh;
 254         struct batadv_neigh_ifinfo *neigh_ifinfo;
 255         struct batadv_algo_ops *bao;
 256
 257         neigh_node = container_of(ref, struct batadv_neigh_node, refcount);
 258         bao = neigh_node->orig_node->bat_priv->bat_algo_ops;
 259
 260         hlist_for_each_entry_safe(neigh_ifinfo, node_tmp,
 261                                   &neigh_node->ifinfo_list, list) {
 262                 batadv_neigh_ifinfo_put(neigh_ifinfo);
 263         }
 264
 265         hardif_neigh = batadv_hardif_neigh_get(neigh_node->if_incoming,
 266                                                neigh_node->addr);
 267         if (hardif_neigh) {
 268                 /* batadv_hardif_neigh_get() increases refcount too */
 269                 batadv_hardif_neigh_put(hardif_neigh);
 270                 batadv_hardif_neigh_put(hardif_neigh);
 271         }
 272
 273         if (bao->bat_neigh_free)
 274                 bao->bat_neigh_free(neigh_node);
 275
 276         batadv_hardif_put(neigh_node->if_incoming);
 277
 278         kfree_rcu(neigh_node, rcu);
 279 }
 280
 281 /**
 282  * batadv_neigh_node_put - decrement the neighbors refcounter and possibly
 283  *  release it
 284  * @neigh_node: neigh neighbor to free
 285  */
 286 void batadv_neigh_node_put(struct batadv_neigh_node *neigh_node)
 287 {
 288         kref_put(&neigh_node->refcount, batadv_neigh_node_release);
 289 }
 290
 291 /**
 292  * batadv_orig_node_get_router - router to the originator depending on iface
 293  * @orig_node: the orig node for the router
 294  * @if_outgoing: the interface where the payload packet has been received or
 295  *  the OGM should be sent to
 296  *
 297  * Return: the neighbor which should be router for this orig_node/iface.
 298  *
 299  * The object is returned with refcounter increased by 1.
 300  */
 301 struct batadv_neigh_node *
 302 batadv_orig_router_get(struct batadv_orig_node *orig_node,
 303                        const struct batadv_hard_iface *if_outgoing)
 304 {
 305         struct batadv_orig_ifinfo *orig_ifinfo;
 306         struct batadv_neigh_node *router = NULL;
 307
 308         rcu_read_lock();
 309         hlist_for_each_entry_rcu(orig_ifinfo, &orig_node->ifinfo_list, list) {
 310                 if (orig_ifinfo->if_outgoing != if_outgoing)
 311                         continue;
 312
 313                 router = rcu_dereference(orig_ifinfo->router);
 314                 break;
 315         }
 316
 317         if (router && !kref_get_unless_zero(&router->refcount))
 318                 router = NULL;
 319
 320         rcu_read_unlock();
 321         return router;
 322 }
 323
 324 /**
 325  * batadv_orig_ifinfo_get - find the ifinfo from an orig_node
 326  * @orig_node: the orig node to be queried
 327  * @if_outgoing: the interface for which the ifinfo should be acquired
 328  *
 329  * Return: the requested orig_ifinfo or NULL if not found.
 330  *
 331  * The object is returned with refcounter increased by 1.
 332  */
 333 struct batadv_orig_ifinfo *
 334 batadv_orig_ifinfo_get(struct batadv_orig_node *orig_node,
 335                        struct batadv_hard_iface *if_outgoing)
 336 {
 337         struct batadv_orig_ifinfo *tmp, *orig_ifinfo = NULL;
 338
 339         rcu_read_lock();
 340         hlist_for_each_entry_rcu(tmp, &orig_node->ifinfo_list,
 341                                  list) {
 342                 if (tmp->if_outgoing != if_outgoing)
 343                         continue;
 344
 345                 if (!kref_get_unless_zero(&tmp->refcount))
 346                         continue;
 347
 348                 orig_ifinfo = tmp;
 349                 break;
 350         }
 351         rcu_read_unlock();
 352
 353         return orig_ifinfo;
 354 }
 355
 356 /**
 357  * batadv_orig_ifinfo_new - search and possibly create an orig_ifinfo object
 358  * @orig_node: the orig node to be queried
 359  * @if_outgoing: the interface for which the ifinfo should be acquired
 360  *
 361  * Return: NULL in case of failure or the orig_ifinfo object for the if_outgoing
 362  * interface otherwise. The object is created and added to the list
 363  * if it does not exist.
 364  *
 365  * The object is returned with refcounter increased by 1.
 366  */
 367 struct batadv_orig_ifinfo *
 368 batadv_orig_ifinfo_new(struct batadv_orig_node *orig_node,
 369                        struct batadv_hard_iface *if_outgoing)
 370 {
 371         struct batadv_orig_ifinfo *orig_ifinfo = NULL;
 372         unsigned long reset_time;
 373
 374         spin_lock_bh(&orig_node->neigh_list_lock);
 375
 376         orig_ifinfo = batadv_orig_ifinfo_get(orig_node, if_outgoing);
 377         if (orig_ifinfo)
 378                 goto out;
 379
 380         orig_ifinfo = kzalloc(sizeof(*orig_ifinfo), GFP_ATOMIC);
 381         if (!orig_ifinfo)
 382                 goto out;
 383
 384         if (if_outgoing != BATADV_IF_DEFAULT &&
 385             !kref_get_unless_zero(&if_outgoing->refcount)) {
 386                 kfree(orig_ifinfo);
 387                 orig_ifinfo = NULL;
 388                 goto out;
 389         }
 390
 391         reset_time = jiffies - 1;
 392         reset_time -= msecs_to_jiffies(BATADV_RESET_PROTECTION_MS);
 393         orig_ifinfo->batman_seqno_reset = reset_time;
 394         orig_ifinfo->if_outgoing = if_outgoing;
 395         INIT_HLIST_NODE(&orig_ifinfo->list);
 396         kref_init(&orig_ifinfo->refcount);
 397         kref_get(&orig_ifinfo->refcount);
 398         hlist_add_head_rcu(&orig_ifinfo->list,
 399                            &orig_node->ifinfo_list);
 400 out:
 401         spin_unlock_bh(&orig_node->neigh_list_lock);
 402         return orig_ifinfo;
 403 }
 404
 405 /**
 406  * batadv_neigh_ifinfo_get - find the ifinfo from an neigh_node
 407  * @neigh: the neigh node to be queried
 408  * @if_outgoing: the interface for which the ifinfo should be acquired
 409  *
 410  * The object is returned with refcounter increased by 1.
 411  *
 412  * Return: the requested neigh_ifinfo or NULL if not found
 413  */
 414 struct batadv_neigh_ifinfo *
 415 batadv_neigh_ifinfo_get(struct batadv_neigh_node *neigh,
 416                         struct batadv_hard_iface *if_outgoing)
 417 {
 418         struct batadv_neigh_ifinfo *neigh_ifinfo = NULL,
 419                                    *tmp_neigh_ifinfo;
 420
 421         rcu_read_lock();
 422         hlist_for_each_entry_rcu(tmp_neigh_ifinfo, &neigh->ifinfo_list,
 423                                  list) {
 424                 if (tmp_neigh_ifinfo->if_outgoing != if_outgoing)
 425                         continue;
 426
 427                 if (!kref_get_unless_zero(&tmp_neigh_ifinfo->refcount))
 428                         continue;
 429
 430                 neigh_ifinfo = tmp_neigh_ifinfo;
 431                 break;
 432         }
 433         rcu_read_unlock();
 434
 435         return neigh_ifinfo;
 436 }
 437
 438 /**
 439  * batadv_neigh_ifinfo_new - search and possibly create an neigh_ifinfo object
 440  * @neigh: the neigh node to be queried
 441  * @if_outgoing: the interface for which the ifinfo should be acquired
 442  *
 443  * Return: NULL in case of failure or the neigh_ifinfo object for the
 444  * if_outgoing interface otherwise. The object is created and added to the list
 445  * if it does not exist.
 446  *
 447  * The object is returned with refcounter increased by 1.
 448  */
 449 struct batadv_neigh_ifinfo *
 450 batadv_neigh_ifinfo_new(struct batadv_neigh_node *neigh,
 451                         struct batadv_hard_iface *if_outgoing)
 452 {
 453         struct batadv_neigh_ifinfo *neigh_ifinfo;
 454
 455         spin_lock_bh(&neigh->ifinfo_lock);
 456
 457         neigh_ifinfo = batadv_neigh_ifinfo_get(neigh, if_outgoing);
 458         if (neigh_ifinfo)
 459                 goto out;
 460
 461         neigh_ifinfo = kzalloc(sizeof(*neigh_ifinfo), GFP_ATOMIC);
 462         if (!neigh_ifinfo)
 463                 goto out;
 464
 465         if (if_outgoing && !kref_get_unless_zero(&if_outgoing->refcount)) {
 466                 kfree(neigh_ifinfo);
 467                 neigh_ifinfo = NULL;
 468                 goto out;
 469         }
 470
 471         INIT_HLIST_NODE(&neigh_ifinfo->list);
 472         kref_init(&neigh_ifinfo->refcount);
 473         kref_get(&neigh_ifinfo->refcount);
 474         neigh_ifinfo->if_outgoing = if_outgoing;
 475
 476         hlist_add_head_rcu(&neigh_ifinfo->list, &neigh->ifinfo_list);
 477
 478 out:
 479         spin_unlock_bh(&neigh->ifinfo_lock);
 480
 481         return neigh_ifinfo;
 482 }
 483
 484 /**
 485  * batadv_neigh_node_get - retrieve a neighbour from the list
 486  * @orig_node: originator which the neighbour belongs to
 487  * @hard_iface: the interface where this neighbour is connected to
 488  * @addr: the address of the neighbour
 489  *
 490  * Looks for and possibly returns a neighbour belonging to this originator list
 491  * which is connected through the provided hard interface.
 492  *
 493  * Return: neighbor when found. Othwerwise NULL
 494  */
 495 static struct batadv_neigh_node *
 496 batadv_neigh_node_get(const struct batadv_orig_node *orig_node,
 497                       const struct batadv_hard_iface *hard_iface,
 498                       const u8 *addr)
 499 {
 500         struct batadv_neigh_node *tmp_neigh_node, *res = NULL;
 501
 502         rcu_read_lock();
 503         hlist_for_each_entry_rcu(tmp_neigh_node, &orig_node->neigh_list, list) {
 504                 if (!batadv_compare_eth(tmp_neigh_node->addr, addr))
 505                         continue;
 506
 507                 if (tmp_neigh_node->if_incoming != hard_iface)
 508                         continue;
 509
 510                 if (!kref_get_unless_zero(&tmp_neigh_node->refcount))
 511                         continue;
 512
 513                 res = tmp_neigh_node;
 514                 break;
 515         }
 516         rcu_read_unlock();
 517
 518         return res;
 519 }
 520
 521 /**
 522  * batadv_hardif_neigh_create - create a hardif neighbour node
 523  * @hard_iface: the interface this neighbour is connected to
 524  * @neigh_addr: the interface address of the neighbour to retrieve
 525  *
 526  * Return: the hardif neighbour node if found or created or NULL otherwise.
 527  */
 528 static struct batadv_hardif_neigh_node *
 529 batadv_hardif_neigh_create(struct batadv_hard_iface *hard_iface,
 530                            const u8 *neigh_addr)
 531 {
 532         struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
 533         struct batadv_hardif_neigh_node *hardif_neigh = NULL;
 534
 535         spin_lock_bh(&hard_iface->neigh_list_lock);
 536
 537         /* check if neighbor hasn't been added in the meantime */
 538         hardif_neigh = batadv_hardif_neigh_get(hard_iface, neigh_addr);
 539         if (hardif_neigh)
 540                 goto out;
 541
 542         if (!kref_get_unless_zero(&hard_iface->refcount))
 543                 goto out;
 544
 545         hardif_neigh = kzalloc(sizeof(*hardif_neigh), GFP_ATOMIC);
 546         if (!hardif_neigh) {
 547                 batadv_hardif_put(hard_iface);
 548                 goto out;
 549         }
 550
 551         INIT_HLIST_NODE(&hardif_neigh->list);
 552         ether_addr_copy(hardif_neigh->addr, neigh_addr);
 553         hardif_neigh->if_incoming = hard_iface;
 554         hardif_neigh->last_seen = jiffies;
 555
 556         kref_init(&hardif_neigh->refcount);
 557
 558         if (bat_priv->bat_algo_ops->bat_hardif_neigh_init)
 559                 bat_priv->bat_algo_ops->bat_hardif_neigh_init(hardif_neigh);
 560
 561         hlist_add_head(&hardif_neigh->list, &hard_iface->neigh_list);
 562
 563 out:
 564         spin_unlock_bh(&hard_iface->neigh_list_lock);
 565         return hardif_neigh;
 566 }
 567
 568 /**
 569  * batadv_hardif_neigh_get_or_create - retrieve or create a hardif neighbour
 570  *  node
 571  * @hard_iface: the interface this neighbour is connected to
 572  * @neigh_addr: the interface address of the neighbour to retrieve
 573  *
 574  * Return: the hardif neighbour node if found or created or NULL otherwise.
 575  */
 576 static struct batadv_hardif_neigh_node *
 577 batadv_hardif_neigh_get_or_create(struct batadv_hard_iface *hard_iface,
 578                                   const u8 *neigh_addr)
 579 {
 580         struct batadv_hardif_neigh_node *hardif_neigh = NULL;
 581
 582         /* first check without locking to avoid the overhead */
 583         hardif_neigh = batadv_hardif_neigh_get(hard_iface, neigh_addr);
 584         if (hardif_neigh)
 585                 return hardif_neigh;
 586
 587         return batadv_hardif_neigh_create(hard_iface, neigh_addr);
 588 }
 589
 590 /**
 591  * batadv_hardif_neigh_get - retrieve a hardif neighbour from the list
 592  * @hard_iface: the interface where this neighbour is connected to
 593  * @neigh_addr: the address of the neighbour
 594  *
 595  * Looks for and possibly returns a neighbour belonging to this hard interface.
 596  *
 597  * Return: neighbor when found. Othwerwise NULL
 598  */
 599 struct batadv_hardif_neigh_node *
 600 batadv_hardif_neigh_get(const struct batadv_hard_iface *hard_iface,
 601                         const u8 *neigh_addr)
 602 {
 603         struct batadv_hardif_neigh_node *tmp_hardif_neigh, *hardif_neigh = NULL;
 604
 605         rcu_read_lock();
 606         hlist_for_each_entry_rcu(tmp_hardif_neigh,
 607                                  &hard_iface->neigh_list, list) {
 608                 if (!batadv_compare_eth(tmp_hardif_neigh->addr, neigh_addr))
 609                         continue;
 610
 611                 if (!kref_get_unless_zero(&tmp_hardif_neigh->refcount))
 612                         continue;
 613
 614                 hardif_neigh = tmp_hardif_neigh;
 615                 break;
 616         }
 617         rcu_read_unlock();
 618
 619         return hardif_neigh;
 620 }
 621
 622 /**
 623  * batadv_neigh_node_new - create and init a new neigh_node object
 624  * @orig_node: originator object representing the neighbour
 625  * @hard_iface: the interface where the neighbour is connected to
 626  * @neigh_addr: the mac address of the neighbour interface
 627  *
 628  * Allocates a new neigh_node object and initialises all the generic fields.
 629  *
 630  * Return: neighbor when found. Othwerwise NULL
 631  */
 632 struct batadv_neigh_node *
 633 batadv_neigh_node_new(struct batadv_orig_node *orig_node,
 634                       struct batadv_hard_iface *hard_iface,
 635                       const u8 *neigh_addr)
 636 {
 637         struct batadv_neigh_node *neigh_node;
 638         struct batadv_hardif_neigh_node *hardif_neigh = NULL;
 639
 640         neigh_node = batadv_neigh_node_get(orig_node, hard_iface, neigh_addr);
 641         if (neigh_node)
 642                 goto out;
 643
 644         hardif_neigh = batadv_hardif_neigh_get_or_create(hard_iface,
 645                                                          neigh_addr);
 646         if (!hardif_neigh)
 647                 goto out;
 648
 649         neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
 650         if (!neigh_node)
 651                 goto out;
 652
 653         if (!kref_get_unless_zero(&hard_iface->refcount)) {
 654                 kfree(neigh_node);
 655                 neigh_node = NULL;
 656                 goto out;
 657         }
 658
 659         INIT_HLIST_NODE(&neigh_node->list);
 660         INIT_HLIST_HEAD(&neigh_node->ifinfo_list);
 661         spin_lock_init(&neigh_node->ifinfo_lock);
 662
 663         ether_addr_copy(neigh_node->addr, neigh_addr);
 664         neigh_node->if_incoming = hard_iface;
 665         neigh_node->orig_node = orig_node;
 666         neigh_node->last_seen = jiffies;
 667
 668         /* extra reference for return */
 669         kref_init(&neigh_node->refcount);
 670         kref_get(&neigh_node->refcount);
 671
 672         spin_lock_bh(&orig_node->neigh_list_lock);
 673         hlist_add_head_rcu(&neigh_node->list, &orig_node->neigh_list);
 674         spin_unlock_bh(&orig_node->neigh_list_lock);
 675
 676         /* increment unique neighbor refcount */
 677         kref_get(&hardif_neigh->refcount);
 678
 679         batadv_dbg(BATADV_DBG_BATMAN, orig_node->bat_priv,
 680                    "Creating new neighbor %pM for orig_node %pM on interface %s\n",
 681                    neigh_addr, orig_node->orig, hard_iface->net_dev->name);
 682
 683 out:
 684         if (hardif_neigh)
 685                 batadv_hardif_neigh_put(hardif_neigh);
 686         return neigh_node;
 687 }
 688
 689 /**
 690  * batadv_hardif_neigh_seq_print_text - print the single hop neighbour list
 691  * @seq: neighbour table seq_file struct
 692  * @offset: not used
 693  *
 694  * Return: always 0
 695  */
 696 int batadv_hardif_neigh_seq_print_text(struct seq_file *seq, void *offset)
 697 {
 698         struct net_device *net_dev = (struct net_device *)seq->private;
 699         struct batadv_priv *bat_priv = netdev_priv(net_dev);
 700         struct batadv_hard_iface *primary_if;
 701
 702         primary_if = batadv_seq_print_text_primary_if_get(seq);
 703         if (!primary_if)
 704                 return 0;
 705
 706         seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s %s)]\n",
 707                    BATADV_SOURCE_VERSION, primary_if->net_dev->name,
 708                    primary_if->net_dev->dev_addr, net_dev->name,
 709                    bat_priv->bat_algo_ops->name);
 710
 711         batadv_hardif_put(primary_if);
 712
 713         if (!bat_priv->bat_algo_ops->bat_neigh_print) {
 714                 seq_puts(seq,
 715                          "No printing function for this routing protocol\n");
 716                 return 0;
 717         }
 718
 719         bat_priv->bat_algo_ops->bat_neigh_print(bat_priv, seq);
 720         return 0;
 721 }
 722
 723 /**
 724  * batadv_orig_ifinfo_release - release orig_ifinfo from lists and queue for
 725  *  free after rcu grace period
 726  * @ref: kref pointer of the orig_ifinfo
 727  */
 728 static void batadv_orig_ifinfo_release(struct kref *ref)
 729 {
 730         struct batadv_orig_ifinfo *orig_ifinfo;
 731         struct batadv_neigh_node *router;
 732
 733         orig_ifinfo = container_of(ref, struct batadv_orig_ifinfo, refcount);
 734
 735         if (orig_ifinfo->if_outgoing != BATADV_IF_DEFAULT)
 736                 batadv_hardif_put(orig_ifinfo->if_outgoing);
 737
 738         /* this is the last reference to this object */
 739         router = rcu_dereference_protected(orig_ifinfo->router, true);
 740         if (router)
 741                 batadv_neigh_node_put(router);
 742
 743         kfree_rcu(orig_ifinfo, rcu);
 744 }
 745
 746 /**
 747  * batadv_orig_ifinfo_put - decrement the refcounter and possibly release
 748  *  the orig_ifinfo
 749  * @orig_ifinfo: the orig_ifinfo object to release
 750  */
 751 void batadv_orig_ifinfo_put(struct batadv_orig_ifinfo *orig_ifinfo)
 752 {
 753         kref_put(&orig_ifinfo->refcount, batadv_orig_ifinfo_release);
 754 }
 755
 756 /**
 757  * batadv_orig_node_free_rcu - free the orig_node
 758  * @rcu: rcu pointer of the orig_node
 759  */
 760 static void batadv_orig_node_free_rcu(struct rcu_head *rcu)
 761 {
 762         struct batadv_orig_node *orig_node;
 763
 764         orig_node = container_of(rcu, struct batadv_orig_node, rcu);
 765
 766         batadv_mcast_purge_orig(orig_node);
 767
 768         batadv_frag_purge_orig(orig_node, NULL);
 769
 770         if (orig_node->bat_priv->bat_algo_ops->bat_orig_free)
 771                 orig_node->bat_priv->bat_algo_ops->bat_orig_free(orig_node);
 772
 773         kfree(orig_node->tt_buff);
 774         kfree(orig_node);
 775 }
 776
 777 /**
 778  * batadv_orig_node_release - release orig_node from lists and queue for
 779  *  free after rcu grace period
 780  * @ref: kref pointer of the orig_node
 781  */
 782 static void batadv_orig_node_release(struct kref *ref)
 783 {
 784         struct hlist_node *node_tmp;
 785         struct batadv_neigh_node *neigh_node;
 786         struct batadv_orig_node *orig_node;
 787         struct batadv_orig_ifinfo *orig_ifinfo;
 788
 789         orig_node = container_of(ref, struct batadv_orig_node, refcount);
 790
 791         spin_lock_bh(&orig_node->neigh_list_lock);
 792
 793         /* for all neighbors towards this originator ... */
 794         hlist_for_each_entry_safe(neigh_node, node_tmp,
 795                                   &orig_node->neigh_list, list) {
 796                 hlist_del_rcu(&neigh_node->list);
 797                 batadv_neigh_node_put(neigh_node);
 798         }
 799
 800         hlist_for_each_entry_safe(orig_ifinfo, node_tmp,
 801                                   &orig_node->ifinfo_list, list) {
 802                 hlist_del_rcu(&orig_ifinfo->list);
 803                 batadv_orig_ifinfo_put(orig_ifinfo);
 804         }
 805         spin_unlock_bh(&orig_node->neigh_list_lock);
 806
 807         /* Free nc_nodes */
 808         batadv_nc_purge_orig(orig_node->bat_priv, orig_node, NULL);
 809
 810         call_rcu(&orig_node->rcu, batadv_orig_node_free_rcu);
 811 }
 812
 813 /**
 814  * batadv_orig_node_put - decrement the orig node refcounter and possibly
 815  *  release it
 816  * @orig_node: the orig node to free
 817  */
 818 void batadv_orig_node_put(struct batadv_orig_node *orig_node)
 819 {
 820         kref_put(&orig_node->refcount, batadv_orig_node_release);
 821 }
 822
 823 void batadv_originator_free(struct batadv_priv *bat_priv)
 824 {
 825         struct batadv_hashtable *hash = bat_priv->orig_hash;
 826         struct hlist_node *node_tmp;
 827         struct hlist_head *head;
 828         spinlock_t *list_lock; /* spinlock to protect write access */
 829         struct batadv_orig_node *orig_node;
 830         u32 i;
 831
 832         if (!hash)
 833                 return;
 834
 835         cancel_delayed_work_sync(&bat_priv->orig_work);
 836
 837         bat_priv->orig_hash = NULL;
 838
 839         for (i = 0; i < hash->size; i++) {
 840                 head = &hash->table[i];
 841                 list_lock = &hash->list_locks[i];
 842
 843                 spin_lock_bh(list_lock);
 844                 hlist_for_each_entry_safe(orig_node, node_tmp,
 845                                           head, hash_entry) {
 846                         hlist_del_rcu(&orig_node->hash_entry);
 847                         batadv_orig_node_put(orig_node);
 848                 }
 849                 spin_unlock_bh(list_lock);
 850         }
 851
 852         batadv_hash_destroy(hash);
 853 }
 854
 855 /**
 856  * batadv_orig_node_new - creates a new orig_node
 857  * @bat_priv: the bat priv with all the soft interface information
 858  * @addr: the mac address of the originator
 859  *
 860  * Creates a new originator object and initialise all the generic fields.
 861  * The new object is not added to the originator list.
 862  *
 863  * Return: the newly created object or NULL on failure.
 864  */
 865 struct batadv_orig_node *batadv_orig_node_new(struct batadv_priv *bat_priv,
 866                                               const u8 *addr)
 867 {
 868         struct batadv_orig_node *orig_node;
 869         struct batadv_orig_node_vlan *vlan;
 870         unsigned long reset_time;
 871         int i;
 872
 873         batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
 874                    "Creating new originator: %pM\n", addr);
 875
 876         orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
 877         if (!orig_node)
 878                 return NULL;
 879
 880         INIT_HLIST_HEAD(&orig_node->neigh_list);
 881         INIT_HLIST_HEAD(&orig_node->vlan_list);
 882         INIT_HLIST_HEAD(&orig_node->ifinfo_list);
 883         spin_lock_init(&orig_node->bcast_seqno_lock);
 884         spin_lock_init(&orig_node->neigh_list_lock);
 885         spin_lock_init(&orig_node->tt_buff_lock);
 886         spin_lock_init(&orig_node->tt_lock);
 887         spin_lock_init(&orig_node->vlan_list_lock);
 888
 889         batadv_nc_init_orig(orig_node);
 890
 891         /* extra reference for return */
 892         kref_init(&orig_node->refcount);
 893         kref_get(&orig_node->refcount);
 894
 895         orig_node->bat_priv = bat_priv;
 896         ether_addr_copy(orig_node->orig, addr);
 897         batadv_dat_init_orig_node_addr(orig_node);
 898         atomic_set(&orig_node->last_ttvn, 0);
 899         orig_node->tt_buff = NULL;
 900         orig_node->tt_buff_len = 0;
 901         orig_node->last_seen = jiffies;
 902         reset_time = jiffies - 1 - msecs_to_jiffies(BATADV_RESET_PROTECTION_MS);
 903         orig_node->bcast_seqno_reset = reset_time;
 904
 905 #ifdef CONFIG_BATMAN_ADV_MCAST
 906         orig_node->mcast_flags = BATADV_NO_FLAGS;
 907         INIT_HLIST_NODE(&orig_node->mcast_want_all_unsnoopables_node);
 908         INIT_HLIST_NODE(&orig_node->mcast_want_all_ipv4_node);
 909         INIT_HLIST_NODE(&orig_node->mcast_want_all_ipv6_node);
 910         spin_lock_init(&orig_node->mcast_handler_lock);
 911 #endif
 912
 913         /* create a vlan object for the "untagged" LAN */
 914         vlan = batadv_orig_node_vlan_new(orig_node, BATADV_NO_FLAGS);
 915         if (!vlan)
 916                 goto free_orig_node;
 917         /* batadv_orig_node_vlan_new() increases the refcounter.
 918          * Immediately release vlan since it is not needed anymore in this
 919          * context
 920          */
 921         batadv_orig_node_vlan_put(vlan);
 922
 923         for (i = 0; i < BATADV_FRAG_BUFFER_COUNT; i++) {
 924                 INIT_HLIST_HEAD(&orig_node->fragments[i].head);
 925                 spin_lock_init(&orig_node->fragments[i].lock);
 926                 orig_node->fragments[i].size = 0;
 927         }
 928
 929         return orig_node;
 930 free_orig_node:
 931         kfree(orig_node);
 932         return NULL;
 933 }
 934
 935 /**
 936  * batadv_purge_neigh_ifinfo - purge obsolete ifinfo entries from neighbor
 937  * @bat_priv: the bat priv with all the soft interface information
 938  * @neigh: orig node which is to be checked
 939  */
 940 static void
 941 batadv_purge_neigh_ifinfo(struct batadv_priv *bat_priv,
 942                           struct batadv_neigh_node *neigh)
 943 {
 944         struct batadv_neigh_ifinfo *neigh_ifinfo;
 945         struct batadv_hard_iface *if_outgoing;
 946         struct hlist_node *node_tmp;
 947
 948         spin_lock_bh(&neigh->ifinfo_lock);
 949
 950         /* for all ifinfo objects for this neighinator */
 951         hlist_for_each_entry_safe(neigh_ifinfo, node_tmp,
 952                                   &neigh->ifinfo_list, list) {
 953                 if_outgoing = neigh_ifinfo->if_outgoing;
 954
 955                 /* always keep the default interface */
 956                 if (if_outgoing == BATADV_IF_DEFAULT)
 957                         continue;
 958
 959                 /* don't purge if the interface is not (going) down */
 960                 if ((if_outgoing->if_status != BATADV_IF_INACTIVE) &&
 961                     (if_outgoing->if_status != BATADV_IF_NOT_IN_USE) &&
 962                     (if_outgoing->if_status != BATADV_IF_TO_BE_REMOVED))
 963                         continue;
 964
 965                 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
 966                            "neighbor/ifinfo purge: neighbor %pM, iface: %s\n",
 967                            neigh->addr, if_outgoing->net_dev->name);
 968
 969                 hlist_del_rcu(&neigh_ifinfo->list);
 970                 batadv_neigh_ifinfo_put(neigh_ifinfo);
 971         }
 972
 973         spin_unlock_bh(&neigh->ifinfo_lock);
 974 }
 975
 976 /**
 977  * batadv_purge_orig_ifinfo - purge obsolete ifinfo entries from originator
 978  * @bat_priv: the bat priv with all the soft interface information
 979  * @orig_node: orig node which is to be checked
 980  *
 981  * Return: true if any ifinfo entry was purged, false otherwise.
 982  */
 983 static bool
 984 batadv_purge_orig_ifinfo(struct batadv_priv *bat_priv,
 985                          struct batadv_orig_node *orig_node)
 986 {
 987         struct batadv_orig_ifinfo *orig_ifinfo;
 988         struct batadv_hard_iface *if_outgoing;
 989         struct hlist_node *node_tmp;
 990         bool ifinfo_purged = false;
 991
 992         spin_lock_bh(&orig_node->neigh_list_lock);
 993
 994         /* for all ifinfo objects for this originator */
 995         hlist_for_each_entry_safe(orig_ifinfo, node_tmp,
 996                                   &orig_node->ifinfo_list, list) {
 997                 if_outgoing = orig_ifinfo->if_outgoing;
 998
 999                 /* always keep the default interface */
1000                 if (if_outgoing == BATADV_IF_DEFAULT)
1001                         continue;
1002
1003                 /* don't purge if the interface is not (going) down */
1004                 if ((if_outgoing->if_status != BATADV_IF_INACTIVE) &&
1005                     (if_outgoing->if_status != BATADV_IF_NOT_IN_USE) &&
1006                     (if_outgoing->if_status != BATADV_IF_TO_BE_REMOVED))
1007                         continue;
1008
1009                 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
1010                            "router/ifinfo purge: originator %pM, iface: %s\n",
1011                            orig_node->orig, if_outgoing->net_dev->name);
1012
1013                 ifinfo_purged = true;
1014
1015                 hlist_del_rcu(&orig_ifinfo->list);
1016                 batadv_orig_ifinfo_put(orig_ifinfo);
1017                 if (orig_node->last_bonding_candidate == orig_ifinfo) {
1018                         orig_node->last_bonding_candidate = NULL;
1019                         batadv_orig_ifinfo_put(orig_ifinfo);
1020                 }
1021         }
1022
1023         spin_unlock_bh(&orig_node->neigh_list_lock);
1024
1025         return ifinfo_purged;
1026 }
1027
1028 /**
1029  * batadv_purge_orig_neighbors - purges neighbors from originator
1030  * @bat_priv: the bat priv with all the soft interface information
1031  * @orig_node: orig node which is to be checked
1032  *
1033  * Return: true if any neighbor was purged, false otherwise
1034  */
1035 static bool
1036 batadv_purge_orig_neighbors(struct batadv_priv *bat_priv,
1037                             struct batadv_orig_node *orig_node)
1038 {
1039         struct hlist_node *node_tmp;
1040         struct batadv_neigh_node *neigh_node;
1041         bool neigh_purged = false;
1042         unsigned long last_seen;
1043         struct batadv_hard_iface *if_incoming;
1044
1045         spin_lock_bh(&orig_node->neigh_list_lock);
1046
1047         /* for all neighbors towards this originator ... */
1048         hlist_for_each_entry_safe(neigh_node, node_tmp,
1049                                   &orig_node->neigh_list, list) {
1050                 last_seen = neigh_node->last_seen;
1051                 if_incoming = neigh_node->if_incoming;
1052
1053                 if ((batadv_has_timed_out(last_seen, BATADV_PURGE_TIMEOUT)) ||
1054                     (if_incoming->if_status == BATADV_IF_INACTIVE) ||
1055                     (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
1056                     (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED)) {
1057                         if ((if_incoming->if_status == BATADV_IF_INACTIVE) ||
1058                             (if_incoming->if_status == BATADV_IF_NOT_IN_USE) ||
1059                             (if_incoming->if_status == BATADV_IF_TO_BE_REMOVED))
1060                                 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
1061                                            "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
1062                                            orig_node->orig, neigh_node->addr,
1063                                            if_incoming->net_dev->name);
1064                         else
1065                                 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
1066                                            "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
1067                                            orig_node->orig, neigh_node->addr,
1068                                            jiffies_to_msecs(last_seen));
1069
1070                         neigh_purged = true;
1071
1072                         hlist_del_rcu(&neigh_node->list);
1073                         batadv_neigh_node_put(neigh_node);
1074                 } else {
1075                         /* only necessary if not the whole neighbor is to be
1076                          * deleted, but some interface has been removed.
1077                          */
1078                         batadv_purge_neigh_ifinfo(bat_priv, neigh_node);
1079                 }
1080         }
1081
1082         spin_unlock_bh(&orig_node->neigh_list_lock);
1083         return neigh_purged;
1084 }
1085
1086 /**
1087  * batadv_find_best_neighbor - finds the best neighbor after purging
1088  * @bat_priv: the bat priv with all the soft interface information
1089  * @orig_node: orig node which is to be checked
1090  * @if_outgoing: the interface for which the metric should be compared
1091  *
1092  * Return: the current best neighbor, with refcount increased.
1093  */
1094 static struct batadv_neigh_node *
1095 batadv_find_best_neighbor(struct batadv_priv *bat_priv,
1096                           struct batadv_orig_node *orig_node,
1097                           struct batadv_hard_iface *if_outgoing)
1098 {
1099         struct batadv_neigh_node *best = NULL, *neigh;
1100         struct batadv_algo_ops *bao = bat_priv->bat_algo_ops;
1101
1102         rcu_read_lock();
1103         hlist_for_each_entry_rcu(neigh, &orig_node->neigh_list, list) {
1104                 if (best && (bao->bat_neigh_cmp(neigh, if_outgoing,
1105                                                 best, if_outgoing) <= 0))
1106                         continue;
1107
1108                 if (!kref_get_unless_zero(&neigh->refcount))
1109                         continue;
1110
1111                 if (best)
1112                         batadv_neigh_node_put(best);
1113
1114                 best = neigh;
1115         }
1116         rcu_read_unlock();
1117
1118         return best;
1119 }
1120
1121 /**
1122  * batadv_purge_orig_node - purges obsolete information from an orig_node
1123  * @bat_priv: the bat priv with all the soft interface information
1124  * @orig_node: orig node which is to be checked
1125  *
1126  * This function checks if the orig_node or substructures of it have become
1127  * obsolete, and purges this information if that's the case.
1128  *
1129  * Return: true if the orig_node is to be removed, false otherwise.
1130  */
1131 static bool batadv_purge_orig_node(struct batadv_priv *bat_priv,
1132                                    struct batadv_orig_node *orig_node)
1133 {
1134         struct batadv_neigh_node *best_neigh_node;
1135         struct batadv_hard_iface *hard_iface;
1136         bool changed_ifinfo, changed_neigh;
1137
1138         if (batadv_has_timed_out(orig_node->last_seen,
1139                                  2 * BATADV_PURGE_TIMEOUT)) {
1140                 batadv_dbg(BATADV_DBG_BATMAN, bat_priv,
1141                            "Originator timeout: originator %pM, last_seen %u\n",
1142                            orig_node->orig,
1143                            jiffies_to_msecs(orig_node->last_seen));
1144                 return true;
1145         }
1146         changed_ifinfo = batadv_purge_orig_ifinfo(bat_priv, orig_node);
1147         changed_neigh = batadv_purge_orig_neighbors(bat_priv, orig_node);
1148
1149         if (!changed_ifinfo && !changed_neigh)
1150                 return false;
1151
1152         /* first for NULL ... */
1153         best_neigh_node = batadv_find_best_neighbor(bat_priv, orig_node,
1154                                                     BATADV_IF_DEFAULT);
1155         batadv_update_route(bat_priv, orig_node, BATADV_IF_DEFAULT,
1156                             best_neigh_node);
1157         if (best_neigh_node)
1158                 batadv_neigh_node_put(best_neigh_node);
1159
1160         /* ... then for all other interfaces. */
1161         rcu_read_lock();
1162         list_for_each_entry_rcu(hard_iface, &batadv_hardif_list, list) {
1163                 if (hard_iface->if_status != BATADV_IF_ACTIVE)
1164                         continue;
1165
1166                 if (hard_iface->soft_iface != bat_priv->soft_iface)
1167                         continue;
1168
1169                 best_neigh_node = batadv_find_best_neighbor(bat_priv,
1170                                                             orig_node,
1171                                                             hard_iface);
1172                 batadv_update_route(bat_priv, orig_node, hard_iface,
1173                                     best_neigh_node);
1174                 if (best_neigh_node)
1175                         batadv_neigh_node_put(best_neigh_node);
1176         }
1177         rcu_read_unlock();
1178
1179         return false;
1180 }
1181
1182 static void _batadv_purge_orig(struct batadv_priv *bat_priv)
1183 {
1184         struct batadv_hashtable *hash = bat_priv->orig_hash;
1185         struct hlist_node *node_tmp;
1186         struct hlist_head *head;
1187         spinlock_t *list_lock; /* spinlock to protect write access */
1188         struct batadv_orig_node *orig_node;
1189         u32 i;
1190
1191         if (!hash)
1192                 return;
1193
1194         /* for all origins... */
1195         for (i = 0; i < hash->size; i++) {
1196                 head = &hash->table[i];
1197                 list_lock = &hash->list_locks[i];
1198
1199                 spin_lock_bh(list_lock);
1200                 hlist_for_each_entry_safe(orig_node, node_tmp,
1201                                           head, hash_entry) {
1202                         if (batadv_purge_orig_node(bat_priv, orig_node)) {
1203                                 batadv_gw_node_delete(bat_priv, orig_node);
1204                                 hlist_del_rcu(&orig_node->hash_entry);
1205                                 batadv_tt_global_del_orig(orig_node->bat_priv,
1206                                                           orig_node, -1,
1207                                                           "originator timed out");
1208                                 batadv_orig_node_put(orig_node);
1209                                 continue;
1210                         }
1211
1212                         batadv_frag_purge_orig(orig_node,
1213                                                batadv_frag_check_entry);
1214                 }
1215                 spin_unlock_bh(list_lock);
1216         }
1217
1218         batadv_gw_election(bat_priv);
1219 }
1220
1221 static void batadv_purge_orig(struct work_struct *work)
1222 {
1223         struct delayed_work *delayed_work;
1224         struct batadv_priv *bat_priv;
1225
1226         delayed_work = container_of(work, struct delayed_work, work);
1227         bat_priv = container_of(delayed_work, struct batadv_priv, orig_work);
1228         _batadv_purge_orig(bat_priv);
1229         queue_delayed_work(batadv_event_workqueue,
1230                            &bat_priv->orig_work,
1231                            msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD));
1232 }
1233
1234 void batadv_purge_orig_ref(struct batadv_priv *bat_priv)
1235 {
1236         _batadv_purge_orig(bat_priv);
1237 }
1238
1239 int batadv_orig_seq_print_text(struct seq_file *seq, void *offset)
1240 {
1241         struct net_device *net_dev = (struct net_device *)seq->private;
1242         struct batadv_priv *bat_priv = netdev_priv(net_dev);
1243         struct batadv_hard_iface *primary_if;
1244
1245         primary_if = batadv_seq_print_text_primary_if_get(seq);
1246         if (!primary_if)
1247                 return 0;
1248
1249         seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s %s)]\n",
1250                    BATADV_SOURCE_VERSION, primary_if->net_dev->name,
1251                    primary_if->net_dev->dev_addr, net_dev->name,
1252                    bat_priv->bat_algo_ops->name);
1253
1254         batadv_hardif_put(primary_if);
1255
1256         if (!bat_priv->bat_algo_ops->bat_orig_print) {
1257                 seq_puts(seq,
1258                          "No printing function for this routing protocol\n");
1259                 return 0;
1260         }
1261
1262         bat_priv->bat_algo_ops->bat_orig_print(bat_priv, seq,
1263                                                BATADV_IF_DEFAULT);
1264
1265         return 0;
1266 }
1267
1268 /**
1269  * batadv_orig_hardif_seq_print_text - writes originator infos for a specific
1270  *  outgoing interface
1271  * @seq: debugfs table seq_file struct
1272  * @offset: not used
1273  *
1274  * Return: 0
1275  */
1276 int batadv_orig_hardif_seq_print_text(struct seq_file *seq, void *offset)
1277 {
1278         struct net_device *net_dev = (struct net_device *)seq->private;
1279         struct batadv_hard_iface *hard_iface;
1280         struct batadv_priv *bat_priv;
1281
1282         hard_iface = batadv_hardif_get_by_netdev(net_dev);
1283
1284         if (!hard_iface || !hard_iface->soft_iface) {
1285                 seq_puts(seq, "Interface not known to B.A.T.M.A.N.\n");
1286                 goto out;
1287         }
1288
1289         bat_priv = netdev_priv(hard_iface->soft_iface);
1290         if (!bat_priv->bat_algo_ops->bat_orig_print) {
1291                 seq_puts(seq,
1292                          "No printing function for this routing protocol\n");
1293                 goto out;
1294         }
1295
1296         if (hard_iface->if_status != BATADV_IF_ACTIVE) {
1297                 seq_puts(seq, "Interface not active\n");
1298                 goto out;
1299         }
1300
1301         seq_printf(seq, "[B.A.T.M.A.N. adv %s, IF/MAC: %s/%pM (%s %s)]\n",
1302                    BATADV_SOURCE_VERSION, hard_iface->net_dev->name,
1303                    hard_iface->net_dev->dev_addr,
1304                    hard_iface->soft_iface->name, bat_priv->bat_algo_ops->name);
1305
1306         bat_priv->bat_algo_ops->bat_orig_print(bat_priv, seq, hard_iface);
1307
1308 out:
1309         if (hard_iface)
1310                 batadv_hardif_put(hard_iface);
1311         return 0;
1312 }
1313
1314 int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
1315                             int max_if_num)
1316 {
1317         struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
1318         struct batadv_algo_ops *bao = bat_priv->bat_algo_ops;
1319         struct batadv_hashtable *hash = bat_priv->orig_hash;
1320         struct hlist_head *head;
1321         struct batadv_orig_node *orig_node;
1322         u32 i;
1323         int ret;
1324
1325         /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
1326          * if_num
1327          */
1328         for (i = 0; i < hash->size; i++) {
1329                 head = &hash->table[i];
1330
1331                 rcu_read_lock();
1332                 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
1333                         ret = 0;
1334                         if (bao->bat_orig_add_if)
1335                                 ret = bao->bat_orig_add_if(orig_node,
1336                                                            max_if_num);
1337                         if (ret == -ENOMEM)
1338                                 goto err;
1339                 }
1340                 rcu_read_unlock();
1341         }
1342
1343         return 0;
1344
1345 err:
1346         rcu_read_unlock();
1347         return -ENOMEM;
1348 }
1349
1350 int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
1351                             int max_if_num)
1352 {
1353         struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
1354         struct batadv_hashtable *hash = bat_priv->orig_hash;
1355         struct hlist_head *head;
1356         struct batadv_hard_iface *hard_iface_tmp;
1357         struct batadv_orig_node *orig_node;
1358         struct batadv_algo_ops *bao = bat_priv->bat_algo_ops;
1359         u32 i;
1360         int ret;
1361
1362         /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
1363          * if_num
1364          */
1365         for (i = 0; i < hash->size; i++) {
1366                 head = &hash->table[i];
1367
1368                 rcu_read_lock();
1369                 hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
1370                         ret = 0;
1371                         if (bao->bat_orig_del_if)
1372                                 ret = bao->bat_orig_del_if(orig_node,
1373                                                            max_if_num,
1374                                                            hard_iface->if_num);
1375                         if (ret == -ENOMEM)
1376                                 goto err;
1377                 }
1378                 rcu_read_unlock();
1379         }
1380
1381         /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
1382         rcu_read_lock();
1383         list_for_each_entry_rcu(hard_iface_tmp, &batadv_hardif_list, list) {
1384                 if (hard_iface_tmp->if_status == BATADV_IF_NOT_IN_USE)
1385                         continue;
1386
1387                 if (hard_iface == hard_iface_tmp)
1388                         continue;
1389
1390                 if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
1391                         continue;
1392
1393                 if (hard_iface_tmp->if_num > hard_iface->if_num)
1394                         hard_iface_tmp->if_num--;
1395         }
1396         rcu_read_unlock();
1397
1398         hard_iface->if_num = -1;
1399         return 0;
1400
1401 err:
1402         rcu_read_unlock();
1403         return -ENOMEM;
1404 }