Home
last modified time | relevance | path

Searched refs:next_value (Results 1 – 5 of 5) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_queue_node.cpp58 void check_item( T* next_value, T &value ) { in check_item() argument
61 CHECK_MESSAGE( next_value[tid] == T(offset), "" ); in check_item()
62 ++next_value[tid]; in check_item()
263 T *next_value = new T[num_threads]; in test_parallel() local
264 for (int tid = 0; tid < num_threads; ++tid) next_value[tid] = T(0); in test_parallel()
268 check_item( next_value, j ); in test_parallel()
272 CHECK_MESSAGE( next_value[tid] == T(N), "" ); in test_parallel()
274 delete[] next_value; in test_parallel()
H A Dtest_buffer_node.cpp209 T *next_value = new T[num_threads]; in test_parallel() local
210 for (int tid = 0; tid < num_threads; ++tid) next_value[tid] = T(0); in test_parallel()
214 check_item( next_value, j ); in test_parallel()
218 CHECK_MESSAGE( next_value[tid] == T((N*(N-1))/2), "" ); in test_parallel()
297 delete [] next_value; in test_parallel()
H A Dtest_priority_queue_node.cpp47 void check_item( T* next_value, T &value ) { in check_item() argument
50 CHECK_MESSAGE( next_value[tid] == T(offset), "" ); in check_item()
51 ++next_value[tid]; in check_item()
H A Dtest_arena_priorities.cpp102 int next_value = (initialization_method + 1) % initialization_methods_num; in do_allocate_and_construct() local
103 initialization_method = (initialization_methods)next_value; in do_allocate_and_construct()
H A Dtest_limiter_node.cpp46 T next_value; member
49 serial_receiver(tbb::flow::graph& g) : next_value(T(0)), my_graph(g) {} in serial_receiver()
52 CHECK_MESSAGE( next_value++ == v, "" ); in try_put_task()