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