[net-next-2.6.git] / drivers / staging / batman-adv / originator.c

/*
 * Copyright (C) 2009-2010 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 "hard-interface.h"

static DECLARE_DELAYED_WORK(purge_orig_wq, purge_orig);

static void start_purge_timer(void)
{
	queue_delayed_work(bat_event_workqueue, &purge_orig_wq, 1 * HZ);
}

int originator_init(void)
{
	unsigned long flags;
	if (orig_hash)
		return 1;

	spin_lock_irqsave(&orig_hash_lock, flags);
	orig_hash = hash_new(128, compare_orig, choose_orig);

	if (!orig_hash)
		goto err;

	spin_unlock_irqrestore(&orig_hash_lock, flags);
	start_purge_timer();
	return 1;

err:
	spin_unlock_irqrestore(&orig_hash_lock, flags);
	return 0;
}

struct neigh_node *
create_neighbor(struct orig_node *orig_node, struct orig_node *orig_neigh_node,
		uint8_t *neigh, struct batman_if *if_incoming)
{
	/* FIXME: each orig_node->batman_if will be attached to a softif */
	struct bat_priv *bat_priv = netdev_priv(soft_device);
	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_LIST_HEAD(&neigh_node->list);

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

	list_add_tail(&neigh_node->list, &orig_node->neigh_list);
	return neigh_node;
}

static void free_orig_node(void *data)
{
	struct list_head *list_pos, *list_pos_tmp;
	struct neigh_node *neigh_node;
	struct orig_node *orig_node = (struct orig_node *)data;

	/* for all neighbors towards this originator ... */
	list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
		neigh_node = list_entry(list_pos, struct neigh_node, list);

		list_del(list_pos);
		kfree(neigh_node);
	}

	hna_global_del_orig(orig_node, "originator timed out");

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

void originator_free(void)
{
	unsigned long flags;

	if (!orig_hash)
		return;

	cancel_delayed_work_sync(&purge_orig_wq);

	spin_lock_irqsave(&orig_hash_lock, flags);
	hash_delete(orig_hash, free_orig_node);
	orig_hash = NULL;
	spin_unlock_irqrestore(&orig_hash_lock, flags);
}

/* this function finds or creates an originator entry for the given
 * address if it does not exits */
struct orig_node *get_orig_node(uint8_t *addr)
{
	/* FIXME: each batman_if will be attached to a softif */
	struct bat_priv *bat_priv = netdev_priv(soft_device);
	struct orig_node *orig_node;
	struct hashtable_t *swaphash;
	int size;

	orig_node = ((struct orig_node *)hash_find(orig_hash, addr));

	if (orig_node != NULL)
		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_LIST_HEAD(&orig_node->neigh_list);

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

	size = bat_priv->num_ifaces * sizeof(TYPE_OF_WORD) * 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);
	if (!orig_node->bcast_own_sum)
		goto free_bcast_own;

	if (hash_add(orig_hash, orig_node) < 0)
		goto free_bcast_own_sum;

	if (orig_hash->elements * 4 > orig_hash->size) {
		swaphash = hash_resize(orig_hash, orig_hash->size * 2);

		if (swaphash == NULL)
			bat_err(soft_device,
				"Couldn't resize orig hash table\n");
		else
			orig_hash = swaphash;
	}

	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 orig_node *orig_node,
				 struct neigh_node **best_neigh_node)
{
	/* FIXME: each orig_node->batman_if will be attached to a softif */
	struct bat_priv *bat_priv = netdev_priv(soft_device);
	struct list_head *list_pos, *list_pos_tmp;
	struct neigh_node *neigh_node;
	bool neigh_purged = false;

	*best_neigh_node = NULL;

	/* for all neighbors towards this originator ... */
	list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
		neigh_node = list_entry(list_pos, struct neigh_node, list);

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

			if (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->dev);
			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;
			list_del(list_pos);
			kfree(neigh_node);
		} else {
			if ((*best_neigh_node == NULL) ||
			    (neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
				*best_neigh_node = neigh_node;
		}
	}
	return neigh_purged;
}

static bool purge_orig_node(struct orig_node *orig_node)
{
	/* FIXME: each batman_if will be attached to a softif */
	struct bat_priv *bat_priv = netdev_priv(soft_device);
	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(orig_node, &best_neigh_node)) {
			update_routes(orig_node, best_neigh_node,
				      orig_node->hna_buff,
				      orig_node->hna_buff_len);
			/* update bonding candidates, we could have lost
			 * some candidates. */
			update_bonding_candidates(bat_priv, orig_node);
		}
	}

	return false;
}

void purge_orig(struct work_struct *work)
{
	HASHIT(hashit);
	struct orig_node *orig_node;
	unsigned long flags;

	spin_lock_irqsave(&orig_hash_lock, flags);

	/* for all origins... */
	while (hash_iterate(orig_hash, &hashit)) {
		orig_node = hashit.bucket->data;
		if (purge_orig_node(orig_node)) {
			hash_remove_bucket(orig_hash, &hashit);
			free_orig_node(orig_node);
		}
	}

	spin_unlock_irqrestore(&orig_hash_lock, flags);

	/* if work == NULL we were not called by the timer
	 * and thus do not need to re-arm the timer */
	if (work)
		start_purge_timer();
}

int orig_seq_print_text(struct seq_file *seq, void *offset)
{
	HASHIT(hashit);
	struct net_device *net_dev = (struct net_device *)seq->private;
	struct bat_priv *bat_priv = netdev_priv(net_dev);
	struct orig_node *orig_node;
	struct neigh_node *neigh_node;
	int batman_count = 0;
	int last_seen_secs;
	int last_seen_msecs;
	unsigned long flags;
	char orig_str[ETH_STR_LEN], router_str[ETH_STR_LEN];

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

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

	spin_lock_irqsave(&orig_hash_lock, flags);

	while (hash_iterate(orig_hash, &hashit)) {

		orig_node = hashit.bucket->data;

		if (!orig_node->router)
			continue;

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

		addr_to_string(orig_str, orig_node->orig);
		addr_to_string(router_str, orig_node->router->addr);
		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, "%-17s %4i.%03is   (%3i) %17s [%10s]:",
			   orig_str, last_seen_secs, last_seen_msecs,
			   orig_node->router->tq_avg, router_str,
			   orig_node->router->if_incoming->dev);

		list_for_each_entry(neigh_node, &orig_node->neigh_list, list) {
			addr_to_string(orig_str, neigh_node->addr);
			seq_printf(seq, " %17s (%3i)", orig_str,
					   neigh_node->tq_avg);
		}

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

	spin_unlock_irqrestore(&orig_hash_lock, flags);

	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(TYPE_OF_WORD) * 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(TYPE_OF_WORD) * 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 batman_if *batman_if, int max_if_num)
{
	struct orig_node *orig_node;
	unsigned long flags;
	HASHIT(hashit);

	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	 * if_num */
	spin_lock_irqsave(&orig_hash_lock, flags);

	while (hash_iterate(orig_hash, &hashit)) {
		orig_node = hashit.bucket->data;

		if (orig_node_add_if(orig_node, max_if_num) == -1)
			goto err;
	}

	spin_unlock_irqrestore(&orig_hash_lock, flags);
	return 0;

err:
	spin_unlock_irqrestore(&orig_hash_lock, flags);
	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(TYPE_OF_WORD) * 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,
	       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,
	       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 batman_if *batman_if, int max_if_num)
{
	struct batman_if *batman_if_tmp;
	struct orig_node *orig_node;
	unsigned long flags;
	HASHIT(hashit);
	int ret;

	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	 * if_num */
	spin_lock_irqsave(&orig_hash_lock, flags);

	while (hash_iterate(orig_hash, &hashit)) {
		orig_node = hashit.bucket->data;

		ret = orig_node_del_if(orig_node, max_if_num,
				       batman_if->if_num);

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

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

		if (batman_if == batman_if_tmp)
			continue;

		if (batman_if_tmp->if_num > batman_if->if_num)
			batman_if_tmp->if_num--;
	}
	rcu_read_unlock();

	batman_if->if_num = -1;
	spin_unlock_irqrestore(&orig_hash_lock, flags);
	return 0;

err:
	spin_unlock_irqrestore(&orig_hash_lock, flags);
	return -ENOMEM;
}
Commit	Line	Data
8a2e042c	1	/*
9b6d10b7	2	* Copyright (C) 2009-2010 B.A.T.M.A.N. contributors:
8a2e042c AL	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"
14741240	29	#include "hard-interface.h"
8a2e042c AL	30
	31	static DECLARE_DELAYED_WORK(purge_orig_wq, purge_orig);
	32
	33	static void start_purge_timer(void)
	34	{
	35	queue_delayed_work(bat_event_workqueue, &purge_orig_wq, 1 * HZ);
	36	}
	37
	38	int originator_init(void)
	39	{
e7017195	40	unsigned long flags;
8a2e042c AL	41	if (orig_hash)
	42	return 1;
	43
e7017195	44	spin_lock_irqsave(&orig_hash_lock, flags);
8a2e042c AL	45	orig_hash = hash_new(128, compare_orig, choose_orig);
	46
	47	if (!orig_hash)
	48	goto err;
	49
e7017195	50	spin_unlock_irqrestore(&orig_hash_lock, flags);
8a2e042c AL	51	start_purge_timer();
	52	return 1;
	53
	54	err:
e7017195	55	spin_unlock_irqrestore(&orig_hash_lock, flags);
8a2e042c AL	56	return 0;
	57	}
	58
8a2e042c AL	59	struct neigh_node *
	60	create_neighbor(struct orig_node orig_node, struct orig_node orig_neigh_node,
	61	uint8_t neigh, struct batman_if if_incoming)
	62	{
84ec0864 ML	63	/* FIXME: each orig_node->batman_if will be attached to a softif */
84ec0864 ML	64	struct bat_priv *bat_priv = netdev_priv(soft_device);
8a2e042c AL	65	struct neigh_node *neigh_node;
8a2e042c AL	66
84ec0864 ML	67	bat_dbg(DBG_BATMAN, bat_priv,
84ec0864 ML	68	"Creating new last-hop neighbor of originator\n");
8a2e042c	69
abad5446	70	neigh_node = kzalloc(sizeof(struct neigh_node), GFP_ATOMIC);
c4bf05d3 SW	71	if (!neigh_node)
	72	return NULL;
	73
