Home
last modified time | relevance | path

Searched refs:M (Results 1 – 25 of 26) sorted by relevance

12

/oneTBB/test/conformance/
H A Dconformance_mutex.h28 template<typename M, typename Counter = utils::Counter<M>>
55 template<typename M>
57 M tested_mutex; in TestTryAcquire()
85 template<typename M>
87 M tested_mutex; in TestTryAcquireReader()
124 M mutex;
212 M mutex; in TestRWStateMultipleChange()
228 M my_iso_mutex;
370 M& my_mutex;
381 M m; in TestNullMutex()
[all …]
H A Dconformance_concurrent_queue.cpp40 static constexpr std::size_t M = 10000; variable
650 for (std::size_t j = 0; j < M; ++j) { in operator ()()
715 int expected = int( nthread * ((M - 1) * M / 2) + ((prefill - 1) * prefill) / 2); in TestPushPop()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_cache_impl.h27 template< typename T, typename M=spin_mutex >
59 typedef M mutex_type;
91 typedef M mutex_type;
149 typedef M mutex_type;
205 predecessor_cache<T, M>::reset(); in reset()
210 predecessor_cache<T, M>::clear(); in clear()
223 typedef M mutex_type;
274 template<typename M>
278 typedef M mutex_type;
336 typedef M mutex_type;
[all …]
H A D_concurrent_unordered_base.h60 template<typename M, typename V>
64 template<typename M, typename T, typename U>
65 friend bool operator==( const solist_iterator<M,T>& i, const solist_iterator<M,U>& j );
66 template<typename M, typename T, typename U>
67 friend bool operator!=( const solist_iterator<M,T>& i, const solist_iterator<M,U>& j );
H A D_flow_graph_join_impl.h1217 template<int M, template<class> class PT, typename OutputTuple, typename JP>
1218 class unfolded_join_node : public join_base<M,PT,OutputTuple,JP>::type {
1220 typedef typename wrap_tuple_elements<M, PT, OutputTuple>::type input_ports_type;
/oneTBB/test/tbb/
H A Dtest_mutex.h29 template <typename M>
31 using mutex_type = M;
33 M mutex;
54 using mutex_type = M;
56 M mutex;
170 template <typename M>
172 Counter<M> counter; in test_basic()
180 template <typename M>
191 template <typename M>
194 test_basic<M>(p); in test()
[all …]
H A Dtest_write_once_node.cpp30 #define M 4 macro
45 for (size_t i = 0; i < M; ++i) { in simple_read_write_tests()
60 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
65 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
91 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
95 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
99 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
141 for (int i = 0; i < M; ++i) { in parallel_read_write_tests()
156 for (int i = 0; i < M; ++i) { in parallel_read_write_tests()
160 for (int i = 0; i < M; ++i) { in parallel_read_write_tests()
[all …]
H A Dtest_overwrite_node.cpp34 #define M 5 macro
44 for (size_t i = 0; i < M; ++i) { in simple_read_write_tests()
57 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
71 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
75 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
79 for (int i = 0; i < M; ++i) { in simple_read_write_tests()
114 for (size_t i = 0; i < M; ++i) { in parallel_read_write_tests()
118 for (int i = 0; i < M; ++i) { in parallel_read_write_tests()
132 for (int i = 0; i < M; ++i) { in parallel_read_write_tests()
136 for (int i = 0; i < M; ++i) { in parallel_read_write_tests()
[all …]
H A Dtest_openmp.cpp144 const int M = 17 * 17; variable
146 data_type A[M], B[N];
147 data_type expected[M+N], actual[M+N];
165 for (int m = 1; m <= M; m *= 17) {
H A Dtest_mutex.cpp97 template<typename M>
100 utils::Counter<M> counter; in TestTransaction()
106 …for(tbb::blocked_range<std::size_t>(0, n, 2), AddOne_CheckTransaction<utils::Counter<M>>(counter)); in TestTransaction()
/oneTBB/doc/main/tbb_userguide/
H A Dappendix_B.rst19 int M, N;
31 for( int i=0; i<M; ++ ) {
51 int M, N;
66 std::vector<pthread_t> id( M );
68 for( int i=0; i<M; ++i )
71 for( int i=0; i<M; ++i )
H A Duse_limiter_node.rst27 the example below, an ``input_node`` will generate ``M`` big objects. But the
29 at a time, and to prevent the ``input_node`` from generating all ``M`` big
45 if ( src_count < M ) {
75 The example above prevents the ``input_node`` from generating all ``M`` big
H A DMutual_Exclusion.rst113 type ``M``, the corresponding lock type is ``M::scoped_lock``.
H A Dcreate_token_based_system.rst47 In the example below, there is an ``input_node`` that generates ``M`` big
69 if ( src_count < M ) {
H A Duse_concurrency_limits.rst46 if ( src_count < M ) {
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp161 template <typename M>
163 M &mutex;
166 SharedSerialFibBody(M &m) : mutex(m) {} in SharedSerialFibBody()
170 typename M::scoped_lock lock(mutex); in operator ()()
196 template <class M>
202 M mutex; in SharedSerialFib()
203 parallel_for(oneapi::tbb::blocked_range<int>(0, 4, 1), SharedSerialFibBody<M>(mutex)); in SharedSerialFib()
318 Matrix2x2 M; in ParallelPipeFib() local
319 bool result = Queue.try_pop(M); // get last element in ParallelPipeFib()
321 value res = M.v[0][0]; // get value in ParallelPipeFib()
H A DREADME.md21 fibonacci K [M[:N]] [R]
24 * `[M:N]` -a range of numbers of threads to be used.
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp62 M[i][j] = 0.125; in InitializeUniverse()
67 M[i][j] = 0.5; in InitializeUniverse()
72 M[i][j] = 0.3; in InitializeUniverse()
111 V[pulseY][pulseX] += 64 * sqrt(M[pulseY][pulseX]) * exp(-t * t); in UpdatePulse()
148 S[i][j] += M[i][j] * (V[i][j + 1] - V[i][j]); in UpdateStress()
149 T[i][j] += M[i][j] * (V[i + 1][j] - V[i][j]); in UpdateStress()
H A Duniverse.hpp57 ValueType M[MaxHeight][MaxWidth]; member in Universe
/oneTBB/examples/parallel_for/game_of_life/
H A DREADME.md20 game_of_life [M[:N] -t execution_time] [-h]
23 * `M:N` - range of numbers of threads to be used.
/oneTBB/doc/
H A Dmake.bat46 %SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
50 %SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
/oneTBB/test/common/
H A Dutils.h420 template<typename M>
422 using mutex_type = M;
423 M mutex;
427 template<typename M>
429 using mutex_type = M;
430 M mutex;
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DReference_Counting.rst135 M. Michael, "Hazard Pointers: Safe Memory Reclamation for Lock-Free
140 M. Herlihy, V. Luchangco, and M. Moir, "The Repeat Offender Problem:
H A DAgglomeration.rst161 #. **M**\ apping – map tasks onto processors. The oneTBB task
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h141 template<typename T, typename M> class successor_cache;
142 template<typename T, typename M> class broadcast_cache;
143 template<typename T, typename M> class round_robin_cache;
144 template<typename T, typename M> class predecessor_cache;
145 template<typename T, typename M> class reservable_predecessor_cache;
267 template<typename TT, typename M> friend class successor_cache;
373 template<typename TT, typename M> friend class successor_cache;

12