Home
last modified time | relevance | path

Searched refs:result (Results 1 – 25 of 88) sorted by relevance

1234

/oneTBB/python/tbb/
H A Dtest.py131 check_timeout_exception(result, lambda result : say(result.get(timeout=1)))
148 check_timeout_exception(result, lambda result : result.get(timeout=0.01))
149 say(result.get())
154 check_timeout_exception(result, lambda result : result.get(timeout=0.01))
155 for i in result.get():
158 for i in result.get():
164 check_timeout_exception(result, lambda result : result.get(timeout=0.01))
165 for i in result.get():
167 for i in result.get():
169 r = result.get()
[all …]
/oneTBB/src/tbbmalloc/
H A DMapMemory.h65 if (result == MAP_FAILED) { in mmapTHP()
74 munmap(result, bytes); in mmapTHP()
80 if (result == MAP_FAILED) { in mmapTHP()
91 munmap(result, offset); in mmapTHP()
94 result = (void*)((uintptr_t)result + offset); in mmapTHP()
106 hint = result; in mmapTHP()
110 return result; in mmapTHP()
116 void* result = nullptr; in MapMemory() local
143 if (result == MAP_FAILED) { in MapMemory()
148 return result; in MapMemory()
[all …]
H A Dfrontend.cpp124 return result; in tlsNumber()
814 return result; in getSmallObjectIndex()
1057 return result; in getEmptyBlock()
2119 return result; in allocateFromFreeList()
2125 if (result) { in allocateFromBumpPtr()
2375 void *result; in allocateAligned() local
2391 result = in allocateAligned()
2403 void *result; in reallocAligned() local
2447 if (result) { in reallocAligned()
3085 if (result) in scalable_calloc()
[all …]
/oneTBB/src/tbb/
H A Darena_slot.cpp35 if (!result) { in get_task_impl()
40 return result; in get_task_impl()
67 d1::task* result = nullptr; in get_task() local
100 if ( result ) { in get_task()
116 if ( result ) { in get_task()
145 return result; in get_task()
153 d1::task* result = nullptr; in steal_task() local
171 if (result) { in steal_task()
183 result = nullptr; in steal_task()
191 } while (!result); in steal_task()
[all …]
H A Dtask_stream.h126 return result; in get_item()
135 d1::task* result = nullptr; in get_item() local
139 result = queue.back(); in get_item()
142 return result; in get_item()
206 d1::task* result = nullptr; in pop_specific() local
217 if( result ) in pop_specific()
224 return result; in pop_specific()
248 d1::task* result = nullptr; in try_pop() local
256 return result; in try_pop()
268 if( result && task_accessor::isolation(*result) == isolation ) { in look_specific()
[all …]
H A Dallocator.cpp192 …void* result = cache_aligned_allocate_handler.load(std::memory_order_acquire)(size, cache_line_siz… in cache_aligned_allocate() local
193 if (!result) { in cache_aligned_allocate()
196 __TBB_ASSERT(is_aligned(result, cache_line_size), "The returned address isn't aligned"); in cache_aligned_allocate()
197 return result; in cache_aligned_allocate()
223 std::uintptr_t result = (base + nfs_size) & ~(nfs_size - 1); in std_cache_aligned_allocate()
226 __TBB_ASSERT(space - (result - base) >= bytes, "Not enough space for the storage"); in std_cache_aligned_allocate()
229 (reinterpret_cast<std::uintptr_t*>(result))[-1] = base; in std_cache_aligned_allocate()
230 return reinterpret_cast<void*>(result); in std_cache_aligned_allocate()
251 void* result = allocate_handler.load(std::memory_order_acquire)(size); in allocate_memory() local
252 if (!result) { in allocate_memory()
[all …]
H A Drml_tbb.cpp82 status_type result; in open() local
85 result = (*open_factory_routine)( *this, server_version, CLIENT_VERSION ); in open()
89 result = st_not_found; in open()
91 return result; in open()
H A Dtask_dispatcher.h130 d1::task* result = get_critical_task(nullptr, ed, isolation, critical_allowed); in get_inbox_or_critical_task() local
131 if (result) in get_inbox_or_critical_task()
132 return result; in get_inbox_or_critical_task()
134 result = get_mailbox_task(inbox, ed, isolation); in get_inbox_or_critical_task()
138 if (isolation != no_isolation && !result && !inbox.empty() && inbox.is_idle_state(true)) { in get_inbox_or_critical_task()
143 return result; in get_inbox_or_critical_task()
152 d1::task* result = get_critical_task(nullptr, ed, isolation, critical_allowed); in get_stream_or_critical_task() local
153 if (result) in get_stream_or_critical_task()
154 return result; in get_stream_or_critical_task()
443 if (d1::task* result = tp->extract_task<task_proxy::mailbox_bit>()) { in get_mailbox_task() local
[all …]
/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DMatrix.hpp32 Matrix result; in operator -() local
35 result.array[i][j] = -x.array[i][j]; in operator -()
36 return result; in operator -()
39 Matrix result; in operator +() local
42 result.array[i][j] = x.array[i][j] + y.array[i][j]; in operator +()
43 return result; in operator +()
46 Matrix result; in operator -() local
49 result.array[i][j] = x.array[i][j] - y.array[i][j]; in operator -()
50 return result; in operator -()
53 Matrix result(0); in operator *() local
[all …]
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp105 value result; in SerialRecursiveFib() local
107 result = n; in SerialRecursiveFib()
110 return result; in SerialRecursiveFib()
320 assert(result); in ParallelPipeFib()
439 value result; in Measure() local
447 return result; in Measure()
459 value result, sum; in main() local
466 assert(result == sum); in main()
468 assert(result == sum); in main()
523 Matrix2x2 result; in operator *() local
[all …]
/oneTBB/test/tbb/
H A Dtest_numa_dist.cpp116 std::vector<DWORD> result(GetMaximumProcessorGroupCount(), 0);
117 result[numaGrp] = example.numaProcessors[numaGrp];
118 REQUIRE(validateProcgrp == result);
128 std::vector<DWORD> result(GetMaximumProcessorGroupCount(), 0);
130 result[numaGrp] = example.numaProcessors[numaGrp] + 1;
132 result[numaGrp] = example.numaProcessors[numaGrp];
133 result[(numaGrp+1)% GetMaximumProcessorGroupCount()] = 1;
135 REQUIRE(validateProcgrp == result);
152 std::vector<DWORD> result(example.numaProcessors.size(), 0); variable
153 …for (size_t i = 0; i < example.numaProcessors.size(); i++) result[i] = 2 * example.numaProcessors[…
[all …]
H A Dtest_environment_whitebox.cpp54 T result = environment_variable_getter(environment_variable_name); in set_and_get_test_variable() local
55 REQUIRE_MESSAGE(result == test_case.second, "Wrong Get<Type>EnvironmentVariable return value"); in set_and_get_test_variable()
68 bool result = false; in alternative_env_variable_checker() local
72 result = !result; in alternative_env_variable_checker()
73 if (!result) return false; in alternative_env_variable_checker()
79 return result; in alternative_env_variable_checker()
87 long result = std::strtol(str, &end, 10); in alternative_env_variable_checker() local
90 if (errno == ERANGE || result < 0 || end == str) { in alternative_env_variable_checker()
91 result = -1; in alternative_env_variable_checker()
96 result = -1; in alternative_env_variable_checker()
[all …]
H A Dtest_concurrent_hash_map.cpp607 CHECK(result); in test_with_minimalistic_mutex()
613 CHECK(result); in test_with_minimalistic_mutex()
707 CHECK(result); in test_chmap_access_mode()
711 result = map.insert(acc, 2L); in test_chmap_access_mode()
712 CHECK(result); in test_chmap_access_mode()
718 CHECK(result); in test_chmap_access_mode()
723 CHECK(result); in test_chmap_access_mode()
727 result = map.find(acc, 1); in test_chmap_access_mode()
728 CHECK(result); in test_chmap_access_mode()
732 result = map.find(acc, 2L); in test_chmap_access_mode()
[all …]
/oneTBB/test/conformance/
H A Dconformance_parallel_reduce.cpp140 const std::size_t result = iterations * (iterations - 1) / 2; in test_preduce_invoke_basic() local
145 CHECK(result == oneapi::tbb::parallel_reduce(range, identity, body, reduction).get()); in test_preduce_invoke_basic()
146 …CHECK(result == oneapi::tbb::parallel_reduce(range, identity, body, reduction, oneapi::tbb::simple… in test_preduce_invoke_basic()
147 …CHECK(result == oneapi::tbb::parallel_reduce(range, identity, body, reduction, oneapi::tbb::auto_p… in test_preduce_invoke_basic()
148 …CHECK(result == oneapi::tbb::parallel_reduce(range, identity, body, reduction, oneapi::tbb::static… in test_preduce_invoke_basic()
150 CHECK(result == oneapi::tbb::parallel_reduce(range, identity, body, reduction, aff).get()); in test_preduce_invoke_basic()
152 …CHECK(result == oneapi::tbb::parallel_deterministic_reduce(range, identity, body, reduction).get()… in test_preduce_invoke_basic()
153 …CHECK(result == oneapi::tbb::parallel_deterministic_reduce(range, identity, body, reduction, oneap… in test_preduce_invoke_basic()
161 test_invoke::SmartValue result = idx; in __anon105f294c0302() local
163 result = result + i; in __anon105f294c0302()
[all …]
/oneTBB/test/common/
H A Dtest_invoke.h53 Value result = idx; in reduction() local
55 result = result + Value(index); in reduction()
57 return Value(result); in reduction()
62 Value result = idx; in scan() local
64 result = result + Value(index); in scan()
65 if (is_final_scan) (*change_vector)[index] = get_real_index(result); in scan()
67 return result; in scan()
H A Dnode_handling_support.h156 typename Container::iterator result,
160 REQUIRE_MESSAGE(result == table.end(),
164 REQUIRE_MESSAGE(*result == *node_value,
168 if (it == result) return;
173 result != table.end()),
182 typename Container::iterator result,
186 check_insert(table, result, node_value);
196 check_insert(table, result.first, node_value);
217 result = table_to_insert.insert(hint..., std::move(nh)); in test_insert_overloads()
223 result = table_to_insert.insert(hint..., std::move(nh)); in test_insert_overloads()
[all …]
H A Diterator.h128 ForwardIterator result = *this; variable
130 return result;
154 RandomIterator result = *this; variable
156 return result;
160 RandomIterator result = *this; variable
162 return result;
212 ConstRandomIterator result = *this; variable
214 return result;
218 ConstRandomIterator result = *this; variable
220 return result;
H A Dcommon_arena_constraints.h349 affinity_mask result = hwloc_bitmap_alloc(); in allocate_empty_affinity_mask() local
350 instance().memory_handler.insert(result); in allocate_empty_affinity_mask()
351 return result; in allocate_empty_affinity_mask()
355 affinity_mask result = hwloc_bitmap_alloc(); in allocate_current_affinity_mask() local
356 instance().memory_handler.insert(result); in allocate_current_affinity_mask()
360 hwloc_bitmap_copy(result, hwloc_topology_get_complete_cpuset(instance().topology)); in allocate_current_affinity_mask()
362 REQUIRE_MESSAGE(!hwloc_bitmap_iszero(result), "Empty current affinity mask."); in allocate_current_affinity_mask()
363 return result; in allocate_current_affinity_mask()
379 std::vector<int> result{}; in get_available_max_threads_values()
382 result.push_back(value); in get_available_max_threads_values()
[all …]
H A Dvector_types.h110 bool result = false; in have_AVX() local
116 result = (info[ECX] & avx_mask) != 0; in have_AVX()
123 result = (ECX & avx_mask); in have_AVX()
125 return result; in have_AVX()
H A Dutils_concurrency_limit.h90 int result = 0; in get_max_procs()
94 if (CPU_ISSET(i, &mask)) ++result; in get_max_procs()
96 maxProcs = result; in get_max_procs()
109 int result = -1; in get_start_affinity_process() local
114 result = i; in get_start_affinity_process()
118 ASSERT(result != -1, nullptr); in get_start_affinity_process()
119 return result; in get_start_affinity_process()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h1110 result.release(); in __TBB_requires()
1117 result.release(); in __TBB_requires()
1124 result.release(); in __TBB_requires()
1131 result.release(); in __TBB_requires()
1138 result.release(); in __TBB_requires()
1145 result.release(); in __TBB_requires()
1153 result.release(); in __TBB_requires()
1161 result.release(); in __TBB_requires()
1168 result.release(); in __TBB_requires()
1175 result.release(); in __TBB_requires()
[all …]
H A Dmutex.h64 bool result = !my_flag.load(std::memory_order_relaxed) && !my_flag.exchange(true); in try_lock() local
65 if (result) { in try_lock()
68 return result; in try_lock()
H A Dspin_mutex.h78 bool result = !m_flag.exchange(true); in try_lock() local
79 if (result) { in try_lock()
82 return result; in try_lock()
/oneTBB/include/oneapi/tbb/detail/
H A D_machine.h165 intptr_t result = 0; in machine_log2()
167 if( sizeof(x) > 4 && (uintptr_t tmp = x >> 32) ) { x = tmp; result += 32; } in machine_log2()
168 if( uintptr_t tmp = x >> 16 ) { x = tmp; result += 16; } in machine_log2()
169 if( uintptr_t tmp = x >> 8 ) { x = tmp; result += 8; } in machine_log2()
170 if( uintptr_t tmp = x >> 4 ) { x = tmp; result += 4; } in machine_log2()
171 if( uintptr_t tmp = x >> 2 ) { x = tmp; result += 2; } in machine_log2()
173 return (x & 2) ? result + 1 : result; in machine_log2()
/oneTBB/examples/migration/recursive_fibonacci/
H A Dfibonacci.cpp33 unsigned long result; in measure() local
36 result = f(number); in measure()
44 result, in measure()

1234