------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- This source file was automatically generated by Platypus -- see http://dossen.univ-brest.fr/apl -- -- Any modification of this file will be lost. -- Please see the "platypus" directory instead : it contains the Cheddar's -- model and its meta-model. ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- Cheddar is a free real time scheduling tool. -- This program provides services to automatically check temporal constraints -- of real time tasks. -- -- Copyright (C) 2002-2014 Frank Singhoff -- Cheddar is developed by the LAB-STICC Team, University of Brest -- -- 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 -- To post to this mailing list, you must be subscribed -- (see http//beru.univ-brest.fr/~singhoff/cheddar for details) -- ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Framework_Config; use Framework_Config; with id_generators; use id_generators; with Objects; use Objects; with Convert_Strings; with Convert_Unbounded_Strings; with text_io; use text_io; Package Partitioning_Algorithms is type Processor_Sort_Type is ( Processor_Index, Processor_Utilization); procedure To_Processor_Sort_Type is new Convert_Strings(Processor_Sort_Type, Processor_Index); procedure To_Processor_Sort_Type is new Convert_Unbounded_Strings(Processor_Sort_Type, Processor_Index); function XML_String (obj : in Processor_Sort_Type) return Unbounded_String; function XML_Ref_String (obj : in Processor_Sort_Type) return Unbounded_String; package Processor_Sort_Type_io is new text_io.enumeration_io(Processor_Sort_Type); use Processor_Sort_Type_io; type Task_Sort_Type is ( Task_Period, Task_Deadline); procedure To_Task_Sort_Type is new Convert_Strings(Task_Sort_Type, Task_Period); procedure To_Task_Sort_Type is new Convert_Unbounded_Strings(Task_Sort_Type, Task_Period); function XML_String (obj : in Task_Sort_Type) return Unbounded_String; function XML_Ref_String (obj : in Task_Sort_Type) return Unbounded_String; package Task_Sort_Type_io is new text_io.enumeration_io(Task_Sort_Type); use Task_Sort_Type_io; type Feasibility_Test_Type is ( Condition_IP_Test, Utilization_Test); procedure To_Feasibility_Test_Type is new Convert_Strings(Feasibility_Test_Type, Condition_IP_Test); procedure To_Feasibility_Test_Type is new Convert_Unbounded_Strings(Feasibility_Test_Type, Condition_IP_Test); function XML_String (obj : in Feasibility_Test_Type) return Unbounded_String; function XML_Ref_String (obj : in Feasibility_Test_Type) return Unbounded_String; package Feasibility_Test_Type_io is new text_io.enumeration_io(Feasibility_Test_Type); use Feasibility_Test_Type_io; type Loop_Operation_Type is ( RMFF_loop, RMBF_loop, RMNF_loop); procedure To_Loop_Operation_Type is new Convert_Strings(Loop_Operation_Type, RMFF_loop); procedure To_Loop_Operation_Type is new Convert_Unbounded_Strings(Loop_Operation_Type, RMFF_loop); function XML_String (obj : in Loop_Operation_Type) return Unbounded_String; function XML_Ref_String (obj : in Loop_Operation_Type) return Unbounded_String; package Loop_Operation_Type_io is new text_io.enumeration_io(Loop_Operation_Type); use Loop_Operation_Type_io; End Partitioning_Algorithms;