blob: fe3313d122314215b40509d4d0cd35284a95f2db [file] [log] [blame]
Brian Carlstrom413e89f2013-10-21 23:53:49 -07001/*
2 * Copyright (C) 2013 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Ian Rogers700a4022014-05-19 16:49:03 -070017#include <memory>
18
Ian Rogerse77493c2014-08-20 15:08:45 -070019#include "allocator.h"
20#include "bit_vector-inl.h"
Brian Carlstromba150c32013-08-27 17:31:03 -070021#include "gtest/gtest.h"
Brian Carlstrom413e89f2013-10-21 23:53:49 -070022
23namespace art {
24
25TEST(BitVector, Test) {
26 const size_t kBits = 32;
27
28 BitVector bv(kBits, false, Allocator::GetMallocAllocator());
29 EXPECT_EQ(1U, bv.GetStorageSize());
Ian Rogersef7d42f2014-01-06 12:55:46 -080030 EXPECT_EQ(sizeof(uint32_t), bv.GetSizeOf());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070031 EXPECT_FALSE(bv.IsExpandable());
32
Brian Carlstromba150c32013-08-27 17:31:03 -070033 EXPECT_EQ(0U, bv.NumSetBits());
Vladimir Markod3c5beb2014-04-11 16:32:51 +010034 EXPECT_EQ(0U, bv.NumSetBits(1));
35 EXPECT_EQ(0U, bv.NumSetBits(kBits));
Brian Carlstrom413e89f2013-10-21 23:53:49 -070036 for (size_t i = 0; i < kBits; i++) {
37 EXPECT_FALSE(bv.IsBitSet(i));
38 }
39 EXPECT_EQ(0U, bv.GetRawStorageWord(0));
40 EXPECT_EQ(0U, *bv.GetRawStorage());
41
Vladimir Markoa5b8fde2014-05-23 15:16:44 +010042 EXPECT_TRUE(bv.Indexes().begin().Done());
43 EXPECT_TRUE(bv.Indexes().begin() == bv.Indexes().end());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070044
45 bv.SetBit(0);
46 bv.SetBit(kBits - 1);
Brian Carlstromba150c32013-08-27 17:31:03 -070047 EXPECT_EQ(2U, bv.NumSetBits());
Vladimir Markod3c5beb2014-04-11 16:32:51 +010048 EXPECT_EQ(1U, bv.NumSetBits(1));
49 EXPECT_EQ(2U, bv.NumSetBits(kBits));
Brian Carlstrom413e89f2013-10-21 23:53:49 -070050 EXPECT_TRUE(bv.IsBitSet(0));
51 for (size_t i = 1; i < kBits - 1; i++) {
52 EXPECT_FALSE(bv.IsBitSet(i));
53 }
54 EXPECT_TRUE(bv.IsBitSet(kBits - 1));
55 EXPECT_EQ(0x80000001U, bv.GetRawStorageWord(0));
56 EXPECT_EQ(0x80000001U, *bv.GetRawStorage());
57
Vladimir Markoa5b8fde2014-05-23 15:16:44 +010058 BitVector::IndexIterator iterator = bv.Indexes().begin();
59 EXPECT_TRUE(iterator != bv.Indexes().end());
Vladimir Marko04071962015-01-02 17:00:44 +000060 EXPECT_EQ(0u, *iterator);
Vladimir Markoa5b8fde2014-05-23 15:16:44 +010061 ++iterator;
62 EXPECT_TRUE(iterator != bv.Indexes().end());
Vladimir Marko04071962015-01-02 17:00:44 +000063 EXPECT_EQ(kBits - 1u, *iterator);
Vladimir Markoa5b8fde2014-05-23 15:16:44 +010064 ++iterator;
65 EXPECT_TRUE(iterator == bv.Indexes().end());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070066}
67
68TEST(BitVector, NoopAllocator) {
69 const uint32_t kWords = 2;
70
71 uint32_t bits[kWords];
72 memset(bits, 0, sizeof(bits));
73
74 BitVector bv(0U, false, Allocator::GetNoopAllocator(), kWords, bits);
75 EXPECT_EQ(kWords, bv.GetStorageSize());
Ian Rogersef7d42f2014-01-06 12:55:46 -080076 EXPECT_EQ(kWords * sizeof(uint32_t), bv.GetSizeOf());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070077 EXPECT_EQ(bits, bv.GetRawStorage());
Brian Carlstromba150c32013-08-27 17:31:03 -070078 EXPECT_EQ(0U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070079
80 bv.SetBit(8);
Brian Carlstromba150c32013-08-27 17:31:03 -070081 EXPECT_EQ(1U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070082 EXPECT_EQ(0x00000100U, bv.GetRawStorageWord(0));
83 EXPECT_EQ(0x00000000U, bv.GetRawStorageWord(1));
Brian Carlstromba150c32013-08-27 17:31:03 -070084 EXPECT_EQ(1U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070085
86 bv.SetBit(16);
Brian Carlstromba150c32013-08-27 17:31:03 -070087 EXPECT_EQ(2U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070088 EXPECT_EQ(0x00010100U, bv.GetRawStorageWord(0));
89 EXPECT_EQ(0x00000000U, bv.GetRawStorageWord(1));
Brian Carlstromba150c32013-08-27 17:31:03 -070090 EXPECT_EQ(2U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070091
92 bv.SetBit(32);
Brian Carlstromba150c32013-08-27 17:31:03 -070093 EXPECT_EQ(3U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070094 EXPECT_EQ(0x00010100U, bv.GetRawStorageWord(0));
95 EXPECT_EQ(0x00000001U, bv.GetRawStorageWord(1));
Brian Carlstromba150c32013-08-27 17:31:03 -070096 EXPECT_EQ(3U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -070097
98 bv.SetBit(48);
Brian Carlstromba150c32013-08-27 17:31:03 -070099 EXPECT_EQ(4U, bv.NumSetBits());
Brian Carlstrom413e89f2013-10-21 23:53:49 -0700100 EXPECT_EQ(0x00010100U, bv.GetRawStorageWord(0));
101 EXPECT_EQ(0x00010001U, bv.GetRawStorageWord(1));
Brian Carlstromba150c32013-08-27 17:31:03 -0700102 EXPECT_EQ(4U, bv.NumSetBits());
103
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100104 EXPECT_EQ(0U, bv.NumSetBits(1));
Brian Carlstromba150c32013-08-27 17:31:03 -0700105
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100106 EXPECT_EQ(0U, bv.NumSetBits(8));
Brian Carlstromba150c32013-08-27 17:31:03 -0700107 EXPECT_EQ(1U, bv.NumSetBits(9));
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100108 EXPECT_EQ(1U, bv.NumSetBits(10));
Brian Carlstromba150c32013-08-27 17:31:03 -0700109
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100110 EXPECT_EQ(1U, bv.NumSetBits(16));
Brian Carlstromba150c32013-08-27 17:31:03 -0700111 EXPECT_EQ(2U, bv.NumSetBits(17));
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100112 EXPECT_EQ(2U, bv.NumSetBits(18));
Brian Carlstromba150c32013-08-27 17:31:03 -0700113
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100114 EXPECT_EQ(2U, bv.NumSetBits(32));
Brian Carlstromba150c32013-08-27 17:31:03 -0700115 EXPECT_EQ(3U, bv.NumSetBits(33));
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100116 EXPECT_EQ(3U, bv.NumSetBits(34));
Brian Carlstromba150c32013-08-27 17:31:03 -0700117
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100118 EXPECT_EQ(3U, bv.NumSetBits(48));
Brian Carlstromba150c32013-08-27 17:31:03 -0700119 EXPECT_EQ(4U, bv.NumSetBits(49));
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100120 EXPECT_EQ(4U, bv.NumSetBits(50));
Brian Carlstromba150c32013-08-27 17:31:03 -0700121
Vladimir Markod3c5beb2014-04-11 16:32:51 +0100122 EXPECT_EQ(4U, bv.NumSetBits(64));
Brian Carlstrom413e89f2013-10-21 23:53:49 -0700123}
124
Vladimir Marko4812d432014-03-11 12:42:25 +0000125TEST(BitVector, SetInitialBits) {
126 const uint32_t kWords = 2;
127
128 uint32_t bits[kWords];
129 memset(bits, 0, sizeof(bits));
130
131 BitVector bv(0U, false, Allocator::GetNoopAllocator(), kWords, bits);
132 bv.SetInitialBits(0u);
133 EXPECT_EQ(0u, bv.NumSetBits());
134 bv.SetInitialBits(1u);
135 EXPECT_EQ(1u, bv.NumSetBits());
136 bv.SetInitialBits(32u);
137 EXPECT_EQ(32u, bv.NumSetBits());
138 bv.SetInitialBits(63u);
139 EXPECT_EQ(63u, bv.NumSetBits());
140 bv.SetInitialBits(64u);
141 EXPECT_EQ(64u, bv.NumSetBits());
142}
143
Nicolas Geoffrayb5567612014-10-22 10:25:24 +0100144TEST(BitVector, UnionIfNotIn) {
145 {
146 BitVector first(2, true, Allocator::GetMallocAllocator());
147 BitVector second(5, true, Allocator::GetMallocAllocator());
148 BitVector third(5, true, Allocator::GetMallocAllocator());
149
150 second.SetBit(64);
151 third.SetBit(64);
152 bool changed = first.UnionIfNotIn(&second, &third);
153 EXPECT_EQ(0u, first.NumSetBits());
154 EXPECT_FALSE(changed);
155 }
156
157 {
158 BitVector first(2, true, Allocator::GetMallocAllocator());
159 BitVector second(5, true, Allocator::GetMallocAllocator());
160 BitVector third(5, true, Allocator::GetMallocAllocator());
161
162 second.SetBit(64);
163 bool changed = first.UnionIfNotIn(&second, &third);
164 EXPECT_EQ(1u, first.NumSetBits());
165 EXPECT_TRUE(changed);
166 EXPECT_TRUE(first.IsBitSet(64));
167 }
168}
169
Brian Carlstrom413e89f2013-10-21 23:53:49 -0700170} // namespace art