Home
last modified time | relevance | path

Searched refs:P (Results 1 – 25 of 30) sorted by relevance

12

/oneTBB/include/oneapi/tbb/
H A Dmemory_pool.h77 template<typename T, typename P = pool_base>
80 typedef P pool_type;
97 typedef memory_pool_allocator<U, P> other;
141 template<typename P>
142 class memory_pool_allocator<void, P> {
144 typedef P pool_type;
149 typedef memory_pool_allocator<U, P> other;
167 template<typename T, typename U, typename P>
168 inline bool operator==( const memory_pool_allocator<T,P>& a, const memory_pool_allocator<U,P>& b) {…
170 template<typename T, typename U, typename P>
[all …]
H A Dconcurrent_map.h145 template <typename P>
146 typename std::enable_if<std::is_constructible<value_type, P&&>::value,
149 return this->emplace(std::forward<P>(value)); in insert()
152 template <typename P>
153 typename std::enable_if<std::is_constructible<value_type, P&&>::value,
156 return this->emplace_hint(hint, std::forward<P>(value)); in insert()
262 template <typename P>
263 typename std::enable_if<std::is_constructible<value_type, P&&>::value,
266 return this->emplace(std::forward<P>(value)); in insert()
269 template <typename P>
[all …]
H A Dconcurrent_unordered_map.h128 template<typename P>
129 typename std::enable_if<std::is_constructible<value_type, P&&>::value,
131 return this->emplace(std::forward<P>(value)); in insert()
134 template<typename P>
135 typename std::enable_if<std::is_constructible<value_type, P&&>::value,
137 return this->emplace_hint(hint, std::forward<P>(value)); in insert()
289 template <typename P>
290 typename std::enable_if<std::is_constructible<value_type, P&&>::value,
292 return this->emplace(std::forward<P>(value)); in insert()
295 template<typename P>
[all …]
H A Denumerable_thread_specific.h651 template<typename T, typename... P>
653 stored_pack<P...> pack;
655 call( [where](const typename std::decay<P>::type&... args ){
659 construct_by_args( P&& ... args ) : pack(std::forward<P>(args)...) {}
678 …template<typename... P> callback_leaf( P&& ... params ) : Constructor(std::forward<P>(params)...) …
697 template<typename... P>
698 static callback_base* make( P&& ... params ) {
700 return new(where) callback_leaf( std::forward<P>(params)... );
869 template <typename P1, typename... P,
874 enumerable_thread_specific( P1&& arg1, P&& ... args ) : my_construct_callback(
[all …]
/oneTBB/doc/main/reference/
H A Dscalable_memory_pools.rst11 Here, ``P`` represents an instance of the memory pool class.
20 * - \ ``~P() throw();``
22 * - \ ``void P::recycle();``
24 * - \ ``void* P::malloc(size_t n);``
26 * - \ ``void P::free(void* ptr);``
28 * - \ ``void* P::realloc(void* ptr, size_t n);``
/oneTBB/examples/graph/logic_sim/
H A Dtest_all.cpp345 make_edge(A.get_out(), input_port<P::A0>(my_adder)); in main()
346 make_edge(B.get_out(), input_port<P::B0>(my_adder)); in main()
348 make_edge(output_port<P::S0>(my_adder), Sum.get_in()); in main()
511 make_edge(A[0].get_out(), input_port<P::A0>(two_adder)); in main()
512 make_edge(B[0].get_out(), input_port<P::B0>(two_adder)); in main()
515 make_edge(A[1].get_out(), input_port<P::A1>(two_adder)); in main()
516 make_edge(B[1].get_out(), input_port<P::B1>(two_adder)); in main()
559 make_edge(A[0].get_out(), input_port<P::A0>(four_adder)); in main()
560 make_edge(B[0].get_out(), input_port<P::B0>(four_adder)); in main()
563 make_edge(A[1].get_out(), input_port<P::A1>(four_adder)); in main()
[all …]
H A Done_bit_adder.hpp20 namespace P { namespace
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_sample.cpp145 point_t extremum(const pointVec_t &P) { in extremum() argument
146 FindXExtremum fxBody(P, type); in extremum()
147 oneapi::tbb::parallel_reduce(range_t(0, P.size(), FindXExtremum::grainSize), fxBody); in extremum()
210 point_t divide(const pointVec_t &P, pointVec_t &P_reduced, const point_t &p1, const point_t &p2) { in divide() argument
211 SplitByCP_buf sbcpb(p1, p2, P, P_reduced); in divide()
214 range_t(0, P.size(), SplitByCP_buf::grainSize), sbcpb, oneapi::tbb::simple_partitioner()); in divide()
218 ss << P.size() << " nodes in bucket" in divide()
228 void divide_and_conquer(const pointVec_t &P, pointVec_t &H, point_t p1, point_t p2) { in divide_and_conquer() argument
229 assert(P.size() >= 2); in divide_and_conquer()
232 point_t p_far = divide(P, P_reduced, p1, p2); in divide_and_conquer()
H A Dconvex_hull_bench.cpp109 point_t farPoint = std::for_each(P.begin(), P.end(), splitByCP); in divide()
113 ss << P.size() << " nodes in bucket" in divide()
124 assert(P.size() >= 2); in divide_and_conquer()
127 point_t p_far = divide(P, P_reduced, p1, p2); in divide_and_conquer()
365 point_t extremum(const pointVec_t &P) { in extremum() argument
366 FindXExtremum fxBody(P, type); in extremum()
509 BodyType body(p1, p2, P, P_reduced); in divide()
516 ss << P.size() << " nodes in bucket" in divide()
527 assert(P.size() >= 2); in divide_and_conquer()
533 p_far = divide<SplitByCP_buf>(P, P_reduced, p1, p2); in divide_and_conquer()
[all …]
/oneTBB/src/tbb/
H A Dsemaphore.h136 void P() {WaitForSingleObjectEx( sem, INFINITE, FALSE );} in P() function
154 void P() { in P() function
177 void P() { in P() function
204 void P() { WaitForSingleObjectEx( my_sem, INFINITE, FALSE ); } in P() function
225 void P();
247 void P() { in P() function
283 void P() { in P() function
H A Dconcurrent_monitor.h153 if (this->my_skipped_wakeup) semaphore().P(); in ~sleep_node()
170 semaphore().P(); in wait()
178 semaphore().P(); in reset()
348 template <typename P>
349 void notify( const P& predicate ) { in notify()
356 template<typename P>
357 void notify_relaxed( const P& predicate ) { in notify_relaxed()
391 template<typename P>
392 void notify_one_relaxed( const P& predicate ) { in notify_one_relaxed()
H A Dsemaphore.cpp76 P(); in binary_semaphore()
84 void binary_semaphore::P() { __TBB_acquire_binsem( &my_sem.lock ); } in P() function in tbb::detail::r1::binary_semaphore
H A Dconcurrent_monitor_mutex.h74 get_semaphore().P(); in wait()
H A Drml_thread_monitor.h235 my_sema.P(); in wait()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_node_impl.h451 template<typename P> static void clear_this(P &p) { in clear_this()
456 template<typename P> static bool this_empty(P &p) { in this_empty()
465 template<typename P> static void clear_this(P &p) {
469 template<typename P> static bool this_empty(P &p) {
574 template<typename T, typename P>
575 static graph_task* emit_this(graph& g, const T &t, P &p) {
585 template<typename T, typename P>
586 static graph_task* emit_this(graph& g, const T &t, P &p) {
/oneTBB/test/tbb/
H A Dtest_semaphore.cpp65 mySem.P(); in operator ()()
124 my_counter.my_sem.P(); in operator ()()
204 my_sem.P(); in Produce()
230 my_sem.P(); in Consume()
H A Dtest_flow_graph_whitebox.cpp552 template<typename P, typename T>
567 template<typename P>
569 typedef tbb::flow::multifunction_node<int, std::tuple<int, int>, P> multinode_type; in TestMultifunctionNode()
571 test_reversal<P,multinode_type> my_test; in TestMultifunctionNode()
601 if (!std::is_same<P, tbb::flow::rejecting>::value) { in TestMultifunctionNode()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_shutdown_hang.cpp56 const int P = tbb::global_control::max_allowed_parallelism; in hangOnExitReproducer() local
58 for (int i = 0; i < P-1; i++) { in hangOnExitReproducer()
/oneTBB/examples/parallel_for/tachyon/src/
H A Dtriangle.cpp208 vector P, tmp, norm; in stri_normal() local
213 VSUB((*pnt), trn->v0, P); in stri_normal()
215 CROSS(tmp, P, trn->edge2); in stri_normal()
218 CROSS(tmp, trn->edge1, P); in stri_normal()
/oneTBB/cmake/
H A Dvars_utils.cmake39 -P ${PROJECT_SOURCE_DIR}/integration/cmake/generate_vars.cmake
/oneTBB/integration/cmake/
H A Dgenerate_vars.cmake40 set(TBBROOT_REPLACEMENT "$(cd $(dirname \${BASH_SOURCE}) && pwd -P)/..")
/oneTBB/examples/parallel_for/seismic/gui/
H A Dseismic.rc68 "P", ID_FILE_PARALLEL, VIRTKEY, ALT, NOINVERT
/oneTBB/python/
H A DCMakeLists.txt51 -P ${PROJECT_SOURCE_DIR}/cmake/python/test_launcher.cmake)
/oneTBB/doc/main/intro/
H A Dnotation.rst30 - X{K \| W \| P} Indicates XK, XW, or XP.
/oneTBB/doc/main/reference/scalable_memory_pools/
H A Dmemory_pool_allocator_cls.rst57 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw();

12