tmtests/tm11/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 11";
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 Middle_tasks(
0053   rtems_task_argument argument
0054 );
0055
0056 rtems_task High_task(
0057   rtems_task_argument argument
0058 );
0059
0060 int operation_count = OPERATION_COUNT;
0061
0062 void Init(
0063   rtems_task_argument argument
0064 )
0065 {
0066   rtems_status_code status;
0067   rtems_id id;
0068
0069   Print_Warning();
0070
0071   TEST_BEGIN();
0072
0073   status = rtems_task_create(
0074     1,
0075     RTEMS_MAXIMUM_PRIORITY - 1u,
0076     RTEMS_MINIMUM_STACK_SIZE,
0077     RTEMS_DEFAULT_MODES,
0078     RTEMS_DEFAULT_ATTRIBUTES,
0079     &id
0080   );
0081   directive_failed( status, "rtems_task_create" );
0082
0083   status = rtems_task_start( id, test_init, 0 );
0084   directive_failed( status, "rtems_task_start" );
0085
0086   rtems_task_exit();
0087 }
0088
0089 #define MESSAGE_SIZE (sizeof(long) * 4)
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 /*  As each task is started, it preempts this task and
0102  *  performs a blocking rtems_message_queue_receive.  Upon completion of
0103  *  this loop all created tasks are blocked.
0104  */
0105
0106   status = rtems_message_queue_create(
0107     rtems_build_name( 'M', 'Q', '1', ' '  ),
0108     OPERATION_COUNT,
0109     MESSAGE_SIZE,
0110     RTEMS_DEFAULT_ATTRIBUTES,
0111     &Queue_id
0112   );
0113   directive_failed( status, "rtems_message_queue_create" );
0114
0115   priority = RTEMS_MAXIMUM_PRIORITY - 2u;
0116
0117   if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
0118     operation_count =  RTEMS_MAXIMUM_PRIORITY - 2u;
0119   for( index = 0; index < operation_count ; index++ ) {
0120     status = rtems_task_create(
0121       rtems_build_name( 'T', 'I', 'M', 'E'  ),
0122       priority,
0123       RTEMS_MINIMUM_STACK_SIZE,
0124       RTEMS_DEFAULT_MODES,
0125       RTEMS_DEFAULT_ATTRIBUTES,
0126       &task_id
0127     );
0128     directive_failed( status, "rtems_task_create LOOP" );
0129
0130     priority--;
0131
0132     if ( index==operation_count-1 ) task_entry = High_task;
0133     else                            task_entry = Middle_tasks;
0134
0135     status = rtems_task_start( task_id, task_entry, 0 );
0136     directive_failed( status, "rtems_task_start LOOP" );
0137   }
0138
0139   benchmark_timer_initialize();
0140     (void) rtems_message_queue_send( Queue_id, Buffer, MESSAGE_SIZE );
0141 }
0142
0143 rtems_task Middle_tasks(
0144   rtems_task_argument argument
0145 )
0146 {
0147   size_t  size;
0148
0149   (void) rtems_message_queue_receive(
0150            Queue_id,
0151            (long (*)[4]) Buffer,
0152            &size,
0153            RTEMS_DEFAULT_OPTIONS,
0154            RTEMS_NO_TIMEOUT
0155          );
0156
0157   (void) rtems_message_queue_send( Queue_id, (long (*)[4]) Buffer, size );
0158 }
0159
0160 rtems_task High_task(
0161   rtems_task_argument argument
0162 )
0163 {
0164   size_t  size;
0165
0166   (void) rtems_message_queue_receive(
0167            Queue_id,
0168            (long (*)[4]) Buffer,
0169            &size,
0170            RTEMS_DEFAULT_OPTIONS,
0171            RTEMS_NO_TIMEOUT
0172          );
0173
0174   end_time = benchmark_timer_read();
0175
0176   put_time(
0177     "rtems_message_queue_send: task readied preempts caller",
0178     end_time,
0179     operation_count,
0180     0,
0181     0
0182   );
0183
0184   TEST_END();
0185   rtems_test_exit( 0 );
0186 }