originator.h 2.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
  1. /*
  2. * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
  3. *
  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. #ifndef _NET_BATMAN_ADV_ORIGINATOR_H_
  22. #define _NET_BATMAN_ADV_ORIGINATOR_H_
  23. int originator_init(struct bat_priv *bat_priv);
  24. void originator_free(struct bat_priv *bat_priv);
  25. void purge_orig_ref(struct bat_priv *bat_priv);
  26. struct orig_node *get_orig_node(struct bat_priv *bat_priv, uint8_t *addr);
  27. struct neigh_node *create_neighbor(struct orig_node *orig_node,
  28. struct orig_node *orig_neigh_node,
  29. uint8_t *neigh,
  30. struct batman_if *if_incoming);
  31. void neigh_node_free_ref(struct kref *refcount);
  32. int orig_seq_print_text(struct seq_file *seq, void *offset);
  33. int orig_hash_add_if(struct batman_if *batman_if, int max_if_num);
  34. int orig_hash_del_if(struct batman_if *batman_if, int max_if_num);
  35. /* returns 1 if they are the same originator */
  36. static inline int compare_orig(void *data1, void *data2)
  37. {
  38. return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
  39. }
  40. /* hashfunction to choose an entry in a hash table of given size */
  41. /* hash algorithm from http://en.wikipedia.org/wiki/Hash_table */
  42. static inline int choose_orig(void *data, int32_t size)
  43. {
  44. unsigned char *key = data;
  45. uint32_t hash = 0;
  46. size_t i;
  47. for (i = 0; i < 6; i++) {
  48. hash += key[i];
  49. hash += (hash << 10);
  50. hash ^= (hash >> 6);
  51. }
  52. hash += (hash << 3);
  53. hash ^= (hash >> 11);
  54. hash += (hash << 15);
  55. return hash % size;
  56. }
  57. #endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */