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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415 | ------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Cheddar is a GNU GPL real-time scheduling analysis tool.
-- This program provides services to automatically check schedulability and
-- other performance criteria of real-time architecture models.
--
-- Copyright (C) 2002-2023, Frank Singhoff, Alain Plantec, Jerome Legrand,
-- Hai Nam Tran, Stephane Rubini
--
-- The Cheddar project was started in 2002 by
-- Frank Singhoff, Lab-STICC UMR CNRS 6285, Universite de Bretagne Occidentale
--
-- Cheddar has been published in the "Agence de Protection des Programmes/France" in 2008.
-- Since 2008, Ellidiss technologies also contributes to the development of
-- Cheddar and provides industrial support.
--
-- The full list of contributors and sponsors can be found in README.md
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program; if not, write to the Free Software
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
--
--
-- Contact : cheddar@listes.univ-brest.fr
--
------------------------------------------------------------------------------
-- Last update :
-- $Rev: 4589 $
-- $Date: 2023-09-29 16:02:19 +0200 (ven., 29 sept. 2023) $
-- $Author: singhoff $
------------------------------------------------------------------------------
------------------------------------------------------------------------------
with Text_IO; use Text_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Strings.Bounded; use Ada.Strings.Bounded;
with unbounded_strings; use unbounded_strings;
with Framework_Config; use Framework_Config;
with Tasks; use Tasks;
with Offsets; use Offsets.Offsets_Table_Package;
with Scheduling_Analysis;
use Scheduling_Analysis.Task_Release_Records_Table_Package;
with Scheduling_Analysis; use Scheduling_Analysis;
with sets;
with priority_assignment; use priority_assignment;
with priority_assignment.utility; use priority_assignment.utility;
with integer_util; use integer_util;
with systems; use systems;
with cache_set; use cache_set;
with priority_assignment.audsley_opa_crpd_pt;
use priority_assignment.audsley_opa_crpd_pt;
with priority_assignment.audsley_opa_crpd_tree;
use priority_assignment.audsley_opa_crpd_tree;
with Caches; use Caches;
with debug; use debug;
package body priority_assignment.audsley_opa is
procedure check_input_data (my_tasks : in tasks_set) is
a_task : generic_task_ptr;
my_iterator : tasks_iterator;
begin
reset_iterator (my_tasks, my_iterator);
loop
current_element (my_tasks, a_task, my_iterator);
if (a_task.task_type /= periodic_type) then
raise task_must_be_periodic;
end if;
-- TODO: check START_TIME
-- if(a_task.offsets.Nb_Entries <= 0) then
-- raise Offset_Must_Be_Defined;
-- end if;
exit when is_last_element (my_tasks, my_iterator);
next_element (my_tasks, my_iterator);
end loop;
end check_input_data;
procedure remaining_interference
(t_start : in Integer;
t : in Integer;
l_tti_i : in Integer;
a_task : in out generic_task_ptr;
my_tasks : in out tasks_set;
r_t_i : out Integer)
is
time : Integer := 0;
t_i : Integer := 0;
d_i : Integer := 0;
t_r : Integer := 0;
c : Integer := 0;
beta_set : task_release_records_table;
begin
t_i := periodic_task_ptr (a_task).period;
d_i := a_task.deadline;
-----------------------------------------
time := t - t_i + d_i;
r_t_i := l_tti_i;
-----------------------------------------
initialize (beta_set);
calculate_task_release_records_table
(t_start => t_start,
t_end => t,
a_task => a_task,
my_tasks => my_tasks,
a_task_release_records_table => beta_set);
-----------------------------------------
for i in 0 .. beta_set.nb_entries - 1 loop
c := beta_set.entries (i).capacity;
t_r := beta_set.entries (i).release_time;
if (t_r > time + r_t_i) then
r_t_i := 0;
end if;
if (t_r > time and r_t_i /= 0) then
r_t_i := r_t_i + c - (t_r - time);
else
r_t_i := r_t_i + c;
end if;
time := t_r;
end loop;
-----------------------------------------
r_t_i := r_t_i - (t - t_r);
if (r_t_i < 0) then
r_t_i := 0;
end if;
end remaining_interference;
procedure created_interference
(t : in Integer;
r_t_i : in Integer;
a_task : in out generic_task_ptr;
my_tasks : in out tasks_set;
k_t_i : out Integer;
l_tti_i : out Integer)
is
t_i : Integer := 0;
d_i : Integer := 0;
t_r : Integer := 0;
c : Integer := 0;
next_free : Integer;
total_created : Integer;
eta_set : task_release_records_table;
begin
t_i := periodic_task_ptr (a_task).period;
d_i := a_task.deadline;
-----------------------------------------
next_free := r_t_i + t;
k_t_i := 0;
total_created := r_t_i;
-----------------------------------------
initialize (eta_set);
calculate_task_release_records_table
(t_start => t,
t_end => t + d_i,
a_task => a_task,
my_tasks => my_tasks,
a_task_release_records_table => eta_set);
-----------------------------------------
for i in 0 .. eta_set.nb_entries - 1 loop
c := eta_set.entries (i).capacity;
t_r := eta_set.entries (i).release_time;
total_created := total_created + c;
if (next_free < t_r) then
next_free := t_r;
end if;
k_t_i := k_t_i + Integer'min (t + d_i - next_free, c);
next_free := Integer'min (next_free + c, t + d_i);
end loop;
--This is an implementation which was not explained in the paper
--In the next release, the remaining interference will be computed
--with the time variable start from: time := t - T_i + D_i;
--so, we substract the Integer'Max(D_i, R_t_i);
l_tti_i := total_created - k_t_i - Integer'max (d_i, r_t_i);
if (l_tti_i < 0) then
l_tti_i := 0;
end if;
end created_interference;
procedure opa_feasibility_test
(priority_level : in Integer;
i_task : in out generic_task_ptr;
my_tasks : in out tasks_set;
is_schedulable : out Boolean)
is
my_iterator_2 : tasks_iterator;
j_task : generic_task_ptr;
t : Integer;
refined_tasks : tasks_set;
r_t_i : Integer := 0;
k_t_i : Integer := 0;
c_i : Integer;
t_i : Integer;
d_i : Integer;
s_i : Integer;
p_i : Integer;
o_max : Integer := 0;
l_tti_i : Integer := 0;
t_start : Integer := 0;
begin
refine_offset
(a_task => i_task,
my_tasks => my_tasks,
refined_tasks => refined_tasks);
--Assign priority to tasks, the checking task has lowest priority level.
--Also find the O_max
i_task.priority := priority_range (priority_level);
reset_iterator (refined_tasks, my_iterator_2);
loop
current_element (refined_tasks, j_task, my_iterator_2);
if (j_task.name /= i_task.name) then
j_task.priority := priority_range'last;
else
j_task.priority := priority_range (priority_level);
end if;
if (j_task.start_time > o_max) then
o_max := Integer (j_task.start_time);
end if;
exit when is_last_element (refined_tasks, my_iterator_2);
next_element (refined_tasks, my_iterator_2);
end loop;
------------------------------------------------------------------------
is_schedulable := True;
c_i := i_task.capacity;
t_i := periodic_task_ptr (i_task).period;
d_i := i_task.deadline;
s_i := Integer (Float'ceiling (Float (o_max) / Float (t_i))) * (t_i);
p_i :=
calculate_pi
(priority_level => priority_level,
my_tasks => refined_tasks);
t := s_i;
while (t < s_i + p_i) loop
r_t_i := 0;
k_t_i := 0;
remaining_interference
(t_start => t_start,
t => t,
l_tti_i => l_tti_i,
a_task => i_task,
my_tasks => refined_tasks,
r_t_i => r_t_i);
created_interference
(t => t,
r_t_i => r_t_i,
a_task => i_task,
my_tasks => refined_tasks,
k_t_i => k_t_i,
l_tti_i => l_tti_i);
put_debug
("Remaining I:" &
r_t_i'img &
" - Created I:" &
k_t_i'img &
" - Capacity:" &
i_task.capacity'img &
" - Deadline:" &
i_task.deadline'img &
" - P_i:" &
p_i'img);
if (c_i + r_t_i + k_t_i > d_i) then
put_debug
(To_String (i_task.name) &
" Unschedulable with priority level: " &
priority_level'img);
is_schedulable := False;
exit;
end if;
t_start := t;
t := t + t_i;
end loop;
end opa_feasibility_test;
procedure opa (my_tasks : in out tasks_set) is
delta_set : tasks_set;
my_iterator : tasks_iterator;
a_task : generic_task_ptr;
temp_task : generic_task_ptr;
n : Integer := 1;
unassigned : Boolean;
is_schedulable : Boolean;
begin
duplicate (src => my_tasks, dest => delta_set);
n := Integer (delta_set.get_number_of_elements);
for j in 1 .. n loop
unassigned := True;
sort (delta_set, decreasing_period_deadline'access);
reset_iterator (delta_set, my_iterator);
loop
current_element (delta_set, a_task, my_iterator);
opa_feasibility_test
(priority_level => j,
i_task => a_task,
my_tasks => delta_set,
is_schedulable => is_schedulable);
if (is_schedulable) then
put_debug
("Assign priority level:" &
j'img &
" to task: " &
To_String (a_task.name) &
ASCII.LF &
"---");
delete (delta_set, a_task);
temp_task :=
search_task (my_tasks => my_tasks, name => a_task.name);
temp_task.priority := priority_range (j);
unassigned := False;
exit;
end if;
exit when is_last_element (delta_set, my_iterator);
next_element (delta_set, my_iterator);
end loop;
if (unassigned) then
raise no_feasible_priority_assignment_exception;
end if;
end loop;
end opa;
---------------------------------------
--
---------------------------------------
procedure set_priority_according_to_audsley_opa
(my_tasks : in out tasks_set;
processor_name : in Unbounded_String := empty_string)
is
iterator1 : tasks_iterator;
task1 : generic_task_ptr;
iterator2 : tasks_iterator;
task2 : generic_task_ptr;
current_prio : priority_range := 1;
tmp : tasks_set;
begin
if processor_name = empty_string then
duplicate (my_tasks, tmp);
else
current_processor_name := processor_name;
select_and_copy (my_tasks, tmp, select_cpu'access);
end if;
periodic_control (tmp, processor_name);
check_input_data (tmp);
-- Assign priorities
--
opa (tmp);
-- Copy resulting task objects in My_Tasks
--
reset_iterator (tmp, iterator1);
loop
current_element (tmp, task1, iterator1);
reset_iterator (my_tasks, iterator2);
loop
current_element (my_tasks, task2, iterator2);
if (task2.name = task1.name) then
task2.priority := task1.priority;
end if;
exit when task2.name = task1.name;
exit when is_last_element (my_tasks, iterator2);
next_element (my_tasks, iterator2);
end loop;
exit when is_last_element (tmp, iterator1);
next_element (tmp, iterator1);
end loop;
free (tmp);
end set_priority_according_to_audsley_opa;
end priority_assignment.audsley_opa;
|