159 lines
5.2 KiB
C++
159 lines
5.2 KiB
C++
/***************************************************************************************************
|
|
* Copyright (c) 2017 - 2023 NVIDIA CORPORATION & AFFILIATES. All rights reserved.
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Neither the name of the copyright holder nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
**************************************************************************************************/
|
|
/*! \file
|
|
\brief Defines common types used for all GEMM-like operators.
|
|
*/
|
|
#pragma once
|
|
|
|
#include "cutlass/cutlass.h"
|
|
#include "cutlass/coord.h"
|
|
#include "cutlass/gemm_coord.h"
|
|
#include "cutlass/layout/matrix.h"
|
|
#include "cute/layout.hpp"
|
|
#include "cutlass/detail/layout.hpp"
|
|
|
|
namespace cutlass {
|
|
namespace gemm {
|
|
|
|
/////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
/// GEMM operand enumeration: D = A * B + C
|
|
enum class Operand {
|
|
kA, /// A multiplicand
|
|
kB, /// B multiplicand
|
|
kC, /// Source accumulator
|
|
kD /// Destination accumulator
|
|
};
|
|
|
|
/////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
enum class GemmUniversalMode {
|
|
kGemm,
|
|
kGemmSplitKParallel,
|
|
kBatched,
|
|
kArray,
|
|
kInvalid
|
|
};
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
/// Some options for clearing shared memory
|
|
enum class SharedMemoryClearOption {
|
|
kNone, ///< SMEM is in don't-care state
|
|
kZfill, ///< Kernels fill out of bounds accesses with zeros
|
|
kClearLastStage ///< Last SMEM stage is explicitly cleared. Mainloop uses 'kNone'
|
|
};
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
using cutlass::detail::TagToStrideA;
|
|
using cutlass::detail::TagToStrideB;
|
|
using cutlass::detail::TagToStrideC;
|
|
using cutlass::detail::TagToStrideA_t;
|
|
using cutlass::detail::TagToStrideB_t;
|
|
using cutlass::detail::TagToStrideC_t;
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
namespace detail {
|
|
|
|
using cutlass::detail::StrideToLayoutTagA;
|
|
using cutlass::detail::StrideToLayoutTagB;
|
|
using cutlass::detail::StrideToLayoutTagC;
|
|
using cutlass::detail::StrideToLayoutTagA_t;
|
|
using cutlass::detail::StrideToLayoutTagB_t;
|
|
using cutlass::detail::StrideToLayoutTagC_t;
|
|
|
|
template<int ModeIndex, class Stride>
|
|
constexpr bool
|
|
is_major(Stride = {}) {
|
|
return ::cutlass::detail::is_major<ModeIndex, Stride>();
|
|
}
|
|
|
|
template<class Stride>
|
|
constexpr bool
|
|
is_mn_major() {
|
|
return is_major<0,Stride>();
|
|
}
|
|
|
|
template<class Stride>
|
|
constexpr
|
|
bool
|
|
is_k_major() {
|
|
return is_major<1,Stride>();
|
|
}
|
|
|
|
template<class LayoutA>
|
|
constexpr bool
|
|
is_mn_major_A() {
|
|
return is_mn_major<TagToStrideA_t<LayoutA>>();
|
|
}
|
|
|
|
template<class LayoutB>
|
|
constexpr bool
|
|
is_mn_major_B() {
|
|
return is_mn_major<TagToStrideB_t<LayoutB>>();
|
|
}
|
|
|
|
template<class LayoutA>
|
|
constexpr bool
|
|
is_k_major_A() {
|
|
return is_k_major<TagToStrideA_t<LayoutA>>();
|
|
}
|
|
|
|
template<class LayoutB>
|
|
constexpr bool
|
|
is_k_major_B() {
|
|
return is_k_major<TagToStrideB_t<LayoutB>>();
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
// The following two metafunctions are used to detect whether a `kernel::Gemm` or `kernel::GemmUniversal`
|
|
// is implementing the CUTLASS 3.x API or not, by checking if the problem shape type is aliased within or not.
|
|
template <class GemmKernel, class = void>
|
|
struct IsCutlass3GemmKernel : cute::false_type { };
|
|
|
|
template <typename GemmKernel>
|
|
struct IsCutlass3GemmKernel<GemmKernel, cute::void_t<typename GemmKernel::ProblemShape>>
|
|
: cute::true_type { };
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
} // namespace detail
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
} // namespace gemm
|
|
} // namespace cutlass
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////////
|