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