/* * (C) Crown Copyright 2021 Met Office * * This software is licensed under the terms of the Apache Licence Version 2.0 * which can be obtained at http://www.apache.org/licenses/LICENSE-2.0. */ #include #include "atlas/functionspace/detail/CubedSphereStructure.h" #include "atlas/runtime/Log.h" #include "atlas/runtime/Trace.h" using namespace atlas::meshgenerator::detail::cubedsphere; namespace atlas { namespace functionspace { namespace detail { namespace { #if ATLAS_BUILD_TYPE_DEBUG constexpr bool checkBounds = true; #else constexpr bool checkBounds = false; #endif } // namespace CubedSphereStructure::BoundingBox::BoundingBox() { iBegin = std::numeric_limits::max(); iEnd = std::numeric_limits::min(); jBegin = std::numeric_limits::max(); jEnd = std::numeric_limits::min(); } CubedSphereStructure::CubedSphereStructure(const Field& tij, const Field& ghost, idx_t size): tij_(tij), ghost_(ghost), nElems_(size) { ATLAS_TRACE(); Log::debug() << "CubedSphereStructure bounds checking is set to " + std::to_string(checkBounds) << std::endl; // Make array views. const auto tijView_ = array::make_view(tij_); const auto ghostView_ = array::make_view(ghost_); // loop over tij and find min and max ij bounds. for (idx_t index = 0; index < nElems_; ++index) { const size_t t = static_cast(tijView_(index, Coordinates::T)); const idx_t i = tijView_(index, Coordinates::I); const idx_t j = tijView_(index, Coordinates::J); ijBounds_[t].iBegin = std::min(i, ijBounds_[t].iBegin); ijBounds_[t].jBegin = std::min(j, ijBounds_[t].jBegin); ijBounds_[t].iEnd = std::max(i + 1, ijBounds_[t].iEnd); ijBounds_[t].jEnd = std::max(j + 1, ijBounds_[t].jEnd); // Keep track of highest non-ghost index. if (!ghostView_(index)) { nOwnedElems_ = index + 1; } } // Set tijToIdx vectors for (idx_t t = 0; t < 6; ++t) { // Set data array. size_t vecSize = 0; if( j_end(t) >= j_begin(t) && i_end(t) >= i_begin(t) ) { vecSize = static_cast((j_end(t) - j_begin(t)) * (i_end(t) - i_begin(t))); } tijToIdx_.emplace_back(vecSize, invalid_index()); } // loop over ijt_ and set ijtToIdx for (idx_t index = 0; index < nElems_; ++index) { const idx_t t = tijView_(index, Coordinates::T); const idx_t i = tijView_(index, Coordinates::I); const idx_t j = tijView_(index, Coordinates::J); tijToIdx_[static_cast(t)][vecIndex(t, i, j)] = index; } } idx_t CubedSphereStructure::size() const { return nElems_; } idx_t CubedSphereStructure::sizeOwned() const { return nOwnedElems_; } idx_t CubedSphereStructure::i_begin(idx_t t) const { if (checkBounds) { tBoundsCheck(t); } return ijBounds_[static_cast(t)].iBegin; } idx_t CubedSphereStructure::i_end(idx_t t) const { if (checkBounds) { tBoundsCheck(t); } return ijBounds_[static_cast(t)].iEnd; } idx_t CubedSphereStructure::j_begin(idx_t t) const { if (checkBounds) { tBoundsCheck(t); } return ijBounds_[static_cast(t)].jBegin; } idx_t CubedSphereStructure::j_end(idx_t t) const { if (checkBounds) { tBoundsCheck(t); } return ijBounds_[static_cast(t)].jEnd; } idx_t CubedSphereStructure::index(idx_t t, idx_t i, idx_t j) const { if (checkBounds) { iBoundsCheck(i, t); jBoundsCheck(j, t); } return tijToIdx_[static_cast(t)][vecIndex(t, i, j)]; } bool CubedSphereStructure::is_valid_index(idx_t t, idx_t i, idx_t j) const { // Check if t is in range. if (t < 0 || t > 5) { return false; } // Check if i and j are in range in index method. if (i < i_begin(t) || i >= i_end(t) || j < j_begin(t) || j >= j_end(t)) { return false; } // Check if (t, i, j) is a valid index. if (index(t, i, j) == invalid_index()) { return false; } return true; } Field CubedSphereStructure::tij() const { return tij_; } Field CubedSphereStructure::ghost() const { return ghost_; } void CubedSphereStructure::tBoundsCheck(idx_t t) const { if (t < 0 || t > 5) { throw_OutOfRange("t", t, 6); } } void CubedSphereStructure::jBoundsCheck(idx_t j, idx_t t) const { const idx_t jSize = j_end(t) - j_begin(t); j -= j_begin(t); if (j < 0 || j >= jSize) { throw_OutOfRange("j - jMin", j, jSize); } } void CubedSphereStructure::iBoundsCheck(idx_t i, idx_t t) const { const idx_t iSize = i_end(t) - i_begin(t); i -= i_begin(t); if (i < 0 || i >= iSize) { throw_OutOfRange("i - iMin", i, iSize); } } size_t CubedSphereStructure::vecIndex(idx_t t, idx_t i, idx_t j) const { return static_cast((j - j_begin(t)) * (i_end(t) - i_begin(t)) + i - i_begin(t)); } } // namespace detail } // namespace functionspace } // namespace atlas