blob: ad6ea78c537db7ea021ab35a7f14d16a6dd1fbec (
plain)
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
|
// Copyright (C) 2009-2016 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library 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 library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
#include <future>
#include <thread>
#include <testsuite_performance.h>
inline bool is_ready(std::shared_future<void>& f)
{
return f.wait_for(std::chrono::microseconds(1)) == std::future_status::ready;
}
void poll(std::shared_future<void> f)
{
while (!is_ready(f))
{ }
}
int main()
{
#ifdef TEST_T1
#define thread_type true
#endif
using namespace __gnu_test;
time_counter time;
resource_counter resource;
const int n = 20;
std::promise<void> p;
std::shared_future<void> f = p.get_future();
std::thread pollers[n];
for (int i=0; i < n; ++i)
pollers[i] = std::thread(poll, f);
start_counters(time, resource);
for (int i = 0; i < 1000000; ++i)
(void)is_ready(f);
p.set_value();
for (int i=0; i < n; ++i)
pollers[i].join();
stop_counters(time, resource);
report_performance(__FILE__, "", time, resource);
return 0;
}
|
