------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 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-2020, 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 AUTHORS.txt and SPONSORS.txt
--
-- 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 Tasks; 				use Tasks;
with Tasks.Extended; 			use Tasks.Extended;
with Integer_Arrays; 			use Integer_Arrays;
with Priority_Assignment.Utility; 	use Priority_Assignment.Utility;
with Cache_Set; 			use Cache_Set;
with Cache_Block_Set;			use Cache_Block_Set;
with Cache_Access_Profile_Set;		use Cache_Access_Profile_Set;

package Priority_Assignment.Audsley_OPA_CRPD is

   procedure Check_Input_Data
     (my_tasks : in Tasks_Set;
      my_cache_access_profiles : in Cache_Access_Profiles_Set);

   type CRPD_Inteference_Computation_Complexity is (ECB_Only,
                                                    PT_Simplified,
                                                    PT_Binomial_Coefficient,
                                                    Tree);
   --------------------------------
   --Perform the Audsley's optimal priority assignment with CRPD taken into account
   --Return the task set with assigned task priorities
   --------------------------------

   -- High level call to Audsley OPA CRPD
   --
   procedure Set_Priority_According_To_CPA
     (My_Tasks       		: in out Tasks_Set;
      My_Cache_Access_Profiles 	: in Cache_Access_Profiles_Set;
      Computation_Complexity    : in CRPD_Inteference_Computation_Complexity := PT_Simplified;
      Processor_Name  		: in Unbounded_String := empty_string);

   -- Lower level call to Audsley OPA CRPD
   -- Perform computation and assign priorities to task
   --
   procedure CPA
     (my_tasks 			: in out Tasks_Set;
      my_cache_access_profiles 	: in Cache_Access_Profiles_Set;
      complexity		: in CRPD_Inteference_Computation_Complexity := PT_Simplified);


end Priority_Assignment.Audsley_OPA_CRPD;