2
* Copyright (C) 2010 Red Hat, Inc. All rights reserved.
4
* This file is part of LVM2.
6
* This copyrighted material is made available to anyone wishing to use,
7
* modify, copy, or redistribute it subject to the terms and conditions
8
* of the GNU General Public License v.2.
10
* You should have received a copy of the GNU General Public License
11
* along with this program; if not, write to the Free Software Foundation,
12
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
15
#include "libdevmapper.h"
16
#include <CUnit/CUnit.h>
18
int bitset_init(void);
19
int bitset_fini(void);
25
static struct dm_pool *mem;
27
int bitset_init(void) {
28
mem = dm_pool_create("bitset test", 1024);
32
int bitset_fini(void) {
37
static void test_get_next(void)
39
int i, j, last = 0, first;
40
dm_bitset_t bs = dm_bitset_create(mem, NR_BITS);
42
for (i = 0; i < NR_BITS; i++)
43
CU_ASSERT(!dm_bit(bs, i));
45
for (i = 0, j = 1; i < NR_BITS; i += j, j++)
49
for (i = 0, j = 1; i < NR_BITS; i += j, j++) {
51
last = dm_bit_get_first(bs);
54
last = dm_bit_get_next(bs, last);
59
CU_ASSERT(dm_bit_get_next(bs, last) == -1);
62
static void bit_flip(dm_bitset_t bs, int bit)
64
int old = dm_bit(bs, bit);
66
dm_bit_clear(bs, bit);
71
static void test_equal(void)
73
dm_bitset_t bs1 = dm_bitset_create(mem, NR_BITS);
74
dm_bitset_t bs2 = dm_bitset_create(mem, NR_BITS);
77
for (i = 0, j = 1; i < NR_BITS; i += j, j++) {
82
CU_ASSERT(dm_bitset_equal(bs1, bs2));
83
CU_ASSERT(dm_bitset_equal(bs2, bs1));
85
for (i = 0; i < NR_BITS; i++) {
87
CU_ASSERT(!dm_bitset_equal(bs1, bs2));
88
CU_ASSERT(!dm_bitset_equal(bs2, bs1));
90
CU_ASSERT(dm_bitset_equal(bs1, bs1)); /* comparing with self */
95
static void test_and(void)
97
dm_bitset_t bs1 = dm_bitset_create(mem, NR_BITS);
98
dm_bitset_t bs2 = dm_bitset_create(mem, NR_BITS);
99
dm_bitset_t bs3 = dm_bitset_create(mem, NR_BITS);
102
for (i = 0, j = 1; i < NR_BITS; i += j, j++) {
107
dm_bit_and(bs3, bs1, bs2);
109
CU_ASSERT(dm_bitset_equal(bs1, bs2));
110
CU_ASSERT(dm_bitset_equal(bs1, bs3));
111
CU_ASSERT(dm_bitset_equal(bs2, bs3));
113
dm_bit_clear_all(bs1);
114
dm_bit_clear_all(bs2);
116
for (i = 0; i < NR_BITS; i++) {
123
dm_bit_and(bs3, bs1, bs2);
124
for (i = 0; i < NR_BITS; i++)
125
CU_ASSERT(!dm_bit(bs3, i));
128
CU_TestInfo bitset_list[] = {
129
{ (char*)"get_next", test_get_next },
130
{ (char*)"equal", test_equal },
131
{ (char*)"and", test_and },