Home
last modified time | relevance | path

Searched refs:Array (Results 1 – 6 of 6) sorted by relevance

/oneTBB/test/conformance/
H A Dconformance_parallel_for.cpp34 static std::atomic<int> Array[N]; variable
158 FooBody<Pad> f( Array ); in Flog()
161 Array[a_i].store(0, std::memory_order_relaxed); in Flog()
188 …HECK(std::find_if_not(Array, Array + i, [](const std::atomic<int>& v) { return v.load(std::memory_… in Flog()
189 …CK(std::find_if_not(Array + i, Array + N, [](const std::atomic<int>& v) { return v.load(std::memor… in Flog()
H A Dconformance_blocked_range.cpp91 unsigned char Array[N]; variable
96 ++Array[i]; in operator ()()
105 if (Array[k] != (k<i)) CHECK(false); in ParallelTest()
106 Array[k] = 0; in ParallelTest()
H A Dconformance_blocked_range2d.cpp112 unsigned char Array[N][N]; variable
119 ++Array[i][j]; in operator ()()
130 if( Array[k][l] != (k<i && l<j) ) REQUIRE(false); in ParallelTest()
131 Array[k][l] = 0; in ParallelTest()
H A Dconformance_blocked_range3d.cpp140 unsigned char Array[N][N][N]; variable
148 ++Array[i][j][k]; in operator ()()
161 if( Array[l][m][n] != (l<i && m<j && n<k) ) REQUIRE(false); in ParallelTest()
162 Array[l][m][n] = 0; in ParallelTest()
/oneTBB/doc/main/tbb_userguide/
H A DBandwidth_and_Cache_Affinity_os.rst95 Improvement from Affinity Dependent on Array Size
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DWavefront.rst137 Each block has an associated atomic counter. Array ``Count``