------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- 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-2016, Frank Singhoff, Alain Plantec, Jerome Legrand -- -- The Cheddar project was started in 2002 by -- Frank Singhoff, Lab-STICC UMR 6285 laboratory, 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: 1249 $ -- $Date: 2014-08-28 07:02:15 +0200 (Fri, 28 Aug 2014) $ -- $Author: singhoff $ ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ with Text_IO; use Text_IO; package body indexed_tables is procedure initialize (a_table : out indexed_table) is begin a_table.nb_entries := 0; for i in indexed_table_range loop initialize (a_table.entries (i).data); end loop; end initialize; procedure put (a_item : in item) is begin put (a_item.item); Put ("/"); put (a_item.data); New_Line; end put; procedure put (a_table : in indexed_table_ptr) is begin put (a_table.all); end put; procedure put (a_table : in indexed_table) is begin Put_Line (" Nb entries : " & a_table.nb_entries'Img); for i in first_range .. first_range + a_table.nb_entries - 1 loop put (a_table.entries (i)); end loop; end put; procedure delete (a_table : in out indexed_table; a_item : indexed_table_range) is begin a_table.entries (a_item) := a_table.entries (a_table.nb_entries - 1); a_table.nb_entries := a_table.nb_entries - 1; end delete; -- Produce XML for all elements of a list -- function xml_ref_string (obj : in indexed_table_ptr) return Unbounded_String is begin return xml_ref_string (obj.all); end xml_ref_string; function xml_string (obj : in indexed_table_ptr) return Unbounded_String is begin return xml_string (obj.all); end xml_string; function xml_string (obj : in indexed_table) return Unbounded_String is result : Unbounded_String := To_Unbounded_String (""); begin for i in first_range .. first_range + obj.nb_entries - 1 loop result := result & To_Unbounded_String ("<") & xml_tag & To_Unbounded_String ("> ") & to_string (obj.entries (i).item) & To_Unbounded_String (" "); result := result & xml_string (obj.entries (i).data); end loop; return result; end xml_string; function xml_ref_string (obj : in indexed_table) return Unbounded_String is result : Unbounded_String := To_Unbounded_String (""); begin for i in first_range .. first_range + obj.nb_entries - 1 loop result := result & xml_ref_string (obj.entries (i).data); end loop; return result; end xml_ref_string; procedure add (a_table : in out indexed_table; a_index : index; a_element : element) is begin if a_table.nb_entries > indexed_table_range'Last - 1 then raise indexed_table_full; end if; a_table.entries (a_table.nb_entries).item := a_index; a_table.entries (a_table.nb_entries).data := a_element; a_table.nb_entries := a_table.nb_entries + 1; end add; end indexed_tables;