summaryrefslogtreecommitdiff
path: root/testsuites/validation/tc-sched-smp.c
blob: 32995422a62dca0efcc8dcbc0f2fbbebcdf9a36b (plain)
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
/* SPDX-License-Identifier: BSD-2-Clause */

/**
 * @file
 *
 * @ingroup RTEMSTestCaseScoreSchedSmpValSmp
 */

/*
 * 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.
 */

/*
 * This file is part of the RTEMS quality process and was automatically
 * generated.  If you find something that needs to be fixed or
 * worded better please post a report or patch to an RTEMS mailing list
 * or raise a bug report:
 *
 * https://www.rtems.org/bugs.html
 *
 * For information on updating and regenerating please refer to the How-To
 * section in the Software Requirements Engineering chapter of the
 * RTEMS Software Engineering manual.  The manual is provided as a part of
 * a release.  For development sources please refer to the online
 * documentation at:
 *
 * https://docs.rtems.org
 */

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

#include <rtems.h>
#include <rtems/test-scheduler.h>
#include <rtems/score/smpbarrier.h>

#include "tx-support.h"

#include <rtems/test.h>

/**
 * @defgroup RTEMSTestCaseScoreSchedSmpValSmp spec:/score/sched/smp/val/smp
 *
 * @ingroup RTEMSTestSuiteTestsuitesValidationSmpOnly0
 *
 * @brief Tests SMP-specific scheduler behaviour.
 *
 * This test case performs the following actions:
 *
 * - Create two worker threads and a mutex.  Use the mutex and the worker to
 *   construct the removal of the last processor of a scheduler while a thread
 *   is scheduled.
 *
 *   - Let worker B help worker A.
 *
 *   - Restart the worker B to withdraw the help offer and wait on barriers.
 *     Move worker B to scheduler A.  Remove the processor while worker A is
 *     scheduled.
 *
 *   - Clean up all used resources.
 *
 * @{
 */

/**
 * @brief Test context for spec:/score/sched/smp/val/smp test case.
 */
typedef struct {
  /**
   * @brief This member contains the runner identifier.
   */
  rtems_id runner_id;

  /**
   * @brief This member contains the worker A identifier.
   */
  rtems_id worker_a_id;

  /**
   * @brief This member contains the worker B identifier.
   */
  rtems_id worker_b_id;

  /**
   * @brief This member contains the mutex identifier.
   */
  rtems_id mutex_id;

  /**
   * @brief This member provides the context to wrap thread queue operations.
   */
  WrapThreadQueueContext wrap_tq_ctx;

  /**
   * @brief This member contains the call within ISR request.
   */
  CallWithinISRRequest request;;

  /**
   * @brief This member contains the barrier to synchronize the runner and the
   *   workers.
   */
  SMP_barrier_Control barrier;
} ScoreSchedSmpValSmp_Context;

static ScoreSchedSmpValSmp_Context
  ScoreSchedSmpValSmp_Instance;

typedef ScoreSchedSmpValSmp_Context Context;

typedef enum {
  EVENT_OBTAIN = RTEMS_EVENT_0,
  EVENT_RELEASE = RTEMS_EVENT_1,
  EVENT_SYNC_RUNNER = RTEMS_EVENT_2,
  EVENT_RESTART = RTEMS_EVENT_3
} Event;

static void Barriers( void *arg )
{
  Context          *ctx;
  SMP_barrier_State barrier_state;

  ctx = arg;
  _SMP_barrier_State_initialize( &barrier_state );

  /* A */
  _SMP_barrier_Wait( &ctx->barrier, &barrier_state, 2 );

  /* B */
  _SMP_barrier_Wait( &ctx->barrier, &barrier_state, 2 );
}

static void RequestISR( void *arg )
{
  Context *ctx;

  ctx = arg;
  ctx->request.handler = Barriers;
  ctx->request.arg = ctx;
  CallWithinISRSubmit( &ctx->request );
}

static void WorkerTask( rtems_task_argument arg )
{
  Context *ctx;

  ctx = (Context *) arg;

  while ( true ) {
    rtems_event_set events;

    events = ReceiveAnyEvents();

    if ( ( events & EVENT_SYNC_RUNNER ) != 0 ) {
      SendEvents( ctx->runner_id, EVENT_SYNC_RUNNER );
    }

    if ( ( events & EVENT_OBTAIN ) != 0 ) {
      ObtainMutex( ctx->mutex_id );
    }

    if ( ( events & EVENT_RELEASE ) != 0 ) {
      ReleaseMutex( ctx->mutex_id );
    }

    if ( ( events & EVENT_RESTART ) != 0 ) {
      rtems_status_code sc;

      T_eq_u32( rtems_scheduler_get_processor(), 0 );
      SetPriority( ctx->runner_id, PRIO_VERY_HIGH );
      T_eq_u32( rtems_scheduler_get_processor(), 1 );

      WrapThreadQueueExtract(
        &ctx->wrap_tq_ctx,
        GetThread( ctx->worker_b_id )
      );

      sc = rtems_task_restart( ctx->worker_b_id, (rtems_task_argument) ctx );
      T_rsc_success( sc );

      T_eq_u32( rtems_scheduler_get_processor(), 0 );
    }
  }
}

