| /third_party/boost/boost/property_map/parallel/ |
| D | global_index_map.hpp | 33 starting_index.reset(new std::vector<value_type>(num_processes(pg) + 1)); in global_index_map()
40 for (process_id_type src = 0; src < num_processes(pg); ++src) { in global_index_map()
45 for (process_id_type dest = 1; dest < num_processes(pg); ++dest) in global_index_map()
46 send(pg, dest, 1, &starting_index->front(), num_processes(pg)); in global_index_map()
50 receive(pg, 0, 1, &starting_index->front(), num_processes(pg)); in global_index_map()
|
| D | process_group.hpp | 66 int num_processes(const process_group_archetype&);
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 56 if (num_processes(pg) > 20) return -1; in test_main()
80 other.owner = (other.owner + 1) % num_processes(pg); in test_main()
100 int prior_processor = (process_id(pg) + num_processes(pg) - 1) in test_main()
101 % num_processes(pg); in test_main()
103 std::size_t vertices_in_prior = (n / num_processes(pg)) in test_main()
104 + (n % num_processes(pg) > prior_processor? 1 : 0); in test_main()
140 if (process_id(pg) == num_processes(pg) - 1) in test_main()
233 other.owner = (other.owner + 1) % num_processes(pg); in test_main()
250 int prior_processor = (process_id(pg) + num_processes(pg) - 1) in test_main()
251 % num_processes(pg); in test_main()
[all …]
|
| D | distributed_property_map_test.cpp | 100 int next_processor = (process_id(pg) + 1) % num_processes(pg); in colored_test()
185 int next_processor = (process_id(pg) + 1) % num_processes(pg); in bool_test()
186 bool next_start_value = ((process_id(pg) + 1) % num_processes(pg)) % 2; in bool_test()
270 int next_processor = (process_id(pg) + 1) % num_processes(pg); in string_test()
302 BOOST_CHECK(get(strings, k) == (num_processes(pg) == 1 ? my_start_string : std::string())); in string_test()
|
| D | adjlist_remove_test.cpp | 42 assert(num_processes(g.process_group()) == 2); in test_bidirectional_graph()
96 assert(num_processes(g.process_group()) == 2); in test_undirected_graph()
|
| D | distributed_queue_test.cpp | 83 n = num_processes(process_group); in test_distributed_queue()
|
| D | distributed_rmat_pagerank.cpp | 95 num_processes(pg), n, m, a, b, c, d, end - start); in test_filtered_rmat_pagerank()
|
| D | distributed_rmat_cc.cpp | 100 num_processes(pg), n, m, a, b, c, d, end - start); in test_filtered_rmat_cc()
|
| D | distributed_rmat_cc_ps.cpp | 99 num_processes(pg), n, m, a, b, c, d, end - start); in test_filtered_rmat_cc()
|
| D | named_vertices_hash_test.cpp | 54 : n(num_processes(pg)) { } in named_vertices_hashed_distribution()
|
| D | distributed_strong_components_test.cpp | 109 << num_processes(pg) << " Processors\n" in test_distributed_strong_components()
|
| D | adjlist_redist_test.cpp | 153 put(to_processor_map, *vi, gen() % num_processes(pg)); in test_redistribution()
|
| /third_party/boost/boost/graph/distributed/adjlist/ |
| D | initialize.hpp | 98 descriptor_requests.resize(num_processes(pg)); in initialize()
147 for (process_id_type dest = 0; dest < num_processes(pg); ++dest) { in initialize()
158 in_descriptor_requests.resize(num_processes(pg)); in initialize()
164 descriptor_responses.resize(num_processes(pg)); in initialize()
165 for (process_id_type dest = 0; dest < num_processes(pg); ++dest) { in initialize()
223 descriptor_requests.resize(num_processes(pg)); in initialize()
269 for (process_id_type dest = 0; dest < num_processes(pg); ++dest) { in initialize()
280 in_descriptor_requests.resize(num_processes(pg)); in initialize()
286 descriptor_responses.resize(num_processes(pg)); in initialize()
287 for (process_id_type dest = 0; dest < num_processes(pg); ++dest) { in initialize()
|
| D | serialization.hpp | 159 , m_requested_vertices(num_processes(m_pg)) in graph_loader()
160 , m_remote_vertices(num_processes(m_pg)) in graph_loader()
161 , m_property_ptrs(num_processes(m_pg)) in graph_loader()
284 if (num_processes_ != num_processes(m_pg)) in load_prefix()
297 m_id_mapping.resize(num_processes(m_pg), -1); in load_prefix()
299 for (process_id_type i = 0; i < num_processes(m_pg); ++i) in load_prefix()
312 for (int i = 0; i < num_processes(m_pg); ++i) in load_prefix()
564 for (int i = 0; i < num_processes(m_pg); ++i) in resolve_property_ptrs()
576 for (int i = 0; i < num_processes(m_pg); ++i) in resolve_remote_vertices()
584 for (int i = 0; i < num_processes(m_pg); ++i) in resolve_remote_vertices()
[all …]
|
| /third_party/boost/boost/graph/distributed/detail/ |
| D | remote_update_set.hpp | 95 : self(self), update_sizes(num_processes(pg), 0) { } in handle_messages()
140 updates(num_processes(pg)), owner(owner) { in remote_update_set()
160 process_id_type num_processes = updates.size(); in synchronize() local
161 for (process_id_type p = 0; p < num_processes; ++p) { in synchronize()
205 { update_sizes.resize(num_processes(pg), 0); } in handle_messages()
|
| D | queue.ipp | 34 new outgoing_buffers_t(num_processes(process_group)));
52 new outgoing_buffers_t(num_processes(process_group)));
68 new outgoing_buffers_t(num_processes(process_group)));
154 process_id_type np = num_processes(process_group);
|
| /third_party/boost/boost/graph/parallel/ |
| D | distribution.hpp | 133 : id(process_id(pg)), p(num_processes(pg)), n(n) { } in block()
197 : id(process_id(pg)), p(num_processes(pg)), local_sizes(local_sizes) in uneven_block()
267 : id(process_id(pg)), p(num_processes(pg)), size(size) { } in oned_block_cyclic()
322 : id(process_id(pg)), p(num_processes(pg)), in twod_block_cyclic()
456 : id(process_id(pg)), p(num_processes(pg)), in twod_random()
|
| /third_party/boost/boost/graph/distributed/ |
| D | dehne_gotz_min_spanning_tree.hpp | 452 process_id_type num_procs = num_processes(pg); in merge_local_minimum_spanning_trees_step()
664 while (pg && num_processes(pg) > 1) { in merge_local_minimum_spanning_trees()
740 double log_d_p = log((double)num_processes(process_group(g))) in boruvka_then_merge()
763 while (pg && num_processes(pg) > 1) { in boruvka_then_merge()
854 if (num_processes(process_group(g)) == 1) { in boruvka_mixed_merge()
866 while (pg && num_processes(pg) > 1) { in boruvka_mixed_merge()
|
| D | connected_components.hpp | 256 for (process_id_type i = 0; i < num_processes(pg); ++i) { in request_parent_map_entries()
279 for (process_id_type i = 0; i < num_processes(pg); ++i) { in request_parent_map_entries()
361 if (num_processes(pg) == 1) return; in parallel_connected_components()
507 std::vector<VertexSet> parent_requests(num_processes(pg)); in parallel_connected_components()
703 for (process_size_type dest = 1, n = num_processes(pg); in number_components_from_parents()
|
| D | shuffled_distribution.hpp | 26 , n(num_processes(pg)) in shuffled_distribution()
|
| D | depth_first_search.hpp | 159 if (left < num_processes(pg)) in run()
161 if (right < num_processes(pg)) in run()
|
| /third_party/boost/boost/graph/parallel/detail/ |
| D | inplace_all_to_all.hpp | 37 process_size_type p = num_processes(pg); in inplace_all_to_all()
|
| /third_party/python/Lib/lib2to3/ |
| D | refactor.py | 688 num_processes=1): argument
689 if num_processes == 1:
701 for i in range(num_processes)]
709 for i in range(num_processes):
|
| /third_party/boost/boost/property_map/parallel/impl/ |
| D | distributed_property_map.ipp | 357 keys.resize(num_processes(process_group));
365 process_size_type n = num_processes(process_group);
378 int n = num_processes(process_group);
|
| /third_party/boost/tools/build/src/tools/ |
| D | mpi.jam | 608 local num_processes = [ property.select <mpi:processes> : $(properties) ] ;
609 num_processes = $(num_processes:G=) ;
616 [ on $(target) return $(.mpirun) $(.mpirun_flags) $(num_processes) ] ;
|