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