[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_v.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_algo.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)
{
	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) {
		batadv_v_elp_iface_activate(primary_if, hard_iface);
		batadv_hardif_put(primary_if);
	}

	/* 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);

	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);
}

/**
 * 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",
	.iface = {
		.activate = batadv_v_iface_activate,
		.enable = batadv_v_iface_enable,
		.disable = batadv_v_iface_disable,
		.update_mac = batadv_v_iface_update_mac,
		.primary_set = batadv_v_primary_iface_set,
	},
	.neigh = {
		.hardif_init = batadv_v_hardif_neigh_init,
		.cmp = batadv_v_neigh_cmp,
		.is_similar_or_better = batadv_v_neigh_is_sob,
		.print = batadv_v_neigh_print,
	},
	.orig = {
		.print = batadv_v_orig_print,
	},
};

/**
 * batadv_v_hardif_init - initialize the algorithm specific fields in the
 *  hard-interface object
 * @hard_iface: the hard-interface to initialize
 */
void batadv_v_hardif_init(struct batadv_hard_iface *hard_iface)
{
	/* enable link throughput auto-detection by setting the throughput
	 * override to zero
	 */
	atomic_set(&hard_iface->bat_v.throughput_override, 0);
	atomic_set(&hard_iface->bat_v.elp_interval, 500);
}

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