[mirror_ubuntu-bionic-kernel.git] / net / batman-adv / originator.h

/* Copyright (C) 2007-2013 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
 */

#ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
#define _NET_BATMAN_ADV_ORIGINATOR_H_

#include "hash.h"

int batadv_compare_orig(const struct hlist_node *node, const void *data2);
int batadv_originator_init(struct batadv_priv *bat_priv);
void batadv_originator_free(struct batadv_priv *bat_priv);
void batadv_purge_orig_ref(struct batadv_priv *bat_priv);
void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node);
void batadv_orig_node_free_ref_now(struct batadv_orig_node *orig_node);
struct batadv_orig_node *batadv_orig_node_new(struct batadv_priv *bat_priv,
					      const uint8_t *addr);
struct batadv_neigh_node *
batadv_neigh_node_new(struct batadv_hard_iface *hard_iface,
		      const uint8_t *neigh_addr,
		      struct batadv_orig_node *orig_node);
void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node);
struct batadv_neigh_node *
batadv_orig_node_get_router(struct batadv_orig_node *orig_node);
int batadv_orig_seq_print_text(struct seq_file *seq, void *offset);
int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
			    int max_if_num);
int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
			    int max_if_num);
struct batadv_orig_node_vlan *
batadv_orig_node_vlan_new(struct batadv_orig_node *orig_node,
			  unsigned short vid);
struct batadv_orig_node_vlan *
batadv_orig_node_vlan_get(struct batadv_orig_node *orig_node,
			  unsigned short vid);
void batadv_orig_node_vlan_free_ref(struct batadv_orig_node_vlan *orig_vlan);


/* hashfunction to choose an entry in a hash table of given size
 * hash algorithm from http://en.wikipedia.org/wiki/Hash_table
 */
static inline uint32_t batadv_choose_orig(const void *data, uint32_t size)
{
	const unsigned char *key = data;
	uint32_t hash = 0;
	size_t i;

	for (i = 0; i < 6; i++) {
		hash += key[i];
		hash += (hash << 10);
		hash ^= (hash >> 6);
	}

	hash += (hash << 3);
	hash ^= (hash >> 11);
	hash += (hash << 15);

	return hash % size;
}

static inline struct batadv_orig_node *
batadv_orig_hash_find(struct batadv_priv *bat_priv, const void *data)
{
	struct batadv_hashtable *hash = bat_priv->orig_hash;
	struct hlist_head *head;
	struct batadv_orig_node *orig_node, *orig_node_tmp = NULL;
	int index;

	if (!hash)
		return NULL;

	index = batadv_choose_orig(data, hash->size);
	head = &hash->table[index];

	rcu_read_lock();
	hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
		if (!batadv_compare_eth(orig_node, data))
			continue;

		if (!atomic_inc_not_zero(&orig_node->refcount))
			continue;

		orig_node_tmp = orig_node;
		break;
	}
	rcu_read_unlock();

	return orig_node_tmp;
}

#endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */
Commit	Line	Data
0b873931	1	/* Copyright (C) 2007-2013 B.A.T.M.A.N. contributors:
c6c8fea2 SE	2	*
	3	* Marek Lindner, Simon Wunderlich
	4	*
	5	* This program is free software; you can redistribute it and/or
	6	* modify it under the terms of version 2 of the GNU General Public
	7	* License as published by the Free Software Foundation.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
	17	* 02110-1301, USA
c6c8fea2 SE	18	*/
	19
	20	#ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
	21	#define _NET_BATMAN_ADV_ORIGINATOR_H_
	22
7aadf889 ML	23	#include "hash.h"
7aadf889 ML	24
bbad0a5e	25	int batadv_compare_orig(const struct hlist_node node, const void data2);
56303d34 SE	26	int batadv_originator_init(struct batadv_priv *bat_priv);
	27	void batadv_originator_free(struct batadv_priv *bat_priv);
	28	void batadv_purge_orig_ref(struct batadv_priv *bat_priv);
	29	void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node);
72822225	30	void batadv_orig_node_free_ref_now(struct batadv_orig_node *orig_node);
bbad0a5e	31	struct batadv_orig_node batadv_orig_node_new(struct batadv_priv bat_priv,
56303d34 SE	32	const uint8_t *addr);
	33	struct batadv_neigh_node *
	34	batadv_neigh_node_new(struct batadv_hard_iface *hard_iface,
0538f759 AQ	35	const uint8_t *neigh_addr,
0538f759 AQ	36	struct batadv_orig_node *orig_node);
56303d34 SE	37	void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node);
	38	struct batadv_neigh_node *
	39	batadv_orig_node_get_router(struct batadv_orig_node *orig_node);
7d211efc	40	int batadv_orig_seq_print_text(struct seq_file seq, void offset);
56303d34 SE	41	int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
	42	int max_if_num);
	43	int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
	44	int max_if_num);
7ea7b4a1 AQ	45	struct batadv_orig_node_vlan *
	46	batadv_orig_node_vlan_new(struct batadv_orig_node *orig_node,
	47	unsigned short vid);
	48	struct batadv_orig_node_vlan *
	49	batadv_orig_node_vlan_get(struct batadv_orig_node *orig_node,
	50	unsigned short vid);
	51	void batadv_orig_node_vlan_free_ref(struct batadv_orig_node_vlan *orig_vlan);
c6c8fea2 SE	52
c6c8fea2 SE	53
9cfc7bd6 SE	54	/* hashfunction to choose an entry in a hash table of given size
	55	* hash algorithm from http://en.wikipedia.org/wiki/Hash_table
	56	*/
da641193	57	static inline uint32_t batadv_choose_orig(const void *data, uint32_t size)
c6c8fea2	58	{
747e4221	59	const unsigned char *key = data;
c6c8fea2 SE	60	uint32_t hash = 0;
	61	size_t i;
	62
	63	for (i = 0; i < 6; i++) {
	64	hash += key[i];
	65	hash += (hash << 10);
	66	hash ^= (hash >> 6);
	67	}
	68
	69	hash += (hash << 3);
	70	hash ^= (hash >> 11);
	71	hash += (hash << 15);
	72
	73	return hash % size;
	74	}
	75
56303d34 SE	76	static inline struct batadv_orig_node *
56303d34 SE	77	batadv_orig_hash_find(struct batadv_priv bat_priv, const void data)
7aadf889	78	{
5bf74e9c	79	struct batadv_hashtable *hash = bat_priv->orig_hash;
7aadf889	80	struct hlist_head *head;
56303d34	81	struct batadv_orig_node orig_node, orig_node_tmp = NULL;
7aadf889 ML	82	int index;
	83
	84	if (!hash)
	85	return NULL;
	86
da641193	87	index = batadv_choose_orig(data, hash->size);
7aadf889 ML	88	head = &hash->table[index];
	89
	90	rcu_read_lock();
b67bfe0d	91	hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
1eda58bf	92	if (!batadv_compare_eth(orig_node, data))
7aadf889 ML	93	continue;
7aadf889 ML	94
7b36e8ee ML	95	if (!atomic_inc_not_zero(&orig_node->refcount))
	96	continue;
	97
7aadf889	98	orig_node_tmp = orig_node;
7aadf889 ML	99	break;
	100	}
	101	rcu_read_unlock();
	102
	103	return orig_node_tmp;
	104	}
	105
c6c8fea2	106	#endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */