Home
last modified time | relevance | path

Searched refs:m (Results 1 – 25 of 62) sorted by relevance

123

/oneTBB/examples/parallel_for/tachyon/src/
H A Dapigeom.cpp140 xinc = wx / ((apiflt)m); in rt_sheightfield()
145 for (x = 0; x < m; x++) { in rt_sheightfield()
146 addr = y * m + x; in rt_sheightfield()
153 for (x = 1; x < m; x++) { in rt_sheightfield()
157 normals[y * m] = normals[y * m + (m - 1)] = rt_vector(0.0, 1.0, 0.0); in rt_sheightfield()
161 addr = y * m + x; in rt_sheightfield()
165 -(field[addr + m] - field[addr - m]) / (2.0 * yinc)); in rt_sheightfield()
174 addr = y * m + x; in rt_sheightfield()
256 totalsize = m * n; in rt_landscape()
271 field[m - 1 + m * (n - 1)] = 1.0 + (rand() % 100) / 100.0; in rt_landscape()
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_scoped_lock.h36 acquire(m); in unique_scoped_lock()
44 void acquire(Mutex& m) { in acquire() argument
46 m_mutex = &m; in acquire()
47 m.lock(); in acquire()
56 m_mutex = &m; in try_acquire()
86 acquire(m, write);
104 m_mutex = &m;
114 bool succeed = write ? m.try_lock() : m.try_lock_shared();
116 m_mutex = &m;
125 Mutex* m = m_mutex; in release() local
[all …]
H A D_rtm_rw_mutex.h72 …scoped_lock(rtm_rw_mutex& m, bool write = true) : m_mutex(nullptr), m_transaction_state(rtm_type::… in alignas()
73 acquire(m, write); in alignas()
88 inline void acquire(rtm_rw_mutex& m, bool write = true); in alignas()
91 inline bool try_acquire(rtm_rw_mutex& m, bool write = true); in alignas()
145 void rtm_rw_mutex::scoped_lock::acquire(rtm_rw_mutex& m, bool write) { in acquire() argument
148 r1::acquire_writer(m, *this); in acquire()
150 r1::acquire_reader(m, *this); in acquire()
155 bool rtm_rw_mutex::scoped_lock::try_acquire(rtm_rw_mutex& m, bool write) { in try_acquire() argument
158 return r1::try_acquire_writer(m, *this); in try_acquire()
160 return r1::try_acquire_reader(m, *this); in try_acquire()
H A D_rtm_mutex.h69 scoped_lock(rtm_mutex& m) : m_mutex(nullptr), m_transaction_state(rtm_state::rtm_none) { in alignas()
70 acquire(m); in alignas()
85 void acquire(rtm_mutex& m); in alignas()
88 bool try_acquire(rtm_mutex& m); in alignas()
120 inline void rtm_mutex::scoped_lock::acquire(rtm_mutex& m) { in acquire() argument
122 r1::acquire(m, *this); in acquire()
126 inline bool rtm_mutex::scoped_lock::try_acquire(rtm_mutex& m) { in try_acquire() argument
128 return r1::try_acquire(m, *this); in try_acquire()
H A D_pipeline_filters.h65 explicit base_filter( unsigned int m ) : in base_filter() argument
68 my_filter_mode(m), in base_filter()
247 concrete_filter(unsigned int m, const Body& body) : base_filter(m), my_body(body) {}
269 concrete_filter(unsigned int m, const Body& body) :
270 base_filter(m | filter_may_emit_null),
294 concrete_filter(unsigned int m, const Body& body) : base_filter(m), my_body(body) {}
308 concrete_filter(unsigned int m, const Body& body) : base_filter(m), my_body(body) {}
440 filter_node_leaf( unsigned int m, const Body& b ) : my_mode(m), my_body(b) {}
/oneTBB/src/tbb/
H A Drtm_rw_mutex.cpp87 s.m_mutex = &m; in acquire_writer()
127 s.m_mutex = &m; in acquire_reader()
144 s.m_mutex = &m; in acquire_reader()
161 d1::rtm_rw_mutex& m = *s.m_mutex; in upgrade() local
165 acquire_writer(m, s, false); in upgrade()
203 acquire_writer(m, s, /*only_speculate=*/true); in try_acquire_writer()
209 if (m.try_lock()) { in try_acquire_writer()
210 s.m_mutex = &m; in try_acquire_writer()
223 acquire_reader(m, s, /*only_speculate=*/true); in try_acquire_reader()
229 if (m.try_lock_shared()) { in try_acquire_reader()
[all …]
H A Drtm_mutex.cpp64 if(m.m_flag.load(std::memory_order_acquire)) { in acquire()
66 spin_wait_while_eq(m.m_flag, true); in acquire()
72 if(m.m_flag.load(std::memory_order_relaxed)) { in acquire()
78 s.m_mutex = &m; in acquire()
86 s.m_mutex = &m; in acquire()
92 static bool try_acquire(d1::rtm_mutex& m, d1::rtm_mutex::scoped_lock& s) { in try_acquire()
93 acquire(m, s, /*only_speculate=*/true); in try_acquire()
99 if (m.try_lock()) { in try_acquire()
100 s.m_mutex = &m; in try_acquire()
109 rtm_mutex_impl::acquire(m, s, only_speculate); in acquire()
[all …]
H A Dqueuing_rw_mutex.cpp164 s.my_mutex = &m; in acquire()
258 if( m.q_tail.load(std::memory_order_relaxed) ) in try_acquire()
275 s.my_mutex = &m; in try_acquire()
577 static bool is_writer(const d1::queuing_rw_mutex::scoped_lock& m) { in is_writer()
581 static void construct(d1::queuing_rw_mutex& m) { in construct()
582 suppress_unused_warning(m); in construct()
583 ITT_SYNC_CREATE(&m, _T("tbb::queuing_rw_mutex"), _T("")); in construct()
588 queuing_rw_mutex_impl::acquire(m, s, write); in acquire()
592 return queuing_rw_mutex_impl::try_acquire(m, s, write); in try_acquire()
611 void __TBB_EXPORTED_FUNC construct(d1::queuing_rw_mutex& m) { in construct() argument
[all …]
H A Dmisc_ex.cpp180 for ( int m = 0; availableProcs < maxProcs && m < numMasks; ++m ) { in initialize_hardware_concurrency_info() local
182 if ( CPU_ISSET( i, processMask + m ) ) in initialize_hardware_concurrency_info()
293 DWORD_PTR pam, sam, m = 1;
296 for ( std::size_t i = 0; i < sizeof(DWORD_PTR) * CHAR_BIT; ++i, m <<= 1 ) {
297 if ( pam & m )
/oneTBB/test/tbb/
H A Dtest_openmp.cpp38 for (int i = 0; i < m + n - 1; ++i) { in SerialConvolve()
40 int finish = i < m ? i + 1 : m; in SerialConvolve()
84 for (int i = 0; i < m + n - 1; ++i) { in OpenMP_TBB_Convolve()
86 int finish = i < m ? i + 1 : m; in OpenMP_TBB_Convolve()
98 const int m; member in OuterBody
115 int finish = i < m ? i + 1 : m; in operator ()()
127 tbb::parallel_for(tbb::blocked_range<int>(0, m + n - 1, 10), OuterBody(c, a, m, b, n, p)); in TBB_OpenMP_Convolve()
150 void RunTest( Func F, int m, int n, int p) { in RunTest() argument
152 memset(actual, -1, (m + n) * sizeof(data_type)); in RunTest()
153 F(actual, A, m, B, n, p); in RunTest()
[all …]
H A Dtest_limiter_node.cpp381 int m = 0; in test_decrementer() local
385 CHECK_MESSAGE( ( !limit.try_put( m++ )), "Closed limiter node's accepts message." ); in test_decrementer()
390 CHECK_MESSAGE( ( !limit.try_put( m )), "Limiter node's gate is not closed." ); in test_decrementer()
393 int actual = -1; m = 0; in test_decrementer()
395 CHECK_MESSAGE( actual == expected[m++], "" ); in test_decrementer()
411 actual = -1; m = 0; in test_decrementer()
413 CHECK_MESSAGE( actual == expected2[m++], "" ); in test_decrementer()
424 m = 0; in test_decrementer()
425 while( limit3.try_put( m ) ){ m++; }; in test_decrementer()
428 actual = -1; m = 0; in test_decrementer()
[all …]
H A Dtest_scheduler_mix.cpp123 acquire(m); in ScopedLock()
136 void acquire(PtrRWMutex& m) { in acquire() argument
139 mMutex = &m; in acquire()
144 bool tryAcquire(PtrRWMutex& m, bool write = true) { in tryAcquire() argument
145 bool succeed = write ? m.tryLock() : m.tryLockShared(); in tryAcquire()
147 mMutex = &m; in tryAcquire()
156 PtrRWMutex* m = mMutex; in clear() local
158 m->clear(); in clear()
164 PtrRWMutex* m = mMutex; in release() local
168 m->unlock(); in release()
[all …]
/oneTBB/test/conformance/
H A Dconformance_limiter_node.cpp111 int m = 0; variable
123 int actual = -1; m = 0;
125 CHECK_MESSAGE(actual == expected[m++], "" );
141 actual = -1; m = 0;
143 CHECK_MESSAGE(actual == expected2[m++], "" );
154 m = 0;
155 while( limit3.try_put( m ) ){ m++; };
158 actual = -1; m = 0;
174 m = 0;
175 while( limit4.try_put( m ) ){ m++; };
[all …]
H A Dconformance_mutex.h241 acquire(m); in scoped_lock()
249 my_mutex = &m; in acquire()
283 my_mutex = &m; in acquire()
381 M m; in TestNullMutex() local
382 m.lock(); in TestNullMutex()
384 m.unlock(); in TestNullMutex()
390 M m; in TestNullRWMutex() local
392 m.lock(); in TestNullRWMutex()
394 m.lock_shared(); in TestNullRWMutex()
396 m.unlock_shared(); in TestNullRWMutex()
[all …]
/oneTBB/examples/parallel_reduce/primes/
H A Dprimes.cpp63 NumberType m; member in Multiples
65 m = NumberType(sqrt(double(n))); in Multiples()
67 m += m & 1; in Multiples()
68 my_is_composite = new bool[m / 2]; in Multiples()
69 my_striker = new NumberType[m / 2]; in Multiples()
70 my_factor = new NumberType[m / 2]; in Multiples()
72 memset(my_is_composite, 0, m / 2); in Multiples()
114 m(f.m), in Multiples()
252 NumberType m = multiples.m; in operator ()() local
263 NumberType window_size = m; in operator ()()
[all …]
/oneTBB/include/oneapi/tbb/
H A Dqueuing_mutex.h60 scoped_lock(queuing_mutex& m) { in scoped_lock() argument
61 acquire(m); in scoped_lock()
74 void acquire( queuing_mutex& m ) { in acquire() argument
79 m_mutex = &m; in acquire()
85 scoped_lock* pred = m.q_tail.exchange(this); in acquire()
87 call_itt_notify(prepare, &m); in acquire()
93 call_itt_notify(acquired, &m); in acquire()
98 bool try_acquire( queuing_mutex& m ) { in try_acquire() argument
110 if (!m.q_tail.compare_exchange_strong(expected, this, std::memory_order_acq_rel)) in try_acquire()
113 m_mutex = &m; in try_acquire()
[all …]
H A Dqueuing_rw_mutex.h81 scoped_lock( queuing_rw_mutex& m, bool write=true ) {
83 acquire(m,write);
96 void acquire( queuing_rw_mutex& m, bool write=true );
99 bool try_acquire( queuing_rw_mutex& m, bool write=true );
172 inline void queuing_rw_mutex::scoped_lock::acquire(queuing_rw_mutex& m,bool write) { in acquire() argument
173 r1::acquire(m, *this, write); in acquire()
176 inline bool queuing_rw_mutex::scoped_lock::try_acquire(queuing_rw_mutex& m, bool write) { in try_acquire() argument
177 return r1::try_acquire(m, *this, write); in try_acquire()
H A Dparallel_sort.h60 …std::size_t median_of_three( const RandomAccessIterator& array, std::size_t l, std::size_t m, std:… in median_of_three() argument
61 …return comp(array[l], array[m]) ? ( comp(array[m], array[r]) ? m : ( comp(array[l], array[r]) ? r … in median_of_three()
62 … : ( comp(array[r], array[m]) ? m : ( comp(array[r], array[l]) ? r : l ) ); in median_of_three()
77 std::size_t m = pseudo_median_of_nine(array, range); in split_range() local
78 if( m != 0 ) std::iter_swap(array, array + m); in split_range()
H A Dconcurrent_hash_map.h261 hashcode_type m_now, m_old = m; in check_mask_race()
308 for (size_type m = my_mask.load(std::memory_order_relaxed); buckets > m; in reserve() local
557 if( m > my_grainsize ) { in set_midpoint()
558 m = my_begin.my_index + m/2u; in set_midpoint()
1010 __TBB_ASSERT((m&(m+1))==0, "data structure is invalid"); in __TBB_requires()
1284 __TBB_ASSERT((m&(m+1))==0, "data structure is invalid"); in __TBB_requires()
1287 bucket_accessor b( this, h & m ); in __TBB_requires()
1471 __TBB_ASSERT((m&(m+1))==0, "data structure is invalid"); in __TBB_requires()
1472 h &= m; in __TBB_requires()
1476 b = this->get_bucket( h &= m ); in __TBB_requires()
[all …]
/oneTBB/src/tbbmalloc/
H A DSynchronize.h53 scoped_lock(MallocMutex& m) : m_mutex(m), m_taken(true) { in scoped_lock() argument
54 m.lock(); in scoped_lock()
56 scoped_lock(MallocMutex& m, bool block, bool *locked) : m_mutex(m), m_taken(false) { in scoped_lock() argument
58 m.lock(); in scoped_lock()
61 m_taken = m.try_lock(); in scoped_lock()
/oneTBB/examples/parallel_for/game_of_life/
H A DEvolution.hpp45 Evolution(Matrix* m, //! beginning matrix including initial pattern in Evolution() argument
48 : m_matrix(m), in Evolution()
109 SequentialEvolution(Matrix* m, BoardPtr board) : Evolution(m, board) {} in SequentialEvolution() argument
120 ParallelEvolution(Matrix* m, BoardPtr board) : Evolution(m, board), m_parallel_time(0) { in ParallelEvolution() argument
/oneTBB/doc/main/tbb_userguide/
H A DEdges.rst26 function_node< int, int > m( g, 1, []( int v ) -> int {
33 make_edge( n, m );
40 Now there are two ``function_node`` ``s``, ``n`` and ``m``. The call to ``make_edge`` creates
41 an edge from ``n`` to ``m``. The node ``n`` is created with unlimited concurrency,
42 while ``m`` has a concurrency limit of 1. The invocations of ``n`` can all
43 proceed in parallel, while the invocations of ``m`` will be serialized.
44 Because there is an edge from ``n`` to ``m``, each value ``v``, returned by ``n``, will
45 be automatically passed to node ``m`` by the runtime library.
H A DMapping_Nodes2Tasks.rst9 m will be referred to as λ\ :sub:`n` and λ\ :sub:`m`, respectively. The
32 As each task from n finishes, it puts its output to m, since m is a
33 successor of n. Unlike node n, m has been constructed with a concurrency
35 it sequentially spawns tasks to execute its body, λ\ :sub:`m`, on the
/oneTBB/test/common/
H A Dallocator_stl_test_common.h53 Map m(typename Map::key_compare(), a); in TestMap()
56 m.insert(value_type(i,i*i)); in TestMap()
58 REQUIRE(m.find(i)->second == i * i); in TestMap()
74 MoveOperationTracker(MoveOperationTracker&& m) noexcept : my_value( m.my_value ) { in MoveOperationTracker()
80 MoveOperationTracker& operator=(MoveOperationTracker&& m) noexcept {
81 my_value = m.my_value;
89 bool operator==(const MoveOperationTracker& m) const {
90 return my_value == m.my_value;
/oneTBB/python/
H A DREADME.md16 …el-Distribution-for-Python/TBB-module-Unleash-parallel-performance-of-Python-programs/m-p/1074459).
32 - `python3 -m tbb -h` - Print documentation on command-line interface.
34 …- `python3 -m tbb your_script.py` - Run your_script.py in context of `with tbb.Monkey():` when one…
35 …- `python3 -m tbb --ipc your_script.py` - Run your_script.py in context of `with tbb.Monkey():` wh…
38 - `python3 -m TBB test` - run test for oneTBB module for Python.
39 - `python3 -m tbb test` - run test for oneTBB module for Python.

123