Dqn/DqnUnitTest.cpp

2917 lines
94 KiB
C++
Raw Normal View History

2017-06-21 04:10:53 +00:00
#if (defined(_WIN32) || defined(_WIN64))
2018-05-18 13:19:50 +00:00
#define DQN_WIN32_IMPLEMENTATION
#include "Windows.h"
2017-06-21 04:10:53 +00:00
#endif
#if defined(__linux__)
2018-05-18 13:19:50 +00:00
#define DQN_UNIX_IMPLEMENTATION
#define HANDMADE_MATH_NO_SSE
2017-06-21 04:10:53 +00:00
#endif
2017-07-02 06:31:29 +00:00
#if defined(__GNUC__)
2018-05-18 13:19:50 +00:00
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wfree-nonheap-object"
2017-07-02 06:31:29 +00:00
#endif
#define DQN_PLATFORM_HEADER
2017-04-10 08:40:15 +00:00
#define DQN_IMPLEMENTATION
#include "dqn.h"
#define HANDMADE_MATH_IMPLEMENTATION
#define HANDMADE_MATH_CPP_MODE
#include "tests/HandmadeMath.h"
2017-06-21 04:10:53 +00:00
#include <limits.h>
2017-06-22 08:10:44 +00:00
#include <stdio.h>
2017-06-28 12:47:27 +00:00
2018-02-03 02:26:00 +00:00
// TODO(doyle): Replace DQN_ASSERT with a non-halting assert that can connect to
// some sort of testing framework to track successes and failures.
2018-03-08 15:03:05 +00:00
#define LOG_HEADER() LogHeader(__func__)
2018-02-02 12:26:05 +00:00
FILE_SCOPE i32 globalIndent;
FILE_SCOPE bool globalNewLine;
#define RED "\x1B[31m"
#define GRN "\x1B[32m"
#define YEL "\x1B[33m"
#define BLU "\x1B[34m"
#define MAG "\x1B[35m"
#define CYN "\x1B[36m"
#define WHT "\x1B[37m"
#define RESET "\x1B[0m"
enum class Status
2017-06-28 12:47:27 +00:00
{
2018-05-18 13:19:50 +00:00
None,
Ok,
Error
2018-02-02 12:26:05 +00:00
};
2018-03-08 15:03:05 +00:00
void Log(Status status, char const *fmt, va_list argList)
2018-02-02 12:26:05 +00:00
{
2018-05-18 13:19:50 +00:00
DQN_ASSERT(globalIndent >= 0);
LOCAL_PERSIST i32 lineLen = 0;
char buf[1024] = {};
i32 bufLen = 0;
{
bufLen = Dqn_vsprintf(buf, fmt, argList);
DQN_ASSERT(bufLen < (i32)DQN_ARRAY_COUNT(buf));
lineLen += bufLen;
}
char indentStr[] = " ";
i32 indentLen = DQN_CHAR_COUNT(indentStr);
{
lineLen += (indentLen * globalIndent);
for (auto i = 0; i < globalIndent; i++)
printf("%s", indentStr);
printf("%s", &(buf[0]));
}
if (status == Status::Ok || status == Status::Error)
{
char okStatus[] = "OK";
char errStatus[] = "ERROR";
char *statusStr;
i32 statusStrLen;
if (status == Status::Ok)
{
statusStr = okStatus;
statusStrLen = DQN_CHAR_COUNT(okStatus);
}
else
{
statusStr = errStatus;
statusStrLen = DQN_CHAR_COUNT(errStatus);
}
lineLen += statusStrLen;
i32 targetLen = 90;
i32 remaining = targetLen - lineLen;
remaining = DQN_MAX(remaining, 0);
for (auto i = 0; i < remaining; i++)
putchar('.');
if (status == Status::Ok)
{
printf(GRN "%s" RESET, statusStr);
}
else
{
printf(RED "%s" RESET, statusStr);
}
}
if (globalNewLine)
{
lineLen = 0;
printf("\n");
}
2017-06-28 12:47:27 +00:00
}
2018-03-08 15:03:05 +00:00
void Log(Status status, char const *fmt, ...)
{
2018-05-18 13:19:50 +00:00
va_list argList;
va_start(argList, fmt);
Log(status, fmt, argList);
va_end(argList);
2018-02-02 12:26:05 +00:00
}
2018-03-08 15:03:05 +00:00
void Log(char const *fmt, ...)
2018-02-02 12:26:05 +00:00
{
2018-05-18 13:19:50 +00:00
va_list argList;
va_start(argList, fmt);
Log(Status::None, fmt, argList);
va_end(argList);
2018-02-02 12:26:05 +00:00
}
2018-03-08 15:03:05 +00:00
void LogHeader(char const *funcName)
2018-02-02 12:26:05 +00:00
{
2018-05-18 13:19:50 +00:00
globalIndent--;
Log("\n[%s]", funcName);
globalIndent++;
}
#include "DqnFixedString.cpp"
2018-06-28 13:25:25 +00:00
#include "DqnOS.cpp"
void HandmadeMathVerifyMat4(DqnMat4 dqnMat, hmm_mat4 hmmMat)
{
2018-05-18 13:19:50 +00:00
f32 *hmmMatf = (f32 *)&hmmMat;
f32 *dqnMatf = (f32 *)&dqnMat;
const u32 EXPECTED_SIZE = 16;
u32 totalSize = DQN_ARRAY_COUNT(dqnMat.e) * DQN_ARRAY_COUNT(dqnMat.e[0]);
DQN_ASSERT(totalSize == EXPECTED_SIZE);
DQN_ASSERT(totalSize ==
(DQN_ARRAY_COUNT(hmmMat.Elements) * DQN_ARRAY_COUNT(hmmMat.Elements[0])));
for (u32 i = 0; i < EXPECTED_SIZE; i++)
{
const f32 EPSILON = 0.001f;
f32 diff = hmmMatf[i] - dqnMatf[i];
diff = DQN_ABS(diff);
DQN_ASSERTM(diff < EPSILON, "hmmMatf[%d]: %f, dqnMatf[%d]: %f\n", i, hmmMatf[i], i,
dqnMatf[i]);
}
}
void HandmadeMathTestInternal()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// Test Perspective/Projection matrix values
}
void Dqn_Test()
2017-04-10 08:40:15 +00:00
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
2018-05-18 13:19:50 +00:00
// const u64 LARGEST_NUM = (u64)-1;
const i64 SMALLEST_NUM = LLONG_MIN;
// StrToI64
if (1)
{
const char *const a = "123";
DQN_ASSERT(Dqn_StrToI64(a, DqnStr_Len(a)) == 123);
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
const char *const b = "-123";
DQN_ASSERT(Dqn_StrToI64(b, DqnStr_Len(b)) == -123);
DQN_ASSERT(Dqn_StrToI64(b, 1) == 0);
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
const char *const c = "-0";
DQN_ASSERT(Dqn_StrToI64(c, DqnStr_Len(c)) == 0);
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
const char *const d = "+123";
DQN_ASSERT(Dqn_StrToI64(d, DqnStr_Len(d)) == 123);
2017-04-10 08:40:15 +00:00
2017-06-22 08:10:44 +00:00
// TODO(doyle): Unsigned conversion
#if 0
2018-05-18 13:19:50 +00:00
char *e = "18446744073709551615";
DQN_ASSERT((u64)(Dqn_StrToI64(e, DqnStr_Len(e))) == LARGEST_NUM);
#endif
2018-05-18 13:19:50 +00:00
const char *const f = "-9223372036854775808";
DQN_ASSERT(Dqn_StrToI64(f, DqnStr_Len(f)) == SMALLEST_NUM);
2018-05-18 13:19:50 +00:00
Log("Dqn_StrToI64()");
}
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
// i64 to str
if (1)
{
char a[DQN_64BIT_NUM_MAX_STR_SIZE] = {};
Dqn_I64ToStr(+100, a, DQN_ARRAY_COUNT(a));
DQN_ASSERT(DqnStr_Cmp(a, "100") == 0);
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
char b[DQN_64BIT_NUM_MAX_STR_SIZE] = {};
Dqn_I64ToStr(-100, b, DQN_ARRAY_COUNT(b));
DQN_ASSERT(DqnStr_Cmp(b, "-100") == 0);
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
char c[DQN_64BIT_NUM_MAX_STR_SIZE] = {};
Dqn_I64ToStr(0, c, DQN_ARRAY_COUNT(c));
DQN_ASSERT(DqnStr_Cmp(c, "0") == 0);
2017-04-10 08:40:15 +00:00
#if 0
2018-05-18 13:19:50 +00:00
char d[DQN_64BIT_NUM_MAX_STR_SIZE] = {};
Dqn_I64ToStr(LARGEST_NUM, d, DQN_ARRAY_COUNT(d));
DQN_ASSERT(DqnStr_Cmp(d, "18446744073709551615") == 0);
#endif
2018-05-18 13:19:50 +00:00
if (sizeof(size_t) == sizeof(u64))
{
char e[DQN_64BIT_NUM_MAX_STR_SIZE] = {};
Dqn_I64ToStr(SMALLEST_NUM, e, DQN_ARRAY_COUNT(e));
DQN_ASSERTM(DqnStr_Cmp(e, "-9223372036854775808") == 0, "e: %s", e);
}
Log("Dqn_I64ToStr()");
}
// StrToF32
if (1)
{
const f32 EPSILON = 0.001f;
const char a[] = "-0.66248";
f32 vA = Dqn_StrToF32(a, DQN_ARRAY_COUNT(a));
DQN_ASSERT(DQN_ABS(vA) - DQN_ABS(-0.66248f) < EPSILON);
const char b[] = "-0.632053";
f32 vB = Dqn_StrToF32(b, DQN_ARRAY_COUNT(b));
DQN_ASSERT(DQN_ABS(vB) - DQN_ABS(-0.632053f) < EPSILON);
const char c[] = "-0.244271";
f32 vC = Dqn_StrToF32(c, DQN_ARRAY_COUNT(c));
DQN_ASSERT(DQN_ABS(vC) - DQN_ABS(-0.244271f) < EPSILON);
const char d[] = "-0.511812";
f32 vD = Dqn_StrToF32(d, DQN_ARRAY_COUNT(d));
DQN_ASSERT(DQN_ABS(vD) - DQN_ABS(-0.511812f) < EPSILON);
const char e[] = "-0.845392";
f32 vE = Dqn_StrToF32(e, DQN_ARRAY_COUNT(e));
DQN_ASSERT(DQN_ABS(vE) - DQN_ABS(-0.845392f) < EPSILON);
const char f[] = "0.127809";
f32 vF = Dqn_StrToF32(f, DQN_ARRAY_COUNT(f));
DQN_ASSERT(DQN_ABS(vF) - DQN_ABS(-0.127809f) < EPSILON);
const char g[] = "0.532";
f32 vG = Dqn_StrToF32(g, DQN_ARRAY_COUNT(g));
DQN_ASSERT(DQN_ABS(vG) - DQN_ABS(-0.532f) < EPSILON);
const char h[] = "0.923";
f32 vH = Dqn_StrToF32(h, DQN_ARRAY_COUNT(h));
DQN_ASSERT(DQN_ABS(vH) - DQN_ABS(-0.923f) < EPSILON);
const char i[] = "0.000";
f32 vI = Dqn_StrToF32(i, DQN_ARRAY_COUNT(i));
DQN_ASSERT(DQN_ABS(vI) - DQN_ABS(-0.000f) < EPSILON);
const char j[] = "0.000283538";
f32 vJ = Dqn_StrToF32(j, DQN_ARRAY_COUNT(j));
DQN_ASSERT(DQN_ABS(vJ) - DQN_ABS(-0.000283538f) < EPSILON);
const char k[] = "-1.25";
f32 vK = Dqn_StrToF32(k, DQN_ARRAY_COUNT(k));
DQN_ASSERT(DQN_ABS(vK) - DQN_ABS(-1.25f) < EPSILON);
const char l[] = "0.286843";
f32 vL = Dqn_StrToF32(l, DQN_ARRAY_COUNT(l));
DQN_ASSERT(DQN_ABS(vL) - DQN_ABS(-0.286843f) < EPSILON);
const char m[] = "-0.406";
f32 vM = Dqn_StrToF32(m, DQN_ARRAY_COUNT(m));
DQN_ASSERT(DQN_ABS(vM) - DQN_ABS(-0.406f) < EPSILON);
const char n[] = "-0.892";
f32 vN = Dqn_StrToF32(n, DQN_ARRAY_COUNT(n));
DQN_ASSERT(DQN_ABS(vN) - DQN_ABS(-0.892f) < EPSILON);
const char o[] = "0.201";
f32 vO = Dqn_StrToF32(o, DQN_ARRAY_COUNT(o));
DQN_ASSERT(DQN_ABS(vO) - DQN_ABS(-0.201f) < EPSILON);
const char p[] = "1.25";
f32 vP = Dqn_StrToF32(p, DQN_ARRAY_COUNT(p));
DQN_ASSERT(DQN_ABS(vP) - DQN_ABS(1.25f) < EPSILON);
const char q[] = "9.64635e-05";
f32 vQ = Dqn_StrToF32(q, DQN_ARRAY_COUNT(q));
DQN_ASSERT(DQN_ABS(vQ) - DQN_ABS(9.64635e-05) < EPSILON);
const char r[] = "9.64635e+05";
f32 vR = Dqn_StrToF32(r, DQN_ARRAY_COUNT(r));
DQN_ASSERT(DQN_ABS(vR) - DQN_ABS(9.64635e+05) < EPSILON);
Log("Dqn_StrToF32()");
}
// UCS <-> UTF8 Checks
if (1)
{
// Test ascii characters
if (1)
{
u32 codepoint = '@';
u32 string[1] = {};
u32 bytesUsed = Dqn_UCSToUTF8(&string[0], codepoint);
DQN_ASSERT(bytesUsed == 1);
DQN_ASSERT(string[0] == '@');
bytesUsed = Dqn_UTF8ToUCS(&string[0], codepoint);
DQN_ASSERT(string[0] >= 0 && string[0] < 0x80);
DQN_ASSERT(bytesUsed == 1);
Log("Dqn_UTF8ToUCS(): Test ascii characters");
}
// Test 2 byte characters
if (1)
{
u32 codepoint = 0x278;
u32 string[1] = {};
u32 bytesUsed = Dqn_UCSToUTF8(&string[0], codepoint);
DQN_ASSERT(bytesUsed == 2);
DQN_ASSERT(string[0] == 0xC9B8);
bytesUsed = Dqn_UTF8ToUCS(&string[0], string[0]);
DQN_ASSERT(string[0] == codepoint);
DQN_ASSERT(bytesUsed == 2);
Log("Dqn_UTF8ToUCS(): Test 2 byte characters");
}
// Test 3 byte characters
if (1)
{
u32 codepoint = 0x0A0A;
u32 string[1] = {};
u32 bytesUsed = Dqn_UCSToUTF8(&string[0], codepoint);
DQN_ASSERT(bytesUsed == 3);
DQN_ASSERT(string[0] == 0xE0A88A);
bytesUsed = Dqn_UTF8ToUCS(&string[0], string[0]);
DQN_ASSERT(string[0] == codepoint);
DQN_ASSERT(bytesUsed == 3);
Log("Dqn_UTF8ToUCS(): Test 3 byte characters");
}
// Test 4 byte characters
if (1)
{
u32 codepoint = 0x10912;
u32 string[1] = {};
u32 bytesUsed = Dqn_UCSToUTF8(&string[0], codepoint);
DQN_ASSERT(bytesUsed == 4);
DQN_ASSERT(string[0] == 0xF090A492);
bytesUsed = Dqn_UTF8ToUCS(&string[0], string[0]);
DQN_ASSERT(string[0] == codepoint);
DQN_ASSERT(bytesUsed == 4);
Log("Dqn_UTF8ToUCS(): Test 4 byte characters");
}
if (1)
{
u32 codepoint = 0x10912;
u32 bytesUsed = Dqn_UCSToUTF8(NULL, codepoint);
DQN_ASSERT(bytesUsed == 0);
bytesUsed = Dqn_UTF8ToUCS(NULL, codepoint);
DQN_ASSERT(bytesUsed == 0);
Log("Dqn_UTF8ToUCS(): Test return result on on NULL output param");
}
}
2017-04-10 08:40:15 +00:00
}
void DqnStr_Test()
{
2018-05-18 13:19:50 +00:00
// String Checks
if (1)
{
LOG_HEADER();
// strcmp
if (1)
{
const char *const a = "str_a";
// Check simple compares
if (1)
{
DQN_ASSERT(DqnStr_Cmp(a, "str_a") == +0);
DQN_ASSERT(DqnStr_Cmp(a, "str_b") == -1);
DQN_ASSERT(DqnStr_Cmp("str_b", a) == +1);
DQN_ASSERT(DqnStr_Cmp(a, "") == +1);
DQN_ASSERT(DqnStr_Cmp("", "") == 0);
// NOTE: Check that the string has not been trashed.
DQN_ASSERT(DqnStr_Cmp(a, "str_a") == +0);
Log("DqnStr_Cmp(): Check simple compares");
}
// Check ops against null
if (1)
{
DQN_ASSERT(DqnStr_Cmp(NULL, NULL) != +0);
DQN_ASSERT(DqnStr_Cmp(a, NULL) != +0);
DQN_ASSERT(DqnStr_Cmp(NULL, a) != +0);
Log("DqnStr_Cmp(): Check ops against null");
}
}
// strlen
if (1)
{
const char *const a = "str_a";
DQN_ASSERT(DqnStr_Len(a) == 5);
DQN_ASSERT(DqnStr_Len("") == 0);
DQN_ASSERT(DqnStr_Len(" a ") == 6);
DQN_ASSERT(DqnStr_Len("a\n") == 2);
// NOTE: Check that the string has not been trashed.
DQN_ASSERT(DqnStr_Cmp(a, "str_a") == 0);
DQN_ASSERT(DqnStr_Len(NULL) == 0);
Log("DqnStr_Len()");
}
// StrReverse
if (1)
{
// Basic reverse operations
if (1)
{
char a[] = "aba";
DqnStr_Reverse(a, DqnStr_Len(a));
DQN_ASSERT(DqnStr_Cmp(a, "aba") == 0);
DqnStr_Reverse(a, 2);
DQN_ASSERT(DqnStr_Cmp(a, "baa") == 0);
DqnStr_Reverse(a, DqnStr_Len(a));
DQN_ASSERT(DqnStr_Cmp(a, "aab") == 0);
DqnStr_Reverse(&a[1], 2);
DQN_ASSERT(DqnStr_Cmp(a, "aba") == 0);
DqnStr_Reverse(a, 0);
DQN_ASSERT(DqnStr_Cmp(a, "aba") == 0);
Log("DqnStr_Reverse(): Basic reverse operations");
}
// Try reverse empty string
if (1)
{
char a[] = "";
DqnStr_Reverse(a, DqnStr_Len(a));
DQN_ASSERT(DqnStr_Cmp(a, "") == 0);
Log("DqnStr_Reverse(): Reverse empty string");
}
// Try reverse single char string
if (1)
{
char a[] = "a";
DqnStr_Reverse(a, DqnStr_Len(a));
DQN_ASSERT(DqnStr_Cmp(a, "a") == 0);
DqnStr_Reverse(a, 0);
DQN_ASSERT(DqnStr_Cmp(a, "a") == 0);
Log("DqnStr_Reverse(): Reverse single char string");
}
}
if (1)
{
const char *const a = "Microsoft";
const char *const b = "icro";
i32 lenA = DqnStr_Len(a);
i32 lenB = DqnStr_Len(b);
DQN_ASSERT(DqnStr_HasSubstring(a, lenA, b, lenB) == true);
DQN_ASSERT(DqnStr_HasSubstring(a, lenA, "iro", DqnStr_Len("iro")) == false);
DQN_ASSERT(DqnStr_HasSubstring(b, lenB, a, lenA) == false);
DQN_ASSERT(DqnStr_HasSubstring("iro", DqnStr_Len("iro"), a, lenA) == false);
DQN_ASSERT(DqnStr_HasSubstring("", 0, "iro", 4) == false);
DQN_ASSERT(DqnStr_HasSubstring("", 0, "", 0) == false);
DQN_ASSERT(DqnStr_HasSubstring(NULL, 0, NULL, 0) == false);
Log("DqnStr_HasSubstring(): Check string with matching substring");
}
if (1)
{
const char *const a = "Micro";
const char *const b = "irob";
i32 lenA = DqnStr_Len(a);
i32 lenB = DqnStr_Len(b);
DQN_ASSERT(DqnStr_HasSubstring(a, lenA, b, lenB) == false);
DQN_ASSERT(DqnStr_HasSubstring(b, lenB, a, lenA) == false);
Log("DqnStr_HasSubstring(): Check string with non-matching substring");
}
}
}
2017-04-10 08:40:15 +00:00
void DqnChar_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// Char Checks
if (1)
{
DQN_ASSERT(DqnChar_IsAlpha('a') == true);
DQN_ASSERT(DqnChar_IsAlpha('A') == true);
DQN_ASSERT(DqnChar_IsAlpha('0') == false);
DQN_ASSERT(DqnChar_IsAlpha('@') == false);
DQN_ASSERT(DqnChar_IsAlpha(' ') == false);
DQN_ASSERT(DqnChar_IsAlpha('\n') == false);
Log(Status::Ok, "IsAlpha");
DQN_ASSERT(DqnChar_IsDigit('1') == true);
DQN_ASSERT(DqnChar_IsDigit('n') == false);
DQN_ASSERT(DqnChar_IsDigit('N') == false);
DQN_ASSERT(DqnChar_IsDigit('*') == false);
DQN_ASSERT(DqnChar_IsDigit(' ') == false);
DQN_ASSERT(DqnChar_IsDigit('\n') == false);
Log(Status::Ok, "IsDigit");
DQN_ASSERT(DqnChar_IsAlphaNum('1') == true);
DQN_ASSERT(DqnChar_IsAlphaNum('a') == true);
DQN_ASSERT(DqnChar_IsAlphaNum('A') == true);
DQN_ASSERT(DqnChar_IsAlphaNum('*') == false);
DQN_ASSERT(DqnChar_IsAlphaNum(' ') == false);
DQN_ASSERT(DqnChar_IsAlphaNum('\n') == false);
Log(Status::Ok, "IsAlphaNum");
DQN_ASSERT(DqnChar_ToLower(L'A') == L'a');
DQN_ASSERT(DqnChar_ToLower(L'a') == L'a');
DQN_ASSERT(DqnChar_ToLower(L' ') == L' ');
Log(Status::Ok, "ToLower");
DQN_ASSERT(DqnChar_ToUpper(L'A') == L'A');
DQN_ASSERT(DqnChar_ToUpper(L'a') == L'A');
DQN_ASSERT(DqnChar_ToUpper(L' ') == L' ');
Log(Status::Ok, "ToUpper");
DQN_ASSERT(DqnChar_IsWhitespace(' '));
DQN_ASSERT(DqnChar_IsWhitespace('\r'));
DQN_ASSERT(DqnChar_IsWhitespace('\n'));
DQN_ASSERT(DqnChar_IsWhitespace('\t'));
Log(Status::Ok, "IsWhiteSpace");
}
// Trim white space test
if (1)
{
if (1)
{
char a[] = "";
i32 newLen = 0;
auto *result = DqnChar_TrimWhitespaceAround(a, DQN_CHAR_COUNT(a), &newLen);
DQN_ASSERT(newLen == 0);
DQN_ASSERT(result == nullptr);
}
if (1)
{
char a[] = "a";
i32 newLen = 0;
auto *result = DqnChar_TrimWhitespaceAround(a, DQN_CHAR_COUNT(a), &newLen);
DQN_ASSERT(newLen == 1);
DQN_ASSERT(result == a);
}
if (1)
{
char a[] = " abc";
i32 newLen = 0;
auto *result = DqnChar_TrimWhitespaceAround(a, DQN_CHAR_COUNT(a), &newLen);
DQN_ASSERT(newLen == 3);
DQN_ASSERT(result == (a + 1));
}
if (1)
{
char a[] = "abc ";
i32 newLen = 0;
auto *result = DqnChar_TrimWhitespaceAround(a, DQN_CHAR_COUNT(a), &newLen);
DQN_ASSERT(newLen == 3);
DQN_ASSERT(result == a);
}
if (1)
{
char a[] = " abc ";
i32 newLen = 0;
auto *result = DqnChar_TrimWhitespaceAround(a, DQN_CHAR_COUNT(a), &newLen);
DQN_ASSERT(newLen == 3);
DQN_ASSERT(result == a + 3);
}
if (1)
{
char a[] = " ";
i32 newLen = 0;
auto *result = DqnChar_TrimWhitespaceAround(a, DQN_CHAR_COUNT(a), &newLen);
DQN_ASSERT(newLen == 0);
DQN_ASSERT(result == nullptr);
}
Log(Status::Ok, "TrimWhitespaceAround");
}
2017-04-10 08:40:15 +00:00
}
void DqnString_Test()
2017-04-10 08:40:15 +00:00
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// Check fixed mem string doesn't allow string to expand and fail if try to append
if (1)
{
char space[4] = {};
DqnString str = {};
DQN_ASSERT(str.InitFixedMem(space, DQN_ARRAY_COUNT(space)));
DQN_ASSERT(str.Append("test_doesnt_fit") == false);
DQN_ASSERT(str.Append("tooo") == false);
DQN_ASSERT(str.Append("fit") == true);
DQN_ASSERT(str.Append("test_doesnt_fit") == false);
DQN_ASSERT(str.Append("1") == false);
DQN_ASSERT(str.str[str.len] == 0);
DQN_ASSERT(str.len <= str.max);
Log(Status::Ok, "Append: Check fixed mem string doesn't expand and fails");
}
// Try expanding string
if (1)
{
DqnString str = {};
DQN_ASSERT(str.InitLiteral("hello world"));
DQN_ASSERT(str.Append(", hello again"));
DQN_ASSERT(str.Append(", and hello again"));
DQN_ASSERT(str.str[str.len] == 0);
DQN_ASSERT(str.len <= str.max);
str.Free();
Log(Status::Ok, "Check expand on append");
}
}
void DqnRnd_Test()
2017-06-22 08:10:44 +00:00
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
2018-06-11 09:16:54 +00:00
auto pcg = DqnRndPCG();
2018-05-18 13:19:50 +00:00
for (i32 i = 0; i < 1000000; i++)
{
i32 min = -100;
i32 max = 1000000000;
i32 result = pcg.Range(min, max);
DQN_ASSERT(result >= min && result <= max);
f32 randF32 = pcg.Nextf();
DQN_ASSERT(randF32 >= 0.0f && randF32 <= 1.0f);
}
Log(Status::Ok, "DqnRndPCG");
2017-04-10 08:40:15 +00:00
}
void DqnMath_Test()
2017-04-10 08:40:15 +00:00
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// Lerp
if (1)
{
if (1)
{
f32 start = 10;
f32 t = 0.5f;
f32 end = 20;
DQN_ASSERT(DqnMath_Lerp(start, t, end) == 15);
}
if (1)
{
f32 start = 10;
f32 t = 2.0f;
f32 end = 20;
DQN_ASSERT(DqnMath_Lerp(start, t, end) == 30);
}
Log(Status::Ok, "Lerp");
}
// Sqrtf
if (1)
{
DQN_ASSERT(DqnMath_Sqrtf(4.0f) == 2.0f);
Log(Status::Ok, "Sqrtf");
}
// Handmade Math Test
if (1)
{
if (1)
{
f32 aspectRatio = 1;
DqnMat4 dqnPerspective = DqnMat4_Perspective(90, aspectRatio, 100, 1000);
hmm_mat4 hmmPerspective = HMM_Perspective(90, aspectRatio, 100, 1000);
HandmadeMathVerifyMat4(dqnPerspective, hmmPerspective);
Log(Status::Ok, "HandmadeMathTest: Perspective");
}
// Test Mat4 translate * scale
if (1)
{
hmm_vec3 hmmVec = HMM_Vec3i(1, 2, 3);
DqnV3 dqnVec = DqnV3(1, 2, 3);
2018-05-18 13:19:50 +00:00
DqnMat4 dqnTranslate = DqnMat4_Translate3f(dqnVec.x, dqnVec.y, dqnVec.z);
hmm_mat4 hmmTranslate = HMM_Translate(hmmVec);
HandmadeMathVerifyMat4(dqnTranslate, hmmTranslate);
hmm_vec3 hmmAxis = HMM_Vec3(0.5f, 0.2f, 0.7f);
DqnV3 dqnAxis = DqnV3(0.5f, 0.2f, 0.7f);
2018-05-18 13:19:50 +00:00
f32 rotationInDegrees = 80.0f;
DqnMat4 dqnRotate = DqnMat4_Rotate(DQN_DEGREES_TO_RADIANS(rotationInDegrees), dqnAxis.x,
dqnAxis.y, dqnAxis.z);
hmm_mat4 hmmRotate = HMM_Rotate(rotationInDegrees, hmmAxis);
HandmadeMathVerifyMat4(dqnRotate, hmmRotate);
dqnVec *= 2;
hmmVec *= 2;
DqnMat4 dqnScale = DqnMat4_Scale(dqnVec.x, dqnVec.y, dqnVec.z);
hmm_mat4 hmmScale = HMM_Scale(hmmVec);
HandmadeMathVerifyMat4(dqnScale, hmmScale);
DqnMat4 dqnTSMatrix = DqnMat4_Mul(dqnTranslate, dqnScale);
hmm_mat4 hmmTSMatrix = HMM_MultiplyMat4(hmmTranslate, hmmScale);
HandmadeMathVerifyMat4(dqnTSMatrix, hmmTSMatrix);
// Test Mat4 * MulV4
if (1)
{
DqnV4 dqnV4 = DqnV4(1, 2, 3, 4);
2018-05-18 13:19:50 +00:00
hmm_vec4 hmmV4 = HMM_Vec4(1, 2, 3, 4);
DqnV4 dqnResult = DqnMat4_MulV4(dqnTSMatrix, dqnV4);
hmm_vec4 hmmResult = HMM_MultiplyMat4ByVec4(hmmTSMatrix, hmmV4);
DQN_ASSERT(dqnResult.x == hmmResult.X);
DQN_ASSERT(dqnResult.y == hmmResult.Y);
DQN_ASSERT(dqnResult.z == hmmResult.Z);
DQN_ASSERT(dqnResult.w == hmmResult.W);
Log(Status::Ok, "HandmadeMathTest: Mat4 * MulV4");
}
}
}
2018-02-02 12:26:05 +00:00
}
void DqnVX_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// V2
if (1)
{
// Ctor
if (1)
{
// Ctor with floats
if (1)
{
DqnV2 vec = DqnV2(5.5f, 5.0f);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(vec.x == 5.5f && vec.y == 5.0f);
DQN_ASSERT(vec.w == 5.5f && vec.h == 5.0f);
}
// Ctor with 2 integers
if (1)
{
DqnV2 vec = DqnV2(3, 5);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(vec.x == 3 && vec.y == 5.0f);
DQN_ASSERT(vec.w == 3 && vec.h == 5.0f);
}
Log(Status::Ok, "DqnV2: Ctor");
}
// V2 Arithmetic
if (1)
{
DqnV2 vecA = DqnV2(5, 10);
DqnV2 vecB = DqnV2(2, 3);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Equals(vecA, vecB) == false);
DQN_ASSERT(DqnV2_Equals(vecA, DqnV2(5, 10)) == true);
DQN_ASSERT(DqnV2_Equals(vecB, DqnV2(2, 3)) == true);
2018-05-18 13:19:50 +00:00
DqnV2 result = DqnV2_Add(vecA, DqnV2(5, 10));
DQN_ASSERT(DqnV2_Equals(result, DqnV2(10, 20)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV2_Sub(result, DqnV2(5, 10));
DQN_ASSERT(DqnV2_Equals(result, DqnV2(5, 10)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV2_Scalef(result, 5);
DQN_ASSERT(DqnV2_Equals(result, DqnV2(25, 50)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV2_Hadamard(result, DqnV2(10.0f, 0.5f));
DQN_ASSERT(DqnV2_Equals(result, DqnV2(250, 25)) == true);
2018-05-18 13:19:50 +00:00
f32 dotResult = DqnV2_Dot(DqnV2(5, 10), DqnV2(3, 4));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(dotResult == 55);
Log(Status::Ok, "DqnV2: Arithmetic");
}
// Test operator overloading
if (1)
{
DqnV2 vecA = DqnV2(5, 10);
DqnV2 vecB = DqnV2(2, 3);
2018-05-18 13:19:50 +00:00
DQN_ASSERT((vecA == vecB) == false);
DQN_ASSERT((vecA == DqnV2(5, 10)) == true);
DQN_ASSERT((vecB == DqnV2(2, 3)) == true);
2018-05-18 13:19:50 +00:00
DqnV2 result = vecA + DqnV2(5, 10);
DQN_ASSERT((result == DqnV2(10, 20)) == true);
2018-05-18 13:19:50 +00:00
result -= DqnV2(5, 10);
DQN_ASSERT((result == DqnV2(5, 10)) == true);
2018-05-18 13:19:50 +00:00
result *= 5;
DQN_ASSERT((result == DqnV2(25, 50)) == true);
2018-05-18 13:19:50 +00:00
result = result * DqnV2(10.0f, 0.5f);
DQN_ASSERT((result == DqnV2(250, 25)) == true);
2018-05-18 13:19:50 +00:00
result += DqnV2(1, 1);
DQN_ASSERT((result == DqnV2(251, 26)) == true);
2018-05-18 13:19:50 +00:00
result = result - DqnV2(1, 1);
DQN_ASSERT((result == DqnV2(250, 25)) == true);
2018-05-18 13:19:50 +00:00
Log(Status::Ok, "DqnV2: Operator Overloading");
}
// V2 Properties
if (1)
{
const f32 EPSILON = 0.001f;
DqnV2 a = DqnV2(0, 0);
DqnV2 b = DqnV2(3, 4);
2018-05-18 13:19:50 +00:00
f32 lengthSq = DqnV2_LengthSquared(a, b);
DQN_ASSERT(lengthSq == 25);
f32 length = DqnV2_Length(a, b);
DQN_ASSERT(length == 5);
DqnV2 normalised = DqnV2_Normalise(b);
f32 normX = b.x / 5.0f;
f32 normY = b.y / 5.0f;
f32 diffNormX = normalised.x - normX;
f32 diffNormY = normalised.y - normY;
DQN_ASSERTM(diffNormX < EPSILON, "normalised.x: %f, normX: %f\n", normalised.x, normX);
DQN_ASSERTM(diffNormY < EPSILON, "normalised.y: %f, normY: %f\n", normalised.y, normY);
DqnV2 c = DqnV2(3.5f, 8.0f);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Overlaps(b, c) == true);
DQN_ASSERT(DqnV2_Overlaps(b, a) == false);
DqnV2 d = DqnV2_Perpendicular(c);
DQN_ASSERT(DqnV2_Dot(c, d) == 0);
Log(Status::Ok, "DqnV2: LengthSquared, Length, Normalize, Overlaps, Perp");
}
// ConstrainToRatio
if (1)
{
DqnV2 ratio = DqnV2(16, 9);
DqnV2 dim = DqnV2(2000, 1080);
2018-05-18 13:19:50 +00:00
DqnV2 result = DqnV2_ConstrainToRatio(dim, ratio);
DQN_ASSERT(result.w == 1920 && result.h == 1080);
Log(Status::Ok, "DqnV2: ConstrainToRatio");
}
}
// V3
if (1)
{
// Ctor
if (1)
{
// Floats
if (1)
{
DqnV3 vec = DqnV3(5.5f, 5.0f, 5.875f);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(vec.x == 5.5f && vec.y == 5.0f && vec.z == 5.875f);
DQN_ASSERT(vec.r == 5.5f && vec.g == 5.0f && vec.b == 5.875f);
}
// Integers
if (1)
{
DqnV3 vec = DqnV3(3, 4, 5);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(vec.x == 3 && vec.y == 4 && vec.z == 5);
DQN_ASSERT(vec.r == 3 && vec.g == 4 && vec.b == 5);
}
Log(Status::Ok, "DqnV3: Ctor");
}
if (1)
{
// Arithmetic
if (1)
{
DqnV3 vecA = DqnV3(5, 10, 15);
DqnV3 vecB = DqnV3(2, 3, 6);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV3_Equals(vecA, vecB) == false);
DQN_ASSERT(DqnV3_Equals(vecA, DqnV3(5, 10, 15)) == true);
DQN_ASSERT(DqnV3_Equals(vecB, DqnV3(2, 3, 6)) == true);
2018-05-18 13:19:50 +00:00
DqnV3 result = DqnV3_Add(vecA, DqnV3(5, 10, 15));
DQN_ASSERT(DqnV3_Equals(result, DqnV3(10, 20, 30)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV3_Sub(result, DqnV3(5, 10, 15));
DQN_ASSERT(DqnV3_Equals(result, DqnV3(5, 10, 15)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV3_Scalef(result, 5);
DQN_ASSERT(DqnV3_Equals(result, DqnV3(25, 50, 75)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV3_Hadamard(result, DqnV3(10.0f, 0.5f, 10.0f));
DQN_ASSERT(DqnV3_Equals(result, DqnV3(250, 25, 750)) == true);
2018-05-18 13:19:50 +00:00
f32 dotResult = DqnV3_Dot(DqnV3(5, 10, 2), DqnV3(3, 4, 6));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(dotResult == 67);
DqnV3 cross = DqnV3_Cross(vecA, vecB);
DQN_ASSERT(DqnV3_Equals(cross, DqnV3(15, 0, -5)) == true);
2018-05-18 13:19:50 +00:00
}
// Operator overloading
if (1)
{
DqnV3 vecA = DqnV3(5, 10, 15);
DqnV3 vecB = DqnV3(2, 3, 6);
2018-05-18 13:19:50 +00:00
DQN_ASSERT((vecA == vecB) == false);
DQN_ASSERT((vecA == DqnV3(5, 10, 15)) == true);
DQN_ASSERT((vecB == DqnV3(2, 3, 6)) == true);
2018-05-18 13:19:50 +00:00
DqnV3 result = vecA + DqnV3(5, 10, 15);
DQN_ASSERT((result == DqnV3(10, 20, 30)) == true);
2018-05-18 13:19:50 +00:00
result -= DqnV3(5, 10, 15);
DQN_ASSERT((result == DqnV3(5, 10, 15)) == true);
2018-05-18 13:19:50 +00:00
result = result * 5;
DQN_ASSERT((result == DqnV3(25, 50, 75)) == true);
2018-05-18 13:19:50 +00:00
result *= DqnV3(10.0f, 0.5f, 10.0f);
DQN_ASSERT((result == DqnV3(250, 25, 750)) == true);
2018-05-18 13:19:50 +00:00
result = result - DqnV3(1, 1, 1);
DQN_ASSERT((result == DqnV3(249, 24, 749)) == true);
2018-05-18 13:19:50 +00:00
result += DqnV3(1, 1, 1);
DQN_ASSERT((result == DqnV3(250, 25, 750)) == true);
2018-05-18 13:19:50 +00:00
}
Log(Status::Ok, "DqnV3: Arithmetic");
}
}
// V4
if (1)
{
// Ctor
if (1)
{
// Floats
if (1)
{
DqnV4 vec = DqnV4(5.5f, 5.0f, 5.875f, 5.928f);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(vec.x == 5.5f && vec.y == 5.0f && vec.z == 5.875f && vec.w == 5.928f);
DQN_ASSERT(vec.r == 5.5f && vec.g == 5.0f && vec.b == 5.875f && vec.a == 5.928f);
}
// Integers
if (1)
{
DqnV4 vec = DqnV4(3, 4, 5, 6);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(vec.x == 3 && vec.y == 4 && vec.z == 5 && vec.w == 6);
DQN_ASSERT(vec.r == 3 && vec.g == 4 && vec.b == 5 && vec.a == 6);
}
Log(Status::Ok, "DqnV4: Ctor");
}
// V4 Arithmetic
if (1)
{
// Arithmetic
{
DqnV4 vecA = DqnV4(5, 10, 15, 20);
DqnV4 vecB = DqnV4(2, 3, 6, 8);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV4_Equals(vecA, vecB) == false);
DQN_ASSERT(DqnV4_Equals(vecA, DqnV4(5, 10, 15, 20)) == true);
DQN_ASSERT(DqnV4_Equals(vecB, DqnV4(2, 3, 6, 8)) == true);
2018-05-18 13:19:50 +00:00
DqnV4 result = DqnV4_Add(vecA, DqnV4(5, 10, 15, 20));
DQN_ASSERT(DqnV4_Equals(result, DqnV4(10, 20, 30, 40)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV4_Sub(result, DqnV4(5, 10, 15, 20));
DQN_ASSERT(DqnV4_Equals(result, DqnV4(5, 10, 15, 20)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV4_Scalef(result, 5);
DQN_ASSERT(DqnV4_Equals(result, DqnV4(25, 50, 75, 100)) == true);
2018-05-18 13:19:50 +00:00
result = DqnV4_Hadamard(result, DqnV4(10.0f, 0.5f, 10.0f, 0.25f));
DQN_ASSERT(DqnV4_Equals(result, DqnV4(250, 25, 750, 25)) == true);
2018-05-18 13:19:50 +00:00
f32 dotResult = DqnV4_Dot(DqnV4(5, 10, 2, 8), DqnV4(3, 4, 6, 5));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(dotResult == 107);
}
// Operator Overloading
if (1)
{
DqnV4 vecA = DqnV4(5, 10, 15, 20);
DqnV4 vecB = DqnV4(2, 3, 6, 8);
2018-05-18 13:19:50 +00:00
DQN_ASSERT((vecA == vecB) == false);
DQN_ASSERT((vecA == DqnV4(5, 10, 15, 20)) == true);
DQN_ASSERT((vecB == DqnV4(2, 3, 6, 8)) == true);
2018-05-18 13:19:50 +00:00
DqnV4 result = vecA + DqnV4(5, 10, 15, 20);
DQN_ASSERT((result == DqnV4(10, 20, 30, 40)) == true);
2018-05-18 13:19:50 +00:00
result = result - DqnV4(5, 10, 15, 20);
DQN_ASSERT((result == DqnV4(5, 10, 15, 20)) == true);
2018-05-18 13:19:50 +00:00
result = result * 5;
DQN_ASSERT((result == DqnV4(25, 50, 75, 100)) == true);
2018-05-18 13:19:50 +00:00
result *= DqnV4(10.0f, 0.5f, 10.0f, 0.25f);
DQN_ASSERT((result == DqnV4(250, 25, 750, 25)) == true);
2018-05-18 13:19:50 +00:00
result += DqnV4(1, 1, 1, 1);
DQN_ASSERT((result == DqnV4(251, 26, 751, 26)) == true);
2018-05-18 13:19:50 +00:00
result -= DqnV4(1, 1, 1, 1);
DQN_ASSERT((result == DqnV4(250, 25, 750, 25)) == true);
2018-05-18 13:19:50 +00:00
}
Log(Status::Ok, "DqnV4: Arithmetic");
}
}
}
2017-04-10 08:40:15 +00:00
void DqnRect_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// Rect
if (1)
{
// Test rect init functions
if (1)
{
DqnRect rect4f = DqnRect(1.1f, 2.2f, 3.3f, 4.4f);
DqnRect rect4i = DqnRect(1, 2, 3, 4);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(rect4i.min.x == 1 && rect4i.min.y == 2);
DQN_ASSERT(rect4i.max.x == 4 && rect4i.max.y == 6);
const f32 EPSILON = 0.001f;
f32 diffMaxX = rect4f.max.x - 4.4f;
f32 diffMaxY = rect4f.max.y - 6.6f;
DQN_ASSERT(rect4f.min.x == 1.1f && rect4f.min.y == 2.2f);
DQN_ASSERT(DQN_ABS(diffMaxX) < EPSILON && DQN_ABS(diffMaxY) < EPSILON);
DqnRect rect = DqnRect(-10, -10, 20, 20);
DQN_ASSERT(DqnV2_Equals(rect.min, DqnV2(-10, -10)));
DQN_ASSERT(DqnV2_Equals(rect.max, DqnV2(10, 10)));
2018-05-18 13:19:50 +00:00
Log(Status::Ok, "Ctor");
}
// Test rect get size function
if (1)
{
// Test float rect
if (1)
{
DqnRect rect = DqnRect(DqnV2(-10, -10), DqnV2(20, 20));
2018-05-18 13:19:50 +00:00
f32 width, height;
rect.GetSize(&width, &height);
DQN_ASSERT(width == 20);
DQN_ASSERT(height == 20);
DqnV2 dim = rect.GetSize();
DQN_ASSERT(DqnV2_Equals(dim, DqnV2(20, 20)));
2018-05-18 13:19:50 +00:00
Log(Status::Ok, "GetSize");
}
}
// Test rect get centre
DqnRect rect = DqnRect(DqnV2(-10, -10), DqnV2(20, 20));
2018-05-18 13:19:50 +00:00
DqnV2 rectCenter = rect.GetCenter();
DQN_ASSERT(DqnV2_Equals(rectCenter, DqnV2(0, 0)));
2018-05-18 13:19:50 +00:00
Log(Status::Ok, "GetCentre");
// Test clipping rect get centre
DqnRect clipRect = DqnRect(DqnV2(-15, -15), DqnV2(10, 10) + DqnV2(15));
2018-05-18 13:19:50 +00:00
DqnRect clipResult = rect.ClipRect(clipRect);
DQN_ASSERT(clipResult.min.x == -10 && clipResult.min.y == -10);
DQN_ASSERT(clipResult.max.x == 10 && clipResult.max.y == 10);
Log(Status::Ok, "ClipRect");
// Test shifting rect
if (1)
{
DqnRect shiftedRect = rect.Move(DqnV2(10, 0));
DQN_ASSERT(DqnV2_Equals(shiftedRect.min, DqnV2(0, -10)));
DQN_ASSERT(DqnV2_Equals(shiftedRect.max, DqnV2(20, 10)));
2018-05-18 13:19:50 +00:00
// Ensure dimensions have remained the same
if (1)
{
f32 width, height;
shiftedRect.GetSize(&width, &height);
DQN_ASSERT(width == 20);
DQN_ASSERT(height == 20);
DqnV2 dim = shiftedRect.GetSize();
DQN_ASSERT(DqnV2_Equals(dim, DqnV2(20, 20)));
2018-05-18 13:19:50 +00:00
}
// Test rect contains p
if (1)
{
DqnV2 inP = DqnV2(5, 5);
DqnV2 outP = DqnV2(100, 100);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(shiftedRect.ContainsP(inP));
DQN_ASSERT(!shiftedRect.ContainsP(outP));
}
Log(Status::Ok, "Move");
}
}
2017-04-10 08:40:15 +00:00
}
void DqnArray_TestInternal(DqnMemAPI *const memAPI)
2017-04-10 08:40:15 +00:00
{
2018-05-18 13:19:50 +00:00
if (1)
{
DqnArray<DqnV2> array(memAPI);
2018-05-18 13:19:50 +00:00
if (1)
{
DQN_ASSERT(array.Reserve(1));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.max >= 1);
DQN_ASSERT(array.count == 0);
// Test basic push
2018-05-18 13:19:50 +00:00
if (1)
{
DqnV2 va = DqnV2(5, 10);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.Push(va));
DqnV2 vb = array.data[0];
DQN_ASSERT(DqnV2_Equals(va, vb));
DQN_ASSERT(array.max >= 1);
DQN_ASSERT(array.count == 1);
Log(Status::Ok, "Test basic push");
2018-05-18 13:19:50 +00:00
}
// Test array resizing and freeing
if (1)
{
DqnV2 va = DqnV2(10, 15);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.Push(va));
DqnV2 vb = array.data[0];
DQN_ASSERT(DqnV2_Equals(va, vb) == false);
vb = array.data[1];
DQN_ASSERT(DqnV2_Equals(va, vb) == true);
DQN_ASSERT(array.max >= 2);
DQN_ASSERT(array.count == 2);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 3);
DQN_ASSERT(array.count == 3);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 4);
DQN_ASSERT(array.count == 4);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 5);
DQN_ASSERT(array.count == 5);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 6);
DQN_ASSERT(array.count == 6);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 7);
DQN_ASSERT(array.count == 7);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 8);
DQN_ASSERT(array.count == 8);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 9);
DQN_ASSERT(array.count == 9);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 10);
DQN_ASSERT(array.count == 10);
DQN_ASSERT(array.Push(va));
DQN_ASSERT(array.max >= 11);
DQN_ASSERT(array.count == 11);
DqnV2 vc = DqnV2(90, 100);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.Push(vc));
DQN_ASSERT(array.max >= 12);
DQN_ASSERT(array.count == 12);
DQN_ASSERT(DqnV2_Equals(vc, array.data[11]));
Log(Status::Ok, "Test resizing and free");
}
array.Free();
// Test insert
if (1)
{
DqnV2 va = DqnV2(5, 10);
array.Push(va);
array.Push(va);
array.Push(va);
DqnV2 vb = DqnV2(1, 2);
2018-06-28 13:25:25 +00:00
array.Insert(-1, vb);
DQN_ASSERT(DqnV2_Equals(array.data[0], vb));
DqnV2 vc = DqnV2(2, 1);
2018-06-28 13:25:25 +00:00
array.Insert(array.count, vc);
DQN_ASSERT(DqnV2_Equals(array.data[array.count-1], vc));
DqnV2 vd = DqnV2(8, 9);
2018-06-28 13:25:25 +00:00
array.Insert(1, vd);
DQN_ASSERT(DqnV2_Equals(array.data[0], vb));
DQN_ASSERT(DqnV2_Equals(array.data[1], vd));
DQN_ASSERT(DqnV2_Equals(array.data[2], va));
DQN_ASSERT(DqnV2_Equals(array.data[3], va));
DQN_ASSERT(DqnV2_Equals(array.data[4], va));
DQN_ASSERT(DqnV2_Equals(array.data[5], vc));
Log(Status::Ok, "Test insert");
}
array.Free();
// Test multi-insert
if (1)
{
DqnV2 va[] = {DqnV2(5, 10), DqnV2(6, 10), DqnV2(7, 10)};
DqnV2 tmp = DqnV2(1, 1);
array.Push(tmp);
array.Push(tmp);
array.Push(tmp);
2018-06-28 13:25:25 +00:00
array.Insert(1, va, DQN_ARRAY_COUNT(va));
DQN_ASSERT(DqnV2_Equals(array.data[0], tmp));
DQN_ASSERT(DqnV2_Equals(array.data[1], va[0]));
DQN_ASSERT(DqnV2_Equals(array.data[2], va[1]));
DQN_ASSERT(DqnV2_Equals(array.data[3], va[2]));
DQN_ASSERT(DqnV2_Equals(array.data[4], tmp));
DQN_ASSERT(DqnV2_Equals(array.data[5], tmp));
Log(Status::Ok, "Test insert");
}
array.Free();
2018-05-18 13:19:50 +00:00
}
if (1)
{
DQN_ASSERT(array.Reserve(1));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.max >= 1);
DQN_ASSERT(array.count == 0);
Log(Status::Ok, "Empty array");
}
array.Free();
if (1)
{
DqnV2 a = DqnV2(1, 2);
DqnV2 b = DqnV2(3, 4);
DqnV2 c = DqnV2(5, 6);
DqnV2 d = DqnV2(7, 8);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.Reserve(16));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 0);
array.Clear();
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 0);
DQN_ASSERT(array.Push(a));
DQN_ASSERT(array.Push(b));
DQN_ASSERT(array.Push(c));
DQN_ASSERT(array.Push(d));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 4);
2018-06-28 13:25:25 +00:00
array.Erase(0);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Equals(array.data[0], d));
DQN_ASSERT(DqnV2_Equals(array.data[1], b));
DQN_ASSERT(DqnV2_Equals(array.data[2], c));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 3);
2018-06-28 13:25:25 +00:00
array.Erase(2);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Equals(array.data[0], d));
DQN_ASSERT(DqnV2_Equals(array.data[1], b));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 2);
2018-06-28 13:25:25 +00:00
// array.Erase(100);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Equals(array.data[0], d));
DQN_ASSERT(DqnV2_Equals(array.data[1], b));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 2);
array.Clear();
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 0);
Log(Status::Ok, "Test removal");
}
array.Free();
array.memAPI = memAPI;
2018-05-18 13:19:50 +00:00
if (1)
{
DqnV2 a = DqnV2(1, 2);
DqnV2 b = DqnV2(3, 4);
DqnV2 c = DqnV2(5, 6);
DqnV2 d = DqnV2(7, 8);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.Reserve(16));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.Push(a));
DQN_ASSERT(array.Push(b));
DQN_ASSERT(array.Push(c));
DQN_ASSERT(array.Push(d));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 4);
2018-06-28 13:25:25 +00:00
array.EraseStable(0);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Equals(array.data[0], b));
DQN_ASSERT(DqnV2_Equals(array.data[1], c));
DQN_ASSERT(DqnV2_Equals(array.data[2], d));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 3);
2018-06-28 13:25:25 +00:00
array.EraseStable(1);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Equals(array.data[0], b));
DQN_ASSERT(DqnV2_Equals(array.data[1], d));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 2);
2018-06-28 13:25:25 +00:00
array.EraseStable(1);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(DqnV2_Equals(array.data[0], b));
DQN_ASSERT(array.max >= 16);
DQN_ASSERT(array.count == 1);
Log(Status::Ok, "Test stable removal");
}
array.Free();
}
2018-06-28 13:25:25 +00:00
// TODO(doyle): Stable erase list API
#if 0
2018-05-18 13:19:50 +00:00
if (1)
{
// Test normal remove list scenario
if (1)
{
i64 indexesToFree[] = {3, 2, 1, 0};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 0);
array.Free();
}
// Test all indexes invalid
if (1)
{
i64 indexesToFree[] = {100, 200, 300, 400};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 4);
DQN_ASSERT(array.data[0] == 128);
DQN_ASSERT(array.data[1] == 32);
DQN_ASSERT(array.data[2] == 29);
DQN_ASSERT(array.data[3] == 31);
array.Free();
}
// Test remove singular index
if (1)
{
i64 indexesToFree[] = {1};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 3);
DQN_ASSERT(array.data[0] == 128);
DQN_ASSERT(array.data[1] == 29);
DQN_ASSERT(array.data[2] == 31);
array.Free();
}
// Test remove singular invalid index
if (1)
{
i64 indexesToFree[] = {100};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 4);
DQN_ASSERT(array.data[0] == 128);
DQN_ASSERT(array.data[1] == 32);
DQN_ASSERT(array.data[2] == 29);
DQN_ASSERT(array.data[3] == 31);
array.Free();
}
// Test remove second last index
if (1)
{
i64 indexesToFree[] = {2};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 3);
DQN_ASSERT(array.data[0] == 128);
DQN_ASSERT(array.data[1] == 32);
DQN_ASSERT(array.data[2] == 31);
array.Free();
}
// Test remove last 2 indexes
if (1)
{
i64 indexesToFree[] = {2, 3};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 2);
DQN_ASSERT(array.data[0] == 128);
DQN_ASSERT(array.data[1] == 32);
array.Free();
}
// Test invalid free index doesn't delete out of bounds
if (1)
{
i64 indexesToFree[] = {30, 1, 3};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 2);
DQN_ASSERT(array.data[0] == 128);
DQN_ASSERT(array.data[1] == 29);
array.Free();
}
// Test a free list including the first index
if (1)
{
i64 indexesToFree[] = {0, 1, 2};
i32 intList[] = {128, 32, 29, 31};
DqnArray<i32> array(memAPI);
array.Reserve(DQN_ARRAY_COUNT(intList));
2018-05-18 13:19:50 +00:00
array.Push(intList, DQN_ARRAY_COUNT(intList));
2018-06-28 13:25:25 +00:00
array.EraseStable(indexesToFree, DQN_ARRAY_COUNT(indexesToFree));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array.count == 1);
DQN_ASSERT(array.data[0] == 31);
array.Free();
}
Log(Status::Ok, "Test stable removal with list of indexes");
}
2018-06-28 13:25:25 +00:00
#endif
}
void DqnArray_TestRealDataInternal(DqnArray<char> *array)
{
(void)array;
#ifdef DQN_PLATFORM_HEADER
2018-05-18 13:19:50 +00:00
size_t bufSize = 0;
u8 *buf = DqnFile::ReadEntireFile("tests/google-10000-english.txt", &bufSize);
DQN_ASSERT(buf);
2018-05-18 13:19:50 +00:00
for (usize i = 0; i < bufSize; i++)
array->Push(buf[i]);
2018-05-18 13:19:50 +00:00
DQN_ASSERT((size_t)array->count == bufSize);
for (auto i = 0; i < array->count; i++)
DQN_ASSERT(array->data[i] == buf[i]);
2018-05-18 13:19:50 +00:00
array->Free();
free(buf);
2018-05-18 13:19:50 +00:00
Log(Status::Ok, "Testing real data");
#endif
}
void DqnArray_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
if (1)
{
auto allocator = DqnMemAPI::HeapAllocator();
DqnArray_TestInternal(&allocator);
}
if (1)
{
if (1)
{
DqnArray<char> array1 = {};
array1.Reserve(3);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array1.count == 0);
DQN_ASSERT(array1.max == 3);
array1.Free();
array1.Reserve(0);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(array1.count == 0);
DQN_ASSERT(array1.max == 0);
array1.Push('c');
DQN_ASSERT(array1.count == 1);
array1.Free();
Log(Status::Ok, "Testing faux-array constructors DqnArray_()");
}
if (1)
{
DqnArray<char> array = {};
DQN_ASSERT(array.Reserve(1));
2018-05-18 13:19:50 +00:00
DqnArray_TestRealDataInternal(&array);
}
if (1)
{
2018-06-25 10:54:38 +00:00
DqnMemStack stack = {}; stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard);
2018-05-18 13:19:50 +00:00
if (1)
{
auto memGuard0 = stack.TempRegionGuard();
DqnArray<char> array(&stack.myHeadAPI);
DQN_ASSERT(array.Reserve(1));
2018-05-18 13:19:50 +00:00
DqnArray_TestRealDataInternal(&array);
}
// Test reallocing strategies for memory stacks
if (1)
{
auto memGuard0 = stack.TempRegionGuard();
DqnArray<char> array(&stack.myHeadAPI);
DQN_ASSERT(array.Reserve(128));
2018-05-18 13:19:50 +00:00
stack.Push(1024);
DqnArray_TestRealDataInternal(&array);
}
stack.Free();
}
}
2017-04-10 08:40:15 +00:00
}
#ifdef DQN_PLATFORM_HEADER
void DqnFile_Test()
2017-06-21 04:10:53 +00:00
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// File i/o
if (1)
{
// Test file open
if (1)
{
const char *const FILE_TO_OPEN = ".clang-format";
u32 expectedSize = 0;
2017-06-21 07:48:00 +00:00
#if defined(DQN_UNIX_IMPLEMENTATION)
2018-05-18 13:19:50 +00:00
{
struct stat fileStat = {0};
DQN_ASSERT(stat(FILE_TO_OPEN, &fileStat) == 0);
expectedSize = fileStat.st_size;
}
if (1)
{
// NOTE: cpuinfo is generated when queried, so a normal 'stat'
// should give us zero, but we fall back to manual byte checking
// which should give us the proper size.
size_t size = 0;
DQN_ASSERT(DqnFile::GetFileSize("/proc/cpuinfo", &size));
DQN_ASSERT(size > 0);
}
2017-06-21 07:48:00 +00:00
#elif defined(DQN_WIN32_IMPLEMENTATION)
2018-05-18 13:19:50 +00:00
{
HANDLE handle = CreateFile(FILE_TO_OPEN, GENERIC_READ, 0, NULL, OPEN_EXISTING,
FILE_ATTRIBUTE_NORMAL, NULL);
if (handle == INVALID_HANDLE_VALUE)
{
DqnWin32_DisplayLastError("CreateFile() failed");
}
DQN_ASSERT(handle != INVALID_HANDLE_VALUE);
LARGE_INTEGER size;
DQN_ASSERT(GetFileSizeEx(handle, &size));
CloseHandle(handle);
expectedSize = size.LowPart;
}
2017-06-21 07:48:00 +00:00
#endif
2018-05-18 13:19:50 +00:00
if (1)
{
size_t size = 0;
DQN_ASSERT(DqnFile::GetFileSize(FILE_TO_OPEN, &size));
DQN_ASSERT(size == expectedSize);
}
DqnFile file = {};
DQN_ASSERT(file.Open(".clang-format",
(DqnFile::PermissionFlag::FileWrite | DqnFile::PermissionFlag::FileRead),
DqnFile::Action::OpenOnly));
DQN_ASSERTM(file.size == expectedSize,
"DqnFileOpen() failed: file.size: %d, expected:%d\n", file.size,
expectedSize);
u8 *buffer = (u8 *)calloc(1, (size_t)file.size * sizeof(u8));
DQN_ASSERT(file.Read(buffer, (u32)file.size) == file.size);
free(buffer);
file.Close();
DQN_ASSERT(!file.handle && file.size == 0 && file.flags == 0);
if (1)
{
DqnSmartFile raiiFile = {};
if (raiiFile.Open(FILE_TO_OPEN,
DqnFile::PermissionFlag::FileWrite | DqnFile::PermissionFlag::FileRead,
DqnFile::Action::OpenOnly))
{
i32 breakHereToTestRaii = 0;
(void)breakHereToTestRaii;
}
}
Log(Status::Ok, "General test");
}
// Test invalid file
if (1)
{
DqnFile file = {};
DQN_ASSERT(!file.Open("asdljasdnel;kajdf", (DqnFile::PermissionFlag::FileWrite |
DqnFile::PermissionFlag::FileRead),
DqnFile::Action::OpenOnly));
DQN_ASSERT(file.size == 0);
DQN_ASSERT(file.flags == 0);
DQN_ASSERT(!file.handle);
Log(Status::Ok, "Invalid file test");
}
}
// Write Test
if (1)
{
const char *fileNames[] = {"dqn_1", "dqn_2", "dqn_3", "dqn_4", "dqn_5"};
const char *writeData[] = {"1234", "2468", "36912", "481216", "5101520"};
DqnFile files[DQN_ARRAY_COUNT(fileNames)] = {};
// Write data out to some files
for (u32 i = 0; i < DQN_ARRAY_COUNT(fileNames); i++)
{
u32 permissions = DqnFile::PermissionFlag::FileRead | DqnFile::PermissionFlag::FileWrite;
DqnFile *file = files + i;
if (!file->Open(fileNames[i], permissions, DqnFile::Action::ClearIfExist))
{
bool result =
file->Open(fileNames[i], permissions, DqnFile::Action::CreateIfNotExist);
DQN_ASSERT(result);
}
size_t bytesToWrite = DqnStr_Len(writeData[i]);
u8 *dataToWrite = (u8 *)(writeData[i]);
size_t bytesWritten = file->Write(dataToWrite, bytesToWrite, 0);
DQN_ASSERT(bytesWritten == bytesToWrite);
file->Close();
}
DqnMemStack memStack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(memStack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
// Read data back in
for (u32 i = 0; i < DQN_ARRAY_COUNT(fileNames); i++)
{
// Manual read the file contents
{
u32 permissions = DqnFile::PermissionFlag::FileRead;
DqnFile *file = files + i;
bool result = file->Open(fileNames[i], permissions, DqnFile::Action::OpenOnly);
DQN_ASSERT(result);
u8 *buffer = (u8 *)memStack.Push(file->size);
DQN_ASSERT(buffer);
size_t bytesRead = file->Read(buffer, file->size);
DQN_ASSERT(bytesRead == file->size);
// Verify the data is the same as we wrote out
DQN_ASSERT(DqnStr_Cmp((char *)buffer, (writeData[i]), (i32)bytesRead) == 0);
// Delete when we're done with it
memStack.Pop(buffer);
file->Close();
}
// Read using the ReadEntireFile api which doesn't need a file handle as an argument
{
size_t reqSize = 0;
DQN_ASSERT(DqnFile::GetFileSize(fileNames[i], &reqSize));
u8 *buffer = (u8 *)memStack.Push(reqSize);
DQN_ASSERT(buffer);
size_t bytesRead = 0;
DQN_ASSERT(DqnFile::ReadEntireFile(fileNames[i], buffer, reqSize, &bytesRead));
DQN_ASSERT(bytesRead == reqSize);
// Verify the data is the same as we wrote out
DQN_ASSERT(DqnStr_Cmp((char *)buffer, (writeData[i]), (i32)reqSize) == 0);
memStack.Pop(buffer);
}
DQN_ASSERT(DqnFile::Delete(fileNames[i]));
}
// Then check delete actually worked, files should not exist.
for (u32 i = 0; i < DQN_ARRAY_COUNT(fileNames); i++)
{
DqnFile dummy = {};
u32 permissions = DqnFile::PermissionFlag::FileRead;
bool fileExists = dummy.Open(fileNames[i], permissions, DqnFile::Action::OpenOnly);
DQN_ASSERT(!fileExists);
}
memStack.Free();
Log(Status::Ok, "Write file");
}
// Test directory listing
if (1)
{
i32 numFiles;
#if defined(DQN_UNIX_IMPLEMENTATION)
2018-05-18 13:19:50 +00:00
char **filelist = DqnFile::ListDir(".", &numFiles);
#elif defined(DQN_WIN32_IMPLEMENTATION)
2018-05-18 13:19:50 +00:00
char **filelist = DqnFile::ListDir("*", &numFiles);
#endif
2018-05-18 13:19:50 +00:00
Log("Test directory listing");
globalIndent++;
for (auto i = 0; i < numFiles; i++)
Log("%02d: %s", i, filelist[i]);
2017-06-21 04:10:53 +00:00
2018-05-18 13:19:50 +00:00
DqnFile::ListDirFree(filelist, numFiles);
globalIndent--;
Log(Status::Ok, "List directory files");
}
2017-06-21 04:10:53 +00:00
}
void DqnTimer_Test()
{
LOG_HEADER();
if (1)
{
f64 startInMs = DqnTimer_NowInMs();
#if defined(DQN_UNIX_PLATFORM)
u32 sleepTimeInMs = 1;
sleep(sleepTimeInMs);
Log("start: %f, end: %f", startInMs, endInMs);
DQN_ASSERT((startInMs + sleepTimeInMs) <= endInMs);
#elif defined(DQN_WIN32_PLATFORM)
u32 sleepTimeInMs = 1000;
Sleep(sleepTimeInMs);
DQN_ASSERT((startInMs + sleepTimeInMs) <= endInMs);
2017-06-21 07:48:00 +00:00
#endif
f64 endInMs = DqnTimer_NowInMs();
Log(Status::Ok, "Timer advanced in time over 1 second");
globalIndent++;
Log("Start: %f, End: %f", startInMs, endInMs);
globalIndent--;
}
}
2017-06-21 04:10:53 +00:00
FILE_SCOPE u32 volatile globalDebugCounter;
FILE_SCOPE DqnLock globalJobQueueLock;
const u32 QUEUE_SIZE = 256;
2018-03-08 15:03:05 +00:00
FILE_SCOPE void JobQueueDebugCallbackIncrementCounter(DqnJobQueue *const queue, void *const userData)
{
2018-05-18 13:19:50 +00:00
(void)userData;
DQN_ASSERT(queue->size == QUEUE_SIZE);
{
DqnLockGuard guard = globalJobQueueLock.LockGuard();
globalDebugCounter++;
2017-06-28 12:47:27 +00:00
// u32 number = globalDebugCounter;
#if defined(DQN_WIN32_IMPLEMENTATION)
// Log("JobQueueDebugCallbackIncrementCounter(): Thread %d: Incrementing Number: %d", GetCurrentThreadId(), number);
#elif defined(DQN_UNIX_IMPLEMENTATION)
// Log("JobQueueDebugCallbackIncrementCounter(): Thread unix: Incrementing Number: %d", number);
#endif
2018-05-18 13:19:50 +00:00
}
}
FILE_SCOPE void DqnJobQueue_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
globalDebugCounter = 0;
DqnMemStack memStack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(memStack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
u32 numThreads, numCores;
2018-06-25 14:33:46 +00:00
DqnOS_GetThreadsAndCores(&numCores, &numThreads);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(numThreads > 0 && numCores > 0);
u32 totalThreads = (numCores - 1) * numThreads;
if (totalThreads == 0) totalThreads = 1;
DqnJobQueue jobQueue = {};
DqnJob *jobList = (DqnJob *)memStack.Push(sizeof(*jobQueue.jobList) * QUEUE_SIZE);
DQN_ASSERT(DqnJobQueue_Init(&jobQueue, jobList, QUEUE_SIZE, totalThreads));
const u32 WORK_ENTRIES = 2048;
DQN_ASSERT(DqnLock_Init(&globalJobQueueLock));
for (u32 i = 0; i < WORK_ENTRIES; i++)
{
DqnJob job = {};
job.callback = JobQueueDebugCallbackIncrementCounter;
while (!DqnJobQueue_AddJob(&jobQueue, job))
{
DqnJobQueue_TryExecuteNextJob(&jobQueue);
}
}
DqnJobQueue_BlockAndCompleteAllJobs(&jobQueue);
DQN_ASSERT(globalDebugCounter == WORK_ENTRIES);
DqnLock_Delete(&globalJobQueueLock);
Log("Final incremented value: %d\n", globalDebugCounter);
}
#else
f64 DqnTimer_NowInMs() { return 0; }
f64 DqnTimer_NowInS() { return 0; }
#endif // DQN_PLATFORM_HEADER
2017-06-28 12:47:27 +00:00
#include <algorithm>
void DqnQuickSort_Test()
2017-06-28 12:47:27 +00:00
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
2018-06-11 09:16:54 +00:00
auto state = DqnRndPCG();
2018-05-18 13:19:50 +00:00
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_KILOBYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
// Create array of ints
u32 numInts = 1000000;
u32 sizeInBytes = sizeof(u32) * numInts;
u32 *dqnCPPArray = (u32 *)stack.Push(sizeInBytes);
u32 *stdArray = (u32 *)stack.Push(sizeInBytes);
DQN_ASSERT(dqnCPPArray && stdArray);
f64 dqnCPPTimings[2] = {};
2018-05-18 13:19:50 +00:00
f64 stdTimings[DQN_ARRAY_COUNT(dqnCPPTimings)] = {};
f64 dqnCPPAverage = 0;
f64 stdAverage = 0;
Log("Timings"); globalIndent++;
for (u32 timingsIndex = 0; timingsIndex < DQN_ARRAY_COUNT(dqnCPPTimings); timingsIndex++)
{
// Populate with random numbers
for (u32 i = 0; i < numInts; i++)
{
dqnCPPArray[i] = state.Next();
stdArray[i] = dqnCPPArray[i];
}
globalNewLine = false;
Log("%02d: ", timingsIndex);
globalIndent -= 2;
// Time Dqn_QuickSort
{
f64 start = DqnTimer_NowInS();
Dqn_QuickSort(dqnCPPArray, numInts);
f64 duration = DqnTimer_NowInS() - start;
dqnCPPTimings[timingsIndex] = duration;
dqnCPPAverage += duration;
Log("Dqn_QuickSort: %f vs ", dqnCPPTimings[timingsIndex]);
}
// Time std::sort
globalNewLine = true;
{
f64 start = DqnTimer_NowInS();
std::sort(stdArray, stdArray + numInts);
f64 duration = DqnTimer_NowInS() - start;
stdTimings[timingsIndex] = duration;
stdAverage += duration;
Log("std::sort: %f", stdTimings[timingsIndex]);
}
globalIndent += 2;
// Validate algorithm is correct
for (u32 i = 0; i < numInts; i++)
{
DQN_ASSERTM(dqnCPPArray[i] == stdArray[i], "DqnArray[%d]: %d, stdArray[%d]: %d", i,
dqnCPPArray[i], stdArray[i], i);
}
}
globalIndent--;
// Print averages
if (1)
{
dqnCPPAverage /= (f64)DQN_ARRAY_COUNT(dqnCPPTimings);
stdAverage /= (f64)DQN_ARRAY_COUNT(stdTimings);
Log("Average Timings");
globalIndent++;
Log("Dqn_QuickSort: %f vs std::sort: %f\n", dqnCPPAverage, stdAverage);
globalIndent--;
}
stack.Free();
Log(Status::Ok, "QuickSort");
}
2017-06-28 12:47:27 +00:00
}
void DqnHashTable_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
DqnHashTable<u32> hashTable = {};
hashTable.Init(1);
2018-05-18 13:19:50 +00:00
{
hashTable.AddNewEntriesToFreeList(+2);
DQN_ASSERT(hashTable.freeList && hashTable.freeList->next);
DQN_ASSERT(hashTable.numFreeEntries == 2);
2018-05-18 13:19:50 +00:00
hashTable.AddNewEntriesToFreeList(-1);
DQN_ASSERT(hashTable.freeList && !hashTable.freeList->next);
DQN_ASSERT(hashTable.numFreeEntries == 1);
}
2018-05-18 13:19:50 +00:00
{
DQN_ASSERT(hashTable.Get("hello world") == nullptr);
DQN_ASSERT(hashTable.Get("collide key") == nullptr);
DQN_ASSERT(hashTable.Get("crash again") == nullptr);
2018-05-18 13:19:50 +00:00
bool entryAlreadyExisted = true;
auto helloEntry = hashTable.Make("hello world", -1, &entryAlreadyExisted);
DQN_ASSERT(entryAlreadyExisted == false);
2018-05-18 13:19:50 +00:00
entryAlreadyExisted = true;
auto collideEntry = hashTable.Make("collide key", -1, &entryAlreadyExisted);
DQN_ASSERT(entryAlreadyExisted == false);
2018-05-18 13:19:50 +00:00
entryAlreadyExisted = true;
auto crashEntry = hashTable.Make("crash again", -1, &entryAlreadyExisted);
DQN_ASSERT(entryAlreadyExisted == false);
2018-05-18 13:19:50 +00:00
helloEntry->data = 5;
collideEntry->data = 10;
crashEntry->data = 15;
2018-05-18 13:19:50 +00:00
DQN_ASSERT(hashTable.numFreeEntries == 0);
2018-05-18 13:19:50 +00:00
DqnHashTable<u32>::Entry *entry = *hashTable.entries;
DQN_ASSERT(entry->data == 15);
2018-05-18 13:19:50 +00:00
entry = entry->next;
DQN_ASSERT(entry->data == 10);
2018-05-18 13:19:50 +00:00
entry = entry->next;
DQN_ASSERT(entry->data == 5);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(hashTable.usedEntriesIndex == 1);
DQN_ASSERT(hashTable.usedEntries[0] == 0);
DQN_ASSERT(hashTable.numFreeEntries == 0);
}
2018-05-18 13:19:50 +00:00
hashTable.Remove("hello world");
DQN_ASSERT(hashTable.ChangeNumEntries(512));
2018-05-18 13:19:50 +00:00
{
auto helloEntry = hashTable.Get("hello world");
DQN_ASSERT(helloEntry == nullptr);
2018-05-18 13:19:50 +00:00
auto collideEntry = hashTable.Get("collide key");
DQN_ASSERT(collideEntry->data == 10);
2018-05-18 13:19:50 +00:00
auto crashEntry = hashTable.Get("crash again");
DQN_ASSERT(crashEntry->data == 15);
2018-05-18 13:19:50 +00:00
bool entryAlreadyExisted = false;
collideEntry = hashTable.Make("collide key", -1, &entryAlreadyExisted);
DQN_ASSERT(entryAlreadyExisted == true);
2018-05-18 13:19:50 +00:00
entryAlreadyExisted = false;
crashEntry = hashTable.Make("crash again", -1, &entryAlreadyExisted);
DQN_ASSERT(entryAlreadyExisted == true);
}
2018-05-18 13:19:50 +00:00
hashTable.Free();
Log(Status::Ok, "HashTable");
}
2017-12-06 08:08:49 +00:00
void Dqn_BSearch_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
if (1)
{
auto IsLessThan = [](const u32 &a, const u32 &b) -> bool {
bool result = a < b;
return result;
};
2018-05-18 13:19:50 +00:00
auto Equals = [](const u32 &a, const u32 &b) -> bool {
bool result = (a == b);
return result;
};
2017-12-06 08:08:49 +00:00
2018-05-18 13:19:50 +00:00
u32 array[] = {1, 2, 3};
i64 result = Dqn_BSearch<u32>(array, DQN_ARRAY_COUNT(array), 1, Equals, IsLessThan);
DQN_ASSERT(result == 0);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch<u32>(array, DQN_ARRAY_COUNT(array), 2, Equals, IsLessThan);
DQN_ASSERT(result == 1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch<u32>(array, DQN_ARRAY_COUNT(array), 3, Equals, IsLessThan);
DQN_ASSERT(result == 2);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch<u32>(array, DQN_ARRAY_COUNT(array), 4, Equals, IsLessThan);
DQN_ASSERT(result == -1);
Log(Status::Ok, "With odd sized array and custom compare");
}
2018-05-18 13:19:50 +00:00
if (1)
{
i64 array[] = {1, 2, 3, 4};
i64 result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 1);
DQN_ASSERT(result == 0);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 2);
DQN_ASSERT(result == 1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 3);
DQN_ASSERT(result == 2);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 4);
DQN_ASSERT(result == 3);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 5);
DQN_ASSERT(result == -1);
Log(Status::Ok, "With even sized array");
}
2018-05-18 13:19:50 +00:00
if (1)
{
i64 array[] = {1, 2, 3};
i64 result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 0, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 1, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 2, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 0);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 3, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 4, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 2);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 5, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 2);
Log(Status::Ok, "Lower bound with odd sized array");
}
2018-05-18 13:19:50 +00:00
if (1)
{
i64 array[] = {1, 2, 3, 4};
2018-05-18 13:19:50 +00:00
i64 result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 0, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 1, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 2, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 0);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 3, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 4, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 2);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 5, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 3);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 6, Dqn_BSearchBound_Lower);
DQN_ASSERT(result == 3);
Log(Status::Ok, "Lower bound with even sized array");
}
2018-05-18 13:19:50 +00:00
if (1)
{
i64 array[] = {1, 2, 3};
i64 result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 0, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == 0);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 1, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == 1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 2, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == 2);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 3, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 4, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 5, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == -1);
Log(Status::Ok, "Higher bound with odd sized array");
}
2018-05-18 13:19:50 +00:00
if (1)
{
i64 array[] = {1, 2, 3, 4};
2018-05-18 13:19:50 +00:00
i64 result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 0, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == 0);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 1, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == 1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 2, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == 2);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 3, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == 3);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 4, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 5, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == -1);
2018-05-18 13:19:50 +00:00
result = Dqn_BSearch(array, DQN_ARRAY_COUNT(array), 6, Dqn_BSearchBound_Higher);
DQN_ASSERT(result == -1);
Log(Status::Ok, "Higher bound with even sized array");
}
}
2017-12-06 08:08:49 +00:00
void DqnMemSet_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
2018-06-11 09:16:54 +00:00
auto rnd = DqnRndPCG();
2018-05-18 13:19:50 +00:00
const int NUM_TIMINGS = 5;
f64 timings[2][NUM_TIMINGS] = {};
f64 avgTimings[DQN_ARRAY_COUNT(timings)] = {};
void *buffers[DQN_ARRAY_COUNT(timings)] = {};
const i32 NUM_ITERATIONS = DQN_ARRAY_COUNT(timings[0]);
Log("Timings");
for (auto i = 0; i < NUM_ITERATIONS; i++)
{
i32 size = rnd.Range(DQN_MEGABYTE(16), DQN_MEGABYTE(32));
u8 value = (u8)rnd.Range(0, 255);
globalIndent++;
globalNewLine = false;
Log("%02d: ", i);
globalIndent--;
globalIndent--;
i32 timingsIndex = 0;
// DqnMem_Set
{
buffers[timingsIndex] = malloc(size); DQN_ASSERT(buffers[timingsIndex]);
f64 start = DqnTimer_NowInMs();
DqnMem_Set(buffers[timingsIndex], value, size);
f64 duration = DqnTimer_NowInMs() - start;
timings[timingsIndex++][i] = duration;
Log("DqnMem_Set: %5.3f vs ", duration);
}
// crt memset
{
buffers[timingsIndex] = malloc(size); DQN_ASSERT(buffers[timingsIndex]);
f64 start = DqnTimer_NowInMs();
memset(buffers[timingsIndex], value, size);
f64 duration = DqnTimer_NowInMs() - start;
timings[timingsIndex++][i] = duration;
Log("memset: %5.3f\n", duration);
}
globalIndent++;
globalNewLine = true;
for (auto testIndex = 0; testIndex < size; testIndex++)
{
DQN_ASSERT(((u8 *)buffers[0])[testIndex] == ((u8 *)buffers[1])[testIndex]);
}
for (usize bufferIndex = 0; bufferIndex < DQN_ARRAY_COUNT(buffers); bufferIndex++)
{
free(buffers[bufferIndex]);
}
}
for (usize timingsIndex = 0; timingsIndex < DQN_ARRAY_COUNT(timings); timingsIndex++)
{
f64 totalTime = 0;
for (auto iterationIndex = 0; iterationIndex < NUM_ITERATIONS; iterationIndex++)
{
totalTime += timings[timingsIndex][iterationIndex];
}
avgTimings[timingsIndex] = totalTime / (f64)NUM_ITERATIONS;
}
Log("Average Timings");
globalIndent++;
Log("DqnMem_Set: %f vs memset: %f\n", avgTimings[0], avgTimings[1]);
globalIndent--;
Log(Status::Ok, "MemSet");
2017-12-06 08:08:49 +00:00
}
FILE_SCOPE void DqnMemStack_Test()
{
2018-05-18 13:19:50 +00:00
LOG_HEADER();
// Check Alignment
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
i32 const ALIGN64 = 64;
i32 const ALIGN16 = 16;
i32 const ALIGN4 = 4;
if (1)
{
u8 *result1 = (u8 *)stack.Push(2, ALIGN4);
u8 *result2 = (u8 *)DQN_ALIGN_POW_N(result1, ALIGN4);
DQN_ASSERT(result1 == result2);
stack.Pop(result1);
}
if (1)
{
u8 *result1 = (u8 *)stack.Push(120, ALIGN16);
u8 *result2 = (u8 *)DQN_ALIGN_POW_N(result1, ALIGN16);
DQN_ASSERT(result1 == result2);
stack.Pop(result1);
}
if (1)
{
u8 *result1 = (u8 *)stack.Push(12, ALIGN64);
u8 *result2 = (u8 *)DQN_ALIGN_POW_N(result1, ALIGN64);
DQN_ASSERT(result1 == result2);
stack.Pop(result1);
}
stack.Free();
Log(Status::Ok, "Check allocated alignment to 4, 16, 64");
}
// Check Non-Expandable
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::NonExpandable));
2018-05-18 13:19:50 +00:00
auto *result1 = stack.Push(DQN_MEGABYTE(2));
DQN_ASSERT(result1 == nullptr);
DQN_ASSERT(stack.block->prevBlock == nullptr);
stack.Free();
Log(Status::Ok, "Check non-expandable flag prevents expansion.");
}
// Check Expansion
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes));
2018-05-18 13:19:50 +00:00
DQN_ASSERT(stack.metadata.GetBoundsGuardSize() == 0);
auto *oldBlock = stack.block;
DQN_ASSERT(oldBlock);
DQN_ASSERT(oldBlock->size == DQN_MEGABYTE(1));
DQN_ASSERT(oldBlock->head == oldBlock->head);
DQN_ASSERT(oldBlock->tail == oldBlock->tail);
DQN_ASSERT(oldBlock->prevBlock == nullptr);
auto *result1 = stack.Push(DQN_MEGABYTE(2));
DQN_ASSERT(result1);
DQN_ASSERT(stack.block->prevBlock == oldBlock);
DQN_ASSERT(stack.block != oldBlock);
Log(Status::Ok, "Check memory stack allocates additional memory blocks.");
stack.Free();
}
// Temporary Regions
if (1)
{
// Check temporary regions
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
DqnMemStack::Block *blockToReturnTo = stack.block;
auto headBefore = blockToReturnTo->head;
auto tailBefore = blockToReturnTo->tail;
if (1)
{
auto memGuard1 = stack.TempRegionGuard();
auto *result2 = stack.Push(100);
auto *result3 = stack.Push(100);
auto *result4 = stack.Push(100);
DQN_ASSERT(result2 && result3 && result4);
DQN_ASSERT(stack.block->head != headBefore);
DQN_ASSERT(stack.block->tail == tailBefore);
DQN_ASSERT(stack.block->memory == blockToReturnTo->memory);
// Force allocation of new block
auto *result5 = stack.Push(DQN_MEGABYTE(5));
DQN_ASSERT(result5);
DQN_ASSERT(stack.block != blockToReturnTo);
DQN_ASSERT(stack.tempRegionCount == 1);
}
DQN_ASSERT(stack.block == blockToReturnTo);
DQN_ASSERT(stack.block->head == headBefore);
DQN_ASSERT(stack.block->tail == tailBefore);
stack.Free();
}
// Check temporary regions keep state
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
DqnMemStack::Block *blockToReturnTo = stack.block;
auto headBefore = blockToReturnTo->head;
auto tailBefore = blockToReturnTo->tail;
if (1)
{
auto memGuard1 = stack.TempRegionGuard();
auto *result2 = stack.Push(100);
auto *result3 = stack.Push(100);
auto *result4 = stack.Push(100);
DQN_ASSERT(result2 && result3 && result4);
DQN_ASSERT(stack.block->head != headBefore);
DQN_ASSERT(stack.block->tail == tailBefore);
DQN_ASSERT(stack.block->memory == blockToReturnTo->memory);
// Force allocation of new block
auto *result5 = stack.Push(DQN_MEGABYTE(5));
DQN_ASSERT(result5);
DQN_ASSERT(stack.block != blockToReturnTo);
DQN_ASSERT(stack.tempRegionCount == 1);
memGuard1.region.keepHeadChanges = true;
}
DQN_ASSERT(stack.block != blockToReturnTo);
DQN_ASSERT(stack.block->prevBlock == blockToReturnTo);
DQN_ASSERT(stack.tempRegionCount == 0);
stack.Free();
}
// Check temporary regions with tail and head pushes
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *pop1 = stack.Push(222);
auto *pop2 = stack.PushOnTail(333);
DqnMemStack::Block *blockToReturnTo = stack.block;
auto headBefore = blockToReturnTo->head;
auto tailBefore = blockToReturnTo->tail;
if (1)
{
auto memGuard1 = stack.TempRegionGuard();
auto *result2 = stack.Push(100);
auto *result3 = stack.PushOnTail(100);
auto *result4 = stack.Push(100);
auto *result5 = stack.PushOnTail(100);
DQN_ASSERT(result2 && result3 && result4 && result5);
DQN_ASSERT(result3 > result5);
DQN_ASSERT(result2 < result4);
DQN_ASSERT(stack.block->head > headBefore && stack.block->head < stack.block->tail);
DQN_ASSERT(stack.block->tail >= stack.block->head && stack.block->tail < (stack.block->memory + stack.block->size));
DQN_ASSERT(stack.block->memory == blockToReturnTo->memory);
// Force allocation of new block
auto *result6 = stack.Push(DQN_MEGABYTE(5));
DQN_ASSERT(result6);
DQN_ASSERT(stack.block != blockToReturnTo);
DQN_ASSERT(stack.tempRegionCount == 1);
}
DQN_ASSERT(stack.block == blockToReturnTo);
DQN_ASSERT(stack.block->head == headBefore);
DQN_ASSERT(stack.block->tail == tailBefore);
stack.Pop(pop1);
stack.PopOnTail(pop2);
DQN_ASSERT(stack.block->head == stack.block->memory);
DQN_ASSERT(stack.block->tail == stack.block->memory + stack.block->size);
stack.Free();
}
Log(Status::Ok, "Temporary regions return state and/or keep changes if requested.");
}
// Check Fixed Mem Init
if (1)
{
// Check fail on insufficient size
if (1)
{
u8 memBuf[sizeof(DqnMemStack::Block) - 1] = {};
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
auto result = stack.Init(&(memBuf[0]), DQN_ARRAY_COUNT(memBuf), Dqn::ZeroClear::No);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(result == false);
DQN_ASSERT(stack.block == nullptr);
stack.Free();
}
// Check success
if (1)
{
i32 const bufSize = sizeof(DqnMemStack::Block) * 5;
u8 memBuf[bufSize] = {};
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
auto result = stack.Init(&(memBuf[0]), bufSize, Dqn::ZeroClear::No);
2018-05-18 13:19:50 +00:00
DQN_ASSERT(result == true);
DQN_ASSERT(stack.block);
DQN_ASSERT(stack.block->prevBlock == false);
DQN_ASSERT(stack.tempRegionCount == 0);
DQN_ASSERT(stack.flags == DqnMemStack::Flag::NonExpandable);
auto *result1 = stack.Push(32);
DQN_ASSERT(result1);
stack.Pop(result1);
auto *result2 = stack.Push(bufSize * 2);
DQN_ASSERT(result2 == nullptr);
DQN_ASSERT(stack.block);
DQN_ASSERT(stack.block->prevBlock == false);
DQN_ASSERT(stack.tempRegionCount == 0);
DQN_ASSERT(stack.flags == DqnMemStack::Flag::NonExpandable);
stack.Free();
}
Log(Status::Ok, "Checked fixed mem initialisation");
}
// Check Freeing Blocks
if (1)
{
DqnMemStack stack = {};
usize size = 32;
usize additionalSize = DqnMemStack::MINIMUM_BLOCK_SIZE;
DqnMemAPI heap = DqnMemAPI::HeapAllocator();
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(size, Dqn::ZeroClear::Yes, 0, &heap));
2018-05-18 13:19:50 +00:00
auto *block1 = stack.block;
size += additionalSize;
auto *result1 = stack.Push(size);
auto *block2 = stack.block;
size += additionalSize;
auto *result2 = stack.Push(size);
auto *block3 = stack.block;
size += additionalSize;
auto *result3 = stack.Push(size);
auto *block4 = stack.block;
size += additionalSize;
auto *result4 = stack.Push(size);
auto *block5 = stack.block;
DQN_ASSERT(result1 && result2 && result3 && result4);
DQN_ASSERT(block1 && block2 && block3 && block4 && block5);
DQN_ASSERT(block5->prevBlock == block4);
DQN_ASSERT(block4->prevBlock == block3);
DQN_ASSERT(block3->prevBlock == block2);
DQN_ASSERT(block2->prevBlock == block1);
DQN_ASSERT(block1->prevBlock == nullptr);
DQN_ASSERT(stack.FreeMemBlock(block4));
DQN_ASSERT(stack.block == block5);
DQN_ASSERT(block5->prevBlock == block3);
DQN_ASSERT(block3->prevBlock == block2);
DQN_ASSERT(block2->prevBlock == block1);
DQN_ASSERT(block1->prevBlock == nullptr);
DQN_ASSERT(stack.FreeMemBlock(block5));
DQN_ASSERT(stack.block == block3);
DQN_ASSERT(block3->prevBlock == block2);
DQN_ASSERT(block2->prevBlock == block1);
DQN_ASSERT(block1->prevBlock == nullptr);
stack.Free();
DQN_ASSERT(stack.memAPI->bytesAllocated == 0);
DQN_ASSERT(stack.block == nullptr);
Log(Status::Ok, "Check freeing arbitrary blocks and freeing");
}
// Check bounds guard places magic values
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *result = stack.Push(64);
// TODO(doyle): check head and tail are adjacent to the bounds of the allocation
u32 *head = stack.metadata.PtrToHeadBoundsGuard((u8 *)result);
u32 *tail = stack.metadata.PtrToTailBoundsGuard((u8 *)result);
DQN_ASSERT(*head == DqnAllocatorMetadata::HEAD_GUARD_VALUE);
DQN_ASSERT(*tail == DqnAllocatorMetadata::TAIL_GUARD_VALUE);
stack.Free();
Log(Status::Ok, "Bounds guards are placed adjacent and have magic values.");
}
if (1)
{
// Push to tail and head
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *result1 = stack.Push(100);
auto *result2 = stack.PushOnTail(100);
auto *headBefore = stack.block->head;
auto *tailBefore = stack.block->tail;
DQN_ASSERT(result2 && result1);
DQN_ASSERT(result2 != result1 && result1 < result2);
stack.PopOnTail(result2);
DQN_ASSERT(headBefore == stack.block->head)
DQN_ASSERT(tailBefore != stack.block->tail)
stack.Pop(result1);
DQN_ASSERT(stack.block->prevBlock == false);
DQN_ASSERT(stack.block->head == stack.block->memory);
DQN_ASSERT(stack.block->tail == stack.block->memory + stack.block->size);
stack.Free();
Log(Status::Ok, "Push, pop to tail and head.");
}
// Expansion with tail
if (1)
{
// Push too much to tail causes expansion
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *result1 = stack.Push(100);
DQN_ASSERT(stack.block->prevBlock == nullptr);
DQN_ASSERT(stack.block->head > stack.block->memory && stack.block->head < stack.block->tail);
DQN_ASSERT(stack.block->tail == stack.block->memory + stack.block->size);
auto *blockBefore = stack.block;
auto *result2 = stack.PushOnTail(DQN_MEGABYTE(1));
DQN_ASSERT(result2 && result1);
DQN_ASSERT(result2 != result1);
DQN_ASSERT(stack.block->prevBlock == blockBefore);
DQN_ASSERT(stack.block != blockBefore);
DQN_ASSERT(stack.block->head == stack.block->memory);
DQN_ASSERT(stack.block->tail < stack.block->memory + stack.block->size &&
stack.block->tail >= stack.block->head);
stack.PopOnTail(result2);
DQN_ASSERT(blockBefore == stack.block);
stack.Pop(result1);
DQN_ASSERT(blockBefore == stack.block);
stack.Free();
}
// Push too much to tail fails to expand when non expandable
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::NonExpandable));
2018-05-18 13:19:50 +00:00
auto *result1 = stack.Push(100);
DQN_ASSERT(stack.block->prevBlock == nullptr);
DQN_ASSERT(stack.block->head != stack.block->memory);
DQN_ASSERT(stack.block->tail == stack.block->memory + stack.block->size);
auto *blockBefore = stack.block;
auto *result2 = stack.PushOnTail(DQN_MEGABYTE(1));
DQN_ASSERT(result2 == nullptr);
DQN_ASSERT(stack.block->prevBlock == nullptr);
DQN_ASSERT(stack.block == blockBefore);
DQN_ASSERT(stack.block->head > stack.block->memory && stack.block->head < stack.block->tail);
DQN_ASSERT(stack.block->tail == stack.block->memory + stack.block->size);
stack.PopOnTail(result2);
DQN_ASSERT(blockBefore == stack.block);
stack.Pop(result1);
DQN_ASSERT(blockBefore == stack.block);
stack.Free();
}
Log(Status::Ok, "Non-Expanding and expanding stack with tail push.");
}
}
// Check stack allocator mem api callbacks
if (1)
{
// Realloc in same block and allow it to grow in place.
if (1)
{
// Using push on head
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *api = &stack.myHeadAPI;
auto *blockBefore = stack.block;
auto *headBefore = stack.block->head;
isize bufSize = 16;
char *buf = (char *)stack.Push(bufSize);
DqnMem_Set(buf, 'X', bufSize);
for (auto i = 0; i < bufSize; i++) DQN_ASSERT(buf[i] == 'X');
isize oldBufSize = bufSize;
bufSize = 32;
buf = (char *)api->Realloc(buf, oldBufSize, bufSize);
for (auto i = 0; i < oldBufSize; i++) DQN_ASSERT(buf[i] == 'X');
DqnMem_Set(buf, '@', bufSize);
DQN_ASSERT(blockBefore == stack.block);
DQN_ASSERT(headBefore < stack.block->head);
stack.Pop(buf);
DQN_ASSERT(blockBefore == stack.block);
DQN_ASSERT(headBefore == stack.block->head);
DQN_ASSERT(headBefore == stack.block->memory);
stack.Free();
}
// Using push on tail
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *api = &stack.myHeadAPI;
auto *blockBefore = stack.block;
auto *tailBefore = stack.block->tail;
isize bufSize = 16;
char *buf = (char *)stack.PushOnTail(bufSize);
DqnMem_Set(buf, 'X', bufSize);
for (auto i = 0; i < bufSize; i++) DQN_ASSERT(buf[i] == 'X');
isize oldBufSize = bufSize;
bufSize = 32;
buf = (char *)api->Realloc(buf, oldBufSize, bufSize);
for (auto i = 0; i < oldBufSize; i++) DQN_ASSERT(buf[i] == 'X');
DqnMem_Set(buf, '@', bufSize);
DQN_ASSERT(blockBefore == stack.block);
DQN_ASSERT(tailBefore > stack.block->tail);
stack.PopOnTail(buf);
DQN_ASSERT(blockBefore == stack.block);
DQN_ASSERT(tailBefore == stack.block->tail);
DQN_ASSERT(stack.block->head == stack.block->memory);
stack.Free();
}
Log(Status::Ok, "Allocator MemAPI callback, realloc grow in place");
}
// Realloc in same block and insufficient size and expand
if (1)
{
// Using push on head
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *api = &stack.myHeadAPI;
auto *blockBefore = stack.block;
auto *headBefore = stack.block->head;
isize bufSize = 16;
char *buf = (char *)stack.Push(bufSize);
DqnMem_Set(buf, 'X', bufSize);
for (auto i = 0; i < bufSize; i++) DQN_ASSERT(buf[i] == 'X');
isize oldBufSize = bufSize;
bufSize = DQN_MEGABYTE(2);
buf = (char *)api->Realloc(buf, oldBufSize, bufSize);
for (auto i = 0; i < oldBufSize; i++) DQN_ASSERT(buf[i] == 'X');
DqnMem_Set(buf, '@', bufSize);
DQN_ASSERT(blockBefore == stack.block->prevBlock);
stack.Pop(buf);
DQN_ASSERT(blockBefore == stack.block);
DQN_ASSERT(headBefore == stack.block->head);
DQN_ASSERT(headBefore == stack.block->memory);
stack.Free();
}
// Using push on tail
if (1)
{
DqnMemStack stack = {};
2018-06-25 10:54:38 +00:00
DQN_ASSERT(stack.Init(DQN_MEGABYTE(1), Dqn::ZeroClear::Yes, DqnMemStack::Flag::BoundsGuard));
2018-05-18 13:19:50 +00:00
auto *api = &stack.myHeadAPI;
auto *blockBefore = stack.block;
auto *tailBefore = stack.block->tail;
isize bufSize = 16;
char *buf = (char *)stack.PushOnTail(bufSize);
DqnMem_Set(buf, 'X', bufSize);
for (auto i = 0; i < bufSize; i++) DQN_ASSERT(buf[i] == 'X');
isize oldBufSize = bufSize;
bufSize = DQN_MEGABYTE(2);
buf = (char *)api->Realloc(buf, oldBufSize, bufSize);
for (auto i = 0; i < oldBufSize; i++)
DQN_ASSERT(buf[i] == 'X');
DqnMem_Set(buf, '@', bufSize);
DQN_ASSERT(blockBefore != stack.block);
DQN_ASSERT(blockBefore == stack.block->prevBlock);
stack.PopOnTail(buf);
DQN_ASSERT(blockBefore == stack.block);
DQN_ASSERT(tailBefore == stack.block->tail);
DQN_ASSERT(stack.block->head == stack.block->memory);
stack.Free();
}
Log(Status::Ok, "Allocator MemAPI callback, realloc insufficient size so expand");
}
// TODO(doyle): Realloc to smaller size logic
}
}
2017-04-10 08:40:15 +00:00
int main(void)
{
2018-05-18 13:19:50 +00:00
globalIndent = 1;
globalNewLine = true;
DqnString_Test();
DqnMemStack_Test();
DqnChar_Test();
DqnRnd_Test();
DqnMath_Test();
DqnVX_Test();
DqnRect_Test();
DqnArray_Test();
DqnQuickSort_Test();
DqnHashTable_Test();
Dqn_BSearch_Test();
DqnMemSet_Test();
DqnFixedString_Test();
2017-06-21 04:10:53 +00:00
#ifdef DQN_PLATFORM_HEADER
2018-06-28 13:25:25 +00:00
DqnOS_Test();
2018-05-18 13:19:50 +00:00
DqnFile_Test();
DqnTimer_Test();
DqnJobQueue_Test();
2017-06-21 04:10:53 +00:00
#endif
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
// Log("\nPress 'Enter' Key to Exit\n");
// getchar();
2017-04-10 08:40:15 +00:00
2018-05-18 13:19:50 +00:00
return 0;
2017-04-10 08:40:15 +00:00
}
2017-04-10 11:31:11 +00:00
2017-07-02 06:31:29 +00:00
#if defined(__GNUC__)
2018-05-18 13:19:50 +00:00
#pragma GCC diagnostic pop
2017-07-02 06:31:29 +00:00
#endif