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

/* Copyright (C) 2007-2014 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, see <http://www.gnu.org/licenses/>.
 */

#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_get(const struct batadv_orig_node *orig_node,
		      const struct batadv_hard_iface *hard_iface,
		      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_router_get(struct batadv_orig_node *orig_node,
		       const struct batadv_hard_iface *if_outgoing);
struct batadv_neigh_ifinfo *
batadv_neigh_ifinfo_new(struct batadv_neigh_node *neigh,
			struct batadv_hard_iface *if_outgoing);
struct batadv_neigh_ifinfo *
batadv_neigh_ifinfo_get(struct batadv_neigh_node *neigh,
			struct batadv_hard_iface *if_outgoing);
void batadv_neigh_ifinfo_free_ref(struct batadv_neigh_ifinfo *neigh_ifinfo);

struct batadv_orig_ifinfo *
batadv_orig_ifinfo_get(struct batadv_orig_node *orig_node,
		       struct batadv_hard_iface *if_outgoing);
struct batadv_orig_ifinfo *
batadv_orig_ifinfo_new(struct batadv_orig_node *orig_node,
		       struct batadv_hard_iface *if_outgoing);
void batadv_orig_ifinfo_free_ref(struct batadv_orig_ifinfo *orig_ifinfo);

int batadv_orig_seq_print_text(struct seq_file *seq, void *offset);
int batadv_orig_hardif_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
e19f9759	1	/* Copyright (C) 2007-2014 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
ebf38fb7	15	* along with this program; if not, see <http://www.gnu.org/licenses/>.
c6c8fea2 SE	16	*/
	17
	18	#ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
	19	#define _NET_BATMAN_ADV_ORIGINATOR_H_
	20
7aadf889 ML	21	#include "hash.h"
7aadf889 ML	22
bbad0a5e	23	int batadv_compare_orig(const struct hlist_node node, const void data2);
56303d34 SE	24	int batadv_originator_init(struct batadv_priv *bat_priv);
	25	void batadv_originator_free(struct batadv_priv *bat_priv);
	26	void batadv_purge_orig_ref(struct batadv_priv *bat_priv);
	27	void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node);
72822225	28	void batadv_orig_node_free_ref_now(struct batadv_orig_node *orig_node);
bbad0a5e	29	struct batadv_orig_node batadv_orig_node_new(struct batadv_priv bat_priv,
56303d34 SE	30	const uint8_t *addr);
56303d34 SE	31	struct batadv_neigh_node *
08bf0ed2 AQ	32	batadv_neigh_node_get(const struct batadv_orig_node *orig_node,
	33	const struct batadv_hard_iface *hard_iface,
	34	const uint8_t *addr);
	35	struct batadv_neigh_node *
56303d34	36	batadv_neigh_node_new(struct batadv_hard_iface *hard_iface,
0538f759 AQ	37	const uint8_t *neigh_addr,
0538f759 AQ	38	struct batadv_orig_node *orig_node);
56303d34 SE	39	void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node);
56303d34 SE	40	struct batadv_neigh_node *
7351a482 SW	41	batadv_orig_router_get(struct batadv_orig_node *orig_node,
7351a482 SW	42	const struct batadv_hard_iface *if_outgoing);
89652331 SW	43	struct batadv_neigh_ifinfo *
	44	batadv_neigh_ifinfo_new(struct batadv_neigh_node *neigh,
	45	struct batadv_hard_iface *if_outgoing);
	46	struct batadv_neigh_ifinfo *
	47	batadv_neigh_ifinfo_get(struct batadv_neigh_node *neigh,
	48	struct batadv_hard_iface *if_outgoing);
	49	void batadv_neigh_ifinfo_free_ref(struct batadv_neigh_ifinfo *neigh_ifinfo);
7351a482 SW	50
	51	struct batadv_orig_ifinfo *
	52	batadv_orig_ifinfo_get(struct batadv_orig_node *orig_node,
	53	struct batadv_hard_iface *if_outgoing);
	54	struct batadv_orig_ifinfo *
	55	batadv_orig_ifinfo_new(struct batadv_orig_node *orig_node,
	56	struct batadv_hard_iface *if_outgoing);
	57	void batadv_orig_ifinfo_free_ref(struct batadv_orig_ifinfo *orig_ifinfo);
	58
7d211efc	59	int batadv_orig_seq_print_text(struct seq_file seq, void offset);
cb1c92ec	60	int batadv_orig_hardif_seq_print_text(struct seq_file seq, void offset);
56303d34 SE	61	int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
	62	int max_if_num);
	63	int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
	64	int max_if_num);
7ea7b4a1 AQ	65	struct batadv_orig_node_vlan *
	66	batadv_orig_node_vlan_new(struct batadv_orig_node *orig_node,
	67	unsigned short vid);
	68	struct batadv_orig_node_vlan *
	69	batadv_orig_node_vlan_get(struct batadv_orig_node *orig_node,
	70	unsigned short vid);
	71	void batadv_orig_node_vlan_free_ref(struct batadv_orig_node_vlan *orig_vlan);
c6c8fea2	72
9cfc7bd6 SE	73	/* hashfunction to choose an entry in a hash table of given size
	74	* hash algorithm from http://en.wikipedia.org/wiki/Hash_table
	75	*/
da641193	76	static inline uint32_t batadv_choose_orig(const void *data, uint32_t size)
c6c8fea2	77	{
747e4221	78	const unsigned char *key = data;
c6c8fea2 SE	79	uint32_t hash = 0;
	80	size_t i;
	81
	82	for (i = 0; i < 6; i++) {
	83	hash += key[i];
	84	hash += (hash << 10);
	85	hash ^= (hash >> 6);
	86	}
	87
	88	hash += (hash << 3);
	89	hash ^= (hash >> 11);
	90	hash += (hash << 15);
	91
	92	return hash % size;
	93	}
	94
56303d34 SE	95	static inline struct batadv_orig_node *
56303d34 SE	96	batadv_orig_hash_find(struct batadv_priv bat_priv, const void data)
7aadf889	97	{
5bf74e9c	98	struct batadv_hashtable *hash = bat_priv->orig_hash;
7aadf889	99	struct hlist_head *head;
56303d34	100	struct batadv_orig_node orig_node, orig_node_tmp = NULL;
7aadf889 ML	101	int index;
	102
	103	if (!hash)
	104	return NULL;
	105
da641193	106	index = batadv_choose_orig(data, hash->size);
7aadf889 ML	107	head = &hash->table[index];
	108
	109	rcu_read_lock();
b67bfe0d	110	hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
1eda58bf	111	if (!batadv_compare_eth(orig_node, data))
7aadf889 ML	112	continue;
7aadf889 ML	113
7b36e8ee ML	114	if (!atomic_inc_not_zero(&orig_node->refcount))
	115	continue;
	116
7aadf889	117	orig_node_tmp = orig_node;
7aadf889 ML	118	break;
	119	}
	120	rcu_read_unlock();
	121
	122	return orig_node_tmp;
	123	}
	124
c6c8fea2	125	#endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */