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

/*
 * Copyright (C) 2009-2011 B.A.T.M.A.N. contributors:
 *
 * Marek Lindner, Simon Wunderlich
 *
 * 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, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
 * 02110-1301, USA
 *
 */

#include "main.h"
#include "originator.h"
#include "hash.h"
#include "translation-table.h"
#include "routing.h"
#include "gateway_client.h"
#include "hard-interface.h"
#include "unicast.h"
#include "soft-interface.h"

static void purge_orig(struct work_struct *work);

static void start_purge_timer(struct bat_priv *bat_priv)
{
	INIT_DELAYED_WORK(&bat_priv->orig_work, purge_orig);
	queue_delayed_work(bat_event_workqueue, &bat_priv->orig_work, 1 * HZ);
}

/* returns 1 if they are the same originator */
static int compare_orig(const struct hlist_node *node, const void *data2)
{
	const void *data1 = container_of(node, struct orig_node, hash_entry);

	return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
}

int originator_init(struct bat_priv *bat_priv)
{
	if (bat_priv->orig_hash)
		return 1;

	bat_priv->orig_hash = hash_new(1024);

	if (!bat_priv->orig_hash)
		goto err;

	start_purge_timer(bat_priv);
	return 1;

err:
	return 0;
}

void neigh_node_free_ref(struct neigh_node *neigh_node)
{
	if (atomic_dec_and_test(&neigh_node->refcount))
		kfree_rcu(neigh_node, rcu);
}

/* increases the refcounter of a found router */
struct neigh_node *orig_node_get_router(struct orig_node *orig_node)
{
	struct neigh_node *router;

	rcu_read_lock();
	router = rcu_dereference(orig_node->router);

	if (router && !atomic_inc_not_zero(&router->refcount))
		router = NULL;

	rcu_read_unlock();
	return router;
}

struct neigh_node *create_neighbor(struct orig_node *orig_node,
				   struct orig_node *orig_neigh_node,
				   const uint8_t *neigh,
				   struct hard_iface *if_incoming)
{
	struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
	struct neigh_node *neigh_node;

	bat_dbg(DBG_BATMAN, bat_priv,
		"Creating new last-hop neighbor of originator\n");

	neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
	if (!neigh_node)
		return NULL;

	INIT_HLIST_NODE(&neigh_node->list);
	INIT_LIST_HEAD(&neigh_node->bonding_list);
	spin_lock_init(&neigh_node->tq_lock);

	memcpy(neigh_node->addr, neigh, ETH_ALEN);
	neigh_node->orig_node = orig_neigh_node;
	neigh_node->if_incoming = if_incoming;

	/* extra reference for return */
	atomic_set(&neigh_node->refcount, 2);

	spin_lock_bh(&orig_node->neigh_list_lock);
	hlist_add_head_rcu(&neigh_node->list, &orig_node->neigh_list);
	spin_unlock_bh(&orig_node->neigh_list_lock);
	return neigh_node;
}

static void orig_node_free_rcu(struct rcu_head *rcu)
{
	struct hlist_node *node, *node_tmp;
	struct neigh_node *neigh_node, *tmp_neigh_node;
	struct orig_node *orig_node;

	orig_node = container_of(rcu, struct orig_node, rcu);

	spin_lock_bh(&orig_node->neigh_list_lock);

	/* for all bonding members ... */
	list_for_each_entry_safe(neigh_node, tmp_neigh_node,
				 &orig_node->bond_list, bonding_list) {
		list_del_rcu(&neigh_node->bonding_list);
		neigh_node_free_ref(neigh_node);
	}

	/* for all neighbors towards this originator ... */
	hlist_for_each_entry_safe(neigh_node, node, node_tmp,
				  &orig_node->neigh_list, list) {
		hlist_del_rcu(&neigh_node->list);
		neigh_node_free_ref(neigh_node);
	}

	spin_unlock_bh(&orig_node->neigh_list_lock);

	frag_list_free(&orig_node->frag_list);
	tt_global_del_orig(orig_node->bat_priv, orig_node,
			    "originator timed out");

	kfree(orig_node->tt_buff);
	kfree(orig_node->bcast_own);
	kfree(orig_node->bcast_own_sum);
	kfree(orig_node);
}

void orig_node_free_ref(struct orig_node *orig_node)
{
	if (atomic_dec_and_test(&orig_node->refcount))
		call_rcu(&orig_node->rcu, orig_node_free_rcu);
}

void originator_free(struct bat_priv *bat_priv)
{
	struct hashtable_t *hash = bat_priv->orig_hash;
	struct hlist_node *node, *node_tmp;
	struct hlist_head *head;
	spinlock_t *list_lock; /* spinlock to protect write access */
	struct orig_node *orig_node;
	int i;

	if (!hash)
		return;

	cancel_delayed_work_sync(&bat_priv->orig_work);

	bat_priv->orig_hash = NULL;

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

		spin_lock_bh(list_lock);
		hlist_for_each_entry_safe(orig_node, node, node_tmp,
					  head, hash_entry) {

			hlist_del_rcu(node);
			orig_node_free_ref(orig_node);
		}
		spin_unlock_bh(list_lock);
	}

	hash_destroy(hash);
}

/* this function finds or creates an originator entry for the given
 * address if it does not exits */
struct orig_node *get_orig_node(struct bat_priv *bat_priv, const uint8_t *addr)
{
	struct orig_node *orig_node;
	int size;
	int hash_added;

	orig_node = orig_hash_find(bat_priv, addr);
	if (orig_node)
		return orig_node;

	bat_dbg(DBG_BATMAN, bat_priv,
		"Creating new originator: %pM\n", addr);

	orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
	if (!orig_node)
		return NULL;

	INIT_HLIST_HEAD(&orig_node->neigh_list);
	INIT_LIST_HEAD(&orig_node->bond_list);
	spin_lock_init(&orig_node->ogm_cnt_lock);
	spin_lock_init(&orig_node->bcast_seqno_lock);
	spin_lock_init(&orig_node->neigh_list_lock);
	spin_lock_init(&orig_node->tt_buff_lock);

