[deliverable/linux.git] / net / batman-adv / bat_v.c

/* Copyright (C) 2013-2016 B.A.T.M.A.N. contributors:
 *
 * Linus Lüssing, Marek Lindner
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, see <http://www.gnu.org/licenses/>.
 */

#include "bat_algo.h"
#include "main.h"

#include <linux/atomic.h>
#include <linux/bug.h>
#include <linux/cache.h>
#include <linux/init.h>
#include <linux/jiffies.h>
#include <linux/netdevice.h>
#include <linux/rculist.h>
#include <linux/rcupdate.h>
#include <linux/seq_file.h>
#include <linux/stddef.h>
#include <linux/types.h>
#include <linux/workqueue.h>

#include "bat_v_elp.h"
#include "bat_v_ogm.h"
#include "hard-interface.h"
#include "hash.h"
#include "originator.h"
#include "packet.h"

static void batadv_v_iface_activate(struct batadv_hard_iface *hard_iface)
{
	/* B.A.T.M.A.N. V does not use any queuing mechanism, therefore it can
	 * set the interface as ACTIVE right away, without any risk of race
	 * condition
	 */
	if (hard_iface->if_status == BATADV_IF_TO_BE_ACTIVATED)
		hard_iface->if_status = BATADV_IF_ACTIVE;
}

static int batadv_v_iface_enable(struct batadv_hard_iface *hard_iface)
{
	int ret;

	ret = batadv_v_elp_iface_enable(hard_iface);
	if (ret < 0)
		return ret;

	ret = batadv_v_ogm_iface_enable(hard_iface);
	if (ret < 0)
		batadv_v_elp_iface_disable(hard_iface);

	/* enable link throughput auto-detection by setting the throughput
	 * override to zero
	 */
	atomic_set(&hard_iface->bat_v.throughput_override, 0);

	return ret;
}

static void batadv_v_iface_disable(struct batadv_hard_iface *hard_iface)
{
	batadv_v_elp_iface_disable(hard_iface);
}

static void batadv_v_primary_iface_set(struct batadv_hard_iface *hard_iface)
{
	batadv_v_elp_primary_iface_set(hard_iface);
	batadv_v_ogm_primary_iface_set(hard_iface);
}

/**
 * batadv_v_iface_update_mac - react to hard-interface MAC address change
 * @hard_iface: the modified interface
 *
 * If the modified interface is the primary one, update the originator
 * address in the ELP and OGM messages to reflect the new MAC address.
 */
static void batadv_v_iface_update_mac(struct batadv_hard_iface *hard_iface)
{
	struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
	struct batadv_hard_iface *primary_if;

	primary_if = batadv_primary_if_get_selected(bat_priv);
	if (primary_if != hard_iface)
		goto out;

	batadv_v_primary_iface_set(hard_iface);
out:
	if (primary_if)
		batadv_hardif_put(primary_if);
}

static void
batadv_v_hardif_neigh_init(struct batadv_hardif_neigh_node *hardif_neigh)
{
	ewma_throughput_init(&hardif_neigh->bat_v.throughput);
	INIT_WORK(&hardif_neigh->bat_v.metric_work,
		  batadv_v_elp_throughput_metric_update);
}

static void batadv_v_ogm_schedule(struct batadv_hard_iface *hard_iface)
{
}

static void batadv_v_ogm_emit(struct batadv_forw_packet *forw_packet)
{
}

/**
 * batadv_v_orig_print_neigh - print neighbors for the originator table
 * @orig_node: the orig_node for which the neighbors are printed
 * @if_outgoing: outgoing interface for these entries
 * @seq: debugfs table seq_file struct
 *
 * Must be called while holding an rcu lock.
 */
static void
batadv_v_orig_print_neigh(struct batadv_orig_node *orig_node,
			  struct batadv_hard_iface *if_outgoing,
			  struct seq_file *seq)
{
	struct batadv_neigh_node *neigh_node;
	struct batadv_neigh_ifinfo *n_ifinfo;

