------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- Cheddar is a GNU GPL real time scheduling analysis tool. -- This program provides services to automatically check performances -- of real time architectures. -- -- Copyright (C) 2002-2010, by Frank Singhoff, Alain Plantec, Jerome Legrand -- -- The Cheddar project was started in 2002 by -- the LISyC Team, University of Western Britanny. -- -- Since 2008, Ellidiss technologies also contributes to the development of -- Cheddar and provides industrial support. -- -- 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: 523 $ -- $Date: 2012-09-26 15:09:39 +0200 (Wed, 26 Sep 2012) $ -- $Author: fotsing $ ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ with unbounded_strings; use unbounded_strings; with Ada.Exceptions; use Ada.Exceptions; with Translate; use Translate; with initialize_framework; use initialize_framework; package body Network_Set is procedure Check_network (My_networks : in Networks_Set; Name : in Unbounded_String; Network_Type : in Networks_Type) is begin if Name = "" then Raise_Exception (Invalid_Parameter'Identity, To_String (Lb_Network (Current_Language) & " " & Name & " : " & Lb_Networks_Name (Current_Language) & Lb_Mandatory (Current_Language))); end if; end Check_network; procedure Add_Network (My_Networks : in out Networks_Set; Name : in Unbounded_String; Network_Type : in Networks_Type) is My_Iterator : iterator; A_Network : Network_Ptr; begin check_initialize; Check_network (My_Networks, Name, Network_Type); if (get_number_of_elements (My_Networks) > 0) then reset_iterator (My_Networks, My_Iterator); loop current_element (My_Networks, A_Network, My_Iterator); if (Name = A_Network.name) then raise Network_Already_Defined; end if; exit when is_last_element (My_Networks, My_Iterator); next_element (My_Networks, My_Iterator); end loop; end if; A_Network := new Network; A_Network.name := Name; A_Network.network_type := Network_Type; add (My_Networks, A_Network); exception when Generic_Network_Set.full_set => Raise_Exception (Invalid_Parameter'Identity, To_String (Lb_Can_Not_Define_More_Networks (Current_Language))); end Add_Network; procedure Update_Network (My_Networks : in out Networks_Set; Name : in Unbounded_String; Network_Type : in Networks_Type) is A_Network : Network_Ptr; begin A_Network := Search_Network (My_Networks, Name); delete (My_Networks, A_Network); Add_Network (My_Networks, Name, Network_Type); end Update_Network; function Search_Network (My_Networks : in Networks_Set; Name : in Unbounded_String) return Network_Ptr is My_Iterator : iterator; A_Network : Network_Ptr; Result : Network_Ptr; Found : Boolean := False; begin reset_iterator (My_Networks, My_Iterator); loop current_element (My_Networks, A_Network, My_Iterator); if (A_Network.name = Name) then Found := True; Result := A_Network; end if; exit when is_last_element (My_Networks, My_Iterator); next_element (My_Networks, My_Iterator); end loop; if not Found then raise Network_Not_Found; end if; return Result; end Search_Network; function Export_Xml (My_Networks : in Networks_Set) return Unbounded_String is My_Iterator : Network_Iterator; A_Network : Network_Ptr; Result : Unbounded_String := empty_string; begin if not is_empty (My_Networks) then Result := Result & To_Unbounded_String ("") & unbounded_lf; reset_iterator (My_Networks, My_Iterator); loop current_element (My_Networks, A_Network, My_Iterator); Result := Result & To_Unbounded_String (ASCII.HT & "") & unbounded_lf; Result := Result & To_Unbounded_String (ASCII.HT & ASCII.HT & "" & To_String (A_Network.name) & "") & unbounded_lf; Result := Result & To_Unbounded_String (ASCII.HT & ASCII.HT & "" & A_Network.network_type'Img & "") & unbounded_lf; Result := Result & To_Unbounded_String (ASCII.HT & "") & unbounded_lf; exit when is_last_element (My_Networks, My_Iterator); next_element (My_Networks, My_Iterator); end loop; Result := Result & To_Unbounded_String ("") & unbounded_lf; end if; return Result; end Export_Xml; function Export_Aadl_Implementations (My_Networks : in Networks_Set) return Unbounded_String is My_Iterator : iterator; A_Network : Network_Ptr; Result : Unbounded_String := empty_string; begin if not is_empty (My_Networks) then reset_iterator (My_Networks, My_Iterator); loop current_element (My_Networks, A_Network, My_Iterator); exit when is_last_element (My_Networks, My_Iterator); Result := Result & To_Unbounded_String ("bus " & To_String (A_Network.name)); Result := Result & To_Unbounded_String ("end " & To_String (A_Network.name) & ";"); Result := Result & To_Unbounded_String ("bus implementation " & To_String (A_Network.name) & ".Impl"); Result := Result & To_Unbounded_String ("end " & To_String (A_Network.name) & ".Impl"); next_element (My_Networks, My_Iterator); end loop; end if; return Result; end Export_Aadl_Implementations; function Export_Aadl_Declarations (My_Networks : in Networks_Set; Number_Of_Ht : in Natural) return Unbounded_String is My_Iterator : iterator; A_Network : Network_Ptr; Result : Unbounded_String := empty_string; begin if not is_empty (My_Networks) then reset_iterator (My_Networks, My_Iterator); loop current_element (My_Networks, A_Network, My_Iterator); exit when is_last_element (My_Networks, My_Iterator); for I in 1 .. Number_Of_Ht loop Result := Result & ASCII.HT; end loop; Result := Result & To_Unbounded_String ("instancied_" & To_String (A_Network.name) & " : bus " & To_String (A_Network.name) & ".Impl;"); next_element (My_Networks, My_Iterator); end loop; end if; return Result; end Export_Aadl_Declarations; procedure Delete_network (My_networks : in out Networks_Set; A_network_name : in Unbounded_String) is Tmp : Networks_Set; A_Network : Network_Ptr; My_Iterator : Network_Iterator; begin if (get_number_of_elements (My_networks) > 0) then reset_iterator (My_networks, My_Iterator); loop current_element (My_networks, A_Network, My_Iterator); if (A_Network.name = A_network_name) then add (Tmp, A_Network); end if; exit when is_last_element (My_networks, My_Iterator); next_element (My_networks, My_Iterator); end loop; if not is_empty (Tmp) then reset_iterator (My_networks, My_Iterator); loop current_element (Tmp, A_Network, My_Iterator); delete (My_networks, A_Network); exit when is_last_element (Tmp, My_Iterator); next_element (Tmp, My_Iterator); end loop; reset (Tmp, False); end if; end if; end Delete_network; -- end Network_Set;