	/* extra reference for return */
	atomic_set(&orig_node->refcount, 2);

	orig_node->tt_poss_change = false;
	orig_node->bat_priv = bat_priv;
	memcpy(orig_node->orig, addr, ETH_ALEN);
	orig_node->router = NULL;
	orig_node->tt_crc = 0;
	atomic_set(&orig_node->last_ttvn, 0);
	orig_node->tt_buff = NULL;
	orig_node->tt_buff_len = 0;
	atomic_set(&orig_node->tt_size, 0);
	orig_node->bcast_seqno_reset = jiffies - 1
					- msecs_to_jiffies(RESET_PROTECTION_MS);
	orig_node->batman_seqno_reset = jiffies - 1
					- msecs_to_jiffies(RESET_PROTECTION_MS);

	atomic_set(&orig_node->bond_candidates, 0);

	size = bat_priv->num_ifaces * sizeof(unsigned long) * NUM_WORDS;

	orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
	if (!orig_node->bcast_own)
		goto free_orig_node;

	size = bat_priv->num_ifaces * sizeof(uint8_t);
	orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);

	INIT_LIST_HEAD(&orig_node->frag_list);
	orig_node->last_frag_packet = 0;

	if (!orig_node->bcast_own_sum)
		goto free_bcast_own;

	hash_added = hash_add(bat_priv->orig_hash, compare_orig,
			      choose_orig, orig_node, &orig_node->hash_entry);
	if (hash_added < 0)
		goto free_bcast_own_sum;

	return orig_node;
free_bcast_own_sum:
	kfree(orig_node->bcast_own_sum);
free_bcast_own:
	kfree(orig_node->bcast_own);
free_orig_node:
	kfree(orig_node);
	return NULL;
}

static bool purge_orig_neighbors(struct bat_priv *bat_priv,
				 struct orig_node *orig_node,
				 struct neigh_node **best_neigh_node)
{
	struct hlist_node *node, *node_tmp;
	struct neigh_node *neigh_node;
	bool neigh_purged = false;

	*best_neigh_node = NULL;

	spin_lock_bh(&orig_node->neigh_list_lock);

	/* for all neighbors towards this originator ... */
	hlist_for_each_entry_safe(neigh_node, node, node_tmp,
				  &orig_node->neigh_list, list) {

		if ((time_after(jiffies,
			neigh_node->last_valid + PURGE_TIMEOUT * HZ)) ||
		    (neigh_node->if_incoming->if_status == IF_INACTIVE) ||
		    (neigh_node->if_incoming->if_status == IF_NOT_IN_USE) ||
		    (neigh_node->if_incoming->if_status == IF_TO_BE_REMOVED)) {

			if ((neigh_node->if_incoming->if_status ==
								IF_INACTIVE) ||
			    (neigh_node->if_incoming->if_status ==
							IF_NOT_IN_USE) ||
			    (neigh_node->if_incoming->if_status ==
							IF_TO_BE_REMOVED))
				bat_dbg(DBG_BATMAN, bat_priv,
					"neighbor purge: originator %pM, "
					"neighbor: %pM, iface: %s\n",
					orig_node->orig, neigh_node->addr,
					neigh_node->if_incoming->net_dev->name);
			else
				bat_dbg(DBG_BATMAN, bat_priv,
					"neighbor timeout: originator %pM, "
					"neighbor: %pM, last_valid: %lu\n",
					orig_node->orig, neigh_node->addr,
					(neigh_node->last_valid / HZ));

			neigh_purged = true;

			hlist_del_rcu(&neigh_node->list);
			bonding_candidate_del(orig_node, neigh_node);
			neigh_node_free_ref(neigh_node);
		} else {
			if ((!*best_neigh_node) ||
			    (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
				*best_neigh_node = neigh_node;
		}
	}

	spin_unlock_bh(&orig_node->neigh_list_lock);
	return neigh_purged;
}

static bool purge_orig_node(struct bat_priv *bat_priv,
			    struct orig_node *orig_node)
{
	struct neigh_node *best_neigh_node;

	if (time_after(jiffies,
		orig_node->last_valid + 2 * PURGE_TIMEOUT * HZ)) {

		bat_dbg(DBG_BATMAN, bat_priv,
			"Originator timeout: originator %pM, last_valid %lu\n",
			orig_node->orig, (orig_node->last_valid / HZ));
		return true;
	} else {
		if (purge_orig_neighbors(bat_priv, orig_node,
							&best_neigh_node)) {
			update_routes(bat_priv, orig_node,
				      best_neigh_node);
		}
	}

	return false;
}

static void _purge_orig(struct bat_priv *bat_priv)
{
	struct hashtable_t *hash = bat_priv->orig_hash;
	struct hlist_node *node, *node_tmp;
	struct hlist_head *head;
	spinlock_t *list_lock; /* spinlock to protect write access */
	struct orig_node *orig_node;
	int i;

	if (!hash)
		return;

	/* for all origins... */
	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];
		list_lock = &hash->list_locks[i];

		spin_lock_bh(list_lock);
		hlist_for_each_entry_safe(orig_node, node, node_tmp,
					  head, hash_entry) {
			if (purge_orig_node(bat_priv, orig_node)) {
				if (orig_node->gw_flags)
					gw_node_delete(bat_priv, orig_node);
				hlist_del_rcu(node);
				orig_node_free_ref(orig_node);
				continue;
			}

			if (time_after(jiffies, orig_node->last_frag_packet +
						msecs_to_jiffies(FRAG_TIMEOUT)))
				frag_list_free(&orig_node->frag_list);
		}
		spin_unlock_bh(list_lock);
	}

	gw_node_purge(bat_priv);
	gw_election(bat_priv);

	softif_neigh_purge(bat_priv);
}

static void purge_orig(struct work_struct *work)
{
	struct delayed_work *delayed_work =
		container_of(work, struct delayed_work, work);
	struct bat_priv *bat_priv =
		container_of(delayed_work, struct bat_priv, orig_work);

	_purge_orig(bat_priv);
	start_purge_timer(bat_priv);
}

