tmtests/tm14/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 14";
0043
0044 rtems_id Queue_id;
0045
0046 long Buffer[4];
0047
0048 rtems_task test_init(
0049   rtems_task_argument argument
0050 );
0051
0052 rtems_task High_task(
0053   rtems_task_argument argument
0054 );
0055
0056 rtems_task Low_tasks(
0057   rtems_task_argument argument
0058 );
0059
0060 #define MESSAGE_SIZE (sizeof(long) * 4)
0061
0062 int operation_count = OPERATION_COUNT;
0063
0064 rtems_task Init(
0065   rtems_task_argument argument
0066 )
0067 {
0068   rtems_id          task_id;
0069   rtems_status_code status;
0070
0071   Print_Warning();
0072
0073   TEST_BEGIN();
0074
0075   status = rtems_task_create(
0076     1,
0077     RTEMS_MAXIMUM_PRIORITY - 1u,
0078     RTEMS_MINIMUM_STACK_SIZE,
0079     RTEMS_DEFAULT_MODES,
0080     RTEMS_DEFAULT_ATTRIBUTES,
0081     &task_id
0082   );
0083   directive_failed( status, "rtems_task_create" );
0084
0085   status = rtems_task_start( task_id, test_init, 0 );
0086   directive_failed( status, "rtems_task_start" );
0087
0088   rtems_task_exit();
0089 }
0090
0091 rtems_task test_init(
0092   rtems_task_argument argument
0093 )
0094 {
0095   int                  index;
0096   rtems_task_entry     task_entry;
0097   rtems_task_priority  priority;
0098   rtems_id             task_id;
0099   rtems_status_code    status;
0100
0101   status = rtems_message_queue_create(
0102     rtems_build_name( 'M', 'Q', '1', ' ' ),
0103     OPERATION_COUNT,
0104     MESSAGE_SIZE,
0105     RTEMS_DEFAULT_ATTRIBUTES,
0106     &Queue_id
0107   );
0108   directive_failed( status, "rtems_message_queue_create" );
0109
0110   priority = RTEMS_MAXIMUM_PRIORITY - 2u;
0111   if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
0112     operation_count =  (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
0113
0114   for( index = 0; index < operation_count ; index++ ) {
0115     status = rtems_task_create(
0116       rtems_build_name( 'T', 'I', 'M', 'E' ),
0117       priority,
0118       RTEMS_MINIMUM_STACK_SIZE,
0119       RTEMS_DEFAULT_MODES,
0120       RTEMS_DEFAULT_ATTRIBUTES,
0121       &task_id
0122     );
0123     directive_failed( status, "rtems_task_create LOOP" );
0124
0125     priority--;
0126
0127     if ( index==operation_count-1 ) task_entry = High_task;
0128     else                            task_entry = Low_tasks;
0129
0130     status = rtems_task_start( task_id, task_entry, 0 );
0131     directive_failed( status, "rtems_task_start LOOP" );
0132   }
0133 }
0134
0135 rtems_task High_task(
0136   rtems_task_argument argument
0137 )
0138 {
0139   int  index;
0140
0141   benchmark_timer_initialize();
0142     for ( index=1 ; index < operation_count ; index++ )
0143       (void) benchmark_timer_empty_function();
0144   overhead = benchmark_timer_read();
0145
0146   benchmark_timer_initialize();
0147     for ( index=1 ; index <= operation_count ; index++ )
0148       (void) rtems_message_queue_urgent( Queue_id, Buffer, MESSAGE_SIZE );
0149   end_time = benchmark_timer_read();
0150
0151   put_time(
0152     "rtems_message_queue_urgent: task readied returns to caller",
0153     end_time,
0154     operation_count,
0155     overhead,
0156     0
0157   );
0158
0159   TEST_END();
0160   rtems_test_exit( 0 );
0161 }
0162
0163 rtems_task Low_tasks(
0164   rtems_task_argument argument
0165 )
0166 {
0167   size_t  size;
0168
0169   (void) rtems_message_queue_receive(
0170            Queue_id,
0171            (long (*)[4]) Buffer,
0172            &size,
0173            RTEMS_DEFAULT_OPTIONS,
0174            RTEMS_NO_TIMEOUT
0175          );
0176 }