Debian Codegraph @

src/atlas/mesh/actions/BuildEdges.cc

raw
1 /*
2 * (C) Copyright 2013 ECMWF.
3 *
4 * This software is licensed under the terms of the Apache Licence Version 2.0
5 * which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
6 * In applying this licence, ECMWF does not waive the privileges and immunities
7 * granted to it by virtue of its status as an intergovernmental organisation
8 * nor does it submit to any jurisdiction.
9 */
10
11 #include "atlas/mesh/actions/BuildEdges.h"
12
13 #include <algorithm>
14 #include <cmath>
15 #include <iostream>
16 #include <limits>
17 #include <memory>
18 #include <set>
19 #include <stdexcept>
20
21 #include "eckit/types/FloatCompare.h"
22
23 #include "atlas/array.h"
24 #include "atlas/array/ArrayView.h"
25 #include "atlas/array/IndexView.h"
26 #include "atlas/domain.h"
27 #include "atlas/field/Field.h"
28 #include "atlas/grid/StructuredGrid.h"
29 #include "atlas/library/config.h"
30 #include "atlas/mesh/ElementType.h"
31 #include "atlas/mesh/Elements.h"
32 #include "atlas/mesh/HybridElements.h"
33 #include "atlas/mesh/Mesh.h"
34 #include "atlas/mesh/Nodes.h"
35 #include "atlas/mesh/detail/AccumulateFacets.h"
36 #include "atlas/parallel/mpi/mpi.h"
37 #include "atlas/runtime/Exception.h"
38 #include "atlas/runtime/Log.h"
39 #include "atlas/util/CoordinateEnums.h"
40 #include "atlas/util/LonLatMicroDeg.h"
41 #include "atlas/util/MicroDeg.h"
42 #include "atlas/util/Unique.h"
43
44 using atlas::mesh::detail::accumulate_facets_ordered_by_halo;
45 using Topology = atlas::mesh::Nodes::Topology;
46 using atlas::util::microdeg;
47 using atlas::util::UniqueLonLat;
48
49 namespace atlas {
50 namespace mesh {
51 namespace actions {
52
53 //----------------------------------------------------------------------------------------------------------------------
54
55 namespace { // anonymous
56 struct Sort {
57 Sort() = default;
58 Sort(gidx_t gid, idx_t idx) {
59 g = gid;
60 i = idx;
61 }
62 gidx_t g;
63 idx_t i;
64 bool operator<(const Sort& other) const { return (g < other.g); }
65 };
66 } // anonymous namespace
67
68 void build_element_to_edge_connectivity(Mesh& mesh) {
69 ATLAS_TRACE();
70 mesh::HybridElements::Connectivity& cell_edge_connectivity = mesh.cells().edge_connectivity();
71 cell_edge_connectivity.clear();
72
73 // Allocate cell_edge_connectivity
74 for (idx_t t = 0; t < mesh.cells().nb_types(); ++t) {
75 idx_t nb_elements = mesh.cells().elements(t).size();
76 idx_t nb_edges_per_elem = mesh.cells().element_type(t).nb_edges();
77 std::vector<idx_t> init(mesh.cells().elements(t).size() * nb_edges_per_elem,
78 cell_edge_connectivity.missing_value());
79 cell_edge_connectivity.add(nb_elements, nb_edges_per_elem, init.data());
80 }
81
82 idx_t nb_edges = mesh.edges().size();
83 const mesh::HybridElements::Connectivity& edge_cell_connectivity = mesh.edges().cell_connectivity();
84 const mesh::HybridElements::Connectivity& edge_node_connectivity = mesh.edges().node_connectivity();
85
86 auto edge_flags = array::make_view<int, 1>(mesh.edges().flags());
87 auto is_pole_edge = [&](idx_t e) { return Topology::check(edge_flags(e), Topology::POLE); };
88
89 // Sort edges for bit-reproducibility
90 std::vector<Sort> edge_sort;
91 edge_sort.reserve(nb_edges);
92 {
93 UniqueLonLat compute_uid(mesh);
94
95 for (idx_t jedge = 0; jedge < nb_edges; ++jedge) {
96 edge_sort.emplace_back(compute_uid(edge_node_connectivity.row(jedge)), jedge);
97 }
98
99 std::sort(edge_sort.data(), edge_sort.data() + nb_edges);
100 }
101
102 // Fill in cell_edge_connectivity
103 std::vector<idx_t> edge_cnt(mesh.cells().size());
104 for (idx_t jedge = 0; jedge < nb_edges; ++jedge) {
105 int iedge = edge_sort[jedge].i;
106 for (idx_t j = 0; j < 2; ++j) {
107 idx_t elem = edge_cell_connectivity(iedge, j);
108
109 if (elem != edge_cell_connectivity.missing_value()) {
110 ATLAS_ASSERT(edge_cnt[elem] < cell_edge_connectivity.cols(elem));
111 cell_edge_connectivity.set(elem, edge_cnt[elem]++, iedge);
112 }
113 else {
114 if (not is_pole_edge(iedge)) {
115 if (j == 0) {
116 auto node_gidx = array::make_view<gidx_t, 1>(mesh.nodes().global_index());
117 std::stringstream ss;
118 ss << "Edge [" << node_gidx(edge_node_connectivity(jedge, 0)) << ", "
119 << node_gidx(edge_node_connectivity(jedge, 1)) << "] "
120 << "has no element connected.";
121 Log::error() << ss.str() << std::endl;
122 throw_Exception(ss.str(), Here());
123 }
124 }
125 }
126 }
127 }
128
129
130 // Verify that all edges have been found
131 auto field_flags = array::make_view<int, 1>(mesh.cells().flags());
132 auto patch = [&field_flags](idx_t e) {
133 using Topology = atlas::mesh::Nodes::Topology;
134 return Topology::check(field_flags(e), Topology::PATCH);
135 };
136
137 for (idx_t jcell = 0; jcell < mesh.cells().size(); ++jcell) {
138 if (patch(jcell)) {
139 continue;
140 }
141 for (idx_t jcol = 0; jcol < cell_edge_connectivity.cols(jcell); ++jcol) {
142 if (cell_edge_connectivity(jcell, jcol) == cell_edge_connectivity.missing_value()) {
143 const array::ArrayView<gidx_t, 1> gidx = array::make_view<gidx_t, 1>(mesh.nodes().global_index());
144 std::stringstream msg;
145 msg << "Could not find edge " << jcol << " for " << mesh.cells().name(jcell) << " elem " << jcell
146 << " with nodes ( ";
147 for (idx_t jnode = 0; jnode < mesh.cells().node_connectivity().cols(jcell); ++jnode) {
148 msg << gidx(mesh.cells().node_connectivity()(jcell, jnode)) << " ";
149 }
150 msg << ")";
151 throw_Exception(msg.str(), Here());
152 }
153 }
154 }
155 }
156
157 void build_node_to_edge_connectivity(Mesh& mesh) {
158 mesh::Nodes& nodes = mesh.nodes();
159 const idx_t nb_edges = mesh.edges().size();
160
161 mesh::Nodes::Connectivity& node_to_edge = nodes.edge_connectivity();
162 node_to_edge.clear();
163
164 const mesh::HybridElements::Connectivity& edge_node_connectivity = mesh.edges().node_connectivity();
165
166 std::vector<idx_t> to_edge_size(nodes.size(), 0);
167 for (idx_t jedge = 0; jedge < nb_edges; ++jedge) {
168 for (idx_t j = 0; j < 2; ++j) {
169 ++to_edge_size[edge_node_connectivity(jedge, j)];
170 }
171 }
172
173 node_to_edge.add(nodes.size(), to_edge_size.data());
174
175 for (idx_t jnode = 0; jnode < nodes.size(); ++jnode) {
176 to_edge_size[jnode] = 0;
177 }
178
179 UniqueLonLat compute_uid(mesh);
180 std::vector<Sort> edge_sort(nb_edges);
181 for (idx_t jedge = 0; jedge < nb_edges; ++jedge) {
182 edge_sort[jedge] = Sort(compute_uid(edge_node_connectivity.row(jedge)), jedge);
183 }
184 std::stable_sort(edge_sort.data(), edge_sort.data() + nb_edges);
185
186 for (idx_t jedge = 0; jedge < nb_edges; ++jedge) {
187 idx_t iedge = edge_sort[jedge].i;
188 ATLAS_ASSERT(iedge < nb_edges);
189 for (idx_t j = 0; j < 2; ++j) {
190 idx_t node = edge_node_connectivity(iedge, j);
191 node_to_edge.set(node, to_edge_size[node]++, iedge);
192 }
193 }
194 }
195
196 class AccumulatePoleEdges {
197 enum
198 {
199 NORTH = 0,
200 SOUTH = 1
201 };
202 const array::ArrayView<double, 2> xy;
203 const array::ArrayView<int, 1> flags;
204 const array::ArrayView<int, 1> part;
205 const array::ArrayView<int, 1> halo;
206 const idx_t nb_nodes;
207 std::vector<std::set<int>> pole_nodes;
208
209 public:
210 AccumulatePoleEdges(mesh::Nodes& nodes):
211 xy(array::make_view<double, 2>(nodes.xy())),
212 flags(array::make_view<int, 1>(nodes.flags())),
213 part(array::make_view<int, 1>(nodes.partition())),
214 halo(array::make_view<int, 1>(nodes.halo())),
215 nb_nodes(nodes.size()),
216 pole_nodes(2) {
217 double min[2], max[2];
218 min[XX] = std::numeric_limits<double>::max();
219 min[YY] = std::numeric_limits<double>::max();
220 max[XX] = -std::numeric_limits<double>::max();
221 max[YY] = -std::numeric_limits<double>::max();
222 for (idx_t node = 0; node < nb_nodes; ++node) {
223 min[XX] = std::min(min[XX], xy(node, XX));
224 min[YY] = std::min(min[YY], xy(node, YY));
225 max[XX] = std::max(max[XX], xy(node, XX));
226 max[YY] = std::max(max[YY], xy(node, YY));
227 }
228
229 ATLAS_TRACE_MPI(ALLREDUCE) {
230 mpi::comm().allReduceInPlace(min, 2, eckit::mpi::min());
231 mpi::comm().allReduceInPlace(max, 2, eckit::mpi::max());
232 }
233
234 double tol = 1e-6;
235
236 // Collect all nodes closest to poles
237 for (idx_t node = 0; node < nb_nodes; ++node) {
238 if (std::abs(xy(node, YY) - max[YY]) < tol) {
239 pole_nodes[NORTH].insert(node);
240 }
241 else if (std::abs(xy(node, YY) - min[YY]) < tol) {
242 pole_nodes[SOUTH].insert(node);
243 }
244 }
245
246 // Sanity check
247 {
248 for (idx_t NS = 0; NS < 2; ++NS) {
249 int npart = -1;
250 for (std::set<int>::iterator it = pole_nodes[NS].begin(); it != pole_nodes[NS].end(); ++it) {
251 int node = *it;
252 if (npart == -1) {
253 npart = part(node);
254 }
255 else if (part(node) != npart) {
256 // Not implemented yet, when pole-lattitude is split.
257 std::stringstream msg;
258 msg << "Split pole-latitude is not supported yet... node " << node << "[p" << part(node)
259 << "] should belong to part " << npart;
260 throw_NotImplemented(msg.str(), Here());
261 }
262 }
263 }
264 }
265 }
266 void compute_pole_edges(int _halo, std::vector<idx_t>& pole_edge_nodes, idx_t& nb_pole_edges) {
267 // Create connections over the poles and store in pole_edge_nodes
268 nb_pole_edges = 0;
269 for (idx_t NS = 0; NS < 2; ++NS) {
270 for (std::set<int>::iterator it = pole_nodes[NS].begin(); it != pole_nodes[NS].end(); ++it) {
271 int node = *it;
272 if (!Topology::check(flags(node), Topology::PERIODIC | Topology::GHOST)) {
273 int x2 = microdeg(xy(node, XX) + 180.);
274 for (std::set<int>::iterator itr = pole_nodes[NS].begin(); itr != pole_nodes[NS].end(); ++itr) {
275 int other_node = *itr;
276 if (microdeg(xy(other_node, XX)) == x2) {
277 if (!Topology::check(flags(other_node), Topology::PERIODIC)) {
278 if (halo(node) == _halo && halo(other_node) == _halo) {
279 pole_edge_nodes.push_back(node);
280 pole_edge_nodes.push_back(other_node);
281 ++nb_pole_edges;
282 }
283 }
284 }
285 }
286 }
287 }
288 }
289 }
290 };
291
292
293 struct ComputeUniquePoleEdgeIndex {
294 // Already assumes that the edges cross the pole
295
296 ComputeUniquePoleEdgeIndex(const mesh::Nodes& nodes): xy(array::make_view<double, 2>(nodes.xy())) {}
297
298 gidx_t operator()(const mesh::Connectivity::Row& edge_nodes) const {
299 double centroid[2];
300 centroid[XX] = 0.;
301 centroid[YY] = 0.;
302 for (idx_t jnode = 0; jnode < 2; ++jnode) {
303 centroid[XX] += xy(edge_nodes(jnode), XX);
304 centroid[YY] += xy(edge_nodes(jnode), YY);
305 }
306 centroid[XX] /= 2.;
307 centroid[YY] /= 2.;
308 if (centroid[YY] > 0) {
309 centroid[YY] = 90.;
310 }
311 else {
312 centroid[YY] = -90.;
313 }
314 /// FIXME make this into `util::unique_lonlat(centroid)` but this causes
315 /// weird parallel behavior
316 return util::detail::unique32(microdeg(centroid[XX]), microdeg(centroid[YY]));
317 }
318
319 array::ArrayView<const double, 2> xy;
320 };
321
322 void build_edges(Mesh& mesh) {
323 build_edges(mesh, util::NoConfig());
324 }
325
326 void build_edges(Mesh& mesh, const eckit::Configuration& config) {
327 ATLAS_TRACE("BuildEdges");
328
329 mpi::Scope mpi_scope(mesh.mpi_comm());
330
331 int mesh_halo(0);
332 mesh.metadata().get("halo", mesh_halo);
333
334 if (mesh.metadata().has("built_edges_for_halo")) {
335 int edges_halo = mesh.metadata().getInt("built_edges_for_halo");
336 if (edges_halo == mesh_halo) {
337 // Nothing to be done here
338 return;
339 }
340 }
341
342 bool pole_edges{false};
343 if (StructuredGrid grid = mesh.grid()) {
344 if (RectangularDomain domain = grid.domain()) {
345 if (domain.global()) {
346 double ymax = std::max(std::abs(grid.y().front()), std::abs(grid.y().back()));
347 pole_edges = not eckit::types::is_approximately_equal(ymax, domain.ymax());
348 }
349 }
350 }
351 config.get("pole_edges", pole_edges);
352
353 bool sort_edges{false};
354 config.get("sort_edges", sort_edges);
355
356
357 mesh::Nodes& nodes = mesh.nodes();
358 auto node_part = array::make_view<int, 1>(nodes.partition());
359
360 idx_t nb_nodes = nodes.size();
361
362 mesh.edges().clear();
363
364 idx_t edge_start{0};
365 idx_t edge_end{0};
366
367 // storage for edge-to-node-connectivity shape=(nb_edges,2)
368 std::vector<idx_t> edge_nodes_data;
369 std::vector<idx_t> edge_to_elem_data;
370 std::vector<idx_t> edge_halo_offsets;
371 idx_t nb_edges;
372 idx_t nb_inner_edges;
373 idx_t missing_value;
374
375 accumulate_facets_ordered_by_halo(mesh.cells(), mesh.nodes(), edge_nodes_data, edge_to_elem_data, nb_edges,
376 nb_inner_edges, missing_value, edge_halo_offsets);
377
378 std::vector<idx_t> sorted_edge_nodes_data;
379 std::vector<idx_t> sorted_edge_to_elem_data;
380
381 for (int halo = 0; halo <= mesh_halo; ++halo) {
382 edge_start = edge_end;
383 if (halo+1 < edge_halo_offsets.size()) {
384 edge_end += (edge_halo_offsets[halo + 1] - edge_halo_offsets[halo]);
385 }
386
387 if (/*sort edges based on lowest node local index = */ sort_edges) {
388 if (sorted_edge_nodes_data.empty()) {
389 sorted_edge_nodes_data.resize(edge_nodes_data.size());
390 }
391 if (sorted_edge_to_elem_data.empty()) {
392 sorted_edge_to_elem_data.resize(edge_to_elem_data.size());
393 }
394 std::vector<std::pair<idx_t, idx_t>> sorted_edges_by_lowest_node_index;
395 sorted_edges_by_lowest_node_index.reserve(edge_end - edge_start);
396 for (idx_t e = edge_start; e < edge_end; ++e) {
397 const idx_t iedge = edge_halo_offsets[halo] + (e - edge_start);
398 idx_t lowest_node_idx = std::min(edge_nodes_data.at(2 * iedge + 0), edge_nodes_data.at(2 * iedge + 1));
399 sorted_edges_by_lowest_node_index.emplace_back(lowest_node_idx, e);
400 }
401 std::sort(sorted_edges_by_lowest_node_index.begin(), sorted_edges_by_lowest_node_index.end());
402 for (idx_t e = edge_start; e < edge_end; ++e) {
403 const idx_t iedge = edge_halo_offsets[halo] + (e - edge_start);
404 const idx_t sedge =
405 edge_halo_offsets[halo] + (sorted_edges_by_lowest_node_index[e - edge_start].second - edge_start);
406 sorted_edge_nodes_data[2 * iedge + 0] = edge_nodes_data[2 * sedge + 0];
407 sorted_edge_nodes_data[2 * iedge + 1] = edge_nodes_data[2 * sedge + 1];
408 sorted_edge_to_elem_data[2 * iedge + 0] = edge_to_elem_data[2 * sedge + 0];
409 sorted_edge_to_elem_data[2 * iedge + 1] = edge_to_elem_data[2 * sedge + 1];
410 }
411
412 for (idx_t e = edge_start; e < edge_end; ++e) {
413 const idx_t iedge = edge_halo_offsets[halo] + (e - edge_start);
414 edge_nodes_data[2 * iedge + 0] = sorted_edge_nodes_data[2 * iedge + 0];
415 edge_nodes_data[2 * iedge + 1] = sorted_edge_nodes_data[2 * iedge + 1];
416 edge_to_elem_data[2 * iedge + 0] = sorted_edge_to_elem_data[2 * iedge + 0];
417 edge_to_elem_data[2 * iedge + 1] = sorted_edge_to_elem_data[2 * iedge + 1];
418 }
419 }
420
421 // Build edges
422 mesh.edges().add(mesh::ElementType::create("Line"), (edge_end - edge_start),
423 edge_nodes_data.data() + edge_halo_offsets[halo] * 2);
424 auto& edge_nodes = mesh.edges().node_connectivity();
425 const auto& cell_nodes = mesh.cells().node_connectivity();
426
427 UniqueLonLat compute_uid(mesh);
428
429 auto edge_ridx = array::make_indexview<idx_t, 1>(mesh.edges().remote_index());
430 auto edge_part = array::make_view<int, 1>(mesh.edges().partition());
431 auto edge_glb_idx = array::make_view<gidx_t, 1>(mesh.edges().global_index());
432 auto edge_halo = array::make_view<int, 1>(mesh.edges().halo());
433 auto edge_flags = array::make_view<int, 1>(mesh.edges().flags());
434
435 ATLAS_ASSERT(cell_nodes.missing_value() == missing_value);
436 for (idx_t edge = edge_start; edge < edge_end; ++edge) {
437 const idx_t iedge = edge_halo_offsets[halo] + (edge - edge_start);
438 const int ip1 = edge_nodes(edge, 0);
439 const int ip2 = edge_nodes(edge, 1);
440 if (compute_uid(ip1) > compute_uid(ip2)) {
441 idx_t swapped[2] = {ip2, ip1};
442 edge_nodes.set(edge, swapped);
443 }
444
445 ATLAS_ASSERT(idx_t(edge_nodes(edge, 0)) < nb_nodes);
446 ATLAS_ASSERT(idx_t(edge_nodes(edge, 1)) < nb_nodes);
447 edge_glb_idx(edge) = compute_uid(edge_nodes.row(edge));
448 edge_part(edge) = std::min(node_part(edge_nodes(edge, 0)), node_part(edge_nodes(edge, 1)));
449 edge_ridx(edge) = edge;
450 edge_halo(edge) = halo;
451 edge_flags(edge) = 0;
452
453 const idx_t e1 = edge_to_elem_data[2 * iedge + 0];
454 const idx_t e2 = edge_to_elem_data[2 * iedge + 1];
455
456 ATLAS_ASSERT(e1 != cell_nodes.missing_value());
457 if (e2 == cell_nodes.missing_value()) {
458 // do nothing
459 }
460 else if (compute_uid(cell_nodes.row(e1)) > compute_uid(cell_nodes.row(e2))) {
461 edge_to_elem_data[iedge * 2 + 0] = e2;
462 edge_to_elem_data[iedge * 2 + 1] = e1;
463 }
464 }
465
466 mesh.edges().cell_connectivity().add((edge_end - edge_start), 2,
467 edge_to_elem_data.data() + edge_halo_offsets[halo] * 2);
468
469 if (pole_edges) {
470 auto pole_edge_accumulator = std::make_shared<AccumulatePoleEdges>(nodes);
471
472 idx_t nb_pole_edges;
473 std::vector<idx_t> pole_edge_nodes;
474
475 pole_edge_accumulator->compute_pole_edges(halo, pole_edge_nodes, nb_pole_edges);
476
477 if (nb_pole_edges) {
478 edge_start = edge_end;
479 edge_end += nb_pole_edges;
480
481 mesh.edges().add(mesh::ElementType::create("Line"), nb_pole_edges, pole_edge_nodes.data());
482
483 auto edge_ridx = array::make_indexview<idx_t, 1>(mesh.edges().remote_index());
484 auto edge_part = array::make_view<int, 1>(mesh.edges().partition());
485 auto edge_glb_idx = array::make_view<gidx_t, 1>(mesh.edges().global_index());
486 auto edge_halo = array::make_view<int, 1>(mesh.edges().halo());
487 auto edge_flags = array::make_view<int, 1>(mesh.edges().flags());
488
489 auto set_pole_edge = [&edge_flags](idx_t e) { Topology::set(edge_flags(e), Topology::POLE); };
490
491 auto& edge_nodes = mesh.edges().node_connectivity();
492
493 mesh.edges().cell_connectivity().add(nb_pole_edges, 2);
494
495 idx_t cnt = 0;
496 ComputeUniquePoleEdgeIndex compute_uid(nodes);
497 for (idx_t edge = edge_start; edge < edge_end; ++edge) {
498 idx_t ip1 = pole_edge_nodes[cnt++];
499 idx_t ip2 = pole_edge_nodes[cnt++];
500 std::array<idx_t, 2> enodes{ip1, ip2};
501 edge_nodes.set(edge, enodes.data());
502 edge_glb_idx(edge) = compute_uid(edge_nodes.row(edge));
503 edge_part(edge) = std::min(node_part(edge_nodes(edge, 0)), node_part(edge_nodes(edge, 1)));
504 edge_ridx(edge) = edge;
505 edge_halo(edge) = halo;
506 set_pole_edge(edge);
507 }
508 }
509 }
510 }
511
512 mesh.edges().metadata().set("pole_edges", pole_edges);
513
514
515 build_element_to_edge_connectivity(mesh);
516
517 mesh::HybridElements::Connectivity& cell_edges = mesh.cells().edge_connectivity();
518 auto cell_halo = array::make_view<int, 1>(mesh.cells().halo());
519 auto cell_flags = array::make_view<int, 1>(mesh.cells().flags());
520 auto cell_patch = [&cell_flags](idx_t e) {
521 using Topology = atlas::mesh::Nodes::Topology;
522 return Topology::check(cell_flags(e), Topology::PATCH);
523 };
524 auto edge_halo = array::make_view<int, 1>(mesh.edges().halo());
525 int max_halo = 0;
526 for (idx_t jcell = 0; jcell < mesh.cells().size(); ++jcell) {
527 if (not cell_patch(jcell)) {
528 int halo = cell_halo(jcell);
529 max_halo = std::max(halo, max_halo);
530 for (idx_t jedge = 0; jedge < cell_edges.cols(jcell); ++jedge) {
531 auto iedge = cell_edges(jcell, jedge);
532 ATLAS_ASSERT(edge_halo(iedge) <= halo);
533 }
534 }
535 }
536
537 std::vector<int> nb_edges_including_halo(max_halo + 1);
538
539 {
540 int nb_edges = mesh.edges().size();
541 for (int jedge = 0; jedge < nb_edges; ++jedge) {
542 nb_edges_including_halo[edge_halo(jedge)] = jedge + 1;
543 if (jedge > 0) {
544 ATLAS_ASSERT(edge_halo(jedge) >= edge_halo(jedge - 1));
545 }
546 }
547 }
548
549 for (int i = 0; i <= max_halo; ++i) {
550 if (i > 0) {
551 ATLAS_ASSERT(nb_edges_including_halo[i] > nb_edges_including_halo[i - 1]);
552 }
553 std::stringstream ss;
554 ss << "nb_edges_including_halo[" << i << "]";
555 mesh.metadata().set(ss.str(), nb_edges_including_halo[i]);
556 }
557 for (int i = max_halo + 1; i <= mesh_halo; ++i) {
558 std::stringstream ss;
559 ss << "nb_edges_including_halo[" << i << "]";
560 mesh.metadata().set(ss.str(), nb_edges_including_halo.back());
561 }
562
563 mesh.metadata().set("built_edges_for_halo", mesh_halo);
564
565 // Backwards compatibility for code that reads "is_pole_edge" field instead of checking the flags, only Fortran would do it
566 {
567 if (pole_edges) {
568 if (!mesh.edges().has_field("is_pole_edge")) {
569 mesh.edges().add(
570 Field("is_pole_edge", array::make_datatype<int>(), array::make_shape(mesh.edges().size())));
571 }
572 auto edge_flags = array::make_view<int, 1>(mesh.edges().flags());
573 auto is_pole_edge = array::make_view<int, 1>(mesh.edges().field("is_pole_edge"));
574 int nb_edges = mesh.edges().size();
575 for (int jedge = 0; jedge < nb_edges; ++jedge) {
576 is_pole_edge(jedge) = Topology::check(edge_flags(jedge), Topology::POLE);
577 }
578 }
579 }
580 }
581
582 void build_pole_edges(Mesh&) {
583 ATLAS_TRACE();
584 Log::info() << "ATLAS_WARNING: Deprecation warning: build_pole_edges is no longer required.\n"
585 << "It is automatically inferred within atlas_build_edges" << std::endl;
586 Log::info() << "The 'build_pole_edges' function will be removed in a future version" << std::endl;
587 }
588
589 //----------------------------------------------------------------------------------------------------------------------
590 // C wrapper interfaces to C++ routines
591
592 extern "C" {
593 void atlas__build_edges(Mesh::Implementation* mesh) {
594 ATLAS_ASSERT(mesh != nullptr, "Cannot access uninitialised atlas_Mesh");
595 Mesh m(mesh);
596 build_edges(m);
597 }
598 void atlas__build_pole_edges(Mesh::Implementation*) {
599 Log::info() << "ATLAS_WARNING: Deprecation warning: atlas_build_pole_edges is no longer required.\n"
600 << "It is automatically inferred within atlas_build_edges" << std::endl;
601 Log::info() << "The 'atlas_build_pole_edges' function will be removed in a future version" << std::endl;
602 }
603 void atlas__build_node_to_edge_connectivity(Mesh::Implementation* mesh) {
604 ATLAS_ASSERT(mesh != nullptr, "Cannot access uninitialised atlas_Mesh");
605 Mesh m(mesh);
606 build_node_to_edge_connectivity(m);
607 }
608 }
609
610 //----------------------------------------------------------------------------------------------------------------------
611
612 } // namespace actions
613 } // namespace mesh
614 } // namespace atlas