Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 104) sorted by relevance

12345

/oneTBB/include/oneapi/tbb/
H A Dversion.h65 #define __TBB_ONETBB_SPEC_VERSION(N) #N ": SPECIFICATION VERSION\t" ONETBB_SPEC_VERSION TBB_ENDL argument
66 #define __TBB_VERSION_NUMBER(N) #N ": VERSION\t\t" TBB_VERSION_STRING TBB_ENDL argument
70 #define __TBB_VERSION_USE_DEBUG(N) #N ": TBB_USE_DEBUG\tundefined" TBB_ENDL argument
72 #define __TBB_VERSION_USE_DEBUG(N) #N ": TBB_USE_DEBUG\t0" TBB_ENDL argument
74 #define __TBB_VERSION_USE_DEBUG(N) #N ": TBB_USE_DEBUG\t1" TBB_ENDL argument
76 #define __TBB_VERSION_USE_DEBUG(N) #N ": TBB_USE_DEBUG\t2" TBB_ENDL argument
82 #define __TBB_VERSION_USE_ASSERT(N) #N ": TBB_USE_ASSERT\tundefined" TBB_ENDL argument
84 #define __TBB_VERSION_USE_ASSERT(N) #N ": TBB_USE_ASSERT\t0" TBB_ENDL argument
86 #define __TBB_VERSION_USE_ASSERT(N) #N ": TBB_USE_ASSERT\t1" TBB_ENDL argument
88 #define __TBB_VERSION_USE_ASSERT(N) #N ": TBB_USE_ASSERT\t2" TBB_ENDL argument
[all …]
H A Dblocked_rangeNd.h52 template<typename Value, unsigned int N, typename = detail::make_index_sequence<N>>
56 template<typename Value, unsigned int N, std::size_t... Is>
58 class blocked_rangeNd_impl<Value, N, detail::index_sequence<Is...>> { in __TBB_requires()
75 static constexpr unsigned int ndims() { return N; } in __TBB_requires()
79 __TBB_ASSERT(dimension < N, "out of bound"); in __TBB_requires()
110 static_assert(N != 0, "zero dimensional blocked_rangeNd can't be constructed"); in __TBB_requires()
113 std::array<tbb::blocked_range<value_type>, N> my_dims; in __TBB_requires()
135 template<typename Value, unsigned int N>
136 using blocked_rangeNd = blocked_rangeNd_impl<Value, N>;
/oneTBB/examples/parallel_for/tachyon/dat/
H A Dtrypsin4pti.dat57 TEXDEF N AMBIENT 0.1 DIFFUSE 0.9 SPECULAR 0.0 OPACITY 1.0
60 TEXALIAS ND2 N
61 TEXALIAS NH1 N
62 TEXALIAS NH2 N
63 TEXALIAS NE N
64 TEXALIAS NE2 N
65 TEXALIAS NZ N
75 SPHERE CENTER 26.465000 27.452000 -2.490000 RAD 1.0 N
86 SPHERE CENTER 25.667000 26.396000 0.708000 RAD 1.0 N
93 SPHERE CENTER 27.170000 23.634001 2.462000 RAD 1.0 N
[all …]
/oneTBB/examples/parallel_for/tachyon/src/
H A Dlight.cpp111 static void light_normal(point_light *l, vector *pnt, ray *incident, vector *N) { in light_normal() argument
112 VSub((vector *)pnt, &(l->ctr), N); in light_normal()
114 VNorm(N); in light_normal()
116 if (VDot(N, &(incident->d)) > 0.0) { in light_normal()
117 N->x = -N->x; in light_normal()
118 N->y = -N->y; in light_normal()
119 N->z = -N->z; in light_normal()
H A Dsphere.cpp116 static void sphere_normal(sphere *spr, vector *pnt, ray *incident, vector *N) { in sphere_normal() argument
117 VSub((vector *)pnt, &(spr->ctr), N); in sphere_normal()
119 VNorm(N); in sphere_normal()
121 if (VDot(N, &(incident->d)) > 0.0) { in sphere_normal()
122 N->x = -N->x; in sphere_normal()
123 N->y = -N->y; in sphere_normal()
124 N->z = -N->z; in sphere_normal()
H A Dring.cpp116 static void ring_normal(ring *rng, vector *pnt, ray *incident, vector *N) { in ring_normal() argument
117 *N = rng->norm; in ring_normal()
118 VNorm(N); in ring_normal()
119 if (VDot(N, &(incident->d)) > 0.0) { in ring_normal()
120 N->x = -N->x; in ring_normal()
121 N->y = -N->y; in ring_normal()
122 N->z = -N->z; in ring_normal()
H A Dbox.cpp171 b = (*N); in box_normal()
173 a.x = fabs(N->x); in box_normal()
174 a.y = fabs(N->y); in box_normal()
175 a.z = fabs(N->z); in box_normal()
177 N->x = 0.0; in box_normal()
178 N->y = 0.0; in box_normal()
179 N->z = 0.0; in box_normal()
184 N->x = b.x; in box_normal()
187 N->y = b.y; in box_normal()
190 N->z = b.z; in box_normal()
[all …]
H A Dtriangle.cpp194 static void tri_normal(tri *trn, vector *pnt, ray *incident, vector *N) { in tri_normal() argument
195 CROSS((*N), trn->edge1, trn->edge2); in tri_normal()
197 VNorm(N); in tri_normal()
199 if (VDot(N, &(incident->d)) > 0.0) { in tri_normal()
200 N->x = -N->x; in tri_normal()
201 N->y = -N->y; in tri_normal()
202 N->z = -N->z; in tri_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()
[all …]
H A Dquadric.cpp125 void quadric_normal(quadric *q, vector *pnt, ray *incident, vector *N) { in quadric_normal() argument
126 N->x = (q->mat.a * (pnt->x - q->ctr.x) + q->mat.b * (pnt->y - q->ctr.y) + in quadric_normal()
129 N->y = (q->mat.b * (pnt->x - q->ctr.x) + q->mat.e * (pnt->y - q->ctr.y) + in quadric_normal()
132 N->z = (q->mat.c * (pnt->x - q->ctr.x) + q->mat.f * (pnt->y - q->ctr.y) + in quadric_normal()
135 VNorm(N); in quadric_normal()
137 if (VDot(N, &(incident->d)) > 0.0) { in quadric_normal()
138 N->x = -N->x; in quadric_normal()
139 N->y = -N->y; in quadric_normal()
140 N->z = -N->z; in quadric_normal()
H A Dshade.cpp71 vector N, L, hit; in shader() local
93 obj->methods->normal(obj, &hit, incident, &N); /* find the surface normal */ in shader()
115 VDOT(inten, N, L) /* light intensity */ in shader()
141 phongval = shade_phong(incident, &hit, &N, &L, obj->tex->phongexp); in shader()
166 specol = shade_reflection(incident, &hit, &N, obj->tex->specular); in shader()
181 color shade_reflection(ray* incident, vector* hit, vector* N, flt specular) { in shade_reflection() argument
186 VAddS(-2.0 * (incident->d.x * N->x + incident->d.y * N->y + incident->d.z * N->z), in shade_reflection()
187 N, in shade_reflection()
233 flt shade_phong(ray* incident, vector* hit, vector* N, vector* L, flt specpower) { in shade_phong() argument
242 inten = VDot(N, &H); in shade_phong()
/oneTBB/test/conformance/
H A Dconformance_blocked_rangeNd.cpp63 template<typename range_t, unsigned int N>
77 auto begin = data.begin() + range.dim(N - 1).begin(); in increment_data()
79 auto end = begin + range.dim(N - 1).size(); in increment_data()
89 auto end = begin + range.dim(N - 1).size(); in check_data()
110 if (range.dim(N - 1).empty()) { return true; } in is_empty()
120 if (get(range_split.dim(N - 1).begin()) == get(range_new.dim(N - 1).begin())) { in check_splitting()
121 REQUIRE(get(range_split.dim(N - 1).end()) == get(range_new.dim(N - 1).end())); in check_splitting()
124 …REQUIRE((get(range_split.dim(N - 1).end()) == get(range_new.dim(N - 1).begin()) && !split_checker)… in check_splitting()
240 static const std::size_t N = 4; variable
245 SerialTest<N>();
[all …]
/oneTBB/test/tbb/
H A Dtest_buffer_node.cpp32 #define N 1000 macro
42 count_value[value / N] += value % N; in check_item()
83 CHECK_MESSAGE( my_touches[v/N][v%N] == false, "" ); in check()
84 my_touches[v/N][v%N] = true; in check()
127 int j_end = ( N < i + C ) ? N : i + C; in operator ()()
218 CHECK_MESSAGE( next_value[tid] == T((N*(N-1))/2), "" ); in test_parallel()
336 for (int i = 0; i < N; ++i) { in test_serial()
342 for (int i = 0; i < N; ++i) { in test_serial()
347 CHECK_MESSAGE( vsum == (N*(N-1))/2, ""); in test_serial()
366 CHECK_MESSAGE( vsum == (N*(N-1))/2, ""); in test_serial()
[all …]
H A Dtest_input_node.cpp36 const int N = 1000; variable
41 std::atomic<int> my_counters[N];
47 for (int i = 0; i < N; ++i ) in test_push_receiver()
83 if ( (int)v < N ){ in operator ()()
121 for (int i = 0; i < N; ++i ) { in test_single_dest()
126 std::atomic<int> counters3[N]; in test_single_dest()
134 for (int i = 0; i < N; ++i ) { in test_single_dest()
142 std::atomic<int> counters2[N]; in test_single_dest()
148 for (int i = 0; i < N; ++i ) { in test_single_dest()
159 for (int i = 0; i < N; ++i ) { in test_single_dest()
[all …]
H A Dtest_collaborative_call_once.cpp78 for (std::size_t i = 0; i < N; ++i) { in call_once_in_for_loop()
112 for (std::size_t i = 0; i < N; ++i) in call_once_threads()
213 constexpr std::size_t N = 32; variable
218 constexpr std::size_t N = tbb::detail::d0::max_nfs_size * 2;
228 call_once_threads(N, f);
235 utils::SpinBarrier barrier{N};
237 utils::NativeParallelFor(N, [&](std::size_t) { in __anon8532fc100602()
287 constexpr std::size_t N = 32; variable
311 utils::NativeParallelFor(N, [&](std::size_t) { in __anon8532fc100b02()
406 constexpr int N = 93; variable
[all …]
H A Dtest_sequencer_node.cpp36 #define N 1000 macro
171 int i_end = ( N < i_start + C ) ? N : i_start + C; in operator ()()
237 for (int i = 0; i < N; ++i) { in test_parallel()
283 for (int i = 0; i < N; ++i) { in test_serial()
290 for (int i = 0; i < N; ++i) { in test_serial()
310 for (int i = 0; i < N; ++i) { in test_serial()
330 for (int i = 0; i < N; ++i) { in test_serial()
335 for (int i = 0; i < N; ++i) { in test_serial()
354 CHECK_MESSAGE( j == N, "" ); in test_serial()
371 for (int i = 0; i < N; ++i) { in test_serial()
[all …]
H A Dtest_queue_node.cpp38 #define N 1000 macro
59 int tid = value / N; in check_item()
60 int offset = value % N; in check_item()
73 for (int j = 0; j < N; ++j) { in operator ()()
112 int v_tid = v / N; in check()
159 for (int j = 0; j < N; ++j) { in operator ()()
179 int j_end = ( N < i + C ) ? N : i + C; in operator ()()
380 for (int i = 0; i < N; ++i) { in test_serial()
386 for (int i = 0; i < N; ++i) { in test_serial()
398 for (int i = 0; i < N; ++i) { in test_serial()
[all …]
H A Dtest_join_node.cpp39 static const int N = std::tuple_size<OutputTupleType>::value; member in recirc_output_func_body
42 input_node_helper<N, join_node_type>::only_check_value(out, v); in operator ()()
54 static const int N = std::tuple_size<TType>::value; member in tag_recirculation_test
56 input_node_helper<N, JType>::print_remark("Recirculation test of tag-matching join"); in test()
59 for(int i = 0; i < N; ++i) all_input_nodes[i][0] = nullptr; in test()
63 JType * my_join = makeJoin<N, JType, tbb::flow::tag_matching>::create(g); in test()
74 input_node_helper<N, JType>::add_recirc_func_nodes(*my_join, *my_input_join, g); in test()
106 input_node_helper<N, JType>::remove_recirc_func_nodes(*my_join, *my_input_join); in test()
108 makeJoin<N, JType, tbb::flow::tag_matching>::destroy(my_join); in test()
H A Dtest_priority_queue_node.cpp38 #define N 10 macro
48 int tid = value / N; in check_item()
49 int offset = value % N; in check_item()
59 for (int j = 0; j < N; ++j) { in operator ()()
73 for (int j = 0; j < N-1; ++j) { in operator ()()
87 int j_end = ( N < i + C ) ? N : i + C; in operator ()()
266 for (int i = 0; i < N; ++i) in test_serial()
268 for (int i = N-1; i >=0; --i) { in test_serial()
280 for (int i = 0; i < N; ++i) in test_serial()
283 for (int i = N-1; i >= 0; --i) { in test_serial()
[all …]
H A Dtest_async_node.cpp145 const int N = NUMBER_OF_MSGS; in test_reset() local
164 for (int i = 0; i < N; ++i) { in test_reset()
183 for (int i = 0; i < N; ++i) { in test_reset()
204 for (int i = 0; i < N; ++i) { in test_reset()
223 for (int i = 0; i < N; ++i) { in test_reset()
242 for (int i = 0; i < N; ++i) { in test_reset()
262 for (int i = 0; i < N; ++i) { in test_reset()
467 const int N = NUMBER_OF_MSGS; in test_copy_ctor() local
482 for (int i = 0; i < N; ++i) { in test_copy_ctor()
490 CHECK_MESSAGE( ( int(r1.my_count) == N), "counting receiver r1 has not received N items" ); in test_copy_ctor()
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_trace_impl.h78 template < typename PortsTuple, int N >
97 template < typename PortsTuple, int N >
131 template < typename PortsTuple, int N >
152 template < typename PortsTuple, int N >
194 template< int N, typename PortsTuple >
201 template< int N, typename PortsTuple >
209 template< int N, typename PortsTuple >
315 template< int N, typename PortsTuple >
318 template< int N, typename PortsTuple >
321 template< int N, typename PortsTuple >
[all …]
H A D_flow_graph_types_impl.h54 template<int N, template<class> class PT, typename... Args>
55 struct wrap_tuple_elements<N, PT, std::tuple<Args...> >{
68 template< int N, int... S >
69 struct make_sequence : make_sequence < N - 1, N - 1, S... > {};
161 template<typename T, size_t N>
162 struct Wrapper<T[N]> : public WrapperBase {
166 typedef T ArrayType[N];
202 for(size_t i = 0; i < N; ++i ) {
213 for(size_t i = 0; i < N; ++i, ++dp, ++sp) {
257 template<class Q, size_t N, class Tuple>
[all …]
/oneTBB/examples/graph/logic_sim/
H A Dbasics.hpp56 template <int N>
415 template <int N>
417 using gate<N>::my_graph;
435 while (i < N) { in operator ()()
455 and_gate(const and_gate<N>& src) : gate<N>(src.my_graph, and_body()) {} in and_gate()
459 template <int N>
479 while (i < N) { in operator ()()
503 template <int N>
523 while (i < N) { in operator ()()
554 template <int N>
[all …]
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A Dshortpath.cpp170 if (at == N) in make_path()
215 vertices.resize(N); in InitializeGraph()
216 edges.resize(N); in InitializeGraph()
217 predecessor.resize(N); in InitializeGraph()
218 g_distance.resize(N); in InitializeGraph()
219 f_distance.resize(N); in InitializeGraph()
293 (int)N, in main()
299 if (dst >= N) { in main()
303 (int)N, in main()
305 dst = N - 1; in main()
[all …]
/oneTBB/src/tbb/
H A Dtask_stream.h152 unsigned N{};
161 …__TBB_ASSERT( N == max_lanes || (N >= n_lanes && ((N - 1) & N) == 0), "number of lanes miscalculat… in initialize()
162 __TBB_ASSERT( N <= sizeof(population_t) * CHAR_BIT, nullptr); in initialize()
164 for (unsigned i = 0; i < N; ++i) { in initialize()
172 for (unsigned i = 0; i < N; ++i) { in ~task_stream()
185 lane = next_lane( /*out_of=*/N ); in push()
186 __TBB_ASSERT( lane < N, "Incorrect lane index." ); in push()
197 lane = next_lane( /*out_of=*/N); in pop()
198 __TBB_ASSERT(lane < N, "Incorrect lane index."); in pop()
208 unsigned idx = last_used_lane & (N-1); in pop_specific()
[all …]
/oneTBB/test/common/
H A Dgraph_utils.h65 template<size_t N>
70 output_converted_value<N-1>(i, p);
652 const int N = 30;
654 const int N = 300;
672 CHECK(end_receiver.my_count == N);
678 CHECK(end_receiver.my_count == 2 * N);
823 utils::SpinBarrier barrier(N);
893 void test_lightweight(unsigned N) {
896 …test_limited_lightweight_execution<NodeType>(N, (std::min)(std::thread::hardware_concurrency() / 2…
902 void test(unsigned N) {
[all …]

12345