blob: 88e5c6049243001ac7d11dd25895b3770bf78d27 [file] [log] [blame]
Sven Eckelmannc6c8fea2010-12-13 11:19:28 +00001/*
Sven Eckelmann64afe352011-01-27 10:38:15 +01002 * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
Sven Eckelmannc6c8fea2010-12-13 11:19:28 +00003 *
4 * Marek Lindner, Simon Wunderlich
5 *
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.
9 *
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.
14 *
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
19 *
20 */
21
22#ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
23#define _NET_BATMAN_ADV_ORIGINATOR_H_
24
25int originator_init(struct bat_priv *bat_priv);
26void originator_free(struct bat_priv *bat_priv);
27void purge_orig_ref(struct bat_priv *bat_priv);
28struct orig_node *get_orig_node(struct bat_priv *bat_priv, uint8_t *addr);
Marek Lindnera8e7f4b2010-12-12 21:57:10 +000029struct neigh_node *create_neighbor(struct orig_node *orig_node,
30 struct orig_node *orig_neigh_node,
31 uint8_t *neigh,
32 struct batman_if *if_incoming);
33void neigh_node_free_ref(struct kref *refcount);
Sven Eckelmannc6c8fea2010-12-13 11:19:28 +000034int orig_seq_print_text(struct seq_file *seq, void *offset);
35int orig_hash_add_if(struct batman_if *batman_if, int max_if_num);
36int orig_hash_del_if(struct batman_if *batman_if, int max_if_num);
37
38
39/* returns 1 if they are the same originator */
40static inline int compare_orig(void *data1, void *data2)
41{
42 return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
43}
44
45/* hashfunction to choose an entry in a hash table of given size */
46/* hash algorithm from http://en.wikipedia.org/wiki/Hash_table */
47static inline int choose_orig(void *data, int32_t size)
48{
49 unsigned char *key = data;
50 uint32_t hash = 0;
51 size_t i;
52
53 for (i = 0; i < 6; i++) {
54 hash += key[i];
55 hash += (hash << 10);
56 hash ^= (hash >> 6);
57 }
58
59 hash += (hash << 3);
60 hash ^= (hash >> 11);
61 hash += (hash << 15);
62
63 return hash % size;
64}
65
66#endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */