Home
last modified time | relevance | path

Searched refs:V (Results 1 – 25 of 26) sorted by relevance

12

/oneTBB/examples/parallel_for/tachyon/src/
H A Dlight.cpp85 vector V; in light_intersect() local
91 VSUB(l->ctr, ry->o, V); in light_intersect()
92 VDOT(b, V, ry->d); in light_intersect()
93 VDOT(temp, V, V); in light_intersect()
H A Dsphere.cpp94 vector V; in sphere_intersect() local
96 VSUB(spr->ctr, ry->o, V); in sphere_intersect()
97 VDOT(b, V, ry->d); in sphere_intersect()
98 VDOT(temp, V, V); in sphere_intersect()
H A Dtriangle.cpp207 flt U, V, W, lensqr; in stri_normal() local
219 V = DOT(tmp, norm) / lensqr; in stri_normal()
221 W = 1.0 - (U + V); in stri_normal()
223 N->x = W * trn->n0.x + U * trn->n1.x + V * trn->n2.x; in stri_normal()
224 N->y = W * trn->n0.y + U * trn->n1.y + V * trn->n2.y; in stri_normal()
225 N->z = W * trn->n0.z + U * trn->n1.z + V * trn->n2.z; in stri_normal()
H A Dshade.cpp234 vector H, V; in shade_phong() local
237 V = incident->d; in shade_phong()
238 VScale(&V, -1.0); in shade_phong()
239 VAdd(&V, L, &H); in shade_phong()
/oneTBB/src/tbb/
H A Dsemaphore.h138 void V() {ReleaseSemaphore( sem, 1, nullptr);} in V() function
159 void V() { dispatch_semaphore_signal(my_sem); } in V() function
182 void V() { sem_post( &sem ); } in V() function
206 void V() { SetEvent( my_sem ); } in V() function
227 void V();
259 void V() { in V() function
288 void V() { sem_post( &my_sem ); } in V() function
H A Dconcurrent_monitor_mutex.h82 get_semaphore().V(); in wakeup()
H A Dsemaphore.cpp86 void binary_semaphore::V() { __TBB_release_binsem( &my_sem.lock ); } in V() function in tbb::detail::r1::binary_semaphore
H A Drml_thread_monitor.h230 my_sema.V(); in notify()
H A Dconcurrent_monitor.h182 semaphore().V(); in notify()
/oneTBB/examples/parallel_for/seismic/
H A Duniverse.cpp49 T[i][j] = S[i][j] = V[i][j] = ValueType(1.0E-6); in InitializeUniverse()
111 V[pulseY][pulseX] += 64 * sqrt(M[pulseY][pulseX]) * exp(-t * t); in UpdatePulse()
148 S[i][j] += M[i][j] * (V[i][j + 1] - V[i][j]); in UpdateStress()
149 T[i][j] += M[i][j] * (V[i + 1][j] - V[i][j]); in UpdateStress()
150 int index = (int)(V[i][j] * (ColorMapSize / 2)) + ColorMapSize / 2; in UpdateStress()
186 V[i][j] = in UpdateVelocity()
187 D[i][j] * (V[i][j] + L[i][j] * (S[i][j] - S[i][j - 1] + T[i][j] - T[i - 1][j])); in UpdateVelocity()
H A Duniverse.hpp51 ValueType V[MaxHeight][MaxWidth]; member in Universe
/oneTBB/test/tbb/
H A Dtest_join_node.h87 V my_value;
98 V my_value;
110 V my_value;
125 V my_value;
142 V my_value;
158 V my_value;
233 template<class K, typename V>
264 V,
270 V, K, my_struct_key<K, V> > my_func_body_type;
271 typename VtoKFB<K, V>::type *kp = new my_func_body_type(my_struct_key<K, V>());
[all …]
H A Dtest_semaphore.cpp76 mySem.V(); in operator ()()
126 my_counter.my_sem.V(); in operator ()()
131 my_counter.my_sem.V(); in AddOne()
219 next_sem.V(); in Produce()
222 next_sem.V(); // final wakeup in Produce()
241 next_sem.V(); in Consume()
/oneTBB/test/conformance/
H A Dconformance_concurrent_vector.cpp50 void CheckIteratorComparison( V& u ) { in CheckIteratorComparison()
51 V u2 = u; in CheckIteratorComparison()
93 V v(N); in TestSequentialFor()
97 typename V::iterator p = v.begin(); in TestSequentialFor()
110 const V& u = v; in TestSequentialFor()
118 V::const_iterator &cpr = ++cp; in TestSequentialFor()
127 V::const_iterator &cpr = --cp; in TestSequentialFor()
172 CheckIteratorComparison<typename V::iterator, typename V::iterator>(v); in TestSequentialFor()
173 CheckIteratorComparison<typename V::iterator, typename V::const_iterator>(v); in TestSequentialFor()
174 CheckIteratorComparison<typename V::const_iterator, typename V::iterator>(v); in TestSequentialFor()
[all …]
H A Dconformance_flowgraph.h33 template<typename V>
34 using test_push_receiver = oneapi::tbb::flow::queue_node<V>;
79 template<typename V>
80 …d::enable_if<!std::is_default_constructible<V>::value, std::vector<V>>::type get_values( test_push… in get_values()
81 std::vector<V> messages; in get_values()
82 V tmp(0); in get_values()
90 template<typename V>
91 …td::enable_if<std::is_default_constructible<V>::value, std::vector<V>>::type get_values( test_push… in get_values()
92 std::vector<V> messages; in get_values()
93 V tmp; in get_values()
H A Dconformance_enumerable_thread_specific.cpp980 template<typename V>
982 void operator()( const V& ) { } in operator ()()
/oneTBB/include/oneapi/tbb/
H A Dmemory_pool.h84 template<typename V, typename U, typename R>
85 … friend bool operator==( const memory_pool_allocator<V,R>& a, const memory_pool_allocator<U,R>& b);
86 template<typename V, typename U, typename R>
87 … friend bool operator!=( const memory_pool_allocator<V,R>& a, const memory_pool_allocator<U,R>& b);
161 template<typename V, typename U, typename R>
162 … friend bool operator==( const memory_pool_allocator<V,R>& a, const memory_pool_allocator<U,R>& b);
163 template<typename V, typename U, typename R>
164 … friend bool operator!=( const memory_pool_allocator<V,R>& a, const memory_pool_allocator<U,R>& b);
H A Dparallel_pipeline.h104 template<typename T, typename V, typename U>
105 filter<T,U> operator&( const filter<T,V>& left, const filter<V,U>& right ) {
H A Dflow_graph.h360 template<typename U, typename V> friend class limiter_node;
2639 template< typename T, typename V,
2641 inline void make_edge( T& output, V& input) { in make_edge()
2653 template< typename S, typename V,
2654 typename = typename V::input_ports_type >
2655 inline void make_edge( sender<S>& output, V& input) { in make_edge()
2672 template< typename T, typename V,
2674 inline void remove_edge( T& output, V& input) { in remove_edge()
2685 template< typename S, typename V,
2686 typename = typename V::input_ports_type >
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_types_impl.h389 template<typename V>
390 const V& cast_to() const {return my_msg.template variant_cast_to<V>();}
392 template<typename V>
393 bool is_a() const {return my_msg.template variant_is_a<V>();}
399 template<typename V, typename T>
400 const V& cast_to(T const &t) { return t.template cast_to<V>(); }
402 template<typename V, typename T>
403 bool is_a(T const &t) { return t.template is_a<V>(); }
H A D_flow_graph_body_impl.h350 template<typename U, typename V> friend class limiter_node;
H A D_concurrent_skip_list.h229 template <typename N, typename V>
/oneTBB/examples/graph/binpack/
H A DREADME.md2 … that performs binpacking of `N` integer values into a near-optimal number of bins of capacity `V`.
4 It features a `source_node` which passes randomly generated integer values of `size <= V` to a `que…
27 * `V` - capacity of each bin.
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DReference_Counting.rst129 D. Bacon and V.T. Rajan, "Concurrent Cycle Collection in Reference
140 M. Herlihy, V. Luchangco, and M. Moir, "The Repeat Offender Problem:
/oneTBB/cmake/
H A DREADME.md198 ctest -V

12