[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
 *
 */

/* increase the reference counter for this originator */

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

static void neigh_node_free_rcu(struct rcu_head *rcu)
{
	struct neigh_node *neigh_node;

	neigh_node = container_of(rcu, struct neigh_node, rcu);
	kfree(neigh_node);
}

void neigh_node_free_ref(struct neigh_node *neigh_node)
{
	if (atomic_dec_and_test(&neigh_node->refcount))
		call_rcu(&neigh_node->rcu, neigh_node_free_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,
				   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);
	hna_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, 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->hna_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->hna_buff,
				      orig_node->hna_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 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;

	if ((!bat_priv->primary_if) ||
	    (bat_priv->primary_if->if_status != IF_ACTIVE)) {
		if (!bat_priv->primary_if)
			return seq_printf(seq, "BATMAN mesh %s disabled - "
				     "please specify interfaces to enable it\n",
				     net_dev->name);

		return seq_printf(seq, "BATMAN mesh %s "
				  "disabled - primary interface not active\n",
				  net_dev->name);
	}

	seq_printf(seq, "[B.A.T.M.A.N. adv %s%s, MainIF/MAC: %s/%pM (%s)]\n",
		   SOURCE_VERSION, REVISION_VERSION_STR,
		   bat_priv->primary_if->net_dev->name,
		   bat_priv->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");

	return 0;
}

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