void purge_orig_ref(struct bat_priv *bat_priv)
{
	_purge_orig(bat_priv);
}

int orig_seq_print_text(struct seq_file *seq, void *offset)
{
	struct net_device *net_dev = (struct net_device *)seq->private;
	struct bat_priv *bat_priv = netdev_priv(net_dev);
	struct hashtable_t *hash = bat_priv->orig_hash;
	struct hlist_node *node, *node_tmp;
	struct hlist_head *head;
	struct hard_iface *primary_if;
	struct orig_node *orig_node;
	struct neigh_node *neigh_node, *neigh_node_tmp;
	int batman_count = 0;
	int last_seen_secs;
	int last_seen_msecs;
	int i, ret = 0;

	primary_if = primary_if_get_selected(bat_priv);

	if (!primary_if) {
		ret = seq_printf(seq, "BATMAN mesh %s disabled - "
				 "please specify interfaces to enable it\n",
				 net_dev->name);
		goto out;
	}

	if (primary_if->if_status != IF_ACTIVE) {
		ret = seq_printf(seq, "BATMAN mesh %s "
				 "disabled - primary interface not active\n",
				 net_dev->name);
		goto out;
	}

	seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
		   SOURCE_VERSION, primary_if->net_dev->name,
		   primary_if->net_dev->dev_addr, net_dev->name);
	seq_printf(seq, "  %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
		   "Originator", "last-seen", "#", TQ_MAX_VALUE, "Nexthop",
		   "outgoingIF", "Potential nexthops");

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

		rcu_read_lock();
		hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
			neigh_node = orig_node_get_router(orig_node);
			if (!neigh_node)
				continue;

			if (neigh_node->tq_avg == 0)
				goto next;

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

			seq_printf(seq, "%pM %4i.%03is   (%3i) %pM [%10s]:",
				   orig_node->orig, last_seen_secs,
				   last_seen_msecs, neigh_node->tq_avg,
				   neigh_node->addr,
				   neigh_node->if_incoming->net_dev->name);

			hlist_for_each_entry_rcu(neigh_node_tmp, node_tmp,
						 &orig_node->neigh_list, list) {
				seq_printf(seq, " %pM (%3i)",
					   neigh_node_tmp->addr,
					   neigh_node_tmp->tq_avg);
			}

			seq_printf(seq, "\n");
			batman_count++;

next:
			neigh_node_free_ref(neigh_node);
		}
		rcu_read_unlock();
	}

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

out:
	if (primary_if)
		hardif_free_ref(primary_if);
	return ret;
}

static int orig_node_add_if(struct orig_node *orig_node, int max_if_num)
{
	void *data_ptr;

	data_ptr = kmalloc(max_if_num * sizeof(unsigned long) * NUM_WORDS,
			   GFP_ATOMIC);
	if (!data_ptr) {
		pr_err("Can't resize orig: out of memory\n");
		return -1;
	}

	memcpy(data_ptr, orig_node->bcast_own,
	       (max_if_num - 1) * sizeof(unsigned long) * NUM_WORDS);
	kfree(orig_node->bcast_own);
	orig_node->bcast_own = data_ptr;

	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
	if (!data_ptr) {
		pr_err("Can't resize orig: out of memory\n");
		return -1;
	}

	memcpy(data_ptr, orig_node->bcast_own_sum,
	       (max_if_num - 1) * sizeof(uint8_t));
	kfree(orig_node->bcast_own_sum);
	orig_node->bcast_own_sum = data_ptr;

	return 0;
}

int orig_hash_add_if(struct hard_iface *hard_iface, int max_if_num)
{
	struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
	struct hashtable_t *hash = bat_priv->orig_hash;
	struct hlist_node *node;
	struct hlist_head *head;
	struct orig_node *orig_node;
	int i, ret;

	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	 * if_num */
	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];

		rcu_read_lock();
		hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
			spin_lock_bh(&orig_node->ogm_cnt_lock);
			ret = orig_node_add_if(orig_node, max_if_num);
			spin_unlock_bh(&orig_node->ogm_cnt_lock);

			if (ret == -1)
				goto err;
		}
		rcu_read_unlock();
	}

	return 0;

err:
	rcu_read_unlock();
	return -ENOMEM;
}

static int orig_node_del_if(struct orig_node *orig_node,
		     int max_if_num, int del_if_num)
{
	void *data_ptr = NULL;
	int chunk_size;

	/* last interface was removed */
	if (max_if_num == 0)
		goto free_bcast_own;

	chunk_size = sizeof(unsigned long) * NUM_WORDS;
	data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
	if (!data_ptr) {
		pr_err("Can't resize orig: out of memory\n");
		return -1;
	}

	/* copy first part */
	memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);

	/* copy second part */
	memcpy((char *)data_ptr + del_if_num * chunk_size,
	       orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
	       (max_if_num - del_if_num) * chunk_size);

free_bcast_own:
	kfree(orig_node->bcast_own);
	orig_node->bcast_own = data_ptr;

	if (max_if_num == 0)
		goto free_own_sum;

	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
	if (!data_ptr) {
		pr_err("Can't resize orig: out of memory\n");
		return -1;
	}

	memcpy(data_ptr, orig_node->bcast_own_sum,
	       del_if_num * sizeof(uint8_t));

	memcpy((char *)data_ptr + del_if_num * sizeof(uint8_t),
	       orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
	       (max_if_num - del_if_num) * sizeof(uint8_t));

free_own_sum:
	kfree(orig_node->bcast_own_sum);
	orig_node->bcast_own_sum = data_ptr;

	return 0;
}

