Back to home page

LXR

 
 

    


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

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002 
0003 /**
0004  *  @file
0005  *
0006  *  Task_1
0007  *
0008  *  This routine serves as a test task.  It verifies the basic task
0009  *  switching capabilities of the executive.
0010  */
0011 
0012 /*
0013  *  COPYRIGHT (c) 1989-2012.
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 #include <time.h>
0044 #include <sched.h>
0045 
0046 /* forward declarations to avoid warnings */
0047 void diff_timespec(
0048   struct timespec *start,
0049   struct timespec *stop,
0050   struct timespec *result
0051 );
0052 
0053 void diff_timespec(
0054   struct timespec *start,
0055   struct timespec *stop,
0056   struct timespec *result
0057 )
0058 {
0059    const long nsecs_per_sec = 1000000000;
0060 
0061    result->tv_sec = stop->tv_sec - start->tv_sec;
0062    if ( stop->tv_nsec < start->tv_nsec ) {
0063       result->tv_nsec = nsecs_per_sec - start->tv_nsec + stop->tv_nsec;
0064       result->tv_sec--;
0065    } else
0066       result->tv_nsec = stop->tv_nsec - start->tv_nsec;
0067 
0068 }
0069 
0070 void *Task_1(
0071   void *argument
0072 )
0073 {
0074   int status;
0075   struct timespec start;
0076   struct timespec current;
0077   struct timespec difference;
0078   struct timespec delay;
0079 
0080   status = clock_gettime( CLOCK_REALTIME, &start );
0081   rtems_test_assert( !status );
0082 
0083   status = sched_rr_get_interval( getpid(), &delay );
0084   rtems_test_assert( !status );
0085 
0086   /* double the rr interval for confidence */
0087 
0088   delay.tv_sec *= 2;
0089   delay.tv_nsec *= 2;
0090   if ( delay.tv_nsec >= 1000000000 ) {   /* handle overflow/carry */
0091     delay.tv_nsec -= 1000000000;
0092     delay.tv_sec++;
0093   }
0094 
0095 
0096   puts( "Task_1: killing time" );
0097   for ( ; ; ) {
0098 
0099     status = clock_gettime( CLOCK_REALTIME, &current );
0100     rtems_test_assert( !status );
0101 
0102     diff_timespec( &start, &current, &difference );
0103 
0104     if ( difference.tv_sec < delay.tv_sec )
0105       continue;
0106 
0107     if ( difference.tv_sec > delay.tv_sec )
0108       break;
0109 
0110     if ( difference.tv_nsec > delay.tv_nsec )
0111       break;
0112 
0113   }
0114 
0115   puts( "Task_1: exitting" );
0116   pthread_exit( NULL );
0117 
0118   return NULL; /* just so the compiler thinks we returned something */
0119 }