//@HEADER // ************************************************************************ // // Kokkos v. 4.0 // Copyright (2022) National Technology & Engineering // Solutions of Sandia, LLC (NTESS). // // Under the terms of Contract DE-NA0003525 with NTESS, // the U.S. Government retains certain rights in this software. // // Part of Kokkos, under the Apache License v2.0 with LLVM Exceptions. // See https://kokkos.org/LICENSE for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //@HEADER #ifndef KOKKOSBATCHED_LU_SERIAL_INTERNAL_HPP #define KOKKOSBATCHED_LU_SERIAL_INTERNAL_HPP /// \author Kyungjoo Kim (kyukim@sandia.gov) #include "KokkosBatched_Util.hpp" #include "KokkosBatched_Vector.hpp" #include "KokkosBatched_InnerLU_Serial_Impl.hpp" #include "KokkosBatched_InnerTrsm_Serial_Impl.hpp" #include "KokkosBatched_Gemm_Serial_Internal.hpp" namespace KokkosBatched { /// /// Serial Internal Impl /// ==================== template struct SerialLU_Internal { template KOKKOS_INLINE_FUNCTION static int invoke(const int m, const int n, ValueType *KOKKOS_RESTRICT A, const int as0, const int as1, const typename MagnitudeScalarType::type tiny); }; template <> template KOKKOS_INLINE_FUNCTION int SerialLU_Internal::invoke( const int m, const int n, ValueType *KOKKOS_RESTRICT A, const int as0, const int as1, const typename MagnitudeScalarType::type tiny) { const int k = (m < n ? m : n); if (k <= 0) return 0; using mst = typename MagnitudeScalarType::type; const auto abs_tiny = tiny > 0 ? tiny : mst(-tiny); const auto minus_abs_tiny = -abs_tiny; for (int p = 0; p < k; ++p) { const int iend = m - p - 1, jend = n - p - 1; const ValueType *KOKKOS_RESTRICT a12t = A + (p)*as0 + (p + 1) * as1; ValueType *KOKKOS_RESTRICT a21 = A + (p + 1) * as0 + (p)*as1, *KOKKOS_RESTRICT A22 = A + (p + 1) * as0 + (p + 1) * as1; if (tiny != 0) { ValueType &alpha11_reference = A[p * as0 + p * as1]; const auto alpha11_real = Kokkos::ArithTraits::real(alpha11_reference); alpha11_reference += minus_abs_tiny * ValueType(alpha11_real < 0); alpha11_reference += abs_tiny * ValueType(alpha11_real >= 0); } const ValueType alpha11 = A[p * as0 + p * as1]; for (int i = 0; i < iend; ++i) { // a21[i*as0] *= inv_alpha11; a21[i * as0] /= alpha11; #if defined(KOKKOS_ENABLE_PRAGMA_UNROLL) #pragma unroll #endif for (int j = 0; j < jend; ++j) A22[i * as0 + j * as1] -= a21[i * as0] * a12t[j * as1]; } } return 0; } template <> template KOKKOS_INLINE_FUNCTION int SerialLU_Internal::invoke( const int m, const int n, ValueType *KOKKOS_RESTRICT A, const int as0, const int as1, const typename MagnitudeScalarType::type /*tiny*/) { constexpr int mbAlgo = Algo::LU::Blocked::mb(); const typename MagnitudeScalarType::type one(1.0), minus_one(-1.0); const int k = (m < n ? m : n); if (k <= 0) return 0; InnerLU lu(as0, as1); InnerTrsmLeftLowerUnitDiag trsm_llu(as0, as1, as0, as1); InnerTrsmLeftLowerNonUnitDiag trsm_run(as1, as0, as1, as0); auto lu_factorize = [&](const int ib, const int jb, ValueType *KOKKOS_RESTRICT AA) { const int mb = mbAlgo; const int kb = ib < jb ? ib : jb; for (int p = 0; p < kb; p += mb) { const int pb = (p + mb) > kb ? (kb - p) : mb; // diagonal block ValueType *KOKKOS_RESTRICT Ap = AA + p * as0 + p * as1; // lu on a block lu.serial_invoke(pb, Ap); // dimension ABR const int m_abr = ib - p - mb, n_abr = jb - p - mb; // trsm update trsm_llu.serial_invoke(Ap, pb, n_abr, Ap + mb * as1); trsm_run.serial_invoke(Ap, pb, m_abr, Ap + mb * as0); // gemm update SerialGemmInternal::invoke(m_abr, n_abr, pb, minus_one, Ap + mb * as0, as0, as1, Ap + mb * as1, as0, as1, one, Ap + mb * as0 + mb * as1, as0, as1); } }; const bool is_small = true; //(m*n <= 64*64); if (is_small) { lu_factorize(m, n, A); } else { // // some cache blocking may need (not priority yet); // lu_factorize(m, n, A); } return 0; } } // namespace KokkosBatched #endif