si4713-i2c: avoid potential buffer overflow on si4713
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / net / batman-adv / originator.h
blob5cc011057da1a8f2f89ebb7782d9aa79cb6983b2
1 /*
2 * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
4 * Marek Lindner, Simon Wunderlich
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.
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.
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
22 #ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
23 #define _NET_BATMAN_ADV_ORIGINATOR_H_
25 #include "hash.h"
27 int originator_init(struct bat_priv *bat_priv);
28 void originator_free(struct bat_priv *bat_priv);
29 void purge_orig_ref(struct bat_priv *bat_priv);
30 void orig_node_free_ref(struct orig_node *orig_node);
31 struct orig_node *get_orig_node(struct bat_priv *bat_priv, uint8_t *addr);
32 struct neigh_node *create_neighbor(struct orig_node *orig_node,
33 struct orig_node *orig_neigh_node,
34 uint8_t *neigh,
35 struct hard_iface *if_incoming);
36 void neigh_node_free_ref(struct neigh_node *neigh_node);
37 int orig_seq_print_text(struct seq_file *seq, void *offset);
38 int orig_hash_add_if(struct hard_iface *hard_iface, int max_if_num);
39 int orig_hash_del_if(struct hard_iface *hard_iface, int max_if_num);
42 /* returns 1 if they are the same originator */
43 static inline int compare_orig(struct hlist_node *node, void *data2)
45 void *data1 = container_of(node, struct orig_node, hash_entry);
47 return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
50 /* hashfunction to choose an entry in a hash table of given size */
51 /* hash algorithm from http://en.wikipedia.org/wiki/Hash_table */
52 static inline int choose_orig(void *data, int32_t size)
54 unsigned char *key = data;
55 uint32_t hash = 0;
56 size_t i;
58 for (i = 0; i < 6; i++) {
59 hash += key[i];
60 hash += (hash << 10);
61 hash ^= (hash >> 6);
64 hash += (hash << 3);
65 hash ^= (hash >> 11);
66 hash += (hash << 15);
68 return hash % size;
71 static inline struct orig_node *orig_hash_find(struct bat_priv *bat_priv,
72 void *data)
74 struct hashtable_t *hash = bat_priv->orig_hash;
75 struct hlist_head *head;
76 struct hlist_node *node;
77 struct orig_node *orig_node, *orig_node_tmp = NULL;
78 int index;
80 if (!hash)
81 return NULL;
83 index = choose_orig(data, hash->size);
84 head = &hash->table[index];
86 rcu_read_lock();
87 hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
88 if (!compare_eth(orig_node, data))
89 continue;
91 if (!atomic_inc_not_zero(&orig_node->refcount))
92 continue;
94 orig_node_tmp = orig_node;
95 break;
97 rcu_read_unlock();
99 return orig_node_tmp;
102 #endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */