Home
last modified time | relevance | path

Searched refs:right (Results 1 – 25 of 34) sorted by relevance

12

/oneTBB/test/tbb/
H A Dtest_partitioner.h119 T right = self().compute_right_part(r, p); in RangeBase() local
120 size_t right_part = self().round(right); in RangeBase()
140 return T(r.size() * T(p.right())) / T(p.left() + p.right()); in compute_right_part()
263 size_t parts = size_t(p.left() + p.right()); in compute_right_part()
265 size_t int_part = currSize / parts * p.right(); in compute_right_part()
266 size_t remainder = currSize % parts * 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) {
[all …]
H A Dtest_parallel_scan.cpp90 Storage<T> JoinStorages(const Storage<T>& left, const Storage<T>& right) { in JoinStorages() argument
91 Storage<T> result = right; in JoinStorages()
93 CHECK(left.my_range.end() == right.my_range.begin()); in JoinStorages()
95 result.my_range = Range(left.my_range.begin(), right.my_range.end(), 1); in JoinStorages()
193 Storage<T> & right = 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_blocked_range.cpp69 std::size_t parts = p.left() + p.right();
72 std::size_t right_idx = int_part * p.right() + fraction * p.right() / parts + 1;
/oneTBB/include/oneapi/tbb/
H A Dparallel_pipeline.h76 filter& operator&=( const filter<OutputType,OutputType>& right ) {
77 *this = *this & right;
105 filter<T,U> operator&( const filter<T,V>& left, const filter<V,U>& right ) {
107 __TBB_ASSERT(right.my_root,"cannot use default-constructed filter as right argument of '&'");
108 …node_ptr( new (r1::allocate_memory(sizeof(filter_node))) filter_node(left.my_root,right.my_root) );
H A Dblocked_range.h137 size_type right_part = size_type(float(r.size()) * float(proportion.right()) in __TBB_requires()
138 / float(proportion.left() + proportion.right()) + 0.5f); in __TBB_requires()
H A Dpartitioner.h330 std::size_t portion = split_obj.right() * my_partition::factor; in do_split()
347 std::size_t right = n / 2; in get_split() local
348 std::size_t left = n - right; in get_split()
349 return proportional_split(left, right); in get_split()
/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 …arable<N> operator()(const minimalNComparable<N>& left, const minimalNComparable<N>& right) const { in operator ()()
225 result.set_value( left.value() + right.value() ); in operator ()()
232 …ngConstructor operator()(const ThrowingConstructor& left, const ThrowingConstructor& right) const { 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 ….begin() + ps.left() * (original.rows().end() - original.rows().begin()) / (ps.left() + ps.right())
/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/src/tbbmalloc/
H A Dbackend.cpp57 if (right > rightBound.load(std::memory_order_relaxed)) in registerAlloc()
58 rightBound.store(right, std::memory_order_relaxed); in registerAlloc()
68 if (rightBound.load(std::memory_order_relaxed) == right) { in registerFree()
72 leftBound.store(right, std::memory_order_relaxed); in registerFree()
972 if (!right->isLastRegionBlock()) in remap()
1074 FreeBlock *right = fBlock->rightNeig(fBlock->sizeTmp); in doCoalesc() local
1079 right->setMeFree(GuardedSize::LAST_REGION_BLOCK); in doCoalesc()
1089 size_t rSz = right->rightNeig(rightSz)-> in doCoalesc()
1092 right->setMeFree(rightSz); // rollback in doCoalesc()
1101 removeBlockFromBin(right); 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/common/gui/
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()
196 r.right = start_x + size_x; in update()
H A Dgdivideo.cpp78 ps.rcPaint.right, in InternalWndProc()
161 r.right = start_x + size_x; in update()
/oneTBB/src/tbb/
H A Dparallel_pipeline.cpp58 if( root.left && root.right ) { in fill_pipeline()
60 fill_pipeline(*root.right); in fill_pipeline()
63 __TBB_ASSERT(!root.left && !root.right, "tree should be full"); in fill_pipeline()
/oneTBB/doc/main/tbb_userguide/
H A DAdvanced_Topic_Other_Kinds_of_Iteration_Spaces.rst55 ``oneapi::tbb::proportional_split``. The type has methods ``left`` and ``right``
59 the right part.
H A DTask-Based_Programming.rst69 The scheduler does *load balancing*. In addition to using the right
75 right.
H A DThroughput_of_pipeline.rst10 running in parallel. Selecting the right value of ``N`` may involve some
H A DBandwidth_and_Cache_Affinity_os.rst61 The example code gets the lifetime of the partitioner right by declaring
/oneTBB/include/oneapi/tbb/detail/
H A D_pipeline_filters.h334 filter_node_ptr right;
336 filter_node() : ref_count(0), left(nullptr), right(nullptr) {
344 right = y;
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.h48 size_t right() const { return my_right; } in right() function
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DReduction.rst161 T left, right;
164 [&]{right=RepeatableReduce(mid,last,identity);}
166 return left+right;
/oneTBB/examples/task_arena/fractal/
H A DREADME.md42 * `d` - move the active fractal to the right.

12