Home
last modified time | relevance | path

Searched refs:op (Results 1 – 15 of 15) sorted by relevance

/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DGraph.cpp23 Cell::Cell(const Cell& other) : op(other.op), value(other.value), successor(other.successor) { in Cell()
34 int op = int((rand() >> 8) % 5u); in create_random_dag() local
35 if (op > int(k)) in create_random_dag()
36 op = int(k); in create_random_dag()
37 switch (op) { in create_random_dag()
39 c.op = OP_VALUE; in create_random_dag()
43 case 2: c.op = OP_SUB; break; in create_random_dag()
44 case 3: c.op = OP_ADD; break; in create_random_dag()
70 c.ref_count = ArityOfOp[c.op]; in get_root_set()
74 if (ArityOfOp[c.op] == 0) in get_root_set()
[all …]
H A DGraph.hpp43 OpKind op; member in Cell
H A Dparallel_preorder.cpp36 c->ref_count = ArityOfOp[c->op]; in operator ()()
/oneTBB/include/oneapi/tbb/detail/
H A D_aggregator.h65 void execute( OperationType* op, HandlerType& handle_operations, bool long_life_time = true ) {
69 const uintptr_t status = op->status.load(std::memory_order_relaxed);
76 call_itt_notify(releasing, &(op->status));
80 op->next.store(res, std::memory_order_relaxed);
81 } while (!pending_operations.compare_exchange_strong(res, op));
90 __TBB_ASSERT(op->status.load(std::memory_order_relaxed), nullptr);
95 call_itt_notify(prepare, &(op->status));
96 spin_wait_while_eq(op->status, uintptr_t(0));
149 void execute(OperationType* op) { in execute() argument
150 aggregator_generic<OperationType>::execute(op, handle_operations); in execute()
H A D_flow_graph_node_impl.h232 void internal_try_put_task(operation_type *op) { in internal_try_put_task() argument
237 op->bypass_t = new_task; in internal_try_put_task()
239 } else if ( my_queue && my_queue->push(*(op->elem)) ) { in internal_try_put_task()
240 op->bypass_t = SUCCESSFULLY_ENQUEUED; in internal_try_put_task()
243 op->bypass_t = nullptr; in internal_try_put_task()
244 op->status.store(FAILED, std::memory_order_release); in internal_try_put_task()
249 void internal_forward(operation_type *op) { in internal_forward() argument
250 op->bypass_t = nullptr; in internal_forward()
252 op->bypass_t = perform_queued_requests(); in internal_forward()
253 if(op->bypass_t) in internal_forward()
[all …]
H A D_flow_graph_tagged_buffer_impl.h109 for( element_type* op = pointer_array[i]; op; op = (element_type *)(op->second)) { in grow_array() local
110 value_type *ov = reinterpret_cast<value_type *>(&(op->first)); in grow_array()
/oneTBB/src/tbbmalloc/
H A Dlarge_objects.cpp245 op->next = *opList; in addOpToOpList()
246 *opList = op; in addOpToOpList()
287 for ( CacheBinOperation *op = opList, *opNext; op; op = opNext ) { in operator ()() local
288 opNext = op->next; in operator ()()
289 switch ( op->type ) { in operator ()()
342 commitOperation( op ); in operator ()()
347 addOpToOpList( op, &opClean ); in operator ()()
466 CacheBinOperation op(data); in get() local
491 CacheBinOperation op(data); in cleanToThreshold() local
512 CacheBinOperation op(data); in releaseAllToBackend() local
[all …]
H A Dlarge_objects.h173 …void ExecuteOperation(CacheBinOperation *op, ExtMemoryPool *extMemPool, BinBitMask *bitMask, int i…
267 void updateCacheState(ExtMemoryPool *extMemPool, DecreaseOrIncrease op, size_t size);
343 void updateCacheState(DecreaseOrIncrease op, size_t size);
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_lru_cache.h99 retrieve_aggregator_operation op(key);
100 my_aggregator.execute(&op);
102 if (op.is_new_value_needed()) {
103 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);
109 return handle(*this, op.result());
125 signal_end_of_usage_aggregator_operation op(map_record_ref); in signal_end_of_usage()
126 my_aggregator.execute(&op); in signal_end_of_usage()
303 aggregator_operation(op_type op) : my_op(op) {}
H A Dflow_graph.h1269 __TBB_ASSERT(op->r, nullptr); in internal_reg_succ()
1276 __TBB_ASSERT(op->r, nullptr); in internal_rem_succ()
1330 __TBB_ASSERT(op->elem, nullptr); in internal_push()
1331 this->push_back(*(op->elem)); in internal_push()
1337 __TBB_ASSERT(op->elem, nullptr); in internal_pop()
1338 if(this->pop_back(*(op->elem))) { in internal_pop()
1347 __TBB_ASSERT(op->elem, nullptr); in internal_reserve()
1713 prio_push(*(op->elem)); in internal_push()
1725 *(op->elem) = prio(); in internal_pop()
1738 *(op->elem) = prio(); in internal_reserve()
[all …]
/oneTBB/test/conformance/
H A Dconformance_parallel_reduce.cpp48 Op op; in operator ()() local
49 my_value = op(my_value, i); in operator ()()
54 Op op; in join() local
55 my_value = op.join(my_value, y.my_value); in join()
78 RotOp op; in TestDeterministicReductionFor() local
79 value = op(value, ii); in TestDeterministicReductionFor()
84 RotOp op; in TestDeterministicReductionFor() local
85 return op.join(v1,v2); in TestDeterministicReductionFor()
H A Dconformance_flowgraph.h167 void operator()( InputType, multifunc_ports_t<InputType, OutputType>& op ) { in operator()
168 std::get<0>(op).try_put(operator()(OutputType(0))); in operator()
196 void operator()( InputType, multifunc_ports_t<InputType, OutputType>& op ) { in operator()
198 std::get<0>(op).try_put(return_value); in operator()
233 std::get<0>(op).try_put(OutputType(0)); in operator()
274 void operator()( InputType argument, multifunc_ports_t<InputType>& op ) { in operator()
276 std::get<0>(op).try_put(argument); in operator()
318 void operator()( const int& argument, multifunc_ports_t<int>& op ) { in operator()
323 std::get<0>(op).try_put(argument); in operator()
364 std::get<0>(op).try_put(OutputType(1)); in operator()
[all …]
/oneTBB/test/tbb/
H A Dtest_multifunction_node.cpp497 …multinode node(precedes(b1, b2), unlimited, [](const int& i, multinode::output_ports_type& op) -> … in test_precedes() argument
499 std::get<0>(op).try_put(i); in test_precedes()
501 std::get<1>(op).try_put(i); in test_precedes()
521 …ges_for_follows, tbb::flow::unlimited, [](const int& i, multinode::output_ports_type& op) -> void { in test_follows_and_precedes_api() argument
522 std::get<0>(op).try_put(i); in test_follows_and_precedes_api()
568 …multinode node(precedes(b1, b2), unlimited, [](const int& i, multinode::output_ports_type& op) -> … in __anon0fcb77200802() argument
570 std::get<0>(op).try_put(i); in __anon0fcb77200802()
572 std::get<1>(op).try_put(i); in __anon0fcb77200802()
H A Dtest_flow_graph_priorities.cpp94 void operator()( int msg, multi_node::output_ports_type& op ) const { in operator ()()
96 std::get<0>(op).try_put( msg ); in operator ()()
/oneTBB/test/common/
H A Ddoctest.h1403 String stringifyBinaryExpr(const DOCTEST_REF_WRAP(L) lhs, const char* op,
1405 return (DOCTEST_STRINGIFY(lhs)) + op + (DOCTEST_STRINGIFY(rhs));
1417 #define SFINAE_OP(ret,op) ret
1419 #define SFINAE_OP(ret,op) decltype((void)(doctest::detail::declval<L>() op doctest::detail::declval…
1422 #define DOCTEST_DO_BINARY_EXPRESSION_COMPARISON(op, op_str, op_macro) \
1424 DOCTEST_NOINLINE SFINAE_OP(Result,op) operator op(R&& rhs) { \
1436 #define DOCTEST_FORBIT_EXPRESSION(rt, op) \
1438 rt& operator op(const R&) { \
1516 #define DOCTEST_RELATIONAL_OP(name, op) \
1722 #define DOCTEST_BINARY_RELATIONAL_OP(n, op) \
[all …]