mirror of
https://gitlab.rtems.org/rtems/rtos/rtems.git
synced 2026-08-18 19:34:20 +08:00
132 lines
3.3 KiB
C
132 lines
3.3 KiB
C
/* SPDX-License-Identifier: BSD-2-Clause */
|
|
|
|
/*
|
|
* COPYRIGHT (c) 1989-2009.
|
|
* On-Line Applications Research Corporation (OAR).
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#if !defined( OPERATION_COUNT )
|
|
#define OPERATION_COUNT 100
|
|
#endif
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include "config.h"
|
|
#endif
|
|
|
|
#include <rtems/btimer.h>
|
|
|
|
#define CONFIGURE_INIT
|
|
#include "system.h"
|
|
|
|
const char rtems_test_name[] = "TIME TEST 18";
|
|
|
|
uint32_t taskcount;
|
|
rtems_task_priority taskpri;
|
|
|
|
extern void test_init( void );
|
|
|
|
rtems_task First_task( rtems_task_argument argument );
|
|
|
|
rtems_task Middle_tasks( rtems_task_argument argument );
|
|
|
|
rtems_task Last_task( rtems_task_argument argument );
|
|
|
|
rtems_task Init( rtems_task_argument argument )
|
|
{
|
|
(void) argument;
|
|
|
|
Print_Warning();
|
|
|
|
TEST_BEGIN();
|
|
|
|
test_init();
|
|
|
|
rtems_task_exit();
|
|
}
|
|
|
|
void test_init( void )
|
|
{
|
|
rtems_id id;
|
|
rtems_task_entry task_entry;
|
|
uint32_t index;
|
|
rtems_status_code status;
|
|
|
|
for ( index = 0; index <= OPERATION_COUNT; index++ ) {
|
|
status = rtems_task_create(
|
|
rtems_build_name( 'T', 'I', 'M', 'E' ),
|
|
( RTEMS_MAXIMUM_PRIORITY / 2u ) + 1u,
|
|
RTEMS_MINIMUM_STACK_SIZE,
|
|
RTEMS_DEFAULT_MODES,
|
|
RTEMS_DEFAULT_ATTRIBUTES,
|
|
&id
|
|
);
|
|
directive_failed( status, "rtems_task_create loop" );
|
|
|
|
if ( index == OPERATION_COUNT ) {
|
|
task_entry = Last_task;
|
|
} else if ( index == 0 ) {
|
|
task_entry = First_task;
|
|
} else {
|
|
task_entry = Middle_tasks;
|
|
}
|
|
|
|
status = rtems_task_start( id, task_entry, 0 );
|
|
directive_failed( status, "rtems_task_start loop" );
|
|
}
|
|
}
|
|
|
|
rtems_task First_task( rtems_task_argument argument )
|
|
{
|
|
(void) argument;
|
|
|
|
benchmark_timer_initialize();
|
|
|
|
rtems_task_exit();
|
|
}
|
|
|
|
rtems_task Middle_tasks( rtems_task_argument argument )
|
|
{
|
|
(void) argument;
|
|
|
|
rtems_task_exit();
|
|
}
|
|
|
|
rtems_task Last_task( rtems_task_argument argument )
|
|
{
|
|
(void) argument;
|
|
|
|
end_time = benchmark_timer_read();
|
|
|
|
put_time(
|
|
"rtems_task_delete: calling task",
|
|
end_time,
|
|
OPERATION_COUNT,
|
|
0,
|
|
0
|
|
);
|
|
|
|
TEST_END();
|
|
rtems_test_exit( 0 );
|
|
}
|