/* SchedulerService(Test) - component integration test for the scheduler Copyright (C) Lumiera.org 2023, Hermann Vosseler 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 scheduler-usage-test.cpp ** unit test \ref SchedulerService_test */ #include "lib/test/run.hpp" #include "activity-detector.hpp" #include "vault/gear/scheduler.hpp" #include "lib/time/timevalue.hpp" #include "lib/format-cout.hpp" #include "lib/test/microbenchmark.hpp" #include "lib/test/diagnostic-output.hpp"///////////////TODO #include "lib/util.hpp" //#include #include using test::Test; //using std::move; //using util::isSameObject; namespace vault{ namespace gear { namespace test { // using lib::time::FrameRate; // using lib::time::Offset; using util::isnil; using lib::time::Time; using std::this_thread::sleep_for; namespace { ////////////////////////////////////////////////////////////////////TICKET #1055 want to construct lumiera Time from std::chrono literals Time t100us = Time{FSecs{1, 10'000}}; Time t200us = t100us + t100us; Time t500us = t200us + t200us + t100us; Time t1ms = Time{1,0}; } /*************************************************************************//** * @test Scheduler component integration test: add and process dependent jobs. * @see SchedulerActivity_test * @see SchedulerInvocation_test * @see SchedulerCommutator_test * @see SchedulerLoadControl_test */ class SchedulerService_test : public Test { virtual void run (Arg) { simpleUsage(); verify_StartStop(); invokeWorkFunction(); walkingDeadline(); } /** @test TODO demonstrate a simple usage scenario * @todo WIP 10/23 ✔ define ⟶ 🔁 implement */ void simpleUsage() { BlockFlowAlloc bFlow; EngineObserver watch; Scheduler scheduler{bFlow, watch}; } /** @test TODO get the scheduler into running state * @todo WIP 10/23 ✔ define ⟶ 🔁 implement */ void verify_StartStop() { BlockFlowAlloc bFlow; EngineObserver watch; Scheduler scheduler{bFlow, watch}; CHECK (isnil (scheduler)); scheduler.ignite(); CHECK (not isnil (scheduler)); scheduler.terminateProcessing(); CHECK (isnil (scheduler)); } /** @test verify visible behaviour of the [work-pulling function](\ref Scheduler::getWork) * - use a rigged Activity probe to capture the schedule time on invocation * - additionally perform a timing measurement for invoking the work-function * - invoking the Activity probe itself costs 50...150µs, Scheduler internals < 50µs * - this implies we can show timing-delay effects in the millisecond range * - demonstrated behaviour * + an Activity already due will be dispatched immediately by post() * + an Activity due at the point when invoking the work-function is dispatched * + while queue is empty, the work-function returns immediately, indicating sleep * + invoking the work-function when there is still some time span up to the next * planned Activity will enter a targeted sleep, returning shortly after the * next schedule. Entering then again will cause dispatch of that activity. * + if the work-function dispatches an Activity while the next entry is planned * for some time ahead, the work-function will likewise go into a targeted * sleep and only return at or shortly after that next planned time entry * + after dispatching an Activity in a situation with no follow-up work, * the work-function inserts a targeted sleep of random duration, * to re-shuffle the rhythm of sleep cycles * + when the next planned Activity has already be »tended for« (by placing * another worker into a targeted sleep), further workers entering the * work-function will be re-targeted by a random sleep to focus capacity * into a time zone behind the next entry. * @note Invoke the Activity probe itself can take 50..150µs, due to the EventLog, * which is not meant to be used in performance critical paths but only for tests, * because it performs lots of heap allocations and string operations. Moreover, * we see additional cache effects after an extended sleep period. * @todo WIP 10/23 🔁 define ⟶ implement */ void invokeWorkFunction() { BlockFlowAlloc bFlow; EngineObserver watch; Scheduler scheduler{bFlow, watch}; ActivityDetector detector; Activity& probe = detector.buildActivationProbe ("testProbe"); TimeVar start; int64_t delay_us; int64_t slip_us; activity::Proc res; auto post = [&](Time start) { // this test class is declared friend to get a backdoor to Scheduler internals... auto& schedCtx = Scheduler::ExecutionCtx::from(scheduler); scheduler.layer2_.acquireGoomingToken(); schedCtx.post (start, &probe, schedCtx); }; auto pullWork = [&] { uint REPETITIONS = 1; delay_us = lib::test::benchmarkTime([&]{ res = scheduler.getWork(); }, REPETITIONS); slip_us = _raw(detector.invokeTime(probe)) - _raw(start); cout << "res:"<= start and wasClose (invoked, start); }; cout << "Scheduled right away..."< up-front delay"< 500); // this proves that there was a delay to wait for the next schedule CHECK (delay_us < 1000); pullWork(); // if we now re-invoke the work-Function as instructed... CHECK (wasInvoked(start)); // then the next schedule is already slightly overdue and immediately invoked CHECK (scheduler.empty()); // the queue is empty and thus this thread will be sent to sleep CHECK (delay_us < 20200); // but beforehand the sleep-cycle is re-shuffled by a wait between 0 ... 20ms CHECK (slip_us < 300); CHECK (activity::PASS == res); // instruction to check back once pullWork(); CHECK (activity::WAIT == res); // but next call will send this thread to sleep right away CHECK (delay_us < 40); cout << "follow-up with some distance => follow-up delay"< 900); // yet this thread was afterwards kept in sleep to await the next task; CHECK (activity::PASS == res); // returns instruction to re-invoke immediately CHECK (not scheduler.empty()); // since there is still work in the queue start += t1ms; // (just re-adjust the reference point to calculate slip_us) pullWork(); // re-invoke immediately as instructed CHECK (wasInvoked(start)); // Result: also the next Activity has been dispatched CHECK (slip_us < 400); // not much slip CHECK (delay_us < 20200); // ...and the post-delay is used to re-shuffle the sleep cycle as usual CHECK (activity::PASS == res); // since queue is empty, we will call back once... CHECK (scheduler.empty()); pullWork(); CHECK (activity::WAIT == res); // and then go to sleep. cout << "already tended-next => re-target capacity"<