Fix most warnings.

This commit is contained in:
Joel Sherrill
2009-05-09 21:24:06 +00:00
parent d0a263ac1e
commit 1055ce20fc
28 changed files with 150 additions and 129 deletions

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -32,7 +32,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
Task_name[ 1 ], Task_name[ 1 ],
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -30,7 +30,7 @@ rtems_task Low_task(
int operation_count = OPERATION_COUNT; int operation_count = OPERATION_COUNT;
void test_init(); void test_init(void);
rtems_task Init( rtems_task Init(
rtems_task_argument argument rtems_task_argument argument
@@ -48,10 +48,10 @@ rtems_task Init(
directive_failed( status, "rtems_task_delete" ); directive_failed( status, "rtems_task_delete" );
} }
void test_init() void test_init(void)
{ {
rtems_status_code status; rtems_status_code status;
uint32_t index; int index;
rtems_task_priority priority; rtems_task_priority priority;
priority = 2; priority = 2;
@@ -71,8 +71,8 @@ void test_init()
status = rtems_task_start( High_id, High_task, 0 ); status = rtems_task_start( High_id, High_task, 0 );
directive_failed( status, "rtems_task_start of high task" ); directive_failed( status, "rtems_task_start of high task" );
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
for ( index=2 ; index < operation_count ; index++ ) { for ( index=2 ; index < operation_count ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'M', 'I', 'D', ' ' ), rtems_build_name( 'M', 'I', 'D', ' ' ),

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -39,7 +39,7 @@ rtems_task Init(
puts( "\n\n*** TIME TEST 3 ***" ); puts( "\n\n*** TIME TEST 3 ***" );
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'A', '1', ' ' ), rtems_build_name( 'T', 'A', '1', ' ' ),
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -63,7 +63,7 @@ rtems_task test_init(
rtems_id task_id; rtems_id task_id;
rtems_task_priority priority; rtems_task_priority priority;
priority = RTEMS_MAXIMUM_PRIORITY - 2; priority = RTEMS_MAXIMUM_PRIORITY - 2u;
status = rtems_semaphore_create( status = rtems_semaphore_create(
rtems_build_name( 'S', 'M', '1', '\0'), rtems_build_name( 'S', 'M', '1', '\0'),
@@ -74,8 +74,8 @@ rtems_task test_init(
); );
directive_failed( status, "rtems_semaphore_create of SM1" ); directive_failed( status, "rtems_semaphore_create of SM1" );
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
for ( index = 2 ; index < operation_count ; index ++ ) { for ( index = 2 ; index < operation_count ; index ++ ) {
rtems_task_create( rtems_task_create(
rtems_build_name( 'M', 'I', 'D', ' ' ), rtems_build_name( 'M', 'I', 'D', ' ' ),

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -25,11 +25,15 @@ rtems_task High_task(
rtems_task_argument argument rtems_task_argument argument
); );
rtems_task Highest_task(
rtems_task_argument argument
);
rtems_task Restart_task( rtems_task Restart_task(
rtems_task_argument argument rtems_task_argument argument
); );
void test_init(); void test_init(void);
rtems_task Init( rtems_task Init(
rtems_task_argument argument rtems_task_argument argument
@@ -47,10 +51,10 @@ rtems_task Init(
directive_failed( status, "rtems_task_delete of RTEMS_SELF" ); directive_failed( status, "rtems_task_delete of RTEMS_SELF" );
} }
void test_init() void test_init(void)
{ {
rtems_status_code status; rtems_status_code status;
uint32_t index; int index;
task_count = OPERATION_COUNT; task_count = OPERATION_COUNT;
@@ -101,7 +105,7 @@ rtems_task Highest_task(
status = rtems_task_set_priority( status = rtems_task_set_priority(
RTEMS_CURRENT_PRIORITY, RTEMS_CURRENT_PRIORITY,
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
&old_priority &old_priority
); );
directive_failed( status, "rtems_task_set_priority" ); directive_failed( status, "rtems_task_set_priority" );
@@ -214,7 +218,7 @@ rtems_task High_task(
for ( index=1 ; index <= OPERATION_COUNT ; index++ ) { for ( index=1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
name, name,
RTEMS_MAXIMUM_PRIORITY - 4, RTEMS_MAXIMUM_PRIORITY - 4u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_NO_PREEMPT, RTEMS_NO_PREEMPT,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -261,7 +265,7 @@ rtems_task High_task(
for ( index=1 ; index <= OPERATION_COUNT ; index++ ) { for ( index=1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
name, name,
RTEMS_MAXIMUM_PRIORITY - 4, RTEMS_MAXIMUM_PRIORITY - 4u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -51,7 +51,7 @@ void test_init( void )
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -96,7 +96,7 @@ rtems_task Task_1(
for ( index=1 ; index <= OPERATION_COUNT ; index++ ) { for ( index=1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -26,7 +26,7 @@ rtems_task Low_task(
rtems_task_argument argument rtems_task_argument argument
); );
void test_init(); void test_init(void);
int operation_count = OPERATION_COUNT; int operation_count = OPERATION_COUNT;
@@ -46,17 +46,17 @@ rtems_task Init(
directive_failed( status, "rtems_task_delete of RTEMS_SELF" ); directive_failed( status, "rtems_task_delete of RTEMS_SELF" );
} }
void test_init() void test_init(void)
{ {
rtems_status_code status; rtems_status_code status;
rtems_task_priority priority; rtems_task_priority priority;
rtems_task_entry task_entry; rtems_task_entry task_entry;
uint32_t index; int index;
priority = RTEMS_MAXIMUM_PRIORITY - 1; priority = RTEMS_MAXIMUM_PRIORITY - 1u;
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
for( index=0 ; index <= operation_count ; index++ ) { for( index=0 ; index <= operation_count ; index++ ) {
status = rtems_task_create( status = rtems_task_create(

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -20,7 +20,7 @@ rtems_task test_task(
rtems_task test_task1( rtems_task test_task1(
rtems_task_argument argument rtems_task_argument argument
); );
void test_init(); void test_init(void);
rtems_task Init( rtems_task Init(
rtems_task_argument argument rtems_task_argument argument
@@ -38,13 +38,13 @@ rtems_task Init(
directive_failed( status, "rtems_task_delete of RTEMS_SELF" ); directive_failed( status, "rtems_task_delete of RTEMS_SELF" );
} }
void test_init() void test_init(void)
{ {
rtems_status_code status; rtems_status_code status;
status = rtems_task_create( status = rtems_task_create(
1, 1,
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -57,7 +57,7 @@ void test_init()
status = rtems_task_create( status = rtems_task_create(
1, 1,
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -106,7 +106,7 @@ rtems_task test_task(
for ( index=1 ; index <= OPERATION_COUNT ; index++ ) for ( index=1 ; index <= OPERATION_COUNT ; index++ )
(void) rtems_task_set_priority( (void) rtems_task_set_priority(
Test_task_id, Test_task_id,
RTEMS_MAXIMUM_PRIORITY - 2, RTEMS_MAXIMUM_PRIORITY - 2u,
&old_priority &old_priority
); );

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -17,7 +17,7 @@ rtems_id Queue_id;
rtems_task Test_task( rtems_task Test_task(
rtems_task_argument argument rtems_task_argument argument
); );
void queue_test(); void queue_test(void);
rtems_task Init( rtems_task Init(
rtems_task_argument argument rtems_task_argument argument
@@ -31,7 +31,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
1, 1,
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE * 2, RTEMS_MINIMUM_STACK_SIZE * 2,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -86,7 +86,7 @@ rtems_task Test_task (
rtems_test_exit( 0 ); rtems_test_exit( 0 );
} }
void queue_test() void queue_test(void)
{ {
uint32_t send_loop_time; uint32_t send_loop_time;
uint32_t urgent_loop_time; uint32_t urgent_loop_time;

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -27,7 +27,7 @@ rtems_task Low_task(
rtems_task_argument argument rtems_task_argument argument
); );
void test_init(); void test_init(void);
int operation_count = OPERATION_COUNT; int operation_count = OPERATION_COUNT;
@@ -84,7 +84,7 @@ void test_init()
status = rtems_message_queue_create( status = rtems_message_queue_create(
1, 1,
operation_count, (uint32_t)operation_count,
16, 16,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
&Queue_id &Queue_id

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -43,7 +43,7 @@ void Init(
status = rtems_task_create( status = rtems_task_create(
1, 1,
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -64,7 +64,7 @@ rtems_task test_init(
rtems_task_argument argument rtems_task_argument argument
) )
{ {
uint32_t index; int index;
rtems_task_entry task_entry; rtems_task_entry task_entry;
rtems_task_priority priority; rtems_task_priority priority;
rtems_id task_id; rtems_id task_id;
@@ -84,10 +84,10 @@ rtems_task test_init(
); );
directive_failed( status, "rtems_message_queue_create" ); directive_failed( status, "rtems_message_queue_create" );
priority = RTEMS_MAXIMUM_PRIORITY - 2; priority = RTEMS_MAXIMUM_PRIORITY - 2u;
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = RTEMS_MAXIMUM_PRIORITY - 2u;
for( index = 0; index < operation_count ; index++ ) { for( index = 0; index < operation_count ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -45,7 +45,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
1, 1,
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -64,7 +64,7 @@ rtems_task test_init(
rtems_task_argument argument rtems_task_argument argument
) )
{ {
uint32_t index; int index;
rtems_task_entry task_entry; rtems_task_entry task_entry;
rtems_task_priority priority; rtems_task_priority priority;
rtems_id task_id; rtems_id task_id;
@@ -73,14 +73,14 @@ rtems_task test_init(
status = rtems_message_queue_create( status = rtems_message_queue_create(
rtems_build_name( 'M', 'Q', '1', ' ' ), rtems_build_name( 'M', 'Q', '1', ' ' ),
operation_count, (uint32_t) operation_count,
MESSAGE_SIZE, MESSAGE_SIZE,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
&Queue_id &Queue_id
); );
directive_failed( status, "rtems_message_queue_create" ); directive_failed( status, "rtems_message_queue_create" );
priority = RTEMS_MAXIMUM_PRIORITY - 1; priority = RTEMS_MAXIMUM_PRIORITY - 1u;
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = RTEMS_MAXIMUM_PRIORITY - 2;
@@ -110,7 +110,7 @@ rtems_task High_task(
rtems_task_argument argument rtems_task_argument argument
) )
{ {
uint32_t index; int index;
benchmark_timer_initialize(); benchmark_timer_initialize();
for ( index=1 ; index < operation_count ; index++ ) for ( index=1 ; index < operation_count ; index++ )

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -45,7 +45,7 @@ void Init(
status = rtems_task_create( status = rtems_task_create(
1, 1,
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -64,7 +64,7 @@ rtems_task test_init(
rtems_task_argument argument rtems_task_argument argument
) )
{ {
uint32_t index; int index;
rtems_task_entry task_entry; rtems_task_entry task_entry;
rtems_task_priority priority; rtems_task_priority priority;
rtems_id task_id; rtems_id task_id;
@@ -84,10 +84,10 @@ rtems_task test_init(
); );
directive_failed( status, "rtems_message_queue_create" ); directive_failed( status, "rtems_message_queue_create" );
priority = RTEMS_MAXIMUM_PRIORITY - 2; priority = RTEMS_MAXIMUM_PRIORITY - 2u;
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = (int)(RTEMS_MAXIMUM_PRIORITY - 2u);
for( index = 0; index < operation_count ; index++ ) { for( index = 0; index < operation_count ; index++ ) {
status = rtems_task_create( status = rtems_task_create(

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -45,7 +45,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
1, 1,
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -64,13 +64,12 @@ rtems_task test_init(
rtems_task_argument argument rtems_task_argument argument
) )
{ {
uint32_t index; int index;
rtems_task_entry task_entry; rtems_task_entry task_entry;
rtems_task_priority priority; rtems_task_priority priority;
rtems_id task_id; rtems_id task_id;
rtems_status_code status; rtems_status_code status;
status = rtems_message_queue_create( status = rtems_message_queue_create(
rtems_build_name( 'M', 'Q', '1', ' ' ), rtems_build_name( 'M', 'Q', '1', ' ' ),
OPERATION_COUNT, OPERATION_COUNT,
@@ -80,9 +79,9 @@ rtems_task test_init(
); );
directive_failed( status, "rtems_message_queue_create" ); directive_failed( status, "rtems_message_queue_create" );
priority = RTEMS_MAXIMUM_PRIORITY - 2; priority = RTEMS_MAXIMUM_PRIORITY - 2u;
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
for( index = 0; index < operation_count ; index++ ) { for( index = 0; index < operation_count ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
@@ -109,7 +108,7 @@ rtems_task High_task(
rtems_task_argument argument rtems_task_argument argument
) )
{ {
uint32_t index; int index;
benchmark_timer_initialize(); benchmark_timer_initialize();
for ( index=1 ; index < operation_count ; index++ ) for ( index=1 ; index < operation_count ; index++ )

View File

@@ -1,6 +1,5 @@
/* /*
* * COPYRIGHT (c) 1989-2009.
* COPYRIGHT (c) 1989-1999.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -23,7 +22,7 @@ rtems_task Low_task(
rtems_task_argument argument rtems_task_argument argument
); );
void test_init(); void test_init(void);
rtems_task Init( rtems_task Init(
rtems_task_argument argument rtems_task_argument argument
@@ -41,7 +40,7 @@ rtems_task Init(
directive_failed( status, "rtems_task_delete of RTEMS_SELF" ); directive_failed( status, "rtems_task_delete of RTEMS_SELF" );
} }
void test_init() void test_init(void)
{ {
rtems_id id; rtems_id id;
uint32_t index; uint32_t index;

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -41,7 +41,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'E', 'S', 'T' ), rtems_build_name( 'T', 'E', 'S', 'T' ),
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -62,7 +62,7 @@ rtems_task test_init(
{ {
rtems_task_priority priority; rtems_task_priority priority;
rtems_status_code status; rtems_status_code status;
uint32_t index; int index;
rtems_task_entry task_entry; rtems_task_entry task_entry;
/* As each task is started, it preempts this task and /* As each task is started, it preempts this task and
@@ -70,9 +70,9 @@ rtems_task test_init(
* this loop all created tasks are blocked. * this loop all created tasks are blocked.
*/ */
priority = RTEMS_MAXIMUM_PRIORITY - 2; priority = RTEMS_MAXIMUM_PRIORITY - 2u;
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
for( index = 0 ; index < operation_count ; index++ ) { for( index = 0 ; index < operation_count ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
@@ -140,8 +140,8 @@ rtems_task High_task(
put_time( put_time(
"rtems_event_send: task readied -- preempts caller", "rtems_event_send: task readied -- preempts caller",
end_time, end_time,
operation_count - 1, operation_count - 1u,
0, 0u,
CALLING_OVERHEAD_EVENT_SEND CALLING_OVERHEAD_EVENT_SEND
); );

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -34,16 +34,16 @@ rtems_task Init(
) )
{ {
rtems_task_entry task_entry; rtems_task_entry task_entry;
uint32_t index; int index;
rtems_status_code status; rtems_status_code status;
Print_Warning(); Print_Warning();
puts( "\n\n*** TIME TEST 17 ***" ); puts( "\n\n*** TIME TEST 17 ***" );
Task_priority = RTEMS_MAXIMUM_PRIORITY - 1; Task_priority = RTEMS_MAXIMUM_PRIORITY - 1u;
if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2 ) if ( OPERATION_COUNT > RTEMS_MAXIMUM_PRIORITY - 2u )
operation_count = RTEMS_MAXIMUM_PRIORITY - 2; operation_count = (int) (RTEMS_MAXIMUM_PRIORITY - 2u);
for( index = 0; index < operation_count ; index++ ) { for( index = 0; index < operation_count ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
@@ -107,7 +107,7 @@ rtems_task Last_task(
rtems_task_argument argument rtems_task_argument argument
) )
{ {
uint32_t index; int index;
end_time = benchmark_timer_read(); end_time = benchmark_timer_read();
@@ -119,7 +119,7 @@ rtems_task Last_task(
put_time( put_time(
"rtems_task_set_priority: preempts caller", "rtems_task_set_priority: preempts caller",
end_time, end_time,
operation_count - 1, operation_count - 1u,
overhead, overhead,
CALLING_OVERHEAD_TASK_SET_PRIORITY CALLING_OVERHEAD_TASK_SET_PRIORITY
); );

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -15,6 +15,8 @@
uint32_t taskcount; uint32_t taskcount;
rtems_task_priority taskpri; rtems_task_priority taskpri;
void test_init(void);
rtems_task First_task( rtems_task First_task(
rtems_task_argument argument rtems_task_argument argument
); );
@@ -46,7 +48,7 @@ rtems_task Init(
directive_failed( status, "rtems_task_delete of RTEMS_SELF" ); directive_failed( status, "rtems_task_delete of RTEMS_SELF" );
} }
void test_init() void test_init(void)
{ {
rtems_id id; rtems_id id;
rtems_task_entry task_entry; rtems_task_entry task_entry;
@@ -56,7 +58,7 @@ void test_init()
for ( index = 0 ; index <= OPERATION_COUNT ; index++ ) { for ( index = 0 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -44,7 +44,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -70,7 +70,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
(RTEMS_MAXIMUM_PRIORITY / 2) - 1, (RTEMS_MAXIMUM_PRIORITY / 2u) - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -166,6 +166,11 @@ rtems_task Task_1(
(void) rtems_signal_send( RTEMS_SELF, RTEMS_SIGNAL_1 ); (void) rtems_signal_send( RTEMS_SELF, RTEMS_SIGNAL_1 );
} }
/* avoid warnings for no prototype */
rtems_asr Process_asr_for_task_2(
rtems_signal_set signals
);
rtems_asr Process_asr_for_task_2( rtems_asr Process_asr_for_task_2(
rtems_signal_set signals rtems_signal_set signals
) )

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -57,7 +57,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', '1' ), rtems_build_name( 'T', 'I', 'M', '1' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -70,7 +70,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', '2' ), rtems_build_name( 'T', 'I', 'M', '2' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 2, (RTEMS_MAXIMUM_PRIORITY / 2u) + 2u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -310,7 +310,7 @@ rtems_task Task_1(
directive_failed( status, "rtems_task_mode" ); directive_failed( status, "rtems_task_mode" );
status = rtems_task_set_priority( status = rtems_task_set_priority(
RTEMS_SELF, RTEMS_MAXIMUM_PRIORITY - 1, &previous_priority ); RTEMS_SELF, RTEMS_MAXIMUM_PRIORITY - 1u, &previous_priority );
directive_failed( status, "rtems_task_set_priority" ); directive_failed( status, "rtems_task_set_priority" );
status = rtems_region_get_segment( status = rtems_region_get_segment(

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -32,7 +32,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
RTEMS_MAXIMUM_PRIORITY - 5, RTEMS_MAXIMUM_PRIORITY - 5u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -60,7 +60,7 @@ rtems_task Task_1(
for( index = 1 ; index <= OPERATION_COUNT ; index++ ) { for( index = 1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create ( status = rtems_task_create (
index, index,
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -41,7 +41,7 @@ rtems_task Init(
{ {
rtems_task_priority priority; rtems_task_priority priority;
uint32_t index; int index;
rtems_id id; rtems_id id;
rtems_task_entry task_entry; rtems_task_entry task_entry;
rtems_status_code status; rtems_status_code status;

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -50,7 +50,7 @@ rtems_task Init(
for ( index = 1 ; index <= OPERATION_COUNT ; index++ ) { for ( index = 1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'R', 'E', 'S', 'T' ), rtems_build_name( 'R', 'E', 'S', 'T' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -45,7 +45,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'L', 'O', 'W', ' ' ), rtems_build_name( 'L', 'O', 'W', ' ' ),
RTEMS_MAXIMUM_PRIORITY - 1, RTEMS_MAXIMUM_PRIORITY - 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,
@@ -59,7 +59,7 @@ rtems_task Init(
for ( index=1 ; index <= OPERATION_COUNT ; index++ ) { for ( index=1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -54,6 +54,10 @@ uint32_t thread_get_time;
uint32_t semaphore_get_time; uint32_t semaphore_get_time;
uint32_t thread_get_invalid_time; uint32_t thread_get_invalid_time;
rtems_task null_task(
rtems_task_argument argument
);
rtems_task High_task( rtems_task High_task(
rtems_task_argument argument rtems_task_argument argument
); );
@@ -94,7 +98,7 @@ rtems_task Init(
puts( "\n\n*** TIME TEST 26 ***" ); puts( "\n\n*** TIME TEST 26 ***" );
#define FP1_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 3) /* 201, */ #define FP1_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 3u) /* 201, */
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'F', 'P', '1', ' ' ), rtems_build_name( 'F', 'P', '1', ' ' ),
FP1_PRIORITY, FP1_PRIORITY,
@@ -108,7 +112,7 @@ rtems_task Init(
status = rtems_task_start( task_id, Floating_point_task_1, 0 ); status = rtems_task_start( task_id, Floating_point_task_1, 0 );
directive_failed( status, "rtems_task_start of FP1" ); directive_failed( status, "rtems_task_start of FP1" );
#define FP2_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 2) /* 202, */ #define FP2_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 2u) /* 202, */
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'F', 'P', '2', ' ' ), rtems_build_name( 'F', 'P', '2', ' ' ),
FP2_PRIORITY, FP2_PRIORITY,
@@ -122,7 +126,7 @@ rtems_task Init(
status = rtems_task_start( task_id, Floating_point_task_2, 0 ); status = rtems_task_start( task_id, Floating_point_task_2, 0 );
directive_failed( status, "rtems_task_start of FP2" ); directive_failed( status, "rtems_task_start of FP2" );
#define LOW_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 4) /* 200, */ #define LOW_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 4u) /* 200, */
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'L', 'O', 'W', ' ' ), rtems_build_name( 'L', 'O', 'W', ' ' ),
LOW_PRIORITY, LOW_PRIORITY,
@@ -136,7 +140,7 @@ rtems_task Init(
status = rtems_task_start( task_id, Low_task, 0 ); status = rtems_task_start( task_id, Low_task, 0 );
directive_failed( status, "rtems_task_start of LOW" ); directive_failed( status, "rtems_task_start of LOW" );
#define MIDDLE_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 5) /* 128, */ #define MIDDLE_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 5u) /* 128, */
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'M', 'I', 'D', ' ' ), rtems_build_name( 'M', 'I', 'D', ' ' ),
MIDDLE_PRIORITY, MIDDLE_PRIORITY,
@@ -175,7 +179,7 @@ rtems_task Init(
for ( index = 1 ; index <= OPERATION_COUNT ; index++ ) { for ( index = 1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'N', 'U', 'L', 'L' ), rtems_build_name( 'N', 'U', 'L', 'L' ),
RTEMS_MAXIMUM_PRIORITY - 1, /* 254, */ RTEMS_MAXIMUM_PRIORITY - 1u, /* 254, */
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -51,7 +51,7 @@ rtems_task Init(
puts( "\n\n*** TIME TEST 27 ***" ); puts( "\n\n*** TIME TEST 27 ***" );
#define LOW_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 1) #define LOW_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 1u)
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'A', '1', ' ' ), rtems_build_name( 'T', 'A', '1', ' ' ),
LOW_PRIORITY, LOW_PRIORITY,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -33,7 +33,7 @@ rtems_task Init(
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'I', 'M', 'E' ), rtems_build_name( 'T', 'I', 'M', 'E' ),
(RTEMS_MAXIMUM_PRIORITY / 2) + 1, (RTEMS_MAXIMUM_PRIORITY / 2u) + 1u,
RTEMS_MINIMUM_STACK_SIZE, RTEMS_MINIMUM_STACK_SIZE,
RTEMS_DEFAULT_MODES, RTEMS_DEFAULT_MODES,
RTEMS_DEFAULT_ATTRIBUTES, RTEMS_DEFAULT_ATTRIBUTES,

View File

@@ -1,5 +1,5 @@
/* /*
* COPYRIGHT (c) 1989-2008. * COPYRIGHT (c) 1989-2009.
* On-Line Applications Research Corporation (OAR). * On-Line Applications Research Corporation (OAR).
* *
* The license and distribution terms for this file may be * The license and distribution terms for this file may be
@@ -116,7 +116,7 @@ rtems_task Init(
CALLING_OVERHEAD_RATE_MONOTONIC_DELETE CALLING_OVERHEAD_RATE_MONOTONIC_DELETE
); );
#define LOOP_TASK_PRIORITY ((RTEMS_MAXIMUM_PRIORITY / 2) + 1) #define LOOP_TASK_PRIORITY ((RTEMS_MAXIMUM_PRIORITY / 2u) + 1u)
for ( index=1 ; index <= OPERATION_COUNT ; index++ ) { for ( index=1 ; index <= OPERATION_COUNT ; index++ ) {
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'T', 'E', 'S', 'T' ), rtems_build_name( 'T', 'E', 'S', 'T' ),
@@ -132,7 +132,7 @@ rtems_task Init(
directive_failed( status, "rtems_task_start LOOP" ); directive_failed( status, "rtems_task_start LOOP" );
} }
#define MIDDLE_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 2) #define MIDDLE_PRIORITY (RTEMS_MAXIMUM_PRIORITY - 2u)
status = rtems_task_create( status = rtems_task_create(
rtems_build_name( 'L', 'O', 'W', ' ' ), rtems_build_name( 'L', 'O', 'W', ' ' ),
MIDDLE_PRIORITY, MIDDLE_PRIORITY,

View File

@@ -12,6 +12,10 @@
#include "system.h" #include "system.h"
rtems_task task_func(void);
void null_func(void);
rtems_status_code Empty_directive(void);
rtems_timer_service_routine Timer_handler( rtems_timer_service_routine Timer_handler(
rtems_id argument rtems_id argument
) )
@@ -30,11 +34,15 @@ rtems_asr Asr_handler(
{ {
} }
rtems_task task_func() {} rtems_task task_func(void)
{
}
void null_func() {} void null_func(void)
{
}
rtems_status_code Empty_directive() rtems_status_code Empty_directive(void)
{ {
return( RTEMS_SUCCESSFUL ); return( RTEMS_SUCCESSFUL );
} }