Home
last modified time | relevance | path

Searched refs:Count (Results 1 – 7 of 7) sorted by relevance

/oneTBB/test/common/
H A Drwm_upgrade_downgrade.h24 static std::atomic<std::size_t> Count; variable
39 std::size_t c = Count; in operator()
42 … REQUIRE_MESSAGE(c == Count, "Another thread modified Count while holding read lock"); in operator()
44 c = Count; in operator()
48 ++Count; in operator()
60 Count = 0; in test_rwm_upgrade_downgrade()
/oneTBB/test/tbb/
H A Dtest_indexer_node.cpp39 const int Count = 150; variable
125 if ( lc < Count){ in operator ()()
273 reset_outputCheck(SIZE, Count); in test()
274 for(int i=0; i < Count*SIZE; ++i) { in test()
279 check_outputCheck(SIZE, Count); in test()
280 reset_outputCheck(SIZE, Count); in test()
282 for(int i=0; i < Count*SIZE; i++) { in test()
286 check_outputCheck(SIZE, Count); in test()
372 for (int i = 0; i < Count; ++i ) { in test_one_serial()
377 for (int i = 0; i < Count * SIZE; ++i ) { in test_one_serial()
[all …]
H A Dtest_split_node.cpp39 const int Count = 300; variable
111 if(my_count >= Count){ in operator ()()
162 for(int i = 0; i < Count; ++i) { in check_sink_values()
167 for(int i = 0; i < Count; ++i) { in check_sink_values()
200 for(int i = 0; i < Count; ++i) { in check_sink_values()
205 for(int i = 0; i < Count; ++i) { in check_sink_values()
281 for (int i = 0; i < Count; ++i ) { in test_one_serial()
344 flags.reserve(Count); in test()
H A Dtest_join_node.h365 const int Count = 150;
523 if ( lc < Count){
1192 reset_outputCheck(TUPLE_SIZE, Count);
1193 for(int i = 0; i < Count; ++i) {
1198 check_outputCheck(TUPLE_SIZE, Count);
1201 for(int i = 0; i < Count; i++) {
1324 for(int i = 0; i < Count; ++i) {
1330 for(int i = 0; i < Count; ++i) {
1346 for(int i = 0; i < Count; ++i) {
1361 for(int i = 0; i < Count / 2; ++i) {
[all …]
H A Dtest_join_node_key_matching.cpp81 template <std::size_t Count>
83 …uple_cat(std::declval<std::tuple<int>>(), std::declval<typename tuple_helper<Count - 1>::type>()));
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DWavefront.rst137 Each block has an associated atomic counter. Array ``Count``
147 std::atomic<char> Count[MAX_LEN/N+1][MAX_LEN/N+1];
156 Count[i][j] = (i>0)+(j>0);
175 if( bj+1<n && --Count[bi][bj+1]==0 )
177 if( bi+1<m && --Count[bi+1][bj]==0 )
H A DLocal_Serializer.rst203 std::atomic<int> count; // Count of queued items and in-flight item