Complete disaster-recovery snapshot: engine/game source, game data assets, VC6 toolchain + DX SDKs, build outputs, deployed game, and _UNUSED archive. Large binaries in Git LFS; text preserved byte-for-byte (core.autocrlf=false, no eol attributes). See RECOVERY.md for the one-clone rebuild procedure.
525 lines
11 KiB
C++
525 lines
11 KiB
C++
//=======================================================================
|
|
// File: SCHNTST.CPP
|
|
//
|
|
// Created: Thursday, September 29, 1994, 2:37 PM
|
|
// Author: Eric Huffman
|
|
// Project: Node.Û
|
|
|
|
// Compiler: 7.0, Û Symantec Corporation 1994
|
|
//-----------------------------------------------------------------------
|
|
// 11/03/94 ECH Made compatible with BC4.0
|
|
//-----------------------------------------------------------------------
|
|
// Copyright (C) 1994, Virtual World Entertainments, All Rights reserved
|
|
// PROPRIETARY AND CONFIDENTIAL
|
|
//=======================================================================
|
|
|
|
#include "StuffHeaders.hpp"
|
|
#include <GameOS\ToolOS.hpp>
|
|
|
|
#define TEST_COUNT 50
|
|
|
|
class SafeChainTestPlug:
|
|
public Plug
|
|
{
|
|
public:
|
|
long value;
|
|
|
|
SafeChainTestPlug(long value);
|
|
~SafeChainTestPlug();
|
|
};
|
|
|
|
class SafeChainTestNode:
|
|
public Plug
|
|
{
|
|
public:
|
|
SafeChainOf<SafeChainTestPlug*>
|
|
chain1,
|
|
chain2;
|
|
|
|
SafeChainTestNode();
|
|
~SafeChainTestNode();
|
|
|
|
bool RunProfile();
|
|
bool RunTest();
|
|
};
|
|
|
|
SafeChainTestPlug::SafeChainTestPlug(long value):
|
|
Plug(DefaultData)
|
|
{
|
|
this->value = value;
|
|
}
|
|
|
|
SafeChainTestPlug::~SafeChainTestPlug()
|
|
{
|
|
}
|
|
|
|
SafeChainTestNode::SafeChainTestNode():
|
|
Plug(DefaultData), chain1(this), chain2(this)
|
|
{
|
|
}
|
|
|
|
SafeChainTestNode::~SafeChainTestNode()
|
|
{
|
|
}
|
|
|
|
//
|
|
//###########################################################################
|
|
// ProfileClass
|
|
//###########################################################################
|
|
//
|
|
|
|
void
|
|
SafeChain::ProfileClass()
|
|
{
|
|
SafeChainTestNode testNode;
|
|
#if defined(_ARMOR)
|
|
Time startTicks = gos_GetHiResTime();
|
|
#endif
|
|
|
|
Test_Message("SafeChain::ProfileClass");
|
|
|
|
testNode.RunProfile();
|
|
|
|
SPEW((
|
|
GROUP_STUFF_TEST,
|
|
"SafeChain::ProfileClass elapsed = %f",
|
|
gos_GetHiResTime() - startTicks
|
|
));
|
|
}
|
|
|
|
//
|
|
//###########################################################################
|
|
// TestClass
|
|
//###########################################################################
|
|
//
|
|
|
|
void
|
|
SafeChain::TestClass()
|
|
{
|
|
SPEW((GROUP_STUFF_TEST, "Starting SafeChain test..."));
|
|
|
|
SafeChainTestNode testNode;
|
|
|
|
testNode.RunTest();
|
|
}
|
|
|
|
bool
|
|
SafeChainTestNode::RunProfile()
|
|
{
|
|
SafeChainTestPlug *testPlug1;
|
|
int i;
|
|
Time startTicks;
|
|
|
|
//
|
|
//--------------------------------------------------------------------
|
|
// Run timing tests
|
|
//--------------------------------------------------------------------
|
|
//
|
|
|
|
/*
|
|
* Create plugs and add to both sockets
|
|
*/
|
|
startTicks = gos_GetHiResTime();
|
|
for (i = 0; i < TEST_COUNT; i++)
|
|
{
|
|
testPlug1 = new SafeChainTestPlug(i);
|
|
Register_Object( testPlug1 );
|
|
chain1.Add(testPlug1);
|
|
chain2.Add(testPlug1);
|
|
}
|
|
SPEW((
|
|
GROUP_STUFF_TEST,
|
|
"SafeChainTestNode::RunTest Create = %f",
|
|
gos_GetHiResTime() - startTicks
|
|
));
|
|
|
|
/*
|
|
* Iterate over both sockets
|
|
*/
|
|
startTicks = gos_GetHiResTime();
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
i = 0;
|
|
while ((testPlug1 = iterator1.ReadAndNext()) != NULL)
|
|
{
|
|
Verify( testPlug1->value == i );
|
|
i++;
|
|
}
|
|
Verify( i == TEST_COUNT );
|
|
|
|
i = 0;
|
|
while ((testPlug1 = iterator2.ReadAndNext()) != NULL)
|
|
{
|
|
Verify( testPlug1->value == i );
|
|
i++;
|
|
}
|
|
Verify( i == TEST_COUNT );
|
|
}
|
|
SPEW((
|
|
GROUP_STUFF_TEST,
|
|
"SafeChainTestNode::RunTest Iterate = %f",
|
|
gos_GetHiResTime() - startTicks
|
|
));
|
|
|
|
/*
|
|
* Destroy from chain1, verify with chain2
|
|
*/
|
|
startTicks = gos_GetHiResTime();
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
i = 0;
|
|
while ((testPlug1 = iterator1.ReadAndNext()) != NULL)
|
|
{
|
|
Verify( testPlug1->value == i );
|
|
i++;
|
|
|
|
Unregister_Object( testPlug1 );
|
|
delete(testPlug1);
|
|
}
|
|
Verify( i == TEST_COUNT );
|
|
|
|
Verify( iterator1.GetSize() == 0 );
|
|
Verify( iterator2.GetSize() == 0 );
|
|
}
|
|
SPEW((
|
|
GROUP_STUFF_TEST,
|
|
"SafeChainTestNode::RunTest Destroy = %f",
|
|
gos_GetHiResTime() - startTicks
|
|
));
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
SafeChainTestNode::RunTest()
|
|
{
|
|
SafeChainTestPlug *testPlug1, *testPlug2;
|
|
int i, j;
|
|
// Time startTicks;
|
|
|
|
//
|
|
//--------------------------------------------------------------------
|
|
// Stress tests
|
|
//--------------------------------------------------------------------
|
|
//
|
|
|
|
/*
|
|
* Create plugs and add to both sockets
|
|
*/
|
|
for (i = 0; i < TEST_COUNT; i++)
|
|
{
|
|
testPlug1 = new SafeChainTestPlug(i);
|
|
Register_Object( testPlug1 );
|
|
chain1.Add(testPlug1);
|
|
chain2.Add(testPlug1);
|
|
}
|
|
|
|
/*
|
|
* Verify first and last
|
|
*/
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
iterator1.First();
|
|
iterator2.First();
|
|
|
|
testPlug1 = iterator1.GetCurrent();
|
|
testPlug2 = iterator2.GetCurrent();
|
|
|
|
Verify( testPlug1 == testPlug2 );
|
|
Verify( testPlug1 == iterator1.GetNth(0) );
|
|
Verify( testPlug1 == iterator2.GetNth(0) );
|
|
|
|
iterator1.Last();
|
|
iterator2.Last();
|
|
|
|
testPlug1 = iterator1.GetCurrent();
|
|
testPlug2 = iterator2.GetCurrent();
|
|
|
|
Verify( testPlug1 == testPlug2 );
|
|
Verify( testPlug1 == iterator1.GetNth(TEST_COUNT - 1) );
|
|
Verify( testPlug1 == iterator2.GetNth(TEST_COUNT - 1) );
|
|
}
|
|
|
|
/*
|
|
* Verify next and prev
|
|
*/
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
i = 0;
|
|
while ((testPlug1 = iterator1.GetCurrent()) != NULL)
|
|
{
|
|
testPlug2 = iterator2.GetCurrent();
|
|
|
|
Verify( testPlug1 == testPlug2 );
|
|
|
|
Verify( testPlug1->value == i );
|
|
Verify( testPlug2->value == i );
|
|
|
|
iterator1.Next();
|
|
iterator2.Next();
|
|
|
|
i++;
|
|
}
|
|
Verify( i == TEST_COUNT );
|
|
|
|
iterator1.Last();
|
|
iterator2.Last();
|
|
|
|
i = TEST_COUNT - 1;
|
|
while ((testPlug1 = iterator1.GetCurrent()) != NULL)
|
|
{
|
|
testPlug2 = iterator2.GetCurrent();
|
|
|
|
Verify( testPlug1 == testPlug2 );
|
|
|
|
Verify( testPlug1->value == i );
|
|
Verify( testPlug2->value == i );
|
|
|
|
iterator1.Previous();
|
|
iterator2.Previous();
|
|
|
|
i--;
|
|
}
|
|
Verify( i == -1 );
|
|
}
|
|
|
|
/*
|
|
* Verify read next and read prev
|
|
*/
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
i = 0;
|
|
while ((testPlug1 = iterator1.ReadAndNext()) != NULL)
|
|
{
|
|
testPlug2 = iterator2.ReadAndNext();
|
|
|
|
Verify( testPlug1 == testPlug2 );
|
|
|
|
Verify( testPlug1->value == i );
|
|
Verify( testPlug2->value == i );
|
|
|
|
i++;
|
|
}
|
|
Verify( i == TEST_COUNT );
|
|
|
|
iterator1.Last();
|
|
iterator2.Last();
|
|
|
|
i = TEST_COUNT - 1;
|
|
while ((testPlug1 = iterator1.ReadAndPrevious()) != NULL)
|
|
{
|
|
testPlug2 = iterator2.ReadAndPrevious();
|
|
|
|
Verify( testPlug1 == testPlug2 );
|
|
|
|
Verify( testPlug1->value == i );
|
|
Verify( testPlug2->value == i );
|
|
|
|
i--;
|
|
}
|
|
Verify( i == -1 );
|
|
}
|
|
|
|
/*
|
|
* Verify nth
|
|
*/
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
for (i = 0; i < TEST_COUNT; i++)
|
|
{
|
|
testPlug1 = iterator1.GetNth(i);
|
|
testPlug2 = iterator2.GetNth(i);
|
|
|
|
Verify( testPlug1 == testPlug2 );
|
|
|
|
Verify( testPlug1->value == i );
|
|
Verify( testPlug2->value == i );
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Verify Remove
|
|
*/
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
i = 0;
|
|
while ((testPlug1 = iterator1.GetCurrent()) != NULL)
|
|
{
|
|
Verify( testPlug1->value == i );
|
|
|
|
iterator1.Remove();
|
|
|
|
testPlug2 = iterator2.GetNth(0);
|
|
|
|
Verify( testPlug2->value == i );
|
|
Verify( testPlug1 == testPlug2 );
|
|
|
|
Unregister_Object( testPlug2 );
|
|
delete(testPlug2);
|
|
|
|
i++;
|
|
}
|
|
Verify( i == TEST_COUNT );
|
|
Verify( iterator1.GetSize() == 0 );
|
|
Verify( iterator2.GetSize() == 0 );
|
|
}
|
|
|
|
/*
|
|
* Verify random deletion
|
|
*/
|
|
{
|
|
/*
|
|
* Add plugs to both sockets
|
|
*/
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == 0 );
|
|
Verify( iterator2.GetSize() == 0 );
|
|
|
|
for (i = 0; i < TEST_COUNT; i++)
|
|
{
|
|
testPlug1 = new SafeChainTestPlug(i);
|
|
Register_Object( testPlug1 );
|
|
chain1.Add(testPlug1);
|
|
chain2.Add(testPlug1);
|
|
}
|
|
}
|
|
|
|
{
|
|
/*
|
|
* Perform random deletion
|
|
*/
|
|
int size, index;
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator2(&chain2);
|
|
|
|
Verify( iterator1.GetSize() == TEST_COUNT );
|
|
Verify( iterator2.GetSize() == TEST_COUNT );
|
|
|
|
i = 0;
|
|
while((size = iterator1.GetSize()) != 0)
|
|
{
|
|
index = Random::GetLessThan(size);
|
|
testPlug1 = iterator1.GetNth(index);
|
|
iterator1.Remove();
|
|
|
|
testPlug2 = iterator2.GetNth(index);
|
|
Verify( testPlug1 == testPlug2 );
|
|
|
|
Unregister_Object( testPlug2 );
|
|
delete(testPlug2);
|
|
|
|
i++;
|
|
}
|
|
Verify( i == TEST_COUNT );
|
|
Verify( iterator1.GetSize() == 0 );
|
|
Verify( iterator2.GetSize() == 0 );
|
|
}
|
|
|
|
/*
|
|
* Verify insertion
|
|
*/
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
|
|
Verify(iterator1.GetSize() == 0);
|
|
|
|
for (i = 0; i < TEST_COUNT; i++)
|
|
{
|
|
testPlug1 = new SafeChainTestPlug(i);
|
|
Register_Object(testPlug1);
|
|
|
|
if (i == 0)
|
|
{
|
|
chain1.Add(testPlug1);
|
|
}
|
|
else
|
|
{
|
|
iterator1.First();
|
|
iterator1.Insert(testPlug1);
|
|
}
|
|
}
|
|
|
|
for (i = 0, j = TEST_COUNT-1; i < TEST_COUNT; i++, j--)
|
|
{
|
|
testPlug1 = iterator1.GetNth(i);
|
|
Verify(testPlug1->value == j);
|
|
}
|
|
|
|
chain1.DeletePlugs();
|
|
}
|
|
{
|
|
SafeChainIteratorOf<SafeChainTestPlug*> iterator1(&chain1);
|
|
|
|
Verify(iterator1.GetSize() == 0);
|
|
|
|
for (i = 0; i < TEST_COUNT; i++)
|
|
{
|
|
testPlug1 = new SafeChainTestPlug(i);
|
|
Register_Object(testPlug1);
|
|
|
|
if (i == 0)
|
|
{
|
|
chain1.Add(testPlug1);
|
|
}
|
|
else
|
|
{
|
|
iterator1.Last();
|
|
iterator1.Insert(testPlug1);
|
|
}
|
|
}
|
|
|
|
for (i = 0; i < TEST_COUNT; i++)
|
|
{
|
|
testPlug1 = iterator1.GetNth(i);
|
|
if (i == TEST_COUNT-1)
|
|
{
|
|
Verify(testPlug1->value == 0);
|
|
}
|
|
else
|
|
{
|
|
Verify(testPlug1->value == i+1);
|
|
}
|
|
}
|
|
|
|
chain1.DeletePlugs();
|
|
}
|
|
return true;
|
|
}
|
|
|