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"
43 #include "multicast.h"
44 #include "network-coding.h"
46 #include "translation-table.h"
49 static struct lock_class_key batadv_orig_hash_lock_class_key
;
51 static void batadv_purge_orig(struct work_struct
*work
);
54 * batadv_compare_orig - comparing function used in the originator hash table
55 * @node: node in the local table
56 * @data2: second object to compare the node to
58 * Return: true if they are the same originator
60 bool batadv_compare_orig(const struct hlist_node
*node
, const void *data2
)
62 const void *data1
= container_of(node
, struct batadv_orig_node
,
65 return batadv_compare_eth(data1
, data2
);
69 * batadv_orig_node_vlan_get - get an orig_node_vlan object
70 * @orig_node: the originator serving the VLAN
71 * @vid: the VLAN identifier
73 * Return: the vlan object identified by vid and belonging to orig_node or NULL
74 * if it does not exist.
76 struct batadv_orig_node_vlan
*
77 batadv_orig_node_vlan_get(struct batadv_orig_node
*orig_node
,
80 struct batadv_orig_node_vlan
*vlan
= NULL
, *tmp
;
83 hlist_for_each_entry_rcu(tmp
, &orig_node
->vlan_list
, list
) {
87 if (!kref_get_unless_zero(&tmp
->refcount
))
100 * batadv_orig_node_vlan_new - search and possibly create an orig_node_vlan
102 * @orig_node: the originator serving the VLAN
103 * @vid: the VLAN identifier
105 * Return: NULL in case of failure or the vlan object identified by vid and
106 * belonging to orig_node otherwise. The object is created and added to the list
107 * if it does not exist.
109 * The object is returned with refcounter increased by 1.
111 struct batadv_orig_node_vlan
*
112 batadv_orig_node_vlan_new(struct batadv_orig_node
*orig_node
,
115 struct batadv_orig_node_vlan
*vlan
;
117 spin_lock_bh(&orig_node
->vlan_list_lock
);
119 /* first look if an object for this vid already exists */
120 vlan
= batadv_orig_node_vlan_get(orig_node
, vid
);
124 vlan
= kzalloc(sizeof(*vlan
), GFP_ATOMIC
);
128 kref_init(&vlan
->refcount
);
129 kref_get(&vlan
->refcount
);
132 hlist_add_head_rcu(&vlan
->list
, &orig_node
->vlan_list
);
135 spin_unlock_bh(&orig_node
->vlan_list_lock
);
141 * batadv_orig_node_vlan_release - release originator-vlan object from lists
142 * and queue for free after rcu grace period
143 * @ref: kref pointer of the originator-vlan object
145 static void batadv_orig_node_vlan_release(struct kref
*ref
)
147 struct batadv_orig_node_vlan
*orig_vlan
;
149 orig_vlan
= container_of(ref
, struct batadv_orig_node_vlan
, refcount
);
151 kfree_rcu(orig_vlan
, rcu
);
155 * batadv_orig_node_vlan_put - decrement the refcounter and possibly release
156 * the originator-vlan object
157 * @orig_vlan: the originator-vlan object to release
159 void batadv_orig_node_vlan_put(struct batadv_orig_node_vlan
*orig_vlan
)
161 kref_put(&orig_vlan
->refcount
, batadv_orig_node_vlan_release
);
164 int batadv_originator_init(struct batadv_priv
*bat_priv
)
166 if (bat_priv
->orig_hash
)
169 bat_priv
->orig_hash
= batadv_hash_new(1024);
171 if (!bat_priv
->orig_hash
)
174 batadv_hash_set_lock_class(bat_priv
->orig_hash
,
175 &batadv_orig_hash_lock_class_key
);
177 INIT_DELAYED_WORK(&bat_priv
->orig_work
, batadv_purge_orig
);
178 queue_delayed_work(batadv_event_workqueue
,
179 &bat_priv
->orig_work
,
180 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD
));
189 * batadv_neigh_ifinfo_release - release neigh_ifinfo from lists and queue for
190 * free after rcu grace period
191 * @ref: kref pointer of the neigh_ifinfo
193 static void batadv_neigh_ifinfo_release(struct kref
*ref
)
195 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
197 neigh_ifinfo
= container_of(ref
, struct batadv_neigh_ifinfo
, refcount
);
199 if (neigh_ifinfo
->if_outgoing
!= BATADV_IF_DEFAULT
)
200 batadv_hardif_put(neigh_ifinfo
->if_outgoing
);
202 kfree_rcu(neigh_ifinfo
, rcu
);
206 * batadv_neigh_ifinfo_put - decrement the refcounter and possibly release
208 * @neigh_ifinfo: the neigh_ifinfo object to release
210 void batadv_neigh_ifinfo_put(struct batadv_neigh_ifinfo
*neigh_ifinfo
)
212 kref_put(&neigh_ifinfo
->refcount
, batadv_neigh_ifinfo_release
);
216 * batadv_hardif_neigh_release - release hardif neigh node from lists and
217 * queue for free after rcu grace period
218 * @ref: kref pointer of the neigh_node
220 static void batadv_hardif_neigh_release(struct kref
*ref
)
222 struct batadv_hardif_neigh_node
*hardif_neigh
;
224 hardif_neigh
= container_of(ref
, struct batadv_hardif_neigh_node
,
227 spin_lock_bh(&hardif_neigh
->if_incoming
->neigh_list_lock
);
228 hlist_del_init_rcu(&hardif_neigh
->list
);
229 spin_unlock_bh(&hardif_neigh
->if_incoming
->neigh_list_lock
);
231 batadv_hardif_put(hardif_neigh
->if_incoming
);
232 kfree_rcu(hardif_neigh
, rcu
);
236 * batadv_hardif_neigh_put - decrement the hardif neighbors refcounter
237 * and possibly release it
238 * @hardif_neigh: hardif neigh neighbor to free
240 void batadv_hardif_neigh_put(struct batadv_hardif_neigh_node
*hardif_neigh
)
242 kref_put(&hardif_neigh
->refcount
, batadv_hardif_neigh_release
);
246 * batadv_neigh_node_release - release neigh_node from lists and queue for
247 * free after rcu grace period
248 * @ref: kref pointer of the neigh_node
250 static void batadv_neigh_node_release(struct kref
*ref
)
252 struct hlist_node
*node_tmp
;
253 struct batadv_neigh_node
*neigh_node
;
254 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
256 neigh_node
= container_of(ref
, struct batadv_neigh_node
, refcount
);
258 hlist_for_each_entry_safe(neigh_ifinfo
, node_tmp
,
259 &neigh_node
->ifinfo_list
, list
) {
260 batadv_neigh_ifinfo_put(neigh_ifinfo
);
263 batadv_hardif_neigh_put(neigh_node
->hardif_neigh
);
265 batadv_hardif_put(neigh_node
->if_incoming
);
267 kfree_rcu(neigh_node
, rcu
);
271 * batadv_neigh_node_put - decrement the neighbors refcounter and possibly
273 * @neigh_node: neigh neighbor to free
275 void batadv_neigh_node_put(struct batadv_neigh_node
*neigh_node
)
277 kref_put(&neigh_node
->refcount
, batadv_neigh_node_release
);
281 * batadv_orig_router_get - router to the originator depending on iface
282 * @orig_node: the orig node for the router
283 * @if_outgoing: the interface where the payload packet has been received or
284 * the OGM should be sent to
286 * Return: the neighbor which should be router for this orig_node/iface.
288 * The object is returned with refcounter increased by 1.
290 struct batadv_neigh_node
*
291 batadv_orig_router_get(struct batadv_orig_node
*orig_node
,
292 const struct batadv_hard_iface
*if_outgoing
)
294 struct batadv_orig_ifinfo
*orig_ifinfo
;
295 struct batadv_neigh_node
*router
= NULL
;
298 hlist_for_each_entry_rcu(orig_ifinfo
, &orig_node
->ifinfo_list
, list
) {
299 if (orig_ifinfo
->if_outgoing
!= if_outgoing
)
302 router
= rcu_dereference(orig_ifinfo
->router
);
306 if (router
&& !kref_get_unless_zero(&router
->refcount
))
314 * batadv_orig_ifinfo_get - find the ifinfo from an orig_node
315 * @orig_node: the orig node to be queried
316 * @if_outgoing: the interface for which the ifinfo should be acquired
318 * Return: the requested orig_ifinfo or NULL if not found.
320 * The object is returned with refcounter increased by 1.
322 struct batadv_orig_ifinfo
*
323 batadv_orig_ifinfo_get(struct batadv_orig_node
*orig_node
,
324 struct batadv_hard_iface
*if_outgoing
)
326 struct batadv_orig_ifinfo
*tmp
, *orig_ifinfo
= NULL
;
329 hlist_for_each_entry_rcu(tmp
, &orig_node
->ifinfo_list
,
331 if (tmp
->if_outgoing
!= if_outgoing
)
334 if (!kref_get_unless_zero(&tmp
->refcount
))
346 * batadv_orig_ifinfo_new - search and possibly create an orig_ifinfo object
347 * @orig_node: the orig node to be queried
348 * @if_outgoing: the interface for which the ifinfo should be acquired
350 * Return: NULL in case of failure or the orig_ifinfo object for the if_outgoing
351 * interface otherwise. The object is created and added to the list
352 * if it does not exist.
354 * The object is returned with refcounter increased by 1.
356 struct batadv_orig_ifinfo
*
357 batadv_orig_ifinfo_new(struct batadv_orig_node
*orig_node
,
358 struct batadv_hard_iface
*if_outgoing
)
360 struct batadv_orig_ifinfo
*orig_ifinfo
= NULL
;
361 unsigned long reset_time
;
363 spin_lock_bh(&orig_node
->neigh_list_lock
);
365 orig_ifinfo
= batadv_orig_ifinfo_get(orig_node
, if_outgoing
);
369 orig_ifinfo
= kzalloc(sizeof(*orig_ifinfo
), GFP_ATOMIC
);
373 if (if_outgoing
!= BATADV_IF_DEFAULT
)
374 kref_get(&if_outgoing
->refcount
);
376 reset_time
= jiffies
- 1;
377 reset_time
-= msecs_to_jiffies(BATADV_RESET_PROTECTION_MS
);
378 orig_ifinfo
->batman_seqno_reset
= reset_time
;
379 orig_ifinfo
->if_outgoing
= if_outgoing
;
380 INIT_HLIST_NODE(&orig_ifinfo
->list
);
381 kref_init(&orig_ifinfo
->refcount
);
382 kref_get(&orig_ifinfo
->refcount
);
383 hlist_add_head_rcu(&orig_ifinfo
->list
,
384 &orig_node
->ifinfo_list
);
386 spin_unlock_bh(&orig_node
->neigh_list_lock
);
391 * batadv_neigh_ifinfo_get - find the ifinfo from an neigh_node
392 * @neigh: the neigh node to be queried
393 * @if_outgoing: the interface for which the ifinfo should be acquired
395 * The object is returned with refcounter increased by 1.
397 * Return: the requested neigh_ifinfo or NULL if not found
399 struct batadv_neigh_ifinfo
*
400 batadv_neigh_ifinfo_get(struct batadv_neigh_node
*neigh
,
401 struct batadv_hard_iface
*if_outgoing
)
403 struct batadv_neigh_ifinfo
*neigh_ifinfo
= NULL
,
407 hlist_for_each_entry_rcu(tmp_neigh_ifinfo
, &neigh
->ifinfo_list
,
409 if (tmp_neigh_ifinfo
->if_outgoing
!= if_outgoing
)
412 if (!kref_get_unless_zero(&tmp_neigh_ifinfo
->refcount
))
415 neigh_ifinfo
= tmp_neigh_ifinfo
;
424 * batadv_neigh_ifinfo_new - search and possibly create an neigh_ifinfo object
425 * @neigh: the neigh node to be queried
426 * @if_outgoing: the interface for which the ifinfo should be acquired
428 * Return: NULL in case of failure or the neigh_ifinfo object for the
429 * if_outgoing interface otherwise. The object is created and added to the list
430 * if it does not exist.
432 * The object is returned with refcounter increased by 1.
434 struct batadv_neigh_ifinfo
*
435 batadv_neigh_ifinfo_new(struct batadv_neigh_node
*neigh
,
436 struct batadv_hard_iface
*if_outgoing
)
438 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
440 spin_lock_bh(&neigh
->ifinfo_lock
);
442 neigh_ifinfo
= batadv_neigh_ifinfo_get(neigh
, if_outgoing
);
446 neigh_ifinfo
= kzalloc(sizeof(*neigh_ifinfo
), GFP_ATOMIC
);
451 kref_get(&if_outgoing
->refcount
);
453 INIT_HLIST_NODE(&neigh_ifinfo
->list
);
454 kref_init(&neigh_ifinfo
->refcount
);
455 kref_get(&neigh_ifinfo
->refcount
);
456 neigh_ifinfo
->if_outgoing
= if_outgoing
;
458 hlist_add_head_rcu(&neigh_ifinfo
->list
, &neigh
->ifinfo_list
);
461 spin_unlock_bh(&neigh
->ifinfo_lock
);
467 * batadv_neigh_node_get - retrieve a neighbour from the list
468 * @orig_node: originator which the neighbour belongs to
469 * @hard_iface: the interface where this neighbour is connected to
470 * @addr: the address of the neighbour
472 * Looks for and possibly returns a neighbour belonging to this originator list
473 * which is connected through the provided hard interface.
475 * Return: neighbor when found. Othwerwise NULL
477 static struct batadv_neigh_node
*
478 batadv_neigh_node_get(const struct batadv_orig_node
*orig_node
,
479 const struct batadv_hard_iface
*hard_iface
,
482 struct batadv_neigh_node
*tmp_neigh_node
, *res
= NULL
;
485 hlist_for_each_entry_rcu(tmp_neigh_node
, &orig_node
->neigh_list
, list
) {
486 if (!batadv_compare_eth(tmp_neigh_node
->addr
, addr
))
489 if (tmp_neigh_node
->if_incoming
!= hard_iface
)
492 if (!kref_get_unless_zero(&tmp_neigh_node
->refcount
))
495 res
= tmp_neigh_node
;
504 * batadv_hardif_neigh_create - create a hardif neighbour node
505 * @hard_iface: the interface this neighbour is connected to
506 * @neigh_addr: the interface address of the neighbour to retrieve
508 * Return: the hardif neighbour node if found or created or NULL otherwise.
510 static struct batadv_hardif_neigh_node
*
511 batadv_hardif_neigh_create(struct batadv_hard_iface
*hard_iface
,
512 const u8
*neigh_addr
)
514 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
515 struct batadv_hardif_neigh_node
*hardif_neigh
= NULL
;
517 spin_lock_bh(&hard_iface
->neigh_list_lock
);
519 /* check if neighbor hasn't been added in the meantime */
520 hardif_neigh
= batadv_hardif_neigh_get(hard_iface
, neigh_addr
);
524 hardif_neigh
= kzalloc(sizeof(*hardif_neigh
), GFP_ATOMIC
);
528 kref_get(&hard_iface
->refcount
);
529 INIT_HLIST_NODE(&hardif_neigh
->list
);
530 ether_addr_copy(hardif_neigh
->addr
, neigh_addr
);
531 hardif_neigh
->if_incoming
= hard_iface
;
532 hardif_neigh
->last_seen
= jiffies
;
534 kref_init(&hardif_neigh
->refcount
);
536 if (bat_priv
->bat_algo_ops
->bat_hardif_neigh_init
)
537 bat_priv
->bat_algo_ops
->bat_hardif_neigh_init(hardif_neigh
);
539 hlist_add_head(&hardif_neigh
->list
, &hard_iface
->neigh_list
);
542 spin_unlock_bh(&hard_iface
->neigh_list_lock
);
547 * batadv_hardif_neigh_get_or_create - retrieve or create a hardif neighbour
549 * @hard_iface: the interface this neighbour is connected to
550 * @neigh_addr: the interface address of the neighbour to retrieve
552 * Return: the hardif neighbour node if found or created or NULL otherwise.
554 static struct batadv_hardif_neigh_node
*
555 batadv_hardif_neigh_get_or_create(struct batadv_hard_iface
*hard_iface
,
556 const u8
*neigh_addr
)
558 struct batadv_hardif_neigh_node
*hardif_neigh
= NULL
;
560 /* first check without locking to avoid the overhead */
561 hardif_neigh
= batadv_hardif_neigh_get(hard_iface
, neigh_addr
);
565 return batadv_hardif_neigh_create(hard_iface
, neigh_addr
);
569 * batadv_hardif_neigh_get - retrieve a hardif neighbour from the list
570 * @hard_iface: the interface where this neighbour is connected to
571 * @neigh_addr: the address of the neighbour
573 * Looks for and possibly returns a neighbour belonging to this hard interface.
575 * Return: neighbor when found. Othwerwise NULL
577 struct batadv_hardif_neigh_node
*
578 batadv_hardif_neigh_get(const struct batadv_hard_iface
*hard_iface
,
579 const u8
*neigh_addr
)
581 struct batadv_hardif_neigh_node
*tmp_hardif_neigh
, *hardif_neigh
= NULL
;
584 hlist_for_each_entry_rcu(tmp_hardif_neigh
,
585 &hard_iface
->neigh_list
, list
) {
586 if (!batadv_compare_eth(tmp_hardif_neigh
->addr
, neigh_addr
))
589 if (!kref_get_unless_zero(&tmp_hardif_neigh
->refcount
))
592 hardif_neigh
= tmp_hardif_neigh
;
601 * batadv_neigh_node_create - create a neigh node object
602 * @orig_node: originator object representing the neighbour
603 * @hard_iface: the interface where the neighbour is connected to
604 * @neigh_addr: the mac address of the neighbour interface
606 * Allocates a new neigh_node object and initialises all the generic fields.
608 * Return: the neighbour node if found or created or NULL otherwise.
610 static struct batadv_neigh_node
*
611 batadv_neigh_node_create(struct batadv_orig_node
*orig_node
,
612 struct batadv_hard_iface
*hard_iface
,
613 const u8
*neigh_addr
)
615 struct batadv_neigh_node
*neigh_node
;
616 struct batadv_hardif_neigh_node
*hardif_neigh
= NULL
;
618 spin_lock_bh(&orig_node
->neigh_list_lock
);
620 neigh_node
= batadv_neigh_node_get(orig_node
, hard_iface
, neigh_addr
);
624 hardif_neigh
= batadv_hardif_neigh_get_or_create(hard_iface
,
629 neigh_node
= kzalloc(sizeof(*neigh_node
), GFP_ATOMIC
);
633 INIT_HLIST_NODE(&neigh_node
->list
);
634 INIT_HLIST_HEAD(&neigh_node
->ifinfo_list
);
635 spin_lock_init(&neigh_node
->ifinfo_lock
);
637 kref_get(&hard_iface
->refcount
);
638 ether_addr_copy(neigh_node
->addr
, neigh_addr
);
639 neigh_node
->if_incoming
= hard_iface
;
640 neigh_node
->orig_node
= orig_node
;
641 neigh_node
->last_seen
= jiffies
;
643 /* increment unique neighbor refcount */
644 kref_get(&hardif_neigh
->refcount
);
645 neigh_node
->hardif_neigh
= hardif_neigh
;
647 /* extra reference for return */
648 kref_init(&neigh_node
->refcount
);
649 kref_get(&neigh_node
->refcount
);
651 hlist_add_head_rcu(&neigh_node
->list
, &orig_node
->neigh_list
);
653 batadv_dbg(BATADV_DBG_BATMAN
, orig_node
->bat_priv
,
654 "Creating new neighbor %pM for orig_node %pM on interface %s\n",
655 neigh_addr
, orig_node
->orig
, hard_iface
->net_dev
->name
);
658 spin_unlock_bh(&orig_node
->neigh_list_lock
);
661 batadv_hardif_neigh_put(hardif_neigh
);
666 * batadv_neigh_node_get_or_create - retrieve or create a neigh node object
667 * @orig_node: originator object representing the neighbour
668 * @hard_iface: the interface where the neighbour is connected to
669 * @neigh_addr: the mac address of the neighbour interface
671 * Return: the neighbour node if found or created or NULL otherwise.
673 struct batadv_neigh_node
*
674 batadv_neigh_node_get_or_create(struct batadv_orig_node
*orig_node
,
675 struct batadv_hard_iface
*hard_iface
,
676 const u8
*neigh_addr
)
678 struct batadv_neigh_node
*neigh_node
= NULL
;
680 /* first check without locking to avoid the overhead */
681 neigh_node
= batadv_neigh_node_get(orig_node
, hard_iface
, neigh_addr
);
685 return batadv_neigh_node_create(orig_node
, hard_iface
, neigh_addr
);
689 * batadv_hardif_neigh_seq_print_text - print the single hop neighbour list
690 * @seq: neighbour table seq_file struct
695 int batadv_hardif_neigh_seq_print_text(struct seq_file
*seq
, void *offset
)
697 struct net_device
*net_dev
= (struct net_device
*)seq
->private;
698 struct batadv_priv
*bat_priv
= netdev_priv(net_dev
);
699 struct batadv_hard_iface
*primary_if
;
701 primary_if
= batadv_seq_print_text_primary_if_get(seq
);
705 seq_printf(seq
, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s %s)]\n",
706 BATADV_SOURCE_VERSION
, primary_if
->net_dev
->name
,
707 primary_if
->net_dev
->dev_addr
, net_dev
->name
,
708 bat_priv
->bat_algo_ops
->name
);
710 batadv_hardif_put(primary_if
);
712 if (!bat_priv
->bat_algo_ops
->bat_neigh_print
) {
714 "No printing function for this routing protocol\n");
718 bat_priv
->bat_algo_ops
->bat_neigh_print(bat_priv
, seq
);
723 * batadv_orig_ifinfo_release - release orig_ifinfo from lists and queue for
724 * free after rcu grace period
725 * @ref: kref pointer of the orig_ifinfo
727 static void batadv_orig_ifinfo_release(struct kref
*ref
)
729 struct batadv_orig_ifinfo
*orig_ifinfo
;
730 struct batadv_neigh_node
*router
;
732 orig_ifinfo
= container_of(ref
, struct batadv_orig_ifinfo
, refcount
);
734 if (orig_ifinfo
->if_outgoing
!= BATADV_IF_DEFAULT
)
735 batadv_hardif_put(orig_ifinfo
->if_outgoing
);
737 /* this is the last reference to this object */
738 router
= rcu_dereference_protected(orig_ifinfo
->router
, true);
740 batadv_neigh_node_put(router
);
742 kfree_rcu(orig_ifinfo
, rcu
);
746 * batadv_orig_ifinfo_put - decrement the refcounter and possibly release
748 * @orig_ifinfo: the orig_ifinfo object to release
750 void batadv_orig_ifinfo_put(struct batadv_orig_ifinfo
*orig_ifinfo
)
752 kref_put(&orig_ifinfo
->refcount
, batadv_orig_ifinfo_release
);
756 * batadv_orig_node_free_rcu - free the orig_node
757 * @rcu: rcu pointer of the orig_node
759 static void batadv_orig_node_free_rcu(struct rcu_head
*rcu
)
761 struct batadv_orig_node
*orig_node
;
763 orig_node
= container_of(rcu
, struct batadv_orig_node
, rcu
);
765 batadv_mcast_purge_orig(orig_node
);
767 batadv_frag_purge_orig(orig_node
, NULL
);
769 if (orig_node
->bat_priv
->bat_algo_ops
->bat_orig_free
)
770 orig_node
->bat_priv
->bat_algo_ops
->bat_orig_free(orig_node
);
772 kfree(orig_node
->tt_buff
);
777 * batadv_orig_node_release - release orig_node from lists and queue for
778 * free after rcu grace period
779 * @ref: kref pointer of the orig_node
781 static void batadv_orig_node_release(struct kref
*ref
)
783 struct hlist_node
*node_tmp
;
784 struct batadv_neigh_node
*neigh_node
;
785 struct batadv_orig_node
*orig_node
;
786 struct batadv_orig_ifinfo
*orig_ifinfo
;
788 orig_node
= container_of(ref
, struct batadv_orig_node
, refcount
);
790 spin_lock_bh(&orig_node
->neigh_list_lock
);
792 /* for all neighbors towards this originator ... */
793 hlist_for_each_entry_safe(neigh_node
, node_tmp
,
794 &orig_node
->neigh_list
, list
) {
795 hlist_del_rcu(&neigh_node
->list
);
796 batadv_neigh_node_put(neigh_node
);
799 hlist_for_each_entry_safe(orig_ifinfo
, node_tmp
,
800 &orig_node
->ifinfo_list
, list
) {
801 hlist_del_rcu(&orig_ifinfo
->list
);
802 batadv_orig_ifinfo_put(orig_ifinfo
);
804 spin_unlock_bh(&orig_node
->neigh_list_lock
);
807 batadv_nc_purge_orig(orig_node
->bat_priv
, orig_node
, NULL
);
809 call_rcu(&orig_node
->rcu
, batadv_orig_node_free_rcu
);
813 * batadv_orig_node_put - decrement the orig node refcounter and possibly
815 * @orig_node: the orig node to free
817 void batadv_orig_node_put(struct batadv_orig_node
*orig_node
)
819 kref_put(&orig_node
->refcount
, batadv_orig_node_release
);
822 void batadv_originator_free(struct batadv_priv
*bat_priv
)
824 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
825 struct hlist_node
*node_tmp
;
826 struct hlist_head
*head
;
827 spinlock_t
*list_lock
; /* spinlock to protect write access */
828 struct batadv_orig_node
*orig_node
;
834 cancel_delayed_work_sync(&bat_priv
->orig_work
);
836 bat_priv
->orig_hash
= NULL
;
838 for (i
= 0; i
< hash
->size
; i
++) {
839 head
= &hash
->table
[i
];
840 list_lock
= &hash
->list_locks
[i
];
842 spin_lock_bh(list_lock
);
843 hlist_for_each_entry_safe(orig_node
, node_tmp
,
845 hlist_del_rcu(&orig_node
->hash_entry
);
846 batadv_orig_node_put(orig_node
);
848 spin_unlock_bh(list_lock
);
851 batadv_hash_destroy(hash
);
855 * batadv_orig_node_new - creates a new orig_node
856 * @bat_priv: the bat priv with all the soft interface information
857 * @addr: the mac address of the originator
859 * Creates a new originator object and initialise all the generic fields.
860 * The new object is not added to the originator list.
862 * Return: the newly created object or NULL on failure.
864 struct batadv_orig_node
*batadv_orig_node_new(struct batadv_priv
*bat_priv
,
867 struct batadv_orig_node
*orig_node
;
868 struct batadv_orig_node_vlan
*vlan
;
869 unsigned long reset_time
;
872 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
873 "Creating new originator: %pM\n", addr
);
875 orig_node
= kzalloc(sizeof(*orig_node
), GFP_ATOMIC
);
879 INIT_HLIST_HEAD(&orig_node
->neigh_list
);
880 INIT_HLIST_HEAD(&orig_node
->vlan_list
);
881 INIT_HLIST_HEAD(&orig_node
->ifinfo_list
);
882 spin_lock_init(&orig_node
->bcast_seqno_lock
);
883 spin_lock_init(&orig_node
->neigh_list_lock
);
884 spin_lock_init(&orig_node
->tt_buff_lock
);
885 spin_lock_init(&orig_node
->tt_lock
);
886 spin_lock_init(&orig_node
->vlan_list_lock
);
888 batadv_nc_init_orig(orig_node
);
890 /* extra reference for return */
891 kref_init(&orig_node
->refcount
);
892 kref_get(&orig_node
->refcount
);
894 orig_node
->bat_priv
= bat_priv
;
895 ether_addr_copy(orig_node
->orig
, addr
);
896 batadv_dat_init_orig_node_addr(orig_node
);
897 atomic_set(&orig_node
->last_ttvn
, 0);
898 orig_node
->tt_buff
= NULL
;
899 orig_node
->tt_buff_len
= 0;
900 orig_node
->last_seen
= jiffies
;
901 reset_time
= jiffies
- 1 - msecs_to_jiffies(BATADV_RESET_PROTECTION_MS
);
902 orig_node
->bcast_seqno_reset
= reset_time
;
904 #ifdef CONFIG_BATMAN_ADV_MCAST
905 orig_node
->mcast_flags
= BATADV_NO_FLAGS
;
906 INIT_HLIST_NODE(&orig_node
->mcast_want_all_unsnoopables_node
);
907 INIT_HLIST_NODE(&orig_node
->mcast_want_all_ipv4_node
);
908 INIT_HLIST_NODE(&orig_node
->mcast_want_all_ipv6_node
);
909 spin_lock_init(&orig_node
->mcast_handler_lock
);
912 /* create a vlan object for the "untagged" LAN */
913 vlan
= batadv_orig_node_vlan_new(orig_node
, BATADV_NO_FLAGS
);
916 /* batadv_orig_node_vlan_new() increases the refcounter.
917 * Immediately release vlan since it is not needed anymore in this
920 batadv_orig_node_vlan_put(vlan
);
922 for (i
= 0; i
< BATADV_FRAG_BUFFER_COUNT
; i
++) {
923 INIT_HLIST_HEAD(&orig_node
->fragments
[i
].head
);
924 spin_lock_init(&orig_node
->fragments
[i
].lock
);
925 orig_node
->fragments
[i
].size
= 0;
935 * batadv_purge_neigh_ifinfo - purge obsolete ifinfo entries from neighbor
936 * @bat_priv: the bat priv with all the soft interface information
937 * @neigh: orig node which is to be checked
940 batadv_purge_neigh_ifinfo(struct batadv_priv
*bat_priv
,
941 struct batadv_neigh_node
*neigh
)
943 struct batadv_neigh_ifinfo
*neigh_ifinfo
;
944 struct batadv_hard_iface
*if_outgoing
;
945 struct hlist_node
*node_tmp
;
947 spin_lock_bh(&neigh
->ifinfo_lock
);
949 /* for all ifinfo objects for this neighinator */
950 hlist_for_each_entry_safe(neigh_ifinfo
, node_tmp
,
951 &neigh
->ifinfo_list
, list
) {
952 if_outgoing
= neigh_ifinfo
->if_outgoing
;
954 /* always keep the default interface */
955 if (if_outgoing
== BATADV_IF_DEFAULT
)
958 /* don't purge if the interface is not (going) down */
959 if ((if_outgoing
->if_status
!= BATADV_IF_INACTIVE
) &&
960 (if_outgoing
->if_status
!= BATADV_IF_NOT_IN_USE
) &&
961 (if_outgoing
->if_status
!= BATADV_IF_TO_BE_REMOVED
))
964 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
965 "neighbor/ifinfo purge: neighbor %pM, iface: %s\n",
966 neigh
->addr
, if_outgoing
->net_dev
->name
);
968 hlist_del_rcu(&neigh_ifinfo
->list
);
969 batadv_neigh_ifinfo_put(neigh_ifinfo
);
972 spin_unlock_bh(&neigh
->ifinfo_lock
);
976 * batadv_purge_orig_ifinfo - purge obsolete ifinfo entries from originator
977 * @bat_priv: the bat priv with all the soft interface information
978 * @orig_node: orig node which is to be checked
980 * Return: true if any ifinfo entry was purged, false otherwise.
983 batadv_purge_orig_ifinfo(struct batadv_priv
*bat_priv
,
984 struct batadv_orig_node
*orig_node
)
986 struct batadv_orig_ifinfo
*orig_ifinfo
;
987 struct batadv_hard_iface
*if_outgoing
;
988 struct hlist_node
*node_tmp
;
989 bool ifinfo_purged
= false;
991 spin_lock_bh(&orig_node
->neigh_list_lock
);
993 /* for all ifinfo objects for this originator */
994 hlist_for_each_entry_safe(orig_ifinfo
, node_tmp
,
995 &orig_node
->ifinfo_list
, list
) {
996 if_outgoing
= orig_ifinfo
->if_outgoing
;
998 /* always keep the default interface */
999 if (if_outgoing
== BATADV_IF_DEFAULT
)
1002 /* don't purge if the interface is not (going) down */
1003 if ((if_outgoing
->if_status
!= BATADV_IF_INACTIVE
) &&
1004 (if_outgoing
->if_status
!= BATADV_IF_NOT_IN_USE
) &&
1005 (if_outgoing
->if_status
!= BATADV_IF_TO_BE_REMOVED
))
1008 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
1009 "router/ifinfo purge: originator %pM, iface: %s\n",
1010 orig_node
->orig
, if_outgoing
->net_dev
->name
);
1012 ifinfo_purged
= true;
1014 hlist_del_rcu(&orig_ifinfo
->list
);
1015 batadv_orig_ifinfo_put(orig_ifinfo
);
1016 if (orig_node
->last_bonding_candidate
== orig_ifinfo
) {
1017 orig_node
->last_bonding_candidate
= NULL
;
1018 batadv_orig_ifinfo_put(orig_ifinfo
);
1022 spin_unlock_bh(&orig_node
->neigh_list_lock
);
1024 return ifinfo_purged
;
1028 * batadv_purge_orig_neighbors - purges neighbors from originator
1029 * @bat_priv: the bat priv with all the soft interface information
1030 * @orig_node: orig node which is to be checked
1032 * Return: true if any neighbor was purged, false otherwise
1035 batadv_purge_orig_neighbors(struct batadv_priv
*bat_priv
,
1036 struct batadv_orig_node
*orig_node
)
1038 struct hlist_node
*node_tmp
;
1039 struct batadv_neigh_node
*neigh_node
;
1040 bool neigh_purged
= false;
1041 unsigned long last_seen
;
1042 struct batadv_hard_iface
*if_incoming
;
1044 spin_lock_bh(&orig_node
->neigh_list_lock
);
1046 /* for all neighbors towards this originator ... */
1047 hlist_for_each_entry_safe(neigh_node
, node_tmp
,
1048 &orig_node
->neigh_list
, list
) {
1049 last_seen
= neigh_node
->last_seen
;
1050 if_incoming
= neigh_node
->if_incoming
;
1052 if ((batadv_has_timed_out(last_seen
, BATADV_PURGE_TIMEOUT
)) ||
1053 (if_incoming
->if_status
== BATADV_IF_INACTIVE
) ||
1054 (if_incoming
->if_status
== BATADV_IF_NOT_IN_USE
) ||
1055 (if_incoming
->if_status
== BATADV_IF_TO_BE_REMOVED
)) {
1056 if ((if_incoming
->if_status
== BATADV_IF_INACTIVE
) ||
1057 (if_incoming
->if_status
== BATADV_IF_NOT_IN_USE
) ||
1058 (if_incoming
->if_status
== BATADV_IF_TO_BE_REMOVED
))
1059 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
1060 "neighbor purge: originator %pM, neighbor: %pM, iface: %s\n",
1061 orig_node
->orig
, neigh_node
->addr
,
1062 if_incoming
->net_dev
->name
);
1064 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
1065 "neighbor timeout: originator %pM, neighbor: %pM, last_seen: %u\n",
1066 orig_node
->orig
, neigh_node
->addr
,
1067 jiffies_to_msecs(last_seen
));
1069 neigh_purged
= true;
1071 hlist_del_rcu(&neigh_node
->list
);
1072 batadv_neigh_node_put(neigh_node
);
1074 /* only necessary if not the whole neighbor is to be
1075 * deleted, but some interface has been removed.
1077 batadv_purge_neigh_ifinfo(bat_priv
, neigh_node
);
1081 spin_unlock_bh(&orig_node
->neigh_list_lock
);
1082 return neigh_purged
;
1086 * batadv_find_best_neighbor - finds the best neighbor after purging
1087 * @bat_priv: the bat priv with all the soft interface information
1088 * @orig_node: orig node which is to be checked
1089 * @if_outgoing: the interface for which the metric should be compared
1091 * Return: the current best neighbor, with refcount increased.
1093 static struct batadv_neigh_node
*
1094 batadv_find_best_neighbor(struct batadv_priv
*bat_priv
,
1095 struct batadv_orig_node
*orig_node
,
1096 struct batadv_hard_iface
*if_outgoing
)
1098 struct batadv_neigh_node
*best
= NULL
, *neigh
;
1099 struct batadv_algo_ops
*bao
= bat_priv
->bat_algo_ops
;
1102 hlist_for_each_entry_rcu(neigh
, &orig_node
->neigh_list
, list
) {
1103 if (best
&& (bao
->bat_neigh_cmp(neigh
, if_outgoing
,
1104 best
, if_outgoing
) <= 0))
1107 if (!kref_get_unless_zero(&neigh
->refcount
))
1111 batadv_neigh_node_put(best
);
1121 * batadv_purge_orig_node - purges obsolete information from an orig_node
1122 * @bat_priv: the bat priv with all the soft interface information
1123 * @orig_node: orig node which is to be checked
1125 * This function checks if the orig_node or substructures of it have become
1126 * obsolete, and purges this information if that's the case.
1128 * Return: true if the orig_node is to be removed, false otherwise.
1130 static bool batadv_purge_orig_node(struct batadv_priv
*bat_priv
,
1131 struct batadv_orig_node
*orig_node
)
1133 struct batadv_neigh_node
*best_neigh_node
;
1134 struct batadv_hard_iface
*hard_iface
;
1135 bool changed_ifinfo
, changed_neigh
;
1137 if (batadv_has_timed_out(orig_node
->last_seen
,
1138 2 * BATADV_PURGE_TIMEOUT
)) {
1139 batadv_dbg(BATADV_DBG_BATMAN
, bat_priv
,
1140 "Originator timeout: originator %pM, last_seen %u\n",
1142 jiffies_to_msecs(orig_node
->last_seen
));
1145 changed_ifinfo
= batadv_purge_orig_ifinfo(bat_priv
, orig_node
);
1146 changed_neigh
= batadv_purge_orig_neighbors(bat_priv
, orig_node
);
1148 if (!changed_ifinfo
&& !changed_neigh
)
1151 /* first for NULL ... */
1152 best_neigh_node
= batadv_find_best_neighbor(bat_priv
, orig_node
,
1154 batadv_update_route(bat_priv
, orig_node
, BATADV_IF_DEFAULT
,
1156 if (best_neigh_node
)
1157 batadv_neigh_node_put(best_neigh_node
);
1159 /* ... then for all other interfaces. */
1161 list_for_each_entry_rcu(hard_iface
, &batadv_hardif_list
, list
) {
1162 if (hard_iface
->if_status
!= BATADV_IF_ACTIVE
)
1165 if (hard_iface
->soft_iface
!= bat_priv
->soft_iface
)
1168 if (!kref_get_unless_zero(&hard_iface
->refcount
))
1171 best_neigh_node
= batadv_find_best_neighbor(bat_priv
,
1174 batadv_update_route(bat_priv
, orig_node
, hard_iface
,
1176 if (best_neigh_node
)
1177 batadv_neigh_node_put(best_neigh_node
);
1179 batadv_hardif_put(hard_iface
);
1186 static void _batadv_purge_orig(struct batadv_priv
*bat_priv
)
1188 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
1189 struct hlist_node
*node_tmp
;
1190 struct hlist_head
*head
;
1191 spinlock_t
*list_lock
; /* spinlock to protect write access */
1192 struct batadv_orig_node
*orig_node
;
1198 /* for all origins... */
1199 for (i
= 0; i
< hash
->size
; i
++) {
1200 head
= &hash
->table
[i
];
1201 list_lock
= &hash
->list_locks
[i
];
1203 spin_lock_bh(list_lock
);
1204 hlist_for_each_entry_safe(orig_node
, node_tmp
,
1206 if (batadv_purge_orig_node(bat_priv
, orig_node
)) {
1207 batadv_gw_node_delete(bat_priv
, orig_node
);
1208 hlist_del_rcu(&orig_node
->hash_entry
);
1209 batadv_tt_global_del_orig(orig_node
->bat_priv
,
1211 "originator timed out");
1212 batadv_orig_node_put(orig_node
);
1216 batadv_frag_purge_orig(orig_node
,
1217 batadv_frag_check_entry
);
1219 spin_unlock_bh(list_lock
);
1222 batadv_gw_election(bat_priv
);
1225 static void batadv_purge_orig(struct work_struct
*work
)
1227 struct delayed_work
*delayed_work
;
1228 struct batadv_priv
*bat_priv
;
1230 delayed_work
= to_delayed_work(work
);
1231 bat_priv
= container_of(delayed_work
, struct batadv_priv
, orig_work
);
1232 _batadv_purge_orig(bat_priv
);
1233 queue_delayed_work(batadv_event_workqueue
,
1234 &bat_priv
->orig_work
,
1235 msecs_to_jiffies(BATADV_ORIG_WORK_PERIOD
));
1238 void batadv_purge_orig_ref(struct batadv_priv
*bat_priv
)
1240 _batadv_purge_orig(bat_priv
);
1243 int batadv_orig_seq_print_text(struct seq_file
*seq
, void *offset
)
1245 struct net_device
*net_dev
= (struct net_device
*)seq
->private;
1246 struct batadv_priv
*bat_priv
= netdev_priv(net_dev
);
1247 struct batadv_hard_iface
*primary_if
;
1249 primary_if
= batadv_seq_print_text_primary_if_get(seq
);
1253 seq_printf(seq
, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s %s)]\n",
1254 BATADV_SOURCE_VERSION
, primary_if
->net_dev
->name
,
1255 primary_if
->net_dev
->dev_addr
, net_dev
->name
,
1256 bat_priv
->bat_algo_ops
->name
);
1258 batadv_hardif_put(primary_if
);
1260 if (!bat_priv
->bat_algo_ops
->bat_orig_print
) {
1262 "No printing function for this routing protocol\n");
1266 bat_priv
->bat_algo_ops
->bat_orig_print(bat_priv
, seq
,
1273 * batadv_orig_hardif_seq_print_text - writes originator infos for a specific
1274 * outgoing interface
1275 * @seq: debugfs table seq_file struct
1280 int batadv_orig_hardif_seq_print_text(struct seq_file
*seq
, void *offset
)
1282 struct net_device
*net_dev
= (struct net_device
*)seq
->private;
1283 struct batadv_hard_iface
*hard_iface
;
1284 struct batadv_priv
*bat_priv
;
1286 hard_iface
= batadv_hardif_get_by_netdev(net_dev
);
1288 if (!hard_iface
|| !hard_iface
->soft_iface
) {
1289 seq_puts(seq
, "Interface not known to B.A.T.M.A.N.\n");
1293 bat_priv
= netdev_priv(hard_iface
->soft_iface
);
1294 if (!bat_priv
->bat_algo_ops
->bat_orig_print
) {
1296 "No printing function for this routing protocol\n");
1300 if (hard_iface
->if_status
!= BATADV_IF_ACTIVE
) {
1301 seq_puts(seq
, "Interface not active\n");
1305 seq_printf(seq
, "[B.A.T.M.A.N. adv %s, IF/MAC: %s/%pM (%s %s)]\n",
1306 BATADV_SOURCE_VERSION
, hard_iface
->net_dev
->name
,
1307 hard_iface
->net_dev
->dev_addr
,
1308 hard_iface
->soft_iface
->name
, bat_priv
->bat_algo_ops
->name
);
1310 bat_priv
->bat_algo_ops
->bat_orig_print(bat_priv
, seq
, hard_iface
);
1314 batadv_hardif_put(hard_iface
);
1318 int batadv_orig_hash_add_if(struct batadv_hard_iface
*hard_iface
,
1321 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
1322 struct batadv_algo_ops
*bao
= bat_priv
->bat_algo_ops
;
1323 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
1324 struct hlist_head
*head
;
1325 struct batadv_orig_node
*orig_node
;
1329 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
1332 for (i
= 0; i
< hash
->size
; i
++) {
1333 head
= &hash
->table
[i
];
1336 hlist_for_each_entry_rcu(orig_node
, head
, hash_entry
) {
1338 if (bao
->bat_orig_add_if
)
1339 ret
= bao
->bat_orig_add_if(orig_node
,
1354 int batadv_orig_hash_del_if(struct batadv_hard_iface
*hard_iface
,
1357 struct batadv_priv
*bat_priv
= netdev_priv(hard_iface
->soft_iface
);
1358 struct batadv_hashtable
*hash
= bat_priv
->orig_hash
;
1359 struct hlist_head
*head
;
1360 struct batadv_hard_iface
*hard_iface_tmp
;
1361 struct batadv_orig_node
*orig_node
;
1362 struct batadv_algo_ops
*bao
= bat_priv
->bat_algo_ops
;
1366 /* resize all orig nodes because orig_node->bcast_own(_sum) depend on
1369 for (i
= 0; i
< hash
->size
; i
++) {
1370 head
= &hash
->table
[i
];
1373 hlist_for_each_entry_rcu(orig_node
, head
, hash_entry
) {
1375 if (bao
->bat_orig_del_if
)
1376 ret
= bao
->bat_orig_del_if(orig_node
,
1378 hard_iface
->if_num
);
1385 /* renumber remaining batman interfaces _inside_ of orig_hash_lock */
1387 list_for_each_entry_rcu(hard_iface_tmp
, &batadv_hardif_list
, list
) {
1388 if (hard_iface_tmp
->if_status
== BATADV_IF_NOT_IN_USE
)
1391 if (hard_iface
== hard_iface_tmp
)
1394 if (hard_iface
->soft_iface
!= hard_iface_tmp
->soft_iface
)
1397 if (hard_iface_tmp
->if_num
> hard_iface
->if_num
)
1398 hard_iface_tmp
->if_num
--;
1402 hard_iface
->if_num
= -1;