1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731
|
// ------------------------------------------------------------------------
//
// SPDX-License-Identifier: LGPL-2.1-or-later
// Copyright (C) 2015 - 2025 by the deal.II authors
//
// This file is part of the deal.II library.
//
// Part of the source code is dual licensed under Apache-2.0 WITH
// LLVM-exception OR LGPL-2.1-or-later. Detailed license information
// governing the source code and code contributions can be found in
// LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
//
// ------------------------------------------------------------------------
#include <deal.II/base/logstream.h>
#include <deal.II/base/memory_consumption.h>
#include <deal.II/base/mpi.templates.h>
#include <deal.II/base/mpi_large_count.h>
#include <deal.II/base/utilities.h>
#include <deal.II/distributed/shared_tria.h>
#include <deal.II/distributed/tria_base.h>
#include <deal.II/grid/filtered_iterator.h>
#include <deal.II/grid/grid_tools.h>
#include <deal.II/grid/tria.h>
#include <deal.II/grid/tria_accessor.h>
#include <deal.II/grid/tria_iterator.h>
#include <deal.II/lac/vector_memory.h>
#include <algorithm>
#include <cstdint>
#include <fstream>
#include <iostream>
#include <limits>
#include <numeric>
DEAL_II_NAMESPACE_OPEN
namespace parallel
{
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
TriangulationBase<dim, spacedim>::TriangulationBase(
const MPI_Comm mpi_communicator,
const typename dealii::Triangulation<dim, spacedim>::MeshSmoothing
smooth_grid,
const bool check_for_distorted_cells)
: dealii::Triangulation<dim, spacedim>(smooth_grid,
check_for_distorted_cells)
, mpi_communicator(mpi_communicator)
, my_subdomain(Utilities::MPI::this_mpi_process(this->mpi_communicator))
, n_subdomains(Utilities::MPI::n_mpi_processes(this->mpi_communicator))
{
#ifndef DEAL_II_WITH_MPI
Assert(false, ExcNeedsMPI());
#endif
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
void TriangulationBase<dim, spacedim>::copy_triangulation(
const dealii::Triangulation<dim, spacedim> &other_tria)
{
#ifndef DEAL_II_WITH_MPI
(void)other_tria;
Assert(false, ExcNeedsMPI());
#else
dealii::Triangulation<dim, spacedim>::copy_triangulation(other_tria);
if (const dealii::parallel::TriangulationBase<dim, spacedim> *other_tria_x =
dynamic_cast<const dealii::parallel::TriangulationBase<dim, spacedim>
*>(&other_tria))
{
// release unused vector memory because we will have very different
// vectors now
::dealii::internal::GrowingVectorMemoryImplementation::
release_all_unused_memory();
}
#endif
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
std::size_t TriangulationBase<dim, spacedim>::memory_consumption() const
{
std::size_t mem =
this->dealii::Triangulation<dim, spacedim>::memory_consumption() +
MemoryConsumption::memory_consumption(this->mpi_communicator) +
MemoryConsumption::memory_consumption(my_subdomain) +
MemoryConsumption::memory_consumption(
number_cache.n_global_active_cells) +
MemoryConsumption::memory_consumption(number_cache.n_global_levels);
return mem;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
TriangulationBase<dim, spacedim>::~TriangulationBase()
{
// release unused vector memory because the vector layout is going to look
// very different now
::dealii::internal::GrowingVectorMemoryImplementation::
release_all_unused_memory();
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
TriangulationBase<dim, spacedim>::NumberCache::NumberCache()
: n_locally_owned_active_cells(0)
, n_global_active_cells(0)
, number_of_global_coarse_cells(0)
, n_global_levels(0)
{}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
unsigned int TriangulationBase<dim, spacedim>::n_locally_owned_active_cells()
const
{
return number_cache.n_locally_owned_active_cells;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
unsigned int TriangulationBase<dim, spacedim>::n_global_levels() const
{
return number_cache.n_global_levels;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
types::global_cell_index
TriangulationBase<dim, spacedim>::n_global_active_cells() const
{
return number_cache.n_global_active_cells;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
MPI_Comm TriangulationBase<dim, spacedim>::get_mpi_communicator() const
{
return mpi_communicator;
}
#ifdef DEAL_II_WITH_MPI
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
void TriangulationBase<dim, spacedim>::update_number_cache()
{
number_cache.ghost_owners.clear();
number_cache.level_ghost_owners.clear();
number_cache.n_locally_owned_active_cells = 0;
if (this->n_levels() == 0)
{
// Skip communication done below if we do not have any cells
// (meaning the Triangulation is empty on all processors). This will
// happen when called from the destructor of Triangulation, which
// can get called during exception handling causing a hang in this
// function.
number_cache.n_global_active_cells = 0;
number_cache.n_global_levels = 0;
return;
}
{
// find ghost owners
for (const auto &cell : this->active_cell_iterators())
if (cell->is_ghost())
number_cache.ghost_owners.insert(cell->subdomain_id());
Assert(number_cache.ghost_owners.size() <
Utilities::MPI::n_mpi_processes(this->mpi_communicator),
ExcInternalError());
}
if (this->n_levels() > 0)
number_cache.n_locally_owned_active_cells = std::count_if(
this->begin_active(),
typename Triangulation<dim, spacedim>::active_cell_iterator(
this->end()),
[](const auto &i) { return i.is_locally_owned(); });
else
number_cache.n_locally_owned_active_cells = 0;
// Potentially cast to a 64 bit type before accumulating to avoid
// overflow:
number_cache.n_global_active_cells =
Utilities::MPI::sum(static_cast<types::global_cell_index>(
number_cache.n_locally_owned_active_cells),
this->mpi_communicator);
number_cache.n_global_levels =
Utilities::MPI::max(this->n_levels(), this->mpi_communicator);
// Store MPI ranks of level ghost owners of this processor on all
// levels.
if (this->is_multilevel_hierarchy_constructed() == true)
{
number_cache.level_ghost_owners.clear();
// if there is nothing to do, then do nothing
if (this->n_levels() == 0)
return;
// find level ghost owners
for (const auto &cell : this->cell_iterators())
if (cell->level_subdomain_id() != numbers::artificial_subdomain_id &&
cell->level_subdomain_id() != this->locally_owned_subdomain())
this->number_cache.level_ghost_owners.insert(
cell->level_subdomain_id());
if constexpr (running_in_debug_mode())
{
// Check that level_ghost_owners is symmetric by sending a message
// to everyone
{
int ierr = MPI_Barrier(this->mpi_communicator);
AssertThrowMPI(ierr);
const int mpi_tag = Utilities::MPI::internal::Tags::
triangulation_base_fill_level_ghost_owners;
// important: preallocate to avoid (re)allocation:
std::vector<MPI_Request> requests(
this->number_cache.level_ghost_owners.size());
unsigned int dummy = 0;
unsigned int req_counter = 0;
for (const auto &it : this->number_cache.level_ghost_owners)
{
ierr = MPI_Isend(&dummy,
1,
MPI_UNSIGNED,
it,
mpi_tag,
this->mpi_communicator,
&requests[req_counter]);
AssertThrowMPI(ierr);
++req_counter;
}
for (const auto &it : this->number_cache.level_ghost_owners)
{
unsigned int dummy;
ierr = MPI_Recv(&dummy,
1,
MPI_UNSIGNED,
it,
mpi_tag,
this->mpi_communicator,
MPI_STATUS_IGNORE);
AssertThrowMPI(ierr);
}
if (requests.size() > 0)
{
ierr = MPI_Waitall(requests.size(),
requests.data(),
MPI_STATUSES_IGNORE);
AssertThrowMPI(ierr);
}
ierr = MPI_Barrier(this->mpi_communicator);
AssertThrowMPI(ierr);
}
}
Assert(this->number_cache.level_ghost_owners.size() <
Utilities::MPI::n_mpi_processes(this->mpi_communicator),
ExcInternalError());
}
this->number_cache.number_of_global_coarse_cells = this->n_cells(0);
// reset global cell ids
this->reset_global_cell_indices();
}
#else
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
void TriangulationBase<dim, spacedim>::update_number_cache()
{
Assert(false, ExcNeedsMPI());
}
#endif
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
void TriangulationBase<dim, spacedim>::update_reference_cells()
{
// run algorithm for locally-owned cells
dealii::Triangulation<dim, spacedim>::update_reference_cells();
// translate ReferenceCell to unsigned int (needed by
// Utilities::MPI::compute_set_union)
std::vector<unsigned int> reference_cells_ui;
reference_cells_ui.reserve(this->reference_cells.size());
for (const auto &i : this->reference_cells)
reference_cells_ui.push_back(static_cast<unsigned int>(i));
// create union
reference_cells_ui =
Utilities::MPI::compute_set_union(reference_cells_ui,
this->mpi_communicator);
// transform back and store result
this->reference_cells.clear();
for (const auto &i : reference_cells_ui)
this->reference_cells.emplace_back(
dealii::internal::make_reference_cell_from_int(i));
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
types::subdomain_id
TriangulationBase<dim, spacedim>::locally_owned_subdomain() const
{
return my_subdomain;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
const std::set<types::subdomain_id>
&TriangulationBase<dim, spacedim>::ghost_owners() const
{
return number_cache.ghost_owners;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
const std::set<types::subdomain_id>
&TriangulationBase<dim, spacedim>::level_ghost_owners() const
{
return number_cache.level_ghost_owners;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
std::vector<types::boundary_id> TriangulationBase<dim, spacedim>::
get_boundary_ids() const
{
return Utilities::MPI::compute_set_union(
dealii::Triangulation<dim, spacedim>::get_boundary_ids(),
this->mpi_communicator);
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
std::vector<types::manifold_id> TriangulationBase<dim, spacedim>::
get_manifold_ids() const
{
return Utilities::MPI::compute_set_union(
dealii::Triangulation<dim, spacedim>::get_manifold_ids(),
this->mpi_communicator);
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
void TriangulationBase<dim, spacedim>::reset_global_cell_indices()
{
#ifndef DEAL_II_WITH_MPI
Assert(false, ExcNeedsMPI());
#else
if (const auto pst =
dynamic_cast<const parallel::shared::Triangulation<dim, spacedim> *>(
this))
if (pst->with_artificial_cells() == false)
{
// Specialization for parallel::shared::Triangulation without
// artificial cells. The code below only works if a halo of a single
// ghost cells is needed.
std::vector<unsigned int> cell_counter(n_subdomains + 1);
// count number of cells of each process
for (const auto &cell : this->active_cell_iterators())
cell_counter[cell->subdomain_id() + 1]++;
// take prefix sum to obtain offset of each process
for (unsigned int i = 0; i < n_subdomains; ++i)
cell_counter[i + 1] += cell_counter[i];
AssertDimension(cell_counter.back(), this->n_active_cells());
// create partitioners
IndexSet is_local(this->n_active_cells());
is_local.add_range(cell_counter[my_subdomain],
cell_counter[my_subdomain + 1]);
number_cache.active_cell_index_partitioner =
std::make_shared<const Utilities::MPI::Partitioner>(
is_local,
complete_index_set(this->n_active_cells()),
this->mpi_communicator);
// set global active cell indices and increment process-local counters
for (const auto &cell : this->active_cell_iterators())
cell->set_global_active_cell_index(
cell_counter[cell->subdomain_id()]++);
Assert(this->is_multilevel_hierarchy_constructed() == false,
ExcNotImplemented());
return;
}
// 1) determine number of active locally-owned cells
const types::global_cell_index n_locally_owned_cells =
this->n_locally_owned_active_cells();
// 2) determine the offset of each process
types::global_cell_index cell_index = 0;
const int ierr = MPI_Exscan(
&n_locally_owned_cells,
&cell_index,
1,
Utilities::MPI::mpi_type_id_for_type<decltype(n_locally_owned_cells)>,
MPI_SUM,
this->mpi_communicator);
AssertThrowMPI(ierr);
// 3) give global indices to locally-owned cells and mark all other cells as
// invalid
std::pair<types::global_cell_index, types::global_cell_index> my_range;
my_range.first = cell_index;
for (const auto &cell : this->active_cell_iterators())
if (cell->is_locally_owned())
cell->set_global_active_cell_index(cell_index++);
else
cell->set_global_active_cell_index(numbers::invalid_dof_index);
my_range.second = cell_index;
// 4) determine the global indices of ghost cells
std::vector<types::global_dof_index> is_ghost_vector;
GridTools::exchange_cell_data_to_ghosts<types::global_cell_index>(
static_cast<dealii::Triangulation<dim, spacedim> &>(*this),
[](const auto &cell) { return cell->global_active_cell_index(); },
[&is_ghost_vector](const auto &cell, const auto &id) {
cell->set_global_active_cell_index(id);
is_ghost_vector.push_back(id);
});
// 5) set up new partitioner
IndexSet is_local(this->n_global_active_cells());
is_local.add_range(my_range.first, my_range.second);
std::sort(is_ghost_vector.begin(), is_ghost_vector.end());
IndexSet is_ghost(this->n_global_active_cells());
is_ghost.add_indices(is_ghost_vector.begin(), is_ghost_vector.end());
number_cache.active_cell_index_partitioner =
std::make_shared<const Utilities::MPI::Partitioner>(
is_local, is_ghost, this->mpi_communicator);
// 6) proceed with multigrid levels if requested
if (this->is_multilevel_hierarchy_constructed() == true)
{
// 1) determine number of locally-owned cells on levels
std::vector<types::global_cell_index> n_cells_level(
this->n_global_levels(), 0);
for (auto cell : this->cell_iterators())
if (cell->level_subdomain_id() == this->locally_owned_subdomain())
n_cells_level[cell->level()]++;
// 2) determine the offset of each process
std::vector<types::global_cell_index> cell_index(
this->n_global_levels(), 0);
int ierr = MPI_Exscan(
n_cells_level.data(),
cell_index.data(),
this->n_global_levels(),
Utilities::MPI::mpi_type_id_for_type<decltype(*n_cells_level.data())>,
MPI_SUM,
this->mpi_communicator);
AssertThrowMPI(ierr);
// 3) determine global number of "active" cells on each level
Utilities::MPI::sum(n_cells_level,
this->mpi_communicator,
n_cells_level);
// 4) give global indices to locally-owned cells on level and mark
// all other cells as invalid
std::vector<
std::pair<types::global_cell_index, types::global_cell_index>>
my_ranges(this->n_global_levels());
for (unsigned int l = 0; l < this->n_global_levels(); ++l)
my_ranges[l].first = cell_index[l];
for (auto cell : this->cell_iterators())
if (cell->level_subdomain_id() == this->locally_owned_subdomain())
cell->set_global_level_cell_index(cell_index[cell->level()]++);
else
cell->set_global_level_cell_index(numbers::invalid_dof_index);
for (unsigned int l = 0; l < this->n_global_levels(); ++l)
my_ranges[l].second = cell_index[l];
// 5) update the numbers of ghost level cells
std::vector<std::vector<types::global_dof_index>> is_ghost_vectors(
this->n_global_levels());
GridTools::exchange_cell_data_to_level_ghosts<
types::global_cell_index,
dealii::Triangulation<dim, spacedim>>(
*this,
[](const auto &cell) { return cell->global_level_cell_index(); },
[&is_ghost_vectors](const auto &cell, const auto &id) {
cell->set_global_level_cell_index(id);
is_ghost_vectors[cell->level()].push_back(id);
});
number_cache.level_cell_index_partitioners.resize(
this->n_global_levels());
// 6) set up cell partitioners for each level
for (unsigned int l = 0; l < this->n_global_levels(); ++l)
{
IndexSet is_local(n_cells_level[l]);
is_local.add_range(my_ranges[l].first, my_ranges[l].second);
IndexSet is_ghost(n_cells_level[l]);
std::sort(is_ghost_vectors[l].begin(), is_ghost_vectors[l].end());
is_ghost.add_indices(is_ghost_vectors[l].begin(),
is_ghost_vectors[l].end());
number_cache.level_cell_index_partitioners[l] =
std::make_shared<const Utilities::MPI::Partitioner>(
is_local, is_ghost, this->mpi_communicator);
}
}
#endif
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
void TriangulationBase<dim, spacedim>::communicate_locally_moved_vertices(
const std::vector<bool> &vertex_locally_moved)
{
AssertDimension(vertex_locally_moved.size(), this->n_vertices());
if constexpr (running_in_debug_mode())
{
{
const std::vector<bool> locally_owned_vertices =
dealii::GridTools::get_locally_owned_vertices(*this);
for (unsigned int i = 0; i < locally_owned_vertices.size(); ++i)
Assert((vertex_locally_moved[i] == false) ||
(locally_owned_vertices[i] == true),
ExcMessage("The vertex_locally_moved argument must not "
"contain vertices that are not locally owned"));
}
}
Point<spacedim> invalid_point;
for (unsigned int d = 0; d < spacedim; ++d)
invalid_point[d] = std::numeric_limits<double>::quiet_NaN();
const auto pack = [&](const auto &cell) {
std::vector<Point<spacedim>> vertices(cell->n_vertices());
for (const auto v : cell->vertex_indices())
if (vertex_locally_moved[cell->vertex_index(v)])
vertices[v] = cell->vertex(v);
else
vertices[v] = invalid_point;
return vertices;
};
const auto unpack = [&](const auto &cell, const auto &vertices) {
for (const auto v : cell->vertex_indices())
if (numbers::is_nan(vertices[v][0]) == false)
cell->vertex(v) = vertices[v];
};
if (this->is_multilevel_hierarchy_constructed())
GridTools::exchange_cell_data_to_level_ghosts<
std::vector<Point<spacedim>>>(
static_cast<dealii::Triangulation<dim, spacedim> &>(*this),
pack,
unpack);
else
GridTools::exchange_cell_data_to_ghosts<std::vector<Point<spacedim>>>(
static_cast<dealii::Triangulation<dim, spacedim> &>(*this),
pack,
unpack);
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
std::weak_ptr<const Utilities::MPI::Partitioner> TriangulationBase<
dim,
spacedim>::global_active_cell_index_partitioner() const
{
return number_cache.active_cell_index_partitioner;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
std::weak_ptr<const Utilities::MPI::Partitioner> TriangulationBase<dim,
spacedim>::
global_level_cell_index_partitioner(const unsigned int level) const
{
Assert(this->is_multilevel_hierarchy_constructed(), ExcNotImplemented());
AssertIndexRange(level, this->n_global_levels());
return number_cache.level_cell_index_partitioners[level];
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
types::coarse_cell_id
TriangulationBase<dim, spacedim>::n_global_coarse_cells() const
{
return number_cache.number_of_global_coarse_cells;
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
DistributedTriangulationBase<dim, spacedim>::DistributedTriangulationBase(
const MPI_Comm mpi_communicator,
const typename dealii::Triangulation<dim, spacedim>::MeshSmoothing
smooth_grid,
const bool check_for_distorted_cells)
: dealii::parallel::TriangulationBase<dim, spacedim>(
mpi_communicator,
smooth_grid,
check_for_distorted_cells)
{}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
void TriangulationBase<dim, spacedim>::clear()
{
dealii::Triangulation<dim, spacedim>::clear();
number_cache = {};
}
template <int dim, int spacedim>
DEAL_II_CXX20_REQUIRES((concepts::is_valid_dim_spacedim<dim, spacedim>))
bool DistributedTriangulationBase<dim, spacedim>::has_hanging_nodes() const
{
if (this->n_global_levels() <= 1)
return false; // can not have hanging nodes without refined cells
// if there are any active cells with level less than n_global_levels()-1,
// then there is obviously also one with level n_global_levels()-1, and
// consequently there must be a hanging node somewhere.
//
// The problem is that we cannot just ask for the first active cell, but
// instead need to filter over locally owned cells.
const bool have_coarser_cell =
std::any_of(this->begin_active(this->n_global_levels() - 2),
this->end_active(this->n_global_levels() - 2),
[](const CellAccessor<dim, spacedim> &cell) {
return cell.is_locally_owned();
});
// return true if at least one process has a coarser cell
return Utilities::MPI::max(have_coarser_cell ? 1 : 0,
this->mpi_communicator) != 0;
}
} // end namespace parallel
/*-------------- Explicit Instantiations -------------------------------*/
#include "distributed/tria_base.inst"
DEAL_II_NAMESPACE_CLOSE
|