8a2e042c AL	74	INIT_LIST_HEAD(&neigh_node->list);
	75
	76	memcpy(neigh_node->addr, neigh, ETH_ALEN);
	77	neigh_node->orig_node = orig_neigh_node;
	78	neigh_node->if_incoming = if_incoming;
	79
	80	list_add_tail(&neigh_node->list, &orig_node->neigh_list);
	81	return neigh_node;
	82	}
	83
42fa1b92	84	static void free_orig_node(void *data)
8a2e042c AL	85	{
	86	struct list_head list_pos, list_pos_tmp;
	87	struct neigh_node *neigh_node;
	88	struct orig_node orig_node = (struct orig_node )data;
	89
5ea84fa3	90	/* for all neighbors towards this originator ... */
8a2e042c AL	91	list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
	92	neigh_node = list_entry(list_pos, struct neigh_node, list);
	93
	94	list_del(list_pos);
	95	kfree(neigh_node);
	96	}
	97
	98	hna_global_del_orig(orig_node, "originator timed out");
	99
	100	kfree(orig_node->bcast_own);
	101	kfree(orig_node->bcast_own_sum);
	102	kfree(orig_node);
	103	}
	104
42fa1b92 SE	105	void originator_free(void)
	106	{
	107	unsigned long flags;
	108
	109	if (!orig_hash)
	110	return;
	111
	112	cancel_delayed_work_sync(&purge_orig_wq);
	113
	114	spin_lock_irqsave(&orig_hash_lock, flags);
	115	hash_delete(orig_hash, free_orig_node);
	116	orig_hash = NULL;
	117	spin_unlock_irqrestore(&orig_hash_lock, flags);
	118	}
	119
