b4e1705417
char was used in different places to store information without really using the characteristics of that data type or by ignoring the fact that char has not a well defined signedness. Signed-off-by: Sven Eckelmann <sven@narfation.org>
44 lines
1.6 KiB
C
44 lines
1.6 KiB
C
/*
|
|
* Copyright (C) 2006-2011 B.A.T.M.A.N. contributors:
|
|
*
|
|
* Simon Wunderlich, Marek Lindner
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of version 2 of the GNU General Public
|
|
* License as published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful, but
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
* 02110-1301, USA
|
|
*
|
|
*/
|
|
|
|
#ifndef _NET_BATMAN_ADV_BITARRAY_H_
|
|
#define _NET_BATMAN_ADV_BITARRAY_H_
|
|
|
|
#define WORD_BIT_SIZE (sizeof(unsigned long) * 8)
|
|
|
|
/* returns true if the corresponding bit in the given seq_bits indicates true
|
|
* and curr_seqno is within range of last_seqno */
|
|
int get_bit_status(const unsigned long *seq_bits, uint32_t last_seqno,
|
|
uint32_t curr_seqno);
|
|
|
|
/* turn corresponding bit on, so we can remember that we got the packet */
|
|
void bit_mark(unsigned long *seq_bits, int32_t n);
|
|
|
|
|
|
/* receive and process one packet, returns 1 if received seq_num is considered
|
|
* new, 0 if old */
|
|
int bit_get_packet(void *priv, unsigned long *seq_bits,
|
|
int32_t seq_num_diff, int set_mark);
|
|
|
|
/* count the hamming weight, how many good packets did we receive? */
|
|
int bit_packet_count(const unsigned long *seq_bits);
|
|
|
|
#endif /* _NET_BATMAN_ADV_BITARRAY_H_ */
|