Back to home page

LXR

 
 

    


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

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002 
0003 /*  Task_1_through_3
0004  *
0005  *  This routine serves as a test task.  It verifies the basic task
0006  *  switching capabilities of the executive.
0007  *
0008  *  Input parameters:
0009  *    argument - task argument
0010  *
0011  *  Output parameters:  NONE
0012  *
0013  *  COPYRIGHT (c) 1989-2009.
0014  *  On-Line Applications Research Corporation (OAR).
0015  *
0016  * Redistribution and use in source and binary forms, with or without
0017  * modification, are permitted provided that the following conditions
0018  * are met:
0019  * 1. Redistributions of source code must retain the above copyright
0020  *    notice, this list of conditions and the following disclaimer.
0021  * 2. Redistributions in binary form must reproduce the above copyright
0022  *    notice, this list of conditions and the following disclaimer in the
0023  *    documentation and/or other materials provided with the distribution.
0024  *
0025  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0026  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0027  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0028  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0029  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0030  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0031  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0032  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0033  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0034  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0035  * POSSIBILITY OF SUCH DAMAGE.
0036  */
0037 
0038 #ifdef HAVE_CONFIG_H
0039 #include "config.h"
0040 #endif
0041 
0042 #include "system.h"
0043 
0044 void Test_init_routine( void );
0045 
0046 void Test_init_routine( void )
0047 {
0048   puts( "Test_init_routine: invoked" );
0049 }
0050 
0051 
0052 void *Task_1_through_3(
0053   void *argument
0054 )
0055 {
0056   int            status;
0057 
0058   puts( "Task_1: sched_yield to Init" );
0059   status = sched_yield();
0060   rtems_test_assert( !status );
0061 
0062     /* switch to Task_1 */
0063 
0064   /* now do some real testing */
0065 
0066   empty_line();
0067 
0068   /* get id of this thread */
0069 
0070   Task_id = pthread_self();
0071   printf( "Task_1: ID is 0x%08" PRIxpthread_t "\n", Task_id );
0072 
0073   /* exercise pthread_equal */
0074 
0075   status = pthread_equal( Task_id, Task_id );
0076   if ( status )
0077     puts( "Task_1: pthread_equal - match case passed" );
0078   rtems_test_assert( status );
0079 
0080   status = pthread_equal( Init_id, Task_id );
0081   if ( !status )
0082     puts( "Task_1: pthread_equal - different case passed" );
0083   rtems_test_assert( !status );
0084 
0085   puts( "Task_1: pthread_equal - first id bad" );
0086   status = pthread_equal( (pthread_t) -1, Task_id );
0087   rtems_test_assert( !status );
0088 
0089   puts( "Task_1: pthread_equal - second id bad" );
0090   status = pthread_equal( Init_id, (pthread_t) -1 );
0091   rtems_test_assert( !status );
0092 
0093   TEST_END();
0094   rtems_test_exit( 0 );
0095 
0096   return NULL; /* just so the compiler thinks we returned something */
0097 }