This is the first step towards a »Test Domain Ongology« #1372, which is a systematic arrangement of test-dummy functionality assumed to mirror the actual media processing functionality present in external libs. Each media-processing library not only provides functions to crunch data, but also establishes a framework of entities and classification to determine what »media« is an how it is structured and can be generated, transformed and qualified. Since a essential goal for Lumiera is to be **library agnostic,** it is important to avoid naïvely to take some popular library's choices as universal truth regarding structure and nature of »media« as such. Rather, the architecture of the Lumiera Render Engine must be kept sufficiently open to accommodate the working style of various libraries, even ones not known today. To validate this architectural openness, we use a set of test functions unrelated to any existing library to validate access to and usage of rendering functionality — followed by further steps to adopt existing popular libraries like **FFmpeg** or **Gstreamer**, without tilting the basic structure of the Render Engine one way or the other.
214 lines
6.5 KiB
C++
214 lines
6.5 KiB
C++
/*
|
|
TestFrame(Test) - verify proper operation of dummy data frames
|
|
|
|
Copyright (C) Lumiera.org
|
|
2011, Hermann Vosseler <Ichthyostega@web.de>
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License as
|
|
published by the Free Software Foundation; either version 2 of
|
|
the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
* *****************************************************/
|
|
|
|
/** @file testframe-test.cpp
|
|
** unit test \ref TestFrame_test
|
|
*/
|
|
|
|
|
|
#include "lib/test/run.hpp"
|
|
#include "steam/engine/testframe.hpp"
|
|
#include "lib/util.hpp"
|
|
|
|
#include <cstdlib>
|
|
#include <memory>
|
|
|
|
using test::Test;
|
|
using std::rand;
|
|
using util::isSameObject;
|
|
using std::unique_ptr;
|
|
|
|
|
|
namespace steam {
|
|
namespace engine{
|
|
namespace test {
|
|
|
|
namespace { // used internally
|
|
|
|
const uint CHAN_COUNT = 30; // independent families of test frames to generate
|
|
const uint NUM_FRAMES = 1000; // number of test frames in each of these families
|
|
|
|
|
|
void
|
|
corruptMemory(void* base, uint offset, uint count)
|
|
{
|
|
char* accessor = reinterpret_cast<char*> (base);
|
|
while (count--)
|
|
accessor[offset+count] = rand() % CHAR_MAX;
|
|
}
|
|
} // (End) internal defs
|
|
|
|
|
|
|
|
/***************************************************************//**
|
|
* @test verify test helper for engine tests: a dummy data frame.
|
|
* TestFrame instances can be created right away, without any
|
|
* external library dependencies. A test frame is automatically
|
|
* filled with random data; multiple frames are arranged in
|
|
* sequences and channels, causing the random data to be
|
|
* reproducible yet different in each frame.
|
|
*
|
|
* To ease writing unit tests, TestFrame provides comparison
|
|
* and assignment and tracks lifecycle automatically. As tests
|
|
* regarding the engine typically have to deal with buffer
|
|
* management, an arbitrary memory location can be interpreted
|
|
* as TestFrame and checked for corruption.
|
|
*/
|
|
class TestFrame_test : public Test
|
|
{
|
|
|
|
virtual void
|
|
run (Arg)
|
|
{
|
|
verifyBasicProperties();
|
|
verifyFrameLifecycle();
|
|
verifyFrameSeries();
|
|
useFrameTable();
|
|
}
|
|
|
|
|
|
void
|
|
verifyBasicProperties()
|
|
{
|
|
CHECK (1024 < sizeof(TestFrame));
|
|
|
|
TestFrame frameA;
|
|
TestFrame frameB;
|
|
TestFrame frameC(5);
|
|
|
|
CHECK (frameA == frameB);
|
|
CHECK (frameA != frameC);
|
|
CHECK (frameB != frameC);
|
|
|
|
CHECK (frameA.isAlive());
|
|
CHECK (frameB.isAlive());
|
|
CHECK (frameC.isAlive());
|
|
|
|
CHECK (frameA.isSane());
|
|
CHECK (frameB.isSane());
|
|
CHECK (frameC.isSane());
|
|
|
|
void * frameMem = &frameB;
|
|
|
|
CHECK (frameA == frameMem);
|
|
corruptMemory(frameMem,20,5);
|
|
CHECK (!frameB.isSane());
|
|
|
|
frameB = frameC;
|
|
|
|
CHECK (frameB.isSane());
|
|
CHECK (frameA != frameB);
|
|
CHECK (frameA != frameC);
|
|
CHECK (frameB == frameC);
|
|
}
|
|
|
|
|
|
void
|
|
verifyFrameLifecycle()
|
|
{
|
|
CHECK (!TestFrame::isDead (this));
|
|
CHECK (!TestFrame::isAlive (this));
|
|
|
|
static char buffer[sizeof(TestFrame)];
|
|
TestFrame* frame = new(&buffer) TestFrame(23);
|
|
|
|
CHECK ( TestFrame::isAlive (frame));
|
|
CHECK (!frame->isDead());
|
|
CHECK (frame->isAlive());
|
|
CHECK (frame->isSane());
|
|
|
|
frame->~TestFrame();
|
|
CHECK ( TestFrame::isDead (frame));
|
|
CHECK (!TestFrame::isAlive (frame));
|
|
}
|
|
|
|
|
|
/** @test build sequences of test frames,
|
|
* organised into multiple families (channels).
|
|
* Verify that adjacent frames hold differing data
|
|
*/
|
|
void
|
|
verifyFrameSeries()
|
|
{
|
|
unique_ptr<TestFrame> thisFrames[CHAN_COUNT];
|
|
unique_ptr<TestFrame> prevFrames[CHAN_COUNT];
|
|
|
|
for (uint i=0; i<CHAN_COUNT; ++i)
|
|
thisFrames[i].reset (new TestFrame(0, i));
|
|
|
|
for (uint nr=1; nr<NUM_FRAMES; ++nr)
|
|
for (uint i=0; i<CHAN_COUNT; ++i)
|
|
{
|
|
thisFrames[i].swap (prevFrames[i]);
|
|
thisFrames[i].reset (new TestFrame(nr, i));
|
|
CHECK (thisFrames[i]->isSane());
|
|
CHECK (prevFrames[i]->isSane());
|
|
CHECK (prevFrames[i]->isAlive());
|
|
|
|
CHECK (*thisFrames[i] != *prevFrames[i]); // differs from predecessor within the same channel
|
|
|
|
for (uint j=0; j<i; ++j)
|
|
{
|
|
ENSURE (j!=i);
|
|
CHECK (*thisFrames[i] != *thisFrames[j]); // differs from frames in other channels at this point
|
|
CHECK (*thisFrames[i] != *prevFrames[j]); // differs cross wise from predecessors in other channels
|
|
} } }
|
|
|
|
|
|
/** @test the table of test frames
|
|
* computed on demand */
|
|
void
|
|
useFrameTable()
|
|
{
|
|
TestFrame& frX = testData(3,50);
|
|
TestFrame& frY = testData(3,25);
|
|
TestFrame& frZ = testData(3,50);
|
|
|
|
CHECK (frX.isSane());
|
|
CHECK (frY.isSane());
|
|
CHECK (frZ.isSane());
|
|
|
|
CHECK (frX != frY);
|
|
CHECK (frX == frZ);
|
|
CHECK (frY != frZ);
|
|
|
|
CHECK (isSameObject (frX, frZ));
|
|
|
|
corruptMemory(&frZ,40,20);
|
|
CHECK (!frX.isSane());
|
|
CHECK (!testData(3,50).isSane());
|
|
CHECK ( testData(3,51).isSane());
|
|
CHECK ( testData(3,49).isSane());
|
|
|
|
resetTestFrames();
|
|
|
|
CHECK ( testData(3,50).isSane());
|
|
}
|
|
};
|
|
|
|
|
|
/** Register this test class... */
|
|
LAUNCHER (TestFrame_test, "unit engine");
|
|
|
|
|
|
|
|
}}} // namespace steam::engine::test
|