1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
/*
* Copyright (C) 2013 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "UniquePtr.h"
#include "bit_vector.h"
#include "gtest/gtest.h"
namespace art {
TEST(BitVector, Test) {
const size_t kBits = 32;
BitVector bv(kBits, false, Allocator::GetMallocAllocator());
EXPECT_EQ(1U, bv.GetStorageSize());
EXPECT_EQ(sizeof(uint32_t), bv.GetSizeOf());
EXPECT_FALSE(bv.IsExpandable());
EXPECT_EQ(0U, bv.NumSetBits());
EXPECT_EQ(0U, bv.NumSetBits(0));
EXPECT_EQ(0U, bv.NumSetBits(kBits - 1));
for (size_t i = 0; i < kBits; i++) {
EXPECT_FALSE(bv.IsBitSet(i));
}
EXPECT_EQ(0U, bv.GetRawStorageWord(0));
EXPECT_EQ(0U, *bv.GetRawStorage());
BitVector::Iterator empty_iterator(&bv);
EXPECT_EQ(-1, empty_iterator.Next());
UniquePtr<BitVector::Iterator> empty_iterator_on_heap(bv.GetIterator());
EXPECT_EQ(-1, empty_iterator_on_heap->Next());
bv.SetBit(0);
bv.SetBit(kBits - 1);
EXPECT_EQ(2U, bv.NumSetBits());
EXPECT_EQ(1U, bv.NumSetBits(0));
EXPECT_EQ(2U, bv.NumSetBits(kBits - 1));
EXPECT_TRUE(bv.IsBitSet(0));
for (size_t i = 1; i < kBits - 1; i++) {
EXPECT_FALSE(bv.IsBitSet(i));
}
EXPECT_TRUE(bv.IsBitSet(kBits - 1));
EXPECT_EQ(0x80000001U, bv.GetRawStorageWord(0));
EXPECT_EQ(0x80000001U, *bv.GetRawStorage());
BitVector::Iterator iterator(&bv);
EXPECT_EQ(0, iterator.Next());
EXPECT_EQ(static_cast<int>(kBits - 1), iterator.Next());
EXPECT_EQ(-1, iterator.Next());
}
TEST(BitVector, NoopAllocator) {
const uint32_t kWords = 2;
uint32_t bits[kWords];
memset(bits, 0, sizeof(bits));
BitVector bv(0U, false, Allocator::GetNoopAllocator(), kWords, bits);
EXPECT_EQ(kWords, bv.GetStorageSize());
EXPECT_EQ(kWords * sizeof(uint32_t), bv.GetSizeOf());
EXPECT_EQ(bits, bv.GetRawStorage());
EXPECT_EQ(0U, bv.NumSetBits());
bv.SetBit(8);
EXPECT_EQ(1U, bv.NumSetBits());
EXPECT_EQ(0x00000100U, bv.GetRawStorageWord(0));
EXPECT_EQ(0x00000000U, bv.GetRawStorageWord(1));
EXPECT_EQ(1U, bv.NumSetBits());
bv.SetBit(16);
EXPECT_EQ(2U, bv.NumSetBits());
EXPECT_EQ(0x00010100U, bv.GetRawStorageWord(0));
EXPECT_EQ(0x00000000U, bv.GetRawStorageWord(1));
EXPECT_EQ(2U, bv.NumSetBits());
bv.SetBit(32);
EXPECT_EQ(3U, bv.NumSetBits());
EXPECT_EQ(0x00010100U, bv.GetRawStorageWord(0));
EXPECT_EQ(0x00000001U, bv.GetRawStorageWord(1));
EXPECT_EQ(3U, bv.NumSetBits());
bv.SetBit(48);
EXPECT_EQ(4U, bv.NumSetBits());
EXPECT_EQ(0x00010100U, bv.GetRawStorageWord(0));
EXPECT_EQ(0x00010001U, bv.GetRawStorageWord(1));
EXPECT_EQ(4U, bv.NumSetBits());
EXPECT_EQ(0U, bv.NumSetBits(0));
EXPECT_EQ(0U, bv.NumSetBits(7));
EXPECT_EQ(1U, bv.NumSetBits(8));
EXPECT_EQ(1U, bv.NumSetBits(9));
EXPECT_EQ(1U, bv.NumSetBits(15));
EXPECT_EQ(2U, bv.NumSetBits(16));
EXPECT_EQ(2U, bv.NumSetBits(17));
EXPECT_EQ(2U, bv.NumSetBits(31));
EXPECT_EQ(3U, bv.NumSetBits(32));
EXPECT_EQ(3U, bv.NumSetBits(33));
EXPECT_EQ(3U, bv.NumSetBits(47));
EXPECT_EQ(4U, bv.NumSetBits(48));
EXPECT_EQ(4U, bv.NumSetBits(49));
EXPECT_EQ(4U, bv.NumSetBits(63));
}
} // namespace art
|
