Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 31) sorted by relevance

12

/oneTBB/test/tbb/
H A Dtest_parallel_scan.cpp90 Storage<T> JoinStorages(const Storage<T>& left, const Storage<T>& right) { in JoinStorages() argument
93 CHECK(left.my_range.end() == right.my_range.begin()); in JoinStorages()
94 result.my_total += left.my_total; in JoinStorages()
95 result.my_range = Range(left.my_range.begin(), right.my_range.end(), 1); in JoinStorages()
192 const Storage<T> & left = left_body.storage; in reverse_join() local
197 right = JoinStorages(left, right); in reverse_join()
250 return JoinStorages(left, right); in operator ()()
282 [](const Storage<T>& left, const Storage<T>& right) -> Storage<T> { in operator ()() argument
283 return JoinStorages(left, right); in operator ()()
385 [](const auto& left, const auto& right) { in operator ()() argument
[all …]
H A Dtest_partitioner.h140 return T(r.size() * T(p.right())) / T(p.left() + p.right()); in compute_right_part()
248 return float(r.size() * float(p.left())) / float(p.left() + p.right()); in compute_right_part()
263 size_t parts = size_t(p.left() + p.right()); in compute_right_part()
282 TreeNode* left, TreeNode* right) in TreeNode()
284 m_left(left), m_right(right) { } in TreeNode()
287 TreeNode *left, TreeNode *right);
291 TreeNode* left = nullptr, TreeNode* right = nullptr) {
293 return new TreeNode(range_begin, range_end, affinity, left, right);
H A Dtest_blocked_range.cpp69 std::size_t parts = p.left() + p.right();
/oneTBB/test/conformance/
H A Dconformance_combinable.cpp86 T operator()(T left, T right ) const { in operator ()()
87 return left + right; in operator ()()
93 T operator()(const T& left, const T& right ) const { in operator ()()
94 return left + right; in operator ()()
99 T my_combine( T left, T right) { return left + right; } in my_combine() argument
102 T my_combine_ref( const T &left, const T &right) { return left + right; } in my_combine_ref() argument
H A Dconformance_enumerable_thread_specific.cpp216 T operator()(const T& left, const T& right) const { in operator ()()
217 return left+right; in operator ()()
223 …minimalNComparable<N> operator()(const minimalNComparable<N>& left, const minimalNComparable<N>& r… in operator ()()
225 result.set_value( left.value() + right.value() ); in operator ()()
232 …ThrowingConstructor operator()(const ThrowingConstructor& left, const ThrowingConstructor& right) … in operator ()()
234 result.m_cnt = ( left.m_cnt + right.m_cnt ); in operator ()()
241 T operator()(T left, T right ) const { in operator ()()
242 return FunctorAddCombineRef<T>()( left, right ); in operator ()()
247 T FunctionAddByRef( const T &left, const T &right) { in FunctionAddByRef() argument
248 return FunctorAddCombineRef<T>()( left, right ); in FunctionAddByRef()
[all …]
H A Dconformance_blocked_range.cpp143 … original.begin() + ps.left() * (original.end() - original.begin()) / (ps.left() + ps.right())
H A Dconformance_blocked_range2d.cpp162 …original.rows().begin() + ps.left() * (original.rows().end() - original.rows().begin()) / (ps.left…
H A Dconformance_blocked_range3d.cpp195 …original.rows().begin() + ps.left() * (original.rows().end() - original.rows().begin()) / (ps.left…
H A Dconformance_blocked_rangeNd.cpp266 …original.dim(0).begin() + ps.left() * (original.dim(0).end() - original.dim(0).begin()) / (ps.left…
/oneTBB/test/common/
H A Dutils.h359 auto max(const T& left, const U& right) -> decltype(left > right ? left : right)
361 return left > right ? left : right;
364 auto min(const T& left, const U& right) -> decltype(left < right ? left : right)
366 return left < right ? left : right;
/oneTBB/examples/common/gui/
H A Dgdivideo.cpp74 ps.rcPaint.left, in InternalWndProc()
76 ps.rcPaint.left, in InternalWndProc()
160 r.left = start_x; in update()
H A Dd2dvideo.cpp75 g_video->on_mouse(x * g_sizex / (rc.right - rc.left), y * g_sizey / (rc.bottom - rc.top), k); in mouse()
137 bitmapSize = D2D1::SizeU(rc.right - rc.left, rc.bottom - rc.top); in init_window()
195 r.left = start_x; in update()
/oneTBB/doc/main/tbb_userguide/
H A Duse_graph_reset.rst9 graph and its nodes may be left in an indeterminate state. For example,
11 left in a buffer. But even beyond remnants in the buffers, there are
H A DAdvanced_Topic_Other_Kinds_of_Iteration_Spaces.rst55 ``oneapi::tbb::proportional_split``. The type has methods ``left`` and ``right``
58 left part of the proportion, and the constructed object corresponds to
/oneTBB/include/oneapi/tbb/
H A Dparallel_pipeline.h105 filter<T,U> operator&( const filter<T,V>& left, const filter<V,U>& right ) {
106 __TBB_ASSERT(left.my_root,"cannot use default-constructed filter as left argument of '&'");
108 …return filter_node_ptr( new (r1::allocate_memory(sizeof(filter_node))) filter_node(left.my_root,ri…
H A Dblocked_range.h138 / float(proportion.left() + proportion.right()) + 0.5f); in __TBB_requires()
/oneTBB/src/tbbmalloc/
H A Dbackend.cpp52 void Backend::UsedAddressRange::registerAlloc(uintptr_t left, uintptr_t right) in registerAlloc() argument
55 if (left < leftBound.load(std::memory_order_relaxed)) in registerAlloc()
56 leftBound.store(left, std::memory_order_relaxed); in registerAlloc()
61 …MALLOC_ASSERT(leftBound.load(std::memory_order_relaxed) <= left && right <= rightBound.load(std::m… in registerAlloc()
64 void Backend::UsedAddressRange::registerFree(uintptr_t left, uintptr_t right) in registerFree() argument
67 if (leftBound.load(std::memory_order_relaxed) == left) { in registerFree()
74 rightBound.store(left, std::memory_order_relaxed); in registerFree()
1058 FreeBlock *left = fBlock->leftNeig(leftSz); in doCoalesc() local
1059 size_t lSz = left->trySetMeUsed(GuardedSize::COAL_BLOCK); in doCoalesc()
1066 left->blockInBin = true; in doCoalesc()
[all …]
H A Dbackend.h213 void registerAlloc(uintptr_t left, uintptr_t right);
214 void registerFree(uintptr_t left, uintptr_t right);
/oneTBB/examples/task_arena/fractal/
H A DREADME.md38 * `left mouse button` - make the fractal active.
40 * `a` - move the active fractal to the left.
/oneTBB/src/tbb/
H A Dparallel_pipeline.cpp58 if( root.left && root.right ) { in fill_pipeline()
59 fill_pipeline(*root.left); in fill_pipeline()
63 __TBB_ASSERT(!root.left && !root.right, "tree should be full"); in fill_pipeline()
/oneTBB/include/oneapi/tbb/detail/
H A D_pipeline_filters.h333 filter_node_ptr left;
336 filter_node() : ref_count(0), left(nullptr), right(nullptr) {
343 left = x;
H A D_flow_graph_impl.h153 bool operator()(const graph_task* left, const graph_task* right) { in operator()
154 return left->priority < right->priority; in operator()
H A D_range_common.h47 size_t left() const { return my_left; } in left() function
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DReduction.rst161 T left, right;
163 [&]{left=RepeatableReduce(first,mid,identity);},
166 return left+right;
/oneTBB/examples/parallel_for/seismic/
H A DREADME.md32 * `left mouse button` - starts new seismic wave in place specified by mouse cursor.

12