static void ScoreSchedSmpValSmp_Setup( ScoreSchedSmpValSmp_Context *ctx )
{
  SetSelfPriority( PRIO_NORMAL );
  WrapThreadQueueInitialize( &ctx->wrap_tq_ctx, RequestISR, ctx );
}

static void ScoreSchedSmpValSmp_Setup_Wrap( void *arg )
{
  ScoreSchedSmpValSmp_Context *ctx;

  ctx = arg;
  ScoreSchedSmpValSmp_Setup( ctx );
}

static void ScoreSchedSmpValSmp_Teardown( ScoreSchedSmpValSmp_Context *ctx )
{
  RestoreRunnerPriority();
  WrapThreadQueueDestroy( &ctx->wrap_tq_ctx );
}

static void ScoreSchedSmpValSmp_Teardown_Wrap( void *arg )
{
  ScoreSchedSmpValSmp_Context *ctx;

  ctx = arg;
  ScoreSchedSmpValSmp_Teardown( ctx );
}

static T_fixture ScoreSchedSmpValSmp_Fixture = {
  .setup = ScoreSchedSmpValSmp_Setup_Wrap,
  .stop = NULL,
  .teardown = ScoreSchedSmpValSmp_Teardown_Wrap,
  .scope = NULL,
  .initial_context = &ScoreSchedSmpValSmp_Instance
};

/**
 * @brief Create two worker threads and a mutex.  Use the mutex and the worker
 *   to construct the removal of the last processor of a scheduler while a
 *   thread is scheduled.
 */
static void ScoreSchedSmpValSmp_Action_0( ScoreSchedSmpValSmp_Context *ctx )
{
  SMP_barrier_State barrier_state;

  _SMP_barrier_Control_initialize( &ctx->barrier );
  _SMP_barrier_State_initialize( &barrier_state );

  ctx->runner_id = rtems_task_self();
  ctx->mutex_id = CreateMutex();

  ctx->worker_a_id = CreateTask( "WRKA", PRIO_HIGH );
  StartTask( ctx->worker_a_id, WorkerTask, ctx );

  ctx->worker_b_id = CreateTask( "WRKB", PRIO_NORMAL );
  SetScheduler( ctx->worker_b_id, SCHEDULER_B_ID, PRIO_NORMAL );
  StartTask( ctx->worker_b_id, WorkerTask, ctx );

  /*
   * Let worker B help worker A.
   */
  SendEvents( ctx->worker_a_id, EVENT_OBTAIN );
  SendEvents( ctx->worker_b_id, EVENT_SYNC_RUNNER | EVENT_OBTAIN );
  ReceiveAllEvents( EVENT_SYNC_RUNNER );
  WaitForExecutionStop( ctx->worker_b_id );

  /*
   * Restart the worker B to withdraw the help offer and wait on barriers. Move
   * worker B to scheduler A.  Remove the processor while worker A is
   * scheduled.
   */
  SendEvents( ctx->worker_a_id, EVENT_RESTART );

  /* A */
  _SMP_barrier_Wait( &ctx->barrier, &barrier_state, 2 );

  SetScheduler( ctx->worker_b_id, SCHEDULER_A_ID, PRIO_HIGH );
  RemoveProcessor( SCHEDULER_B_ID, 1 );

  /* B */
  _SMP_barrier_Wait( &ctx->barrier, &barrier_state, 2 );

  /*
   * Clean up all used resources.
   */
  SetPriority( ctx->runner_id, PRIO_NORMAL );
  AddProcessor( SCHEDULER_B_ID, 1 );
  SendEvents( ctx->worker_a_id, EVENT_RELEASE );
  DeleteTask( ctx->worker_a_id );
  DeleteTask( ctx->worker_b_id );
  DeleteMutex( ctx->mutex_id );
}

/**
 * @fn void T_case_body_ScoreSchedSmpValSmp( void )
 */
T_TEST_CASE_FIXTURE( ScoreSchedSmpValSmp, &ScoreSchedSmpValSmp_Fixture )
{
  ScoreSchedSmpValSmp_Context *ctx;

  ctx = T_fixture_context();

  ScoreSchedSmpValSmp_Action_0( ctx );
}

/** @} */