Home
last modified time | relevance | path

Searched refs:new (Results 1 – 25 of 76) sorted by relevance

1234

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_join_impl.h1272 new type_to_key_function_body_leaf<T0, K, Body0>(body0),
1273 new type_to_key_function_body_leaf<T1, K, Body1>(body1)
1308 new type_to_key_function_body_leaf<T0, K, Body0>(body0),
1310 new type_to_key_function_body_leaf<T2, K, Body2>(body2)
1351 new type_to_key_function_body_leaf<T3, K, Body3>(body3)
1396 new type_to_key_function_body_leaf<T4, K, Body4>(body4)
1446 new type_to_key_function_body_leaf<T5, K, Body5>(body5)
1502 new type_to_key_function_body_leaf<T6, K, Body6>(body6)
1562 new type_to_key_function_body_leaf<T7, K, Body7>(body7)
1626 new type_to_key_function_body_leaf<T8, K, Body8>(body8)
[all …]
H A D_flow_graph_body_impl.h91 return new input_body_leaf< Output, Body >(body);
115 return new function_body_leaf< Input, Output, B >(body);
132 return new function_body_leaf< continue_msg, continue_msg, B >(body);
149 return new function_body_leaf< Input, continue_msg, B >(body);
165 return new function_body_leaf< continue_msg, Output, B >(body);
191 return new multifunction_body_leaf<Input, OutputSet,B>(body);
223 return new type_to_key_function_body_leaf< Input, Output, B>(body);
237 return new type_to_key_function_body_leaf< Input, Output&, B>(body);
H A D_flow_graph_types_impl.h145 if(space) (void) new (space) Wrapper<default_constructed>(default_constructed());
154 (void) new(newSpace) Wrapper(value_space);
185 (void) new(space) Wrapper<default_constructed>(default_constructed());
203 (void) new(vp++) value_type(other[i]);
214 (void) new(dp) value_type(*sp);
221 (void) new(newSpace) Wrapper(*this); // exceptions handled in copy constructor
278 (void) new(mySpace) Wrapper<T>(x);
332 variant() { (void) new(&my_space) Wrapper<default_constructed>(default_constructed()); }
H A D_flow_graph_node_impl.h69 , my_queue(!has_policy<rejecting, Policy>::value ? new input_queue_type() : nullptr) in function_input_base()
365 , my_body( new function_body_leaf< input_type, output_type, Body>(body) ) in function_input()
366 , my_init_body( new function_body_leaf< input_type, output_type, Body>(body) ) { in function_input()
500 , my_body( new multifunction_body_leaf<input_type, output_ports_type, Body>(body) )
501 , my_init_body( new multifunction_body_leaf<input_type, output_ports_type, Body>(body) )
610 , my_body( new function_body_leaf< input_type, output_type, Body>(body) )
611 , my_init_body( new function_body_leaf< input_type, output_type, Body>(body) )
619 , my_body( new function_body_leaf< input_type, output_type, Body>(body) )
620 , my_init_body( new function_body_leaf< input_type, output_type, Body>(body) )
H A D_small_object_pool.h55 auto constructed_object = new(allocated_object) Type(std::forward<Args>(args)...); in new_object()
63 auto constructed_object = new(allocated_object) Type(std::forward<Args>(args)...); in new_object()
H A D_flow_graph_item_buffer_impl.h81 new(&(item(i).first)) item_type(o); in set_my_item()
172 (void)new(new_space) item_type(get_my_item(i)); in grow_my_array()
/oneTBB/doc/main/tbb_userguide/Migration_Guide/
H A DTask_API.rst27 RootTask& root = *new(tbb::task::allocate_root()) RootTask{};
29 ChildTask1& child1 = *new(root.allocate_child()) ChildTask1{/*params*/};
30 ChildTask2& child2 = *new(root.allocate_child()) ChildTask2{/*params*/};
115 tbb::task& child = *new(m_root.allocate_child()) OtherWork;
127 RootTask& root = *new(tbb::task::allocate_root()) RootTask{/*params*/};
132 Task& task = *new(root.allocate_child()) Task(root, items[i]);
347 auto* other_p = new(this->parent().allocate_child()) OtherTask{};
356 RootTask& root = *new(tbb::task::allocate_root()) RootTask{};
358 Task& child = *new(root.allocate_child()) Task{/*params*/};
405 RootTask& root = *new(tbb::task::allocate_root()) RootTask{};
[all …]
/oneTBB/examples/migration/recursive_fibonacci/
H A Dtask_emulation_layer.h28 …task_group_pool() : pool_size(std::thread::hardware_concurrency()), task_submitters(new tbb::task_… in task_group_pool()
87 C* continuation = new C{std::forward<Args>(args)...}; in allocate_continuation()
160 F* obj = new F{std::forward<Args>(args)...}; in allocate_child_impl()
197 obj.reset_parent(new root_task{tg}); in create_root_task()
203 F* obj = new F{std::forward<Args>(args)...}; in allocate_root_task()
205 obj->reset_parent(new root_task{tg}); in allocate_root_task()
/oneTBB/test/common/
H A Dtest_join_node_multiple_predecessors.h50 std::unique_ptr<join_node_t> jn( new join_node_t(g) ); in connect_join_via_make_edge()
62 std::unique_ptr<join_node_t> jn( new join_node_t(follows(bn_set)) ); in connect_join_via_follows()
73 std::unique_ptr<join_node_t> jn( new join_node_t(precedes(qn_copy_set)) ); in connect_join_via_precedes()
H A Dconcurrent_priority_queue_common.h209 vec_sorted.push_back(value_type(new T(item))); in type_tester_unique_ptr()
215 q1.push(value_type(new T(item))); in type_tester_unique_ptr()
216 q1_copy.push(value_type(new T(item))); in type_tester_unique_ptr()
224 q1.emplace(new T(item)); in type_tester_unique_ptr()
H A Dutils_env.h40 char* buf = new char[namelen+valuelen+2]; in SetEnv()
/oneTBB/doc/main/tbb_userguide/
H A Duse_nested_algorithms.rst17 new matrices by applying a function to each element, and two final
41 double *b = new double[N];
48 double *b = new double[N];
H A DTask_Scheduler_Bypass.rst8 the spawning of the new task to be executed by the current thread involves the next steps:
10 - Push a new task onto the thread's deque.
H A Duse_concurrency_limits.rst47 big_object* v = new big_object();
75 ``function_node`` drops below its concurrency limit, it will pull new
H A Davoid_dynamic_node_removal.rst19 It is possible to add new nodes and edges and to remove old edges from a
/oneTBB/test/tbb/
H A Dtest_join_node.h577 JType *temp = new JType(g,
593 JType *temp = new JType(g,
611 JType *temp = new JType(g,
629 JType *temp = new JType(g,
651 JType *temp = new JType(g,
671 JType *temp = new JType(g,
694 JType *temp = new JType(g,
716 JType *temp = new JType(g,
740 JType *temp = new JType(g,
764 JType *temp = new JType(g,
[all …]
/oneTBB/.github/
H A Dpull_request_template.md16 - [ ] new feature - _change that adds functionality_
23 - [ ] added - _required for new features and some bug fixes_
/oneTBB/include/oneapi/tbb/
H A Dparallel_pipeline.h72 my_root( new(r1::allocate_memory(sizeof(filter_node_leaf<InputType, OutputType, Body>))) in filter()
91 …return filter_node_ptr( new(r1::allocate_memory(sizeof(filter_node_leaf<InputType, OutputType, Bod… in make_filter()
108 …return filter_node_ptr( new (r1::allocate_memory(sizeof(filter_node))) filter_node(left.my_root,ri…
H A Dprofiling.h105 wchar_t *type = new wchar_t[len_type]; in create_itt_sync()
108 wchar_t *name = new wchar_t[len_name]; in create_itt_sync()
141 wchar_t *obj_name = new wchar_t[len_name]; in itt_set_sync_name()
H A Denumerable_thread_specific.h632 …void construct(void*where) {new(where) T();} // C++ note: the () in T() ensure zero initialization.
639 void construct(void*where) {new(where) T(exemplar);}
647 void construct(void* where) {new(where) T(f());}
656 new(where) T(args...);
700 return new(where) callback_leaf( std::forward<P>(params)... );
803 new(lref.value()) T(*static_cast<T*>(p));
810 new(lref.value()) T(std::move(*static_cast<T*>(p)));
/oneTBB/src/tbb/
H A Dthread_data.h110 …, my_small_object_pool{new (cache_aligned_allocate(sizeof(small_object_pool_impl))) small_object_p… in new() function
111 , my_context_list(new (cache_aligned_allocate(sizeof(context_list))) context_list{})
H A Dconcurrent_monitor_mutex.h95 new (my_semaphore.begin()) semaphore(); in get_semaphore()
/oneTBB/doc/GSG/
H A Dget_started.rst7 It is helpful for new users of parallel programming and experienced developers that want to improve…
/oneTBB/src/tbbmalloc_proxy/def/
H A Dlin32-proxy.def39 _ZdaPv; /* next ones are new/delete */
H A Dlin64-proxy.def39 _ZdaPv; /* next ones are new/delete */

1234