	hlist_for_each_entry_rcu(neigh_node, &orig_node->neigh_list, list) {
		n_ifinfo = batadv_neigh_ifinfo_get(neigh_node, if_outgoing);
		if (!n_ifinfo)
			continue;

		seq_printf(seq, " %pM (%9u.%1u)",
			   neigh_node->addr,
			   n_ifinfo->bat_v.throughput / 10,
			   n_ifinfo->bat_v.throughput % 10);

		batadv_neigh_ifinfo_put(n_ifinfo);
	}
}

/**
 * batadv_v_hardif_neigh_print - print a single ELP neighbour node
 * @seq: neighbour table seq_file struct
 * @hardif_neigh: hardif neighbour information
 */
static void
batadv_v_hardif_neigh_print(struct seq_file *seq,
			    struct batadv_hardif_neigh_node *hardif_neigh)
{
	int last_secs, last_msecs;
	u32 throughput;

	last_secs = jiffies_to_msecs(jiffies - hardif_neigh->last_seen) / 1000;
	last_msecs = jiffies_to_msecs(jiffies - hardif_neigh->last_seen) % 1000;
	throughput = ewma_throughput_read(&hardif_neigh->bat_v.throughput);

	seq_printf(seq, "%pM %4i.%03is (%9u.%1u) [%10s]\n",
		   hardif_neigh->addr, last_secs, last_msecs, throughput / 10,
		   throughput % 10, hardif_neigh->if_incoming->net_dev->name);
}

/**
 * batadv_v_neigh_print - print the single hop neighbour list
 * @bat_priv: the bat priv with all the soft interface information
 * @seq: neighbour table seq_file struct
 */
static void batadv_v_neigh_print(struct batadv_priv *bat_priv,
				 struct seq_file *seq)
{
	struct net_device *net_dev = (struct net_device *)seq->private;
	struct batadv_hardif_neigh_node *hardif_neigh;
	struct batadv_hard_iface *hard_iface;
	int batman_count = 0;

	seq_puts(seq,
		 "  Neighbor        last-seen ( throughput) [        IF]\n");

	rcu_read_lock();
	list_for_each_entry_rcu(hard_iface, &batadv_hardif_list, list) {
		if (hard_iface->soft_iface != net_dev)
			continue;

		hlist_for_each_entry_rcu(hardif_neigh,
					 &hard_iface->neigh_list, list) {
			batadv_v_hardif_neigh_print(seq, hardif_neigh);
			batman_count++;
		}
	}
	rcu_read_unlock();

	if (batman_count == 0)
		seq_puts(seq, "No batman nodes in range ...\n");
}

/**
 * batadv_v_orig_print - print the originator table
 * @bat_priv: the bat priv with all the soft interface information
 * @seq: debugfs table seq_file struct
 * @if_outgoing: the outgoing interface for which this should be printed
 */
static void batadv_v_orig_print(struct batadv_priv *bat_priv,
				struct seq_file *seq,
				struct batadv_hard_iface *if_outgoing)
{
	struct batadv_neigh_node *neigh_node;
	struct batadv_hashtable *hash = bat_priv->orig_hash;
	int last_seen_msecs, last_seen_secs;
	struct batadv_orig_node *orig_node;
	struct batadv_neigh_ifinfo *n_ifinfo;
	unsigned long last_seen_jiffies;
	struct hlist_head *head;
	int batman_count = 0;
	u32 i;

