text
stringlengths 0
2.2M
|
---|
if (!bslmt::ThreadUtil::isEqual(d_handles[i],
|
bslmt::ThreadUtil::invalidHandle())) {
|
int rc = bslmt::ThreadUtil::join (d_handles[i], 0);
|
ASSERT(rc == 0);
|
d_handles[i] = bslmt::ThreadUtil::invalidHandle();
|
}
|
}
|
ASSERT (d_numThreadsStarted == d_numThreadsFinished);
|
delete d_barrier;
|
d_barrier = 0;
|
return 0;
|
}
|
void *MyTask::run()
|
{
|
void *ret = 0;
|
int threadNum = ++d_numThreadsStarted;
|
++d_totalThreadsStarted;
|
if (veryVerbose) {
|
bslmt::LockGuard<bslmt::Mutex> lg(&d_logMutex);
|
bsl::cout << "***Enter Thread: Id="
|
<< bslmt::ThreadUtil::selfId()
|
<< " Num="
|
<< threadNum
|
<< bsl::endl;
|
}
|
// This will increase the contention
|
barrier()->wait();
|
if (d_f) {
|
ret = d_f(threadNum, *this);
|
}
|
++d_numThreadsFinished;
|
++d_totalThreadsFinished;
|
if (veryVerbose) {
|
bslmt::LockGuard<bslmt::Mutex> lg(&d_logMutex);
|
bsl::cout << "***Leave Thread: Id="
|
<< bslmt::ThreadUtil::selfId()
|
<< " Num="
|
<< threadNum
|
<< bsl::endl;
|
}
|
return ret;
|
}
|
// ----------------------------------------------------------------------------
|
// Class generating random numbers
|
// ----------------------------------------------------------------------------
|
class Rand {
|
// DATA
|
unsigned int d_seed;
|
public:
|
// CREATORS
|
Rand(int seedParameter) : d_seed(seedParameter)
|
{
|
d_seed ^= (int)(bsl::size_t) this;
|
if (veryVerbose) {
|
bsl::cout << "Rand seed=" << d_seed << bsl::endl;
|
}
|
srand(d_seed);
|
}
|
int get()
|
{
|
int next;
|
#if defined BSLS_PLATFORM_OS_WINDOWS
|
next = rand();
|
#else
|
next = rand_r(&d_seed);
|
#endif
|
return next;
|
}
|
};
|
void printMetrics(bsl::ostream& out,
|
const char *name,
|
bsl::size_t numTotal,
|
bsls::Stopwatch& sw)
|
{
|
out << name
|
<< " NumIter=" << numTotal
|
<< " Time=" << sw.elapsedTime()
|
<< bsl::endl;
|
}
|
typedef bslmt::Semaphore Semaphore;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.