1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425
|
/*
* SPDX-License-Identifier: GPL-2.0-only
*
* SPDX-FileCopyrightText: 2025 Jérémie Galarneau <jeremie.galarneau@efficios.com>
*/
#include <common/make-unique.hpp>
#include <common/scheduler.hpp>
#include <common/task-executor.hpp>
#include <algorithm>
#include <array>
#include <memory>
#include <random>
#include <tap/tap.h>
#include <vector>
/* For error.hpp */
int lttng_opt_quiet;
int lttng_opt_verbose;
int lttng_opt_mi;
namespace {
lttng::scheduling::absolute_time ns_to_time_point(std::uint64_t ns)
{
return lttng::scheduling::absolute_time(std::chrono::nanoseconds(ns));
}
namespace once_scheduling {
class task_once : public lttng::scheduling::task {
public:
explicit task_once(bool& value_to_set) : _task_was_scheduled{ value_to_set }
{
}
void _run([[maybe_unused]] lttng::scheduling::absolute_time current_time) noexcept override
{
/* Indicate that task executed. */
_task_was_scheduled = true;
}
private:
bool& _task_was_scheduled;
};
void test_task_not_ran_immediately()
{
lttng::scheduling::scheduler scheduler;
bool task_ran = false;
scheduler.tick(ns_to_time_point(1));
auto my_task = std::make_shared<task_once>(task_ran);
/*
* The task is scheduled to run on the next tick (ideally started right after this tick
* completes).
*/
scheduler.schedule(my_task, ns_to_time_point(1));
ok(task_ran == false, "Task scheduled \"now\" didn't run during scheduling");
/* Next tick occurs "immediately". */
scheduler.tick(ns_to_time_point(1));
ok(task_ran == true, "Task scheduled \"now\" ran at the next tick");
}
void test_task_not_ran_directly_when_scheduling()
{
lttng::scheduling::scheduler scheduler;
bool task_ran = false;
scheduler.tick(ns_to_time_point(1));
auto my_task = std::make_shared<task_once>(task_ran);
/* The task should only run in 100ns, so for tick >= 101. */
scheduler.schedule(my_task, ns_to_time_point(1) + lttng::scheduling::duration_ns(100));
ok(task_ran == false, "Task scheduled @ 101 not ran right after scheduling");
}
void test_task_not_ran_before_deadline()
{
lttng::scheduling::scheduler scheduler;
bool task_ran = false;
scheduler.tick(ns_to_time_point(1));
auto my_task = std::make_shared<task_once>(task_ran);
/* The task should only run in 100ns, so for ticks >= 101. */
scheduler.schedule(my_task, ns_to_time_point(1) + lttng::scheduling::duration_ns(100));
scheduler.tick(ns_to_time_point(10));
ok(task_ran == false, "Task scheduled @ 101 not ran after tick @ 10");
}
void test_task_ran_on_deadline()
{
lttng::scheduling::scheduler scheduler;
bool task_ran = false;
scheduler.tick(ns_to_time_point(1));
auto my_task = std::make_shared<task_once>(task_ran);
/* The task should only run in 100ns, so for ticks >= 101. */
scheduler.schedule(my_task, ns_to_time_point(1) + lttng::scheduling::duration_ns(100));
const auto tick_ret = scheduler.tick(ns_to_time_point(101));
ok(task_ran == true, "Task scheduled @ 101 ran after tick @ 101");
ok(!tick_ret.has_value(), "Tick @ 101 returned no time until next task");
}
void test_task_ran_on_late_tick()
{
lttng::scheduling::scheduler scheduler;
bool task_ran = false;
scheduler.tick(ns_to_time_point(1));
auto my_task = std::make_shared<task_once>(task_ran);
/* The task should only run in 100ns, so for ticks >= 101. */
scheduler.schedule(my_task, ns_to_time_point(1) + lttng::scheduling::duration_ns(100));
scheduler.tick(ns_to_time_point(200));
ok(task_ran == true, "Task scheduled @ 101 ran after tick @ 200");
}
void test_task_not_ran_twice()
{
lttng::scheduling::scheduler scheduler;
bool task_ran = false;
scheduler.tick(ns_to_time_point(1));
auto my_task = std::make_shared<task_once>(task_ran);
/* The task should only run in 100ns, so for ticks >= 101. */
scheduler.schedule(my_task, ns_to_time_point(1) + lttng::scheduling::duration_ns(100));
scheduler.tick(ns_to_time_point(200));
ok(task_ran, "Task scheduled @ 100 ran after tick @ 200");
/*
* Reset "ran" state to validate that a task that was scheduled to run only once
* is not ran twice.
*/
task_ran = false;
scheduler.tick(ns_to_time_point(500));
ok(task_ran == false, "Task scheduled @ 101, and already ran, does not run twice");
}
void test_tasks_all_ran_after_deadline()
{
lttng::scheduling::scheduler scheduler;
bool task_50_ran = false, task_100_ran = false, task_150_ran = false;
auto task_50 = std::make_shared<task_once>(task_50_ran);
auto task_100 = std::make_shared<task_once>(task_100_ran);
auto task_150 = std::make_shared<task_once>(task_150_ran);
scheduler.schedule(task_150, ns_to_time_point(150));
scheduler.schedule(task_50, ns_to_time_point(50));
scheduler.schedule(task_100, ns_to_time_point(100));
scheduler.tick(ns_to_time_point(200));
ok(task_50_ran == true, "Task scheduled @ 50 ran after tick @ 200");
ok(task_100_ran == true, "Task scheduled @ 100 ran after tick @ 200");
ok(task_150_ran == true, "Task scheduled @ 150 ran after tick @ 200");
}
void test_tasks_some_ran_after_tick()
{
lttng::scheduling::scheduler scheduler;
bool task_50_ran = false, task_100_ran = false, task_150_ran = false;
auto task_50 = std::make_shared<task_once>(task_50_ran);
auto task_100 = std::make_shared<task_once>(task_100_ran);
auto task_150 = std::make_shared<task_once>(task_150_ran);
scheduler.schedule(task_150, ns_to_time_point(150));
scheduler.schedule(task_50, ns_to_time_point(50));
scheduler.schedule(task_100, ns_to_time_point(100));
scheduler.tick(ns_to_time_point(120));
ok(task_50_ran == true, "Task scheduled @ 50 ran after tick @ 120");
ok(task_100_ran == true, "Task scheduled @ 100 ran after tick @ 120");
ok(task_150_ran == false, "Task scheduled @ 150 didn't run after tick @ 120");
}
void test_lots_of_tasks_ran_in_order()
{
lttng::scheduling::scheduler scheduler;
std::array<bool, 16> tasks_ran = { false };
std::vector<std::pair<task_once::sptr, lttng::scheduling::absolute_time>> tasks;
/* Create tasks to be scheduled at ticks 5, 15, 25, 35, etc. */
for (unsigned int i = 0; i < tasks_ran.size(); i++) {
tasks.emplace_back(std::make_shared<task_once>(tasks_ran[i]),
ns_to_time_point((i * 10) + 5));
}
/*
* Shuffle tasks to insert them in a random order in the scheduler's set of tasks.
* The tasks_ran array remains in order of scheduled tasks to validate the order
* of the execution of the tasks.
*/
std::shuffle(std::begin(tasks), std::end(tasks), std::default_random_engine{});
for (const auto& task_pair : tasks) {
scheduler.schedule(task_pair.first, task_pair.second);
}
for (unsigned int i = 0; i < tasks_ran.size() + 1; i++) {
const auto current_tick = i * 10;
scheduler.tick(ns_to_time_point(current_tick));
unsigned int consecutive_tasks_executed = 0;
for (const auto& ran : tasks_ran) {
if (ran) {
consecutive_tasks_executed++;
} else {
break;
}
}
ok(i == consecutive_tasks_executed,
"%u first tasks executed as of tick %u",
i,
current_tick);
}
}
} /* namespace once_scheduling */
namespace periodic_scheduling {
class periodic_task : public lttng::scheduling::periodic_task {
public:
periodic_task(lttng::scheduling::duration_ns period_ns, unsigned int& value_to_increment) :
lttng::scheduling::periodic_task(period_ns),
_value_to_increment{ value_to_increment }
{
}
void _run([[maybe_unused]] lttng::scheduling::absolute_time current_time) noexcept override
{
/* Indicate that task ran. */
_value_to_increment++;
}
private:
unsigned int& _value_to_increment;
};
class periodic_task_die_after_3 : public lttng::scheduling::periodic_task {
public:
periodic_task_die_after_3(lttng::scheduling::duration_ns period_ns,
unsigned int& value_to_increment) :
lttng::scheduling::periodic_task(period_ns),
_value_to_increment{ value_to_increment }
{
}
void _run([[maybe_unused]] lttng::scheduling::absolute_time current_time) noexcept override
{
/* Indicate that task ran. */
_value_to_increment++;
if (_value_to_increment == 3) {
/* This task should no longer run. */
_cancel_no_lock();
}
}
private:
unsigned int& _value_to_increment;
};
void test_task_not_ran_before_deadline()
{
lttng::scheduling::scheduler scheduler;
unsigned int task_run_count = 0;
/* Run every 100 ns. */
auto my_task = std::make_shared<periodic_task>(lttng::scheduling::duration_ns(100),
task_run_count);
/* The task should run every 100 ns, starting in 100 ns. */
scheduler.schedule(my_task, ns_to_time_point(0) + my_task->period());
scheduler.tick(ns_to_time_point(50));
ok(task_run_count == 0, "Periodic task scheduled @ 100 not run with tick @ 50");
}
void test_task_ran_on_deadline()
{
lttng::scheduling::scheduler scheduler;
unsigned int task_run_count = 0;
/* Run every 100 ns. */
auto my_task = std::make_shared<periodic_task>(lttng::scheduling::duration_ns(100),
task_run_count);
/* The task should run every 100 ns, starting in 100 ns. */
scheduler.schedule(my_task, ns_to_time_point(0) + my_task->period());
scheduler.tick(ns_to_time_point(100));
ok(task_run_count == 1, "Periodic task scheduled @ 100 ran during tick @ 100");
}
void test_task_second_run_not_before_deadline()
{
lttng::scheduling::scheduler scheduler;
unsigned int task_run_count = 0;
/* Run every 100 ns. */
auto my_task = std::make_shared<periodic_task>(lttng::scheduling::duration_ns(100),
task_run_count);
/* The task should run every 100 ns, starting in 100 ns. */
scheduler.schedule(my_task, ns_to_time_point(0) + my_task->period());
scheduler.tick(ns_to_time_point(120));
ok(task_run_count == 1, "Periodic task scheduled @ 100 ran during tick @ 120");
scheduler.tick(ns_to_time_point(150));
ok(task_run_count == 1, "Periodic task scheduled @ 200 didn't run twice with tick @ 150");
}
void test_task_rescheduled()
{
lttng::scheduling::scheduler scheduler;
unsigned int task_run_count = 0;
/* Run every 100 ns. */
auto my_task = std::make_shared<periodic_task>(lttng::scheduling::duration_ns(100),
task_run_count);
/* The task should run every 100 ns, starting in 100 ns. */
scheduler.schedule(my_task, ns_to_time_point(0) + my_task->period());
const auto tick_ret = scheduler.tick(ns_to_time_point(100));
ok(task_run_count == 1, "Periodic task scheduled @ 100 ran during tick @ 100");
ok(tick_ret.has_value() && tick_ret == lttng::scheduling::duration_ns(100),
"Tick @ 100 returned time until next task");
scheduler.tick(ns_to_time_point(200));
ok(task_run_count == 2, "Periodic task scheduled @ 200 ran during tick @ 200");
scheduler.tick(ns_to_time_point(300));
ok(task_run_count == 3, "Periodic task scheduled @ 300 ran during tick @ 300");
}
void test_task_die()
{
lttng::scheduling::scheduler scheduler;
unsigned int task_run_count = 0;
/* Run every 100 ns. */
auto my_task = std::make_shared<periodic_task_die_after_3>(
lttng::scheduling::duration_ns(100), task_run_count);
/* The task should run every 100 ns, starting in 100 ns. */
scheduler.schedule(my_task, ns_to_time_point(0) + my_task->period());
scheduler.tick(ns_to_time_point(100));
ok(task_run_count == 1, "Periodic task scheduled @ 100 ran during tick @ 100");
scheduler.tick(ns_to_time_point(200));
ok(task_run_count == 2, "Periodic task scheduled @ 200 ran during tick @ 200");
scheduler.tick(ns_to_time_point(300));
ok(task_run_count == 3, "Periodic task scheduled @ 300 ran during tick @ 300");
scheduler.tick(ns_to_time_point(400));
ok(task_run_count == 3,
"Periodic task scheduled to run only three times only ran three times");
}
} /* namespace periodic_scheduling */
namespace task_execution {
void test_stop()
{
lttng::scheduling::scheduler scheduler;
lttng::scheduling::task_executor executor(scheduler);
executor.stop();
ok(true, "Scheduler stopped");
}
void test_task_die()
{
lttng::scheduling::scheduler scheduler;
lttng::scheduling::task_executor executor(scheduler);
unsigned int task_run_count = 0;
auto my_task = std::make_shared<periodic_scheduling::periodic_task_die_after_3>(
lttng::scheduling::duration_ns(std::chrono::milliseconds(100)), task_run_count);
scheduler.schedule(my_task, std::chrono::steady_clock::now() + my_task->period());
while (!my_task->canceled()) {
std::this_thread::sleep_for(std::chrono::milliseconds(10));
}
ok(task_run_count == 3,
"Periodic task scheduled to run only three times only ran three times by task executor");
}
} /* namespace task_execution */
} /* namespace */
int main([[maybe_unused]] int argc, [[maybe_unused]] char **argv)
{
plan_tests(46);
once_scheduling::test_task_not_ran_immediately();
once_scheduling::test_task_not_ran_before_deadline();
once_scheduling::test_task_not_ran_directly_when_scheduling();
once_scheduling::test_task_not_ran_twice();
once_scheduling::test_task_ran_on_deadline();
once_scheduling::test_task_ran_on_late_tick();
once_scheduling::test_tasks_all_ran_after_deadline();
once_scheduling::test_tasks_some_ran_after_tick();
once_scheduling::test_lots_of_tasks_ran_in_order();
periodic_scheduling::test_task_second_run_not_before_deadline();
periodic_scheduling::test_task_not_ran_before_deadline();
periodic_scheduling::test_task_ran_on_deadline();
periodic_scheduling::test_task_rescheduled();
periodic_scheduling::test_task_die();
task_execution::test_stop();
task_execution::test_task_die();
return exit_status();
}
|