	seq_puts(seq,
		 "  Originator      last-seen ( throughput)           Nexthop [outgoingIF]:   Potential nexthops ...\n");

	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];

		rcu_read_lock();
		hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
			neigh_node = batadv_orig_router_get(orig_node,
							    if_outgoing);
			if (!neigh_node)
				continue;

			n_ifinfo = batadv_neigh_ifinfo_get(neigh_node,
							   if_outgoing);
			if (!n_ifinfo)
				goto next;

			last_seen_jiffies = jiffies - orig_node->last_seen;
			last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
			last_seen_secs = last_seen_msecs / 1000;
			last_seen_msecs = last_seen_msecs % 1000;

			seq_printf(seq, "%pM %4i.%03is (%9u.%1u) %pM [%10s]:",
				   orig_node->orig, last_seen_secs,
				   last_seen_msecs,
				   n_ifinfo->bat_v.throughput / 10,
				   n_ifinfo->bat_v.throughput % 10,
				   neigh_node->addr,
				   neigh_node->if_incoming->net_dev->name);

			batadv_v_orig_print_neigh(orig_node, if_outgoing, seq);
			seq_puts(seq, "\n");
			batman_count++;

next:
			batadv_neigh_node_put(neigh_node);
			if (n_ifinfo)
				batadv_neigh_ifinfo_put(n_ifinfo);
		}
		rcu_read_unlock();
	}

	if (batman_count == 0)
		seq_puts(seq, "No batman nodes in range ...\n");
}

static int batadv_v_neigh_cmp(struct batadv_neigh_node *neigh1,
			      struct batadv_hard_iface *if_outgoing1,
			      struct batadv_neigh_node *neigh2,
			      struct batadv_hard_iface *if_outgoing2)
{
	struct batadv_neigh_ifinfo *ifinfo1, *ifinfo2;
	int ret = 0;

	ifinfo1 = batadv_neigh_ifinfo_get(neigh1, if_outgoing1);
	if (WARN_ON(!ifinfo1))
		goto err_ifinfo1;

	ifinfo2 = batadv_neigh_ifinfo_get(neigh2, if_outgoing2);
	if (WARN_ON(!ifinfo2))
		goto err_ifinfo2;

	ret = ifinfo1->bat_v.throughput - ifinfo2->bat_v.throughput;

	batadv_neigh_ifinfo_put(ifinfo2);
err_ifinfo2:
	batadv_neigh_ifinfo_put(ifinfo1);
err_ifinfo1:
	return ret;
}

static bool batadv_v_neigh_is_sob(struct batadv_neigh_node *neigh1,
				  struct batadv_hard_iface *if_outgoing1,
				  struct batadv_neigh_node *neigh2,
				  struct batadv_hard_iface *if_outgoing2)
{
	struct batadv_neigh_ifinfo *ifinfo1, *ifinfo2;
	u32 threshold;
	bool ret = false;

	ifinfo1 = batadv_neigh_ifinfo_get(neigh1, if_outgoing1);
	if (WARN_ON(!ifinfo1))
		goto err_ifinfo1;

	ifinfo2 = batadv_neigh_ifinfo_get(neigh2, if_outgoing2);
	if (WARN_ON(!ifinfo2))
		goto err_ifinfo2;

	threshold = ifinfo1->bat_v.throughput / 4;
	threshold = ifinfo1->bat_v.throughput - threshold;

	ret = ifinfo2->bat_v.throughput > threshold;

	batadv_neigh_ifinfo_put(ifinfo2);
err_ifinfo2:
	batadv_neigh_ifinfo_put(ifinfo1);
err_ifinfo1:
	return ret;
}

static struct batadv_algo_ops batadv_batman_v __read_mostly = {
	.name = "BATMAN_V",
	.bat_iface_activate = batadv_v_iface_activate,
	.bat_iface_enable = batadv_v_iface_enable,
	.bat_iface_disable = batadv_v_iface_disable,
	.bat_iface_update_mac = batadv_v_iface_update_mac,
	.bat_primary_iface_set = batadv_v_primary_iface_set,
	.bat_hardif_neigh_init = batadv_v_hardif_neigh_init,
	.bat_ogm_emit = batadv_v_ogm_emit,
	.bat_ogm_schedule = batadv_v_ogm_schedule,
	.bat_orig_print = batadv_v_orig_print,
	.bat_neigh_cmp = batadv_v_neigh_cmp,
	.bat_neigh_is_similar_or_better = batadv_v_neigh_is_sob,
	.bat_neigh_print = batadv_v_neigh_print,
};

