Home
last modified time | relevance | path

Searched refs:source (Results 1 – 25 of 55) sorted by relevance

123

/oneTBB/examples/parallel_for/game_of_life/
H A DUpdate_state.cpp258 return *(source + ((x * y) - 1)); in GetAdjacentCellState()
264 return *(source + (cellNumber - 1)); in GetAdjacentCellState()
272 return *((source + cellNumber) - x); in GetAdjacentCellState()
276 return *(source + ((x * y) - x)); in GetAdjacentCellState()
290 return *(source + (cellNumber + 1)); in GetAdjacentCellState()
294 return *source; in GetAdjacentCellState()
308 return *(source + (cellNumber + x)); in GetAdjacentCellState()
312 return *(source + (x - 1)); in GetAdjacentCellState()
326 return *(source + (cellNumber - 1)); in GetAdjacentCellState()
333 char* source = m_matrix->data; in CheckCell() local
[all …]
H A DEvolution.cpp142 static void set_values(Matrix* source, char* dest) { in set_values() argument
143 m_source = source; in set_values()
/oneTBB/test/common/
H A Dcontainer_move_support.h333 MemoryLocations( const ContainerType& source ) : locations(source.size()) { in MemoryLocations()
334 for (auto it = source.begin(); it != source.end(); ++it) { in MemoryLocations()
431 container_type& source; member
439 locations(source) in container_size()
448 locations(source) in container_size()
460 verify_size(source); in init()
672 container_type dst(std::move(fixture.source), fixture.source.get_allocator()); in test_move_ctor_with_equal_allocator()
700 dst = std::move(fixture.source); in test_move_assignment_POCMA_true_stateful_allocator()
721 dst = std::move(fixture.source); in test_move_assignment_POCMA_true_stateless_allocator()
737 dst = std::move(fixture.source); in test_move_assignment_POCMA_false_equal_allocator()
[all …]
H A Dconcurrent_lru_cache_common.h211 helpers::instance_serial_counter source; member
217 cloner(source), in preset_instance_count()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_set.h95 void merge(concurrent_set<key_type, OtherCompare, Allocator>& source) { in merge() argument
96 this->internal_merge(source); in merge()
100 void merge(concurrent_set<key_type, OtherCompare, Allocator>&& source) { in merge() argument
101 this->internal_merge(std::move(source)); in merge()
106 this->internal_merge(source); in merge()
111 this->internal_merge(std::move(source)); in merge()
196 void merge(concurrent_set<key_type, OtherCompare, Allocator>& source) { in merge() argument
197 this->internal_merge(source); in merge()
202 this->internal_merge(std::move(source)); in merge()
207 this->internal_merge(source); in merge()
[all …]
H A Dconcurrent_map.h160 void merge(concurrent_map<key_type, mapped_type, OtherCompare, Allocator>& source) { in merge() argument
161 this->internal_merge(source); in merge()
165 void merge(concurrent_map<key_type, mapped_type, OtherCompare, Allocator>&& source) { in merge() argument
166 this->internal_merge(std::move(source)); in merge()
171 this->internal_merge(source); in merge()
176 this->internal_merge(std::move(source)); in merge()
278 this->internal_merge(source); in merge()
283 this->internal_merge(std::move(source)); in merge()
287 void merge(concurrent_map<key_type, mapped_type, OtherCompare, Allocator>& source) { in merge() argument
288 this->internal_merge(source); in merge()
[all …]
H A Dconcurrent_unordered_set.h88 …oid merge( concurrent_unordered_set<key_type, OtherHash, OtherKeyEqual, allocator_type>& source ) { in merge() argument
89 this->internal_merge(source); in merge()
93 …id merge( concurrent_unordered_set<key_type, OtherHash, OtherKeyEqual, allocator_type>&& source ) { in merge() argument
94 this->internal_merge(std::move(source)); in merge()
99 this->internal_merge(source); in merge()
104 this->internal_merge(std::move(source)); in merge()
227 …oid merge( concurrent_unordered_set<key_type, OtherHash, OtherKeyEqual, allocator_type>& source ) { in merge() argument
228 this->internal_merge(source); in merge()
233 this->internal_merge(std::move(source)); in merge()
238 this->internal_merge(source); in merge()
[all …]
H A Dconcurrent_unordered_map.h141 …ncurrent_unordered_map<key_type, mapped_type, OtherHash, OtherKeyEqual, allocator_type>& source ) { in merge() argument
142 this->internal_merge(source); in merge()
146 …current_unordered_map<key_type, mapped_type, OtherHash, OtherKeyEqual, allocator_type>&& source ) { in merge() argument
147 this->internal_merge(std::move(source)); in merge()
152 this->internal_merge(source); in merge()
157 this->internal_merge(std::move(source)); in merge()
302 …ncurrent_unordered_map<key_type, mapped_type, OtherHash, OtherKeyEqual, allocator_type>& source ) { in merge() argument
303 this->internal_merge(source); in merge()
308 this->internal_merge(std::move(source)); in merge()
313 this->internal_merge(source); in merge()
[all …]
/oneTBB/doc/main/reference/
H A Dtask_group_extensions.rst16 …p specification <https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/tas…
86 …p specification <https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/tas…
87 …t specification <https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/sch…
88 …s specification <https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/tas…
89 …dle class <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/task_scheduler/tas…
/oneTBB/doc/main/tbb_userguide/
H A Dstd_invoke.rst207 * `parallel_for <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/algorithms/fu…
208 * `parallel_reduce <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/algorithms…
209 …ic_reduce <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/algorithms/functio…
210 * `parallel_for_each <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/algorith…
211 * `parallel_scan <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/algorithms/f…
212 * `parallel_pipeline <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/algorith…
213 * `function_node <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/flow_graph/f…
214 * `multifunction_node <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/flow_gr…
215 * `async_node <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/flow_graph/asyn…
216 * `sequencer_node <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/flow_graph/…
[all …]
H A DMigration_Guide.rst6 While oneTBB is mostly source compatible with TBB, some interfaces were deprecated
H A DConstraints.rst7 enforce `named requirements <https://spec.oneapi.com/versions/latest/elements/oneTBB/source/named_r…
/oneTBB/doc/main/tbb_userguide/Migration_Guide/
H A DTask_Scheduler_Init.rst17 <https://spec.oneapi.com/versions/latest/elements/oneTBB/source/info_namespace.html>`_
21 …<https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/task_arena/this_tas…
26 …<https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/scheduling_controls…
33 …<https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/task_arena/this_tas…
37 …<https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/scheduling_controls…
119 <https://spec.oneapi.com/versions/latest/elements/oneTBB/source/task_scheduler/scheduling_controls/…
144 `task_scheduler_handle <https://oneapi-src.github.io/oneAPI-spec/spec/elements/oneTBB/source/task_s…
/oneTBB/include/oneapi/tbb/detail/
H A D_pipeline_filters.h176 static pointer create_token(value_type && source) {
177 return new (r1::allocate_memory(sizeof(T))) T(std::move(source));
193 static pointer create_token(const value_type & source) { return source; }
209 static pointer create_token(const value_type & source) { return source; }
/oneTBB/src/tbb/
H A Dtask_stream.h181 void push(d1::task* source, const lane_selector_t& next_lane ) { in push() argument
187 } while( ! (succeed = try_push( source, lane )) ); in push()
234 bool try_push(d1::task* source, unsigned lane_idx ) { in try_push() argument
237 lanes[lane_idx].my_queue.push_back( source ); in try_push()
/oneTBB/test/tbb/
H A Dtest_concurrent_lru_cache.cpp60 preset_object.source.instances_count() > 1,
73 preset_object.source.instances_count() == preset_object.number_of_lru_history_items + 1,
H A Dtest_concurrent_queue.cpp137 Queue source; in CopyWithThrowElement() local
141 source.emplace(); in CopyWithThrowElement()
149 Queue copy(source); in CopyWithThrowElement()
/oneTBB/examples/graph/fgbzip2/
H A Dbzlib.hpp198 char* source,
206 char* source,
/oneTBB/test/conformance/
H A Dconformance_graph.cpp31 continue_node<int> source(g, 2, [&](const continue_msg&){ flag = true; return 1;}); in test_continue_node_rf_reset_protocol() local
33 source.try_put(continue_msg()); in test_continue_node_rf_reset_protocol()
40 source.try_put(continue_msg()); in test_continue_node_rf_reset_protocol()
44 source.try_put(continue_msg()); in test_continue_node_rf_reset_protocol()
H A Dconformance_concurrent_vector.cpp634 std::vector<dummy> source(sequence_size, 0); in TestSerialMoveInShrinkToFit() local
635 std::generate_n(source.begin(), source.size(), std::rand); in TestSerialMoveInShrinkToFit()
640 c_vector.assign(source.begin(), source.end()); in TestSerialMoveInShrinkToFit()
646 REQUIRE((c_vector == c_vector_t(source.begin(),source.end()))); in TestSerialMoveInShrinkToFit()
694 …dst.grow_by(std::make_move_iterator(fixture.source.begin()), std::make_move_iterator(fixture.sourc… in TestSerialGrowByWithMoveIterators()
919 typename MyVector::value_type source; in operator ()() local
920 source.bar() = current_adding_index_in_cvector; in operator ()()
927 r = my_vector.grow_by(1, source); in operator ()()
930 r = my_vector.push_back(source); in operator ()()
933 r = my_vector.push_back(std::move(source)); in operator ()()
[all …]
H A Dconformance_concurrent_priority_queue.cpp35 std::vector<int> source(range.begin(), range.end()); in test_to_vector() local
37 oneapi::tbb::concurrent_priority_queue<int> q(source.begin(), source.end()); in test_to_vector()
40 std::sort(source.begin(), source.end()); in test_to_vector()
41 …REQUIRE_MESSAGE(source == from_cpq, "equality_comparison_helpers::toVector incorrectly copied item… in test_to_vector()
H A Dconformance_concurrent_lru_cache.cpp127 preset_object.source.instances_count() == preset_object.number_of_lru_history_items+1,
/oneTBB/examples/concurrent_priority_queue/
H A DREADME.md6 | shortpath | Solves the single source shortest path problem using a `concurrent_priority_queue` c…
/oneTBB/
H A Dthird-party-programs.txt7 third party license terms, other Intel software license terms, and open source
18 Redistribution and use in source and binary forms, with or without modification,
21 1. Redistributions of source code must retain the above copyright
68 Redistribution and use in source and binary forms, with or without
72 1. Redistributions of source code must retain the above copyright
100 Redistribution and use in source and binary forms, with or without
104 * Redistributions of source code must retain the above copyright
179 …The "source code" for a work means the preferred form of the work for making modifications to it. …
189 The Corresponding Source for a work in source code form is that same work.
209 …ram, or the modifications to produce it from the Program, in the form of source code under the ter…
[all …]
/oneTBB/examples/parallel_for/polygon_overlay/
H A DREADME.md11 …nerated sub-polygons are subtracted from the original area of one of the source polygons. When the…
25 The source maps are generated pseudo-randomly in the manner described in the paper above. That is, …
27 One limitation of the program is that if the number of polygons in the source map is greater than t…

123