| /oneTBB/examples/graph/som/ |
| H A D | som_graph.cpp | 141 function_node_execs.reserve(xranges * yranges + 1); in build_BMU_graph() 152 s_array[scnt]->reserve(xranges); in build_BMU_graph() 154 g_array[scnt]->reserve(xranges); in build_BMU_graph() 166 (*s_array[scnt])[xindex].reserve(yranges); in build_BMU_graph() 168 (*g_array[scnt])[xindex].reserve(yranges); in build_BMU_graph() 374 cancel_count.reserve(xRangeMax * yRangeMax + 1); in graph_teach() 375 extra_count.reserve(xRangeMax * yRangeMax + 1); in graph_teach() 376 missing_count.reserve(xRangeMax * yRangeMax + 1); in graph_teach() 536 single_dist.reserve(my_teaching.size()); in main() 538 single_xval.reserve(my_teaching.size()); in main() [all …]
|
| H A D | som.hpp | 135 my_map.reserve(xSize); in SOMap() 138 my_map[i].reserve(ySize); in SOMap()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_invoke.h | 88 root_wait_ctx.reserve(); in invoke_subroot_task() 138 root_wait_ctx.reserve(1); in invoke_recursive_separation() 147 root_wait_ctx.reserve(2); in invoke_recursive_separation() 158 root_wait_ctx.reserve(3); in invoke_recursive_separation()
|
| H A D | parallel_for_each.h | 175 my_wait_context.reserve(); in internal_add_copy_impl() 192 my_wait_context.reserve(); in internal_add_move() 285 my_wait_context.reserve(); 288 my_wait_context.reserve(); 350 my_wait_context.reserve(); 353 my_wait_context.reserve(); 482 my_wait_context.reserve(); 516 this->my_wait_context.reserve(); 559 this->my_wait_context.reserve();
|
| H A D | task_group.h | 501 m_wait_ctx.reserve(); in internal_run_and_wait() 532 m_wait_ctx.reserve(); in prepare_task() 543 m_wait_ctx.reserve(); in prepare_task_handle()
|
| H A D | concurrent_priority_queue.h | 69 data.reserve(init_capacity); 76 data.reserve(init_capacity);
|
| H A D | concurrent_hash_map.h | 305 void reserve(size_type buckets) { in reserve() function 850 this->reserve(n); in __TBB_requires() 856 this->reserve(n); in __TBB_requires() 963 this->reserve(sz); // TODO: add reduction of number of buckets as well in __TBB_requires() 1489 this->reserve(source.my_size.load(std::memory_order_relaxed)); // TODO: load_factor? in __TBB_requires() 1512 this->reserve(reserve_size); // TODO: load_factor? in __TBB_requires()
|
| H A D | concurrent_vector.h | 499 void reserve( size_type n ) { in reserve() function 507 base_type::reserve(n); in reserve() 909 reserve(n); in internal_resize()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Flow_Graph_Reservation.rst | 15 message be created. If any input port fails to reserve a message, no 28 edge to push state, and tries to reserve the next node connected by 209 - ``jn`` tries to reserve ``bn``, which fails. The arc to ``bn`` 211 - ``jn`` tries to reserve ``buf1``, which succeeds (reserved nodes are 215 - ``jn`` tries to reserve ``buf2``, which succeeds. ``jn`` receives the 233 ``jn`` attempts to reserve again. 238 - ``jn`` tries to reserve ``buf1``, which fails. The arc to ``buf1``
|
| H A D | create_token_based_system.rst | 39 first reserve an input on each port from an upstream source. If it 40 can reserve an input at each port, it gets those inputs and joins
|
| /oneTBB/test/tbb/ |
| H A D | test_task.cpp | 113 wait.reserve(1); in test_cancellation_on_exception() 149 wait.reserve(1); 188 wait.reserve(threads_num); 245 wait.reserve(task_threads_num); 288 wait.reserve(threads_num); 540 wait.reserve(task_number / 2); 556 wait.reserve(1); 562 wait.reserve(task_number / 2); in __anon509d20bd1302() 621 wait.reserve(task_number); in __anon509d20bd1902() 716 wait.reserve(task_number); in __anon509d20bd1f02()
|
| H A D | test_concurrent_vector.cpp | 160 Primes.reserve(count);// TODO: or compact()? in TimeFindPrimes() 238 c1.reserve(100); in test_scoped_allocator() 289 c2.reserve( 5 ); in Examine() 391 v.reserve( 1 ); in TestSerialGrowByRange()
|
| H A D | test_partitioner.cpp | 60 v.reserve(repeats); in test()
|
| H A D | test_split_node.cpp | 344 flags.reserve(Count); in test()
|
| /oneTBB/examples/graph/dining_philosophers/ |
| H A D | dining_philosophers.cpp | 271 philosophers.reserve(num_philosophers); in main() 273 think_nodes.reserve(num_philosophers); in main() 277 eat_nodes.reserve(num_philosophers); in main() 279 forward_nodes.reserve(num_philosophers); in main()
|
| /oneTBB/examples/parallel_for/polygon_overlay/ |
| H A D | polyover.cpp | 92 (*resultMap)->reserve(mapxSize * mapySize); // can't be any bigger than this in SerialOverlayMaps() 152 result_map->reserve(mapxSize * mapySize); // can't be any bigger than this in NaiveParallelOverlay() 204 left_out.reserve(in_map.size()); in split_at() 205 right_out.reserve(in_map.size()); in split_at() 242 my_map1.reserve(p1->size()); in blocked_range_with_maps() 243 my_map2.reserve(p2->size()); in blocked_range_with_maps() 418 (*result_map)->reserve(mapxSize * mapySize); // can't be any bigger than this in SplitParallelOverlay()
|
| H A D | polymain.cpp | 397 (*newMap)->reserve(gNPolygons + 1); // how much bigger does this need to be on average? in GenerateMap() 657 t1->reserve(map1->size()); in ComparePolygonMaps() 662 t2->reserve(map2->size()); in ComparePolygonMaps()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_vector.cpp | 340 vector_t v; v.reserve(old_size); in TestCapacity() 342 v.reserve( new_size ); in TestCapacity() 423 case reserve: { in TestExceptions() 430 victim.reserve(N); in TestExceptions() 434 victim.reserve(2); in TestExceptions() 457 case reserve: in TestExceptions() 560 victim.reserve(2); // get fragmented assignment in test_ex_assign_operator() 638 c_vector.reserve(1); //make it fragmented in TestSerialMoveInShrinkToFit() 840 part.reserve(std::distance(begin,end)); in separate() 1073 victim.reserve(2); // for fragmented assignment in test_ex_move_assignment_memory_failure() [all …]
|
| H A D | conformance_concurrent_lru_cache.cpp | 64 animals.reserve(5);
|
| /oneTBB/test/common/ |
| H A D | concurrent_unordered_common.h | 184 c.reserve(size_type(count)); in CustomExamine() 384 container.reserve(elements); in test_reserve_regression() 389 container.reserve(capacity * 2); in test_reserve_regression()
|
| H A D | concurrent_priority_queue_common.h | 34 v.reserve(cpq.size()); in toVector()
|
| /oneTBB/src/tbb/ |
| H A D | parallel_pipeline.cpp | 300 my_pipeline.wait_ctx.reserve(); in stage_task() 310 my_pipeline.wait_ctx.reserve(); in stage_task()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _task.h | 141 void reserve(std::uint32_t delta = 1) {
|
| H A D | _flow_graph_join_impl.h | 83 static inline bool reserve( InputTuple &my_input, OutputTuple &out) { in reserve() function 84 if ( !std::get<N-1>( my_input ).reserve( std::get<N-1>( out ) ) ) return false; in reserve() 85 if ( !join_helper<N-1>::reserve( my_input, out ) ) { in reserve() 162 static inline bool reserve( InputTuple &my_input, OutputTuple &out) { 163 return std::get<0>( my_input ).reserve( std::get<0>( out ) ); 330 bool reserve( T &v ) { 726 return join_helper<N>::reserve(my_inputs, out);
|
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull_sample.cpp | 273 points.reserve(cfg::numberOfPoints); in main()
|