8a2e042c AL	120	/* this function finds or creates an originator entry for the given
	121	* address if it does not exits */
	122	struct orig_node get_orig_node(uint8_t addr)
	123	{
208e13e4 ML	124	/* FIXME: each batman_if will be attached to a softif */
208e13e4 ML	125	struct bat_priv *bat_priv = netdev_priv(soft_device);
8a2e042c AL	126	struct orig_node *orig_node;
8a2e042c AL	127	struct hashtable_t *swaphash;
8a2e042c AL	128	int size;
	129
	130	orig_node = ((struct orig_node *)hash_find(orig_hash, addr));
	131
	132	if (orig_node != NULL)
	133	return orig_node;
	134
84ec0864 ML	135	bat_dbg(DBG_BATMAN, bat_priv,
84ec0864 ML	136	"Creating new originator: %pM\n", addr);
8a2e042c	137
abad5446	138	orig_node = kzalloc(sizeof(struct orig_node), GFP_ATOMIC);
c4bf05d3 SW	139	if (!orig_node)
	140	return NULL;
	141
8a2e042c AL	142	INIT_LIST_HEAD(&orig_node->neigh_list);
	143
	144	memcpy(orig_node->orig, addr, ETH_ALEN);
	145	orig_node->router = NULL;
8a2e042c	146	orig_node->hna_buff = NULL;
6d45d8df SE	147	orig_node->bcast_seqno_reset = jiffies - 1
	148	- msecs_to_jiffies(RESET_PROTECTION_MS);
	149	orig_node->batman_seqno_reset = jiffies - 1
	150	- msecs_to_jiffies(RESET_PROTECTION_MS);
8a2e042c	151
208e13e4	152	size = bat_priv->num_ifaces * sizeof(TYPE_OF_WORD) * NUM_WORDS;
8a2e042c	153
abad5446	154	orig_node->bcast_own = kzalloc(size, GFP_ATOMIC);
c4bf05d3 SW	155	if (!orig_node->bcast_own)
	156	goto free_orig_node;
	157
208e13e4	158	size = bat_priv->num_ifaces * sizeof(uint8_t);
abad5446	159	orig_node->bcast_own_sum = kzalloc(size, GFP_ATOMIC);
c4bf05d3 SW	160	if (!orig_node->bcast_own_sum)
	161	goto free_bcast_own;
	162
c4bf05d3 SW	163	if (hash_add(orig_hash, orig_node) < 0)
c4bf05d3 SW	164	goto free_bcast_own_sum;
8a2e042c AL	165
	166	if (orig_hash->elements * 4 > orig_hash->size) {
	167	swaphash = hash_resize(orig_hash, orig_hash->size * 2);
	168
	169	if (swaphash == NULL)
c1641862 SE	170	bat_err(soft_device,
c1641862 SE	171	"Couldn't resize orig hash table\n");
8a2e042c AL	172	else
	173	orig_hash = swaphash;
	174	}
	175
	176	return orig_node;
c4bf05d3 SW	177	free_bcast_own_sum:
	178	kfree(orig_node->bcast_own_sum);
	179	free_bcast_own:
	180	kfree(orig_node->bcast_own);
	181	free_orig_node:
	182	kfree(orig_node);
	183	return NULL;
8a2e042c AL	184	}
8a2e042c AL	185
5ea84fa3	186	static bool purge_orig_neighbors(struct orig_node *orig_node,
8a2e042c AL	187	struct neigh_node **best_neigh_node)
8a2e042c AL	188	{
84ec0864 ML	189	/* FIXME: each orig_node->batman_if will be attached to a softif */
84ec0864 ML	190	struct bat_priv *bat_priv = netdev_priv(soft_device);
8a2e042c	191	struct list_head list_pos, list_pos_tmp;
8a2e042c AL	192	struct neigh_node *neigh_node;
	193	bool neigh_purged = false;
	194
	195	*best_neigh_node = NULL;
	196
5ea84fa3	197	/* for all neighbors towards this originator ... */
8a2e042c AL	198	list_for_each_safe(list_pos, list_pos_tmp, &orig_node->neigh_list) {
	199	neigh_node = list_entry(list_pos, struct neigh_node, list);
	200
208e13e4	201	if ((time_after(jiffies,
b6be4535	202	neigh_node->last_valid + PURGE_TIMEOUT * HZ)) \|\|
208e13e4 ML	203	(neigh_node->if_incoming->if_status ==
	204	IF_TO_BE_REMOVED)) {
	205
	206	if (neigh_node->if_incoming->if_status ==
	207	IF_TO_BE_REMOVED)
84ec0864	208	bat_dbg(DBG_BATMAN, bat_priv,
6d45d8df SE	209	"neighbor purge: originator %pM, "
6d45d8df SE	210	"neighbor: %pM, iface: %s\n",
208e13e4 ML	211	orig_node->orig, neigh_node->addr,
	212	neigh_node->if_incoming->dev);
	213	else
84ec0864	214	bat_dbg(DBG_BATMAN, bat_priv,
6d45d8df SE	215	"neighbor timeout: originator %pM, "
6d45d8df SE	216	"neighbor: %pM, last_valid: %lu\n",
208e13e4 ML	217	orig_node->orig, neigh_node->addr,
208e13e4 ML	218	(neigh_node->last_valid / HZ));
8a2e042c AL	219
	220	neigh_purged = true;
	221	list_del(list_pos);
	222	kfree(neigh_node);
	223	} else {
	224	if ((*best_neigh_node == NULL) \|\|
	225	(neigh_node->tq_avg > (*best_neigh_node)->tq_avg))
	226	*best_neigh_node = neigh_node;
	227	}
	228	}
	229	return neigh_purged;
	230	}
	231
