bitarray.h 1.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445
  1. /*
  2. * Copyright (C) 2006-2012 B.A.T.M.A.N. contributors:
  3. *
  4. * Simon Wunderlich, Marek Lindner
  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_BITARRAY_H_
  22. #define _NET_BATMAN_ADV_BITARRAY_H_
  23. #define WORD_BIT_SIZE (sizeof(unsigned long) * 8)
  24. /* returns true if the corresponding bit in the given seq_bits indicates true
  25. * and curr_seqno is within range of last_seqno */
  26. int get_bit_status(const unsigned long *seq_bits, uint32_t last_seqno,
  27. uint32_t curr_seqno);
  28. /* turn corresponding bit on, so we can remember that we got the packet */
  29. void bit_mark(unsigned long *seq_bits, int32_t n);
  30. /* receive and process one packet, returns 1 if received seq_num is considered
  31. * new, 0 if old */
  32. int bit_get_packet(void *priv, unsigned long *seq_bits,
  33. int32_t seq_num_diff, int set_mark);
  34. /* count the hamming weight, how many good packets did we receive? */
  35. int bit_packet_count(const unsigned long *seq_bits);
  36. #endif /* _NET_BATMAN_ADV_BITARRAY_H_ */