| /oneTBB/src/tbb/ |
| H A D | tls.h | 40 int create( tls_dtor_t dtor = nullptr ) { 50 int create() { 61 int create() {
|
| H A D | global_control.cpp | 189 static void create(d1::global_control& gc) { in create() function 249 void __TBB_EXPORTED_FUNC create(d1::global_control& gc) { in create() function 250 global_control_impl::create(gc); in create()
|
| H A D | governor.cpp | 64 int status = theTLS.create(auto_terminate); in acquire_resources() 66 int status = theTLS.create(); in acquire_resources() 195 arena& a = arena::create(thr_control, num_slots, num_reserved_slots, arena_priority_level); in init_external_thread()
|
| /oneTBB/test/tbb/ |
| H A D | test_join_node.h | 561 static JType *create(tbb::flow::graph& g) { 576 static JType *create(tbb::flow::graph& g) { 592 static JType *create(tbb::flow::graph& g) { 610 static JType *create(tbb::flow::graph& g) { 628 static JType *create(tbb::flow::graph& g) { 650 static JType *create(tbb::flow::graph& g) { 670 static JType *create(tbb::flow::graph& g) { 693 static JType *create(tbb::flow::graph& g) { 715 static JType *create(tbb::flow::graph& g) { 739 static JType *create(tbb::flow::graph& g) { [all …]
|
| H A D | test_join_node.cpp | 63 JType * my_join = makeJoin<N, JType, tbb::flow::tag_matching>::create(g); in test() 67 … input_join_type * my_input_join = makeJoin<2, input_join_type, tbb::flow::reserving>::create(g); in test()
|
| H A D | test_split_node.cpp | 127 static SType *create(tbb::flow::graph& g) { in create() function in makeSplit 236 SType* my_split = makeSplit<N,SType>::create(g); in test() 345 SType* my_split = makeSplit<TUPLE_SIZE,SType>::create(g); in test()
|
| H A D | test_scheduler_mix.cpp | 407 void create(Random& rnd) { in create() function in ArenaTable 533 arenaTable.create(r); in do_it()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | global_control.h | 40 TBB_EXPORT void __TBB_EXPORTED_FUNC create(d1::global_control&); 77 r1::create(*this); in global_control()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | use_make_edge.rst | 21 functions, such as sender<T>::register_successor, to create these edges,
|
| H A D | Flow_Graph_Reservation.rst | 10 every input before they can create an output message. The reserving 12 messages from its inputs until it has a message at each input. To create 32 reserving ``join_node`` will create a message using the reserved 47 to create and push a message if all input ports succeed reserving
|
| H A D | Task-Based_Programming.rst | 31 The threads you create with a threading package are *logical* threads, 79 Design your programs to try to create many more tasks than there are
|
| H A D | broadcast_or_send.rst | 85 characteristic to create useful graph structures such as the one shown 91 values, and in priority order? You can easily create this behavior by
|
| H A D | Using_Circular_Buffers.rst | 9 first filter to create an item and last filter to consume an item are
|
| H A D | appendix_B.rst | 39 ``#pragma omp parallel`` causes the OpenMP to create a team of threads,
|
| H A D | Parallelizing_Flow_Graph.rst | 8 It's possible to create graphs that are highly scalable, but it is also possible to 9 create graphs that are completely sequential.
|
| H A D | cancel_a_graph.rst | 7 To cancel a graph execution without an exception, you can create the
|
| H A D | create_token_based_system.rst | 17 ``join_node``s can be used to create an analogous system. A ``join_node`` has 123 to repeatedly allocate and deallocate them, and essentially create a
|
| H A D | Predefined_Node_Types.rst | 8 class sender and class receiver but it is likely that you can create 39 …e generic types. The node combines one message from each input port to create a tuple that is …
|
| H A D | use_input_node.rst | 55 In general it is safest to create your ``input_node`` objects in the inactive
|
| H A D | Cancellation_and_Nested_Parallelism.rst | 16 Nested oneTBB algorithms create a tree of these ``task_group_context``
|
| H A D | communicate_with_nodes.rst | 17 If two graphs must communicate, do NOT create an edge between them, but
|
| H A D | Dependence_Graph.rst | 8 computations and the edges create a partial ordering of these
|
| /oneTBB/examples/graph/logic_sim/ |
| H A D | README.md | 2 … logic simulations with basic logic gates that can be easily composed to create more interesting c…
|
| /oneTBB/ |
| H A D | INSTALL.md | 73 The following commands allow you to create a simple portable package that includes header files, li… 91 … team members and community contributors. If the version is out of date, create an issue or pull r…
|
| /oneTBB/examples/graph/cholesky/ |
| H A D | README.md | 8 …here a loop nest that is similar to the serial implementation is used to create an unrolled versio…
|