8a2e042c AL	232	static bool purge_orig_node(struct orig_node *orig_node)
8a2e042c AL	233	{
e35fd5ec SW	234	/* FIXME: each batman_if will be attached to a softif */
e35fd5ec SW	235	struct bat_priv *bat_priv = netdev_priv(soft_device);
8a2e042c	236	struct neigh_node *best_neigh_node;
8a2e042c AL	237
8a2e042c AL	238	if (time_after(jiffies,
b6be4535	239	orig_node->last_valid + 2 * PURGE_TIMEOUT * HZ)) {
8a2e042c	240
84ec0864	241	bat_dbg(DBG_BATMAN, bat_priv,
b9b27e4e AL	242	"Originator timeout: originator %pM, last_valid %lu\n",
b9b27e4e AL	243	orig_node->orig, (orig_node->last_valid / HZ));
8a2e042c AL	244	return true;
8a2e042c AL	245	} else {
e35fd5ec	246	if (purge_orig_neighbors(orig_node, &best_neigh_node)) {
8a2e042c AL	247	update_routes(orig_node, best_neigh_node,
	248	orig_node->hna_buff,
	249	orig_node->hna_buff_len);
e35fd5ec SW	250	/* update bonding candidates, we could have lost
	251	* some candidates. */
	252	update_bonding_candidates(bat_priv, orig_node);
	253	}
8a2e042c	254	}
14741240	255
8a2e042c AL	256	return false;
	257	}
	258
	259	void purge_orig(struct work_struct *work)
	260	{
b6c35976	261	HASHIT(hashit);
8a2e042c	262	struct orig_node *orig_node;
e7017195	263	unsigned long flags;
8a2e042c	264
e7017195	265	spin_lock_irqsave(&orig_hash_lock, flags);
8a2e042c AL	266
8a2e042c AL	267	/* for all origins... */
b6c35976 SW	268	while (hash_iterate(orig_hash, &hashit)) {
b6c35976 SW	269	orig_node = hashit.bucket->data;
8a2e042c	270	if (purge_orig_node(orig_node)) {
b6c35976	271	hash_remove_bucket(orig_hash, &hashit);
8a2e042c AL	272	free_orig_node(orig_node);
	273	}
	274	}
	275
e7017195	276	spin_unlock_irqrestore(&orig_hash_lock, flags);
8a2e042c	277
208e13e4 ML	278	/* if work == NULL we were not called by the timer
	279	* and thus do not need to re-arm the timer */
	280	if (work)
	281	start_purge_timer();
8a2e042c AL	282	}
8a2e042c AL	283
4caecbc0	284	int orig_seq_print_text(struct seq_file seq, void offset)
47fdf097 ML	285	{
47fdf097 ML	286	HASHIT(hashit);
4caecbc0	287	struct net_device net_dev = (struct net_device )seq->private;
208e13e4	288	struct bat_priv *bat_priv = netdev_priv(net_dev);
47fdf097 ML	289	struct orig_node *orig_node;
47fdf097 ML	290	struct neigh_node *neigh_node;
4caecbc0	291	int batman_count = 0;
80f6c34b LL	292	int last_seen_secs;
80f6c34b LL	293	int last_seen_msecs;
47fdf097 ML	294	unsigned long flags;
	295	char orig_str[ETH_STR_LEN], router_str[ETH_STR_LEN];
	296
4caecbc0 SE	297	if ((!bat_priv->primary_if) \|\|
	298	(bat_priv->primary_if->if_status != IF_ACTIVE)) {
	299	if (!bat_priv->primary_if)
	300	return seq_printf(seq, "BATMAN mesh %s disabled - "
6d45d8df SE	301	"please specify interfaces to enable it\n",
6d45d8df SE	302	net_dev->name);
14741240	303
4caecbc0 SE	304	return seq_printf(seq, "BATMAN mesh %s "
	305	"disabled - primary interface not active\n",
	306	net_dev->name);
14741240 ML	307	}
14741240 ML	308
208e13e4	309	rcu_read_lock();
80f6c34b LL	310	seq_printf(seq, "[B.A.T.M.A.N. adv %s%s, MainIF/MAC: %s/%s (%s)]\n",
80f6c34b LL	311	SOURCE_VERSION, REVISION_VERSION_STR,
208e13e4	312	bat_priv->primary_if->dev, bat_priv->primary_if->addr_str,
14741240	313	net_dev->name);
80f6c34b LL	314	seq_printf(seq, " %-15s %s (%s/%i) %17s [%10s]: %20s ...\n",
	315	"Originator", "last-seen", "#", TQ_MAX_VALUE, "Nexthop",
	316	"outgoingIF", "Potential nexthops");
47fdf097 ML	317	rcu_read_unlock();
47fdf097 ML	318
47fdf097 ML	319	spin_lock_irqsave(&orig_hash_lock, flags);
	320
	321	while (hash_iterate(orig_hash, &hashit)) {
	322
	323	orig_node = hashit.bucket->data;
	324
	325	if (!orig_node->router)
	326	continue;
	327
	328	if (orig_node->router->tq_avg == 0)
	329	continue;
	330
47fdf097 ML	331	addr_to_string(orig_str, orig_node->orig);
47fdf097 ML	332	addr_to_string(router_str, orig_node->router->addr);
80f6c34b LL	333	last_seen_secs = jiffies_to_msecs(jiffies -
	334	orig_node->last_valid) / 1000;
	335	last_seen_msecs = jiffies_to_msecs(jiffies -
	336	orig_node->last_valid) % 1000;
	337
	338	seq_printf(seq, "%-17s %4i.%03is (%3i) %17s [%10s]:",
	339	orig_str, last_seen_secs, last_seen_msecs,
	340	orig_node->router->tq_avg, router_str,
4caecbc0	341	orig_node->router->if_incoming->dev);
47fdf097 ML	342
	343	list_for_each_entry(neigh_node, &orig_node->neigh_list, list) {
	344	addr_to_string(orig_str, neigh_node->addr);
4caecbc0	345	seq_printf(seq, " %17s (%3i)", orig_str,
47fdf097 ML	346	neigh_node->tq_avg);
	347	}
	348
4caecbc0	349	seq_printf(seq, "\n");
47fdf097	350	batman_count++;
47fdf097 ML	351	}
	352
	353	spin_unlock_irqrestore(&orig_hash_lock, flags);
	354
4caecbc0 SE	355	if ((batman_count == 0))
4caecbc0 SE	356	seq_printf(seq, "No batman nodes in range ...\n");
47fdf097	357
4caecbc0	358	return 0;
47fdf097	359	}
8a2e042c	360
208e13e4 ML	361	static int orig_node_add_if(struct orig_node *orig_node, int max_if_num)
	362	{
	363	void *data_ptr;
	364
	365	data_ptr = kmalloc(max_if_num * sizeof(TYPE_OF_WORD) * NUM_WORDS,
	366	GFP_ATOMIC);
	367	if (!data_ptr) {
c1641862	368	pr_err("Can't resize orig: out of memory\n");
208e13e4 ML	369	return -1;
	370	}
	371
	372	memcpy(data_ptr, orig_node->bcast_own,
	373	(max_if_num - 1) * sizeof(TYPE_OF_WORD) * NUM_WORDS);
	374	kfree(orig_node->bcast_own);
	375	orig_node->bcast_own = data_ptr;
	376
	377	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
	378	if (!data_ptr) {
c1641862	379	pr_err("Can't resize orig: out of memory\n");
208e13e4 ML	380	return -1;
	381	}
	382
	383	memcpy(data_ptr, orig_node->bcast_own_sum,
	384	(max_if_num - 1) * sizeof(uint8_t));
	385	kfree(orig_node->bcast_own_sum);
	386	orig_node->bcast_own_sum = data_ptr;
	387
	388	return 0;
	389	}
	390
	391	int orig_hash_add_if(struct batman_if *batman_if, int max_if_num)
	392	{
	393	struct orig_node *orig_node;
9abc1023	394	unsigned long flags;
208e13e4 ML	395	HASHIT(hashit);
	396
	397	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	398	* if_num */
9abc1023	399	spin_lock_irqsave(&orig_hash_lock, flags);
208e13e4 ML	400
	401	while (hash_iterate(orig_hash, &hashit)) {
	402	orig_node = hashit.bucket->data;
	403
	404	if (orig_node_add_if(orig_node, max_if_num) == -1)
	405	goto err;
	406	}
	407
9abc1023	408	spin_unlock_irqrestore(&orig_hash_lock, flags);
208e13e4 ML	409	return 0;
	410
	411	err:
9abc1023	412	spin_unlock_irqrestore(&orig_hash_lock, flags);
208e13e4 ML	413	return -ENOMEM;
	414	}
	415
	416	static int orig_node_del_if(struct orig_node *orig_node,
	417	int max_if_num, int del_if_num)
	418	{
	419	void *data_ptr = NULL;
	420	int chunk_size;
	421
	422	/* last interface was removed */
	423	if (max_if_num == 0)
	424	goto free_bcast_own;
	425
	426	chunk_size = sizeof(TYPE_OF_WORD) * NUM_WORDS;
	427	data_ptr = kmalloc(max_if_num * chunk_size, GFP_ATOMIC);
	428	if (!data_ptr) {
c1641862	429	pr_err("Can't resize orig: out of memory\n");
208e13e4 ML	430	return -1;
	431	}
	432
	433	/* copy first part */
	434	memcpy(data_ptr, orig_node->bcast_own, del_if_num * chunk_size);
	435
	436	/* copy second part */
	437	memcpy(data_ptr,
	438	orig_node->bcast_own + ((del_if_num + 1) * chunk_size),
	439	(max_if_num - del_if_num) * chunk_size);
	440
	441	free_bcast_own:
	442	kfree(orig_node->bcast_own);
	443	orig_node->bcast_own = data_ptr;
	444
	445	if (max_if_num == 0)
	446	goto free_own_sum;
	447
	448	data_ptr = kmalloc(max_if_num * sizeof(uint8_t), GFP_ATOMIC);
	449	if (!data_ptr) {
c1641862	450	pr_err("Can't resize orig: out of memory\n");
208e13e4 ML	451	return -1;
	452	}
	453
	454	memcpy(data_ptr, orig_node->bcast_own_sum,
	455	del_if_num * sizeof(uint8_t));
	456
	457	memcpy(data_ptr,
	458	orig_node->bcast_own_sum + ((del_if_num + 1) * sizeof(uint8_t)),
	459	(max_if_num - del_if_num) * sizeof(uint8_t));
	460
	461	free_own_sum:
	462	kfree(orig_node->bcast_own_sum);
	463	orig_node->bcast_own_sum = data_ptr;
	464
	465	return 0;
	466	}
	467
	468	int orig_hash_del_if(struct batman_if *batman_if, int max_if_num)
	469	{
	470	struct batman_if *batman_if_tmp;
	471	struct orig_node *orig_node;
9abc1023	472	unsigned long flags;
208e13e4 ML	473	HASHIT(hashit);
	474	int ret;
	475
	476	/* resize all orig nodes because orig_node->bcast_own(_sum) depend on
	477	* if_num */
9abc1023	478	spin_lock_irqsave(&orig_hash_lock, flags);
208e13e4 ML	479
	480	while (hash_iterate(orig_hash, &hashit)) {
	481	orig_node = hashit.bucket->data;
	482
	483	ret = orig_node_del_if(orig_node, max_if_num,
	484	batman_if->if_num);
	485
	486	if (ret == -1)
	487	goto err;
	488	}
	489
	490	/* renumber remaining batman interfaces _inside_ of orig_hash_lock */
	491	rcu_read_lock();
	492	list_for_each_entry_rcu(batman_if_tmp, &if_list, list) {
	493	if (batman_if_tmp->if_status == IF_NOT_IN_USE)
	494	continue;
	495
	496	if (batman_if == batman_if_tmp)
	497	continue;
	498
	499	if (batman_if_tmp->if_num > batman_if->if_num)
	500	batman_if_tmp->if_num--;
	501	}
	502	rcu_read_unlock();
	503
	504	batman_if->if_num = -1;
9abc1023	505	spin_unlock_irqrestore(&orig_hash_lock, flags);
208e13e4 ML	506	return 0;
	507
	508	err:
9abc1023	509	spin_unlock_irqrestore(&orig_hash_lock, flags);
208e13e4 ML	510	return -ENOMEM;
208e13e4 ML	511	}