------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- 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 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 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 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_r2 is

   procedure compute_less_equal
     (my_tasks       : in     tasks_set;
      processor_name : in     Unbounded_String;
      current_task   : in     generic_task_ptr;
      value_w_i      :    out my_array;
      q              :    out Integer)
   is
      my_iterator : tasks_iterator;
      taski       : generic_task_ptr;
      rightvalue  : Double;
      leftvalue   : Double;
      k           : Integer := 0;
   begin
      reset_iterator (my_tasks, my_iterator);
      current_element (my_tasks, taski, my_iterator);
      rightvalue    := 0.0;
      leftvalue     := 0.0;
      value_w_i (0) := 1.0;
      while (value_w_i (k) >= rightvalue) loop
         leftvalue  := Double (w_i (my_tasks, Double (k), taski));
         rightvalue :=
           Double (periodic_task_ptr (taski).period) *
           Double (1.0 + Double (k));
         value_w_i (k) := leftvalue;
         k             := k + 1;
      end loop;
      q := k;
   end compute_less_equal;

   function w_i
     (my_tasks     : in tasks_set;
      q            : in Double;
      current_task : in generic_task_ptr) return Double
   is
      iterator     : tasks_iterator;
      taski, taskj : generic_task_ptr;
      calcul, tmp  : Double;
   begin
      calcul := 0.0;
      tmp    := -0.1;
      current_element (my_tasks, taski, iterator);
      while (tmp /= calcul) loop
         reset_iterator (my_tasks, iterator);
         tmp    := calcul;
         calcul := (Double (current_task.capacity)) * (1.0 + q);
         loop
            current_element (my_tasks, taskj, iterator);
            if (taskj.priority > current_task.priority) then
               calcul :=
                 calcul +
                 Double
                   ((Double (taskj.capacity)) *
                    (Double'ceiling
                       ((Double (periodic_task_ptr (taskj).jitter) + tmp) /
                        (Double (periodic_task_ptr (taskj).period)))));
            end if;
            exit when is_last_element (my_tasks, iterator);
            next_element (my_tasks, iterator);
         end loop;
      end loop;
      return calcul;
   end w_i;

   function max_r_i
     (my_tasks     : in tasks_set;
      w_i          : in my_array;
      nb_value_w_i : in Integer;
      current_task : in generic_task_ptr) return Double
   is
      my_iterator : tasks_iterator;
      taski       : generic_task_ptr;
      q           : Integer;
      calcul, max : Double;
   begin
      calcul := 0.0;
      current_element (my_tasks, taski, my_iterator);
      max := 0.0;
      for q in 0 .. nb_value_w_i loop
         calcul :=
           Double (periodic_task_ptr (taski).jitter) +
           Double (periodic_task_ptr (taski).blocking_time) +
           w_i (q) -
           Double (q) * Double (periodic_task_ptr (taski).period);
         if calcul > max then
            max := calcul;
         end if;
      end loop;
      return max;
   end max_r_i;

end feasibility_test.generated_r2;