Home
last modified time | relevance | path

Searched refs:second (Results 1 – 25 of 69) sorted by relevance

123

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h53 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->second))%alignment_of<buffer_ite… in item()
59 …__TBB_ASSERT(!(size_type(&(my_array[i&(my_array_size-1)].begin()->second))%alignment_of<buffer_ite… in item()
64 …valid(size_type i) const { return (i < my_tail) && (i >= my_head) && (item(i).second != no_item); } in my_item_valid()
66 bool my_item_reserved(size_type i) const { return item(i).second == reserved_item; } in my_item_reserved()
78 if(item(i).second != no_item) { in set_my_item()
82 item(i).second = has_item; in set_my_item()
123 item(i).second = no_item; in destroy_item()
141 …tem_valid(i) && !my_item_reserved(i), "item cannot be reserved"); item(i).second = reserved_item; } in reserve_item()
142 …e_type i) { __TBB_ASSERT(my_item_reserved(i), "item is not reserved"); item(i).second = has_item; } in release_item()
166 for( size_type i=0; i<new_size; ++i ) { new_array[i].begin()->second = no_item; } in grow_my_array()
[all …]
H A D_flow_graph_tagged_buffer_impl.h72 la[i].second = &(la[i+1]); in set_up_free_list()
74 la[sz-1].second = nullptr; in set_up_free_list()
109 for( element_type* op = pointer_array[i]; op; op = (element_type *)(op->second)) { in grow_array()
135 element_type* my_elem = p_free_list; p_free_list = (element_type *)(p_free_list->second); in internal_insert_with_key()
137 my_elem->second = p_pointer_array[h]; in internal_insert_with_key()
154 p_next = (element_type *)p->second; in internal_free_buffer()
217 for(element_type* p = pointer_array[i]; p; p = (element_type *)(p->second)) { in find_ref_with_key()
241 for(element_type* p = pointer_array[h]; p; prev = p, p = (element_type *)(p->second)) { in delete_with_key()
246 if(prev) prev->second = p->second; in delete_with_key()
247 else pointer_array[h] = (element_type *)(p->second); in delete_with_key()
[all …]
H A D_concurrent_skip_list.h420 if (insert_result.second) { in insert()
448 return extract_result.second; in unsafe_erase()
814 return std::distance(r.first, r.second); in internal_count()
829 ++result.second; in internal_equal_range()
848 result.second = iterator(curr); in internal_equal_range()
928 bool operator()( const K1& first, const K2& second ) const { in operator()
929 return !my_less_compare(second, first); in operator()
945 if (!insert_result.second) { in internal_insert()
1031 unsafe_erase(eq.first, eq.second); in internal_erase()
1052 result.second = next_node; in internal_extract()
[all …]
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_lru_cache.h103 op.result().second.my_value = my_value_function(key);
104 op.result().second.my_is_ready.store(true, std::memory_order_release);
106 spin_wait_while_eq(op.result().second.my_is_ready, false);
140 if (! --(map_it->second.my_ref_counter)) { in signal_end_of_usage_serial()
153 __TBB_ASSERT(map_it_to_evict->second.my_ref_counter == 0, in signal_end_of_usage_serial()
164 map_it->second.my_history_list_iterator = my_history_list.begin(); in signal_end_of_usage_serial()
176 history_list_iterator_type list_it = map_it->second.my_history_list_iterator; in retrieve_serial()
178 __TBB_ASSERT(map_it->second.my_ref_counter == 0, in retrieve_serial()
184 map_it->second.my_history_list_iterator = my_history_list.end(); in retrieve_serial()
188 ++(map_it->second.my_ref_counter); in retrieve_serial()
[all …]
H A Dblocked_rangeNd.h120 …(), [](const tbb::blocked_range<value_type>& first, const tbb::blocked_range<value_type>& second) { in __TBB_requires()
121 return (first.size() * second.grainsize() < second.size() * first.grainsize()); in __TBB_requires()
/oneTBB/test/conformance/
H A Dconformance_concurrent_hash_map.cpp227 a->second.set_value( i*i ); in FillTable()
241 CHECK_FAST(a->second.value_of()==i*i); in CheckTable()
410 data.set_value(0); a->second = data; in TestIteratorsAndRanges()
412 data.set_value(5*5); a->second = data; in TestIteratorsAndRanges()
614 CHECK_FAST((*a).second == next); in apply()
625 CHECK_FAST((*a).second == i + 1); in apply_impl()
690 ca->second.set_value( ~ca->second.value_of() ); in apply()
692 (*ca).second.set_value( ~ca->second.value_of() ); in apply()
759 CHECK_FAST((cer.first == er.first && cer.second == er.second)); in TraverseTable()
992 a->second.set_value( a->second.value_of()+1 ); in operator ()()
[all …]
H A Dconformance_blocked_range3d.cpp192 oneapi::tbb::blocked_range3d<int> second(first, ps);
197 if (first.rows().size() == second.rows().size()) {
198 if (first.cols().size() == second.cols().size()) {
200 …utils::check_range_bounds_after_splitting(original.pages(), first.pages(), second.pages(), expecte…
203 …utils::check_range_bounds_after_splitting(original.cols(), first.cols(), second.cols(), expected_f…
207 …utils::check_range_bounds_after_splitting(original.rows(), first.rows(), second.rows(), expected_f…
H A Dconformance_blocked_range2d.cpp159 oneapi::tbb::blocked_range2d<int> second(first, ps);
164 if (first.rows().size() == second.rows().size()) {
166 …utils::check_range_bounds_after_splitting(original.cols(), first.cols(), second.cols(), expected_f…
169 …utils::check_range_bounds_after_splitting(original.rows(), first.rows(), second.rows(), expected_f…
H A Dconformance_blocked_rangeNd.cpp263 oneapi::tbb::blocked_rangeNd<int, 2> second(first, ps);
268 if (first.dim(0).size() == second.dim(0).size()) {
270 …utils::check_range_bounds_after_splitting(original.dim(1), first.dim(1), second.dim(1), expected_f…
273 …utils::check_range_bounds_after_splitting(original.dim(0), first.dim(0), second.dim(0), expected_f…
/oneTBB/test/tbb/
H A Dtest_concurrent_hash_map.cpp84 a->second = my_value.second; in operator ()()
90 CHECK(utils::IsEqual()(ca->second, my_value.second)); in operator ()()
138 CHECK(utils::IsEqual()(ca->second, value.second)); in operator ()()
145 CHECK(utils::IsEqual()(ca->second, value.second)); in operator ()()
152 CHECK(utils::IsEqual()(a->second, value.second)); in operator ()()
159 CHECK(utils::IsEqual()(a->second, value.second)); in operator ()()
336 arrRefInt.push_back( ref_int_t( it->first, it->second ) ); in TestSpecificTypes()
625 CHECK(acc->second == i); in test_with_minimalistic_mutex()
635 CHECK(acc->second == i); in test_with_minimalistic_mutex()
645 CHECK(acc->second == i); in test_with_minimalistic_mutex()
[all …]
/oneTBB/test/common/
H A Dconcurrent_associative_common.h127 if((*it).second == targets[i]) {
327 sum.second += Value<Container>::get(*i);
335 sum1.first += sum2.first; sum1.second += sum2.second;
378 ++value.second;
383 ++value.second.bar();
509 for (; it != range.second; it++)
604 for (; it != range.second; it++) {
612 for (; it != range.second; it++) {
693 last_inserted = pib.second;
705 last_inserted = pib.second;
[all …]
H A Drange_based_for_support.h54 return lhs + rhs.second; in operator()
62 return lhs + rhs.second; in operator()
H A Dutils.h392 t1.second.lock().get() == t2.second.lock().get();
411 … const tbb::blocked_range<T>& second, const T& expected_first_end )
415 REQUIRE(second.begin() == expected_first_end);
416 REQUIRE(second.end() == original.end());
417 REQUIRE(first.size() + second.size() == original.size());
H A Dstate_trackable.h162 return !is_state<desired_state>(p.second); in operator()
175 return is_state<desired_state>(p.second); in operator()
/oneTBB/src/tbb/
H A Dmailbox.h131 if ( task_proxy* second = curr->next_in_mailbox.load(std::memory_order_acquire) ) { in internal_pop() local
133 prev_ptr->store(second, std::memory_order_relaxed); in internal_pop()
147 … while ( !(second = curr->next_in_mailbox.load(std::memory_order_acquire)) ) backoff.pause(); in internal_pop()
148 prev_ptr->store( second, std::memory_order_relaxed); in internal_pop()
H A Dpm_client.h49 int delta = min_max_workers.second - my_max_workers; in update_request()
50 set_workers(min_max_workers.first, min_max_workers.second); in update_request()
/oneTBB/doc/main/tbb_userguide/
H A DAdvanced_Topic_Other_Kinds_of_Iteration_Spaces.rst43 - The second of type oneapi::tbb::split
46 The second argument is not used; it serves only to distinguish the
50 second half.
54 constructor is optional and takes the second argument of type
H A Dconcurrent_hash_map.rst58 a->second += 1;
82 printf("%s %d\n",i->first.c_str(),i->second);
119 a->second += 1;
H A Dwork_isolation.rst18 the second (nested) parallel loop blocks execution of the first
27 // The second parallel loop.
130 // Run the second parallel loop in an isolated region to prevent the current thread
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp89 a->second += 1; in operator ()()
107 printf("%s %d\n", i->first.c_str(), i->second); in CountOccurrences()
112 n += i->second; in CountOccurrences()
116 c += i->second - 1; in CountOccurrences()
/oneTBB/examples/migration/recursive_fibonacci/
H A Dfibonacci.cpp55 std::cout << "Fibonacci two tasks impl N = " << res.first << " Avg time = " << res.second in main()
59 std::cout << "Fibonacci single task impl N = " << res.first << " Avg time = " << res.second in main()
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp129 return xRange.second; in Width()
132 return yRange.second; in Height()
135 return xRange.first + xRange.second; in EndX()
138 return yRange.first + yRange.second; in EndY()
/oneTBB/examples/graph/cholesky/
H A Dcholesky.cpp333 tile_t A_block = in.second; in operator ()()
363 tile_t L_block = in0.second; in operator ()()
364 tile_t A_block = in1.second; in operator ()()
410 tile_t A_block = in2.second; in operator ()()
412 tile_t L_block = in0.second; in operator ()()
416 tile_t L1_block = in0.second; in operator ()()
417 tile_t L2_block = in1.second; in operator ()()
704 algorithm *const alg = i->second; in main()
712 algorithm *const alg = alg_iter->second; in main()
/oneTBB/examples/common/utility/
H A Dutility.hpp208 if (!result.second) { in add_arg()
269 pa = &((*it).second); in parse()
280 pa = &((*it).second); in parse()
297 pa = &((*found_positional_arg).second); in parse()
331 const internal::argument& a = (*argument_it).second; in usage_string()
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp237 value sum = f1->second + f2->second; in operator ()()
240 assert(fsum->second == sum); // check value in operator ()()
263 return fresult->second; in ConcurrentHashSerialFib()

123