int orig_hash_del_if(struct hard_iface *hard_iface, int max_if_num)
{
	struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
	struct hashtable_t *hash = bat_priv->orig_hash;
	struct hlist_node *node;
	struct hlist_head *head;
	struct hard_iface *hard_iface_tmp;
	struct orig_node *orig_node;
	int i, ret;

	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	 * if_num */
	for (i = 0; i < hash->size; i++) {
		head = &hash->table[i];

		rcu_read_lock();
		hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
			spin_lock_bh(&orig_node->ogm_cnt_lock);
			ret = orig_node_del_if(orig_node, max_if_num,
					hard_iface->if_num);
			spin_unlock_bh(&orig_node->ogm_cnt_lock);

			if (ret == -1)
				goto err;
		}
		rcu_read_unlock();
	}

	/* renumber remaining batman interfaces _inside_ of orig_hash_lock */
	rcu_read_lock();
	list_for_each_entry_rcu(hard_iface_tmp, &hardif_list, list) {
		if (hard_iface_tmp->if_status == IF_NOT_IN_USE)
			continue;

		if (hard_iface == hard_iface_tmp)
			continue;

		if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
			continue;

		if (hard_iface_tmp->if_num > hard_iface->if_num)
			hard_iface_tmp->if_num--;
	}
	rcu_read_unlock();

	hard_iface->if_num = -1;
	return 0;

err:
	rcu_read_unlock();
	return -ENOMEM;
}
Commit	Line	Data
c6c8fea2	1	/*
64afe353	2	* Copyright (C) 2009-2011 B.A.T.M.A.N. contributors:
c6c8fea2 SE	3	*
	4	* Marek Lindner, Simon Wunderlich
	5	*
	6	* This program is free software; you can redistribute it and/or
	7	* modify it under the terms of version 2 of the GNU General Public
	8	* License as published by the Free Software Foundation.
	9	*
	10	* This program is distributed in the hope that it will be useful, but
	11	* WITHOUT ANY WARRANTY; without even the implied warranty of
	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	13	* General Public License for more details.
	14	*
	15	* You should have received a copy of the GNU General Public License
	16	* along with this program; if not, write to the Free Software
	17	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
	18	* 02110-1301, USA
	19	*
	20	*/
	21
c6c8fea2 SE	22	#include "main.h"
	23	#include "originator.h"
	24	#include "hash.h"
	25	#include "translation-table.h"
	26	#include "routing.h"
	27	#include "gateway_client.h"
	28	#include "hard-interface.h"
	29	#include "unicast.h"
	30	#include "soft-interface.h"
	31
	32	static void purge_orig(struct work_struct *work);
	33
	34	static void start_purge_timer(struct bat_priv *bat_priv)
	35	{
	36	INIT_DELAYED_WORK(&bat_priv->orig_work, purge_orig);
	37	queue_delayed_work(bat_event_workqueue, &bat_priv->orig_work, 1 * HZ);
	38	}
	39
b8e2dd13 SE	40	/* returns 1 if they are the same originator */
	41	static int compare_orig(const struct hlist_node node, const void data2)
	42	{
	43	const void *data1 = container_of(node, struct orig_node, hash_entry);
	44
	45	return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
	46	}
	47
c6c8fea2 SE	48	int originator_init(struct bat_priv *bat_priv)
	49	{
	50	if (bat_priv->orig_hash)
	51	return 1;
	52
c6c8fea2 SE	53	bat_priv->orig_hash = hash_new(1024);
	54
	55	if (!bat_priv->orig_hash)
	56	goto err;
	57
c6c8fea2 SE	58	start_purge_timer(bat_priv);
	59	return 1;
	60
	61	err:
c6c8fea2 SE	62	return 0;
	63	}
	64
44524fcd	65	void neigh_node_free_ref(struct neigh_node *neigh_node)
a4c135c5	66	{
44524fcd	67	if (atomic_dec_and_test(&neigh_node->refcount))
ae179ae4	68	kfree_rcu(neigh_node, rcu);
a4c135c5 SW	69	}
a4c135c5 SW	70
e1a5382f LL	71	/* increases the refcounter of a found router */
	72	struct neigh_node orig_node_get_router(struct orig_node orig_node)
	73	{
	74	struct neigh_node *router;
	75
	76	rcu_read_lock();
	77	router = rcu_dereference(orig_node->router);
	78
	79	if (router && !atomic_inc_not_zero(&router->refcount))
	80	router = NULL;
	81
	82	rcu_read_unlock();
	83	return router;
	84	}
	85
a8e7f4bc ML	86	struct neigh_node create_neighbor(struct orig_node orig_node,
a8e7f4bc ML	87	struct orig_node *orig_neigh_node,
747e4221	88	const uint8_t *neigh,
e6c10f43	89	struct hard_iface *if_incoming)
c6c8fea2 SE	90	{
	91	struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
	92	struct neigh_node *neigh_node;
	93
	94	bat_dbg(DBG_BATMAN, bat_priv,
	95	"Creating new last-hop neighbor of originator\n");
	96
704509b8	97	neigh_node = kzalloc(sizeof(*neigh_node), GFP_ATOMIC);
c6c8fea2 SE	98	if (!neigh_node)
	99	return NULL;
	100
9591a79f	101	INIT_HLIST_NODE(&neigh_node->list);
a4c135c5	102	INIT_LIST_HEAD(&neigh_node->bonding_list);
68003903	103	spin_lock_init(&neigh_node->tq_lock);
c6c8fea2 SE	104
	105	memcpy(neigh_node->addr, neigh, ETH_ALEN);
	106	neigh_node->orig_node = orig_neigh_node;
	107	neigh_node->if_incoming = if_incoming;
1605d0d6 ML	108
	109	/* extra reference for return */
	110	atomic_set(&neigh_node->refcount, 2);
c6c8fea2	111
f987ed6e ML	112	spin_lock_bh(&orig_node->neigh_list_lock);
	113	hlist_add_head_rcu(&neigh_node->list, &orig_node->neigh_list);
	114	spin_unlock_bh(&orig_node->neigh_list_lock);
c6c8fea2 SE	115	return neigh_node;
	116	}
	117
