4 * This file is part of BeRTOS.
6 * Bertos is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 * As a special exception, you may use this file as part of a free software
21 * library without restriction. Specifically, if other files instantiate
22 * templates or use macros or inline functions from this file, or you compile
23 * this file and link it with other files to produce an executable, this
24 * file does not by itself cause the resulting executable to be covered by
25 * the GNU General Public License. This exception does not however
26 * invalidate any other reasons why the executable file might be covered by
27 * the GNU General Public License.
29 * Copyright 2010 Develer S.r.l. (http://www.develer.com/)
33 * \brief Bitarray test
35 * \author Daniele Basile <asterix@develer.com>
38 #include <struct/bitarray.h>
40 #include <cfg/compiler.h>
42 #include <cfg/debug.h>
49 ALLOC_BITARRAY(test1, TEST1_LEN);
50 ALLOC_BITARRAY(test2, TEST2_LEN);
53 int bitarray_testSetup(void)
59 int bitarray_testRun(void)
61 memset(test1, 0xaa, sizeof(test1));
63 bitarray_dump(test1, TEST1_LEN);
64 for (size_t i = 0; i < TEST1_LEN; i++)
66 if (!((bool)(i % 2) == bitarray_check(i, test1, TEST1_LEN)))
70 memset(test1, 0, sizeof(test1));
71 for (size_t i = 0; i < TEST1_LEN; i++)
74 bitarray_clear(i, test1, TEST1_LEN);
76 bitarray_set(i, test1, TEST1_LEN);
79 bitarray_dump(test1, TEST1_LEN);
80 for (size_t i = 0; i < TEST1_LEN; i++)
82 if (!((bool)(i % 2) == bitarray_check(i, test1, TEST1_LEN)))
86 memset(test1, 0, sizeof(test1));
87 bitarray_set(0, test1, TEST1_LEN);
88 bitarray_dump(test1, TEST1_LEN);
89 if (!bitarray_check(0, test1, TEST1_LEN))
92 memset(test1, 0, sizeof(test1));
93 bitarray_set(TEST1_LEN, test1, TEST1_LEN);
94 bitarray_dump(test1, TEST1_LEN);
95 if (!bitarray_check(TEST1_LEN, test1, TEST1_LEN))
99 memset(test2, 0xFF, sizeof(test2));
100 bitarray_dump(test2, TEST2_LEN);
101 if (!bitarray_full(test2, TEST2_LEN))
104 memset(test2, 0xFF, sizeof(test2));
105 bitarray_clear(5, test2, TEST2_LEN);
106 bitarray_dump(test2, TEST2_LEN);
107 if (bitarray_full(test2, TEST2_LEN))
110 memset(test2, 0xFF, sizeof(test2));
111 bitarray_clear(13, test2, TEST2_LEN);
112 bitarray_dump(test2, TEST2_LEN);
113 if (bitarray_full(test2, TEST2_LEN))
123 int bitarray_testTearDown(void)