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
|
/*
* Copyright © Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 or 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "mir/thread_safe_list.h"
#include "mir/test/signal.h"
#include <gtest/gtest.h>
#include <gmock/gmock.h>
namespace
{
struct Dummy {};
using Element = std::shared_ptr<Dummy>;
using SharedPtrList = mir::ThreadSafeList<Element>;
struct ThreadSafeListTest : testing::Test
{
SharedPtrList list;
Element const element1 = std::make_shared<Dummy>();
Element const element2 = std::make_shared<Dummy>();
};
}
TEST_F(ThreadSafeListTest, can_remove_element_while_iterating_same_element)
{
using namespace testing;
list.add(element1);
list.for_each(
[&] (Element const& element)
{
list.remove(element);
});
int elements_seen = 0;
list.for_each(
[&] (Element const&)
{
++elements_seen;
});
EXPECT_THAT(elements_seen, Eq(0));
}
TEST_F(ThreadSafeListTest, can_remove_unused_element_while_iterating_different_element)
{
using namespace testing;
list.add(element1);
list.add(element2);
int elements_seen = 0;
list.for_each(
[&] (Element const&)
{
list.remove(element2);
++elements_seen;
});
EXPECT_THAT(elements_seen, Eq(1));
}
TEST_F(ThreadSafeListTest,
can_remove_unused_element_while_different_element_is_used_in_different_thread)
{
using namespace testing;
list.add(element1);
list.add(element2);
mir::test::Signal first_element_in_use;
mir::test::Signal second_element_removed;
int elements_seen = 0;
std::thread t{
[&]
{
list.for_each(
[&] (Element const&)
{
first_element_in_use.raise();
second_element_removed.wait_for(std::chrono::seconds{3});
EXPECT_TRUE(second_element_removed.raised());
++elements_seen;
});
}};
first_element_in_use.wait_for(std::chrono::seconds{3});
list.remove(element2);
second_element_removed.raise();
t.join();
EXPECT_THAT(elements_seen, Eq(1));
}
TEST_F(ThreadSafeListTest, removes_all_matching_elements)
{
using namespace testing;
std::vector<Element> elements_seen;
list.add(element1);
list.add(element2);
list.add(element1);
list.remove_all(element1);
list.for_each(
[&] (Element const& element)
{
elements_seen.push_back(element);
});
EXPECT_THAT(elements_seen, ElementsAre(element2));
}
TEST_F(ThreadSafeListTest, clears_all_elements)
{
using namespace testing;
int elements_seen = 0;
list.add(element1);
list.add(element2);
list.add(element1);
list.clear();
list.for_each(
[&] (Element const&)
{
++elements_seen;
});
EXPECT_THAT(elements_seen, Eq(0));
}
|