7b36e8ee	118	static void orig_node_free_rcu(struct rcu_head *rcu)
c6c8fea2	119	{
9591a79f	120	struct hlist_node node, node_tmp;
a4c135c5	121	struct neigh_node neigh_node, tmp_neigh_node;
16b1aba8 ML	122	struct orig_node *orig_node;
16b1aba8 ML	123
7b36e8ee	124	orig_node = container_of(rcu, struct orig_node, rcu);
c6c8fea2	125
f987ed6e ML	126	spin_lock_bh(&orig_node->neigh_list_lock);
f987ed6e ML	127
a4c135c5 SW	128	/* for all bonding members ... */
	129	list_for_each_entry_safe(neigh_node, tmp_neigh_node,
	130	&orig_node->bond_list, bonding_list) {
	131	list_del_rcu(&neigh_node->bonding_list);
44524fcd	132	neigh_node_free_ref(neigh_node);
a4c135c5 SW	133	}
a4c135c5 SW	134
c6c8fea2	135	/* for all neighbors towards this originator ... */
9591a79f ML	136	hlist_for_each_entry_safe(neigh_node, node, node_tmp,
9591a79f ML	137	&orig_node->neigh_list, list) {
f987ed6e	138	hlist_del_rcu(&neigh_node->list);
44524fcd	139	neigh_node_free_ref(neigh_node);
c6c8fea2 SE	140	}
c6c8fea2 SE	141
f987ed6e ML	142	spin_unlock_bh(&orig_node->neigh_list_lock);
f987ed6e ML	143
c6c8fea2	144	frag_list_free(&orig_node->frag_list);
2dafb49d	145	tt_global_del_orig(orig_node->bat_priv, orig_node,
16b1aba8	146	"originator timed out");
c6c8fea2	147
a73105b8	148	kfree(orig_node->tt_buff);
c6c8fea2 SE	149	kfree(orig_node->bcast_own);
	150	kfree(orig_node->bcast_own_sum);
	151	kfree(orig_node);
	152	}
	153
7b36e8ee ML	154	void orig_node_free_ref(struct orig_node *orig_node)
	155	{
	156	if (atomic_dec_and_test(&orig_node->refcount))
	157	call_rcu(&orig_node->rcu, orig_node_free_rcu);
	158	}
	159
c6c8fea2 SE	160	void originator_free(struct bat_priv *bat_priv)
c6c8fea2 SE	161	{
16b1aba8	162	struct hashtable_t *hash = bat_priv->orig_hash;
7aadf889	163	struct hlist_node node, node_tmp;
16b1aba8	164	struct hlist_head *head;
16b1aba8 ML	165	spinlock_t list_lock; / spinlock to protect write access */
	166	struct orig_node *orig_node;
	167	int i;
	168
	169	if (!hash)
c6c8fea2 SE	170	return;
	171
	172	cancel_delayed_work_sync(&bat_priv->orig_work);
	173
c6c8fea2	174	bat_priv->orig_hash = NULL;
16b1aba8 ML	175
	176	for (i = 0; i < hash->size; i++) {
	177	head = &hash->table[i];
	178	list_lock = &hash->list_locks[i];
	179
	180	spin_lock_bh(list_lock);
7aadf889 ML	181	hlist_for_each_entry_safe(orig_node, node, node_tmp,
7aadf889 ML	182	head, hash_entry) {
16b1aba8	183
7aadf889	184	hlist_del_rcu(node);
7b36e8ee	185	orig_node_free_ref(orig_node);
16b1aba8 ML	186	}
	187	spin_unlock_bh(list_lock);
	188	}
	189
	190	hash_destroy(hash);
c6c8fea2 SE	191	}
	192
	193	/* this function finds or creates an originator entry for the given
	194	* address if it does not exits */
