1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
/* SPDX-License-Identifier: BSD-2-Clause */
/**
* @file
*
* Task_1
*
* This routine serves as a test task. It verifies the basic task
* switching capabilities of the executive.
*/
/*
* COPYRIGHT (c) 1989-2012.
* 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.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "system.h"
#include <time.h>
#include <sched.h>
/* forward declarations to avoid warnings */
void diff_timespec(
struct timespec *start,
struct timespec *stop,
struct timespec *result
);
void diff_timespec(
struct timespec *start,
struct timespec *stop,
struct timespec *result
)
{
const long nsecs_per_sec = 1000000000;
result->tv_sec = stop->tv_sec - start->tv_sec;
if ( stop->tv_nsec < start->tv_nsec ) {
result->tv_nsec = nsecs_per_sec - start->tv_nsec + stop->tv_nsec;
result->tv_sec--;
} else
result->tv_nsec = stop->tv_nsec - start->tv_nsec;
}
void *Task_1(
void *argument
)
{
int status;
struct timespec start;
struct timespec current;
struct timespec difference;
struct timespec delay;
status = clock_gettime( CLOCK_REALTIME, &start );
rtems_test_assert( !status );
status = sched_rr_get_interval( getpid(), &delay );
rtems_test_assert( !status );
/* double the rr interval for confidence */
delay.tv_sec *= 2;
delay.tv_nsec *= 2;
if ( delay.tv_nsec >= 1000000000 ) { /* handle overflow/carry */
delay.tv_nsec -= 1000000000;
delay.tv_sec++;
}
puts( "Task_1: killing time" );
for ( ; ; ) {
status = clock_gettime( CLOCK_REALTIME, ¤t );
rtems_test_assert( !status );
diff_timespec( &start, ¤t, &difference );
if ( difference.tv_sec < delay.tv_sec )
continue;
if ( difference.tv_sec > delay.tv_sec )
break;
if ( difference.tv_nsec > delay.tv_nsec )
break;
}
puts( "Task_1: exitting" );
pthread_exit( NULL );
return NULL; /* just so the compiler thinks we returned something */
}
|
