------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 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 6285, Université 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 Text_IO;             use Text_IO;
with Translate;           use Translate;
with unbounded_strings;   use unbounded_strings;
with Scheduler;           use Scheduler;
with Scheduling_Analysis; use Scheduling_Analysis;
use Scheduling_Analysis.Double_Tasks_Parameters_Package;
with Tasks;                             use Tasks;
use Tasks.Generic_Task_List_Package;
with Task_Set;                          use Task_Set;
with Offsets;               use Offsets;
with Offsets.extended;      use Offsets.extended;
with Task_Dependencies;   use Task_Dependencies;
with Dependencies;        use Dependencies;

package body Feasibility_Test.generated_C2 is

  function Processor_Utilization_Over_Period_C2
        (My_Tasks       : in Tasks_Set;
      Processor_Name : in Unbounded_String)
      return           Double
      is
          Taski    : Generic_Task_Ptr;
          My_Iterator : Tasks_Iterator;
          calcul : Double := 0.0;
      begin
          Periodic_Control (My_Tasks, Processor_Name);
          reset_iterator (My_Tasks, My_Iterator);
	         loop
	                 current_element (My_Tasks, Taski, My_Iterator); 
		         if (Taski.task_type /= Aperiodic_Type) then
	                    calcul := calcul + (Double(Taski.capacity)/Double(Periodic_Task_Ptr(Taski).period));
			 end if; 
			 exit when  is_last_element (My_Tasks, My_Iterator); 
		         next_element (My_Tasks, My_Iterator);
		  end loop; 
      return calcul;
 end Processor_Utilization_Over_Period_C2;
 function compute_less_C2 
         (My_Tasks       : in Tasks_Set;
          Processor_Name : in Unbounded_String)
          return boolean
          is
          rightvalue, leftvalue : Double;
          begin 
   leftvalue := Processor_Utilization_Over_Period_C2(My_Tasks,To_Unbounded_String("CPU_A"));						 
          rightvalue :=1.0;
          if leftvalue <  rightvalue then
               return True;
          else return False;
          end if;
end compute_less_C2;
end Feasibility_Test.generated_C2;