Back to home page

LXR

 
 

    


File indexing completed on 2025-05-11 08:24:50

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002 
0003 /*
0004  *  COPYRIGHT (c) 1989-2009.
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 17";
0043 
0044 uint32_t   Task_count;
0045 rtems_task_priority Task_priority;
0046 
0047 rtems_task First_task(
0048   rtems_task_argument argument
0049 );
0050 
0051 rtems_task Middle_tasks(
0052   rtems_task_argument argument
0053 );
0054 
0055 rtems_task Last_task(
0056   rtems_task_argument argument
0057 );
0058 
0059 int operation_count = OPERATION_COUNT;
0060 
0061 rtems_task Init(
0062   rtems_task_argument argument
0063 )
0064 {
0065   rtems_task_entry  task_entry;
0066   int               index;
0067   rtems_status_code status;
0068 
0069   Print_Warning();
0070 
0071   TEST_BEGIN();
0072 
0073   Task_priority = RTEMS_MAXIMUM_PRIORITY - 1u;
0074   if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
0075     operation_count =  (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
0076 
0077   for( index = 0; index < operation_count ; index++ ) {
0078     status = rtems_task_create(
0079       rtems_build_name( 'T', 'I', 'M', 'E' ),
0080       Task_priority,
0081       RTEMS_MINIMUM_STACK_SIZE,
0082       RTEMS_DEFAULT_MODES,
0083       RTEMS_DEFAULT_ATTRIBUTES,
0084       &Task_id[ index ]
0085     );
0086     directive_failed( status, "rtems_task_create loop" );
0087 
0088     if ( index == operation_count-1 ) task_entry = Last_task;
0089     else if ( index == 0 )            task_entry = First_task;
0090     else                              task_entry = Middle_tasks;
0091 
0092     status = rtems_task_start( Task_id[ index ], task_entry, 0 );
0093     directive_failed( status, "rtems_task_start loop" );
0094   }
0095 
0096   Task_count = 1;
0097   rtems_task_exit();
0098 }
0099 
0100 rtems_task First_task(
0101   rtems_task_argument argument
0102 )
0103 {
0104   rtems_task_priority previous_priority;
0105 
0106   benchmark_timer_initialize();
0107 
0108   Task_priority--;
0109   Task_count++;
0110 
0111   (void) rtems_task_set_priority(
0112            Task_id[ Task_count ],
0113            Task_priority,
0114            &previous_priority
0115          );
0116 }
0117 
0118 rtems_task Middle_tasks(
0119   rtems_task_argument argument
0120 )
0121 {
0122   rtems_task_priority previous_priority;
0123 
0124   Task_priority--;
0125   Task_count++;
0126 
0127   (void) rtems_task_set_priority(
0128            Task_id[ Task_count ],
0129            Task_priority,
0130            &previous_priority
0131          );
0132 }
0133 
0134 rtems_task Last_task(
0135   rtems_task_argument argument
0136 )
0137 {
0138   int index;
0139 
0140   end_time = benchmark_timer_read();
0141 
0142   benchmark_timer_initialize();
0143     for ( index=1 ; index < operation_count ; index++ )
0144       (void) benchmark_timer_empty_function();
0145   overhead = benchmark_timer_read();
0146 
0147   put_time(
0148     "rtems_task_set_priority: preempts caller",
0149     end_time,
0150     operation_count - 1u,
0151     overhead,
0152     0
0153   );
0154 
0155   TEST_END();
0156   rtems_test_exit( 0 );
0157 }