Line data Source code
1 : //* This file is part of the MOOSE framework
2 : //* https://mooseframework.inl.gov
3 : //*
4 : //* All rights reserved, see COPYRIGHT for full restrictions
5 : //* https://github.com/idaholab/moose/blob/master/COPYRIGHT
6 : //*
7 : //* Licensed under LGPL 2.1, please see LICENSE for details
8 : //* https://www.gnu.org/licenses/lgpl-2.1.html
9 :
10 : // MOOSE includes
11 : #include "MooseMeshUtils.h"
12 :
13 : #include "libmesh/elem.h"
14 : #include "libmesh/boundary_info.h"
15 : #include "libmesh/id_types.h"
16 : #include "libmesh/int_range.h"
17 : #include "libmesh/parallel.h"
18 : #include "libmesh/parallel_algebra.h"
19 : #include "libmesh/utility.h"
20 :
21 : #include "libmesh/distributed_mesh.h"
22 : #include "libmesh/parallel_elem.h"
23 : #include "libmesh/parallel_node.h"
24 : #include "libmesh/compare_elems_by_level.h"
25 : #include "libmesh/mesh_communication.h"
26 : #include "libmesh/edge_edge3.h"
27 : #include "libmesh/enum_to_string.h"
28 : #include "libmesh/unstructured_mesh.h"
29 :
30 : #include "timpi/parallel_sync.h"
31 :
32 : using namespace libMesh;
33 :
34 : namespace MooseMeshUtils
35 : {
36 :
37 : void
38 410 : mergeBoundaryIDsWithSameName(MeshBase & mesh)
39 : {
40 : // We check if we have the same boundary name with different IDs. If we do, we assign the
41 : // first ID to every occurrence.
42 410 : const auto & side_bd_name_map = mesh.get_boundary_info().get_sideset_name_map();
43 410 : const auto & node_bd_name_map = mesh.get_boundary_info().get_nodeset_name_map();
44 410 : std::map<boundary_id_type, boundary_id_type> same_name_ids;
45 :
46 820 : auto populate_map = [](const std::map<boundary_id_type, std::string> & map,
47 : std::map<boundary_id_type, boundary_id_type> & same_ids)
48 : {
49 4036 : for (const auto & pair_outer : map)
50 26256 : for (const auto & pair_inner : map)
51 : // The last condition is needed to make sure we only store one combination
52 24240 : if (pair_outer.second == pair_inner.second && pair_outer.first != pair_inner.first &&
53 24240 : same_ids.find(pair_inner.first) == same_ids.end())
54 600 : same_ids[pair_outer.first] = pair_inner.first;
55 820 : };
56 :
57 410 : populate_map(side_bd_name_map, same_name_ids);
58 410 : populate_map(node_bd_name_map, same_name_ids);
59 :
60 742 : for (const auto & [id1, id2] : same_name_ids)
61 332 : mesh.get_boundary_info().renumber_id(id2, id1);
62 410 : }
63 :
64 : void
65 508 : changeBoundaryId(MeshBase & mesh,
66 : const boundary_id_type old_id,
67 : const boundary_id_type new_id,
68 : bool delete_prev)
69 : {
70 : // Get a reference to our BoundaryInfo object, we will use it several times below...
71 508 : BoundaryInfo & boundary_info = mesh.get_boundary_info();
72 :
73 : // Container to catch ids passed back from BoundaryInfo
74 508 : std::vector<boundary_id_type> old_ids;
75 :
76 : // Only level-0 elements store BCs. Loop over them.
77 562116 : for (auto & elem : as_range(mesh.level_elements_begin(0), mesh.level_elements_end(0)))
78 : {
79 280804 : unsigned int n_sides = elem->n_sides();
80 1930316 : for (const auto s : make_range(n_sides))
81 : {
82 1649512 : boundary_info.boundary_ids(elem, s, old_ids);
83 1649512 : if (std::find(old_ids.begin(), old_ids.end(), old_id) != old_ids.end())
84 : {
85 16581 : std::vector<boundary_id_type> new_ids(old_ids);
86 16581 : std::replace(new_ids.begin(), new_ids.end(), old_id, new_id);
87 16581 : if (delete_prev)
88 : {
89 15585 : boundary_info.remove_side(elem, s);
90 15585 : boundary_info.add_side(elem, s, new_ids);
91 : }
92 : else
93 996 : boundary_info.add_side(elem, s, new_ids);
94 16581 : }
95 : }
96 508 : }
97 :
98 : // Remove any remaining references to the old ID from the
99 : // BoundaryInfo object. This prevents things like empty sidesets
100 : // from showing up when printing information, etc.
101 508 : if (delete_prev)
102 399 : boundary_info.remove_id(old_id);
103 :
104 : // global information may now be out of sync
105 508 : mesh.unset_is_prepared();
106 508 : }
107 :
108 : std::vector<boundary_id_type>
109 9968 : getBoundaryIDs(const MeshBase & mesh,
110 : const std::vector<BoundaryName> & boundary_name,
111 : bool generate_unknown)
112 : {
113 : return getBoundaryIDs(
114 9968 : mesh, boundary_name, generate_unknown, mesh.get_boundary_info().get_boundary_ids());
115 : }
116 :
117 : std::vector<boundary_id_type>
118 125650 : getBoundaryIDs(const MeshBase & mesh,
119 : const std::vector<BoundaryName> & boundary_name,
120 : bool generate_unknown,
121 : const std::set<BoundaryID> & mesh_boundary_ids)
122 : {
123 125650 : const BoundaryInfo & boundary_info = mesh.get_boundary_info();
124 125650 : const std::map<BoundaryID, std::string> & sideset_map = boundary_info.get_sideset_name_map();
125 125650 : const std::map<BoundaryID, std::string> & nodeset_map = boundary_info.get_nodeset_name_map();
126 :
127 125650 : BoundaryID max_boundary_local_id = 0;
128 : /* It is required to generate a new ID for a given name. It is used often in mesh modifiers such
129 : * as SideSetsBetweenSubdomains. Then we need to check the current boundary ids since they are
130 : * changing during "mesh modify()", and figure out the right max boundary ID. Most of mesh
131 : * modifiers are running in serial, and we won't involve a global communication.
132 : */
133 125650 : if (generate_unknown)
134 : {
135 120580 : const auto & bids = mesh.is_prepared() ? mesh.get_boundary_info().get_global_boundary_ids()
136 1002 : : mesh.get_boundary_info().get_boundary_ids();
137 120580 : max_boundary_local_id = bids.empty() ? 0 : *(bids.rbegin());
138 : /* We should not hit this often */
139 120580 : if (!mesh.is_prepared() && !mesh.is_serial())
140 93 : mesh.comm().max(max_boundary_local_id);
141 : }
142 :
143 125650 : BoundaryID max_boundary_id = mesh_boundary_ids.empty() ? 0 : *(mesh_boundary_ids.rbegin());
144 :
145 125650 : max_boundary_id =
146 125650 : max_boundary_id > max_boundary_local_id ? max_boundary_id : max_boundary_local_id;
147 :
148 125650 : std::vector<BoundaryID> ids(boundary_name.size());
149 282721 : for (const auto i : index_range(boundary_name))
150 : {
151 157187 : if (boundary_name[i] == "ANY_BOUNDARY_ID")
152 : {
153 116 : ids.assign(mesh_boundary_ids.begin(), mesh_boundary_ids.end());
154 116 : if (i)
155 0 : mooseWarning("You passed \"ANY_BOUNDARY_ID\" in addition to other boundary_names. This "
156 : "may be a logic error.");
157 116 : break;
158 : }
159 :
160 157071 : if (boundary_name[i].empty() && !generate_unknown)
161 0 : mooseError("Incoming boundary name is empty and we are not generating unknown boundary IDs. "
162 : "This is invalid.");
163 :
164 : BoundaryID id;
165 :
166 157071 : if (boundary_name[i].empty() || !MooseUtils::isDigits(boundary_name[i]))
167 : {
168 : /**
169 : * If the conversion from a name to a number fails, that means that this must be a named
170 : * boundary. We will look in the complete map for this sideset and create a new name/ID pair
171 : * if requested.
172 : */
173 306354 : if (generate_unknown &&
174 220460 : !MooseUtils::doesMapContainValue(sideset_map, std::string(boundary_name[i])) &&
175 114412 : !MooseUtils::doesMapContainValue(nodeset_map, std::string(boundary_name[i])))
176 8146 : id = ++max_boundary_id;
177 : else
178 97902 : id = boundary_info.get_id_by_name(boundary_name[i]);
179 : }
180 : else
181 51023 : id = getIDFromName<BoundaryName, BoundaryID>(boundary_name[i]);
182 :
183 157071 : ids[i] = id;
184 : }
185 :
186 251300 : return ids;
187 0 : }
188 :
189 : std::set<BoundaryID>
190 169 : getBoundaryIDSet(const MeshBase & mesh,
191 : const std::vector<BoundaryName> & boundary_name,
192 : bool generate_unknown)
193 : {
194 169 : auto boundaries = getBoundaryIDs(mesh, boundary_name, generate_unknown);
195 338 : return std::set<BoundaryID>(boundaries.begin(), boundaries.end());
196 169 : }
197 :
198 : std::vector<subdomain_id_type>
199 305902 : getSubdomainIDs(const MeshBase & mesh, const std::vector<SubdomainName> & subdomain_names)
200 : {
201 305902 : std::vector<subdomain_id_type> ids;
202 :
203 : // shortcut for "ANY_BLOCK_ID"
204 305902 : if (subdomain_names.size() == 1 && subdomain_names[0] == "ANY_BLOCK_ID")
205 : {
206 : // since get_mesh_subdomains() requires a prepared mesh, we need to check that here
207 : mooseAssert(mesh.is_prepared(),
208 : "getSubdomainIDs() should only be called on a prepared mesh if ANY_BLOCK_ID is "
209 : "used to query all block IDs");
210 60009 : ids.assign(mesh.get_mesh_subdomains().begin(), mesh.get_mesh_subdomains().end());
211 60009 : return ids;
212 : }
213 :
214 : // loop through subdomain names and get IDs (this preserves the order of subdomain_names)
215 245893 : ids.resize(subdomain_names.size());
216 365167 : for (auto i : index_range(subdomain_names))
217 : {
218 119274 : if (subdomain_names[i] == "ANY_BLOCK_ID")
219 0 : mooseError("getSubdomainIDs() accepts \"ANY_BLOCK_ID\" if and only if it is the only "
220 : "subdomain name being queried.");
221 119274 : ids[i] = MooseMeshUtils::getSubdomainID(subdomain_names[i], mesh);
222 : }
223 :
224 245893 : return ids;
225 0 : }
226 :
227 : std::set<subdomain_id_type>
228 0 : getSubdomainIDs(const MeshBase & mesh, const std::set<SubdomainName> & subdomain_names)
229 : {
230 : const auto blk_ids = getSubdomainIDs(
231 0 : mesh, std::vector<SubdomainName>(subdomain_names.begin(), subdomain_names.end()));
232 0 : return {blk_ids.begin(), blk_ids.end()};
233 0 : }
234 :
235 : BoundaryID
236 373702 : getBoundaryID(const BoundaryName & boundary_name, const MeshBase & mesh)
237 : {
238 373702 : BoundaryID id = Moose::INVALID_BOUNDARY_ID;
239 373702 : if (boundary_name.empty())
240 0 : return id;
241 :
242 373702 : if (!MooseUtils::isDigits(boundary_name))
243 195269 : id = mesh.get_boundary_info().get_id_by_name(boundary_name);
244 : else
245 178433 : id = getIDFromName<BoundaryName, BoundaryID>(boundary_name);
246 :
247 373699 : return id;
248 : }
249 :
250 : SubdomainID
251 482715 : getSubdomainID(const SubdomainName & subdomain_name, const MeshBase & mesh)
252 : {
253 482715 : if (subdomain_name == "ANY_BLOCK_ID")
254 0 : mooseError("getSubdomainID() does not work with \"ANY_BLOCK_ID\"");
255 :
256 482715 : SubdomainID id = Moose::INVALID_BLOCK_ID;
257 482715 : if (subdomain_name.empty())
258 0 : return id;
259 :
260 482715 : if (!MooseUtils::isDigits(subdomain_name))
261 208078 : id = mesh.get_id_by_name(subdomain_name);
262 : else
263 274637 : id = getIDFromName<SubdomainName, SubdomainID>(subdomain_name);
264 :
265 482715 : return id;
266 : }
267 :
268 : void
269 0 : changeSubdomainId(MeshBase & mesh, const subdomain_id_type old_id, const subdomain_id_type new_id)
270 : {
271 0 : for (const auto & elem : mesh.element_ptr_range())
272 0 : if (elem->subdomain_id() == old_id)
273 0 : elem->subdomain_id() = new_id;
274 :
275 : // global cached information may now be out of sync
276 0 : mesh.unset_is_prepared();
277 0 : }
278 :
279 : Point
280 922 : meshCentroidCalculator(const MeshBase & mesh)
281 : {
282 922 : Point centroid_pt = Point(0.0, 0.0, 0.0);
283 922 : Real vol_tmp = 0.0;
284 19798 : for (const auto & elem : mesh.active_local_element_ptr_range())
285 : {
286 18876 : Real elem_vol = elem->volume();
287 18876 : centroid_pt += (elem->true_centroid()) * elem_vol;
288 18876 : vol_tmp += elem_vol;
289 922 : }
290 922 : mesh.comm().sum(centroid_pt);
291 922 : mesh.comm().sum(vol_tmp);
292 922 : centroid_pt /= vol_tmp;
293 1844 : return centroid_pt;
294 : }
295 :
296 : Point
297 152 : boundaryCentroidCalculator(const BoundaryName & boundary, MeshBase & mesh)
298 : {
299 : // Need boundaries to be synchronized
300 152 : if (!mesh.preparation().has_boundary_id_sets)
301 152 : mesh.get_boundary_info().synchronize_global_id_set();
302 152 : BoundaryInfo & mesh_boundary_info = mesh.get_boundary_info();
303 152 : boundary_id_type boundary_id = mesh_boundary_info.get_id_by_name(boundary);
304 152 : const auto side_list = mesh_boundary_info.build_side_list();
305 :
306 : // Initialize sums
307 152 : Real volume_sum = 0;
308 152 : Point volume_weighted_centroid_sum(0, 0, 0);
309 :
310 1208 : for (const auto & [eid, side_i, bid] : side_list)
311 : {
312 1056 : if (bid != boundary_id)
313 672 : continue;
314 :
315 : // Get the side
316 384 : const auto elem = mesh.elem_ptr(eid);
317 384 : const auto side = elem->side_ptr(side_i);
318 :
319 384 : volume_sum += side->volume();
320 384 : volume_weighted_centroid_sum += side->volume() * side->true_centroid();
321 384 : }
322 : // Sum across processes
323 152 : mesh.comm().sum(volume_weighted_centroid_sum);
324 152 : mesh.comm().sum(volume_sum);
325 :
326 304 : return volume_weighted_centroid_sum / volume_sum;
327 152 : }
328 :
329 : RealVectorValue
330 20 : boundaryWeightedNormal(const BoundaryName & boundary, MeshBase & mesh)
331 : {
332 : // Need boundaries to be synchronized
333 20 : if (!mesh.preparation().has_boundary_id_sets)
334 0 : mesh.get_boundary_info().synchronize_global_id_set();
335 20 : BoundaryInfo & mesh_boundary_info = mesh.get_boundary_info();
336 20 : boundary_id_type boundary_id = mesh_boundary_info.get_id_by_name(boundary);
337 20 : const auto side_list = mesh_boundary_info.build_side_list();
338 :
339 : // Initialize sums
340 20 : Real volume_sum = 0;
341 20 : RealVectorValue volume_weighted_normal_sum(0, 0, 0);
342 :
343 180 : for (const auto & [eid, side_i, bid] : side_list)
344 : {
345 160 : if (bid != boundary_id)
346 120 : continue;
347 :
348 : // Get the side
349 40 : const auto elem = mesh.elem_ptr(eid);
350 40 : const auto side = elem->side_ptr(side_i);
351 :
352 40 : volume_sum += side->volume();
353 40 : volume_weighted_normal_sum += side->volume() * elem->side_vertex_average_normal(side_i);
354 40 : }
355 : // Sum across processes
356 20 : mesh.comm().sum(volume_weighted_normal_sum);
357 20 : mesh.comm().sum(volume_sum);
358 :
359 40 : return volume_weighted_normal_sum / volume_sum;
360 20 : }
361 :
362 : Real
363 40 : computeMaxDistanceToAxis(const MeshBase & mesh,
364 : const Point & origin,
365 : const RealVectorValue & direction)
366 : {
367 40 : Real distance = 0;
368 : mooseAssert(MooseUtils::absoluteFuzzyEqual(direction.norm_sq(), 1),
369 : "Direction should be normalized");
370 1384 : for (const auto & node : mesh.node_ptr_range())
371 672 : if (const auto dist_node = (*node - origin).cross(direction).norm(); dist_node > distance)
372 94 : distance = dist_node;
373 40 : mesh.comm().max(distance);
374 40 : return distance;
375 : }
376 :
377 : std::unordered_map<dof_id_type, dof_id_type>
378 476 : getExtraIDUniqueCombinationMap(const MeshBase & mesh,
379 : const std::set<SubdomainID> & block_ids,
380 : std::vector<ExtraElementIDName> extra_ids)
381 : {
382 : // check block restriction
383 476 : const bool block_restricted = !block_ids.empty();
384 : // get element id name of interest in recursive parsing algorithm
385 476 : ExtraElementIDName id_name = extra_ids.back();
386 476 : extra_ids.pop_back();
387 476 : const auto id_index = mesh.get_elem_integer_index(id_name);
388 :
389 : // create base parsed id set
390 476 : if (extra_ids.empty())
391 : {
392 : // get set of extra id values;
393 278 : std::vector<dof_id_type> ids;
394 : {
395 278 : std::set<dof_id_type> ids_set;
396 1129933 : for (const auto & elem : mesh.active_element_ptr_range())
397 : {
398 1129655 : if (block_restricted && block_ids.find(elem->subdomain_id()) == block_ids.end())
399 520 : continue;
400 1129135 : const auto id = elem->get_extra_integer(id_index);
401 1129135 : ids_set.insert(id);
402 278 : }
403 278 : mesh.comm().set_union(ids_set);
404 278 : ids.assign(ids_set.begin(), ids_set.end());
405 278 : }
406 :
407 : // determine new extra id values;
408 278 : std::unordered_map<dof_id_type, dof_id_type> parsed_ids;
409 1129933 : for (auto & elem : mesh.active_element_ptr_range())
410 : {
411 1129655 : if (block_restricted && block_ids.find(elem->subdomain_id()) == block_ids.end())
412 520 : continue;
413 2258270 : parsed_ids[elem->id()] = std::distance(
414 2258270 : ids.begin(), std::lower_bound(ids.begin(), ids.end(), elem->get_extra_integer(id_index)));
415 278 : }
416 278 : return parsed_ids;
417 278 : }
418 :
419 : // if extra_ids is not empty, recursively call getExtraIDUniqueCombinationMap
420 : const auto base_parsed_ids =
421 198 : MooseMeshUtils::getExtraIDUniqueCombinationMap(mesh, block_ids, extra_ids);
422 : // parsing extra ids based on ref_parsed_ids
423 198 : std::vector<std::pair<dof_id_type, dof_id_type>> unique_ids;
424 : {
425 198 : std::set<std::pair<dof_id_type, dof_id_type>> unique_ids_set;
426 870470 : for (const auto & elem : mesh.active_element_ptr_range())
427 : {
428 870272 : if (block_restricted && block_ids.find(elem->subdomain_id()) == block_ids.end())
429 480 : continue;
430 869792 : const dof_id_type id1 = libmesh_map_find(base_parsed_ids, elem->id());
431 869792 : const dof_id_type id2 = elem->get_extra_integer(id_index);
432 869792 : const std::pair<dof_id_type, dof_id_type> ids = std::make_pair(id1, id2);
433 869792 : unique_ids_set.insert(ids);
434 198 : }
435 198 : mesh.comm().set_union(unique_ids_set);
436 198 : unique_ids.assign(unique_ids_set.begin(), unique_ids_set.end());
437 198 : }
438 :
439 198 : std::unordered_map<dof_id_type, dof_id_type> parsed_ids;
440 :
441 870470 : for (const auto & elem : mesh.active_element_ptr_range())
442 : {
443 870272 : if (block_restricted && block_ids.find(elem->subdomain_id()) == block_ids.end())
444 480 : continue;
445 869792 : const dof_id_type id1 = libmesh_map_find(base_parsed_ids, elem->id());
446 869792 : const dof_id_type id2 = elem->get_extra_integer(id_index);
447 869792 : const dof_id_type new_id = std::distance(
448 : unique_ids.begin(),
449 869792 : std::lower_bound(unique_ids.begin(), unique_ids.end(), std::make_pair(id1, id2)));
450 869792 : parsed_ids[elem->id()] = new_id;
451 198 : }
452 :
453 198 : return parsed_ids;
454 476 : }
455 :
456 : bool
457 9372 : isCoPlanar(const std::vector<Point> & vec_pts, const Point plane_nvec, const Point fixed_pt)
458 : {
459 38888 : for (const auto & pt : vec_pts)
460 38543 : if (!MooseUtils::absoluteFuzzyEqual((pt - fixed_pt) * plane_nvec, 0.0))
461 9027 : return false;
462 345 : return true;
463 : }
464 :
465 : bool
466 9104 : isCoPlanar(const std::vector<Point> & vec_pts, const Point plane_nvec)
467 : {
468 9104 : return isCoPlanar(vec_pts, plane_nvec, vec_pts.front());
469 : }
470 :
471 : bool
472 9104 : isCoPlanar(const std::vector<Point> & vec_pts)
473 : {
474 : // Assuming that overlapped Points are allowed, the Points that are overlapped with vec_pts[0] are
475 : // removed before further calculation.
476 18208 : std::vector<Point> vec_pts_nonzero{vec_pts[0]};
477 81936 : for (const auto i : index_range(vec_pts))
478 72832 : if (!MooseUtils::absoluteFuzzyEqual((vec_pts[i] - vec_pts[0]).norm(), 0.0))
479 36332 : vec_pts_nonzero.push_back(vec_pts[i]);
480 : // 3 or fewer points are always coplanar
481 9104 : if (vec_pts_nonzero.size() <= 3)
482 0 : return true;
483 : else
484 : {
485 18228 : for (const auto i : make_range(vec_pts_nonzero.size() - 1))
486 : {
487 18228 : const Point tmp_pt = (vec_pts_nonzero[i] - vec_pts_nonzero[0])
488 18228 : .cross(vec_pts_nonzero[i + 1] - vec_pts_nonzero[0]);
489 : // if the three points are not collinear, use cross product as the normal vector of the plane
490 18228 : if (!MooseUtils::absoluteFuzzyEqual(tmp_pt.norm(), 0.0))
491 9104 : return isCoPlanar(vec_pts_nonzero, tmp_pt.unit());
492 : }
493 : }
494 : // If all the points are collinear, they are also coplanar
495 0 : return true;
496 9104 : }
497 :
498 : SubdomainID
499 2187 : getNextFreeSubdomainID(MeshBase & input_mesh)
500 : {
501 : // Call this to get most up to date block id information
502 2187 : input_mesh.cache_elem_data();
503 :
504 2187 : std::set<SubdomainID> preexisting_subdomain_ids;
505 2187 : input_mesh.subdomain_ids(preexisting_subdomain_ids);
506 2187 : if (preexisting_subdomain_ids.empty())
507 0 : return 0;
508 : else
509 : {
510 : const auto highest_subdomain_id =
511 2187 : *std::max_element(preexisting_subdomain_ids.begin(), preexisting_subdomain_ids.end());
512 : mooseAssert(highest_subdomain_id < std::numeric_limits<SubdomainID>::max(),
513 : "A SubdomainID with max possible value was found");
514 2187 : return highest_subdomain_id + 1;
515 : }
516 2187 : }
517 :
518 : BoundaryID
519 1342 : getNextFreeBoundaryID(MeshBase & input_mesh)
520 : {
521 1342 : if (!input_mesh.preparation().has_boundary_id_sets)
522 345 : input_mesh.get_boundary_info().regenerate_id_sets();
523 :
524 1342 : auto boundary_ids = input_mesh.get_boundary_info().get_boundary_ids();
525 1342 : if (boundary_ids.empty())
526 406 : return 0;
527 936 : return (*boundary_ids.rbegin() + 1);
528 1342 : }
529 :
530 : bool
531 16101 : hasSubdomainID(const MeshBase & input_mesh, const SubdomainID & id)
532 : {
533 16101 : std::set<SubdomainID> mesh_blocks;
534 16101 : input_mesh.subdomain_ids(mesh_blocks);
535 :
536 : // On a distributed mesh we may have sideset IDs that only exist on
537 : // other processors
538 16101 : if (!input_mesh.is_replicated())
539 2164 : input_mesh.comm().set_union(mesh_blocks);
540 :
541 32202 : return mesh_blocks.count(id) && (id != Moose::INVALID_BLOCK_ID);
542 16101 : }
543 :
544 : bool
545 13683 : hasSubdomainName(const MeshBase & input_mesh, const SubdomainName & name)
546 : {
547 13683 : const auto id = getSubdomainID(name, input_mesh);
548 27366 : return hasSubdomainID(input_mesh, id);
549 : }
550 :
551 : bool
552 7776 : hasBoundaryID(const MeshBase & input_mesh, const BoundaryID id)
553 : {
554 7776 : const BoundaryInfo & boundary_info = input_mesh.get_boundary_info();
555 7776 : std::set<boundary_id_type> boundary_ids = boundary_info.get_boundary_ids();
556 :
557 : // On a distributed mesh we may have boundary IDs that only exist on
558 : // other processors
559 7776 : if (!input_mesh.is_replicated())
560 1054 : input_mesh.comm().set_union(boundary_ids);
561 :
562 15552 : return boundary_ids.count(id) && (id != Moose::INVALID_BOUNDARY_ID);
563 7776 : }
564 :
565 : bool
566 7633 : hasBoundaryName(const MeshBase & input_mesh, const BoundaryName & name)
567 : {
568 7633 : const auto id = getBoundaryID(name, input_mesh);
569 7633 : return hasBoundaryID(input_mesh, id);
570 : }
571 :
572 : void
573 436 : makeOrderedNodeList(std::vector<std::pair<dof_id_type, dof_id_type>> & node_assm,
574 : std::vector<dof_id_type> & elem_id_list,
575 : std::vector<dof_id_type> & midpoint_node_list,
576 : std::vector<dof_id_type> & ordered_node_list,
577 : std::vector<dof_id_type> & ordered_elem_id_list)
578 : {
579 : // a flag to indicate if the ordered_node_list has been reversed
580 436 : bool is_flipped = false;
581 : // Start from the first element, try to find a chain of nodes
582 : mooseAssert(node_assm.size(), "Node list must not be empty");
583 436 : ordered_node_list.push_back(node_assm.front().first);
584 436 : if (midpoint_node_list.front() != DofObject::invalid_id)
585 0 : ordered_node_list.push_back(midpoint_node_list.front());
586 436 : ordered_node_list.push_back(node_assm.front().second);
587 436 : ordered_elem_id_list.push_back(elem_id_list.front());
588 : // Remove the element that has just been added to ordered_node_list
589 436 : node_assm.erase(node_assm.begin());
590 436 : midpoint_node_list.erase(midpoint_node_list.begin());
591 436 : elem_id_list.erase(elem_id_list.begin());
592 436 : const unsigned int node_assm_size_0 = node_assm.size();
593 2521 : for (unsigned int i = 0; i < node_assm_size_0; i++)
594 : {
595 : // Find nodes to expand the chain
596 2088 : dof_id_type end_node_id = ordered_node_list.back();
597 6994 : auto isMatch1 = [end_node_id](std::pair<dof_id_type, dof_id_type> old_id_pair)
598 6994 : { return old_id_pair.first == end_node_id; };
599 1894 : auto isMatch2 = [end_node_id](std::pair<dof_id_type, dof_id_type> old_id_pair)
600 1894 : { return old_id_pair.second == end_node_id; };
601 2088 : auto result = std::find_if(node_assm.begin(), node_assm.end(), isMatch1);
602 : bool match_first;
603 2088 : if (result == node_assm.end())
604 : {
605 1070 : match_first = false;
606 1070 : result = std::find_if(node_assm.begin(), node_assm.end(), isMatch2);
607 : }
608 : else
609 : {
610 1018 : match_first = true;
611 : }
612 : // If found, add the node to boundary_ordered_node_list
613 2088 : if (result != node_assm.end())
614 : {
615 1861 : const auto elem_index = std::distance(node_assm.begin(), result);
616 1861 : if (midpoint_node_list[elem_index] != DofObject::invalid_id)
617 0 : ordered_node_list.push_back(midpoint_node_list[elem_index]);
618 1861 : ordered_node_list.push_back(match_first ? (*result).second : (*result).first);
619 1861 : node_assm.erase(result);
620 1861 : midpoint_node_list.erase(midpoint_node_list.begin() + elem_index);
621 1861 : ordered_elem_id_list.push_back(elem_id_list[elem_index]);
622 1861 : elem_id_list.erase(elem_id_list.begin() + elem_index);
623 : }
624 : // If there are still elements in node_assm and result ==
625 : // node_assm.end(), this means the curve is not a loop, the
626 : // ordered_node_list is flipped and try the other direction that has not
627 : // been examined yet.
628 : else
629 : {
630 227 : if (is_flipped)
631 : // Flipped twice; this means the node list has at least two segments.
632 3 : throw MooseException("The node list provided has more than one segments.");
633 :
634 : // mark the first flip event.
635 224 : is_flipped = true;
636 224 : std::reverse(ordered_node_list.begin(), ordered_node_list.end());
637 224 : std::reverse(midpoint_node_list.begin(), midpoint_node_list.end());
638 224 : std::reverse(ordered_elem_id_list.begin(), ordered_elem_id_list.end());
639 : // As this iteration is wasted, set the iterator backward
640 224 : i--;
641 : }
642 : }
643 433 : }
644 :
645 : void
646 208 : makeOrderedNodeList(std::vector<std::pair<dof_id_type, dof_id_type>> & node_assm,
647 : std::vector<dof_id_type> & elem_id_list,
648 : std::vector<dof_id_type> & ordered_node_list,
649 : std::vector<dof_id_type> & ordered_elem_id_list)
650 : {
651 208 : std::vector<dof_id_type> dummy_midpoint_node_list(node_assm.size(), DofObject::invalid_id);
652 208 : makeOrderedNodeList(
653 : node_assm, elem_id_list, dummy_midpoint_node_list, ordered_node_list, ordered_elem_id_list);
654 208 : }
655 :
656 : void
657 8160 : swapNodesInElem(Elem & elem, const unsigned int nd1, const unsigned int nd2)
658 : {
659 8160 : Node * n_temp = elem.node_ptr(nd1);
660 8160 : elem.set_node(nd1, elem.node_ptr(nd2));
661 8160 : elem.set_node(nd2, n_temp);
662 8160 : }
663 :
664 : void
665 394 : extraElemIntegerSwapParametersProcessor(
666 : const std::string & class_name,
667 : const unsigned int num_sections,
668 : const unsigned int num_integers,
669 : const std::vector<std::vector<std::vector<dof_id_type>>> & elem_integers_swaps,
670 : std::vector<std::unordered_map<dof_id_type, dof_id_type>> & elem_integers_swap_pairs)
671 : {
672 394 : elem_integers_swap_pairs.reserve(num_sections * num_integers);
673 418 : for (const auto i : make_range(num_integers))
674 : {
675 24 : const auto & elem_integer_swaps = elem_integers_swaps[i];
676 24 : std::vector<std::unordered_map<dof_id_type, dof_id_type>> elem_integer_swap_pairs;
677 : try
678 : {
679 48 : MooseMeshUtils::idSwapParametersProcessor(class_name,
680 : "elem_integers_swaps",
681 : elem_integer_swaps,
682 : elem_integer_swap_pairs,
683 : i * num_sections);
684 : }
685 0 : catch (const MooseException & e)
686 : {
687 0 : throw MooseException(e.what());
688 0 : }
689 :
690 24 : elem_integers_swap_pairs.insert(elem_integers_swap_pairs.end(),
691 : elem_integer_swap_pairs.begin(),
692 : elem_integer_swap_pairs.end());
693 24 : }
694 394 : }
695 :
696 : std::unique_ptr<ReplicatedMesh>
697 0 : buildBoundaryMesh(const MeshBase & input_mesh, const boundary_id_type boundary_id)
698 : {
699 0 : if (!input_mesh.is_serial())
700 0 : ::mooseError("Input mesh should be serialized for extracting the boundary mesh.\nInput mesh:" +
701 0 : input_mesh.get_info());
702 0 : auto poly_mesh = std::make_unique<ReplicatedMesh>(input_mesh.comm());
703 :
704 0 : auto side_list = input_mesh.get_boundary_info().build_side_list();
705 :
706 0 : std::unordered_map<dof_id_type, dof_id_type> old_new_node_map;
707 0 : for (const auto & [eid, side_i, bid] : side_list)
708 : {
709 0 : if (bid != boundary_id)
710 0 : continue;
711 :
712 : // Get the side
713 0 : const auto elem = input_mesh.elem_ptr(eid);
714 0 : const auto side = elem->side_ptr(side_i);
715 0 : auto side_elem = elem->build_side_ptr(side_i);
716 0 : auto copy = side_elem->build(side_elem->type());
717 :
718 0 : for (const auto i : side_elem->node_index_range())
719 : {
720 0 : auto & n = side_elem->node_ref(i);
721 :
722 0 : if (old_new_node_map.count(n.id()))
723 0 : copy->set_node(i, poly_mesh->node_ptr(old_new_node_map[n.id()]));
724 : else
725 : {
726 0 : Node * node = poly_mesh->add_point(side_elem->point(i));
727 0 : copy->set_node(i, node);
728 0 : old_new_node_map[n.id()] = node->id();
729 : }
730 : }
731 0 : poly_mesh->add_elem(copy.release());
732 0 : }
733 0 : poly_mesh->skip_partitioning(true);
734 0 : poly_mesh->prepare_for_use();
735 0 : if (poly_mesh->n_elem() == 0)
736 0 : mooseError("The input mesh to extract the boundary from does not have a boundary with id ",
737 : boundary_id,
738 : ".\n",
739 : input_mesh);
740 :
741 0 : return poly_mesh;
742 0 : }
743 :
744 : std::unique_ptr<ReplicatedMesh>
745 88 : buildLoopBoundaryOf2DMesh(const MeshBase & input_mesh, const boundary_id_type boundary_id)
746 : {
747 88 : if (!input_mesh.is_serial())
748 0 : ::mooseError(
749 0 : "Input 2D mesh should be serialized for extracting the loop boundary mesh.\nInput mesh:" +
750 0 : input_mesh.get_info());
751 88 : auto edge_mesh = std::make_unique<ReplicatedMesh>(input_mesh.comm());
752 88 : auto side_list = input_mesh.get_boundary_info().build_side_list();
753 88 : std::set<BoundaryInfo::BCTuple> visited;
754 88 : bool already_seen_this_side_tuple = false;
755 88 : BoundaryInfo::BCTuple first_side_visited = {libMesh::invalid_uint, 0, 0};
756 :
757 : // Helps move elem to elem at a given node
758 88 : const auto node_to_elem_map = buildBoundaryNodeToElemMap(input_mesh, boundary_id);
759 : // Helps check if a node is part of a boundary
760 88 : const auto & node_to_bids = input_mesh.get_boundary_info().get_nodeset_map();
761 :
762 : // Traverse from the first side (edge) in the side_list that matches the boundary_id
763 648 : for (const auto & bside : side_list)
764 : {
765 560 : if (std::get<2>(bside) != boundary_id)
766 472 : continue;
767 :
768 : // Check that we are not starting 'another' loop
769 560 : if (bside != first_side_visited)
770 : {
771 560 : if (visited.size() && !visited.count(bside))
772 0 : mooseWarning(
773 0 : "Boundary " + std::to_string(boundary_id) +
774 0 : " is not a (contiguous) loop. Boundary side: (" + Moose::stringify(bside) +
775 0 : ") was not visited after a single pass around the boundary. Boundary sides visited: " +
776 0 : Moose::stringify(visited));
777 560 : else if (visited.empty())
778 88 : first_side_visited = bside;
779 : else
780 472 : continue;
781 : }
782 :
783 : // Form the element to be able to find the side
784 : // These three variables will be updated while traversing the loop boundary
785 88 : const Elem * elem = input_mesh.elem_ptr(std::get<0>(bside));
786 88 : auto current_side = std::get<1>(bside);
787 88 : auto side_elem = elem->build_side_ptr(current_side);
788 :
789 : // 3D elements should not be part of this boundary
790 88 : if (elem->dim() != 2)
791 0 : mooseError(
792 : "Finding the loop boundary of a 2D mesh cannot be done with non-2D elements such as ",
793 : *elem);
794 :
795 : // Start from node 0 of the side (on the boundary), set the next node as the other node
796 : // one that side, and keep going from tht next node
797 88 : bool looped_back = false;
798 88 : const Node * starting_node = side_elem->node_ptr(0);
799 88 : const auto new_mesh_starting_node = edge_mesh->add_point(side_elem->point(0));
800 88 : Node * new_first_node = new_mesh_starting_node;
801 88 : [[maybe_unused]] dof_id_type first_node_index = starting_node->id();
802 88 : dof_id_type second_node_index = input_mesh.node_ptr(side_elem->node_id(1))->id();
803 :
804 648 : while (!looped_back && !already_seen_this_side_tuple)
805 : {
806 560 : if (MooseUtils::absoluteFuzzyEqual(input_mesh.point(second_node_index),
807 1120 : Point(*starting_node)))
808 88 : looped_back = true;
809 :
810 : // Get the opposite node (the next node) and add it to the edge mesh
811 : Node * new_second_node = looped_back
812 560 : ? new_mesh_starting_node
813 472 : : edge_mesh->add_point(input_mesh.point(second_node_index));
814 :
815 : // Add a copy of the edge side element to the mesh
816 560 : side_elem = elem->build_side_ptr(current_side);
817 560 : auto copy = side_elem->build(side_elem->type());
818 560 : copy->set_node(0, new_first_node);
819 560 : copy->set_node(1, new_second_node);
820 560 : edge_mesh->add_elem(copy.release());
821 :
822 : // Make this side as 'visited'
823 : std::tuple<dof_id_type, unsigned short int, boundary_id_type> bc_tuple = {
824 560 : elem->id(), current_side, boundary_id};
825 560 : const auto & visit_iter = visited.insert(bc_tuple);
826 560 : if (!looped_back && !visit_iter.second)
827 0 : already_seen_this_side_tuple = true;
828 :
829 : // Find the next element and side_elem
830 560 : auto & connected_elems = libmesh_map_find(node_to_elem_map, second_node_index);
831 560 : bool found_match = false;
832 560 : const auto current_eid = elem->id();
833 :
834 1032 : for (const auto eid : connected_elems)
835 : {
836 : mooseAssert(!found_match,
837 : "We should only find one node on a connected element on this boundary");
838 856 : if (eid != current_eid)
839 : {
840 : // Update the element (on the input mesh)
841 496 : elem = input_mesh.elem_ptr(eid);
842 :
843 : // Find the side and the opposite node index in that side
844 1032 : for (const auto si : elem->side_index_range())
845 : {
846 : // Check that second node is on the side
847 : const auto local_second_node_index =
848 920 : elem->get_node_index(input_mesh.node_ptr(second_node_index));
849 : // 2 sides should match this
850 920 : if (elem->is_node_on_side(local_second_node_index, si))
851 : {
852 : // Only one side should be on the same boundary (node is connected to two elements)
853 : // Form a bc_tuple and check the list of boundary sides
854 : std::tuple<dof_id_type, unsigned short int, boundary_id_type> side_bc_tuple = {
855 760 : elem->id(), si, boundary_id};
856 :
857 760 : if (std::find(side_list.begin(), side_list.end(), side_bc_tuple) == side_list.end())
858 376 : continue;
859 :
860 : // We are on the right boundary, just need to get the other node
861 768 : for (const auto local_side_node_id : elem->nodes_on_side(si))
862 : {
863 768 : const auto side_node_id = elem->node_id(local_side_node_id);
864 :
865 : // Skip current node (use global index to compare)
866 768 : if (side_node_id == second_node_index)
867 384 : continue;
868 : mooseAssert(side_node_id != first_node_index,
869 : "Somehow looped back in a single element");
870 :
871 384 : current_side = si;
872 384 : second_node_index = side_node_id;
873 384 : found_match = true;
874 384 : break;
875 384 : }
876 : }
877 : // No need to examine more sides
878 544 : if (found_match)
879 384 : break;
880 : }
881 :
882 : // No need to examine more elements
883 496 : if (found_match)
884 384 : break;
885 : }
886 : // next node could be on the same element, just moving on to the next side
887 360 : else if (connected_elems.size() == 1)
888 : {
889 176 : elem = input_mesh.elem_ptr(eid);
890 : const auto local_second_node_index =
891 176 : elem->get_node_index(input_mesh.node_ptr(second_node_index));
892 :
893 : // Move on to the next side
894 416 : for (const auto si : elem->side_index_range())
895 416 : if (si != current_side && elem->is_node_on_side(local_second_node_index, si))
896 : {
897 : // Check all nodes on that next side
898 528 : for (const auto local_side_node_id : elem->nodes_on_side(si))
899 : {
900 352 : const auto side_node_id = elem->node_id(local_side_node_id);
901 : // Skip current node
902 352 : if (side_node_id == second_node_index)
903 176 : continue;
904 : mooseAssert((side_node_id != first_node_index) ||
905 : (side_list.size() == elem->n_sides()),
906 : "Somehow looped back in a single element");
907 :
908 : // Check all the boundaries the other node (on the edge side) is part of
909 176 : const auto bids_range = node_to_bids.equal_range(input_mesh.node_ptr(side_node_id));
910 :
911 352 : for (auto iter = bids_range.first; iter != bids_range.second; iter++)
912 176 : if (iter->second == boundary_id)
913 : {
914 176 : current_side = si;
915 176 : second_node_index = side_node_id;
916 176 : found_match = true;
917 : }
918 176 : }
919 :
920 : // no need to examine other sides
921 176 : if (found_match)
922 176 : break;
923 : }
924 : }
925 : }
926 :
927 : // Set current node to opposite node of new element
928 : // NOTE: do not use new_first_node or new_second_node to search in the input mesh!
929 560 : new_first_node = new_second_node;
930 560 : first_node_index = second_node_index;
931 :
932 : // Handle loop ending criterion
933 560 : if (!found_match)
934 : {
935 0 : mooseWarning("Search for next element in loop boundary failed. Is boundary '" +
936 0 : std::to_string(boundary_id) + "' of mesh ",
937 : input_mesh,
938 : " a loop boundary?");
939 0 : break;
940 : }
941 560 : }
942 88 : }
943 :
944 88 : if (already_seen_this_side_tuple)
945 0 : mooseWarning("Boundary " + std::to_string(boundary_id) +
946 : " seems to have cycles. A single-cycle loop should be used");
947 :
948 88 : edge_mesh->skip_partitioning(true);
949 88 : edge_mesh->prepare_for_use();
950 88 : if (edge_mesh->n_elem() == 0)
951 0 : mooseError("The input mesh to extract the boundary from does not have a boundary with id ",
952 : boundary_id,
953 : "\n",
954 : input_mesh);
955 :
956 176 : return edge_mesh;
957 88 : }
958 :
959 : std::unordered_map<dof_id_type, std::unordered_set<dof_id_type>>
960 88 : buildBoundaryNodeToElemMap(const MeshBase & input_mesh, const boundary_id_type boundary_id)
961 : {
962 88 : if (!input_mesh.is_serial())
963 0 : ::mooseError(
964 0 : "Input 2D mesh should be serialized for extracting the loop boundary mesh.\nInput mesh:" +
965 0 : input_mesh.get_info());
966 :
967 : // Get all nodes on that boundary
968 : // Boundary ID might be a sideset or a nodeset, get nodes regardless
969 88 : const auto particular_node_ids = getBoundaryNodes(input_mesh, boundary_id);
970 :
971 88 : std::unordered_map<dof_id_type, std::unordered_set<dof_id_type>> nid_to_eids_map;
972 : // Fill the map from looping over elements
973 88 : for (const auto & elem :
974 944 : as_range(input_mesh.active_elements_begin(), input_mesh.active_elements_end()))
975 : {
976 1536 : for (const auto & nd : elem->node_ref_range())
977 : {
978 : // Only add the element id if the node is on the boundary
979 1152 : if (!particular_node_ids.count(nd.id()))
980 0 : continue;
981 :
982 1152 : auto & elem_ids = nid_to_eids_map[nd.id()];
983 1152 : elem_ids.insert(elem->id());
984 : }
985 88 : }
986 176 : return nid_to_eids_map;
987 88 : }
988 :
989 : std::set<dof_id_type>
990 88 : getBoundaryNodes(const MeshBase & mesh, const BoundaryID boundary_id)
991 : {
992 88 : std::set<dof_id_type> boundary_node_ids;
993 88 : const BoundaryInfo & boundary_info = mesh.get_boundary_info();
994 :
995 : // Get all nodes from the sideset with ID of boundary_id
996 : const auto & bc_sides =
997 88 : boundary_info.build_side_list(libMesh::BoundaryInfo::BCTupleSortBy::BOUNDARY_ID);
998 648 : for (const auto & [elem_id, side, bc_id] : bc_sides)
999 : {
1000 560 : if (bc_id == boundary_id)
1001 : {
1002 560 : const auto elem = mesh.elem_ptr(elem_id);
1003 1680 : for (const auto ni : elem->nodes_on_side(side))
1004 1680 : boundary_node_ids.insert(elem->node_id(ni));
1005 : }
1006 : }
1007 :
1008 : // Get all nodes from nodeset with ID of boundary_id
1009 88 : const auto & bc_nodes = boundary_info.build_node_list();
1010 648 : for (const auto & [n_id, bc_id] : bc_nodes)
1011 560 : if (bc_id == boundary_id)
1012 560 : boundary_node_ids.insert(n_id);
1013 :
1014 176 : return boundary_node_ids;
1015 88 : }
1016 :
1017 : void
1018 2553 : createSubdomainFromSidesets(MeshBase & mesh,
1019 : std::vector<BoundaryName> boundary_names,
1020 : const SubdomainID new_subdomain_id,
1021 : const SubdomainName new_subdomain_name,
1022 : const std::string type_name)
1023 : {
1024 : // Generate a new block id if one isn't supplied.
1025 2553 : SubdomainID new_block_id = new_subdomain_id;
1026 :
1027 : // Make sure our boundary info and parallel counts are setup
1028 2553 : if (!mesh.is_prepared())
1029 : {
1030 475 : const bool allow_remote_element_removal = mesh.allow_remote_element_removal();
1031 : // We want all of our boundary elements available, so avoid removing them if they haven't
1032 : // already been so
1033 475 : mesh.allow_remote_element_removal(false);
1034 475 : mesh.prepare_for_use();
1035 475 : mesh.allow_remote_element_removal(allow_remote_element_removal);
1036 : }
1037 :
1038 : // Check that the sidesets are present in the mesh
1039 5258 : for (const auto & sideset : boundary_names)
1040 2714 : if (!MooseMeshUtils::hasBoundaryName(mesh, sideset))
1041 9 : mooseException("The sideset '", sideset, "' was not found within the mesh");
1042 :
1043 2544 : auto sideset_ids = MooseMeshUtils::getBoundaryIDs(mesh, boundary_names, true);
1044 2544 : std::set<boundary_id_type> sidesets(sideset_ids.begin(), sideset_ids.end());
1045 2544 : auto side_list = mesh.get_boundary_info().build_side_list();
1046 2544 : if (!mesh.is_serial() && mesh.comm().size() > 1)
1047 : {
1048 10 : std::vector<Elem *> elements_to_send;
1049 10 : unsigned short i_need_boundary_elems = 0;
1050 172 : for (const auto & [elem_id, side, bc_id] : side_list)
1051 : {
1052 162 : libmesh_ignore(side);
1053 162 : if (sidesets.count(bc_id))
1054 : {
1055 : // Whether we have this boundary information through our locally owned element or a ghosted
1056 : // element, we'll need the boundary elements for parallel consistent addition
1057 92 : i_need_boundary_elems = 1;
1058 92 : auto * elem = mesh.elem_ptr(elem_id);
1059 92 : if (elem->processor_id() == mesh.processor_id())
1060 80 : elements_to_send.push_back(elem);
1061 : }
1062 : }
1063 :
1064 : std::set<const Elem *, libMesh::CompareElemIdsByLevel> connected_elements(
1065 10 : elements_to_send.begin(), elements_to_send.end());
1066 10 : std::set<const Node *> connected_nodes;
1067 10 : reconnect_nodes(connected_elements, connected_nodes);
1068 10 : std::set<dof_id_type> connected_node_ids;
1069 178 : for (auto * nd : connected_nodes)
1070 168 : connected_node_ids.insert(nd->id());
1071 :
1072 10 : std::vector<unsigned short> need_boundary_elems(mesh.comm().size());
1073 10 : mesh.comm().allgather(i_need_boundary_elems, need_boundary_elems);
1074 10 : std::unordered_map<processor_id_type, decltype(elements_to_send)> push_element_data;
1075 10 : std::unordered_map<processor_id_type, decltype(connected_nodes)> push_node_data;
1076 :
1077 30 : for (const auto pid : index_range(mesh.comm()))
1078 : // Don't need to send to self
1079 20 : if (pid != mesh.processor_id() && need_boundary_elems[pid])
1080 : {
1081 10 : if (elements_to_send.size())
1082 10 : push_element_data[pid] = elements_to_send;
1083 10 : if (connected_nodes.size())
1084 10 : push_node_data[pid] = connected_nodes;
1085 : }
1086 :
1087 10 : auto node_action_functor = [](processor_id_type, const auto &)
1088 : {
1089 : // Node packing specialization already has unpacked node into mesh, so nothing to do
1090 10 : };
1091 10 : Parallel::push_parallel_packed_range(mesh.comm(), push_node_data, &mesh, node_action_functor);
1092 10 : auto elem_action_functor = [](processor_id_type, const auto &)
1093 : {
1094 : // Elem packing specialization already has unpacked elem into mesh, so nothing to do
1095 10 : };
1096 10 : TIMPI::push_parallel_packed_range(mesh.comm(), push_element_data, &mesh, elem_action_functor);
1097 :
1098 : // now that we've gathered everything, we need to rebuild the side list
1099 10 : side_list = mesh.get_boundary_info().build_side_list();
1100 10 : }
1101 :
1102 2544 : std::vector<std::pair<dof_id_type, ElemSidePair>> element_sides_on_boundary;
1103 2544 : dof_id_type counter = 0;
1104 150766 : for (const auto & [eid, side, bid] : side_list)
1105 148225 : if (sidesets.count(bid))
1106 : {
1107 26609 : if (auto elem = mesh.query_elem_ptr(eid))
1108 : {
1109 26609 : if (!elem->active())
1110 3 : mooseError(
1111 : "Only active, level 0 elements can be made interior parents of new level 0 lower-d "
1112 : "elements. Make sure that ",
1113 : type_name,
1114 : "s are run before any refinement generators");
1115 26606 : element_sides_on_boundary.push_back(std::make_pair(counter, ElemSidePair(elem, side)));
1116 : }
1117 26606 : ++counter;
1118 : }
1119 :
1120 2541 : dof_id_type max_elem_id = mesh.max_elem_id();
1121 2541 : unique_id_type max_unique_id = mesh.parallel_max_unique_id();
1122 :
1123 : // Making an important assumption that at least our boundary elements are the same on all
1124 : // processes even in distributed mesh mode (this is reliant on the correct ghosting functors
1125 : // existing on the mesh)
1126 29147 : for (auto & [i, elem_side] : element_sides_on_boundary)
1127 : {
1128 26606 : Elem * elem = elem_side.elem;
1129 :
1130 26606 : const auto side = elem_side.side;
1131 :
1132 : // Build a non-proxy element from this side.
1133 26606 : std::unique_ptr<Elem> side_elem(elem->build_side_ptr(side));
1134 :
1135 : // The side will be added with the same processor id as the parent.
1136 26606 : side_elem->processor_id() = elem->processor_id();
1137 :
1138 : // Add subdomain ID
1139 26606 : side_elem->subdomain_id() = new_block_id;
1140 :
1141 : // Also assign the side's interior parent, so it is always
1142 : // easy to figure out the Elem we came from.
1143 26606 : side_elem->set_interior_parent(elem);
1144 :
1145 : // Add id
1146 26606 : side_elem->set_id(max_elem_id + i);
1147 26606 : side_elem->set_unique_id(max_unique_id + i);
1148 :
1149 : // Finally, add the lower-dimensional element to the mesh.
1150 26606 : mesh.add_elem(side_elem.release());
1151 26606 : };
1152 :
1153 : // Assign block name, if provided
1154 2541 : if (new_subdomain_name.size())
1155 1407 : mesh.subdomain_name(new_block_id) = new_subdomain_name;
1156 :
1157 2541 : const bool skip_partitioning_old = mesh.skip_partitioning();
1158 2541 : mesh.skip_partitioning(true);
1159 2541 : mesh.prepare_for_use();
1160 2541 : mesh.skip_partitioning(skip_partitioning_old);
1161 2541 : }
1162 :
1163 : void
1164 929 : convertBlockToMesh(MeshBase & source_mesh,
1165 : MeshBase & target_mesh,
1166 : const std::vector<SubdomainName> & target_blocks)
1167 : {
1168 929 : if (!source_mesh.is_replicated())
1169 0 : mooseError("This generator does not support distributed meshes.");
1170 :
1171 929 : const auto target_block_ids = MooseMeshUtils::getSubdomainIDs(source_mesh, target_blocks);
1172 :
1173 : // Check that the block ids/names exist in the mesh
1174 929 : std::set<SubdomainID> mesh_blocks;
1175 929 : source_mesh.subdomain_ids(mesh_blocks);
1176 :
1177 1921 : for (const auto i : index_range(target_block_ids))
1178 992 : if (target_block_ids[i] == Moose::INVALID_BLOCK_ID || !mesh_blocks.count(target_block_ids[i]))
1179 : {
1180 0 : mooseException("The target_block '", target_blocks[i], "' was not found within the mesh.");
1181 : }
1182 :
1183 : // know which nodes have already been inserted, by tracking the old mesh's node's ids'
1184 929 : std::unordered_map<dof_id_type, dof_id_type> old_new_node_map;
1185 :
1186 1906 : for (const auto target_block_id : target_block_ids)
1187 : {
1188 :
1189 17232 : for (auto elem : source_mesh.active_subdomain_elements_ptr_range(target_block_id))
1190 : {
1191 8129 : if (elem->level() != 0)
1192 3 : mooseError("Refined blocks are not supported by this generator. "
1193 : "Can you re-organize mesh generators to refine after converting the block?");
1194 :
1195 : // make a deep copy so that mutiple meshes' destructors don't segfault at program termination
1196 8126 : auto copy = elem->build(elem->type());
1197 :
1198 : // Keep the subdomain id
1199 8126 : copy->subdomain_id() = elem->subdomain_id();
1200 :
1201 : // index of node in the copy element must be managed manually as there is no intelligent
1202 : // insert method
1203 8126 : dof_id_type copy_n_index = 0;
1204 :
1205 : // correctly assign new copies of nodes, loop over nodes
1206 35950 : for (dof_id_type i : elem->node_index_range())
1207 : {
1208 27824 : auto & n = elem->node_ref(i);
1209 :
1210 27824 : if (old_new_node_map.count(n.id()))
1211 : {
1212 : // case where we have already inserted this particular point before
1213 : // then we need to find the already-inserted one and hook it up right
1214 : // to it's respective element
1215 16164 : copy->set_node(copy_n_index++, target_mesh.node_ptr(old_new_node_map[n.id()]));
1216 : }
1217 : else
1218 : {
1219 : // case where we've NEVER inserted this particular point before
1220 : // add them both to the element and the mesh
1221 :
1222 : // Nodes' IDs are their indexes in the nodes' respective mesh
1223 : // If we set them as invalid they are automatically assigned
1224 : // Add to mesh, auto-assigning a new id.
1225 11660 : Node * node = target_mesh.add_point(elem->point(i));
1226 :
1227 : // Add to element copy (manually)
1228 11660 : copy->set_node(copy_n_index++, node);
1229 :
1230 : // remember the (old) ID
1231 11660 : old_new_node_map[n.id()] = node->id();
1232 : }
1233 : }
1234 :
1235 : // it is ok to release the copy element into the mesh because derived meshes class
1236 : // (ReplicatedMesh, DistributedMesh) manage their own elements, will delete them
1237 8126 : target_mesh.add_elem(copy.release());
1238 9103 : }
1239 : }
1240 :
1241 : // Move subdomain names
1242 1900 : for (const auto sbd_id : target_block_ids)
1243 974 : target_mesh.subdomain_name(sbd_id) = source_mesh.subdomain_name(sbd_id);
1244 926 : }
1245 :
1246 : void
1247 1956 : copyIntoMesh(MeshGenerator & mg,
1248 : UnstructuredMesh & destination,
1249 : const UnstructuredMesh & source,
1250 : const bool avoid_merging_subdomains,
1251 : const bool avoid_merging_boundaries,
1252 : const Parallel::Communicator & communicator)
1253 : {
1254 1956 : dof_id_type node_delta = destination.max_node_id();
1255 1956 : dof_id_type elem_delta = destination.max_elem_id();
1256 :
1257 : unique_id_type unique_delta =
1258 : #ifdef LIBMESH_ENABLE_UNIQUE_ID
1259 1956 : destination.parallel_max_unique_id();
1260 : #else
1261 : 0;
1262 : #endif
1263 :
1264 : // Prevent overlaps by offsetting the subdomains in
1265 1956 : std::unordered_map<subdomain_id_type, subdomain_id_type> id_remapping;
1266 1956 : unsigned int block_offset = 0;
1267 1956 : if (avoid_merging_subdomains)
1268 : {
1269 : // Note: if performance becomes an issue, this is overkill for just getting the max node id
1270 132 : std::set<subdomain_id_type> source_ids;
1271 132 : std::set<subdomain_id_type> dest_ids;
1272 :
1273 : // We need source subdomain ids already cached; libMesh will
1274 : // scream otherwise
1275 132 : source.subdomain_ids(source_ids, true);
1276 :
1277 : // Our destination is non-const, so we can fix any missing caches
1278 132 : if (!destination.preparation().has_cached_elem_data)
1279 132 : destination.cache_elem_data();
1280 :
1281 132 : destination.subdomain_ids(dest_ids, true);
1282 :
1283 : mooseAssert(source_ids.size(), "Should have a subdomain");
1284 : mooseAssert(dest_ids.size(), "Should have a subdomain");
1285 132 : unsigned int max_dest_bid = *dest_ids.rbegin();
1286 132 : unsigned int min_source_bid = *source_ids.begin();
1287 132 : communicator.max(max_dest_bid);
1288 132 : communicator.min(min_source_bid);
1289 132 : block_offset = 1 + max_dest_bid - min_source_bid;
1290 264 : for (const auto bid : source_ids)
1291 132 : id_remapping[bid] = block_offset + bid;
1292 132 : }
1293 :
1294 : // Copy mesh data over from the other mesh
1295 1956 : destination.copy_nodes_and_elements(source,
1296 : // Skipping this should cause the neighbors
1297 : // to simply be copied from the other mesh
1298 : // (which makes sense and is way faster)
1299 : /*skip_find_neighbors = */ true,
1300 : elem_delta,
1301 : node_delta,
1302 : unique_delta,
1303 : avoid_merging_subdomains ? &id_remapping : nullptr);
1304 :
1305 : // Get an offset to prevent overlaps / wild merging between boundaries
1306 1956 : BoundaryInfo & boundary = destination.get_boundary_info();
1307 1956 : const BoundaryInfo & other_boundary = source.get_boundary_info();
1308 :
1309 1956 : unsigned int bid_offset = 0;
1310 1956 : if (avoid_merging_boundaries)
1311 : {
1312 162 : const auto boundary_ids = boundary.get_boundary_ids();
1313 162 : const auto other_boundary_ids = other_boundary.get_boundary_ids();
1314 162 : unsigned int max_dest_bid = boundary_ids.size() ? *boundary_ids.rbegin() : 0;
1315 162 : unsigned int min_source_bid = other_boundary_ids.size() ? *other_boundary_ids.begin() : 0;
1316 162 : communicator.max(max_dest_bid);
1317 162 : communicator.min(min_source_bid);
1318 162 : bid_offset = 1 + max_dest_bid - min_source_bid;
1319 162 : }
1320 :
1321 : // Note: the code below originally came from ReplicatedMesh::stitch_mesh_helper()
1322 : // in libMesh replicated_mesh.C around line 1203
1323 :
1324 : // Copy BoundaryInfo from other_mesh too. We do this via the
1325 : // list APIs rather than element-by-element for speed.
1326 54892 : for (const auto & t : other_boundary.build_node_list())
1327 54892 : boundary.add_node(std::get<0>(t) + node_delta, bid_offset + std::get<1>(t));
1328 :
1329 37800 : for (const auto & t : other_boundary.build_side_list())
1330 37800 : boundary.add_side(std::get<0>(t) + elem_delta, std::get<1>(t), bid_offset + std::get<2>(t));
1331 :
1332 1956 : for (const auto & t : other_boundary.build_edge_list())
1333 1956 : boundary.add_edge(std::get<0>(t) + elem_delta, std::get<1>(t), bid_offset + std::get<2>(t));
1334 :
1335 1956 : for (const auto & t : other_boundary.build_shellface_list())
1336 0 : boundary.add_shellface(
1337 1956 : std::get<0>(t) + elem_delta, std::get<1>(t), bid_offset + std::get<2>(t));
1338 :
1339 : // Check for the case with two block ids sharing the same name
1340 1956 : if (avoid_merging_subdomains)
1341 : {
1342 : mooseAssert(mg.parameters().isParamDefined("avoid_merging_subdomains"),
1343 : "Missing parameter in the mesh generator calling this function: "
1344 : "avoid_merging_subdomains. Considering setting avoid_merging_subdomains to true.");
1345 304 : for (const auto & [block_id, block_name] : destination.get_subdomain_name_map())
1346 233 : for (const auto & [source_id, source_name] : source.get_subdomain_name_map())
1347 61 : if (block_name == source_name)
1348 0 : mg.paramWarning(
1349 : "avoid_merging_subdomains",
1350 0 : "Not merging subdomains is creating two subdomains with the same name '" +
1351 0 : block_name + "' but different ids: " + std::to_string(source_id) + " & " +
1352 0 : std::to_string(block_id + block_offset) +
1353 : ".\n We recommend using a RenameBlockGenerator to prevent this as you "
1354 : "will get errors reading the Exodus output later.");
1355 : }
1356 :
1357 2126 : for (const auto & [block_id, block_name] : source.get_subdomain_name_map())
1358 340 : destination.set_subdomain_name_map().insert(
1359 340 : std::make_pair<SubdomainID, SubdomainName>(block_id + block_offset, block_name));
1360 :
1361 : // Check for the case with two boundary ids sharing the same name
1362 1956 : if (avoid_merging_boundaries)
1363 : {
1364 : mooseAssert(mg.parameters().isParamDefined("avoid_merging_boundaries"),
1365 : "Missing parameter in the mesh generator calling this function: "
1366 : "avoid_merging_boundaries. Considering setting avoid_merging_boundaries to true.");
1367 830 : for (const auto & [b_id, b_name] : other_boundary.get_sideset_name_map())
1368 4740 : for (const auto & [source_id, source_name] : boundary.get_sideset_name_map())
1369 4072 : if (b_name == source_name)
1370 0 : mg.paramWarning(
1371 : "avoid_merging_boundaries",
1372 0 : "Not merging boundaries is creating two sidesets with the same name '" + b_name +
1373 0 : "' but different ids: " + std::to_string(source_id) + " & " +
1374 0 : std::to_string(b_id + bid_offset) +
1375 : ".\n We recommend using a RenameBoundaryGenerator to prevent this as you "
1376 : "will get errors reading the Exodus output later.");
1377 830 : for (const auto & [b_id, b_name] : other_boundary.get_nodeset_name_map())
1378 4740 : for (const auto & [source_id, source_name] : boundary.get_nodeset_name_map())
1379 4072 : if (b_name == source_name)
1380 0 : mg.paramWarning(
1381 : "avoid_merging_boundaries",
1382 0 : "Not merging boundaries is creating two nodesets with the same name '" + b_name +
1383 0 : "' but different ids: " + std::to_string(source_id) + " & " +
1384 0 : std::to_string(b_id + bid_offset) +
1385 : ".\n We recommend using a RenameBoundaryGenerator to prevent this as you "
1386 : "will get errors reading the Exodus output later.");
1387 : }
1388 :
1389 8988 : for (const auto & [nodeset_id, nodeset_name] : other_boundary.get_nodeset_name_map())
1390 14064 : boundary.set_nodeset_name_map().insert(
1391 14064 : std::make_pair<BoundaryID, BoundaryName>(nodeset_id + bid_offset, nodeset_name));
1392 :
1393 9248 : for (const auto & [sideset_id, sideset_name] : other_boundary.get_sideset_name_map())
1394 14584 : boundary.set_sideset_name_map().insert(
1395 14584 : std::make_pair<BoundaryID, BoundaryName>(sideset_id + bid_offset, sideset_name));
1396 :
1397 1956 : for (const auto & [edgeset_id, edgeset_name] : other_boundary.get_edgeset_name_map())
1398 0 : boundary.set_edgeset_name_map().insert(
1399 0 : std::make_pair<BoundaryID, BoundaryName>(edgeset_id + bid_offset, edgeset_name));
1400 1956 : }
1401 :
1402 : void
1403 1364 : buildPolyLineMesh(MeshBase & mesh,
1404 : const std::vector<Point> & points,
1405 : const std::vector<Point> & mid_points,
1406 : const bool loop,
1407 : const BoundaryName & start_boundary,
1408 : const BoundaryName & end_boundary,
1409 : const std::vector<unsigned int> & nums_edges_between_points)
1410 : {
1411 : mooseAssert(nums_edges_between_points.size() == 1 ||
1412 : nums_edges_between_points.size() == points.size() - 1 + loop,
1413 : "nums_edges_between_points must be either a single value or have the same number of "
1414 : "entries as segments defined by the points.");
1415 : mooseAssert(
1416 : mid_points.size() == 0 || mid_points.size() == points.size() - (loop ? 0 : 1),
1417 : "mid_points must be either empty or have the consistent number of entries as points.");
1418 : mooseAssert(
1419 : mid_points.size() == 0 ||
1420 : (nums_edges_between_points.size() == 1 && nums_edges_between_points.front() == 1) ||
1421 : (nums_edges_between_points.size() == points.size() - 1 + loop &&
1422 : std::all_of(nums_edges_between_points.begin(),
1423 : nums_edges_between_points.end(),
1424 : [](unsigned int n) { return n == 1; })),
1425 : "mid_points can only be provided if each segment has exactly one edge.");
1426 :
1427 1364 : const auto n_points = points.size();
1428 24256 : for (auto i : make_range(n_points))
1429 : {
1430 : const auto & num_edges_between_points =
1431 22902 : (nums_edges_between_points.size() == 1)
1432 23522 : ? nums_edges_between_points[0]
1433 620 : : (i == nums_edges_between_points.size() ? 0 : nums_edges_between_points[i]);
1434 :
1435 22902 : Point p = points[i];
1436 22902 : const auto pt_counter = (nums_edges_between_points.size() == 1)
1437 23522 : ? i
1438 620 : : std::accumulate(nums_edges_between_points.begin(),
1439 620 : nums_edges_between_points.begin() + i,
1440 22902 : 0);
1441 45184 : mesh.add_point(
1442 45184 : p, nums_edges_between_points.size() == 1 ? (i * num_edges_between_points) : pt_counter);
1443 :
1444 22902 : if (num_edges_between_points > 1)
1445 : {
1446 750 : if (!loop && (i + 1) == n_points)
1447 10 : break;
1448 :
1449 740 : const auto ip1 = (i + 1) % n_points;
1450 740 : const Point pvec = (points[ip1] - p) / num_edges_between_points;
1451 :
1452 1650 : for (auto j : make_range(1u, num_edges_between_points))
1453 : {
1454 910 : p += pvec;
1455 1820 : mesh.add_point(
1456 : p,
1457 910 : (nums_edges_between_points.size() == 1 ? (i * num_edges_between_points) : pt_counter) +
1458 910 : j);
1459 : }
1460 : }
1461 : }
1462 : // Add mid points if applicable. When mid points are provided, each segment has exactly one edge,
1463 : // so the midpoint node ids follow the vertex node ids.
1464 3324 : for (const auto & i : make_range(mid_points.size()))
1465 1960 : mesh.add_point(mid_points[i], n_points + i);
1466 :
1467 1364 : const auto n_segments = loop ? n_points : (n_points - 1);
1468 : const auto n_elem =
1469 1364 : nums_edges_between_points.size() == 1
1470 1472 : ? n_segments * nums_edges_between_points[0]
1471 108 : : std::accumulate(nums_edges_between_points.begin(), nums_edges_between_points.end(), 0);
1472 : const auto max_nodes =
1473 1472 : (nums_edges_between_points.size() == 1 ? n_segments * nums_edges_between_points[0]
1474 108 : : std::accumulate(nums_edges_between_points.begin(),
1475 : nums_edges_between_points.end(),
1476 : 0)) +
1477 1364 : (loop ? 0 : 1);
1478 25127 : for (auto i : make_range(n_elem))
1479 : {
1480 23763 : std::unique_ptr<Elem> elem;
1481 23763 : if (mid_points.size())
1482 : {
1483 1960 : elem = std::make_unique<Edge3>();
1484 1960 : elem->set_node(2, mesh.node_ptr(n_points + i));
1485 : }
1486 : else
1487 21803 : elem = Elem::build(EDGE2);
1488 23763 : const auto ip1 = (i + 1) % max_nodes;
1489 23763 : elem->set_node(0, mesh.node_ptr(i));
1490 23763 : elem->set_node(1, mesh.node_ptr(ip1));
1491 23763 : elem->set_id() = i;
1492 23763 : mesh.add_elem(std::move(elem));
1493 23763 : }
1494 :
1495 1364 : if (!loop)
1496 : {
1497 49 : BoundaryInfo & bi = mesh.get_boundary_info();
1498 196 : std::vector<BoundaryName> bdy_names{start_boundary, end_boundary};
1499 49 : std::vector<boundary_id_type> ids = MooseMeshUtils::getBoundaryIDs(mesh, bdy_names, true);
1500 49 : bi.add_side(mesh.elem_ptr(0), 0, ids[0]);
1501 49 : bi.add_side(mesh.elem_ptr(n_elem - 1), 1, ids[1]);
1502 49 : }
1503 : else
1504 : mooseAssert(start_boundary.empty() && end_boundary.empty(),
1505 : "Cannot assign start/end boundaries on a looped polyline.");
1506 :
1507 1364 : mesh.prepare_for_use();
1508 1413 : }
1509 :
1510 : void
1511 406 : buildPolyLineMesh(MeshBase & mesh,
1512 : const std::vector<Point> & points,
1513 : const bool loop,
1514 : const BoundaryName & start_boundary,
1515 : const BoundaryName & end_boundary,
1516 : const std::vector<unsigned int> & nums_edges_between_points)
1517 : {
1518 406 : buildPolyLineMesh(
1519 : mesh, points, {}, loop, start_boundary, end_boundary, nums_edges_between_points);
1520 406 : }
1521 :
1522 : void
1523 88 : buildPolyLineMesh(MeshBase & mesh,
1524 : const std::vector<Point> & points,
1525 : const bool loop,
1526 : const BoundaryName & start_boundary,
1527 : const BoundaryName & end_boundary,
1528 : const Real max_elem_size)
1529 : {
1530 88 : std::vector<unsigned int> nums_edges_between_points;
1531 88 : const auto n_points = points.size();
1532 648 : for (auto i : make_range(n_points))
1533 : {
1534 560 : if (!loop && (i + 1) == n_points)
1535 0 : break;
1536 :
1537 560 : const auto ip1 = (i + 1) % n_points;
1538 560 : const Real length = (points[ip1] - points[i]).norm();
1539 1120 : const unsigned int n_elems = std::max(
1540 560 : static_cast<unsigned int>(std::ceil(length / max_elem_size)), static_cast<unsigned int>(1));
1541 560 : nums_edges_between_points.push_back(n_elems);
1542 : }
1543 :
1544 88 : buildPolyLineMesh(
1545 : mesh, points, {}, loop, start_boundary, end_boundary, nums_edges_between_points);
1546 88 : }
1547 :
1548 : void
1549 510 : addExternalBoundary(MeshBase & mesh, const BoundaryID extern_bid, bool & has_external_bid)
1550 : {
1551 510 : auto & binfo = mesh.get_boundary_info();
1552 66734 : for (const auto & elem : mesh.active_element_ptr_range())
1553 133368 : for (const auto & i_side : elem->side_index_range())
1554 100256 : if (elem->neighbor_ptr(i_side) == nullptr)
1555 : {
1556 13144 : has_external_bid = true;
1557 13144 : binfo.add_side(elem, i_side, extern_bid);
1558 510 : }
1559 510 : }
1560 : }
|
