tmtests/tm10/task1.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /*
0004  *  COPYRIGHT (c) 1989-2013.
0005  *  On-Line Applications Research Corporation (OAR).
0006  *
0007  * Redistribution and use in source and binary forms, with or without
0008  * modification, are permitted provided that the following conditions
0009  * are met:
0010  * 1. Redistributions of source code must retain the above copyright
0011  *    notice, this list of conditions and the following disclaimer.
0012  * 2. Redistributions in binary form must reproduce the above copyright
0013  *    notice, this list of conditions and the following disclaimer in the
0014  *    documentation and/or other materials provided with the distribution.
0015  *
0016  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0017  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0018  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0019  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0020  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0021  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0022  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0023  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0024  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0025  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0026  * POSSIBILITY OF SUCH DAMAGE.
0027  */
0028
0029 #if !defined(OPERATION_COUNT)
0030 #define OPERATION_COUNT 100
0031 #endif
0032
0033 #ifdef HAVE_CONFIG_H
0034 #include "config.h"
0035 #endif
0036
0037 #include <rtems/btimer.h>
0038
0039 #define CONFIGURE_INIT
0040 #include "system.h"
0041
0042 const char rtems_test_name[] = "TIME TEST 10";
0043
0044 rtems_id Queue_id;
0045 long Buffer[4];
0046
0047 rtems_task High_task(
0048   rtems_task_argument argument
0049 );
0050
0051 rtems_task Middle_tasks(
0052   rtems_task_argument argument
0053 );
0054
0055 rtems_task Low_task(
0056   rtems_task_argument argument
0057 );
0058
0059 void test_init(void);
0060
0061 int operation_count = OPERATION_COUNT;
0062
0063 rtems_task Init(
0064   rtems_task_argument argument
0065 )
0066 {
0067   Print_Warning();
0068
0069   TEST_BEGIN();
0070
0071   test_init();
0072
0073   rtems_task_exit();
0074 }
0075
0076 void test_init()
0077 {
0078   int                 index;
0079   size_t              size;
0080   rtems_task_entry    task_entry;
0081   rtems_status_code   status;
0082   rtems_task_priority priority;
0083   rtems_id            task_id;
0084
0085   priority = 2;
0086
0087   if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 )
0088     operation_count =  RTEMS_MAXIMUM_PRIORITY - 2;
0089
0090   for( index = 0; index < operation_count ; index++ ) {
0091     status = rtems_task_create(
0092       rtems_build_name( 'T', 'I', 'M', 'E' ),
0093       priority,
0094       RTEMS_MINIMUM_STACK_SIZE,
0095       RTEMS_DEFAULT_MODES,
0096       RTEMS_DEFAULT_ATTRIBUTES,
0097       &task_id
0098     );
0099     directive_failed( status, "rtems_task_create LOOP" );
0100
0101     priority++;
0102
0103     if ( index==0 )                    task_entry = High_task;
0104     else if ( index==operation_count-1 ) task_entry = Low_task;
0105     else                               task_entry = Middle_tasks;
0106
0107     status = rtems_task_start( task_id, task_entry, 0 );
0108     directive_failed( status, "rtems_task_start LOOP" );
0109   }
0110
0111   status = rtems_message_queue_create(
0112     1,
0113     (uint32_t)operation_count,
0114     16,
0115     RTEMS_DEFAULT_ATTRIBUTES,
0116     &Queue_id
0117   );
0118   directive_failed( status, "rtems_message_queue_create" );
0119
0120   benchmark_timer_initialize();
0121     for ( index=1 ; index < operation_count ; index++ )
0122       (void) benchmark_timer_empty_function();
0123   overhead = benchmark_timer_read();
0124
0125   benchmark_timer_initialize();
0126     for ( index=1 ; index < operation_count ; index++ )
0127       (void) rtems_message_queue_receive(
0128                Queue_id,
0129                (long (*)[4]) Buffer,
0130                &size,
0131                RTEMS_NO_WAIT,
0132                RTEMS_NO_TIMEOUT
0133              );
0134   end_time = benchmark_timer_read();
0135
0136   put_time(
0137     "rtems_message_queue_receive: not available NO_WAIT",
0138     end_time,
0139     operation_count,
0140     overhead,
0141     0
0142   );
0143
0144 }
0145
0146 rtems_task High_task(
0147   rtems_task_argument argument
0148 )
0149 {
0150   size_t  size;
0151
0152   benchmark_timer_initialize();
0153      (void) rtems_message_queue_receive(
0154               Queue_id,
0155               (long (*)[4]) Buffer,
0156               &size,
0157               RTEMS_DEFAULT_OPTIONS,
0158               RTEMS_NO_TIMEOUT
0159             );
0160 }
0161
0162 rtems_task Middle_tasks(
0163   rtems_task_argument argument
0164 )
0165 {
0166   size_t  size;
0167
0168   (void) rtems_message_queue_receive(
0169            Queue_id,
0170            (long (*)[4]) Buffer,
0171            &size,
0172            RTEMS_DEFAULT_OPTIONS,
0173            RTEMS_NO_TIMEOUT
0174          );
0175 }
0176
0177
0178 rtems_task Low_task(
0179   rtems_task_argument argument
0180 )
0181 {
0182   end_time = benchmark_timer_read();
0183
0184   put_time(
0185     "rtems_message_queue_receive: not available caller blocks",
0186     end_time,
0187     operation_count - 1,
0188     0,
0189     0
0190   );
0191
0192   TEST_END();
0193   rtems_test_exit( 0 );
0194 }