Home
last modified time | relevance | path

Searched refs:array (Results 1 – 25 of 47) sorted by relevance

12

/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DMatrix.hpp22 float array[n][n]; member in Matrix
29 array[i][j] = i == j ? z : 0; in Matrix()
35 result.array[i][j] = -x.array[i][j]; in operator -()
42 result.array[i][j] = x.array[i][j] + y.array[i][j]; in operator +()
49 result.array[i][j] = x.array[i][j] - y.array[i][j]; in operator -()
57 result.array[i][j] += x.array[i][k] * y.array[k][j]; in operator *()
/oneTBB/include/oneapi/tbb/
H A Dparallel_sort.h61 …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()
67 return median_of_three(array, in pseudo_median_of_nine()
68 median_of_three(array, 0 , offset, offset * 2), in pseudo_median_of_nine()
75 RandomAccessIterator array = range.begin; in split_range() local
77 std::size_t m = pseudo_median_of_nine(array, range); in split_range()
78 if( m != 0 ) std::iter_swap(array, array + m); in split_range()
89 } while( comp(*first_element, array[j]) ); in split_range()
94 } while( comp(array[i], *first_element) ); in split_range()
96 std::iter_swap(array + i, array + j); in split_range()
[all …]
H A Denumerable_thread_specific.h109 struct array {
110 array* next;
137 std::atomic<array*> my_root;
144 array* allocate( std::size_t lg_size ) {
146 array* a = static_cast<array*>(create_array(sizeof(array) + n * sizeof(slot)));
151 void deallocate(array* a) {
206 while ( array* r = my_root.load(std::memory_order_relaxed) ) {
247 array* r = my_root.load(std::memory_order_acquire);
252 array* a = allocate(s);
256 array* new_r = r;
[all …]
H A Dblocked_rangeNd.h113 std::array<tbb::blocked_range<value_type>, N> my_dims; in __TBB_requires()
/oneTBB/test/common/
H A Dallocator_test_common.h40 void zero_fill(void* array, size_t n) { in zero_fill() argument
41 memset(array, 0, sizeof(T)*n); in zero_fill()
176 array[k] = a.allocate(k); in TestAllocatorConcept()
187 a.deallocate(array[k], k); in TestAllocatorConcept()
230 REQUIRE(array[i] == nullptr); in check_allocate()
232 array[i] = a.allocate(size); in check_allocate()
250 array[i] = nullptr; in check_deallocate()
254 pointer_type array[256]; in operator() local
257 array[k] = nullptr; in operator()
260 if(!array[i]) check_allocate(array, i, thread_id); in operator()
[all …]
H A Dtest_follows_and_precedes_api.h51 std::array<PredecessorType, 3>& preds,
52 std::array<MessageType, 3>& messages) {
60 std::array<PredecessorType, 3>& preds,
61 std::array<MessageType, 3>& messages,
77 std::array<PredecessorType, 3>& preds,
78 std::array<MessageType, 3>& messages,
94 std::array<PredecessorType, 3>& preds,
95 std::array<MessageType, 3>& messages,
109 std::array<PredecessorType, 3>& preds,
110 std::array<MessageType, 3>& messages,
[all …]
H A Dutils.h118 static constexpr std::array<uint64_t, 64> Primes = {{
269 void zero_fill( void* array, std::size_t n ) {
270 std::memset(array, 0, sizeof(T) * n);
405 tbb::blocked_range<T*> make_blocked_range( T(& array)[N] ) {
406 return tbb::blocked_range<T*>(array, array + N);
H A Dconcurrent_associative_common.h343 void CheckRange( atomic_byte_type array[], int n, bool allow_multimapping, int odd_count ) {
347 REQUIRE(array[k] == odd_count);
349 REQUIRE(array[k] == 2);
354 REQUIRE(array[k] == 1);
749 atomic_byte_type* const array;
752 : n(num), array(arr) {}
760 ++array[k];
801 atomic_byte_type* array = new atomic_byte_type[items];
802 std::memset(static_cast<void*>(array), 0, items * sizeof(atomic_byte_type));
813 std::memset(static_cast<void*>(array), 0, items * sizeof(atomic_byte_type));
[all …]
/oneTBB/src/tbb/
H A Dparallel_pipeline.cpp119 task_info* array; member in tbb::detail::r1::input_buffer
157 array(nullptr), in input_buffer()
165 __TBB_ASSERT( array, nullptr ); in input_buffer()
170 __TBB_ASSERT( array, nullptr ); in ~input_buffer()
171 cache_aligned_allocator<task_info>().deallocate(array,array_size); in ~input_buffer()
172 poison_pointer( array ); in ~input_buffer()
206 array[token&(array_size-1)] = info; in try_put_token()
221 task_info& item = array[++low_token & (array_size-1)]; in try_to_spawn_task_for_next_token()
256 task_info* old_array = array; in grow()
262 array = new_array; in grow()
/oneTBB/test/tbb/
H A Dtest_parallel_sort.cpp373 sort_array_test([](int (&array)[array_size]) { in __anon54e49e5e0202()
374 tbb::parallel_sort(array); in __anon54e49e5e0202()
382 sort_array_test([](int (&array)[array_size]) { in __anon54e49e5e0302()
383 tbb::parallel_sort(minimal_span<int>{array, array_size}); in __anon54e49e5e0302()
390 sort_array_test([](int (&array)[array_size]) { in __anon54e49e5e0402()
391 const minimal_span<int> span(array, array_size); in __anon54e49e5e0402()
H A Dtest_concurrent_queue_whitebox.cpp76 q.my_queue_representation->array[i].head_counter = k; in test_flogger_help()
77 q.my_queue_representation->array[i].tail_counter = k; in test_flogger_help()
H A Dtest_join_node_preview.cpp35 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in jn_follows_and_precedes()
69 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in jn_msg_key_matching_follows_and_precedes()
H A Dtest_concurrent_vector.cpp42 tbb::concurrent_vector<int> array(n); in TestSort() local
44 array.at(i) = (i*7)%n; in TestSort()
46 std::sort( array.begin(), array.end() ); in TestSort()
48 REQUIRE( array[i]==i ); in TestSort()
H A Dtest_scheduler_mix.cpp273 std::array<std::uint64_t, numActions> mCounters;
382 std::array<ArenaPtrRWMutex, maxArenas> mArenaTable;
H A Dtest_overwrite_node.cpp157 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in test_follows_and_precedes_api()
H A Dtest_write_once_node.cpp181 std::array<msg_t, 3> messages_for_follows= {msg_t(), msg_t(), msg_t()}; in test_follows_and_precedes_api()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_regression.cpp57 char* array[take_out_count]; in TestBootstrapLeak() local
59 array[i] = a.allocate( alloc_size ); in TestBootstrapLeak()
88 a.deallocate( array[i], alloc_size ); in TestBootstrapLeak()
/oneTBB/doc/main/tbb_userguide/
H A Dconcurrent_vector_ug.rst7 ``A concurrent_vector<T>`` is a dynamically growable array of ``T``. It
15 Method ``push_back(x)`` safely appends x to the array. Method
50 A ``concurrent_vector<T>`` never moves an element until the array is
H A DPartitioner_Summary.rst52 temporary array proportional to the size of the range. With a limited
53 subrange size, you can use an automatic variable for the array
/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp742 bool* array = new bool[n]; in TraverseTable() local
743 memset( array, 0, n*sizeof(bool) ); in TraverseTable()
753 array[k] = true; in TraverseTable()
769 delete[] array; in TraverseTable()
860 AtomicByte* const array; member
863 array(array_) in ParallelTraverseBody()
869 ++array[k]; in operator ()()
889 AtomicByte* array = new AtomicByte[n]; in ParallelTraverseTable() local
894 Check( array, n, expected_size ); in ParallelTraverseTable()
900 Check( array, n, expected_size ); in ParallelTraverseTable()
[all …]
H A Dconformance_parallel_for.cpp93 FooBody( const FooBody& other ) : array(other.array), state(other.state) { in FooBody()
99 CHECK_FAST(array[k].load(std::memory_order_relaxed) == 0); in operator ()()
100 array[k].store(1, std::memory_order_relaxed); in operator ()()
105 std::atomic<int>* array; member in FooBody
109 FooBody( std::atomic<int>* array_ ) : array(array_), state(LIVE) {} in FooBody()
/oneTBB/doc/main/reference/
H A Dparallel_sort_ranges_extension.rst61 #include <array>
66 static std::array<int, 3> arr = {3, 2, 1};
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_queue_base.h436 array[index].clear(alloc); in clear()
452 array[queue_idx].assign(src.array[queue_idx], alloc, construct_item); in assign()
456 array[i].clear_and_invalidate(alloc); in assign()
494 return array[index(k)]; in choose()
497 alignas(max_nfs_size) micro_queue_type array[n_queue];
524 my_array[i] = my_queue_rep->array[i].get_head_page(); in concurrent_queue_iterator_base()
/oneTBB/doc/main/reference/scalable_memory_pools/
H A Dmalloc_replacement_log.rst44 …riable or be ``NULL``. If it is not ``NULL``, the function writes there the address of an array of
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DElementwise.rst86 array padded with zeros such that ``x[k]``\ returns zero when ``k<0``

12