------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- 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$ -- $Date$ -- $Author: singhoff $ ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Text_IO; use Text_IO; with unbounded_strings; use unbounded_strings; with Scheduling_Analysis; use Scheduling_Analysis; with priority_assignment.audsley_opa; use priority_assignment.audsley_opa; with task_set; use task_set; with Doubles; use Doubles; with Tasks; use Tasks; with Tasks.extended; use Tasks.extended; with priority_assignment.utility; use priority_assignment.utility; with cache_set; use cache_set; with CFG_Nodes.extended; use CFG_Nodes.extended; package priority_assignment.audsley_opa_crpd_tree is optimize_memory : Boolean := True; optimize_nodes : Boolean := True; crpd_computation : Boolean := True; -------------------------------- -- Perform feasibilitty testing with CRPD Interference computed by Tree solution -- -------------------------------- procedure opa_feasibility_test_crpd (priority_level : in Integer; number_of_task : in Integer; i_task : in out generic_task_ptr; my_tasks : in out tasks_set; a_tuea : in task_ucb_ecb_array_ptr; is_schedulable : out Boolean); type task_activation_type is (preemption, deny_preemption, no_executing_job); --------------------------------------- -- --------------------------------------- procedure compute_crpd_tree (tdi : in Integer; number_of_task : in Integer; state : in Boolean := True; index : in task_release_records_range; -- IMPORTANT: index = a_node.index + 1; assessing_job_index : in task_release_records_range; counter : in out Integer; a_node : in out crpd_node_ptr; time : in Integer; -- Release time of the job with index: index-1 is_schedulable : in out Boolean); -- Release time of the job with index: index-1); -- Release time of the job with index: index --------------------------------------- -- --------------------------------------- procedure assess_release_set (a_trrt : in out task_release_records_table_ptr; tdi : in Integer; number_of_task : in Integer := 0; assessing_job_index : in task_release_records_range; is_schedulable : in out Boolean); end priority_assignment.audsley_opa_crpd_tree;