drivers/staging/batman-adv/bitarray.h

   1 /*
   2  * Copyright (C) 2006-2010 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
  22
  23 /* you should choose something big, if you don't want to waste cpu */
  24 #define TYPE_OF_WORD unsigned long
  25 #define WORD_BIT_SIZE (sizeof(TYPE_OF_WORD) * 8)
  26
  27 /* returns true if the corresponding bit in the given seq_bits indicates true
  28  * and curr_seqno is within range of last_seqno */
  29 uint8_t get_bit_status(TYPE_OF_WORD *seq_bits, uint32_t last_seqno,
  30                                            uint32_t curr_seqno);
  31
  32 /* turn corresponding bit on, so we can remember that we got the packet */
  33 void bit_mark(TYPE_OF_WORD *seq_bits, int32_t n);
  34
  35
  36 /* receive and process one packet, returns 1 if received seq_num is considered
  37  * new, 0 if old  */
  38 char bit_get_packet(TYPE_OF_WORD *seq_bits, int32_t seq_num_diff,
  39                                         int8_t set_mark);
  40
  41 /* count the hamming weight, how many good packets did we receive? */
  42 int  bit_packet_count(TYPE_OF_WORD *seq_bits);