| /oneTBB/src/tbb/ |
| H A D | observer_proxy.h | 54 void do_notify_entry_observers( observer_proxy*& last, bool worker ); 57 void do_notify_exit_observers( observer_proxy* last, bool worker ); 85 inline void notify_entry_observers( observer_proxy*& last, bool worker ); 88 inline void notify_exit_observers( observer_proxy*& last, bool worker ); 133 if (last == my_tail.load(std::memory_order_relaxed)) in notify_entry_observers() 135 do_notify_entry_observers(last, worker); in notify_entry_observers() 139 if (last == nullptr) { in notify_exit_observers() 142 __TBB_ASSERT(!is_poisoned(last), nullptr); in notify_exit_observers() 143 do_notify_exit_observers( last, worker ); in notify_exit_observers() 144 __TBB_ASSERT(last != nullptr, nullptr); in notify_exit_observers() [all …]
|
| H A D | observer_proxy.cpp | 146 void observer_list::do_notify_entry_observers(observer_proxy*& last, bool worker) { in do_notify_entry_observers() argument 148 observer_proxy* p = last, * prev = p; in do_notify_entry_observers() 176 last = p; in do_notify_entry_observers() 207 void observer_list::do_notify_exit_observers(observer_proxy* last, bool worker) { in do_notify_exit_observers() argument 218 if (p != last) { in do_notify_exit_observers() 243 if (p != last) // the last is already referenced since entry notification in do_notify_exit_observers() 254 __TBB_ASSERT(p->my_ref_count || p == last, nullptr); in do_notify_exit_observers()
|
| H A D | concurrent_monitor.h | 53 inline base_node* last() const { return head.prev; } in last() function 368 for (base_node* n = my_waitset.last(); n != end; n = nxt) { in notify_relaxed() 403 for (base_node* n = my_waitset.last(); n != end; n = next) { in notify_one_relaxed()
|
| H A D | arena_slot.h | 99 void fill_with_canary_pattern ( std::size_t first, std::size_t last ) { in fill_with_canary_pattern() argument 100 for ( std::size_t i = first; i < last; ++i ) in fill_with_canary_pattern()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_for.h | 309 else if (first < last) { in parallel_for_impl() 311 Index end = Index(last - first - 1ul) / step + Index(1); in parallel_for_impl() 321 void parallel_for(Index first, Index last, Index step, const Function& f) { in __TBB_requires() 346 parallel_for_impl(first, last, step, f, partitioner); in __TBB_requires() 352 void parallel_for(Index first, Index last, const Function& f) { in __TBB_requires() 377 parallel_for_impl(first, last, static_cast<Index>(1), f, partitioner); in __TBB_requires() 385 else if (first < last) { in parallel_for_impl() 387 Index end = (last - first - Index(1)) / step + Index(1); in parallel_for_impl() 422 parallel_for_impl(first, last, step, f, partitioner, context); in __TBB_requires() 428 void parallel_for(Index first, Index last, const Function& f, task_group_context &context) { in __TBB_requires() [all …]
|
| H A D | parallel_for_each.h | 478 …for_each_root_task_base(Iterator first, Iterator last, const Body& body, wait_context& w_context, … 479 … : my_first(first), my_last(last), my_wait_context(w_context), my_execution_context(e_context), 623 void run_parallel_for_each( Iterator first, Iterator last, const Body& body, task_group_context& co… 625 if (!(first == last)) { 629 … for_each_root_task<Iterator, Body, ItemType> root_task(first, last, body, w_context, context); 661 void parallel_for_each(Iterator first, Iterator last, const Body& body) { 663 run_parallel_for_each<Iterator, Body>(first, last, body, context); 682 void parallel_for_each(Iterator first, Iterator last, const Body& body, task_group_context& context… 683 run_parallel_for_each<Iterator, Body>(first, last, body, context);
|
| /oneTBB/test/conformance/ |
| H A D | conformance_parallel_for.cpp | 134 void operator()( const T& first, const T& last, const Body& f, empty_partitioner_tag& ) { in operator ()() 135 oneapi::tbb::parallel_for( first, last, f ); in operator ()() 138 oneapi::tbb::parallel_for( first, last, step, f ); in operator ()() 144 void operator()( const T& first, const T& last, const Body& f, Partitioner& p ) { in operator ()() 145 oneapi::tbb::parallel_for( first, last, f, p ); in operator ()() 148 oneapi::tbb::parallel_for( first, last, step, f, p ); in operator ()() 335 SmartIndex last{iterations, change_vector}; in test_pfor_func_invoke() local 338 oneapi::tbb::parallel_for(first, last, &SmartIndex::increase); in test_pfor_func_invoke() 343 oneapi::tbb::parallel_for(first, last, &SmartIndex::increase, aff); in test_pfor_func_invoke() 350 oneapi::tbb::parallel_for(first, last, stride, &SmartIndex::increase); in test_pfor_func_invoke() [all …]
|
| /oneTBB/examples/parallel_reduce/pi/ |
| H A D | main.cpp | 38 number_t last = num_intervals - tail; in compute_pi_serial() local 40 for (number_t slice = 0; slice < last; slice += chunk_size) { in compute_pi_serial() 43 ret += pi_slice_kernel(last, tail); in compute_pi_serial() 64 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
|
| /oneTBB/src/tbbmalloc/ |
| H A D | large_objects.cpp | 488 if (last.load(std::memory_order_relaxed) && in cleanToThreshold() 510 if (last.load(std::memory_order_relaxed)) { in releaseAllToBackend() 543 MALLOC_ASSERT( !last.load(std::memory_order_relaxed) || in putList() 544 …(last.load(std::memory_order_relaxed)->age != 0 && last.load(std::memory_order_relaxed)->age != -1… in putList() 567 if (!last.load(std::memory_order_relaxed)) { in putList() 570 last.store(tail, std::memory_order_relaxed); in putList() 630 if ( !last.load(std::memory_order_relaxed) || in cleanToThreshold() 645 last.store(last.load(std::memory_order_relaxed)->prev, std::memory_order_relaxed); in cleanToThreshold() 646 } while (last.load(std::memory_order_relaxed) && in cleanToThreshold() 650 if (last.load(std::memory_order_relaxed)) { in cleanToThreshold() [all …]
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Reduction.rst | 82 interval [first,last). 88 T AssociativeReduce( const T* first, const T* last, T identity ) { 91 oneapi::tbb::blocked_range<const T*>(first,last), 121 T CombineReduce( const T* first, const T* last, T identity ) { 124 oneapi::tbb::blocked_range<const T*>(first,last), 154 T RepeatableReduce( const T* first, const T* last, T identity ) { 155 if( last-first<=1000 ) { 157 return std::accumulate( first, last, identity ); 160 const T* mid = first+(last-first)/2; 164 [&]{right=RepeatableReduce(mid,last,identity);} [all …]
|
| H A D | Reference_Counting.rst | 65 // Remove reference. Return true if it was the last reference. 79 would both be told incorrectly that they had removed the last
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Initializing_and_Terminating_the_Library.rst | 9 The termination happens when the last such thread exits. 21 …oneapi::tbb::release`` function on all but the last one, then call ``oneapi::tbb::finalize`` for t…
|
| H A D | Using_Circular_Buffers.rst | 9 first filter to create an item and last filter to consume an item are 20 first and last filter are *not* ``serial_in_order``, then you have to
|
| H A D | Working_on_the_Assembly_Line_pipeline.rst | 71 // Pointer to one past last character in sequence 73 // Pointer to one past last available byte in sequence. 90 // Pointer to one past last character in sequence 96 // Append sequence [first,last) to this sequence. 97 void append( char* first, char* last ) { 98 memcpy( logical_end, first, last-first ); 99 logical_end += last-first; 236 last filter of the pipeline, it returns ``void``.
|
| H A D | Lambda_Expressions.rst | 75 expression ``parallel_for(first,last,step,f)`` is like writing 76 ``for(auto i=first; i<last; i+=step)f(i)`` except that
|
| /oneTBB/test/common/ |
| H A D | test_invoke.h | 37 …SmartRange(const Value& first, const Value& last) : base_range(first, last), change_vector(nullptr… in SmartRange() argument 38 SmartRange(const Value& first, const Value& last, std::vector<std::size_t>& cv) in SmartRange() argument 39 : base_range(first, last), change_vector(&cv) {} in SmartRange()
|
| H A D | concurrent_priority_queue_common.h | 281 T elem(my_max), last; in operator() 282 if (q->try_pop(last)) { in operator() 285 REQUIRE_MESSAGE(!less_than(last, elem), "Failed pop/priority test in EmptyBody"); in operator() 286 last = elem; in operator()
|
| /oneTBB/examples/parallel_pipeline/square/ |
| H A D | square.cpp | 78 void append(char* first, char* last) { in append() argument 79 memcpy(logical_end, first, last - first); in append() 80 logical_end += last - first; in append() 248 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
|
| /oneTBB/examples/task_arena/fractal/ |
| H A D | main.cpp | 68 fractal_group fg(video.get_drawing_memory(), threads.last, max_iterations, num_frames); in main() 76 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
|
| /oneTBB/examples/parallel_for/seismic/ |
| H A D | main.cpp | 76 SeismicVideo video(u, options.numberOfFrames, options.threads.last, options.parallel); in main() 94 for (int p = options.threads.first; p <= options.threads.last; in main()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _concurrent_unordered_base.h | 263 concurrent_unordered_base( InputIterator first, InputIterator last, 268 insert(first, last); in concurrent_unordered_base() 272 concurrent_unordered_base( InputIterator first, InputIterator last, in concurrent_unordered_base() argument 277 concurrent_unordered_base( InputIterator first, InputIterator last, in concurrent_unordered_base() argument 432 void insert( InputIterator first, InputIterator last ) { in insert() argument 433 for (; first != last; ++first) { in insert() 503 while(first != last) { in unsafe_erase() 1296 node_ptr last = first; in internal_equal_range() local 1298 last = last->next(); in internal_equal_range() 1299 } while (allow_multimapping && last != nullptr && !last->is_dummy() && in internal_equal_range() [all …]
|
| H A D | _concurrent_skip_list.h | 297 …concurrent_skip_list( InputIterator first, InputIterator last, const key_compare& comp = key_compa… 301 internal_copy(first, last); in concurrent_skip_list() 305 concurrent_skip_list( InputIterator first, InputIterator last, const allocator_type& alloc ) in concurrent_skip_list() argument 306 : concurrent_skip_list(first, last, key_compare(), alloc) {} in concurrent_skip_list() 405 void insert( InputIterator first, InputIterator last ) { in insert() argument 406 while (first != last) { in insert() 457 iterator unsafe_erase( const_iterator first, const_iterator last ) { in unsafe_erase() argument 458 while (first != last) { in unsafe_erase() 1086 void internal_copy( Iterator first, Iterator last ) { in internal_copy() argument 1088 for (auto it = first; it != last; ++it) { in internal_copy()
|
| /oneTBB/doc/main/reference/ |
| H A D | parallel_for_each_semantics.rst | 22 … void parallel_for_each( InputIterator first, InputIterator last, Body body ); // overload (1) 24 …void parallel_for_each( InputIterator first, InputIterator last, Body body, task_group_context& gr…
|
| /oneTBB/examples/common/utility/ |
| H A D | utility.hpp | 461 int last; // first<=last member 474 last((high_ > -1) ? high_ : auto_number_of_threads_()), in thread_number_range() 479 if (first > last) { in thread_number_range() 529 o << range.first << ":" << range.last << ":" << step_function_descriptors[i].mnemonic in operator <<()
|
| /oneTBB/examples/parallel_for_each/parallel_preorder/ |
| H A D | main.cpp | 65 for (int p = threads.first; p <= threads.last; p = threads.step(p)) { in main()
|