1 /* Copyright (C) 2009-2016 B.A.T.M.A.N. contributors:
3 * Marek Lindner, Simon Wunderlich
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.
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.
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/>.
18 #include "originator.h"
21 #include <linux/atomic.h>
22 #include <linux/errno.h>
23 #include <linux/etherdevice.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>
38 #include "distributed-arp-table.h"
39 #include "fragmentation.h"
40 #include "gateway_client.h"
41 #include "hard-interface.h"
44 #include "multicast.h"
45 #include "network-coding.h"
47 #include "translation-table.h"
50 static struct lock_class_key batadv_orig_hash_lock_class_key
;
52 static void batadv_purge_orig(struct work_struct
*work
);
55 * batadv_compare_orig - comparing function used in the originator hash table
56 * @node: node in the local table
57 * @data2: second object to compare the node to
59 * Return: true if they are the same originator
61 bool batadv_compare_orig(const struct hlist_node
*node
, const void *data2
)
63 const void *data1
= container_of(node
, struct batadv_orig_node
,
66 return batadv_compare_eth(data1
, data2
);
70 * batadv_orig_node_vlan_get - get an orig_node_vlan object
71 * @orig_node: the originator serving the VLAN
72 * @vid: the VLAN identifier
74 * Return: the vlan object identified by vid and belonging to orig_node or NULL
75 * if it does not exist.
77 struct batadv_orig_node_vlan
*
78 batadv_orig_node_vlan_get(struct batadv_orig_node
*orig_node
,
81 struct batadv_orig_node_vlan
*vlan
= NULL
, *tmp
;
84 hlist_for_each_entry_rcu(tmp
, &orig_node
->vlan_list
, list
) {
88 if (!kref_get_unless_zero(&tmp
->refcount
))
101 * batadv_orig_node_vlan_new - search and possibly create an orig_node_vlan
103 * @orig_node: the originator serving the VLAN
104 * @vid: the VLAN identifier
106 * Return: NULL in case of failure or the vlan object identified by vid and
107 * belonging to orig_node otherwise. The object is created and added to the list
108 * if it does not exist.
110 * The object is returned with refcounter increased by 1.
112 struct batadv_orig_node_vlan
*
113 batadv_orig_node_vlan_new(struct batadv_orig_node
*orig_node
,
116 struct batadv_orig_node_vlan
*vlan
;
118 spin_lock_bh(&orig_node
->vlan_list_lock
);
120 /* first look if an object for this vid already exists */
121 vlan
= batadv_orig_node_vlan_get(orig_node
, vid
);
125 vlan
= kzalloc(sizeof(*vlan
), GFP_ATOMIC
);
129 kref_init(&vlan
->refcount
);
130 kref_get(&vlan
->refcount
);
133 hlist_add_head_rcu(&vlan
->list
, &orig_node
->vlan_list
);
136 spin_unlock_bh(&orig_node
->vlan_list_lock
);
142 * batadv_orig_node_vlan_release - release originator-vlan object from lists
143 * and queue for free after rcu grace period
144 * @ref: kref pointer of the originator-vlan object
146 static void batadv_orig_node_vlan_release(struct kref
*ref
)
148 struct batadv_orig_node_vlan
*orig_vlan
;
150 orig_vlan
= container_of(ref
, struct batadv_orig_node_vlan
, refcount
);
152 kfree_rcu(orig_vlan
, rcu
);
156 * batadv_orig_node_vlan_put - decrement the refcounter and possibly release
157 * the originator-vlan object
158 * @orig_vlan: the originator-vlan object to release
160 void batadv_orig_node_vlan_put(struct batadv_orig_node_vlan
*orig_vlan
)
162 kref_put(&orig_vlan
->refcount
, batadv_orig_node_vlan_release
);
165 int batadv_originator_init(struct batadv_priv
*bat_priv
)
167 if (bat_priv
->orig_hash
)
170 bat_priv
->orig_hash
= batadv_hash_new(1024);
172 if (!bat_priv
->orig_hash
)
175 batadv_hash_set_lock_class(bat_priv
->orig_hash
,
176 &batadv_orig_hash_lock_class_key
);
178 INIT_DELAYED_WORK(&bat_priv
->orig_work
, batadv_purge_orig
);
179 queue_delayed_work(batadv_event_workqueue
,
180 &bat_priv
->orig_work
,
181 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD
));
190 * batadv_neigh_ifinfo_release - release neigh_ifinfo from lists and queue for
191 * free after rcu grace period
192 * @ref: kref pointer of the neigh_ifinfo
194 static void batadv_neigh_ifinfo_release(struct kref
*ref
)
196 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
198 neigh_ifinfo
= container_of(ref
, struct batadv_neigh_ifinfo
, refcount
);
200 if (neigh_ifinfo
->if_outgoing
!= BATADV_IF_DEFAULT
)
201 batadv_hardif_put(neigh_ifinfo
->if_outgoing
);
203 kfree_rcu(neigh_ifinfo
, rcu
);
207 * batadv_neigh_ifinfo_put - decrement the refcounter and possibly release
209 * @neigh_ifinfo: the neigh_ifinfo object to release
211 void batadv_neigh_ifinfo_put(struct batadv_neigh_ifinfo
*neigh_ifinfo
)
213 kref_put(&neigh_ifinfo
->refcount
, batadv_neigh_ifinfo_release
);
217 * batadv_hardif_neigh_release - release hardif neigh node from lists and
218 * queue for free after rcu grace period
219 * @ref: kref pointer of the neigh_node
221 static void batadv_hardif_neigh_release(struct kref
*ref
)
223 struct batadv_hardif_neigh_node
*hardif_neigh
;
225 hardif_neigh
= container_of(ref
, struct batadv_hardif_neigh_node
,
228 spin_lock_bh(&hardif_neigh
->if_incoming
->neigh_list_lock
);
229 hlist_del_init_rcu(&hardif_neigh
->list
);
230 spin_unlock_bh(&hardif_neigh
->if_incoming
->neigh_list_lock
);
232 batadv_hardif_put(hardif_neigh
->if_incoming
);
233 kfree_rcu(hardif_neigh
, rcu
);
237 * batadv_hardif_neigh_put - decrement the hardif neighbors refcounter
238 * and possibly release it
239 * @hardif_neigh: hardif neigh neighbor to free
241 void batadv_hardif_neigh_put(struct batadv_hardif_neigh_node
*hardif_neigh
)
243 kref_put(&hardif_neigh
->refcount
, batadv_hardif_neigh_release
);
247 * batadv_neigh_node_release - release neigh_node from lists and queue for
248 * free after rcu grace period
249 * @ref: kref pointer of the neigh_node
251 static void batadv_neigh_node_release(struct kref
*ref
)
253 struct hlist_node
*node_tmp
;
254 struct batadv_neigh_node
*neigh_node
;
255 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
257 neigh_node
= container_of(ref
, struct batadv_neigh_node
, refcount
);
259 hlist_for_each_entry_safe(neigh_ifinfo
, node_tmp
,
260 &neigh_node
->ifinfo_list
, list
) {
261 batadv_neigh_ifinfo_put(neigh_ifinfo
);
264 batadv_hardif_neigh_put(neigh_node
->hardif_neigh
);
266 batadv_hardif_put(neigh_node
->if_incoming
);
268 kfree_rcu(neigh_node
, rcu
);
272 * batadv_neigh_node_put - decrement the neighbors refcounter and possibly
274 * @neigh_node: neigh neighbor to free
276 void batadv_neigh_node_put(struct batadv_neigh_node
*neigh_node
)
278 kref_put(&neigh_node
->refcount
, batadv_neigh_node_release
);
282 * batadv_orig_router_get - router to the originator depending on iface
283 * @orig_node: the orig node for the router
284 * @if_outgoing: the interface where the payload packet has been received or
285 * the OGM should be sent to
287 * Return: the neighbor which should be router for this orig_node/iface.
289 * The object is returned with refcounter increased by 1.
291 struct batadv_neigh_node
*
292 batadv_orig_router_get(struct batadv_orig_node
*orig_node
,
293 const struct batadv_hard_iface
*if_outgoing
)
295 struct batadv_orig_ifinfo
*orig_ifinfo
;
296 struct batadv_neigh_node
*router
= NULL
;
299 hlist_for_each_entry_rcu(orig_ifinfo
, &orig_node
->ifinfo_list
, list
) {
300 if (orig_ifinfo
->if_outgoing
!= if_outgoing
)
303 router
= rcu_dereference(orig_ifinfo
->router
);
307 if (router
&& !kref_get_unless_zero(&router
->refcount
))
315 * batadv_orig_ifinfo_get - find the ifinfo from an orig_node
316 * @orig_node: the orig node to be queried
317 * @if_outgoing: the interface for which the ifinfo should be acquired
319 * Return: the requested orig_ifinfo or NULL if not found.
321 * The object is returned with refcounter increased by 1.
323 struct batadv_orig_ifinfo
*
324 batadv_orig_ifinfo_get(struct batadv_orig_node
*orig_node
,
325 struct batadv_hard_iface
*if_outgoing
)
327 struct batadv_orig_ifinfo
*tmp
, *orig_ifinfo
= NULL
;
330 hlist_for_each_entry_rcu(tmp
, &orig_node
->ifinfo_list
,
332 if (tmp
->if_outgoing
!= if_outgoing
)
335 if (!kref_get_unless_zero(&tmp
->refcount
))
347 * batadv_orig_ifinfo_new - search and possibly create an orig_ifinfo object
348 * @orig_node: the orig node to be queried
349 * @if_outgoing: the interface for which the ifinfo should be acquired
351 * Return: NULL in case of failure or the orig_ifinfo object for the if_outgoing
352 * interface otherwise. The object is created and added to the list
353 * if it does not exist.
355 * The object is returned with refcounter increased by 1.
357 struct batadv_orig_ifinfo
*
358 batadv_orig_ifinfo_new(struct batadv_orig_node
*orig_node
,
359 struct batadv_hard_iface
*if_outgoing
)
361 struct batadv_orig_ifinfo
*orig_ifinfo
= NULL
;
362 unsigned long reset_time
;
364 spin_lock_bh(&orig_node
->neigh_list_lock
);
366 orig_ifinfo
= batadv_orig_ifinfo_get(orig_node
, if_outgoing
);
370 orig_ifinfo
= kzalloc(sizeof(*orig_ifinfo
), GFP_ATOMIC
);
374 if (if_outgoing
!= BATADV_IF_DEFAULT
)
375 kref_get(&if_outgoing
->refcount
);
377 reset_time
= jiffies
- 1;
378 reset_time
-= msecs_to_jiffies(BATADV_RESET_PROTECTION_MS
);
379 orig_ifinfo
->batman_seqno_reset
= reset_time
;
380 orig_ifinfo
->if_outgoing
= if_outgoing
;
381 INIT_HLIST_NODE(&orig_ifinfo
->list
);
382 kref_init(&orig_ifinfo
->refcount
);
383 kref_get(&orig_ifinfo
->refcount
);
384 hlist_add_head_rcu(&orig_ifinfo
->list
,
385 &orig_node
->ifinfo_list
);
387 spin_unlock_bh(&orig_node
->neigh_list_lock
);
392 * batadv_neigh_ifinfo_get - find the ifinfo from an neigh_node
393 * @neigh: the neigh node to be queried
394 * @if_outgoing: the interface for which the ifinfo should be acquired
396 * The object is returned with refcounter increased by 1.
398 * Return: the requested neigh_ifinfo or NULL if not found
400 struct batadv_neigh_ifinfo
*
401 batadv_neigh_ifinfo_get(struct batadv_neigh_node
*neigh
,
402 struct batadv_hard_iface
*if_outgoing
)
404 struct batadv_neigh_ifinfo
*neigh_ifinfo
= NULL
,
408 hlist_for_each_entry_rcu(tmp_neigh_ifinfo
, &neigh
->ifinfo_list
,
410 if (tmp_neigh_ifinfo
->if_outgoing
!= if_outgoing
)
413 if (!kref_get_unless_zero(&tmp_neigh_ifinfo
->refcount
))
416 neigh_ifinfo
= tmp_neigh_ifinfo
;
425 * batadv_neigh_ifinfo_new - search and possibly create an neigh_ifinfo object
426 * @neigh: the neigh node to be queried
427 * @if_outgoing: the interface for which the ifinfo should be acquired
429 * Return: NULL in case of failure or the neigh_ifinfo object for the
430 * if_outgoing interface otherwise. The object is created and added to the list
431 * if it does not exist.
433 * The object is returned with refcounter increased by 1.
435 struct batadv_neigh_ifinfo
*
436 batadv_neigh_ifinfo_new(struct batadv_neigh_node
*neigh
,
437 struct batadv_hard_iface
*if_outgoing
)
439 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
441 spin_lock_bh(&neigh
->ifinfo_lock
);
443 neigh_ifinfo
= batadv_neigh_ifinfo_get(neigh
, if_outgoing
);
447 neigh_ifinfo
= kzalloc(sizeof(*neigh_ifinfo
), GFP_ATOMIC
);
452 kref_get(&if_outgoing
->refcount
);
454 INIT_HLIST_NODE(&neigh_ifinfo
->list
);
455 kref_init(&neigh_ifinfo
->refcount
);
456 kref_get(&neigh_ifinfo
->refcount
);
457 neigh_ifinfo
->if_outgoing
= if_outgoing
;
459 hlist_add_head_rcu(&neigh_ifinfo
->list
, &neigh
->ifinfo_list
);
462 spin_unlock_bh(&neigh
->ifinfo_lock
);
468 * batadv_neigh_node_get - retrieve a neighbour from the list
469 * @orig_node: originator which the neighbour belongs to
470 * @hard_iface: the interface where this neighbour is connected to
471 * @addr: the address of the neighbour
473 * Looks for and possibly returns a neighbour belonging to this originator list
474 * which is connected through the provided hard interface.
476 * Return: neighbor when found. Othwerwise NULL
478 static struct batadv_neigh_node
*
479 batadv_neigh_node_get(const struct batadv_orig_node
*orig_node
,
480 const struct batadv_hard_iface
*hard_iface
,
483 struct batadv_neigh_node
*tmp_neigh_node
, *res
= NULL
;
486 hlist_for_each_entry_rcu(tmp_neigh_node
, &orig_node
->neigh_list
, list
) {
487 if (!batadv_compare_eth(tmp_neigh_node
->addr
, addr
))
490 if (tmp_neigh_node
->if_incoming
!= hard_iface
)
493 if (!kref_get_unless_zero(&tmp_neigh_node
->refcount
))
496 res
= tmp_neigh_node
;
505 * batadv_hardif_neigh_create - create a hardif neighbour node
506 * @hard_iface: the interface this neighbour is connected to
507 * @neigh_addr: the interface address of the neighbour to retrieve
509 * Return: the hardif neighbour node if found or created or NULL otherwise.
511 static struct batadv_hardif_neigh_node
*
512 batadv_hardif_neigh_create(struct batadv_hard_iface
*hard_iface
,
513 const u8
*neigh_addr
)
515 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
516 struct batadv_hardif_neigh_node
*hardif_neigh
= NULL
;
518 spin_lock_bh(&hard_iface
->neigh_list_lock
);
520 /* check if neighbor hasn't been added in the meantime */
521 hardif_neigh
= batadv_hardif_neigh_get(hard_iface
, neigh_addr
);
525 hardif_neigh
= kzalloc(sizeof(*hardif_neigh
), GFP_ATOMIC
);
529 kref_get(&hard_iface
->refcount
);
530 INIT_HLIST_NODE(&hardif_neigh
->list
);
531 ether_addr_copy(hardif_neigh
->addr
, neigh_addr
);
532 hardif_neigh
->if_incoming
= hard_iface
;
533 hardif_neigh
->last_seen
= jiffies
;
535 kref_init(&hardif_neigh
->refcount
);
537 if (bat_priv
->bat_algo_ops
->bat_hardif_neigh_init
)
538 bat_priv
->bat_algo_ops
->bat_hardif_neigh_init(hardif_neigh
);
540 hlist_add_head(&hardif_neigh
->list
, &hard_iface
->neigh_list
);
543 spin_unlock_bh(&hard_iface
->neigh_list_lock
);
548 * batadv_hardif_neigh_get_or_create - retrieve or create a hardif neighbour
550 * @hard_iface: the interface this neighbour is connected to
551 * @neigh_addr: the interface address of the neighbour to retrieve
553 * Return: the hardif neighbour node if found or created or NULL otherwise.
555 static struct batadv_hardif_neigh_node
*
556 batadv_hardif_neigh_get_or_create(struct batadv_hard_iface
*hard_iface
,
557 const u8
*neigh_addr
)
559 struct batadv_hardif_neigh_node
*hardif_neigh
= NULL
;
561 /* first check without locking to avoid the overhead */
562 hardif_neigh
= batadv_hardif_neigh_get(hard_iface
, neigh_addr
);
566 return batadv_hardif_neigh_create(hard_iface
, neigh_addr
);
570 * batadv_hardif_neigh_get - retrieve a hardif neighbour from the list
571 * @hard_iface: the interface where this neighbour is connected to
572 * @neigh_addr: the address of the neighbour
574 * Looks for and possibly returns a neighbour belonging to this hard interface.
576 * Return: neighbor when found. Othwerwise NULL
578 struct batadv_hardif_neigh_node
*
579 batadv_hardif_neigh_get(const struct batadv_hard_iface
*hard_iface
,
580 const u8
*neigh_addr
)
582 struct batadv_hardif_neigh_node
*tmp_hardif_neigh
, *hardif_neigh
= NULL
;
585 hlist_for_each_entry_rcu(tmp_hardif_neigh
,
586 &hard_iface
->neigh_list
, list
) {
587 if (!batadv_compare_eth(tmp_hardif_neigh
->addr
, neigh_addr
))
590 if (!kref_get_unless_zero(&tmp_hardif_neigh
->refcount
))
593 hardif_neigh
= tmp_hardif_neigh
;
602 * batadv_neigh_node_create - create a neigh node object
603 * @orig_node: originator object representing the neighbour
604 * @hard_iface: the interface where the neighbour is connected to
605 * @neigh_addr: the mac address of the neighbour interface
607 * Allocates a new neigh_node object and initialises all the generic fields.
609 * Return: the neighbour node if found or created or NULL otherwise.
611 static struct batadv_neigh_node
*
612 batadv_neigh_node_create(struct batadv_orig_node
*orig_node
,
613 struct batadv_hard_iface
*hard_iface
,
614 const u8
*neigh_addr
)
616 struct batadv_neigh_node
*neigh_node
;
617 struct batadv_hardif_neigh_node
*hardif_neigh
= NULL
;
619 spin_lock_bh(&orig_node
->neigh_list_lock
);
621 neigh_node
= batadv_neigh_node_get(orig_node
, hard_iface
, neigh_addr
);
625 hardif_neigh
= batadv_hardif_neigh_get_or_create(hard_iface
,
630 neigh_node
= kzalloc(sizeof(*neigh_node
), GFP_ATOMIC
);
634 INIT_HLIST_NODE(&neigh_node
->list
);
635 INIT_HLIST_HEAD(&neigh_node
->ifinfo_list
);
636 spin_lock_init(&neigh_node
->ifinfo_lock
);
638 kref_get(&hard_iface
->refcount
);
639 ether_addr_copy(neigh_node
->addr
, neigh_addr
);
640 neigh_node
->if_incoming
= hard_iface
;
641 neigh_node
->orig_node
= orig_node
;
642 neigh_node
->last_seen
= jiffies
;
644 /* increment unique neighbor refcount */
645 kref_get(&hardif_neigh
->refcount
);
646 neigh_node
->hardif_neigh
= hardif_neigh
;
648 /* extra reference for return */
649 kref_init(&neigh_node
->refcount
);
650 kref_get(&neigh_node
->refcount
);
652 hlist_add_head_rcu(&neigh_node
->list
, &orig_node
->neigh_list
);
654 batadv_dbg(BATADV_DBG_BATMAN
, orig_node
->bat_priv
,
655 "Creating new neighbor %pM for orig_node %pM on interface %s\n",
656 neigh_addr
, orig_node
->orig
, hard_iface
->net_dev
->name
);
659 spin_unlock_bh(&orig_node
->neigh_list_lock
);
662 batadv_hardif_neigh_put(hardif_neigh
);
667 * batadv_neigh_node_get_or_create - retrieve or create a neigh node object
668 * @orig_node: originator object representing the neighbour
669 * @hard_iface: the interface where the neighbour is connected to
670 * @neigh_addr: the mac address of the neighbour interface
672 * Return: the neighbour node if found or created or NULL otherwise.
674 struct batadv_neigh_node
*
675 batadv_neigh_node_get_or_create(struct batadv_orig_node
*orig_node
,
676 struct batadv_hard_iface
*hard_iface
,
677 const u8
*neigh_addr
)
679 struct batadv_neigh_node
*neigh_node
= NULL
;
681 /* first check without locking to avoid the overhead */
682 neigh_node
= batadv_neigh_node_get(orig_node
, hard_iface
, neigh_addr
);
686 return batadv_neigh_node_create(orig_node
, hard_iface
, neigh_addr
);
690 * batadv_hardif_neigh_seq_print_text - print the single hop neighbour list
691 * @seq: neighbour table seq_file struct
696 int batadv_hardif_neigh_seq_print_text(struct seq_file
*seq
, void *offset
)
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
;
702 primary_if
= batadv_seq_print_text_primary_if_get(seq
);
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
);
711 batadv_hardif_put(primary_if
);
713 if (!bat_priv
->bat_algo_ops
->bat_neigh_print
) {
715 "No printing function for this routing protocol\n");
719 bat_priv
->bat_algo_ops
->bat_neigh_print(bat_priv
, seq
);
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
728 static void batadv_orig_ifinfo_release(struct kref
*ref
)
730 struct batadv_orig_ifinfo
*orig_ifinfo
;
731 struct batadv_neigh_node
*router
;
733 orig_ifinfo
= container_of(ref
, struct batadv_orig_ifinfo
, refcount
);
735 if (orig_ifinfo
->if_outgoing
!= BATADV_IF_DEFAULT
)
736 batadv_hardif_put(orig_ifinfo
->if_outgoing
);
738 /* this is the last reference to this object */
739 router
= rcu_dereference_protected(orig_ifinfo
->router
, true);
741 batadv_neigh_node_put(router
);
743 kfree_rcu(orig_ifinfo
, rcu
);
747 * batadv_orig_ifinfo_put - decrement the refcounter and possibly release
749 * @orig_ifinfo: the orig_ifinfo object to release
751 void batadv_orig_ifinfo_put(struct batadv_orig_ifinfo
*orig_ifinfo
)
753 kref_put(&orig_ifinfo
->refcount
, batadv_orig_ifinfo_release
);
757 * batadv_orig_node_free_rcu - free the orig_node
758 * @rcu: rcu pointer of the orig_node
760 static void batadv_orig_node_free_rcu(struct rcu_head
*rcu
)
762 struct batadv_orig_node
*orig_node
;
764 orig_node
= container_of(rcu
, struct batadv_orig_node
, rcu
);
766 batadv_mcast_purge_orig(orig_node
);
768 batadv_frag_purge_orig(orig_node
, NULL
);
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
);
773 kfree(orig_node
->tt_buff
);
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
782 static void batadv_orig_node_release(struct kref
*ref
)
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
;
789 orig_node
= container_of(ref
, struct batadv_orig_node
, refcount
);
791 spin_lock_bh(&orig_node
->neigh_list_lock
);
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
);
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
);
805 spin_unlock_bh(&orig_node
->neigh_list_lock
);
808 batadv_nc_purge_orig(orig_node
->bat_priv
, orig_node
, NULL
);
810 call_rcu(&orig_node
->rcu
, batadv_orig_node_free_rcu
);
814 * batadv_orig_node_put - decrement the orig node refcounter and possibly
816 * @orig_node: the orig node to free
818 void batadv_orig_node_put(struct batadv_orig_node
*orig_node
)
820 kref_put(&orig_node
->refcount
, batadv_orig_node_release
);
823 void batadv_originator_free(struct batadv_priv
*bat_priv
)
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
;
835 cancel_delayed_work_sync(&bat_priv
->orig_work
);
837 bat_priv
->orig_hash
= NULL
;
839 for (i
= 0; i
< hash
->size
; i
++) {
840 head
= &hash
->table
[i
];
841 list_lock
= &hash
->list_locks
[i
];
843 spin_lock_bh(list_lock
);
844 hlist_for_each_entry_safe(orig_node
, node_tmp
,
846 hlist_del_rcu(&orig_node
->hash_entry
);
847 batadv_orig_node_put(orig_node
);
849 spin_unlock_bh(list_lock
);
852 batadv_hash_destroy(hash
);
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
860 * Creates a new originator object and initialise all the generic fields.
861 * The new object is not added to the originator list.
863 * Return: the newly created object or NULL on failure.
865 struct batadv_orig_node
*batadv_orig_node_new(struct batadv_priv
*bat_priv
,
868 struct batadv_orig_node
*orig_node
;
869 struct batadv_orig_node_vlan
*vlan
;
870 unsigned long reset_time
;
873 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
874 "Creating new originator: %pM\n", addr
);
876 orig_node
= kzalloc(sizeof(*orig_node
), GFP_ATOMIC
);
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
);
889 batadv_nc_init_orig(orig_node
);
891 /* extra reference for return */
892 kref_init(&orig_node
->refcount
);
893 kref_get(&orig_node
->refcount
);
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
;
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
);
913 /* create a vlan object for the "untagged" LAN */
914 vlan
= batadv_orig_node_vlan_new(orig_node
, BATADV_NO_FLAGS
);
917 /* batadv_orig_node_vlan_new() increases the refcounter.
918 * Immediately release vlan since it is not needed anymore in this
921 batadv_orig_node_vlan_put(vlan
);
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;
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
941 batadv_purge_neigh_ifinfo(struct batadv_priv
*bat_priv
,
942 struct batadv_neigh_node
*neigh
)
944 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
945 struct batadv_hard_iface
*if_outgoing
;
946 struct hlist_node
*node_tmp
;
948 spin_lock_bh(&neigh
->ifinfo_lock
);
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
;
955 /* always keep the default interface */
956 if (if_outgoing
== BATADV_IF_DEFAULT
)
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
))
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
);
969 hlist_del_rcu(&neigh_ifinfo
->list
);
970 batadv_neigh_ifinfo_put(neigh_ifinfo
);
973 spin_unlock_bh(&neigh
->ifinfo_lock
);
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
981 * Return: true if any ifinfo entry was purged, false otherwise.
984 batadv_purge_orig_ifinfo(struct batadv_priv
*bat_priv
,
985 struct batadv_orig_node
*orig_node
)
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;
992 spin_lock_bh(&orig_node
->neigh_list_lock
);
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
;
999 /* always keep the default interface */
1000 if (if_outgoing
== BATADV_IF_DEFAULT
)
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
))
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
);
1013 ifinfo_purged
= true;
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
);
1023 spin_unlock_bh(&orig_node
->neigh_list_lock
);
1025 return ifinfo_purged
;
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
1033 * Return: true if any neighbor was purged, false otherwise
1036 batadv_purge_orig_neighbors(struct batadv_priv
*bat_priv
,
1037 struct batadv_orig_node
*orig_node
)
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
;
1045 spin_lock_bh(&orig_node
->neigh_list_lock
);
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
;
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
);
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
));
1070 neigh_purged
= true;
1072 hlist_del_rcu(&neigh_node
->list
);
1073 batadv_neigh_node_put(neigh_node
);
1075 /* only necessary if not the whole neighbor is to be
1076 * deleted, but some interface has been removed.
1078 batadv_purge_neigh_ifinfo(bat_priv
, neigh_node
);
1082 spin_unlock_bh(&orig_node
->neigh_list_lock
);
1083 return neigh_purged
;
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
1092 * Return: the current best neighbor, with refcount increased.
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
)
1099 struct batadv_neigh_node
*best
= NULL
, *neigh
;
1100 struct batadv_algo_ops
*bao
= bat_priv
->bat_algo_ops
;
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))
1108 if (!kref_get_unless_zero(&neigh
->refcount
))
1112 batadv_neigh_node_put(best
);
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
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.
1129 * Return: true if the orig_node is to be removed, false otherwise.
1131 static bool batadv_purge_orig_node(struct batadv_priv
*bat_priv
,
1132 struct batadv_orig_node
*orig_node
)
1134 struct batadv_neigh_node
*best_neigh_node
;
1135 struct batadv_hard_iface
*hard_iface
;
1136 bool changed_ifinfo
, changed_neigh
;
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",
1143 jiffies_to_msecs(orig_node
->last_seen
));
1146 changed_ifinfo
= batadv_purge_orig_ifinfo(bat_priv
, orig_node
);
1147 changed_neigh
= batadv_purge_orig_neighbors(bat_priv
, orig_node
);
1149 if (!changed_ifinfo
&& !changed_neigh
)
1152 /* first for NULL ... */
1153 best_neigh_node
= batadv_find_best_neighbor(bat_priv
, orig_node
,
1155 batadv_update_route(bat_priv
, orig_node
, BATADV_IF_DEFAULT
,
1157 if (best_neigh_node
)
1158 batadv_neigh_node_put(best_neigh_node
);
1160 /* ... then for all other interfaces. */
1162 list_for_each_entry_rcu(hard_iface
, &batadv_hardif_list
, list
) {
1163 if (hard_iface
->if_status
!= BATADV_IF_ACTIVE
)
1166 if (hard_iface
->soft_iface
!= bat_priv
->soft_iface
)
1169 if (!kref_get_unless_zero(&hard_iface
->refcount
))
1172 best_neigh_node
= batadv_find_best_neighbor(bat_priv
,
1175 batadv_update_route(bat_priv
, orig_node
, hard_iface
,
1177 if (best_neigh_node
)
1178 batadv_neigh_node_put(best_neigh_node
);
1180 batadv_hardif_put(hard_iface
);
1187 static void _batadv_purge_orig(struct batadv_priv
*bat_priv
)
1189 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
1190 struct hlist_node
*node_tmp
;
1191 struct hlist_head
*head
;
1192 spinlock_t
*list_lock
; /* spinlock to protect write access */
1193 struct batadv_orig_node
*orig_node
;
1199 /* for all origins... */
1200 for (i
= 0; i
< hash
->size
; i
++) {
1201 head
= &hash
->table
[i
];
1202 list_lock
= &hash
->list_locks
[i
];
1204 spin_lock_bh(list_lock
);
1205 hlist_for_each_entry_safe(orig_node
, node_tmp
,
1207 if (batadv_purge_orig_node(bat_priv
, orig_node
)) {
1208 batadv_gw_node_delete(bat_priv
, orig_node
);
1209 hlist_del_rcu(&orig_node
->hash_entry
);
1210 batadv_tt_global_del_orig(orig_node
->bat_priv
,
1212 "originator timed out");
1213 batadv_orig_node_put(orig_node
);
1217 batadv_frag_purge_orig(orig_node
,
1218 batadv_frag_check_entry
);
1220 spin_unlock_bh(list_lock
);
1223 batadv_gw_election(bat_priv
);
1226 static void batadv_purge_orig(struct work_struct
*work
)
1228 struct delayed_work
*delayed_work
;
1229 struct batadv_priv
*bat_priv
;
1231 delayed_work
= to_delayed_work(work
);
1232 bat_priv
= container_of(delayed_work
, struct batadv_priv
, orig_work
);
1233 _batadv_purge_orig(bat_priv
);
1234 queue_delayed_work(batadv_event_workqueue
,
1235 &bat_priv
->orig_work
,
1236 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD
));
1239 void batadv_purge_orig_ref(struct batadv_priv
*bat_priv
)
1241 _batadv_purge_orig(bat_priv
);
1244 int batadv_orig_seq_print_text(struct seq_file
*seq
, void *offset
)
1246 struct net_device
*net_dev
= (struct net_device
*)seq
->private;
1247 struct batadv_priv
*bat_priv
= netdev_priv(net_dev
);
1248 struct batadv_hard_iface
*primary_if
;
1250 primary_if
= batadv_seq_print_text_primary_if_get(seq
);
1254 seq_printf(seq
, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s %s)]\n",
1255 BATADV_SOURCE_VERSION
, primary_if
->net_dev
->name
,
1256 primary_if
->net_dev
->dev_addr
, net_dev
->name
,
1257 bat_priv
->bat_algo_ops
->name
);
1259 batadv_hardif_put(primary_if
);
1261 if (!bat_priv
->bat_algo_ops
->bat_orig_print
) {
1263 "No printing function for this routing protocol\n");
1267 bat_priv
->bat_algo_ops
->bat_orig_print(bat_priv
, seq
,
1274 * batadv_orig_hardif_seq_print_text - writes originator infos for a specific
1275 * outgoing interface
1276 * @seq: debugfs table seq_file struct
1281 int batadv_orig_hardif_seq_print_text(struct seq_file
*seq
, void *offset
)
1283 struct net_device
*net_dev
= (struct net_device
*)seq
->private;
1284 struct batadv_hard_iface
*hard_iface
;
1285 struct batadv_priv
*bat_priv
;
1287 hard_iface
= batadv_hardif_get_by_netdev(net_dev
);
1289 if (!hard_iface
|| !hard_iface
->soft_iface
) {
1290 seq_puts(seq
, "Interface not known to B.A.T.M.A.N.\n");
1294 bat_priv
= netdev_priv(hard_iface
->soft_iface
);
1295 if (!bat_priv
->bat_algo_ops
->bat_orig_print
) {
1297 "No printing function for this routing protocol\n");
1301 if (hard_iface
->if_status
!= BATADV_IF_ACTIVE
) {
1302 seq_puts(seq
, "Interface not active\n");
1306 seq_printf(seq
, "[B.A.T.M.A.N. adv %s, IF/MAC: %s/%pM (%s %s)]\n",
1307 BATADV_SOURCE_VERSION
, hard_iface
->net_dev
->name
,
1308 hard_iface
->net_dev
->dev_addr
,
1309 hard_iface
->soft_iface
->name
, bat_priv
->bat_algo_ops
->name
);
1311 bat_priv
->bat_algo_ops
->bat_orig_print(bat_priv
, seq
, hard_iface
);
1315 batadv_hardif_put(hard_iface
);
1319 int batadv_orig_hash_add_if(struct batadv_hard_iface
*hard_iface
,
1322 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
1323 struct batadv_algo_ops
*bao
= bat_priv
->bat_algo_ops
;
1324 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
1325 struct hlist_head
*head
;
1326 struct batadv_orig_node
*orig_node
;
1330 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
1333 for (i
= 0; i
< hash
->size
; i
++) {
1334 head
= &hash
->table
[i
];
1337 hlist_for_each_entry_rcu(orig_node
, head
, hash_entry
) {
1339 if (bao
->bat_orig_add_if
)
1340 ret
= bao
->bat_orig_add_if(orig_node
,
1355 int batadv_orig_hash_del_if(struct batadv_hard_iface
*hard_iface
,
1358 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
1359 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
1360 struct hlist_head
*head
;
1361 struct batadv_hard_iface
*hard_iface_tmp
;
1362 struct batadv_orig_node
*orig_node
;
1363 struct batadv_algo_ops
*bao
= bat_priv
->bat_algo_ops
;
1367 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
1370 for (i
= 0; i
< hash
->size
; i
++) {
1371 head
= &hash
->table
[i
];
1374 hlist_for_each_entry_rcu(orig_node
, head
, hash_entry
) {
1376 if (bao
->bat_orig_del_if
)
1377 ret
= bao
->bat_orig_del_if(orig_node
,
1379 hard_iface
->if_num
);
1386 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
1388 list_for_each_entry_rcu(hard_iface_tmp
, &batadv_hardif_list
, list
) {
1389 if (hard_iface_tmp
->if_status
== BATADV_IF_NOT_IN_USE
)
1392 if (hard_iface
== hard_iface_tmp
)
1395 if (hard_iface
->soft_iface
!= hard_iface_tmp
->soft_iface
)
1398 if (hard_iface_tmp
->if_num
> hard_iface
->if_num
)
1399 hard_iface_tmp
->if_num
--;
1403 hard_iface
->if_num
= -1;