mirror of
https://github.com/rdkit/rdkit.git
synced 2026-06-04 21:54:27 +08:00
* revert duplicate chunk in release notes * replace deprecated ifdefs This one gets rid of USE_BUILTIN_POPCNT and RDK_THREADSAFE_SS use RDK_OPTIMIZE_POPCNT or RDK_BUILD_THREADSAFE_SSS instead * get rid of BUILD_COORDGEN_SUPPORT from ROMol.i * fix a stupid typo * update release notes
140 lines
3.4 KiB
C++
140 lines
3.4 KiB
C++
#ifdef RDK_BUILD_THREADSAFE_SSS
|
|
#include <RDGeneral/Invariant.h>
|
|
#include <RDGeneral/RDLog.h>
|
|
|
|
#include <functional>
|
|
#include <iomanip>
|
|
#include <sstream>
|
|
|
|
#include "ConcurrentQueue.h"
|
|
|
|
using namespace RDKit;
|
|
|
|
//! method for testing basic ConcurrentQueue operations
|
|
void testPushAndPop() {
|
|
ConcurrentQueue<int>* q = new ConcurrentQueue<int>(4);
|
|
int e1, e2, e3;
|
|
TEST_ASSERT(q->isEmpty());
|
|
|
|
q->push(1);
|
|
q->push(2);
|
|
q->push(3);
|
|
|
|
TEST_ASSERT(!q->isEmpty());
|
|
|
|
TEST_ASSERT(q->pop(e1));
|
|
TEST_ASSERT(q->pop(e2));
|
|
TEST_ASSERT(q->pop(e3));
|
|
|
|
TEST_ASSERT(e1 == 1);
|
|
TEST_ASSERT(e2 == 2);
|
|
TEST_ASSERT(e3 == 3);
|
|
|
|
TEST_ASSERT(q->isEmpty());
|
|
|
|
delete (q);
|
|
}
|
|
|
|
void produce(ConcurrentQueue<int>& q, const int numToProduce) {
|
|
for (int i = 0; i < numToProduce; ++i) {
|
|
q.push(i);
|
|
}
|
|
}
|
|
|
|
void consume(ConcurrentQueue<int>& q, std::vector<int>& result) {
|
|
int element;
|
|
while (q.pop(element)) {
|
|
result.push_back(element);
|
|
}
|
|
}
|
|
|
|
//! multithreaded testing for ConcurrentQueue
|
|
bool testProducerConsumer(const int numProducerThreads,
|
|
const int numConsumerThreads) {
|
|
ConcurrentQueue<int> q(5);
|
|
TEST_ASSERT(q.isEmpty());
|
|
|
|
const int numToProduce = 10;
|
|
|
|
std::vector<std::thread> producers(numProducerThreads);
|
|
std::vector<std::thread> consumers(numConsumerThreads);
|
|
std::vector<std::vector<int>> results(numConsumerThreads);
|
|
|
|
//! start producer threads
|
|
for (int i = 0; i < numProducerThreads; i++) {
|
|
producers[i] = std::thread(produce, std::ref(q), numToProduce);
|
|
}
|
|
//! start consumer threads
|
|
for (int i = 0; i < numConsumerThreads; i++) {
|
|
consumers[i] = std::thread(consume, std::ref(q), std::ref(results[i]));
|
|
}
|
|
|
|
std::for_each(producers.begin(), producers.end(),
|
|
std::mem_fn(&std::thread::join));
|
|
|
|
//! the producer is done producing
|
|
q.setDone();
|
|
|
|
std::for_each(consumers.begin(), consumers.end(),
|
|
std::mem_fn(&std::thread::join));
|
|
TEST_ASSERT(q.isEmpty());
|
|
|
|
std::vector<int> frequency(numToProduce, 0);
|
|
for (auto& result : results) {
|
|
for (auto& element : result) {
|
|
frequency[element] += 1;
|
|
}
|
|
}
|
|
for (auto& freq : frequency) {
|
|
if (freq != numProducerThreads) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void testMultipleTimes() {
|
|
const int trials = 10000;
|
|
//! Single Producer, Single Consumer
|
|
for (int i = 0; i < trials; i++) {
|
|
bool result = testProducerConsumer(1, 1);
|
|
TEST_ASSERT(result);
|
|
}
|
|
|
|
//! Single Producer, Multiple Consumer
|
|
for (int i = 0; i < trials; i++) {
|
|
bool result = testProducerConsumer(1, 5);
|
|
TEST_ASSERT(result);
|
|
}
|
|
|
|
//! Multiple Producer, Single Consumer
|
|
for (int i = 0; i < trials; i++) {
|
|
bool result = testProducerConsumer(5, 1);
|
|
TEST_ASSERT(result);
|
|
}
|
|
|
|
//! Multiple Producer, Multiple Consumer
|
|
for (int i = 0; i < trials; i++) {
|
|
bool result = testProducerConsumer(2, 4);
|
|
TEST_ASSERT(result);
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
RDLog::InitLogs();
|
|
|
|
BOOST_LOG(rdErrorLog) << "\n-----------------------------------------\n";
|
|
testPushAndPop();
|
|
BOOST_LOG(rdErrorLog) << "Finished: testPushAndPop() \n";
|
|
BOOST_LOG(rdErrorLog) << "\n-----------------------------------------\n";
|
|
#ifdef RDK_TEST_MULTITHREADED
|
|
BOOST_LOG(rdErrorLog) << "\n-----------------------------------------\n";
|
|
testMultipleTimes();
|
|
BOOST_LOG(rdErrorLog) << "Finished: testMultipleTimes() \n";
|
|
BOOST_LOG(rdErrorLog) << "\n-----------------------------------------\n";
|
|
#endif
|
|
return 0;
|
|
}
|
|
|
|
#endif
|