[linux-2.6-block.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);
}

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(struct 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->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(struct 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);

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

	orig_node->bat_priv = bat_priv;
	memcpy(orig_node->orig, addr, ETH_ALEN);
	orig_node->router = NULL;
	orig_node->tt_buff = NULL;
	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,
				      orig_node->tt_buff,
				      orig_node->tt_buff_len);
		}
	}

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