747e4221	195	struct orig_node get_orig_node(struct bat_priv bat_priv, const uint8_t *addr)
c6c8fea2 SE	196	{
	197	struct orig_node *orig_node;
	198	int size;
	199	int hash_added;
	200
7aadf889 ML	201	orig_node = orig_hash_find(bat_priv, addr);
7aadf889 ML	202	if (orig_node)
c6c8fea2 SE	203	return orig_node;
	204
	205	bat_dbg(DBG_BATMAN, bat_priv,
	206	"Creating new originator: %pM\n", addr);
	207
704509b8	208	orig_node = kzalloc(sizeof(*orig_node), GFP_ATOMIC);
c6c8fea2 SE	209	if (!orig_node)
	210	return NULL;
	211
9591a79f	212	INIT_HLIST_HEAD(&orig_node->neigh_list);
a4c135c5	213	INIT_LIST_HEAD(&orig_node->bond_list);
2ae2daf6	214	spin_lock_init(&orig_node->ogm_cnt_lock);
f3e0008f	215	spin_lock_init(&orig_node->bcast_seqno_lock);
f987ed6e	216	spin_lock_init(&orig_node->neigh_list_lock);
a73105b8	217	spin_lock_init(&orig_node->tt_buff_lock);
7b36e8ee ML	218
	219	/* extra reference for return */
	220	atomic_set(&orig_node->refcount, 2);
c6c8fea2	221
cc47f66e	222	orig_node->tt_poss_change = false;
16b1aba8	223	orig_node->bat_priv = bat_priv;
c6c8fea2 SE	224	memcpy(orig_node->orig, addr, ETH_ALEN);
c6c8fea2 SE	225	orig_node->router = NULL;
c8c991bf AQ	226	orig_node->tt_crc = 0;
c8c991bf AQ	227	atomic_set(&orig_node->last_ttvn, 0);
2dafb49d	228	orig_node->tt_buff = NULL;
a73105b8 AQ	229	orig_node->tt_buff_len = 0;
a73105b8 AQ	230	atomic_set(&orig_node->tt_size, 0);
c6c8fea2 SE	231	orig_node->bcast_seqno_reset = jiffies - 1
	232	- msecs_to_jiffies(RESET_PROTECTION_MS);
	233	orig_node->batman_seqno_reset = jiffies - 1
	234	- msecs_to_jiffies(RESET_PROTECTION_MS);
	235
a4c135c5 SW	236	atomic_set(&orig_node->bond_candidates, 0);
a4c135c5 SW	237
c6c8fea2 SE	238	size = bat_priv->num_ifaces * sizeof(unsigned long) * NUM_WORDS;
	239
	240	orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
	241	if (!orig_node->bcast_own)
	242	goto free_orig_node;
	243
	244	size = bat_priv->num_ifaces * sizeof(uint8_t);
	245	orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
	246
	247	INIT_LIST_HEAD(&orig_node->frag_list);
	248	orig_node->last_frag_packet = 0;
	249
	250	if (!orig_node->bcast_own_sum)
	251	goto free_bcast_own;
	252
7aadf889 ML	253	hash_added = hash_add(bat_priv->orig_hash, compare_orig,
7aadf889 ML	254	choose_orig, orig_node, &orig_node->hash_entry);
c6c8fea2 SE	255	if (hash_added < 0)
	256	goto free_bcast_own_sum;
	257
	258	return orig_node;
	259	free_bcast_own_sum:
	260	kfree(orig_node->bcast_own_sum);
	261	free_bcast_own:
	262	kfree(orig_node->bcast_own);
	263	free_orig_node:
	264	kfree(orig_node);
	265	return NULL;
	266	}
	267
	268	static bool purge_orig_neighbors(struct bat_priv *bat_priv,
	269	struct orig_node *orig_node,
	270	struct neigh_node **best_neigh_node)
	271	{
9591a79f	272	struct hlist_node node, node_tmp;
c6c8fea2 SE	273	struct neigh_node *neigh_node;
	274	bool neigh_purged = false;
	275
	276	*best_neigh_node = NULL;
	277
f987ed6e ML	278	spin_lock_bh(&orig_node->neigh_list_lock);
f987ed6e ML	279
c6c8fea2	280	/* for all neighbors towards this originator ... */
9591a79f ML	281	hlist_for_each_entry_safe(neigh_node, node, node_tmp,
9591a79f ML	282	&orig_node->neigh_list, list) {
c6c8fea2 SE	283
	284	if ((time_after(jiffies,
	285	neigh_node->last_valid + PURGE_TIMEOUT * HZ)) \|\|
	286	(neigh_node->if_incoming->if_status == IF_INACTIVE) \|\|
1a241a57	287	(neigh_node->if_incoming->if_status == IF_NOT_IN_USE) \|\|
c6c8fea2 SE	288	(neigh_node->if_incoming->if_status == IF_TO_BE_REMOVED)) {
c6c8fea2 SE	289
1a241a57 ML	290	if ((neigh_node->if_incoming->if_status ==
	291	IF_INACTIVE) \|\|
	292	(neigh_node->if_incoming->if_status ==
	293	IF_NOT_IN_USE) \|\|
	294	(neigh_node->if_incoming->if_status ==
	295	IF_TO_BE_REMOVED))
c6c8fea2 SE	296	bat_dbg(DBG_BATMAN, bat_priv,
	297	"neighbor purge: originator %pM, "
	298	"neighbor: %pM, iface: %s\n",
	299	orig_node->orig, neigh_node->addr,
	300	neigh_node->if_incoming->net_dev->name);
	301	else
	302	bat_dbg(DBG_BATMAN, bat_priv,
	303	"neighbor timeout: originator %pM, "
	304	"neighbor: %pM, last_valid: %lu\n",
	305	orig_node->orig, neigh_node->addr,
	306	(neigh_node->last_valid / HZ));
	307
	308	neigh_purged = true;
9591a79f	309
f987ed6e	310	hlist_del_rcu(&neigh_node->list);
a4c135c5	311	bonding_candidate_del(orig_node, neigh_node);
44524fcd	312	neigh_node_free_ref(neigh_node);
c6c8fea2 SE	313	} else {
	314	if ((!*best_neigh_node) \|\|
	315	(neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
	316	*best_neigh_node = neigh_node;
	317	}
	318	}
f987ed6e ML	319
f987ed6e ML	320	spin_unlock_bh(&orig_node->neigh_list_lock);
c6c8fea2 SE	321	return neigh_purged;
	322	}
	323
	324	static bool purge_orig_node(struct bat_priv *bat_priv,
	325	struct orig_node *orig_node)
	326	{
	327	struct neigh_node *best_neigh_node;
	328
	329	if (time_after(jiffies,
	330	orig_node->last_valid + 2 * PURGE_TIMEOUT * HZ)) {
	331
	332	bat_dbg(DBG_BATMAN, bat_priv,
	333	"Originator timeout: originator %pM, last_valid %lu\n",
	334	orig_node->orig, (orig_node->last_valid / HZ));
	335	return true;
	336	} else {
	337	if (purge_orig_neighbors(bat_priv, orig_node,
	338	&best_neigh_node)) {
	339	update_routes(bat_priv, orig_node,
a73105b8	340	best_neigh_node);
c6c8fea2 SE	341	}
	342	}
	343
	344	return false;
	345	}
	346
	347	static void _purge_orig(struct bat_priv *bat_priv)
	348	{
	349	struct hashtable_t *hash = bat_priv->orig_hash;
7aadf889	350	struct hlist_node node, node_tmp;
c6c8fea2	351	struct hlist_head *head;
fb778ea1	352	spinlock_t list_lock; / spinlock to protect write access */
c6c8fea2 SE	353	struct orig_node *orig_node;
	354	int i;
	355
	356	if (!hash)
	357	return;
	358
c6c8fea2 SE	359	/* for all origins... */
	360	for (i = 0; i < hash->size; i++) {
	361	head = &hash->table[i];
fb778ea1	362	list_lock = &hash->list_locks[i];
c6c8fea2	363
fb778ea1	364	spin_lock_bh(list_lock);
7aadf889 ML	365	hlist_for_each_entry_safe(orig_node, node, node_tmp,
7aadf889 ML	366	head, hash_entry) {
c6c8fea2 SE	367	if (purge_orig_node(bat_priv, orig_node)) {
	368	if (orig_node->gw_flags)
	369	gw_node_delete(bat_priv, orig_node);
7aadf889	370	hlist_del_rcu(node);
7b36e8ee	371	orig_node_free_ref(orig_node);
fb778ea1	372	continue;
c6c8fea2 SE	373	}
	374
	375	if (time_after(jiffies, orig_node->last_frag_packet +
	376	msecs_to_jiffies(FRAG_TIMEOUT)))
	377	frag_list_free(&orig_node->frag_list);
	378	}
fb778ea1	379	spin_unlock_bh(list_lock);
c6c8fea2 SE	380	}
c6c8fea2 SE	381
c6c8fea2 SE	382	gw_node_purge(bat_priv);
	383	gw_election(bat_priv);
	384
	385	softif_neigh_purge(bat_priv);
	386	}
	387
	388	static void purge_orig(struct work_struct *work)
	389	{
	390	struct delayed_work *delayed_work =
	391	container_of(work, struct delayed_work, work);
	392	struct bat_priv *bat_priv =
	393	container_of(delayed_work, struct bat_priv, orig_work);
	394
	395	_purge_orig(bat_priv);
	396	start_purge_timer(bat_priv);
	397	}
	398
	399	void purge_orig_ref(struct bat_priv *bat_priv)
	400	{
	401	_purge_orig(bat_priv);
	402	}
	403
	404	int orig_seq_print_text(struct seq_file seq, void offset)
	405	{
	406	struct net_device net_dev = (struct net_device )seq->private;
	407	struct bat_priv *bat_priv = netdev_priv(net_dev);
	408	struct hashtable_t *hash = bat_priv->orig_hash;
7aadf889	409	struct hlist_node node, node_tmp;
c6c8fea2	410	struct hlist_head *head;
32ae9b22	411	struct hard_iface *primary_if;
c6c8fea2	412	struct orig_node *orig_node;
e1a5382f	413	struct neigh_node neigh_node, neigh_node_tmp;
c6c8fea2 SE	414	int batman_count = 0;
	415	int last_seen_secs;
	416	int last_seen_msecs;
32ae9b22 ML	417	int i, ret = 0;
	418
	419	primary_if = primary_if_get_selected(bat_priv);
c6c8fea2	420
32ae9b22 ML	421	if (!primary_if) {
	422	ret = seq_printf(seq, "BATMAN mesh %s disabled - "
	423	"please specify interfaces to enable it\n",
	424	net_dev->name);
	425	goto out;
	426	}
c6c8fea2	427
32ae9b22 ML	428	if (primary_if->if_status != IF_ACTIVE) {
	429	ret = seq_printf(seq, "BATMAN mesh %s "
	430	"disabled - primary interface not active\n",
	431	net_dev->name);
	432	goto out;
c6c8fea2 SE	433	}
c6c8fea2 SE	434
44c4349a SE	435	seq_printf(seq, "[B.A.T.M.A.N. adv %s, MainIF/MAC: %s/%pM (%s)]\n",
44c4349a SE	436	SOURCE_VERSION, primary_if->net_dev->name,
32ae9b22	437	primary_if->net_dev->dev_addr, net_dev->name);
c6c8fea2 SE	438	seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
	439	"Originator", "last-seen", "#", TQ_MAX_VALUE, "Nexthop",
	440	"outgoingIF", "Potential nexthops");
	441
c6c8fea2 SE	442	for (i = 0; i < hash->size; i++) {
	443	head = &hash->table[i];
	444
fb778ea1	445	rcu_read_lock();
7aadf889	446	hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
e1a5382f LL	447	neigh_node = orig_node_get_router(orig_node);
e1a5382f LL	448	if (!neigh_node)
c6c8fea2 SE	449	continue;
c6c8fea2 SE	450
e1a5382f LL	451	if (neigh_node->tq_avg == 0)
e1a5382f LL	452	goto next;
c6c8fea2 SE	453
	454	last_seen_secs = jiffies_to_msecs(jiffies -
	455	orig_node->last_valid) / 1000;
	456	last_seen_msecs = jiffies_to_msecs(jiffies -
	457	orig_node->last_valid) % 1000;
	458
c6c8fea2 SE	459	seq_printf(seq, "%pM %4i.%03is (%3i) %pM [%10s]:",
	460	orig_node->orig, last_seen_secs,
	461	last_seen_msecs, neigh_node->tq_avg,
	462	neigh_node->addr,
	463	neigh_node->if_incoming->net_dev->name);
	464
e1a5382f	465	hlist_for_each_entry_rcu(neigh_node_tmp, node_tmp,
f987ed6e	466	&orig_node->neigh_list, list) {
e1a5382f LL	467	seq_printf(seq, " %pM (%3i)",
	468	neigh_node_tmp->addr,
	469	neigh_node_tmp->tq_avg);
c6c8fea2 SE	470	}
	471
	472	seq_printf(seq, "\n");
	473	batman_count++;
e1a5382f LL	474
	475	next:
	476	neigh_node_free_ref(neigh_node);
c6c8fea2	477	}
fb778ea1	478	rcu_read_unlock();
c6c8fea2 SE	479	}
c6c8fea2 SE	480
e1a5382f	481	if (batman_count == 0)
c6c8fea2 SE	482	seq_printf(seq, "No batman nodes in range ...\n");
c6c8fea2 SE	483
32ae9b22 ML	484	out:
	485	if (primary_if)
	486	hardif_free_ref(primary_if);
	487	return ret;
c6c8fea2 SE	488	}
	489
	490	static int orig_node_add_if(struct orig_node *orig_node, int max_if_num)
	491	{
	492	void *data_ptr;
	493
	494	data_ptr = kmalloc(max_if_num * sizeof(unsigned long) * NUM_WORDS,
	495	GFP_ATOMIC);
	496	if (!data_ptr) {
	497	pr_err("Can't resize orig: out of memory\n");
	498	return -1;
	499	}
	500
	501	memcpy(data_ptr, orig_node->bcast_own,
	502	(max_if_num - 1) * sizeof(unsigned long) * NUM_WORDS);
	503	kfree(orig_node->bcast_own);
	504	orig_node->bcast_own = data_ptr;
	505
	506	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
	507	if (!data_ptr) {
	508	pr_err("Can't resize orig: out of memory\n");
	509	return -1;
	510	}
	511
	512	memcpy(data_ptr, orig_node->bcast_own_sum,
	513	(max_if_num - 1) * sizeof(uint8_t));
	514	kfree(orig_node->bcast_own_sum);
	515	orig_node->bcast_own_sum = data_ptr;
	516
	517	return 0;
	518	}
	519
