10IndexSpaceImp<G>::IndexSpaceImp (
const G& gshop,
const Geometry& geom,
11 int required_coarsening_level,
12 int max_coarsening_level,
13 int ngrow,
bool build_coarse_level_by_coarsening,
14 bool extend_domain_face,
int num_coarsen_opt)
16 m_build_coarse_level_by_coarsening(build_coarse_level_by_coarsening),
17 m_extend_domain_face(extend_domain_face),
18 m_num_coarsen_opt(num_coarsen_opt)
22 max_coarsening_level = std::max(required_coarsening_level,max_coarsening_level);
23 max_coarsening_level = std::min(30,max_coarsening_level);
25 int ngrow_finest = std::max(ngrow,0);
26 if (!extend_domain_face) {
27 for (
int i = 1; i <= required_coarsening_level; ++i) {
32 m_geom.push_back(geom);
33 m_domain.push_back(geom.Domain());
34 m_ngrow.push_back(ngrow_finest);
35 m_gslevel.reserve(max_coarsening_level+1);
36 m_gslevel.emplace_back(
this, gshop, geom, EB2::max_grid_size, ngrow_finest, extend_domain_face,
39 for (
int ilev = 1; ilev <= max_coarsening_level; ++ilev)
41 bool coarsenable = m_geom.back().Domain().coarsenable(2,2);
43 if (ilev <= required_coarsening_level) {
44 amrex::Abort(
"IndexSpaceImp: domain is not coarsenable at level "+std::to_string(ilev));
51 if (ilev <= required_coarsening_level) {
52 ng = extend_domain_face ? m_ngrow.back() : m_ngrow.back()/2;
57 m_gslevel.emplace_back(
this, ilev, EB2::max_grid_size, ng, cgeom, m_gslevel[ilev-1]);
58 if (!m_gslevel.back().isOK()) {
60 if (ilev <= required_coarsening_level) {
61 if (build_coarse_level_by_coarsening) {
62 amrex::Abort(
"Failed to build required coarse EB level "+std::to_string(ilev));
64 m_gslevel.emplace_back(
this, gshop, cgeom, EB2::max_grid_size, ng, extend_domain_face,
65 num_coarsen_opt-ilev);
71 m_geom.push_back(cgeom);
72 m_domain.push_back(cdomain);
73 m_ngrow.push_back(ng);
79IndexSpaceImp<G>::IndexSpaceImp (
const G& gshop,
const Vector<Geometry>& geom,
81 bool extend_domain_face,
int num_coarsen_opt)
83 m_build_coarse_level_by_coarsening(false),
84 m_extend_domain_face(extend_domain_face),
85 m_num_coarsen_opt(num_coarsen_opt)
88 auto nlevels =
int(geom.size());
89 m_gslevel.reserve(nlevels);
91 for (
int ilev = 0; ilev < nlevels; ++ilev)
94 Geometry cgeom = geom[ilev];
95 Box cdomain = cgeom.Domain();
96 m_gslevel.emplace_back(
this, gshop, cgeom, EB2::max_grid_size, ng, extend_domain_face,
97 num_coarsen_opt-ilev);
98 m_geom.push_back(cgeom);
99 m_domain.push_back(cdomain);
100 m_ngrow.push_back(ng);
106IndexSpaceImp<G>::getLevel (
const Geometry& geom)
const
108 auto it = std::ranges::find(m_domain, geom.Domain());
110 "IndexSpaceImp::getLevel: Geometry not found");
111 int i = std::distance(m_domain.begin(), it);
117IndexSpaceImp<G>::getGeometry (
const Box& dom)
const
119 auto it = std::ranges::find(m_domain, dom);
121 "IndexSpaceImp::getLevel: domain not found");
122 int i = std::distance(m_domain.begin(), it);
128IndexSpaceImp<G>::addFineLevels (
int num_new_fine_levels)
130 if (num_new_fine_levels <= 0) {
return; }
132 "IndexSpaceImp::addFineLevels: num_new_fine_levels too large");
134 if (m_num_coarsen_opt > 0) {
135 m_num_coarsen_opt += num_new_fine_levels;
138 int rr_fine =
static_cast<int>(1U << num_new_fine_levels);
139 IndexSpaceImp<G> fine_isp(m_gshop,
amrex::refine(m_geom[0], rr_fine),
140 num_new_fine_levels-1, num_new_fine_levels-1,
141 m_ngrow[0], m_build_coarse_level_by_coarsening,
142 m_extend_domain_face, m_num_coarsen_opt);
144 fine_isp.m_gslevel.reserve(m_domain.size()+num_new_fine_levels);
145 for (
int i = 0; i < m_domain.size(); ++i) {
146 fine_isp.m_gslevel.emplace_back(std::move(m_gslevel[i]));
148 std::swap(fine_isp.m_gslevel, m_gslevel);
151 for (
auto& lev : m_gslevel) {
155 m_geom.insert(m_geom.begin(), fine_isp.m_geom.begin(), fine_isp.m_geom.end());
156 m_domain.insert(m_domain.begin(), fine_isp.m_domain.begin(), fine_isp.m_domain.end());
157 m_ngrow.insert(m_ngrow.begin(), fine_isp.m_ngrow.begin(), fine_isp.m_ngrow.end());
162IndexSpaceImp<G>::addRegularCoarseLevels (
int num_new_coarse_levels)
164 if (num_new_coarse_levels <= 0) {
return; }
166 "IndexSpaceImp::addRegularCoarseLevels: num_new_coarse_levels too large");
169 if (m_num_coarsen_opt > 0) {
170 m_num_coarsen_opt += num_new_coarse_levels;
173 auto nlevs_old =
int(m_gslevel.size());
174 int nlevs_new = nlevs_old + num_new_coarse_levels;
176 Vector<GShopLevel<G>> new_gslevel;
177 new_gslevel.reserve(nlevs_new);
179 Vector<Geometry> new_geom;
180 new_geom.reserve(nlevs_new);
182 Vector<Box> new_domain;
183 new_domain.reserve(nlevs_new);
185 Vector<int> new_ngrow;
186 new_ngrow.reserve(nlevs_new);
188 for (
int ilev = 0; ilev < num_new_coarse_levels; ++ilev) {
189 int rr =
static_cast<int>(1U << (num_new_coarse_levels-ilev));
191 new_domain.push_back(new_geom.back().Domain());
192 new_ngrow.push_back(m_ngrow[0]);
193 new_gslevel.push_back(GShopLevel<G>::makeAllRegular(
this, new_geom.back()));
196 for (
int ilev = 0; ilev < nlevs_old; ++ilev) {
197 new_gslevel.emplace_back(std::move(m_gslevel[ilev]));
198 new_geom.push_back (m_geom [ilev]);
199 new_domain.push_back(m_domain[ilev]);
200 new_ngrow.push_back (m_ngrow [ilev]);
203 std::swap(new_gslevel, m_gslevel);
204 std::swap(new_geom , m_geom);
205 std::swap(new_domain , m_domain);
206 std::swap(new_ngrow , m_ngrow);
208 for (
int ilev = num_new_coarse_levels-1; ilev >= 0; --ilev) {
209 m_gslevel[ilev].buildCutCellMask(m_gslevel[ilev+1]);
215IndexSpaceImp<G>::setShift (
int direction,
int ncells)
217 auto nlevs =
int(m_gslevel.size());
218 for (
int ilev = nlevs-1; ilev >= 0; --ilev) {
219 m_gslevel[ilev].setShift(direction, ncells);
226IndexSpaceImp<G>::buildAllFCData ()
228 for (
int ilev = 0; ilev <
int(m_gslevel.size()); ++ilev) {
229 m_gslevel[ilev].buildFCData(m_gshop, EB2::max_grid_size,
230 m_extend_domain_face, m_num_coarsen_opt-ilev);
#define AMREX_ALWAYS_ASSERT_WITH_MESSAGE(EX, MSG)
Definition AMReX_BLassert.H:49
#define AMREX_ALWAYS_ASSERT(EX)
Definition AMReX_BLassert.H:50
__host__ __device__ BoxND< dim > coarsen(const BoxND< dim > &b, int ref_ratio) noexcept
Return a copy of b coarsened by the isotropic ratio ref_ratio.
Definition AMReX_Box.H:1471
__host__ __device__ BoxND< dim > refine(const BoxND< dim > &b, int ref_ratio) noexcept
Return a copy of b refined by the isotropic ratio ref_ratio.
Definition AMReX_Box.H:1512
BoxND< 3 > Box
Box is an alias for amrex::BoxND instantiated with AMREX_SPACEDIM.
Definition AMReX_BaseFwd.H:35
void Abort(const std::string &msg)
Print a fatal-error message to stderr and abort execution.
Definition AMReX.cpp:239
const int[]
Definition AMReX_BLProfiler.cpp:1665