summaryrefslogtreecommitdiffstats
path: root/cpukit/libtest/t-test-scheduler.c
blob: 3f4a59c6741048bb09f6ff2fedd8ae75184b1eb1 (plain) (blame)
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
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
/* SPDX-License-Identifier: BSD-2-Clause */

/**
 * @file
 *
 * @ingroup RTEMSTestFrameworkImpl
 *
 * @brief This source file contains the implementation of the scheduler test
 *   support API.
 */

/*
 * Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de)
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <rtems/test-scheduler.h>

#include <rtems.h>
#include <rtems/score/percpu.h>
#include <rtems/score/schedulerimpl.h>

typedef struct {
	RTEMS_INTERRUPT_LOCK_MEMBER(lock)
	T_scheduler_log *active;
	T_scheduler_event_handler handler;
	void *arg;
} T_scheduler_context;

static T_scheduler_context T_scheduler_instance = {
#ifdef RTEMS_SMP
	.lock = RTEMS_INTERRUPT_LOCK_INITIALIZER("Test Scheduler"),
#endif
	.active = NULL
};

void
T_scheduler_set_event_handler(T_scheduler_event_handler handler, void *arg)
{
	T_scheduler_context *ctx;
	rtems_interrupt_lock_context lock_context;

	ctx = &T_scheduler_instance;

	rtems_interrupt_lock_acquire(&ctx->lock, &lock_context);
	ctx->handler = handler;
	ctx->arg = arg;
	rtems_interrupt_lock_release(&ctx->lock, &lock_context);
}

static void
T_scheduler_before_operation(T_scheduler_event *event)
{
	T_scheduler_context *ctx;
	rtems_interrupt_lock_context lock_context;
	T_scheduler_log *log;
	T_scheduler_event_handler handler;
	void *arg;
	Per_CPU_Control *cpu_self;

	ctx = &T_scheduler_instance;
	log = ctx->active;
	handler = ctx->handler;

	if (log == NULL && handler == NULL) {
		return;
	}

	rtems_interrupt_lock_interrupt_disable(&lock_context);
	cpu_self = _Per_CPU_Get();
	event->cpu = _Per_CPU_Get_index( cpu_self );

	if (_Per_CPU_Is_ISR_in_progress(cpu_self)) {
		event->executing = NULL;
	} else {
		event->executing = _Per_CPU_Get_executing(cpu_self);
	}

	event->instant = T_now();

	rtems_interrupt_lock_acquire_isr(&ctx->lock, &lock_context);
	handler = ctx->handler;
	arg = ctx->arg;
	rtems_interrupt_lock_release(&ctx->lock, &lock_context);

	if (handler != NULL) {
		(*handler)(arg, event, T_SCHEDULER_BEFORE);
	}
}

static void
T_scheduler_record_event(T_scheduler_event *event)
{
	T_scheduler_context *ctx;
	rtems_interrupt_lock_context lock_context;
	T_scheduler_log *log;
	T_scheduler_event_handler handler;

	ctx = &T_scheduler_instance;
	log = ctx->active;
	handler = ctx->handler;

	if (log == NULL && handler == NULL) {
		return;
	}

	rtems_interrupt_lock_acquire(&ctx->lock, &lock_context);

#ifdef RTEMS_SMP
	handler = ctx->handler;
#endif

	if (handler != NULL) {
		void *arg;

		arg = ctx->arg;

		rtems_interrupt_lock_release(&ctx->lock, &lock_context);
		(*handler)(arg, event, T_SCHEDULER_AFTER);
		rtems_interrupt_lock_acquire(&ctx->lock, &lock_context);
	}

#ifdef RTEMS_SMP
	log = ctx->active;
#endif

	if (log != NULL) {
		size_t recorded;

		++log->header.operations;
		recorded = log->header.recorded;

		if (recorded < log->header.capacity) {
			log->header.recorded = recorded + 1;
			log->events[recorded] = *event;
		}
	}

	rtems_interrupt_lock_release(&ctx->lock, &lock_context);
}

T_scheduler_log *
T_scheduler_record(T_scheduler_log *log)
{
	rtems_interrupt_lock_context lock_context;
	T_scheduler_log *previous;
	T_scheduler_context *ctx;

	if (log != NULL) {
		log->header.recorded = 0;
		log->header.operations = 0;
	}

	ctx = &T_scheduler_instance;

	rtems_interrupt_lock_acquire(&ctx->lock, &lock_context);
	previous = ctx->active;
	ctx->active = log;
	rtems_interrupt_lock_release(&ctx->lock, &lock_context);

	return previous;
}

T_scheduler_log *
T_scheduler_record_2(T_scheduler_log_2 *log)
{
	log->header.capacity = T_ARRAY_SIZE(log->events);
	return T_scheduler_record((T_scheduler_log *)log);
}

T_scheduler_log *
T_scheduler_record_4(T_scheduler_log_4 *log)
{
	log->header.capacity = T_ARRAY_SIZE(log->events);
	return T_scheduler_record((T_scheduler_log *)log);
}

T_scheduler_log *
T_scheduler_record_10(T_scheduler_log_10 *log)
{
	log->header.capacity = T_ARRAY_SIZE(log->events);
	return T_scheduler_record((T_scheduler_log *)log);
}

T_scheduler_log *
T_scheduler_record_20(T_scheduler_log_20 *log)
{
	log->header.capacity = T_ARRAY_SIZE(log->events);
	return T_scheduler_record((T_scheduler_log *)log);
}

T_scheduler_log *
T_scheduler_record_40(T_scheduler_log_40 *log)
{
	log->header.capacity = T_ARRAY_SIZE(log->events);
	return T_scheduler_record((T_scheduler_log *)log);
}

const T_scheduler_event T_scheduler_event_null;

const T_scheduler_event *
T_scheduler_next(T_scheduler_header *header, T_scheduler_operation operation,
    size_t *index)
{
	T_scheduler_log *log;
	size_t i;

	log = (T_scheduler_log *)header;

	if (log == NULL) {
		return &T_scheduler_event_null;
	}

	i = *index;

	while (i < log->header.recorded) {
		if (operation == T_SCHEDULER_ANY ||
		    operation == log->events[i].operation) {
			*index = i + 1;
			return &log->events[i];
		}

		++i;
	}

	return &T_scheduler_event_null;
}

const T_scheduler_event *
T_scheduler_next_any(T_scheduler_header *header, size_t *index)
{
	return T_scheduler_next(header, T_SCHEDULER_ANY, index);
}

void
T_scheduler_initialize(const Scheduler_Control *scheduler)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_INITIALIZE
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->initialize)(scheduler);
	T_scheduler_record_event(&event);
}

void
T_scheduler_schedule(const Scheduler_Control *scheduler,
   Thread_Control *thread)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_SCHEDULE,
		.thread = thread
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->schedule)(scheduler, thread);
	T_scheduler_record_event(&event);
}

void
T_scheduler_yield(const Scheduler_Control *scheduler, Thread_Control *thread,
    Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_YIELD,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->yield)(scheduler, thread, node);
	T_scheduler_record_event(&event);
}

void
T_scheduler_block(const Scheduler_Control *scheduler, Thread_Control *thread,
    Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_BLOCK,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->block)(scheduler, thread, node);
	T_scheduler_record_event(&event);
}

void
T_scheduler_unblock(const Scheduler_Control *scheduler, Thread_Control *thread,
    Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_UNBLOCK,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->unblock)(scheduler, thread, node);
	T_scheduler_record_event(&event);
}

void
T_scheduler_update_priority(const Scheduler_Control *scheduler,
    Thread_Control *thread, Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_UPDATE_PRIORITY,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->update_priority)(scheduler, thread, node);
	T_scheduler_record_event(&event);
}

Priority_Control T_scheduler_map_priority(const Scheduler_Control *scheduler,
    Priority_Control priority)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_MAP_PRIORITY
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.map_unmap_priority.in = priority;
	T_scheduler_before_operation(&event);
	event.map_unmap_priority.out = (*operations->map_priority)(scheduler,
	    priority);
	T_scheduler_record_event(&event);
	return event.map_unmap_priority.out;
}

Priority_Control T_scheduler_unmap_priority(const Scheduler_Control *scheduler,
    Priority_Control priority)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_UNMAP_PRIORITY
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.map_unmap_priority.in = priority;
	T_scheduler_before_operation(&event);
	event.map_unmap_priority.out = (*operations->unmap_priority)(scheduler,
	    priority);
	T_scheduler_record_event(&event);
	return event.map_unmap_priority.out;
}

void
T_scheduler_node_initialize(const Scheduler_Control *scheduler,
    Scheduler_Node *node, Thread_Control *thread, Priority_Control priority)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_NODE_INITIALIZE,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->node_initialize)(scheduler, node, thread, priority);
	T_scheduler_record_event(&event);
}

void
T_scheduler_node_destroy(const Scheduler_Control *scheduler,
    Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_NODE_DESTROY,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->node_destroy)(scheduler, node);
	T_scheduler_record_event(&event);
}

void
T_scheduler_release_job(const Scheduler_Control *scheduler,
    Thread_Control *thread, Priority_Node *priority, uint64_t deadline,
    Thread_queue_Context *queue_context)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_RELEASE_JOB,
		.thread = thread
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.release_job.priority = priority;
	event.release_job.deadline = deadline;
	T_scheduler_before_operation(&event);
	(*operations->release_job)(scheduler, thread, priority, deadline, queue_context);
	T_scheduler_record_event(&event);
}

void
T_scheduler_cancel_job(const Scheduler_Control *scheduler,
    Thread_Control *thread, Priority_Node *priority,
    Thread_queue_Context *queue_context)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_CANCEL_JOB,
		.thread = thread
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.cancel_job.priority = priority;
	T_scheduler_before_operation(&event);
	(*operations->cancel_job)(scheduler, thread, priority, queue_context);
	T_scheduler_record_event(&event);
}

void
T_scheduler_start_idle(const Scheduler_Control *scheduler,
    Thread_Control *thread, Per_CPU_Control *cpu)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_START_IDLE,
		.thread = thread
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->start_idle)(scheduler, thread, cpu);
	T_scheduler_record_event(&event);
}

#ifdef RTEMS_SMP
bool
T_scheduler_ask_for_help(const Scheduler_Control *scheduler,
    Thread_Control *thread, Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_ASK_FOR_HELP,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	event.ask_for_help.success = (*operations->ask_for_help)(scheduler,
	    thread, node);
	T_scheduler_record_event(&event);
	return event.ask_for_help.success;
}

void
T_scheduler_reconsider_help_request(const Scheduler_Control *scheduler,
    Thread_Control *thread, Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_RECONSIDER_HELP_REQUEST,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->reconsider_help_request)(scheduler, thread, node);
	T_scheduler_record_event(&event);
}

void
T_scheduler_withdraw_node(const Scheduler_Control *scheduler,
    Thread_Control *thread, Scheduler_Node *node,
    Thread_Scheduler_state next_state)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_WITHDRAW_NODE,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.withdraw_node.next_state = next_state;
	T_scheduler_before_operation(&event);
	(*operations->withdraw_node)(scheduler, thread, node, next_state);
	T_scheduler_record_event(&event);
}

void
T_scheduler_make_sticky(const Scheduler_Control *scheduler, Thread_Control *thread,
    Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_MAKE_STICKY,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->make_sticky)(scheduler, thread, node);
	T_scheduler_record_event(&event);
}

void
T_scheduler_clean_sticky(const Scheduler_Control *scheduler, Thread_Control *thread,
    Scheduler_Node *node)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_CLEAN_STICKY,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	T_scheduler_before_operation(&event);
	(*operations->clean_sticky)(scheduler, thread, node);
	T_scheduler_record_event(&event);
}

void
T_scheduler_pin(const Scheduler_Control *scheduler, Thread_Control *thread,
    Scheduler_Node *node, Per_CPU_Control *cpu)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_PIN,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.pin_unpin.cpu = cpu;
	T_scheduler_before_operation(&event);
	(*operations->pin)(scheduler, thread, node, cpu);
	T_scheduler_record_event(&event);
}

void
T_scheduler_unpin(const Scheduler_Control *scheduler, Thread_Control *thread,
    Scheduler_Node *node, Per_CPU_Control *cpu)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_UNPIN,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.pin_unpin.cpu = cpu;
	T_scheduler_before_operation(&event);
	(*operations->unpin)(scheduler, thread, node, cpu);
	T_scheduler_record_event(&event);
}

void
T_scheduler_add_processor(const Scheduler_Control *scheduler,
    Thread_Control *idle)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_ADD_PROCESSOR,
		.thread = idle
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.add_processor.idle = idle;
	T_scheduler_before_operation(&event);
	(*operations->add_processor)(scheduler, idle);
	T_scheduler_record_event(&event);
}

Thread_Control *
T_scheduler_remove_processor(const Scheduler_Control *scheduler,
    Per_CPU_Control *cpu)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_REMOVE_PROCESSOR
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.remove_processor.cpu = cpu;
	T_scheduler_before_operation(&event);
	event.remove_processor.idle =
	    (*operations->remove_processor)(scheduler, cpu);
	T_scheduler_record_event(&event);
	return event.remove_processor.idle;
}

Status_Control
T_scheduler_set_affinity(const Scheduler_Control *scheduler,
    Thread_Control *thread, Scheduler_Node *node,
    const Processor_mask *affinity)
{
	T_scheduler_event event = {
		.operation = T_SCHEDULER_SET_AFFINITY,
		.thread = thread,
		.node = node
	};
	const Scheduler_Operations *operations;

	operations = &T_scheduler_operations[_Scheduler_Get_index(scheduler)];
	event.set_affinity.affinity = *affinity;
	T_scheduler_before_operation(&event);
	event.set_affinity.status = (*operations->set_affinity)(scheduler,
	    thread, node, affinity);
	T_scheduler_record_event(&event);
	return event.set_affinity.status;
}
#endif