forked from bitcoin/bitcoin
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
cfefe5b
commit 68d370b
Showing
2 changed files
with
111 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,110 @@ | ||
// Copyright (c) 2012-2013 The Bitcoin Core developers | ||
// Distributed under the MIT software license, see the accompanying | ||
// file COPYING or http://www.opensource.org/licenses/mit-license.php. | ||
|
||
#include "random.h" | ||
#include "scheduler.h" | ||
|
||
#include "test/test_bitcoin.h" | ||
|
||
#include <boost/bind.hpp> | ||
#include <boost/random/mersenne_twister.hpp> | ||
#include <boost/random/uniform_int_distribution.hpp> | ||
#include <boost/thread.hpp> | ||
#include <boost/test/unit_test.hpp> | ||
|
||
BOOST_AUTO_TEST_SUITE(scheduler_tests) | ||
|
||
static void microTask(CScheduler& s, boost::mutex& mutex, int& counter, int delta, boost::chrono::system_clock::time_point rescheduleTime) | ||
{ | ||
{ | ||
boost::unique_lock<boost::mutex> lock(mutex); | ||
counter += delta; | ||
} | ||
boost::chrono::system_clock::time_point noTime = boost::chrono::system_clock::time_point::min(); | ||
if (rescheduleTime != noTime) { | ||
CScheduler::Function f = boost::bind(µTask, boost::ref(s), boost::ref(mutex), boost::ref(counter), -delta + 1, noTime); | ||
s.schedule(f, rescheduleTime); | ||
} | ||
} | ||
|
||
static void MicroSleep(uint64_t n) | ||
{ | ||
#if defined(HAVE_WORKING_BOOST_SLEEP_FOR) | ||
boost::this_thread::sleep_for(boost::chrono::microseconds(n)); | ||
#elif defined(HAVE_WORKING_BOOST_SLEEP) | ||
boost::this_thread::sleep(boost::posix_time::microseconds(n)); | ||
#else | ||
//should never get here | ||
#error missing boost sleep implementation | ||
#endif | ||
} | ||
|
||
BOOST_AUTO_TEST_CASE(manythreads) | ||
{ | ||
// Stress test: hundreds of microsecond-scheduled tasks, | ||
// serviced by 10 threads. | ||
// | ||
// So... ten shared counters, which if all the tasks execute | ||
// properly will sum to the number of tasks done. | ||
// Each task adds or subtracts from one of the counters a | ||
// random amount, and then schedules another task 0-1000 | ||
// microseconds in the future to subtract or add from | ||
// the counter -random_amount+1, so in the end the shared | ||
// counters should sum to the number of initial tasks performed. | ||
CScheduler microTasks; | ||
|
||
boost::thread_group microThreads; | ||
for (int i = 0; i < 5; i++) | ||
microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, µTasks)); | ||
|
||
boost::mutex counterMutex[10]; | ||
int counter[10] = { 0 }; | ||
boost::random::mt19937 rng(insecure_rand()); | ||
boost::random::uniform_int_distribution<> zeroToNine(0, 9); | ||
boost::random::uniform_int_distribution<> randomMsec(-11, 1000); | ||
boost::random::uniform_int_distribution<> randomDelta(-1000, 1000); | ||
|
||
boost::chrono::system_clock::time_point start = boost::chrono::system_clock::now(); | ||
boost::chrono::system_clock::time_point now = start; | ||
|
||
for (int i = 0; i < 100; i++) { | ||
boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng)); | ||
boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng)); | ||
int whichCounter = zeroToNine(rng); | ||
CScheduler::Function f = boost::bind(µTask, boost::ref(microTasks), | ||
boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]), | ||
randomDelta(rng), tReschedule); | ||
microTasks.schedule(f, t); | ||
} | ||
|
||
MicroSleep(600); | ||
now = boost::chrono::system_clock::now(); | ||
// More threads and more tasks: | ||
for (int i = 0; i < 5; i++) | ||
microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, µTasks)); | ||
for (int i = 0; i < 100; i++) { | ||
boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng)); | ||
boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng)); | ||
int whichCounter = zeroToNine(rng); | ||
CScheduler::Function f = boost::bind(µTask, boost::ref(microTasks), | ||
boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]), | ||
randomDelta(rng), tReschedule); | ||
microTasks.schedule(f, t); | ||
} | ||
|
||
// All 2,000 tasks should be finished within 2 milliseconds. Sleep a bit longer. | ||
MicroSleep(2100); | ||
|
||
microThreads.interrupt_all(); | ||
microThreads.join_all(); | ||
|
||
int counterSum = 0; | ||
for (int i = 0; i < 10; i++) { | ||
BOOST_CHECK(counter[i] != 0); | ||
counterSum += counter[i]; | ||
} | ||
BOOST_CHECK_EQUAL(counterSum, 200); | ||
} | ||
|
||
BOOST_AUTO_TEST_SUITE_END() |