-
Notifications
You must be signed in to change notification settings - Fork 121
Expand file tree
/
Copy pathconcurrent_vector_test.cc
More file actions
102 lines (78 loc) · 2.31 KB
/
Copy pathconcurrent_vector_test.cc
File metadata and controls
102 lines (78 loc) · 2.31 KB
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
// Copyright 2020 The TensorFlow Runtime Authors
//
// 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.
// Unit test for ConcurrentVector
#include "tfrt/support/concurrent_vector.h"
#include <thread>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
namespace {
TEST(ConcurrentVectorTest, SingleThreaded) {
tfrt::ConcurrentVector<int> vec(1);
constexpr int kCount = 1000;
for (int i = 0; i < kCount; ++i) {
ASSERT_EQ(i, vec.emplace_back(i));
}
for (int i = 0; i < kCount; ++i) {
EXPECT_EQ(i, vec[i]);
}
}
TEST(ConcurrentVectorTest, OneWriterOneReader) {
tfrt::ConcurrentVector<int> vec(1);
constexpr int kCount = 1000;
std::thread writer([&] {
for (int i = 0; i < kCount; ++i) {
ASSERT_EQ(i, vec.emplace_back(i));
}
});
std::thread reader([&] {
for (int i = 0; i < kCount; ++i) {
while (i >= vec.size());
EXPECT_EQ(i, vec[i]);
}
});
writer.join();
reader.join();
}
TEST(ConcurrentVectorTest, TwoWritersTwoReaders) {
tfrt::ConcurrentVector<int> vec(1);
constexpr int kCount = 1000;
// Each writer stores from 0 to kCount/2 - 1 to the vector.
auto writer = [&] {
for (int i = 0; i < kCount / 2; ++i) {
vec.emplace_back(i);
}
};
std::thread writer1(writer);
std::thread writer2(writer);
// Reader reads all the data from the vector and verifies its content.
auto reader = [&] {
std::vector<int> stored;
for (int i = 0; i < kCount; ++i) {
while (i >= vec.size());
stored.emplace_back(vec[i]);
}
std::sort(stored.begin(), stored.end());
for (int i = 0; i < kCount / 2; ++i) {
ASSERT_EQ(stored[2 * i], i);
ASSERT_EQ(stored[2 * i + 1], i);
}
};
std::thread reader1(reader);
std::thread reader2(reader);
writer1.join();
writer2.join();
reader1.join();
reader2.join();
}
} // namespace