originator.h 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105
  1. /* Copyright (C) 2007-2013 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, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  17. * 02110-1301, USA
  18. */
  19. #ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
  20. #define _NET_BATMAN_ADV_ORIGINATOR_H_
  21. #include "hash.h"
  22. int batadv_originator_init(struct batadv_priv *bat_priv);
  23. void batadv_originator_free(struct batadv_priv *bat_priv);
  24. void batadv_purge_orig_ref(struct batadv_priv *bat_priv);
  25. void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node);
  26. void batadv_orig_node_free_ref_now(struct batadv_orig_node *orig_node);
  27. struct batadv_orig_node *batadv_get_orig_node(struct batadv_priv *bat_priv,
  28. const uint8_t *addr);
  29. struct batadv_neigh_node *
  30. batadv_neigh_node_new(struct batadv_hard_iface *hard_iface,
  31. const uint8_t *neigh_addr,
  32. struct batadv_orig_node *orig_node);
  33. void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node);
  34. struct batadv_neigh_node *
  35. batadv_orig_node_get_router(struct batadv_orig_node *orig_node);
  36. int batadv_orig_seq_print_text(struct seq_file *seq, void *offset);
  37. int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface,
  38. int max_if_num);
  39. int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface,
  40. int max_if_num);
  41. struct batadv_orig_node_vlan *
  42. batadv_orig_node_vlan_new(struct batadv_orig_node *orig_node,
  43. unsigned short vid);
  44. struct batadv_orig_node_vlan *
  45. batadv_orig_node_vlan_get(struct batadv_orig_node *orig_node,
  46. unsigned short vid);
  47. void batadv_orig_node_vlan_free_ref(struct batadv_orig_node_vlan *orig_vlan);
  48. /* hashfunction to choose an entry in a hash table of given size
  49. * hash algorithm from http://en.wikipedia.org/wiki/Hash_table
  50. */
  51. static inline uint32_t batadv_choose_orig(const void *data, uint32_t size)
  52. {
  53. const unsigned char *key = data;
  54. uint32_t hash = 0;
  55. size_t i;
  56. for (i = 0; i < 6; i++) {
  57. hash += key[i];
  58. hash += (hash << 10);
  59. hash ^= (hash >> 6);
  60. }
  61. hash += (hash << 3);
  62. hash ^= (hash >> 11);
  63. hash += (hash << 15);
  64. return hash % size;
  65. }
  66. static inline struct batadv_orig_node *
  67. batadv_orig_hash_find(struct batadv_priv *bat_priv, const void *data)
  68. {
  69. struct batadv_hashtable *hash = bat_priv->orig_hash;
  70. struct hlist_head *head;
  71. struct batadv_orig_node *orig_node, *orig_node_tmp = NULL;
  72. int index;
  73. if (!hash)
  74. return NULL;
  75. index = batadv_choose_orig(data, hash->size);
  76. head = &hash->table[index];
  77. rcu_read_lock();
  78. hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
  79. if (!batadv_compare_eth(orig_node, data))
  80. continue;
  81. if (!atomic_inc_not_zero(&orig_node->refcount))
  82. continue;
  83. orig_node_tmp = orig_node;
  84. break;
  85. }
  86. rcu_read_unlock();
  87. return orig_node_tmp;
  88. }
  89. #endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */