2 * Copyright (C) 2006-2009 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
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)
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
, uint16_t last_seqno
,
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
);
35 /* shift the packet array by n places. */
36 void bit_shift(TYPE_OF_WORD
*seq_bits
, int32_t n
);
39 /* receive and process one packet, returns 1 if received seq_num is considered
41 char bit_get_packet(TYPE_OF_WORD
*seq_bits
, int16_t seq_num_diff
,
44 /* count the hamming weight, how many good packets did we receive? */
45 int bit_packet_count(TYPE_OF_WORD
*seq_bits
);