/
bitmap_test.cc
132 lines (114 loc) · 3.68 KB
/
bitmap_test.cc
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
123
124
125
126
127
128
129
130
131
132
// Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.
#include "vm/bitmap.h"
#include "platform/assert.h"
#include "vm/code_descriptors.h"
#include "vm/object.h"
#include "vm/unit_test.h"
namespace dart {
// 0x4 is just a placeholder PC offset because no entry of a CSM should
// have a PC offset of 0, otherwise internal assumptions break.
static const intptr_t kTestPcOffset = 0x4;
static const intptr_t kTestSpillSlotBitCount = 0;
static RawCompressedStackMaps* MapsFromBuilder(BitmapBuilder* bmap) {
CompressedStackMapsBuilder builder;
builder.AddEntry(kTestPcOffset, bmap, kTestSpillSlotBitCount);
return builder.Finalize();
}
ISOLATE_UNIT_TEST_CASE(BitmapBuilder) {
// Test basic bit map builder operations.
BitmapBuilder* builder1 = new BitmapBuilder();
EXPECT_EQ(0, builder1->Length());
bool value = true;
for (int32_t i = 0; i < 128; i++) {
builder1->Set(i, value);
value = !value;
}
EXPECT_EQ(128, builder1->Length());
value = true;
for (int32_t i = 0; i < 128; i++) {
EXPECT_EQ(value, builder1->Get(i));
value = !value;
}
value = true;
for (int32_t i = 0; i < 1024; i++) {
builder1->Set(i, value);
value = !value;
}
EXPECT_EQ(1024, builder1->Length());
value = true;
for (int32_t i = 0; i < 1024; i++) {
EXPECT_EQ(value, builder1->Get(i));
value = !value;
}
// Create a CompressedStackMaps object and verify its contents.
const auto& maps1 = CompressedStackMaps::Handle(MapsFromBuilder(builder1));
CompressedStackMapsIterator it1(maps1);
EXPECT(it1.MoveNext());
EXPECT_EQ(kTestPcOffset, it1.pc_offset());
EXPECT_EQ(kTestSpillSlotBitCount, it1.spill_slot_bit_count());
EXPECT_EQ(1024, it1.length());
value = true;
for (int32_t i = 0; i < 1024; i++) {
EXPECT_EQ(value, it1.IsObject(i));
value = !value;
}
EXPECT(!it1.MoveNext());
// Test the SetRange function in the builder.
builder1->SetRange(0, 256, false);
EXPECT_EQ(1024, builder1->Length());
builder1->SetRange(257, 1024, true);
EXPECT_EQ(1025, builder1->Length());
builder1->SetRange(1025, 2048, false);
EXPECT_EQ(2049, builder1->Length());
for (int32_t i = 0; i <= 256; i++) {
EXPECT(!builder1->Get(i));
}
for (int32_t i = 257; i <= 1024; i++) {
EXPECT(builder1->Get(i));
}
for (int32_t i = 1025; i <= 2048; i++) {
EXPECT(!builder1->Get(i));
}
const auto& maps2 = CompressedStackMaps::Handle(MapsFromBuilder(builder1));
CompressedStackMapsIterator it2(maps2);
EXPECT(it2.MoveNext());
EXPECT_EQ(kTestPcOffset, it2.pc_offset());
EXPECT_EQ(kTestSpillSlotBitCount, it2.spill_slot_bit_count());
EXPECT_EQ(2049, it2.length());
for (int32_t i = 0; i <= 256; i++) {
EXPECT(!it2.IsObject(i));
}
for (int32_t i = 257; i <= 1024; i++) {
EXPECT(it2.IsObject(i));
}
for (int32_t i = 1025; i <= 2048; i++) {
EXPECT(!it2.IsObject(i));
}
EXPECT(!it2.MoveNext());
// Test using SetLength to shorten the builder, followed by lengthening.
builder1->SetLength(747);
EXPECT_EQ(747, builder1->Length());
for (int32_t i = 257; i < 747; ++i) {
EXPECT(builder1->Get(i));
}
builder1->Set(800, false);
EXPECT_EQ(801, builder1->Length());
for (int32_t i = 257; i < 747; ++i) {
EXPECT(builder1->Get(i));
}
for (int32_t i = 747; i < 801; ++i) {
EXPECT(!builder1->Get(i));
}
builder1->Set(900, true);
EXPECT_EQ(901, builder1->Length());
for (int32_t i = 257; i < 747; ++i) {
EXPECT(builder1->Get(i));
}
for (int32_t i = 747; i < 900; ++i) {
EXPECT(!builder1->Get(i));
}
EXPECT(builder1->Get(900));
}
} // namespace dart