/**
 * batadv_v_mesh_init - initialize the B.A.T.M.A.N. V private resources for a
 *  mesh
 * @bat_priv: the object representing the mesh interface to initialise
 *
 * Return: 0 on success or a negative error code otherwise
 */
int batadv_v_mesh_init(struct batadv_priv *bat_priv)
{
	return batadv_v_ogm_init(bat_priv);
}

/**
 * batadv_v_mesh_free - free the B.A.T.M.A.N. V private resources for a mesh
 * @bat_priv: the object representing the mesh interface to free
 */
void batadv_v_mesh_free(struct batadv_priv *bat_priv)
{
	batadv_v_ogm_free(bat_priv);
}

/**
 * batadv_v_init - B.A.T.M.A.N. V initialization function
 *
 * Description: Takes care of initializing all the subcomponents.
 * It is invoked upon module load only.
 *
 * Return: 0 on success or a negative error code otherwise
 */
int __init batadv_v_init(void)
{
	int ret;

	/* B.A.T.M.A.N. V echo location protocol packet  */
	ret = batadv_recv_handler_register(BATADV_ELP,
					   batadv_v_elp_packet_recv);
	if (ret < 0)
		return ret;

	ret = batadv_recv_handler_register(BATADV_OGM2,
					   batadv_v_ogm_packet_recv);
	if (ret < 0)
		goto elp_unregister;

	ret = batadv_algo_register(&batadv_batman_v);
	if (ret < 0)
		goto ogm_unregister;

	return ret;

ogm_unregister:
	batadv_recv_handler_unregister(BATADV_OGM2);

elp_unregister:
	batadv_recv_handler_unregister(BATADV_ELP);

	return ret;
}
Commit	Line	Data
d6f94d91 LL	1	/* Copyright (C) 2013-2016 B.A.T.M.A.N. contributors:
	2	*
	3	* Linus Lüssing, Marek Lindner
	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 "bat_algo.h"
	19	#include "main.h"
	20
0b5ecc68	21	#include <linux/atomic.h>
97869060	22	#include <linux/bug.h>
d6f94d91 LL	23	#include <linux/cache.h>
d6f94d91 LL	24	#include <linux/init.h>
261e264d AQ	25	#include <linux/jiffies.h>
	26	#include <linux/netdevice.h>
	27	#include <linux/rculist.h>
	28	#include <linux/rcupdate.h>
	29	#include <linux/seq_file.h>
a45e932a	30	#include <linux/stddef.h>
97869060	31	#include <linux/types.h>
c833484e	32	#include <linux/workqueue.h>
d6f94d91 LL	33
d6f94d91 LL	34	#include "bat_v_elp.h"
0da00359	35	#include "bat_v_ogm.h"
b6cf5d49	36	#include "hard-interface.h"
261e264d	37	#include "hash.h"
97869060	38	#include "originator.h"
162bd64c	39	#include "packet.h"
d6f94d91	40
b6cf5d49 AQ	41	static void batadv_v_iface_activate(struct batadv_hard_iface *hard_iface)
	42	{
	43	/* B.A.T.M.A.N. V does not use any queuing mechanism, therefore it can
	44	* set the interface as ACTIVE right away, without any risk of race
	45	* condition
	46	*/
	47	if (hard_iface->if_status == BATADV_IF_TO_BE_ACTIVATED)
	48	hard_iface->if_status = BATADV_IF_ACTIVE;
	49	}
	50
