| /oneTBB/test/tbb/ |
| H A D | test_environment_whitebox.cpp | 128 cases.push_back(std::make_pair("1", true)); in initialize_cases() 129 cases.push_back(std::make_pair(" 1 ", true)); in initialize_cases() 132 cases.push_back(std::make_pair(" 1", true)); in initialize_cases() 136 cases.push_back(std::make_pair("", wrong_result)); in initialize_cases() 137 cases.push_back(std::make_pair(" ", wrong_result)); in initialize_cases() 142 cases.push_back(std::make_pair("1;", wrong_result)); in initialize_cases() 144 cases.push_back(std::make_pair("0", wrong_result)); in initialize_cases() 145 cases.push_back(std::make_pair("0 ", wrong_result)); in initialize_cases() 147 cases.push_back(std::make_pair("01", wrong_result)); in initialize_cases() 188 cases.push_back(std::make_pair("", wrong_result)); in initialize_cases() [all …]
|
| H A D | test_enumerable_thread_specific.cpp | 117 threads.push_back( new std::thread ( set_body( a ) ) ); in do_std_threads() 193 my_vec.push_back(my_inner_container); in flog_segmented_interator() 195 my_vec.at(i).push_back((T)(maxval * i + j)); in flog_segmented_interator() 217 my_vec.push_back(my_inner_container); in flog_segmented_interator() 226 my_vec.push_back(my_inner_container); in flog_segmented_interator() 229 my_vec.at(i).push_back((T)(maxval * (i/2) + j)); in flog_segmented_interator() 255 my_vec.push_back(my_inner_container); in flog_segmented_interator() 264 my_vec.push_back(my_inner_container); in flog_segmented_interator() 267 my_vec.at(i).push_back((T)(maxval * (i/2) + j)); in flog_segmented_interator() 294 my_vec.push_back(my_inner_container); in flog_segmented_iterator_map()
|
| H A D | test_concurrent_vector.cpp | 61 a_c_vector.push_back(i); in TestRangeBasedFor() 125 v.push_back(foo); in TestVectorTypes() 152 Primes.push_back( idx ); in operator ()() 231 c1.push_back(data1); in test_scoped_allocator() 232 c1.push_back(data2); in test_scoped_allocator() 233 c1.push_back(std::move(data1)); in test_scoped_allocator() 360 for ( int i=0; i<NUMBER; ++i ) intArr.push_back(i); in TestTypes() 373 for ( int i=0; i<NUMBER; ++i ) shrPtrArr.push_back( std::make_shared<int>(i) ); in TestTypes() 416 operations.push_back(random_operation + 1); in TestConcurrentOperationsWithUnSafeOperations() 470 vector.push_back(1); in TestConcurrentOperationsWithUnSafeOperations() [all …]
|
| H A D | test_flow_graph_priorities.cpp | 140 nodes.push_back(std::unique_ptr<NodeType>( node_creator(g, i, barrier) )); in test_node() 270 g_async_task_ids.push_back( ++g_task_num ); in operator ()() 500 nodes.push_back( in create_nodes() 523 nodes.push_back( in test() 629 outer_nodes.push_back( in test() 655 g_task_info.push_back( TaskInfo( priority, current_task_index ) ); in common_body() 766 nodes.push_back( in test() 772 nodes.push_back( in test() 819 throwing_msgs.push_back(std::rand() % num_messages); in test()
|
| H A D | test_function_node.cpp | 87 receivers.push_back( std::make_shared<harness_mapped_receiver<OutputType>>(g) ); in buffered_levels() 101 senders.push_back( std::make_shared<harness_counting_sender<InputType>>() ); in buffered_levels() 176 receivers.push_back( std::make_shared<harness_mapped_receiver<OutputType>>(g) ); in buffered_levels_with_copy() 187 senders.push_back( std::make_shared<harness_counting_sender<InputType>>() ); in buffered_levels_with_copy() 270 receivers.push_back( std::make_shared<harness_counting_receiver<OutputType>>(g) ); in concurrency_levels() 295 senders.push_back( std::make_shared<harness_counting_sender<InputType>>() ); in concurrency_levels() 380 receivers.push_back( std::make_shared<harness_counting_receiver<OutputType>>(g) ); in unlimited_concurrency()
|
| H A D | test_tagged_msg.cpp | 80 di.push_back(2.0); in TestWrapper() 88 oia[0].push_back(3); in TestWrapper() 89 oia[1].push_back(2); in TestWrapper()
|
| H A D | test_multifunction_node.cpp | 79 receivers.push_back( std::make_shared<harness_mapped_receiver<OutputType>>(g) ); in buffered_levels() 93 senders.push_back( std::make_shared<harness_counting_sender<InputType>>() ); in buffered_levels() 167 receivers.push_back( std::make_shared<harness_mapped_receiver<OutputType>>(g) ); in buffered_levels_with_copy() 178 senders.push_back( std::make_shared<harness_counting_sender<InputType>>() ); in buffered_levels_with_copy() 257 receivers.push_back( std::make_shared<harness_counting_receiver<OutputType>>(g) ); in concurrency_levels() 282 senders.push_back( std::make_shared<harness_counting_sender<InputType>>() ); in concurrency_levels() 367 receivers.push_back( std::make_shared<harness_counting_receiver<OutputType>>(g) ); in unlimited_concurrency()
|
| H A D | test_overwrite_node.cpp | 45 r.push_back( std::make_shared<harness_counting_receiver<R>>(g) ); in simple_read_write_tests() 115 r.push_back( std::make_shared<harness_counting_receiver<R>>(g) ); in parallel_read_write_tests()
|
| H A D | test_write_once_node.cpp | 46 r.push_back( std::make_shared<harness_counting_receiver<R>>(g) ); in simple_read_write_tests() 137 r.push_back( std::make_shared<harness_counting_receiver<R>>(g) ); in parallel_read_write_tests()
|
| H A D | test_broadcast_node.cpp | 90 receivers.push_back( std::make_shared<counting_array_receiver<T>>(g) ); in test_serial_broadcasts() 135 receivers.push_back( std::make_shared< counting_array_receiver<T> >(g) ); in run_parallel_broadcasts()
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | polyover.cpp | 94 (*resultMap)->push_back(RPolygon(0, 0, mapxSize, mapySize)); in SerialOverlayMaps() 166 result_map->push_back(RPolygon(0, 0, mapxSize, mapySize)); in NaiveParallelOverlay() 210 left_out.push_back(*i); in split_at() 213 right_out.push_back(*i); in split_at() 218 left_out.push_back(*i); in split_at() 219 right_out.push_back(RPolygon_flagged(p, true)); in split_at() 245 my_map1.push_back(RPolygon_flagged(&((*p1)[i]), false)); in blocked_range_with_maps() 248 my_map2.push_back(RPolygon_flagged(&(p2->at(i)), false)); in blocked_range_with_maps() 436 (*result_map)->push_back(RPolygon(0, 0, mapxSize, mapySize)); in SplitParallelOverlay() 587 s_result_map.push_back(*i); in SplitParallelOverlayCV() [all …]
|
| H A D | polymain.cpp | 398 (*newMap)->push_back(RPolygon(0, 0, xSize - 1, ySize - 1)); in GenerateMap() 409 (*newMap)->push_back(RPolygon(nX, nY, nX, nY, nR, nG, nB)); in GenerateMap() 506 (*newMap)->push_back(RPolygon(i, j, ilen, jlen, nR, nG, nB)); in GenerateMap() 659 t1->push_back(map1->at(i)); in ComparePolygonMaps() 664 t2->push_back(map2->at(i)); in ComparePolygonMaps()
|
| /oneTBB/examples/graph/som/ |
| H A D | som_graph.cpp | 143 function_node_execs.push_back(0); in build_BMU_graph() 167 g_array[scnt]->push_back(graph_vector_type()); in build_BMU_graph() 178 (*g_array[scnt])[xindex].push_back(g_local); in build_BMU_graph() 179 (*s_array[scnt])[xindex].push_back(s); in build_BMU_graph() 379 cancel_count.push_back(0); in graph_teach() 380 extra_count.push_back(0); in graph_teach() 381 missing_count.push_back(0); in graph_teach() 382 canceled_before.push_back(0); in graph_teach() 640 single_dist.push_back(my_dist); in main() 641 single_xval.push_back(xdist); in main() [all …]
|
| H A D | som.cpp | 213 my_teaching.push_back(SOM_element()); in readInputData() 214 my_teaching.push_back(SOM_element()); in readInputData() 215 my_teaching.push_back(SOM_element()); in readInputData() 216 my_teaching.push_back(SOM_element()); in readInputData() 217 my_teaching.push_back(SOM_element()); in readInputData()
|
| H A D | som.hpp | 137 my_map.push_back(teaching_vector_type()); in SOMap() 140 my_map[i].push_back(SOM_element()); in SOMap()
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | shortpath.cpp | 171 path.push_back(src); in make_path() 173 path.push_back(src); in make_path() 174 path.push_back(dst); in make_path() 178 path.push_back(dst); in make_path() 243 edges[i].push_back(j); in InitializeGraph() 252 edges[k].push_back(i); in InitializeGraph()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | concurrent_vector_ug.rst | 11 common uses of dynamic arrays: ``push_back``, ``grow_by``, and 15 Method ``push_back(x)`` safely appends x to the array. Method 40 by methods ``push_back``, ``grow_by,`` or ``grow_to_at_least``. The
|
| /oneTBB/src/tbbbind/ |
| H A D | tbb_bind.cpp | 131 numa_indexes_list.push_back(-1); in numa_topology_parsing() 143 numa_indexes_list.push_back(numa_nodes_count == 0 ? -1 : 0); in numa_topology_parsing() 146 numa_affinity_masks_list.push_back(hwloc_bitmap_dup(process_cpu_affinity_mask)); in numa_topology_parsing() 185 core_types_indexes_list.push_back(-1); in core_types_topology_parsing() 207 core_types_indexes_list.push_back(core_type); in core_types_topology_parsing()
|
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull_bench.cpp | 93 reducedSet.push_back(p); in operator ()() 117 util::OUTPUT.push_back(ss.str()); in divide() 129 H.push_back(p1); in divide_and_conquer() 408 reducedSet.push_back(initialSet[i]); in operator ()() 412 reducedSet.push_back(initialSet[i]); in operator ()() 520 util::OUTPUT.push_back(ss.str()); in divide() 540 H.push_back(p1); in divide_and_conquer() 659 points.push_back(util::GenerateRNDPoint<double>(count, &std::rand, RAND_MAX)); in serial_initialize()
|
| /oneTBB/examples/parallel_for_each/parallel_preorder/ |
| H A D | Graph.cpp | 72 c.input[j]->successor.push_back(&c); in get_root_set() 75 root_set.push_back(&my_vertex_set[k]); in get_root_set()
|
| /oneTBB/examples/graph/dining_philosophers/ |
| H A D | dining_philosophers.cpp | 282 philosophers.push_back( in main() 288 think_nodes.push_back(new think_node_type( in main() 290 eat_nodes.push_back( in main() 292 forward_nodes.push_back(new forward_node_type( in main()
|
| /oneTBB/test/common/ |
| H A D | common_arena_constraints.h | 204 numa_node_infos.push_back(current_node_info); in system_info() 212 numa_node_infos.push_back(current_node_info); in system_info() 382 result.push_back(value); in get_available_max_threads_values() 514 numa_nodes.push_back((tbb::numa_node_id)tbb::task_arena::automatic); in generate_constraints_variety() 518 core_types.push_back((tbb::core_type_id)tbb::task_arena::automatic); in generate_constraints_variety()
|
| H A D | utils_concurrency_limit.h | 60 threads_range.push_back(thread_num); in concurrency_range() 62 threads_range.push_back(max_threads); in concurrency_range() 196 free_indexes.push_back(i); in get_thread_affinity_mask()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_cache_impl.h | 247 my_successors.push_back( &r ); in register_successor() 300 my_successors.push_back( &r ); in register_successor() 379 tasks.push_back(*new_task); in gather_successful_try_puts()
|
| /oneTBB/examples/migration/recursive_fibonacci/ |
| H A D | fibonacci.cpp | 40 times.push_back(time); in measure()
|