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

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

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

	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;
	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) {
			if (!orig_node->router)
				continue;

			if (orig_node->router->tq_avg == 0)
				continue;

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

			neigh_node = orig_node->router;
			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, node_tmp,
						 &orig_node->neigh_list, list) {
				seq_printf(seq, " %pM (%3i)", neigh_node->addr,
						neigh_node->tq_avg);
			}

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