| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_property_map_test.cpp | 96 mpi_process_group pg; in colored_test() local
99 color_t my_start_color = process_id(pg) % 2 == 0? ::red : ::blue; in colored_test()
100 int next_processor = (process_id(pg) + 1) % num_processes(pg); in colored_test()
111 synchronize(pg); in colored_test()
117 ColorMap colors(pg, remote_key_to_global(), local_colors); in colored_test()
120 if (process_id(pg) == 0) std::cerr << "Checking local colors..."; in colored_test()
123 remote_key k(process_id(pg), i); in colored_test()
128 if (process_id(pg) == 0) std::cerr << "OK.\nChecking next processor's default colors..."; in colored_test()
135 if (process_id(pg) == 0) std::cerr << "OK.\nSynchronizing..."; in colored_test()
136 synchronize(pg); in colored_test()
[all …]
|
| D | distributed_adjacency_list_test.cpp | 46 mpi_process_group pg; in test_main() local
47 parallel::block dist(pg, 20); in test_main()
56 if (num_processes(pg) > 20) return -1; in test_main()
58 if (process_id(pg) == 0) std::cout << "Graph 1------------------\n"; in test_main()
60 std::cout << "Processor #" << process_id(pg) << ": " in test_main()
71 std::cout << "Processor #" << process_id(pg) << ": vertex " << ++counter in test_main()
80 other.owner = (other.owner + 1) % num_processes(pg); in test_main()
84 std::cout << "Adding edge from processor " << process_id(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()
[all …]
|
| D | algorithm_performance.cpp | 182 process_group_type pg = process_group(g); in test_directed_csr_only_algorithms() local
183 typename process_group_type::process_id_type id = process_id(pg); in test_directed_csr_only_algorithms()
184 typename process_group_type::process_size_type p = num_processes(pg); in test_directed_csr_only_algorithms()
187 n = boost::parallel::all_reduce(pg, n, std::plus<vertices_size_type>()); in test_directed_csr_only_algorithms()
190 m = boost::parallel::all_reduce(pg, m, std::plus<edges_size_type>()); in test_directed_csr_only_algorithms()
210 n0 = boost::parallel::all_reduce(pg, n0, std::plus<vertices_size_type>()); in test_directed_csr_only_algorithms()
233 all_gather(pg, local_sources.begin(), local_sources.end(), all_sources); in test_directed_csr_only_algorithms()
294 process_group_type pg = process_group(g); in test_undirected_algorithms() local
295 typename process_group_type::process_id_type id = process_id(pg); in test_undirected_algorithms()
296 typename process_group_type::process_size_type p = num_processes(pg); in test_undirected_algorithms()
[all …]
|
| D | process_group_serialization.cpp | 36 mpi_process_group pg; in test_main() local
41 if (process_id(pg) == 0) { in test_main()
42 send(pg, 1, 0, seventeen); in test_main()
43 send(pg, 1, 1, seventeens); in test_main()
45 synchronize(pg); in test_main()
47 if (process_id(pg) == 1) { in test_main()
49 receive(pg, 0, 0, value); in test_main()
53 receive(pg, 0, 1, values); in test_main()
|
| D | ssca.cpp | 183 process_group_type pg = g.process_group(); in generate_sources() local
185 typename process_group_type::process_id_type id = process_id(pg); in generate_sources()
186 typename process_group_type::process_size_type p = num_processes(pg); in generate_sources()
207 all_gather(pg, local_sources.begin(), local_sources.end(), all_sources); in generate_sources()
222 process_group_type pg = g.process_group(); in classify_sets() local
239 if (get(owner, source(e, g)) == process_id(pg)) { in classify_sets()
254 int global_max = all_reduce(pg, max_, boost::parallel::maximum<int>()); in classify_sets()
260 all_gather(pg, S.begin(), S.end(), global_S); in classify_sets()
266 synchronize(pg); in classify_sets()
270 if (process_id(pg) == 0) { in classify_sets()
[all …]
|
| D | adjlist_build_test.cpp | 48 mpi_process_group pg; in test_main() local
49 int rank = process_id(pg); in test_main()
50 int numprocs = num_processes(pg); in test_main()
54 broadcast(pg, seed, 0); in test_main()
71 n, pg, Graph::graph_property_type()); in test_main()
83 Graph g2(n, pg); in test_main()
118 communicator(pg).abort(-1); in test_main()
125 communicator(pg).abort(-1); in test_main()
137 communicator(pg).abort(-1); in test_main()
144 communicator(pg).abort(-1); in test_main()
[all …]
|
| /third_party/boost/boost/property_map/parallel/ |
| D | global_index_map.hpp | 28 global_index_map(ProcessGroup pg, value_type num_local_indices, in global_index_map() argument
33 starting_index.reset(new std::vector<value_type>(num_processes(pg) + 1)); in global_index_map()
34 send(pg, 0, 0, num_local_indices); in global_index_map()
35 synchronize(pg); in global_index_map()
38 if (process_id(pg) == 0) { in global_index_map()
40 for (process_id_type src = 0; src < num_processes(pg); ++src) { in global_index_map()
42 receive(pg, src, 0, n); 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()
47 synchronize(pg); in global_index_map()
[all …]
|
| D | simple_trigger.hpp | 61 simple_trigger(ProcessGroup& pg, int tag, Class* self, in simple_trigger() argument
65 pg.template trigger<T>(tag, in simple_trigger()
78 simple_trigger(ProcessGroup& pg, int tag, Class* self, in simple_trigger() argument
82 pg.template trigger_with_reply<T> in simple_trigger()
93 simple_trigger(ProcessGroup& pg, int tag, Class* self, in simple_trigger() argument
99 simple_trigger(pg, tag, self, pmf, 0); in simple_trigger()
|
| /third_party/boost/boost/graph/parallel/detail/ |
| D | inplace_all_to_all.hpp | 28 inplace_all_to_all(ProcessGroup pg, in inplace_all_to_all() argument
37 process_size_type p = num_processes(pg); in inplace_all_to_all()
40 synchronize(pg); in inplace_all_to_all()
44 if (dest != process_id(pg)) { in inplace_all_to_all()
45 send(pg, dest, 0, outgoing[dest].size()); in inplace_all_to_all()
47 send(pg, dest, 1, &outgoing[dest].front(), outgoing[dest].size()); in inplace_all_to_all()
52 synchronize(pg); in inplace_all_to_all()
56 if (source != process_id(pg)) { in inplace_all_to_all()
58 receive(pg, source, 0, size); in inplace_all_to_all()
61 receive(pg, source, 1, &incoming[source].front(), size); in inplace_all_to_all()
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | mpi_process_group.hpp | 155 receive(mpi_process_group const& pg, int source, int tag,
178 receive(mpi_process_group const& pg, int source, int tag,
201 receive(mpi_process_group const& pg, int source, int tag,
220 receive(mpi_process_group const& pg, int source, int tag,
241 receive(mpi_process_group const& pg, int source, int tag,
245 void prepare_receive(mpi_process_group const& pg, int tag, bool force=false) const;
620 process_id(const mpi_process_group& pg) in process_id() argument
621 { return pg.rank; } in process_id()
624 num_processes(const mpi_process_group& pg) in num_processes() argument
625 { return pg.size; } in num_processes()
[all …]
|
| D | compressed_sparse_row_graph.hpp | 154 compressed_sparse_row_graph(const ProcessGroup& pg = ProcessGroup()) in compressed_sparse_row_graph() argument
155 : m_process_group(pg), m_distribution(parallel::block(pg, 0)) {} in compressed_sparse_row_graph()
158 const ProcessGroup& pg = ProcessGroup()) in compressed_sparse_row_graph() argument
159 : m_process_group(pg), m_distribution(parallel::block(pg, 0)) {} in compressed_sparse_row_graph()
162 const ProcessGroup& pg = ProcessGroup()) in compressed_sparse_row_graph() argument
163 : m_process_group(pg), m_distribution(parallel::block(pg, 0)), in compressed_sparse_row_graph()
169 const ProcessGroup& pg = ProcessGroup()) in compressed_sparse_row_graph() argument
170 : m_process_group(pg), m_distribution(parallel::block(pg, 0)), in compressed_sparse_row_graph()
176 const ProcessGroup& pg, in compressed_sparse_row_graph() argument
178 : m_process_group(pg), m_distribution(dist), m_base(numverts) {} in compressed_sparse_row_graph()
[all …]
|
| D | boman_et_al_graph_coloring.hpp | 151 process_group_type pg = process_group(g); in boman_et_al_graph_coloring() local
163 rounds = all_reduce(pg, rounds, boost::parallel::maximum<std::size_t>()); in boman_et_al_graph_coloring()
182 sent_to_processors.assign(num_processes(pg), false); in boman_et_al_graph_coloring()
183 sent_to_processors[process_id(pg)] = true; in boman_et_al_graph_coloring()
205 send(pg, get(owner, target(e, g)), 17, in boman_et_al_graph_coloring()
217 synchronize(pg); in boman_et_al_graph_coloring()
221 while (optional<std::pair<process_id_type, int> > stp = probe(pg)) { in boman_et_al_graph_coloring()
224 receive(pg, stp->first, stp->second, msg); in boman_et_al_graph_coloring()
238 if (get(owner, w) != process_id(pg) // boundary vertex in boman_et_al_graph_coloring()
260 if (asynchronous) synchronize(pg); in boman_et_al_graph_coloring()
[all …]
|
| D | depth_first_search.hpp | 61 index_map(index_map), vis(vis), pg(process_group(g)), in parallel_dfs()
78 if (get(owner, s) == process_id(pg)) { in run()
79 send_oob(pg, get(owner, s), discover_msg, vertex_pair(s, s)); in run()
84 std::pair<process_id_type, int> msg = *pg.poll(true); in run()
90 receive_oob(pg, msg.first, msg.second, p); in run()
118 send_oob(pg, get(owner, target(*ei, g)), visited_msg, visit); in run()
128 receive_oob(pg, msg.first, msg.second, p); in run()
141 receive_oob(pg, msg.first, msg.second, p); in run()
152 receive_oob(pg, msg.first, msg.second, done); in run()
156 process_id_type id = process_id(pg); in run()
[all …]
|
| D | graphviz.hpp | 123 process_group_type pg = process_group(g); in write_graphviz() local
126 global_index(pg, num_vertices(g), get(vertex_index, g), in write_graphviz()
131 local_graph_out << " subgraph cluster_" << process_id(pg) << " {\n"; in write_graphviz()
155 if (process_id(pg) == 0) { in write_graphviz()
159 synchronize(pg); in write_graphviz()
160 for (int i = 1; i < num_processes(pg); ++i) { in write_graphviz()
162 receive(pg, i, 0, len); in write_graphviz()
165 receive(pg, i, 1, data, len); in write_graphviz()
175 send(pg, 0, 0, len); in write_graphviz()
176 send(pg, 0, 1, data, len); in write_graphviz()
[all …]
|
| D | connected_components.hpp | 90 process_group_type pg = process_group(g); in build_local_metagraph() local
91 process_id_type id = process_id(pg); in build_local_metagraph()
103 send(pg, 0, root_adj_msg, adjs); in build_local_metagraph()
107 synchronize(pg); in build_local_metagraph()
121 while (optional<std::pair<process_id_type, int> > m = probe(pg)) { in build_local_metagraph()
125 receive(pg, m->first, m->second, adjs); in build_local_metagraph()
248 process_group_type pg = process_group(g); in request_parent_map_entries() local
256 for (process_id_type i = 0; i < num_processes(pg); ++i) { in request_parent_map_entries()
260 send(pg, i, req_parents_msg, reqs); in request_parent_map_entries()
264 synchronize(pg); in request_parent_map_entries()
[all …]
|
| D | dehne_gotz_min_spanning_tree.hpp | 147 boruvka_merge_step(ProcessGroup pg, const Graph& g, WeightMap weight_map, in boruvka_merge_step() argument
191 all_reduce(pg, in boruvka_merge_step()
435 merge_local_minimum_spanning_trees_step(ProcessGroup pg, in merge_local_minimum_spanning_trees_step() argument
452 process_id_type num_procs = num_processes(pg); in merge_local_minimum_spanning_trees_step()
453 process_id_type id = process_id(pg); in merge_local_minimum_spanning_trees_step()
478 synchronize(pg); in merge_local_minimum_spanning_trees_step()
482 receive(pg, from_id, 0, num_incoming_edges); in merge_local_minimum_spanning_trees_step()
485 receive(pg, from_id, 1, &incoming_edges[0], num_incoming_edges); in merge_local_minimum_spanning_trees_step()
512 send(pg, id % procs_left, 0, edge_list.size()); in merge_local_minimum_spanning_trees_step()
520 send(pg, id % procs_left, 1, &outgoing_edges[0], in merge_local_minimum_spanning_trees_step()
[all …]
|
| D | delta_stepping_shortest_paths.hpp | 139 ProcessGroup pg; member in boost::graph::distributed::delta_stepping_impl
177 pg(boost::graph::parallel::process_group_adl(g), attach_distributed_object()), in delta_stepping_impl()
195 pg(boost::graph::parallel::process_group_adl(g), attach_distributed_object()), in delta_stepping_impl()
212 max_edge_weight = all_reduce(pg, max_edge_weight, maximum<Dist>()); in delta_stepping_impl()
213 max_degree = all_reduce(pg, max_degree, maximum<Degree>()); in delta_stepping_impl()
245 if (get(owner, s) == process_id(pg)) in run()
266 std::cerr << "#" << process_id(pg) << ": lowest bucket is #" in run()
273 current_bucket = all_reduce(pg, current_bucket, minimum<BucketIndex>()); in run()
280 if (process_id(pg) == 0) in run()
302 std::cerr << "#" << process_id(pg) << ": processing vertex " in run()
[all …]
|
| /third_party/boost/boost/graph/distributed/detail/ |
| D | remote_update_set.hpp | 26 void do_synchronize(ProcessGroup& pg) in do_synchronize() argument
29 synchronize(pg); in do_synchronize()
94 handle_messages(remote_update_set* self, const ProcessGroup& pg) in handle_messages()
95 : self(self), update_sizes(num_processes(pg), 0) { } in handle_messages()
138 remote_update_set(const ProcessGroup& pg, const OwnerMap& owner) in remote_update_set() argument
139 : process_group(pg, handle_messages(this, pg)), in remote_update_set()
140 updates(num_processes(pg)), owner(owner) { in remote_update_set()
203 explicit handle_messages(remote_update_set* self, const ProcessGroup& pg) in handle_messages()
205 { update_sizes.resize(num_processes(pg), 0); } in handle_messages()
226 remote_update_set(const ProcessGroup& pg, const OwnerMap& owner) in remote_update_set() argument
[all …]
|
| D | mpi_process_group.ipp | 228 send(const mpi_process_group& pg, mpi_process_group::process_id_type dest,
231 pg.send_impl(dest, pg.encode_tag(pg.my_block_number(), tag), value,
237 send(const mpi_process_group& pg, mpi_process_group::process_id_type dest,
240 pg.send_impl(dest, pg.encode_tag(pg.my_block_number(), tag),
280 send(const mpi_process_group& pg, mpi_process_group::process_id_type dest,
283 pg.array_send_impl(dest, pg.encode_tag(pg.my_block_number(), tag),
289 send(const mpi_process_group& pg, mpi_process_group::process_id_type dest,
294 if (values.empty()) send(pg, dest, tag, static_cast<value_type*>(0), 0);
295 else send(pg, dest, tag, &values[0], values.size());
674 receive(const mpi_process_group& pg, int tag, T& value)
[all …]
|
| /third_party/uboot/u-boot-2020.01/arch/arm/mach-imx/ |
| D | spl_imx_romapi.c | 171 u32 pagesize, pg; in spl_romapi_load_image_stream() local
186 pg = pagesize; in spl_romapi_load_image_stream()
187 if (pg < 1024) in spl_romapi_load_image_stream()
188 pg = 1024; in spl_romapi_load_image_stream()
191 ret = g_rom_api->download_image(p, 0, pg, in spl_romapi_load_image_stream()
192 ((uintptr_t)p) ^ pg); in spl_romapi_load_image_stream()
200 pfit = search_fit_header(p, pg); in spl_romapi_load_image_stream()
201 p += pg; in spl_romapi_load_image_stream()
213 ret = g_rom_api->download_image(p, 0, pg, ((uintptr_t)p) ^ pg); in spl_romapi_load_image_stream()
221 p += pg; in spl_romapi_load_image_stream()
[all …]
|
| /third_party/boost/boost/graph/distributed/adjlist/ |
| D | initialize.hpp | 85 process_group_type pg = process_group(); in initialize() local
86 process_id_type id = process_id(pg); in initialize()
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()
159 inplace_all_to_all(pg, descriptor_requests, in_descriptor_requests); 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()
174 inplace_all_to_all(pg, descriptor_responses); in initialize()
210 process_group_type pg = process_group(); in initialize() local
[all …]
|
| /third_party/boost/libs/math/test/ |
| D | test_erf.hpp | 29 typedef value_type (*pg)(value_type); in do_test_erf() typedef
31 pg funcp = ERF_FUNCTION_TO_TEST; in do_test_erf()
33 pg funcp = boost::math::erf<value_type>; in do_test_erf()
35 pg funcp = boost::math::erf; in do_test_erf()
80 typedef value_type (*pg)(value_type); in do_test_erf_inv() typedef
89 pg funcp = ERF_INV_FUNCTION_TO_TEST; in do_test_erf_inv()
91 pg funcp = boost::math::erf_inv<value_type>; in do_test_erf_inv()
93 pg funcp = boost::math::erf_inv; in do_test_erf_inv()
110 typedef value_type (*pg)(value_type); in do_test_erfc_inv() typedef
119 pg funcp = ERFC_INV_FUNCTION_TO_TEST; in do_test_erfc_inv()
[all …]
|
| D | test_bessel_y.hpp | 30 typedef value_type (*pg)(value_type, value_type); in do_test_cyl_neumann_y() typedef
32 pg funcp = BESSEL_Y_FUNCTION_TO_TEST; in do_test_cyl_neumann_y()
34 pg funcp = boost::math::cyl_neumann<value_type, value_type>; in do_test_cyl_neumann_y()
36 pg funcp = boost::math::cyl_neumann; in do_test_cyl_neumann_y()
73 typedef value_type (*pg)(value_type, value_type); in do_test_cyl_neumann_y_int() typedef
75 pg funcp = cyl_neumann_int_wrapper<value_type>; in do_test_cyl_neumann_y_int()
77 pg funcp = cyl_neumann_int_wrapper; in do_test_cyl_neumann_y_int()
103 typedef value_type (*pg)(unsigned, value_type); in do_test_sph_neumann_y() typedef
105 pg funcp = BESSEL_YS_FUNCTION_TO_TEST; in do_test_sph_neumann_y()
107 pg funcp = boost::math::sph_neumann<value_type>; in do_test_sph_neumann_y()
[all …]
|
| D | test_bessel_y_prime.hpp | 31 typedef value_type (*pg)(value_type, value_type); in do_test_cyl_neumann_y_prime() typedef
33 pg funcp = BESSEL_YP_FUNCTION_TO_TEST; in do_test_cyl_neumann_y_prime()
35 pg funcp = boost::math::cyl_neumann_prime<value_type, value_type>; in do_test_cyl_neumann_y_prime()
37 pg funcp = boost::math::cyl_neumann_prime; in do_test_cyl_neumann_y_prime()
74 typedef value_type (*pg)(value_type, value_type); in do_test_cyl_neumann_y_prime_int() typedef
76 pg funcp = cyl_neumann_prime_int_wrapper<value_type>; in do_test_cyl_neumann_y_prime_int()
78 pg funcp = cyl_neumann_prime_int_wrapper; in do_test_cyl_neumann_y_prime_int()
104 typedef value_type (*pg)(unsigned, value_type); in do_test_sph_neumann_y_prime() typedef
106 pg funcp = BESSEL_YPS_FUNCTION_TO_TEST; in do_test_sph_neumann_y_prime()
108 pg funcp = boost::math::sph_neumann_prime<value_type>; in do_test_sph_neumann_y_prime()
[all …]
|
| /third_party/boost/boost/graph/parallel/ |
| D | algorithm.hpp | 49 reduce(ProcessGroup pg, typename ProcessGroup::process_id_type root,
55 all_reduce(ProcessGroup pg, const T& value, BinaryOperation bin_op) in all_reduce() argument
58 all_reduce(pg, in all_reduce()
66 scan(ProcessGroup pg, const T& value, BinaryOperation bin_op) in scan() argument
69 scan(pg, in scan()
78 all_gather(ProcessGroup pg, InputIterator first, InputIterator last,
|