net/batman-adv/originator.h

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