e6c10f43	520	int orig_hash_add_if(struct hard_iface *hard_iface, int max_if_num)
c6c8fea2	521	{
e6c10f43	522	struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
c6c8fea2	523	struct hashtable_t *hash = bat_priv->orig_hash;
7aadf889	524	struct hlist_node *node;
c6c8fea2	525	struct hlist_head *head;
c6c8fea2	526	struct orig_node *orig_node;
2ae2daf6	527	int i, ret;
c6c8fea2 SE	528
	529	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	530	* if_num */
c6c8fea2 SE	531	for (i = 0; i < hash->size; i++) {
	532	head = &hash->table[i];
	533
fb778ea1	534	rcu_read_lock();
7aadf889	535	hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
2ae2daf6 ML	536	spin_lock_bh(&orig_node->ogm_cnt_lock);
	537	ret = orig_node_add_if(orig_node, max_if_num);
	538	spin_unlock_bh(&orig_node->ogm_cnt_lock);
	539
	540	if (ret == -1)
c6c8fea2 SE	541	goto err;
c6c8fea2 SE	542	}
fb778ea1	543	rcu_read_unlock();
c6c8fea2 SE	544	}
c6c8fea2 SE	545
c6c8fea2 SE	546	return 0;
	547
	548	err:
fb778ea1	549	rcu_read_unlock();
c6c8fea2 SE	550	return -ENOMEM;
	551	}
	552
	553	static int orig_node_del_if(struct orig_node *orig_node,
	554	int max_if_num, int del_if_num)
	555	{
	556	void *data_ptr = NULL;
	557	int chunk_size;
	558
	559	/* last interface was removed */
	560	if (max_if_num == 0)
	561	goto free_bcast_own;
	562
	563	chunk_size = sizeof(unsigned long) * NUM_WORDS;
	564	data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
	565	if (!data_ptr) {
	566	pr_err("Can't resize orig: out of memory\n");
	567	return -1;
	568	}
	569
	570	/* copy first part */
	571	memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
	572
	573	/* copy second part */
38e3c5f0	574	memcpy((char )data_ptr + del_if_num chunk_size,
c6c8fea2 SE	575	orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
	576	(max_if_num - del_if_num) * chunk_size);
	577
	578	free_bcast_own:
	579	kfree(orig_node->bcast_own);
	580	orig_node->bcast_own = data_ptr;
	581
	582	if (max_if_num == 0)
	583	goto free_own_sum;
	584
	585	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
	586	if (!data_ptr) {
	587	pr_err("Can't resize orig: out of memory\n");
	588	return -1;
	589	}
	590
	591	memcpy(data_ptr, orig_node->bcast_own_sum,
	592	del_if_num * sizeof(uint8_t));
	593
38e3c5f0	594	memcpy((char )data_ptr + del_if_num sizeof(uint8_t),
c6c8fea2 SE	595	orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
	596	(max_if_num - del_if_num) * sizeof(uint8_t));
	597
	598	free_own_sum:
	599	kfree(orig_node->bcast_own_sum);
	600	orig_node->bcast_own_sum = data_ptr;
	601
	602	return 0;
	603	}
	604
