LUMIERA.clone/tests/library/advice/advice-multiplicity-test.cpp
Ichthyostega 806db414dd Copyright: clarify and simplify the file headers
* Lumiera source code always was copyrighted by individual contributors
 * there is no entity "Lumiera.org" which holds any copyrights
 * Lumiera source code is provided under the GPL Version 2+

== Explanations ==
Lumiera as a whole is distributed under Copyleft, GNU General Public License Version 2 or above.
For this to become legally effective, the ''File COPYING in the root directory is sufficient.''

The licensing header in each file is not strictly necessary, yet considered good practice;
attaching a licence notice increases the likeliness that this information is retained
in case someone extracts individual code files. However, it is not by the presence of some
text, that legally binding licensing terms become effective; rather the fact matters that a
given piece of code was provably copyrighted and published under a license. Even reformatting
the code, renaming some variables or deleting parts of the code will not alter this legal
situation, but rather creates a derivative work, which is likewise covered by the GPL!

The most relevant information in the file header is the notice regarding the
time of the first individual copyright claim. By virtue of this initial copyright,
the first author is entitled to choose the terms of licensing. All further
modifications are permitted and covered by the License. The specific wording
or format of the copyright header is not legally relevant, as long as the
intention to publish under the GPL remains clear. The extended wording was
based on a recommendation by the FSF. It can be shortened, because the full terms
of the license are provided alongside the distribution, in the file COPYING.
2024-11-17 23:42:55 +01:00

126 lines
4.4 KiB
C++
Raw Permalink Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/*
AdviceMultiplicity(Test) - verify correctness when dispatching multiple Advices concurrently
Copyright (C)
2010, Hermann Vosseler <Ichthyostega@web.de>
  **Lumiera** 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. See the file COPYING for further details.
* *****************************************************************/
/** @file advice-multiplicity-test.cpp
** unit test \ref AdviceMultiplicity_test
*/
#include "lib/test/run.hpp"
//#include "lib/test/test-helper.hpp"
//#include "lib/p.hpp"
//#include "steam/assetmanager.hpp"
//#include "steam/asset/inventory.hpp"
//#include "steam/mobject/session/clip.hpp"
//#include "steam/mobject/session/fork.hpp"
//#include "lib/meta/trait-special.hpp"
//#include "lib/util-foreach.hpp"
//#include "lib/symbol.hpp"
#include "common/advice.hpp"
//#include <string>
//using lib::test::showSizeof;
//using lib::test::randStr;
//using util::isSameObject;
//using util::and_all;
//using util::for_each;
//using util::isnil;
//using lib::Literal;
//using lib::Symbol;
//using lib::P;
//using std::string;
namespace lumiera {
namespace advice {
namespace test {
namespace {
}
/***************************************************************************//**
* @test stress test for the Advice system:
* Concurrently add a multitude of advice provisions and check correct
* matching and dispatch of all advice.
*
* @todo advanced topic, deferred for now (4/10) ////////////////////TICKET #610
*
* @see advice.hpp
* @see AdviceBasics_test
*/
class AdviceMultiplicity_test : public Test
{
virtual void
run (Arg)
{
check_highLoadSimpleMatch();
check_multipleMatch();
check_unlockedDispatch();
}
/** @test run simple pairs of collaborators in multiple threads.
* Intentionally, there should be just a single match per pair,
* but the timings of provision and pickup are chosen randomly
*/
void
check_highLoadSimpleMatch()
{
#if false /////////////////////////////////////////////////////////////////////////////////////////////////////////////UNIMPLEMENTED :: TICKET #610
#endif /////////////////////////////////////////////////////////////////////////////////////////////////////////////UNIMPLEMENTED :: TICKET #610
}
/** @test here, one advice might reach multiple advised entities and
* one entity may receive multiple pieces of advice, overwriting
* previous advice provisions. The receiving clients (advised entities)
* are polling irregularly, but finally should each pick up the correct
* value. To check this, advice values are generated with a specific
* pattern, which can be check summed */
void
check_multipleMatch()
{
#if false /////////////////////////////////////////////////////////////////////////////////////////////////////////////UNIMPLEMENTED :: TICKET #610
#endif /////////////////////////////////////////////////////////////////////////////////////////////////////////////UNIMPLEMENTED :: TICKET #610
}
/** @test when dispatching Advice, some of the locking can be left out.
* Obviously this means we can't be sure anymore the client will
* see the newly dispatched piece of advice. But the main focus
* of this test is to ensure the advice system itself is working
* properly even without complete locking.
* To verify the results, each thread performs a kind of "flush"
* (actually creates a memory barrier) before picking up the
* final value */
void
check_unlockedDispatch()
{
#if false /////////////////////////////////////////////////////////////////////////////////////////////////////////////UNIMPLEMENTED :: TICKET #610
#endif /////////////////////////////////////////////////////////////////////////////////////////////////////////////UNIMPLEMENTED :: TICKET #610
}
};
/** Register this test class... */
LAUNCHER (AdviceMultiplicity_test, "function common");
}}} // namespace lumiera::advice::test