Home
last modified time | relevance | path

Searched defs:nthread (Results 1 – 9 of 9) sorted by relevance

/oneTBB/examples/parallel_for/game_of_life/
H A DEvolution.cpp53 void SequentialEvolution::Run(double execution_time, int nthread) { in Run()
95 void ParallelEvolution::Run(double execution_time, int nthread) { in Run()
/oneTBB/test/tbb/
H A Dtest_mutex.h171 void test_basic( std::size_t nthread ) { in test_basic()
181 void test_rw_basic( std::size_t nthread ) { in test_rw_basic()
H A Dtest_concurrent_queue.cpp33 const std::size_t nthread; member
52 void TestPrimitiveTypes(std::size_t nthread, T exemplar) { in TestPrimitiveTypes()
H A Dtest_parallel_reduce.cpp526 void TestSplitting( std::size_t nthread ) { in TestSplitting()
H A Dtest_concurrent_vector.cpp157 double TimeFindPrimes( std::size_t nthread ) { in TimeFindPrimes()
/oneTBB/test/conformance/
H A Dconformance_combinable.cpp429 const int nthread; member
448 void TestLocalAllocations( int nthread ) { in TestLocalAllocations()
H A Dconformance_concurrent_queue.cpp593 const std::size_t nthread; member
620 void TestNegativeQueue( std::size_t nthread ) { in TestNegativeQueue()
641 const std::size_t nthread; member
679 void TestPushPop(typename CQ::size_type prefill, std::ptrdiff_t capacity, std::size_t nthread ) { in TestPushPop()
753 for (std::size_t nthread = MinThread; nthread <= MaxThread; ++nthread) { in TestConcurrentPushPop() local
H A Dconformance_concurrent_hash_map.cpp731 void DoConcurrentOperations( TableType& table, int n, const char* what, std::size_t nthread ) { in DoConcurrentOperations()
905 void TestInsertFindErase( std::size_t nthread ) { in TestInsertFindErase()
970 …AddToTable( test_table_type& table, std::size_t nthread, int m ) : my_table(table), my_nthread(nth… in AddToTable()
1024 void TestConcurrency( std::size_t nthread ) { in TestConcurrency()
H A Dconformance_concurrent_vector.cpp782 void TestParallelFor( std::size_t nthread ) { in TestParallelFor()