2015-04-23 11:16:35 +00:00
|
|
|
/* Copyright (C) 2007-2015 B.A.T.M.A.N. contributors:
|
2010-12-13 11:19:28 +00:00
|
|
|
*
|
|
|
|
* 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
|
2013-11-03 19:40:48 +00:00
|
|
|
* along with this program; if not, see <http://www.gnu.org/licenses/>.
|
2010-12-13 11:19:28 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
|
|
|
|
#define _NET_BATMAN_ADV_ORIGINATOR_H_
|
|
|
|
|
2015-04-17 17:40:28 +00:00
|
|
|
#include "main.h"
|
|
|
|
|
|
|
|
#include <linux/atomic.h>
|
|
|
|
#include <linux/compiler.h>
|
|
|
|
#include <linux/if_ether.h>
|
|
|
|
#include <linux/jhash.h>
|
|
|
|
#include <linux/rculist.h>
|
|
|
|
#include <linux/rcupdate.h>
|
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
|
2011-02-18 12:28:09 +00:00
|
|
|
#include "hash.h"
|
|
|
|
|
2015-04-17 17:40:28 +00:00
|
|
|
struct seq_file;
|
|
|
|
|
2013-09-02 10:15:02 +00:00
|
|
|
int batadv_compare_orig(const struct hlist_node *node, const void *data2);
|
2012-06-05 20:31:31 +00:00
|
|
|
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);
|
2013-09-02 10:15:02 +00:00
|
|
|
struct batadv_orig_node *batadv_orig_node_new(struct batadv_priv *bat_priv,
|
2015-05-26 16:34:26 +00:00
|
|
|
const u8 *addr);
|
2015-08-04 13:09:55 +00:00
|
|
|
struct batadv_hardif_neigh_node *
|
|
|
|
batadv_hardif_neigh_get(const struct batadv_hard_iface *hard_iface,
|
|
|
|
const u8 *neigh_addr);
|
|
|
|
void
|
|
|
|
batadv_hardif_neigh_free_ref(struct batadv_hardif_neigh_node *hardif_neigh);
|
2012-06-05 20:31:31 +00:00
|
|
|
struct batadv_neigh_node *
|
2015-07-25 20:59:15 +00:00
|
|
|
batadv_neigh_node_new(struct batadv_orig_node *orig_node,
|
|
|
|
struct batadv_hard_iface *hard_iface,
|
|
|
|
const u8 *neigh_addr);
|
2012-06-05 20:31:31 +00:00
|
|
|
void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node);
|
|
|
|
struct batadv_neigh_node *
|
2013-11-13 18:14:47 +00:00
|
|
|
batadv_orig_router_get(struct batadv_orig_node *orig_node,
|
|
|
|
const struct batadv_hard_iface *if_outgoing);
|
2013-11-13 18:14:46 +00:00
|
|
|
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);
|
2013-11-13 18:14:47 +00:00
|
|
|
|
2015-08-04 13:09:57 +00:00
|
|
|
int batadv_hardif_neigh_seq_print_text(struct seq_file *seq, void *offset);
|
|
|
|
|
2013-11-13 18:14:47 +00:00
|
|
|
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);
|
|
|
|
|
2012-05-12 00:09:34 +00:00
|
|
|
int batadv_orig_seq_print_text(struct seq_file *seq, void *offset);
|
2013-11-21 10:52:16 +00:00
|
|
|
int batadv_orig_hardif_seq_print_text(struct seq_file *seq, void *offset);
|
2012-06-05 20:31:31 +00:00
|
|
|
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);
|
2013-07-30 20:16:25 +00:00
|
|
|
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);
|
2010-12-13 11:19:28 +00:00
|
|
|
|
2012-05-12 00:09:43 +00:00
|
|
|
/* hashfunction to choose an entry in a hash table of given size
|
|
|
|
* hash algorithm from http://en.wikipedia.org/wiki/Hash_table
|
|
|
|
*/
|
2015-05-26 16:34:26 +00:00
|
|
|
static inline u32 batadv_choose_orig(const void *data, u32 size)
|
2010-12-13 11:19:28 +00:00
|
|
|
{
|
2015-05-26 16:34:26 +00:00
|
|
|
u32 hash = 0;
|
2010-12-13 11:19:28 +00:00
|
|
|
|
2015-03-01 08:46:18 +00:00
|
|
|
hash = jhash(data, ETH_ALEN, hash);
|
2010-12-13 11:19:28 +00:00
|
|
|
return hash % size;
|
|
|
|
}
|
|
|
|
|
2012-06-05 20:31:31 +00:00
|
|
|
static inline struct batadv_orig_node *
|
|
|
|
batadv_orig_hash_find(struct batadv_priv *bat_priv, const void *data)
|
2011-02-18 12:28:09 +00:00
|
|
|
{
|
2012-06-05 20:31:28 +00:00
|
|
|
struct batadv_hashtable *hash = bat_priv->orig_hash;
|
2011-02-18 12:28:09 +00:00
|
|
|
struct hlist_head *head;
|
2012-06-05 20:31:31 +00:00
|
|
|
struct batadv_orig_node *orig_node, *orig_node_tmp = NULL;
|
2011-02-18 12:28:09 +00:00
|
|
|
int index;
|
|
|
|
|
|
|
|
if (!hash)
|
|
|
|
return NULL;
|
|
|
|
|
2012-05-12 11:48:56 +00:00
|
|
|
index = batadv_choose_orig(data, hash->size);
|
2011-02-18 12:28:09 +00:00
|
|
|
head = &hash->table[index];
|
|
|
|
|
|
|
|
rcu_read_lock();
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 01:06:00 +00:00
|
|
|
hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
|
2012-05-12 11:48:58 +00:00
|
|
|
if (!batadv_compare_eth(orig_node, data))
|
2011-02-18 12:28:09 +00:00
|
|
|
continue;
|
|
|
|
|
2011-02-18 12:28:10 +00:00
|
|
|
if (!atomic_inc_not_zero(&orig_node->refcount))
|
|
|
|
continue;
|
|
|
|
|
2011-02-18 12:28:09 +00:00
|
|
|
orig_node_tmp = orig_node;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return orig_node_tmp;
|
|
|
|
}
|
|
|
|
|
2010-12-13 11:19:28 +00:00
|
|
|
#endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */
|