d6f94d91 LL	51	static int batadv_v_iface_enable(struct batadv_hard_iface *hard_iface)
d6f94d91 LL	52	{
0da00359 AQ	53	int ret;
	54
	55	ret = batadv_v_elp_iface_enable(hard_iface);
	56	if (ret < 0)
	57	return ret;
	58
	59	ret = batadv_v_ogm_iface_enable(hard_iface);
	60	if (ret < 0)
	61	batadv_v_elp_iface_disable(hard_iface);
	62
0b5ecc68 AQ	63	/* enable link throughput auto-detection by setting the throughput
	64	* override to zero
	65	*/
	66	atomic_set(&hard_iface->bat_v.throughput_override, 0);
	67
0da00359	68	return ret;
d6f94d91 LL	69	}
	70
	71	static void batadv_v_iface_disable(struct batadv_hard_iface *hard_iface)
	72	{
	73	batadv_v_elp_iface_disable(hard_iface);
	74	}
	75
d6f94d91 LL	76	static void batadv_v_primary_iface_set(struct batadv_hard_iface *hard_iface)
	77	{
	78	batadv_v_elp_primary_iface_set(hard_iface);
0da00359	79	batadv_v_ogm_primary_iface_set(hard_iface);
d6f94d91 LL	80	}
d6f94d91 LL	81
1653f61d AQ	82	/**
	83	* batadv_v_iface_update_mac - react to hard-interface MAC address change
	84	* @hard_iface: the modified interface
	85	*
	86	* If the modified interface is the primary one, update the originator
	87	* address in the ELP and OGM messages to reflect the new MAC address.
	88	*/
	89	static void batadv_v_iface_update_mac(struct batadv_hard_iface *hard_iface)
	90	{
	91	struct batadv_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
	92	struct batadv_hard_iface *primary_if;
	93
	94	primary_if = batadv_primary_if_get_selected(bat_priv);
	95	if (primary_if != hard_iface)
	96	goto out;
	97
	98	batadv_v_primary_iface_set(hard_iface);
	99	out:
	100	if (primary_if)
	101	batadv_hardif_put(primary_if);
	102	}
	103
162bd64c LL	104	static void
	105	batadv_v_hardif_neigh_init(struct batadv_hardif_neigh_node *hardif_neigh)
	106	{
	107	ewma_throughput_init(&hardif_neigh->bat_v.throughput);
c833484e AQ	108	INIT_WORK(&hardif_neigh->bat_v.metric_work,
c833484e AQ	109	batadv_v_elp_throughput_metric_update);
162bd64c LL	110	}
162bd64c LL	111
d6f94d91 LL	112	static void batadv_v_ogm_schedule(struct batadv_hard_iface *hard_iface)
	113	{
	114	}
	115
	116	static void batadv_v_ogm_emit(struct batadv_forw_packet *forw_packet)
	117	{
	118	}
	119
261e264d AQ	120	/**
	121	* batadv_v_orig_print_neigh - print neighbors for the originator table
	122	* @orig_node: the orig_node for which the neighbors are printed
	123	* @if_outgoing: outgoing interface for these entries
	124	* @seq: debugfs table seq_file struct
	125	*
	126	* Must be called while holding an rcu lock.
	127	*/
	128	static void
	129	batadv_v_orig_print_neigh(struct batadv_orig_node *orig_node,
	130	struct batadv_hard_iface *if_outgoing,
	131	struct seq_file *seq)
	132	{
	133	struct batadv_neigh_node *neigh_node;
	134	struct batadv_neigh_ifinfo *n_ifinfo;
	135
	136	hlist_for_each_entry_rcu(neigh_node, &orig_node->neigh_list, list) {
	137	n_ifinfo = batadv_neigh_ifinfo_get(neigh_node, if_outgoing);
	138	if (!n_ifinfo)
	139	continue;
	140
	141	seq_printf(seq, " %pM (%9u.%1u)",
	142	neigh_node->addr,
	143	n_ifinfo->bat_v.throughput / 10,
	144	n_ifinfo->bat_v.throughput % 10);
	145
	146	batadv_neigh_ifinfo_put(n_ifinfo);
	147	}
	148	}
	149
626d23e8 LL	150	/**
	151	* batadv_v_hardif_neigh_print - print a single ELP neighbour node
	152	* @seq: neighbour table seq_file struct
	153	* @hardif_neigh: hardif neighbour information
	154	*/
	155	static void
	156	batadv_v_hardif_neigh_print(struct seq_file *seq,
	157	struct batadv_hardif_neigh_node *hardif_neigh)
	158	{
	159	int last_secs, last_msecs;
	160	u32 throughput;
	161
	162	last_secs = jiffies_to_msecs(jiffies - hardif_neigh->last_seen) / 1000;
	163	last_msecs = jiffies_to_msecs(jiffies - hardif_neigh->last_seen) % 1000;
	164	throughput = ewma_throughput_read(&hardif_neigh->bat_v.throughput);
	165
	166	seq_printf(seq, "%pM %4i.%03is (%9u.%1u) [%10s]\n",
	167	hardif_neigh->addr, last_secs, last_msecs, throughput / 10,
	168	throughput % 10, hardif_neigh->if_incoming->net_dev->name);
	169	}
	170
	171	/**
	172	* batadv_v_neigh_print - print the single hop neighbour list
	173	* @bat_priv: the bat priv with all the soft interface information
	174	* @seq: neighbour table seq_file struct
	175	*/
	176	static void batadv_v_neigh_print(struct batadv_priv *bat_priv,
	177	struct seq_file *seq)
	178	{
	179	struct net_device net_dev = (struct net_device )seq->private;
	180	struct batadv_hardif_neigh_node *hardif_neigh;
	181	struct batadv_hard_iface *hard_iface;
	182	int batman_count = 0;
	183
925a6f37 AQ	184	seq_puts(seq,
925a6f37 AQ	185	" Neighbor last-seen ( throughput) [ IF]\n");
626d23e8 LL	186
	187	rcu_read_lock();
	188	list_for_each_entry_rcu(hard_iface, &batadv_hardif_list, list) {
	189	if (hard_iface->soft_iface != net_dev)
	190	continue;
	191
	192	hlist_for_each_entry_rcu(hardif_neigh,
	193	&hard_iface->neigh_list, list) {
	194	batadv_v_hardif_neigh_print(seq, hardif_neigh);
	195	batman_count++;
	196	}
	197	}
	198	rcu_read_unlock();
	199
	200	if (batman_count == 0)
	201	seq_puts(seq, "No batman nodes in range ...\n");
	202	}
	203
261e264d AQ	204	/**
	205	* batadv_v_orig_print - print the originator table
	206	* @bat_priv: the bat priv with all the soft interface information
	207	* @seq: debugfs table seq_file struct
	208	* @if_outgoing: the outgoing interface for which this should be printed
	209	*/
	210	static void batadv_v_orig_print(struct batadv_priv *bat_priv,
	211	struct seq_file *seq,
	212	struct batadv_hard_iface *if_outgoing)
	213	{
	214	struct batadv_neigh_node *neigh_node;
	215	struct batadv_hashtable *hash = bat_priv->orig_hash;
	216	int last_seen_msecs, last_seen_secs;
	217	struct batadv_orig_node *orig_node;
	218	struct batadv_neigh_ifinfo *n_ifinfo;
	219	unsigned long last_seen_jiffies;
	220	struct hlist_head *head;
	221	int batman_count = 0;
	222	u32 i;
	223
925a6f37 AQ	224	seq_puts(seq,
925a6f37 AQ	225	" Originator last-seen ( throughput) Nexthop [outgoingIF]: Potential nexthops ...\n");
261e264d AQ	226
	227	for (i = 0; i < hash->size; i++) {
	228	head = &hash->table[i];
	229
	230	rcu_read_lock();
	231	hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
	232	neigh_node = batadv_orig_router_get(orig_node,
	233	if_outgoing);
	234	if (!neigh_node)
	235	continue;
	236
	237	n_ifinfo = batadv_neigh_ifinfo_get(neigh_node,
	238	if_outgoing);
	239	if (!n_ifinfo)
	240	goto next;
	241
	242	last_seen_jiffies = jiffies - orig_node->last_seen;
	243	last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
	244	last_seen_secs = last_seen_msecs / 1000;
	245	last_seen_msecs = last_seen_msecs % 1000;
	246
	247	seq_printf(seq, "%pM %4i.%03is (%9u.%1u) %pM [%10s]:",
	248	orig_node->orig, last_seen_secs,
	249	last_seen_msecs,
	250	n_ifinfo->bat_v.throughput / 10,
	251	n_ifinfo->bat_v.throughput % 10,
	252	neigh_node->addr,
	253	neigh_node->if_incoming->net_dev->name);
	254
	255	batadv_v_orig_print_neigh(orig_node, if_outgoing, seq);
	256	seq_puts(seq, "\n");
	257	batman_count++;
	258
	259	next:
	260	batadv_neigh_node_put(neigh_node);
	261	if (n_ifinfo)
	262	batadv_neigh_ifinfo_put(n_ifinfo);
	263	}
	264	rcu_read_unlock();
	265	}
	266
	267	if (batman_count == 0)
	268	seq_puts(seq, "No batman nodes in range ...\n");
	269	}
	270
97869060 AQ	271	static int batadv_v_neigh_cmp(struct batadv_neigh_node *neigh1,
	272	struct batadv_hard_iface *if_outgoing1,
	273	struct batadv_neigh_node *neigh2,
	274	struct batadv_hard_iface *if_outgoing2)
	275	{
	276	struct batadv_neigh_ifinfo ifinfo1, ifinfo2;
71f9d27d	277	int ret = 0;
97869060 AQ	278
97869060 AQ	279	ifinfo1 = batadv_neigh_ifinfo_get(neigh1, if_outgoing1);
71f9d27d SE	280	if (WARN_ON(!ifinfo1))
	281	goto err_ifinfo1;
	282
97869060	283	ifinfo2 = batadv_neigh_ifinfo_get(neigh2, if_outgoing2);
71f9d27d SE	284	if (WARN_ON(!ifinfo2))
71f9d27d SE	285	goto err_ifinfo2;
97869060	286
71f9d27d	287	ret = ifinfo1->bat_v.throughput - ifinfo2->bat_v.throughput;
97869060	288
71f9d27d SE	289	batadv_neigh_ifinfo_put(ifinfo2);
	290	err_ifinfo2:
	291	batadv_neigh_ifinfo_put(ifinfo1);
	292	err_ifinfo1:
	293	return ret;
97869060 AQ	294	}
	295
	296	static bool batadv_v_neigh_is_sob(struct batadv_neigh_node *neigh1,
	297	struct batadv_hard_iface *if_outgoing1,
	298	struct batadv_neigh_node *neigh2,
	299	struct batadv_hard_iface *if_outgoing2)
	300	{
	301	struct batadv_neigh_ifinfo ifinfo1, ifinfo2;
	302	u32 threshold;
71f9d27d	303	bool ret = false;
97869060 AQ	304
97869060 AQ	305	ifinfo1 = batadv_neigh_ifinfo_get(neigh1, if_outgoing1);
71f9d27d SE	306	if (WARN_ON(!ifinfo1))
71f9d27d SE	307	goto err_ifinfo1;
97869060	308
71f9d27d SE	309	ifinfo2 = batadv_neigh_ifinfo_get(neigh2, if_outgoing2);
	310	if (WARN_ON(!ifinfo2))
	311	goto err_ifinfo2;
a45e932a	312
97869060 AQ	313	threshold = ifinfo1->bat_v.throughput / 4;
	314	threshold = ifinfo1->bat_v.throughput - threshold;
	315
71f9d27d SE	316	ret = ifinfo2->bat_v.throughput > threshold;
	317
	318	batadv_neigh_ifinfo_put(ifinfo2);
	319	err_ifinfo2:
	320	batadv_neigh_ifinfo_put(ifinfo1);
	321	err_ifinfo1:
	322	return ret;
97869060 AQ	323	}
97869060 AQ	324
d6f94d91 LL	325	static struct batadv_algo_ops batadv_batman_v __read_mostly = {
d6f94d91 LL	326	.name = "BATMAN_V",
b6cf5d49	327	.bat_iface_activate = batadv_v_iface_activate,
d6f94d91 LL	328	.bat_iface_enable = batadv_v_iface_enable,
	329	.bat_iface_disable = batadv_v_iface_disable,
	330	.bat_iface_update_mac = batadv_v_iface_update_mac,
	331	.bat_primary_iface_set = batadv_v_primary_iface_set,
162bd64c	332	.bat_hardif_neigh_init = batadv_v_hardif_neigh_init,
d6f94d91 LL	333	.bat_ogm_emit = batadv_v_ogm_emit,
d6f94d91 LL	334	.bat_ogm_schedule = batadv_v_ogm_schedule,
261e264d	335	.bat_orig_print = batadv_v_orig_print,
97869060 AQ	336	.bat_neigh_cmp = batadv_v_neigh_cmp,
97869060 AQ	337	.bat_neigh_is_similar_or_better = batadv_v_neigh_is_sob,
626d23e8	338	.bat_neigh_print = batadv_v_neigh_print,
d6f94d91 LL	339	};
d6f94d91 LL	340
0da00359 AQ	341	/**
	342	* batadv_v_mesh_init - initialize the B.A.T.M.A.N. V private resources for a
	343	* mesh
	344	* @bat_priv: the object representing the mesh interface to initialise
	345	*
	346	* Return: 0 on success or a negative error code otherwise
	347	*/
	348	int batadv_v_mesh_init(struct batadv_priv *bat_priv)
	349	{
	350	return batadv_v_ogm_init(bat_priv);
	351	}
	352
	353	/**
	354	* batadv_v_mesh_free - free the B.A.T.M.A.N. V private resources for a mesh
	355	* @bat_priv: the object representing the mesh interface to free
	356	*/
	357	void batadv_v_mesh_free(struct batadv_priv *bat_priv)
	358	{
	359	batadv_v_ogm_free(bat_priv);
	360	}
	361
d6f94d91 LL	362	/**
	363	* batadv_v_init - B.A.T.M.A.N. V initialization function
	364	*
	365	* Description: Takes care of initializing all the subcomponents.
	366	* It is invoked upon module load only.
	367	*
	368	* Return: 0 on success or a negative error code otherwise
	369	*/
	370	int __init batadv_v_init(void)
	371	{
162bd64c LL	372	int ret;
	373
	374	/* B.A.T.M.A.N. V echo location protocol packet */
	375	ret = batadv_recv_handler_register(BATADV_ELP,
	376	batadv_v_elp_packet_recv);
	377	if (ret < 0)
	378	return ret;
	379
0da00359 AQ	380	ret = batadv_recv_handler_register(BATADV_OGM2,
	381	batadv_v_ogm_packet_recv);
	382	if (ret < 0)
	383	goto elp_unregister;
162bd64c	384
0da00359	385	ret = batadv_algo_register(&batadv_batman_v);
162bd64c	386	if (ret < 0)
0da00359 AQ	387	goto ogm_unregister;
	388
	389	return ret;
	390
	391	ogm_unregister:
	392	batadv_recv_handler_unregister(BATADV_OGM2);
	393
	394	elp_unregister:
	395	batadv_recv_handler_unregister(BATADV_ELP);
162bd64c LL	396
162bd64c LL	397	return ret;
d6f94d91	398	}