2 * Copyright (C) 2006-2012 B.A.T.M.A.N. contributors:
4 * Simon Wunderlich, Marek Lindner
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.
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.
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
22 #ifndef _NET_BATMAN_ADV_BITARRAY_H_
23 #define _NET_BATMAN_ADV_BITARRAY_H_
25 #define WORD_BIT_SIZE (sizeof(unsigned long) * 8)
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 int get_bit_status(const unsigned long *seq_bits
, uint32_t last_seqno
,
32 /* turn corresponding bit on, so we can remember that we got the packet */
33 void bit_mark(unsigned long *seq_bits
, int32_t n
);
36 /* receive and process one packet, returns 1 if received seq_num is considered
38 int bit_get_packet(void *priv
, unsigned long *seq_bits
,
39 int32_t seq_num_diff
, int set_mark
);
41 /* count the hamming weight, how many good packets did we receive? */
42 int bit_packet_count(const unsigned long *seq_bits
);
44 #endif /* _NET_BATMAN_ADV_BITARRAY_H_ */