Datasets:
QueenieFi
/
CodeText_dataset

Dataset card Data Studio Files
xet
 Community
1
CombinedText
stringlengths
4
3.42M
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . C A L E N D A R -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1999-2001 Ada Core Technologies, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT 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 distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ package body GNAT.Calendar is use Ada.Calendar; use Interfaces; ----------------- -- Day_In_Year -- ----------------- function Day_In_Year (Date : Time) return Day_In_Year_Number is Year : Year_Number; Month : Month_Number; Day : Day_Number; Dsecs : Day_Duration; begin Split (Date, Year, Month, Day, Dsecs); return Julian_Day (Year, Month, Day) - Julian_Day (Year, 1, 1) + 1; end Day_In_Year; ----------------- -- Day_Of_Week -- ----------------- function Day_Of_Week (Date : Time) return Day_Name is Year : Year_Number; Month : Month_Number; Day : Day_Number; Dsecs : Day_Duration; begin Split (Date, Year, Month, Day, Dsecs); return Day_Name'Val ((Julian_Day (Year, Month, Day)) mod 7); end Day_Of_Week; ---------- -- Hour -- ---------- function Hour (Date : Time) return Hour_Number is Year : Year_Number; Month : Month_Number; Day : Day_Number; Hour : Hour_Number; Minute : Minute_Number; Second : Second_Number; Sub_Second : Second_Duration; begin Split (Date, Year, Month, Day, Hour, Minute, Second, Sub_Second); return Hour; end Hour; ---------------- -- Julian_Day -- ---------------- -- Julian_Day is used to by Day_Of_Week and Day_In_Year. Note -- that this implementation is not expensive. function Julian_Day (Year : Year_Number; Month : Month_Number; Day : Day_Number) return Integer is Internal_Year : Integer; Internal_Month : Integer; Internal_Day : Integer; Julian_Date : Integer; C : Integer; Ya : Integer; begin Internal_Year := Integer (Year); Internal_Month := Integer (Month); Internal_Day := Integer (Day); if Internal_Month > 2 then Internal_Month := Internal_Month - 3; else Internal_Month := Internal_Month + 9; Internal_Year := Internal_Year - 1; end if; C := Internal_Year / 100; Ya := Internal_Year - (100 * C); Julian_Date := (146_097 * C) / 4 + (1_461 * Ya) / 4 + (153 * Internal_Month + 2) / 5 + Internal_Day + 1_721_119; return Julian_Date; end Julian_Day; ------------ -- Minute -- ------------ function Minute (Date : Time) return Minute_Number is Year : Year_Number; Month : Month_Number; Day : Day_Number; Hour : Hour_Number; Minute : Minute_Number; Second : Second_Number; Sub_Second : Second_Duration; begin Split (Date, Year, Month, Day, Hour, Minute, Second, Sub_Second); return Minute; end Minute; ------------ -- Second -- ------------ function Second (Date : Time) return Second_Number is Year : Year_Number; Month : Month_Number; Day : Day_Number; Hour : Hour_Number; Minute : Minute_Number; Second : Second_Number; Sub_Second : Second_Duration; begin Split (Date, Year, Month, Day, Hour, Minute, Second, Sub_Second); return Second; end Second; ----------- -- Split -- ----------- procedure Split (Date : Time; Year : out Year_Number; Month : out Month_Number; Day : out Day_Number; Hour : out Hour_Number; Minute : out Minute_Number; Second : out Second_Number; Sub_Second : out Second_Duration) is Dsecs : Day_Duration; Secs : Natural; begin Split (Date, Year, Month, Day, Dsecs); if Dsecs = 0.0 then Secs := 0; else Secs := Natural (Dsecs - 0.5); end if; Sub_Second := Second_Duration (Dsecs - Day_Duration (Secs)); Hour := Hour_Number (Secs / 3600); Secs := Secs mod 3600; Minute := Minute_Number (Secs / 60); Second := Second_Number (Secs mod 60); end Split; ---------------- -- Sub_Second -- ---------------- function Sub_Second (Date : Time) return Second_Duration is Year : Year_Number; Month : Month_Number; Day : Day_Number; Hour : Hour_Number; Minute : Minute_Number; Second : Second_Number; Sub_Second : Second_Duration; begin Split (Date, Year, Month, Day, Hour, Minute, Second, Sub_Second); return Sub_Second; end Sub_Second; ------------- -- Time_Of -- ------------- function Time_Of (Year : Year_Number; Month : Month_Number; Day : Day_Number; Hour : Hour_Number; Minute : Minute_Number; Second : Second_Number; Sub_Second : Second_Duration := 0.0) return Time is Dsecs : constant Day_Duration := Day_Duration (Hour * 3600 + Minute * 60 + Second) + Sub_Second; begin return Time_Of (Year, Month, Day, Dsecs); end Time_Of; ----------------- -- To_Duration -- ----------------- function To_Duration (T : access timeval) return Duration is procedure timeval_to_duration (T : access timeval; sec : access C.long; usec : access C.long); pragma Import (C, timeval_to_duration, "__gnat_timeval_to_duration"); Micro : constant := 10**6; sec : aliased C.long; usec : aliased C.long; begin timeval_to_duration (T, sec'Access, usec'Access); return Duration (sec) + Duration (usec) / Micro; end To_Duration; ---------------- -- To_Timeval -- ---------------- function To_Timeval (D : Duration) return timeval is procedure duration_to_timeval (Sec, Usec : C.long; T : access timeval); pragma Import (C, duration_to_timeval, "__gnat_duration_to_timeval"); Micro : constant := 10**6; Result : aliased timeval; sec : C.long; usec : C.long; begin if D = 0.0 then sec := 0; usec := 0; else sec := C.long (D - 0.5); usec := C.long ((D - Duration (sec)) * Micro - 0.5); end if; duration_to_timeval (sec, usec, Result'Access); return Result; end To_Timeval; ------------------ -- Week_In_Year -- ------------------ function Week_In_Year (Date : Ada.Calendar.Time) return Week_In_Year_Number is Year : Year_Number; Month : Month_Number; Day : Day_Number; Hour : Hour_Number; Minute : Minute_Number; Second : Second_Number; Sub_Second : Second_Duration; Offset : Natural; begin Split (Date, Year, Month, Day, Hour, Minute, Second, Sub_Second); -- Day offset number for the first week of the year. Offset := Julian_Day (Year, 1, 1) mod 7; return 1 + ((Day_In_Year (Date) - 1) + Offset) / 7; end Week_In_Year; end GNAT.Calendar;
--PRÁCTICA 4: CÉSAR BORAO MORATINOS (Chat_Procedures.ads) with Ada.Text_IO; with Hash_Maps_G; with Ada.Calendar; with Ordered_Maps_G; with Lower_Layer_UDP; with Ada.Command_Line; with Ada.Strings.Unbounded; package Chat_Procedures is package ATI renames Ada.Text_IO; package LLU renames Lower_Layer_UDP; package ACL renames Ada.Command_Line; package ASU renames Ada.Strings.Unbounded; use type ASU.Unbounded_String; type Data is record Client_EP: LLU.End_Point_Type; Time: Ada.Calendar.Time; end record; type Old_Data is record Nick: ASU.Unbounded_String; Time: Ada.Calendar.Time; end record; function Max_Valid (Max_Clients: Natural) return Boolean; procedure Print_Active_Map; procedure Print_Old_Map; procedure Case_Init (I_Buffer: access LLU.Buffer_Type; O_Buffer: access LLU.Buffer_Type); procedure Case_Writer (I_Buffer: access LLU.Buffer_Type; O_Buffer: access LLU.Buffer_Type); procedure Case_Logout (I_Buffer: access LLU.Buffer_Type; O_Buffer: access LLU.Buffer_Type); end Chat_Procedures;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.STRINGS.FIXED.HASH_CASE_INSENSITIVE -- -- -- -- S p e c -- -- -- -- Copyright (C) 2011, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with Ada.Containers; with Ada.Strings.Hash_Case_Insensitive; function Ada.Strings.Fixed.Hash_Case_Insensitive (Key : String) return Containers.Hash_Type renames Ada.Strings.Hash_Case_Insensitive; pragma Pure (Ada.Strings.Fixed.Hash_Case_Insensitive);
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with AMF.Elements; with AMF.Internals.Element_Collections; with AMF.Internals.Helpers; with AMF.Internals.Tables.UML_Attributes; with AMF.Visitors.UML_Iterators; with AMF.Visitors.UML_Visitors; with League.Strings.Internals; with Matreshka.Internals.Strings; package body AMF.Internals.UML_Activity_Parameter_Nodes is ------------------- -- Enter_Element -- ------------------- overriding procedure Enter_Element (Self : not null access constant UML_Activity_Parameter_Node_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Enter_Activity_Parameter_Node (AMF.UML.Activity_Parameter_Nodes.UML_Activity_Parameter_Node_Access (Self), Control); end if; end Enter_Element; ------------------- -- Leave_Element -- ------------------- overriding procedure Leave_Element (Self : not null access constant UML_Activity_Parameter_Node_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then AMF.Visitors.UML_Visitors.UML_Visitor'Class (Visitor).Leave_Activity_Parameter_Node (AMF.UML.Activity_Parameter_Nodes.UML_Activity_Parameter_Node_Access (Self), Control); end if; end Leave_Element; ------------------- -- Visit_Element -- ------------------- overriding procedure Visit_Element (Self : not null access constant UML_Activity_Parameter_Node_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control) is begin if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then AMF.Visitors.UML_Iterators.UML_Iterator'Class (Iterator).Visit_Activity_Parameter_Node (Visitor, AMF.UML.Activity_Parameter_Nodes.UML_Activity_Parameter_Node_Access (Self), Control); end if; end Visit_Element; ------------------- -- Get_Parameter -- ------------------- overriding function Get_Parameter (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Parameters.UML_Parameter_Access is begin return AMF.UML.Parameters.UML_Parameter_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Parameter (Self.Element))); end Get_Parameter; ------------------- -- Set_Parameter -- ------------------- overriding procedure Set_Parameter (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.Parameters.UML_Parameter_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Parameter (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Parameter; ------------------ -- Get_In_State -- ------------------ overriding function Get_In_State (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.States.Collections.Set_Of_UML_State is begin return AMF.UML.States.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_In_State (Self.Element))); end Get_In_State; ------------------------- -- Get_Is_Control_Type -- ------------------------- overriding function Get_Is_Control_Type (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return Boolean is begin return AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Control_Type (Self.Element); end Get_Is_Control_Type; ------------------------- -- Set_Is_Control_Type -- ------------------------- overriding procedure Set_Is_Control_Type (Self : not null access UML_Activity_Parameter_Node_Proxy; To : Boolean) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Control_Type (Self.Element, To); end Set_Is_Control_Type; ------------------ -- Get_Ordering -- ------------------ overriding function Get_Ordering (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.UML_Object_Node_Ordering_Kind is begin return AMF.Internals.Tables.UML_Attributes.Internal_Get_Ordering (Self.Element); end Get_Ordering; ------------------ -- Set_Ordering -- ------------------ overriding procedure Set_Ordering (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.UML_Object_Node_Ordering_Kind) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Ordering (Self.Element, To); end Set_Ordering; ------------------- -- Get_Selection -- ------------------- overriding function Get_Selection (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Behaviors.UML_Behavior_Access is begin return AMF.UML.Behaviors.UML_Behavior_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Selection (Self.Element))); end Get_Selection; ------------------- -- Set_Selection -- ------------------- overriding procedure Set_Selection (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.Behaviors.UML_Behavior_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Selection (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Selection; --------------------- -- Get_Upper_Bound -- --------------------- overriding function Get_Upper_Bound (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Value_Specifications.UML_Value_Specification_Access is begin return AMF.UML.Value_Specifications.UML_Value_Specification_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Upper_Bound (Self.Element))); end Get_Upper_Bound; --------------------- -- Set_Upper_Bound -- --------------------- overriding procedure Set_Upper_Bound (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.Value_Specifications.UML_Value_Specification_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Upper_Bound (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Upper_Bound; ------------------ -- Get_Activity -- ------------------ overriding function Get_Activity (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Activities.UML_Activity_Access is begin return AMF.UML.Activities.UML_Activity_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Activity (Self.Element))); end Get_Activity; ------------------ -- Set_Activity -- ------------------ overriding procedure Set_Activity (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.Activities.UML_Activity_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Activity (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Activity; ------------------ -- Get_In_Group -- ------------------ overriding function Get_In_Group (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Activity_Groups.Collections.Set_Of_UML_Activity_Group is begin return AMF.UML.Activity_Groups.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_In_Group (Self.Element))); end Get_In_Group; --------------------------------- -- Get_In_Interruptible_Region -- --------------------------------- overriding function Get_In_Interruptible_Region (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Interruptible_Activity_Regions.Collections.Set_Of_UML_Interruptible_Activity_Region is begin return AMF.UML.Interruptible_Activity_Regions.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_In_Interruptible_Region (Self.Element))); end Get_In_Interruptible_Region; ---------------------- -- Get_In_Partition -- ---------------------- overriding function Get_In_Partition (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Activity_Partitions.Collections.Set_Of_UML_Activity_Partition is begin return AMF.UML.Activity_Partitions.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_In_Partition (Self.Element))); end Get_In_Partition; ---------------------------- -- Get_In_Structured_Node -- ---------------------------- overriding function Get_In_Structured_Node (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access is begin return AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_In_Structured_Node (Self.Element))); end Get_In_Structured_Node; ---------------------------- -- Set_In_Structured_Node -- ---------------------------- overriding procedure Set_In_Structured_Node (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_In_Structured_Node (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_In_Structured_Node; ------------------ -- Get_Incoming -- ------------------ overriding function Get_Incoming (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge is begin return AMF.UML.Activity_Edges.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Incoming (Self.Element))); end Get_Incoming; ------------------ -- Get_Outgoing -- ------------------ overriding function Get_Outgoing (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge is begin return AMF.UML.Activity_Edges.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Outgoing (Self.Element))); end Get_Outgoing; ------------------------ -- Get_Redefined_Node -- ------------------------ overriding function Get_Redefined_Node (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node is begin return AMF.UML.Activity_Nodes.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefined_Node (Self.Element))); end Get_Redefined_Node; ----------------- -- Get_Is_Leaf -- ----------------- overriding function Get_Is_Leaf (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return Boolean is begin return AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Leaf (Self.Element); end Get_Is_Leaf; ----------------- -- Set_Is_Leaf -- ----------------- overriding procedure Set_Is_Leaf (Self : not null access UML_Activity_Parameter_Node_Proxy; To : Boolean) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Leaf (Self.Element, To); end Set_Is_Leaf; --------------------------- -- Get_Redefined_Element -- --------------------------- overriding function Get_Redefined_Element (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element is begin return AMF.UML.Redefinable_Elements.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefined_Element (Self.Element))); end Get_Redefined_Element; ------------------------------ -- Get_Redefinition_Context -- ------------------------------ overriding function Get_Redefinition_Context (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is begin return AMF.UML.Classifiers.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefinition_Context (Self.Element))); end Get_Redefinition_Context; --------------------------- -- Get_Client_Dependency -- --------------------------- overriding function Get_Client_Dependency (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is begin return AMF.UML.Dependencies.Collections.Wrap (AMF.Internals.Element_Collections.Wrap (AMF.Internals.Tables.UML_Attributes.Internal_Get_Client_Dependency (Self.Element))); end Get_Client_Dependency; ------------------------- -- Get_Name_Expression -- ------------------------- overriding function Get_Name_Expression (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.String_Expressions.UML_String_Expression_Access is begin return AMF.UML.String_Expressions.UML_String_Expression_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Name_Expression (Self.Element))); end Get_Name_Expression; ------------------------- -- Set_Name_Expression -- ------------------------- overriding procedure Set_Name_Expression (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.String_Expressions.UML_String_Expression_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Name_Expression (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Name_Expression; ------------------- -- Get_Namespace -- ------------------- overriding function Get_Namespace (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin return AMF.UML.Namespaces.UML_Namespace_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Namespace (Self.Element))); end Get_Namespace; ------------------------ -- Get_Qualified_Name -- ------------------------ overriding function Get_Qualified_Name (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.Optional_String is begin declare use type Matreshka.Internals.Strings.Shared_String_Access; Aux : constant Matreshka.Internals.Strings.Shared_String_Access := AMF.Internals.Tables.UML_Attributes.Internal_Get_Qualified_Name (Self.Element); begin if Aux = null then return (Is_Empty => True); else return (False, League.Strings.Internals.Create (Aux)); end if; end; end Get_Qualified_Name; -------------- -- Get_Type -- -------------- overriding function Get_Type (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Types.UML_Type_Access is begin return AMF.UML.Types.UML_Type_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Type (Self.Element))); end Get_Type; -------------- -- Set_Type -- -------------- overriding procedure Set_Type (Self : not null access UML_Activity_Parameter_Node_Proxy; To : AMF.UML.Types.UML_Type_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Type (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Type; ------------------------ -- Is_Consistent_With -- ------------------------ overriding function Is_Consistent_With (Self : not null access constant UML_Activity_Parameter_Node_Proxy; Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Consistent_With unimplemented"); raise Program_Error with "Unimplemented procedure UML_Activity_Parameter_Node_Proxy.Is_Consistent_With"; return Is_Consistent_With (Self, Redefinee); end Is_Consistent_With; ----------------------------------- -- Is_Redefinition_Context_Valid -- ----------------------------------- overriding function Is_Redefinition_Context_Valid (Self : not null access constant UML_Activity_Parameter_Node_Proxy; Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Redefinition_Context_Valid unimplemented"); raise Program_Error with "Unimplemented procedure UML_Activity_Parameter_Node_Proxy.Is_Redefinition_Context_Valid"; return Is_Redefinition_Context_Valid (Self, Redefined); end Is_Redefinition_Context_Valid; ------------------------- -- All_Owning_Packages -- ------------------------- overriding function All_Owning_Packages (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Packages.Collections.Set_Of_UML_Package is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented"); raise Program_Error with "Unimplemented procedure UML_Activity_Parameter_Node_Proxy.All_Owning_Packages"; return All_Owning_Packages (Self); end All_Owning_Packages; ----------------------------- -- Is_Distinguishable_From -- ----------------------------- overriding function Is_Distinguishable_From (Self : not null access constant UML_Activity_Parameter_Node_Proxy; N : AMF.UML.Named_Elements.UML_Named_Element_Access; Ns : AMF.UML.Namespaces.UML_Namespace_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented"); raise Program_Error with "Unimplemented procedure UML_Activity_Parameter_Node_Proxy.Is_Distinguishable_From"; return Is_Distinguishable_From (Self, N, Ns); end Is_Distinguishable_From; --------------- -- Namespace -- --------------- overriding function Namespace (Self : not null access constant UML_Activity_Parameter_Node_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented"); raise Program_Error with "Unimplemented procedure UML_Activity_Parameter_Node_Proxy.Namespace"; return Namespace (Self); end Namespace; end AMF.Internals.UML_Activity_Parameter_Nodes;
-- -- -- package Copyright (c) Dmitry A. Kazakov -- -- Parsers.Generic_Source.XPM Luebeck -- -- Implementation Summer, 2006 -- -- -- -- Last revision : 19:53 12 Jan 2008 -- -- -- -- This library 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 library -- -- 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 library; if not, write to the Free Software Foundation, -- -- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- --____________________________________________________________________-- -- -- This generic package is an XPM parser. It can be instantiated for -- any type of sources, but usually it makes sense for multi-line -- sources only. The package provides three subprograms for parsing XPM -- files. An XPM file is a C program containing an XPM image. A source -- containing such image is usually parsed this way: -- -- Header : Descriptor := Get (Source); -- Map : Color_Tables.Table := Get (Source, Header); -- Image : Pixel_Buffer := Get (Source, Header, Map); -- with Tables; with Parsers.Generic_Source.Get_Cpp_Blank; with Parsers.Generic_Source.Get_Text; with Parsers.Generic_Source.Keywords; generic package Parsers.Generic_Source.XPM is -- -- Descriptor -- Of an XPM file -- -- The descriptor contains the information about an XPM image. -- -- Name - The name of the image, as found in the file -- Width - In pixels -- Height - In pixels -- Pixel_Size - Number of characters per pixel used in the file -- Map_Size - Number of colors in the colormap -- Extended - Has XPMEXT part -- X_Hotspot - Hostspot co-ordinate 0.. -- Y_Hotspot - Hostspot co-ordinate 0.. -- type Descriptor ( Has_Hotspot : Boolean; Length : Positive ) is record Name : String (1..Length); Width : Positive; Height : Positive; Pixel_Size : Positive; Map_Size : Positive; Extended : Boolean; case Has_Hotspot is when True => X_Hotspot : Natural; Y_Hotspot : Natural; when False => null; end case; end record; -- -- RGB_Color -- The type of a pixel -- -- The values are encoded as RGB, big endian. For example, Red is -- 16#FF0000#. The value 2**24 is used for the transparent color. -- type RGB_Color is range 0..2**24; Transparent : constant RGB_Color := RGB_Color'Last; -- -- Color_Tables -- Colormaps -- -- The type Color_Table.Table is a mapping String->RGB_Color. -- package Color_Tables is new Tables (RGB_Color); -- -- Pixel_Buffer -- Image in Row x Column format -- type Pixel_Buffer is array (Positive range <>, Positive range <>) of RGB_Color; -- -- Get -- Descriptor from source -- -- Code - The source to parse -- -- Returns : -- -- The image descriptor -- -- Exceptions : -- -- Syntax_Error - Syntax error during parsing -- othes - Source related exception -- function Get (Code : access Source_Type) return Descriptor; -- -- Get -- Colormap from source -- -- Code - The source to parse -- Header - Parsed before -- -- Returns : -- -- The image colormap -- -- Exceptions : -- -- Syntax_Error - Syntax error during parsing -- othes - Source related exception -- function Get ( Code : access Source_Type; Header : Descriptor ) return Color_Tables.Table; -- -- Get -- Image from source -- -- Code - The source to parse -- Header - The image descriptor parsed before -- Map - The image colormap parsed before -- -- Returns : -- -- The image -- -- Exceptions : -- -- Syntax_Error - Syntax error during parsing -- othes - Source related exception -- function Get ( Code : access Source_Type; Header : Descriptor; Map : Color_Tables.Table ) return Pixel_Buffer; private type Color_Type is (m, s, g4, g, c); package Color_Types is new Keywords (Color_Type); type Color_Name is (none, white, black, red, green, blue); package Color_Names is new Keywords (Color_Name); procedure Skip is new Parsers.Generic_Source.Get_Cpp_Blank; procedure Get is new Parsers.Generic_Source.Get_Text; end Parsers.Generic_Source.XPM;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . B B . M C U _ P A R A M E T E R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2019, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- -- The port of GNARL to bare board targets was initially developed by the -- -- Real-Time Systems Group at the Technical University of Madrid. -- -- -- ------------------------------------------------------------------------------ -- This package defines MCU parameters for the SAMV71 family package System.BB.MCU_Parameters is pragma No_Elaboration_Code_All; pragma Preelaborate; Number_Of_Interrupts : constant := 69; Has_FPU : constant Boolean := True; end System.BB.MCU_Parameters;
-- The MIT License (MIT) -- -- Copyright (c) 2016-2017 artium@nihamkin.com -- -- Permission is hereby granted, free of charge, to any person obtaining a copy -- of this software and associated documentation files (the "Software"), to deal -- in the Software without restriction, including without limitation the rights -- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -- copies of the Software, and to permit persons to whom the Software is -- furnished to do so, subject to the following conditions: -- -- The above copyright notice and this permission notice shall be included in -- all copies or substantial portions of the Software. -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN -- THE SOFTWARE. -- -- separate (Main) procedure Draw_Curve(Control_Points : in CRV.Control_Points_Array; Algorithm : in Algorithm_Type; Knot_Values : in CRV.Knot_Values_Array) is procedure Draw_Curve_Segment(Segment : in Positive := 1) is STEP : constant := 0.015625; -- Power of 2 required for floating point to reach 1.0 exaclty! Token : Gl.Immediate.Input_Token := GL.Immediate.Start (Line_Strip); T : Gl.Types.Double := 0.0; P : CRV.Point_Type := CRV.ORIGIN_POINT; Skip_Vertex : Boolean := False; begin T := 0.0; while T <= 1.0 loop Skip_Vertex := False; case Algorithm is when DE_CASTELIJAU => P := CRV.Eval_De_Castelijau( Control_Points, T); when DE_BOOR => P := CRV.Eval_De_Boor ( Control_Points => Control_Points, Knot_Values => Knot_Values, T => T, Is_Outside_The_Domain => Skip_Vertex); when CATMULL_ROM => P := CRV.Eval_Catmull_Rom( Control_Points, Segment, T); when LAGRANGE_EQUIDISTANT => P := CRV.Eval_Lagrange( Control_Points, CRV.Make_Equidistant_Nodes(Control_Points'Length), T); when LAGRANGE_CHEBYSHEV => P := CRV.Eval_Lagrange( Control_Points, CRV.Make_Chebyshev_Nodes(Control_Points'Length), T); end case; if not Skip_Vertex then GL.Immediate.Add_Vertex(Token, Vector2'(P(CRV.X), P(CRV.Y))); end if; T := T + STEP; end loop; end Draw_Curve_Segment; begin GL.Toggles.Enable(GL.Toggles.Line_Smooth); Gl.Immediate.Set_Color (GL.Types.Colors.Color'(1.0, 1.0, 0.0, 0.0)); case Algorithm is when DE_CASTELIJAU | LAGRANGE_EQUIDISTANT | LAGRANGE_CHEBYSHEV | DE_BOOR => Draw_Curve_Segment; when CATMULL_ROM => for Segment in Positive range 1 .. Control_Points'Length - 3 loop Draw_Curve_Segment(Segment); end loop; end case; GL.Toggles.Disable(GL.Toggles.Line_Smooth); end Draw_Curve;
-- -*- Mode: Ada -*- -- Filename : last_chance_handler.ads -- Description : Definition of the exception handler for the kernel. -- Author : Luke A. Guest -- Created On : Thu Jun 14 12:06:21 2012 -- Licence : See LICENCE in the root directory. with System; procedure Last_Chance_Handler (Source_Location : System.Address; Line : Integer); pragma Export (C, Last_Chance_Handler, "__gnat_last_chance_handler"); pragma Preelaborate (Last_Chance_Handler);
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>memRead</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>5</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>memRdCtrl_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>memRdCtrl.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>40</bitwidth> </Value> <direction>1</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>3</id> <name>cc2memReadMd_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>4</id> <name>cc2memRead_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>130</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_4"> <Value> <Obj> <type>1</type> <id>5</id> <name>memRd2comp_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>130</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_5"> <Value> <Obj> <type>1</type> <id>6</id> <name>memRd2compMd_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>1</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>54</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_6"> <Value> <Obj> <type>0</type> <id>13</id> <name>memRdState_load</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>42</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second class_id="11" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="12" tracking_level="0" version="0"> <first class_id="13" tracking_level="0" version="0"> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>42</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>80</item> </oprand_edges> <opcode>load</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>14</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>42</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>42</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>81</item> <item>82</item> <item>83</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>16</id> <name>tmp</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>85</item> <item>86</item> <item>88</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>17</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>45</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>45</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>89</item> <item>90</item> <item>91</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>19</id> <name>tmp_29</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>93</item> <item>94</item> <item>95</item> </oprand_edges> <opcode>nbreadreq</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>20</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>45</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>45</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>96</item> <item>97</item> <item>98</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>22</id> <name>tmp27</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp27</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>100</item> <item>101</item> <item>386</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>23</id> <name>tmp_operation_V</name> <fileName>sources/hashTable/../globals.h</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>136</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first> <second>read</second> </first> <second>127</second> </item> <item> <first> <first>sources/hashTable/../globals.h</first> <second>operator=</second> </first> <second>136</second> </item> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.operation.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>102</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>24</id> <name>tmp_keyLength_V</name> <fileName>sources/hashTable/../globals.h</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>136</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first> <second>read</second> </first> <second>127</second> </item> <item> <first> <first>sources/hashTable/../globals.h</first> <second>operator=</second> </first> <second>136</second> </item> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>46</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.keyLength.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>104</item> <item>105</item> <item>107</item> <item>109</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>25</id> <name>tmp_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.1</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>130</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>111</item> <item>112</item> <item>387</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>26</id> <name>p_Val2_s</name> <fileName>sources/hashTable/../globals.h</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>120</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first> <second>read</second> </first> <second>127</second> </item> <item> <first> <first>sources/hashTable/../globals.h</first> <second>operator=</second> </first> <second>120</second> </item> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>47</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>113</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>27</id> <name>tmp_EOP_V_4</name> <fileName>sources/hashTable/../globals.h</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>120</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first> <second>read</second> </first> <second>127</second> </item> <item> <first> <first>sources/hashTable/../globals.h</first> <second>operator=</second> </first> <second>120</second> </item> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>47</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.EOP.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>115</item> <item>116</item> <item>118</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>28</id> <name>tmp_i</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>49</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>119</item> <item>121</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>29</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>49</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>49</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>122</item> <item>123</item> <item>124</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>31</id> <name>p_Result_i</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>52</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>52</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>7</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>126</item> <item>127</item> <item>129</item> <item>131</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>32</id> <name>tmp_30</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>53</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>53</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>136</item> <item>137</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>33</id> <name>memData_count_V_cast</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>53</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>53</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>138</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>34</id> <name>r_V</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>140</item> <item>141</item> <item>143</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>35</id> <name>tmp_128_i</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>144</item> <item>145</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>36</id> <name>p_0184_1_0_v_cast_i_c</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>146</item> <item>148</item> <item>150</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>37</id> <name>memData_count_V</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName>memData.count.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>151</item> <item>152</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.01</m_delay> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp_s</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>54</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>54</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>37</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>154</item> <item>155</item> <item>157</item> <item>158</item> <item>160</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>39</id> <name>tmp_2</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.2</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>40</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>161</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>40</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>58</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>58</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>163</item> <item>164</item> <item>165</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>41</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>59</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>166</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>43</id> <name>tmp_129_i</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>60</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>60</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>167</item> <item>169</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.86</m_delay> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>44</id> <name>tmp_31</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>171</item> <item>172</item> <item>173</item> <item>174</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>45</id> <name>tmp_131_i</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>176</item> <item>177</item> <item>178</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>46</id> <name>tmp_336</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>180</item> <item>181</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.35</m_delay> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>47</id> <name>tmp_337</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>182</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>48</id> <name>tmp_338</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>184</item> <item>185</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>49</id> <name>p_Result_s</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>186</item> <item>187</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>50</id> <name>tmp_340</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>188</item> <item>189</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.35</m_delay> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>51</id> <name>tmp_341</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>190</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>52</id> <name>tmp_342</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>191</item> <item>192</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>53</id> <name>p_Result_23</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>62</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>62</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>193</item> <item>194</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>54</id> <name>tmp_data_V</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>65</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>195</item> <item>196</item> <item>197</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>1.62</m_delay> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>55</id> <name>tmp_43_i</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>65</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>199</item> <item>200</item> <item>202</item> <item>203</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>56</id> <name>tmp_3</name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>65</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.3</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>130</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>205</item> <item>206</item> <item>207</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>57</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>65</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>209</item> <item>210</item> <item>211</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>58</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>213</item> <item>214</item> <item>215</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>59</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>67</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>67</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>216</item> <item>217</item> <item>218</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>61</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>220</item> <item>221</item> <item>385</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>62</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>222</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>64</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>69</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>223</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>66</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>70</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>70</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>224</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>68</id> <name>tmp_5</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>tmp.5</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>130</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>225</item> <item>226</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>69</id> <name>tmp_EOP_V</name> <fileName>sources/hashTable/../globals.h</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>120</lineNumber> <contextFuncName>operator=</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first> <second>read</second> </first> <second>127</second> </item> <item> <first> <first>sources/hashTable/../globals.h</first> <second>operator=</second> </first> <second>120</second> </item> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>74</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.EOP.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>227</item> <item>228</item> <item>229</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>70</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>230</item> <item>231</item> <item>232</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>2.39</m_delay> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>71</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>76</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>76</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>233</item> <item>234</item> <item>235</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>73</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>77</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>77</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>237</item> <item>238</item> <item>384</item> </oprand_edges> <opcode>store</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.85</m_delay> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>74</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>77</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>77</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>239</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>76</id> <name></name> <fileName>sources/hashTable/memRead.cpp</fileName> <fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory> <lineNumber>78</lineNumber> <contextFuncName>memRead</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>sources/hashTable/memRead.cpp</first> <second>memRead</second> </first> <second>78</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>240</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>78</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_delay>0.00</m_delay> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>19</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_60"> <Value> <Obj> <type>2</type> <id>87</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_61"> <Value> <Obj> <type>2</type> <id>106</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>40</content> </item> <item class_id_reference="16" object_id="_62"> <Value> <Obj> <type>2</type> <id>108</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>47</content> </item> <item class_id_reference="16" object_id="_63"> <Value> <Obj> <type>2</type> <id>117</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>129</content> </item> <item class_id_reference="16" object_id="_64"> <Value> <Obj> <type>2</type> <id>120</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_65"> <Value> <Obj> <type>2</type> <id>128</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_66"> <Value> <Obj> <type>2</type> <id>130</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>14</content> </item> <item class_id_reference="16" object_id="_67"> <Value> <Obj> <type>2</type> <id>135</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>44</content> </item> <item class_id_reference="16" object_id="_68"> <Value> <Obj> <type>2</type> <id>142</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_69"> <Value> <Obj> <type>2</type> <id>147</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_70"> <Value> <Obj> <type>2</type> <id>149</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>5</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_71"> <Value> <Obj> <type>2</type> <id>156</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>22</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_72"> <Value> <Obj> <type>2</type> <id>159</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>3</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_73"> <Value> <Obj> <type>2</type> <id>168</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>17</content> </item> <item class_id_reference="16" object_id="_74"> <Value> <Obj> <type>2</type> <id>179</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>128</content> </item> <item class_id_reference="16" object_id="_75"> <Value> <Obj> <type>2</type> <id>183</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>128</bitwidth> </Value> <const_type>0</const_type> <content>340282366920938463463374607431768211455</content> </item> <item class_id_reference="16" object_id="_76"> <Value> <Obj> <type>2</type> <id>201</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>128</content> </item> <item class_id_reference="16" object_id="_77"> <Value> <Obj> <type>2</type> <id>219</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_78"> <Value> <Obj> <type>2</type> <id>236</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>13</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_79"> <Obj> <type>3</type> <id>15</id> <name>entry</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>13</item> <item>14</item> </node_objs> </item> <item class_id_reference="18" object_id="_80"> <Obj> <type>3</type> <id>18</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>16</item> <item>17</item> </node_objs> </item> <item class_id_reference="18" object_id="_81"> <Obj> <type>3</type> <id>21</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>19</item> <item>20</item> </node_objs> </item> <item class_id_reference="18" object_id="_82"> <Obj> <type>3</type> <id>30</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>8</count> <item_version>0</item_version> <item>22</item> <item>23</item> <item>24</item> <item>25</item> <item>26</item> <item>27</item> <item>28</item> <item>29</item> </node_objs> </item> <item class_id_reference="18" object_id="_83"> <Obj> <type>3</type> <id>42</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>11</count> <item_version>0</item_version> <item>31</item> <item>32</item> <item>33</item> <item>34</item> <item>35</item> <item>36</item> <item>37</item> <item>38</item> <item>39</item> <item>40</item> <item>41</item> </node_objs> </item> <item class_id_reference="18" object_id="_84"> <Obj> <type>3</type> <id>60</id> <name>._crit_edge3.i_ifconv</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>17</count> <item_version>0</item_version> <item>43</item> <item>44</item> <item>45</item> <item>46</item> <item>47</item> <item>48</item> <item>49</item> <item>50</item> <item>51</item> <item>52</item> <item>53</item> <item>54</item> <item>55</item> <item>56</item> <item>57</item> <item>58</item> <item>59</item> </node_objs> </item> <item class_id_reference="18" object_id="_85"> <Obj> <type>3</type> <id>63</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>61</item> <item>62</item> </node_objs> </item> <item class_id_reference="18" object_id="_86"> <Obj> <type>3</type> <id>65</id> <name>._crit_edge5.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>64</item> </node_objs> </item> <item class_id_reference="18" object_id="_87"> <Obj> <type>3</type> <id>67</id> <name>._crit_edge1.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>66</item> </node_objs> </item> <item class_id_reference="18" object_id="_88"> <Obj> <type>3</type> <id>72</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>68</item> <item>69</item> <item>70</item> <item>71</item> </node_objs> </item> <item class_id_reference="18" object_id="_89"> <Obj> <type>3</type> <id>75</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>73</item> <item>74</item> </node_objs> </item> <item class_id_reference="18" object_id="_90"> <Obj> <type>3</type> <id>77</id> <name>._crit_edge6.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>76</item> </node_objs> </item> <item class_id_reference="18" object_id="_91"> <Obj> <type>3</type> <id>79</id> <name>memRead.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>1</count> <item_version>0</item_version> <item>78</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>127</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_92"> <id>80</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>13</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_93"> <id>81</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_94"> <id>82</id> <edge_type>2</edge_type> <source_obj>18</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_95"> <id>83</id> <edge_type>2</edge_type> <source_obj>72</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_96"> <id>86</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_97"> <id>88</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_98"> <id>89</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_99"> <id>90</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_100"> <id>91</id> <edge_type>2</edge_type> <source_obj>21</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_101"> <id>94</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_102"> <id>95</id> <edge_type>1</edge_type> <source_obj>87</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_103"> <id>96</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_104"> <id>97</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_105"> <id>98</id> <edge_type>2</edge_type> <source_obj>30</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_106"> <id>101</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_107"> <id>102</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_108"> <id>105</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_109"> <id>107</id> <edge_type>1</edge_type> <source_obj>106</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_110"> <id>109</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_111"> <id>112</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_112"> <id>113</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_113"> <id>116</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_114"> <id>118</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_115"> <id>119</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_116"> <id>121</id> <edge_type>1</edge_type> <source_obj>120</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_117"> <id>122</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_118"> <id>123</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_119"> <id>124</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_120"> <id>127</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_121"> <id>129</id> <edge_type>1</edge_type> <source_obj>128</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_122"> <id>131</id> <edge_type>1</edge_type> <source_obj>130</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_123"> <id>134</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_124"> <id>136</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_125"> <id>137</id> <edge_type>1</edge_type> <source_obj>108</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_126"> <id>138</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_127"> <id>141</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_128"> <id>143</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_129"> <id>144</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_130"> <id>145</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_131"> <id>146</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_132"> <id>148</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_133"> <id>150</id> <edge_type>1</edge_type> <source_obj>149</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_134"> <id>151</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_135"> <id>152</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_136"> <id>155</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_137"> <id>157</id> <edge_type>1</edge_type> <source_obj>156</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_138"> <id>158</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_139"> <id>160</id> <edge_type>1</edge_type> <source_obj>159</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_140"> <id>161</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_141"> <id>164</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_142"> <id>165</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_143"> <id>166</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_144"> <id>167</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_145"> <id>169</id> <edge_type>1</edge_type> <source_obj>168</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_146"> <id>172</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_147"> <id>173</id> <edge_type>1</edge_type> <source_obj>106</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_148"> <id>174</id> <edge_type>1</edge_type> <source_obj>135</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_149"> <id>177</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_150"> <id>178</id> <edge_type>1</edge_type> <source_obj>159</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_151"> <id>180</id> <edge_type>1</edge_type> <source_obj>179</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_152"> <id>181</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_153"> <id>182</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_154"> <id>184</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_155"> <id>185</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_156"> <id>186</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_157"> <id>187</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_158"> <id>188</id> <edge_type>1</edge_type> <source_obj>179</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_159"> <id>189</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_160"> <id>190</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_161"> <id>191</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_162"> <id>192</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_163"> <id>193</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_164"> <id>194</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_165"> <id>195</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_166"> <id>196</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_167"> <id>197</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_168"> <id>200</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_169"> <id>202</id> <edge_type>1</edge_type> <source_obj>201</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_170"> <id>203</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_171"> <id>206</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_172"> <id>207</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_173"> <id>210</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_174"> <id>211</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_175"> <id>214</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_176"> <id>215</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_177"> <id>216</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_178"> <id>217</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_179"> <id>218</id> <edge_type>2</edge_type> <source_obj>65</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_180"> <id>220</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_181"> <id>221</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_182"> <id>222</id> <edge_type>2</edge_type> <source_obj>65</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_183"> <id>223</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_184"> <id>224</id> <edge_type>2</edge_type> <source_obj>79</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_185"> <id>226</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_186"> <id>228</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_187"> <id>229</id> <edge_type>1</edge_type> <source_obj>117</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_188"> <id>231</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_189"> <id>232</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_190"> <id>233</id> <edge_type>1</edge_type> <source_obj>69</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_191"> <id>234</id> <edge_type>2</edge_type> <source_obj>77</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_192"> <id>235</id> <edge_type>2</edge_type> <source_obj>75</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_193"> <id>237</id> <edge_type>1</edge_type> <source_obj>236</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_194"> <id>238</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_195"> <id>239</id> <edge_type>2</edge_type> <source_obj>77</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_196"> <id>240</id> <edge_type>2</edge_type> <source_obj>79</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_197"> <id>366</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_198"> <id>367</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_199"> <id>368</id> <edge_type>2</edge_type> <source_obj>18</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_200"> <id>369</id> <edge_type>2</edge_type> <source_obj>18</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_201"> <id>370</id> <edge_type>2</edge_type> <source_obj>21</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_202"> <id>371</id> <edge_type>2</edge_type> <source_obj>21</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_203"> <id>372</id> <edge_type>2</edge_type> <source_obj>30</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_204"> <id>373</id> <edge_type>2</edge_type> <source_obj>30</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_205"> <id>374</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_206"> <id>375</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_207"> <id>376</id> <edge_type>2</edge_type> <source_obj>60</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_208"> <id>377</id> <edge_type>2</edge_type> <source_obj>63</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_209"> <id>378</id> <edge_type>2</edge_type> <source_obj>65</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_210"> <id>379</id> <edge_type>2</edge_type> <source_obj>67</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_211"> <id>380</id> <edge_type>2</edge_type> <source_obj>72</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_212"> <id>381</id> <edge_type>2</edge_type> <source_obj>72</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_213"> <id>382</id> <edge_type>2</edge_type> <source_obj>75</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_214"> <id>383</id> <edge_type>2</edge_type> <source_obj>77</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_215"> <id>384</id> <edge_type>4</edge_type> <source_obj>13</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_216"> <id>385</id> <edge_type>4</edge_type> <source_obj>13</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_217"> <id>386</id> <edge_type>4</edge_type> <source_obj>16</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_218"> <id>387</id> <edge_type>4</edge_type> <source_obj>19</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_219"> <mId>1</mId> <mTag>memRead</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>13</count> <item_version>0</item_version> <item>15</item> <item>18</item> <item>21</item> <item>30</item> <item>42</item> <item>60</item> <item>63</item> <item>65</item> <item>67</item> <item>72</item> <item>75</item> <item>77</item> <item>79</item> </basic_blocks> <mII>1</mII> <mDepth>3</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>2</mMinLatency> <mMaxLatency>2</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="26" tracking_level="0" version="0"> <count>54</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>13</first> <second class_id="28" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>31</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>32</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>41</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>50</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>51</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>54</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>56</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>57</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>58</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>59</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>64</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>66</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>68</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>69</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>70</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>74</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>2</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="29" tracking_level="0" version="0"> <count>13</count> <item_version>0</item_version> <item class_id="30" tracking_level="0" version="0"> <first>15</first> <second class_id="31" tracking_level="0" version="0"> <first>0</first> <second>2</second> </second> </item> <item> <first>18</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>30</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>60</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>63</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>65</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>67</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>72</first> <second> <first>0</first> <second>1</second> </second> </item> <item> <first>75</first> <second> <first>0</first> <second>2</second> </second> </item> <item> <first>77</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>79</first> <second> <first>2</first> <second>2</second> </second> </item> </bblk_ent_exit> <regions class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="1" version="0" object_id="_220"> <region_name>memRead</region_name> <basic_blocks> <count>13</count> <item_version>0</item_version> <item>15</item> <item>18</item> <item>21</item> <item>30</item> <item>42</item> <item>60</item> <item>63</item> <item>65</item> <item>67</item> <item>72</item> <item>75</item> <item>77</item> <item>79</item> </basic_blocks> <nodes> <count>0</count> <item_version>0</item_version> </nodes> <anchor_node>-1</anchor_node> <region_type>8</region_type> <interval>1</interval> <pipe_depth>3</pipe_depth> </item> </regions> <dp_fu_nodes class_id="34" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>0</count> <item_version>0</item_version> </dp_reg_nodes> <dp_regname_nodes> <count>0</count> <item_version>0</item_version> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="37" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="38" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>
------------------------------------------------------------------------------ -- A d a r u n - t i m e s p e c i f i c a t i o n -- -- ASIS implementation for Gela project, a portable Ada compiler -- -- http://gela.ada-ru.org -- -- - - - - - - - - - - - - - - - -- -- Read copyright and license at the end of ada.ads file -- ------------------------------------------------------------------------------ -- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $ package Ada.IO_Exceptions is pragma Pure (IO_Exceptions); Status_Error : exception; Mode_Error : exception; Name_Error : exception; Use_Error : exception; Device_Error : exception; End_Error : exception; Data_Error : exception; Layout_Error : exception; end Ada.IO_Exceptions;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of STMicroelectronics nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ package body STM32.Board is ------------------ -- All_LEDs_Off -- ------------------ procedure All_LEDs_Off is begin Clear (All_LEDs); end All_LEDs_Off; ----------------- -- All_LEDs_On -- ----------------- procedure All_LEDs_On is begin Set (All_LEDs); end All_LEDs_On; --------------------- -- Initialize_LEDs -- --------------------- procedure Initialize_LEDs is Conf : GPIO_Port_Configuration; begin Enable_Clock (All_LEDs); Conf.Mode := Mode_Out; Conf.Output_Type := Push_Pull; Conf.Speed := Speed_100MHz; Conf.Resistors := Floating; Configure_IO (All_LEDs, Conf); end Initialize_LEDs; ------------------------- -- Initialize_I2C_GPIO -- ------------------------- procedure Initialize_I2C_GPIO (Port : in out I2C_Port) is Id : constant I2C_Port_Id := As_Port_Id (Port); Points : constant GPIO_Points (1 .. 2) := (if Id = I2C_Id_1 then (PB8, PB9) elsif Id = I2C_Id_3 then (PH7, PH8) else (PA0, PA0)); begin if Id = I2C_Id_2 or else Id = I2C_Id_4 then raise Unknown_Device with "This I2C_Port cannot be used on this board"; end if; Enable_Clock (Points); Configure_Alternate_Function (Points, GPIO_AF_I2C); Configure_IO (Points, (Speed => Speed_25MHz, Mode => Mode_AF, Output_Type => Open_Drain, Resistors => Floating)); Lock (Points); end Initialize_I2C_GPIO; ------------------- -- TP_I2C_Config -- ------------------- procedure Configure_I2C (Port : in out I2C_Port) is I2C_Conf : I2C_Configuration; begin if Port /= I2C_3 then return; end if; if not STM32.I2C.Is_Configured (Port) then I2C_Conf.Own_Address := 16#00#; I2C_Conf.Addressing_Mode := Addressing_Mode_7bit; I2C_Conf.General_Call_Enabled := False; I2C_Conf.Clock_Stretching_Enabled := True; I2C_Conf.Clock_Speed := 100_000; Configure (Port, I2C_Conf); end if; end Configure_I2C; -------------------------------- -- Configure_User_Button_GPIO -- -------------------------------- procedure Configure_User_Button_GPIO is Config : GPIO_Port_Configuration; begin Enable_Clock (User_Button_Point); Config.Mode := Mode_In; Config.Resistors := Floating; Configure_IO (User_Button_Point, Config); end Configure_User_Button_GPIO; end STM32.Board;
--////////////////////////////////////////////////////////// -- SFML - Simple and Fast Multimedia Library -- Copyright (C) 2007-2018 Laurent Gomila (laurent@sfml-dev.org) -- This software is provided 'as-is', without any express or implied warranty. -- In no event will the authors be held liable for any damages arising from the use of this software. -- Permission is granted to anyone to use this software for any purpose, -- including commercial applications, and to alter it and redistribute it freely, -- subject to the following restrictions: -- 1. The origin of this software must not be misrepresented; -- you must not claim that you wrote the original software. -- If you use this software in a product, an acknowledgment -- in the product documentation would be appreciated but is not required. -- 2. Altered source versions must be plainly marked as such, -- and must not be misrepresented as being the original software. -- 3. This notice may not be removed or altered from any source distribution. --////////////////////////////////////////////////////////// with Sf.System.Vector2; with Sf.Graphics.Transform; with Sf.Graphics.Color; with Sf.Graphics.Rect; package Sf.Graphics.Text is --////////////////////////////////////////////////////////// --/ sfText styles --////////////////////////////////////////////////////////// --/< Regular characters, no style --/< Bold characters --/< Italic characters --/< Underlined characters --/< Strike through characters subtype sfTextStyle is sfUint32; sfTextRegular : constant sfTextStyle := 0; sfTextBold : constant sfTextStyle := 1; sfTextItalic : constant sfTextStyle := 2; sfTextUnderlined : constant sfTextStyle := 4; sfTextStrikeThrough : constant sfTextStyle := 8; --////////////////////////////////////////////////////////// --/ @brief Create a new text --/ --/ @return A new sfText object, or NULL if it failed --/ --////////////////////////////////////////////////////////// function create return sfText_Ptr; --////////////////////////////////////////////////////////// --/ @brief Copy an existing text --/ --/ @param text Text to copy --/ --/ @return Copied object --/ --////////////////////////////////////////////////////////// function copy (text : sfText_Ptr) return sfText_Ptr; --////////////////////////////////////////////////////////// --/ @brief Destroy an existing text --/ --/ @param text Text to delete --/ --////////////////////////////////////////////////////////// procedure destroy (text : sfText_Ptr); --////////////////////////////////////////////////////////// --/ @brief Set the position of a text --/ --/ This function completely overwrites the previous position. --/ See sfText_move to apply an offset based on the previous position instead. --/ The default position of a text Text object is (0, 0). --/ --/ @param text Text object --/ @param position New position --/ --////////////////////////////////////////////////////////// procedure setPosition (text : sfText_Ptr; position : Sf.System.Vector2.sfVector2f); --////////////////////////////////////////////////////////// --/ @brief Set the orientation of a text --/ --/ This function completely overwrites the previous rotation. --/ See sfText_rotate to add an angle based on the previous rotation instead. --/ The default rotation of a text Text object is 0. --/ --/ @param text Text object --/ @param angle New rotation, in degrees --/ --////////////////////////////////////////////////////////// procedure setRotation (text : sfText_Ptr; angle : float); --////////////////////////////////////////////////////////// --/ @brief Set the scale factors of a text --/ --/ This function completely overwrites the previous scale. --/ See sfText_scale to add a factor based on the previous scale instead. --/ The default scale of a text Text object is (1, 1). --/ --/ @param text Text object --/ @param scale New scale factors --/ --////////////////////////////////////////////////////////// procedure setScale (text : sfText_Ptr; scale : Sf.System.Vector2.sfVector2f); --////////////////////////////////////////////////////////// --/ @brief Set the local origin of a text --/ --/ The origin of an object defines the center point for --/ all transformations (position, scale, rotation). --/ The coordinates of this point must be relative to the --/ top-left corner of the object, and ignore all --/ transformations (position, scale, rotation). --/ The default origin of a text object is (0, 0). --/ --/ @param text Text object --/ @param origin New origin --/ --////////////////////////////////////////////////////////// procedure setOrigin (text : sfText_Ptr; origin : Sf.System.Vector2.sfVector2f); --////////////////////////////////////////////////////////// --/ @brief Get the position of a text --/ --/ @param text Text object --/ --/ @return Current position --/ --////////////////////////////////////////////////////////// function getPosition (text : sfText_Ptr) return Sf.System.Vector2.sfVector2f; --////////////////////////////////////////////////////////// --/ @brief Get the orientation of a text --/ --/ The rotation is always in the range [0, 360]. --/ --/ @param text Text object --/ --/ @return Current rotation, in degrees --/ --////////////////////////////////////////////////////////// function getRotation (text : sfText_Ptr) return float; --////////////////////////////////////////////////////////// --/ @brief Get the current scale of a text --/ --/ @param text Text object --/ --/ @return Current scale factors --/ --////////////////////////////////////////////////////////// function getScale (text : sfText_Ptr) return Sf.System.Vector2.sfVector2f; --////////////////////////////////////////////////////////// --/ @brief Get the local origin of a text --/ --/ @param text Text object --/ --/ @return Current origin --/ --////////////////////////////////////////////////////////// function getOrigin (text : sfText_Ptr) return Sf.System.Vector2.sfVector2f; --////////////////////////////////////////////////////////// --/ @brief Move a text by a given offset --/ --/ This function adds to the current position of the object, --/ unlike sfText_setPosition which overwrites it. --/ --/ @param text Text object --/ @param offset Offset --/ --////////////////////////////////////////////////////////// procedure move (text : sfText_Ptr; offset : Sf.System.Vector2.sfVector2f); --////////////////////////////////////////////////////////// --/ @brief Rotate a text --/ --/ This function adds to the current rotation of the object, --/ unlike sfText_setRotation which overwrites it. --/ --/ @param text Text object --/ @param angle Angle of rotation, in degrees --/ --////////////////////////////////////////////////////////// procedure rotate (text : sfText_Ptr; angle : float); --////////////////////////////////////////////////////////// --/ @brief Scale a text --/ --/ This function multiplies the current scale of the object, --/ unlike sfText_setScale which overwrites it. --/ --/ @param text Text object --/ @param factors Scale factors --/ --////////////////////////////////////////////////////////// procedure scale (text : sfText_Ptr; factors : Sf.System.Vector2.sfVector2f); --////////////////////////////////////////////////////////// --/ @brief Get the combined transform of a text --/ --/ @param text Text object --/ --/ @return Transform combining the position/rotation/scale/origin of the object --/ --////////////////////////////////////////////////////////// function getTransform (text : sfText_Ptr) return Sf.Graphics.Transform.sfTransform; --////////////////////////////////////////////////////////// --/ @brief Get the inverse of the combined transform of a text --/ --/ @param text Text object --/ --/ @return Inverse of the combined transformations applied to the object --/ --////////////////////////////////////////////////////////// function getInverseTransform (text : sfText_Ptr) return Sf.Graphics.Transform.sfTransform; --////////////////////////////////////////////////////////// --/ @brief Set the string of a text (from an ANSI string) --/ --/ A text's string is empty by default. --/ --/ @param text Text object --/ @param str New string --/ --////////////////////////////////////////////////////////// procedure setString (text : sfText_Ptr; str : String); --////////////////////////////////////////////////////////// --/ @brief Set the string of a text (from a unicode string) --/ --/ @param text Text object --/ @param str New string --/ --////////////////////////////////////////////////////////// procedure setUnicodeString (text : sfText_Ptr; str : access sfUint32); --////////////////////////////////////////////////////////// --/ @brief Set the font of a text --/ --/ The @a font argument refers to a texture that must --/ exist as long as the text uses it. Indeed, the text --/ doesn't store its own copy of the font, but rather keeps --/ a pointer to the one that you passed to this function. --/ If the font is destroyed and the text tries to --/ use it, the behaviour is undefined. --/ --/ @param text Text object --/ @param font New font --/ --////////////////////////////////////////////////////////// procedure setFont (text : sfText_Ptr; font : sfFont_Ptr); --////////////////////////////////////////////////////////// --/ @brief Set the character size of a text --/ --/ The default size is 30. --/ --/ @param text Text object --/ @param size New character size, in pixels --/ --////////////////////////////////////////////////////////// procedure setCharacterSize (text : sfText_Ptr; size : sfUint32); --////////////////////////////////////////////////////////// --/ @brief Set the line spacing factor --/ --/ The default spacing between lines is defined by the font. --/ This method enables you to set a factor for the spacing --/ between lines. By default the line spacing factor is 1. --/ --/ @param text Text object --/ @param spacingFactor New line spacing factor --/ --/ @see sfText_getLineSpacing --/ --////////////////////////////////////////////////////////// procedure setLineSpacing (text : sfText_Ptr; spacingFactor : float); --////////////////////////////////////////////////////////// --/ @brief Set the letter spacing factor --/ --/ The default spacing between letters is defined by the font. --/ This factor doesn't directly apply to the existing --/ spacing between each character, it rather adds a fixed --/ space between them which is calculated from the font --/ metrics and the character size. --/ Note that factors below 1 (including negative numbers) bring --/ characters closer to each other. --/ By default the letter spacing factor is 1. --/ --/ @param text Text object --/ @param spacingFactor New letter spacing factor --/ --/ @see sfText_getLetterSpacing --/ --////////////////////////////////////////////////////////// procedure setLetterSpacing (text : sfText_Ptr; spacingFactor : float); --////////////////////////////////////////////////////////// --/ @brief Set the style of a text --/ --/ You can pass a combination of one or more styles, for --/ example sfTextBold | sfTextItalic. --/ The default style is sfTextRegular. --/ --/ @param text Text object --/ @param style New style --/ --////////////////////////////////////////////////////////// procedure setStyle (text : sfText_Ptr; style : sfTextStyle); --////////////////////////////////////////////////////////// --/ @brief Set the fill color of a text --/ --/ By default, the text's fill color is opaque white. --/ Setting the fill color to a transparent color with an outline --/ will cause the outline to be displayed in the fill area of the text. --/ --/ @param text Text object --/ @param color New fill color of the text --/ --/ @deprecated This function is deprecated and may be removed in future releases. --/ Use sfText_setFillColor instead. --/ --////////////////////////////////////////////////////////// procedure setColor (text : sfText_Ptr; color : Sf.Graphics.Color.sfColor); --////////////////////////////////////////////////////////// --/ @brief Set the fill color of a text --/ --/ By default, the text's fill color is opaque white. --/ Setting the fill color to a transparent color with an outline --/ will cause the outline to be displayed in the fill area of the text. --/ --/ @param text Text object --/ @param color New fill color of the text --/ --////////////////////////////////////////////////////////// procedure setFillColor (text : sfText_Ptr; color : Sf.Graphics.Color.sfColor); --////////////////////////////////////////////////////////// --/ @brief Set the outline color of the text --/ --/ By default, the text's outline color is opaque black. --/ --/ @param text Text object --/ @param color New outline color of the text --/ --////////////////////////////////////////////////////////// procedure setOutlineColor (text : sfText_Ptr; color : Sf.Graphics.Color.sfColor); --////////////////////////////////////////////////////////// --/ @brief Set the thickness of the text's outline --/ --/ By default, the outline thickness is 0. --/ --/ Be aware that using a negative value for the outline --/ thickness will cause distorted rendering. --/ --/ @param thickness New outline thickness, in pixels --/ --/ @see getOutlineThickness --/ --////////////////////////////////////////////////////////// procedure setOutlineThickness (text : sfText_Ptr; thickness : float); --////////////////////////////////////////////////////////// --/ @brief Get the string of a text (returns an ANSI string) --/ --/ @param text Text object --/ --/ @return String as a locale-dependant ANSI string --/ --////////////////////////////////////////////////////////// function getString (text : sfText_Ptr) return String; --////////////////////////////////////////////////////////// --/ @brief Get the string of a text (returns a unicode string) --/ --/ @param text Text object --/ --/ @return String as UTF-32 --/ --////////////////////////////////////////////////////////// function getUnicodeString (text : sfText_Ptr) return access sfUint32; --////////////////////////////////////////////////////////// --/ @brief Get the font used by a text --/ --/ If the text has no font attached, a NULL pointer is returned. --/ The returned pointer is const, which means that you can't --/ modify the font when you retrieve it with this function. --/ --/ @param text Text object --/ --/ @return Pointer to the font --/ --////////////////////////////////////////////////////////// function getFont (text : sfText_Ptr) return sfFont_Ptr; --////////////////////////////////////////////////////////// --/ @brief Get the size of the characters of a text --/ --/ @param text Text object --/ --/ @return Size of the characters --/ --////////////////////////////////////////////////////////// function getCharacterSize (text : sfText_Ptr) return sfUint32; --////////////////////////////////////////////////////////// --/ @brief Get the size of the letter spacing factor --/ --/ @param text Text object --/ --/ @return Size of the letter spacing factor --/ --/ @see sfText_setLetterSpacing --/ --////////////////////////////////////////////////////////// function getLetterSpacing (text : sfText_Ptr) return float; --////////////////////////////////////////////////////////// --/ @brief Get the size of the line spacing factor --/ --/ @param text Text object --/ --/ @return Size of the line spacing factor --/ --/ @see sfText_setLineSpacing --/ --////////////////////////////////////////////////////////// function getLineSpacing (text : sfText_Ptr) return float; --////////////////////////////////////////////////////////// --/ @brief Get the style of a text --/ --/ @param text Text object --/ --/ @return Current string style (see sfTextStyle enum) --/ --////////////////////////////////////////////////////////// function getStyle (text : sfText_Ptr) return sfTextStyle; --////////////////////////////////////////////////////////// --/ @brief Get the fill color of a text --/ --/ @param text Text object --/ --/ @return Fill color of the text --/ --/ @deprecated This function is deprecated and may be removed in future releases. --/ Use sfText_getFillColor instead. --/ --////////////////////////////////////////////////////////// function getColor (text : sfText_Ptr) return Sf.Graphics.Color.sfColor; --////////////////////////////////////////////////////////// --/ @brief Get the fill color of a text --/ --/ @param text Text object --/ --/ @return Fill color of the text --/ --////////////////////////////////////////////////////////// function getFillColor (text : sfText_Ptr) return Sf.Graphics.Color.sfColor; --////////////////////////////////////////////////////////// --/ @brief Get the outline color of a text --/ --/ @param text Text object --/ --/ @return Outline color of the text --/ --////////////////////////////////////////////////////////// function getOutlineColor (text : sfText_Ptr) return Sf.Graphics.Color.sfColor; --////////////////////////////////////////////////////////// --/ @brief Get the outline thickness of a text --/ --/ @param text Text object --/ --/ @return Outline thickness of a text, in pixels --/ --////////////////////////////////////////////////////////// function getOutlineThickness (text : sfText_Ptr) return float; --////////////////////////////////////////////////////////// --/ @brief Return the position of the @a index-th character in a text --/ --/ This function computes the visual position of a character --/ from its index in the string. The returned position is --/ in global coordinates (translation, rotation, scale and --/ origin are applied). --/ If @a index is out of range, the position of the end of --/ the string is returned. --/ --/ @param text Text object --/ @param index Index of the character --/ --/ @return Position of the character --/ --////////////////////////////////////////////////////////// function findCharacterPos (text : sfText_Ptr; index : sfSize_t) return Sf.System.Vector2.sfVector2f; --////////////////////////////////////////////////////////// --/ @brief Get the local bounding rectangle of a text --/ --/ The returned rectangle is in local coordinates, which means --/ that it ignores the transformations (translation, rotation, --/ scale, ...) that are applied to the entity. --/ In other words, this function returns the bounds of the --/ entity in the entity's coordinate system. --/ --/ @param text Text object --/ --/ @return Local bounding rectangle of the entity --/ --////////////////////////////////////////////////////////// function getLocalBounds (text : sfText_Ptr) return Sf.Graphics.Rect.sfFloatRect; --////////////////////////////////////////////////////////// --/ @brief Get the global bounding rectangle of a text --/ --/ The returned rectangle is in global coordinates, which means --/ that it takes in account the transformations (translation, --/ rotation, scale, ...) that are applied to the entity. --/ In other words, this function returns the bounds of the --/ text in the global 2D world's coordinate system. --/ --/ @param text Text object --/ --/ @return Global bounding rectangle of the entity --/ --////////////////////////////////////////////////////////// function getGlobalBounds (text : sfText_Ptr) return Sf.Graphics.Rect.sfFloatRect; private pragma Import (C, create, "sfText_create"); pragma Import (C, copy, "sfText_copy"); pragma Import (C, destroy, "sfText_destroy"); pragma Import (C, setPosition, "sfText_setPosition"); pragma Import (C, setRotation, "sfText_setRotation"); pragma Import (C, setScale, "sfText_setScale"); pragma Import (C, setOrigin, "sfText_setOrigin"); pragma Import (C, getPosition, "sfText_getPosition"); pragma Import (C, getRotation, "sfText_getRotation"); pragma Import (C, getScale, "sfText_getScale"); pragma Import (C, getOrigin, "sfText_getOrigin"); pragma Import (C, move, "sfText_move"); pragma Import (C, rotate, "sfText_rotate"); pragma Import (C, scale, "sfText_scale"); pragma Import (C, getTransform, "sfText_getTransform"); pragma Import (C, getInverseTransform, "sfText_getInverseTransform"); pragma Import (C, setUnicodeString, "sfText_setUnicodeString"); pragma Import (C, setFont, "sfText_setFont"); pragma Import (C, setCharacterSize, "sfText_setCharacterSize"); pragma Import (C, setLineSpacing, "sfText_setLineSpacing"); pragma Import (C, setLetterSpacing, "sfText_setLetterSpacing"); pragma Import (C, setStyle, "sfText_setStyle"); pragma Import (C, setColor, "sfText_setColor"); pragma Import (C, setFillColor, "sfText_setFillColor"); pragma Import (C, setOutlineColor, "sfText_setOutlineColor"); pragma Import (C, setOutlineThickness, "sfText_setOutlineThickness"); pragma Import (C, getUnicodeString, "sfText_getUnicodeString"); pragma Import (C, getFont, "sfText_getFont"); pragma Import (C, getCharacterSize, "sfText_getCharacterSize"); pragma Import (C, getLetterSpacing, "sfText_getLetterSpacing"); pragma Import (C, getLineSpacing, "getLineSpacing"); pragma Import (C, getStyle, "sfText_getStyle"); pragma Import (C, getColor, "sfText_getColor"); pragma Import (C, getFillColor, "sfText_getFillColor"); pragma Import (C, getOutlineColor, "sfText_getOutlineColor"); pragma Import (C, getOutlineThickness, "sfText_getOutlineThickness"); pragma Import (C, findCharacterPos, "sfText_findCharacterPos"); pragma Import (C, getLocalBounds, "sfText_getLocalBounds"); pragma Import (C, getGlobalBounds, "sfText_getGlobalBounds"); end Sf.Graphics.Text;
with ACO.Events; package body ACO.Protocols.Error_Control is overriding function Is_Valid (This : in out EC; Msg : in ACO.Messages.Message) return Boolean is pragma Unreferenced (This); use type ACO.Messages.Function_Code; begin return ACO.Messages.Func_Code (Msg) = EC_Id; end Is_Valid; procedure Message_Received (This : in out EC; Msg : in ACO.Messages.Message) is begin if EC_Commands.Is_Valid_Command (Msg, This.Id) then declare Hbt_State : constant EC_Commands.EC_State := EC_Commands.Get_EC_State (Msg); Id : constant ACO.Messages.Node_Nr := ACO.Messages.Node_Id (Msg); begin This.Od.Events.Node_Events.Put ((Event => ACO.Events.Heartbeat_Received, Received_Heartbeat => (Id => Id, State => EC_Commands.To_State (Hbt_State)))); This.On_Heartbeat (Id, Hbt_State); end; end if; end Message_Received; procedure EC_Log (This : in out EC; Level : in ACO.Log.Log_Level; Message : in String) is pragma Unreferenced (This); begin ACO.Log.Put_Line (Level, "(EC) " & Message); end EC_Log; end ACO.Protocols.Error_Control;
package body GNAT.Regpat is function Compile (Expression : String; Flags : Regexp_Flags := No_Flags) return Pattern_Matcher is begin raise Program_Error; -- unimplemented return Compile (Expression, Flags); end Compile; function Match ( Self : Pattern_Matcher; Data : String; Data_First : Integer := -1; Data_Last : Positive := Positive'Last) return Boolean is begin raise Program_Error; -- unimplemented return Match (Self, Data, Data_First, Data_Last); end Match; procedure Match ( Self : Pattern_Matcher; Data : String; Matches : out Match_Array; Data_First : Integer := -1; Data_Last : Positive := Positive'Last) is begin raise Program_Error; -- unimplemented end Match; end GNAT.Regpat;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . S P I T B O L . P A T T E R N S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1997-2015, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- SPITBOL-like pattern construction and matching -- This child package of GNAT.SPITBOL provides a complete implementation -- of the SPITBOL-like pattern construction and matching operations. This -- package is based on Macro-SPITBOL created by Robert Dewar. ------------------------------------------------------------ -- Summary of Pattern Matching Packages in GNAT Hierarchy -- ------------------------------------------------------------ -- There are three related packages that perform pattern matching functions. -- the following is an outline of these packages, to help you determine -- which is best for your needs. -- GNAT.Regexp (files g-regexp.ads/g-regexp.adb) -- This is a simple package providing Unix-style regular expression -- matching with the restriction that it matches entire strings. It -- is particularly useful for file name matching, and in particular -- it provides "globbing patterns" that are useful in implementing -- unix or DOS style wild card matching for file names. -- GNAT.Regpat (files g-regpat.ads/g-regpat.adb) -- This is a more complete implementation of Unix-style regular -- expressions, copied from the original V7 style regular expression -- library written in C by Henry Spencer. It is functionally the -- same as this library, and uses the same internal data structures -- stored in a binary compatible manner. -- GNAT.Spitbol.Patterns (files g-spipat.ads/g-spipat.adb) -- This is a completely general patterm matching package based on the -- pattern language of SNOBOL4, as implemented in SPITBOL. The pattern -- language is modeled on context free grammars, with context sensitive -- extensions that provide full (type 0) computational capabilities. with Ada.Strings.Maps; use Ada.Strings.Maps; with Ada.Text_IO; use Ada.Text_IO; package GNAT.Spitbol.Patterns is pragma Elaborate_Body; ------------------------------- -- Pattern Matching Tutorial -- ------------------------------- -- A pattern matching operation (a call to one of the Match subprograms) -- takes a subject string and a pattern, and optionally a replacement -- string. The replacement string option is only allowed if the subject -- is a variable. -- The pattern is matched against the subject string, and either the -- match fails, or it succeeds matching a contiguous substring. If a -- replacement string is specified, then the subject string is modified -- by replacing the matched substring with the given replacement. -- Concatenation and Alternation -- ============================= -- A pattern consists of a series of pattern elements. The pattern is -- built up using either the concatenation operator: -- A & B -- which means match A followed immediately by matching B, or the -- alternation operator: -- A or B -- which means first attempt to match A, and then if that does not -- succeed, match B. -- There is full backtracking, which means that if a given pattern -- element fails to match, then previous alternatives are matched. -- For example if we have the pattern: -- (A or B) & (C or D) & (E or F) -- First we attempt to match A, if that succeeds, then we go on to try -- to match C, and if that succeeds, we go on to try to match E. If E -- fails, then we try F. If F fails, then we go back and try matching -- D instead of C. Let's make this explicit using a specific example, -- and introducing the simplest kind of pattern element, which is a -- literal string. The meaning of this pattern element is simply to -- match the characters that correspond to the string characters. Now -- let's rewrite the above pattern form with specific string literals -- as the pattern elements: -- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ") -- The following strings will be attempted in sequence: -- ABC . DEF . GH -- ABC . DEF . IJ -- ABC . CDE . GH -- ABC . CDE . IJ -- AB . DEF . GH -- AB . DEF . IJ -- AB . CDE . GH -- AB . CDE . IJ -- Here we use the dot simply to separate the pieces of the string -- matched by the three separate elements. -- Moving the Start Point -- ====================== -- A pattern is not required to match starting at the first character -- of the string, and is not required to match to the end of the string. -- The first attempt does indeed attempt to match starting at the first -- character of the string, trying all the possible alternatives. But -- if all alternatives fail, then the starting point of the match is -- moved one character, and all possible alternatives are attempted at -- the new anchor point. -- The entire match fails only when every possible starting point has -- been attempted. As an example, suppose that we had the subject -- string -- "ABABCDEIJKL" -- matched using the pattern in the previous example: -- ("ABC" or "AB") & ("DEF" or "CDE") & ("GH" or "IJ") -- would succeed, after two anchor point moves: -- "ABABCDEIJKL" -- ^^^^^^^ -- matched -- section -- This mode of pattern matching is called the unanchored mode. It is -- also possible to put the pattern matcher into anchored mode by -- setting the global variable Anchored_Mode to True. This will cause -- all subsequent matches to be performed in anchored mode, where the -- match is required to start at the first character. -- We will also see later how the effect of an anchored match can be -- obtained for a single specified anchor point if this is desired. -- Other Pattern Elements -- ====================== -- In addition to strings (or single characters), there are many special -- pattern elements that correspond to special predefined alternations: -- Arb Matches any string. First it matches the null string, and -- then on a subsequent failure, matches one character, and -- then two characters, and so on. It only fails if the -- entire remaining string is matched. -- Bal Matches a non-empty string that is parentheses balanced -- with respect to ordinary () characters. Examples of -- balanced strings are "ABC", "A((B)C)", and "A(B)C(D)E". -- Bal matches the shortest possible balanced string on the -- first attempt, and if there is a subsequent failure, -- attempts to extend the string. -- Cancel Immediately aborts the entire pattern match, signalling -- failure. This is a specialized pattern element, which is -- useful in conjunction with some of the special pattern -- elements that have side effects. -- Fail The null alternation. Matches no possible strings, so it -- always signals failure. This is a specialized pattern -- element, which is useful in conjunction with some of the -- special pattern elements that have side effects. -- Fence Matches the null string at first, and then if a failure -- causes alternatives to be sought, aborts the match (like -- a Cancel). Note that using Fence at the start of a pattern -- has the same effect as matching in anchored mode. -- Rest Matches from the current point to the last character in -- the string. This is a specialized pattern element, which -- is useful in conjunction with some of the special pattern -- elements that have side effects. -- Succeed Repeatedly matches the null string (it is equivalent to -- the alternation ("" or "" or "" ....). This is a special -- pattern element, which is useful in conjunction with some -- of the special pattern elements that have side effects. -- Pattern Construction Functions -- ============================== -- The following functions construct additional pattern elements -- Any(S) Where S is a string, matches a single character that is -- any one of the characters in S. Fails if the current -- character is not one of the given set of characters. -- Arbno(P) Where P is any pattern, matches any number of instances -- of the pattern, starting with zero occurrences. It is -- thus equivalent to ("" or (P & ("" or (P & ("" ....)))). -- The pattern P may contain any number of pattern elements -- including the use of alternation and concatenation. -- Break(S) Where S is a string, matches a string of zero or more -- characters up to but not including a break character -- that is one of the characters given in the string S. -- Can match the null string, but cannot match the last -- character in the string, since a break character is -- required to be present. -- BreakX(S) Where S is a string, behaves exactly like Break(S) when -- it first matches, but if a string is successfully matched, -- then a subsequent failure causes an attempt to extend the -- matched string. -- Fence(P) Where P is a pattern, attempts to match the pattern P -- including trying all possible alternatives of P. If none -- of these alternatives succeeds, then the Fence pattern -- fails. If one alternative succeeds, then the pattern -- match proceeds, but on a subsequent failure, no attempt -- is made to search for alternative matches of P. The -- pattern P may contain any number of pattern elements -- including the use of alternation and concatenation. -- Len(N) Where N is a natural number, matches the given number of -- characters. For example, Len(10) matches any string that -- is exactly ten characters long. -- NotAny(S) Where S is a string, matches a single character that is -- not one of the characters of S. Fails if the current -- character is one of the given set of characters. -- NSpan(S) Where S is a string, matches a string of zero or more -- characters that is among the characters given in the -- string. Always matches the longest possible such string. -- Always succeeds, since it can match the null string. -- Pos(N) Where N is a natural number, matches the null string -- if exactly N characters have been matched so far, and -- otherwise fails. -- Rpos(N) Where N is a natural number, matches the null string -- if exactly N characters remain to be matched, and -- otherwise fails. -- Rtab(N) Where N is a natural number, matches characters from -- the current position until exactly N characters remain -- to be matched in the string. Fails if fewer than N -- unmatched characters remain in the string. -- Tab(N) Where N is a natural number, matches characters from -- the current position until exactly N characters have -- been matched in all. Fails if more than N characters -- have already been matched. -- Span(S) Where S is a string, matches a string of one or more -- characters that is among the characters given in the -- string. Always matches the longest possible such string. -- Fails if the current character is not one of the given -- set of characters. -- Recursive Pattern Matching -- ========================== -- The plus operator (+P) where P is a pattern variable, creates -- a recursive pattern that will, at pattern matching time, follow -- the pointer to obtain the referenced pattern, and then match this -- pattern. This may be used to construct recursive patterns. Consider -- for example: -- P := ("A" or ("B" & (+P))) -- On the first attempt, this pattern attempts to match the string "A". -- If this fails, then the alternative matches a "B", followed by an -- attempt to match P again. This second attempt first attempts to -- match "A", and so on. The result is a pattern that will match a -- string of B's followed by a single A. -- This particular example could simply be written as NSpan('B') & 'A', -- but the use of recursive patterns in the general case can construct -- complex patterns which could not otherwise be built. -- Pattern Assignment Operations -- ============================= -- In addition to the overall result of a pattern match, which indicates -- success or failure, it is often useful to be able to keep track of -- the pieces of the subject string that are matched by individual -- pattern elements, or subsections of the pattern. -- The pattern assignment operators allow this capability. The first -- form is the immediate assignment: -- P * S -- Here P is an arbitrary pattern, and S is a variable of type VString -- that will be set to the substring matched by P. This assignment -- happens during pattern matching, so if P matches more than once, -- then the assignment happens more than once. -- The deferred assignment operation: -- P ** S -- avoids these multiple assignments by deferring the assignment to the -- end of the match. If the entire match is successful, and if the -- pattern P was part of the successful match, then at the end of the -- matching operation the assignment to S of the string matching P is -- performed. -- The cursor assignment operation: -- Setcur(N'Access) -- assigns the current cursor position to the natural variable N. The -- cursor position is defined as the count of characters that have been -- matched so far (including any start point moves). -- Finally the operations * and ** may be used with values of type -- Text_IO.File_Access. The effect is to do a Put_Line operation of -- the matched substring. These are particularly useful in debugging -- pattern matches. -- Deferred Matching -- ================= -- The pattern construction functions (such as Len and Any) all permit -- the use of pointers to natural or string values, or functions that -- return natural or string values. These forms cause the actual value -- to be obtained at pattern matching time. This allows interesting -- possibilities for constructing dynamic patterns as illustrated in -- the examples section. -- In addition the (+S) operator may be used where S is a pointer to -- string or function returning string, with a similar deferred effect. -- A special use of deferred matching is the construction of predicate -- functions. The element (+P) where P is an access to a function that -- returns a Boolean value, causes the function to be called at the -- time the element is matched. If the function returns True, then the -- null string is matched, if the function returns False, then failure -- is signalled and previous alternatives are sought. -- Deferred Replacement -- ==================== -- The simple model given for pattern replacement (where the matched -- substring is replaced by the string given as the third argument to -- Match) works fine in simple cases, but this approach does not work -- in the case where the expression used as the replacement string is -- dependent on values set by the match. -- For example, suppose we want to find an instance of a parenthesized -- character, and replace the parentheses with square brackets. At first -- glance it would seem that: -- Match (Subject, '(' & Len (1) * Char & ')', '[' & Char & ']'); -- would do the trick, but that does not work, because the third -- argument to Match gets evaluated too early, before the call to -- Match, and before the pattern match has had a chance to set Char. -- To solve this problem we provide the deferred replacement capability. -- With this approach, which of course is only needed if the pattern -- involved has side effects, is to do the match in two stages. The -- call to Match sets a pattern result in a variable of the private -- type Match_Result, and then a subsequent Replace operation uses -- this Match_Result object to perform the required replacement. -- Using this approach, we can now write the above operation properly -- in a manner that will work: -- M : Match_Result; -- ... -- Match (Subject, '(' & Len (1) * Char & ')', M); -- Replace (M, '[' & Char & ']'); -- As with other Match cases, there is a function and procedure form -- of this match call. A call to Replace after a failed match has no -- effect. Note that Subject should not be modified between the calls. -- Examples of Pattern Matching -- ============================ -- First a simple example of the use of pattern replacement to remove -- a line number from the start of a string. We assume that the line -- number has the form of a string of decimal digits followed by a -- period, followed by one or more spaces. -- Digs : constant Pattern := Span("0123456789"); -- Lnum : constant Pattern := Pos(0) & Digs & '.' & Span(' '); -- Now to use this pattern we simply do a match with a replacement: -- Match (Line, Lnum, ""); -- which replaces the line number by the null string. Note that it is -- also possible to use an Ada.Strings.Maps.Character_Set value as an -- argument to Span and similar functions, and in particular all the -- useful constants 'in Ada.Strings.Maps.Constants are available. This -- means that we could define Digs as: -- Digs : constant Pattern := Span(Decimal_Digit_Set); -- The style we use here, of defining constant patterns and then using -- them is typical. It is possible to build up patterns dynamically, -- but it is usually more efficient to build them in pieces in advance -- using constant declarations. Note in particular that although it is -- possible to construct a pattern directly as an argument for the -- Match routine, it is much more efficient to preconstruct the pattern -- as we did in this example. -- Now let's look at the use of pattern assignment to break a -- string into sections. Suppose that the input string has two -- unsigned decimal integers, separated by spaces or a comma, -- with spaces allowed anywhere. Then we can isolate the two -- numbers with the following pattern: -- Num1, Num2 : aliased VString; -- B : constant Pattern := NSpan(' '); -- N : constant Pattern := Span("0123456789"); -- T : constant Pattern := -- NSpan(' ') & N * Num1 & Span(" ,") & N * Num2; -- The match operation Match (" 124, 257 ", T) would assign the -- string 124 to Num1 and the string 257 to Num2. -- Now let's see how more complex elements can be built from the -- set of primitive elements. The following pattern matches strings -- that have the syntax of Ada 95 based literals: -- Digs : constant Pattern := Span(Decimal_Digit_Set); -- UDigs : constant Pattern := Digs & Arbno('_' & Digs); -- Edig : constant Pattern := Span(Hexadecimal_Digit_Set); -- UEdig : constant Pattern := Edig & Arbno('_' & Edig); -- Bnum : constant Pattern := Udigs & '#' & UEdig & '#'; -- A match against Bnum will now match the desired strings, e.g. -- it will match 16#123_abc#, but not a#b#. However, this pattern -- is not quite complete, since it does not allow colons to replace -- the pound signs. The following is more complete: -- Bchar : constant Pattern := Any("#:"); -- Bnum : constant Pattern := Udigs & Bchar & UEdig & Bchar; -- but that is still not quite right, since it allows # and : to be -- mixed, and they are supposed to be used consistently. We solve -- this by using a deferred match. -- Temp : aliased VString; -- Bnum : constant Pattern := -- Udigs & Bchar * Temp & UEdig & (+Temp) -- Here the first instance of the base character is stored in Temp, and -- then later in the pattern we rematch the value that was assigned. -- For an example of a recursive pattern, let's define a pattern -- that is like the built in Bal, but the string matched is balanced -- with respect to square brackets or curly brackets. -- The language for such strings might be defined in extended BNF as -- ELEMENT ::= <any character other than [] or {}> -- | '[' BALANCED_STRING ']' -- | '{' BALANCED_STRING '}' -- BALANCED_STRING ::= ELEMENT {ELEMENT} -- Here we use {} to indicate zero or more occurrences of a term, as -- is common practice in extended BNF. Now we can translate the above -- BNF into recursive patterns as follows: -- Element, Balanced_String : aliased Pattern; -- . -- . -- . -- Element := NotAny ("[]{}") -- or -- ('[' & (+Balanced_String) & ']') -- or -- ('{' & (+Balanced_String) & '}'); -- Balanced_String := Element & Arbno (Element); -- Note the important use of + here to refer to a pattern not yet -- defined. Note also that we use assignments precisely because we -- cannot refer to as yet undeclared variables in initializations. -- Now that this pattern is constructed, we can use it as though it -- were a new primitive pattern element, and for example, the match: -- Match ("xy[ab{cd}]", Balanced_String * Current_Output & Fail); -- will generate the output: -- x -- xy -- xy[ab{cd}] -- y -- y[ab{cd}] -- [ab{cd}] -- a -- ab -- ab{cd} -- b -- b{cd} -- {cd} -- c -- cd -- d -- Note that the function of the fail here is simply to force the -- pattern Balanced_String to match all possible alternatives. Studying -- the operation of this pattern in detail is highly instructive. -- Finally we give a rather elaborate example of the use of deferred -- matching. The following declarations build up a pattern which will -- find the longest string of decimal digits in the subject string. -- Max, Cur : VString; -- Loc : Natural; -- function GtS return Boolean is -- begin -- return Length (Cur) > Length (Max); -- end GtS; -- Digit : constant Character_Set := Decimal_Digit_Set; -- Digs : constant Pattern := Span(Digit); -- Find : constant Pattern := -- "" * Max & Fence & -- initialize Max to null -- BreakX (Digit) & -- scan looking for digits -- ((Span(Digit) * Cur & -- assign next string to Cur -- (+GtS'Unrestricted_Access) & -- check size(Cur) > Size(Max) -- Setcur(Loc'Access)) -- if so, save location -- * Max) & -- and assign to Max -- Fail; -- seek all alternatives -- As we see from the comments here, complex patterns like this take -- on aspects of sequential programs. In fact they are sequential -- programs with general backtracking. In this pattern, we first use -- a pattern assignment that matches null and assigns it to Max, so -- that it is initialized for the new match. Now BreakX scans to the -- next digit. Arb would do here, but BreakX will be more efficient. -- Once we have found a digit, we scan out the longest string of -- digits with Span, and assign it to Cur. The deferred call to GtS -- tests if the string we assigned to Cur is the longest so far. If -- not, then failure is signalled, and we seek alternatives (this -- means that BreakX will extend and look for the next digit string). -- If the call to GtS succeeds then the matched string is assigned -- as the largest string so far into Max and its location is saved -- in Loc. Finally Fail forces the match to fail and seek alternatives, -- so that the entire string is searched. -- If the pattern Find is matched against a string, the variable Max -- at the end of the pattern will have the longest string of digits, -- and Loc will be the starting character location of the string. For -- example, Match("ab123cd4657ef23", Find) will assign "4657" to Max -- and 11 to Loc (indicating that the string ends with the eleventh -- character of the string). -- Note: the use of Unrestricted_Access to reference GtS will not -- be needed if GtS is defined at the outer level, but definitely -- will be necessary if GtS is a nested function (in which case of -- course the scope of the pattern Find will be restricted to this -- nested scope, and this cannot be checked, i.e. use of the pattern -- outside this scope is erroneous). Generally it is a good idea to -- define patterns and the functions they call at the outer level -- where possible, to avoid such problems. -- Correspondence with Pattern Matching in SPITBOL -- =============================================== -- Generally the Ada syntax and names correspond closely to SPITBOL -- syntax for pattern matching construction. -- The basic pattern construction operators are renamed as follows: -- Spitbol Ada -- (space) & -- | or -- $ * -- . ** -- The Ada operators were chosen so that the relative precedences of -- these operators corresponds to that of the Spitbol operators, but -- as always, the use of parentheses is advisable to clarify. -- The pattern construction operators all have similar names except for -- Spitbol Ada -- Abort Cancel -- Rem Rest -- where we have clashes with Ada reserved names -- Ada requires the use of 'Access to refer to functions used in the -- pattern match, and often the use of 'Unrestricted_Access may be -- necessary to get around the scope restrictions if the functions -- are not declared at the outer level. -- The actual pattern matching syntax is modified in Ada as follows: -- Spitbol Ada -- X Y Match (X, Y); -- X Y = Z Match (X, Y, Z); -- and pattern failure is indicated by returning a Boolean result from -- the Match function (True for success, False for failure). ----------------------- -- Type Declarations -- ----------------------- type Pattern is private; -- Type representing a pattern. This package provides a complete set of -- operations for constructing patterns that can be used in the pattern -- matching operations provided. type Boolean_Func is access function return Boolean; -- General Boolean function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred predicate -- pattern. The function will be called when the pattern element is -- matched and failure signalled if False is returned. type Natural_Func is access function return Natural; -- General Natural function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred pattern. -- The function will be called when the pattern element is matched -- to obtain the currently referenced Natural value. type VString_Func is access function return VString; -- General VString function type. When this type is used as a formal -- parameter type in this package, it indicates a deferred pattern. -- The function will be called when the pattern element is matched -- to obtain the currently referenced string value. subtype PString is String; -- This subtype is used in the remainder of the package to indicate a -- formal parameter that is converted to its corresponding pattern, -- i.e. a pattern that matches the characters of the string. subtype PChar is Character; -- Similarly, this subtype is used in the remainder of the package to -- indicate a formal parameter that is converted to its corresponding -- pattern, i.e. a pattern that matches this one character. subtype VString_Var is VString; subtype Pattern_Var is Pattern; -- These synonyms are used as formal parameter types to a function where, -- if the language allowed, we would use in out parameters, but we are -- not allowed to have in out parameters for functions. Instead we pass -- actuals which must be variables, and with a bit of trickery in the -- body, manage to interpret them properly as though they were indeed -- in out parameters. pragma Warnings (Off, VString_Var); pragma Warnings (Off, Pattern_Var); -- We turn off warnings for these two types so that when variables are used -- as arguments in this context, warnings about them not being assigned in -- the source program will be suppressed. -------------------------------- -- Basic Pattern Construction -- -------------------------------- function "&" (L : Pattern; R : Pattern) return Pattern; function "&" (L : PString; R : Pattern) return Pattern; function "&" (L : Pattern; R : PString) return Pattern; function "&" (L : PChar; R : Pattern) return Pattern; function "&" (L : Pattern; R : PChar) return Pattern; -- Pattern concatenation. Matches L followed by R function "or" (L : Pattern; R : Pattern) return Pattern; function "or" (L : PString; R : Pattern) return Pattern; function "or" (L : Pattern; R : PString) return Pattern; function "or" (L : PString; R : PString) return Pattern; function "or" (L : PChar; R : Pattern) return Pattern; function "or" (L : Pattern; R : PChar) return Pattern; function "or" (L : PChar; R : PChar) return Pattern; function "or" (L : PString; R : PChar) return Pattern; function "or" (L : PChar; R : PString) return Pattern; -- Pattern alternation. Creates a pattern that will first try to match -- L and then on a subsequent failure, attempts to match R instead. ---------------------------------- -- Pattern Assignment Functions -- ---------------------------------- function "*" (P : Pattern; Var : VString_Var) return Pattern; function "*" (P : PString; Var : VString_Var) return Pattern; function "*" (P : PChar; Var : VString_Var) return Pattern; -- Matches P, and if the match succeeds, assigns the matched substring -- to the given VString variable Var. This assignment happens as soon as -- the substring is matched, and if the pattern P1 is matched more than -- once during the course of the match, then the assignment will occur -- more than once. function "**" (P : Pattern; Var : VString_Var) return Pattern; function "**" (P : PString; Var : VString_Var) return Pattern; function "**" (P : PChar; Var : VString_Var) return Pattern; -- Like "*" above, except that the assignment happens at most once -- after the entire match is completed successfully. If the match -- fails, then no assignment takes place. ---------------------------------- -- Deferred Matching Operations -- ---------------------------------- function "+" (Str : VString_Var) return Pattern; -- Here Str must be a VString variable. This function constructs a -- pattern which at pattern matching time will access the current -- value of this variable, and match against these characters. function "+" (Str : VString_Func) return Pattern; -- Constructs a pattern which at pattern matching time calls the given -- function, and then matches against the string or character value -- that is returned by the call. function "+" (P : Pattern_Var) return Pattern; -- Here P must be a Pattern variable. This function constructs a -- pattern which at pattern matching time will access the current -- value of this variable, and match against the pattern value. function "+" (P : Boolean_Func) return Pattern; -- Constructs a predicate pattern function that at pattern matching time -- calls the given function. If True is returned, then the pattern matches. -- If False is returned, then failure is signalled. -------------------------------- -- Pattern Building Functions -- -------------------------------- function Arb return Pattern; -- Constructs a pattern that will match any string. On the first attempt, -- the pattern matches a null string, then on each successive failure, it -- matches one more character, and only fails if matching the entire rest -- of the string. function Arbno (P : Pattern) return Pattern; function Arbno (P : PString) return Pattern; function Arbno (P : PChar) return Pattern; -- Pattern repetition. First matches null, then on a subsequent failure -- attempts to match an additional instance of the given pattern. -- Equivalent to (but more efficient than) P & ("" or (P & ("" or ... function Any (Str : String) return Pattern; function Any (Str : VString) return Pattern; function Any (Str : Character) return Pattern; function Any (Str : Character_Set) return Pattern; function Any (Str : not null access VString) return Pattern; function Any (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a single character that is one of -- the characters in the given argument. The pattern fails if the current -- character is not in Str. function Bal return Pattern; -- Constructs a pattern that will match any non-empty string that is -- parentheses balanced with respect to the normal parentheses characters. -- Attempts to extend the string if a subsequent failure occurs. function Break (Str : String) return Pattern; function Break (Str : VString) return Pattern; function Break (Str : Character) return Pattern; function Break (Str : Character_Set) return Pattern; function Break (Str : not null access VString) return Pattern; function Break (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a (possibly null) string which -- is immediately followed by a character in the given argument. This -- character is not part of the matched string. The pattern fails if -- the remaining characters to be matched do not include any of the -- characters in Str. function BreakX (Str : String) return Pattern; function BreakX (Str : VString) return Pattern; function BreakX (Str : Character) return Pattern; function BreakX (Str : Character_Set) return Pattern; function BreakX (Str : not null access VString) return Pattern; function BreakX (Str : VString_Func) return Pattern; -- Like Break, but the pattern attempts to extend on a failure to find -- the next occurrence of a character in Str, and only fails when the -- last such instance causes a failure. function Cancel return Pattern; -- Constructs a pattern that immediately aborts the entire match function Fail return Pattern; -- Constructs a pattern that always fails function Fence return Pattern; -- Constructs a pattern that matches null on the first attempt, and then -- causes the entire match to be aborted if a subsequent failure occurs. function Fence (P : Pattern) return Pattern; -- Constructs a pattern that first matches P. If P fails, then the -- constructed pattern fails. If P succeeds, then the match proceeds, -- but if subsequent failure occurs, alternatives in P are not sought. -- The idea of Fence is that each time the pattern is matched, just -- one attempt is made to match P, without trying alternatives. function Len (Count : Natural) return Pattern; function Len (Count : not null access Natural) return Pattern; function Len (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches exactly the given number of -- characters. The pattern fails if fewer than this number of characters -- remain to be matched in the string. function NotAny (Str : String) return Pattern; function NotAny (Str : VString) return Pattern; function NotAny (Str : Character) return Pattern; function NotAny (Str : Character_Set) return Pattern; function NotAny (Str : not null access VString) return Pattern; function NotAny (Str : VString_Func) return Pattern; -- Constructs a pattern that matches a single character that is not -- one of the characters in the given argument. The pattern Fails if -- the current character is in Str. function NSpan (Str : String) return Pattern; function NSpan (Str : VString) return Pattern; function NSpan (Str : Character) return Pattern; function NSpan (Str : Character_Set) return Pattern; function NSpan (Str : not null access VString) return Pattern; function NSpan (Str : VString_Func) return Pattern; -- Constructs a pattern that matches the longest possible string -- consisting entirely of characters from the given argument. The -- string may be empty, so this pattern always succeeds. function Pos (Count : Natural) return Pattern; function Pos (Count : not null access Natural) return Pattern; function Pos (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches the null string if exactly Count -- characters have already been matched, and otherwise fails. function Rest return Pattern; -- Constructs a pattern that always succeeds, matching the remaining -- unmatched characters in the pattern. function Rpos (Count : Natural) return Pattern; function Rpos (Count : not null access Natural) return Pattern; function Rpos (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches the null string if exactly Count -- characters remain to be matched in the string, and otherwise fails. function Rtab (Count : Natural) return Pattern; function Rtab (Count : not null access Natural) return Pattern; function Rtab (Count : Natural_Func) return Pattern; -- Constructs a pattern that matches from the current location until -- exactly Count characters remain to be matched in the string. The -- pattern fails if fewer than Count characters remain to be matched. function Setcur (Var : not null access Natural) return Pattern; -- Constructs a pattern that matches the null string, and assigns the -- current cursor position in the string. This value is the number of -- characters matched so far. So it is zero at the start of the match. function Span (Str : String) return Pattern; function Span (Str : VString) return Pattern; function Span (Str : Character) return Pattern; function Span (Str : Character_Set) return Pattern; function Span (Str : not null access VString) return Pattern; function Span (Str : VString_Func) return Pattern; -- Constructs a pattern that matches the longest possible string -- consisting entirely of characters from the given argument. The -- string cannot be empty, so the pattern fails if the current -- character is not one of the characters in Str. function Succeed return Pattern; -- Constructs a pattern that succeeds matching null, both on the first -- attempt, and on any rematch attempt, i.e. it is equivalent to an -- infinite alternation of null strings. function Tab (Count : Natural) return Pattern; function Tab (Count : not null access Natural) return Pattern; function Tab (Count : Natural_Func) return Pattern; -- Constructs a pattern that from the current location until Count -- characters have been matched. The pattern fails if more than Count -- characters have already been matched. --------------------------------- -- Pattern Matching Operations -- --------------------------------- -- The Match function performs an actual pattern matching operation. -- The versions with three parameters perform a match without modifying -- the subject string and return a Boolean result indicating if the -- match is successful or not. The Anchor parameter is set to True to -- obtain an anchored match in which the pattern is required to match -- the first character of the string. In an unanchored match, which is -- the default, successive attempts are made to match the given pattern -- at each character of the subject string until a match succeeds, or -- until all possibilities have failed. -- Note that pattern assignment functions in the pattern may generate -- side effects, so these functions are not necessarily pure. Anchored_Mode : Boolean := False; -- This global variable can be set True to cause all subsequent pattern -- matches to operate in anchored mode. In anchored mode, no attempt is -- made to move the anchor point, so that if the match succeeds it must -- succeed starting at the first character. Note that the effect of -- anchored mode may be achieved in individual pattern matches by using -- Fence or Pos(0) at the start of the pattern. Pattern_Stack_Overflow : exception; -- Exception raised if internal pattern matching stack overflows. This -- is typically the result of runaway pattern recursion. If there is a -- genuine case of stack overflow, then either the match must be broken -- down into simpler steps, or the stack limit must be reset. Stack_Size : constant Positive := 2000; -- Size used for internal pattern matching stack. Increase this size if -- complex patterns cause Pattern_Stack_Overflow to be raised. -- Simple match functions. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed, and -- the returned value indicates whether or not the match succeeded. function Match (Subject : VString; Pat : Pattern) return Boolean; function Match (Subject : VString; Pat : PString) return Boolean; function Match (Subject : String; Pat : Pattern) return Boolean; function Match (Subject : String; Pat : PString) return Boolean; -- Replacement functions. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed, and -- the returned value indicates whether or not the match succeeded. -- If the match succeeds, then the matched part of the subject string -- is replaced by the given Replace string. function Match (Subject : VString_Var; Pat : Pattern; Replace : VString) return Boolean; function Match (Subject : VString_Var; Pat : PString; Replace : VString) return Boolean; function Match (Subject : VString_Var; Pat : Pattern; Replace : String) return Boolean; function Match (Subject : VString_Var; Pat : PString; Replace : String) return Boolean; -- Simple match procedures. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed. No -- indication of success or failure is returned. procedure Match (Subject : VString; Pat : Pattern); procedure Match (Subject : VString; Pat : PString); procedure Match (Subject : String; Pat : Pattern); procedure Match (Subject : String; Pat : PString); -- Replacement procedures. The subject is matched against the pattern. -- Any immediate or deferred assignments or writes are executed. No -- indication of success or failure is returned. If the match succeeds, -- then the matched part of the subject string is replaced by the given -- Replace string. procedure Match (Subject : in out VString; Pat : Pattern; Replace : VString); procedure Match (Subject : in out VString; Pat : PString; Replace : VString); procedure Match (Subject : in out VString; Pat : Pattern; Replace : String); procedure Match (Subject : in out VString; Pat : PString; Replace : String); -- Deferred Replacement type Match_Result is private; -- Type used to record result of pattern match subtype Match_Result_Var is Match_Result; -- This synonyms is used as a formal parameter type to a function where, -- if the language allowed, we would use an in out parameter, but we are -- not allowed to have in out parameters for functions. Instead we pass -- actuals which must be variables, and with a bit of trickery in the -- body, manage to interpret them properly as though they were indeed -- in out parameters. function Match (Subject : VString_Var; Pat : Pattern; Result : Match_Result_Var) return Boolean; procedure Match (Subject : in out VString; Pat : Pattern; Result : out Match_Result); procedure Replace (Result : in out Match_Result; Replace : VString); -- Given a previous call to Match which set Result, performs a pattern -- replacement if the match was successful. Has no effect if the match -- failed. This call should immediately follow the Match call. ------------------------ -- Debugging Routines -- ------------------------ -- Debugging pattern matching operations can often be quite complex, -- since there is no obvious way to trace the progress of the match. -- The declarations in this section provide some debugging assistance. Debug_Mode : Boolean := False; -- This global variable can be set True to generate debugging on all -- subsequent calls to Match. The debugging output is a full trace of -- the actions of the pattern matcher, written to Standard_Output. The -- level of this information is intended to be comprehensible at the -- abstract level of this package declaration. However, note that the -- use of this switch often generates large amounts of output. function "*" (P : Pattern; Fil : File_Access) return Pattern; function "*" (P : PString; Fil : File_Access) return Pattern; function "*" (P : PChar; Fil : File_Access) return Pattern; function "**" (P : Pattern; Fil : File_Access) return Pattern; function "**" (P : PString; Fil : File_Access) return Pattern; function "**" (P : PChar; Fil : File_Access) return Pattern; -- These are similar to the corresponding pattern assignment operations -- except that instead of setting the value of a variable, the matched -- substring is written to the appropriate file. This can be useful in -- following the progress of a match without generating the full amount -- of information obtained by setting Debug_Mode to True. Terminal : constant File_Access := Standard_Error; Output : constant File_Access := Standard_Output; -- Two handy synonyms for use with the above pattern write operations -- Finally we have some routines that are useful for determining what -- patterns are in use, particularly if they are constructed dynamically. function Image (P : Pattern) return String; function Image (P : Pattern) return VString; -- This procedures yield strings that corresponds to the syntax needed -- to create the given pattern using the functions in this package. The -- form of this string is such that it could actually be compiled and -- evaluated to yield the required pattern except for references to -- variables and functions, which are output using one of the following -- forms: -- -- access Natural NP(16#...#) -- access Pattern PP(16#...#) -- access VString VP(16#...#) -- -- Natural_Func NF(16#...#) -- VString_Func VF(16#...#) -- -- where 16#...# is the hex representation of the integer address that -- corresponds to the given access value procedure Dump (P : Pattern); -- This procedure writes information about the pattern to Standard_Out. -- The format of this information is keyed to the internal data structures -- used to implement patterns. The information provided by Dump is thus -- more precise than that yielded by Image, but is also a bit more obscure -- (i.e. it cannot be interpreted solely in terms of this spec, you have -- to know something about the data structures). ------------------ -- Private Part -- ------------------ private type PE; -- Pattern element, a pattern is a complex structure of PE's. This type -- is defined and described in the body of this package. type PE_Ptr is access all PE; -- Pattern reference. PE's use PE_Ptr values to reference other PE's type Pattern is new Controlled with record Stk : Natural := 0; -- Maximum number of stack entries required for matching this -- pattern. See description of pattern history stack in body. P : PE_Ptr := null; -- Pointer to initial pattern element for pattern end record; pragma Finalize_Storage_Only (Pattern); procedure Adjust (Object : in out Pattern); -- Adjust routine used to copy pattern objects procedure Finalize (Object : in out Pattern); -- Finalization routine used to release storage allocated for a pattern type VString_Ptr is access all VString; type Match_Result is record Var : VString_Ptr; -- Pointer to subject string. Set to null if match failed Start : Natural := 1; -- Starting index position (1's origin) of matched section of -- subject string. Only valid if Var is non-null. Stop : Natural := 0; -- Ending index position (1's origin) of matched section of -- subject string. Only valid if Var is non-null. end record; pragma Volatile (Match_Result); -- This ensures that the Result parameter is passed by reference, so -- that we can play our games with the bogus Match_Result_Var parameter -- in the function case to treat it as though it were an in out parameter. end GNAT.Spitbol.Patterns;
with Ada.Text_IO; with Ada_Code; procedure Ada_Main is package ATI renames Ada.Text_Io; begin ATI.Put_Line ("Ada_Main: Calling Ada_Proc"); Ada_Code.Ada_Proc; ATI.Put_Line ("Ada_Main: Returned from Ada_Proc"); end Ada_Main;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . B B . M C U _ P A R A M E T E R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2016, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- -- The port of GNARL to bare board targets was initially developed by the -- -- Real-Time Systems Group at the Technical University of Madrid. -- -- -- ------------------------------------------------------------------------------ -- This package defines MCU parameters for the STM32F469x and STM32F479x -- family with Interfaces.STM32; with Interfaces.STM32.PWR; package System.BB.MCU_Parameters is pragma No_Elaboration_Code_All; pragma Preelaborate; use type Interfaces.STM32.Bit; Number_Of_Interrupts : constant := 94; procedure PWR_Initialize; procedure PWR_Overdrive_Enable; function Is_PWR_Stabilized return Boolean is (Interfaces.STM32.PWR.PWR_Periph.CSR.VOSRDY = 1); end System.BB.MCU_Parameters;
-- Copyright 2011-2016 Free Software Foundation, Inc. -- -- 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 3 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, see <http://www.gnu.org/licenses/>. package body Dn is procedure Do_Nothing (A : System.Address) is begin null; end Do_Nothing; end Dn;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2010-2012, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This package provides implementation of proxy to map collection of elements -- into internal representation used to represent value of object's attribute. ------------------------------------------------------------------------------ package AMF.Internals.Collections.Elements.Proxies is type Shared_Element_Collection_Proxy is new Shared_Element_Collection with record Collection : AMF.Internals.AMF_Collection_Of_Element; end record; type Shared_Element_Collection_Proxy_Access is access all Shared_Element_Collection_Proxy'Class; overriding function Length (Self : not null access constant Shared_Element_Collection_Proxy) return Natural; overriding procedure Clear (Self : not null access Shared_Element_Collection_Proxy); overriding function Element (Self : not null access constant Shared_Element_Collection_Proxy; Index : Positive) return not null AMF.Elements.Element_Access; overriding procedure Add (Self : not null access Shared_Element_Collection_Proxy; Item : not null AMF.Elements.Element_Access); overriding procedure Reference (Self : not null access Shared_Element_Collection_Proxy) is null; overriding procedure Unreference (Self : not null access Shared_Element_Collection_Proxy) is null; -- Reference to the proxy is owned by the collection table, reference -- counting is not used. end AMF.Internals.Collections.Elements.Proxies;
-- The Village of Vampire by YT, このソースコードはNYSLです with Ada.Formatting; package Tabula is pragma Pure; type Static_String_Access is access constant String; for Static_String_Access'Storage_Size use 0; -- string of Natural without spacing function Image is new Ada.Formatting.Integer_Image ( Natural, Signs => Ada.Formatting.Triming_Sign_Marks); end Tabula;
-- Copyright (C) 2011-2015 Free Software Foundation, Inc. -- -- 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 3 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, see <http://www.gnu.org/licenses/>. package Pck is function Ident (I : Integer) return Integer; end Pck;
-- { dg-do compile } with Varsize3_Pkg1; use Varsize3_Pkg1; procedure Varsize3_4 is Filter : Object renames True; begin null; end;
-- C9A011B.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT "TASKING_ERROR" IS RAISED BY A TIMED ENTRY CALL IF -- THE CALLED TASK IS ABORTED BEFORE THE DELAY EXPIRES BUT NOT -- WHEN THE CALL IS FIRST EXECUTED. -- HISTORY: -- DHH 06/14/88 CREATED ORIGINAL TEST. with Impdef; WITH SYSTEM; USE SYSTEM; WITH REPORT; USE REPORT; PROCEDURE C9A011B IS TASK TIMED_ENTRY IS ENTRY WAIT_AROUND; END TIMED_ENTRY; TASK OWNER IS ENTRY START; ENTRY SELF_ABORT; END OWNER; TASK BODY TIMED_ENTRY IS BEGIN SELECT OWNER.SELF_ABORT; OR DELAY 60.0 * Impdef.One_Second; END SELECT; FAILED("NO EXCEPTION RAISED"); ACCEPT WAIT_AROUND; EXCEPTION WHEN TASKING_ERROR => ACCEPT WAIT_AROUND; WHEN OTHERS => FAILED("WRONG EXCEPTION RAISED"); ACCEPT WAIT_AROUND; END TIMED_ENTRY; TASK BODY OWNER IS BEGIN ACCEPT START DO WHILE SELF_ABORT'COUNT = 0 LOOP DELAY 1.0 * Impdef.One_Second; END LOOP; END START; ABORT OWNER; ACCEPT SELF_ABORT; END OWNER; BEGIN TEST("C9A011B", "CHECK THAT ""TASKING_ERROR"" IS RAISED BY A " & "TIMED ENTRY CALL IF THE CALLED TASK IS " & "ABORTED BEFORE THE DELAY EXPIRES BUT NOT " & "WHEN THE CALL IS FIRST EXECUTED"); OWNER.START; DELAY 5.0 * Impdef.One_Second; IF TIMED_ENTRY'CALLABLE THEN TIMED_ENTRY.WAIT_AROUND; ELSE FAILED("TASK ABORTED WHEN TASKING ERROR IS RAISED"); END IF; RESULT; EXCEPTION WHEN OTHERS => FAILED("EXCEPTION RAISED OUTSIDE OF TASK"); RESULT; END C9A011B;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . T A S K _ I N F O -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains the definitions and routines associated with the -- implementation and use of the Task_Info pragma. It is specialized -- appropriately for targets that make use of this pragma. -- Note: the compiler generates direct calls to this interface, via Rtsfind. -- Any changes to this interface may require corresponding compiler changes. -- The functionality in this unit is now provided by the predefined package -- System.Multiprocessors and the CPU aspect. This package is obsolescent. package System.Task_Info is pragma Obsolescent (Task_Info, "use System.Multiprocessors and CPU aspect"); pragma Preelaborate; pragma Elaborate_Body; -- To ensure that a body is allowed ----------------------------------------- -- Implementation of Task_Info Feature -- ----------------------------------------- -- The Task_Info pragma: -- pragma Task_Info (EXPRESSION); -- allows the specification on a task by task basis of a value of type -- System.Task_Info.Task_Info_Type to be passed to a task when it is -- created. The specification of this type, and the effect on the task -- that is created is target dependent. -- The Task_Info pragma appears within a task definition (compare the -- definition and implementation of pragma Priority). If no such pragma -- appears, then the value Unspecified_Task_Info is passed. If a pragma -- is present, then it supplies an alternative value. If the argument of -- the pragma is a discriminant reference, then the value can be set on -- a task by task basis by supplying the appropriate discriminant value. -- Note that this means that the type used for Task_Info_Type must be -- suitable for use as a discriminant (i.e. a scalar or access type). ------------------ -- Declarations -- ------------------ type Scope_Type is (Process_Scope, -- Contend only with threads in same process System_Scope, -- Contend with all threads on same CPU Default_Scope); type Task_Info_Type is new Scope_Type; -- Type used for passing information to task create call, using the -- Task_Info pragma. This type may be specialized for individual -- implementations, but it must be a type that can be used as a -- discriminant (i.e. a scalar or access type). Unspecified_Task_Info : constant Task_Info_Type := Default_Scope; -- Value passed to task in the absence of a Task_Info pragma end System.Task_Info;
----------------------------------------------------------------------- -- security -- Security -- Copyright (C) 2010, 2011, 2012, 2015, 2017, 2018, 2019 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- = Security = -- The `Security` package provides a security framework that allows -- an application to use OpenID or OAuth security frameworks. This security -- framework was first developed within the Ada Server Faces project. -- It was moved to a separate project so that it can easyly be used with AWS. -- This package defines abstractions that are close or similar to Java -- security package. -- -- The security framework uses the following abstractions: -- -- * **Policy and policy manager**: -- The `Policy` defines and implements the set of security rules that specify how to -- protect the system or resources. The `Policy_Manager` maintains the security policies. -- -- * **Principal**: -- The `Principal` is the entity that can be authenticated. A principal is obtained -- after successful authentication of a user or of a system through an authorization process. -- The OpenID or OAuth authentication processes generate such security principal. -- -- * **Permission**: -- The `Permission` represents an access to a system or application resource. -- A permission is checked by using the security policy manager. The policy manager uses a -- security controller to enforce the permission. -- -- The `Security_Context` holds the contextual information that the security controller -- can use to verify the permission. The security context is associated with a principal and -- a set of policy context. -- -- == Overview == -- An application will create a security policy manager and register one or several security -- policies (yellow). The framework defines a simple role based security policy and an URL -- security policy intended to provide security in web applications. The security policy manager -- reads some security policy configuration file which allows the security policies to configure -- and create the security controllers. These controllers will enforce the security according -- to the application security rules. All these components are built only once when -- an application starts. -- -- A user is authenticated through an authentication system which creates a `Principal` -- instance that identifies the user (green). The security framework provides two authentication -- systems: OpenID and OAuth 2.0 OpenID Connect. -- -- [images/ModelOverview.png] -- -- When a permission must be enforced, a security context is created and linked to the -- `Principal` instance (blue). Additional security policy context can be added depending -- on the application context. To check the permission, the security policy manager is called -- and it will ask a security controller to verify the permission. -- -- The framework allows an application to plug its own security policy, its own policy context, -- its own principal and authentication mechanism. -- -- @include security-permissions.ads -- -- == Principal == -- A principal is created by using either the [Security_Auth OpenID], -- the [Security_OAuth OAuth] or another authentication mechanism. The authentication produces -- an object that must implement the `Principal` interface. For example: -- -- P : Security.Auth.Principal_Access := Security.Auth.Create_Principal (Auth); -- -- or -- -- P : Security.OAuth.Clients.Access_Token_Access := Security.OAuth.Clients.Create_Access_Token -- -- The principal is then stored in a security context. -- -- @include security-contexts.ads -- package Security is pragma Preelaborate; -- ------------------------------ -- Principal -- ------------------------------ type Principal is limited interface; type Principal_Access is access all Principal'Class; -- Get the principal name. function Get_Name (From : in Principal) return String is abstract; end Security;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015-2019, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- This packages provide a low level driver for the FAT file system -- architecture. It is recommended to _not_ use this interface directly but to -- access the file system using the File_IO package. For more info, see the -- file system chapter of the documentation. with System; with Interfaces; use Interfaces; with HAL; use HAL; with HAL.Block_Drivers; use HAL.Block_Drivers; with HAL.Filesystem; use HAL.Filesystem; package Filesystem.FAT is MAX_VOLUMES : constant := 1; -- Maximum number of mounted volumes MAX_FILENAME_LENGTH : constant := 255; -- Maximum size of a file or directory name MAX_FILE_HANDLES : constant := 10; -- Maximum number of handles opened simultaneously. MAX_DIR_HANDLES : constant := 10; -- Maximum number of handles opened simultaneously. type FAT_Name is private; type FAT_Filesystem is limited new Filesystem_Driver with private; type FAT_Filesystem_Access is access all FAT_Filesystem; type FAT_Node is new Node_Handle with private; ----------------------- -- PATH MANIPULATION -- ----------------------- function "-" (Name : FAT_Name) return String; function "-" (Name : String) return FAT_Name with Pre => Name'Length < MAX_FILENAME_LENGTH; overriding function "=" (Name1, Name2 : FAT_Name) return Boolean; function Is_Root (Path : String) return Boolean with Inline_Always; function Parent (Path : String) return String; function Basename (Path : String) return String; function Normalize (Path : String; Ensure_Dir : Boolean := False) return String; ------------------------ -- DIRECTORY HANDLING -- ------------------------ overriding function Open (FS : in out FAT_Filesystem; Path : String; Handle : out Any_Directory_Handle) return Status_Code; overriding function Root_Node (FS : in out FAT_Filesystem; As : String; Handle : out Any_Node_Handle) return Status_Code; function Long_Name (E : FAT_Node) return FAT_Name; function Short_Name (E : FAT_Node) return FAT_Name; overriding function Basename (E : FAT_Node) return String; overriding function Is_Read_Only (E : FAT_Node) return Boolean; overriding function Is_Hidden (E : FAT_Node) return Boolean; function Is_System_File (E : FAT_Node) return Boolean; overriding function Is_Symlink (E : FAT_Node) return Boolean; overriding function Is_Subdirectory (E : FAT_Node) return Boolean; function Is_Archive (E : FAT_Node) return Boolean; overriding function Size (E : FAT_Node) return File_Size; overriding procedure Close (E : in out FAT_Node); overriding function Get_FS (E : FAT_Node) return Any_Filesystem_Driver; ------------------- -- FILE HANDLING -- ------------------- overriding function Open (FS : in out FAT_Filesystem; Path : String; Mode : File_Mode; Handle : out Any_File_Handle) return Status_Code; overriding function Open (Parent : FAT_Node; Name : String; Mode : File_Mode; Handle : out Any_File_Handle) return Status_Code with Pre => Name'Length <= MAX_FILENAME_LENGTH; -------------------- -- FAT FILESYSTEM -- -------------------- function Open (Controller : HAL.Block_Drivers.Any_Block_Driver; LBA : Block_Number; FS : in out FAT_Filesystem) return Status_Code; -- Opens a FAT partition at the given LBA overriding procedure Close (FS : in out FAT_Filesystem); ----------------------- -- FAT FS PROPERTIES -- ----------------------- type FAT_Version is (FAT16, FAT32); function Version (FS : FAT_Filesystem) return FAT_Version; -- The FAT version of the volume function OEM_Name (FS : FAT_Filesystem) return String; -- The OEM Name of the Volume. Different from the Volume Label. function Is_Volume (FS : FAT_Filesystem) return Boolean; function Volume_ID (FS : FAT_Filesystem) return Unsigned_32; function Volume_Label (FS : FAT_Filesystem) return String; function File_System_Type (FS : FAT_Filesystem) return String; private type Cluster_Type is new Interfaces.Unsigned_32; subtype Valid_Cluster is Cluster_Type range 2 .. 16#0FFF_FFFF#; type Block_Offset is new Interfaces.Unsigned_32; type FAT_File_Size is new Interfaces.Unsigned_32; -- FAT Filesystem does not support files >= 4GB (e.g. 2**32) INVALID_CLUSTER : constant Cluster_Type := 0; FREE_CLUSTER_VALUE : constant Cluster_Type := 16#0000_0000#; LAST_CLUSTER_VALUE : constant Cluster_Type := 16#0FFF_FFFF#; BAD_CLUSTER_VALUE : constant Cluster_Type := 16#0FFF_FFF7#; function Get_Start_Cluster (E : FAT_Node) return Cluster_Type; function Size (E : FAT_Node) return FAT_File_Size; function Block_Size (FS : FAT_Filesystem) return FAT_File_Size; function Blocks_Per_Cluster (FS : FAT_Filesystem) return Block_Offset; function Cluster_Size (FS : FAT_Filesystem) return FAT_File_Size; function Reserved_Blocks (FS : FAT_Filesystem) return Unsigned_16; function Number_Of_FATs (FS : FAT_Filesystem) return Unsigned_8; function Total_Number_Of_Blocks (FS : FAT_Filesystem) return Unsigned_32; function FAT_Table_Size_In_Blocks (FS : FAT_Filesystem) return Unsigned_32; function Number_Of_Hidden_Blocks (FS : FAT_Filesystem) return Unsigned_32; function Root_Dir_Cluster (FS : FAT_Filesystem) return Cluster_Type; function FAT16_Root_Dir_Num_Entries (FS : FAT_Filesystem) return Unsigned_16; function Flags_For_FAT_Mirroring (FS : FAT_Filesystem) return Unsigned_16 with Pre => Version (FS) = FAT32; function FS_Version_Number (FS : FAT_Filesystem) return Unsigned_16 with Pre => Version (FS) = FAT32; function FSInfo_Block_Number (FS : FAT_Filesystem) return Unsigned_16 with Pre => Version (FS) = FAT32; function Boot_Block_Backup_Block_Number (FS : FAT_Filesystem) return Unsigned_16 with Pre => Version (FS) = FAT32; function Last_Known_Free_Data_Clusters_Number (FS : FAT_Filesystem) return Unsigned_32 with Pre => Version (FS) = FAT32; function Most_Recently_Allocated_Cluster (FS : FAT_Filesystem) return Cluster_Type with Pre => Version (FS) = FAT32; type FAT_Name is record Name : String (1 .. MAX_FILENAME_LENGTH); Len : Natural := 0; end record; type FAT_Disk_Parameter is record OEM_Name : String (1 .. 8); Block_Size_In_Bytes : Unsigned_16; Blocks_Per_Cluster : Unsigned_8; Reserved_Blocks : Unsigned_16; Number_Of_FATs : Unsigned_8; Root_Dir_Entries_Fat16 : Unsigned_16; Number_Of_Blocks_Fat16 : Unsigned_16; Removable_Drive : Boolean; Table_Size_Fat16 : Unsigned_16; Blocks_Per_Cylinder : Unsigned_16; Number_Of_Heads : Unsigned_16; Hidden_Blocks : Unsigned_32; Number_Of_Blocks_Fat32 : Unsigned_32; Table_Size_Fat32 : Unsigned_32; Fat_Mirroring_Flags : Unsigned_16; FS_Version_Number : Unsigned_16; Root_Directory_Cluster : Cluster_Type; FSInfo_Block_Number : Unsigned_16; Boot_Block_Backup_Block : Unsigned_16; Drive_Number_Fat32 : Unsigned_8; Current_Head_Fat32 : Unsigned_8; Boot_Signature_Fat32 : Unsigned_8; Volume_Id_Fat32 : Unsigned_32; Volume_Label_Fat32 : String (1 .. 11); FS_Type_Fat32 : String (1 .. 8); end record with Size => 92 * 8; for FAT_Disk_Parameter use record OEM_Name at 16#03# range 0 .. 63; Block_Size_In_Bytes at 16#0B# range 0 .. 15; Blocks_Per_Cluster at 16#0D# range 0 .. 7; Reserved_Blocks at 16#0E# range 0 .. 15; Number_Of_FATs at 16#10# range 0 .. 7; Root_Dir_Entries_Fat16 at 16#11# range 0 .. 15; Number_Of_Blocks_Fat16 at 16#13# range 0 .. 15; Removable_Drive at 16#15# range 2 .. 2; Table_Size_Fat16 at 16#16# range 0 .. 15; Blocks_Per_Cylinder at 16#18# range 0 .. 15; Number_Of_Heads at 16#1A# range 0 .. 15; Hidden_Blocks at 16#1C# range 0 .. 31; Number_Of_Blocks_Fat32 at 16#20# range 0 .. 31; Table_Size_Fat32 at 16#24# range 0 .. 31; Fat_Mirroring_Flags at 16#28# range 0 .. 15; FS_Version_Number at 16#2A# range 0 .. 15; Root_Directory_Cluster at 16#2C# range 0 .. 31; FSInfo_Block_Number at 16#30# range 0 .. 15; Boot_Block_Backup_Block at 16#32# range 0 .. 15; Drive_Number_Fat32 at 16#40# range 0 .. 7; Current_Head_Fat32 at 16#41# range 0 .. 7; Boot_Signature_Fat32 at 16#42# range 0 .. 7; Volume_Id_Fat32 at 16#43# range 0 .. 31; Volume_Label_Fat32 at 16#47# range 0 .. 87; FS_Type_Fat32 at 16#52# range 0 .. 63; end record; function Trim (S : String) return String; type FAT_FS_Info is record Signature : String (1 .. 4); Free_Clusters : Unsigned_32; Last_Allocated_Cluster : Cluster_Type; end record; for FAT_FS_Info use record Signature at 0 range 0 .. 31; Free_Clusters at 4 range 0 .. 31; Last_Allocated_Cluster at 8 range 0 .. 31; end record; type FAT_Filesystem is limited new Filesystem_Driver with record Initialized : Boolean := False; Disk_Parameters : FAT_Disk_Parameter; LBA : Block_Number; Controller : Any_Block_Driver; FSInfo : FAT_FS_Info; FSInfo_Changed : Boolean := False; Root_Dir_Area : Block_Offset := 0; Data_Area : Block_Offset; -- address to the data area, rel. to LBA FAT_Addr : Block_Offset; -- address to the FAT table, rel. to LBA Num_Clusters : Cluster_Type; Window_Block : Block_Offset := Block_Offset'Last; Window : Block (0 .. 511); FAT_Block : Block_Offset := Block_Offset'Last; FAT_Window : Block (0 .. 511); Root_Entry : aliased FAT_Node; end record; function Ensure_Block (FS : in out FAT_Filesystem; Block : Block_Offset) return Status_Code; -- Ensures the block is visible within the FS window. -- Block_Base_OFfset returns the index within the FS window of the block function Write_Window (FS : in out FAT_Filesystem) return Status_Code; function Cluster_To_Block (FS : FAT_Filesystem; Cluster : Cluster_Type) return Block_Offset is (FS.Data_Area + Block_Offset (Cluster - 2) * FS.Blocks_Per_Cluster); function "+" (Base : Block_Number; Off : Block_Offset) return Block_Number is (Base + Block_Number (Off)); function Get_FAT (FS : in out FAT_Filesystem; Cluster : Cluster_Type) return Cluster_Type; function Set_FAT (FS : in out FAT_Filesystem; Cluster : Cluster_Type; Value : Cluster_Type) return Status_Code; function Get_Free_Cluster (FS : in out FAT_Filesystem; Previous : Cluster_Type := INVALID_CLUSTER) return Cluster_Type; -- Retrieve a free cluster from the filesystem. -- Returns INVALID_CLUSTER in case the filesystem is full. procedure Write_FSInfo (FS : in out FAT_Filesystem); -- Writes back the FSInfo structure on the Filesystem function Is_Last_Cluster (FS : FAT_Filesystem; Ent : Cluster_Type) return Boolean is (case Version (FS) is when FAT16 => (Ent and 16#FFF8#) = 16#FFF8#, when FAT32 => (Ent and 16#0FFF_FFF8#) = 16#0FFF_FFF8#); -- return true if this is the last cluster for an entry function Is_Reserved_Cluster (FS : FAT_Filesystem; Ent : Cluster_Type) return Boolean is (case Version (FS) is when FAT16 => Ent > FS.Num_Clusters and Ent <= 16#FFF6#, when FAT32 => Ent > FS.Num_Clusters and Ent <= 16#0FFF_FFF6#); -- return true if this cluster is reserved function Is_Bad_Cluster (FS : FAT_Filesystem; Ent : Cluster_Type) return Boolean is (case Version (FS) is when FAT16 => (Ent and 16#FFF7#) = 16#FFF7#, when FAT32 => (Ent and 16#FFFF_FFF7#) = 16#FFFF_FFF7#); -- return true if this cluster is defective function Is_Free_Cluster (FS : FAT_Filesystem; Ent : Cluster_Type) return Boolean is ((Ent and 16#0FFF_FFFF#) = FREE_CLUSTER_VALUE); -- return true if the FAT entry indicates the cluster being unused function New_Cluster (FS : in out FAT_Filesystem) return Cluster_Type; function New_Cluster (FS : in out FAT_Filesystem; Previous : Cluster_Type) return Cluster_Type; type Entry_Index is new Unsigned_16; Null_Index : Entry_Index := 16#FFFF#; type FAT_Directory_Handle is limited new Directory_Handle with record Is_Free : Boolean := True; FS : FAT_Filesystem_Access; Current_Index : Entry_Index; Start_Cluster : Cluster_Type; Current_Cluster : Cluster_Type; Current_Block : Block_Offset; Current_Node : aliased FAT_Node; end record; type FAT_Directory_Handle_Access is access all FAT_Directory_Handle; type Any_FAT_Directory_Handle is access all FAT_Directory_Handle'Class; overriding function Get_FS (Dir : FAT_Directory_Handle) return Any_Filesystem_Driver; overriding function Read (Dir : in out FAT_Directory_Handle; Handle : out Any_Node_Handle) return Status_Code; overriding procedure Reset (Dir : in out FAT_Directory_Handle); overriding procedure Close (Dir : in out FAT_Directory_Handle); overriding function Create_File (This : in out FAT_Filesystem; Path : String) return Status_Code; overriding function Unlink (This : in out FAT_Filesystem; Path : String) return Status_Code; overriding function Remove_Directory (This : in out FAT_Filesystem; Path : String) return Status_Code; function FAT_Open (FS : in out FAT_Filesystem; Path : String; Handle : out FAT_Directory_Handle_Access) return Status_Code; function FAT_Open (D_Entry : FAT_Node; Handle : out FAT_Directory_Handle_Access) return Status_Code; type FAT_Directory_Entry_Attribute is record Read_Only : Boolean; Hidden : Boolean; System_File : Boolean; Volume_Label : Boolean; Subdirectory : Boolean; Archive : Boolean; end record with Size => 8, Pack; type FAT_Node is new Node_Handle with record FS : FAT_Filesystem_Access; L_Name : FAT_Name; S_Name : String (1 .. 8); S_Name_Ext : String (1 .. 3); Attributes : FAT_Directory_Entry_Attribute; Start_Cluster : Cluster_Type; -- The content of this entry Size : FAT_File_Size; Index : Entry_Index; -- Index of the FAT_Directory_Intry within Parent's content Is_Root : Boolean := False; -- Is it the root directory ? Is_Dirty : Boolean := False; -- Whether changes need to be written on disk end record; type FAT_File_Handle is limited new File_Handle with record Is_Free : Boolean := True; FS : FAT_Filesystem_Access; Mode : File_Mode; -- The current cluster from which we read or write Current_Cluster : Cluster_Type := 0; -- The current block from which we read or write, offset from -- current_cluster base block Current_Block : Block_Offset := 0; -- Buffer with the content of the current block Buffer : Block (0 .. 511); -- How much data in Buffer is meaningful Buffer_Filled : Boolean := False; -- Whether there's a discrepency between the disk data and the buffer Buffer_Dirty : Boolean := False; -- The actual file index File_Index : FAT_File_Size := 0; -- The associated directory entry D_Entry : FAT_Node; -- The parent's directory directory entry Parent : FAT_Node; end record; type FAT_File_Handle_Access is access all FAT_File_Handle; overriding function Get_FS (File : in out FAT_File_Handle) return Any_Filesystem_Driver; overriding function Size (File : FAT_File_Handle) return File_Size; overriding function Mode (File : FAT_File_Handle) return File_Mode; overriding function Read (File : in out FAT_File_Handle; Addr : System.Address; Length : in out File_Size) return Status_Code; -- read data from file. -- @return number of bytes read (at most Data'Length), or -1 on error. overriding function Offset (File : FAT_File_Handle) return File_Size; -- Current index within the file overriding function Write (File : in out FAT_File_Handle; Addr : System.Address; Length : File_Size) return Status_Code; -- write to file -- @return number of bytes written (at most Data'Length), or -1 on error. overriding function Flush (File : in out FAT_File_Handle) return Status_Code; -- force writing file to disk at this very moment (slow!) overriding function Seek (File : in out FAT_File_Handle; Origin : Seek_Mode; Amount : in out File_Size) return Status_Code; -- Moves the current file position to "Amount", according to the Origin -- parameter. If the command makes the file pointer move outside of the -- file, it stops at the file boundary and returns the actual amount of -- bytes moved. overriding procedure Close (File : in out FAT_File_Handle); -- invalidates the handle, and ensures that -- everything is flushed to the disk -- Type definition for implementation details, make them visible to all -- children of the package type FAT_Directory_Entry is record Filename : String (1 .. 8); Extension : String (1 .. 3); Attributes : FAT_Directory_Entry_Attribute; Reserved : String (1 .. 8); Cluster_H : Unsigned_16; Time : Unsigned_16; Date : Unsigned_16; Cluster_L : Unsigned_16; Size : FAT_File_Size; end record with Size => 32 * 8; for FAT_Directory_Entry use record Filename at 16#00# range 0 .. 63; Extension at 16#08# range 0 .. 23; Attributes at 16#0B# range 0 .. 7; Reserved at 16#0C# range 0 .. 63; Cluster_H at 16#14# range 0 .. 15; Time at 16#16# range 0 .. 15; Date at 16#18# range 0 .. 15; Cluster_L at 16#1A# range 0 .. 15; Size at 16#1C# range 0 .. 31; end record; VFAT_Directory_Entry_Attribute : constant FAT_Directory_Entry_Attribute := (Subdirectory => False, Archive => False, others => True); -- Attrite value 16#F0# defined at offset 16#0B# and identifying a VFAT -- entry rather than a regular directory entry type VFAT_Sequence_Number is mod 2 ** 6 with Size => 6; type VFAT_Sequence is record Sequence : VFAT_Sequence_Number; Stop_Bit : Boolean; end record with Size => 8; for VFAT_Sequence use record Sequence at 0 range 0 .. 5; Stop_Bit at 0 range 6 .. 7; end record; type VFAT_Directory_Entry is record VFAT_Attr : VFAT_Sequence; Name_1 : Wide_String (1 .. 5); Attribute : FAT_Directory_Entry_Attribute; Reserved : Unsigned_8 := 0; Checksum : Unsigned_8; Name_2 : Wide_String (1 .. 6); Cluster : Unsigned_16 := 0; Name_3 : Wide_String (1 .. 2); end record with Pack, Size => 32 * 8; -------------------------------------------------- -- Inlined implementations of utility functions -- -------------------------------------------------- function Version (FS : FAT_Filesystem) return FAT_Version is (if FS.Disk_Parameters.Root_Dir_Entries_Fat16 /= 0 then FAT16 else FAT32); function OEM_Name (FS : FAT_Filesystem) return String is (FS.Disk_Parameters.OEM_Name); function Block_Size (FS : FAT_Filesystem) return FAT_File_Size is (FAT_File_Size (FS.Disk_Parameters.Block_Size_In_Bytes)); function Blocks_Per_Cluster (FS : FAT_Filesystem) return Block_Offset is (Block_Offset (FS.Disk_Parameters.Blocks_Per_Cluster)); function Cluster_Size (FS : FAT_Filesystem) return FAT_File_Size is (FAT_File_Size (FS.Blocks_Per_Cluster) * FS.Block_Size); function Reserved_Blocks (FS : FAT_Filesystem) return Unsigned_16 is (FS.Disk_Parameters.Reserved_Blocks); function Number_Of_FATs (FS : FAT_Filesystem) return Unsigned_8 is (FS.Disk_Parameters.Number_Of_FATs); function Total_Number_Of_Blocks (FS : FAT_Filesystem) return Unsigned_32 is (FS.Disk_Parameters.Number_Of_Blocks_Fat32); function FAT_Table_Size_In_Blocks (FS : FAT_Filesystem) return Unsigned_32 is ((if FS.Version = FAT16 then Unsigned_32 (FS.Disk_Parameters.Table_Size_Fat16) else FS.Disk_Parameters.Table_Size_Fat32)); function Number_Of_Hidden_Blocks (FS : FAT_Filesystem) return Unsigned_32 is (FS.Disk_Parameters.Hidden_Blocks); function Is_Volume (FS : FAT_Filesystem) return Boolean is (FS.Disk_Parameters.Boot_Signature_Fat32 = 16#29#); function Volume_ID (FS : FAT_Filesystem) return Unsigned_32 is (if not Is_Volume (FS) then 0 else FS.Disk_Parameters.Volume_Id_Fat32); function Volume_Label (FS : FAT_Filesystem) return String is (if FS.Version = FAT16 then "UNKNOWN" elsif not Is_Volume (FS) then "UNKNOWN" else Trim (FS.Disk_Parameters.Volume_Label_Fat32)); function File_System_Type (FS : FAT_Filesystem) return String is (if FS.Version = FAT16 then "FAT16" elsif not Is_Volume (FS) then "FAT32" else Trim (FS.Disk_Parameters.FS_Type_Fat32)); function Flags_For_FAT_Mirroring (FS : FAT_Filesystem) return Unsigned_16 is (FS.Disk_Parameters.Fat_Mirroring_Flags); function FS_Version_Number (FS : FAT_Filesystem) return Unsigned_16 is (FS.Disk_Parameters.FS_Version_Number); function Root_Dir_Cluster (FS : FAT_Filesystem) return Cluster_Type is (FS.Disk_Parameters.Root_Directory_Cluster); function FAT16_Root_Dir_Num_Entries (FS : FAT_Filesystem) return Unsigned_16 is (FS.Disk_Parameters.Root_Dir_Entries_Fat16); function FSInfo_Block_Number (FS : FAT_Filesystem) return Unsigned_16 is (FS.Disk_Parameters.FSInfo_Block_Number); function Boot_Block_Backup_Block_Number (FS : FAT_Filesystem) return Unsigned_16 is (FS.Disk_Parameters.Boot_Block_Backup_Block); function Last_Known_Free_Data_Clusters_Number (FS : FAT_Filesystem) return Unsigned_32 is (FS.FSInfo.Free_Clusters); function Most_Recently_Allocated_Cluster (FS : FAT_Filesystem) return Cluster_Type is (FS.FSInfo.Last_Allocated_Cluster); function Get_Num_VFAT_Entries (Name : FAT_Name) return Natural is ((Name.Len + 12) / 13); -- Returns the number of VFAT Entries needed to encode 'Name' -- There's 13 characters in each entry, and we need Name.Len + 2 characters -- for the trailing ASCII.NUL + 0xFFFF sequence. overriding function Get_FS (Dir : FAT_Directory_Handle) return Any_Filesystem_Driver is (Any_Filesystem_Driver (Dir.FS)); overriding function Get_FS (File : in out FAT_File_Handle) return Any_Filesystem_Driver is (Any_Filesystem_Driver (File.FS)); overriding function Get_FS (E : FAT_Node) return Any_Filesystem_Driver is (Any_Filesystem_Driver (E.FS)); function Long_Name (E : FAT_Node) return FAT_Name is (if E.L_Name.Len > 0 then E.L_Name else Short_Name (E)); function Short_Name (E : FAT_Node) return FAT_Name is (-(Trim (E.S_Name) & (if E.S_Name_Ext /= " " then "." & E.S_Name_Ext else ""))); overriding function Basename (E : FAT_Node) return String is (-E.Long_Name); overriding function Is_Read_Only (E : FAT_Node) return Boolean is (E.Attributes.Read_Only); overriding function Is_Hidden (E : FAT_Node) return Boolean is (E.Attributes.Hidden); function Is_System_File (E : FAT_Node) return Boolean is (E.Attributes.System_File); overriding function Is_Subdirectory (E : FAT_Node) return Boolean is (E.Attributes.Subdirectory); function Is_Archive (E : FAT_Node) return Boolean is (E.Attributes.Archive); function Get_Start_Cluster (E : FAT_Node) return Cluster_Type is (E.Start_Cluster); function Size (E : FAT_Node) return FAT_File_Size is (E.Size); overriding function Is_Symlink (E : FAT_Node) return Boolean is (False); end Filesystem.FAT;
with GNAT.Exception_Traces; with GNAT.Traceback.Symbolic; package body DDS.Request_Reply.Tests.Simple is begin GNAT.Exception_Traces.Trace_On (GNAT.Exception_Traces.Every_Raise); GNAT.Exception_Traces.Set_Trace_Decorator (GNAT.Traceback.Symbolic.Symbolic_Traceback_No_Hex'Access); end DDS.Request_Reply.Tests.Simple;
------------------------------------------------------------------------------ -- -- -- GNAT BSP Test -- -- -- -- Copyright (C) 2018, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Report; with Ada.Real_Time; use Ada.Real_Time; package body Clock_Tests is ---------- -- Test -- ---------- procedure Test is First_Measurement : Time; Second_Measurement : Time; begin Report.Test ("c_ri04_01", "Check the granularity of the clock"); -- Take two consecutive measurements First_Measurement := Ada.Real_Time.Clock; Second_Measurement := Ada.Real_Time.Clock; -- The two measurements that have been taken must be different and -- separated by less than 15 microseconds (ARM D.8 par. 30 requires -- this value to be no greater than 1 millisecond). if Second_Measurement > First_Measurement and then (Second_Measurement - First_Measurement) < Microseconds (15) then Report.Passed ("Clock granularity is less than 15 microseconds"); else Report.Failed ("Clock granularity is not less than 15 microseconds"); end if; end Test; end Clock_Tests;
-- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired) -- -- Copyright William A. Whitaker (1936–2010) -- -- This is a free program, which means it is proper to copy it and pass -- it on to your friends. Consider it a developmental item for which -- there is no charge. However, just for form, it is Copyrighted -- (c). Permission is hereby freely given for any and all use of program -- and data. You can sell it as your own, but at least tell me. -- -- This version is distributed without obligation, but the developer -- would appreciate comments and suggestions. -- -- All parts of the WORDS system, source code and data files, are made freely -- available to anyone who wishes to use them, for whatever purpose. with Text_IO; use Text_IO; procedure Oners is package Integer_IO is new Text_IO.Integer_IO (Integer); use Integer_IO; Line, Old_Line : String (1 .. 250) := (others => ' '); Last, Old_Last : Integer := 0; N : Integer := 0; Input, Output : File_Type; begin Put_Line ("ONERS.IN -> ONERS.OUT"); Put_Line ("Takes a sorted file to produce a file having just" & " one of each identical line."); Put_Line ("Puts a count of how many identical lines at the" & " begining of each."); Open (Input, In_File, "ONERS.IN"); Create (Output, Out_File, "ONERS.OUT"); Get_Line (Input, Old_Line, Old_Last); while not End_Of_File (Input) loop Get_Line (Input, Line, Last); N := N + 1; if Line (1 .. Last) /= Old_Line (1 .. Old_Last) then Put (Output, N); Put_Line (Output, " " & Old_Line (1 .. Old_Last)); N := 0; Old_Last := Last; Old_Line (1 .. Old_Last) := Line (1 .. Last); end if; end loop; Close (Output); end Oners;
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Program.Lexical_Elements; with Program.Elements.Formal_Floating_Point_Definitions; with Program.Element_Visitors; package Program.Nodes.Formal_Floating_Point_Definitions is pragma Preelaborate; type Formal_Floating_Point_Definition is new Program.Nodes.Node and Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition and Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition_Text with private; function Create (Digits_Token : not null Program.Lexical_Elements.Lexical_Element_Access; Box_Token : not null Program.Lexical_Elements.Lexical_Element_Access) return Formal_Floating_Point_Definition; type Implicit_Formal_Floating_Point_Definition is new Program.Nodes.Node and Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition with private; function Create (Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return Implicit_Formal_Floating_Point_Definition with Pre => Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance; private type Base_Formal_Floating_Point_Definition is abstract new Program.Nodes.Node and Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition with null record; procedure Initialize (Self : aliased in out Base_Formal_Floating_Point_Definition'Class); overriding procedure Visit (Self : not null access Base_Formal_Floating_Point_Definition; Visitor : in out Program.Element_Visitors.Element_Visitor'Class); overriding function Is_Formal_Floating_Point_Definition_Element (Self : Base_Formal_Floating_Point_Definition) return Boolean; overriding function Is_Formal_Type_Definition_Element (Self : Base_Formal_Floating_Point_Definition) return Boolean; overriding function Is_Definition_Element (Self : Base_Formal_Floating_Point_Definition) return Boolean; type Formal_Floating_Point_Definition is new Base_Formal_Floating_Point_Definition and Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition_Text with record Digits_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Box_Token : not null Program.Lexical_Elements .Lexical_Element_Access; end record; overriding function To_Formal_Floating_Point_Definition_Text (Self : aliased in out Formal_Floating_Point_Definition) return Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition_Text_Access; overriding function Digits_Token (Self : Formal_Floating_Point_Definition) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function Box_Token (Self : Formal_Floating_Point_Definition) return not null Program.Lexical_Elements.Lexical_Element_Access; type Implicit_Formal_Floating_Point_Definition is new Base_Formal_Floating_Point_Definition with record Is_Part_Of_Implicit : Boolean; Is_Part_Of_Inherited : Boolean; Is_Part_Of_Instance : Boolean; end record; overriding function To_Formal_Floating_Point_Definition_Text (Self : aliased in out Implicit_Formal_Floating_Point_Definition) return Program.Elements.Formal_Floating_Point_Definitions .Formal_Floating_Point_Definition_Text_Access; overriding function Is_Part_Of_Implicit (Self : Implicit_Formal_Floating_Point_Definition) return Boolean; overriding function Is_Part_Of_Inherited (Self : Implicit_Formal_Floating_Point_Definition) return Boolean; overriding function Is_Part_Of_Instance (Self : Implicit_Formal_Floating_Point_Definition) return Boolean; end Program.Nodes.Formal_Floating_Point_Definitions;
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- package Slim.Messages.DSCO is type DSCO_Message is new Message with private; private type DSCO_Message is new Base_Message (Max_8 => 1, Max_16 => 0, Max_32 => 0, Max_64 => 0) with null record; overriding function Read (Data : not null access League.Stream_Element_Vectors.Stream_Element_Vector) return DSCO_Message; overriding procedure Write (Self : DSCO_Message; Tag : out Message_Tag; Data : out League.Stream_Element_Vectors.Stream_Element_Vector); overriding procedure Visit (Self : not null access DSCO_Message; Visiter : in out Slim.Message_Visiters.Visiter'Class); end Slim.Messages.DSCO;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . T E X T _ I O . M O D U L A R _ A U X -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2001 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT 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 distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains the routines for Ada.Text_IO.Modular_IO that are -- shared among separate instantiations of this package. The routines in -- this package are identical semantically to those in Modular_IO itself, -- except that the generic parameter Num has been replaced by Unsigned or -- Long_Long_Unsigned, and the default parameters have been removed because -- they are supplied explicitly by the calls from within the generic template. with System.Unsigned_Types; private package Ada.Text_IO.Modular_Aux is package U renames System.Unsigned_Types; procedure Get_Uns (File : File_Type; Item : out U.Unsigned; Width : Field); procedure Get_LLU (File : File_Type; Item : out U.Long_Long_Unsigned; Width : Field); procedure Put_Uns (File : File_Type; Item : U.Unsigned; Width : Field; Base : Number_Base); procedure Put_LLU (File : File_Type; Item : U.Long_Long_Unsigned; Width : Field; Base : Number_Base); procedure Gets_Uns (From : String; Item : out U.Unsigned; Last : out Positive); procedure Gets_LLU (From : String; Item : out U.Long_Long_Unsigned; Last : out Positive); procedure Puts_Uns (To : out String; Item : U.Unsigned; Base : Number_Base); procedure Puts_LLU (To : out String; Item : U.Long_Long_Unsigned; Base : Number_Base); end Ada.Text_IO.Modular_Aux;
-- C85005C.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT A VARIABLE CREATED BY AN ENTRY 'IN OUT' FORMAL -- PARAMETER CAN BE RENAMED AND HAS THE CORRECT VALUE, AND THAT -- THE NEW NAME CAN BE USED IN AN ASSIGNMENT STATEMENT AND PASSED -- ON AS AN ACTUAL SUBPROGRAM OR ENTRY 'IN OUT' OR 'OUT' PARAMETER, -- AND AS AN ACTUAL GENERIC 'IN OUT' PARAMETER, AND THAT WHEN THE -- VALUE OF THE RENAMED VARIABLE IS CHANGED, THE NEW VALUE IS -- REFLECTED BY THE VALUE OF THE NEW NAME. -- HISTORY: -- JET 03/15/88 CREATED ORIGINAL TEST. WITH REPORT; USE REPORT; PROCEDURE C85005C IS TYPE ARRAY1 IS ARRAY (POSITIVE RANGE <>) OF INTEGER; TYPE RECORD1 (D : INTEGER) IS RECORD FIELD1 : INTEGER := 1; END RECORD; TYPE POINTER1 IS ACCESS INTEGER; PACKAGE PACK1 IS TYPE PRIVY IS PRIVATE; ZERO : CONSTANT PRIVY; ONE : CONSTANT PRIVY; TWO : CONSTANT PRIVY; THREE : CONSTANT PRIVY; FOUR : CONSTANT PRIVY; FIVE : CONSTANT PRIVY; FUNCTION IDENT (I : PRIVY) RETURN PRIVY; FUNCTION NEXT (I : PRIVY) RETURN PRIVY; PRIVATE TYPE PRIVY IS RANGE 0..127; ZERO : CONSTANT PRIVY := 0; ONE : CONSTANT PRIVY := 1; TWO : CONSTANT PRIVY := 2; THREE : CONSTANT PRIVY := 3; FOUR : CONSTANT PRIVY := 4; FIVE : CONSTANT PRIVY := 5; END PACK1; TASK TYPE TASK1 IS ENTRY ASSIGN (J : IN INTEGER); ENTRY VALU (J : OUT INTEGER); ENTRY NEXT; ENTRY STOP; END TASK1; DI1 : INTEGER := 0; DA1 : ARRAY1(1..3) := (OTHERS => 0); DR1 : RECORD1(1) := (D => 1, FIELD1 => 0); DP1 : POINTER1 := NEW INTEGER'(0); DV1 : PACK1.PRIVY := PACK1.ZERO; DT1 : TASK1; I : INTEGER; GENERIC GI1 : IN OUT INTEGER; GA1 : IN OUT ARRAY1; GR1 : IN OUT RECORD1; GP1 : IN OUT POINTER1; GV1 : IN OUT PACK1.PRIVY; GT1 : IN OUT TASK1; PACKAGE GENERIC1 IS END GENERIC1; FUNCTION IDENT (P : POINTER1) RETURN POINTER1 IS BEGIN IF EQUAL (3,3) THEN RETURN P; ELSE RETURN NULL; END IF; END IDENT; PACKAGE BODY PACK1 IS FUNCTION IDENT (I : PRIVY) RETURN PRIVY IS BEGIN IF EQUAL(3,3) THEN RETURN I; ELSE RETURN PRIVY'(0); END IF; END IDENT; FUNCTION NEXT (I : PRIVY) RETURN PRIVY IS BEGIN RETURN I+1; END NEXT; END PACK1; PACKAGE BODY GENERIC1 IS BEGIN GI1 := GI1 + 1; GA1 := (GA1(1)+1, GA1(2)+1, GA1(3)+1); GR1 := (D => 1, FIELD1 => GR1.FIELD1 + 1); GP1 := NEW INTEGER'(GP1.ALL + 1); GV1 := PACK1.NEXT(GV1); GT1.NEXT; END GENERIC1; TASK BODY TASK1 IS TASK_VALUE : INTEGER := 0; ACCEPTING_ENTRIES : BOOLEAN := TRUE; BEGIN WHILE ACCEPTING_ENTRIES LOOP SELECT ACCEPT ASSIGN (J : IN INTEGER) DO TASK_VALUE := J; END ASSIGN; OR ACCEPT VALU (J : OUT INTEGER) DO J := TASK_VALUE; END VALU; OR ACCEPT NEXT DO TASK_VALUE := TASK_VALUE + 1; END NEXT; OR ACCEPT STOP DO ACCEPTING_ENTRIES := FALSE; END STOP; END SELECT; END LOOP; END TASK1; BEGIN TEST ("C85005C", "CHECK THAT A VARIABLE CREATED BY AN ENTRY " & "'IN OUT' FORMAL PARAMETER CAN BE RENAMED " & "AND HAS THE CORRECT VALUE, AND THAT THE NEW " & "NAME CAN BE USED IN AN ASSIGNMENT STATEMENT " & "AND PASSED ON AS AN ACTUAL SUBPROGRAM OR " & "ENTRY 'IN OUT' OR 'OUT' PARAMETER, AND AS AN " & "ACTUAL GENERIC 'IN OUT' PARAMETER, AND THAT " & "WHEN THE VALUE OF THE RENAMED VARIABLE IS " & "CHANGED, THE NEW VALUE IS REFLECTED BY THE " & "VALUE OF THE NEW NAME"); DECLARE TASK MAIN_TASK IS ENTRY START (TI1 : IN OUT INTEGER; TA1 : IN OUT ARRAY1; TR1 : IN OUT RECORD1; TP1 : IN OUT POINTER1; TV1 : IN OUT PACK1.PRIVY; TT1 : IN OUT TASK1); END MAIN_TASK; TASK BODY MAIN_TASK IS BEGIN ACCEPT START (TI1: IN OUT INTEGER; TA1: IN OUT ARRAY1; TR1: IN OUT RECORD1; TP1: IN OUT POINTER1; TV1: IN OUT PACK1.PRIVY; TT1: IN OUT TASK1) DO DECLARE XTI1 : INTEGER RENAMES TI1; XTA1 : ARRAY1 RENAMES TA1; XTR1 : RECORD1 RENAMES TR1; XTP1 : POINTER1 RENAMES TP1; XTV1 : PACK1.PRIVY RENAMES TV1; XTT1 : TASK1 RENAMES TT1; TASK TYPE TASK2 IS ENTRY ENTRY1 (TTI1 : OUT INTEGER; TTA1 : OUT ARRAY1; TTR1 : OUT RECORD1; TTP1 : IN OUT POINTER1; TTV1 : IN OUT PACK1.PRIVY; TTT1 : IN OUT TASK1); END TASK2; CHK_TASK : TASK2; PROCEDURE PROC1 (PTI1 : IN OUT INTEGER; PTA1 : IN OUT ARRAY1; PTR1 : IN OUT RECORD1; PTP1 : OUT POINTER1; PTV1 : OUT PACK1.PRIVY; PTT1 : IN OUT TASK1) IS BEGIN PTI1 := PTI1 + 1; PTA1 := (PTA1(1)+1, PTA1(2)+1, PTA1(3)+1); PTR1 := (D => 1, FIELD1 => PTR1.FIELD1 + 1); PTP1 := NEW INTEGER'(TP1.ALL + 1); PTV1 := PACK1.NEXT(TV1); PTT1.NEXT; END PROC1; TASK BODY TASK2 IS BEGIN ACCEPT ENTRY1 (TTI1 : OUT INTEGER; TTA1 : OUT ARRAY1; TTR1 : OUT RECORD1; TTP1 : IN OUT POINTER1; TTV1 : IN OUT PACK1.PRIVY; TTT1 : IN OUT TASK1) DO TTI1 := TI1 + 1; TTA1 := (TA1(1)+1, TA1(2)+1, TA1(3)+1); TTR1 := (D => 1, FIELD1 => TR1.FIELD1 + 1); TTP1 := NEW INTEGER'(TTP1.ALL + 1); TTV1 := PACK1.NEXT(TTV1); TTT1.NEXT; END ENTRY1; END TASK2; PACKAGE GENPACK1 IS NEW GENERIC1 (XTI1, XTA1, XTR1, XTP1, XTV1, XTT1); BEGIN IF XTI1 /= IDENT_INT(1) THEN FAILED ("INCORRECT VALUE OF XTI1 (1)"); END IF; IF XTA1 /= (IDENT_INT(1),IDENT_INT(1), IDENT_INT(1)) THEN FAILED ("INCORRECT VALUE OF XTA1 (1)"); END IF; IF XTR1 /= (D => 1, FIELD1 => IDENT_INT(1)) THEN FAILED ("INCORRECT VALUE OF XTR1 (1)"); END IF; IF XTP1 /= IDENT(TP1) OR XTP1.ALL /= IDENT_INT(1) THEN FAILED ("INCORRECT VALUE OF XTP1 (1)"); END IF; IF PACK1."/=" (XTV1, PACK1.IDENT(PACK1.ONE)) THEN FAILED ("INCORRECT VALUE OF XTV1 (1)"); END IF; XTT1.VALU(I); IF I /= IDENT_INT(1) THEN FAILED ("INCORRECT RETURN VALUE OF " & "XTT1.VALU (1)"); END IF; PROC1(XTI1, XTA1, XTR1, XTP1, XTV1, XTT1); IF XTI1 /= IDENT_INT(2) THEN FAILED ("INCORRECT VALUE OF XTI1 (2)"); END IF; IF XTA1 /= (IDENT_INT(2),IDENT_INT(2), IDENT_INT(2)) THEN FAILED ("INCORRECT VALUE OF XTA1 (2)"); END IF; IF XTR1 /= (D => 1, FIELD1 => IDENT_INT(2)) THEN FAILED ("INCORRECT VALUE OF XTR1 (2)"); END IF; IF XTP1 /= IDENT(TP1) OR XTP1.ALL /= IDENT_INT(2) THEN FAILED ("INCORRECT VALUE OF XTP1 (2)"); END IF; IF PACK1."/=" (XTV1, PACK1.IDENT(PACK1.TWO)) THEN FAILED ("INCORRECT VALUE OF XTV1 (2)"); END IF; XTT1.VALU(I); IF I /= IDENT_INT(2) THEN FAILED ("INCORRECT RETURN VALUE FROM " & "XTT1.VALU (2)"); END IF; CHK_TASK.ENTRY1 (XTI1, XTA1, XTR1, XTP1, XTV1, XTT1); IF XTI1 /= IDENT_INT(3) THEN FAILED ("INCORRECT VALUE OF XTI1 (3)"); END IF; IF XTA1 /= (IDENT_INT(3),IDENT_INT(3), IDENT_INT(3)) THEN FAILED ("INCORRECT VALUE OF XTA1 (3)"); END IF; IF XTR1 /= (D => 1, FIELD1 => IDENT_INT(3)) THEN FAILED ("INCORRECT VALUE OF XTR1 (3)"); END IF; IF XTP1 /= IDENT(TP1) OR XTP1.ALL /= IDENT_INT(3) THEN FAILED ("INCORRECT VALUE OF XTP1 (3)"); END IF; IF PACK1."/=" (XTV1, PACK1.IDENT(PACK1.THREE)) THEN FAILED ("INCORRECT VALUE OF XTV1 (3)"); END IF; XTT1.VALU(I); IF I /= IDENT_INT(3) THEN FAILED ("INCORRECT RETURN VALUE OF " & "XTT1.VALU (3)"); END IF; XTI1 := XTI1 + 1; XTA1 := (XTA1(1)+1, XTA1(2)+1, XTA1(3)+1); XTR1 := (D => 1, FIELD1 => XTR1.FIELD1 + 1); XTP1 := NEW INTEGER'(XTP1.ALL + 1); XTV1 := PACK1.NEXT(XTV1); XTT1.NEXT; IF XTI1 /= IDENT_INT(4) THEN FAILED ("INCORRECT VALUE OF XTI1 (4)"); END IF; IF XTA1 /= (IDENT_INT(4),IDENT_INT(4), IDENT_INT(4)) THEN FAILED ("INCORRECT VALUE OF XTA1 (4)"); END IF; IF XTR1 /= (D => 1, FIELD1 => IDENT_INT(4)) THEN FAILED ("INCORRECT VALUE OF XTR1 (4)"); END IF; IF XTP1 /= IDENT(TP1) OR XTP1.ALL /= IDENT_INT(4) THEN FAILED ("INCORRECT VALUE OF XTP1 (4)"); END IF; IF PACK1."/=" (XTV1, PACK1.IDENT(PACK1.FOUR)) THEN FAILED ("INCORRECT VALUE OF XTV1 (4)"); END IF; XTT1.VALU(I); IF I /= IDENT_INT(4) THEN FAILED ("INCORRECT RETURN VALUE OF " & "XTT1.VALU (4)"); END IF; TI1 := TI1 + 1; TA1 := (TA1(1)+1, TA1(2)+1, TA1(3)+1); TR1 := (D => 1, FIELD1 => TR1.FIELD1 + 1); TP1 := NEW INTEGER'(TP1.ALL + 1); TV1 := PACK1.NEXT(TV1); TT1.NEXT; IF XTI1 /= IDENT_INT(5) THEN FAILED ("INCORRECT VALUE OF XTI1 (5)"); END IF; IF XTA1 /= (IDENT_INT(5),IDENT_INT(5), IDENT_INT(5)) THEN FAILED ("INCORRECT VALUE OF XTA1 (5)"); END IF; IF XTR1 /= (D => 1, FIELD1 => IDENT_INT(5)) THEN FAILED ("INCORRECT VALUE OF XTR1 (5)"); END IF; IF XTP1 /= IDENT(TP1) OR XTP1.ALL /= IDENT_INT(5) THEN FAILED ("INCORRECT VALUE OF XTP1 (5)"); END IF; IF PACK1."/=" (XTV1, PACK1.IDENT(PACK1.FIVE)) THEN FAILED ("INCORRECT VALUE OF XTV1 (5)"); END IF; XTT1.VALU(I); IF I /= IDENT_INT(5) THEN FAILED ("INCORRECT RETURN VALUE OF " & "XTT1.VALU (5)"); END IF; END; END START; END MAIN_TASK; BEGIN MAIN_TASK.START (DI1, DA1, DR1, DP1, DV1, DT1); END; DT1.STOP; RESULT; END C85005C;
-- { dg-do run } procedure Volatile4 is type My_Int is new Integer; pragma Volatile (My_Int); type Rec is record I : My_Int; end record; function F (R : Rec) return Rec is begin return R; end; R : Rec := (I => 0); begin R := F (R); if R.I /= 0 then raise Program_Error; end if; end;
-- CD1009R.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT A 'STORAGE_SIZE' CLAUSE MAY BE GIVEN IN THE -- PRIVATE PART OF A PACKAGE FOR AN INCOMPLETE TYPE, WHOSE FULL -- DECLARATION IS AN ACCESS TYPE, DECLARED IN THE VISIBLE PART OF -- THE SAME PACKAGE. -- HISTORY: -- BCB 03/20/89 CHANGED EXTENSION FROM '.ADA' TO '.DEP'. -- VCL 10/21/87 CREATED ORIGINAL TEST. WITH REPORT; USE REPORT; PROCEDURE CD1009R IS BEGIN TEST ("CD1009R", "A 'STORAGE_SIZE' CLAUSE MAY BE GIVEN IN THE " & "PRIVATE PART OF A PACKAGE FOR AN INCOMPLETE " & "TYPE, WHOSE FULL TYPE DECLARATION IS AN " & "ACCESS TYPE, DECLARED IN THE VISIBLE PART OF " & "THE SAME PACKAGE"); DECLARE PACKAGE PACK IS SPECIFIED_SIZE : CONSTANT := INTEGER'SIZE * 10; TYPE CHECK_TYPE_1; TYPE ACC IS ACCESS CHECK_TYPE_1; TYPE CHECK_TYPE_1 IS ACCESS INTEGER; PRIVATE FOR CHECK_TYPE_1'STORAGE_SIZE USE SPECIFIED_SIZE; END PACK; USE PACK; BEGIN IF CHECK_TYPE_1'STORAGE_SIZE < SPECIFIED_SIZE THEN FAILED ("CHECK_TYPE_1'STORAGE_SIZE IS TOO SMALL"); END IF; END; RESULT; END CD1009R;
-- part of AdaYaml, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "copying.txt" with Ada.Unchecked_Deallocation; package body Yaml.Transformation is procedure Adjust (Object : in out Reference) is begin Increase_Refcount (Object.Data); end Adjust; procedure Finalize (Object : in out Reference) is begin Decrease_Refcount (Object.Data); end Finalize; procedure Finalize (Object : in out Instance) is procedure Free is new Ada.Unchecked_Deallocation (Transformator.Instance'Class, Transformator.Pointer); begin for Element of Object.Transformators loop declare Ptr : Transformator.Pointer := Element; begin Free (Ptr); end; end loop; end Finalize; function Transform (Original : Stream_Impl.Reference) return Instance is begin return (Refcount_Base with Original => Original, Transformators => <>); end Transform; function Transform (Original : Stream_Impl.Reference) return Reference is Ptr : constant not null Instance_Access := new Instance'(Refcount_Base with Original => Original, Transformators => <>); begin return (Ada.Finalization.Controlled with Data => Ptr); end Transform; function Value (Object : Reference) return Accessor is ((Data => Object.Data.all'Access)); function Next (Object : in out Instance) return Event is use type Transformator_Vectors.Cursor; Cursor : Transformator_Vectors.Cursor := Object.Transformators.Last; Current : Event; begin Outer : loop while Cursor /= Transformator_Vectors.No_Element loop exit when Transformator_Vectors.Element (Cursor).Has_Next; Transformator_Vectors.Previous (Cursor); end loop; if Cursor = Transformator_Vectors.No_Element then Current := Stream_Impl.Next (Stream_Impl.Value (Object.Original).Data.all); Cursor := Object.Transformators.First; else Current := Transformator_Vectors.Element (Cursor).Next; Transformator_Vectors.Next (Cursor); end if; loop exit Outer when Cursor = Transformator_Vectors.No_Element; Transformator_Vectors.Element (Cursor).Put (Current); exit when not Transformator_Vectors.Element (Cursor).Has_Next; Current := Transformator_Vectors.Element (Cursor).Next; Transformator_Vectors.Next (Cursor); end loop; Transformator_Vectors.Previous (Cursor); end loop Outer; return Current; end Next; procedure Append (Object : in out Instance; T : not null Transformator.Pointer) is begin Object.Transformators.Append (T); end Append; end Yaml.Transformation;
----------------------------------------------------------------------- -- asf -- Ada Server Faces -- Copyright (C) 2009, 2010 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- Ada Server Faces is an adapted implementation of JSR 252, -- the Java Server Faces for Ada 2005. package ASF is pragma Pure; end ASF;
-- Copyright 2010, 2011 Free Software Foundation, Inc. -- -- 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 3 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, see <http://www.gnu.org/licenses/>. package body Pck is Last_Node_Id : Node_Id := Node_Id'First; function Pn (N : Node_Id) return Node_Id is begin Last_Node_Id := N; return N; end Pn; end Pck;
with AdaM.Factory; package body AdaM.a_Type.interface_type is -- Storage Pool -- record_Version : constant := 1; pool_Size : constant := 5_000; package Pool is new AdaM.Factory.Pools (storage_Folder => ".adam-store", pool_Name => "interface_types", max_Items => pool_Size, record_Version => record_Version, Item => interface_type.item, View => interface_type.view); -- Forge -- procedure define (Self : in out Item; Name : in String) is begin Self.Name := +Name; end define; overriding procedure destruct (Self : in out Item) is begin null; end destruct; function new_Type (Name : in String := "") return interface_type.View is new_View : constant interface_type.view := Pool.new_Item; begin define (interface_type.item (new_View.all), Name); return new_View; end new_Type; procedure free (Self : in out interface_type.view) is begin destruct (a_Type.item (Self.all)); Pool.free (Self); end free; -- Attributes -- overriding function Id (Self : access Item) return AdaM.Id is begin return Pool.to_Id (Self); end Id; overriding function to_Source (Self : in Item) return text_Vectors.Vector is pragma Unreferenced (Self); the_Source : text_Vectors.Vector; begin raise Program_Error with "TODO"; return the_Source; end to_Source; -- Streams -- procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class; Self : in View) renames Pool.View_write; procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class; Self : out View) renames Pool.View_read; end AdaM.a_Type.interface_type;
------------------------------------------------------------ -- B B . G U I -- -- -- -- Spec -- -- -- -- Graphical User Interface for the Ball on Beam system. -- -- -- -- Author: Jorge Real -- -- Universitat Politecnica de Valencia -- -- July, 2020 - Version 1 -- -- February, 2021 - Version 2 -- -- -- -- This is free software in the ample sense: -- -- you can use it freely, provided you preserve -- -- this comment at the header of source files -- -- and you clearly indicate the changes made to -- -- the original file, if any. -- ------------------------------------------------------------ with BB.GUI.Controller; with Gnoga.Application.Singleton; -- For use of a native GTk window for the GUI with Gnoga.Application.Gtk_Window; with Gnoga.Gui.Window; with Ada.Exceptions; package body BB.GUI is ------------------ -- GUI_Setpoint -- ------------------ procedure GUI_Setpoint (Target_Pos : Position) is begin Current_Target_Pos := Target_Pos; end GUI_Setpoint; Main_Window : Gnoga.Gui.Window.Window_Type; -- Package initialisation begin Gnoga.Application.Title ("Ball on Beam Simulator"); Gnoga.Application.HTML_On_Close ("Connection to <b>Ball on Beam Simulator</b> has been terminated."); -- For native Gtk window: -- First, use the proper initialize for a Gtk window Gnoga.Application.Gtk_Window.Initialize (Port => 8080, Width => 1050, Height => 450); -- And second, include Verbose parameter in the call Gnoga.Application.Singleton.Initialize (Main_Window => Main_Window, Verbose => False); -- For browser window: -- Gnoga.Application.Open_URL ("http://127.0.0.1:8080"); -- Gnoga.Application.Singleton.Initialize (Main_Window, Port => 8080); BB.GUI.Controller.Create_GUI (Main_Window); exception when E : others => Gnoga.Log (Ada.Exceptions.Exception_Name (E) & " - " & Ada.Exceptions.Exception_Message (E)); end BB.GUI;
------------------------------------------------------------------------------ -- G E L A A S I S -- -- ASIS implementation for Gela project, a portable Ada compiler -- -- http://gela.ada-ru.org -- -- - - - - - - - - - - - - - - - -- -- Read copyright and license at the end of this file -- ------------------------------------------------------------------------------ -- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $ package body XML_IO.Base_Readers_Streams is use Implementation; --------------------- -- Attribute_Count -- --------------------- function Attribute_Count (Parser : in Reader) return List_Count is begin return Attribute_Count (Implementation.Reader (Parser)); end Attribute_Count; -------------------- -- Attribute_Name -- -------------------- function Attribute_Name (Parser : in Reader; Index : in List_Index) return XML_String is begin return Value (Parser.Buffer, Attribute_Name (Parser, Index)); end Attribute_Name; --------------------- -- Attribute_Value -- --------------------- function Attribute_Value (Parser : in Reader; Index : in List_Index) return XML_String is begin return Value (Parser.Buffer, Attribute_Value (Parser, Index)); end Attribute_Value; --------------------- -- Attribute_Value -- --------------------- function Attribute_Value (Parser : in Reader; Name : in XML_String; Default : in XML_String := Implementation.Nil_Literal; Raise_Error : in Boolean := False) return XML_String is use type XML_String; begin for J in 1 .. Attribute_Count (Parser) loop if Attribute_Name (Parser, J) = Name then return Attribute_Value (Parser, J); end if; end loop; if Raise_Error then raise Constraint_Error; else return Default; end if; end Attribute_Value; -------------- -- Encoding -- -------------- function Encoding (Parser : in Reader) return XML_String is begin return Value (Parser.Buffer, Encoding (Parser)); end Encoding; ---------------- -- Initialize -- ---------------- procedure Initialize (Parser : in out Reader) is begin Initialize (Parser.Buffer, Parser); end Initialize; ----------------- -- More_Pieces -- ----------------- function More_Pieces (Parser : in Reader) return Boolean is begin return More_Pieces (Implementation.Reader (Parser)); end More_Pieces; ---------- -- Name -- ---------- function Name (Parser : in Reader) return XML_String is begin return Value (Parser.Buffer, Name (Parser)); end Name; ---------- -- Next -- ---------- procedure Next (Parser : in out Reader) is begin Next (Parser.Buffer, Parser); end Next; ---------------- -- Piece_Kind -- ---------------- function Piece_Kind (Parser : in Reader) return Piece_Kinds is begin return Piece_Kind (Implementation.Reader (Parser)); end Piece_Kind; ---------- -- Read -- ---------- procedure Read (Parser : in out Reader; Buffer : in out XML_String; Last : out Natural) is begin Read (Parser.Stream, Buffer, Last); end Read; ---------------- -- Standalone -- ---------------- function Standalone (Parser : in Reader) return Boolean is begin return Standalone (Implementation.Reader (Parser)); end Standalone; ---------- -- Text -- ---------- function Text (Parser : in Reader) return XML_String is begin return Value (Parser.Buffer, Text (Parser)); end Text; end XML_IO.Base_Readers_Streams; ------------------------------------------------------------------------------ -- Copyright (c) 2006-2013, Maxim Reznik -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- * Neither the name of the Maxim Reznik, IE nor the names of its -- contributors may be used to endorse or promote products derived from -- this software without specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE -- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------
-- sarge.adb - Implementation file for the Sarge command line argument parser project. -- Revision 0 -- Features: -- - -- Notes: -- - -- 2019/04/10, Maya Posch with Ada.Command_Line; with Ada.Text_IO; use Ada.Text_IO; package body Sarge is --- SET ARGUMENT --- procedure setArgument(arg_short: in Unbounded_String; arg_long: in Unbounded_String; desc: in Unbounded_String; hasVal: in boolean) is arg: aliased Argument := (arg_short => arg_short, arg_long => arg_long, description => desc, hasValue => hasVal, value => +"", parsed => False); aa: Argument_Access; begin args.append(arg); -- Set up links. if length(arg_short) > 0 then aa := args.Last_Element'Access; argNames.include(arg_short, aa); end if; if length(arg_long) > 0 then argNames.include(arg_long, arg'Access); end if; end setArgument; --- SET DESCRIPTION --- procedure setDescription(desc: in Unbounded_String) is begin description := desc; end setDescription; --- SET USAGE --- procedure setUsage(usage: in Unbounded_String) is begin usageStr := usage; end setUsage; --- PARSE ARGUMENTS --- function parseArguments return boolean is flag_it: argNames_map.Cursor; expectValue: boolean := False; begin -- execName := Ada.Command_Line.command_name; for arg in 1..Ada.Command_Line.argument_count loop -- Each flag will start with a '-' character. Multiple flags can be joined together in -- the same string if they're the short form flag type (one character per flag). if expectValue = True then -- Copy value. argNames(flag_it).value := arg; expectValue := False; elsif arg(arg'First) = '-' then -- Parse flag. -- First check for the long form. if arg(arg'First + 1) = '-' then -- Long form of the flag. if not argNames.contains(arg(arg'First + 2..arg'Last)) then -- Flag wasn't found. Abort. put_line("Long flag " & arg'Image & " wasn't found"); return False; end if; -- Mark as found. flag_it := argNames.find(arg); argNames_map.Element(flag_it).parsed := True; flagCounter := flagCounter + 1; if argNames_map.Element(flag_it).hasValue = True then expectValue := True; end if; else -- Parse short form flag. Parse all of them sequentially. Only the last one -- is allowed to have an additional value following it. for i in arg'range loop flag_it := argNames.find(arg(arg'First + (1 + i)..arg'First + (2 + i))); if flag_it = argNames_map.No_Element then -- Flag wasn't found. Abort. put_line("Short flag " & arg(arg'First + (1 + i)..arg'First + (2 + i)) & " wasn't found."); return False; end if; -- Mark as found. argNames_map.Element(flag_it).parsed := True; flagCounter := flagCounter + 1; if argNames_map.Element(flag_it).hasValue = True then if i /= (arg'Length - 1) then -- Flag isn't at end, thus cannot have value. put_line("Flag " & arg(arg'First + (1 + i)..arg'First + (2 + i)) & " needs to be followed by a value string."); return False; else expectValue := True; end if; end if; end loop; end if; else put_line("Expected flag, not value."); return False; end if; end loop; parsed := True; return True; end parseArguments; --- GET FLAG --- function getFlag(arg_flag: in Unbounded_String; arg_value: out Unbounded_String) return boolean is flag_it: argNames_map.Cursor; begin if parsed /= True then return False; end if; flag_it := argNames.find(arg_flag); if flag_it = No_Elements then return False; elsif Element(flag_it).parsed /= True then return False; end if; if Element(flag_it).hasValue = True then arg_value := Element(flag_it).value; end if; return True; end getFlag; --- EXISTS --- function exists(arg_flag: in Unbounded_String) return boolean is flag_it: argNames_map.Cursor; begin if parsed /= True then return False; end if; flag_it := argNames.find(arg_flag); if flag_it = No_Elements then return False; elsif Element(flag_it).parsed /= True then return False; end if; return True; end exists; --- PRINT HELP --- procedure printHelp is begin put_line; put_line(description); put_line("Usage:"); put_line(usageStr); put_line; put_line("Options:"); -- Print out the options. for opt in args.Iterate loop put_line("-" & opt.arg_short & " --" & opt.arg_long & " " & opt.description); end loop; end printHelp; --- FLAG COUNT --- function flagCount return integer is begin return flagCount; end flagCount; --- EXECUTABLE NAME --- function executableName return Unbounded_String is begin return execName; end executableName; end Sarge;
with openGL.Geometry, openGL.Font, openGL.Texture; package openGL.Model.Box.lit_colored -- -- Models a lit and colored box. -- -- Each face may be separately colored via each of its 4 vertices. -- is type Item is new Model.box.item with private; type View is access all Item'Class; type Face is record Colors : lucid_Colors (1 .. 4); -- The color of each faces 4 vertices. end record; type Faces is array (Side) of Face; --------- --- Forge -- function new_Box (Size : in Vector_3; Faces : in lit_colored.Faces) return View; -------------- --- Attributes -- overriding function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class; Fonts : in Font.font_id_Map_of_font) return Geometry.views; private type Item is new Model.box.item with record Faces : lit_colored.Faces; end record; end openGL.Model.Box.lit_colored;
with System.Storage_Elements; use System.Storage_Elements; with MSP430_SVD; use MSP430_SVD; with MSP430_SVD.SYSTEM_CLOCK; use MSP430_SVD.SYSTEM_CLOCK; with MSPGD.GPIO; use MSPGD.GPIO; with MSPGD.GPIO.Pin; with Startup; package body Board is CALDCO_1MHz : DCOCTL_Register with Import, Address => System'To_Address (16#10FE#); CALBC1_1MHz : BCSCTL1_Register with Import, Address => System'To_Address (16#10FF#); CALDCO_8MHz : DCOCTL_Register with Import, Address => System'To_Address (16#10FC#); CALBC1_8MHz : BCSCTL1_Register with Import, Address => System'To_Address (16#10FD#); package RX is new MSPGD.GPIO.Pin (Port => 1, Pin => 1, Alt_Func => Secondary); package TX is new MSPGD.GPIO.Pin (Port => 1, Pin => 2, Alt_Func => Secondary); procedure Init is begin -- SYSTEM_CLOCK_Periph.BCSCTL1 := CALBC1_8MHz; -- SYSTEM_CLOCK_Periph.DCOCTL := CALDCO_8MHz; Clock.Init; RX.Init; TX.Init; UART.Init; end Init; end Board;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- M L I B . U T L -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 2001, Ada Core Technologies, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT 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 distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ -- This package provides an easy way of calling various tools such as gcc, -- ar, etc... package MLib.Utl is procedure Delete_File (Filename : in String); -- Delete the file Filename. procedure Gcc (Output_File : String; Objects : Argument_List; Options : Argument_List; Base_File : String := ""); -- Invoke gcc to create a library. procedure Ar (Output_File : String; Objects : Argument_List); -- Run ar to move all the binaries inside the archive. -- If ranlib is on the path, run it also. function Lib_Directory return String; -- Return the directory containing libgnat. end MLib.Utl;
with Ada.Integer_Text_IO, Ada.Text_IO; use Ada.Integer_Text_IO, Ada.Text_IO; package body data is function Sum_Vector(A,B: in Vector) return Vector is S: Vector; begin for i in 1..N loop S(i):=A(i)+B(i); end loop; return S; end Sum_Vector; function Matrix_Multiplication(A,B: in Matrix) return Matrix is M: Matrix; s: Integer; begin for k in 1..N loop for i in 1..N loop s:=0; for j in 1..N loop s:=A(k)(j)*B(j)(i); M(k)(i):=s; end loop; end loop; end loop; return M; end Matrix_Multiplication; function Vector_Matrix_Multiplication(A: in Vector; B: in Matrix) return Vector is P: Vector; s: Integer; begin for i in 1..N loop s:=0; for j in 1..N loop s:=S+A(i)*B(j)(i); end loop; P(i):=S; end loop; return P; end Vector_Matrix_Multiplication; procedure Vector_Sort(A: in out Vector) is e: Integer; begin for i in 1..N loop for j in 1..N loop if A(i)>A(j) then E:=A(j); A(j):=A(i); A(i):=e; end if; end loop; end loop; end Vector_Sort; procedure Matrix_Sort(A: in out Matrix) is m: Integer; begin for i in 1..n loop for j in 1..n loop A(i)(j):=A(i)(j); end loop; end loop; for k in 1..n loop for i in reverse 1..n loop for j in 1..(i-1) loop if A(k)(j) <A(k)(j+1) then m :=A(k)(j); A(k)(j):=A(k)(j+1); A(k)(j+1):=m; end if; end loop; end loop; end loop; end Matrix_Sort; function Matrix_Add(A,B: in Matrix) return Matrix is S: Matrix; begin for i in 1..N loop for j in 1..N loop S(i)(j):=A(i)(j) + B(i)(j); end loop; end loop; return S; end Matrix_Add; procedure Matrix_Fill_Ones (A: out Matrix) is begin for i in 1..N loop for j in 1..N loop A(i)(j):=i; end loop; end loop; end Matrix_Fill_Ones; procedure Vector_Fill_Ones (A: out Vector) is begin for i in 1..N loop A(i):=1; end loop; end Vector_Fill_Ones; procedure Vector_Input (A: out Vector) is begin for i in 1..N loop Get(A(i)); end loop; end Vector_Input; procedure Vector_Output (A: in Vector) is begin for i in 1..N loop Put(A(i)); end loop; New_Line; end Vector_Output; procedure Matrix_Input(A: out Matrix) is begin for i in 1..N loop for j in 1..N loop Get(A(i)(j)); end loop; end loop; end Matrix_Input; procedure Matrix_Output(A: in Matrix) is begin for i in 1..N loop for j in 1..N loop Put(A(i)(j)); end loop; New_Line; end loop; New_Line; end Matrix_Output; function Func1(A,B,C: in Vector; MA,ME: in Matrix) return Vector is Z_Sum, O_Sum, D: Vector; MK: Matrix; begin O_Sum:= Sum_Vector(A,B); Vector_Sort(O_Sum); Z_Sum:= Sum_Vector(O_Sum,C); MK:= Matrix_Multiplication(MA,ME); D:= Vector_Matrix_Multiplication(Z_Sum,MK); return D; end Func1; function Func2(MF,MG,MH: in Matrix) return Matrix is MJ: Matrix; MQ: Matrix; begin MJ:= Matrix_Multiplication(MG,MH); MQ:= Matrix_Add(MJ, MF); Matrix_Sort(MQ); return MQ; end Func2; function Func3(O,P: in Vector; MP,MS: in Matrix) return Vector is T,S: Vector; MG: Matrix; begin S:= Sum_Vector(O,P); MG:= Matrix_Multiplication(MP,MS); T:= Vector_Matrix_Multiplication(P,MG); return T; end Func3; end data;
-- Keepa API -- The Keepa API offers numerous endpoints. Every request requires your API access key as a parameter. You can find and change your key in the keepa portal. All requests must be issued as a HTTPS GET and accept gzip encoding. If possible, use a Keep_Alive connection. Multiple requests can be made in parallel to increase throughput. -- -- OpenAPI spec version: 1.0.0 -- Contact: info@keepa.com -- -- NOTE: This package is auto generated by the swagger code generator 4.0.0-beta2. -- https://openapi-generator.tech -- Do not edit the class manually. with Swagger.Streams; with Swagger.Servers.Operation; package body .Skeletons is package body Skeleton is package API_Category is new Swagger.Servers.Operation (Handler => Category, Method => Swagger.Servers.GET, URI => URI_Prefix & "/category"); -- Returns Amazon category information from Keepa API. procedure Category (Req : in out Swagger.Servers.Request'Class; Reply : in out Swagger.Servers.Response'Class; Stream : in out Swagger.Servers.Output_Stream'Class; Context : in out Swagger.Servers.Context_Type) is Impl : Implementation_Type; Key : Swagger.UString; Domain : Integer; Category : Integer; Parents : Integer; Result : .Models.CategoryType_Vectors.Vector; begin Swagger.Servers.Get_Query_Parameter (Req, "key", Key); Swagger.Servers.Get_Query_Parameter (Req, "domain", Domain); Swagger.Servers.Get_Query_Parameter (Req, "category", Category); Swagger.Servers.Get_Query_Parameter (Req, "parents", Parents); Impl.Category (Key, Domain, Category, Parents, Result, Context); if Context.Get_Status = 200 then Stream.Start_Document; .Models.Serialize (Stream, "", Result); Stream.End_Document; end if; end Category; package API_Product is new Swagger.Servers.Operation (Handler => Product, Method => Swagger.Servers.GET, URI => URI_Prefix & "/product"); -- Retrieve the product for the specified ASIN and domain. procedure Product (Req : in out Swagger.Servers.Request'Class; Reply : in out Swagger.Servers.Response'Class; Stream : in out Swagger.Servers.Output_Stream'Class; Context : in out Swagger.Servers.Context_Type) is Impl : Implementation_Type; Key : Swagger.UString; Domain : Integer; Asin : Swagger.Nullable_UString; Code : Swagger.Nullable_UString; Result : .Models.CategoryType_Vectors.Vector; begin Swagger.Servers.Get_Query_Parameter (Req, "key", Key); Swagger.Servers.Get_Query_Parameter (Req, "domain", Domain); Swagger.Servers.Get_Query_Parameter (Req, "asin", Asin); Swagger.Servers.Get_Query_Parameter (Req, "code", Code); Impl.Product (Key, Domain, Asin, Code, Result, Context); if Context.Get_Status = 200 then Stream.Start_Document; .Models.Serialize (Stream, "", Result); Stream.End_Document; end if; end Product; procedure Register (Server : in out Swagger.Servers.Application_Type'Class) is begin Swagger.Servers.Register (Server, API_Category.Definition); Swagger.Servers.Register (Server, API_Product.Definition); end Register; end Skeleton; package body Shared_Instance is -- Returns Amazon category information from Keepa API. procedure Category (Req : in out Swagger.Servers.Request'Class; Reply : in out Swagger.Servers.Response'Class; Stream : in out Swagger.Servers.Output_Stream'Class; Context : in out Swagger.Servers.Context_Type) is Key : Swagger.UString; Domain : Integer; Category : Integer; Parents : Integer; Result : .Models.CategoryType_Vectors.Vector; begin Swagger.Servers.Get_Query_Parameter (Req, "key", Key); Swagger.Servers.Get_Query_Parameter (Req, "domain", Domain); Swagger.Servers.Get_Query_Parameter (Req, "category", Category); Swagger.Servers.Get_Query_Parameter (Req, "parents", Parents); Server.Category (Key, Domain, Category, Parents, Result, Context); if Context.Get_Status = 200 then Stream.Start_Document; .Models.Serialize (Stream, "", Result); Stream.End_Document; end if; end Category; package API_Category is new Swagger.Servers.Operation (Handler => Category, Method => Swagger.Servers.GET, URI => URI_Prefix & "/category"); -- Retrieve the product for the specified ASIN and domain. procedure Product (Req : in out Swagger.Servers.Request'Class; Reply : in out Swagger.Servers.Response'Class; Stream : in out Swagger.Servers.Output_Stream'Class; Context : in out Swagger.Servers.Context_Type) is Key : Swagger.UString; Domain : Integer; Asin : Swagger.Nullable_UString; Code : Swagger.Nullable_UString; Result : .Models.CategoryType_Vectors.Vector; begin Swagger.Servers.Get_Query_Parameter (Req, "key", Key); Swagger.Servers.Get_Query_Parameter (Req, "domain", Domain); Swagger.Servers.Get_Query_Parameter (Req, "asin", Asin); Swagger.Servers.Get_Query_Parameter (Req, "code", Code); Server.Product (Key, Domain, Asin, Code, Result, Context); if Context.Get_Status = 200 then Stream.Start_Document; .Models.Serialize (Stream, "", Result); Stream.End_Document; end if; end Product; package API_Product is new Swagger.Servers.Operation (Handler => Product, Method => Swagger.Servers.GET, URI => URI_Prefix & "/product"); procedure Register (Server : in out Swagger.Servers.Application_Type'Class) is begin Swagger.Servers.Register (Server, API_Category.Definition); Swagger.Servers.Register (Server, API_Product.Definition); end Register; protected body Server is -- Returns Amazon category information from Keepa API. procedure Category (Key : in Swagger.UString; Domain : in Integer; Category : in Integer; Parents : in Integer; Result : out .Models.CategoryType_Vectors.Vector; Context : in out Swagger.Servers.Context_Type) is begin Impl.Category (Key, Domain, Category, Parents, Result, Context); end Category; -- Retrieve the product for the specified ASIN and domain. procedure Product (Key : in Swagger.UString; Domain : in Integer; Asin : in Swagger.Nullable_UString; Code : in Swagger.Nullable_UString; Result : out .Models.CategoryType_Vectors.Vector; Context : in out Swagger.Servers.Context_Type) is begin Impl.Product (Key, Domain, Asin, Code, Result, Context); end Product; end Server; end Shared_Instance; end .Skeletons;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015-2021, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of STMicroelectronics nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- -- -- -- This file is based on: -- -- -- -- @file stm32f4xx_hal_gpio.c -- -- @author MCD Application Team -- -- @version V1.1.0 -- -- @date 19-June-2014 -- -- @brief GPIO HAL module driver. -- -- -- -- COPYRIGHT(c) 2014 STMicroelectronics -- ------------------------------------------------------------------------------ with System; use System; with STM32_SVD.GPIO; use STM32_SVD.GPIO; with STM32.RCC; with STM32.SYSCFG; with System.Machine_Code; package body STM32.GPIO is procedure Lock_The_Pin (This : in out GPIO_Port; Pin : GPIO_Pin); -- This is the routine that actually locks the pin for the port. It is an -- internal routine and has no preconditions. We use it to avoid redundant -- calls to the precondition that checks that the pin is not already -- locked. The redundancy would otherwise occur because the routine that -- locks an array of pins is implemented by calling the routine that locks -- a single pin: both those Lock routines have a precondition that checks -- that the pin(s) is not already being locked. subtype GPIO_Pin_Index is Natural range 0 .. GPIO_Pin'Pos (GPIO_Pin'Last); ------------- -- Any_Set -- ------------- function Any_Set (Pins : GPIO_Points) return Boolean is begin for Pin of Pins loop if Pin.Set then return True; end if; end loop; return False; end Any_Set; ---------- -- Mode -- ---------- overriding function Mode (This : GPIO_Point) return HAL.GPIO.GPIO_Mode is begin case Pin_IO_Mode (This) is when Mode_Out => return HAL.GPIO.Output; when Mode_In => return HAL.GPIO.Input; when others => return HAL.GPIO.Unknown_Mode; end case; end Mode; ----------------- -- Pin_IO_Mode -- ----------------- function Pin_IO_Mode (This : GPIO_Point) return Pin_IO_Modes is Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin); begin return Pin_IO_Modes'Val (This.Periph.MODER.Arr (Index)); end Pin_IO_Mode; -------------- -- Set_Mode -- -------------- overriding procedure Set_Mode (This : in out GPIO_Point; Mode : HAL.GPIO.GPIO_Config_Mode) is Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin); begin case Mode is when HAL.GPIO.Output => This.Periph.MODER.Arr (Index) := Pin_IO_Modes'Enum_Rep (Mode_Out); when HAL.GPIO.Input => This.Periph.MODER.Arr (Index) := Pin_IO_Modes'Enum_Rep (Mode_In); end case; end Set_Mode; ------------------- -- Pull_Resistor -- ------------------- overriding function Pull_Resistor (This : GPIO_Point) return HAL.GPIO.GPIO_Pull_Resistor is Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin); begin if This.Periph.PUPDR.Arr (Index) = 0 then return HAL.GPIO.Floating; elsif This.Periph.PUPDR.Arr (Index) = 1 then return HAL.GPIO.Pull_Up; else return HAL.GPIO.Pull_Down; end if; end Pull_Resistor; ----------------------- -- Set_Pull_Resistor -- ----------------------- overriding procedure Set_Pull_Resistor (This : in out GPIO_Point; Pull : HAL.GPIO.GPIO_Pull_Resistor) is Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin); begin case Pull is when HAL.GPIO.Floating => This.Periph.PUPDR.Arr (Index) := 0; when HAL.GPIO.Pull_Up => This.Periph.PUPDR.Arr (Index) := 1; when HAL.GPIO.Pull_Down => This.Periph.PUPDR.Arr (Index) := 2; end case; end Set_Pull_Resistor; --------- -- Set -- --------- overriding function Set (This : GPIO_Point) return Boolean is Pin_Mask : constant UInt16 := GPIO_Pin'Enum_Rep (This.Pin); begin return (This.Periph.IDR.IDR.Val and Pin_Mask) = Pin_Mask; end Set; ------------- -- All_Set -- ------------- function All_Set (Pins : GPIO_Points) return Boolean is begin for Pin of Pins loop if not Pin.Set then return False; end if; end loop; return True; end All_Set; --------- -- Set -- --------- overriding procedure Set (This : in out GPIO_Point) is begin This.Periph.BSRR.BS.Val := GPIO_Pin'Enum_Rep (This.Pin); -- The bit-set and bit-reset registers ignore writes of zeros so we -- don't need to preserve the existing bit values in those registers. end Set; --------- -- Set -- --------- procedure Set (Pins : in out GPIO_Points) is begin for Pin of Pins loop Pin.Set; end loop; end Set; ----------- -- Clear -- ----------- overriding procedure Clear (This : in out GPIO_Point) is begin This.Periph.BSRR.BR.Val := GPIO_Pin'Enum_Rep (This.Pin); -- The bit-set and bit-reset registers ignore writes of zeros so we -- don't need to preserve the existing bit values in those registers. end Clear; ----------- -- Clear -- ----------- procedure Clear (Pins : in out GPIO_Points) is begin for Pin of Pins loop Pin.Clear; end loop; end Clear; ------------ -- Toggle -- ------------ overriding procedure Toggle (This : in out GPIO_Point) is begin This.Periph.ODR.ODR.Val := This.Periph.ODR.ODR.Val xor GPIO_Pin'Enum_Rep (This.Pin); end Toggle; ------------ -- Toggle -- ------------ procedure Toggle (Points : in out GPIO_Points) is begin for Point of Points loop Point.Toggle; end loop; end Toggle; ----------- -- Drive -- ----------- procedure Drive (This : in out GPIO_Point; Condition : Boolean) is begin if Condition then This.Set; else This.Clear; end if; end Drive; ------------ -- Locked -- ------------ function Locked (This : GPIO_Point) return Boolean is Mask : constant UInt16 := GPIO_Pin'Enum_Rep (This.Pin); begin return (This.Periph.LCKR.LCK.Val and Mask) = Mask; end Locked; ------------------ -- Lock_The_Pin -- ------------------ procedure Lock_The_Pin (This : in out GPIO_Port; Pin : GPIO_Pin) is use System.Machine_Code; use ASCII; begin -- As per the Reference Manual (RM0090; Doc ID 018909 Rev 6) pg 282, a -- specific sequence is required to set a pin's lock bit. The sequence -- writes and reads values from the port's LCKR register. Remember that -- this 32-bit register has 16 bits for the pin mask (0 .. 15), with bit -- #16 used as the "lock control bit". -- -- 1) write a 1 to the lock control bit with a 1 in the pin bit mask for the pin to be locked -- 2) write a 0 to the lock control bit with a 1 in the pin bit mask for the pin to be locked -- 3) do step 1 again -- 4) read the entire LCKR register -- 5) read the entire LCKR register again (optional) -- Throughout the sequence the same value for the lower 16 bits of the -- word must be maintained (i.e., the pin mask), including when clearing -- the LCCK bit in the upper half. -- Expressed in Ada the sequence would be as follows: -- Temp := LCCK or Pin'Enum_Rep; -- -- -- set the lock bit and pin bit, others will be unchanged -- Port.LCKR := Temp; -- -- -- clear the lock bit but keep the pin mask unchanged -- Port.LCKR := Pin'Enum_Rep; -- -- -- set the lock bit again, with both lock bit and pin mask set as before -- Port.LCKR := Temp; -- -- -- read the lock bit to complete key lock sequence -- Temp := Port.LCKR; -- -- -- read the lock bit again (optional) -- Temp := Port.LCKR; -- We use the following assembly language sequence because the above -- high-level version in Ada works only if the optimizer is enabled. -- This is not an issue specific to Ada. If you need a specific sequence -- of instructions you should really specify those instructions. -- We don't want the functionality to depend on the switches, and we -- don't want to preclude debugging, hence the following: Asm ("orr r3, %1, #65536" & LF & HT & -- Temp := LCCK or Pin, ie both set "str r3, [%0, #28]" & LF & HT & -- Port.LCKR := Temp "str %1, [%0, #28]" & LF & HT & -- Port.LCKR := Pin alone, LCCK bit cleared "str r3, [%0, #28]" & LF & HT & -- Port.LCKR := Temp "ldr r3, [%0, #28]" & LF & HT & -- Temp := Port.LCKR "ldr r3, [%0, #28]" & LF & HT, -- Temp := Port.LCKR Inputs => (Address'Asm_Input ("r", This'Address), -- %0 (GPIO_Pin'Asm_Input ("r", Pin))), -- %1 Volatile => True, Clobber => ("r3")); end Lock_The_Pin; ---------- -- Lock -- ---------- procedure Lock (This : GPIO_Point) is begin Lock_The_Pin (This.Periph.all, This.Pin); end Lock; ---------- -- Lock -- ---------- procedure Lock (Points : GPIO_Points) is begin for Point of Points loop if not Locked (Point) then Point.Lock; end if; end loop; end Lock; ------------------ -- Configure_IO -- ------------------ procedure Configure_IO (This : GPIO_Point; Config : GPIO_Port_Configuration) is Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin); begin This.Periph.MODER.Arr (Index) := Pin_IO_Modes'Enum_Rep (Config.Mode); This.Periph.PUPDR.Arr (Index) := Internal_Pin_Resistors'Enum_Rep (Config.Resistors); case Config.Mode is when Mode_In | Mode_Analog => null; when Mode_Out => This.Periph.OTYPER.OT.Arr (Index) := Config.Output_Type = Open_Drain; This.Periph.OSPEEDR.Arr (Index) := Pin_Output_Speeds'Enum_Rep (Config.Speed); when Mode_AF => This.Periph.OTYPER.OT.Arr (Index) := Config.AF_Output_Type = Open_Drain; This.Periph.OSPEEDR.Arr (Index) := Pin_Output_Speeds'Enum_Rep (Config.AF_Speed); Configure_Alternate_Function (This, Config.AF); end case; end Configure_IO; ------------------ -- Configure_IO -- ------------------ procedure Configure_IO (Points : GPIO_Points; Config : GPIO_Port_Configuration) is begin for Point of Points loop Point.Configure_IO (Config); end loop; end Configure_IO; ---------------------------------- -- Configure_Alternate_Function -- ---------------------------------- procedure Configure_Alternate_Function (This : GPIO_Point; AF : GPIO_Alternate_Function) is Index : constant GPIO_Pin_Index := GPIO_Pin'Pos (This.Pin); begin if Index < 8 then This.Periph.AFRL.Arr (Index) := UInt4 (AF); else This.Periph.AFRH.Arr (Index) := UInt4 (AF); end if; end Configure_Alternate_Function; ---------------------------------- -- Configure_Alternate_Function -- ---------------------------------- procedure Configure_Alternate_Function (Points : GPIO_Points; AF : GPIO_Alternate_Function) is begin for Point of Points loop Point.Configure_Alternate_Function (AF); end loop; end Configure_Alternate_Function; --------------------------- -- Interrupt_Line_Number -- --------------------------- function Interrupt_Line_Number (This : GPIO_Point) return EXTI.External_Line_Number is begin return EXTI.External_Line_Number'Val (GPIO_Pin'Pos (This.Pin)); end Interrupt_Line_Number; ----------------------- -- Configure_Trigger -- ----------------------- procedure Configure_Trigger (This : GPIO_Point; Trigger : EXTI.External_Triggers) is use STM32.EXTI; Line : constant External_Line_Number := External_Line_Number'Val (GPIO_Pin'Pos (This.Pin)); use STM32.SYSCFG, STM32.RCC; begin SYSCFG_Clock_Enable; Connect_External_Interrupt (This); if Trigger in Interrupt_Triggers then Enable_External_Interrupt (Line, Trigger); else Enable_External_Event (Line, Trigger); end if; end Configure_Trigger; ----------------------- -- Configure_Trigger -- ----------------------- procedure Configure_Trigger (Points : GPIO_Points; Trigger : EXTI.External_Triggers) is begin for Point of Points loop Point.Configure_Trigger (Trigger); end loop; end Configure_Trigger; end STM32.GPIO;
with Ada.Text_IO; use Ada.Text_IO; procedure Adventofcode.Day_25.Main is begin Put_Line ("Day-25"); end Adventofcode.Day_25.Main;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . S T R E A M S . S T O R A G E . B O U N D E D -- -- -- -- S p e c -- -- -- -- Copyright (C) 2020, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the contents of the part following the private keyword. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- ------------------------------------------------------------------------------ package Ada.Streams.Storage.Bounded with Pure is type Stream_Type (Max_Elements : Stream_Element_Count) is new Storage_Stream_Type with private with Default_Initial_Condition => Element_Count (Stream_Type) = 0; overriding procedure Read (Stream : in out Stream_Type; Item : out Stream_Element_Array; Last : out Stream_Element_Offset) with Post => (declare Num_Read : constant Stream_Element_Count := Stream_Element_Count'Min (Element_Count (Stream)'Old, Item'Length); begin Last = Num_Read + Item'First - 1 and Element_Count (Stream) = Element_Count (Stream)'Old - Num_Read); overriding procedure Write (Stream : in out Stream_Type; Item : Stream_Element_Array) with Post => Element_Count (Stream) = Element_Count (Stream)'Old + Item'Length; overriding function Element_Count (Stream : Stream_Type) return Stream_Element_Count with Post => Element_Count'Result <= Stream.Max_Elements; overriding procedure Clear (Stream : in out Stream_Type) with Post => Element_Count (Stream) = 0; private type Stream_Type (Max_Elements : Stream_Element_Count) is new Storage_Stream_Type with record Count : Stream_Element_Count := 0; Elements : Stream_Element_Array (1 .. Max_Elements); end record; end Ada.Streams.Storage.Bounded;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T M A K E -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT 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 distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Gnatmake usage: please consult the gnat documentation with Gnatvsn; with Make; procedure Gnatmake is pragma Ident (Gnatvsn.Gnat_Static_Version_String); begin -- The real work is done in Package Make. Gnatmake used to be a standalone -- routine. Now Gnatmake's facilities have been placed in a package -- because a number of gnatmake's services may be useful to others. Make.Gnatmake; end Gnatmake;
-- C66002D.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- CHECK THAT OVERLOADED SUBPROGRAM DECLARATIONS -- ARE PERMITTED IN WHICH THERE IS A MINIMAL -- DIFFERENCE BETWEEN THE DECLARATIONS. -- (D) THE BASE TYPE OF A PARAMETER IS DIFFERENT FROM THAT -- OF THE CORRESPONDING ONE. -- CVP 5/4/81 -- JRK 5/8/81 -- NL 10/13/81 WITH REPORT; PROCEDURE C66002D IS USE REPORT; BEGIN TEST ("C66002D", "SUBPROGRAM OVERLOADING WITH " & "MINIMAL DIFFERENCES ALLOWED"); -------------------------------------------------- -- THE BASE TYPE OF ONE PARAMETER IS -- DIFFERENT FROM THAT OF THE CORRESPONDING -- ONE. DECLARE I, J, K : INTEGER := 0; B : BOOLEAN; S : STRING (1..2) := "12"; PROCEDURE P (I1 : INTEGER; BI : OUT BOOLEAN; I2 : IN OUT INTEGER) IS BEGIN S(1) := 'A'; BI := TRUE; -- THIS VALUE IS IRRELEVENT. END P; PROCEDURE P (I1 : INTEGER; BI : OUT INTEGER; I2 : IN OUT INTEGER) IS BEGIN S(2) := 'B'; BI := 0; -- THIS VALUE IS IRRELEVENT. END P; BEGIN P (I, B, K); P (I, J, K); IF S /= "AB" THEN FAILED ("PROCEDURES DIFFERING ONLY BY " & "THE BASE TYPE OF A PARAMETER " & "CAUSED CONFUSION"); END IF; END; -------------------------------------------------- RESULT; END C66002D;
-- ___ _ ___ _ _ -- -- / __| |/ (_) | | Common SKilL implementation -- -- \__ \ ' <| | | |__ stream to skill tokens -- -- |___/_|\_\_|_|____| by: Timm Felden, Dennis Przytarski -- -- -- pragma Ada_2012; with Interfaces.C; with Interfaces.C.Pointers; with Interfaces.C.Strings; with Interfaces.C_Streams; with Skill.Types; with Ada.Exceptions; package Skill.Streams.Reader is type Abstract_Stream is tagged private; type Stream is access all Abstract_Stream'Class; type Input_Stream_T is new Abstract_Stream with private; type Input_Stream is not null access Skill.Streams.Reader.Input_Stream_T; type Sub_Stream_T is new Abstract_Stream with private; type Sub_Stream is access Sub_Stream_T; -- type cast function To (This : access Abstract_Stream'Class) return Stream is (Stream(This)); -- note an empty stream will be created if path is null function Open (Path : Skill.Types.String_Access) return Input_Stream; -- creates a sub map function Map (This : access Input_Stream_T; Base : Types.v64; First : Types.v64; Last : Types.v64) return Sub_Stream; function Empty_Sub_Stream return Sub_Stream; -- destroy a map and close the file procedure Close (This : access Input_Stream_T); -- destroy a sub map procedure Free (This : access Sub_Stream_T); function Path (This : access Input_Stream_T) return Skill.Types.String_Access; function Eof (This : access Abstract_Stream'Class) return Boolean; function Position (This : access Abstract_Stream'Class) return Skill.Types.v64; -- checks validity of argument position for this stream, -- if invalid, raise constraint error procedure Check_Offset (This : access Abstract_Stream'Class; Pos : Skill.Types.v64); procedure Jump (This : access Abstract_Stream'Class; Pos : Skill.Types.v64); function I8 (This : access Abstract_Stream'Class) return Skill.Types.i8; pragma Inline (I8); use type Interfaces.Integer_8; function Bool (This : access Abstract_Stream'Class) return Boolean is (This.I8 /= 0); pragma Inline (Bool); function I16 (This : access Abstract_Stream'Class) return Skill.Types.i16; pragma Inline (I16); function I32 (This : access Abstract_Stream'Class) return Skill.Types.i32; pragma Inline (I32); function I64 (This : access Abstract_Stream'Class) return Skill.Types.i64; pragma Inline (I64); function F32 (This : access Abstract_Stream'Class) return Skill.Types.F32; pragma Inline (F32); function F64 (This : access Abstract_Stream'Class) return Skill.Types.F64; pragma Inline (F64); function V64 (This : access Abstract_Stream'Class) return Skill.Types.v64; -- wont happen, simply too large pragma Inline (V64); function Parse_Exception (This : access Input_Stream_T; Block_Counter : Positive; Cause : in Ada.Exceptions.Exception_Occurrence; Message : String) return String; function Parse_Exception (This : access Input_Stream_T; Block_Counter : Positive; Message : String) return String; private package C renames Interfaces.C; -- returns an invalid map pointer, that can be used in empty maps function Invalid_Pointer return Map_Pointer; pragma Inline (Invalid_Pointer); -- mmap_c_array mmap_open (char const * filename) function MMap_Open (Path : Interfaces.C.Strings.chars_ptr) return Mmap; pragma Import (C, MMap_Open, "mmap_read"); -- void mmap_close(FILE *stream) procedure MMap_Close (File : Interfaces.C_Streams.FILEs); pragma Import (C, MMap_Close, "mmap_close"); type Abstract_Stream is tagged record -- current position Map : Map_Pointer; -- first position Base : Map_Pointer; -- last position EOF : Map_Pointer; end record; type Input_Stream_T is new Abstract_Stream with record Path : Skill.Types.String_Access; -- shared string! File : Interfaces.C_Streams.FILEs; end record; -- a part that is a sub section of an input stream type Sub_Stream_T is new Abstract_Stream with null record; end Skill.Streams.Reader;
with Interfaces; use Interfaces; with Interfaces.C; use Interfaces.C; with SDL_SDL_video_h; use SDL_SDL_video_h; package body Display.Basic.Fonts is type Byte is new Interfaces.Unsigned_8; -- for shift/rotate type Half_Word is new Interfaces.Unsigned_16; -- for shift/rotate BMP_Font16x24 : constant array (0 .. 2279) of Half_Word := (16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#00CC#, 16#00CC#, 16#00CC#, 16#00CC#, 16#00CC#, 16#00CC#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0C60#, 16#0C60#, 16#0C60#, 16#0630#, 16#0630#, 16#1FFE#, 16#1FFE#, 16#0630#, 16#0738#, 16#0318#, 16#1FFE#, 16#1FFE#, 16#0318#, 16#0318#, 16#018C#, 16#018C#, 16#018C#, 16#0000#, 16#0000#, 16#0080#, 16#03E0#, 16#0FF8#, 16#0E9C#, 16#1C8C#, 16#188C#, 16#008C#, 16#0098#, 16#01F8#, 16#07E0#, 16#0E80#, 16#1C80#, 16#188C#, 16#188C#, 16#189C#, 16#0CB8#, 16#0FF0#, 16#03E0#, 16#0080#, 16#0080#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#180E#, 16#0C1B#, 16#0C11#, 16#0611#, 16#0611#, 16#0311#, 16#0311#, 16#019B#, 16#018E#, 16#38C0#, 16#6CC0#, 16#4460#, 16#4460#, 16#4430#, 16#4430#, 16#4418#, 16#6C18#, 16#380C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#01E0#, 16#03F0#, 16#0738#, 16#0618#, 16#0618#, 16#0330#, 16#01F0#, 16#00F0#, 16#00F8#, 16#319C#, 16#330E#, 16#1E06#, 16#1C06#, 16#1C06#, 16#3F06#, 16#73FC#, 16#21F0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0200#, 16#0300#, 16#0180#, 16#00C0#, 16#00C0#, 16#0060#, 16#0060#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0060#, 16#0060#, 16#00C0#, 16#00C0#, 16#0180#, 16#0300#, 16#0200#, 16#0000#, 16#0000#, 16#0020#, 16#0060#, 16#00C0#, 16#0180#, 16#0180#, 16#0300#, 16#0300#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0300#, 16#0300#, 16#0180#, 16#0180#, 16#00C0#, 16#0060#, 16#0020#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#06D8#, 16#07F8#, 16#01E0#, 16#0330#, 16#0738#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#3FFC#, 16#3FFC#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0100#, 16#0100#, 16#0080#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#07E0#, 16#07E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0C00#, 16#0C00#, 16#0600#, 16#0600#, 16#0600#, 16#0300#, 16#0300#, 16#0300#, 16#0380#, 16#0180#, 16#0180#, 16#0180#, 16#00C0#, 16#00C0#, 16#00C0#, 16#0060#, 16#0060#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#07F0#, 16#0E38#, 16#0C18#, 16#180C#, 16#180C#, 16#180C#, 16#180C#, 16#180C#, 16#180C#, 16#180C#, 16#180C#, 16#180C#, 16#0C18#, 16#0E38#, 16#07F0#, 16#03E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0100#, 16#0180#, 16#01C0#, 16#01F0#, 16#0198#, 16#0188#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#0FF8#, 16#0C18#, 16#180C#, 16#180C#, 16#1800#, 16#1800#, 16#0C00#, 16#0600#, 16#0300#, 16#0180#, 16#00C0#, 16#0060#, 16#0030#, 16#0018#, 16#1FFC#, 16#1FFC#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#01E0#, 16#07F8#, 16#0E18#, 16#0C0C#, 16#0C0C#, 16#0C00#, 16#0600#, 16#03C0#, 16#07C0#, 16#0C00#, 16#1800#, 16#1800#, 16#180C#, 16#180C#, 16#0C18#, 16#07F8#, 16#03E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0C00#, 16#0E00#, 16#0F00#, 16#0F00#, 16#0D80#, 16#0CC0#, 16#0C60#, 16#0C60#, 16#0C30#, 16#0C18#, 16#0C0C#, 16#3FFC#, 16#3FFC#, 16#0C00#, 16#0C00#, 16#0C00#, 16#0C00#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0FF8#, 16#0FF8#, 16#0018#, 16#0018#, 16#000C#, 16#03EC#, 16#07FC#, 16#0E1C#, 16#1C00#, 16#1800#, 16#1800#, 16#1800#, 16#180C#, 16#0C1C#, 16#0E18#, 16#07F8#, 16#03E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#07C0#, 16#0FF0#, 16#1C38#, 16#1818#, 16#0018#, 16#000C#, 16#03CC#, 16#0FEC#, 16#0E3C#, 16#1C1C#, 16#180C#, 16#180C#, 16#180C#, 16#1C18#, 16#0E38#, 16#07F0#, 16#03E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#1FFC#, 16#1FFC#, 16#0C00#, 16#0600#, 16#0600#, 16#0300#, 16#0380#, 16#0180#, 16#01C0#, 16#00C0#, 16#00E0#, 16#0060#, 16#0060#, 16#0070#, 16#0030#, 16#0030#, 16#0030#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#07F0#, 16#0E38#, 16#0C18#, 16#0C18#, 16#0C18#, 16#0638#, 16#07F0#, 16#07F0#, 16#0C18#, 16#180C#, 16#180C#, 16#180C#, 16#180C#, 16#0C38#, 16#0FF8#, 16#03E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#07F0#, 16#0E38#, 16#0C1C#, 16#180C#, 16#180C#, 16#180C#, 16#1C1C#, 16#1E38#, 16#1BF8#, 16#19E0#, 16#1800#, 16#0C00#, 16#0C00#, 16#0E1C#, 16#07F8#, 16#01F0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0100#, 16#0100#, 16#0080#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#1000#, 16#1C00#, 16#0F80#, 16#03E0#, 16#00F8#, 16#0018#, 16#00F8#, 16#03E0#, 16#0F80#, 16#1C00#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#1FF8#, 16#0000#, 16#0000#, 16#0000#, 16#1FF8#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0008#, 16#0038#, 16#01F0#, 16#07C0#, 16#1F00#, 16#1800#, 16#1F00#, 16#07C0#, 16#01F0#, 16#0038#, 16#0008#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#0FF8#, 16#0C18#, 16#180C#, 16#180C#, 16#1800#, 16#0C00#, 16#0600#, 16#0300#, 16#0180#, 16#00C0#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#07E0#, 16#1818#, 16#2004#, 16#29C2#, 16#4A22#, 16#4411#, 16#4409#, 16#4409#, 16#4409#, 16#2209#, 16#1311#, 16#0CE2#, 16#4002#, 16#2004#, 16#1818#, 16#07E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0380#, 16#0380#, 16#06C0#, 16#06C0#, 16#06C0#, 16#0C60#, 16#0C60#, 16#1830#, 16#1830#, 16#1830#, 16#3FF8#, 16#3FF8#, 16#701C#, 16#600C#, 16#600C#, 16#C006#, 16#C006#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03FC#, 16#0FFC#, 16#0C0C#, 16#180C#, 16#180C#, 16#180C#, 16#0C0C#, 16#07FC#, 16#0FFC#, 16#180C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#180C#, 16#1FFC#, 16#07FC#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#07C0#, 16#1FF0#, 16#3838#, 16#301C#, 16#700C#, 16#6006#, 16#0006#, 16#0006#, 16#0006#, 16#0006#, 16#0006#, 16#0006#, 16#6006#, 16#700C#, 16#301C#, 16#1FF0#, 16#07E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03FE#, 16#0FFE#, 16#0E06#, 16#1806#, 16#1806#, 16#3006#, 16#3006#, 16#3006#, 16#3006#, 16#3006#, 16#3006#, 16#3006#, 16#1806#, 16#1806#, 16#0E06#, 16#0FFE#, 16#03FE#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3FFC#, 16#3FFC#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#1FFC#, 16#1FFC#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#3FFC#, 16#3FFC#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3FF8#, 16#3FF8#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#1FF8#, 16#1FF8#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0FE0#, 16#3FF8#, 16#783C#, 16#600E#, 16#E006#, 16#C007#, 16#0003#, 16#0003#, 16#FE03#, 16#FE03#, 16#C003#, 16#C007#, 16#C006#, 16#C00E#, 16#F03C#, 16#3FF8#, 16#0FE0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#3FFC#, 16#3FFC#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0600#, 16#0618#, 16#0618#, 16#0738#, 16#03F0#, 16#01E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3006#, 16#1806#, 16#0C06#, 16#0606#, 16#0306#, 16#0186#, 16#00C6#, 16#0066#, 16#0076#, 16#00DE#, 16#018E#, 16#0306#, 16#0606#, 16#0C06#, 16#1806#, 16#3006#, 16#6006#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#1FF8#, 16#1FF8#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#E00E#, 16#F01E#, 16#F01E#, 16#F01E#, 16#D836#, 16#D836#, 16#D836#, 16#D836#, 16#CC66#, 16#CC66#, 16#CC66#, 16#C6C6#, 16#C6C6#, 16#C6C6#, 16#C6C6#, 16#C386#, 16#C386#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#300C#, 16#301C#, 16#303C#, 16#303C#, 16#306C#, 16#306C#, 16#30CC#, 16#30CC#, 16#318C#, 16#330C#, 16#330C#, 16#360C#, 16#360C#, 16#3C0C#, 16#3C0C#, 16#380C#, 16#300C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#07E0#, 16#1FF8#, 16#381C#, 16#700E#, 16#6006#, 16#C003#, 16#C003#, 16#C003#, 16#C003#, 16#C003#, 16#C003#, 16#C003#, 16#6006#, 16#700E#, 16#381C#, 16#1FF8#, 16#07E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0FFC#, 16#1FFC#, 16#380C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#180C#, 16#1FFC#, 16#07FC#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#07E0#, 16#1FF8#, 16#381C#, 16#700E#, 16#6006#, 16#E003#, 16#C003#, 16#C003#, 16#C003#, 16#C003#, 16#C003#, 16#E007#, 16#6306#, 16#3F0E#, 16#3C1C#, 16#3FF8#, 16#F7E0#, 16#C000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0FFE#, 16#1FFE#, 16#3806#, 16#3006#, 16#3006#, 16#3006#, 16#3806#, 16#1FFE#, 16#07FE#, 16#0306#, 16#0606#, 16#0C06#, 16#1806#, 16#1806#, 16#3006#, 16#3006#, 16#6006#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#0FF8#, 16#0C1C#, 16#180C#, 16#180C#, 16#000C#, 16#001C#, 16#03F8#, 16#0FE0#, 16#1E00#, 16#3800#, 16#3006#, 16#3006#, 16#300E#, 16#1C1C#, 16#0FF8#, 16#07E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#7FFE#, 16#7FFE#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#300C#, 16#1818#, 16#1FF8#, 16#07E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#6003#, 16#3006#, 16#3006#, 16#3006#, 16#180C#, 16#180C#, 16#180C#, 16#0C18#, 16#0C18#, 16#0E38#, 16#0630#, 16#0630#, 16#0770#, 16#0360#, 16#0360#, 16#01C0#, 16#01C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#6003#, 16#61C3#, 16#61C3#, 16#61C3#, 16#3366#, 16#3366#, 16#3366#, 16#3366#, 16#3366#, 16#3366#, 16#1B6C#, 16#1B6C#, 16#1B6C#, 16#1A2C#, 16#1E3C#, 16#0E38#, 16#0E38#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#E00F#, 16#700C#, 16#3018#, 16#1830#, 16#0C70#, 16#0E60#, 16#07C0#, 16#0380#, 16#0380#, 16#03C0#, 16#06E0#, 16#0C70#, 16#1C30#, 16#1818#, 16#300C#, 16#600E#, 16#E007#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#C003#, 16#6006#, 16#300C#, 16#381C#, 16#1838#, 16#0C30#, 16#0660#, 16#07E0#, 16#03C0#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#7FFC#, 16#7FFC#, 16#6000#, 16#3000#, 16#1800#, 16#0C00#, 16#0600#, 16#0300#, 16#0180#, 16#00C0#, 16#0060#, 16#0030#, 16#0018#, 16#000C#, 16#0006#, 16#7FFE#, 16#7FFE#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#03E0#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#0060#, 16#03E0#, 16#03E0#, 16#0000#, 16#0000#, 16#0030#, 16#0030#, 16#0060#, 16#0060#, 16#0060#, 16#00C0#, 16#00C0#, 16#00C0#, 16#01C0#, 16#0180#, 16#0180#, 16#0180#, 16#0300#, 16#0300#, 16#0300#, 16#0600#, 16#0600#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#03E0#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#0300#, 16#03E0#, 16#03E0#, 16#0000#, 16#0000#, 16#0000#, 16#01C0#, 16#01C0#, 16#0360#, 16#0360#, 16#0360#, 16#0630#, 16#0630#, 16#0C18#, 16#0C18#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#FFFF#, 16#FFFF#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03F0#, 16#07F8#, 16#0C1C#, 16#0C0C#, 16#0F00#, 16#0FF0#, 16#0CF8#, 16#0C0C#, 16#0C0C#, 16#0F1C#, 16#0FF8#, 16#18F0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#03D8#, 16#0FF8#, 16#0C38#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#0C38#, 16#0FF8#, 16#03D8#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03C0#, 16#07F0#, 16#0E30#, 16#0C18#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0C18#, 16#0E30#, 16#07F0#, 16#03C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#1800#, 16#1800#, 16#1800#, 16#1800#, 16#1800#, 16#1BC0#, 16#1FF0#, 16#1C30#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1C30#, 16#1FF0#, 16#1BC0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03C0#, 16#0FF0#, 16#0C30#, 16#1818#, 16#1FF8#, 16#1FF8#, 16#0018#, 16#0018#, 16#1838#, 16#1C30#, 16#0FF0#, 16#07C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0F80#, 16#0FC0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#07F0#, 16#07F0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0DE0#, 16#0FF8#, 16#0E18#, 16#0C0C#, 16#0C0C#, 16#0C0C#, 16#0C0C#, 16#0C0C#, 16#0C0C#, 16#0E18#, 16#0FF8#, 16#0DE0#, 16#0C00#, 16#0C0C#, 16#061C#, 16#07F8#, 16#01F0#, 16#0000#, 16#0000#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#07D8#, 16#0FF8#, 16#1C38#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00F8#, 16#0078#, 16#0000#, 16#0000#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#000C#, 16#0C0C#, 16#060C#, 16#030C#, 16#018C#, 16#00CC#, 16#006C#, 16#00FC#, 16#019C#, 16#038C#, 16#030C#, 16#060C#, 16#0C0C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3C7C#, 16#7EFF#, 16#E3C7#, 16#C183#, 16#C183#, 16#C183#, 16#C183#, 16#C183#, 16#C183#, 16#C183#, 16#C183#, 16#C183#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0798#, 16#0FF8#, 16#1C38#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03C0#, 16#0FF0#, 16#0C30#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#0C30#, 16#0FF0#, 16#03C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03D8#, 16#0FF8#, 16#0C38#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#0C38#, 16#0FF8#, 16#03D8#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0018#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#1BC0#, 16#1FF0#, 16#1C30#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1C30#, 16#1FF0#, 16#1BC0#, 16#1800#, 16#1800#, 16#1800#, 16#1800#, 16#1800#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#07B0#, 16#03F0#, 16#0070#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0030#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#03E0#, 16#03F0#, 16#0E38#, 16#0C18#, 16#0038#, 16#03F0#, 16#07C0#, 16#0C00#, 16#0C18#, 16#0E38#, 16#07F0#, 16#03E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0080#, 16#00C0#, 16#00C0#, 16#00C0#, 16#07F0#, 16#07F0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#07C0#, 16#0780#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1818#, 16#1C38#, 16#1FF0#, 16#19E0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#180C#, 16#0C18#, 16#0C18#, 16#0C18#, 16#0630#, 16#0630#, 16#0630#, 16#0360#, 16#0360#, 16#0360#, 16#01C0#, 16#01C0#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#41C1#, 16#41C1#, 16#61C3#, 16#6363#, 16#6363#, 16#6363#, 16#3636#, 16#3636#, 16#3636#, 16#1C1C#, 16#1C1C#, 16#1C1C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#381C#, 16#1C38#, 16#0C30#, 16#0660#, 16#0360#, 16#0360#, 16#0360#, 16#0360#, 16#0660#, 16#0C30#, 16#1C38#, 16#381C#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3018#, 16#1830#, 16#1830#, 16#1870#, 16#0C60#, 16#0C60#, 16#0CE0#, 16#06C0#, 16#06C0#, 16#0380#, 16#0380#, 16#0380#, 16#0180#, 16#0180#, 16#01C0#, 16#00F0#, 16#0070#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#1FFC#, 16#1FFC#, 16#0C00#, 16#0600#, 16#0300#, 16#0180#, 16#00C0#, 16#0060#, 16#0030#, 16#0018#, 16#1FFC#, 16#1FFC#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0300#, 16#0180#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#0060#, 16#0060#, 16#0030#, 16#0060#, 16#0040#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#00C0#, 16#0180#, 16#0300#, 16#0000#, 16#0000#, 16#0000#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0000#, 16#0000#, 16#0060#, 16#00C0#, 16#01C0#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0300#, 16#0300#, 16#0600#, 16#0300#, 16#0100#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#0180#, 16#00C0#, 16#0060#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#10F0#, 16#1FF8#, 16#0F08#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#); BMP_Font12x12 : constant array (0 .. 1151) of Half_Word := (16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#5000#, 16#5000#, 16#5000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0900#, 16#0900#, 16#1200#, 16#7f00#, 16#1200#, 16#7f00#, 16#1200#, 16#2400#, 16#2400#, 16#0000#, 16#0000#, 16#1000#, 16#3800#, 16#5400#, 16#5000#, 16#5000#, 16#3800#, 16#1400#, 16#5400#, 16#5400#, 16#3800#, 16#1000#, 16#0000#, 16#0000#, 16#3080#, 16#4900#, 16#4900#, 16#4a00#, 16#32c0#, 16#0520#, 16#0920#, 16#0920#, 16#10c0#, 16#0000#, 16#0000#, 16#0000#, 16#0c00#, 16#1200#, 16#1200#, 16#1400#, 16#1800#, 16#2500#, 16#2300#, 16#2300#, 16#1d80#, 16#0000#, 16#0000#, 16#0000#, 16#4000#, 16#4000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0800#, 16#1000#, 16#1000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#1000#, 16#1000#, 16#0000#, 16#4000#, 16#2000#, 16#2000#, 16#1000#, 16#1000#, 16#1000#, 16#1000#, 16#1000#, 16#1000#, 16#2000#, 16#2000#, 16#0000#, 16#2000#, 16#7000#, 16#2000#, 16#5000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0800#, 16#0800#, 16#7f00#, 16#0800#, 16#0800#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#2000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#7000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#1000#, 16#1000#, 16#1000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#4000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#1000#, 16#2800#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#2800#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#1000#, 16#3000#, 16#5000#, 16#1000#, 16#1000#, 16#1000#, 16#1000#, 16#1000#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#3000#, 16#4800#, 16#4400#, 16#0400#, 16#0800#, 16#1000#, 16#2000#, 16#4000#, 16#7c00#, 16#0000#, 16#0000#, 16#0000#, 16#3000#, 16#4800#, 16#0400#, 16#0800#, 16#1000#, 16#0800#, 16#4400#, 16#4800#, 16#3000#, 16#0000#, 16#0000#, 16#0000#, 16#0800#, 16#1800#, 16#1800#, 16#2800#, 16#2800#, 16#4800#, 16#7c00#, 16#0800#, 16#0800#, 16#0000#, 16#0000#, 16#0000#, 16#3c00#, 16#2000#, 16#4000#, 16#7000#, 16#4800#, 16#0400#, 16#4400#, 16#4800#, 16#3000#, 16#0000#, 16#0000#, 16#0000#, 16#1800#, 16#2400#, 16#4000#, 16#5000#, 16#6800#, 16#4400#, 16#4400#, 16#2800#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#7c00#, 16#0400#, 16#0800#, 16#1000#, 16#1000#, 16#1000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#1000#, 16#2800#, 16#4400#, 16#2800#, 16#1000#, 16#2800#, 16#4400#, 16#2800#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#1000#, 16#2800#, 16#4400#, 16#4400#, 16#2c00#, 16#1400#, 16#0400#, 16#4800#, 16#3000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#2000#, 16#4000#, 16#0000#, 16#0000#, 16#0400#, 16#0800#, 16#3000#, 16#4000#, 16#3000#, 16#0800#, 16#0400#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#7c00#, 16#0000#, 16#0000#, 16#7c00#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#4000#, 16#2000#, 16#1800#, 16#0400#, 16#1800#, 16#2000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3800#, 16#6400#, 16#4400#, 16#0400#, 16#0800#, 16#1000#, 16#1000#, 16#0000#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#0f80#, 16#1040#, 16#2ea0#, 16#51a0#, 16#5120#, 16#5120#, 16#5120#, 16#5320#, 16#4dc0#, 16#2020#, 16#1040#, 16#0000#, 16#0800#, 16#1400#, 16#1400#, 16#1400#, 16#2200#, 16#3e00#, 16#2200#, 16#4100#, 16#4100#, 16#0000#, 16#0000#, 16#0000#, 16#3c00#, 16#2200#, 16#2200#, 16#2200#, 16#3c00#, 16#2200#, 16#2200#, 16#2200#, 16#3c00#, 16#0000#, 16#0000#, 16#0000#, 16#0e00#, 16#1100#, 16#2100#, 16#2000#, 16#2000#, 16#2000#, 16#2100#, 16#1100#, 16#0e00#, 16#0000#, 16#0000#, 16#0000#, 16#3c00#, 16#2200#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#2200#, 16#3c00#, 16#0000#, 16#0000#, 16#0000#, 16#3e00#, 16#2000#, 16#2000#, 16#2000#, 16#3e00#, 16#2000#, 16#2000#, 16#2000#, 16#3e00#, 16#0000#, 16#0000#, 16#0000#, 16#3e00#, 16#2000#, 16#2000#, 16#2000#, 16#3c00#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0e00#, 16#1100#, 16#2100#, 16#2000#, 16#2700#, 16#2100#, 16#2100#, 16#1100#, 16#0e00#, 16#0000#, 16#0000#, 16#0000#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#3f00#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#4800#, 16#4800#, 16#3000#, 16#0000#, 16#0000#, 16#0000#, 16#2200#, 16#2400#, 16#2800#, 16#2800#, 16#3800#, 16#2800#, 16#2400#, 16#2400#, 16#2200#, 16#0000#, 16#0000#, 16#0000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#3e00#, 16#0000#, 16#0000#, 16#0000#, 16#2080#, 16#3180#, 16#3180#, 16#3180#, 16#2a80#, 16#2a80#, 16#2a80#, 16#2a80#, 16#2480#, 16#0000#, 16#0000#, 16#0000#, 16#2100#, 16#3100#, 16#3100#, 16#2900#, 16#2900#, 16#2500#, 16#2300#, 16#2300#, 16#2100#, 16#0000#, 16#0000#, 16#0000#, 16#0c00#, 16#1200#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#1200#, 16#0c00#, 16#0000#, 16#0000#, 16#0000#, 16#3c00#, 16#2200#, 16#2200#, 16#2200#, 16#3c00#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0c00#, 16#1200#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#1600#, 16#0d00#, 16#0100#, 16#0000#, 16#0000#, 16#3e00#, 16#2100#, 16#2100#, 16#2100#, 16#3e00#, 16#2400#, 16#2200#, 16#2100#, 16#2080#, 16#0000#, 16#0000#, 16#0000#, 16#1c00#, 16#2200#, 16#2200#, 16#2000#, 16#1c00#, 16#0200#, 16#2200#, 16#2200#, 16#1c00#, 16#0000#, 16#0000#, 16#0000#, 16#3e00#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0000#, 16#0000#, 16#0000#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#2100#, 16#1200#, 16#0c00#, 16#0000#, 16#0000#, 16#0000#, 16#4100#, 16#4100#, 16#2200#, 16#2200#, 16#2200#, 16#1400#, 16#1400#, 16#1400#, 16#0800#, 16#0000#, 16#0000#, 16#0000#, 16#4440#, 16#4a40#, 16#2a40#, 16#2a80#, 16#2a80#, 16#2a80#, 16#2a80#, 16#2a80#, 16#1100#, 16#0000#, 16#0000#, 16#0000#, 16#4100#, 16#2200#, 16#1400#, 16#1400#, 16#0800#, 16#1400#, 16#1400#, 16#2200#, 16#4100#, 16#0000#, 16#0000#, 16#0000#, 16#4100#, 16#2200#, 16#2200#, 16#1400#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0800#, 16#0000#, 16#0000#, 16#0000#, 16#7e00#, 16#0200#, 16#0400#, 16#0800#, 16#1000#, 16#1000#, 16#2000#, 16#4000#, 16#7e00#, 16#0000#, 16#0000#, 16#0000#, 16#3000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#4000#, 16#4000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#1000#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#6000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#1000#, 16#2800#, 16#2800#, 16#2800#, 16#4400#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#7e00#, 16#4000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3800#, 16#4400#, 16#0400#, 16#3c00#, 16#4400#, 16#4400#, 16#3c00#, 16#0000#, 16#0000#, 16#0000#, 16#4000#, 16#4000#, 16#5800#, 16#6400#, 16#4400#, 16#4400#, 16#4400#, 16#6400#, 16#5800#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3000#, 16#4800#, 16#4000#, 16#4000#, 16#4000#, 16#4800#, 16#3000#, 16#0000#, 16#0000#, 16#0000#, 16#0400#, 16#0400#, 16#3400#, 16#4c00#, 16#4400#, 16#4400#, 16#4400#, 16#4c00#, 16#3400#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3800#, 16#4400#, 16#4400#, 16#7c00#, 16#4000#, 16#4400#, 16#3800#, 16#0000#, 16#0000#, 16#0000#, 16#6000#, 16#4000#, 16#e000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3400#, 16#4c00#, 16#4400#, 16#4400#, 16#4400#, 16#4c00#, 16#3400#, 16#0400#, 16#4400#, 16#0000#, 16#4000#, 16#4000#, 16#5800#, 16#6400#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#0000#, 16#0000#, 16#0000#, 16#4000#, 16#0000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#4000#, 16#0000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#0000#, 16#4000#, 16#4000#, 16#4800#, 16#5000#, 16#6000#, 16#5000#, 16#5000#, 16#4800#, 16#4800#, 16#0000#, 16#0000#, 16#0000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#5200#, 16#6d00#, 16#4900#, 16#4900#, 16#4900#, 16#4900#, 16#4900#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#5800#, 16#6400#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3800#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#3800#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#5800#, 16#6400#, 16#4400#, 16#4400#, 16#4400#, 16#6400#, 16#5800#, 16#4000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#3400#, 16#4c00#, 16#4400#, 16#4400#, 16#4400#, 16#4c00#, 16#3400#, 16#0400#, 16#0400#, 16#0000#, 16#0000#, 16#0000#, 16#5000#, 16#6000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#3000#, 16#4800#, 16#4000#, 16#3000#, 16#0800#, 16#4800#, 16#3000#, 16#0000#, 16#0000#, 16#0000#, 16#4000#, 16#4000#, 16#e000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#4000#, 16#6000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#4400#, 16#4c00#, 16#3400#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#4400#, 16#4400#, 16#2800#, 16#2800#, 16#2800#, 16#2800#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#4900#, 16#4900#, 16#5500#, 16#5500#, 16#5500#, 16#5500#, 16#2200#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#4400#, 16#2800#, 16#2800#, 16#1000#, 16#2800#, 16#2800#, 16#4400#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#4400#, 16#4400#, 16#2800#, 16#2800#, 16#2800#, 16#1000#, 16#1000#, 16#1000#, 16#1000#, 16#0000#, 16#0000#, 16#0000#, 16#7800#, 16#0800#, 16#1000#, 16#2000#, 16#2000#, 16#4000#, 16#7800#, 16#0000#, 16#0000#, 16#0000#, 16#1000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#4000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#4000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#1000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#2000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#7400#, 16#5800#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#0000#, 16#7000#, 16#5000#, 16#5000#, 16#5000#, 16#5000#, 16#5000#, 16#5000#, 16#7000#, 16#0000#, 16#0000#); BMP_Font8x8 : constant array (0 .. 767) of Byte := (16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#40#, 16#40#, 16#40#, 16#40#, 16#40#, 16#00#, 16#40#, 16#a0#, 16#a0#, 16#a0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#24#, 16#24#, 16#fe#, 16#48#, 16#fc#, 16#48#, 16#48#, 16#38#, 16#54#, 16#50#, 16#38#, 16#14#, 16#14#, 16#54#, 16#38#, 16#44#, 16#a8#, 16#a8#, 16#50#, 16#14#, 16#1a#, 16#2a#, 16#24#, 16#10#, 16#28#, 16#28#, 16#10#, 16#74#, 16#4c#, 16#4c#, 16#30#, 16#10#, 16#10#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#08#, 16#10#, 16#08#, 16#08#, 16#08#, 16#08#, 16#08#, 16#08#, 16#10#, 16#00#, 16#00#, 16#24#, 16#18#, 16#3c#, 16#18#, 16#24#, 16#00#, 16#00#, 16#00#, 16#10#, 16#10#, 16#7c#, 16#10#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#08#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3c#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#18#, 16#08#, 16#08#, 16#08#, 16#10#, 16#10#, 16#20#, 16#20#, 16#20#, 16#18#, 16#24#, 16#24#, 16#24#, 16#24#, 16#24#, 16#24#, 16#18#, 16#08#, 16#18#, 16#28#, 16#08#, 16#08#, 16#08#, 16#08#, 16#08#, 16#38#, 16#44#, 16#00#, 16#04#, 16#08#, 16#10#, 16#20#, 16#7c#, 16#18#, 16#24#, 16#04#, 16#18#, 16#04#, 16#04#, 16#24#, 16#18#, 16#04#, 16#0c#, 16#14#, 16#24#, 16#44#, 16#7e#, 16#04#, 16#04#, 16#3c#, 16#20#, 16#20#, 16#38#, 16#04#, 16#04#, 16#24#, 16#18#, 16#18#, 16#24#, 16#20#, 16#38#, 16#24#, 16#24#, 16#24#, 16#18#, 16#3c#, 16#04#, 16#08#, 16#08#, 16#08#, 16#10#, 16#10#, 16#10#, 16#18#, 16#24#, 16#24#, 16#18#, 16#24#, 16#24#, 16#24#, 16#18#, 16#18#, 16#24#, 16#24#, 16#24#, 16#1c#, 16#04#, 16#24#, 16#18#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#08#, 16#10#, 16#00#, 16#00#, 16#00#, 16#04#, 16#18#, 16#20#, 16#18#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3c#, 16#00#, 16#3c#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#18#, 16#04#, 16#18#, 16#20#, 16#00#, 16#18#, 16#24#, 16#04#, 16#08#, 16#10#, 16#10#, 16#00#, 16#10#, 16#3c#, 16#42#, 16#99#, 16#a5#, 16#a5#, 16#9d#, 16#42#, 16#38#, 16#38#, 16#44#, 16#44#, 16#44#, 16#7c#, 16#44#, 16#44#, 16#44#, 16#78#, 16#44#, 16#44#, 16#78#, 16#44#, 16#44#, 16#44#, 16#78#, 16#1c#, 16#22#, 16#42#, 16#40#, 16#40#, 16#42#, 16#22#, 16#1c#, 16#70#, 16#48#, 16#44#, 16#44#, 16#44#, 16#44#, 16#48#, 16#70#, 16#7c#, 16#40#, 16#40#, 16#7c#, 16#40#, 16#40#, 16#40#, 16#7c#, 16#3c#, 16#20#, 16#20#, 16#38#, 16#20#, 16#20#, 16#20#, 16#20#, 16#1c#, 16#22#, 16#42#, 16#40#, 16#4e#, 16#42#, 16#22#, 16#1c#, 16#44#, 16#44#, 16#44#, 16#7c#, 16#44#, 16#44#, 16#44#, 16#44#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#04#, 16#04#, 16#04#, 16#04#, 16#04#, 16#24#, 16#24#, 16#18#, 16#44#, 16#48#, 16#50#, 16#70#, 16#50#, 16#48#, 16#48#, 16#44#, 16#20#, 16#20#, 16#20#, 16#20#, 16#20#, 16#20#, 16#20#, 16#3c#, 16#82#, 16#c6#, 16#c6#, 16#aa#, 16#aa#, 16#aa#, 16#aa#, 16#92#, 16#42#, 16#62#, 16#52#, 16#52#, 16#4a#, 16#4a#, 16#46#, 16#42#, 16#18#, 16#24#, 16#42#, 16#42#, 16#42#, 16#42#, 16#24#, 16#18#, 16#78#, 16#44#, 16#44#, 16#44#, 16#78#, 16#40#, 16#40#, 16#40#, 16#18#, 16#24#, 16#42#, 16#42#, 16#42#, 16#42#, 16#2c#, 16#1a#, 16#78#, 16#44#, 16#44#, 16#78#, 16#50#, 16#48#, 16#44#, 16#42#, 16#38#, 16#44#, 16#40#, 16#38#, 16#04#, 16#44#, 16#44#, 16#38#, 16#7c#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#42#, 16#42#, 16#42#, 16#42#, 16#42#, 16#42#, 16#24#, 16#18#, 16#44#, 16#44#, 16#28#, 16#28#, 16#28#, 16#28#, 16#28#, 16#10#, 16#92#, 16#aa#, 16#aa#, 16#aa#, 16#aa#, 16#aa#, 16#aa#, 16#44#, 16#42#, 16#24#, 16#24#, 16#18#, 16#18#, 16#24#, 16#24#, 16#42#, 16#44#, 16#28#, 16#28#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#7c#, 16#04#, 16#08#, 16#10#, 16#10#, 16#20#, 16#40#, 16#7c#, 16#1c#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#1c#, 16#10#, 16#10#, 16#08#, 16#08#, 16#08#, 16#08#, 16#04#, 16#04#, 16#1c#, 16#04#, 16#04#, 16#04#, 16#04#, 16#04#, 16#04#, 16#1c#, 16#10#, 16#28#, 16#44#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#10#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#04#, 16#1c#, 16#24#, 16#24#, 16#1c#, 16#20#, 16#20#, 16#28#, 16#34#, 16#24#, 16#24#, 16#34#, 16#28#, 16#00#, 16#00#, 16#18#, 16#24#, 16#20#, 16#20#, 16#24#, 16#18#, 16#04#, 16#04#, 16#14#, 16#2c#, 16#24#, 16#24#, 16#2c#, 16#14#, 16#00#, 16#00#, 16#18#, 16#24#, 16#3c#, 16#20#, 16#24#, 16#18#, 16#00#, 16#18#, 16#10#, 16#10#, 16#18#, 16#10#, 16#10#, 16#10#, 16#00#, 16#18#, 16#24#, 16#24#, 16#18#, 16#04#, 16#24#, 16#18#, 16#20#, 16#20#, 16#28#, 16#34#, 16#24#, 16#24#, 16#24#, 16#24#, 16#10#, 16#00#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#08#, 16#00#, 16#08#, 16#08#, 16#08#, 16#08#, 16#28#, 16#10#, 16#20#, 16#20#, 16#24#, 16#28#, 16#30#, 16#28#, 16#24#, 16#24#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#00#, 16#00#, 16#a6#, 16#da#, 16#92#, 16#92#, 16#92#, 16#92#, 16#00#, 16#00#, 16#28#, 16#34#, 16#24#, 16#24#, 16#24#, 16#24#, 16#00#, 16#00#, 16#18#, 16#24#, 16#24#, 16#24#, 16#24#, 16#18#, 16#00#, 16#28#, 16#34#, 16#24#, 16#38#, 16#20#, 16#20#, 16#20#, 16#00#, 16#14#, 16#2c#, 16#24#, 16#1c#, 16#04#, 16#04#, 16#04#, 16#00#, 16#00#, 16#2c#, 16#30#, 16#20#, 16#20#, 16#20#, 16#20#, 16#00#, 16#00#, 16#18#, 16#24#, 16#10#, 16#08#, 16#24#, 16#18#, 16#00#, 16#10#, 16#38#, 16#10#, 16#10#, 16#10#, 16#10#, 16#18#, 16#00#, 16#00#, 16#24#, 16#24#, 16#24#, 16#24#, 16#2c#, 16#14#, 16#00#, 16#00#, 16#44#, 16#44#, 16#28#, 16#28#, 16#28#, 16#10#, 16#00#, 16#00#, 16#92#, 16#aa#, 16#aa#, 16#aa#, 16#aa#, 16#44#, 16#00#, 16#00#, 16#44#, 16#28#, 16#10#, 16#10#, 16#28#, 16#44#, 16#00#, 16#28#, 16#28#, 16#28#, 16#10#, 16#10#, 16#10#, 16#10#, 16#00#, 16#00#, 16#3c#, 16#04#, 16#08#, 16#10#, 16#20#, 16#3c#, 16#00#, 16#08#, 16#10#, 16#10#, 16#20#, 16#10#, 16#10#, 16#08#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#10#, 16#00#, 16#10#, 16#08#, 16#08#, 16#04#, 16#08#, 16#08#, 16#10#, 16#00#, 16#00#, 16#00#, 16#60#, 16#92#, 16#0c#, 16#00#, 16#00#, 16#ff#, 16#ff#, 16#ff#, 16#ff#, 16#ff#, 16#ff#, 16#ff#, 16#ff#); ------------------- -- Draw_Char_8x8 -- ------------------- procedure Draw_Char_8x8 (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; FG, BG : Uint32) is Char_Index : constant Natural := (Character'Pos (Char) - 32) * 8; begin -- Character outside screen if P.X > Integer(Canvas.Surface.w - 8) or else P.Y > Integer(Canvas.Surface.h - 8) then return; end if; for H in 0 .. 7 loop for W in 0 .. 7 loop if (BMP_Font8x8 (Char_Index + H) and (2**(8 - W))) /= 0 then Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, FG); else Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, BG); end if; end loop; end loop; end Draw_Char_8x8; procedure Draw_Char_8x8 (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; FG : Uint32) is Char_Index : constant Natural := (Character'Pos (Char) - 32) * 8; begin -- Character outside screen if P.X > Integer(Canvas.Surface.w - 8) or else P.Y > Integer(Canvas.Surface.h - 8) then return; end if; for H in 0 .. 7 loop for W in 0 .. 7 loop if (BMP_Font8x8 (Char_Index + H) and (2**(8 - W))) /= 0 then Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, FG); end if; end loop; end loop; end Draw_Char_8x8; --------------------- -- Draw_Char_12x12 -- --------------------- procedure Draw_Char_12x12 (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; FG, BG : Uint32) is Char_Index : constant Natural := (Character'Pos (Char) - 32) * 12; begin -- Character outside screen if P.X > Integer(Canvas.Surface.w - 12) or else P.Y > Integer(Canvas.Surface.h - 12) then return; end if; for H in 0 .. 11 loop for W in 0 .. 11 loop if (BMP_Font12x12 (Char_Index + H) and (2**(16 - W))) /= 0 then Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, FG); else Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, BG); end if; end loop; end loop; end Draw_Char_12x12; procedure Draw_Char_12x12 (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; FG : Uint32) is Char_Index : constant Natural := (Character'Pos (Char) - 32) * 12; begin -- Character outside screen if P.X > Integer(Canvas.Surface.w - 12) or else P.Y > Integer(Canvas.Surface.h - 12) then return; end if; for H in 0 .. 11 loop for W in 0 .. 11 loop if (BMP_Font12x12 (Char_Index + H) and (2**(16 - W))) /= 0 then Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, FG); end if; end loop; end loop; end Draw_Char_12x12; --------------------- -- Draw_Char_16x24 -- --------------------- procedure Draw_Char_16x24 (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; FG, BG : Uint32) is Char_Index : constant Natural := (Character'Pos (Char) - 32) * 24; begin -- Character outside screen if P.X > Integer(Canvas.Surface.w - 16) or else P.Y > Integer(Canvas.Surface.h - 16) then return; end if; for H in 0 .. 23 loop for W in 0 .. 15 loop if (BMP_Font16x24 (Char_Index + H) and (2**W)) /= 0 then Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, FG); else Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, BG); end if; end loop; end loop; end Draw_Char_16x24; procedure Draw_Char_16x24 (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; FG : Uint32) is Char_Index : constant Natural := (Character'Pos (Char) - 32) * 24; begin -- Character outside screen if P.X > Integer(Canvas.Surface.w - 16) or else P.Y > Integer(Canvas.Surface.h - 16) then return; end if; for H in 0 .. 23 loop for W in 0 .. 15 loop if (BMP_Font16x24 (Char_Index + H) and (2**W)) /= 0 then Put_Pixel (Canvas.Surface, P.X + W, P.Y + H, FG); end if; end loop; end loop; end Draw_Char_16x24; --------------- -- Draw_Char -- --------------- procedure Draw_Char (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; Font : BMP_Font; FG, BG : Uint32) is begin case Font is when Font8x8 => Draw_Char_8x8 (Canvas, P, Char, FG, BG); when Font12x12 => Draw_Char_12x12 (Canvas, P, Char, FG, BG); when Font16x24 => Draw_Char_16x24 (Canvas, P, Char, FG, BG); end case; end Draw_Char; procedure Draw_Char (Canvas : T_Internal_Canvas; P : Screen_Point; Char : Character; Font : BMP_Font; FG : Uint32) is begin case Font is when Font8x8 => Draw_Char_8x8 (Canvas, P, Char, FG); when Font12x12 => Draw_Char_12x12 (Canvas, P, Char, FG); when Font16x24 => Draw_Char_16x24 (Canvas, P, Char, FG); end case; end Draw_Char; ----------------- -- Draw_String -- ----------------- procedure Draw_String (Canvas : T_Internal_Canvas; P : Screen_Point; Str : String; Font : BMP_Font; FG, BG : RGBA_T; Wrap : Boolean := False) is -- Count : Natural := 0; Cursor : Screen_Point := P; FG_U, BG_U : Uint32; begin FG_U := SDL_MapRGBA (Canvas.Surface.format.all'Address, unsigned_char (FG.R), unsigned_char (FG.G), unsigned_char (FG.B), unsigned_char (FG.A)); BG_U := SDL_MapRGBA (Canvas.Surface.format.all'Address, unsigned_char (BG.R), unsigned_char (BG.G), unsigned_char (BG.B), unsigned_char (BG.A)); for C of Str loop -- Character outside screen -- Draw_Char ((P.X + Count * Char_Size (Font).X, P.Y), C, Font, FG, BG); if BG.A = 0 then Draw_Char (Canvas, Cursor, C, Font, FG_U); else Draw_Char (Canvas, Cursor, C, Font, FG_U, BG_U); end if; if Cursor.X + Char_Size (Font).X > Integer(Canvas.Surface.w) then if Wrap then Cursor.Y := Cursor.Y + Char_Size (Font).Y; Cursor.X := 0; else exit; end if; else Cursor.X := Cursor.X + Char_Size (Font).X; --exit; end if; --Count := Count + 1; end loop; end Draw_String; --------------- -- Char_Size -- --------------- function Char_Size (Font : BMP_Font) return Screen_Point is begin case Font is when Font8x8 => return (8, 8); when Font12x12 => return (12, 12); when Font16x24 => return (16, 24); end case; end Char_Size; function String_Size (Font : BMP_Font; Text : String) return Screen_Point is begin case Font is when Font8x8 => return (8 * Text'Length, 8); when Font12x12 => return (12 * Text'Length, 12); when Font16x24 => return (16 * Text'Length, 24); end case; end String_Size; end Display.Basic.Fonts;
----------------------------------------------------------------------- -- awa-users-principals -- User principals -- Copyright (C) 2011, 2012, 2013, 2014 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- package body AWA.Users.Principals is -- ------------------------------ -- Get the principal name. -- ------------------------------ function Get_Name (From : in Principal) return String is begin return From.User.Get_Name; end Get_Name; -- ------------------------------ -- Get the principal identifier (name) -- ------------------------------ function Get_Id (From : in Principal) return String is begin return From.User.Get_Name; end Get_Id; -- ------------------------------ -- Get the user associated with the principal. -- ------------------------------ function Get_User (From : in Principal) return AWA.Users.Models.User_Ref is begin return From.User; end Get_User; -- ------------------------------ -- Get the current user identifier invoking the service operation. -- Returns NO_IDENTIFIER if there is none. -- ------------------------------ function Get_User_Identifier (From : in Principal) return ADO.Identifier is begin return From.User.Get_Id; end Get_User_Identifier; -- ------------------------------ -- Get the connection session used by the user. -- ------------------------------ function Get_Session (From : in Principal) return AWA.Users.Models.Session_Ref is begin return From.Session; end Get_Session; -- ------------------------------ -- Get the connection session identifier used by the user. -- ------------------------------ function Get_Session_Identifier (From : in Principal) return ADO.Identifier is begin return From.Session.Get_Id; end Get_Session_Identifier; -- ------------------------------ -- Create a principal for the given user. -- ------------------------------ function Create (User : in AWA.Users.Models.User_Ref; Session : in AWA.Users.Models.Session_Ref) return Principal_Access is Result : constant Principal_Access := new Principal; begin Result.User := User; Result.Session := Session; return Result; end Create; -- ------------------------------ -- Create a principal for the given user. -- ------------------------------ function Create (User : in AWA.Users.Models.User_Ref; Session : in AWA.Users.Models.Session_Ref) return Principal is begin return Result : Principal do Result.User := User; Result.Session := Session; end return; end Create; -- ------------------------------ -- Get the current user identifier invoking the service operation. -- Returns NO_IDENTIFIER if there is none or if the principal is not an AWA principal. -- ------------------------------ function Get_User_Identifier (From : in ASF.Principals.Principal_Access) return ADO.Identifier is use type ASF.Principals.Principal_Access; begin if From = null then return ADO.NO_IDENTIFIER; elsif not (From.all in Principal'Class) then return ADO.NO_IDENTIFIER; else return Principal'Class (From.all).Get_User_Identifier; end if; end Get_User_Identifier; end AWA.Users.Principals;
with Ada.Text_IO; use Ada.Text_IO; procedure Test is procedure P is begin return 0; end; begin P; end;
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C; use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C; procedure affect_param is type stringptr is access all char_array; procedure PString(s : stringptr) is begin String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all)); end; procedure PInt(i : in Integer) is begin String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left)); end; procedure foo(b : in Integer) is a : Integer; begin a := b; a := 4; end; a : Integer; begin a := 0; foo(a); PInt(a); PString(new char_array'( To_C("" & Character'Val(10)))); end;
-- part of OpenGLAda, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "COPYING" with Interfaces.C.Strings; with Glfw.API; package body Glfw.Errors is Cur_Callback : Callback := null; procedure Raw_Handler (Code : Kind; Description : Interfaces.C.Strings.chars_ptr); pragma Convention (C, Raw_Handler); procedure Raw_Handler (Code : Kind; Description : Interfaces.C.Strings.chars_ptr) is begin if Cur_Callback /= null then Cur_Callback.all (Code, Interfaces.C.Strings.Value (Description)); end if; end Raw_Handler; procedure Set_Callback (Handler : Callback) is Previous : API.Error_Callback; pragma Warnings (Off, Previous); begin Cur_Callback := Handler; if Handler = null then Previous := API.Set_Error_Callback (null); else Previous := API.Set_Error_Callback (Raw_Handler'Access); end if; end Set_Callback; end Glfw.Errors;
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2012-2013, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.OCL.Ocl_Expressions; package AMF.OCL.Literal_Exps is pragma Preelaborate; type OCL_Literal_Exp is limited interface and AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression; type OCL_Literal_Exp_Access is access all OCL_Literal_Exp'Class; for OCL_Literal_Exp_Access'Storage_Size use 0; end AMF.OCL.Literal_Exps;
pragma License (Unrestricted); -- runtime unit package System.Startup is pragma Preelaborate; -- command arguments (initialize.c) argc : Integer with Export, Convention => C, External_Name => "gnat_argc"; argv : Address with Export, Convention => C, External_Name => "gnat_argv"; envp : Address with Export, Convention => C, External_Name => "gnat_envp"; -- command status (exit.c) Exit_Status : Integer := 0 with Export, Convention => C, External_Name => "gnat_exit_status"; -- initialize system (initialize.c) procedure Initialize (SEH : Address) with Export, Convention => C, External_Name => "__gnat_initialize"; -- filled by gnatbind (init.c) Main_Priority : Integer := -1 with Export, Convention => C, External_Name => "__gl_main_priority"; Main_CPU : Integer := -1 with Export, Convention => C, External_Name => "__gl_main_cpu"; Time_Slice_Value : Integer := -1 with Export, Convention => C, External_Name => "__gl_time_slice_val"; WC_Encoding : Character := 'n' with Export, Convention => C, External_Name => "__gl_wc_encoding"; Locking_Policy : Character := ' ' with Export, Convention => C, External_Name => "__gl_locking_policy"; Queuing_Policy : Character := ' ' with Export, Convention => C, External_Name => "__gl_queuing_policy"; Task_Dispatching_Policy : Character := ' ' with Export, Convention => C, External_Name => "__gl_task_dispatching_policy"; Priority_Specific_Dispatching : Address := Null_Address with Export, Convention => C, External_Name => "__gl_priority_specific_dispatching"; Num_Specific_Dispatching : Integer := 0 with Export, Convention => C, External_Name => "__gl_num_specific_dispatching"; Interrupt_States : Address := Null_Address with Export, Convention => C, External_Name => "__gl_interrupt_states"; Num_Interrupt_States : Integer := 0 with Export, Convention => C, External_Name => "__gl_num_interrupt_states"; Unreserve_All_Interrupts : Integer := 0 with Export, Convention => C, External_Name => "__gl_unreserve_all_interrupts"; Detect_Blocking : Integer := 0 with Export, Convention => C, External_Name => "__gl_detect_blocking"; Default_Stack_Size : Integer := -1 with Export, Convention => C, External_Name => "__gl_default_stack_size"; Leap_Seconds_Support : Integer := 0 with Export, Convention => C, External_Name => "__gl_leap_seconds_support"; Bind_Env_Addr : Address := Null_Address with Export, Convention => C, External_Name => "__gl_bind_env_addr"; -- initialize Ada runtime (rtinit.c) procedure Runtime_Initialize (Install_Handler : Integer) is null with Export, Convention => C, External_Name => "__gnat_runtime_initialize"; -- finalize Ada runtime 1 (rtfinal.c) procedure Runtime_Finalize is null with Export, Convention => C, External_Name => "__gnat_runtime_finalize"; -- finalize Ada runtime 2 (s-stalib.adb) procedure AdaFinal is null with Export, Convention => C, External_Name => "system__standard_library__adafinal"; -- finalize system (final.c) procedure Finalize is null with Export, Convention => C, External_Name => "__gnat_finalize"; -- finalize library-level controlled objects (s-soflin.ads) type Finalize_Library_Objects_Handler is access procedure; pragma Favor_Top_Level (Finalize_Library_Objects_Handler); pragma Suppress (Access_Check, Finalize_Library_Objects_Handler); Finalize_Library_Objects : Finalize_Library_Objects_Handler with Export, Convention => Ada, External_Name => "__gnat_finalize_library_objects"; pragma Suppress (Access_Check, Finalize_Library_Objects); end System.Startup;
-- { dg-do run } procedure Concat_Length is type Byte is mod 256; for Byte'Size use 8; type Block is array(Byte range <>) of Integer; C0: Block(1..7) := (others => 0); C1: Block(8..255) := (others => 0); C2: Block := C0 & C1; begin if C2'Length /= 255 then raise Program_Error; end if; end;
----------------------------------------------------------------------- -- nodes-core -- Core nodes -- Copyright (C) 2009, 2010, 2011, 2012, 2013 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- -- The <b>ASF.Views.Nodes.Core</b> package defines some pre-defined -- core tag nodes which are mapped in the following namespaces: -- -- xmlns:c="http://java.sun.com/jstl/core" -- xmlns:ui="http://java.sun.com/jsf/facelets" -- xmlns:fn="http://java.sun.com/jsp/jstl/functions" -- -- The following JSTL core elements are defined: -- <c:set var="name" value="#{expr}"/> -- <c:if test="#{expr}"> ...</c:if> -- <c:choose><c:when test="#{expr}"></c:when><c:otherwise/</c:choose> -- -- with ASF.Factory; with EL.Functions; package ASF.Views.Nodes.Core is FN_URI : constant String := "http://java.sun.com/jsp/jstl/functions"; -- Tag factory for nodes defined in this package. function Definition return ASF.Factory.Factory_Bindings_Access; -- Register a set of functions in the namespace -- xmlns:fn="http://java.sun.com/jsp/jstl/functions" -- Functions: -- capitalize, toUpperCase, toLowerCase procedure Set_Functions (Mapper : in out EL.Functions.Function_Mapper'Class); -- ------------------------------ -- Set Tag -- ------------------------------ -- The <c:set var="name" value="#{expr}"/> variable creation. -- The variable is created in the faces context. type Set_Tag_Node is new Tag_Node with private; type Set_Tag_Node_Access is access all Set_Tag_Node'Class; -- Create the Set Tag function Create_Set_Tag_Node (Binding : in Binding_Access; Line : in Line_Info; Parent : in Tag_Node_Access; Attributes : in Tag_Attribute_Array_Access) return Tag_Node_Access; -- Build the component tree from the tag node and attach it as -- the last child of the given parent. Calls recursively the -- method to create children. overriding procedure Build_Components (Node : access Set_Tag_Node; Parent : in UIComponent_Access; Context : in out Facelet_Context'Class); -- ------------------------------ -- If Tag -- ------------------------------ -- The <c:if test="#{expr}"> ...</c:if> condition. -- If the condition evaluates to true when the component tree is built, -- the children of this node are evaluated. Otherwise the entire -- sub-tree is not present in the component tree. type If_Tag_Node is new Tag_Node with private; type If_Tag_Node_Access is access all If_Tag_Node'Class; -- Create the If Tag function Create_If_Tag_Node (Binding : in Binding_Access; Line : in Line_Info; Parent : in Tag_Node_Access; Attributes : in Tag_Attribute_Array_Access) return Tag_Node_Access; -- Build the component tree from the tag node and attach it as -- the last child of the given parent. Calls recursively the -- method to create children. overriding procedure Build_Components (Node : access If_Tag_Node; Parent : in UIComponent_Access; Context : in out Facelet_Context'Class); -- ------------------------------ -- Choose Tag -- ------------------------------ -- The <c:choose> ...</c:choose> choice. -- Evaluate a set of choices (<c:when>) until one of them is found. -- When no choice is found, evaluate the <c:otherwise> node. type Choose_Tag_Node is new Tag_Node with private; type Choose_Tag_Node_Access is access all Choose_Tag_Node'Class; -- Freeze the tag node tree and perform any initialization steps -- necessary to build the components efficiently. -- Prepare the evaluation of choices by identifying the <c:when> and -- <c:otherwise> conditions. overriding procedure Freeze (Node : access Choose_Tag_Node); -- Build the component tree from the tag node and attach it as -- the last child of the given parent. Calls recursively the -- method to create children. overriding procedure Build_Components (Node : access Choose_Tag_Node; Parent : in UIComponent_Access; Context : in out Facelet_Context'Class); -- Create the <c:choose> tag node function Create_Choose_Tag_Node (Binding : in Binding_Access; Line : in Line_Info; Parent : in Tag_Node_Access; Attributes : in Tag_Attribute_Array_Access) return Tag_Node_Access; -- ------------------------------ -- When Tag -- ------------------------------ -- The <c:when test="#{expr}"> ...</c:when> choice. -- If the condition evaluates to true when the component tree is built, -- the children of this node are evaluated. Otherwise the entire -- sub-tree is not present in the component tree. type When_Tag_Node is new If_Tag_Node with private; type When_Tag_Node_Access is access all When_Tag_Node'Class; -- Check whether the node condition is selected. function Is_Selected (Node : When_Tag_Node; Context : Facelet_Context'Class) return Boolean; -- Create the When Tag function Create_When_Tag_Node (Binding : in Binding_Access; Line : in Line_Info; Parent : in Tag_Node_Access; Attributes : in Tag_Attribute_Array_Access) return Tag_Node_Access; -- ------------------------------ -- Otherwise Tag -- ------------------------------ -- The <c:otherwise> ...</c:otherwise> choice. -- When all the choice conditions were false, the component tree is built, -- the children of this node are evaluated. type Otherwise_Tag_Node is new Tag_Node with null record; type Otherwise_Tag_Node_Access is access all Otherwise_Tag_Node'Class; -- Create the Otherwise Tag function Create_Otherwise_Tag_Node (Binding : in Binding_Access; Line : in Line_Info; Parent : in Tag_Node_Access; Attributes : in Tag_Attribute_Array_Access) return Tag_Node_Access; -- Java Facelet provides a <c:repeat> tag. It must not be implemented -- because it was proven this was not a good method for iterating over a list. private type Set_Tag_Node is new Tag_Node with record Var : Tag_Attribute_Access; Value : Tag_Attribute_Access; end record; type If_Tag_Node is new Tag_Node with record Condition : Tag_Attribute_Access; Var : Tag_Attribute_Access; end record; type When_Tag_Node is new If_Tag_Node with record Next_Choice : When_Tag_Node_Access; end record; type Choose_Tag_Node is new Tag_Node with record Choices : When_Tag_Node_Access; Otherwise : Tag_Node_Access; end record; end ASF.Views.Nodes.Core;
------------------------------------------------------------------------------- -- This file is part of libsparkcrypto. -- -- @author Alexander Senier -- @date 2019-01-21 -- -- Copyright (C) 2018 Componolit GmbH -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- * Neither the name of the nor the names of its contributors may be used -- to endorse or promote products derived from this software without -- specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------- with AUnit; use AUnit; with AUnit.Test_Cases; use AUnit.Test_Cases; -- @summary Tests HMAC SHA-2 package LSC_Test_HMAC_SHA2 is type Test_Case is new Test_Cases.Test_Case with null record; procedure Register_Tests (T : in out Test_Case); -- Register routines to be run function Name (T : Test_Case) return Message_String; -- Provide name identifying the test case end LSC_Test_HMAC_SHA2;
with physics.Object, ada.unchecked_Deallocation; package body gel.hinge_Joint is use gel.Joint; procedure define (Self : access Item; in_Space : in std_physics.Space.view; Sprite_A, Sprite_B : access gel.Sprite.item'Class; pivot_Axis : in Vector_3; pivot_Anchor : in Vector_3) is pivot_in_A : constant Vector_3 := (pivot_Anchor - Sprite_A.Site); pivot_in_B : constant Vector_3 := (pivot_Anchor - Sprite_B.Site); the_Axis : constant Vector_3 := pivot_Axis; begin Self.define (in_Space, Sprite_A, Sprite_B, the_Axis, pivot_in_A, pivot_in_B, low_Limit => to_Radians (-180.0), high_Limit => to_Radians ( 180.0), collide_Conected => False); end define; procedure define (Self : access Item; in_Space : in std_physics.Space.view; Sprite_A, Sprite_B : access gel.Sprite.item'Class; pivot_Axis : in Vector_3) is Midpoint : constant Vector_3 := (Sprite_A.Site + Sprite_B.Site) / 2.0; begin Self.define (in_Space, Sprite_A, Sprite_B, pivot_Axis, pivot_anchor => Midpoint); end define; procedure define (Self : access Item; in_Space : in std_physics.Space.view; Sprite_A, Sprite_B : access gel.Sprite.item'Class; Frame_A, Frame_B : in Matrix_4x4; low_Limit : in Real := to_Radians (-180.0); high_Limit : in Real := to_Radians ( 180.0); collide_Conected : in Boolean) is A_Frame : constant Matrix_4x4 := Frame_A; B_Frame : constant Matrix_4x4 := Frame_B; type Joint_cast is access all gel.Joint.item; sprite_A_Solid, sprite_B_Solid : std_physics.Object.view; begin if Sprite_A = null or Sprite_B = null then raise Error with "Sprite is null."; end if; sprite_A_Solid := std_physics.Object.view (Sprite_A.Solid); sprite_B_Solid := std_physics.Object.view (Sprite_B.Solid); joint.define (Joint_cast (Self), Sprite_A, Sprite_B); -- Define base class. Self.Physics := in_Space.new_hinge_Joint (sprite_A_Solid, sprite_B_Solid, A_Frame, B_Frame, low_Limit, high_Limit, collide_Conected); end define; procedure define (Self : access Item; in_Space : in std_physics.Space.view; Sprite_A : access gel.Sprite.item'Class; Frame_A : in Matrix_4x4) is type Joint_cast is access all gel.Joint.item; A_Frame : constant Matrix_4x4 := Frame_A; sprite_A_Solid : std_physics.Object.view; begin joint.define (Joint_cast (Self), Sprite_A, null); -- Define base class. sprite_A_Solid := std_physics.Object.view (Sprite_A.Solid); Self.Physics := in_Space.new_hinge_Joint (sprite_A_Solid, A_Frame); end define; procedure define (Self : access Item; in_Space : in std_physics.Space.view; Sprite_A, Sprite_B : access gel.Sprite.item'Class; pivot_Axis : in Vector_3; Anchor_in_A, Anchor_in_B : in Vector_3; low_Limit, high_Limit : in Real; collide_Conected : in Boolean) is type Joint_cast is access all gel.Joint.item; sprite_A_Solid, sprite_B_Solid : std_physics.Object.view; begin if Sprite_A = null or Sprite_B = null then raise Error with "Attempt to join a null sprite."; end if; sprite_A_Solid := std_physics.Object.view (Sprite_A.Solid); sprite_B_Solid := std_physics.Object.view (Sprite_B.Solid); Joint.define (Joint_cast (Self), Sprite_A, Sprite_B); -- Define base class. Self.Physics := in_Space.new_hinge_Joint (sprite_A_Solid, sprite_B_Solid, Anchor_in_A, Anchor_in_B, pivot_Axis, low_Limit, high_Limit, collide_Conected); end define; overriding procedure destroy (Self : in out Item) is my_Physics : std_physics.Joint.view := std_physics.Joint.view (Self.Physics); procedure deallocate is new ada.unchecked_Deallocation (std_physics.Joint.item'Class, std_physics.Joint.view); begin my_Physics.destruct; deallocate (my_Physics); Self.Physics := null; end destroy; -------------- --- Attributes -- overriding function Degrees_of_freedom (Self : in Item) return joint.degree_of_Freedom is pragma unreferenced (Self); begin return 1; end Degrees_of_freedom; function Angle (Self : in Item'Class) return Real is begin raise Error with "TODO"; return 0.0; end Angle; overriding function Frame_A (Self : in Item) return Matrix_4x4 is begin return Self.Physics.Frame_A; end Frame_A; overriding function Frame_B (Self : in Item) return Matrix_4x4 is begin return Self.Physics.Frame_B; end Frame_B; overriding procedure Frame_A_is (Self : in out Item; Now : in Matrix_4x4) is begin Self.Physics.Frame_A_is (Now); end Frame_A_is; overriding procedure Frame_B_is (Self : in out Item; Now : in Matrix_4x4) is begin Self.Physics.Frame_B_is (Now); end Frame_B_is; overriding function Physics (Self : in Item) return joint.Physics_view is begin return Joint.Physics_view (Self.Physics); end Physics; ---------------- --- Joint Limits -- procedure Limits_are (Self : in out Item'Class; Low, High : in Real; Softness : in Real := 0.9; bias_Factor : in Real := 0.3; relaxation_Factor : in Real := 1.0) is begin Self.low_Bound := Low; Self.high_Bound := High; Self.Softness := Softness; Self.bias_Factor := bias_Factor; Self.relaxation_Factor := relaxation_Factor; end Limits_are; procedure apply_Limits (Self : in out Item) is begin Self.Physics.Limits_are (Self.low_Bound, Self.high_Bound, Self.Softness, Self.bias_Factor, Self.relaxation_Factor); end apply_Limits; -- Bounds - limits the range of motion for a Degree of freedom. -- overriding function low_Bound (Self : access Item; for_Degree : in joint.Degree_of_freedom) return Real is use type joint.Degree_of_freedom; begin if for_Degree /= Revolve then raise Error with "Invalid degree of freedom:" & for_Degree'Image; end if; return Self.low_Bound; end low_Bound; overriding procedure low_Bound_is (Self : access Item; for_Degree : in joint.Degree_of_freedom; Now : in Real) is use type joint.Degree_of_freedom; begin if for_Degree /= Revolve then raise Error with "Invalid degree of freedom:" & for_Degree'Image; end if; Self.low_Bound := Now; Self.apply_Limits; end low_Bound_is; overriding function high_Bound (Self : access Item; for_Degree : in joint.Degree_of_freedom) return Real is use type joint.Degree_of_freedom; begin if for_Degree /= Revolve then raise Error with "Invalid degree of freedom:" & for_Degree'Image; end if; return Self.high_Bound; end high_Bound; overriding procedure high_Bound_is (Self : access Item; for_Degree : in joint.Degree_of_freedom; Now : in Real) is use type joint.Degree_of_freedom; Span : Real := abs (Now) * 2.0; begin if for_Degree /= Revolve then raise Error with "Invalid degree of freedom:" & for_Degree'Image; end if; Self.high_Bound := Now; Self.apply_Limits; end high_Bound_is; overriding function Extent (Self : in Item; for_Degree : in Degree_of_freedom) return Real is use type joint.Degree_of_freedom; begin if for_Degree /= Revolve then raise Error with "Invalid degree of freedom:" & for_Degree'Image; end if; return Self.Angle; end Extent; overriding function is_Bound (Self : in Item; for_Degree : in joint.Degree_of_freedom) return Boolean is begin return Self.Physics.is_Limited (for_Degree); end is_Bound; overriding procedure Velocity_is (Self : in Item; for_Degree : in joint.Degree_of_freedom; Now : in Real) is begin self.Physics.Velocity_is (Now, for_Degree); end Velocity_is; end gel.hinge_Joint;
with AUnit.Run.Generic_Runner; procedure Suits.Main is new AUnit.Run.Generic_Runner (Suit);
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces.C; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_glx_get_convolution_parameterfv_cookie_t is -- Item -- type Item is record sequence : aliased Interfaces.C.unsigned; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_glx_get_convolution_parameterfv_cookie_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_convolution_parameterfv_cookie_t.Item, Element_Array => xcb.xcb_glx_get_convolution_parameterfv_cookie_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_glx_get_convolution_parameterfv_cookie_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_convolution_parameterfv_cookie_t.Pointer, Element_Array => xcb.xcb_glx_get_convolution_parameterfv_cookie_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_glx_get_convolution_parameterfv_cookie_t;
with Heap; generic type Num is range <>; package PrimeUtilities is type Sieve is Array (Positive range <>) of Num; type Prime_Count is Record prime : Num; count : Positive; end Record; type Prime_Factors is Array (Positive range <>) of Prime_Count; type Proper_Divisors is Array (Positive range <>) of Num; type Prime_Generator is private; function Make_Generator(Max_Prime : Num := Num'Last) return Prime_Generator; procedure Next_Prime(gen : in out Prime_Generator; prime : out Num); function Generate_Sieve(Max_Prime : Num) return Sieve; function Generate_Prime_Factors(n : Num; primes : sieve) return Prime_Factors; function Count_Divisors(factors : Prime_Factors) return Positive; function Generate_Proper_Divisors(factors : Prime_Factors) return Proper_Divisors; function Generate_Proper_Divisors(n : Num; primes : sieve) return Proper_Divisors; function Generate_Proper_Divisors(n : Num) return Proper_Divisors; private type Virtual_List is Record Next_Composite : Num; Increment : Num; end Record; function "<=" (Left, Right: in Virtual_List) return Boolean; package Virtual_List_Heap is new Heap(Element_Type => Virtual_List); type Incrementor is mod 8; type Prime_Generator is Record Filters : Virtual_List_Heap.Heap; Last_Prime : Num; Max_Prime : Num; Increment : Incrementor; Done : Boolean; end Record; end PrimeUtilities;
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_get_geometry_request_t is -- Item -- type Item is record major_opcode : aliased Interfaces.Unsigned_8; pad0 : aliased Interfaces.Unsigned_8; length : aliased Interfaces.Unsigned_16; drawable : aliased xcb.xcb_drawable_t; end record; -- Item_Array -- type Item_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_get_geometry_request_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_get_geometry_request_t.Item, Element_Array => xcb.xcb_get_geometry_request_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_get_geometry_request_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_get_geometry_request_t.Pointer, Element_Array => xcb.xcb_get_geometry_request_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_get_geometry_request_t;
package A_Stack with SPARK_Mode, Abstract_State => The_Stack, Initializes => The_Stack is Stack_Size : constant := 100; subtype Item is Integer range 0 .. 20; function Is_Empty return Boolean with Global => The_Stack; function Is_Full return Boolean with Global => The_Stack; function Top return Item with Pre => not Is_Empty, Global => The_Stack; procedure Push (It : in Item) with Pre => not Is_Full, Global => (In_Out => The_Stack); procedure Pop (It : out Item) with Pre => not Is_Empty, Global => (In_Out => The_Stack); function Utilization return Integer with Global => The_Stack; end A_Stack;
-- This spec has been automatically generated from STM32L0x1.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with System; package STM32_SVD.DBGMCU is pragma Preelaborate; --------------- -- Registers -- --------------- -- MCU Device ID Code Register type IDCODE_Register is record -- Read-only. Device Identifier DEV_ID : STM32_SVD.UInt12; -- unspecified Reserved_12_15 : STM32_SVD.UInt4; -- Read-only. Revision Identifier REV_ID : STM32_SVD.UInt16; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IDCODE_Register use record DEV_ID at 0 range 0 .. 11; Reserved_12_15 at 0 range 12 .. 15; REV_ID at 0 range 16 .. 31; end record; -- Debug MCU Configuration Register type CR_Register is record -- Debug Sleep Mode DBG_SLEEP : STM32_SVD.Bit; -- Debug Stop Mode DBG_STOP : STM32_SVD.Bit; -- Debug Standby Mode DBG_STANDBY : STM32_SVD.Bit; -- unspecified Reserved_3_31 : STM32_SVD.UInt29; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record DBG_SLEEP at 0 range 0 .. 0; DBG_STOP at 0 range 1 .. 1; DBG_STANDBY at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; -- APB Low Freeze Register type APB1_FZ_Register is record -- Debug Timer 2 stopped when Core is halted DBG_TIMER2_STOP : STM32_SVD.Bit; -- unspecified Reserved_1_3 : STM32_SVD.UInt3; -- Debug Timer 6 stopped when Core is halted DBG_TIMER6_STOP : STM32_SVD.Bit; -- unspecified Reserved_5_9 : STM32_SVD.UInt5; -- Debug RTC stopped when Core is halted DBG_RTC_STOP : STM32_SVD.Bit; -- Debug Window Wachdog stopped when Core is halted DBG_WWDG_STOP : STM32_SVD.Bit; -- Debug Independent Wachdog stopped when Core is halted DBG_IWDG_STOP : STM32_SVD.Bit; -- unspecified Reserved_13_20 : STM32_SVD.Byte; -- I2C1 SMBUS timeout mode stopped when core is halted DBG_I2C1_STOP : STM32_SVD.Bit; -- I2C2 SMBUS timeout mode stopped when core is halted DBG_I2C2_STOP : STM32_SVD.Bit; -- unspecified Reserved_23_30 : STM32_SVD.Byte; -- LPTIM1 counter stopped when core is halted DBG_LPTIMER_STOP : STM32_SVD.Bit; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB1_FZ_Register use record DBG_TIMER2_STOP at 0 range 0 .. 0; Reserved_1_3 at 0 range 1 .. 3; DBG_TIMER6_STOP at 0 range 4 .. 4; Reserved_5_9 at 0 range 5 .. 9; DBG_RTC_STOP at 0 range 10 .. 10; DBG_WWDG_STOP at 0 range 11 .. 11; DBG_IWDG_STOP at 0 range 12 .. 12; Reserved_13_20 at 0 range 13 .. 20; DBG_I2C1_STOP at 0 range 21 .. 21; DBG_I2C2_STOP at 0 range 22 .. 22; Reserved_23_30 at 0 range 23 .. 30; DBG_LPTIMER_STOP at 0 range 31 .. 31; end record; -- APB High Freeze Register type APB2_FZ_Register is record -- unspecified Reserved_0_1 : STM32_SVD.UInt2; -- Debug Timer 21 stopped when Core is halted DBG_TIMER21_STOP : STM32_SVD.Bit; -- unspecified Reserved_3_5 : STM32_SVD.UInt3; -- Debug Timer 22 stopped when Core is halted DBG_TIMER22_STO : STM32_SVD.Bit; -- unspecified Reserved_7_31 : STM32_SVD.UInt25; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for APB2_FZ_Register use record Reserved_0_1 at 0 range 0 .. 1; DBG_TIMER21_STOP at 0 range 2 .. 2; Reserved_3_5 at 0 range 3 .. 5; DBG_TIMER22_STO at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Debug support type DBG_Peripheral is record -- MCU Device ID Code Register IDCODE : aliased IDCODE_Register; -- Debug MCU Configuration Register CR : aliased CR_Register; -- APB Low Freeze Register APB1_FZ : aliased APB1_FZ_Register; -- APB High Freeze Register APB2_FZ : aliased APB2_FZ_Register; end record with Volatile; for DBG_Peripheral use record IDCODE at 16#0# range 0 .. 31; CR at 16#4# range 0 .. 31; APB1_FZ at 16#8# range 0 .. 31; APB2_FZ at 16#C# range 0 .. 31; end record; -- Debug support DBG_Periph : aliased DBG_Peripheral with Import, Address => DBG_Base; end STM32_SVD.DBGMCU;
-- SaxonSOC GPIO mapping -- The structure is mostly based on https://github.com/AdaCore/bb-runtimes/ -- blob/community-2020/riscv/sifive/fe310/svd/i-fe310-gpio.ads with System; -- TODO do more than just the LEDS package Interfaces.SaxonSOC.GPIO is pragma Preelaborate; pragma No_Elaboration_Code_All; -- Auxiliary types type GPIO_Control_Reg is new Unsigned_32; type Mask_T is new Unsigned_32; -- Addresses GPIO_A_Base_Address : constant := 16#1000_0000#; GPIO_A_Input : GPIO_Control_Reg with Volatile_Full_Access, Address => System'To_Address (GPIO_A_Base_Address); GPIO_A_Output : GPIO_Control_Reg with Address => System'To_Address (GPIO_A_Base_Address + 16#04#); GPIO_A_Output_Enable : GPIO_Control_Reg with Address => System'To_Address (GPIO_A_Base_Address + 16#08#); end Interfaces.SaxonSOC.GPIO;
------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- S Y S T E M . E X P _ L L I -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT 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 distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Long_Long_Integer exponentiation with System.Exp_Gen; package System.Exp_LLI is pragma Pure (Exp_LLI); function Exp_Long_Long_Integer is new System.Exp_Gen.Exp_Integer_Type (Long_Long_Integer); end System.Exp_LLI;
with HAL.UART; with FE310.UART; with FE310.Device; package body IO is type BToCT is array (Byte range 0 .. 15) of Character; BToC : constant BToCT := ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'); --------- -- Put -- --------- procedure Put (C : Character) is B : HAL.UART.UART_Data_8b (0 .. 0); S : HAL.UART.UART_Status; begin B (0) := Character'Pos (C); FE310.UART.Transmit (FE310.Device.UART0, B, S); pragma Unreferenced (S); end Put; -------------- -- New_Line -- -------------- procedure New_Line (Spacing : Positive := 1) is begin for J in 1 .. Spacing loop Put (ASCII.CR); Put (ASCII.LF); end loop; end New_Line; --------- -- Put -- --------- procedure Put (X : Integer) is Int : Integer; S : String (1 .. Integer'Width); First : Natural := S'Last + 1; Val : Integer; begin -- Work on negative values to avoid overflows Int := (if X < 0 then X else -X); loop -- Cf RM 4.5.5 Multiplying Operators. The rem operator will return -- negative values for negative values of Int. Val := Int rem 10; Int := (Int - Val) / 10; First := First - 1; S (First) := Character'Val (Character'Pos ('0') - Val); exit when Int = 0; end loop; if X < 0 then First := First - 1; S (First) := '-'; end if; Put (S (First .. S'Last)); end Put; procedure Put (X : UInt64) is Int : UInt64 := X; S : String (1 .. UInt64'Width) := (others => ' '); First : Natural := S'Last + 1; Val : UInt64; begin loop Val := Int rem 10; Int := (Int - Val) / 10; First := First - 1; S (First) := Character'Val (Character'Pos ('0') + Val); exit when Int = 0; end loop; -- Fixed width output Put (S); end Put; --------- -- Put -- --------- procedure Put (S : String) is begin for J in S'Range loop Put (S (J)); end loop; end Put; -------------- -- Put_Line -- -------------- procedure Put_Line (S : String) is begin Put (S); New_Line; end Put_Line; procedure Put_Line (S : String; X : Unsigned_64) is begin Put (S); Put (UInt64 (X)); New_Line; end Put_Line; procedure Put (B : in Byte) is begin Put ("16#"); Put (BToC (B / 16)); Put (BToC (B mod 16)); Put ("# "); end Put; procedure Put (S : in String; D : in Byte_Seq) is begin Put_Line (S); for I in D'Range loop Put (D (I)); if I mod 8 = 7 then New_Line; end if; end loop; New_Line; end Put; end IO;
-- Copyright 2013-2014 Free Software Foundation, Inc. -- -- 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 3 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, see <http://www.gnu.org/licenses/>. with Pck; use Pck; procedure Foo is begin while I <= 3 loop begin raise Constraint_Error; exception when others => null; end; I := I + 1; end loop; end Foo;
-- Copyright 2008-2015 Free Software Foundation, Inc. -- -- 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 3 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, see <http://www.gnu.org/licenses/>. package Pck is String_Var : String := "Hello from package Pck"; end Pck;
----------------------------------------------------------------------- -- AWA.Counters.Models -- AWA.Counters.Models ----------------------------------------------------------------------- -- File generated by ada-gen DO NOT MODIFY -- Template used: templates/model/package-spec.xhtml -- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095 ----------------------------------------------------------------------- -- Copyright (C) 2019 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- pragma Warnings (Off); with ADO.Sessions; with ADO.Objects; with ADO.Statements; with ADO.SQL; with ADO.Schemas; with ADO.Queries; with ADO.Queries.Loaders; with Ada.Calendar; with Ada.Containers.Vectors; with Ada.Strings.Unbounded; with Util.Beans.Objects; with Util.Beans.Basic.Lists; with Util.Beans.Methods; pragma Warnings (On); package AWA.Counters.Models is pragma Style_Checks ("-mr"); type Counter_Ref is new ADO.Objects.Object_Ref with null record; type Counter_Definition_Ref is new ADO.Objects.Object_Ref with null record; type Visit_Ref is new ADO.Objects.Object_Ref with null record; -- Create an object key for Counter. function Counter_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key; -- Create an object key for Counter from a string. -- Raises Constraint_Error if the string cannot be converted into the object key. function Counter_Key (Id : in String) return ADO.Objects.Object_Key; Null_Counter : constant Counter_Ref; function "=" (Left, Right : Counter_Ref'Class) return Boolean; -- Set the object associated with the counter. procedure Set_Object_Id (Object : in out Counter_Ref; Value : in ADO.Identifier); -- Get the object associated with the counter. function Get_Object_Id (Object : in Counter_Ref) return ADO.Identifier; -- Set the day associated with the counter. procedure Set_Date (Object : in out Counter_Ref; Value : in Ada.Calendar.Time); -- Get the day associated with the counter. function Get_Date (Object : in Counter_Ref) return Ada.Calendar.Time; -- Set the counter value. procedure Set_Counter (Object : in out Counter_Ref; Value : in Integer); -- Get the counter value. function Get_Counter (Object : in Counter_Ref) return Integer; -- Set the counter definition identifier. procedure Set_Definition_Id (Object : in out Counter_Ref; Value : in ADO.Identifier); -- Get the counter definition identifier. function Get_Definition_Id (Object : in Counter_Ref) return ADO.Identifier; -- Load the entity identified by 'Id'. -- Raises the NOT_FOUND exception if it does not exist. procedure Load (Object : in out Counter_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier); -- Load the entity identified by 'Id'. -- Returns True in <b>Found</b> if the object was found and False if it does not exist. procedure Load (Object : in out Counter_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean); -- Find and load the entity. overriding procedure Find (Object : in out Counter_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); -- Save the entity. If the entity does not have an identifier, an identifier is allocated -- and it is inserted in the table. Otherwise, only data fields which have been changed -- are updated. overriding procedure Save (Object : in out Counter_Ref; Session : in out ADO.Sessions.Master_Session'Class); -- Delete the entity. overriding procedure Delete (Object : in out Counter_Ref; Session : in out ADO.Sessions.Master_Session'Class); overriding function Get_Value (From : in Counter_Ref; Name : in String) return Util.Beans.Objects.Object; -- Table definition COUNTER_TABLE : constant ADO.Schemas.Class_Mapping_Access; -- Internal method to allocate the Object_Record instance overriding procedure Allocate (Object : in out Counter_Ref); -- Copy of the object. procedure Copy (Object : in Counter_Ref; Into : in out Counter_Ref); -- -------------------- -- A counter definition defines what the counter represents. It uniquely identifies -- the counter for the Counter table. A counter may be associated with a database -- table. In that case, the counter definition has a relation to the corresponding Entity_Type. -- -------------------- -- Create an object key for Counter_Definition. function Counter_Definition_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key; -- Create an object key for Counter_Definition from a string. -- Raises Constraint_Error if the string cannot be converted into the object key. function Counter_Definition_Key (Id : in String) return ADO.Objects.Object_Key; Null_Counter_Definition : constant Counter_Definition_Ref; function "=" (Left, Right : Counter_Definition_Ref'Class) return Boolean; -- Set the counter name. procedure Set_Name (Object : in out Counter_Definition_Ref; Value : in Ada.Strings.Unbounded.Unbounded_String); procedure Set_Name (Object : in out Counter_Definition_Ref; Value : in String); -- Get the counter name. function Get_Name (Object : in Counter_Definition_Ref) return Ada.Strings.Unbounded.Unbounded_String; function Get_Name (Object : in Counter_Definition_Ref) return String; -- Set the counter unique id. procedure Set_Id (Object : in out Counter_Definition_Ref; Value : in ADO.Identifier); -- Get the counter unique id. function Get_Id (Object : in Counter_Definition_Ref) return ADO.Identifier; -- Set the optional entity type that identifies the database table. procedure Set_Entity_Type (Object : in out Counter_Definition_Ref; Value : in ADO.Nullable_Entity_Type); -- Get the optional entity type that identifies the database table. function Get_Entity_Type (Object : in Counter_Definition_Ref) return ADO.Nullable_Entity_Type; -- Load the entity identified by 'Id'. -- Raises the NOT_FOUND exception if it does not exist. procedure Load (Object : in out Counter_Definition_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier); -- Load the entity identified by 'Id'. -- Returns True in <b>Found</b> if the object was found and False if it does not exist. procedure Load (Object : in out Counter_Definition_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean); -- Find and load the entity. overriding procedure Find (Object : in out Counter_Definition_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); -- Save the entity. If the entity does not have an identifier, an identifier is allocated -- and it is inserted in the table. Otherwise, only data fields which have been changed -- are updated. overriding procedure Save (Object : in out Counter_Definition_Ref; Session : in out ADO.Sessions.Master_Session'Class); -- Delete the entity. overriding procedure Delete (Object : in out Counter_Definition_Ref; Session : in out ADO.Sessions.Master_Session'Class); overriding function Get_Value (From : in Counter_Definition_Ref; Name : in String) return Util.Beans.Objects.Object; -- Table definition COUNTER_DEFINITION_TABLE : constant ADO.Schemas.Class_Mapping_Access; -- Internal method to allocate the Object_Record instance overriding procedure Allocate (Object : in out Counter_Definition_Ref); -- Copy of the object. procedure Copy (Object : in Counter_Definition_Ref; Into : in out Counter_Definition_Ref); -- Create an object key for Visit. function Visit_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key; -- Create an object key for Visit from a string. -- Raises Constraint_Error if the string cannot be converted into the object key. function Visit_Key (Id : in String) return ADO.Objects.Object_Key; Null_Visit : constant Visit_Ref; function "=" (Left, Right : Visit_Ref'Class) return Boolean; -- Set the entity identifier. procedure Set_Object_Id (Object : in out Visit_Ref; Value : in ADO.Identifier); -- Get the entity identifier. function Get_Object_Id (Object : in Visit_Ref) return ADO.Identifier; -- Set the number of times the entity was visited by the user. procedure Set_Counter (Object : in out Visit_Ref; Value : in Integer); -- Get the number of times the entity was visited by the user. function Get_Counter (Object : in Visit_Ref) return Integer; -- Set the date and time when the entity was last visited. procedure Set_Date (Object : in out Visit_Ref; Value : in Ada.Calendar.Time); -- Get the date and time when the entity was last visited. function Get_Date (Object : in Visit_Ref) return Ada.Calendar.Time; -- Set the user who visited the entity. procedure Set_User (Object : in out Visit_Ref; Value : in ADO.Identifier); -- Get the user who visited the entity. function Get_User (Object : in Visit_Ref) return ADO.Identifier; -- Set the counter definition identifier. procedure Set_Definition_Id (Object : in out Visit_Ref; Value : in ADO.Identifier); -- Get the counter definition identifier. function Get_Definition_Id (Object : in Visit_Ref) return ADO.Identifier; -- Load the entity identified by 'Id'. -- Raises the NOT_FOUND exception if it does not exist. procedure Load (Object : in out Visit_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier); -- Load the entity identified by 'Id'. -- Returns True in <b>Found</b> if the object was found and False if it does not exist. procedure Load (Object : in out Visit_Ref; Session : in out ADO.Sessions.Session'Class; Id : in ADO.Identifier; Found : out Boolean); -- Find and load the entity. overriding procedure Find (Object : in out Visit_Ref; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); -- Save the entity. If the entity does not have an identifier, an identifier is allocated -- and it is inserted in the table. Otherwise, only data fields which have been changed -- are updated. overriding procedure Save (Object : in out Visit_Ref; Session : in out ADO.Sessions.Master_Session'Class); -- Delete the entity. overriding procedure Delete (Object : in out Visit_Ref; Session : in out ADO.Sessions.Master_Session'Class); overriding function Get_Value (From : in Visit_Ref; Name : in String) return Util.Beans.Objects.Object; -- Table definition VISIT_TABLE : constant ADO.Schemas.Class_Mapping_Access; -- Internal method to allocate the Object_Record instance overriding procedure Allocate (Object : in out Visit_Ref); -- Copy of the object. procedure Copy (Object : in Visit_Ref; Into : in out Visit_Ref); package Visit_Vectors is new Ada.Containers.Vectors (Index_Type => Natural, Element_Type => Visit_Ref, "=" => "="); subtype Visit_Vector is Visit_Vectors.Vector; procedure List (Object : in out Visit_Vector; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class); -- -------------------- -- The month statistics. -- -------------------- type Stat_Info is new Util.Beans.Basic.Bean with record -- the counter date. Date : Ada.Calendar.Time; -- the counter value. Count : Natural; end record; -- Get the bean attribute identified by the name. overriding function Get_Value (From : in Stat_Info; Name : in String) return Util.Beans.Objects.Object; -- Set the bean attribute identified by the name. overriding procedure Set_Value (Item : in out Stat_Info; Name : in String; Value : in Util.Beans.Objects.Object); package Stat_Info_Beans is new Util.Beans.Basic.Lists (Element_Type => Stat_Info); package Stat_Info_Vectors renames Stat_Info_Beans.Vectors; subtype Stat_Info_List_Bean is Stat_Info_Beans.List_Bean; type Stat_Info_List_Bean_Access is access all Stat_Info_List_Bean; -- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>. procedure List (Object : in out Stat_Info_List_Bean'Class; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class); subtype Stat_Info_Vector is Stat_Info_Vectors.Vector; -- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>. procedure List (Object : in out Stat_Info_Vector; Session : in out ADO.Sessions.Session'Class; Context : in out ADO.Queries.Context'Class); Query_Counter_Update : constant ADO.Queries.Query_Definition_Access; Query_Counter_Update_Field : constant ADO.Queries.Query_Definition_Access; -- -------------------- -- The Stat_List_Bean is the bean that allows to retrieve the counter statistics -- for a given database entity and provide the values through a bean to the -- presentation layer.load the counters for the entity and the timeframe. -- -------------------- type Stat_List_Bean is abstract limited new Util.Beans.Basic.Bean and Util.Beans.Methods.Method_Bean with record -- the entity type name. Entity_Type : Ada.Strings.Unbounded.Unbounded_String; -- the first date. First_Date : Ada.Strings.Unbounded.Unbounded_String; -- the last date. Last_Date : Ada.Strings.Unbounded.Unbounded_String; -- the entity identifier. Entity_Id : ADO.Identifier; Counter_Name : Ada.Strings.Unbounded.Unbounded_String; Query_Name : Ada.Strings.Unbounded.Unbounded_String; end record; -- This bean provides some methods that can be used in a Method_Expression. overriding function Get_Method_Bindings (From : in Stat_List_Bean) return Util.Beans.Methods.Method_Binding_Array_Access; -- Get the bean attribute identified by the name. overriding function Get_Value (From : in Stat_List_Bean; Name : in String) return Util.Beans.Objects.Object; -- Set the bean attribute identified by the name. overriding procedure Set_Value (Item : in out Stat_List_Bean; Name : in String; Value : in Util.Beans.Objects.Object); procedure Load (Bean : in out Stat_List_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is abstract; private COUNTER_NAME : aliased constant String := "awa_counter"; COL_0_1_NAME : aliased constant String := "object_id"; COL_1_1_NAME : aliased constant String := "date"; COL_2_1_NAME : aliased constant String := "counter"; COL_3_1_NAME : aliased constant String := "definition_id"; COUNTER_DEF : aliased constant ADO.Schemas.Class_Mapping := (Count => 4, Table => COUNTER_NAME'Access, Members => ( 1 => COL_0_1_NAME'Access, 2 => COL_1_1_NAME'Access, 3 => COL_2_1_NAME'Access, 4 => COL_3_1_NAME'Access) ); COUNTER_TABLE : constant ADO.Schemas.Class_Mapping_Access := COUNTER_DEF'Access; Null_Counter : constant Counter_Ref := Counter_Ref'(ADO.Objects.Object_Ref with null record); type Counter_Impl is new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER, Of_Class => COUNTER_DEF'Access) with record Object_Id : ADO.Identifier; Date : Ada.Calendar.Time; Counter : Integer; end record; type Counter_Access is access all Counter_Impl; overriding procedure Destroy (Object : access Counter_Impl); overriding procedure Find (Object : in out Counter_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); overriding procedure Load (Object : in out Counter_Impl; Session : in out ADO.Sessions.Session'Class); procedure Load (Object : in out Counter_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class); overriding procedure Save (Object : in out Counter_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Create (Object : in out Counter_Impl; Session : in out ADO.Sessions.Master_Session'Class); overriding procedure Delete (Object : in out Counter_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Set_Field (Object : in out Counter_Ref'Class; Impl : out Counter_Access); COUNTER_DEFINITION_NAME : aliased constant String := "awa_counter_definition"; COL_0_2_NAME : aliased constant String := "name"; COL_1_2_NAME : aliased constant String := "id"; COL_2_2_NAME : aliased constant String := "entity_type"; COUNTER_DEFINITION_DEF : aliased constant ADO.Schemas.Class_Mapping := (Count => 3, Table => COUNTER_DEFINITION_NAME'Access, Members => ( 1 => COL_0_2_NAME'Access, 2 => COL_1_2_NAME'Access, 3 => COL_2_2_NAME'Access) ); COUNTER_DEFINITION_TABLE : constant ADO.Schemas.Class_Mapping_Access := COUNTER_DEFINITION_DEF'Access; Null_Counter_Definition : constant Counter_Definition_Ref := Counter_Definition_Ref'(ADO.Objects.Object_Ref with null record); type Counter_Definition_Impl is new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER, Of_Class => COUNTER_DEFINITION_DEF'Access) with record Name : Ada.Strings.Unbounded.Unbounded_String; Entity_Type : ADO.Nullable_Entity_Type; end record; type Counter_Definition_Access is access all Counter_Definition_Impl; overriding procedure Destroy (Object : access Counter_Definition_Impl); overriding procedure Find (Object : in out Counter_Definition_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); overriding procedure Load (Object : in out Counter_Definition_Impl; Session : in out ADO.Sessions.Session'Class); procedure Load (Object : in out Counter_Definition_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class); overriding procedure Save (Object : in out Counter_Definition_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Create (Object : in out Counter_Definition_Impl; Session : in out ADO.Sessions.Master_Session'Class); overriding procedure Delete (Object : in out Counter_Definition_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Set_Field (Object : in out Counter_Definition_Ref'Class; Impl : out Counter_Definition_Access); VISIT_NAME : aliased constant String := "awa_visit"; COL_0_3_NAME : aliased constant String := "object_id"; COL_1_3_NAME : aliased constant String := "counter"; COL_2_3_NAME : aliased constant String := "date"; COL_3_3_NAME : aliased constant String := "user"; COL_4_3_NAME : aliased constant String := "definition_id"; VISIT_DEF : aliased constant ADO.Schemas.Class_Mapping := (Count => 5, Table => VISIT_NAME'Access, Members => ( 1 => COL_0_3_NAME'Access, 2 => COL_1_3_NAME'Access, 3 => COL_2_3_NAME'Access, 4 => COL_3_3_NAME'Access, 5 => COL_4_3_NAME'Access) ); VISIT_TABLE : constant ADO.Schemas.Class_Mapping_Access := VISIT_DEF'Access; Null_Visit : constant Visit_Ref := Visit_Ref'(ADO.Objects.Object_Ref with null record); type Visit_Impl is new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER, Of_Class => VISIT_DEF'Access) with record Object_Id : ADO.Identifier; Counter : Integer; Date : Ada.Calendar.Time; User : ADO.Identifier; end record; type Visit_Access is access all Visit_Impl; overriding procedure Destroy (Object : access Visit_Impl); overriding procedure Find (Object : in out Visit_Impl; Session : in out ADO.Sessions.Session'Class; Query : in ADO.SQL.Query'Class; Found : out Boolean); overriding procedure Load (Object : in out Visit_Impl; Session : in out ADO.Sessions.Session'Class); procedure Load (Object : in out Visit_Impl; Stmt : in out ADO.Statements.Query_Statement'Class; Session : in out ADO.Sessions.Session'Class); overriding procedure Save (Object : in out Visit_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Create (Object : in out Visit_Impl; Session : in out ADO.Sessions.Master_Session'Class); overriding procedure Delete (Object : in out Visit_Impl; Session : in out ADO.Sessions.Master_Session'Class); procedure Set_Field (Object : in out Visit_Ref'Class; Impl : out Visit_Access); package File_1 is new ADO.Queries.Loaders.File (Path => "counter-update.xml", Sha1 => "6C157006E7A28699E1FE0E2CB571BACA2706E58D"); package Def_Statinfo_Counter_Update is new ADO.Queries.Loaders.Query (Name => "counter-update", File => File_1.File'Access); Query_Counter_Update : constant ADO.Queries.Query_Definition_Access := Def_Statinfo_Counter_Update.Query'Access; package Def_Statinfo_Counter_Update_Field is new ADO.Queries.Loaders.Query (Name => "counter-update-field", File => File_1.File'Access); Query_Counter_Update_Field : constant ADO.Queries.Query_Definition_Access := Def_Statinfo_Counter_Update_Field.Query'Access; end AWA.Counters.Models;
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces.C; with xcb.xcb_render_pictforminfo_t; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_render_pictforminfo_iterator_t is -- Item -- type Item is record data : access xcb.xcb_render_pictforminfo_t.Item; the_rem : aliased Interfaces.C.int; index : aliased Interfaces.C.int; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_render_pictforminfo_iterator_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_pictforminfo_iterator_t.Item, Element_Array => xcb.xcb_render_pictforminfo_iterator_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_render_pictforminfo_iterator_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_pictforminfo_iterator_t.Pointer, Element_Array => xcb.xcb_render_pictforminfo_iterator_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_render_pictforminfo_iterator_t;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015-2016, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- Driver for the WM8994 CODEC with HAL; use HAL; with HAL.I2C; use HAL.I2C; with HAL.Time; package WM8994 is type Output_Device is (No_Output, Speaker, Headphone, Both, Auto); type Input_Device is (No_Input, Microphone, Input_Line); WM8994_ID : constant := 16#8994#; type Audio_Frequency is (Audio_Freq_8kHz, Audio_Freq_11kHz, Audio_Freq_16kHz, Audio_Freq_22kHz, Audio_Freq_44kHz, Audio_Freq_48kHz, Audio_Freq_96kHz) with Size => 32; for Audio_Frequency use (Audio_Freq_8kHz => 8_000, Audio_Freq_11kHz => 11_025, Audio_Freq_16kHz => 16_000, Audio_Freq_22kHz => 22_050, Audio_Freq_44kHz => 44_100, Audio_Freq_48kHz => 48_000, Audio_Freq_96kHz => 96_000); type Mute is (Mute_On, Mute_Off); type Stop_Mode is (Stop_Power_Down_Sw, Stop_Power_Down_Hw); -- Stop_Power_Down_Sw: -- only mutes the audio codec. When resuming from this mode the codec -- keeps the previous initialization (no need to re-Initialize the codec -- registers). -- Stop_Power_Down_Hw: -- Physically power down the codec. When resuming from this mode, the codec -- is set to default configuration (user should re-Initialize the codec in -- order to play again the audio stream). subtype Volume_Level is UInt8 range 0 .. 100; type WM8994_Device (Port : not null Any_I2C_Port; I2C_Addr : UInt10; Time : not null HAL.Time.Any_Delays) is tagged limited private; procedure Init (This : in out WM8994_Device; Input : Input_Device; Output : Output_Device; Volume : UInt8; Frequency : Audio_Frequency); function Read_ID (This : in out WM8994_Device) return UInt16; procedure Play (This : in out WM8994_Device); procedure Pause (This : in out WM8994_Device); procedure Resume (This : in out WM8994_Device); procedure Stop (This : in out WM8994_Device; Cmd : Stop_Mode); procedure Set_Volume (This : in out WM8994_Device; Volume : Volume_Level); procedure Set_Mute (This : in out WM8994_Device; Cmd : Mute); procedure Set_Output_Mode (This : in out WM8994_Device; Device : Output_Device); procedure Set_Frequency (This : in out WM8994_Device; Freq : Audio_Frequency); procedure Reset (This : in out WM8994_Device); private type WM8994_Device (Port : not null Any_I2C_Port; I2C_Addr : UInt10; Time : not null HAL.Time.Any_Delays) is tagged limited null record; procedure I2C_Write (This : in out WM8994_Device; Reg : UInt16; Value : UInt16); function I2C_Read (This : in out WM8994_Device; Reg : UInt16) return UInt16; end WM8994;
package Tk.TopLevel.Test_Data.Tests is end Tk.TopLevel.Test_Data.Tests;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2015-2016, AdaCore -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- MPU9250 I2C device class package with Interfaces; use Interfaces; with HAL; use HAL; with HAL.I2C; use HAL.I2C; with HAL.Time; package MPU9250 is type MPU9250_AD0_Pin_State is (High, Low); -- The MPU9250 has a pin that can be set to high or low level to change -- its I2C address. -- Types and subtypes type MPU9250_Device (Port : HAL.I2C.Any_I2C_Port; I2C_AD0_Pin : MPU9250_AD0_Pin_State; Time : not null HAL.Time.Any_Delays) is private; -- Type reprensnting all the different clock sources of the MPU9250. -- See the MPU9250 register map section 4.4 for more details. type MPU9250_Clock_Source is (Internal_Clk, X_Gyro_Clk, Y_Gyro_Clk, Z_Gyro_Clk, External_32K_Clk, External_19M_Clk, Reserved_Clk, Stop_Clk); for MPU9250_Clock_Source use (Internal_Clk => 16#00#, X_Gyro_Clk => 16#01#, Y_Gyro_Clk => 16#02#, Z_Gyro_Clk => 16#03#, External_32K_Clk => 16#04#, External_19M_Clk => 16#05#, Reserved_Clk => 16#06#, Stop_Clk => 16#07#); for MPU9250_Clock_Source'Size use 3; -- Type representing the allowed full scale ranges -- for MPU9250 gyroscope. type MPU9250_FS_Gyro_Range is (MPU9250_Gyro_FS_250, MPU9250_Gyro_FS_500, MPU9250_Gyro_FS_1000, MPU9250_Gyro_FS_2000); for MPU9250_FS_Gyro_Range use (MPU9250_Gyro_FS_250 => 16#00#, MPU9250_Gyro_FS_500 => 16#01#, MPU9250_Gyro_FS_1000 => 16#02#, MPU9250_Gyro_FS_2000 => 16#03#); for MPU9250_FS_Gyro_Range'Size use 2; -- Type representing the allowed full scale ranges -- for MPU9250 accelerometer. type MPU9250_FS_Accel_Range is (MPU9250_Accel_FS_2, MPU9250_Accel_FS_4, MPU9250_Accel_FS_8, MPU9250_Accel_FS_16); for MPU9250_FS_Accel_Range use (MPU9250_Accel_FS_2 => 16#00#, MPU9250_Accel_FS_4 => 16#01#, MPU9250_Accel_FS_8 => 16#02#, MPU9250_Accel_FS_16 => 16#03#); for MPU9250_FS_Accel_Range'Size use 2; type MPU9250_DLPF_Bandwidth_Mode is (MPU9250_DLPF_BW_256, MPU9250_DLPF_BW_188, MPU9250_DLPF_BW_98, MPU9250_DLPF_BW_42, MPU9250_DLPF_BW_20, MPU9250_DLPF_BW_10, MPU9250_DLPF_BW_5); for MPU9250_DLPF_Bandwidth_Mode use (MPU9250_DLPF_BW_256 => 16#00#, MPU9250_DLPF_BW_188 => 16#01#, MPU9250_DLPF_BW_98 => 16#02#, MPU9250_DLPF_BW_42 => 16#03#, MPU9250_DLPF_BW_20 => 16#04#, MPU9250_DLPF_BW_10 => 16#05#, MPU9250_DLPF_BW_5 => 16#06#); for MPU9250_DLPF_Bandwidth_Mode'Size use 3; -- Use to convert MPU9250 registers in degrees (gyro) and G (acc). MPU9250_DEG_PER_LSB_250 : constant := (2.0 * 250.0) / 65536.0; MPU9250_DEG_PER_LSB_500 : constant := (2.0 * 500.0) / 65536.0; MPU9250_DEG_PER_LSB_1000 : constant := (2.0 * 1000.0) / 65536.0; MPU9250_DEG_PER_LSB_2000 : constant := (2.0 * 2000.0) / 65536.0; MPU9250_G_PER_LSB_2 : constant := (2.0 * 2.0) / 65536.0; MPU9250_G_PER_LSB_4 : constant := (2.0 * 4.0) / 65536.0; MPU9250_G_PER_LSB_8 : constant := (2.0 * 8.0) / 65536.0; MPU9250_G_PER_LSB_16 : constant := (2.0 * 16.0) / 65536.0; -- Procedures and functions -- Initialize the MPU9250 Device via I2C. procedure MPU9250_Init (Device : in out MPU9250_Device); -- Test if the MPU9250 is initialized and connected. function MPU9250_Test (Device : MPU9250_Device) return Boolean; -- Test if we are connected to MPU9250 via I2C. function MPU9250_Test_Connection (Device : MPU9250_Device) return Boolean; type Test_Reporter is access procedure (Msg : String; Has_Succeeded : out Boolean); -- MPU9250 self test. function MPU9250_Self_Test (Device : in out MPU9250_Device; Do_Report : Boolean; Reporter : Test_Reporter) return Boolean; -- Reset the MPU9250 device. -- A small delay of ~50ms may be desirable after triggering a reset. procedure MPU9250_Reset (Device : in out MPU9250_Device); -- Get raw 6-axis motion sensor readings (accel/gyro). -- Retrieves all currently available motion sensor values. procedure MPU9250_Get_Motion_6 (Device : MPU9250_Device; Acc_X : out Integer_16; Acc_Y : out Integer_16; Acc_Z : out Integer_16; Gyro_X : out Integer_16; Gyro_Y : out Integer_16; Gyro_Z : out Integer_16); -- Set clock source setting. -- 3 bits allowed to choose the source. The different -- clock sources are enumerated in the MPU9250 register map. procedure MPU9250_Set_Clock_Source (Device : in out MPU9250_Device; Clock_Source : MPU9250_Clock_Source); -- Set digital low-pass filter configuration. procedure MPU9250_Set_DLPF_Mode (Device : in out MPU9250_Device; DLPF_Mode : MPU9250_DLPF_Bandwidth_Mode); -- Set full-scale gyroscope range. procedure MPU9250_Set_Full_Scale_Gyro_Range (Device : in out MPU9250_Device; FS_Range : MPU9250_FS_Gyro_Range); -- Set full-scale acceler range. procedure MPU9250_Set_Full_Scale_Accel_Range (Device : in out MPU9250_Device; FS_Range : MPU9250_FS_Accel_Range); -- Set I2C bypass enabled status. -- When this bit is equal to 1 and I2C_MST_EN (Register 106 bit[5]) is -- equal to 0, the host application processor -- will be able to directly access the -- auxiliary I2C bus of the MPU-60X0. When this bit is equal to 0, -- the host application processor will not be able to directly -- access the auxiliary I2C bus of the MPU-60X0 regardless of the state -- of I2C_MST_EN (Register 106 bit[5]). procedure MPU9250_Set_I2C_Bypass_Enabled (Device : in out MPU9250_Device; Value : Boolean); -- Set interrupts enabled status. procedure MPU9250_Set_Int_Enabled (Device : in out MPU9250_Device; Value : Boolean); -- Set gyroscope sample rate divider procedure MPU9250_Set_Rate (Device : in out MPU9250_Device; Rate_Div : UInt8); -- Set sleep mode status. procedure MPU9250_Set_Sleep_Enabled (Device : in out MPU9250_Device; Value : Boolean); -- Set temperature sensor enabled status. procedure MPU9250_Set_Temp_Sensor_Enabled (Device : in out MPU9250_Device; Value : Boolean); -- Get temperature sensor enabled status. function MPU9250_Get_Temp_Sensor_Enabled (Device : MPU9250_Device) return Boolean; private type MPU9250_Device (Port : HAL.I2C.Any_I2C_Port; I2C_AD0_Pin : MPU9250_AD0_Pin_State; Time : not null HAL.Time.Any_Delays) is record Is_Init : Boolean := False; Address : UInt10; end record; subtype T_Bit_Pos_8 is Natural range 0 .. 7; subtype T_Bit_Pos_16 is Natural range 0 .. 15; -- Global variables and constants -- MPU9250 Device ID. Use to test if we are connected via I2C MPU9250_DEVICE_ID : constant := 16#71#; -- Address pin low (GND), default for InvenSense evaluation board MPU9250_ADDRESS_AD0_LOW : constant := 16#68#; -- Address pin high (VCC) MPU9250_ADDRESS_AD0_HIGH : constant := 16#69#; MPU9250_STARTUP_TIME_MS : constant := 1_000; -- MPU9250 register adresses and other defines MPU9250_REV_C4_ES : constant := 16#14#; MPU9250_REV_C5_ES : constant := 16#15#; MPU9250_REV_D6_ES : constant := 16#16#; MPU9250_REV_D7_ES : constant := 16#17#; MPU9250_REV_D8_ES : constant := 16#18#; MPU9250_REV_C4 : constant := 16#54#; MPU9250_REV_C5 : constant := 16#55#; MPU9250_REV_D6 : constant := 16#56#; MPU9250_REV_D7 : constant := 16#57#; MPU9250_REV_D8 : constant := 16#58#; MPU9250_REV_D9 : constant := 16#59#; MPU9250_RA_ST_X_GYRO : constant := 16#00#; MPU9250_RA_ST_Y_GYRO : constant := 16#01#; MPU9250_RA_ST_Z_GYRO : constant := 16#02#; MPU9250_RA_ST_X_ACCEL : constant := 16#0D#; MPU9250_RA_ST_Y_ACCEL : constant := 16#0E#; MPU9250_RA_ST_Z_ACCEL : constant := 16#0F#; MPU9250_RA_XG_OFFS_USRH : constant := 16#13#; MPU9250_RA_XG_OFFS_USRL : constant := 16#14#; MPU9250_RA_YG_OFFS_USRH : constant := 16#15#; MPU9250_RA_YG_OFFS_USRL : constant := 16#16#; MPU9250_RA_ZG_OFFS_USRH : constant := 16#17#; MPU9250_RA_ZG_OFFS_USRL : constant := 16#18#; MPU9250_RA_SMPLRT_DIV : constant := 16#19#; MPU9250_RA_CONFIG : constant := 16#1A#; MPU9250_RA_GYRO_CONFIG : constant := 16#1B#; MPU9250_RA_ACCEL_CONFIG : constant := 16#1C#; MPU9250_RA_ACCEL_CONFIG_2 : constant := 16#1D#; MPU9250_RA_LP_ACCEL_ODR : constant := 16#1E#; MPU9250_RA_WOM_THR : constant := 16#1F#; MPU9250_RA_FIFO_EN : constant := 16#23#; MPU9250_RA_I2C_MST_CTRL : constant := 16#24#; MPU9250_RA_I2C_SLV0_ADDR : constant := 16#25#; MPU9250_RA_I2C_SLV0_REG : constant := 16#26#; MPU9250_RA_I2C_SLV0_CTRL : constant := 16#27#; MPU9250_RA_I2C_SLV1_ADDR : constant := 16#28#; MPU9250_RA_I2C_SLV1_REG : constant := 16#29#; MPU9250_RA_I2C_SLV1_CTRL : constant := 16#2A#; MPU9250_RA_I2C_SLV2_ADDR : constant := 16#2B#; MPU9250_RA_I2C_SLV2_REG : constant := 16#2C#; MPU9250_RA_I2C_SLV2_CTRL : constant := 16#2D#; MPU9250_RA_I2C_SLV3_ADDR : constant := 16#2E#; MPU9250_RA_I2C_SLV3_REG : constant := 16#2F#; MPU9250_RA_I2C_SLV3_CTRL : constant := 16#30#; MPU9250_RA_I2C_SLV4_ADDR : constant := 16#31#; MPU9250_RA_I2C_SLV4_REG : constant := 16#32#; MPU9250_RA_I2C_SLV4_DO : constant := 16#33#; MPU9250_RA_I2C_SLV4_CTRL : constant := 16#34#; MPU9250_RA_I2C_SLV4_DI : constant := 16#35#; MPU9250_RA_I2C_MST_STATUS : constant := 16#36#; MPU9250_RA_INT_PIN_CFG : constant := 16#37#; MPU9250_RA_INT_ENABLE : constant := 16#38#; MPU9250_RA_DMP_INT_STATUS : constant := 16#39#; MPU9250_RA_INT_STATUS : constant := 16#3A#; MPU9250_RA_ACCEL_XOUT_H : constant := 16#3B#; MPU9250_RA_ACCEL_XOUT_L : constant := 16#3C#; MPU9250_RA_ACCEL_YOUT_H : constant := 16#3D#; MPU9250_RA_ACCEL_YOUT_L : constant := 16#3E#; MPU9250_RA_ACCEL_ZOUT_H : constant := 16#3F#; MPU9250_RA_ACCEL_ZOUT_L : constant := 16#40#; MPU9250_RA_TEMP_OUT_H : constant := 16#41#; MPU9250_RA_TEMP_OUT_L : constant := 16#42#; MPU9250_RA_GYRO_XOUT_H : constant := 16#43#; MPU9250_RA_GYRO_XOUT_L : constant := 16#44#; MPU9250_RA_GYRO_YOUT_H : constant := 16#45#; MPU9250_RA_GYRO_YOUT_L : constant := 16#46#; MPU9250_RA_GYRO_ZOUT_H : constant := 16#47#; MPU9250_RA_GYRO_ZOUT_L : constant := 16#48#; MPU9250_RA_EXT_SENS_DATA_00 : constant := 16#49#; MPU9250_RA_EXT_SENS_DATA_01 : constant := 16#4A#; MPU9250_RA_EXT_SENS_DATA_02 : constant := 16#4B#; MPU9250_RA_EXT_SENS_DATA_03 : constant := 16#4C#; MPU9250_RA_EXT_SENS_DATA_04 : constant := 16#4D#; MPU9250_RA_EXT_SENS_DATA_05 : constant := 16#4E#; MPU9250_RA_EXT_SENS_DATA_06 : constant := 16#4F#; MPU9250_RA_EXT_SENS_DATA_07 : constant := 16#50#; MPU9250_RA_EXT_SENS_DATA_08 : constant := 16#51#; MPU9250_RA_EXT_SENS_DATA_09 : constant := 16#52#; MPU9250_RA_EXT_SENS_DATA_10 : constant := 16#53#; MPU9250_RA_EXT_SENS_DATA_11 : constant := 16#54#; MPU9250_RA_EXT_SENS_DATA_12 : constant := 16#55#; MPU9250_RA_EXT_SENS_DATA_13 : constant := 16#56#; MPU9250_RA_EXT_SENS_DATA_14 : constant := 16#57#; MPU9250_RA_EXT_SENS_DATA_15 : constant := 16#58#; MPU9250_RA_EXT_SENS_DATA_16 : constant := 16#59#; MPU9250_RA_EXT_SENS_DATA_17 : constant := 16#5A#; MPU9250_RA_EXT_SENS_DATA_18 : constant := 16#5B#; MPU9250_RA_EXT_SENS_DATA_19 : constant := 16#5C#; MPU9250_RA_EXT_SENS_DATA_20 : constant := 16#5D#; MPU9250_RA_EXT_SENS_DATA_21 : constant := 16#5E#; MPU9250_RA_EXT_SENS_DATA_22 : constant := 16#5F#; MPU9250_RA_EXT_SENS_DATA_23 : constant := 16#60#; MPU9250_RA_MOT_DETECT_STATUS : constant := 16#61#; MPU9250_RA_I2C_SLV0_DO : constant := 16#63#; MPU9250_RA_I2C_SLV1_DO : constant := 16#64#; MPU9250_RA_I2C_SLV2_DO : constant := 16#65#; MPU9250_RA_I2C_SLV3_DO : constant := 16#66#; MPU9250_RA_I2C_MST_DELAY_CTRL : constant := 16#67#; MPU9250_RA_SIGNAL_PATH_RESET : constant := 16#68#; MPU9250_RA_MOT_DETECT_CTRL : constant := 16#69#; MPU9250_RA_USER_CTRL : constant := 16#6A#; MPU9250_RA_PWR_MGMT_1 : constant := 16#6B#; MPU9250_RA_PWR_MGMT_2 : constant := 16#6C#; MPU9250_RA_BANK_SEL : constant := 16#6D#; MPU9250_RA_MEM_START_ADDR : constant := 16#6E#; MPU9250_RA_MEM_R_W : constant := 16#6F#; MPU9250_RA_DMP_CFG_1 : constant := 16#70#; MPU9250_RA_DMP_CFG_2 : constant := 16#71#; MPU9250_RA_FIFO_COUNTH : constant := 16#72#; MPU9250_RA_FIFO_COUNTL : constant := 16#73#; MPU9250_RA_FIFO_R_W : constant := 16#74#; MPU9250_RA_WHO_AM_I : constant := 16#75#; MPU9250_RA_XA_OFFSET_H : constant := 16#77#; MPU9250_RA_XA_OFFSET_L : constant := 16#78#; MPU9250_RA_YA_OFFSET_H : constant := 16#7A#; MPU9250_RA_YA_OFFSET_L : constant := 16#7B#; MPU9250_RA_ZA_OFFSET_H : constant := 16#7D#; MPU9250_RA_ZA_OFFSET_L : constant := 16#7E#; MPU9250_TC_PWR_MODE_BIT : constant := 7; MPU9250_TC_OFFSET_BIT : constant := 6; MPU9250_TC_OFFSET_LENGTH : constant := 6; MPU9250_TC_OTP_BNK_VLD_BIT : constant := 0; MPU9250_VDDIO_LEVEL_VLOGIC : constant := 0; MPU9250_VDDIO_LEVEL_VDD : constant := 1; MPU9250_CFG_EXT_SYNC_SET_BIT : constant := 5; MPU9250_CFG_EXT_SYNC_SET_LENGTH : constant := 3; MPU9250_CFG_DLPF_CFG_BIT : constant := 2; MPU9250_CFG_DLPF_CFG_LENGTH : constant := 3; MPU9250_EXT_SYNC_DISABLED : constant := 16#0#; MPU9250_EXT_SYNC_TEMP_OUT_L : constant := 16#1#; MPU9250_EXT_SYNC_GYRO_XOUT_L : constant := 16#2#; MPU9250_EXT_SYNC_GYRO_YOUT_L : constant := 16#3#; MPU9250_EXT_SYNC_GYRO_ZOUT_L : constant := 16#4#; MPU9250_EXT_SYNC_ACCEL_XOUT_L : constant := 16#5#; MPU9250_EXT_SYNC_ACCEL_YOUT_L : constant := 16#6#; MPU9250_EXT_SYNC_ACCEL_ZOUT_L : constant := 16#7#; MPU9250_GCONFIG_XG_ST_BIT : constant := 7; MPU9250_GCONFIG_YG_ST_BIT : constant := 6; MPU9250_GCONFIG_ZG_ST_BIT : constant := 5; MPU9250_GCONFIG_FS_SEL_BIT : constant := 4; MPU9250_GCONFIG_FS_SEL_LENGTH : constant := 2; MPU9250_ACONFIG_XA_ST_BIT : constant := 7; MPU9250_ACONFIG_YA_ST_BIT : constant := 6; MPU9250_ACONFIG_ZA_ST_BIT : constant := 5; MPU9250_ACONFIG_AFS_SEL_BIT : constant := 4; MPU9250_ACONFIG_AFS_SEL_LENGTH : constant := 2; MPU9250_ACONFIG_ACCEL_HPF_BIT : constant := 2; MPU9250_ACONFIG_ACCEL_HPF_LENGTH : constant := 3; MPU9250_DHPF_RESET : constant := 16#00#; MPU9250_DHPF_5 : constant := 16#01#; MPU9250_DHPF_2P5 : constant := 16#02#; MPU9250_DHPF_1P25 : constant := 16#03#; MPU9250_DHPF_0P63 : constant := 16#04#; MPU9250_DHPF_HOLD : constant := 16#07#; MPU9250_TEMP_FIFO_EN_BIT : constant := 7; MPU9250_XG_FIFO_EN_BIT : constant := 6; MPU9250_YG_FIFO_EN_BIT : constant := 5; MPU9250_ZG_FIFO_EN_BIT : constant := 4; MPU9250_ACCEL_FIFO_EN_BIT : constant := 3; MPU9250_SLV2_FIFO_EN_BIT : constant := 2; MPU9250_SLV1_FIFO_EN_BIT : constant := 1; MPU9250_SLV0_FIFO_EN_BIT : constant := 0; MPU9250_MULT_MST_EN_BIT : constant := 7; MPU9250_WAIT_FOR_ES_BIT : constant := 6; MPU9250_SLV_3_FIFO_EN_BIT : constant := 5; MPU9250_I2C_MST_P_NSR_BIT : constant := 4; MPU9250_I2C_MST_CLK_BIT : constant := 3; MPU9250_I2C_MST_CLK_LENGTH : constant := 4; MPU9250_CLOCK_DIV_348 : constant := 16#0#; MPU9250_CLOCK_DIV_333 : constant := 16#1#; MPU9250_CLOCK_DIV_320 : constant := 16#2#; MPU9250_CLOCK_DIV_308 : constant := 16#3#; MPU9250_CLOCK_DIV_296 : constant := 16#4#; MPU9250_CLOCK_DIV_286 : constant := 16#5#; MPU9250_CLOCK_DIV_276 : constant := 16#6#; MPU9250_CLOCK_DIV_267 : constant := 16#7#; MPU9250_CLOCK_DIV_258 : constant := 16#8#; MPU9250_CLOCK_DIV_500 : constant := 16#9#; MPU9250_CLOCK_DIV_471 : constant := 16#A#; MPU9250_CLOCK_DIV_444 : constant := 16#B#; MPU9250_CLOCK_DIV_421 : constant := 16#C#; MPU9250_CLOCK_DIV_400 : constant := 16#D#; MPU9250_CLOCK_DIV_381 : constant := 16#E#; MPU9250_CLOCK_DIV_364 : constant := 16#F#; MPU9250_I2C_SLV_RW_BIT : constant := 7; MPU9250_I2C_SLV_ADDR_BIT : constant := 6; MPU9250_I2C_SLV_ADDR_LENGTH : constant := 7; MPU9250_I2C_SLV_EN_BIT : constant := 7; MPU9250_I2C_SLV_UInt8_SW_BIT : constant := 6; MPU9250_I2C_SLV_REG_DIS_BIT : constant := 5; MPU9250_I2C_SLV_GRP_BIT : constant := 4; MPU9250_I2C_SLV_LEN_BIT : constant := 3; MPU9250_I2C_SLV_LEN_LENGTH : constant := 4; MPU9250_I2C_SLV4_RW_BIT : constant := 7; MPU9250_I2C_SLV4_ADDR_BIT : constant := 6; MPU9250_I2C_SLV4_ADDR_LENGTH : constant := 7; MPU9250_I2C_SLV4_EN_BIT : constant := 7; MPU9250_I2C_SLV4_INT_EN_BIT : constant := 6; MPU9250_I2C_SLV4_REG_DIS_BIT : constant := 5; MPU9250_I2C_SLV4_MST_DLY_BIT : constant := 4; MPU9250_I2C_SLV4_MST_DLY_LENGTH : constant := 5; MPU9250_MST_PASS_THROUGH_BIT : constant := 7; MPU9250_MST_I2C_SLV4_DONE_BIT : constant := 6; MPU9250_MST_I2C_LOST_ARB_BIT : constant := 5; MPU9250_MST_I2C_SLV4_NACK_BIT : constant := 4; MPU9250_MST_I2C_SLV3_NACK_BIT : constant := 3; MPU9250_MST_I2C_SLV2_NACK_BIT : constant := 2; MPU9250_MST_I2C_SLV1_NACK_BIT : constant := 1; MPU9250_MST_I2C_SLV0_NACK_BIT : constant := 0; MPU9250_INTCFG_INT_LEVEL_BIT : constant := 7; MPU9250_INTCFG_INT_OPEN_BIT : constant := 6; MPU9250_INTCFG_LATCH_INT_EN_BIT : constant := 5; MPU9250_INTCFG_INT_RD_CLEAR_BIT : constant := 4; MPU9250_INTCFG_FSYNC_INT_LEVEL_BIT : constant := 3; MPU9250_INTCFG_FSYNC_INT_EN_BIT : constant := 2; MPU9250_INTCFG_I2C_BYPASS_EN_BIT : constant := 1; MPU9250_INTCFG_CLKOUT_EN_BIT : constant := 0; MPU9250_INTMODE_ACTIVEHIGH : constant := 16#00#; MPU9250_INTMODE_ACTIVELOW : constant := 16#01#; MPU9250_INTDRV_PUSHPULL : constant := 16#00#; MPU9250_INTDRV_OPENDRAIN : constant := 16#01#; MPU9250_INTLATCH_50USPULSE : constant := 16#00#; MPU9250_INTLATCH_WAITCLEAR : constant := 16#01#; MPU9250_INTCLEAR_STATUSREAD : constant := 16#00#; MPU9250_INTCLEAR_ANYREAD : constant := 16#01#; MPU9250_INTERRUPT_FF_BIT : constant := 7; MPU9250_INTERRUPT_MOT_BIT : constant := 6; MPU9250_INTERRUPT_ZMOT_BIT : constant := 5; MPU9250_INTERRUPT_FIFO_OFLOW_BIT : constant := 4; MPU9250_INTERRUPT_I2C_MST_INT_BIT : constant := 3; MPU9250_INTERRUPT_PLL_RDY_INT_BIT : constant := 2; MPU9250_INTERRUPT_DMP_INT_BIT : constant := 1; MPU9250_INTERRUPT_DATA_RDY_BIT : constant := 0; MPU9250_DMPINT_5_BIT : constant := 5; MPU9250_DMPINT_4_BIT : constant := 4; MPU9250_DMPINT_3_BIT : constant := 3; MPU9250_DMPINT_2_BIT : constant := 2; MPU9250_DMPINT_1_BIT : constant := 1; MPU9250_DMPINT_0_BIT : constant := 0; MPU9250_MOTION_MOT_XNEG_BIT : constant := 7; MPU9250_MOTION_MOT_XPOS_BIT : constant := 6; MPU9250_MOTION_MOT_YNEG_BIT : constant := 5; MPU9250_MOTION_MOT_YPOS_BIT : constant := 4; MPU9250_MOTION_MOT_ZNEG_BIT : constant := 3; MPU9250_MOTION_MOT_ZPOS_BIT : constant := 2; MPU9250_MOTION_MOT_ZRMOT_BIT : constant := 0; MPU9250_DELAYCTRL_DELAY_ES_SHADOW_BIT : constant := 7; MPU9250_DELAYCTRL_I2C_SLV4_DLY_EN_BIT : constant := 4; MPU9250_DELAYCTRL_I2C_SLV3_DLY_EN_BIT : constant := 3; MPU9250_DELAYCTRL_I2C_SLV2_DLY_EN_BIT : constant := 2; MPU9250_DELAYCTRL_I2C_SLV1_DLY_EN_BIT : constant := 1; MPU9250_DELAYCTRL_I2C_SLV0_DLY_EN_BIT : constant := 0; MPU9250_PATHRESET_GYRO_RESET_BIT : constant := 2; MPU9250_PATHRESET_ACCEL_RESET_BIT : constant := 1; MPU9250_PATHRESET_TEMP_RESET_BIT : constant := 0; MPU9250_DETECT_ACCEL_ON_DELAY_BIT : constant := 5; MPU9250_DETECT_ACCEL_ON_DELAY_LENGTH : constant := 2; MPU9250_DETECT_FF_COUNT_BIT : constant := 3; MPU9250_DETECT_FF_COUNT_LENGTH : constant := 2; MPU9250_DETECT_MOT_COUNT_BIT : constant := 1; MPU9250_DETECT_MOT_COUNT_LENGTH : constant := 2; MPU9250_DETECT_DECREMENT_RESET : constant := 16#0#; MPU9250_DETECT_DECREMENT_1 : constant := 16#1#; MPU9250_DETECT_DECREMENT_2 : constant := 16#2#; MPU9250_DETECT_DECREMENT_4 : constant := 16#3#; MPU9250_USERCTRL_DMP_EN_BIT : constant := 7; MPU9250_USERCTRL_FIFO_EN_BIT : constant := 6; MPU9250_USERCTRL_I2C_MST_EN_BIT : constant := 5; MPU9250_USERCTRL_I2C_IF_DIS_BIT : constant := 4; MPU9250_USERCTRL_DMP_RESET_BIT : constant := 3; MPU9250_USERCTRL_FIFO_RESET_BIT : constant := 2; MPU9250_USERCTRL_I2C_MST_RESET_BIT : constant := 1; MPU9250_USERCTRL_SIG_COND_RESET_BIT : constant := 0; MPU9250_PWR1_DEVICE_RESET_BIT : constant := 7; MPU9250_PWR1_SLEEP_BIT : constant := 6; MPU9250_PWR1_CYCLE_BIT : constant := 5; MPU9250_PWR1_TEMP_DIS_BIT : constant := 3; MPU9250_PWR1_CLKSEL_BIT : constant := 2; MPU9250_PWR1_CLKSEL_LENGTH : constant := 3; MPU9250_CLOCK_INTERNAL : constant := 16#00#; MPU9250_CLOCK_PLL_XGYRO : constant := 16#01#; MPU9250_CLOCK_PLL_YGYRO : constant := 16#02#; MPU9250_CLOCK_PLL_ZGYRO : constant := 16#03#; MPU9250_CLOCK_PLL_EXT32K : constant := 16#04#; MPU9250_CLOCK_PLL_EXT19M : constant := 16#05#; MPU9250_CLOCK_KEEP_RESET : constant := 16#07#; MPU9250_PWR2_LP_WAKE_CTRL_BIT : constant := 7; MPU9250_PWR2_LP_WAKE_CTRL_LENGTH : constant := 2; MPU9250_PWR2_STBY_XA_BIT : constant := 5; MPU9250_PWR2_STBY_YA_BIT : constant := 4; MPU9250_PWR2_STBY_ZA_BIT : constant := 3; MPU9250_PWR2_STBY_XG_BIT : constant := 2; MPU9250_PWR2_STBY_YG_BIT : constant := 1; MPU9250_PWR2_STBY_ZG_BIT : constant := 0; MPU9250_WAKE_FREQ_1P25 : constant := 16#0#; MPU9250_WAKE_FREQ_2P5 : constant := 16#1#; MPU9250_WAKE_FREQ_5 : constant := 16#2#; MPU9250_WAKE_FREQ_10 : constant := 16#3#; MPU9250_BANKSEL_PRFTCH_EN_BIT : constant := 6; MPU9250_BANKSEL_CFG_USER_BANK_BIT : constant := 5; MPU9250_BANKSEL_MEM_SEL_BIT : constant := 4; MPU9250_BANKSEL_MEM_SEL_LENGTH : constant := 5; MPU9250_WHO_AM_I_BIT : constant := 6; MPU9250_WHO_AM_I_LENGTH : constant := 6; MPU9250_DMP_MEMORY_BANKS : constant := 8; MPU9250_DMP_MEMORY_BANK_SIZE : constant := 256; MPU9250_DMP_MEMORY_CHUNK_SIZE : constant := 16; MPU9250_ST_GYRO_LOW : constant := (-14.0); MPU9250_ST_GYRO_HIGH : constant := 14.0; MPU9250_ST_ACCEL_LOW : constant := (-14.0); MPU9250_ST_ACCEL_HIGH : constant := 14.0; -- Element n is 2620 * (1.01 ** n) MPU9250_ST_TB : constant array (0 .. 255) of UInt16 := ( 2620, 2646, 2672, 2699, 2726, 2753, 2781, 2808, 2837, 2865, 2894, 2923, 2952, 2981, 3011, 3041, 3072, 3102, 3133, 3165, 3196, 3228, 3261, 3293, 3326, 3359, 3393, 3427, 3461, 3496, 3531, 3566, 3602, 3638, 3674, 3711, 3748, 3786, 3823, 3862, 3900, 3939, 3979, 4019, 4059, 4099, 4140, 4182, 4224, 4266, 4308, 4352, 4395, 4439, 4483, 4528, 4574, 4619, 4665, 4712, 4759, 4807, 4855, 4903, 4953, 5002, 5052, 5103, 5154, 5205, 5257, 5310, 5363, 5417, 5471, 5525, 5581, 5636, 5693, 5750, 5807, 5865, 5924, 5983, 6043, 6104, 6165, 6226, 6289, 6351, 6415, 6479, 6544, 6609, 6675, 6742, 6810, 6878, 6946, 7016, 7086, 7157, 7229, 7301, 7374, 7448, 7522, 7597, 7673, 7750, 7828, 7906, 7985, 8065, 8145, 8227, 8309, 8392, 8476, 8561, 8647, 8733, 8820, 8909, 8998, 9088, 9178, 9270, 9363, 9457, 9551, 9647, 9743, 9841, 9939, 10038, 10139, 10240, 10343, 10446, 10550, 10656, 10763, 10870, 10979, 11089, 11200, 11312, 11425, 11539, 11654, 11771, 11889, 12008, 12128, 12249, 12371, 12495, 12620, 12746, 12874, 13002, 13132, 13264, 13396, 13530, 13666, 13802, 13940, 14080, 14221, 14363, 14506, 14652, 14798, 14946, 15096, 15247, 15399, 15553, 15709, 15866, 16024, 16184, 16346, 16510, 16675, 16842, 17010, 17180, 17352, 17526, 17701, 17878, 18057, 18237, 18420, 18604, 18790, 18978, 19167, 19359, 19553, 19748, 19946, 20145, 20347, 20550, 20756, 20963, 21173, 21385, 21598, 21814, 22033, 22253, 22475, 22700, 22927, 23156, 23388, 23622, 23858, 24097, 24338, 24581, 24827, 25075, 25326, 25579, 25835, 26093, 26354, 26618, 26884, 27153, 27424, 27699, 27976, 28255, 28538, 28823, 29112, 29403, 29697, 29994, 30294, 30597, 30903, 31212, 31524, 31839, 32157, 32479, 32804, 33132 ); -- Procedures and functions -- Read data to the specified MPU9250 register procedure MPU9250_Read_Register (Device : MPU9250_Device; Reg_Addr : UInt8; Data : in out I2C_Data); -- Read one UInt8 at the specified MPU9250 register procedure MPU9250_Read_UInt8_At_Register (Device : MPU9250_Device; Reg_Addr : UInt8; Data : out UInt8); -- Read one but at the specified MPU9250 register function MPU9250_Read_Bit_At_Register (Device : MPU9250_Device; Reg_Addr : UInt8; Bit_Pos : T_Bit_Pos_8) return Boolean; -- Write data to the specified MPU9250 register procedure MPU9250_Write_Register (Device : MPU9250_Device; Reg_Addr : UInt8; Data : I2C_Data); -- Write one UInt8 at the specified MPU9250 register procedure MPU9250_Write_UInt8_At_Register (Device : MPU9250_Device; Reg_Addr : UInt8; Data : UInt8); -- Write one bit at the specified MPU9250 register procedure MPU9250_Write_Bit_At_Register (Device : MPU9250_Device; Reg_Addr : UInt8; Bit_Pos : T_Bit_Pos_8; Bit_Value : Boolean); -- Write data in the specified register, starting from the -- bit specified in Start_Bit_Pos procedure MPU9250_Write_Bits_At_Register (Device : MPU9250_Device; Reg_Addr : UInt8; Start_Bit_Pos : T_Bit_Pos_8; Data : UInt8; Length : T_Bit_Pos_8); function Fuse_Low_And_High_Register_Parts (High : UInt8; Low : UInt8) return Integer_16; pragma Inline (Fuse_Low_And_High_Register_Parts); end MPU9250;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ E N U M -- -- -- -- S p e c -- -- -- -- Copyright (C) 2000-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Enumeration_Type'Image for all enumeration types except those in package -- Standard (where we have no opportunity to build image tables), and in -- package System (where it is too early to start building image tables). -- Special routines exist for the enumeration types in these packages. -- Note: this is an obsolete package, replaced by System.Img_Enum_New, which -- provides procedures instead of functions for these enumeration image calls. -- The reason we maintain this package is that when bootstrapping with old -- compilers, the old compiler will search for this unit, expecting to find -- these functions. The new compiler will search for procedures in the new -- version of the unit. pragma Compiler_Unit_Warning; package System.Img_Enum is pragma Pure; function Image_Enumeration_8 (Pos : Natural; Names : String; Indexes : System.Address) return String; -- Used to compute Enum'Image (Str) where Enum is some enumeration type -- other than those defined in package Standard. Names is a string with a -- lower bound of 1 containing the characters of all the enumeration -- literals concatenated together in sequence. Indexes is the address of an -- array of type array (0 .. N) of Natural_8, where N is the number of -- enumeration literals in the type. The Indexes values are the starting -- subscript of each enumeration literal, indexed by Pos values, with an -- extra entry at the end containing Names'Length + 1. The reason that -- Indexes is passed by address is that the actual type is created on the -- fly by the expander. The value returned is the desired 'Image value. function Image_Enumeration_16 (Pos : Natural; Names : String; Indexes : System.Address) return String; -- Identical to Image_Enumeration_8 except that it handles types -- using array (0 .. Num) of Natural_16 for the Indexes table. function Image_Enumeration_32 (Pos : Natural; Names : String; Indexes : System.Address) return String; -- Identical to Image_Enumeration_8 except that it handles types -- using array (0 .. Num) of Natural_32 for the Indexes table. end System.Img_Enum;
-- MIT License -- Copyright (c) 2021 Stephen Merrony -- Permission is hereby granted, free of charge, to any person obtaining a copy -- of this software and associated documentation files (the "Software"), to deal -- in the Software without restriction, including without limitation the rights -- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -- copies of the Software, and to permit persons to whom the Software is -- furnished to do so, subject to the following conditions: -- The above copyright notice and this permission notice shall be included in all -- copies or substantial portions of the Software. -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE -- SOFTWARE. package Processor.Eagle_PC_P is procedure Do_Eagle_PC (I : in Decoded_Instr_T; CPU : in out CPU_T); end Processor.Eagle_PC_P;
-- Copyright 2008-2014 Free Software Foundation, Inc. -- -- 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 3 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, see <http://www.gnu.org/licenses/>. package body Pck is procedure Do_Nothing (C : in out Circle) is begin null; end Do_Nothing; end Pck;
------------------------------------------------------------------------------ -- -- -- GNAT EXAMPLE -- -- -- -- Copyright (C) 2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Unchecked_Conversion; package body TMS570.LEDs is function As_Word is new Ada.Unchecked_Conversion (Source => User_LED, Target => Word); -------- -- On -- -------- procedure On (This : User_LED) is begin Set_Pin (HET_Port, As_Word (This)); end On; --------- -- Off -- --------- procedure Off (This : User_LED) is begin Clear_Pin (HET_Port, As_Word (This)); end Off; ---------------- -- Initialize -- ---------------- procedure Initialize is begin -- set all pins as outputs HET_Port.DIR := 16#FFFF_FFFF#; end Initialize; begin Initialize; end TMS570.LEDs;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ C H 8 -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT 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 distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Types; use Types; package Sem_Ch8 is ----------------------------------- -- Handling extensions of System -- ----------------------------------- -- For targets that define a much larger System package than given in -- the RM, we use a child package containing additional declarations, -- which is loaded when needed, and whose entities are conceptually -- within System itself. The presence of this auxiliary package is -- controlled with the pragma Extend_System. The following variable -- holds the entity of the auxiliary package, to simplify the special -- visibility rules that apply to it. System_Aux_Id : Entity_Id := Empty; ----------------- -- Subprograms -- ----------------- procedure Analyze_Exception_Renaming (N : Node_Id); procedure Analyze_Expanded_Name (N : Node_Id); procedure Analyze_Generic_Function_Renaming (N : Node_Id); procedure Analyze_Generic_Package_Renaming (N : Node_Id); procedure Analyze_Generic_Procedure_Renaming (N : Node_Id); procedure Analyze_Object_Renaming (N : Node_Id); procedure Analyze_Package_Renaming (N : Node_Id); procedure Analyze_Subprogram_Renaming (N : Node_Id); procedure Analyze_Use_Package (N : Node_Id; Chain : Boolean := True); -- Analyze a use package clause and control (through the Chain parameter) -- whether to add N to the use clause chain for the name denoted within -- use clause N in case we are reanalyzing a use clause because of stack -- manipulation. procedure Analyze_Use_Type (N : Node_Id; Chain : Boolean := True); -- Similar to Analyze_Use_Package except the Chain parameter applies to the -- type within N's subtype mark Current_Use_Clause. procedure End_Scope; -- Called at end of scope. On exit from blocks and bodies (subprogram, -- package, task, and protected bodies), the name of the current scope -- must be removed from the scope stack, and the local entities must be -- removed from their homonym chains. On exit from record declarations, -- from package specifications, and from tasks and protected type -- specifications, more specialized procedures are invoked. procedure End_Use_Clauses (Clause : Node_Id); -- Invoked on scope exit, to undo the effect of local use clauses. Clause -- is the first use-clause of a scope being exited. This can be the current -- scope, or some enclosing scopes when building a clean environment to -- compile an instance body for inlining. procedure End_Use_Package (N : Node_Id); procedure End_Use_Type (N : Node_Id); -- Subsidiaries of End_Use_Clauses. Also called directly for use clauses -- appearing in context clauses. procedure Find_Direct_Name (N : Node_Id); -- Given a direct name (Identifier or Operator_Symbol), this routine scans -- the homonym chain for the name, searching for corresponding visible -- entities to find the referenced entity (or in the case of overloading, -- one candidate interpretation). On return, the Entity and Etype fields -- are set. In the non-overloaded case, these are the correct entries. -- In the overloaded case, the flag Is_Overloaded is set, Etype and Entity -- refer to an arbitrary element of the overloads set, and the appropriate -- entries have been added to the overloads table entry for the node. The -- overloading will be disambiguated during type resolution. -- -- Note, when this is called during semantic analysis in the overloaded -- case, the entity set will be the most recently declared homonym. In -- particular, the caller may follow the homonym chain checking for all -- entries in the current scope, and that will give all homonyms that are -- declared before the point of call in the current scope. This is useful -- for example in the processing for pragma Inline. -- -- Flag Errors_OK should be set when error diagnostics are desired. Flag -- Marker_OK should be set when a N_Variable_Reference_Marker needs to be -- generated for a SPARK object in order to detect elaboration issues. Flag -- Reference_OK should be set when N must generate a cross reference. procedure Find_Selected_Component (N : Node_Id); -- Resolve various cases of selected components, recognize expanded names procedure Find_Type (N : Node_Id); -- Perform name resolution, and verify that the name found is that of a -- type. On return the Entity and Etype fields of the node N are set -- appropriately. If it is an incomplete type whose full declaration has -- been seen, they are set to the entity in the full declaration. If it -- is an incomplete type associated with an interface visible through a -- limited-with clause, whose full declaration has been seen, they are -- set to the entity in the full declaration. Similarly, if the type is -- private, it has received a full declaration, and we are in the private -- part or body of the package, then the two fields are set to the entity -- of the full declaration as well. This procedure also has special -- processing for 'Class attribute references. function Has_Loop_In_Inner_Open_Scopes (S : Entity_Id) return Boolean; -- S is the entity of an open scope. This function determines if there is -- an inner scope of S which is a loop (i.e. it appears somewhere in the -- scope stack after S). function In_Open_Scopes (S : Entity_Id) return Boolean; -- S is the entity of a scope. This function determines if this scope is -- currently open (i.e. it appears somewhere in the scope stack). procedure Initialize; -- Initializes data structures used for visibility analysis. Must be -- called before analyzing each new main source program. procedure Install_Use_Clauses (Clause : Node_Id; Force_Installation : Boolean := False); -- Applies the use clauses appearing in a given declarative part, -- when the corresponding scope has been placed back on the scope -- stack after unstacking to compile a different context (subunit or -- parent of generic body). Force_Installation is used when called from -- Analyze_Subunit.Re_Install_Use_Clauses to insure that, after the -- analysis of the subunit, the parent's environment is again identical. procedure Mark_Use_Clauses (Id : Node_Or_Entity_Id); -- Mark a given entity or node Id's relevant use clauses as effective, -- including redundant ones and ones outside of the current scope. procedure Push_Scope (S : Entity_Id); -- Make new scope stack entry, pushing S, the entity for a scope onto the -- top of the scope table. The current setting of the scope suppress flags -- is saved for restoration on exit. procedure Pop_Scope; -- Remove top entry from scope stack, restoring the saved setting of the -- scope suppress flags. function Present_System_Aux (N : Node_Id := Empty) return Boolean; -- Return True if the auxiliary system file has been successfully loaded. -- Otherwise attempt to load it, using the name supplied by a previous -- Extend_System pragma, and report on the success of the load. If N is -- present, it is a selected component whose prefix is System, or else a -- with-clause on system. N is absent when the function is called to find -- the visibility of implicit operators. function Save_Scope_Stack (Handle_Use : Boolean := True) return Elist_Id; procedure Restore_Scope_Stack (List : Elist_Id; Handle_Use : Boolean := True); -- These two subprograms are called from Semantics, when a unit U1 is to -- be compiled in the course of the compilation of another unit U2. This -- happens whenever Rtsfind is called. U1, the unit retrieved by Rtsfind, -- must be compiled in its own context, and the current scope stack -- containing U2 and local scopes must be made unreachable. This is -- achieved using a call to Save_Scope_Stack. On return, the contents -- of the scope stack must be made accessible again with a call to -- Restore_Scope_Stack. -- -- The flag Handle_Use indicates whether local use clauses must be removed -- or installed. In the case of inlining of instance bodies, the visibility -- handling is done fully in Inline_Instance_Body, and use clauses are -- handled there. Save_Scope_Stack returns the list of entities which have -- been temporarily removed from visibility; that list must be passed to -- Restore_Scope_Stack to restore their visibility. procedure Set_Use (L : List_Id); -- Find use clauses that are declarative items in a package declaration -- and set the potentially use-visible flags of imported entities before -- analyzing the corresponding package body. procedure Update_Use_Clause_Chain; -- Called at the end of a declarative region to detect unused use type -- clauses and maintain the Current_Use_Clause for type entities. procedure ws; -- Debugging routine for use in gdb: dump all entities on scope stack procedure we (S : Entity_Id); -- Debugging routine for use in gdb: dump all entities in given scope end Sem_Ch8;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . B B . M C U _ P A R A M E T E R S -- -- -- -- B o d y -- -- -- -- Copyright (C) 2016, AdaCore -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- -- The port of GNARL to bare board targets was initially developed by the -- -- Real-Time Systems Group at the Technical University of Madrid. -- -- -- ------------------------------------------------------------------------------ with Interfaces.STM32.PWR; use Interfaces.STM32.PWR; package body System.BB.MCU_Parameters is -------------------- -- PWR_Initialize -- -------------------- procedure PWR_Initialize is begin -- Set the PWR to Scale 1 mode to stabilize the MCU when in high -- performance mode. PWR_Periph.CR.VOS := 3; end PWR_Initialize; -------------------------- -- PWR_Overdrive_Enable -- -------------------------- procedure PWR_Overdrive_Enable is begin -- Enable the overdrive mode PWR_Periph.CR.ODEN := 1; -- Wait for stabilisation loop exit when PWR_Periph.CSR.ODRDY = 1; end loop; -- Now switch to it PWR_Periph.CR.ODSWEN := 1; loop exit when PWR_Periph.CSR.ODSWRDY = 1; end loop; end PWR_Overdrive_Enable; end System.BB.MCU_Parameters;
-- This spec has been automatically generated from STM32F0xx.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with System; package STM32_SVD.WWDG is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_T_Field is STM32_SVD.UInt7; subtype CR_WDGA_Field is STM32_SVD.Bit; -- Control register type CR_Register is record -- 7-bit counter T : CR_T_Field := 16#7F#; -- Activation bit WDGA : CR_WDGA_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record T at 0 range 0 .. 6; WDGA at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype CFR_W_Field is STM32_SVD.UInt7; subtype CFR_WDGTB_Field is STM32_SVD.UInt2; subtype CFR_EWI_Field is STM32_SVD.Bit; -- Configuration register type CFR_Register is record -- 7-bit window value W : CFR_W_Field := 16#7F#; -- Timer base WDGTB : CFR_WDGTB_Field := 16#0#; -- Early wakeup interrupt EWI : CFR_EWI_Field := 16#0#; -- unspecified Reserved_10_31 : STM32_SVD.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CFR_Register use record W at 0 range 0 .. 6; WDGTB at 0 range 7 .. 8; EWI at 0 range 9 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; subtype SR_EWIF_Field is STM32_SVD.Bit; -- Status register type SR_Register is record -- Early wakeup interrupt flag EWIF : SR_EWIF_Field := 16#0#; -- unspecified Reserved_1_31 : STM32_SVD.UInt31 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register use record EWIF at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Window watchdog type WWDG_Peripheral is record -- Control register CR : aliased CR_Register; -- Configuration register CFR : aliased CFR_Register; -- Status register SR : aliased SR_Register; end record with Volatile; for WWDG_Peripheral use record CR at 16#0# range 0 .. 31; CFR at 16#4# range 0 .. 31; SR at 16#8# range 0 .. 31; end record; -- Window watchdog WWDG_Periph : aliased WWDG_Peripheral with Import, Address => System'To_Address (16#40002C00#); end STM32_SVD.WWDG;
with Ada.Tags.Generic_Dispatching_Constructor; package generic_dispatch_p is type Iface is interface; function Constructor (I : not null access Integer) return Iface is abstract; function Dispatching_Constructor is new Ada.Tags.Generic_Dispatching_Constructor (T => Iface, Parameters => Integer, Constructor => Constructor); type DT is new Iface with null record; overriding function Constructor (I : not null access Integer) return DT; end;
-- This spec has been automatically generated from STM32WB55x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.MPU is pragma Preelaborate; --------------- -- Registers -- --------------- subtype MPU_TYPER_DREGION_Field is HAL.UInt8; subtype MPU_TYPER_IREGION_Field is HAL.UInt8; -- MPU type register type MPU_TYPER_Register is record -- Read-only. Separate flag SEPARATE_k : Boolean; -- unspecified Reserved_1_7 : HAL.UInt7; -- Read-only. Number of MPU data regions DREGION : MPU_TYPER_DREGION_Field; -- Read-only. Number of MPU instruction regions IREGION : MPU_TYPER_IREGION_Field; -- unspecified Reserved_24_31 : HAL.UInt8; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_TYPER_Register use record SEPARATE_k at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; DREGION at 0 range 8 .. 15; IREGION at 0 range 16 .. 23; Reserved_24_31 at 0 range 24 .. 31; end record; -- MPU control register type MPU_CTRL_Register is record -- Read-only. Enables the MPU ENABLE : Boolean; -- Read-only. Enables the operation of MPU during hard fault HFNMIENA : Boolean; -- Read-only. Enable priviliged software access to default memory map PRIVDEFENA : Boolean; -- unspecified Reserved_3_31 : HAL.UInt29; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_CTRL_Register use record ENABLE at 0 range 0 .. 0; HFNMIENA at 0 range 1 .. 1; PRIVDEFENA at 0 range 2 .. 2; Reserved_3_31 at 0 range 3 .. 31; end record; subtype MPU_RNR_REGION_Field is HAL.UInt8; -- MPU region number register type MPU_RNR_Register is record -- MPU region REGION : MPU_RNR_REGION_Field := 16#0#; -- unspecified Reserved_8_31 : HAL.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_RNR_Register use record REGION at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype MPU_RBAR_REGION_Field is HAL.UInt4; subtype MPU_RBAR_ADDR_Field is HAL.UInt27; -- MPU region base address register type MPU_RBAR_Register is record -- MPU region field REGION : MPU_RBAR_REGION_Field := 16#0#; -- MPU region number valid VALID : Boolean := False; -- Region base address field ADDR : MPU_RBAR_ADDR_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_RBAR_Register use record REGION at 0 range 0 .. 3; VALID at 0 range 4 .. 4; ADDR at 0 range 5 .. 31; end record; subtype MPU_RASR_SIZE_Field is HAL.UInt5; subtype MPU_RASR_SRD_Field is HAL.UInt8; subtype MPU_RASR_TEX_Field is HAL.UInt3; subtype MPU_RASR_AP_Field is HAL.UInt3; -- MPU region attribute and size register type MPU_RASR_Register is record -- Region enable bit. ENABLE : Boolean := False; -- Size of the MPU protection region SIZE : MPU_RASR_SIZE_Field := 16#0#; -- unspecified Reserved_6_7 : HAL.UInt2 := 16#0#; -- Subregion disable bits SRD : MPU_RASR_SRD_Field := 16#0#; -- memory attribute B : Boolean := False; -- memory attribute C : Boolean := False; -- Shareable memory attribute S : Boolean := False; -- memory attribute TEX : MPU_RASR_TEX_Field := 16#0#; -- unspecified Reserved_22_23 : HAL.UInt2 := 16#0#; -- Access permission AP : MPU_RASR_AP_Field := 16#0#; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Instruction access disable bit XN : Boolean := False; -- unspecified Reserved_29_31 : HAL.UInt3 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for MPU_RASR_Register use record ENABLE at 0 range 0 .. 0; SIZE at 0 range 1 .. 5; Reserved_6_7 at 0 range 6 .. 7; SRD at 0 range 8 .. 15; B at 0 range 16 .. 16; C at 0 range 17 .. 17; S at 0 range 18 .. 18; TEX at 0 range 19 .. 21; Reserved_22_23 at 0 range 22 .. 23; AP at 0 range 24 .. 26; Reserved_27_27 at 0 range 27 .. 27; XN at 0 range 28 .. 28; Reserved_29_31 at 0 range 29 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Memory protection unit type MPU_Peripheral is record -- MPU type register MPU_TYPER : aliased MPU_TYPER_Register; -- MPU control register MPU_CTRL : aliased MPU_CTRL_Register; -- MPU region number register MPU_RNR : aliased MPU_RNR_Register; -- MPU region base address register MPU_RBAR : aliased MPU_RBAR_Register; -- MPU region attribute and size register MPU_RASR : aliased MPU_RASR_Register; end record with Volatile; for MPU_Peripheral use record MPU_TYPER at 16#0# range 0 .. 31; MPU_CTRL at 16#4# range 0 .. 31; MPU_RNR at 16#8# range 0 .. 31; MPU_RBAR at 16#C# range 0 .. 31; MPU_RASR at 16#10# range 0 .. 31; end record; -- Memory protection unit MPU_Periph : aliased MPU_Peripheral with Import, Address => System'To_Address (16#E000ED90#); end STM32_SVD.MPU;
-- This spec has been automatically generated from cm7.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; -- Data Watchpoint Trace package Cortex_M_SVD.DWT is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CTRL_POSTPRESET_Field is HAL.UInt4; subtype CTRL_POSTINIT_Field is HAL.UInt4; subtype CTRL_SYNCTAP_Field is HAL.UInt2; subtype CTRL_Reserved_13_15_Field is HAL.UInt3; subtype CTRL_NUMCOMP_Field is HAL.UInt4; -- Control Register type CTRL_Register is record -- enable cycle counter CYCCNTENA : Boolean := False; -- ??? POSTPRESET : CTRL_POSTPRESET_Field := 16#0#; -- ??? POSTINIT : CTRL_POSTINIT_Field := 16#0#; -- ??? CYCTAP : Boolean := False; -- ??? SYNCTAP : CTRL_SYNCTAP_Field := 16#0#; -- enable POSTCNT as timer for PC sample packets PCSAMPLENA : Boolean := False; -- Reserved bits 13..15 Reserved_13_15 : CTRL_Reserved_13_15_Field := 16#0#; -- enable interrupt event tracing EXCTRCENA : Boolean := False; -- enable CPI count event CPIEVTENA : Boolean := False; -- enable interrupt overhead event EXCEVTENA : Boolean := False; -- enable Sleep count event SLEEPEVTENA : Boolean := False; -- enable Load Store Unit (LSU) count event LSUEVTENA : Boolean := False; -- enable Folded instruction count event FOLDEVTENA : Boolean := False; -- enable Cycle count event CYCEVTENA : Boolean := False; -- Read-only. Reserved bit 23 Reserved_23 : Boolean := False; -- No profiling counters NOPRFCNT : Boolean := False; -- No cycle counter NOCYCCNT : Boolean := False; -- No external match signals NOEXTTRIG : Boolean := False; -- No trace sampling and exception tracing NOTRCPKT : Boolean := False; -- Number of comparators NUMCOMP : CTRL_NUMCOMP_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CTRL_Register use record CYCCNTENA at 0 range 0 .. 0; POSTPRESET at 0 range 1 .. 4; POSTINIT at 0 range 5 .. 8; CYCTAP at 0 range 9 .. 9; SYNCTAP at 0 range 10 .. 11; PCSAMPLENA at 0 range 12 .. 12; Reserved_13_15 at 0 range 13 .. 15; EXCTRCENA at 0 range 16 .. 16; CPIEVTENA at 0 range 17 .. 17; EXCEVTENA at 0 range 18 .. 18; SLEEPEVTENA at 0 range 19 .. 19; LSUEVTENA at 0 range 20 .. 20; FOLDEVTENA at 0 range 21 .. 21; CYCEVTENA at 0 range 22 .. 22; Reserved_23 at 0 range 23 .. 23; NOPRFCNT at 0 range 24 .. 24; NOCYCCNT at 0 range 25 .. 25; NOEXTTRIG at 0 range 26 .. 26; NOTRCPKT at 0 range 27 .. 27; NUMCOMP at 0 range 28 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Data Watchpoint Trace type DWT_Peripheral is record -- Control Register CTRL : aliased CTRL_Register; -- Cycle Count Register CYCCNT : aliased HAL.UInt32; -- CPI Count Register CPICNT : aliased HAL.UInt32; -- Exception Overhead Count Register EXCCNT : aliased HAL.UInt32; -- Sleep Count Register SLEEPCNT : aliased HAL.UInt32; -- LSU Count Register LSUCNT : aliased HAL.UInt32; -- Folded-instruction Count Register FOLDCNT : aliased HAL.UInt32; -- Program Counter Sample Register PCSR : aliased HAL.UInt32; -- Comparator Register 0 COMP0 : aliased HAL.UInt32; -- Mask Register 0 MASK0 : aliased HAL.UInt32; -- Function Register 0 FUNCTION0 : aliased HAL.UInt32; -- Reserved 0 RESERVED0 : aliased HAL.UInt32; -- Comparator Register 1 COMP1 : aliased HAL.UInt32; -- Mask Register 1 MASK1 : aliased HAL.UInt32; -- Function Register 1 FUNCTION1 : aliased HAL.UInt32; -- Reserved 1 RESERVED1 : aliased HAL.UInt32; -- Comparator Register 2 COMP2 : aliased HAL.UInt32; -- Mask Register 2 MASK2 : aliased HAL.UInt32; -- Function Register 2 FUNCTION2 : aliased HAL.UInt32; -- Reserved 2 RESERVED2 : aliased HAL.UInt32; -- Comparator Register 3 COMP3 : aliased HAL.UInt32; -- Mask Register 3 MASK3 : aliased HAL.UInt32; -- Function Register 3 FUNCTION3 : aliased HAL.UInt32; -- Lock Access Register LAR : aliased HAL.UInt32; -- Lock Status Register LSR : aliased HAL.UInt32; end record with Volatile; for DWT_Peripheral use record CTRL at 16#0# range 0 .. 31; CYCCNT at 16#4# range 0 .. 31; CPICNT at 16#8# range 0 .. 31; EXCCNT at 16#C# range 0 .. 31; SLEEPCNT at 16#10# range 0 .. 31; LSUCNT at 16#14# range 0 .. 31; FOLDCNT at 16#18# range 0 .. 31; PCSR at 16#1C# range 0 .. 31; COMP0 at 16#20# range 0 .. 31; MASK0 at 16#24# range 0 .. 31; FUNCTION0 at 16#28# range 0 .. 31; RESERVED0 at 16#2C# range 0 .. 31; COMP1 at 16#30# range 0 .. 31; MASK1 at 16#34# range 0 .. 31; FUNCTION1 at 16#38# range 0 .. 31; RESERVED1 at 16#3C# range 0 .. 31; COMP2 at 16#40# range 0 .. 31; MASK2 at 16#44# range 0 .. 31; FUNCTION2 at 16#48# range 0 .. 31; RESERVED2 at 16#4C# range 0 .. 31; COMP3 at 16#50# range 0 .. 31; MASK3 at 16#54# range 0 .. 31; FUNCTION3 at 16#58# range 0 .. 31; LAR at 16#FB0# range 0 .. 31; LSR at 16#FB4# range 0 .. 31; end record; -- Data Watchpoint Trace DWT_Periph : aliased DWT_Peripheral with Import, Address => DWT_Base; end Cortex_M_SVD.DWT;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- B U T I L -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT 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 distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Namet; use Namet; with Output; use Output; with Targparm; use Targparm; package body Butil is ---------------------- -- Is_Internal_Unit -- ---------------------- -- Note: the reason we do not use the Fname package for this function -- is that it would drag too much junk into the binder. function Is_Internal_Unit return Boolean is begin return Is_Predefined_Unit or else (Name_Len > 4 and then (Name_Buffer (1 .. 5) = "gnat%" or else Name_Buffer (1 .. 5) = "gnat.")) or else (OpenVMS_On_Target and then Name_Len > 3 and then (Name_Buffer (1 .. 4) = "dec%" or else Name_Buffer (1 .. 4) = "dec.")); end Is_Internal_Unit; ------------------------ -- Is_Predefined_Unit -- ------------------------ -- Note: the reason we do not use the Fname package for this function -- is that it would drag too much junk into the binder. function Is_Predefined_Unit return Boolean is begin return (Name_Len > 3 and then Name_Buffer (1 .. 4) = "ada.") or else (Name_Len > 6 and then Name_Buffer (1 .. 7) = "system.") or else (Name_Len > 10 and then Name_Buffer (1 .. 11) = "interfaces.") or else (Name_Len > 3 and then Name_Buffer (1 .. 4) = "ada%") or else (Name_Len > 8 and then Name_Buffer (1 .. 9) = "calendar%") or else (Name_Len > 9 and then Name_Buffer (1 .. 10) = "direct_io%") or else (Name_Len > 10 and then Name_Buffer (1 .. 11) = "interfaces%") or else (Name_Len > 13 and then Name_Buffer (1 .. 14) = "io_exceptions%") or else (Name_Len > 12 and then Name_Buffer (1 .. 13) = "machine_code%") or else (Name_Len > 13 and then Name_Buffer (1 .. 14) = "sequential_io%") or else (Name_Len > 6 and then Name_Buffer (1 .. 7) = "system%") or else (Name_Len > 7 and then Name_Buffer (1 .. 8) = "text_io%") or else (Name_Len > 20 and then Name_Buffer (1 .. 21) = "unchecked_conversion%") or else (Name_Len > 22 and then Name_Buffer (1 .. 23) = "unchecked_deallocation%") or else (Name_Len > 4 and then Name_Buffer (1 .. 5) = "gnat%") or else (Name_Len > 4 and then Name_Buffer (1 .. 5) = "gnat."); end Is_Predefined_Unit; ---------------- -- Uname_Less -- ---------------- function Uname_Less (U1, U2 : Unit_Name_Type) return Boolean is begin Get_Name_String (U1); declare U1_Name : constant String (1 .. Name_Len) := Name_Buffer (1 .. Name_Len); Min_Length : Natural; begin Get_Name_String (U2); if Name_Len < U1_Name'Last then Min_Length := Name_Len; else Min_Length := U1_Name'Last; end if; for I in 1 .. Min_Length loop if U1_Name (I) > Name_Buffer (I) then return False; elsif U1_Name (I) < Name_Buffer (I) then return True; end if; end loop; return U1_Name'Last < Name_Len; end; end Uname_Less; --------------------- -- Write_Unit_Name -- --------------------- procedure Write_Unit_Name (U : Unit_Name_Type) is begin Get_Name_String (U); Write_Str (Name_Buffer (1 .. Name_Len - 2)); if Name_Buffer (Name_Len) = 's' then Write_Str (" (spec)"); else Write_Str (" (body)"); end if; Name_Len := Name_Len + 5; end Write_Unit_Name; end Butil;
------------------------------------------------------------------------ -- Copyright (C) 2005-2020 by <ada.rocks@jlfencey.com> -- -- -- -- This work is free. You can redistribute it and/or modify it under -- -- the terms of the Do What The Fuck You Want To Public License, -- -- Version 2, as published by Sam Hocevar. See the LICENSE file for -- -- more details. -- ------------------------------------------------------------------------ pragma License (Unrestricted); ------------------------------------------------------------------------ -- AMD Élan(tm) SC 520 embedded microprocessor -- -- MMCR -> General Purpose Bus Controller Registers -- -- -- -- reference: User's Manual Chapter 13, -- -- Register Set Manual Chapter 10 -- ------------------------------------------------------------------------ with Elan520.Basic_Types; package Elan520.GP_Bus_Controller_Registers is -- # of available chip select signals type Chip_Selects is range 0 .. 7; -- type for signal offset, pulse width and recovery time type Cycle_Length is range 1 .. 256; -- biased representation for Cycle_Length'Size use 8; -- chipselect qualifier type CS_Qualifier is (None, Write_Strobes, Read_Strobes, Both_Strobes); for CS_Qualifier use (None => 2#00#, Write_Strobes => 2#01#, Read_Strobes => 2#10#, Both_Strobes => 2#11#); for CS_Qualifier'Size use 2; -- (default) data width for chipselects type CS_Data_Width is (Byte, Word); for CS_Data_Width use (Byte => 2#0#, Word => 2#1#); for CS_Data_Width'Size use 1; --------------------------------------------------------------------- -- GP Echo Mode (GPECHO) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C00h -- --------------------------------------------------------------------- MMCR_OFFSET_GP_ECHO_MODE : constant := 16#C00#; GP_ECHO_MODE_SIZE : constant := 8; type GP_Echo_Mode is record GP_Echo : Basic_Types.Positive_Bit; end record; for GP_Echo_Mode use record GP_Echo at 0 range 0 .. 0; -- bits 1 .. 7 are reserved end record; for GP_Echo_Mode'Size use GP_ECHO_MODE_SIZE; --------------------------------------------------------------------- -- GP Chip Select Data Width (GPCSDW) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C01h -- --------------------------------------------------------------------- MMCR_OFFSET_GP_CS_DATA_WIDTH : constant := 16#C01#; GP_CS_DATA_WIDTH_SIZE : constant := 8; type GP_CS_Data_Width is array (Chip_Selects) of CS_Data_Width; pragma Pack (GP_CS_Data_Width); for GP_CS_Data_Width'Size use GP_CS_DATA_WIDTH_SIZE; --------------------------------------------------------------------- -- GP Chip Select Qualification (GPCSQUAL) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C02h -- --------------------------------------------------------------------- MMCR_OFFSET_GP_CS_QUALIFICATION : constant := 16#C02#; GP_CS_QUALIFICATION_SIZE : constant := 16; type GP_CS_Qualification is array (Chip_Selects) of CS_Qualifier; pragma Pack (GP_CS_Qualification); for GP_CS_Qualification'Size use GP_CS_QUALIFICATION_SIZE; --------------------------------------------------------------------- -- GP Chip Select Recovery Time (GPCSRT) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C08h -- -- -- -- GP Chip Select Pulse Width (GPCSPW) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C09h -- -- -- -- GP Chip Select Offset (GPCSOFF) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C0Ah -- -- -- -- GP Read Pulse Width (GPRDW) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C0Bh -- -- -- -- GP Read Offset (GPRDOFF) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C0Ch -- -- -- -- GP Write Pulse Width (GPWRW) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C0Dh -- -- -- -- GP Write Offset (GPWROFF) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C0Eh -- -- -- -- GPALE Pulse Width (GPALEW) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C0Fh -- -- -- -- GPALE Offset (GPALEOFF) -- -- Memory Mapped, Read/Write -- -- MMCR Offset C10h -- --------------------------------------------------------------------- MMCR_OFFSET_GP_CS_RECOVERY_TIME : constant := 16#C08#; MMCR_OFFSET_GP_CS_PULSE_WIDTH : constant := 16#C09#; MMCR_OFFSET_GP_CS_OFFSET : constant := 16#C0A#; MMCR_OFFSET_GP_READ_PULSE_WIDTH : constant := 16#C0B#; MMCR_OFFSET_GP_READ_OFFSET : constant := 16#C0C#; MMCR_OFFSET_GP_WRITE_PULSE_WIDTH : constant := 16#C0D#; MMCR_OFFSET_GP_WRITE_OFFSET : constant := 16#C0E#; MMCR_OFFSET_GP_ALE_PULSE_WIDTH : constant := 16#C0F#; MMCR_OFFSET_GP_ALE_OFFSET : constant := 16#C10#; subtype GP_CS_Recovery_Time is Cycle_Length; subtype GP_CS_Pulse_Width is Cycle_Length; subtype GP_CS_Offset is Cycle_Length; subtype GP_Read_Pulse_Width is Cycle_Length; subtype GP_Read_Offset is Cycle_Length; subtype GP_Write_Pulse_Width is Cycle_Length; subtype GP_Write_Offset is Cycle_Length; subtype GP_ALE_Pulse_Width is Cycle_Length; subtype GP_ALE_Offset is Cycle_Length; end Elan520.GP_Bus_Controller_Registers;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- I N T E R F A C E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2002-2013, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- -- apply solely to the implementation dependent sections of this file. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ pragma Compiler_Unit_Warning; package Interfaces is pragma Pure; -- All identifiers in this unit are implementation defined pragma Implementation_Defined; type Integer_8 is range -2 ** 7 .. 2 ** 7 - 1; for Integer_8'Size use 8; type Integer_16 is range -2 ** 15 .. 2 ** 15 - 1; for Integer_16'Size use 16; type Integer_32 is range -2 ** 31 .. 2 ** 31 - 1; for Integer_32'Size use 32; type Integer_64 is range -2 ** 63 .. 2 ** 63 - 1; for Integer_64'Size use 64; type Unsigned_8 is mod 2 ** 8; for Unsigned_8'Size use 8; type Unsigned_16 is mod 2 ** 16; for Unsigned_16'Size use 16; type Unsigned_32 is mod 2 ** 32; for Unsigned_32'Size use 32; type Unsigned_64 is mod 2 ** 64; for Unsigned_64'Size use 64; function Shift_Left (Value : Unsigned_8; Amount : Natural) return Unsigned_8; function Shift_Right (Value : Unsigned_8; Amount : Natural) return Unsigned_8; function Shift_Right_Arithmetic (Value : Unsigned_8; Amount : Natural) return Unsigned_8; function Rotate_Left (Value : Unsigned_8; Amount : Natural) return Unsigned_8; function Rotate_Right (Value : Unsigned_8; Amount : Natural) return Unsigned_8; function Shift_Left (Value : Unsigned_16; Amount : Natural) return Unsigned_16; function Shift_Right (Value : Unsigned_16; Amount : Natural) return Unsigned_16; function Shift_Right_Arithmetic (Value : Unsigned_16; Amount : Natural) return Unsigned_16; function Rotate_Left (Value : Unsigned_16; Amount : Natural) return Unsigned_16; function Rotate_Right (Value : Unsigned_16; Amount : Natural) return Unsigned_16; function Shift_Left (Value : Unsigned_32; Amount : Natural) return Unsigned_32; function Shift_Right (Value : Unsigned_32; Amount : Natural) return Unsigned_32; function Shift_Right_Arithmetic (Value : Unsigned_32; Amount : Natural) return Unsigned_32; function Rotate_Left (Value : Unsigned_32; Amount : Natural) return Unsigned_32; function Rotate_Right (Value : Unsigned_32; Amount : Natural) return Unsigned_32; function Shift_Left (Value : Unsigned_64; Amount : Natural) return Unsigned_64; function Shift_Right (Value : Unsigned_64; Amount : Natural) return Unsigned_64; function Shift_Right_Arithmetic (Value : Unsigned_64; Amount : Natural) return Unsigned_64; function Rotate_Left (Value : Unsigned_64; Amount : Natural) return Unsigned_64; function Rotate_Right (Value : Unsigned_64; Amount : Natural) return Unsigned_64; pragma Import (Intrinsic, Shift_Left); pragma Import (Intrinsic, Shift_Right); pragma Import (Intrinsic, Shift_Right_Arithmetic); pragma Import (Intrinsic, Rotate_Left); pragma Import (Intrinsic, Rotate_Right); -- IEEE Floating point types. Note that the form of these definitions -- ensures that the work on VMS, even if the standard library is compiled -- using a Float_Representation pragma for Vax_Float. pragma Warnings (Off); -- Turn off warnings for targets not providing IEEE floating-point types type IEEE_Float_32 is digits 6; pragma Float_Representation (IEEE_Float, IEEE_Float_32); for IEEE_Float_32'Size use 32; type IEEE_Float_64 is digits 15; pragma Float_Representation (IEEE_Float, IEEE_Float_64); for IEEE_Float_64'Size use 64; -- If there is an IEEE extended float available on the machine, we assume -- that it is available as Long_Long_Float. -- Note: it is harmless, and explicitly permitted, to include additional -- types in interfaces, so it is not wrong to have IEEE_Extended_Float -- defined even if the extended format is not available. type IEEE_Extended_Float is new Long_Long_Float; end Interfaces;
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="14"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>p_source_files_sr</name> <ret_bitwidth>64</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>p_read</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <direction>0</direction> <if_type>0</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_2"> <Value> <Obj> <type>0</type> <id>2</id> <name>p_read_1</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>6</item> <item>7</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> </item> <item class_id_reference="9" object_id="_3"> <Value> <Obj> <type>0</type> <id>3</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>8</item> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> </item> </nodes> <consts class_id="11" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </consts> <blocks class_id="12" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="13" tracking_level="1" version="0" object_id="_4"> <Obj> <type>3</type> <id>4</id> <name>__../source_files/sr</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>2</item> <item>3</item> </node_objs> </item> </blocks> <edges class_id="14" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="15" tracking_level="1" version="0" object_id="_5"> <id>7</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>2</sink_obj> </item> <item class_id_reference="15" object_id="_6"> <id>8</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>3</sink_obj> </item> </edges> </cdfg> <cdfg_regions class_id="16" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="17" tracking_level="1" version="0" object_id="_7"> <mId>1</mId> <mTag>__../source_files/sr</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>4</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>-1</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="19" tracking_level="1" version="0" object_id="_8"> <states class_id="20" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="21" tracking_level="1" version="0" object_id="_9"> <id>1</id> <operations class_id="22" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="23" tracking_level="1" version="0" object_id="_10"> <id>2</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="23" object_id="_11"> <id>3</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="24" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="26" tracking_level="0" version="0"> <count>2</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>2</first> <second class_id="28" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>3</first> <second> <first>0</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="29" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="30" tracking_level="0" version="0"> <first>4</first> <second class_id="31" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> </bblk_ent_exit> <regions class_id="32" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="33" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first>4</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>0</count> <item_version>0</item_version> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>1</count> <item_version>0</item_version> <item class_id="37" tracking_level="0" version="0"> <first>p_read_1_read_fu_4</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>0</count> <item_version>0</item_version> </return_ports> <dp_mem_port_nodes class_id="38" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_mem_port_nodes> <dp_reg_nodes> <count>0</count> <item_version>0</item_version> </dp_reg_nodes> <dp_regname_nodes> <count>0</count> <item_version>0</item_version> </dp_regname_nodes> <dp_reg_phi> <count>0</count> <item_version>0</item_version> </dp_reg_phi> <dp_regname_phi> <count>0</count> <item_version>0</item_version> </dp_regname_phi> <dp_port_io_nodes class_id="39" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="40" tracking_level="0" version="0"> <first>p_read</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="41" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Localization, Internationalization, Globalization for Ada -- -- -- -- Tools Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2015, Vadim Godunko <vgodunko@gmail.com> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ with Ada.Wide_Wide_Text_IO; package body UAFLEX.Nodes is -------------- -- Add_Rule -- -------------- procedure Add_Rule (RegExp : League.Strings.Universal_String; Action : League.Strings.Universal_String; Line : Positive) is procedure Add (Name : League.Strings.Universal_String; Condition : in out Start_Condition); procedure Add_Inclusive (Name : League.Strings.Universal_String; Condition : in out Start_Condition); procedure Each_Inclusive (Cursor : Start_Condition_Maps.Cursor); function Get_Action (Text : League.Strings.Universal_String) return Positive; Text : League.Strings.Universal_String := RegExp; To : constant Natural := Text.Index ('>'); Index : Positive; --------- -- Add -- --------- procedure Add (Name : League.Strings.Universal_String; Condition : in out Start_Condition) is pragma Unreferenced (Name); begin Condition.Rules.Append (Index); end Add; ------------------- -- Add_Inclusive -- ------------------- procedure Add_Inclusive (Name : League.Strings.Universal_String; Condition : in out Start_Condition) is begin if not Condition.Exclusive then Add (Name, Condition); end if; end Add_Inclusive; -------------------- -- Each_Inclusive -- -------------------- procedure Each_Inclusive (Cursor : Start_Condition_Maps.Cursor) is begin Conditions.Update_Element (Cursor, Add_Inclusive'Access); end Each_Inclusive; -------------------- -- Get_Action -- -------------------- function Get_Action (Text : League.Strings.Universal_String) return Positive is begin for J in 1 .. Actions.Length loop if Actions.Element (J) = Text then return J; end if; end loop; Actions.Append (Action); return Actions.Length; end Get_Action; begin Indexes.Append (Get_Action (Action)); Index := Rules.Length + 1; if Text.Starts_With ("<") then declare Conditions : constant League.Strings.Universal_String := Text.Slice (2, To - 1); List : constant League.String_Vectors.Universal_String_Vector := Conditions.Split (','); begin for J in 1 .. List.Length loop declare Condition : constant League.Strings.Universal_String := List.Element (J); Cursor : constant Start_Condition_Maps.Cursor := Nodes.Conditions.Find (Condition); begin if Start_Condition_Maps.Has_Element (Cursor) then Nodes.Conditions.Update_Element (Cursor, Add'Access); else Ada.Wide_Wide_Text_IO.Put_Line ("Line:" & Natural'Wide_Wide_Image (Line) & " " & "No such start condition: " & Condition.To_Wide_Wide_String); Success := False; end if; end; end loop; Text.Slice (To + 1, Text.Length); end; else Conditions.Iterate (Each_Inclusive'Access); end if; Rules.Append (Text); Lines.Append (Line); end Add_Rule; -------------------------- -- Add_Start_Conditions -- -------------------------- procedure Add_Start_Conditions (List : League.String_Vectors.Universal_String_Vector; Exclusive : Boolean) is begin for J in 1 .. List.Length loop Conditions.Insert (List.Element (J), (Exclusive, others => <>)); end loop; end Add_Start_Conditions; function To_Node (Value : League.Strings.Universal_String) return Node is begin return (Text, Value); end To_Node; function To_Action (Value : League.Strings.Universal_String) return Node is begin return To_Node (Value.Slice (2, Value.Length - 1)); end To_Action; end UAFLEX.Nodes;
-- CD5014X.ADA -- Grant of Unlimited Rights -- -- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687, -- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained -- unlimited rights in the software and documentation contained herein. -- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making -- this public release, the Government intends to confer upon all -- recipients unlimited rights equal to those held by the Government. -- These rights include rights to use, duplicate, release or disclose the -- released technical data and computer software in whole or in part, in -- any manner and for any purpose whatsoever, and to have or permit others -- to do so. -- -- DISCLAIMER -- -- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR -- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED -- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE -- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE -- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A -- PARTICULAR PURPOSE OF SAID MATERIAL. --* -- OBJECTIVE: -- CHECK THAT AN ADDRESS CLAUSE CAN BE GIVEN IN THE PRIVATE PART -- OF A GENERIC PACKAGE SPECIFICATION FOR A VARIABLE OF A FORMAL -- ARRAY TYPE, WHERE THE VARIABLE IS DECLARED IN THE VISIBLE PART -- OF THE SPECIFICATION. -- HISTORY: -- BCB 10/08/87 CREATED ORIGINAL TEST. -- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'. WITH SYSTEM; USE SYSTEM; WITH SPPRT13; USE SPPRT13; WITH REPORT; USE REPORT; WITH TEXT_IO; USE TEXT_IO; PROCEDURE CD5014X IS BEGIN TEST ("CD5014X", " AN ADDRESS CLAUSE CAN BE GIVEN " & "IN THE PRIVATE PART OF A GENERIC PACKAGE " & "SPECIFICATION FOR A VARIABLE OF A FORMAL " & "ARRAY TYPE, WHERE THE VARIABLE IS DECLARED " & "IN THE VISIBLE PART OF THE SPECIFICATION"); DECLARE TYPE COLOR IS (RED,BLUE,GREEN); TYPE COLOR_TABLE IS ARRAY (COLOR) OF INTEGER; GENERIC TYPE INDEX IS (<>); TYPE FORM_ARRAY_TYPE IS ARRAY (INDEX) OF INTEGER; PACKAGE PKG IS FORM_ARRAY_OBJ1 : FORM_ARRAY_TYPE := (1,2,3); PRIVATE FOR FORM_ARRAY_OBJ1 USE AT VARIABLE_ADDRESS; END PKG; PACKAGE BODY PKG IS BEGIN IF EQUAL(3,3) THEN FORM_ARRAY_OBJ1 := (10,20,30); END IF; IF FORM_ARRAY_OBJ1 /= (10,20,30) THEN FAILED ("INCORRECT VALUE FOR FORMAL ARRAY VARIABLE"); END IF; IF FORM_ARRAY_OBJ1'ADDRESS /= VARIABLE_ADDRESS THEN FAILED ("INCORRECT ADDRESS FOR FORMAL ARRAY " & "VARIABLE"); END IF; END PKG; PACKAGE PACK IS NEW PKG(INDEX => COLOR, FORM_ARRAY_TYPE => COLOR_TABLE); BEGIN NULL; END; RESULT; END CD5014X;
with Text_IO; use Text_IO; procedure example is begin -- Hello world in ADA Put_Line("Hello world"); end example;
-- { dg-do run } -- { dg-options "-O3 -flto" { target lto } } with Lto21_Pkg1; with Lto21_Pkg2; use Lto21_Pkg2; procedure Lto21 is begin Proc; end;
----------------------------------------------------------------------- -- asf-lifecycles-validation -- Validation phase -- Copyright (C) 2010, 2019 Stephane Carrez -- Written by Stephane Carrez (Stephane.Carrez@gmail.com) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Exceptions; with ASF.Components.Root; with ASF.Components.Base; with Util.Log.Loggers; -- The <b>ASF.Lifecycles.Validation</b> package defines the behavior -- of the validation phase. package body ASF.Lifecycles.Validation is use Ada.Exceptions; use Util.Log; -- The logger Log : constant Loggers.Logger := Loggers.Create ("ASF.Lifecycles.Validation"); -- ------------------------------ -- Execute the validation phase. -- ------------------------------ overriding procedure Execute (Controller : in Validation_Controller; Context : in out ASF.Contexts.Faces.Faces_Context'Class) is pragma Unreferenced (Controller); View : constant Components.Root.UIViewRoot := Context.Get_View_Root; Root : constant access Components.Base.UIComponent'Class := Components.Root.Get_Root (View); begin Root.Process_Validators (Context); exception when E : others => Log.Error ("Error when running the validation phase {0}: {1}: {2}", "?", Exception_Name (E), Exception_Message (E)); raise; end Execute; end ASF.Lifecycles.Validation;
-- part of OpenGLAda, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "COPYING" generic type Base (<>) is new Texture_Proxy with private; package GL.Objects.Textures.With_2D_Loader is pragma Preelaborate; type Target is new Base with null record; procedure Load_Empty_Texture (Object : Target; Level : Mipmap_Level; Internal_Format : Pixels.Internal_Format; Width, Height : Types.Size); procedure Storage (Object : Target; Number_Of_Levels : Types.Size; Internal_Format : Pixels.Internal_Format; Width, Height : Types.Size); type Fillable_Target is new Target with null record; procedure Load_From_Data (Object : Fillable_Target; Level : Mipmap_Level; Internal_Format : Pixels.Internal_Format; Width, Height : Types.Size; Source_Format : Pixels.Data_Format; Source_Type : Pixels.Data_Type; Source : Image_Source); procedure Load_Sub_Image_From_Data (Object : Fillable_Target; Level : Mipmap_Level; X_Offset, Y_Offset : Int; Width, Height : Size; Format : Pixels.Data_Format; Data_Type : Pixels.Data_Type; Source : Image_Source); procedure Load_Compressed (Object : Fillable_Target; Level : Mipmap_Level; Internal_Format : Pixels.Internal_Format; Width, Height, Image_Size : Types.Size; Source : Image_Source); end GL.Objects.Textures.With_2D_Loader;