Home
last modified time | relevance | path

Searched refs:src (Results 1 – 25 of 75) sorted by relevance

123

/oneTBB/examples/parallel_for/tachyon/
H A DCMakeLists.txt27 src/main.cpp src/pthread.cpp
28 src/tachyon_video.cpp src/api.cpp
32 src/box.cpp
38 src/grid.cpp
40 src/imap.cpp
42 src/jpeg.cpp
47 src/ppm.cpp
50 src/ring.cpp
57 src/ui.cpp
58 src/util.cpp
[all …]
/oneTBB/doc/GSG/
H A Dsamples.rst13 …* `concurrent_hash_map <https://github.com/oneapi-src/oneTBB/tree/master/examples/concurrent_hash_…
14 …* `concurrent_priority_queue <https://github.com/oneapi-src/oneTBB/tree/master/examples/concurrent…
16 * `Flow Graph <https://github.com/oneapi-src/oneTBB/tree/master/examples/graph>`_
18 …* `Cholesky Factorization algorithm <https://github.com/oneapi-src/oneTBB/tree/master/examples/gra…
27 * `parallel_for <https://github.com/oneapi-src/oneTBB/tree/master/examples/parallel_for>`_
29 …* `Polygon overlay <https://github.com/oneapi-src/oneTBB/tree/master/examples/parallel_for/polygon…
34 …* `parallel_for_each <https://github.com/oneapi-src/oneTBB/tree/master/examples/parallel_for_each>…
35 …* `parallel_pipeline <https://github.com/oneapi-src/oneTBB/tree/master/examples/parallel_pipeline>…
36 * `parallel_reduce <https://github.com/oneapi-src/oneTBB/tree/master/examples/parallel_reduce>`_
40 * `task_arena <https://github.com/oneapi-src/oneTBB/tree/master/examples/task_arena>`_
[all …]
/oneTBB/examples/graph/logic_sim/
H A Dbasics.hpp277 pulse(const pulse& src) in pulse() argument
287 ms = src.ms; in operator =()
289 reps = src.reps; in operator =()
312 push_button(const push_button& src) : my_graph(src.my_graph), push_button_node(src.my_graph) { in push_button() argument
384 buffer(const buffer& src) : gate<1>(src.my_graph, buffer_body()) {} in buffer() argument
411 not_gate(const not_gate& src) : gate<1>(src.my_graph, not_body()) {} in not_gate() argument
455 and_gate(const and_gate<N>& src) : gate<N>(src.my_graph, and_body()) {} in and_gate() argument
499 or_gate(const or_gate& src) : gate<N>(src.my_graph, or_body()) {} in or_gate() argument
550 xor_gate(const xor_gate& src) : gate<N>(src.my_graph, xor_body()) {} in xor_gate() argument
598 nor_gate(const nor_gate& src) : gate<N>(src.my_graph, nor_body()) {} in nor_gate() argument
[all …]
H A Done_bit_adder.hpp78 one_bit_adder(const one_bit_adder& src) in one_bit_adder() argument
79 : base_type(src.my_graph), in one_bit_adder()
80 my_graph(src.my_graph), in one_bit_adder()
81 A_port(src.my_graph), in one_bit_adder()
82 B_port(src.my_graph), in one_bit_adder()
83 CI_port(src.my_graph), in one_bit_adder()
84 FirstXOR(src.my_graph), in one_bit_adder()
85 SecondXOR(src.my_graph), in one_bit_adder()
86 FirstAND(src.my_graph), in one_bit_adder()
87 SecondAND(src.my_graph), in one_bit_adder()
[all …]
H A Dtwo_bit_adder.hpp40 two_bit_adder(const two_bit_adder& src) in two_bit_adder() argument
41 : base_type(src.my_graph), in two_bit_adder()
42 my_graph(src.my_graph), in two_bit_adder()
43 two_adders(2, one_bit_adder(src.my_graph)) { in two_bit_adder()
H A Dfour_bit_adder.hpp47 four_bit_adder(const four_bit_adder& src) in four_bit_adder() argument
48 : fba_base_type(src.my_graph), in four_bit_adder()
49 my_graph(src.my_graph), in four_bit_adder()
50 four_adders(4, one_bit_adder(src.my_graph)) { in four_bit_adder()
/oneTBB/
H A DBUILD.bazel26 "src/tbb/*.cpp",
27 "src/tbb/*.h",
86 "src/tbbmalloc/*.h",
87 "src/tbb/*.h",
88 "src/tbbmalloc_proxy/*.h",
90 "src/tbbmalloc/backend.cpp",
91 "src/tbbmalloc/backref.cpp",
92 "src/tbbmalloc/frontend.cpp",
93 "src/tbbmalloc/large_objects.cpp",
94 "src/tbbmalloc/tbbmalloc.cpp",
[all …]
H A DREADME.md2 …[oneTBB CI](https://github.com/oneapi-src/oneTBB/actions/workflows/ci.yml/badge.svg)](https://gith…
19 Refer to oneTBB [examples](examples) and [samples](https://github.com/oneapi-src/oneAPI-samples/tre…
31 * [oneTBB Developer Guide and Reference](https://oneapi-src.github.io/oneTBB)
32 * [Migrating from TBB to oneTBB](https://oneapi-src.github.io/oneTBB/main/tbb_userguide/Migration_G…
34 * [oneTBB Testing Approach](https://oneapi-src.github.io/oneTBB/main/intro/testing_approach.html)
36 * [oneTBB Discussions](https://github.com/oneapi-src/oneTBB/discussions)
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_queue.h111 concurrent_queue(concurrent_queue&& src) : in concurrent_queue() argument
114 internal_swap(src); in concurrent_queue()
122 if (my_allocator == src.my_allocator) { in concurrent_queue()
123 internal_swap(src); in concurrent_queue()
127 src.clear(); in concurrent_queue()
171 concurrent_queue src(first, last); in assign()
238 void internal_swap(concurrent_queue& src) { in internal_swap() argument
392 internal_swap(src); in concurrent_bounded_queue()
400 if (my_allocator == src.my_allocator) { in concurrent_bounded_queue()
401 internal_swap(src); in concurrent_bounded_queue()
[all …]
H A Dpartitioner.h304 adaptive_mode(adaptive_mode &src, split) : my_divisor(do_split(src, split())) {} in adaptive_mode()
310 std::size_t do_split(adaptive_mode &src, split) { in do_split()
311 return src.my_divisor /= 2u; in do_split()
323 proportional_mode(proportional_mode &src, split) : adaptive_mode<Partition>(src, split()) {} in proportional_mode()
325 : adaptive_mode<Partition>(src, split_obj) in proportional_mode()
327 self().my_divisor = do_split(src, split_obj); in proportional_mode()
332 src.my_divisor -= portion; in do_split()
368 …linear_affinity_mode(linear_affinity_mode &src, split) : proportional_mode<Partition>(src, split()) in linear_affinity_mode()
369 …, my_head((src.my_head + src.my_divisor) % src.my_max_affinity), my_max_affinity(src.my_max_affini… in linear_affinity_mode()
370 …r_affinity_mode(linear_affinity_mode &src, const proportional_split& split_obj) : proportional_mod… in linear_affinity_mode()
[all …]
H A Dmemory_pool.h101 memory_pool_allocator(const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw()
103 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() argument
153 memory_pool_allocator( const memory_pool_allocator& src) throw() : my_pool(src.my_pool) {} in throw()
155 memory_pool_allocator(const memory_pool_allocator<U,P>& src) throw() : my_pool(src.my_pool) {} in memory_pool_allocator() argument
182 explicit memory_pool(const Alloc &src = Alloc());
203 memory_pool<Alloc>::memory_pool(const Alloc &src) : my_alloc(src) { in memory_pool() argument
/oneTBB/doc/main/tbb_userguide/
H A Duse_input_node.rst23 input_node< int > src( g, src_body(10), false );
25 src.activate();
42 input_node< int > src( g, src_body(10), false );
43 make_edge( src, squarer );
44 make_edge( src, cuber );
45 src.activate();
69 src is activated just after its construction:
86 src.activate();
99 make_edge( src, func1 );
106 before the edge from src to ``func1``. If the edge from src to func1 were
[all …]
/oneTBB/test/common/
H A Dstate_trackable.h115 StateTrackable( const StateTrackable& src ) noexcept : state(CopyInitialized) { in StateTrackable()
116 CHECK_FAST_MESSAGE(src.is_valid(), "Bad source for copy ctor"); in StateTrackable()
119 StateTrackable( StateTrackable&& src ) noexcept : state(MoveInitialized) { in StateTrackable()
120 CHECK_FAST_MESSAGE(src.is_valid(), "Bad source for move ctor"); in StateTrackable()
121 src.state = MovedFrom; in StateTrackable()
124 StateTrackable& operator=( const StateTrackable& src ) noexcept {
126 CHECK_FAST_MESSAGE(src.is_valid(), "Bad source for copy assignment");
131 StateTrackable& operator=( StateTrackable&& src ) noexcept {
133 CHECK_FAST_MESSAGE(src.is_valid(), "Bad source for move assignment");
135 src.state = MovedFrom;
H A Dcommon_arena_constraints.h104 index_info(const index_info& src) in index_info()
105 : index{src.index} in index_info()
106 , concurrency{src.concurrency}
107 , cpuset{hwloc_bitmap_dup(src.cpuset)}
110 index_info& operator=(index_info src) {
111 index = src.index;
112 concurrency = src.concurrency;
113 std::swap(cpuset, src.cpuset);
129 core_info(const core_info& src) in core_info()
133 core_info& operator=(core_info src) {
[all …]
H A Dchecktype.h34 DestroyedTracker( const DestroyedTracker& src ) : my_state(LIVE) { in DestroyedTracker() argument
35 CHECK_FAST_MESSAGE(src.is_alive(), "Constructing from the dead source"); in DestroyedTracker()
43 DestroyedTracker& operator=( const DestroyedTracker& src ) {
45 CHECK_FAST_MESSAGE(src.is_alive(), "Assignment from the dead source");
H A Dvector_types.h52 ClassWithVectorType( const ClassWithVectorType& src ) { in ClassWithVectorType() argument
54 field[i] = src.field[i]; in ClassWithVectorType()
58 ClassWithVectorType& operator=( const ClassWithVectorType& src ) {
61 stack[i^5] = src.field[i];
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A Dshortpath.cpp83 std::size_t src = 0; // start of path variable
112 f_distance[src] = in shortpath()
114 open_set.emplace(src, f_distance[src]); // emplace src into open_set in shortpath()
171 path.push_back(src); in make_path()
172 else if (at == src) { in make_path()
173 path.push_back(src); in make_path()
177 make_path(src, at, path); in make_path()
185 make_path(src, dst, path); in print_path()
294 (int)src, in main()
323 (int)src, in main()
[all …]
/oneTBB/examples/parallel_for/game_of_life/
H A DUpdate_state.cpp26 dst[0] |= src[width - 1]; in create_record()
28 dst[0] |= src[i] << (i + 1); in create_record()
130 char* src = &mas[(row + begin) * width]; in UpdateState() local
132 create_record(src, dst, width); in UpdateState()
135 char* src; in UpdateState() local
137 src = &mas[(m_matrix->height - 1) * width]; in UpdateState()
140 src = &mas[(begin - 1) * width]; in UpdateState()
143 create_record(src, dst, width); in UpdateState()
147 src = mas; in UpdateState()
150 src = &mas[end * width]; in UpdateState()
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_machine.h213 inline unsigned char reverse_byte(unsigned char src) { in reverse_byte() argument
214 return reverse<unsigned char>::byte_table[src]; in reverse_byte()
219 T machine_reverse_bits(T src) { in machine_reverse_bits() argument
221 return builtin_bitreverse(fixed_width_cast(src)); in machine_reverse_bits()
224 unsigned char *original = reinterpret_cast<unsigned char *>(&src); in machine_reverse_bits()
340 cpu_ctl_env( const cpu_ctl_env &src ) : my_fenv_ptr(nullptr) { in cpu_ctl_env() argument
341 *this = src; in cpu_ctl_env()
343 cpu_ctl_env& operator=( const cpu_ctl_env &src ) {
344 __TBB_ASSERT( src.my_fenv_ptr, nullptr);
347 *my_fenv_ptr = *src.my_fenv_ptr;
H A D_flow_graph_node_impl.h78 …: function_input_base(src.my_graph_ref, src.my_max_concurrency, src.my_priority, src.my_is_no_thro… in function_input_base()
99 op_data.r = &src; in register_predecessor()
107 op_data.r = &src; in remove_predecessor()
370 function_input( const function_input& src ) : in function_input() argument
371 base_type(src), in function_input()
372 my_body( src.my_init_body->clone() ), in function_input()
373 my_init_body(src.my_init_body->clone() ) { in function_input()
507 base_type(src),
508 my_body( src.my_init_body->clone() ),
509 my_init_body(src.my_init_body->clone() ),
[all …]
H A D_concurrent_queue_base.h106 using item_constructor_type = void (*)(value_type* location, const void* src);
200 micro_queue& assign( const micro_queue& src, queue_allocator_type& allocator, in assign() argument
203 … head_counter.store(src.head_counter.load(std::memory_order_relaxed), std::memory_order_relaxed); in assign()
206 const padded_page* srcp = src.head_page.load(std::memory_order_relaxed); in assign()
223 if (srcp != src.tail_page.load(std::memory_order_relaxed)) { in assign()
229 __TBB_ASSERT(srcp == src.tail_page.load(std::memory_order_relaxed), nullptr ); in assign()
327 void copy_item( padded_page& dst, size_type dindex, const padded_page& src, size_type sindex, in copy_item() argument
330 auto& src_item = src[sindex]; in copy_item()
334 void assign_and_destroy_item( void* dst, padded_page& src, size_type index ) { in assign_and_destroy_item() argument
335 auto& from = src[index]; in assign_and_destroy_item()
[all …]
/oneTBB/src/tbb/
H A Dcancellation_disseminator.h38 …mic<uint32_t> d1::task_group_context::*mptr_state, d1::task_group_context& src, uint32_t new_state… in propagate_task_group_state() argument
39 …if (src.my_may_have_children.load(std::memory_order_relaxed) != d1::task_group_context::may_have_c… in propagate_task_group_state()
47 if ((src.*mptr_state).load(std::memory_order_relaxed) != new_state) { in propagate_task_group_state()
57 thr_data.propagate_task_group_state(mptr_state, src, new_state); in propagate_task_group_state()
/oneTBB/python/rml/
H A DCMakeLists.txt16 ../../src/tbb/allocator.cpp
17 ../../src/tbb/dynamic_link.cpp
18 ../../src/tbb/misc.cpp
19 ../../src/tbb/misc_ex.cpp
20 ../../src/tbb/exception.cpp
/oneTBB/test/conformance/
H A Dconformance_composite_node.cpp96 oneapi::tbb::flow::input_node<int> src(g, body());
112 …auto output_tuple = std::tie(ct,j, ind, fxn, src, bc, oneapi::tbb::flow::output_port<0>(s), lim, o…
119 a_node.add_visible_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
120 a_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
134 b_node.add_visible_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
135 b_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
148 c_node.add_visible_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
150 c_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_sample.cpp38 void appendVector(const point_t *src, std::size_t srcSize, pointVec_t &dest) { in appendVector() argument
39 std::copy(src, src + srcSize, dest.grow_by(srcSize)); in appendVector()
42 void appendVector(const pointVec_t &src, pointVec_t &dest) { in appendVector() argument
43 std::copy(src.begin(), src.end(), dest.grow_by(src.size())); in appendVector()

123