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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
/* SPDX-License-Identifier: BSD-2-Clause */
/* Task_1_through_6
*
* This routine serves as a test task for the EDF scheduling
*
* Input parameters:
* argument - task argument
*
* Output parameters: NONE
*
* COPYRIGHT (c) 1989-1999.
* 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 <rtems/score/watchdogimpl.h>
/*
runtime of TA6 should be shorter than TA5
*/
#define TA6_ITERATIONS 10
#define TA6_PERIOD_FACTOR 10
uint32_t Periods[7] = { 0, 2, 2, 2, 2, 100, 0 };
uint32_t Iterations[7] = { 0, 50, 50, 50, 50, 1, TA6_ITERATIONS };
rtems_task Task_1_through_6(
rtems_task_argument argument
)
{
rtems_id rmid;
rtems_id test_rmid;
int index;
int pass;
uint32_t failed;
rtems_status_code status;
status = rtems_rate_monotonic_create( argument, &rmid );
directive_failed( status, "rtems_rate_monotonic_create" );
put_name( Task_name[ argument ], FALSE );
printf( "- rtems_rate_monotonic_create id = 0x%08" PRIxrtems_id "\n",
rmid );
status = rtems_rate_monotonic_ident( argument, &test_rmid );
directive_failed( status, "rtems_rate_monotonic_ident" );
put_name( Task_name[ argument ], FALSE );
printf( "- rtems_rate_monotonic_ident id = 0x%08" PRIxrtems_id "\n",
test_rmid );
if ( rmid != test_rmid ) {
printf( "RMID's DO NOT MATCH (0x%" PRIxrtems_id " and 0x%" PRIxrtems_id ")\n",
rmid, test_rmid );
rtems_test_exit( 0 );
}
put_name( Task_name[ argument ], FALSE );
printf( "- (0x%08" PRIxrtems_id ") period %" PRIu32 "\n",
rmid, Periods[ argument ] );
status = rtems_task_wake_after( 2 );
directive_failed( status, "rtems_task_wake_after" );
switch ( argument ) {
case 1:
case 2:
case 3:
case 4:
while ( FOREVER ) {
status = rtems_rate_monotonic_period( rmid, Periods[ argument ] );
directive_failed( status, "rtems_rate_monotonic_period" );
Count.count[ argument ]++;
}
break;
case 5:
pass = 0;
failed = 0;
status = rtems_rate_monotonic_period( rmid, Periods[ argument ] );
directive_failed( status, "rtems_rate_monotonic_period 1 of TA5" );
Get_all_counters();
while ( FOREVER ) {
status = rtems_rate_monotonic_period( rmid, Periods[ argument ] );
directive_failed( status, "rtems_rate_monotonic_period 2 of TA5" );
Get_all_counters();
for( index = 1 ; index <= 4 ; index++ ) {
if ( Temporary_count.count[ index ] != Iterations[ index ] ) {
puts_nocr( "FAIL -- " );
put_name ( Task_name[ index ], FALSE );
printf ( " Actual=%" PRIu32 ", Expected=%" PRIu32 "\n",
Temporary_count.count[ index ],
Iterations[ index ]
);
failed += 1;
}
}
if ( failed == 5 )
rtems_test_exit( 0 );
pass += 1;
printf( "TA5 - PERIODS CHECK OK (%d)\n", pass );
fflush( stdout );
if ( pass == 10 ) {
TEST_END();
rtems_test_exit( 0 );
}
}
break;
case 6:
/* test changing periods */
{
uint32_t time[TA6_ITERATIONS+1];
rtems_interval period;
period = 1*TA6_PERIOD_FACTOR;
status = rtems_rate_monotonic_period( rmid, period);
directive_failed( status, "rtems_rate_monotonic_period of TA6" );
time[0] = _Watchdog_Ticks_since_boot; /* timestamp */
/*printf("%d - %d\n", period, time[0]);*/
for (index = 1; index <= TA6_ITERATIONS; index++)
{
period = (index+1)*TA6_PERIOD_FACTOR;
status = rtems_rate_monotonic_period( rmid, period);
directive_failed( status, "rtems_rate_monotonic_period of TA6" );
time[index] = _Watchdog_Ticks_since_boot; /* timestamp */
/*printf("%d - %d\n", period, time[index]);*/
}
for (index = 1; index <= TA6_ITERATIONS; index++)
{
rtems_interval meas = time[index] - time[index-1];
period = index*TA6_PERIOD_FACTOR;
printf( "TA6 - Actual: %" PRIdrtems_interval " Expected: %"
PRIdrtems_interval, meas, period );
if (period == meas) printf(" - OK\n");
else printf(" - FAILED\n");
}
}
rtems_task_suspend(RTEMS_SELF);
break;
}
}
|
