| /*************************************************************************************************** | |
| * Copyright (c) 2017 - 2025 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 Templates implementing warp-level matrix multiply-accumulate operations. | |
| */ | |
| ///////////////////////////////////////////////////////////////////////////////////////////////// | |
| namespace cutlass { | |
| ///////////////////////////////////////////////////////////////////////////////////////////////// | |
| /// Array holding planar complex elements | |
| template <typename Element_, int N> | |
| struct ArrayPlanarComplex { | |
| /// Underlying real element | |
| using Element = Element_; | |
| /// Number of logical elements | |
| static constexpr size_t kElements = N; | |
| /// Underlying Fragment of real-valued elemenets | |
| using ArrayReal = cutlass::Array<Element, N>; | |
| public: | |
| /// Fragment of real-valued elements representing the real part | |
| ArrayReal real; | |
| /// Fragment of real-valued elements representing the imaginary part | |
| ArrayReal imag; | |
| public: | |
| /// Sets the array to zero efficiently | |
| CUTLASS_HOST_DEVICE | |
| void clear() { | |
| real.clear(); | |
| imag.clear(); | |
| } | |
| }; | |
| ///////////////////////////////////////////////////////////////////////////////////////////////// | |
| /// Helper to deduce template arguments | |
| template <typename Element, int N> | |
| CUTLASS_HOST_DEVICE | |
| ArrayPlanarComplex<Element, N> | |
| make_ArrayPlanarComplex(Array<Element, N> const &real, Array<Element, N> const &imag) { | |
| return ArrayPlanarComplex<Element, N>{real, imag}; | |
| } | |
| ///////////////////////////////////////////////////////////////////////////////////////////////// | |
| } // namespace cutlass | |
| ///////////////////////////////////////////////////////////////////////////////////////////////// | |