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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
// Copyright 2014 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/compiler/node-cache.h"
#include "test/unittests/compiler/graph-unittest.h"
#include "test/unittests/test-utils.h"
#include "testing/gmock-support.h"
using testing::Contains;
namespace v8 {
namespace internal {
namespace compiler {
namespace node_cache_unittest {
typedef GraphTest NodeCacheTest;
TEST_F(NodeCacheTest, Int32Constant_back_to_back) {
Int32NodeCache cache;
for (int i = -2000000000; i < 2000000000; i += 3315177) {
Node** pos = cache.Find(zone(), i);
ASSERT_TRUE(pos != nullptr);
for (int j = 0; j < 3; j++) {
Node** npos = cache.Find(zone(), i);
EXPECT_EQ(pos, npos);
}
}
}
TEST_F(NodeCacheTest, Int32Constant_five) {
Int32NodeCache cache;
int32_t constants[] = {static_cast<int32_t>(0x80000000), -77, 0, 1, -1};
Node* nodes[arraysize(constants)];
for (size_t i = 0; i < arraysize(constants); i++) {
int32_t k = constants[i];
Node* node = graph()->NewNode(common()->Int32Constant(k));
*cache.Find(zone(), k) = nodes[i] = node;
}
for (size_t i = 0; i < arraysize(constants); i++) {
int32_t k = constants[i];
EXPECT_EQ(nodes[i], *cache.Find(zone(), k));
}
}
TEST_F(NodeCacheTest, Int32Constant_hits) {
Int32NodeCache cache;
const int32_t kSize = 1500;
Node** nodes = zone()->NewArray<Node*>(kSize);
for (int i = 0; i < kSize; i++) {
int32_t v = i * -55;
nodes[i] = graph()->NewNode(common()->Int32Constant(v));
*cache.Find(zone(), v) = nodes[i];
}
int hits = 0;
for (int i = 0; i < kSize; i++) {
int32_t v = i * -55;
Node** pos = cache.Find(zone(), v);
if (*pos != nullptr) {
EXPECT_EQ(nodes[i], *pos);
hits++;
}
}
EXPECT_LT(4, hits);
}
TEST_F(NodeCacheTest, Int64Constant_back_to_back) {
Int64NodeCache cache;
for (int64_t i = -2000000000; i < 2000000000; i += 3315177) {
Node** pos = cache.Find(zone(), i);
ASSERT_TRUE(pos != nullptr);
for (int j = 0; j < 3; j++) {
Node** npos = cache.Find(zone(), i);
EXPECT_EQ(pos, npos);
}
}
}
TEST_F(NodeCacheTest, Int64Constant_hits) {
Int64NodeCache cache;
const int32_t kSize = 1500;
Node** nodes = zone()->NewArray<Node*>(kSize);
for (int i = 0; i < kSize; i++) {
int64_t v = static_cast<int64_t>(i) * static_cast<int64_t>(5003001);
nodes[i] = graph()->NewNode(common()->Int32Constant(i));
*cache.Find(zone(), v) = nodes[i];
}
int hits = 0;
for (int i = 0; i < kSize; i++) {
int64_t v = static_cast<int64_t>(i) * static_cast<int64_t>(5003001);
Node** pos = cache.Find(zone(), v);
if (*pos != nullptr) {
EXPECT_EQ(nodes[i], *pos);
hits++;
}
}
EXPECT_LT(4, hits);
}
TEST_F(NodeCacheTest, GetCachedNodes_int32) {
Int32NodeCache cache;
int32_t constants[] = {0, 311, 12, 13, 14, 555, -555, -44, -33, -22, -11,
0, 311, 311, 412, 412, 11, 11, -33, -33, -22, -11};
for (size_t i = 0; i < arraysize(constants); i++) {
int32_t k = constants[i];
Node** pos = cache.Find(zone(), k);
if (*pos != nullptr) {
ZoneVector<Node*> nodes(zone());
cache.GetCachedNodes(&nodes);
EXPECT_THAT(nodes, Contains(*pos));
} else {
ZoneVector<Node*> nodes(zone());
Node* n = graph()->NewNode(common()->Int32Constant(k));
*pos = n;
cache.GetCachedNodes(&nodes);
EXPECT_THAT(nodes, Contains(n));
}
}
}
TEST_F(NodeCacheTest, GetCachedNodes_int64) {
Int64NodeCache cache;
int64_t constants[] = {0, 311, 12, 13, 14, 555, -555, -44, -33, -22, -11,
0, 311, 311, 412, 412, 11, 11, -33, -33, -22, -11};
for (size_t i = 0; i < arraysize(constants); i++) {
int64_t k = constants[i];
Node** pos = cache.Find(zone(), k);
if (*pos != nullptr) {
ZoneVector<Node*> nodes(zone());
cache.GetCachedNodes(&nodes);
EXPECT_THAT(nodes, Contains(*pos));
} else {
ZoneVector<Node*> nodes(zone());
Node* n = graph()->NewNode(common()->Int64Constant(k));
*pos = n;
cache.GetCachedNodes(&nodes);
EXPECT_THAT(nodes, Contains(n));
}
}
}
} // namespace node_cache_unittest
} // namespace compiler
} // namespace internal
} // namespace v8
|
