blob: 6407e606014c01a6db35fdb8e0975ed30a9a2b1a [file] [log] [blame]
// Copyright 2016 The SwiftShader Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "Assert.hpp"
#include "Coroutine.hpp"
#include "Print.hpp"
#include "Reactor.hpp"
#include "gtest/gtest.h"
#include <array>
#include <cmath>
#include <filesystem>
#include <fstream>
#include <thread>
#include <tuple>
using namespace rr;
using float4 = float[4];
using int4 = int[4];
static std::string testName()
{
auto info = ::testing::UnitTest::GetInstance()->current_test_info();
return std::string{ info->test_suite_name() } + "_" + info->name();
}
int reference(int *p, int y)
{
int x = p[-1];
int z = 4;
for(int i = 0; i < 10; i++)
{
z += (2 << i) - (i / 3);
}
int sum = x + y + z;
return sum;
}
TEST(ReactorUnitTests, Sample)
{
FunctionT<int(int *, int)> function;
{
Pointer<Int> p = function.Arg<0>();
Int x = p[-1];
Int y = function.Arg<1>();
Int z = 4;
For(Int i = 0, i < 10, i++)
{
z += (2 << i) - (i / 3);
}
Float4 v;
v.z = As<Float>(z);
z = As<Int>(Float(Float4(v.xzxx).y));
Int sum = x + y + z;
Return(sum);
}
auto routine = function(testName().c_str());
int one[2] = { 1, 0 };
int result = routine(&one[1], 2);
EXPECT_EQ(result, reference(&one[1], 2));
}
// This test demonstrates the use of a 'trampoline', where a routine calls
// a static function which then generates another routine during the execution
// of the first routine. Also note the code generated for the second routine
// depends on a parameter passed to the first routine.
TEST(ReactorUnitTests, Trampoline)
{
using SecondaryFunc = int(int, int);
static auto generateSecondary = [](int upDown) {
FunctionT<SecondaryFunc> secondary;
{
Int x = secondary.Arg<0>();
Int y = secondary.Arg<1>();
Int r;
if(upDown > 0)
{
r = x + y;
}
else if(upDown < 0)
{
r = x - y;
}
else
{
r = 0;
}
Return(r);
}
static auto routine = secondary((testName() + "_secondary").c_str());
return routine.getEntry();
};
using SecondaryGeneratorFunc = SecondaryFunc *(*)(int);
SecondaryGeneratorFunc secondaryGenerator = (SecondaryGeneratorFunc)generateSecondary;
using PrimaryFunc = int(int, int, int);
FunctionT<PrimaryFunc> primary;
{
Int x = primary.Arg<0>();
Int y = primary.Arg<1>();
Int z = primary.Arg<2>();
Pointer<Byte> secondary = Call(secondaryGenerator, z);
Int r = Call<SecondaryFunc>(secondary, x, y);
Return(r);
}
auto routine = primary((testName() + "_primary").c_str());
int result = routine(100, 20, -3);
EXPECT_EQ(result, 80);
}
TEST(ReactorUnitTests, Uninitialized)
{
#if __has_feature(memory_sanitizer)
// Building the static C++ code with MemorySanitizer enabled does not
// automatically enable MemorySanitizer instrumentation for Reactor
// routines. False positives can also be prevented by unpoisoning all
// memory writes. This Pragma ensures proper instrumentation is enabled.
Pragma(MemorySanitizerInstrumentation, true);
#endif
FunctionT<int()> function;
{
Int a;
Int z = 4;
Int q;
Int c;
Int p;
Bool b;
q += q;
If(b)
{
c = p;
}
Return(a + z + q + c);
}
auto routine = function(testName().c_str());
if(!__has_feature(memory_sanitizer))
{
int result = routine();
EXPECT_EQ(result, result); // Anything is fine, just don't crash
}
else
{
// Optimizations may turn the conditional If() in the Reactor code
// into a conditional move or arithmetic operations, which would not
// trigger a MemorySanitizer error. However, in that case the equals
// operator below should trigger it before the abort is reached.
EXPECT_DEATH(
{
int result = routine();
if(result == 0) abort();
},
"MemorySanitizer: use-of-uninitialized-value");
}
Pragma(MemorySanitizerInstrumentation, false);
}
TEST(ReactorUnitTests, Unreachable)
{
FunctionT<int(int)> function;
{
Int a = function.Arg<0>();
Int z = 4;
Return(a + z);
// Code beyond this point is unreachable but should not cause any
// compilation issues.
z += a;
}
auto routine = function(testName().c_str());
int result = routine(16);
EXPECT_EQ(result, 20);
}
// Stopping in the middle of a `Function<>` is supported and should not affect
// subsequent complete ones.
TEST(ReactorUnitTests, UnfinishedFunction)
{
do
{
FunctionT<int(int)> function;
{
Int a = function.Arg<0>();
Int z = 4;
if((true)) break; // Terminate do-while early.
Return(a + z);
}
} while(true);
FunctionT<int(int)> function;
{
Int a = function.Arg<0>();
Int z = 4;
Return(a - z);
}
auto routine = function(testName().c_str());
int result = routine(16);
EXPECT_EQ(result, 12);
}
// Deriving from `Function<>` and using Reactor variables as members can be a
// convenient way to 'name' function arguments and compose complex functions
// with helper methods. This test checks the interactions between the lifetime
// of the `Function<>` and the variables belonging to the derived class.
struct FunctionMembers : FunctionT<int(int)>
{
FunctionMembers()
: level(Arg<0>())
{
For(Int i = 0, i < 3, i++)
{
pourSomeMore();
}
Return(level);
}
void pourSomeMore()
{
level += 2;
}
Int level;
};
TEST(ReactorUnitTests, FunctionMembers)
{
FunctionMembers function;
auto routine = function(testName().c_str());
int result = routine(3);
EXPECT_EQ(result, 9);
}
// This test excercises modifying the value of a local variable through a
// pointer to it.
TEST(ReactorUnitTests, VariableAddress)
{
FunctionT<int(int)> function;
{
Int a = function.Arg<0>();
Int z = 0;
Pointer<Int> p = &z;
*p = 4;
Return(a + z);
}
auto routine = function(testName().c_str());
int result = routine(16);
EXPECT_EQ(result, 20);
}
// This test exercises taking the address of a local varible at the end of a
// loop and modifying its value through the pointer in the second iteration.
TEST(ReactorUnitTests, LateVariableAddress)
{
FunctionT<int(void)> function;
{
Pointer<Int> p = nullptr;
Int a = 0;
While(a == 0)
{
If(p != Pointer<Int>(nullptr))
{
*p = 1;
}
p = &a;
}
Return(a);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 1);
}
// This test checks that the value of a local variable which has been modified
// though a pointer is correct at the point before its address is (statically)
// obtained.
TEST(ReactorUnitTests, LoadAfterIndirectStore)
{
FunctionT<int(void)> function;
{
Pointer<Int> p = nullptr;
Int a = 0;
Int b = 0;
While(a == 0)
{
If(p != Pointer<Int>(nullptr))
{
*p = 1;
}
// `a` must be loaded from memory here, despite not statically knowing
// yet that its address will be taken below.
b = a + 5;
p = &a;
}
Return(b);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 6);
}
// This test checks that variables statically accessed after a Return statement
// are still loaded, modified, and stored correctly.
TEST(ReactorUnitTests, LoopAfterReturn)
{
FunctionT<int(void)> function;
{
Int min = 100;
Int max = 200;
If(min > max)
{
Return(5);
}
While(min < max)
{
min++;
}
Return(7);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 7);
}
TEST(ReactorUnitTests, ConstantPointer)
{
int c = 44;
FunctionT<int()> function;
{
Int x = *Pointer<Int>(ConstantPointer(&c));
Return(x);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 44);
}
// This test excercises the Optimizer::eliminateLoadsFollowingSingleStore() optimization pass.
// The three load operations for `y` should get eliminated.
TEST(ReactorUnitTests, EliminateLoadsFollowingSingleStore)
{
FunctionT<int(int)> function;
{
Int x = function.Arg<0>();
Int y;
Int z;
// This branch materializes the variables.
If(x != 0) // TODO(b/179922668): Support If(x)
{
y = x;
z = y + y + y;
}
Return(z);
}
Nucleus::setOptimizerCallback([](const Nucleus::OptimizerReport *report) {
EXPECT_EQ(report->allocas, 2);
EXPECT_EQ(report->loads, 2);
EXPECT_EQ(report->stores, 2);
});
auto routine = function(testName().c_str());
int result = routine(11);
EXPECT_EQ(result, 33);
}
// This test excercises the Optimizer::propagateAlloca() optimization pass.
// The pointer variable should not get stored to / loaded from memory.
TEST(ReactorUnitTests, PropagateAlloca)
{
FunctionT<int(int)> function;
{
Int b = function.Arg<0>();
Int a = 22;
Pointer<Int> p;
// This branch materializes both `a` and `p`, and ensures single basic block
// optimizations don't also eliminate the pointer store and load.
If(b != 0) // TODO(b/179922668): Support If(b)
{
p = &a;
}
Return(Int(*p)); // TODO(b/179694472): Support Return(*p)
}
Nucleus::setOptimizerCallback([](const Nucleus::OptimizerReport *report) {
EXPECT_EQ(report->allocas, 1);
EXPECT_EQ(report->loads, 1);
EXPECT_EQ(report->stores, 1);
});
auto routine = function(testName().c_str());
int result = routine(true);
EXPECT_EQ(result, 22);
}
// Corner case for Optimizer::propagateAlloca(). It should not replace loading of `p`
// with the addres of `a`, since it also got the address of `b` assigned.
TEST(ReactorUnitTests, PointerToPointer)
{
FunctionT<int()> function;
{
Int a = 444;
Int b = 555;
Pointer<Int> p = &a;
Pointer<Pointer<Int>> pp = &p;
p = &b;
Return(Int(*Pointer<Int>(*pp))); // TODO(b/179694472): Support **pp
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 555);
}
// Corner case for Optimizer::propagateAlloca(). It should not replace loading of `p[i]`
// with any of the addresses of the `a`, `b`, or `c`.
TEST(ReactorUnitTests, ArrayOfPointersToLocals)
{
FunctionT<int(int)> function;
{
Int i = function.Arg<0>();
Int a = 111;
Int b = 222;
Int c = 333;
Array<Pointer<Int>, 3> p;
p[0] = &a;
p[1] = &b;
p[2] = &c;
Return(Int(*Pointer<Int>(p[i]))); // TODO(b/179694472): Support *p[i]
}
auto routine = function(testName().c_str());
int result = routine(1);
EXPECT_EQ(result, 222);
}
TEST(ReactorUnitTests, ModifyLocalThroughPointer)
{
FunctionT<int(void)> function;
{
Int a = 1;
Pointer<Int> p = &a;
Pointer<Pointer<Int>> pp = &p;
Pointer<Int> q = *pp;
*q = 3;
Return(a);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 3);
}
TEST(ReactorUnitTests, ScalarReplacementOfArray)
{
FunctionT<int(void)> function;
{
Array<Int, 2> a;
a[0] = 1;
a[1] = 2;
Return(a[0] + a[1]);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 3);
}
TEST(ReactorUnitTests, CArray)
{
FunctionT<int(void)> function;
{
Int a[2];
a[0] = 1;
a[1] = 2;
auto x = a[0];
a[0] = a[1];
a[1] = x;
Return(a[0] + a[1]);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 3);
}
// SRoA should replace the array elements with scalars, which in turn enables
// eliminating all loads and stores.
TEST(ReactorUnitTests, ReactorArray)
{
FunctionT<int(void)> function;
{
Array<Int, 2> a;
a[0] = 1;
a[1] = 2;
Int x = a[0];
a[0] = a[1];
a[1] = x;
Return(a[0] + a[1]);
}
Nucleus::setOptimizerCallback([](const Nucleus::OptimizerReport *report) {
EXPECT_EQ(report->allocas, 0);
EXPECT_EQ(report->loads, 0);
EXPECT_EQ(report->stores, 0);
});
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 3);
}
// Excercises the optimizeSingleBasicBlockLoadsStores optimization pass.
TEST(ReactorUnitTests, StoresInMultipleBlocks)
{
FunctionT<int(int)> function;
{
Int b = function.Arg<0>();
Int a = 13;
If(b != 0) // TODO(b/179922668): Support If(b)
{
a = 4;
a = a + 3;
}
Else
{
a = 6;
a = a + 5;
}
Return(a);
}
Nucleus::setOptimizerCallback([](const Nucleus::OptimizerReport *report) {
EXPECT_EQ(report->allocas, 1);
EXPECT_EQ(report->loads, 1);
EXPECT_EQ(report->stores, 3);
});
auto routine = function(testName().c_str());
int result = routine(true);
EXPECT_EQ(result, 7);
}
// This is similar to the LoadAfterIndirectStore test except that the indirect
// store is preceded by a direct store. The subsequent load should not be replaced
// by the value written by the direct store.
TEST(ReactorUnitTests, StoreBeforeIndirectStore)
{
FunctionT<int(int)> function;
{
// Int b = function.Arg<0>();
Int b;
Pointer<Int> p = &b;
Int a = 13;
For(Int i = 0, i < 2, i++)
{
a = 10;
*p = 4;
// This load of `a` should not be replaced by the 10 written above, since
// in the second iteration `p` points to `a` and writes 4.
b = a;
p = &a;
}
Return(b);
}
auto routine = function(testName().c_str());
int result = routine(true);
EXPECT_EQ(result, 4);
}
TEST(ReactorUnitTests, AssertTrue)
{
FunctionT<int()> function;
{
Int a = 3;
Int b = 5;
Assert(a < b);
Return(a + b);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 8);
}
TEST(ReactorUnitTests, AssertFalse)
{
FunctionT<int()> function;
{
Int a = 3;
Int b = 5;
Assert(a == b);
Return(a + b);
}
auto routine = function(testName().c_str());
#ifndef NDEBUG
# if !defined(__APPLE__)
const char *stderrRegex = "AssertFalse"; // stderr should contain the assert's expression, file:line, and function
# else
const char *stderrRegex = ""; // TODO(b/156389924): On macOS an stderr redirect can cause googletest to fail the capture
# endif
EXPECT_DEATH(
{
int result = routine();
EXPECT_NE(result, result); // We should never reach this
},
stderrRegex);
#else
int result = routine();
EXPECT_EQ(result, 8);
#endif
}
TEST(ReactorUnitTests, SubVectorLoadStore)
{
FunctionT<int(void *, void *)> function;
{
Pointer<Byte> in = function.Arg<0>();
Pointer<Byte> out = function.Arg<1>();
*Pointer<Int4>(out + 16 * 0) = *Pointer<Int4>(in + 16 * 0);
*Pointer<Short4>(out + 16 * 1) = *Pointer<Short4>(in + 16 * 1);
*Pointer<Byte8>(out + 16 * 2) = *Pointer<Byte8>(in + 16 * 2);
*Pointer<Byte4>(out + 16 * 3) = *Pointer<Byte4>(in + 16 * 3);
*Pointer<Short2>(out + 16 * 4) = *Pointer<Short2>(in + 16 * 4);
Return(0);
}
auto routine = function(testName().c_str());
int8_t in[16 * 5] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 18, 19, 20, 21, 22, 23, 24, 0, 0, 0, 0, 0, 0, 0, 0,
25, 26, 27, 28, 29, 30, 31, 32, 0, 0, 0, 0, 0, 0, 0, 0,
33, 34, 35, 36, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
37, 38, 39, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
int8_t out[16 * 5] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 };
routine(in, out);
for(int row = 0; row < 5; row++)
{
for(int col = 0; col < 16; col++)
{
int i = row * 16 + col;
if(in[i] == 0)
{
EXPECT_EQ(out[i], -1) << "Row " << row << " column " << col << " not left untouched.";
}
else
{
EXPECT_EQ(out[i], in[i]) << "Row " << row << " column " << col << " not equal to input.";
}
}
}
}
TEST(ReactorUnitTests, VectorConstant)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Int4>(out + 16 * 0) = Int4(0x04030201, 0x08070605, 0x0C0B0A09, 0x100F0E0D);
*Pointer<Short4>(out + 16 * 1) = Short4(0x1211, 0x1413, 0x1615, 0x1817);
*Pointer<Byte8>(out + 16 * 2) = Byte8(0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20);
*Pointer<Int2>(out + 16 * 3) = Int2(0x24232221, 0x28272625);
Return(0);
}
auto routine = function(testName().c_str());
int8_t out[16 * 4] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 };
int8_t exp[16 * 4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 18, 19, 20, 21, 22, 23, 24, -1, -1, -1, -1, -1, -1, -1, -1,
25, 26, 27, 28, 29, 30, 31, 32, -1, -1, -1, -1, -1, -1, -1, -1,
33, 34, 35, 36, 37, 38, 39, 40, -1, -1, -1, -1, -1, -1, -1, -1 };
routine(out);
for(int row = 0; row < 4; row++)
{
for(int col = 0; col < 16; col++)
{
int i = row * 16 + col;
EXPECT_EQ(out[i], exp[i]);
}
}
}
TEST(ReactorUnitTests, Concatenate)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Int4>(out + 16 * 0) = Int4(Int2(0x04030201, 0x08070605), Int2(0x0C0B0A09, 0x100F0E0D));
*Pointer<Short8>(out + 16 * 1) = Short8(Short4(0x0201, 0x0403, 0x0605, 0x0807), Short4(0x0A09, 0x0C0B, 0x0E0D, 0x100F));
Return(0);
}
auto routine = function(testName().c_str());
int8_t ref[16 * 5] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
int8_t out[16 * 5] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 };
routine(out);
for(int row = 0; row < 2; row++)
{
for(int col = 0; col < 16; col++)
{
int i = row * 16 + col;
EXPECT_EQ(out[i], ref[i]) << "Row " << row << " column " << col << " not equal to reference.";
}
}
}
TEST(ReactorUnitTests, Cast)
{
FunctionT<void(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
Int4 c = Int4(0x01020304, 0x05060708, 0x09101112, 0x13141516);
*Pointer<Short4>(out + 16 * 0) = Short4(c);
*Pointer<Byte4>(out + 16 * 1 + 0) = Byte4(c);
*Pointer<Byte4>(out + 16 * 1 + 4) = Byte4(As<Byte8>(c));
*Pointer<Byte4>(out + 16 * 1 + 8) = Byte4(As<Short4>(c));
}
auto routine = function(testName().c_str());
int out[2][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x07080304);
EXPECT_EQ(out[0][1], 0x15161112);
EXPECT_EQ(out[1][0], 0x16120804);
EXPECT_EQ(out[1][1], 0x01020304);
EXPECT_EQ(out[1][2], 0x06080204);
}
static uint16_t swizzleCode4(int i)
{
auto x = (i >> 0) & 0x03;
auto y = (i >> 2) & 0x03;
auto z = (i >> 4) & 0x03;
auto w = (i >> 6) & 0x03;
return static_cast<uint16_t>((x << 12) | (y << 8) | (z << 4) | (w << 0));
}
TEST(ReactorUnitTests, Swizzle4)
{
FunctionT<void(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
for(int i = 0; i < 256; i++)
{
*Pointer<Float4>(out + 16 * i) = Swizzle(Float4(1.0f, 2.0f, 3.0f, 4.0f), swizzleCode4(i));
}
for(int i = 0; i < 256; i++)
{
*Pointer<Float4>(out + 16 * (256 + i)) = ShuffleLowHigh(Float4(1.0f, 2.0f, 3.0f, 4.0f), Float4(5.0f, 6.0f, 7.0f, 8.0f), swizzleCode4(i));
}
*Pointer<Float4>(out + 16 * (512 + 0)) = UnpackLow(Float4(1.0f, 2.0f, 3.0f, 4.0f), Float4(5.0f, 6.0f, 7.0f, 8.0f));
*Pointer<Float4>(out + 16 * (512 + 1)) = UnpackHigh(Float4(1.0f, 2.0f, 3.0f, 4.0f), Float4(5.0f, 6.0f, 7.0f, 8.0f));
*Pointer<Int2>(out + 16 * (512 + 2)) = UnpackLow(Short4(1, 2, 3, 4), Short4(5, 6, 7, 8));
*Pointer<Int2>(out + 16 * (512 + 3)) = UnpackHigh(Short4(1, 2, 3, 4), Short4(5, 6, 7, 8));
*Pointer<Short4>(out + 16 * (512 + 4)) = UnpackLow(Byte8(1, 2, 3, 4, 5, 6, 7, 8), Byte8(9, 10, 11, 12, 13, 14, 15, 16));
*Pointer<Short4>(out + 16 * (512 + 5)) = UnpackHigh(Byte8(1, 2, 3, 4, 5, 6, 7, 8), Byte8(9, 10, 11, 12, 13, 14, 15, 16));
for(int i = 0; i < 256; i++)
{
*Pointer<Short4>(out + 16 * (512 + 6) + (8 * i)) =
Swizzle(Short4(1, 2, 3, 4), swizzleCode4(i));
}
for(int i = 0; i < 256; i++)
{
*Pointer<Int4>(out + 16 * (512 + 6 + i) + (8 * 256)) =
Swizzle(Int4(1, 2, 3, 4), swizzleCode4(i));
}
}
auto routine = function(testName().c_str());
struct
{
float f[256 + 256 + 2][4];
int i[388][4];
} out;
memset(&out, 0, sizeof(out));
routine(&out);
for(int i = 0; i < 256; i++)
{
EXPECT_EQ(out.f[i][0], float((i >> 0) & 0x03) + 1.0f);
EXPECT_EQ(out.f[i][1], float((i >> 2) & 0x03) + 1.0f);
EXPECT_EQ(out.f[i][2], float((i >> 4) & 0x03) + 1.0f);
EXPECT_EQ(out.f[i][3], float((i >> 6) & 0x03) + 1.0f);
}
for(int i = 0; i < 256; i++)
{
EXPECT_EQ(out.f[256 + i][0], float((i >> 0) & 0x03) + 1.0f);
EXPECT_EQ(out.f[256 + i][1], float((i >> 2) & 0x03) + 1.0f);
EXPECT_EQ(out.f[256 + i][2], float((i >> 4) & 0x03) + 5.0f);
EXPECT_EQ(out.f[256 + i][3], float((i >> 6) & 0x03) + 5.0f);
}
EXPECT_EQ(out.f[512 + 0][0], 1.0f);
EXPECT_EQ(out.f[512 + 0][1], 5.0f);
EXPECT_EQ(out.f[512 + 0][2], 2.0f);
EXPECT_EQ(out.f[512 + 0][3], 6.0f);
EXPECT_EQ(out.f[512 + 1][0], 3.0f);
EXPECT_EQ(out.f[512 + 1][1], 7.0f);
EXPECT_EQ(out.f[512 + 1][2], 4.0f);
EXPECT_EQ(out.f[512 + 1][3], 8.0f);
EXPECT_EQ(out.i[0][0], 0x00050001);
EXPECT_EQ(out.i[0][1], 0x00060002);
EXPECT_EQ(out.i[0][2], 0x00000000);
EXPECT_EQ(out.i[0][3], 0x00000000);
EXPECT_EQ(out.i[1][0], 0x00070003);
EXPECT_EQ(out.i[1][1], 0x00080004);
EXPECT_EQ(out.i[1][2], 0x00000000);
EXPECT_EQ(out.i[1][3], 0x00000000);
EXPECT_EQ(out.i[2][0], 0x0A020901);
EXPECT_EQ(out.i[2][1], 0x0C040B03);
EXPECT_EQ(out.i[2][2], 0x00000000);
EXPECT_EQ(out.i[2][3], 0x00000000);
EXPECT_EQ(out.i[3][0], 0x0E060D05);
EXPECT_EQ(out.i[3][1], 0x10080F07);
EXPECT_EQ(out.i[3][2], 0x00000000);
EXPECT_EQ(out.i[3][3], 0x00000000);
for(int i = 0; i < 256; i++)
{
EXPECT_EQ(out.i[4 + i / 2][0 + (i % 2) * 2] & 0xFFFF,
((i >> 0) & 0x03) + 1);
EXPECT_EQ(out.i[4 + i / 2][0 + (i % 2) * 2] >> 16,
((i >> 2) & 0x03) + 1);
EXPECT_EQ(out.i[4 + i / 2][1 + (i % 2) * 2] & 0xFFFF,
((i >> 4) & 0x03) + 1);
EXPECT_EQ(out.i[4 + i / 2][1 + (i % 2) * 2] >> 16,
((i >> 6) & 0x03) + 1);
}
for(int i = 0; i < 256; i++)
{
EXPECT_EQ(out.i[132 + i][0], ((i >> 0) & 0x03) + 1);
EXPECT_EQ(out.i[132 + i][1], ((i >> 2) & 0x03) + 1);
EXPECT_EQ(out.i[132 + i][2], ((i >> 4) & 0x03) + 1);
EXPECT_EQ(out.i[132 + i][3], ((i >> 6) & 0x03) + 1);
}
}
TEST(ReactorUnitTests, Swizzle)
{
FunctionT<void(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
Int4 c = Int4(0x01020304, 0x05060708, 0x09101112, 0x13141516);
*Pointer<Byte16>(out + 16 * 0) = Swizzle(As<Byte16>(c), 0xFEDCBA9876543210ull);
*Pointer<Byte8>(out + 16 * 1) = Swizzle(As<Byte8>(c), 0x76543210u);
*Pointer<UShort8>(out + 16 * 2) = Swizzle(As<UShort8>(c), 0x76543210u);
}
auto routine = function(testName().c_str());
int out[3][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x16151413);
EXPECT_EQ(out[0][1], 0x12111009);
EXPECT_EQ(out[0][2], 0x08070605);
EXPECT_EQ(out[0][3], 0x04030201);
EXPECT_EQ(out[1][0], 0x08070605);
EXPECT_EQ(out[1][1], 0x04030201);
EXPECT_EQ(out[2][0], 0x15161314);
EXPECT_EQ(out[2][1], 0x11120910);
EXPECT_EQ(out[2][2], 0x07080506);
EXPECT_EQ(out[2][3], 0x03040102);
}
TEST(ReactorUnitTests, Shuffle)
{
// |select| is [0aaa:0bbb:0ccc:0ddd] where |aaa|, |bbb|, |ccc|
// and |ddd| are 7-bit selection indices. For a total (1 << 12)
// possibilities.
const int kSelectRange = 1 << 12;
// Unfortunately, testing the whole kSelectRange results in a test
// that is far too slow to run, because LLVM spends exponentially more
// time optimizing the function below as the number of test cases
// increases.
//
// To work-around the problem, only test a subset of the range by
// skipping every kRangeIncrement value.
//
// Set this value to 1 if you want to test the whole implementation,
// which will take a little less than 2 minutes on a fast workstation.
//
// The default value here takes about 1390ms, which is a little more than
// what the Swizzle test takes (993 ms) on my machine. A non-power-of-2
// value ensures a better spread over possible values.
const int kRangeIncrement = 11;
auto rangeIndexToSelect = [](int i) {
return static_cast<unsigned short>(
(((i >> 9) & 7) << 0) |
(((i >> 6) & 7) << 4) |
(((i >> 3) & 7) << 8) |
(((i >> 0) & 7) << 12));
};
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
for(int i = 0; i < kSelectRange; i += kRangeIncrement)
{
unsigned short select = rangeIndexToSelect(i);
*Pointer<Float4>(out + 16 * i) = Shuffle(Float4(1.0f, 2.0f, 3.0f, 4.0f),
Float4(5.0f, 6.0f, 7.0f, 8.0f),
select);
*Pointer<Int4>(out + (kSelectRange + i) * 16) = Shuffle(Int4(10, 11, 12, 13),
Int4(14, 15, 16, 17),
select);
*Pointer<UInt4>(out + (2 * kSelectRange + i) * 16) = Shuffle(UInt4(100, 101, 102, 103),
UInt4(104, 105, 106, 107),
select);
}
Return(0);
}
auto routine = function(testName().c_str());
struct
{
float f[kSelectRange][4];
int i[kSelectRange][4];
unsigned u[kSelectRange][4];
} out;
memset(&out, 0, sizeof(out));
routine(&out);
for(int i = 0; i < kSelectRange; i += kRangeIncrement)
{
EXPECT_EQ(out.f[i][0], float(1.0f + (i & 7)));
EXPECT_EQ(out.f[i][1], float(1.0f + ((i >> 3) & 7)));
EXPECT_EQ(out.f[i][2], float(1.0f + ((i >> 6) & 7)));
EXPECT_EQ(out.f[i][3], float(1.0f + ((i >> 9) & 7)));
}
for(int i = 0; i < kSelectRange; i += kRangeIncrement)
{
EXPECT_EQ(out.i[i][0], int(10 + (i & 7)));
EXPECT_EQ(out.i[i][1], int(10 + ((i >> 3) & 7)));
EXPECT_EQ(out.i[i][2], int(10 + ((i >> 6) & 7)));
EXPECT_EQ(out.i[i][3], int(10 + ((i >> 9) & 7)));
}
for(int i = 0; i < kSelectRange; i += kRangeIncrement)
{
EXPECT_EQ(out.u[i][0], unsigned(100 + (i & 7)));
EXPECT_EQ(out.u[i][1], unsigned(100 + ((i >> 3) & 7)));
EXPECT_EQ(out.u[i][2], unsigned(100 + ((i >> 6) & 7)));
EXPECT_EQ(out.u[i][3], unsigned(100 + ((i >> 9) & 7)));
}
}
TEST(ReactorUnitTests, Broadcast)
{
FunctionT<int()> function;
{
Int4 i = 2;
Int j = 3 + i.x;
Int4 k = i * 7;
Return(k.z - j);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 9);
}
TEST(ReactorUnitTests, Branching)
{
FunctionT<int()> function;
{
Int x = 0;
For(Int i = 0, i < 8, i++)
{
If(i < 2)
{
x += 1;
}
Else If(i < 4)
{
x += 10;
}
Else If(i < 6)
{
x += 100;
}
Else
{
x += 1000;
}
For(Int i = 0, i < 5, i++)
x += 10000;
}
For(Int i = 0, i < 10, i++) for(int i = 0; i < 10; i++)
For(Int i = 0, i < 10, i++)
{
x += 1000000;
}
For(Int i = 0, i < 2, i++)
If(x == 1000402222)
{
If(x != 1000402222)
x += 1000000000;
}
Else
x = -5;
Return(x);
}
auto routine = function(testName().c_str());
int result = routine();
EXPECT_EQ(result, 1000402222);
}
TEST(ReactorUnitTests, FMulAdd)
{
Function<Void(Pointer<Float4>, Pointer<Float4>, Pointer<Float4>, Pointer<Float4>)> function;
{
Pointer<Float4> r = function.Arg<0>();
Pointer<Float4> x = function.Arg<1>();
Pointer<Float4> y = function.Arg<2>();
Pointer<Float4> z = function.Arg<3>();
*r = MulAdd(*x, *y, *z);
}
auto routine = function(testName().c_str());
auto callable = (void (*)(float4 *, float4 *, float4 *, float4 *))routine->getEntry();
float x[] = { 0.0f, 2.0f, 4.0f, 1.00000011920929f };
float y[] = { 0.0f, 3.0f, 0.0f, 53400708.0f };
float z[] = { 0.0f, 0.0f, 7.0f, -53400708.0f };
for(size_t i = 0; i < std::size(x); i++)
{
float4 x_in = { x[i], x[i], x[i], x[i] };
float4 y_in = { y[i], y[i], y[i], y[i] };
float4 z_in = { z[i], z[i], z[i], z[i] };
float4 r_out;
callable(&r_out, &x_in, &y_in, &z_in);
// Possible results
float fma = fmaf(x[i], y[i], z[i]);
float mul_add = x[i] * y[i] + z[i];
// If the backend and the CPU support FMA instructions, we assume MulAdd to use
// them. Otherwise it may behave as a multiplication followed by an addition.
if(rr::Caps::fmaIsFast())
{
EXPECT_FLOAT_EQ(r_out[0], fma);
}
else if(r_out[0] != fma)
{
EXPECT_FLOAT_EQ(r_out[0], mul_add);
}
}
}
TEST(ReactorUnitTests, FMA)
{
Function<Void(Pointer<Float4>, Pointer<Float4>, Pointer<Float4>, Pointer<Float4>)> function;
{
Pointer<Float4> r = function.Arg<0>();
Pointer<Float4> x = function.Arg<1>();
Pointer<Float4> y = function.Arg<2>();
Pointer<Float4> z = function.Arg<3>();
*r = FMA(*x, *y, *z);
}
auto routine = function(testName().c_str());
auto callable = (void (*)(float4 *, float4 *, float4 *, float4 *))routine->getEntry();
float x[] = { 0.0f, 2.0f, 4.0f, 1.00000011920929f };
float y[] = { 0.0f, 3.0f, 0.0f, 53400708.0f };
float z[] = { 0.0f, 0.0f, 7.0f, -53400708.0f };
for(size_t i = 0; i < std::size(x); i++)
{
float4 x_in = { x[i], x[i], x[i], x[i] };
float4 y_in = { y[i], y[i], y[i], y[i] };
float4 z_in = { z[i], z[i], z[i], z[i] };
float4 r_out;
callable(&r_out, &x_in, &y_in, &z_in);
float expected = fmaf(x[i], y[i], z[i]);
EXPECT_FLOAT_EQ(r_out[0], expected);
}
}
TEST(ReactorUnitTests, FAbs)
{
Function<Void(Pointer<Float4>, Pointer<Float4>)> function;
{
Pointer<Float4> x = function.Arg<0>();
Pointer<Float4> y = function.Arg<1>();
*y = Abs(*x);
}
auto routine = function(testName().c_str());
auto callable = (void (*)(float4 *, float4 *))routine->getEntry();
float input[] = { 1.0f, -1.0f, -0.0f, 0.0f };
for(float x : input)
{
float4 v_in = { x, x, x, x };
float4 v_out;
callable(&v_in, &v_out);
float expected = fabs(x);
EXPECT_FLOAT_EQ(v_out[0], expected);
}
}
TEST(ReactorUnitTests, Abs)
{
Function<Void(Pointer<Int4>, Pointer<Int4>)> function;
{
Pointer<Int4> x = function.Arg<0>();
Pointer<Int4> y = function.Arg<1>();
*y = Abs(*x);
}
auto routine = function(testName().c_str());
auto callable = (void (*)(int4 *, int4 *))routine->getEntry();
int input[] = { 1, -1, 0, (int)0x80000000 };
for(int x : input)
{
int4 v_in = { x, x, x, x };
int4 v_out;
callable(&v_in, &v_out);
float expected = abs(x);
EXPECT_EQ(v_out[0], expected);
}
}
TEST(ReactorUnitTests, MinMax)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Float4>(out + 16 * 0) = Min(Float4(1.0f, 0.0f, -0.0f, +0.0f), Float4(0.0f, 1.0f, +0.0f, -0.0f));
*Pointer<Float4>(out + 16 * 1) = Max(Float4(1.0f, 0.0f, -0.0f, +0.0f), Float4(0.0f, 1.0f, +0.0f, -0.0f));
*Pointer<Int4>(out + 16 * 2) = Min(Int4(1, 0, -1, -0), Int4(0, 1, 0, +0));
*Pointer<Int4>(out + 16 * 3) = Max(Int4(1, 0, -1, -0), Int4(0, 1, 0, +0));
*Pointer<UInt4>(out + 16 * 4) = Min(UInt4(1, 0, -1, -0), UInt4(0, 1, 0, +0));
*Pointer<UInt4>(out + 16 * 5) = Max(UInt4(1, 0, -1, -0), UInt4(0, 1, 0, +0));
*Pointer<Short4>(out + 16 * 6) = Min(Short4(1, 0, -1, -0), Short4(0, 1, 0, +0));
*Pointer<Short4>(out + 16 * 7) = Max(Short4(1, 0, -1, -0), Short4(0, 1, 0, +0));
*Pointer<UShort4>(out + 16 * 8) = Min(UShort4(1, 0, -1, -0), UShort4(0, 1, 0, +0));
*Pointer<UShort4>(out + 16 * 9) = Max(UShort4(1, 0, -1, -0), UShort4(0, 1, 0, +0));
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[10][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x00000000u);
EXPECT_EQ(out[0][1], 0x00000000u);
EXPECT_EQ(out[0][2], 0x00000000u);
EXPECT_EQ(out[0][3], 0x80000000u);
EXPECT_EQ(out[1][0], 0x3F800000u);
EXPECT_EQ(out[1][1], 0x3F800000u);
EXPECT_EQ(out[1][2], 0x00000000u);
EXPECT_EQ(out[1][3], 0x80000000u);
EXPECT_EQ(out[2][0], 0x00000000u);
EXPECT_EQ(out[2][1], 0x00000000u);
EXPECT_EQ(out[2][2], 0xFFFFFFFFu);
EXPECT_EQ(out[2][3], 0x00000000u);
EXPECT_EQ(out[3][0], 0x00000001u);
EXPECT_EQ(out[3][1], 0x00000001u);
EXPECT_EQ(out[3][2], 0x00000000u);
EXPECT_EQ(out[3][3], 0x00000000u);
EXPECT_EQ(out[4][0], 0x00000000u);
EXPECT_EQ(out[4][1], 0x00000000u);
EXPECT_EQ(out[4][2], 0x00000000u);
EXPECT_EQ(out[4][3], 0x00000000u);
EXPECT_EQ(out[5][0], 0x00000001u);
EXPECT_EQ(out[5][1], 0x00000001u);
EXPECT_EQ(out[5][2], 0xFFFFFFFFu);
EXPECT_EQ(out[5][3], 0x00000000u);
EXPECT_EQ(out[6][0], 0x00000000u);
EXPECT_EQ(out[6][1], 0x0000FFFFu);
EXPECT_EQ(out[6][2], 0x00000000u);
EXPECT_EQ(out[6][3], 0x00000000u);
EXPECT_EQ(out[7][0], 0x00010001u);
EXPECT_EQ(out[7][1], 0x00000000u);
EXPECT_EQ(out[7][2], 0x00000000u);
EXPECT_EQ(out[7][3], 0x00000000u);
EXPECT_EQ(out[8][0], 0x00000000u);
EXPECT_EQ(out[8][1], 0x00000000u);
EXPECT_EQ(out[8][2], 0x00000000u);
EXPECT_EQ(out[8][3], 0x00000000u);
EXPECT_EQ(out[9][0], 0x00010001u);
EXPECT_EQ(out[9][1], 0x0000FFFFu);
EXPECT_EQ(out[9][2], 0x00000000u);
EXPECT_EQ(out[9][3], 0x00000000u);
}
TEST(ReactorUnitTests, NotNeg)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Int>(out + 16 * 0) = ~Int(0x55555555);
*Pointer<Short>(out + 16 * 1) = ~Short(0x5555);
*Pointer<Int4>(out + 16 * 2) = ~Int4(0x55555555, 0xAAAAAAAA, 0x00000000, 0xFFFFFFFF);
*Pointer<Short4>(out + 16 * 3) = ~Short4(0x5555, 0xAAAA, 0x0000, 0xFFFF);
*Pointer<Int>(out + 16 * 4) = -Int(0x55555555);
*Pointer<Short>(out + 16 * 5) = -Short(0x5555);
*Pointer<Int4>(out + 16 * 6) = -Int4(0x55555555, 0xAAAAAAAA, 0x00000000, 0xFFFFFFFF);
*Pointer<Short4>(out + 16 * 7) = -Short4(0x5555, 0xAAAA, 0x0000, 0xFFFF);
*Pointer<Float4>(out + 16 * 8) = -Float4(1.0f, -1.0f, 0.0f, -0.0f);
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[10][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0xAAAAAAAAu);
EXPECT_EQ(out[0][1], 0x00000000u);
EXPECT_EQ(out[0][2], 0x00000000u);
EXPECT_EQ(out[0][3], 0x00000000u);
EXPECT_EQ(out[1][0], 0x0000AAAAu);
EXPECT_EQ(out[1][1], 0x00000000u);
EXPECT_EQ(out[1][2], 0x00000000u);
EXPECT_EQ(out[1][3], 0x00000000u);
EXPECT_EQ(out[2][0], 0xAAAAAAAAu);
EXPECT_EQ(out[2][1], 0x55555555u);
EXPECT_EQ(out[2][2], 0xFFFFFFFFu);
EXPECT_EQ(out[2][3], 0x00000000u);
EXPECT_EQ(out[3][0], 0x5555AAAAu);
EXPECT_EQ(out[3][1], 0x0000FFFFu);
EXPECT_EQ(out[3][2], 0x00000000u);
EXPECT_EQ(out[3][3], 0x00000000u);
EXPECT_EQ(out[4][0], 0xAAAAAAABu);
EXPECT_EQ(out[4][1], 0x00000000u);
EXPECT_EQ(out[4][2], 0x00000000u);
EXPECT_EQ(out[4][3], 0x00000000u);
EXPECT_EQ(out[5][0], 0x0000AAABu);
EXPECT_EQ(out[5][1], 0x00000000u);
EXPECT_EQ(out[5][2], 0x00000000u);
EXPECT_EQ(out[5][3], 0x00000000u);
EXPECT_EQ(out[6][0], 0xAAAAAAABu);
EXPECT_EQ(out[6][1], 0x55555556u);
EXPECT_EQ(out[6][2], 0x00000000u);
EXPECT_EQ(out[6][3], 0x00000001u);
EXPECT_EQ(out[7][0], 0x5556AAABu);
EXPECT_EQ(out[7][1], 0x00010000u);
EXPECT_EQ(out[7][2], 0x00000000u);
EXPECT_EQ(out[7][3], 0x00000000u);
EXPECT_EQ(out[8][0], 0xBF800000u);
EXPECT_EQ(out[8][1], 0x3F800000u);
EXPECT_EQ(out[8][2], 0x80000000u);
EXPECT_EQ(out[8][3], 0x00000000u);
}
TEST(ReactorUnitTests, RoundInt)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Int4>(out + 0) = RoundInt(Float4(3.1f, 3.6f, -3.1f, -3.6f));
*Pointer<Int4>(out + 16) = RoundIntClamped(Float4(2147483648.0f, -2147483648.0f, 2147483520, -2147483520));
Return(0);
}
auto routine = function(testName().c_str());
int out[2][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 3);
EXPECT_EQ(out[0][1], 4);
EXPECT_EQ(out[0][2], -3);
EXPECT_EQ(out[0][3], -4);
// x86 returns 0x80000000 for values which cannot be represented in a 32-bit
// integer, but RoundIntClamped() clamps to ensure a positive value for
// positive input. ARM saturates to the largest representable integers.
EXPECT_GE(out[1][0], 2147483520);
EXPECT_LT(out[1][1], -2147483647);
EXPECT_EQ(out[1][2], 2147483520);
EXPECT_EQ(out[1][3], -2147483520);
}
TEST(ReactorUnitTests, FPtoUI)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<UInt>(out + 0) = UInt(Float(0xF0000000u));
*Pointer<UInt>(out + 4) = UInt(Float(0xC0000000u));
*Pointer<UInt>(out + 8) = UInt(Float(0x00000001u));
*Pointer<UInt>(out + 12) = UInt(Float(0xF000F000u));
*Pointer<UInt4>(out + 16) = UInt4(Float4(0xF0000000u, 0x80000000u, 0x00000000u, 0xCCCC0000u));
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[2][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0xF0000000u);
EXPECT_EQ(out[0][1], 0xC0000000u);
EXPECT_EQ(out[0][2], 0x00000001u);
EXPECT_EQ(out[0][3], 0xF000F000u);
EXPECT_EQ(out[1][0], 0xF0000000u);
EXPECT_EQ(out[1][1], 0x80000000u);
EXPECT_EQ(out[1][2], 0x00000000u);
EXPECT_EQ(out[1][3], 0xCCCC0000u);
}
TEST(ReactorUnitTests, VectorCompare)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Int4>(out + 16 * 0) = CmpEQ(Float4(1.0f, 1.0f, -0.0f, +0.0f), Float4(0.0f, 1.0f, +0.0f, -0.0f));
*Pointer<Int4>(out + 16 * 1) = CmpEQ(Int4(1, 0, -1, -0), Int4(0, 1, 0, +0));
*Pointer<Byte8>(out + 16 * 2) = CmpEQ(SByte8(1, 2, 3, 4, 5, 6, 7, 8), SByte8(7, 6, 5, 4, 3, 2, 1, 0));
*Pointer<Int4>(out + 16 * 3) = CmpNLT(Float4(1.0f, 1.0f, -0.0f, +0.0f), Float4(0.0f, 1.0f, +0.0f, -0.0f));
*Pointer<Int4>(out + 16 * 4) = CmpNLT(Int4(1, 0, -1, -0), Int4(0, 1, 0, +0));
*Pointer<Byte8>(out + 16 * 5) = CmpGT(SByte8(1, 2, 3, 4, 5, 6, 7, 8), SByte8(7, 6, 5, 4, 3, 2, 1, 0));
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[6][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x00000000u);
EXPECT_EQ(out[0][1], 0xFFFFFFFFu);
EXPECT_EQ(out[0][2], 0xFFFFFFFFu);
EXPECT_EQ(out[0][3], 0xFFFFFFFFu);
EXPECT_EQ(out[1][0], 0x00000000u);
EXPECT_EQ(out[1][1], 0x00000000u);
EXPECT_EQ(out[1][2], 0x00000000u);
EXPECT_EQ(out[1][3], 0xFFFFFFFFu);
EXPECT_EQ(out[2][0], 0xFF000000u);
EXPECT_EQ(out[2][1], 0x00000000u);
EXPECT_EQ(out[3][0], 0xFFFFFFFFu);
EXPECT_EQ(out[3][1], 0xFFFFFFFFu);
EXPECT_EQ(out[3][2], 0xFFFFFFFFu);
EXPECT_EQ(out[3][3], 0xFFFFFFFFu);
EXPECT_EQ(out[4][0], 0xFFFFFFFFu);
EXPECT_EQ(out[4][1], 0x00000000u);
EXPECT_EQ(out[4][2], 0x00000000u);
EXPECT_EQ(out[4][3], 0xFFFFFFFFu);
EXPECT_EQ(out[5][0], 0x00000000u);
EXPECT_EQ(out[5][1], 0xFFFFFFFFu);
}
TEST(ReactorUnitTests, SaturatedAddAndSubtract)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Byte8>(out + 8 * 0) =
AddSat(Byte8(1, 2, 3, 4, 5, 6, 7, 8),
Byte8(7, 6, 5, 4, 3, 2, 1, 0));
*Pointer<Byte8>(out + 8 * 1) =
AddSat(Byte8(0xFE, 0xFE, 0xFE, 0xFE, 0xFE, 0xFE, 0xFE, 0xFE),
Byte8(7, 6, 5, 4, 3, 2, 1, 0));
*Pointer<Byte8>(out + 8 * 2) =
SubSat(Byte8(1, 2, 3, 4, 5, 6, 7, 8),
Byte8(7, 6, 5, 4, 3, 2, 1, 0));
*Pointer<SByte8>(out + 8 * 3) =
AddSat(SByte8(1, 2, 3, 4, 5, 6, 7, 8),
SByte8(7, 6, 5, 4, 3, 2, 1, 0));
*Pointer<SByte8>(out + 8 * 4) =
AddSat(SByte8(0x7E, 0x7E, 0x7E, 0x7E, 0x7E, 0x7E, 0x7E, 0x7E),
SByte8(7, 6, 5, 4, 3, 2, 1, 0));
*Pointer<SByte8>(out + 8 * 5) =
AddSat(SByte8(0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88),
SByte8(-7, -6, -5, -4, -3, -2, -1, -0));
*Pointer<SByte8>(out + 8 * 6) =
SubSat(SByte8(0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88),
SByte8(7, 6, 5, 4, 3, 2, 1, 0));
*Pointer<Short4>(out + 8 * 7) =
AddSat(Short4(1, 2, 3, 4), Short4(3, 2, 1, 0));
*Pointer<Short4>(out + 8 * 8) =
AddSat(Short4(0x7FFE, 0x7FFE, 0x7FFE, 0x7FFE),
Short4(3, 2, 1, 0));
*Pointer<Short4>(out + 8 * 9) =
AddSat(Short4(0x8001, 0x8002, 0x8003, 0x8004),
Short4(-3, -2, -1, -0));
*Pointer<Short4>(out + 8 * 10) =
SubSat(Short4(0x8001, 0x8002, 0x8003, 0x8004),
Short4(3, 2, 1, 0));
*Pointer<UShort4>(out + 8 * 11) =
AddSat(UShort4(1, 2, 3, 4), UShort4(3, 2, 1, 0));
*Pointer<UShort4>(out + 8 * 12) =
AddSat(UShort4(0xFFFE, 0xFFFE, 0xFFFE, 0xFFFE),
UShort4(3, 2, 1, 0));
*Pointer<UShort4>(out + 8 * 13) =
SubSat(UShort4(1, 2, 3, 4), UShort4(3, 2, 1, 0));
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[14][2];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x08080808u);
EXPECT_EQ(out[0][1], 0x08080808u);
EXPECT_EQ(out[1][0], 0xFFFFFFFFu);
EXPECT_EQ(out[1][1], 0xFEFFFFFFu);
EXPECT_EQ(out[2][0], 0x00000000u);
EXPECT_EQ(out[2][1], 0x08060402u);
EXPECT_EQ(out[3][0], 0x08080808u);
EXPECT_EQ(out[3][1], 0x08080808u);
EXPECT_EQ(out[4][0], 0x7F7F7F7Fu);
EXPECT_EQ(out[4][1], 0x7E7F7F7Fu);
EXPECT_EQ(out[5][0], 0x80808080u);
EXPECT_EQ(out[5][1], 0x88868482u);
EXPECT_EQ(out[6][0], 0x80808080u);
EXPECT_EQ(out[6][1], 0x88868482u);
EXPECT_EQ(out[7][0], 0x00040004u);
EXPECT_EQ(out[7][1], 0x00040004u);
EXPECT_EQ(out[8][0], 0x7FFF7FFFu);
EXPECT_EQ(out[8][1], 0x7FFE7FFFu);
EXPECT_EQ(out[9][0], 0x80008000u);
EXPECT_EQ(out[9][1], 0x80048002u);
EXPECT_EQ(out[10][0], 0x80008000u);
EXPECT_EQ(out[10][1], 0x80048002u);
EXPECT_EQ(out[11][0], 0x00040004u);
EXPECT_EQ(out[11][1], 0x00040004u);
EXPECT_EQ(out[12][0], 0xFFFFFFFFu);
EXPECT_EQ(out[12][1], 0xFFFEFFFFu);
EXPECT_EQ(out[13][0], 0x00000000u);
EXPECT_EQ(out[13][1], 0x00040002u);
}
TEST(ReactorUnitTests, Unpack)
{
FunctionT<int(void *, void *)> function;
{
Pointer<Byte> in = function.Arg<0>();
Pointer<Byte> out = function.Arg<1>();
Byte4 test_byte_a = *Pointer<Byte4>(in + 4 * 0);
Byte4 test_byte_b = *Pointer<Byte4>(in + 4 * 1);
*Pointer<Short4>(out + 8 * 0) =
Unpack(test_byte_a, test_byte_b);
*Pointer<Short4>(out + 8 * 1) = Unpack(test_byte_a);
Return(0);
}
auto routine = function(testName().c_str());
unsigned int in[1][2];
unsigned int out[2][2];
memset(&out, 0, sizeof(out));
in[0][0] = 0xABCDEF12u;
in[0][1] = 0x34567890u;
routine(&in, &out);
EXPECT_EQ(out[0][0], 0x78EF9012u);
EXPECT_EQ(out[0][1], 0x34AB56CDu);
EXPECT_EQ(out[1][0], 0xEFEF1212u);
EXPECT_EQ(out[1][1], 0xABABCDCDu);
}
TEST(ReactorUnitTests, Pack)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<SByte8>(out + 8 * 0) =
PackSigned(Short4(-1, -2, 1, 2),
Short4(3, 4, -3, -4));
*Pointer<Byte8>(out + 8 * 1) =
PackUnsigned(Short4(-1, -2, 1, 2),
Short4(3, 4, -3, -4));
*Pointer<Short8>(out + 8 * 2) =
PackSigned(Int4(-1, -2, 1, 2),
Int4(3, 4, -3, -4));
*Pointer<UShort8>(out + 8 * 4) =
PackUnsigned(Int4(-1, -2, 1, 2),
Int4(3, 4, -3, -4));
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[6][2];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x0201FEFFu);
EXPECT_EQ(out[0][1], 0xFCFD0403u);
EXPECT_EQ(out[1][0], 0x02010000u);
EXPECT_EQ(out[1][1], 0x00000403u);
EXPECT_EQ(out[2][0], 0xFFFEFFFFu);
EXPECT_EQ(out[2][1], 0x00020001u);
EXPECT_EQ(out[3][0], 0x00040003u);
EXPECT_EQ(out[3][1], 0xFFFCFFFDu);
EXPECT_EQ(out[4][0], 0x00000000u);
EXPECT_EQ(out[4][1], 0x00020001u);
EXPECT_EQ(out[5][0], 0x00040003u);
EXPECT_EQ(out[5][1], 0x00000000u);
}
TEST(ReactorUnitTests, MulHigh)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Short4>(out + 16 * 0) =
MulHigh(Short4(0x01AA, 0x02DD, 0x03EE, 0xF422),
Short4(0x01BB, 0x02CC, 0x03FF, 0xF411));
*Pointer<UShort4>(out + 16 * 1) =
MulHigh(UShort4(0x01AA, 0x02DD, 0x03EE, 0xF422),
UShort4(0x01BB, 0x02CC, 0x03FF, 0xF411));
*Pointer<Int4>(out + 16 * 2) =
MulHigh(Int4(0x000001AA, 0x000002DD, 0xC8000000, 0xF8000000),
Int4(0x000001BB, 0x84000000, 0x000003EE, 0xD7000000));
*Pointer<UInt4>(out + 16 * 3) =
MulHigh(UInt4(0x000001AAu, 0x000002DDu, 0xC8000000u, 0xD8000000u),
UInt4(0x000001BBu, 0x84000000u, 0x000003EEu, 0xD7000000u));
*Pointer<Int4>(out + 16 * 4) =
MulHigh(Int4(0x7FFFFFFF, 0x7FFFFFFF, 0x80008000, 0xFFFFFFFF),
Int4(0x7FFFFFFF, 0x80000000, 0x80008000, 0xFFFFFFFF));
*Pointer<UInt4>(out + 16 * 5) =
MulHigh(UInt4(0x7FFFFFFFu, 0x7FFFFFFFu, 0x80008000u, 0xFFFFFFFFu),
UInt4(0x7FFFFFFFu, 0x80000000u, 0x80008000u, 0xFFFFFFFFu));
// (U)Short8 variants currently unimplemented.
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[6][4];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x00080002u);
EXPECT_EQ(out[0][1], 0x008D000Fu);
EXPECT_EQ(out[1][0], 0x00080002u);
EXPECT_EQ(out[1][1], 0xE8C0000Fu);
EXPECT_EQ(out[2][0], 0x00000000u);
EXPECT_EQ(out[2][1], 0xFFFFFE9Cu);
EXPECT_EQ(out[2][2], 0xFFFFFF23u);
EXPECT_EQ(out[2][3], 0x01480000u);
EXPECT_EQ(out[3][0], 0x00000000u);
EXPECT_EQ(out[3][1], 0x00000179u);
EXPECT_EQ(out[3][2], 0x00000311u);
EXPECT_EQ(out[3][3], 0xB5680000u);
EXPECT_EQ(out[4][0], 0x3FFFFFFFu);
EXPECT_EQ(out[4][1], 0xC0000000u);
EXPECT_EQ(out[4][2], 0x3FFF8000u);
EXPECT_EQ(out[4][3], 0x00000000u);
EXPECT_EQ(out[5][0], 0x3FFFFFFFu);
EXPECT_EQ(out[5][1], 0x3FFFFFFFu);
EXPECT_EQ(out[5][2], 0x40008000u);
EXPECT_EQ(out[5][3], 0xFFFFFFFEu);
}
TEST(ReactorUnitTests, MulAdd)
{
FunctionT<int(void *)> function;
{
Pointer<Byte> out = function.Arg<0>();
*Pointer<Int2>(out + 8 * 0) =
MulAdd(Short4(0x1aa, 0x2dd, 0x3ee, 0xF422),
Short4(0x1bb, 0x2cc, 0x3ff, 0xF411));
// (U)Short8 variant is mentioned but unimplemented
Return(0);
}
auto routine = function(testName().c_str());
unsigned int out[1][2];
memset(&out, 0, sizeof(out));
routine(&out);
EXPECT_EQ(out[0][0], 0x000AE34Au);
EXPECT_EQ(out[0][1], 0x009D5254u);
}
TEST(ReactorUnitTests, PointersEqual)
{
FunctionT<int(void *, void *)> function;
{
Pointer<Byte> ptrA = function.Arg<0>();
Pointer<Byte> ptrB = function.Arg<1>();
If(ptrA == ptrB)
{
Return(1);
}
Else
{
Return(0);
}
}
auto routine = function(testName().c_str());
int *a = reinterpret_cast<int *>(uintptr_t(0x0000000000000000));
int *b = reinterpret_cast<int *>(uintptr_t(0x00000000F0000000));
int *c = reinterpret_cast<int *>(uintptr_t(0xF000000000000000));
EXPECT_EQ(routine(&a, &a), 1);
EXPECT_EQ(routine(&b, &b), 1);
EXPECT_EQ(routine(&c, &c), 1);
EXPECT_EQ(routine(&a, &b), 0);
EXPECT_EQ(routine(&b, &a), 0);
EXPECT_EQ(routine(&b, &c), 0);
EXPECT_EQ(routine(&c, &b), 0);
EXPECT_EQ(routine(&c, &a), 0);
EXPECT_EQ(routine(&a, &c), 0);
}
TEST(ReactorUnitTests, Args_2Mixed)
{
// 2 mixed type args
FunctionT<float(int, float)> function;
{
Int a = function.Arg<0>();
Float b = function.Arg<1>();
Return(Float(a) + b);
}
if(auto routine = function(testName().c_str()))
{
float result = routine(1, 2.f);
EXPECT_EQ(result, 3.f);
}
}
TEST(ReactorUnitTests, Args_4Mixed)
{
// 4 mixed type args (max register allocation on Windows)
FunctionT<float(int, float, int, float)> function;
{
Int a = function.Arg<0>();
Float b = function.Arg<1>();
Int c = function.Arg<2>();
Float d = function.Arg<3>();
Return(Float(a) + b + Float(c) + d);
}
if(auto routine = function(testName().c_str()))
{
float result = routine(1, 2.f, 3, 4.f);
EXPECT_EQ(result, 10.f);
}
}
TEST(ReactorUnitTests, Args_5Mixed)
{
// 5 mixed type args (5th spills over to stack on Windows)
FunctionT<float(int, float, int, float, int)> function;
{
Int a = function.Arg<0>();
Float b = function.Arg<1>();
Int c = function.Arg<2>();
Float d = function.Arg<3>();
Int e = function.Arg<4>();
Return(Float(a) + b + Float(c) + d + Float(e));
}
if(auto routine = function(testName().c_str()))
{
float result = routine(1, 2.f, 3, 4.f, 5);
EXPECT_EQ(result, 15.f);
}
}
TEST(ReactorUnitTests, Args_GreaterThan5Mixed)
{
// >5 mixed type args
FunctionT<float(int, float, int, float, int, float, int, float, int, float)> function;
{
Int a = function.Arg<0>();
Float b = function.Arg<1>();
Int c = function.Arg<2>();
Float d = function.Arg<3>();
Int e = function.Arg<4>();
Float f = function.Arg<5>();
Int g = function.Arg<6>();
Float h = function.Arg<7>();
Int i = function.Arg<8>();
Float j = function.Arg<9>();
Return(Float(a) + b + Float(c) + d + Float(e) + f + Float(g) + h + Float(i) + j);
}
if(auto routine = function(testName().c_str()))
{
float result = routine(1, 2.f, 3, 4.f, 5, 6.f, 7, 8.f, 9, 10.f);
EXPECT_EQ(result, 55.f);
}
}
// This test was written because on Windows with Subzero, we would get a crash when executing a function
// with a large number of local variables. The problem was that on Windows, 4K pages are allocated as
// needed for the stack whenever an access is made in a "guard page", at which point the page is committed,
// and the next 4K page becomes the guard page. If a stack access is made that's beyond the guard page,
// a regular page fault occurs. To fix this, Subzero (and any compiler) now emits a call to __chkstk with
// the stack size in EAX, so that it can probe the stack in 4K increments up to that size, committing the
// required pages. See https://docs.microsoft.com/en-us/windows/win32/devnotes/-win32-chkstk.
TEST(ReactorUnitTests, LargeStack)
{
// An empirically large enough value to access outside the guard pages
constexpr int ArrayByteSize = 24 * 1024;
constexpr int ArraySize = ArrayByteSize / sizeof(int32_t);
FunctionT<void(int32_t * v)> function;
{
// Allocate a stack array large enough that writing to the first element will reach beyond
// the guard page.
Array<Int, ArraySize> largeStackArray;
for(int i = 0; i < ArraySize; ++i)
{
largeStackArray[i] = i;
}
Pointer<Int> in = function.Arg<0>();
for(int i = 0; i < ArraySize; ++i)
{
in[i] = largeStackArray[i];
}
}
// LLVM takes very long to generate this routine when O2 optimizations are enabled. Disable for now.
// TODO(b/174031014): Remove this once we fix LLVM taking so long.
ScopedPragma O0(OptimizationLevel, 0);
auto routine = function(testName().c_str());
std::array<int32_t, ArraySize> v;
// Run this in a thread, so that we get the default reserved stack size (8K on Win64).
std::thread t([&] {
routine(v.data());
});
t.join();
for(int i = 0; i < ArraySize; ++i)
{
EXPECT_EQ(v[i], i);
}
}
TEST(ReactorUnitTests, Call)
{
struct Class
{
static int Callback(Class *p, int i, float f)
{
p->i = i;
p->f = f;
return i + int(f);
}
int i = 0;
float f = 0.0f;
};
FunctionT<int(void *)> function;
{
Pointer<Byte> c = function.Arg<0>();
auto res = Call(Class::Callback, c, 10, 20.0f);
Return(res);
}
auto routine = function(testName().c_str());
Class c;
int res = routine(&c);
EXPECT_EQ(res, 30);
EXPECT_EQ(c.i, 10);
EXPECT_EQ(c.f, 20.0f);
}
TEST(ReactorUnitTests, CallMemberFunction)
{
struct Class
{
int Callback(int argI, float argF)
{
i = argI;
f = argF;
return i + int(f);
}
int i = 0;
float f = 0.0f;
};
Class c;
FunctionT<int()> function;
{
auto res = Call(&Class::Callback, &c, 10, 20.0f);
Return(res);
}
auto routine = function(testName().c_str());
int res = routine();
EXPECT_EQ(res, 30);
EXPECT_EQ(c.i, 10);
EXPECT_EQ(c.f, 20.0f);
}
TEST(ReactorUnitTests, CallMemberFunctionIndirect)
{
struct Class
{
int Callback(int argI, float argF)
{
i = argI;
f = argF;
return i + int(f);
}
int i = 0;
float f = 0.0f;
};
FunctionT<int(void *)> function;
{
Pointer<Byte> c = function.Arg<0>();
auto res = Call(&Class::Callback, c, 10, 20.0f);
Return(res);
}
auto routine = function(testName().c_str());
Class c;
int res = routine(&c);
EXPECT_EQ(res, 30);
EXPECT_EQ(c.i, 10);
EXPECT_EQ(c.f, 20.0f);
}
TEST(ReactorUnitTests, CallImplicitCast)
{
struct Class
{
static void Callback(Class *c, const char *s)
{
c->str = s;
}
std::string str;
};
FunctionT<void(Class * c, const char *s)> function;
{
Pointer<Byte> c = function.Arg<0>();
Pointer<Byte> s = function.Arg<1>();
Call(Class::Callback, c, s);
}
auto routine = function(testName().c_str());
Class c;
routine(&c, "hello world");
EXPECT_EQ(c.str, "hello world");
}
TEST(ReactorUnitTests, CallBoolReturnFunction)
{
struct Class
{
static bool IsEven(int a)
{
return a % 2 == 0;
}
};
FunctionT<int(int)> function;
{
Int a = function.Arg<0>();
Bool res = Call(Class::IsEven, a);
If(res)
{
Return(1);
}
Return(0);
}
auto routine = function(testName().c_str());
for(int i = 0; i < 10; ++i)
{
EXPECT_EQ(routine(i), i % 2 == 0);
}
}
TEST(ReactorUnitTests, Call_Args4)
{
struct Class
{
static int Func(int a, int b, int c, int d)
{
return a + b + c + d;
}
};
{
FunctionT<int()> function;
{
auto res = Call(Class::Func, 1, 2, 3, 4);
Return(res);
}
auto routine = function(testName().c_str());
int res = routine();
EXPECT_EQ(res, 1 + 2 + 3 + 4);
}
}
TEST(ReactorUnitTests, Call_Args5)
{
struct Class
{
static int Func(int a, int b, int c, int d, int e)
{
return a + b + c + d + e;
}
};
{
FunctionT<int()> function;
{
auto res = Call(Class::Func, 1, 2, 3, 4, 5);
Return(res);
}
auto routine = function(testName().c_str());
int res = routine();
EXPECT_EQ(res, 1 + 2 + 3 + 4 + 5);
}
}
TEST(ReactorUnitTests, Call_ArgsMany)
{
struct Class
{
static int Func(int a, int b, int c, int d, int e, int f, int g, int h)
{
return a + b + c + d + e + f + g + h;
}
};
{
FunctionT<int()> function;
{
auto res = Call(Class::Func, 1, 2, 3, 4, 5, 6, 7, 8);
Return(res);
}
auto routine = function(testName().c_str());
int res = routine();
EXPECT_EQ(res, 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8);
}
}
TEST(ReactorUnitTests, Call_ArgsMixed)
{
struct Class
{
static int Func(int a, float b, int *c, float *d, int e, float f, int *g, float *h)
{
return a + b + *c + *d + e + f + *g + *h;
}
};
{
FunctionT<int()> function;
{
Int c(3);
Float d(4);
Int g(7);
Float h(8);
auto res = Call(Class::Func, 1, 2.f, &c, &d, 5, 6.f, &g, &h);
Return(res);
}
auto routine = function(testName().c_str());
int res = routine();
EXPECT_EQ(res, 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8);
}
}
TEST(ReactorUnitTests, Call_ArgsPointer)
{
struct Class
{
static int Func(int *a)
{
return *a;
}
};
{
FunctionT<int()> function;
{
Int a(12345);
auto res = Call(Class::Func, &a);
Return(res);
}
auto routine = function(testName().c_str());
int res = routine();
EXPECT_EQ(res, 12345);
}
}
TEST(ReactorUnitTests, CallExternalCallRoutine)
{
// routine1 calls Class::Func, passing it a pointer to routine2, and Class::Func calls routine2
auto routine2 = [] {
FunctionT<float(float, int)> function;
{
Float a = function.Arg<0>();
Int b = function.Arg<1>();
Return(a + Float(b));
}
return function("%s2", testName().c_str());
}();
struct Class
{
static float Func(void *