Home
last modified time | relevance | path

Searched refs:val (Results 1 – 25 of 32) sorted by relevance

12

/oneTBB/src/tbb/
H A Dintrusive_list.h134 __TBB_ASSERT( node(val).my_prev_node == &node(val) && node(val).my_next_node == &node(val), in push_front()
145 void remove( T& val ) { in remove() argument
146 …__TBB_ASSERT( node(val).my_prev_node != &node(val) && node(val).my_next_node != &node(val), "Eleme… in remove()
147 …__TBB_ASSERT( node(val).my_prev_node->my_next_node == &node(val) && node(val).my_next_node->my_pre… in remove()
149 node(val).my_next_node->my_prev_node = node(val).my_prev_node; in remove()
150 node(val).my_prev_node->my_next_node = node(val).my_next_node; in remove()
152 node(val).my_prev_node = node(val).my_next_node = &node(val); in remove()
158 T& val = *it; in erase() local
160 remove( val ); in erase()
196 static intrusive_list_node& node ( T& val ) { return val.*NodePtr; } in node() argument
[all …]
H A Drml_thread_monitor.h164 BOOL val = in join() local
167 __TBB_ASSERT( val, nullptr); in join()
172 BOOL val = in detach_thread() local
175 __TBB_ASSERT( val, nullptr); in detach_thread()
H A Dthread_data.h66 void remove(d1::intrusive_list_node& val) { in remove() argument
69 intrusive_list<d1::intrusive_list_node>::remove(val); in remove()
77 void push_front(d1::intrusive_list_node& val) { in push_front() argument
80 intrusive_list<d1::intrusive_list_node>::push_front(val); in push_front()
H A Dscheduler_common.h340 inline void poison_value(std::uintptr_t& val) { val = venom; } in poison_value() argument
342 inline void poison_value(std::atomic<std::uintptr_t>& val) { val.store(venom, std::memory_order_rel… in poison_value() argument
H A Dtask_stream.h68 inline bool is_bit_set( population_t val, int pos ) { in is_bit_set() argument
71 return (val & (one<<pos)) != 0; in is_bit_set()
/oneTBB/test/tbb/
H A Dtest_fuzzing.cpp29 std::string val = provider.ConsumeRandomLengthString(); in LLVMFuzzerTestOneInput() local
31 _putenv_s(var, val.c_str()); in LLVMFuzzerTestOneInput()
33 setenv(var, val.c_str(), 1); in LLVMFuzzerTestOneInput()
H A Dtest_profiling.cpp116 [](const tbb::flow::continue_msg& val) -> const tbb::flow::continue_msg&
118 return val; in __anon8094d7940102()
127 tbb::flow::function_node<int, int> node(g, 1, [](const int& val) -> int {return val; }); in __anon8094d7940202() argument
H A Dtest_split_node.cpp310 function_node<int, int> f4(g, unlimited, [&](int val) { ++body_calls; return val; } ); in test_follows_and_precedes_api() argument
311 function_node<float, float> f5(g, unlimited, [&](float val) { ++body_calls; return val; } ); in test_follows_and_precedes_api() argument
312 function_node<double, double> f6(g, unlimited, [&](double val) { ++body_calls; return val; } ); in test_follows_and_precedes_api() argument
H A Dtest_parallel_sort.cpp42 int val; member in Minimal
44 void set_val(int i) { val = i; } in set_val()
46 return (a.val < b.val); in Less()
49 return a.val == b.val; in AreEqual()
H A Dtest_concurrent_priority_queue.cpp55 MyDataType( int val ) : priority(std::size_t(val)) {} in MyDataType()
H A Dtest_concurrent_vector.cpp138 bool is_prime( std::size_t val ) const { in is_prime()
140 if( val<5u ) in is_prime()
141 return val==2; in is_prime()
143 limit = long(sqrtf(float(val))+0.5f); in is_prime()
144 while( factor<=limit && val % factor ) in is_prime()
H A Dtest_queue_node.cpp548 int val = 1; variable
549 res = q.try_reserve(val);
551 CHECK_MESSAGE( (val == 42), "queue_node must reserve once passed item." );
H A Dtest_continue_node.cpp319 T operator()(const T& val) { in operator ()()
320 return val; in operator ()()
/oneTBB/src/tbbmalloc/
H A Dtbbmalloc_internal.h185 void set(size_t idx, bool val) { in set() argument
190 if (val) { in set()
221 void set(size_t idx, bool val) { BitMaskBasic<NUM>::set(idx, val); } in set() argument
230 void set(size_t idx, bool val) { in set() argument
231 BitMaskBasic<NUM>::set(NUM - 1 - idx, val); in set()
375 intptr_t val;
381 return val;
386 val = newVal;
403 val = 1;
406 val = defaultVal;
/oneTBB/src/tbb/tools_api/
H A Dittnotify_config.h365 #define __TBB_machine_fetchadd4(addr, val) __fetchadd4_acq((void *)addr, val) argument
367 #define __TBB_machine_fetchadd4(addr, val) __sync_fetch_and_add(addr, val) argument
382 #define __TBB_machine_fetchadd4(addr, val) __sync_fetch_and_add(addr, val) argument
/oneTBB/test/conformance/
H A Dconformance_join_node.cpp216 auto body2 = [](const float &val) -> int { return static_cast<int>(val); }; in __anon798ebb9d0702() argument
237 …auto body2 = [](const float &val) -> oneapi::tbb::flow::tag_value { return static_cast<oneapi::tbb… in __anon798ebb9d0902() argument
H A Dconformance_concurrent_priority_queue.cpp89 explicit MoveOperationTrackerBase( const std::size_t val ) : value(val) {} in MoveOperationTrackerBase()
300 ForwardInEmplaceTester( int val ) : a(val) {} in ForwardInEmplaceTester()
304 ForwardInEmplaceTester( ForwardInEmplaceTester&& obj, int val ) : a(obj.a) { in ForwardInEmplaceTester()
306 obj.a = val; in ForwardInEmplaceTester()
H A Dconformance_concurrent_queue.cpp1109 static bool push( CQ& queue, VType&& val ) { in push()
1110 queue.push( std::forward<VType>( val ) ); in push()
1118 static bool push( CQ& queue, VType&& val ) { in push()
1119 return queue.try_push( std::forward<VType>( val ) ); in push()
1128 static bool pop( CQ& queue, VType&& val ) { in pop()
1130 queue.pop( std::forward<VType>( val ) ); in pop()
1138 static bool pop( CQ& queue, VType&& val ) { in pop()
1139 return queue.try_pop( std::forward<VType>( val ) ); in pop()
1378 … static void emplace( CQ& queue, Args&&... val ) { queue.emplace( std::forward<Args>( val )... ); } in emplace()
1384 static void emplace( CQ& queue, Args&&... val ) { in emplace()
[all …]
H A Dconformance_combinable.cpp62 minimalCombinable(int val=0) : my_value(val) { ++construction_counter; } in minimalCombinable() argument
H A Dconformance_parallel_pipeline.cpp153 ValueType val = *first; in RootSequence() local
155 return val; in RootSequence()
/oneTBB/examples/graph/logic_sim/
H A Dbasics.hpp245 signal_t val; member in pulse::clock_body
248 clock_body(std::size_t& _ms, int& _reps) : ms(_ms), reps(_reps), val(low) {} in clock_body()
254 if (val == low) in operator ()()
255 val = high; in operator ()()
257 val = low; in operator ()()
261 return val; in operator ()()
/oneTBB/test/common/
H A Dtest_comparisons.h254 std::size_t operator()( const comparisons_testing::TwoWayComparable& val ) const {
255 return std::hash<std::size_t>{}(val.n);
H A Dconcurrent_associative_common.h86 static bool compare( const typename Container::iterator& it, U val ) {
87 return (Value::template convert<U>(*it) == val);
687 int val = my_asymptotic ? 1 : i;
688 pair_ib pib = my_table.insert(Value<Container>::make(val));
689 REQUIRE_MESSAGE((Value<Container>::get(*(pib.first)) == val),
699 int val = my_asymptotic ? 1 : i;
700 pair_ib pib = my_table.insert(Value<Container>::make(val));
701 REQUIRE_MESSAGE((Value<Container>::get(*(pib.first)) == val),
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_set.h44 static const key_type& get_key(const_reference val) { in get_key()
45 return val; in get_key()
/oneTBB/examples/common/utility/
H A Dutility.hpp361 bool is_power_of_2(T val) { in is_power_of_2() argument
362 std::size_t intval = std::size_t(val); in is_power_of_2()

12