source: rtems/testsuites/smptests/smpload01/init.c @ 9486566

4.115
Last change on this file since 9486566 was 9486566, checked in by Sebastian Huber <sebastian.huber@…>, on 03/21/14 at 08:53:15

smptests/smpload01: Improve test

Add a task producing memory traffic. Add tasks to obtain a priority
inheritance semaphore in a synchronized way.

  • Property mode set to 100644
File size: 9.9 KB
Line 
1/*
2 * Copyright (c) 2014 embedded brains GmbH.  All rights reserved.
3 *
4 *  embedded brains GmbH
5 *  Dornierstr. 4
6 *  82178 Puchheim
7 *  Germany
8 *  <rtems@embedded-brains.de>
9 *
10 * The license and distribution terms for this file may be
11 * found in the file LICENSE in this distribution or at
12 * http://www.rtems.org/license/LICENSE.
13 */
14
15#ifdef HAVE_CONFIG_H
16  #include "config.h"
17#endif
18
19#include "tmacros.h"
20
21#include <stdlib.h>
22#include <stdio.h>
23#include <inttypes.h>
24
25#include <rtems.h>
26#include <rtems/counter.h>
27#include <rtems/profiling.h>
28#include <rtems/score/smpbarrier.h>
29#include <rtems/score/smplock.h>
30
31const char rtems_test_name[] = "SMPLOAD 1";
32
33#define CPU_COUNT 32
34
35#define MAX_INHERIT_OBTAIN_COUNT CPU_COUNT
36
37#define SEM_WORKER_COUNT (3 * CPU_COUNT)
38
39#define INIT_PRIO 1
40
41#define INHERIT_RELEASE_PRIO_HIGH (INIT_PRIO + 1)
42
43#define INHERIT_OBTAIN_PRIO_BASE (INHERIT_RELEASE_PRIO_HIGH + 1)
44
45#define INHERIT_RELEASE_PRIO_LOW (INHERIT_OBTAIN_PRIO_BASE + MAX_INHERIT_OBTAIN_COUNT)
46
47#define LOAD_PRIO (INHERIT_RELEASE_PRIO_LOW + 1)
48
49#define SEM_WORKER_CEILING_PRIO (LOAD_PRIO + 1)
50
51#define SEM_WORKER_PRIO_BASE (SEM_WORKER_CEILING_PRIO + 1)
52
53typedef struct {
54  rtems_id main_task_id;
55  rtems_id inherit_release_task_id;
56  rtems_id inherit_main_obtain_task_id;
57  rtems_id sem_worker_sem_prio_inherit;
58  rtems_id sem_worker_sem_prio_ceiling;
59  rtems_id inherit_sem;
60  rtems_counter_ticks inherit_obtain_delay;
61  SMP_barrier_Control inherit_barrier;
62  uint64_t inherit_obtain_counter[MAX_INHERIT_OBTAIN_COUNT];
63  uint64_t inherit_release_counter;
64  uint64_t sem_worker_counter[SEM_WORKER_COUNT];
65} test_context;
66
67static test_context test_instance = {
68  .inherit_barrier = SMP_BARRIER_CONTROL_INITIALIZER
69};
70
71static uint32_t simple_random(uint32_t v)
72{
73  v *= 1664525;
74  v += 1013904223;
75
76  return v;
77}
78
79static void inherit_obtain_task(rtems_task_argument arg)
80{
81  test_context *ctx = &test_instance;
82  rtems_status_code sc;
83  SMP_barrier_State barrier_state = SMP_BARRIER_STATE_INITIALIZER;
84  uint32_t cpu_count = rtems_smp_get_processor_count();
85  rtems_counter_ticks delay = (cpu_count - 1 - arg) * ctx->inherit_obtain_delay;
86
87  while (true) {
88    _SMP_barrier_Wait(&ctx->inherit_barrier, &barrier_state, cpu_count);
89
90    rtems_counter_delay_ticks(delay);
91
92    /*
93     * FIXME: Using a smaller value for the timeout triggers bug leading to
94     * system corruption.
95     */
96    sc = rtems_semaphore_obtain(ctx->inherit_sem, RTEMS_WAIT, 100);
97    rtems_test_assert(sc == RTEMS_TIMEOUT);
98
99    _SMP_barrier_Wait(&ctx->inherit_barrier, &barrier_state, cpu_count);
100
101    ++ctx->inherit_obtain_counter[arg];
102
103    if (arg == 0) {
104      rtems_task_priority prio = INHERIT_RELEASE_PRIO_HIGH;
105
106      sc = rtems_task_set_priority(ctx->inherit_release_task_id, prio, &prio);
107      rtems_test_assert(sc == RTEMS_SUCCESSFUL);
108
109      sc = rtems_task_resume(ctx->inherit_release_task_id);
110      rtems_test_assert(sc == RTEMS_SUCCESSFUL);
111
112      sc = rtems_event_transient_receive(RTEMS_WAIT, RTEMS_NO_TIMEOUT);
113      rtems_test_assert(sc == RTEMS_SUCCESSFUL);
114    }
115  }
116}
117
118static void inherit_release_task(rtems_task_argument arg)
119{
120  test_context *ctx = &test_instance;
121  rtems_status_code sc;
122
123  sc = rtems_semaphore_obtain(
124    ctx->inherit_sem,
125    RTEMS_WAIT,
126    RTEMS_NO_TIMEOUT
127  );
128  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
129
130  sc = rtems_event_transient_send(ctx->main_task_id);
131  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
132
133  while (true) {
134    rtems_task_priority prio = INHERIT_RELEASE_PRIO_LOW;
135
136    sc = rtems_task_suspend(RTEMS_SELF);
137    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
138
139    sc = rtems_semaphore_release(ctx->inherit_sem);
140    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
141
142    ++ctx->inherit_release_counter;
143
144    sc = rtems_semaphore_obtain(
145      ctx->inherit_sem,
146      RTEMS_WAIT,
147      RTEMS_NO_TIMEOUT
148    );
149    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
150
151    sc = rtems_task_set_priority(RTEMS_SELF, prio, &prio);
152    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
153
154    sc = rtems_event_transient_send(ctx->inherit_main_obtain_task_id);
155    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
156  }
157}
158
159static void load_task(rtems_task_argument arg)
160{
161  size_t data_size;
162  volatile int *data;
163  volatile int dummy;
164  size_t n;
165
166  data_size = rtems_cache_get_data_cache_size(0);
167  if (data_size > 0) {
168    data = malloc(data_size);
169    rtems_test_assert(data != NULL);
170  } else {
171    data_size = sizeof(dummy);
172    data = &dummy;
173  }
174
175  n = data_size / sizeof(*data);
176  while (true) {
177    size_t i;
178
179    for (i = 0; i < n; ++i) {
180      data[i] = i;
181    }
182  }
183}
184
185static void sem_worker_task(rtems_task_argument arg)
186{
187  test_context *ctx = &test_instance;
188  uint32_t v = arg;
189
190  while (true) {
191    rtems_status_code sc;
192    rtems_id id;
193
194    v = simple_random(v);
195
196    if ((v & 0x80000000) != 0) {
197      id = ctx->sem_worker_sem_prio_inherit;
198    } else {
199      id = ctx->sem_worker_sem_prio_ceiling;
200    }
201
202    sc = rtems_semaphore_obtain(id, RTEMS_WAIT, RTEMS_NO_TIMEOUT);
203    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
204
205    sc = rtems_task_wake_after(1);
206    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
207
208    sc = rtems_semaphore_release(id);
209    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
210
211    ++ctx->sem_worker_counter[arg];
212  }
213}
214
215static int cmp(const void *ap, const void *bp)
216{
217  const rtems_counter_ticks *a = ap;
218  const rtems_counter_ticks *b = bp;
219
220  return *a - *b;
221}
222
223static void get_obtain_delay_estimate(test_context *ctx)
224{
225  rtems_counter_ticks t[32];
226  SMP_lock_Control lock;
227  ISR_Level level;
228  size_t n = RTEMS_ARRAY_SIZE(t);
229  size_t i;
230
231  _SMP_lock_Initialize(&lock, "test");
232
233  _ISR_Disable_without_giant(level);
234
235  for (i = 0; i < n; ++i) {
236    SMP_lock_Context lock_context;
237    rtems_counter_ticks a;
238    rtems_counter_ticks b;
239
240    a = rtems_counter_read();
241    _SMP_lock_ISR_disable_and_acquire(&lock, &lock_context);
242    b = rtems_counter_read();
243    _SMP_lock_Release_and_ISR_enable(&lock, &lock_context);
244
245    t[i] = rtems_counter_difference(b, a);
246  }
247
248  _ISR_Enable_without_giant(level);
249
250  _SMP_lock_Destroy(&lock);
251
252  qsort(&t[0], n, sizeof(t[0]), cmp);
253
254  ctx->inherit_obtain_delay = t[n / 2];
255}
256
257static void test(void)
258{
259  test_context *ctx = &test_instance;
260  uint32_t i;
261  rtems_status_code sc;
262  rtems_id id;
263
264  ctx->main_task_id = rtems_task_self();
265
266  get_obtain_delay_estimate(ctx);
267
268  sc = rtems_semaphore_create(
269    rtems_build_name('S', 'E', 'M', 'I'),
270    1,
271    RTEMS_BINARY_SEMAPHORE | RTEMS_PRIORITY | RTEMS_INHERIT_PRIORITY,
272    0,
273    &ctx->sem_worker_sem_prio_inherit
274  );
275  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
276
277  sc = rtems_semaphore_create(
278    rtems_build_name('S', 'E', 'M', 'C'),
279    1,
280    RTEMS_BINARY_SEMAPHORE | RTEMS_PRIORITY | RTEMS_PRIORITY_CEILING,
281    SEM_WORKER_CEILING_PRIO,
282    &ctx->sem_worker_sem_prio_ceiling
283  );
284  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
285
286  sc = rtems_semaphore_create(
287    rtems_build_name('I', 'N', 'H', 'E'),
288    1,
289    RTEMS_BINARY_SEMAPHORE | RTEMS_PRIORITY | RTEMS_INHERIT_PRIORITY,
290    0,
291    &ctx->inherit_sem
292  );
293  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
294
295  for (i = 0; i < SEM_WORKER_COUNT; ++i) {
296    sc = rtems_task_create(
297      rtems_build_name('S', 'E', 'M', 'W'),
298      SEM_WORKER_PRIO_BASE + i,
299      RTEMS_MINIMUM_STACK_SIZE,
300      RTEMS_DEFAULT_MODES,
301      RTEMS_DEFAULT_ATTRIBUTES,
302      &id
303    );
304    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
305
306    sc = rtems_task_start(id, sem_worker_task, i);
307    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
308  }
309
310  sc = rtems_task_create(
311    rtems_build_name('L', 'O', 'A', 'D'),
312    LOAD_PRIO,
313    RTEMS_MINIMUM_STACK_SIZE,
314    RTEMS_DEFAULT_MODES,
315    RTEMS_DEFAULT_ATTRIBUTES,
316    &id
317  );
318  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
319
320  sc = rtems_task_start(id, load_task, 0);
321  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
322
323  sc = rtems_task_create(
324    rtems_build_name('I', 'N', 'H', 'R'),
325    INHERIT_RELEASE_PRIO_LOW,
326    RTEMS_MINIMUM_STACK_SIZE,
327    RTEMS_DEFAULT_MODES,
328    RTEMS_DEFAULT_ATTRIBUTES,
329    &id
330  );
331  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
332
333  ctx->inherit_release_task_id = id;
334
335  sc = rtems_task_start(id, inherit_release_task, 0);
336  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
337
338  sc = rtems_event_transient_receive(RTEMS_WAIT, RTEMS_NO_TIMEOUT);
339  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
340
341  for (i = 0; i < rtems_smp_get_processor_count(); ++i) {
342    sc = rtems_task_create(
343      rtems_build_name('I', 'N', 'H', 'O'),
344      INHERIT_OBTAIN_PRIO_BASE + i,
345      RTEMS_MINIMUM_STACK_SIZE,
346      RTEMS_DEFAULT_MODES,
347      RTEMS_DEFAULT_ATTRIBUTES,
348      &id
349    );
350    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
351
352    if (i == 0) {
353      ctx->inherit_main_obtain_task_id = id;
354    }
355
356    sc = rtems_task_start(id, inherit_obtain_task, i);
357    rtems_test_assert(sc == RTEMS_SUCCESSFUL);
358  }
359
360  sc = rtems_task_wake_after(30 * rtems_clock_get_ticks_per_second());
361  rtems_test_assert(sc == RTEMS_SUCCESSFUL);
362
363  for (i = 0; i < SEM_WORKER_COUNT; ++i) {
364    printf(
365      "semaphore worker count %2" PRIu32 ": %" PRIu64 "\n",
366      i,
367      ctx->sem_worker_counter[i]
368    );
369  }
370
371  printf(
372    "priority inheritance release count: %" PRIu64 "\n",
373    ctx->inherit_release_counter
374  );
375
376  for (i = 0; i < rtems_smp_get_processor_count(); ++i) {
377    printf(
378      "priority inheritance obtain count %2" PRIu32 ": %" PRIu64 "\n",
379      i,
380      ctx->inherit_obtain_counter[i]
381    );
382  }
383
384  rtems_profiling_report_xml("SMPLOAD 1", rtems_printf_plugin, NULL, 1, "  ");
385}
386
387static void Init(rtems_task_argument arg)
388{
389  TEST_BEGIN();
390
391  test();
392
393  TEST_END();
394  rtems_test_exit(0);
395}
396
397#define CONFIGURE_APPLICATION_NEEDS_CLOCK_DRIVER
398#define CONFIGURE_APPLICATION_NEEDS_CONSOLE_DRIVER
399
400#define CONFIGURE_MICROSECONDS_PER_TICK 1000
401
402#define CONFIGURE_SMP_APPLICATION
403
404#define CONFIGURE_SMP_MAXIMUM_PROCESSORS CPU_COUNT
405
406#define CONFIGURE_MAXIMUM_TASKS \
407  (1 + MAX_INHERIT_OBTAIN_COUNT + 1 + 1 + SEM_WORKER_COUNT)
408
409#define CONFIGURE_MAXIMUM_SEMAPHORES 3
410
411#define CONFIGURE_INIT_TASK_PRIORITY INIT_PRIO
412
413#define CONFIGURE_INITIAL_EXTENSIONS RTEMS_TEST_INITIAL_EXTENSION
414
415#define CONFIGURE_RTEMS_INIT_TASKS_TABLE
416
417#define CONFIGURE_INIT
418
419#include <rtems/confdefs.h>
Note: See TracBrowser for help on using the repository browser.