200 lines
5.1 KiB
Plaintext
200 lines
5.1 KiB
Plaintext
/***************************************************************************************************
|
|
* Copyright (c) 2017-2021, NVIDIA CORPORATION. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without modification, are permitted
|
|
* provided that the following conditions are met:
|
|
* * Redistributions of source code must retain the above copyright notice, this list of
|
|
* conditions and the following disclaimer.
|
|
* * 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.
|
|
* * Neither the name of the NVIDIA CORPORATION 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 NVIDIA CORPORATION 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 TOR (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 Unit tests for the small matrix class.
|
|
*/
|
|
|
|
#include <iostream>
|
|
|
|
#include "../common/cutlass_unit_test.h"
|
|
|
|
#include "cutlass/matrix.h"
|
|
#include "cutlass/core_io.h"
|
|
|
|
/////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
TEST(Matrix, elementwise_add) {
|
|
|
|
using Matrix4x4 = cutlass::Matrix4x4<float>;
|
|
|
|
Matrix4x4 A = {
|
|
1, 2, 3, 4,
|
|
5, 6, 7, 8,
|
|
9, 10, 11, 12,
|
|
13, 14, 15, 16
|
|
};
|
|
|
|
Matrix4x4 B = A.transpose();
|
|
|
|
Matrix4x4 C = A.add(B * 2.125f);
|
|
|
|
bool passed = true;
|
|
|
|
for (int i = 0; i < 4; ++i) {
|
|
for (int j = 0; j < 4; ++j) {
|
|
float got = C.at(i, j);
|
|
float expected = A.at(i, j) + A.at(j, i) * 2.125f;
|
|
if (got != expected) {
|
|
passed = false;
|
|
}
|
|
}
|
|
}
|
|
EXPECT_TRUE(passed);
|
|
if (!passed) {
|
|
std::cout << "A:\n" << A << "\n\nB:\n" << B << "\n\nC:\n" << C << std::endl;
|
|
}
|
|
}
|
|
|
|
TEST(Matrix, elementwise_multiply) {
|
|
|
|
using Matrix4x4 = cutlass::Matrix4x4<float>;
|
|
|
|
Matrix4x4 A = {
|
|
1, 2, 3, 4,
|
|
5, 6, 7, 8,
|
|
9, 10, 11, 12,
|
|
13, 14, 15, 16
|
|
};
|
|
|
|
Matrix4x4 B = A.transpose();
|
|
|
|
Matrix4x4 C = A.multiply(B);
|
|
|
|
bool passed = true;
|
|
|
|
for (int i = 0; i < 4; ++i) {
|
|
for (int j = 0; j < 4; ++j) {
|
|
float got = C.at(i, j);
|
|
float expected = A.at(i, j) * A.at(j, i);
|
|
if (got != expected) {
|
|
passed = false;
|
|
}
|
|
}
|
|
}
|
|
EXPECT_TRUE(passed);
|
|
if (!passed) {
|
|
std::cout << "A:\n" << A << "\n\nB:\n" << B << "\n\nC:\n" << C << std::endl;
|
|
}
|
|
}
|
|
|
|
TEST(Matrix, product_4x4_overloads) {
|
|
|
|
using Matrix4x4 = cutlass::Matrix4x4<float>;
|
|
|
|
Matrix4x4 A = {
|
|
1, 2, 3, 4,
|
|
5, 6, 7, 8,
|
|
9, 10, 11, 12,
|
|
13, 14, 15, 16
|
|
};
|
|
|
|
Matrix4x4 B = {
|
|
-1, -2, 0, 4,
|
|
1, 2, 1, 1,
|
|
3, 2, 1, 1,
|
|
1, 0, 8, 2
|
|
};
|
|
|
|
Matrix4x4 C = Matrix4x4::identity();
|
|
|
|
Matrix4x4 D = A * B + C;
|
|
|
|
bool passed = true;
|
|
|
|
for (int i = 0; i < 4; ++i) {
|
|
for (int j = 0; j < 4; ++j) {
|
|
float got = D.at(i, j);
|
|
float expected = (i == j ? 1.0f : 0);
|
|
for (int k = 0; k < 4; ++k) {
|
|
expected += A.at(i, k) * B.at(k, j);
|
|
}
|
|
if (got != expected) {
|
|
passed = false;
|
|
}
|
|
}
|
|
}
|
|
|
|
EXPECT_TRUE(passed);
|
|
if (!passed) {
|
|
std::cout << "A:\n" << A << "\n\nB:\n" << B << "\n\nC:\n" << C << "\n\nD:\n" << D << std::endl;
|
|
}
|
|
}
|
|
|
|
|
|
TEST(Matrix, product_4x4) {
|
|
|
|
using Matrix4x4 = cutlass::Matrix4x4<float>;
|
|
|
|
Matrix4x4 A = {
|
|
1, 2, 3, 4,
|
|
5, 6, 7, 8,
|
|
9, 10, 11, 12,
|
|
13, 14, 15, 16
|
|
};
|
|
|
|
Matrix4x4 B = {
|
|
-1, -2, 0, 4,
|
|
1, 2, 1, 1,
|
|
3, 2, 1, 1,
|
|
1, 0, 8, 2
|
|
};
|
|
|
|
Matrix4x4 C = Matrix4x4::identity();
|
|
|
|
// Compute product with optional source accumulator
|
|
Matrix4x4 D = A.product(B, C);
|
|
|
|
bool passed = true;
|
|
|
|
for (int i = 0; i < 4; ++i) {
|
|
for (int j = 0; j < 4; ++j) {
|
|
float got = D.at(i, j);
|
|
float expected = (i == j ? 1.0f : 0.0f);
|
|
for (int k = 0; k < 4; ++k) {
|
|
expected += A.at(i, k) * B.at(k, j);
|
|
}
|
|
if (got != expected) {
|
|
passed = false;
|
|
}
|
|
}
|
|
}
|
|
|
|
EXPECT_TRUE(passed);
|
|
if (!passed) {
|
|
std::cout << "A:\n" << A << "\n\nB:\n" << B << "\n\nC:\n" << C << "\n\nD:\n" << D << std::endl;
|
|
}
|
|
|
|
for (int i = 0; i < 4; ++i) {
|
|
for (int j = 0; j < 4; ++j) {
|
|
float c = (i == j ? 1.0f : 0.0f);
|
|
EXPECT_TRUE(A.row(i).dot(B.column(j)) + c == D.at(i, j));
|
|
}
|
|
}
|
|
}
|
|
|
|
/////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|