| /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``
21 expressions for ``n1`` and ``n2``, a ``parallel_for`` is used to apply the functions
40 function_node< double *, double * > n1( g, unlimited, [&]( double *a ) -> double * {
62 make_edge( matrix_source, n1 );
64 make_edge( n1, n1_sink );
|
| H A D | communicate_with_nodes.rst | 29 function_node< int, int > n1( g, 1, [](int i) -> int {
30 cout << "n1\n";
39 make_edge( n1, n2 );
51 n1.try_put(i);
66 // we reach here before n1 & n2 are finished
72 its body and sends a message to n1 using an explicit try_put. In turn,
73 n1 runs its body and sends a message to n2. The runtime library does not
74 consider m2 to be a predecessor of n1 since no edge exists.
84 since they belong to g2; the call does not however wait for n1 and n2,
86 reached before n1 and n2 are done.
|
| H A D | use_nested_flow_graphs.rst | 20 node_t n1( h, [=]( msg_t ) { cout << "n1: " << i << "\n"; } );
24 make_edge( n1, n2 );
25 make_edge( n1, n3 );
28 n1.try_put(continue_msg());
101 node_t n1( h, [=]( msg_t ) { cout << "n1: " << i << "\n"; } );
105 make_edge( n1, n2 );
106 make_edge( n1, n3 );
109 n1.try_put(continue_msg());
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | apitrigeom.cpp | 70 vector n1, n2; in rt_tri_fcylinder() local
95 n1 = p1; in rt_tri_fcylinder()
96 MyVNorm(&n1); 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
147 n1 = p1; in rt_tri_ring()
148 MyVNorm(&n1); in rt_tri_ring()
149 MyVAddS(a, &n1, &ctr, &p1); in rt_tri_ring()
150 MyVAddS(b, &n1, &ctr, &p3); 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
118 t->n1 = n1; 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 | 80 vector n1; 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
745 rc |= GetVector(dfile, &n1); 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
144 n1 = 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()
|
| /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/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_node_impl.h | 767 void add_nodes_impl(CompositeType *c_node, bool visible, const NodeType1& n1, const NodeTypes&... n…
768 void *addr = const_cast<NodeType1 *>(&n1);
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_queue.cpp | 1724 size_t n1(15), n2(7); in TestMoveQueue() local
1727 for(size_t i =0; i < n1; i++) in TestMoveQueue()
1785 size_t n1(15), n2(7); in TestMoveQueueUnequal() local
1788 for(size_t i =0; i < n1; i++) in TestMoveQueueUnequal()
|