| /oneTBB/doc/main/tbb_userguide/ |
| H A D | use_nested_algorithms.rst | 16 ``function_nodes``, ``n1`` and ``n2``, that receive these matrices and generate two
19 matrices. The ``matrix_source`` is connected to both ``n1`` and ``n2``. The node ``n1``
20 is connected to ``n1_sink``, and ``n2`` is connected to ``n2_sink``. In the lambda
21 expressions for ``n1`` and ``n2``, a ``parallel_for`` is used to apply the functions
47 function_node< double *, double * > n2( g, unlimited, [&]( double *a ) -> double * {
63 make_edge( matrix_source, n2 );
65 make_edge( n2, n2_sink );
|
| H A D | use_nested_flow_graphs.rst | 21 node_t n2( h, [=]( msg_t ) { cout << "n2: " << i << "\n"; } );
24 make_edge( n1, n2 );
26 make_edge( n2, n4 );
102 node_t n2( h, [=]( msg_t ) { cout << "n2: " << i << "\n"; } );
105 make_edge( n1, n2 );
107 make_edge( n2, n4 );
|
| H A D | communicate_with_nodes.rst | 34 function_node< int, int > n2( g, 1, [](int i) -> int {
35 cout << "n2\n";
39 make_edge( n1, n2 );
66 // we reach here before n1 & n2 are finished
73 n1 runs its body and sends a message to n2. The runtime library does not
84 since they belong to g2; the call does not however wait for n1 and n2,
86 reached before n1 and n2 are done.
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | apitrigeom.cpp | 70 vector n1, n2; in rt_tri_fcylinder() local
101 n2 = p2; in rt_tri_fcylinder()
102 MyVNorm(&n2); in rt_tri_fcylinder()
108 rt_stri(tex, p1, p2, p3, n1, n2, n1); in rt_tri_fcylinder()
109 rt_stri(tex, p3, p2, p4, n1, n2, n2); in rt_tri_fcylinder()
122 vector n1, n2; in rt_tri_ring() local
154 n2 = p2; in rt_tri_ring()
155 MyVNorm(&n2); in rt_tri_ring()
156 MyVAddS(a, &n2, &ctr, &p2); in rt_tri_ring()
157 MyVAddS(b, &n2, &ctr, &p4); in rt_tri_ring()
|
| H A D | triangle.cpp | 97 object *newstri(void *tex, vector v0, vector v1, vector v2, vector n0, vector n1, vector n2) { in newstri() argument
119 t->n2 = n2; in newstri()
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 D | triangle.hpp | 81 vector n2; member
|
| H A D | api.cpp | 380 void rt_stri(void *tex, vector v0, vector v1, vector v2, vector n0, vector n1, vector n2) { in rt_stri() argument
383 trn = newstri(tex, (vector)v0, (vector)v1, (vector)v2, (vector)n0, (vector)n1, (vector)n2); in rt_stri()
|
| H A D | parse.cpp | 728 vector v0, v1, v2, n0, n1, n2; in GetSTri() local
748 rc |= GetVector(dfile, &n2); in GetSTri()
752 rt_stri(tex, v0, v1, v2, n0, n1, n2); in GetSTri()
|
| /oneTBB/examples/graph/fgbzip2/ |
| H A D | huffman.cpp | 116 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
148 n2 = heap[1]; in BZ2_hbMakeCodeLengths()
153 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
154 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
|
| H A D | bzlib.cpp | 1084 Int32 n, n2, ret; in BZ_API() local
1120 n2 = fwrite((void*)(bzf->buf), sizeof(UChar), n, bzf->handle); in BZ_API()
1121 if (n != n2 || ferror(bzf->handle)) { in BZ_API()
1150 Int32 n, n2, ret; in BZ_API() local
1187 n2 = fwrite((void*)(bzf->buf), sizeof(UChar), n, bzf->handle); in BZ_API()
1188 if (n != n2 || ferror(bzf->handle)) { in BZ_API()
|
| /oneTBB/doc/main/reference/ |
| H A D | follows_and_precedes_functions.rst | 72 auto handlers = make_node_set(n1, n2, n3);
78 broadcast_node<int> input(precedes(n1, n2, n3));
|
| /oneTBB/test/tbb/ |
| H A D | test_flow_graph.cpp | 368 continue_node<int> n2(g, [](const continue_msg &){return 1;}); in __anon515993d30602() variable
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_queue.cpp | 1724 size_t n1(15), n2(7); in TestMoveQueue() local
1733 for(size_t i =0; i < n2; i++) in TestMoveQueue()
1785 size_t n1(15), n2(7); in TestMoveQueueUnequal() local
1792 for(size_t i =0; i < n2; i++) in TestMoveQueueUnequal()
|