/*************************************************************************************************** * 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. * **************************************************************************************************/ //#define CUTLASS_DEBUG_TRACE_LEVEL 1 #include "cutlass_unit_test.h" #include #include #include #include // cute::composition #include // cute::Swizzle #include // cute::composition #include using namespace cute; template void test_left_inverse(Layout const& layout) { auto inv_layout = left_inverse(layout); CUTLASS_TRACE_HOST(layout << " ^ -1\n" << " => \n" << inv_layout); for (int i = 0; i < size(layout); ++i) { //printf("%3d: %3d %3d %3d\n", i, int(layout(i)), int(inv_layout(layout(i))), int(layout(inv_layout(layout(i))))); EXPECT_EQ(layout(inv_layout(layout(i))), layout(i)); } CUTLASS_TRACE_HOST("Composition: " << coalesce(composition(layout, composition(inv_layout, layout)))); } TEST(CuTe_core, Inverse_left) { CUTLASS_TRACE_HOST("-------------------------------"); CUTLASS_TRACE_HOST("LEFT INVERSE" ); CUTLASS_TRACE_HOST("-------------------------------"); CUTLASS_TRACE_HOST("-------------------------------"); CUTLASS_TRACE_HOST("Simple tests" ); CUTLASS_TRACE_HOST("-------------------------------"); { auto layout = Layout<_1, _0>{}; test_left_inverse(layout); } { auto layout = Layout<_1, _1>{}; test_left_inverse(layout); } { auto layout = Layout>, Stride>>{}; test_left_inverse(layout); } { auto layout = Layout>, Stride>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_0>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_1>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_2>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_0,_2>>{}; test_left_inverse(layout); } { auto layout = Layout>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_4, _1>>{}; test_left_inverse(layout); } { auto layout = Layout>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_4,_1,_8>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_4,_1,_0,_8>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_1,_16>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_1, _5>>{}; test_left_inverse(layout); } { auto layout = Layout,Stride<_65536,_1>>{}; test_left_inverse(layout); } { auto layout = Layout,Stride<_65536,_1>>{}; test_left_inverse(layout); } { auto layout = Layout,Stride<_65536,_512,_1>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride, Int<2>>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_262144,_4,Int<8388608>,_1>>{}; test_left_inverse(layout); } { auto layout = Layout, Stride<_4,_0,_1>>{}; test_left_inverse(layout); } { auto layout = Layout, _1>, Shape < _32, _2>>, _4>, _1, Shape <_2, _2>, _2>, Stride, _4>, _0>, Stride, C<1>>>, C<8388608>>, _0, Stride<_2, _16>, _32>>{}; test_left_inverse(layout); } // CUTLASS_TRACE_HOST("-------------------------------"); // CUTLASS_TRACE_HOST("Dynamic shapes/strides" ); // CUTLASS_TRACE_HOST("-------------------------------"); // { // auto layout = make_layout(Shape<_4, _2>{}, make_stride(Int<1>{}, 4)); // test_left_inverse(layout); // } // { // auto layout = make_layout(make_shape(_4{}, 2), make_stride(Int<1>{}, 4)); // test_left_inverse(layout); // } // { // auto layout = make_layout(make_shape(4, 2), make_stride(Int<1>{}, 4)); // test_left_inverse(layout); // } // { // auto layout = make_layout(Shape<_2, _4>{}, make_stride(4, Int<1>{})); // test_left_inverse(layout); // } // { // auto layout = make_layout(make_shape(2, Int<4>{}), make_stride(4, Int<1>{})); // test_left_inverse(layout); // } // { // auto layout = make_layout(make_shape(2, 4), make_stride(4, Int<1>{})); // test_left_inverse(layout); // } // { // auto layout = make_layout(make_shape(2, 4), make_stride(4, 1)); // test_left_inverse(layout); // } CUTLASS_TRACE_HOST("-------------------------------"); CUTLASS_TRACE_HOST("Swizzle layouts" ); CUTLASS_TRACE_HOST("-------------------------------"); { auto layout = ComposedLayout, _0, Layout, Stride<_1, _4>>>{}; test_left_inverse(layout); } { auto layout = ComposedLayout, _0, Layout, Stride<_4, _1>>>{}; test_left_inverse(layout); } { auto layout = ComposedLayout, _0, Layout, Stride<_8, _1>>>{}; test_left_inverse(layout); } CUTLASS_TRACE_HOST("-------------------------------"); CUTLASS_TRACE_HOST("BETA: Negative strides" ); CUTLASS_TRACE_HOST("-------------------------------"); { auto layout = make_layout(Shape<_4>{}, Stride>{}); test_left_inverse(layout); } //{ //auto layout = Layout, // Stride<_m1,_2>>{}; //test_left_inverse(layout); //} //{ //auto layout = Layout, // Stride< _4,_m1>>{}; //test_left_inverse(layout); //} //{ //auto layout = Layout, // Stride<_m1,_12,_m2>>{}; //test_left_inverse(layout); //} }