e6c10f43	605	int orig_hash_del_if(struct hard_iface *hard_iface, int max_if_num)
c6c8fea2	606	{
e6c10f43	607	struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
c6c8fea2	608	struct hashtable_t *hash = bat_priv->orig_hash;
7aadf889	609	struct hlist_node *node;
c6c8fea2	610	struct hlist_head *head;
e6c10f43	611	struct hard_iface *hard_iface_tmp;
c6c8fea2 SE	612	struct orig_node *orig_node;
	613	int i, ret;
	614
	615	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	616	* if_num */
c6c8fea2 SE	617	for (i = 0; i < hash->size; i++) {
	618	head = &hash->table[i];
	619
fb778ea1	620	rcu_read_lock();
7aadf889	621	hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
2ae2daf6	622	spin_lock_bh(&orig_node->ogm_cnt_lock);
c6c8fea2	623	ret = orig_node_del_if(orig_node, max_if_num,
e6c10f43	624	hard_iface->if_num);
2ae2daf6	625	spin_unlock_bh(&orig_node->ogm_cnt_lock);
c6c8fea2 SE	626
	627	if (ret == -1)
	628	goto err;
	629	}
fb778ea1	630	rcu_read_unlock();
c6c8fea2 SE	631	}
	632
	633	/* renumber remaining batman interfaces _inside_ of orig_hash_lock */
	634	rcu_read_lock();
e6c10f43 ML	635	list_for_each_entry_rcu(hard_iface_tmp, &hardif_list, list) {
e6c10f43 ML	636	if (hard_iface_tmp->if_status == IF_NOT_IN_USE)
c6c8fea2 SE	637	continue;
c6c8fea2 SE	638
e6c10f43	639	if (hard_iface == hard_iface_tmp)
c6c8fea2 SE	640	continue;
c6c8fea2 SE	641
e6c10f43	642	if (hard_iface->soft_iface != hard_iface_tmp->soft_iface)
c6c8fea2 SE	643	continue;
c6c8fea2 SE	644
e6c10f43 ML	645	if (hard_iface_tmp->if_num > hard_iface->if_num)
e6c10f43 ML	646	hard_iface_tmp->if_num--;
c6c8fea2 SE	647	}
	648	rcu_read_unlock();
	649
e6c10f43	650	hard_iface->if_num = -1;
c6c8fea2 SE	651	return 0;
	652
	653	err:
fb778ea1	654	rcu_read_unlock();
c6c8fea2 SE	655	return -ENOMEM;
c6c8fea2 SE	656	}