originator.h 4.5 KB
Newer Older
1
/* Copyright (C) 2007-2017  B.A.T.M.A.N. contributors:
2 3 4 5 6 7 8 9 10 11 12 13 14
 *
 * 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
15
 * along with this program; if not, see <http://www.gnu.org/licenses/>.
16 17 18 19 20
 */

#ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
#define _NET_BATMAN_ADV_ORIGINATOR_H_

21 22 23 24 25
#include "main.h"

#include <linux/compiler.h>
#include <linux/if_ether.h>
#include <linux/jhash.h>
26
#include <linux/kref.h>
27 28 29 30 31
#include <linux/rculist.h>
#include <linux/rcupdate.h>
#include <linux/stddef.h>
#include <linux/types.h>

32 33
#include "hash.h"

34
struct netlink_callback;
35
struct seq_file;
36
struct sk_buff;
37

38
bool batadv_compare_orig(const struct hlist_node *node, const void *data2);
39 40 41
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);
42
void batadv_orig_node_put(struct batadv_orig_node *orig_node);
43
struct batadv_orig_node *batadv_orig_node_new(struct batadv_priv *bat_priv,
44
					      const u8 *addr);
45 46 47 48
struct batadv_hardif_neigh_node *
batadv_hardif_neigh_get(const struct batadv_hard_iface *hard_iface,
			const u8 *neigh_addr);
void
49
batadv_hardif_neigh_put(struct batadv_hardif_neigh_node *hardif_neigh);
50
struct batadv_neigh_node *
51 52 53
batadv_neigh_node_get_or_create(struct batadv_orig_node *orig_node,
				struct batadv_hard_iface *hard_iface,
				const u8 *neigh_addr);
54
void batadv_neigh_node_put(struct batadv_neigh_node *neigh_node);
55
struct batadv_neigh_node *
56 57
batadv_orig_router_get(struct batadv_orig_node *orig_node,
		       const struct batadv_hard_iface *if_outgoing);
58 59 60 61 62 63
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);
64
void batadv_neigh_ifinfo_put(struct batadv_neigh_ifinfo *neigh_ifinfo);
65

66
int batadv_hardif_neigh_dump(struct sk_buff *msg, struct netlink_callback *cb);
67 68
int batadv_hardif_neigh_seq_print_text(struct seq_file *seq, void *offset);

69 70 71 72 73 74
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);
75
void batadv_orig_ifinfo_put(struct batadv_orig_ifinfo *orig_ifinfo);
76

77
int batadv_orig_seq_print_text(struct seq_file *seq, void *offset);
78
int batadv_orig_dump(struct sk_buff *msg, struct netlink_callback *cb);
79
int batadv_orig_hardif_seq_print_text(struct seq_file *seq, void *offset);
80 81 82 83
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);
84 85 86 87 88 89
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);
90
void batadv_orig_node_vlan_put(struct batadv_orig_node_vlan *orig_vlan);
91

92 93 94
/* hashfunction to choose an entry in a hash table of given size
 * hash algorithm from http://en.wikipedia.org/wiki/Hash_table
 */
95
static inline u32 batadv_choose_orig(const void *data, u32 size)
96
{
97
	u32 hash = 0;
98

99
	hash = jhash(data, ETH_ALEN, hash);
100 101 102
	return hash % size;
}

103 104
static inline struct batadv_orig_node *
batadv_orig_hash_find(struct batadv_priv *bat_priv, const void *data)
105
{
106
	struct batadv_hashtable *hash = bat_priv->orig_hash;
107
	struct hlist_head *head;
108
	struct batadv_orig_node *orig_node, *orig_node_tmp = NULL;
109 110 111 112 113
	int index;

	if (!hash)
		return NULL;

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

	rcu_read_lock();
118
	hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
119
		if (!batadv_compare_eth(orig_node, data))
120 121
			continue;

122
		if (!kref_get_unless_zero(&orig_node->refcount))
123 124
			continue;

125 126 127 128 129 130 131 132
		orig_node_tmp = orig_node;
		break;
	}
	rcu_read_unlock();

	return orig_node_tmp;
}

133
#endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */