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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
/******************************************************************************
* ____ _ _____ *
* / ___| / \ | ___| C++ *
* | | / _ \ | |_ Actor *
* | |___ / ___ \| _| Framework *
* \____/_/ \_|_| *
* *
* Copyright 2011-2018 Dominik Charousset *
* *
* Distributed under the terms and conditions of the BSD 3-Clause License or *
* (at your option) under the terms and conditions of the Boost Software *
* License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE. *
* *
* If you did not receive a copy of the license files, see *
* http://opensource.org/licenses/BSD-3-Clause and *
* http://www.boost.org/LICENSE_1_0.txt. *
******************************************************************************/
// This unit test checks guarantees regarding ordering and equality for actor
// handles, i.e., actor_addr, actor, and typed_actor<...>.
#include "caf/config.hpp"
#define CAF_SUITE handles
#include "caf/test/unit_test.hpp"
#include "caf/all.hpp"
using namespace caf;
namespace {
// Simple int32_terface for testee actors.
using testee_actor = typed_actor<replies_to<int32_t>::with<int32_t>>;
// Dynamically typed testee.
behavior dt_testee() {
return {
[](int32_t x) {
return x * x;
}
};
}
// Statically typed testee.
testee_actor::behavior_type st_testee() {
return {
[](int32_t x) {
return x * x;
}
};
}
// A simple wrapper for storing a handle in all representations.
struct handle_set {
// Weak handle to the actor.
actor_addr wh;
// Dynamically typed handle to the actor.
actor dt;
// Staically typed handle to the actor.
testee_actor st;
handle_set() = default;
template <class T>
handle_set(const T& hdl)
: wh(hdl.address()),
dt(actor_cast<actor>(hdl)),
st(actor_cast<testee_actor>(hdl)) {
// nop
}
};
struct fixture {
fixture()
: sys(cfg),
self(sys, true),
a1{sys.spawn(dt_testee)},
a2{sys.spawn(st_testee)} {
// nop
}
actor_system_config cfg;
actor_system sys;
scoped_actor self;
handle_set a0;
handle_set a1{sys.spawn(dt_testee)};
handle_set a2{sys.spawn(st_testee)};
};
} // namespace
CAF_TEST_FIXTURE_SCOPE(handle_tests, fixture)
CAF_TEST(identity) {
// all handles in a0 are equal
CAF_CHECK_EQUAL(a0.wh, a0.wh);
CAF_CHECK_EQUAL(a0.wh, a0.dt);
CAF_CHECK_EQUAL(a0.wh, a0.st);
CAF_CHECK_EQUAL(a0.dt, a0.wh);
CAF_CHECK_EQUAL(a0.dt, a0.dt);
CAF_CHECK_EQUAL(a0.dt, a0.st);
CAF_CHECK_EQUAL(a0.st, a0.wh);
CAF_CHECK_EQUAL(a0.st, a0.dt);
CAF_CHECK_EQUAL(a0.st, a0.st);
// all handles in a1 are equal
CAF_CHECK_EQUAL(a1.wh, a1.wh);
CAF_CHECK_EQUAL(a1.wh, a1.dt);
CAF_CHECK_EQUAL(a1.wh, a1.st);
CAF_CHECK_EQUAL(a1.dt, a1.wh);
CAF_CHECK_EQUAL(a1.dt, a1.dt);
CAF_CHECK_EQUAL(a1.dt, a1.st);
CAF_CHECK_EQUAL(a1.st, a1.wh);
CAF_CHECK_EQUAL(a1.st, a1.dt);
CAF_CHECK_EQUAL(a1.st, a1.st);
// all handles in a2 are equal
CAF_CHECK_EQUAL(a2.wh, a2.wh);
CAF_CHECK_EQUAL(a2.wh, a2.dt);
CAF_CHECK_EQUAL(a2.wh, a2.st);
CAF_CHECK_EQUAL(a2.dt, a2.wh);
CAF_CHECK_EQUAL(a2.dt, a2.dt);
CAF_CHECK_EQUAL(a2.dt, a2.st);
CAF_CHECK_EQUAL(a2.st, a2.wh);
CAF_CHECK_EQUAL(a2.st, a2.dt);
CAF_CHECK_EQUAL(a2.st, a2.st);
// all handles in a0 are *not* equal to any handle in a1 or a2
CAF_CHECK_NOT_EQUAL(a0.wh, a1.wh);
CAF_CHECK_NOT_EQUAL(a0.wh, a1.dt);
CAF_CHECK_NOT_EQUAL(a0.wh, a1.st);
CAF_CHECK_NOT_EQUAL(a0.dt, a1.wh);
CAF_CHECK_NOT_EQUAL(a0.dt, a1.dt);
CAF_CHECK_NOT_EQUAL(a0.dt, a1.st);
CAF_CHECK_NOT_EQUAL(a0.st, a1.wh);
CAF_CHECK_NOT_EQUAL(a0.st, a1.dt);
CAF_CHECK_NOT_EQUAL(a0.st, a1.st);
CAF_CHECK_NOT_EQUAL(a0.wh, a2.wh);
CAF_CHECK_NOT_EQUAL(a0.wh, a2.dt);
CAF_CHECK_NOT_EQUAL(a0.wh, a2.st);
CAF_CHECK_NOT_EQUAL(a0.dt, a2.wh);
CAF_CHECK_NOT_EQUAL(a0.dt, a2.dt);
CAF_CHECK_NOT_EQUAL(a0.dt, a2.st);
CAF_CHECK_NOT_EQUAL(a0.st, a2.wh);
CAF_CHECK_NOT_EQUAL(a0.st, a2.dt);
CAF_CHECK_NOT_EQUAL(a0.st, a2.st);
// all handles in a1 are *not* equal to any handle in a0 or a2
CAF_CHECK_NOT_EQUAL(a1.wh, a0.wh);
CAF_CHECK_NOT_EQUAL(a1.wh, a0.dt);
CAF_CHECK_NOT_EQUAL(a1.wh, a0.st);
CAF_CHECK_NOT_EQUAL(a1.dt, a0.wh);
CAF_CHECK_NOT_EQUAL(a1.dt, a0.dt);
CAF_CHECK_NOT_EQUAL(a1.dt, a0.st);
CAF_CHECK_NOT_EQUAL(a1.st, a0.wh);
CAF_CHECK_NOT_EQUAL(a1.st, a0.dt);
CAF_CHECK_NOT_EQUAL(a1.st, a0.st);
CAF_CHECK_NOT_EQUAL(a1.wh, a2.wh);
CAF_CHECK_NOT_EQUAL(a1.wh, a2.dt);
CAF_CHECK_NOT_EQUAL(a1.wh, a2.st);
CAF_CHECK_NOT_EQUAL(a1.dt, a2.wh);
CAF_CHECK_NOT_EQUAL(a1.dt, a2.dt);
CAF_CHECK_NOT_EQUAL(a1.dt, a2.st);
CAF_CHECK_NOT_EQUAL(a1.st, a2.wh);
CAF_CHECK_NOT_EQUAL(a1.st, a2.dt);
CAF_CHECK_NOT_EQUAL(a1.st, a2.st);
// all handles in a2 are *not* equal to any handle in a0 or a1
CAF_CHECK_NOT_EQUAL(a2.wh, a0.wh);
CAF_CHECK_NOT_EQUAL(a2.wh, a0.dt);
CAF_CHECK_NOT_EQUAL(a2.wh, a0.st);
CAF_CHECK_NOT_EQUAL(a2.dt, a0.wh);
CAF_CHECK_NOT_EQUAL(a2.dt, a0.dt);
CAF_CHECK_NOT_EQUAL(a2.dt, a0.st);
CAF_CHECK_NOT_EQUAL(a2.st, a0.wh);
CAF_CHECK_NOT_EQUAL(a2.st, a0.dt);
CAF_CHECK_NOT_EQUAL(a2.st, a0.st);
CAF_CHECK_NOT_EQUAL(a2.wh, a1.wh);
CAF_CHECK_NOT_EQUAL(a2.wh, a1.dt);
CAF_CHECK_NOT_EQUAL(a2.wh, a1.st);
CAF_CHECK_NOT_EQUAL(a2.dt, a1.wh);
CAF_CHECK_NOT_EQUAL(a2.dt, a1.dt);
CAF_CHECK_NOT_EQUAL(a2.dt, a1.st);
CAF_CHECK_NOT_EQUAL(a2.st, a1.wh);
CAF_CHECK_NOT_EQUAL(a2.st, a1.dt);
CAF_CHECK_NOT_EQUAL(a2.st, a1.st);
}
CAF_TEST(ordering) {
// handles in a0 are all equal, i.e., are not in less-than relation
CAF_CHECK_NOT_LESS(a0.wh, a0.wh);
CAF_CHECK_NOT_LESS(a0.wh, a0.dt);
CAF_CHECK_NOT_LESS(a0.wh, a0.st);
CAF_CHECK_NOT_LESS(a0.dt, a0.wh);
CAF_CHECK_NOT_LESS(a0.dt, a0.dt);
CAF_CHECK_NOT_LESS(a0.dt, a0.st);
CAF_CHECK_NOT_LESS(a0.st, a0.wh);
CAF_CHECK_NOT_LESS(a0.st, a0.dt);
CAF_CHECK_NOT_LESS(a0.st, a0.st);
// handles in a1 are all equal, i.e., are not in less-than relation
CAF_CHECK_NOT_LESS(a1.wh, a1.wh);
CAF_CHECK_NOT_LESS(a1.wh, a1.dt);
CAF_CHECK_NOT_LESS(a1.wh, a1.st);
CAF_CHECK_NOT_LESS(a1.dt, a1.wh);
CAF_CHECK_NOT_LESS(a1.dt, a1.dt);
CAF_CHECK_NOT_LESS(a1.dt, a1.st);
CAF_CHECK_NOT_LESS(a1.st, a1.wh);
CAF_CHECK_NOT_LESS(a1.st, a1.dt);
CAF_CHECK_NOT_LESS(a1.st, a1.st);
// handles in a2 are all equal, i.e., are not in less-than relation
CAF_CHECK_NOT_LESS(a2.wh, a2.wh);
CAF_CHECK_NOT_LESS(a2.wh, a2.dt);
CAF_CHECK_NOT_LESS(a2.wh, a2.st);
CAF_CHECK_NOT_LESS(a2.dt, a2.wh);
CAF_CHECK_NOT_LESS(a2.dt, a2.dt);
CAF_CHECK_NOT_LESS(a2.dt, a2.st);
CAF_CHECK_NOT_LESS(a2.st, a2.wh);
CAF_CHECK_NOT_LESS(a2.st, a2.dt);
CAF_CHECK_NOT_LESS(a2.st, a2.st);
// all handles in a0 are less than handles in a1 or a2
CAF_CHECK_LESS(a0.wh, a1.wh);
CAF_CHECK_LESS(a0.wh, a1.dt);
CAF_CHECK_LESS(a0.wh, a1.st);
CAF_CHECK_LESS(a0.dt, a1.wh);
CAF_CHECK_LESS(a0.dt, a1.dt);
CAF_CHECK_LESS(a0.dt, a1.st);
CAF_CHECK_LESS(a0.st, a1.wh);
CAF_CHECK_LESS(a0.st, a1.dt);
CAF_CHECK_LESS(a0.st, a1.st);
CAF_CHECK_LESS(a0.wh, a2.wh);
CAF_CHECK_LESS(a0.wh, a2.dt);
CAF_CHECK_LESS(a0.wh, a2.st);
CAF_CHECK_LESS(a0.dt, a2.wh);
CAF_CHECK_LESS(a0.dt, a2.dt);
CAF_CHECK_LESS(a0.dt, a2.st);
CAF_CHECK_LESS(a0.st, a2.wh);
CAF_CHECK_LESS(a0.st, a2.dt);
CAF_CHECK_LESS(a0.st, a2.st);
// all handles in a1 are less than handles in a2
CAF_CHECK_LESS(a1.wh, a2.wh);
CAF_CHECK_LESS(a1.wh, a2.dt);
CAF_CHECK_LESS(a1.wh, a2.st);
CAF_CHECK_LESS(a1.dt, a2.wh);
CAF_CHECK_LESS(a1.dt, a2.dt);
CAF_CHECK_LESS(a1.dt, a2.st);
CAF_CHECK_LESS(a1.st, a2.wh);
CAF_CHECK_LESS(a1.st, a2.dt);
CAF_CHECK_LESS(a1.st, a2.st);
// all handles in a1 are *not* less than handles in a0
CAF_CHECK_NOT_LESS(a1.wh, a0.wh);
CAF_CHECK_NOT_LESS(a1.wh, a0.dt);
CAF_CHECK_NOT_LESS(a1.wh, a0.st);
CAF_CHECK_NOT_LESS(a1.dt, a0.wh);
CAF_CHECK_NOT_LESS(a1.dt, a0.dt);
CAF_CHECK_NOT_LESS(a1.dt, a0.st);
CAF_CHECK_NOT_LESS(a1.st, a0.wh);
CAF_CHECK_NOT_LESS(a1.st, a0.dt);
CAF_CHECK_NOT_LESS(a1.st, a0.st);
// all handles in a2 are *not* less than handles in a0 or a1
CAF_CHECK_NOT_LESS(a2.wh, a0.wh);
CAF_CHECK_NOT_LESS(a2.wh, a0.dt);
CAF_CHECK_NOT_LESS(a2.wh, a0.st);
CAF_CHECK_NOT_LESS(a2.dt, a0.wh);
CAF_CHECK_NOT_LESS(a2.dt, a0.dt);
CAF_CHECK_NOT_LESS(a2.dt, a0.st);
CAF_CHECK_NOT_LESS(a2.st, a0.wh);
CAF_CHECK_NOT_LESS(a2.st, a0.dt);
CAF_CHECK_NOT_LESS(a2.st, a0.st);
CAF_CHECK_NOT_LESS(a2.wh, a1.wh);
CAF_CHECK_NOT_LESS(a2.wh, a1.dt);
CAF_CHECK_NOT_LESS(a2.wh, a1.st);
CAF_CHECK_NOT_LESS(a2.dt, a1.wh);
CAF_CHECK_NOT_LESS(a2.dt, a1.dt);
CAF_CHECK_NOT_LESS(a2.dt, a1.st);
CAF_CHECK_NOT_LESS(a2.st, a1.wh);
CAF_CHECK_NOT_LESS(a2.st, a1.dt);
CAF_CHECK_NOT_LESS(a2.st, a1.st);
}
CAF_TEST(string_representation) {
auto s1 = a0.wh;
auto s2 = a0.dt;
auto s3 = a0.st;
CAF_CHECK_EQUAL(s1, s2);
CAF_CHECK_EQUAL(s2, s3);
}
CAF_TEST(mpi_string_representation) {
CAF_CHECK(sys.message_types(a0.dt).empty());
std::set<std::string> st_expected{"caf::replies_to<@i32>::with<@i32>"};
CAF_CHECK_EQUAL(st_expected, sys.message_types(a0.st));
CAF_CHECK_EQUAL(st_expected, sys.message_types<testee_actor>());
}
CAF_TEST_FIXTURE_SCOPE_END()
|
