blob: f829b7fa5d8e3e44acf69bfb238c8b986bbd587a (
plain) (
blame)
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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/vespalib/util/barrier.h>
using namespace vespalib;
struct Fixture {
Barrier barrier;
CountDownLatch latch;
Fixture(size_t n) : barrier(n), latch(n) {}
};
TEST_MT_F("require that barriers are satisfied by the appropriate number of threads", 3, Fixture(num_threads)) {
if (thread_id == 0) {
f1.latch.countDown();
EXPECT_FALSE(f.latch.await(250));
EXPECT_TRUE(f.barrier.await());
EXPECT_TRUE(f.latch.await(25000));
} else {
EXPECT_TRUE(f1.barrier.await());
f1.latch.countDown();
}
}
TEST_MT_F("require that barriers can be used multiple times", 3, Fixture(num_threads)) {
EXPECT_TRUE(f1.barrier.await());
EXPECT_TRUE(f1.barrier.await());
if (thread_id == 0) {
f1.latch.countDown();
EXPECT_FALSE(f.latch.await(250));
EXPECT_TRUE(f.barrier.await());
EXPECT_TRUE(f.latch.await(25000));
} else {
EXPECT_TRUE(f1.barrier.await());
f1.latch.countDown();
}
}
TEST_MT_F("require that barriers can be broken", 3, Fixture(num_threads)) {
EXPECT_TRUE(f1.barrier.await());
if (thread_id == 0) {
f1.latch.countDown();
EXPECT_FALSE(f.latch.await(250));
f1.barrier.destroy();
EXPECT_TRUE(f.latch.await(25000));
} else {
EXPECT_FALSE(f1.barrier.await());
f1.latch.countDown();
}
EXPECT_FALSE(f1.barrier.await());
}
TEST_MT_F("require that barriers cannot be retroactively broken", 100, Barrier(num_threads)) {
EXPECT_TRUE(f1.await());
f1.destroy();
EXPECT_FALSE(f1.await());
}
TEST_MAIN() { TEST_RUN_ALL(); }
|