Datasets:
QueenieFi
/
CodeText_dataset

Dataset card Data Studio Files
xet
 Community
1
CombinedText
stringlengths
4
3.42M
------------------------------------------------------------------------------ -- -- -- 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_Literal_Strings is ------------------- -- Enter_Element -- ------------------- overriding procedure Enter_Element (Self : not null access constant UML_Literal_String_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_Literal_String (AMF.UML.Literal_Strings.UML_Literal_String_Access (Self), Control); end if; end Enter_Element; ------------------- -- Leave_Element -- ------------------- overriding procedure Leave_Element (Self : not null access constant UML_Literal_String_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_Literal_String (AMF.UML.Literal_Strings.UML_Literal_String_Access (Self), Control); end if; end Leave_Element; ------------------- -- Visit_Element -- ------------------- overriding procedure Visit_Element (Self : not null access constant UML_Literal_String_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_Literal_String (Visitor, AMF.UML.Literal_Strings.UML_Literal_String_Access (Self), Control); end if; end Visit_Element; --------------- -- Get_Value -- --------------- overriding function Get_Value (Self : not null access constant UML_Literal_String_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_Value (Self.Element); begin if Aux = null then return (Is_Empty => True); else return (False, League.Strings.Internals.Create (Aux)); end if; end; end Get_Value; --------------- -- Set_Value -- --------------- overriding procedure Set_Value (Self : not null access UML_Literal_String_Proxy; To : AMF.Optional_String) is begin if To.Is_Empty then AMF.Internals.Tables.UML_Attributes.Internal_Set_Value (Self.Element, null); else AMF.Internals.Tables.UML_Attributes.Internal_Set_Value (Self.Element, League.Strings.Internals.Internal (To.Value)); end if; end Set_Value; -------------- -- Get_Type -- -------------- overriding function Get_Type (Self : not null access constant UML_Literal_String_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_Literal_String_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; --------------------------- -- Get_Client_Dependency -- --------------------------- overriding function Get_Client_Dependency (Self : not null access constant UML_Literal_String_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_Literal_String_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_Literal_String_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_Literal_String_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_Literal_String_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_Owning_Template_Parameter -- ----------------------------------- overriding function Get_Owning_Template_Parameter (Self : not null access constant UML_Literal_String_Proxy) return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is begin return AMF.UML.Template_Parameters.UML_Template_Parameter_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Owning_Template_Parameter (Self.Element))); end Get_Owning_Template_Parameter; ----------------------------------- -- Set_Owning_Template_Parameter -- ----------------------------------- overriding procedure Set_Owning_Template_Parameter (Self : not null access UML_Literal_String_Proxy; To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Owning_Template_Parameter (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Owning_Template_Parameter; ---------------------------- -- Get_Template_Parameter -- ---------------------------- overriding function Get_Template_Parameter (Self : not null access constant UML_Literal_String_Proxy) return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is begin return AMF.UML.Template_Parameters.UML_Template_Parameter_Access (AMF.Internals.Helpers.To_Element (AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Parameter (Self.Element))); end Get_Template_Parameter; ---------------------------- -- Set_Template_Parameter -- ---------------------------- overriding procedure Set_Template_Parameter (Self : not null access UML_Literal_String_Proxy; To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is begin AMF.Internals.Tables.UML_Attributes.Internal_Set_Template_Parameter (Self.Element, AMF.Internals.Helpers.To_Element (AMF.Elements.Element_Access (To))); end Set_Template_Parameter; ------------------- -- Is_Computable -- ------------------- overriding function Is_Computable (Self : not null access constant UML_Literal_String_Proxy) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Computable unimplemented"); raise Program_Error with "Unimplemented procedure UML_Literal_String_Proxy.Is_Computable"; return Is_Computable (Self); end Is_Computable; ------------------ -- String_Value -- ------------------ overriding function String_Value (Self : not null access constant UML_Literal_String_Proxy) return League.Strings.Universal_String is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "String_Value unimplemented"); raise Program_Error with "Unimplemented procedure UML_Literal_String_Proxy.String_Value"; return String_Value (Self); end String_Value; ------------------------ -- Is_Compatible_With -- ------------------------ overriding function Is_Compatible_With (Self : not null access constant UML_Literal_String_Proxy; P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Compatible_With unimplemented"); raise Program_Error with "Unimplemented procedure UML_Literal_String_Proxy.Is_Compatible_With"; return Is_Compatible_With (Self, P); end Is_Compatible_With; ------------------ -- String_Value -- ------------------ overriding function String_Value (Self : not null access constant UML_Literal_String_Proxy) return AMF.Optional_String is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "String_Value unimplemented"); raise Program_Error with "Unimplemented procedure UML_Literal_String_Proxy.String_Value"; return String_Value (Self); end String_Value; ------------------------- -- All_Owning_Packages -- ------------------------- overriding function All_Owning_Packages (Self : not null access constant UML_Literal_String_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_Literal_String_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_Literal_String_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_Literal_String_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_Literal_String_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_Literal_String_Proxy.Namespace"; return Namespace (Self); end Namespace; --------------------------- -- Is_Template_Parameter -- --------------------------- overriding function Is_Template_Parameter (Self : not null access constant UML_Literal_String_Proxy) return Boolean is begin -- Generated stub: replace with real body! pragma Compile_Time_Warning (Standard.True, "Is_Template_Parameter unimplemented"); raise Program_Error with "Unimplemented procedure UML_Literal_String_Proxy.Is_Template_Parameter"; return Is_Template_Parameter (Self); end Is_Template_Parameter; end AMF.Internals.UML_Literal_Strings;
------------------------------------------------------------------------------ -- -- -- ASIS-for-GNAT IMPLEMENTATION COMPONENTS -- -- -- -- A S I S . C O M P I L A T I O N _ U N I T S . R E L A T I O N S -- -- -- -- B o d y -- -- -- -- Copyright (c) 1995-2006, Free Software Foundation, Inc. -- -- -- -- ASIS-for-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 -- -- Software Foundation; either version 2, or (at your option) any later -- -- version. ASIS-for-GNAT is distributed in the hope that it will be use- -- -- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- -- -- CHANTABILITY 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 ASIS-for-GNAT; see file -- -- COPYING. If not, write to the Free Software Foundation, 51 Franklin -- -- Street, Fifth Floor, Boston, MA 02110-1301, USA. -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the -- -- Software Engineering Laboratory of the Swiss Federal Institute of -- -- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the -- -- Scientific Research Computer Center of Moscow State University (SRCC -- -- MSU), Russia, with funding partially provided by grants from the Swiss -- -- National Science Foundation and the Swiss Academy of Engineering -- -- Sciences. ASIS-for-GNAT is now maintained by AdaCore -- -- (http://www.adacore.com). -- -- -- ------------------------------------------------------------------------------ with Asis.Errors; use Asis.Errors; with Asis.Exceptions; use Asis.Exceptions; with Asis.Extensions; use Asis.Extensions; with Asis.Set_Get; use Asis.Set_Get; with A4G.Contt.Dp; use A4G.Contt.Dp; with A4G.Vcheck; use A4G.Vcheck; package body Asis.Compilation_Units.Relations is Package_Name : constant String := "Asis.Compilation_Units.Relations."; ----------------------- -- Elaboration_Order -- ----------------------- -- NOT IMPLEMENTED -- function Elaboration_Order (Compilation_Units : Asis.Compilation_Unit_List; The_Context : Asis.Context) return Relationship is begin Check_Validity (The_Context, Package_Name & "Semantic_Dependence_Order"); if Is_Nil (Compilation_Units) then return Nil_Relationship; end if; Not_Implemented_Yet (Diagnosis => Package_Name & "Semantic_Dependence_Order"); -- ASIS_Failed is raised, Not_Implemented_Error status is setted return Nil_Relationship; -- to make the code syntactically correct exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Semantic_Dependence_Order"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Semantic_Dependence_Order", Ex => Ex); end Elaboration_Order; ------------------------------- -- Semantic_Dependence_Order -- ------------------------------- -- PARTIALLY IMPLEMENTED -- function Semantic_Dependence_Order (Compilation_Units : Asis.Compilation_Unit_List; Dependent_Units : Asis.Compilation_Unit_List; The_Context : Asis.Context; Relation : Asis.Relation_Kinds) return Relationship is Res_Cont_Id : Context_Id; Arg_Kind : Asis.Unit_Kinds; Result_List : Compilation_Unit_List_Access; Missing_List : Compilation_Unit_List_Access; Missing_Len : ASIS_Natural := 0; begin Check_Validity (The_Context, Package_Name & "Semantic_Dependence_Order"); Res_Cont_Id := Get_Cont_Id (The_Context); -- The current implementation limitation is that all the units from -- Compilation_Units list and from Dependent_Units should be from -- The_Context for I in Compilation_Units'Range loop Check_Validity (Compilation_Units (I), Package_Name & "Semantic_Dependence_Order"); Arg_Kind := Kind (Compilation_Units (I)); if Arg_Kind = Not_A_Unit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body or else Arg_Kind = A_Configuration_Compilation then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Semantic_Dependence_Order"); end if; if Res_Cont_Id /= Encl_Cont_Id (Compilation_Units (I)) then Not_Implemented_Yet (Diagnosis => Package_Name & "Semantic_Dependence_Order (multi-context processing"); end if; end loop; for I in Dependent_Units'Range loop Check_Validity (Dependent_Units (I), Package_Name & "Semantic_Dependence_Order"); Arg_Kind := Kind (Dependent_Units (I)); if Arg_Kind = Not_A_Unit or else Arg_Kind = A_Nonexistent_Declaration or else Arg_Kind = A_Nonexistent_Body or else Arg_Kind = A_Configuration_Compilation then Raise_ASIS_Inappropriate_Compilation_Unit (Diagnosis => Package_Name & "Semantic_Dependence_Order"); end if; if Res_Cont_Id /= Encl_Cont_Id (Dependent_Units (I)) then Not_Implemented_Yet (Diagnosis => Package_Name & "Semantic_Dependence_Order (multi-context processing"); end if; end loop; if Is_Nil (Compilation_Units) then return Nil_Relationship; end if; case Relation is when Ancestors => Set_All_Ancestors (Compilation_Units, Result_List); when Descendants => Set_All_Descendants (Compilation_Units, Result_List); when Supporters => Set_All_Supporters (Compilation_Units, Result_List); when Dependents => Set_All_Dependents (Compilation_Units, Dependent_Units, Result_List); when Family => Set_All_Families (Compilation_Units, Result_List); when Needed_Units => Set_All_Needed_Units (Compilation_Units, Result_List, Missing_List); end case; if Missing_List /= null then Missing_Len := Missing_List'Length; end if; declare Result : Relationship (Consistent_Length => Result_List'Length, Inconsistent_Length => 0, Missing_Length => Missing_Len, Circular_Length => 0); begin Result.Consistent := Result_List.all; if Missing_List /= null then Result.Missing := Missing_List.all; end if; Free (Result_List); Free (Missing_List); return Result; end; exception when ASIS_Inappropriate_Context => raise; when ASIS_Failed => if Status_Indicator = Unhandled_Exception_Error then Add_Call_Information (Outer_Call => Package_Name & "Semantic_Dependence_Order"); end if; raise; when Ex : others => Report_ASIS_Bug (Query_Name => Package_Name & "Semantic_Dependence_Order", Ex => Ex); end Semantic_Dependence_Order; end Asis.Compilation_Units.Relations;
-- SPDX-License-Identifier: Apache-2.0 -- -- Copyright (c) 2017 onox <denkpadje@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. private with GL.Fences; generic type Index_Type is mod <>; Maximum_Wait : Duration := 0.010; package Orka.Rendering.Fences is pragma Preelaborate; type Buffer_Fence is tagged private; type Fence_Status is (Not_Initialized, Signaled, Not_Signaled); function Create_Buffer_Fence return Buffer_Fence; procedure Prepare_Index (Object : in out Buffer_Fence; Status : out Fence_Status); -- Perform a client wait sync for the fence corresponding to the -- current index procedure Advance_Index (Object : in out Buffer_Fence); -- Set a fence for the corresponding index and then increment it private type Fence_Array is array (Index_Type) of GL.Fences.Fence; type Buffer_Fence is tagged record Fences : Fence_Array; Index : Index_Type; end record; end Orka.Rendering.Fences;
------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- ncurses -- -- -- -- B O D Y -- -- -- ------------------------------------------------------------------------------ -- Copyright 2020 Thomas E. Dickey -- -- Copyright 2000 Free Software Foundation, Inc. -- -- -- -- 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, distribute with modifications, 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 ABOVE 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. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Eugene V. Melaragno <aldomel@ix.netcom.com> 2000 -- Version Control -- $Revision: 1.2 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ procedure ncurses2.color_test;
-- { dg-do compile } with Ada.Text_IO; use Ada.Text_IO; procedure Warn11 is type My_Integer is new Integer range 1 .. 10; for My_Integer'Size use 65; -- { dg-warning "unused" } type My_Integer2 is new Integer range 1 .. 10; for My_Integer2'Size use 129; -- { dg-warning "unused" } begin Put_Line ("MB'Size is " & Natural'Image (My_Integer'Size)); Put_Line ("MB'Size is " & Natural'Image (My_Integer2'Size)); end;
-------------------------------------------------------------------------------- -- Copyright (c) 2013, Felix Krause <contact@flyx.org> -- -- Permission to use, copy, modify, and/or distribute this software for any -- purpose with or without fee is hereby granted, provided that the above -- copyright notice and this permission notice appear in all copies. -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -------------------------------------------------------------------------------- package CL.Enumerations.CL_GL is type GL_Texture_Info is (Target, Level); for GL_Texture_Info use (Target => 16#2004#, Level => 16#2005#); for GL_Texture_Info'Size use UInt'Size; end CL.Enumerations.CL_GL;
-- This package was generated by the Ada_Drivers_Library project wizard script package ADL_Config is Vendor : constant String := "STMicro"; -- From board definition Max_Mount_Points : constant := 2; -- From default value Max_Mount_Name_Length : constant := 128; -- From default value Runtime_Profile : constant String := "ravenscar-full"; -- From command line Device_Name : constant String := "STM32F429ZITx"; -- From board definition Device_Family : constant String := "STM32F4"; -- From board definition Has_Ravenscar_SFP_Runtime : constant String := "True"; -- From board definition Runtime_Name : constant String := "ravenscar-full-stm32f429disco"; -- From default value Has_Ravenscar_Full_Runtime : constant String := "True"; -- From board definition CPU_Core : constant String := "ARM Cortex-M4F"; -- From mcu definition Board : constant String := "STM32F429_Discovery"; -- From command line Has_ZFP_Runtime : constant String := "False"; -- From board definition Number_Of_Interrupts : constant := 0; -- From default value High_Speed_External_Clock : constant := 8000000; -- From board definition Use_Startup_Gen : constant Boolean := False; -- From command line Max_Path_Length : constant := 1024; -- From default value Runtime_Name_Suffix : constant String := "stm32f429disco"; -- From board definition Architecture : constant String := "ARM"; -- From board definition end ADL_Config;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . S T R I N G S . U N B O U N D E D . H A S H -- -- -- -- B o d y -- -- -- -- Copyright (C) 2004-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. -- -- -- -- 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/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ with System.String_Hash; function Ada.Strings.Unbounded.Hash (Key : Unbounded_String) return Containers.Hash_Type is use Ada.Containers; function Hash is new System.String_Hash.Hash (Character, String, Hash_Type); begin return Hash (To_String (Key)); end Ada.Strings.Unbounded.Hash;
-- C83024E0.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 DECLARATION IN THE DECLARATIVE REGION OF A GENERIC -- PACKAGE HIDES AN OUTER DECLARATION OF A HOMOGRAPH. ALSO CHECK -- THAT THE OUTER DECLARATION IS DIRECTLY VISIBLE IN BOTH -- DECLARATIVE REGIONS BEFORE THE DECLARATION OF THE INNER HOMOGRAPH -- AND THE OUTER DECLARATION IS VISIBLE BY SELECTION AFTER THE INNER -- HOMOGRAPH DECLARATION, IF THE GENERIC PACKAGE BODY IS SEPARATELY -- COMPILED, BUT NOT AS A SUBUNIT. -- HISTORY: -- BCB 08/30/88 CREATED ORIGINAL TEST. -- PWN 11/30/94 ADDED A PROCEDURE TO KEEP PACKAGE BODIES LEGAL. GENERIC TYPE T IS PRIVATE; X : T; FUNCTION C83024E_GEN_FUN RETURN T; FUNCTION C83024E_GEN_FUN RETURN T IS BEGIN RETURN X; END C83024E_GEN_FUN; WITH REPORT; USE REPORT; PRAGMA ELABORATE(REPORT); PACKAGE C83024E_P1 IS A : INTEGER := IDENT_INT(2); B : INTEGER := A; PROCEDURE REQUIRE_BODY; GENERIC X : IN OUT INTEGER; PACKAGE C83024E_PACK1 IS C : INTEGER := A; A : INTEGER := IDENT_INT(3); END C83024E_PACK1; END C83024E_P1; WITH REPORT; USE REPORT; PRAGMA ELABORATE(REPORT); PACKAGE C83024E_P2 IS A : INTEGER := IDENT_INT(2); B : INTEGER := A; OBJ : INTEGER := IDENT_INT(3); PROCEDURE REQUIRE_BODY; GENERIC X : IN INTEGER := A; A : IN OUT INTEGER; PACKAGE C83024E_PACK2 IS C : INTEGER := A; END C83024E_PACK2; END C83024E_P2; WITH REPORT; USE REPORT; PRAGMA ELABORATE(REPORT); PACKAGE C83024E_P3 IS A : INTEGER := IDENT_INT(2); B : INTEGER := A; PROCEDURE REQUIRE_BODY; GENERIC X : IN OUT INTEGER; PACKAGE C83024E_PACK3 IS END C83024E_PACK3; END C83024E_P3; WITH REPORT; USE REPORT; WITH C83024E_GEN_FUN; PRAGMA ELABORATE(REPORT,C83024E_GEN_FUN); PACKAGE C83024E_P4 IS OBJ : INTEGER := IDENT_INT(1); FLO : FLOAT := 6.25; PROCEDURE REQUIRE_BODY; FUNCTION F IS NEW C83024E_GEN_FUN (INTEGER, OBJ); FUNCTION F IS NEW C83024E_GEN_FUN (FLOAT, FLO); GENERIC X : IN OUT INTEGER; F : IN FLOAT; PACKAGE C83024E_PACK4 IS END C83024E_PACK4; END C83024E_P4;
with Interfaces.C.Strings; with Interfaces.C_Streams; with Sensors.Conversions; with Sensors.LibSensors.Sensors_Sensors_H; with Sensors.LibSensors.Sensors_Error_H; with Ada.IO_Exceptions; package body Sensors is API_VERSION : constant := 16#500#; pragma Compile_Time_Error (API_VERSION /= Sensors.LibSensors.Sensors_Sensors_H.SENSORS_API_VERSION, "Incompatible APIs"); use all type Interfaces.C.int; use Sensors.LibSensors.Sensors_Sensors_H; function Error_Image (Code : Interfaces.C.int) return String is begin return "[" & Code'Img & "] : " & Interfaces.C.Strings.Value (Sensors.LibSensors.Sensors_Error_H.Sensors_Strerror (Code)); end; function Get_Instance (Config_Path : String := "") return Instance is Ret : Interfaces.C.int; Mode : String := "r" & ASCII.NUL; L_Config_Path : constant String := Config_Path & ASCII.NUL; F : aliased Interfaces.C_Streams.FILEs := Interfaces.C_Streams.NULL_Stream; use all type Interfaces.C_Streams.FILEs; begin return Object : Instance do if Config_Path /= "" then F := Interfaces.C_Streams.Fopen (Filename => L_Config_Path'Address, Mode => Mode'Address); if F = Interfaces.C_Streams.NULL_Stream then raise Ada.IO_Exceptions.Name_Error with "Unable to open:" & Config_Path; end if; end if; Ret := Sensors_Init (F); if F /= Interfaces.C_Streams.NULL_Stream then if Interfaces.C_Streams.Fclose (F) /= 0 then null; end if; end if; if Ret /= 0 then raise Sensors_Error with Error_Image (Ret); end if; end return; end; ------------------ -- First_Cursor -- ------------------ function First_Cursor (Cont : Chips_Iterator) return Chips_Cursor is begin return Chips_Cursor'(Cont'Unrestricted_Access, 0); end First_Cursor; ------------- -- Advance -- ------------- function Advance (Cont : Chips_Iterator; Position : Chips_Cursor) return Chips_Cursor is begin return Chips_Cursor'(Position.Ref, Position.I + 1); end; ------------------------ -- Cursor_Has_Element -- ------------------------ function Cursor_Has_Element (Cont : Chips_Iterator; Position : Chips_Cursor) return Boolean is C : aliased Interfaces.C.int := Position.I; Ret : access constant Sensors_Chip_Name; begin Ret := Sensors_Get_Detected_Chips (null, C'Access); return Ret /= null; end Cursor_Has_Element; ----------------- -- Get_Element -- ----------------- function Get_Element (Cont : Chips_Iterator; Position : Chips_Cursor) return Chip_Name'Class is pragma Unreferenced (Cont); C : aliased Interfaces.C.int := Position.I; begin return Conversions.Convert_Up (Sensors_Get_Detected_Chips (null, C'Access).all); end Get_Element; ------------------------ -- Get_Detected_Chips -- ------------------------ function Detected_Chips (Self : Instance) return Chips_Iterator'Class is begin return Ret : Chips_Iterator do null; end return; end Detected_Chips; -------------- -- Finalize -- -------------- procedure Finalize (Object : in out Instance) is pragma Unreferenced (Object); begin Sensors.LibSensors.Sensors_Sensors_H.Sensors_Cleanup; end Finalize; function Version return String is begin return Interfaces.C.Strings.Value (Sensors.LibSensors.Sensors_Sensors_H.Libsensors_Version); end; -- begin -- if Binding_Version /= Version then -- raise Program_Error with "Binding version missmatch"; -- end if; end Sensors;
-- Ada_GUI implementation based on Gnoga. Adapted 2021 -- -- -- GNOGA - The GNU Omnificent GUI for Ada -- -- -- -- G N O G A . G U I . E L E M E N T . C O M M O N -- -- -- -- S p e c -- -- -- -- -- -- Copyright (C) 2014 David Botton -- -- -- -- This library is free software; you can redistribute it and/or modify -- -- it under terms of the GNU General Public License as published by the -- -- Free Software Foundation; either version 3, 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. -- -- -- -- 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/>. -- -- -- -- 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. -- -- -- -- For more information please go to http://www.gnoga.com -- ------------------------------------------------------------------------------ with Ada_GUI.Gnoga.Gui.View; package Ada_GUI.Gnoga.Gui.Element.Common is ------------------------------------------------------------------------- -- A_Types ------------------------------------------------------------------------- type A_Type is new Gnoga.Gui.View.View_Base_Type with private; type A_Access is access all A_Type; type Pointer_To_A_Class is access all A_Type'Class; ------------------------------------------------------------------------- -- A_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (A : in out A_Type; Parent : in out Gnoga.Gui.Base_Type'Class; Link : in String := ""; Content : in String := ""; Target : in String := "_self"; ID : in String := ""); -- Create an Anchor link ------------------------------------------------------------------------- -- A_Type - Properties ------------------------------------------------------------------------- procedure Link (A : in out A_Type; Value : String); function Link (A : A_Type) return String; -- The HREF link of the Anchor procedure Target (A : in out A_Type; Value : String); function Target (A : A_Type) return String; -- Target of link, name of a frame or: -- _blank = new window -- _top = top most frame (full browser window) -- _parent = parent frame or window -- _self = current frame or window ------------------------------------------------------------------------- -- Button_Types ------------------------------------------------------------------------- type Button_Type is new Gnoga.Gui.View.View_Base_Type with private; type Button_Access is access all Button_Type; type Pointer_To_Button_Class is access all Button_Type'Class; ------------------------------------------------------------------------- -- Button_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (Button : in out Button_Type; Parent : in out Gnoga.Gui.Base_Type'Class; Content : in String := ""; ID : in String := ""); -- Create an HTML button. The content will be placed inside the button. -- For forms use Gnoga.Gui.Element.Form.Button instead. -- Button_Type's can contain other elements like images. ------------------------------------------------------------------------- -- Button_Type - Properties ------------------------------------------------------------------------- procedure Disabled (Button : in out Button_Type; Value : in Boolean := True); function Disabled (Button : Button_Type) return Boolean; ------------------------------------------------------------------------- -- DIV_Types ------------------------------------------------------------------------- type DIV_Type is new Gnoga.Gui.View.View_Base_Type with private; type DIV_Access is access all DIV_Type; type Pointer_To_DIV_Class is access all DIV_Type'Class; ------------------------------------------------------------------------- -- DIV_Type - Creation Methods ------------------------------------------------------------------------- -- Also note, that View_Base_Type.Put_Line also creates DIVs internally procedure Create (DIV : in out DIV_Type; Parent : in out Gnoga.Gui.Base_Type'Class; Content : in String := ""; ID : in String := ""); -- Create a div container with optional HTML content ------------------------------------------------------------------------- -- P_Types ------------------------------------------------------------------------- type P_Type is new Gnoga.Gui.View.View_Base_Type with private; type P_Access is access all P_Type; type Pointer_To_P_Class is access all P_Type'Class; ------------------------------------------------------------------------- -- P_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (P : in out P_Type; Parent : in out Gnoga.Gui.Base_Type'Class; Content : in String := ""; ID : in String := ""); ------------------------------------------------------------------------- -- IMG_Types ------------------------------------------------------------------------- type IMG_Type is new Gnoga.Gui.Element.Element_Type with private; type IMG_Access is access all IMG_Type; type Pointer_To_IMG_Class is access all IMG_Type'Class; ------------------------------------------------------------------------- -- IMG_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (IMG : in out IMG_Type; Parent : in out Gnoga.Gui.Base_Type'Class; URL_Source : in String := ""; Alternative_Text : in String := ""; ID : in String := ""); -- Create an image element. Use width and height properties before -- placing image to constrain image size. procedure URL_Source (IMG : in out IMG_Type; Value : in String); -- Change URL Source for IMG ------------------------------------------------------------------------- -- HR_Types ------------------------------------------------------------------------- type HR_Type is new Gnoga.Gui.Element.Element_Type with private; type HR_Access is access all HR_Type; type Pointer_To_HR_Class is access all HR_Type'Class; ------------------------------------------------------------------------- -- HR_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (HR : in out HR_Type; Parent : in out Gnoga.Gui.Base_Type'Class; ID : in String := ""); -- Create a horizontal rule ------------------------------------------------------------------------- -- BR_Types ------------------------------------------------------------------------- type BR_Type is new Gnoga.Gui.Element.Element_Type with private; type BR_Access is access all BR_Type; type Pointer_To_BR_Class is access all BR_Type'Class; ------------------------------------------------------------------------- -- BR_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (BR : in out BR_Type; Parent : in out Gnoga.Gui.Base_Type'Class; ID : in String := ""); ------------------------------------------------------------------------- -- Meter_Types ------------------------------------------------------------------------- type Meter_Type is new Gnoga.Gui.Element.Element_Type with private; type Meter_Access is access all Meter_Type; type Pointer_To_Meter_Class is access all Meter_Type'Class; ------------------------------------------------------------------------- -- Meter_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (Meter : in out Meter_Type; Parent : in out Gnoga.Gui.Base_Type'Class; Value : in Integer := 0; High : in Integer := 100; Low : in Integer := 0; Maximum : in Integer := 100; Minimum : in Integer := 0; Optimum : in Integer := 50; ID : in String := ""); ------------------------------------------------------------------------- -- Meter_Type - Properties ------------------------------------------------------------------------- procedure Value (Meter : in out Meter_Type; Value : in Integer); function Value (Meter : Meter_Type) return Integer; procedure High (Meter : in out Meter_Type; Value : in Integer); function High (Meter : Meter_Type) return Integer; procedure Low (Meter : in out Meter_Type; Value : in Integer); function Low (Meter : Meter_Type) return Integer; procedure Maximum (Meter : in out Meter_Type; Value : in Integer); function Maximum (Meter : Meter_Type) return Integer; procedure Minimum (Meter : in out Meter_Type; Value : in Integer); function Minimum (Meter : Meter_Type) return Integer; procedure Optimum (Meter : in out Meter_Type; Value : in Integer); function Optimum (Meter : Meter_Type) return Integer; ------------------------------------------------------------------------- -- Progress_Bar_Types ------------------------------------------------------------------------- type Progress_Bar_Type is new Gnoga.Gui.Element.Element_Type with private; type Progress_Bar_Access is access all Progress_Bar_Type; type Pointer_To_Progress_Bar_Class is access all Progress_Bar_Type'Class; ------------------------------------------------------------------------- -- Progress_Bar_Type - Creation Methods ------------------------------------------------------------------------- procedure Create (Progress_Bar : in out Progress_Bar_Type; Parent : in out Gnoga.Gui.Base_Type'Class; Value : in Integer := 0; Maximum : in Integer := 100; ID : in String := ""); ------------------------------------------------------------------------- -- Progress_Bar_Type - Properties ------------------------------------------------------------------------- procedure Value (Progress_Bar : in out Progress_Bar_Type; Value : in Integer); function Value (Progress_Bar : Progress_Bar_Type) return Integer; procedure Maximum (Progress_Bar : in out Progress_Bar_Type; Value : in Integer); function Maximum (Progress_Bar : Progress_Bar_Type) return Integer; ------------------------------------------------------------------------- -- Span_Types ------------------------------------------------------------------------- type Span_Type is new Gnoga.Gui.View.View_Base_Type with private; type Span_Access is access all Span_Type; type Pointer_To_Span_Class is access all Span_Type'Class; ------------------------------------------------------------------------- -- Span_Type - Creation Methods ------------------------------------------------------------------------- -- The Spans are created automatically when using View_Base_Type.Put procedure Create (Span : in out Span_Type; Parent : in out Gnoga.Gui.Base_Type'Class; Content : in String := ""; ID : in String := ""); -- Create a Span container private type A_Type is new Gnoga.Gui.View.View_Base_Type with null record; type Button_Type is new Gnoga.Gui.View.View_Base_Type with null record; type DIV_Type is new Gnoga.Gui.View.View_Base_Type with null record; type P_Type is new Gnoga.Gui.View.View_Base_Type with null record; type IMG_Type is new Gnoga.Gui.Element.Element_Type with null record; type HR_Type is new Gnoga.Gui.Element.Element_Type with null record; type BR_Type is new Gnoga.Gui.Element.Element_Type with null record; type Meter_Type is new Gnoga.Gui.Element.Element_Type with null record; type Progress_Bar_Type is new Gnoga.Gui.Element.Element_Type with null record; type Span_Type is new Gnoga.Gui.View.View_Base_Type with null record; end Ada_GUI.Gnoga.Gui.Element.Common;
------------------------------------------------------------------------------ -- -- -- 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$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements.Generic_Hash; function AMF.Standard_Profile_L3.Build_Components.Hash is new AMF.Elements.Generic_Hash (Standard_Profile_L3_Build_Component, Standard_Profile_L3_Build_Component_Access);
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 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 file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Internals.Utp_Elements; with AMF.String_Collections; with AMF.UML.Behaviored_Classifiers; with AMF.UML.Structured_Classifiers; with AMF.Utp.Test_Contexts; with AMF.Visitors; package AMF.Internals.Utp_Test_Contexts is type Utp_Test_Context_Proxy is limited new AMF.Internals.Utp_Elements.Utp_Element_Proxy and AMF.Utp.Test_Contexts.Utp_Test_Context with null record; overriding function Get_Base_Structured_Classifier (Self : not null access constant Utp_Test_Context_Proxy) return AMF.UML.Structured_Classifiers.UML_Structured_Classifier_Access; -- Getter of TestContext::base_StructuredClassifier. -- overriding procedure Set_Base_Structured_Classifier (Self : not null access Utp_Test_Context_Proxy; To : AMF.UML.Structured_Classifiers.UML_Structured_Classifier_Access); -- Setter of TestContext::base_StructuredClassifier. -- overriding function Get_Base_Behaviored_Classifier (Self : not null access constant Utp_Test_Context_Proxy) return AMF.UML.Behaviored_Classifiers.UML_Behaviored_Classifier_Access; -- Getter of TestContext::base_BehavioredClassifier. -- overriding procedure Set_Base_Behaviored_Classifier (Self : not null access Utp_Test_Context_Proxy; To : AMF.UML.Behaviored_Classifiers.UML_Behaviored_Classifier_Access); -- Setter of TestContext::base_BehavioredClassifier. -- overriding function Get_Test_Level (Self : not null access constant Utp_Test_Context_Proxy) return AMF.Optional_String; -- Getter of TestContext::testLevel. -- overriding procedure Set_Test_Level (Self : not null access Utp_Test_Context_Proxy; To : AMF.Optional_String); -- Setter of TestContext::testLevel. -- overriding function Get_Compatible_SUT_Version (Self : not null access constant Utp_Test_Context_Proxy) return AMF.String_Collections.Set_Of_String; -- Getter of TestContext::compatibleSUTVersion. -- overriding function Get_Compatible_SUT_Variant (Self : not null access constant Utp_Test_Context_Proxy) return AMF.String_Collections.Set_Of_String; -- Getter of TestContext::compatibleSUTVariant. -- overriding procedure Enter_Element (Self : not null access constant Utp_Test_Context_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); overriding procedure Leave_Element (Self : not null access constant Utp_Test_Context_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); overriding procedure Visit_Element (Self : not null access constant Utp_Test_Context_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); end AMF.Internals.Utp_Test_Contexts;
----------------------------------------------------------------------- -- awa-users-module -- User management module -- Copyright (C) 2009, 2010, 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. ----------------------------------------------------------------------- with ASF.Applications; with AWA.Modules; with AWA.Users.Services; with AWA.Users.Filters; with AWA.Users.Servlets; -- == Introduction == -- The <b>Users.Module</b> manages the creation, update, removal and authentication of users -- in an application. The module provides the foundations for user management in -- a web application. -- -- A user can register himself by using a subscription form. In that case, a verification mail -- is sent and the user has to follow the verification link defined in the mail to finish -- the registration process. The user will authenticate using a password. -- -- A user can also use an OpenID account and be automatically registered. -- -- A user can have one or several permissions that allow to protect the application data. -- User permissions are managed by the <b>Permissions.Module</b>. -- -- == Configuration == -- The *users* module uses a set of configuration properties to configure the OpenID -- integration. -- -- @include users.xml -- -- @include awa-users-services.ads -- -- @include users.xml -- -- == Model == -- [http://ada-awa.googlecode.com/svn/wiki/awa_user_model.png] -- -- @include User.hbm.xml package AWA.Users.Modules is NAME : constant String := "users"; type User_Module is new AWA.Modules.Module with private; type User_Module_Access is access all User_Module'Class; -- Initialize the user module. overriding procedure Initialize (Plugin : in out User_Module; App : in AWA.Modules.Application_Access; Props : in ASF.Applications.Config); -- Get the user manager. function Get_User_Manager (Plugin : in User_Module) return Services.User_Service_Access; -- Create a user manager. This operation can be overriden to provide another -- user service implementation. function Create_User_Manager (Plugin : in User_Module) return Services.User_Service_Access; -- Get the user module instance associated with the current application. function Get_User_Module return User_Module_Access; -- Get the user manager instance associated with the current application. function Get_User_Manager return Services.User_Service_Access; private type User_Module is new AWA.Modules.Module with record Manager : Services.User_Service_Access := null; Key_Filter : aliased AWA.Users.Filters.Verify_Filter; Auth_Filter : aliased AWA.Users.Filters.Auth_Filter; Auth : aliased AWA.Users.Servlets.Request_Auth_Servlet; Verify_Auth : aliased AWA.Users.Servlets.Verify_Auth_Servlet; end record; end AWA.Users.Modules;
with Ada.Containers.Vectors; package Perfect_Number is function Is_Perfect (N : Natural) return Boolean; package Pn_Vectors is new Ada.Containers.Vectors ( Index_Type => Natural, Element_Type => Natural); function Get_Perfect_Numbers (Limit : Natural) return Pn_Vectors.Vector; end Perfect_Number;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- O S I N T -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ with Alloc; with Debug; with Fmap; use Fmap; with Gnatvsn; use Gnatvsn; with Hostparm; with Opt; use Opt; with Output; use Output; with Sdefault; use Sdefault; with Table; with Targparm; use Targparm; with Unchecked_Conversion; pragma Warnings (Off); -- This package is used also by gnatcoll with System.Case_Util; use System.Case_Util; with System.CRTL; pragma Warnings (On); with GNAT.HTable; package body Osint is use type CRTL.size_t; Running_Program : Program_Type := Unspecified; -- comment required here ??? Program_Set : Boolean := False; -- comment required here ??? Std_Prefix : String_Ptr; -- Standard prefix, computed dynamically the first time Relocate_Path -- is called, and cached for subsequent calls. Empty : aliased String := ""; No_Dir : constant String_Ptr := Empty'Access; -- Used in Locate_File as a fake directory when Name is already an -- absolute path. ------------------------------------- -- Use of Name_Find and Name_Enter -- ------------------------------------- -- This package creates a number of source, ALI and object file names -- that are used to locate the actual file and for the purpose of message -- construction. These names need not be accessible by Name_Find, and can -- be therefore created by using routine Name_Enter. The files in question -- are file names with a prefix directory (i.e., the files not in the -- current directory). File names without a prefix directory are entered -- with Name_Find because special values might be attached to the various -- Info fields of the corresponding name table entry. ----------------------- -- Local Subprograms -- ----------------------- function Append_Suffix_To_File_Name (Name : File_Name_Type; Suffix : String) return File_Name_Type; -- Appends Suffix to Name and returns the new name function OS_Time_To_GNAT_Time (T : OS_Time) return Time_Stamp_Type; -- Convert OS format time to GNAT format time stamp. If T is Invalid_Time, -- then returns Empty_Time_Stamp. -- Round to even seconds on Windows before conversion. -- Windows ALI files had timestamps rounded to even seconds historically. -- The rounding was originally done in GM_Split. Now that GM_Split no -- longer does it, we are rounding it here only for ALI files. function Executable_Prefix return String_Ptr; -- Returns the name of the root directory where the executable is stored. -- The executable must be located in a directory called "bin", or under -- root/lib/gcc-lib/..., or under root/libexec/gcc/... For example, if -- executable is stored in directory "/foo/bar/bin", this routine returns -- "/foo/bar/". Return "" if location is not recognized as described above. function File_Names_Equal (File1, File2 : String) return Boolean; -- Compare File1 and File2 taking into account the case insensitivity -- of the OS. function Update_Path (Path : String_Ptr) return String_Ptr; -- Update the specified path to replace the prefix with the location where -- GNAT is installed. See the file prefix.c in GCC for details. procedure Locate_File (N : File_Name_Type; T : File_Type; Dir : Natural; Name : String; Found : out File_Name_Type; Attr : access File_Attributes); -- See if the file N whose name is Name exists in directory Dir. Dir is an -- index into the Lib_Search_Directories table if T = Library. Otherwise -- if T = Source, Dir is an index into the Src_Search_Directories table. -- Returns the File_Name_Type of the full file name if file found, or -- No_File if not found. -- -- On exit, Found is set to the file that was found, and Attr to a cache of -- its attributes (at least those that have been computed so far). Reusing -- the cache will save some system calls. -- -- Attr is always reset in this call to Unknown_Attributes, even in case of -- failure procedure Find_File (N : File_Name_Type; T : File_Type; Found : out File_Name_Type; Attr : access File_Attributes; Full_Name : Boolean := False); -- A version of Find_File that also returns a cache of the file attributes -- for later reuse procedure Smart_Find_File (N : File_Name_Type; T : File_Type; Found : out File_Name_Type; Attr : out File_Attributes); -- A version of Smart_Find_File that also returns a cache of the file -- attributes for later reuse function C_String_Length (S : Address) return CRTL.size_t; -- Returns length of a C string (zero for a null address) function To_Path_String_Access (Path_Addr : Address; Path_Len : CRTL.size_t) return String_Access; -- Converts a C String to an Ada String. Are we doing this to avoid withing -- Interfaces.C.Strings ??? -- Caller must free result. function Include_Dir_Default_Prefix return String_Access; -- Same as exported version, except returns a String_Access ------------------------------ -- Other Local Declarations -- ------------------------------ EOL : constant Character := ASCII.LF; -- End of line character Number_File_Names : Nat := 0; -- Number of file names found on command line and placed in File_Names Look_In_Primary_Directory_For_Current_Main : Boolean := False; -- When this variable is True, Find_File only looks in Primary_Directory -- for the Current_Main file. This variable is always set to True for the -- compiler. It is also True for gnatmake, when the source name given on -- the command line has directory information. Current_Full_Source_Name : File_Name_Type := No_File; Current_Full_Source_Stamp : Time_Stamp_Type := Empty_Time_Stamp; Current_Full_Lib_Name : File_Name_Type := No_File; Current_Full_Lib_Stamp : Time_Stamp_Type := Empty_Time_Stamp; Current_Full_Obj_Name : File_Name_Type := No_File; Current_Full_Obj_Stamp : Time_Stamp_Type := Empty_Time_Stamp; -- Respectively full name (with directory info) and time stamp of the -- latest source, library and object files opened by Read_Source_File and -- Read_Library_Info. package File_Name_Chars is new Table.Table ( Table_Component_Type => Character, Table_Index_Type => Int, Table_Low_Bound => 1, Table_Initial => Alloc.File_Name_Chars_Initial, Table_Increment => Alloc.File_Name_Chars_Increment, Table_Name => "File_Name_Chars"); -- Table to store text to be printed by Dump_Source_File_Names The_Include_Dir_Default_Prefix : String_Access := null; -- Value returned by Include_Dir_Default_Prefix. We don't initialize it -- here, because that causes an elaboration cycle with Sdefault; we -- initialize it lazily instead. ------------------ -- Search Paths -- ------------------ Primary_Directory : constant := 0; -- This is index in the tables created below for the first directory to -- search in for source or library information files. This is the directory -- containing the latest main input file (a source file for the compiler or -- a library file for the binder). package Src_Search_Directories is new Table.Table ( Table_Component_Type => String_Ptr, Table_Index_Type => Integer, Table_Low_Bound => Primary_Directory, Table_Initial => 10, Table_Increment => 100, Table_Name => "Osint.Src_Search_Directories"); -- Table of names of directories in which to search for source (Compiler) -- files. This table is filled in the order in which the directories are -- to be searched, and then used in that order. package Lib_Search_Directories is new Table.Table ( Table_Component_Type => String_Ptr, Table_Index_Type => Integer, Table_Low_Bound => Primary_Directory, Table_Initial => 10, Table_Increment => 100, Table_Name => "Osint.Lib_Search_Directories"); -- Table of names of directories in which to search for library (Binder) -- files. This table is filled in the order in which the directories are -- to be searched and then used in that order. The reason for having two -- distinct tables is that we need them both in gnatmake. --------------------- -- File Hash Table -- --------------------- -- The file hash table is provided to free the programmer from any -- efficiency concern when retrieving full file names or time stamps of -- source files. If the programmer calls Source_File_Data (Cache => True) -- he is guaranteed that the price to retrieve the full name (i.e. with -- directory info) or time stamp of the file will be payed only once, the -- first time the full name is actually searched (or the first time the -- time stamp is actually retrieved). This is achieved by employing a hash -- table that stores as a key the File_Name_Type of the file and associates -- to that File_Name_Type the full file name and time stamp of the file. File_Cache_Enabled : Boolean := False; -- Set to true if you want the enable the file data caching mechanism type File_Hash_Num is range 0 .. 1020; function File_Hash (F : File_Name_Type) return File_Hash_Num; -- Compute hash index for use by Simple_HTable type File_Info_Cache is record File : File_Name_Type; Attr : aliased File_Attributes; end record; No_File_Info_Cache : constant File_Info_Cache := (No_File, (others => 0)); package File_Name_Hash_Table is new GNAT.HTable.Simple_HTable ( Header_Num => File_Hash_Num, Element => File_Info_Cache, No_Element => No_File_Info_Cache, Key => File_Name_Type, Hash => File_Hash, Equal => "="); function Smart_Find_File (N : File_Name_Type; T : File_Type) return File_Name_Type; -- Exactly like Find_File except that if File_Cache_Enabled is True this -- routine looks first in the hash table to see if the full name of the -- file is already available. function Smart_File_Stamp (N : File_Name_Type; T : File_Type) return Time_Stamp_Type; -- Takes the same parameter as the routine above (N is a file name without -- any prefix directory information) and behaves like File_Stamp except -- that if File_Cache_Enabled is True this routine looks first in the hash -- table to see if the file stamp of the file is already available. ----------------------------- -- Add_Default_Search_Dirs -- ----------------------------- procedure Add_Default_Search_Dirs is Search_Dir : String_Access; Search_Path : String_Access; Path_File_Name : String_Access; procedure Add_Search_Dir (Search_Dir : String; Additional_Source_Dir : Boolean); procedure Add_Search_Dir (Search_Dir : String_Access; Additional_Source_Dir : Boolean); -- Add a source search dir or a library search dir, depending on the -- value of Additional_Source_Dir. procedure Get_Dirs_From_File (Additional_Source_Dir : Boolean); -- Open a path file and read the directory to search, one per line function Get_Libraries_From_Registry return String_Ptr; -- On Windows systems, get the list of installed standard libraries -- from the registry key: -- -- HKEY_LOCAL_MACHINE\SOFTWARE\Ada Core Technologies\ -- GNAT\Standard Libraries -- Return an empty string on other systems. -- -- Note that this is an undocumented legacy feature, and that it -- works only when using the default runtime library (i.e. no --RTS= -- command line switch). -------------------- -- Add_Search_Dir -- -------------------- procedure Add_Search_Dir (Search_Dir : String; Additional_Source_Dir : Boolean) is begin if Additional_Source_Dir then Add_Src_Search_Dir (Search_Dir); else Add_Lib_Search_Dir (Search_Dir); end if; end Add_Search_Dir; procedure Add_Search_Dir (Search_Dir : String_Access; Additional_Source_Dir : Boolean) is begin if Additional_Source_Dir then Add_Src_Search_Dir (Search_Dir.all); else Add_Lib_Search_Dir (Search_Dir.all); end if; end Add_Search_Dir; ------------------------ -- Get_Dirs_From_File -- ------------------------ procedure Get_Dirs_From_File (Additional_Source_Dir : Boolean) is File_FD : File_Descriptor; Buffer : constant String := Path_File_Name.all & ASCII.NUL; Len : Natural; Actual_Len : Natural; S : String_Access; Curr : Natural; First : Natural; Ch : Character; Status : Boolean; pragma Warnings (Off, Status); -- For the call to Close where status is ignored begin File_FD := Open_Read (Buffer'Address, Binary); -- If we cannot open the file, we ignore it, we don't fail if File_FD = Invalid_FD then return; end if; Len := Integer (File_Length (File_FD)); S := new String (1 .. Len); -- Read the file. Note that the loop is probably not necessary any -- more since the whole file is read in at once on all targets. But -- it is harmless and might be needed in future. Curr := 1; Actual_Len := Len; while Curr <= Len and then Actual_Len /= 0 loop Actual_Len := Read (File_FD, S (Curr)'Address, Len); Curr := Curr + Actual_Len; end loop; -- We are done with the file, so we close it (ignore any error on -- the close, since we have successfully read the file). Close (File_FD, Status); -- Now, we read line by line First := 1; Curr := 0; while Curr < Len loop Ch := S (Curr + 1); if Ch = ASCII.CR or else Ch = ASCII.LF or else Ch = ASCII.FF or else Ch = ASCII.VT then if First <= Curr then Add_Search_Dir (S (First .. Curr), Additional_Source_Dir); end if; First := Curr + 2; end if; Curr := Curr + 1; end loop; -- Last line is a special case, if the file does not end with -- an end of line mark. if First <= S'Last then Add_Search_Dir (S (First .. S'Last), Additional_Source_Dir); end if; end Get_Dirs_From_File; --------------------------------- -- Get_Libraries_From_Registry -- --------------------------------- function Get_Libraries_From_Registry return String_Ptr is function C_Get_Libraries_From_Registry return Address; pragma Import (C, C_Get_Libraries_From_Registry, "__gnat_get_libraries_from_registry"); Result_Ptr : Address; Result_Length : CRTL.size_t; Out_String : String_Ptr; begin Result_Ptr := C_Get_Libraries_From_Registry; Result_Length := CRTL.strlen (Result_Ptr); Out_String := new String (1 .. Integer (Result_Length)); CRTL.strncpy (Out_String.all'Address, Result_Ptr, Result_Length); CRTL.free (Result_Ptr); return Out_String; end Get_Libraries_From_Registry; -- Start of processing for Add_Default_Search_Dirs begin -- If there was a -gnateO switch, add all object directories from the -- file given in argument to the library search list. if Object_Path_File_Name /= null then Path_File_Name := String_Access (Object_Path_File_Name); pragma Assert (Path_File_Name'Length > 0); Get_Dirs_From_File (Additional_Source_Dir => False); end if; -- After the locations specified on the command line, the next places -- to look for files are the directories specified by the appropriate -- environment variable. Get this value, extract the directory names -- and store in the tables. -- Check for eventual project path file env vars Path_File_Name := Getenv (Project_Include_Path_File); if Path_File_Name'Length > 0 then Get_Dirs_From_File (Additional_Source_Dir => True); end if; Path_File_Name := Getenv (Project_Objects_Path_File); if Path_File_Name'Length > 0 then Get_Dirs_From_File (Additional_Source_Dir => False); end if; -- Put path name in canonical form for Additional_Source_Dir in False .. True loop if Additional_Source_Dir then Search_Path := Getenv (Ada_Include_Path); else Search_Path := Getenv (Ada_Objects_Path); end if; Get_Next_Dir_In_Path_Init (Search_Path); loop Search_Dir := Get_Next_Dir_In_Path (Search_Path); exit when Search_Dir = null; Add_Search_Dir (Search_Dir, Additional_Source_Dir); end loop; end loop; -- For the compiler, if --RTS= was specified, add the runtime -- directories. if RTS_Src_Path_Name /= null and then RTS_Lib_Path_Name /= null then Add_Search_Dirs (RTS_Src_Path_Name, Include); Add_Search_Dirs (RTS_Lib_Path_Name, Objects); else if not Opt.No_Stdinc then -- For WIN32 systems, look for any system libraries defined in -- the registry. These are added to both source and object -- directories. Search_Path := String_Access (Get_Libraries_From_Registry); Get_Next_Dir_In_Path_Init (Search_Path); loop Search_Dir := Get_Next_Dir_In_Path (Search_Path); exit when Search_Dir = null; Add_Search_Dir (Search_Dir, False); Add_Search_Dir (Search_Dir, True); end loop; -- The last place to look are the defaults Search_Path := Read_Default_Search_Dirs (String_Access (Update_Path (Search_Dir_Prefix)), Include_Search_File, String_Access (Update_Path (Include_Dir_Default_Name))); Get_Next_Dir_In_Path_Init (Search_Path); loop Search_Dir := Get_Next_Dir_In_Path (Search_Path); exit when Search_Dir = null; Add_Search_Dir (Search_Dir, True); end loop; end if; -- Even when -nostdlib is used, we still want to have visibility on -- the run-time object directory, as it is used by gnatbind to find -- the run-time ALI files in "real" ZFP set up. if not Opt.RTS_Switch then Search_Path := Read_Default_Search_Dirs (String_Access (Update_Path (Search_Dir_Prefix)), Objects_Search_File, String_Access (Update_Path (Object_Dir_Default_Name))); Get_Next_Dir_In_Path_Init (Search_Path); loop Search_Dir := Get_Next_Dir_In_Path (Search_Path); exit when Search_Dir = null; Add_Search_Dir (Search_Dir, False); end loop; end if; end if; end Add_Default_Search_Dirs; -------------- -- Add_File -- -------------- procedure Add_File (File_Name : String; Index : Int := No_Index) is begin Number_File_Names := Number_File_Names + 1; -- As Add_File may be called for mains specified inside a project file, -- File_Names may be too short and needs to be extended. if Number_File_Names > File_Names'Last then File_Names := new File_Name_Array'(File_Names.all & File_Names.all); File_Indexes := new File_Index_Array'(File_Indexes.all & File_Indexes.all); end if; File_Names (Number_File_Names) := new String'(File_Name); File_Indexes (Number_File_Names) := Index; end Add_File; ------------------------ -- Add_Lib_Search_Dir -- ------------------------ procedure Add_Lib_Search_Dir (Dir : String) is begin if Dir'Length = 0 then Fail ("missing library directory name"); end if; declare Norm : String_Ptr := Normalize_Directory_Name (Dir); begin -- Do nothing if the directory is already in the list. This saves -- system calls and avoid unneeded work for D in Lib_Search_Directories.First .. Lib_Search_Directories.Last loop if Lib_Search_Directories.Table (D).all = Norm.all then Free (Norm); return; end if; end loop; Lib_Search_Directories.Increment_Last; Lib_Search_Directories.Table (Lib_Search_Directories.Last) := Norm; end; end Add_Lib_Search_Dir; --------------------- -- Add_Search_Dirs -- --------------------- procedure Add_Search_Dirs (Search_Path : String_Ptr; Path_Type : Search_File_Type) is Current_Search_Path : String_Access; begin Get_Next_Dir_In_Path_Init (String_Access (Search_Path)); loop Current_Search_Path := Get_Next_Dir_In_Path (String_Access (Search_Path)); exit when Current_Search_Path = null; if Path_Type = Include then Add_Src_Search_Dir (Current_Search_Path.all); else Add_Lib_Search_Dir (Current_Search_Path.all); end if; end loop; end Add_Search_Dirs; ------------------------ -- Add_Src_Search_Dir -- ------------------------ procedure Add_Src_Search_Dir (Dir : String) is begin if Dir'Length = 0 then Fail ("missing source directory name"); end if; Src_Search_Directories.Increment_Last; Src_Search_Directories.Table (Src_Search_Directories.Last) := Normalize_Directory_Name (Dir); end Add_Src_Search_Dir; -------------------------------- -- Append_Suffix_To_File_Name -- -------------------------------- function Append_Suffix_To_File_Name (Name : File_Name_Type; Suffix : String) return File_Name_Type is begin Get_Name_String (Name); Name_Buffer (Name_Len + 1 .. Name_Len + Suffix'Length) := Suffix; Name_Len := Name_Len + Suffix'Length; return Name_Find; end Append_Suffix_To_File_Name; --------------------- -- C_String_Length -- --------------------- function C_String_Length (S : Address) return CRTL.size_t is begin if S = Null_Address then return 0; else return CRTL.strlen (S); end if; end C_String_Length; ------------------------------ -- Canonical_Case_File_Name -- ------------------------------ procedure Canonical_Case_File_Name (S : in out String) is begin if not File_Names_Case_Sensitive then To_Lower (S); end if; end Canonical_Case_File_Name; --------------------------------- -- Canonical_Case_Env_Var_Name -- --------------------------------- procedure Canonical_Case_Env_Var_Name (S : in out String) is begin if not Env_Vars_Case_Sensitive then To_Lower (S); end if; end Canonical_Case_Env_Var_Name; --------------------------- -- Create_File_And_Check -- --------------------------- procedure Create_File_And_Check (Fdesc : out File_Descriptor; Fmode : Mode) is begin Output_File_Name := Name_Enter; Fdesc := Create_File (Name_Buffer'Address, Fmode); if Fdesc = Invalid_FD then Fail ("Cannot create: " & Name_Buffer (1 .. Name_Len)); end if; end Create_File_And_Check; ----------------------------------- -- Open_File_To_Append_And_Check -- ----------------------------------- procedure Open_File_To_Append_And_Check (Fdesc : out File_Descriptor; Fmode : Mode) is begin Output_File_Name := Name_Enter; Fdesc := Open_Append (Name_Buffer'Address, Fmode); if Fdesc = Invalid_FD then Fail ("Cannot create: " & Name_Buffer (1 .. Name_Len)); end if; end Open_File_To_Append_And_Check; ------------------------ -- Current_File_Index -- ------------------------ function Current_File_Index return Int is begin return File_Indexes (Current_File_Name_Index); end Current_File_Index; -------------------------------- -- Current_Library_File_Stamp -- -------------------------------- function Current_Library_File_Stamp return Time_Stamp_Type is begin return Current_Full_Lib_Stamp; end Current_Library_File_Stamp; ------------------------------- -- Current_Object_File_Stamp -- ------------------------------- function Current_Object_File_Stamp return Time_Stamp_Type is begin return Current_Full_Obj_Stamp; end Current_Object_File_Stamp; ------------------------------- -- Current_Source_File_Stamp -- ------------------------------- function Current_Source_File_Stamp return Time_Stamp_Type is begin return Current_Full_Source_Stamp; end Current_Source_File_Stamp; ---------------------------- -- Dir_In_Obj_Search_Path -- ---------------------------- function Dir_In_Obj_Search_Path (Position : Natural) return String_Ptr is begin if Opt.Look_In_Primary_Dir then return Lib_Search_Directories.Table (Primary_Directory + Position - 1); else return Lib_Search_Directories.Table (Primary_Directory + Position); end if; end Dir_In_Obj_Search_Path; ---------------------------- -- Dir_In_Src_Search_Path -- ---------------------------- function Dir_In_Src_Search_Path (Position : Natural) return String_Ptr is begin if Opt.Look_In_Primary_Dir then return Src_Search_Directories.Table (Primary_Directory + Position - 1); else return Src_Search_Directories.Table (Primary_Directory + Position); end if; end Dir_In_Src_Search_Path; ----------------------------------------- -- Dump_Command_Line_Source_File_Names -- ----------------------------------------- procedure Dump_Command_Line_Source_File_Names is begin for J in 1 .. Number_Of_Files loop Write_Str (File_Names (J).all & " "); end loop; end Dump_Command_Line_Source_File_Names; ---------------------------- -- Dump_Source_File_Names -- ---------------------------- procedure Dump_Source_File_Names is subtype Rng is Int range File_Name_Chars.First .. File_Name_Chars.Last; begin Write_Str (String (File_Name_Chars.Table (Rng))); end Dump_Source_File_Names; --------------------- -- Executable_Name -- --------------------- function Executable_Name (Name : File_Name_Type; Only_If_No_Suffix : Boolean := False) return File_Name_Type is Exec_Suffix : String_Access; Add_Suffix : Boolean; begin if Name = No_File then return No_File; end if; if Executable_Extension_On_Target = No_Name then Exec_Suffix := Get_Target_Executable_Suffix; else Get_Name_String (Executable_Extension_On_Target); Exec_Suffix := new String'(Name_Buffer (1 .. Name_Len)); end if; if Exec_Suffix'Length /= 0 then Get_Name_String (Name); Add_Suffix := True; if Only_If_No_Suffix then for J in reverse 1 .. Name_Len loop if Name_Buffer (J) = '.' then Add_Suffix := False; exit; elsif Is_Directory_Separator (Name_Buffer (J)) then exit; end if; end loop; end if; if Add_Suffix then -- If Executable doesn't end with the executable suffix, add it if Name_Len <= Exec_Suffix'Length or else not File_Names_Equal (Name_Buffer (Name_Len - Exec_Suffix'Length + 1 .. Name_Len), Exec_Suffix.all) then Name_Buffer (Name_Len + 1 .. Name_Len + Exec_Suffix'Length) := Exec_Suffix.all; Name_Len := Name_Len + Exec_Suffix'Length; Free (Exec_Suffix); return Name_Find; end if; end if; end if; Free (Exec_Suffix); return Name; end Executable_Name; function Executable_Name (Name : String; Only_If_No_Suffix : Boolean := False) return String is Exec_Suffix : String_Access; Add_Suffix : Boolean; begin if Executable_Extension_On_Target = No_Name then Exec_Suffix := Get_Target_Executable_Suffix; else Get_Name_String (Executable_Extension_On_Target); Exec_Suffix := new String'(Name_Buffer (1 .. Name_Len)); end if; if Exec_Suffix'Length = 0 then Free (Exec_Suffix); return Name; else declare Suffix : constant String := Exec_Suffix.all; begin Free (Exec_Suffix); Add_Suffix := True; if Only_If_No_Suffix then for J in reverse Name'Range loop if Name (J) = '.' then Add_Suffix := False; exit; elsif Is_Directory_Separator (Name (J)) then exit; end if; end loop; end if; if Add_Suffix and then (Name'Length <= Suffix'Length or else not File_Names_Equal (Name (Name'Last - Suffix'Length + 1 .. Name'Last), Suffix)) then declare Result : String (1 .. Name'Length + Suffix'Length); begin Result (1 .. Name'Length) := Name; Result (Name'Length + 1 .. Result'Last) := Suffix; return Result; end; else return Name; end if; end; end if; end Executable_Name; ----------------------- -- Executable_Prefix -- ----------------------- function Executable_Prefix return String_Ptr is function Get_Install_Dir (Exec : String) return String_Ptr; -- S is the executable name preceded by the absolute or relative -- path, e.g. "c:\usr\bin\gcc.exe" or "..\bin\gcc". --------------------- -- Get_Install_Dir -- --------------------- function Get_Install_Dir (Exec : String) return String_Ptr is Full_Path : constant String := Normalize_Pathname (Exec); -- Use the full path, so that we find "lib" or "bin", even when -- the tool has been invoked with a relative path, as in -- "./gnatls -v" invoked in the GNAT bin directory. begin for J in reverse Full_Path'Range loop if Is_Directory_Separator (Full_Path (J)) then if J < Full_Path'Last - 5 then if (To_Lower (Full_Path (J + 1)) = 'l' and then To_Lower (Full_Path (J + 2)) = 'i' and then To_Lower (Full_Path (J + 3)) = 'b') or else (To_Lower (Full_Path (J + 1)) = 'b' and then To_Lower (Full_Path (J + 2)) = 'i' and then To_Lower (Full_Path (J + 3)) = 'n') then return new String'(Full_Path (Full_Path'First .. J)); end if; end if; end if; end loop; return new String'(""); end Get_Install_Dir; -- Start of processing for Executable_Prefix begin if Exec_Name = null then Exec_Name := new String (1 .. Len_Arg (0)); Osint.Fill_Arg (Exec_Name (1)'Address, 0); end if; -- First determine if a path prefix was placed in front of the -- executable name. for J in reverse Exec_Name'Range loop if Is_Directory_Separator (Exec_Name (J)) then return Get_Install_Dir (Exec_Name.all); end if; end loop; -- If we come here, the user has typed the executable name with no -- directory prefix. return Get_Install_Dir (Locate_Exec_On_Path (Exec_Name.all).all); end Executable_Prefix; ------------------ -- Exit_Program -- ------------------ procedure Exit_Program (Exit_Code : Exit_Code_Type) is begin -- The program will exit with the following status: -- 0 if the object file has been generated (with or without warnings) -- 1 if recompilation was not needed (smart recompilation) -- 2 if gnat1 has been killed by a signal (detected by GCC) -- 4 for a fatal error -- 5 if there were errors -- 6 if no code has been generated (spec) -- Note that exit code 3 is not used and must not be used as this is -- the code returned by a program aborted via C abort() routine on -- Windows. GCC checks for that case and thinks that the child process -- has been aborted. This code (exit code 3) used to be the code used -- for E_No_Code, but E_No_Code was changed to 6 for this reason. case Exit_Code is when E_Success => OS_Exit (0); when E_Warnings => OS_Exit (0); when E_No_Compile => OS_Exit (1); when E_Fatal => OS_Exit (4); when E_Errors => OS_Exit (5); when E_No_Code => OS_Exit (6); when E_Abort => OS_Abort; end case; end Exit_Program; ---------- -- Fail -- ---------- procedure Fail (S : String) is begin -- We use Output in case there is a special output set up. In this case -- Set_Standard_Error will have no immediate effect. Set_Standard_Error; Osint.Write_Program_Name; Write_Str (": "); Write_Str (S); Write_Eol; Exit_Program (E_Fatal); end Fail; ---------------------- -- File_Names_Equal -- ---------------------- function File_Names_Equal (File1, File2 : String) return Boolean is begin if File_Names_Case_Sensitive then return File1 = File2; else return To_Lower (File1) = To_Lower (File2); end if; end File_Names_Equal; --------------- -- File_Hash -- --------------- function File_Hash (F : File_Name_Type) return File_Hash_Num is begin return File_Hash_Num (Int (F) mod File_Hash_Num'Range_Length); end File_Hash; ----------------- -- File_Length -- ----------------- function File_Length (Name : C_File_Name; Attr : access File_Attributes) return Long_Integer is function Internal (F : Integer; N : C_File_Name; A : System.Address) return CRTL.int64; pragma Import (C, Internal, "__gnat_file_length_attr"); begin -- The conversion from int64 to Long_Integer is ok here as this -- routine is only to be used by the compiler and we do not expect -- a unit to be larger than a 32bit integer. return Long_Integer (Internal (-1, Name, Attr.all'Address)); end File_Length; --------------------- -- File_Time_Stamp -- --------------------- function File_Time_Stamp (Name : C_File_Name; Attr : access File_Attributes) return OS_Time is function Internal (N : C_File_Name; A : System.Address) return OS_Time; pragma Import (C, Internal, "__gnat_file_time_name_attr"); begin return Internal (Name, Attr.all'Address); end File_Time_Stamp; function File_Time_Stamp (Name : Path_Name_Type; Attr : access File_Attributes) return Time_Stamp_Type is begin if Name = No_Path then return Empty_Time_Stamp; end if; Get_Name_String (Name); Name_Buffer (Name_Len + 1) := ASCII.NUL; return OS_Time_To_GNAT_Time (File_Time_Stamp (Name_Buffer'Address, Attr)); end File_Time_Stamp; ---------------- -- File_Stamp -- ---------------- function File_Stamp (Name : File_Name_Type) return Time_Stamp_Type is begin if Name = No_File then return Empty_Time_Stamp; end if; Get_Name_String (Name); -- File_Time_Stamp will always return Invalid_Time if the file does -- not exist, and OS_Time_To_GNAT_Time will convert this value to -- Empty_Time_Stamp. Therefore we do not need to first test whether -- the file actually exists, which saves a system call. return OS_Time_To_GNAT_Time (File_Time_Stamp (Name_Buffer (1 .. Name_Len))); end File_Stamp; function File_Stamp (Name : Path_Name_Type) return Time_Stamp_Type is begin return File_Stamp (File_Name_Type (Name)); end File_Stamp; --------------- -- Find_File -- --------------- function Find_File (N : File_Name_Type; T : File_Type; Full_Name : Boolean := False) return File_Name_Type is Attr : aliased File_Attributes; Found : File_Name_Type; begin Find_File (N, T, Found, Attr'Access, Full_Name); return Found; end Find_File; --------------- -- Find_File -- --------------- procedure Find_File (N : File_Name_Type; T : File_Type; Found : out File_Name_Type; Attr : access File_Attributes; Full_Name : Boolean := False) is begin Get_Name_String (N); declare File_Name : String renames Name_Buffer (1 .. Name_Len); File : File_Name_Type := No_File; Last_Dir : Natural; begin -- If we are looking for a config file, look only in the current -- directory, i.e. return input argument unchanged. Also look only in -- the current directory if we are looking for a .dg file (happens in -- -gnatD mode). if T = Config or else (Debug_Generated_Code and then Name_Len > 3 and then Name_Buffer (Name_Len - 2 .. Name_Len) = ".dg") then Found := N; Attr.all := Unknown_Attributes; if T = Config then if Full_Name then declare Full_Path : constant String := Normalize_Pathname (Get_Name_String (N)); Full_Size : constant Natural := Full_Path'Length; begin Name_Buffer (1 .. Full_Size) := Full_Path; Name_Len := Full_Size; Found := Name_Find; end; end if; -- Check that it is a file, not a directory if not Is_Regular_File (Get_Name_String (Found)) then Found := No_File; end if; end if; return; -- If we are trying to find the current main file just look in the -- directory where the user said it was. elsif Look_In_Primary_Directory_For_Current_Main and then Current_Main = N then Locate_File (N, T, Primary_Directory, File_Name, Found, Attr); return; -- Otherwise do standard search for source file else -- Check the mapping of this file name File := Mapped_Path_Name (N); -- If the file name is mapped to a path name, return the -- corresponding path name if File /= No_File then -- For locally removed file, Error_Name is returned; then -- return No_File, indicating the file is not a source. if File = Error_File_Name then Found := No_File; else Found := File; end if; Attr.all := Unknown_Attributes; return; end if; -- First place to look is in the primary directory (i.e. the same -- directory as the source) unless this has been disabled with -I- if Opt.Look_In_Primary_Dir then Locate_File (N, T, Primary_Directory, File_Name, Found, Attr); if Found /= No_File then return; end if; end if; -- Finally look in directories specified with switches -I/-aI/-aO if T = Library then Last_Dir := Lib_Search_Directories.Last; else Last_Dir := Src_Search_Directories.Last; end if; for D in Primary_Directory + 1 .. Last_Dir loop Locate_File (N, T, D, File_Name, Found, Attr); if Found /= No_File then return; end if; end loop; Attr.all := Unknown_Attributes; Found := No_File; end if; end; end Find_File; ----------------------- -- Find_Program_Name -- ----------------------- procedure Find_Program_Name is Command_Name : String (1 .. Len_Arg (0)); Cindex1 : Integer := Command_Name'First; Cindex2 : Integer := Command_Name'Last; begin Fill_Arg (Command_Name'Address, 0); if Command_Name = "" then Name_Len := 0; return; end if; -- The program name might be specified by a full path name. However, -- we don't want to print that all out in an error message, so the -- path might need to be stripped away. for J in reverse Cindex1 .. Cindex2 loop if Is_Directory_Separator (Command_Name (J)) then Cindex1 := J + 1; exit; end if; end loop; -- Command_Name(Cindex1 .. Cindex2) is now the equivalent of the -- POSIX command "basename argv[0]" -- Strip off any executable extension (usually nothing or .exe) -- but formally reported by autoconf in the variable EXEEXT if Cindex2 - Cindex1 >= 4 then if To_Lower (Command_Name (Cindex2 - 3)) = '.' and then To_Lower (Command_Name (Cindex2 - 2)) = 'e' and then To_Lower (Command_Name (Cindex2 - 1)) = 'x' and then To_Lower (Command_Name (Cindex2)) = 'e' then Cindex2 := Cindex2 - 4; end if; end if; Name_Len := Cindex2 - Cindex1 + 1; Name_Buffer (1 .. Name_Len) := Command_Name (Cindex1 .. Cindex2); end Find_Program_Name; ------------------------ -- Full_Lib_File_Name -- ------------------------ procedure Full_Lib_File_Name (N : File_Name_Type; Lib_File : out File_Name_Type; Attr : out File_Attributes) is A : aliased File_Attributes; begin -- ??? seems we could use Smart_Find_File here Find_File (N, Library, Lib_File, A'Access); Attr := A; end Full_Lib_File_Name; ------------------------ -- Full_Lib_File_Name -- ------------------------ function Full_Lib_File_Name (N : File_Name_Type) return File_Name_Type is Attr : File_Attributes; File : File_Name_Type; begin Full_Lib_File_Name (N, File, Attr); return File; end Full_Lib_File_Name; ---------------------------- -- Full_Library_Info_Name -- ---------------------------- function Full_Library_Info_Name return File_Name_Type is begin return Current_Full_Lib_Name; end Full_Library_Info_Name; --------------------------- -- Full_Object_File_Name -- --------------------------- function Full_Object_File_Name return File_Name_Type is begin return Current_Full_Obj_Name; end Full_Object_File_Name; ---------------------- -- Full_Source_Name -- ---------------------- function Full_Source_Name return File_Name_Type is begin return Current_Full_Source_Name; end Full_Source_Name; ---------------------- -- Full_Source_Name -- ---------------------- function Full_Source_Name (N : File_Name_Type) return File_Name_Type is begin return Smart_Find_File (N, Source); end Full_Source_Name; ---------------------- -- Full_Source_Name -- ---------------------- procedure Full_Source_Name (N : File_Name_Type; Full_File : out File_Name_Type; Attr : access File_Attributes) is begin Smart_Find_File (N, Source, Full_File, Attr.all); end Full_Source_Name; ------------------- -- Get_Directory -- ------------------- function Get_Directory (Name : File_Name_Type) return File_Name_Type is begin Get_Name_String (Name); for J in reverse 1 .. Name_Len loop if Is_Directory_Separator (Name_Buffer (J)) then Name_Len := J; return Name_Find; end if; end loop; Name_Len := Hostparm.Normalized_CWD'Length; Name_Buffer (1 .. Name_Len) := Hostparm.Normalized_CWD; return Name_Find; end Get_Directory; ------------------------------ -- Get_First_Main_File_Name -- ------------------------------ function Get_First_Main_File_Name return String is begin return File_Names (1).all; end Get_First_Main_File_Name; -------------------------- -- Get_Next_Dir_In_Path -- -------------------------- Search_Path_Pos : Integer; -- Keeps track of current position in search path. Initialized by the -- call to Get_Next_Dir_In_Path_Init, updated by Get_Next_Dir_In_Path. function Get_Next_Dir_In_Path (Search_Path : String_Access) return String_Access is Lower_Bound : Positive := Search_Path_Pos; Upper_Bound : Positive; begin loop while Lower_Bound <= Search_Path'Last and then Search_Path.all (Lower_Bound) = Path_Separator loop Lower_Bound := Lower_Bound + 1; end loop; exit when Lower_Bound > Search_Path'Last; Upper_Bound := Lower_Bound; while Upper_Bound <= Search_Path'Last and then Search_Path.all (Upper_Bound) /= Path_Separator loop Upper_Bound := Upper_Bound + 1; end loop; Search_Path_Pos := Upper_Bound; return new String'(Search_Path.all (Lower_Bound .. Upper_Bound - 1)); end loop; return null; end Get_Next_Dir_In_Path; ------------------------------- -- Get_Next_Dir_In_Path_Init -- ------------------------------- procedure Get_Next_Dir_In_Path_Init (Search_Path : String_Access) is begin Search_Path_Pos := Search_Path'First; end Get_Next_Dir_In_Path_Init; -------------------------------------- -- Get_Primary_Src_Search_Directory -- -------------------------------------- function Get_Primary_Src_Search_Directory return String_Ptr is begin return Src_Search_Directories.Table (Primary_Directory); end Get_Primary_Src_Search_Directory; ------------------------ -- Get_RTS_Search_Dir -- ------------------------ function Get_RTS_Search_Dir (Search_Dir : String; File_Type : Search_File_Type) return String_Ptr is procedure Get_Current_Dir (Dir : System.Address; Length : System.Address); pragma Import (C, Get_Current_Dir, "__gnat_get_current_dir"); Max_Path : Integer; pragma Import (C, Max_Path, "__gnat_max_path_len"); -- Maximum length of a path name Current_Dir : String_Ptr; Default_Search_Dir : String_Access; Default_Suffix_Dir : String_Access; Local_Search_Dir : String_Access; Norm_Search_Dir : String_Access; Result_Search_Dir : String_Access; Search_File : String_Access; Temp_String : String_Ptr; begin -- Add a directory separator at the end of the directory if necessary -- so that we can directly append a file to the directory if not Is_Directory_Separator (Search_Dir (Search_Dir'Last)) then Local_Search_Dir := new String'(Search_Dir & String'(1 => Directory_Separator)); else Local_Search_Dir := new String'(Search_Dir); end if; if File_Type = Include then Search_File := Include_Search_File; Default_Suffix_Dir := new String'("adainclude"); else Search_File := Objects_Search_File; Default_Suffix_Dir := new String'("adalib"); end if; Norm_Search_Dir := Local_Search_Dir; if Is_Absolute_Path (Norm_Search_Dir.all) then -- We first verify if there is a directory Include_Search_Dir -- containing default search directories Result_Search_Dir := Read_Default_Search_Dirs (Norm_Search_Dir, Search_File, null); Default_Search_Dir := new String'(Norm_Search_Dir.all & Default_Suffix_Dir.all); Free (Norm_Search_Dir); if Result_Search_Dir /= null then return String_Ptr (Result_Search_Dir); elsif Is_Directory (Default_Search_Dir.all) then return String_Ptr (Default_Search_Dir); else return null; end if; -- Search in the current directory else -- Get the current directory declare Buffer : String (1 .. Max_Path + 2); Path_Len : Natural := Max_Path; begin Get_Current_Dir (Buffer'Address, Path_Len'Address); if Path_Len = 0 then raise Program_Error; end if; if not Is_Directory_Separator (Buffer (Path_Len)) then Path_Len := Path_Len + 1; Buffer (Path_Len) := Directory_Separator; end if; Current_Dir := new String'(Buffer (1 .. Path_Len)); end; Norm_Search_Dir := new String'(Current_Dir.all & Local_Search_Dir.all); Result_Search_Dir := Read_Default_Search_Dirs (Norm_Search_Dir, Search_File, null); Default_Search_Dir := new String'(Norm_Search_Dir.all & Default_Suffix_Dir.all); Free (Norm_Search_Dir); if Result_Search_Dir /= null then return String_Ptr (Result_Search_Dir); elsif Is_Directory (Default_Search_Dir.all) then return String_Ptr (Default_Search_Dir); else -- Search in Search_Dir_Prefix/Search_Dir Norm_Search_Dir := new String' (Update_Path (Search_Dir_Prefix).all & Local_Search_Dir.all); Result_Search_Dir := Read_Default_Search_Dirs (Norm_Search_Dir, Search_File, null); Default_Search_Dir := new String'(Norm_Search_Dir.all & Default_Suffix_Dir.all); Free (Norm_Search_Dir); if Result_Search_Dir /= null then return String_Ptr (Result_Search_Dir); elsif Is_Directory (Default_Search_Dir.all) then return String_Ptr (Default_Search_Dir); else -- We finally search in Search_Dir_Prefix/rts-Search_Dir Temp_String := new String'(Update_Path (Search_Dir_Prefix).all & "rts-"); Norm_Search_Dir := new String'(Temp_String.all & Local_Search_Dir.all); Result_Search_Dir := Read_Default_Search_Dirs (Norm_Search_Dir, Search_File, null); Default_Search_Dir := new String'(Norm_Search_Dir.all & Default_Suffix_Dir.all); Free (Norm_Search_Dir); if Result_Search_Dir /= null then return String_Ptr (Result_Search_Dir); elsif Is_Directory (Default_Search_Dir.all) then return String_Ptr (Default_Search_Dir); else return null; end if; end if; end if; end if; end Get_RTS_Search_Dir; -------------------------------- -- Include_Dir_Default_Prefix -- -------------------------------- function Include_Dir_Default_Prefix return String_Access is begin if The_Include_Dir_Default_Prefix = null then The_Include_Dir_Default_Prefix := String_Access (Update_Path (Include_Dir_Default_Name)); end if; return The_Include_Dir_Default_Prefix; end Include_Dir_Default_Prefix; function Include_Dir_Default_Prefix return String is begin return Include_Dir_Default_Prefix.all; end Include_Dir_Default_Prefix; ---------------- -- Initialize -- ---------------- procedure Initialize is begin Number_File_Names := 0; Current_File_Name_Index := 0; Src_Search_Directories.Init; Lib_Search_Directories.Init; -- Start off by setting all suppress options, to False. The special -- overflow fields are set to Not_Set (they will be set by -gnatp, or -- by -gnato, or, if neither of these appear, in Adjust_Global_Switches -- in Gnat1drv). Suppress_Options := ((others => False), Not_Set, Not_Set); -- Reserve the first slot in the search paths table. This is the -- directory of the main source file or main library file and is filled -- in by each call to Next_Main_Source/Next_Main_Lib_File with the -- directory specified for this main source or library file. This is the -- directory which is searched first by default. This default search is -- inhibited by the option -I- for both source and library files. Src_Search_Directories.Set_Last (Primary_Directory); Src_Search_Directories.Table (Primary_Directory) := new String'(""); Lib_Search_Directories.Set_Last (Primary_Directory); Lib_Search_Directories.Table (Primary_Directory) := new String'(""); end Initialize; ------------------ -- Is_Directory -- ------------------ function Is_Directory (Name : C_File_Name; Attr : access File_Attributes) return Boolean is function Internal (N : C_File_Name; A : System.Address) return Integer; pragma Import (C, Internal, "__gnat_is_directory_attr"); begin return Internal (Name, Attr.all'Address) /= 0; end Is_Directory; ---------------------------- -- Is_Directory_Separator -- ---------------------------- function Is_Directory_Separator (C : Character) return Boolean is begin -- In addition to the default directory_separator allow the '/' to -- act as separator since this is allowed in MS-DOS and Windows. return C = Directory_Separator or else C = '/'; end Is_Directory_Separator; ------------------------- -- Is_Readonly_Library -- ------------------------- function Is_Readonly_Library (File : File_Name_Type) return Boolean is begin Get_Name_String (File); pragma Assert (Name_Buffer (Name_Len - 3 .. Name_Len) = ".ali"); return not Is_Writable_File (Name_Buffer (1 .. Name_Len)); end Is_Readonly_Library; ------------------------ -- Is_Executable_File -- ------------------------ function Is_Executable_File (Name : C_File_Name; Attr : access File_Attributes) return Boolean is function Internal (N : C_File_Name; A : System.Address) return Integer; pragma Import (C, Internal, "__gnat_is_executable_file_attr"); begin return Internal (Name, Attr.all'Address) /= 0; end Is_Executable_File; ---------------------- -- Is_Readable_File -- ---------------------- function Is_Readable_File (Name : C_File_Name; Attr : access File_Attributes) return Boolean is function Internal (N : C_File_Name; A : System.Address) return Integer; pragma Import (C, Internal, "__gnat_is_readable_file_attr"); begin return Internal (Name, Attr.all'Address) /= 0; end Is_Readable_File; --------------------- -- Is_Regular_File -- --------------------- function Is_Regular_File (Name : C_File_Name; Attr : access File_Attributes) return Boolean is function Internal (N : C_File_Name; A : System.Address) return Integer; pragma Import (C, Internal, "__gnat_is_regular_file_attr"); begin return Internal (Name, Attr.all'Address) /= 0; end Is_Regular_File; ---------------------- -- Is_Symbolic_Link -- ---------------------- function Is_Symbolic_Link (Name : C_File_Name; Attr : access File_Attributes) return Boolean is function Internal (N : C_File_Name; A : System.Address) return Integer; pragma Import (C, Internal, "__gnat_is_symbolic_link_attr"); begin return Internal (Name, Attr.all'Address) /= 0; end Is_Symbolic_Link; ---------------------- -- Is_Writable_File -- ---------------------- function Is_Writable_File (Name : C_File_Name; Attr : access File_Attributes) return Boolean is function Internal (N : C_File_Name; A : System.Address) return Integer; pragma Import (C, Internal, "__gnat_is_writable_file_attr"); begin return Internal (Name, Attr.all'Address) /= 0; end Is_Writable_File; ------------------- -- Lib_File_Name -- ------------------- function Lib_File_Name (Source_File : File_Name_Type; Munit_Index : Nat := 0) return File_Name_Type is begin Get_Name_String (Source_File); for J in reverse 2 .. Name_Len loop if Name_Buffer (J) = '.' then Name_Len := J - 1; exit; end if; end loop; if Munit_Index /= 0 then Add_Char_To_Name_Buffer (Multi_Unit_Index_Character); Add_Nat_To_Name_Buffer (Munit_Index); end if; Add_Char_To_Name_Buffer ('.'); Add_Str_To_Name_Buffer (ALI_Suffix.all); return Name_Find; end Lib_File_Name; ----------------- -- Locate_File -- ----------------- procedure Locate_File (N : File_Name_Type; T : File_Type; Dir : Natural; Name : String; Found : out File_Name_Type; Attr : access File_Attributes) is Dir_Name : String_Ptr; begin -- If Name is already an absolute path, do not look for a directory if Is_Absolute_Path (Name) then Dir_Name := No_Dir; elsif T = Library then Dir_Name := Lib_Search_Directories.Table (Dir); else pragma Assert (T /= Config); Dir_Name := Src_Search_Directories.Table (Dir); end if; declare Full_Name : String (1 .. Dir_Name'Length + Name'Length + 1); begin Full_Name (1 .. Dir_Name'Length) := Dir_Name.all; Full_Name (Dir_Name'Length + 1 .. Full_Name'Last - 1) := Name; Full_Name (Full_Name'Last) := ASCII.NUL; Attr.all := Unknown_Attributes; if not Is_Regular_File (Full_Name'Address, Attr) then Found := No_File; else -- If the file is in the current directory then return N itself if Dir_Name'Length = 0 then Found := N; else Name_Len := Full_Name'Length - 1; Name_Buffer (1 .. Name_Len) := Full_Name (1 .. Full_Name'Last - 1); Found := Name_Find; -- ??? Was Name_Enter, no obvious reason end if; end if; end; end Locate_File; ------------------------------- -- Matching_Full_Source_Name -- ------------------------------- function Matching_Full_Source_Name (N : File_Name_Type; T : Time_Stamp_Type) return File_Name_Type is begin Get_Name_String (N); declare File_Name : constant String := Name_Buffer (1 .. Name_Len); File : File_Name_Type := No_File; Attr : aliased File_Attributes; Last_Dir : Natural; begin if Opt.Look_In_Primary_Dir then Locate_File (N, Source, Primary_Directory, File_Name, File, Attr'Access); if File /= No_File and then T = File_Stamp (N) then return File; end if; end if; Last_Dir := Src_Search_Directories.Last; for D in Primary_Directory + 1 .. Last_Dir loop Locate_File (N, Source, D, File_Name, File, Attr'Access); if File /= No_File and then T = File_Stamp (File) then return File; end if; end loop; return No_File; end; end Matching_Full_Source_Name; ---------------- -- More_Files -- ---------------- function More_Files return Boolean is begin return (Current_File_Name_Index < Number_File_Names); end More_Files; ------------------------------- -- Nb_Dir_In_Obj_Search_Path -- ------------------------------- function Nb_Dir_In_Obj_Search_Path return Natural is begin if Opt.Look_In_Primary_Dir then return Lib_Search_Directories.Last - Primary_Directory + 1; else return Lib_Search_Directories.Last - Primary_Directory; end if; end Nb_Dir_In_Obj_Search_Path; ------------------------------- -- Nb_Dir_In_Src_Search_Path -- ------------------------------- function Nb_Dir_In_Src_Search_Path return Natural is begin if Opt.Look_In_Primary_Dir then return Src_Search_Directories.Last - Primary_Directory + 1; else return Src_Search_Directories.Last - Primary_Directory; end if; end Nb_Dir_In_Src_Search_Path; -------------------- -- Next_Main_File -- -------------------- function Next_Main_File return File_Name_Type is File_Name : String_Ptr; Dir_Name : String_Ptr; Fptr : Natural; begin pragma Assert (More_Files); Current_File_Name_Index := Current_File_Name_Index + 1; -- Get the file and directory name File_Name := File_Names (Current_File_Name_Index); Fptr := File_Name'First; for J in reverse File_Name'Range loop if Is_Directory_Separator (File_Name (J)) then if J = File_Name'Last then Fail ("File name missing"); end if; Fptr := J + 1; exit; end if; end loop; -- Save name of directory in which main unit resides for use in -- locating other units Dir_Name := new String'(File_Name (File_Name'First .. Fptr - 1)); case Running_Program is when Compiler => Src_Search_Directories.Table (Primary_Directory) := Dir_Name; Look_In_Primary_Directory_For_Current_Main := True; when Make => Src_Search_Directories.Table (Primary_Directory) := Dir_Name; if Fptr > File_Name'First then Look_In_Primary_Directory_For_Current_Main := True; end if; when Binder | Gnatls => Dir_Name := Normalize_Directory_Name (Dir_Name.all); Lib_Search_Directories.Table (Primary_Directory) := Dir_Name; when Unspecified => null; end case; Name_Len := File_Name'Last - Fptr + 1; Name_Buffer (1 .. Name_Len) := File_Name (Fptr .. File_Name'Last); Canonical_Case_File_Name (Name_Buffer (1 .. Name_Len)); Current_Main := Name_Find; -- In the gnatmake case, the main file may have not have the -- extension. Try ".adb" first then ".ads" if Running_Program = Make then declare Orig_Main : constant File_Name_Type := Current_Main; begin if Strip_Suffix (Orig_Main) = Orig_Main then Current_Main := Append_Suffix_To_File_Name (Orig_Main, ".adb"); if Full_Source_Name (Current_Main) = No_File then Current_Main := Append_Suffix_To_File_Name (Orig_Main, ".ads"); if Full_Source_Name (Current_Main) = No_File then Current_Main := Orig_Main; end if; end if; end if; end; end if; return Current_Main; end Next_Main_File; ------------------------------ -- Normalize_Directory_Name -- ------------------------------ function Normalize_Directory_Name (Directory : String) return String_Ptr is function Is_Quoted (Path : String) return Boolean; pragma Inline (Is_Quoted); -- Returns true if Path is quoted (either double or single quotes) --------------- -- Is_Quoted -- --------------- function Is_Quoted (Path : String) return Boolean is First : constant Character := Path (Path'First); Last : constant Character := Path (Path'Last); begin if (First = ''' and then Last = ''') or else (First = '"' and then Last = '"') then return True; else return False; end if; end Is_Quoted; Result : String_Ptr; -- Start of processing for Normalize_Directory_Name begin if Directory'Length = 0 then Result := new String'(Hostparm.Normalized_CWD); elsif Is_Directory_Separator (Directory (Directory'Last)) then Result := new String'(Directory); elsif Is_Quoted (Directory) then -- This is a quoted string, it certainly means that the directory -- contains some spaces for example. We can safely remove the quotes -- here as the OS_Lib.Normalize_Arguments will be called before any -- spawn routines. This ensure that quotes will be added when needed. Result := new String (1 .. Directory'Length - 1); Result (1 .. Directory'Length - 2) := Directory (Directory'First + 1 .. Directory'Last - 1); Result (Result'Last) := Directory_Separator; else Result := new String (1 .. Directory'Length + 1); Result (1 .. Directory'Length) := Directory; Result (Directory'Length + 1) := Directory_Separator; end if; return Result; end Normalize_Directory_Name; --------------------- -- Number_Of_Files -- --------------------- function Number_Of_Files return Nat is begin return Number_File_Names; end Number_Of_Files; ------------------------------- -- Object_Dir_Default_Prefix -- ------------------------------- function Object_Dir_Default_Prefix return String is Object_Dir : String_Access := String_Access (Update_Path (Object_Dir_Default_Name)); begin if Object_Dir = null then return ""; else declare Result : constant String := Object_Dir.all; begin Free (Object_Dir); return Result; end; end if; end Object_Dir_Default_Prefix; ---------------------- -- Object_File_Name -- ---------------------- function Object_File_Name (N : File_Name_Type) return File_Name_Type is begin if N = No_File then return No_File; end if; Get_Name_String (N); Name_Len := Name_Len - ALI_Suffix'Length - 1; for J in Target_Object_Suffix'Range loop Name_Len := Name_Len + 1; Name_Buffer (Name_Len) := Target_Object_Suffix (J); end loop; return Name_Enter; end Object_File_Name; ------------------------------- -- OS_Exit_Through_Exception -- ------------------------------- procedure OS_Exit_Through_Exception (Status : Integer) is begin Current_Exit_Status := Status; raise Types.Terminate_Program; end OS_Exit_Through_Exception; -------------------------- -- OS_Time_To_GNAT_Time -- -------------------------- function OS_Time_To_GNAT_Time (T : OS_Time) return Time_Stamp_Type is GNAT_Time : Time_Stamp_Type; type Underlying_OS_Time is range -(2 ** (Standard'Address_Size - Integer'(1))) .. +(2 ** (Standard'Address_Size - Integer'(1)) - 1); -- Underlying_OS_Time is a redeclaration of OS_Time to allow integer -- manipulation. Remove this in favor of To_Ada/To_C once newer -- GNAT releases are available with these functions. function To_Int is new Unchecked_Conversion (OS_Time, Underlying_OS_Time); function From_Int is new Unchecked_Conversion (Underlying_OS_Time, OS_Time); TI : Underlying_OS_Time := To_Int (T); Y : Year_Type; Mo : Month_Type; D : Day_Type; H : Hour_Type; Mn : Minute_Type; S : Second_Type; begin if T = Invalid_Time then return Empty_Time_Stamp; end if; if On_Windows and then TI mod 2 > 0 then -- Windows ALI files had timestamps rounded to even seconds -- historically. The rounding was originally done in GM_Split. -- Now that GM_Split no longer does it, we are rounding it here -- only for ALI files. TI := TI + 1; end if; GM_Split (From_Int (TI), Y, Mo, D, H, Mn, S); Make_Time_Stamp (Year => Nat (Y), Month => Nat (Mo), Day => Nat (D), Hour => Nat (H), Minutes => Nat (Mn), Seconds => Nat (S), TS => GNAT_Time); return GNAT_Time; end OS_Time_To_GNAT_Time; ----------------- -- Prep_Suffix -- ----------------- function Prep_Suffix return String is begin return ".prep"; end Prep_Suffix; ------------------ -- Program_Name -- ------------------ function Program_Name (Nam : String; Prog : String) return String_Access is End_Of_Prefix : Natural := 0; Start_Of_Prefix : Positive := 1; Start_Of_Suffix : Positive; begin -- Get the name of the current program being executed Find_Program_Name; Start_Of_Suffix := Name_Len + 1; -- Find the target prefix if any, for the cross compilation case. -- For instance in "powerpc-elf-gcc" the target prefix is -- "powerpc-elf-" -- Ditto for suffix, e.g. in "gcc-4.1", the suffix is "-4.1" for J in reverse 1 .. Name_Len loop if Is_Directory_Separator (Name_Buffer (J)) or else Name_Buffer (J) = ':' then Start_Of_Prefix := J + 1; exit; end if; end loop; -- Find End_Of_Prefix for J in Start_Of_Prefix .. Name_Len - Prog'Length + 1 loop if Name_Buffer (J .. J + Prog'Length - 1) = Prog then End_Of_Prefix := J - 1; exit; end if; end loop; if End_Of_Prefix > 1 then Start_Of_Suffix := End_Of_Prefix + Prog'Length + 1; end if; -- Create the new program name return new String' (Name_Buffer (Start_Of_Prefix .. End_Of_Prefix) & Nam & Name_Buffer (Start_Of_Suffix .. Name_Len)); end Program_Name; ------------------------------ -- Read_Default_Search_Dirs -- ------------------------------ function Read_Default_Search_Dirs (Search_Dir_Prefix : String_Access; Search_File : String_Access; Search_Dir_Default_Name : String_Access) return String_Access is Prefix_Len : constant Integer := Search_Dir_Prefix.all'Length; Buffer : String (1 .. Prefix_Len + Search_File.all'Length + 1); File_FD : File_Descriptor; S, S1 : String_Access; Len : Integer; Curr : Integer; Actual_Len : Integer; J1 : Integer; Prev_Was_Separator : Boolean; Nb_Relative_Dir : Integer; function Is_Relative (S : String; K : Positive) return Boolean; pragma Inline (Is_Relative); -- Returns True if a relative directory specification is found -- in S at position K, False otherwise. ----------------- -- Is_Relative -- ----------------- function Is_Relative (S : String; K : Positive) return Boolean is begin return not Is_Absolute_Path (S (K .. S'Last)); end Is_Relative; -- Start of processing for Read_Default_Search_Dirs begin -- Construct a C compatible character string buffer Buffer (1 .. Search_Dir_Prefix.all'Length) := Search_Dir_Prefix.all; Buffer (Search_Dir_Prefix.all'Length + 1 .. Buffer'Last - 1) := Search_File.all; Buffer (Buffer'Last) := ASCII.NUL; File_FD := Open_Read (Buffer'Address, Binary); if File_FD = Invalid_FD then return Search_Dir_Default_Name; end if; Len := Integer (File_Length (File_FD)); -- An extra character for a trailing Path_Separator is allocated S := new String (1 .. Len + 1); S (Len + 1) := Path_Separator; -- Read the file. Note that the loop is probably not necessary since the -- whole file is read at once but the loop is harmless and that way we -- are sure to accommodate systems where this is not the case. Curr := 1; Actual_Len := Len; while Actual_Len /= 0 loop Actual_Len := Read (File_FD, S (Curr)'Address, Len); Curr := Curr + Actual_Len; end loop; -- Process the file, dealing with path separators Prev_Was_Separator := True; Nb_Relative_Dir := 0; for J in 1 .. Len loop -- Treat any control character as a path separator. Note that we do -- not treat space as a path separator (we used to treat space as a -- path separator in an earlier version). That way space can appear -- as a legitimate character in a path name. -- Why do we treat all control characters as path separators??? if S (J) in ASCII.NUL .. ASCII.US then S (J) := Path_Separator; end if; -- Test for explicit path separator (or control char as above) if S (J) = Path_Separator then Prev_Was_Separator := True; -- If not path separator, register use of relative directory else if Prev_Was_Separator and then Is_Relative (S.all, J) then Nb_Relative_Dir := Nb_Relative_Dir + 1; end if; Prev_Was_Separator := False; end if; end loop; if Nb_Relative_Dir = 0 then return S; end if; -- Add the Search_Dir_Prefix to all relative paths S1 := new String (1 .. S'Length + Nb_Relative_Dir * Prefix_Len); J1 := 1; Prev_Was_Separator := True; for J in 1 .. Len + 1 loop if S (J) = Path_Separator then Prev_Was_Separator := True; else if Prev_Was_Separator and then Is_Relative (S.all, J) then S1 (J1 .. J1 + Prefix_Len - 1) := Search_Dir_Prefix.all; J1 := J1 + Prefix_Len; end if; Prev_Was_Separator := False; end if; S1 (J1) := S (J); J1 := J1 + 1; end loop; Free (S); return S1; end Read_Default_Search_Dirs; ----------------------- -- Read_Library_Info -- ----------------------- function Read_Library_Info (Lib_File : File_Name_Type; Fatal_Err : Boolean := False) return Text_Buffer_Ptr is File : File_Name_Type; Attr : aliased File_Attributes; begin Find_File (Lib_File, Library, File, Attr'Access); return Read_Library_Info_From_Full (Full_Lib_File => File, Lib_File_Attr => Attr'Access, Fatal_Err => Fatal_Err); end Read_Library_Info; --------------------------------- -- Read_Library_Info_From_Full -- --------------------------------- function Read_Library_Info_From_Full (Full_Lib_File : File_Name_Type; Lib_File_Attr : access File_Attributes; Fatal_Err : Boolean := False) return Text_Buffer_Ptr is Lib_FD : File_Descriptor; -- The file descriptor for the current library file. A negative value -- indicates failure to open the specified source file. Len : Integer; -- Length of source file text (ALI). If it doesn't fit in an integer -- we're probably stuck anyway (>2 gigs of source seems a lot, and -- there are other places in the compiler that make this assumption). Text : Text_Buffer_Ptr; -- Allocated text buffer Status : Boolean; pragma Warnings (Off, Status); -- For the calls to Close begin Current_Full_Lib_Name := Full_Lib_File; Current_Full_Obj_Name := Object_File_Name (Current_Full_Lib_Name); if Current_Full_Lib_Name = No_File then if Fatal_Err then Fail ("Cannot find: " & Name_Buffer (1 .. Name_Len)); else Current_Full_Obj_Stamp := Empty_Time_Stamp; return null; end if; end if; Get_Name_String (Current_Full_Lib_Name); Name_Buffer (Name_Len + 1) := ASCII.NUL; -- Open the library FD, note that we open in binary mode, because as -- documented in the spec, the caller is expected to handle either -- DOS or Unix mode files, and there is no point in wasting time on -- text translation when it is not required. Lib_FD := Open_Read (Name_Buffer'Address, Binary); if Lib_FD = Invalid_FD then if Fatal_Err then Fail ("Cannot open: " & Name_Buffer (1 .. Name_Len)); else Current_Full_Obj_Stamp := Empty_Time_Stamp; return null; end if; end if; -- Compute the length of the file (potentially also preparing other data -- like the timestamp and whether the file is read-only, for future use) Len := Integer (File_Length (Name_Buffer'Address, Lib_File_Attr)); -- Check for object file consistency if requested if Opt.Check_Object_Consistency then -- On most systems, this does not result in an extra system call Current_Full_Lib_Stamp := OS_Time_To_GNAT_Time (File_Time_Stamp (Name_Buffer'Address, Lib_File_Attr)); -- ??? One system call here Current_Full_Obj_Stamp := File_Stamp (Current_Full_Obj_Name); if Current_Full_Obj_Stamp (1) = ' ' then -- When the library is readonly always assume object is consistent -- The call to Is_Writable_File only results in a system call on -- some systems, but in most cases it has already been computed as -- part of the call to File_Length above. Get_Name_String (Current_Full_Lib_Name); Name_Buffer (Name_Len + 1) := ASCII.NUL; if not Is_Writable_File (Name_Buffer'Address, Lib_File_Attr) then Current_Full_Obj_Stamp := Current_Full_Lib_Stamp; elsif Fatal_Err then Get_Name_String (Current_Full_Obj_Name); Close (Lib_FD, Status); -- No need to check the status, we fail anyway Fail ("Cannot find: " & Name_Buffer (1 .. Name_Len)); else Current_Full_Obj_Stamp := Empty_Time_Stamp; Close (Lib_FD, Status); -- No need to check the status, we return null anyway return null; end if; elsif Current_Full_Obj_Stamp < Current_Full_Lib_Stamp then Close (Lib_FD, Status); -- No need to check the status, we return null anyway return null; end if; end if; -- Read data from the file declare Actual_Len : Integer := 0; Lo : constant Text_Ptr := 0; -- Low bound for allocated text buffer Hi : Text_Ptr := Text_Ptr (Len); -- High bound for allocated text buffer. Note length is Len + 1 -- which allows for extra EOF character at the end of the buffer. begin -- Allocate text buffer. Note extra character at end for EOF Text := new Text_Buffer (Lo .. Hi); -- Some systems have file types that require one read per line, -- so read until we get the Len bytes or until there are no more -- characters. Hi := Lo; loop Actual_Len := Read (Lib_FD, Text (Hi)'Address, Len); Hi := Hi + Text_Ptr (Actual_Len); exit when Actual_Len = Len or else Actual_Len <= 0; end loop; Text (Hi) := EOF; end; -- Read is complete, close file and we are done Close (Lib_FD, Status); -- The status should never be False. But, if it is, what can we do? -- So, we don't test it. return Text; end Read_Library_Info_From_Full; ---------------------- -- Read_Source_File -- ---------------------- procedure Read_Source_File (N : File_Name_Type; Lo : Source_Ptr; Hi : out Source_Ptr; Src : out Source_Buffer_Ptr; FD : out File_Descriptor; T : File_Type := Source) is Len : Integer; -- Length of file, assume no more than 2 gigabytes of source Actual_Len : Integer; Status : Boolean; pragma Warnings (Off, Status); -- For the call to Close begin Current_Full_Source_Name := Find_File (N, T, Full_Name => True); Current_Full_Source_Stamp := File_Stamp (Current_Full_Source_Name); if Current_Full_Source_Name = No_File then -- If we were trying to access the main file and we could not find -- it, we have an error. if N = Current_Main then Get_Name_String (N); Fail ("Cannot find: " & Name_Buffer (1 .. Name_Len)); end if; FD := Null_FD; Src := null; Hi := No_Location; return; end if; Get_Name_String (Current_Full_Source_Name); Name_Buffer (Name_Len + 1) := ASCII.NUL; -- Open the source FD, note that we open in binary mode, because as -- documented in the spec, the caller is expected to handle either -- DOS or Unix mode files, and there is no point in wasting time on -- text translation when it is not required. FD := Open_Read (Name_Buffer'Address, Binary); if FD = Invalid_FD then Src := null; Hi := No_Location; return; end if; -- If it's a Source file, print out the file name, if requested, and if -- it's not part of the runtimes, store it in File_Name_Chars. We don't -- want to print non-Source files, like GNAT-TEMP-000001.TMP used to -- pass information from gprbuild to gcc. We don't want to save runtime -- file names, because we don't want users to send them in bug reports. if T = Source then declare Name : String renames Name_Buffer (1 .. Name_Len); Inc : String renames Include_Dir_Default_Prefix.all; Part_Of_Runtimes : constant Boolean := Inc /= "" and then Inc'Length < Name_Len and then Name_Buffer (1 .. Inc'Length) = Inc; begin if Debug.Debug_Flag_Dot_N then Write_Line (Name); end if; if not Part_Of_Runtimes then File_Name_Chars.Append_All (File_Name_Chars.Table_Type (Name)); File_Name_Chars.Append (ASCII.LF); end if; end; end if; -- Prepare to read data from the file Len := Integer (File_Length (FD)); -- Set Hi so that length is one more than the physical length, -- allowing for the extra EOF character at the end of the buffer Hi := Lo + Source_Ptr (Len); -- Do the actual read operation declare Var_Ptr : constant Source_Buffer_Ptr_Var := new Source_Buffer (Lo .. Hi); -- Allocate source buffer, allowing extra character at end for EOF begin -- Some systems have file types that require one read per line, -- so read until we get the Len bytes or until there are no more -- characters. Hi := Lo; loop Actual_Len := Read (FD, Var_Ptr (Hi)'Address, Len); Hi := Hi + Source_Ptr (Actual_Len); exit when Actual_Len = Len or else Actual_Len <= 0; end loop; Var_Ptr (Hi) := EOF; Src := Var_Ptr.all'Access; end; -- Read is complete, get time stamp and close file and we are done Close (FD, Status); -- The status should never be False. But, if it is, what can we do? -- So, we don't test it. -- ???We don't really need to return Hi anymore; We could get rid of -- it. We could also make this into a function. pragma Assert (Hi = Src'Last); end Read_Source_File; ------------------- -- Relocate_Path -- ------------------- function Relocate_Path (Prefix : String; Path : String) return String_Ptr is S : String_Ptr; procedure set_std_prefix (S : String; Len : Integer); pragma Import (C, set_std_prefix); begin if Std_Prefix = null then Std_Prefix := Executable_Prefix; if Std_Prefix.all /= "" then -- Remove trailing directory separator when calling set_std_prefix set_std_prefix (Std_Prefix.all, Std_Prefix'Length - 1); end if; end if; if Path'Last >= Prefix'Last and then Path (Prefix'Range) = Prefix then if Std_Prefix.all /= "" then S := new String (1 .. Std_Prefix'Length + Path'Last - Prefix'Last); S (1 .. Std_Prefix'Length) := Std_Prefix.all; S (Std_Prefix'Length + 1 .. S'Last) := Path (Prefix'Last + 1 .. Path'Last); return S; end if; end if; return new String'(Path); end Relocate_Path; ----------------- -- Set_Program -- ----------------- procedure Set_Program (P : Program_Type) is begin if Program_Set then Fail ("Set_Program called twice"); end if; Program_Set := True; Running_Program := P; end Set_Program; ---------------- -- Shared_Lib -- ---------------- function Shared_Lib (Name : String) return String is Library : String (1 .. Name'Length + Library_Version'Length + 3); -- 3 = 2 for "-l" + 1 for "-" before lib version begin Library (1 .. 2) := "-l"; Library (3 .. 2 + Name'Length) := Name; Library (3 + Name'Length) := '-'; Library (4 + Name'Length .. Library'Last) := Library_Version; return Library; end Shared_Lib; ---------------------- -- Smart_File_Stamp -- ---------------------- function Smart_File_Stamp (N : File_Name_Type; T : File_Type) return Time_Stamp_Type is File : File_Name_Type; Attr : aliased File_Attributes; begin if not File_Cache_Enabled then Find_File (N, T, File, Attr'Access); else Smart_Find_File (N, T, File, Attr); end if; if File = No_File then return Empty_Time_Stamp; else Get_Name_String (File); Name_Buffer (Name_Len + 1) := ASCII.NUL; return OS_Time_To_GNAT_Time (File_Time_Stamp (Name_Buffer'Address, Attr'Access)); end if; end Smart_File_Stamp; --------------------- -- Smart_Find_File -- --------------------- function Smart_Find_File (N : File_Name_Type; T : File_Type) return File_Name_Type is File : File_Name_Type; Attr : File_Attributes; begin Smart_Find_File (N, T, File, Attr); return File; end Smart_Find_File; --------------------- -- Smart_Find_File -- --------------------- procedure Smart_Find_File (N : File_Name_Type; T : File_Type; Found : out File_Name_Type; Attr : out File_Attributes) is Info : File_Info_Cache; begin if not File_Cache_Enabled then Find_File (N, T, Info.File, Info.Attr'Access); else Info := File_Name_Hash_Table.Get (N); if Info.File = No_File then Find_File (N, T, Info.File, Info.Attr'Access); File_Name_Hash_Table.Set (N, Info); end if; end if; Found := Info.File; Attr := Info.Attr; end Smart_Find_File; ---------------------- -- Source_File_Data -- ---------------------- procedure Source_File_Data (Cache : Boolean) is begin File_Cache_Enabled := Cache; end Source_File_Data; ----------------------- -- Source_File_Stamp -- ----------------------- function Source_File_Stamp (N : File_Name_Type) return Time_Stamp_Type is begin return Smart_File_Stamp (N, Source); end Source_File_Stamp; --------------------- -- Strip_Directory -- --------------------- function Strip_Directory (Name : File_Name_Type) return File_Name_Type is begin Get_Name_String (Name); for J in reverse 1 .. Name_Len - 1 loop -- If we find the last directory separator if Is_Directory_Separator (Name_Buffer (J)) then -- Return part of Name that follows this last directory separator Name_Buffer (1 .. Name_Len - J) := Name_Buffer (J + 1 .. Name_Len); Name_Len := Name_Len - J; return Name_Find; end if; end loop; -- There were no directory separator, just return Name return Name; end Strip_Directory; ------------------ -- Strip_Suffix -- ------------------ function Strip_Suffix (Name : File_Name_Type) return File_Name_Type is begin Get_Name_String (Name); for J in reverse 2 .. Name_Len loop -- If we found the last '.', return part of Name that precedes it if Name_Buffer (J) = '.' then Name_Len := J - 1; return Name_Enter; end if; end loop; return Name; end Strip_Suffix; --------------------------- -- To_Canonical_File_List -- --------------------------- function To_Canonical_File_List (Wildcard_Host_File : String; Only_Dirs : Boolean) return String_Access_List_Access is function To_Canonical_File_List_Init (Host_File : Address; Only_Dirs : Integer) return Integer; pragma Import (C, To_Canonical_File_List_Init, "__gnat_to_canonical_file_list_init"); function To_Canonical_File_List_Next return Address; pragma Import (C, To_Canonical_File_List_Next, "__gnat_to_canonical_file_list_next"); procedure To_Canonical_File_List_Free; pragma Import (C, To_Canonical_File_List_Free, "__gnat_to_canonical_file_list_free"); Num_Files : Integer; C_Wildcard_Host_File : String (1 .. Wildcard_Host_File'Length + 1); begin C_Wildcard_Host_File (1 .. Wildcard_Host_File'Length) := Wildcard_Host_File; C_Wildcard_Host_File (C_Wildcard_Host_File'Last) := ASCII.NUL; -- Do the expansion and say how many there are Num_Files := To_Canonical_File_List_Init (C_Wildcard_Host_File'Address, Boolean'Pos (Only_Dirs)); declare Canonical_File_List : String_Access_List (1 .. Num_Files); Canonical_File_Addr : Address; Canonical_File_Len : CRTL.size_t; begin -- Retrieve the expanded directory names and build the list for J in 1 .. Num_Files loop Canonical_File_Addr := To_Canonical_File_List_Next; Canonical_File_Len := C_String_Length (Canonical_File_Addr); Canonical_File_List (J) := To_Path_String_Access (Canonical_File_Addr, Canonical_File_Len); end loop; -- Free up the storage To_Canonical_File_List_Free; return new String_Access_List'(Canonical_File_List); end; end To_Canonical_File_List; ---------------------- -- To_Host_Dir_Spec -- ---------------------- function To_Host_Dir_Spec (Canonical_Dir : String; Prefix_Style : Boolean) return String_Access is function To_Host_Dir_Spec (Canonical_Dir : Address; Prefix_Flag : Integer) return Address; pragma Import (C, To_Host_Dir_Spec, "__gnat_to_host_dir_spec"); C_Canonical_Dir : String (1 .. Canonical_Dir'Length + 1); Host_Dir_Addr : Address; Host_Dir_Len : CRTL.size_t; begin C_Canonical_Dir (1 .. Canonical_Dir'Length) := Canonical_Dir; C_Canonical_Dir (C_Canonical_Dir'Last) := ASCII.NUL; if Prefix_Style then Host_Dir_Addr := To_Host_Dir_Spec (C_Canonical_Dir'Address, 1); else Host_Dir_Addr := To_Host_Dir_Spec (C_Canonical_Dir'Address, 0); end if; Host_Dir_Len := C_String_Length (Host_Dir_Addr); if Host_Dir_Len = 0 then return null; else return To_Path_String_Access (Host_Dir_Addr, Host_Dir_Len); end if; end To_Host_Dir_Spec; ----------------------- -- To_Host_File_Spec -- ----------------------- function To_Host_File_Spec (Canonical_File : String) return String_Access is function To_Host_File_Spec (Canonical_File : Address) return Address; pragma Import (C, To_Host_File_Spec, "__gnat_to_host_file_spec"); C_Canonical_File : String (1 .. Canonical_File'Length + 1); Host_File_Addr : Address; Host_File_Len : CRTL.size_t; begin C_Canonical_File (1 .. Canonical_File'Length) := Canonical_File; C_Canonical_File (C_Canonical_File'Last) := ASCII.NUL; Host_File_Addr := To_Host_File_Spec (C_Canonical_File'Address); Host_File_Len := C_String_Length (Host_File_Addr); if Host_File_Len = 0 then return null; else return To_Path_String_Access (Host_File_Addr, Host_File_Len); end if; end To_Host_File_Spec; --------------------------- -- To_Path_String_Access -- --------------------------- function To_Path_String_Access (Path_Addr : Address; Path_Len : CRTL.size_t) return String_Access is subtype Path_String is String (1 .. Integer (Path_Len)); type Path_String_Access is access Path_String; function Address_To_Access is new Unchecked_Conversion (Source => Address, Target => Path_String_Access); Path_Access : constant Path_String_Access := Address_To_Access (Path_Addr); Return_Val : String_Access; begin Return_Val := new String (1 .. Integer (Path_Len)); for J in 1 .. Integer (Path_Len) loop Return_Val (J) := Path_Access (J); end loop; return Return_Val; end To_Path_String_Access; ----------------- -- Update_Path -- ----------------- function Update_Path (Path : String_Ptr) return String_Ptr is function C_Update_Path (Path, Component : Address) return Address; pragma Import (C, C_Update_Path, "update_path"); In_Length : constant Integer := Path'Length; In_String : String (1 .. In_Length + 1); Component_Name : aliased String := "GCC" & ASCII.NUL; Result_Ptr : Address; Result_Length : CRTL.size_t; Out_String : String_Ptr; begin In_String (1 .. In_Length) := Path.all; In_String (In_Length + 1) := ASCII.NUL; Result_Ptr := C_Update_Path (In_String'Address, Component_Name'Address); Result_Length := CRTL.strlen (Result_Ptr); Out_String := new String (1 .. Integer (Result_Length)); CRTL.strncpy (Out_String.all'Address, Result_Ptr, Result_Length); return Out_String; end Update_Path; ---------------- -- Write_Info -- ---------------- procedure Write_Info (Info : String) is begin Write_With_Check (Info'Address, Info'Length); Write_With_Check (EOL'Address, 1); end Write_Info; ------------------------ -- Write_Program_Name -- ------------------------ procedure Write_Program_Name is Save_Buffer : constant String (1 .. Name_Len) := Name_Buffer (1 .. Name_Len); begin Find_Program_Name; -- Convert the name to lower case so error messages are the same on -- all systems. for J in 1 .. Name_Len loop if Name_Buffer (J) in 'A' .. 'Z' then Name_Buffer (J) := Character'Val (Character'Pos (Name_Buffer (J)) + 32); end if; end loop; Write_Str (Name_Buffer (1 .. Name_Len)); -- Restore Name_Buffer which was clobbered by the call to -- Find_Program_Name Name_Len := Save_Buffer'Last; Name_Buffer (1 .. Name_Len) := Save_Buffer; end Write_Program_Name; ---------------------- -- Write_With_Check -- ---------------------- procedure Write_With_Check (A : Address; N : Integer) is Ignore : Boolean; begin if N = Write (Output_FD, A, N) then return; else Write_Str ("error: disk full writing "); Write_Name_Decoded (Output_File_Name); Write_Eol; Name_Len := Name_Len + 1; Name_Buffer (Name_Len) := ASCII.NUL; Delete_File (Name_Buffer'Address, Ignore); Exit_Program (E_Fatal); end if; end Write_With_Check; ---------------------------- -- Package Initialization -- ---------------------------- procedure Reset_File_Attributes (Attr : System.Address); pragma Import (C, Reset_File_Attributes, "__gnat_reset_attributes"); begin Initialization : declare function Get_Default_Identifier_Character_Set return Character; pragma Import (C, Get_Default_Identifier_Character_Set, "__gnat_get_default_identifier_character_set"); -- Function to determine the default identifier character set, -- which is system dependent. See Opt package spec for a list of -- the possible character codes and their interpretations. function Get_Maximum_File_Name_Length return Int; pragma Import (C, Get_Maximum_File_Name_Length, "__gnat_get_maximum_file_name_length"); -- Function to get maximum file name length for system Sizeof_File_Attributes : Integer; pragma Import (C, Sizeof_File_Attributes, "__gnat_size_of_file_attributes"); begin pragma Assert (Sizeof_File_Attributes <= File_Attributes_Size); Reset_File_Attributes (Unknown_Attributes'Address); Identifier_Character_Set := Get_Default_Identifier_Character_Set; Maximum_File_Name_Length := Get_Maximum_File_Name_Length; -- Following should be removed by having above function return -- Integer'Last as indication of no maximum instead of -1 ??? if Maximum_File_Name_Length = -1 then Maximum_File_Name_Length := Int'Last; end if; Src_Search_Directories.Set_Last (Primary_Directory); Src_Search_Directories.Table (Primary_Directory) := new String'(""); Lib_Search_Directories.Set_Last (Primary_Directory); Lib_Search_Directories.Table (Primary_Directory) := new String'(""); Osint.Initialize; end Initialization; end Osint;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 2020, 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. -- -- -- ------------------------------------------------------------------------------ with HAL; use HAL; with Minisamd51; procedure Main is procedure Busy; V : Integer with Volatile; ---------- -- Busy -- ---------- procedure Busy is begin for X in 0 .. 1_000_000 loop V := 0; end loop; end Busy; begin loop for Step in 1 .. 3 loop for Val in UInt8 loop Busy; if Minisamd51.Button_Pressed then Minisamd51.Turn_On_LED; else Minisamd51.Turn_Off_LED; end if; case Step is when 1 => Minisamd51.Set_RGB (5, UInt8'Last - Val, Val, 0); when 2 => Minisamd51.Set_RGB (5, 0, UInt8'Last - Val, Val); when 3 => Minisamd51.Set_RGB (5, Val, 0, UInt8'Last - Val); end case; end loop; end loop; end loop; end Main;
with ILI9341_Regs; package body ILI9341.Hack is --------------------- -- Prepare_For_DMA -- --------------------- procedure Prepare_For_DMA (This : in out ILI9341_Device; X1 : Width; Y1 : Height; X2 : Width; Y2 : Height) is begin This.Set_Cursor_Position (X1, Y1, X2, Y2); This.Send_Command (ILI9341_Regs.ILI9341_GRAM); This.WRX.Set; This.Chip_Select_Low; end Prepare_For_DMA; ------------- -- End_DMA -- ------------- procedure End_DMA (This : in out ILI9341_Device) is begin This.Chip_Select_High; end End_DMA; end ILI9341.Hack;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . W I D E _ W I D E _ C H A R A C T E R T S . U N I C O D E -- -- -- -- B o d y -- -- -- -- Copyright (C) 2005-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. -- -- -- ------------------------------------------------------------------------------ package body Ada.Wide_Wide_Characters.Unicode is package G renames System.UTF_32; ------------------ -- Get_Category -- ------------------ function Get_Category (U : Wide_Wide_Character) return Category is begin return Category (G.Get_Category (Wide_Wide_Character'Pos (U))); end Get_Category; -------------- -- Is_Digit -- -------------- function Is_Digit (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Digit (Wide_Wide_Character'Pos (U)); end Is_Digit; function Is_Digit (C : Category) return Boolean is begin return G.Is_UTF_32_Digit (G.Category (C)); end Is_Digit; --------------- -- Is_Letter -- --------------- function Is_Letter (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Letter (Wide_Wide_Character'Pos (U)); end Is_Letter; function Is_Letter (C : Category) return Boolean is begin return G.Is_UTF_32_Letter (G.Category (C)); end Is_Letter; ------------------------ -- Is_Line_Terminator -- ------------------------ function Is_Line_Terminator (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Line_Terminator (Wide_Wide_Character'Pos (U)); end Is_Line_Terminator; ------------- -- Is_Mark -- ------------- function Is_Mark (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Mark (Wide_Wide_Character'Pos (U)); end Is_Mark; function Is_Mark (C : Category) return Boolean is begin return G.Is_UTF_32_Mark (G.Category (C)); end Is_Mark; -------------------- -- Is_Non_Graphic -- -------------------- function Is_Non_Graphic (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Non_Graphic (Wide_Wide_Character'Pos (U)); end Is_Non_Graphic; function Is_Non_Graphic (C : Category) return Boolean is begin return G.Is_UTF_32_Non_Graphic (G.Category (C)); end Is_Non_Graphic; -------------- -- Is_Other -- -------------- function Is_Other (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Other (Wide_Wide_Character'Pos (U)); end Is_Other; function Is_Other (C : Category) return Boolean is begin return G.Is_UTF_32_Other (G.Category (C)); end Is_Other; -------------------- -- Is_Punctuation -- -------------------- function Is_Punctuation (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Punctuation (Wide_Wide_Character'Pos (U)); end Is_Punctuation; function Is_Punctuation (C : Category) return Boolean is begin return G.Is_UTF_32_Punctuation (G.Category (C)); end Is_Punctuation; -------------- -- Is_Space -- -------------- function Is_Space (U : Wide_Wide_Character) return Boolean is begin return G.Is_UTF_32_Space (Wide_Wide_Character'Pos (U)); end Is_Space; function Is_Space (C : Category) return Boolean is begin return G.Is_UTF_32_Space (G.Category (C)); end Is_Space; ------------------- -- To_Lower_Case -- ------------------- function To_Lower_Case (U : Wide_Wide_Character) return Wide_Wide_Character is begin return Wide_Wide_Character'Val (G.UTF_32_To_Lower_Case (Wide_Wide_Character'Pos (U))); end To_Lower_Case; ------------------- -- To_Upper_Case -- ------------------- function To_Upper_Case (U : Wide_Wide_Character) return Wide_Wide_Character is begin return Wide_Wide_Character'Val (G.UTF_32_To_Upper_Case (Wide_Wide_Character'Pos (U))); end To_Upper_Case; end Ada.Wide_Wide_Characters.Unicode;
with Ada.Text_Io; use Ada.Text_Io; procedure Tasking_99_Bottles is subtype Num_Bottles is Natural range 1..99; task Print is entry Set (Num_Bottles); end Print; task body Print is Num : Natural; begin for I in reverse Num_Bottles'range loop select accept Set(I) do -- Rendezvous with Counter task I Num := I; end Set; Put_Line(Integer'Image(Num) & " bottles of beer on the wall"); Put_Line(Integer'Image(Num) & " bottles of beer"); Put_Line("Take one down, pass it around"); Put_Line(Integer'Image(Num - 1) & " bottles of beer on the wall"); New_Line; or terminate; -- end when all Counter tasks have completed end select; end loop; end Print; task type Counter(I : Num_Bottles); task body Counter is begin Print.Set(I); end Counter; type Task_Access is access Counter; Task_List : array(Num_Bottles) of Task_Access; begin for I in Task_List'range loop -- Create 99 Counter tasks Task_List(I) := new Counter(I); end loop; end Tasking_99_Bottles;
with Ada.Integer_Text_IO; with Ada.Numerics.Elementary_Functions; -- Copyright 2021 Melwyn Francis Carlo procedure A044 is use Ada.Integer_Text_IO; use Ada.Numerics.Elementary_Functions; Max_N : constant Integer := 5E3; Min_Pd : Integer := 1E7; P1, P2, P1pp2, P1mp2 : Integer; Sqrt_term : Float; begin for I in 1 .. Max_N loop P1 := Integer (Float'Floor (0.5E0 * Float (I) * ((3.0E0 * Float (I)) - 1.0E0))); for J in (I + 1) .. Max_N loop P2 := Integer (Float'Floor ((0.5E0 * Float (J) * ((3.0E0 * Float (J)) - 1.0E0)))); P1pp2 := P1 + P2; Sqrt_term := Sqrt (1.0E0 + (24.0E0 * Float (P1pp2))); if Sqrt_term = Float'Floor (Sqrt_term) then if ((Integer (Sqrt_term) + 1) mod 6) = 0 then P1mp2 := P2 - P1; Sqrt_term := Sqrt (1.0E0 + (24.0E0 * Float (P1mp2))); if Sqrt_term = Float'Floor (Sqrt_term) then if ((Integer (Sqrt_term) + 1) mod 6) = 0 then if P1mp2 < Min_Pd then Min_Pd := P1mp2; end if; end if; end if; end if; end if; end loop; end loop; Put (Min_Pd, Width => 0); end A044;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S T A N D -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-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. -- -- -- ------------------------------------------------------------------------------ -- This package contains the declarations of entities in package Standard, -- These values are initialized either by calling CStand.Create_Standard, -- or by calling Stand.Tree_Read. with Types; use Types; package Stand is -- Warning: the entities defined in this package are written out by the -- Tree_Write routine, and read back in by the Tree_Read routine, so be -- sure to modify these two routines if you add entities that are not -- part of Standard_Entity. type Standard_Entity_Type is ( -- This enumeration type contains an entry for each name in Standard -- Package names S_Standard, S_ASCII, -- Types and subtypes defined in package Standard (in the order in which -- they appear in the RM, so that the declarations are in the right -- order for the purposes of ASIS traversals S_Boolean, S_Short_Short_Integer, S_Short_Integer, S_Integer, S_Long_Integer, S_Long_Long_Integer, S_Natural, S_Positive, S_Short_Float, S_Float, S_Long_Float, S_Long_Long_Float, S_Character, S_Wide_Character, S_Wide_Wide_Character, S_String, S_Wide_String, S_Wide_Wide_String, S_Duration, -- Enumeration literals for type Boolean S_False, S_True, -- Exceptions declared in package Standard S_Constraint_Error, S_Numeric_Error, S_Program_Error, S_Storage_Error, S_Tasking_Error, -- Binary Operators declared in package Standard S_Op_Add, S_Op_And, S_Op_Concat, S_Op_Concatw, S_Op_Concatww, S_Op_Divide, S_Op_Eq, S_Op_Expon, S_Op_Ge, S_Op_Gt, S_Op_Le, S_Op_Lt, S_Op_Mod, S_Op_Multiply, S_Op_Ne, S_Op_Or, S_Op_Rem, S_Op_Subtract, S_Op_Xor, -- Unary operators declared in package Standard S_Op_Abs, S_Op_Minus, S_Op_Not, S_Op_Plus, -- Constants defined in package ASCII (with value in hex). -- First the thirty-two C0 control characters) S_NUL, -- 16#00# S_SOH, -- 16#01# S_STX, -- 16#02# S_ETX, -- 16#03# S_EOT, -- 16#04# S_ENQ, -- 16#05# S_ACK, -- 16#06# S_BEL, -- 16#07# S_BS, -- 16#08# S_HT, -- 16#09# S_LF, -- 16#0A# S_VT, -- 16#0B# S_FF, -- 16#0C# S_CR, -- 16#0D# S_SO, -- 16#0E# S_SI, -- 16#0F# S_DLE, -- 16#10# S_DC1, -- 16#11# S_DC2, -- 16#12# S_DC3, -- 16#13# S_DC4, -- 16#14# S_NAK, -- 16#15# S_SYN, -- 16#16# S_ETB, -- 16#17# S_CAN, -- 16#18# S_EM, -- 16#19# S_SUB, -- 16#1A# S_ESC, -- 16#1B# S_FS, -- 16#1C# S_GS, -- 16#1D# S_RS, -- 16#1E# S_US, -- 16#1F# -- Here are the ones for Colonel Whitaker's O26 keypunch S_Exclam, -- 16#21# S_Quotation, -- 16#22# S_Sharp, -- 16#23# S_Dollar, -- 16#24# S_Percent, -- 16#25# S_Ampersand, -- 16#26# S_Colon, -- 16#3A# S_Semicolon, -- 16#3B# S_Query, -- 16#3F# S_At_Sign, -- 16#40# S_L_Bracket, -- 16#5B# S_Back_Slash, -- 16#5C# S_R_Bracket, -- 16#5D# S_Circumflex, -- 16#5E# S_Underline, -- 16#5F# S_Grave, -- 16#60# S_LC_A, -- 16#61# S_LC_B, -- 16#62# S_LC_C, -- 16#63# S_LC_D, -- 16#64# S_LC_E, -- 16#65# S_LC_F, -- 16#66# S_LC_G, -- 16#67# S_LC_H, -- 16#68# S_LC_I, -- 16#69# S_LC_J, -- 16#6A# S_LC_K, -- 16#6B# S_LC_L, -- 16#6C# S_LC_M, -- 16#6D# S_LC_N, -- 16#6E# S_LC_O, -- 16#6F# S_LC_P, -- 16#70# S_LC_Q, -- 16#71# S_LC_R, -- 16#72# S_LC_S, -- 16#73# S_LC_T, -- 16#74# S_LC_U, -- 16#75# S_LC_V, -- 16#76# S_LC_W, -- 16#77# S_LC_X, -- 16#78# S_LC_Y, -- 16#79# S_LC_Z, -- 16#7A# S_L_BRACE, -- 16#7B# S_BAR, -- 16#7C# S_R_BRACE, -- 16#7D# S_TILDE, -- 16#7E# -- And one more control character, all on its own S_DEL); -- 16#7F# subtype S_Types is Standard_Entity_Type range S_Boolean .. S_Duration; subtype S_Exceptions is Standard_Entity_Type range S_Constraint_Error .. S_Tasking_Error; subtype S_ASCII_Names is Standard_Entity_Type range S_NUL .. S_DEL; subtype S_Binary_Ops is Standard_Entity_Type range S_Op_Add .. S_Op_Xor; subtype S_Unary_Ops is Standard_Entity_Type range S_Op_Abs .. S_Op_Plus; type Standard_Entity_Array_Type is array (Standard_Entity_Type) of Node_Id; Standard_Entity : Standard_Entity_Array_Type; -- This array contains pointers to the Defining Identifier nodes for each -- of the visible entities defined in Standard_Entities_Type. The array is -- initialized by the Create_Standard procedure. Standard_Package_Node : Node_Id; -- Points to the N_Package_Declaration node for standard. Also -- initialized by the Create_Standard procedure. -- The following Entities are the pointers to the Defining Identifier -- nodes for some visible entities defined in Standard_Entities_Type. SE : Standard_Entity_Array_Type renames Standard_Entity; Standard_Standard : Entity_Id renames SE (S_Standard); Standard_ASCII : Entity_Id renames SE (S_ASCII); Standard_Character : Entity_Id renames SE (S_Character); Standard_Wide_Character : Entity_Id renames SE (S_Wide_Character); Standard_Wide_Wide_Character : Entity_Id renames SE (S_Wide_Wide_Character); Standard_String : Entity_Id renames SE (S_String); Standard_Wide_String : Entity_Id renames SE (S_Wide_String); Standard_Wide_Wide_String : Entity_Id renames SE (S_Wide_Wide_String); Standard_Boolean : Entity_Id renames SE (S_Boolean); Standard_False : Entity_Id renames SE (S_False); Standard_True : Entity_Id renames SE (S_True); Standard_Duration : Entity_Id renames SE (S_Duration); Standard_Natural : Entity_Id renames SE (S_Natural); Standard_Positive : Entity_Id renames SE (S_Positive); Standard_Constraint_Error : Entity_Id renames SE (S_Constraint_Error); Standard_Numeric_Error : Entity_Id renames SE (S_Numeric_Error); Standard_Program_Error : Entity_Id renames SE (S_Program_Error); Standard_Storage_Error : Entity_Id renames SE (S_Storage_Error); Standard_Tasking_Error : Entity_Id renames SE (S_Tasking_Error); Standard_Short_Float : Entity_Id renames SE (S_Short_Float); Standard_Float : Entity_Id renames SE (S_Float); Standard_Long_Float : Entity_Id renames SE (S_Long_Float); Standard_Long_Long_Float : Entity_Id renames SE (S_Long_Long_Float); Standard_Short_Short_Integer : Entity_Id renames SE (S_Short_Short_Integer); Standard_Short_Integer : Entity_Id renames SE (S_Short_Integer); Standard_Integer : Entity_Id renames SE (S_Integer); Standard_Long_Integer : Entity_Id renames SE (S_Long_Integer); Standard_Long_Long_Integer : Entity_Id renames SE (S_Long_Long_Integer); Standard_Op_Add : Entity_Id renames SE (S_Op_Add); Standard_Op_And : Entity_Id renames SE (S_Op_And); Standard_Op_Concat : Entity_Id renames SE (S_Op_Concat); Standard_Op_Concatw : Entity_Id renames SE (S_Op_Concatw); Standard_Op_Concatww : Entity_Id renames SE (S_Op_Concatww); Standard_Op_Divide : Entity_Id renames SE (S_Op_Divide); Standard_Op_Eq : Entity_Id renames SE (S_Op_Eq); Standard_Op_Expon : Entity_Id renames SE (S_Op_Expon); Standard_Op_Ge : Entity_Id renames SE (S_Op_Ge); Standard_Op_Gt : Entity_Id renames SE (S_Op_Gt); Standard_Op_Le : Entity_Id renames SE (S_Op_Le); Standard_Op_Lt : Entity_Id renames SE (S_Op_Lt); Standard_Op_Mod : Entity_Id renames SE (S_Op_Mod); Standard_Op_Multiply : Entity_Id renames SE (S_Op_Multiply); Standard_Op_Ne : Entity_Id renames SE (S_Op_Ne); Standard_Op_Or : Entity_Id renames SE (S_Op_Or); Standard_Op_Rem : Entity_Id renames SE (S_Op_Rem); Standard_Op_Subtract : Entity_Id renames SE (S_Op_Subtract); Standard_Op_Xor : Entity_Id renames SE (S_Op_Xor); Standard_Op_Abs : Entity_Id renames SE (S_Op_Abs); Standard_Op_Minus : Entity_Id renames SE (S_Op_Minus); Standard_Op_Not : Entity_Id renames SE (S_Op_Not); Standard_Op_Plus : Entity_Id renames SE (S_Op_Plus); Last_Standard_Node_Id : Node_Id; -- Highest Node_Id value used by Standard Last_Standard_List_Id : List_Id; -- Highest List_Id value used by Standard (including those used by -- normal list headers, element list headers, and list elements) Boolean_Literals : array (Boolean) of Entity_Id; -- Entities for the two boolean literals, used by the expander ------------------------------------- -- Semantic Phase Special Entities -- ------------------------------------- -- The semantic phase needs a number of entities for internal processing -- that are logically at the level of Standard, and hence defined in this -- package. However, they are never visible to a program, and are not -- chained on to the Decls list of Standard. The names of all these -- types are relevant only in certain debugging and error message -- situations. They have names that are suitable for use in such -- error messages (see body for actual names used). Standard_Void_Type : Entity_Id; -- This is a type used to represent the return type of procedures Standard_Exception_Type : Entity_Id; -- This is a type used to represent the Etype of exceptions Standard_A_String : Entity_Id; -- An access to String type used for building elements of tables -- carrying the enumeration literal names. Standard_A_Char : Entity_Id; -- Access to character, used as a component of the exception type to denote -- a thin pointer component. Standard_Debug_Renaming_Type : Entity_Id; -- A zero-size subtype of Integer, used as the type of variables used to -- provide the debugger with name encodings for renaming declarations. Predefined_Float_Types : Elist_Id; -- Entities for predefined floating point types. These are used by -- the semantic phase to select appropriate types for floating point -- declarations. This list is ordered by preference. All types up to -- Long_Long_Float_Type are considered for plain "digits N" declarations, -- while selection of later types requires a range specification and -- possibly other attributes or pragmas. -- The entities labeled Any_xxx are used in situations where the full -- characteristics of an entity are not yet known, e.g. Any_Character -- is used to label a character literal before resolution is complete. -- These entities are also used to construct appropriate references in -- error messages ("expecting an integer type"). Any_Id : Entity_Id; -- Used to represent some unknown identifier. Used to label undefined -- identifier references to prevent cascaded errors. Any_Type : Entity_Id; -- Used to represent some unknown type. Any_Type is the type of an -- unresolved operator, and it is the type of a node where a type error -- has been detected. Any_Type plays an important role in avoiding cascaded -- errors, because it is compatible with all other types, and is propagated -- to any expression that has a subexpression of Any_Type. When resolving -- operators, Any_Type is the initial type of the node before any of its -- candidate interpretations has been examined. If after examining all of -- them the type is still Any_Type, the node has no possible interpretation -- and an error can be emitted (and Any_Type will be propagated upwards). Any_Access : Entity_Id; -- Used to resolve the overloaded literal NULL Any_Array : Entity_Id; -- Used to represent some unknown array type Any_Boolean : Entity_Id; -- The context type of conditions in IF and WHILE statements Any_Character : Entity_Id; -- Any_Character is used to label character literals, which in general -- will not have an explicit declaration (this is true of the predefined -- character types). Any_Composite : Entity_Id; -- The type Any_Composite is used for aggregates before type resolution. -- It is compatible with any array or non-limited record type. Any_Discrete : Entity_Id; -- Used to represent some unknown discrete type Any_Fixed : Entity_Id; -- Used to represent some unknown fixed-point type Any_Integer : Entity_Id; -- Used to represent some unknown integer type Any_Modular : Entity_Id; -- Used to represent the result type of a boolean operation on an integer -- literal. The result is not Universal_Integer, because it is only legal -- in a modular context. Any_Numeric : Entity_Id; -- Used to represent some unknown numeric type Any_Real : Entity_Id; -- Used to represent some unknown real type Any_Scalar : Entity_Id; -- Used to represent some unknown scalar type Any_String : Entity_Id; -- The type Any_String is used for string literals before type resolution. -- It corresponds to array (Positive range <>) of character where the -- component type is compatible with any character type, not just -- Standard_Character. Raise_Type : Entity_Id; -- The type Raise_Type denotes the type of a Raise_Expression. It is -- compatible with all other types, and must eventually resolve to a -- concrete type that is imposed by the context. -- -- Historical note: we used to use Any_Type for this purpose, but the -- confusion of meanings (Any_Type normally indicates an error) caused -- difficulties. In particular some needed expansions were skipped since -- the nodes in question looked like they had an error. Universal_Integer : Entity_Id; -- Entity for universal integer type. The bounds of this type correspond -- to the largest supported integer type (i.e. Long_Long_Integer). It is -- the type used for runtime calculations in type universal integer. Universal_Real : Entity_Id; -- Entity for universal real type. The bounds of this type correspond to -- to the largest supported real type (i.e. Long_Long_Float). It is the -- type used for runtime calculations in type universal real. Note that -- this type is always IEEE format. Universal_Fixed : Entity_Id; -- Entity for universal fixed type. This is a type with arbitrary -- precision that can only appear in a context with a specific type. -- Universal_Fixed labels the result of multiplication or division of -- two fixed point numbers, and has no specified bounds (since, unlike -- universal integer and universal real, it is never used for runtime -- calculations). Standard_Integer_8 : Entity_Id; Standard_Integer_16 : Entity_Id; Standard_Integer_32 : Entity_Id; Standard_Integer_64 : Entity_Id; -- These are signed integer types with the indicated sizes. Used for the -- underlying implementation types for fixed-point and enumeration types. Standard_Short_Short_Unsigned : Entity_Id; Standard_Short_Unsigned : Entity_Id; Standard_Unsigned : Entity_Id; Standard_Long_Unsigned : Entity_Id; Standard_Long_Long_Unsigned : Entity_Id; -- Unsigned types with same Esize as corresponding signed integer types Standard_Unsigned_64 : Entity_Id; -- An unsigned type, mod 2 ** 64, size of 64 bits. Abort_Signal : Entity_Id; -- Entity for abort signal exception Standard_Op_Rotate_Left : Entity_Id; Standard_Op_Rotate_Right : Entity_Id; Standard_Op_Shift_Left : Entity_Id; Standard_Op_Shift_Right : Entity_Id; Standard_Op_Shift_Right_Arithmetic : Entity_Id; -- These entities are used for shift operators generated by the expander ----------------- -- Subprograms -- ----------------- procedure Tree_Read; -- Initializes entity values in this package from the current tree file -- using Tree_IO. Note that Tree_Read includes all the initialization that -- is carried out by Create_Standard. procedure Tree_Write; -- Writes out the entity values in this package to the current tree file -- using Tree_IO. end Stand;
package My_Class is type Object is tagged private; procedure Primitive(Self: Object); -- primitive subprogram procedure Dynamic(Self: Object'Class); procedure Static; private type Object is tagged null record; end My_Class;
------------------------------------------------------------------------------ -- -- -- tiled-code-gen -- -- -- -- Copyright (C) 2018 Fabien Chouteau -- -- -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ package TCG.Outputs is end TCG.Outputs;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- G N A T . L I S T S -- -- -- -- B o d y -- -- -- -- Copyright (C) 2018-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. -- -- -- -- 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_Deallocation; package body GNAT.Lists is package body Doubly_Linked_Lists is procedure Delete_Node (L : Doubly_Linked_List; Nod : Node_Ptr); pragma Inline (Delete_Node); -- Detach and delete node Nod from list L procedure Ensure_Circular (Head : Node_Ptr); pragma Inline (Ensure_Circular); -- Ensure that dummy head Head is circular with respect to itself procedure Ensure_Created (L : Doubly_Linked_List); pragma Inline (Ensure_Created); -- Verify that list L is created. Raise Not_Created if this is not the -- case. procedure Ensure_Full (L : Doubly_Linked_List); pragma Inline (Ensure_Full); -- Verify that list L contains at least one element. Raise List_Empty if -- this is not the case. procedure Ensure_Unlocked (L : Doubly_Linked_List); pragma Inline (Ensure_Unlocked); -- Verify that list L is unlocked. Raise Iterated if this is not the -- case. function Find_Node (Head : Node_Ptr; Elem : Element_Type) return Node_Ptr; pragma Inline (Find_Node); -- Travers a list indicated by dummy head Head to determine whethe there -- exists a node with element Elem. If such a node exists, return it, -- otherwise return null; procedure Free is new Ada.Unchecked_Deallocation (Doubly_Linked_List_Attributes, Doubly_Linked_List); procedure Free is new Ada.Unchecked_Deallocation (Node, Node_Ptr); procedure Insert_Between (L : Doubly_Linked_List; Elem : Element_Type; Left : Node_Ptr; Right : Node_Ptr); pragma Inline (Insert_Between); -- Insert element Elem between nodes Left and Right of list L function Is_Valid (Iter : Iterator) return Boolean; pragma Inline (Is_Valid); -- Determine whether iterator Iter refers to a valid element function Is_Valid (Nod : Node_Ptr; Head : Node_Ptr) return Boolean; pragma Inline (Is_Valid); -- Determine whether node Nod is non-null and does not refer to dummy -- head Head, thus making it valid. procedure Lock (L : Doubly_Linked_List); pragma Inline (Lock); -- Lock all mutation functionality of list L function Present (Nod : Node_Ptr) return Boolean; pragma Inline (Present); -- Determine whether node Nod exists procedure Unlock (L : Doubly_Linked_List); pragma Inline (Unlock); -- Unlock all mutation functionality of list L ------------ -- Append -- ------------ procedure Append (L : Doubly_Linked_List; Elem : Element_Type) is Head : Node_Ptr; begin Ensure_Created (L); Ensure_Unlocked (L); -- Ensure that the dummy head of an empty list is circular with -- respect to itself. Head := L.Nodes'Access; Ensure_Circular (Head); -- Append the node by inserting it between the last node and the -- dummy head. Insert_Between (L => L, Elem => Elem, Left => Head.Prev, Right => Head); end Append; ------------ -- Create -- ------------ function Create return Doubly_Linked_List is begin return new Doubly_Linked_List_Attributes; end Create; -------------- -- Contains -- -------------- function Contains (L : Doubly_Linked_List; Elem : Element_Type) return Boolean is Head : Node_Ptr; Nod : Node_Ptr; begin Ensure_Created (L); Head := L.Nodes'Access; Nod := Find_Node (Head, Elem); return Is_Valid (Nod, Head); end Contains; ------------ -- Delete -- ------------ procedure Delete (L : Doubly_Linked_List; Elem : Element_Type) is Head : Node_Ptr; Nod : Node_Ptr; begin Ensure_Created (L); Ensure_Full (L); Ensure_Unlocked (L); Head := L.Nodes'Access; Nod := Find_Node (Head, Elem); if Is_Valid (Nod, Head) then Delete_Node (L, Nod); end if; end Delete; ------------------ -- Delete_First -- ------------------ procedure Delete_First (L : Doubly_Linked_List) is Head : Node_Ptr; Nod : Node_Ptr; begin Ensure_Created (L); Ensure_Full (L); Ensure_Unlocked (L); Head := L.Nodes'Access; Nod := Head.Next; if Is_Valid (Nod, Head) then Delete_Node (L, Nod); end if; end Delete_First; ----------------- -- Delete_Last -- ----------------- procedure Delete_Last (L : Doubly_Linked_List) is Head : Node_Ptr; Nod : Node_Ptr; begin Ensure_Created (L); Ensure_Full (L); Ensure_Unlocked (L); Head := L.Nodes'Access; Nod := Head.Prev; if Is_Valid (Nod, Head) then Delete_Node (L, Nod); end if; end Delete_Last; ----------------- -- Delete_Node -- ----------------- procedure Delete_Node (L : Doubly_Linked_List; Nod : Node_Ptr) is Ref : Node_Ptr := Nod; pragma Assert (Present (Ref)); Next : constant Node_Ptr := Ref.Next; Prev : constant Node_Ptr := Ref.Prev; begin pragma Assert (Present (L)); pragma Assert (Present (Next)); pragma Assert (Present (Prev)); Prev.Next := Next; -- Prev ---> Next Next.Prev := Prev; -- Prev <--> Next Ref.Next := null; Ref.Prev := null; L.Elements := L.Elements - 1; -- Invoke the element destructor before deallocating the node Destroy_Element (Nod.Elem); Free (Ref); end Delete_Node; ------------- -- Destroy -- ------------- procedure Destroy (L : in out Doubly_Linked_List) is Head : Node_Ptr; begin Ensure_Created (L); Ensure_Unlocked (L); Head := L.Nodes'Access; while Is_Valid (Head.Next, Head) loop Delete_Node (L, Head.Next); end loop; Free (L); end Destroy; --------------------- -- Ensure_Circular -- --------------------- procedure Ensure_Circular (Head : Node_Ptr) is pragma Assert (Present (Head)); begin if not Present (Head.Next) and then not Present (Head.Prev) then Head.Next := Head; Head.Prev := Head; end if; end Ensure_Circular; -------------------- -- Ensure_Created -- -------------------- procedure Ensure_Created (L : Doubly_Linked_List) is begin if not Present (L) then raise Not_Created; end if; end Ensure_Created; ----------------- -- Ensure_Full -- ----------------- procedure Ensure_Full (L : Doubly_Linked_List) is begin pragma Assert (Present (L)); if L.Elements = 0 then raise List_Empty; end if; end Ensure_Full; --------------------- -- Ensure_Unlocked -- --------------------- procedure Ensure_Unlocked (L : Doubly_Linked_List) is begin pragma Assert (Present (L)); -- The list has at least one outstanding iterator if L.Iterators > 0 then raise Iterated; end if; end Ensure_Unlocked; ----------- -- Equal -- ----------- function Equal (Left : Doubly_Linked_List; Right : Doubly_Linked_List) return Boolean is Left_Head : Node_Ptr; Left_Nod : Node_Ptr; Right_Head : Node_Ptr; Right_Nod : Node_Ptr; begin -- Two non-existent lists are considered equal if Left = Nil and then Right = Nil then return True; -- A non-existent list is never equal to an already created list elsif Left = Nil or else Right = Nil then return False; -- The two lists must contain the same number of elements to be equal elsif Size (Left) /= Size (Right) then return False; end if; -- Compare the two lists element by element Left_Head := Left.Nodes'Access; Left_Nod := Left_Head.Next; Right_Head := Right.Nodes'Access; Right_Nod := Right_Head.Next; while Is_Valid (Left_Nod, Left_Head) and then Is_Valid (Right_Nod, Right_Head) loop if Left_Nod.Elem /= Right_Nod.Elem then return False; end if; Left_Nod := Left_Nod.Next; Right_Nod := Right_Nod.Next; end loop; return True; end Equal; --------------- -- Find_Node -- --------------- function Find_Node (Head : Node_Ptr; Elem : Element_Type) return Node_Ptr is pragma Assert (Present (Head)); Nod : Node_Ptr; begin -- Traverse the nodes of the list, looking for a matching element Nod := Head.Next; while Is_Valid (Nod, Head) loop if Nod.Elem = Elem then return Nod; end if; Nod := Nod.Next; end loop; return null; end Find_Node; ----------- -- First -- ----------- function First (L : Doubly_Linked_List) return Element_Type is begin Ensure_Created (L); Ensure_Full (L); return L.Nodes.Next.Elem; end First; -------------- -- Has_Next -- -------------- function Has_Next (Iter : Iterator) return Boolean is Is_OK : constant Boolean := Is_Valid (Iter); begin -- The iterator is no longer valid which indicates that it has been -- exhausted. Unlock all mutation functionality of the list because -- the iterator cannot be advanced any further. if not Is_OK then Unlock (Iter.List); end if; return Is_OK; end Has_Next; ------------------ -- Insert_After -- ------------------ procedure Insert_After (L : Doubly_Linked_List; After : Element_Type; Elem : Element_Type) is Head : Node_Ptr; Nod : Node_Ptr; begin Ensure_Created (L); Ensure_Unlocked (L); Head := L.Nodes'Access; Nod := Find_Node (Head, After); if Is_Valid (Nod, Head) then Insert_Between (L => L, Elem => Elem, Left => Nod, Right => Nod.Next); end if; end Insert_After; ------------------- -- Insert_Before -- ------------------- procedure Insert_Before (L : Doubly_Linked_List; Before : Element_Type; Elem : Element_Type) is Head : Node_Ptr; Nod : Node_Ptr; begin Ensure_Created (L); Ensure_Unlocked (L); Head := L.Nodes'Access; Nod := Find_Node (Head, Before); if Is_Valid (Nod, Head) then Insert_Between (L => L, Elem => Elem, Left => Nod.Prev, Right => Nod); end if; end Insert_Before; -------------------- -- Insert_Between -- -------------------- procedure Insert_Between (L : Doubly_Linked_List; Elem : Element_Type; Left : Node_Ptr; Right : Node_Ptr) is pragma Assert (Present (L)); pragma Assert (Present (Left)); pragma Assert (Present (Right)); Nod : constant Node_Ptr := new Node'(Elem => Elem, Next => Right, -- Left Nod ---> Right Prev => Left); -- Left <--- Nod ---> Right begin Left.Next := Nod; -- Left <--> Nod ---> Right Right.Prev := Nod; -- Left <--> Nod <--> Right L.Elements := L.Elements + 1; end Insert_Between; -------------- -- Is_Empty -- -------------- function Is_Empty (L : Doubly_Linked_List) return Boolean is begin Ensure_Created (L); return L.Elements = 0; end Is_Empty; -------------- -- Is_Valid -- -------------- function Is_Valid (Iter : Iterator) return Boolean is begin -- The invariant of Iterate and Next ensures that the iterator always -- refers to a valid node if there exists one. return Is_Valid (Iter.Curr_Nod, Iter.List.Nodes'Access); end Is_Valid; -------------- -- Is_Valid -- -------------- function Is_Valid (Nod : Node_Ptr; Head : Node_Ptr) return Boolean is begin -- A node is valid if it is non-null, and does not refer to the dummy -- head of some list. return Present (Nod) and then Nod /= Head; end Is_Valid; ------------- -- Iterate -- ------------- function Iterate (L : Doubly_Linked_List) return Iterator is begin Ensure_Created (L); -- Lock all mutation functionality of the list while it is being -- iterated on. Lock (L); return (List => L, Curr_Nod => L.Nodes.Next); end Iterate; ---------- -- Last -- ---------- function Last (L : Doubly_Linked_List) return Element_Type is begin Ensure_Created (L); Ensure_Full (L); return L.Nodes.Prev.Elem; end Last; ---------- -- Lock -- ---------- procedure Lock (L : Doubly_Linked_List) is begin pragma Assert (Present (L)); -- The list may be locked multiple times if multiple iterators are -- operating over it. L.Iterators := L.Iterators + 1; end Lock; ---------- -- Next -- ---------- procedure Next (Iter : in out Iterator; Elem : out Element_Type) is Is_OK : constant Boolean := Is_Valid (Iter); Saved : constant Node_Ptr := Iter.Curr_Nod; begin -- The iterator is no linger valid which indicates that it has been -- exhausted. Unlock all mutation functionality of the list as the -- iterator cannot be advanced any further. if not Is_OK then Unlock (Iter.List); raise Iterator_Exhausted; end if; -- Advance to the next node along the list Iter.Curr_Nod := Iter.Curr_Nod.Next; Elem := Saved.Elem; end Next; ------------- -- Prepend -- ------------- procedure Prepend (L : Doubly_Linked_List; Elem : Element_Type) is Head : Node_Ptr; begin Ensure_Created (L); Ensure_Unlocked (L); -- Ensure that the dummy head of an empty list is circular with -- respect to itself. Head := L.Nodes'Access; Ensure_Circular (Head); -- Append the node by inserting it between the dummy head and the -- first node. Insert_Between (L => L, Elem => Elem, Left => Head, Right => Head.Next); end Prepend; ------------- -- Present -- ------------- function Present (L : Doubly_Linked_List) return Boolean is begin return L /= Nil; end Present; ------------- -- Present -- ------------- function Present (Nod : Node_Ptr) return Boolean is begin return Nod /= null; end Present; ------------- -- Replace -- ------------- procedure Replace (L : Doubly_Linked_List; Old_Elem : Element_Type; New_Elem : Element_Type) is Head : Node_Ptr; Nod : Node_Ptr; begin Ensure_Created (L); Ensure_Unlocked (L); Head := L.Nodes'Access; Nod := Find_Node (Head, Old_Elem); if Is_Valid (Nod, Head) then Nod.Elem := New_Elem; end if; end Replace; ---------- -- Size -- ---------- function Size (L : Doubly_Linked_List) return Natural is begin Ensure_Created (L); return L.Elements; end Size; ------------ -- Unlock -- ------------ procedure Unlock (L : Doubly_Linked_List) is begin pragma Assert (Present (L)); -- The list may be locked multiple times if multiple iterators are -- operating over it. L.Iterators := L.Iterators - 1; end Unlock; end Doubly_Linked_Lists; end GNAT.Lists;
-- This spec has been automatically generated from STM32L4x1.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.RCC is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_MSIRANGE_Field is HAL.UInt4; -- Clock control register type CR_Register is record -- MSI clock enable MSION : Boolean := True; -- Read-only. MSI clock ready flag MSIRDY : Boolean := True; -- MSI clock PLL enable MSIPLLEN : Boolean := False; -- Write-only. MSI clock range selection MSIRGSEL : Boolean := False; -- MSI clock ranges MSIRANGE : CR_MSIRANGE_Field := 16#6#; -- HSI clock enable HSION : Boolean := False; -- HSI always enable for peripheral kernels HSIKERON : Boolean := False; -- Read-only. HSI clock ready flag HSIRDY : Boolean := False; -- HSI automatic start from Stop HSIASFS : Boolean := False; -- unspecified Reserved_12_15 : HAL.UInt4 := 16#0#; -- HSE clock enable HSEON : Boolean := False; -- Read-only. HSE clock ready flag HSERDY : Boolean := False; -- HSE crystal oscillator bypass HSEBYP : Boolean := False; -- Write-only. Clock security system enable CSSON : Boolean := False; -- unspecified Reserved_20_23 : HAL.UInt4 := 16#0#; -- Main PLL enable PLLON : Boolean := False; -- Read-only. Main PLL clock ready flag PLLRDY : Boolean := False; -- SAI1 PLL enable PLLSAI1ON : Boolean := False; -- Read-only. SAI1 PLL clock ready flag PLLSAI1RDY : Boolean := False; -- unspecified Reserved_28_31 : HAL.UInt4 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record MSION at 0 range 0 .. 0; MSIRDY at 0 range 1 .. 1; MSIPLLEN at 0 range 2 .. 2; MSIRGSEL at 0 range 3 .. 3; MSIRANGE at 0 range 4 .. 7; HSION at 0 range 8 .. 8; HSIKERON at 0 range 9 .. 9; HSIRDY at 0 range 10 .. 10; HSIASFS at 0 range 11 .. 11; Reserved_12_15 at 0 range 12 .. 15; HSEON at 0 range 16 .. 16; HSERDY at 0 range 17 .. 17; HSEBYP at 0 range 18 .. 18; CSSON at 0 range 19 .. 19; Reserved_20_23 at 0 range 20 .. 23; PLLON at 0 range 24 .. 24; PLLRDY at 0 range 25 .. 25; PLLSAI1ON at 0 range 26 .. 26; PLLSAI1RDY at 0 range 27 .. 27; Reserved_28_31 at 0 range 28 .. 31; end record; subtype ICSCR_MSICAL_Field is HAL.UInt8; subtype ICSCR_MSITRIM_Field is HAL.UInt8; subtype ICSCR_HSICAL_Field is HAL.UInt8; subtype ICSCR_HSITRIM_Field is HAL.UInt5; -- Internal clock sources calibration register type ICSCR_Register is record -- Read-only. MSI clock calibration MSICAL : ICSCR_MSICAL_Field := 16#0#; -- MSI clock trimming MSITRIM : ICSCR_MSITRIM_Field := 16#0#; -- Read-only. HSI clock calibration HSICAL : ICSCR_HSICAL_Field := 16#0#; -- HSI clock trimming HSITRIM : ICSCR_HSITRIM_Field := 16#10#; -- unspecified Reserved_29_31 : HAL.UInt3 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICSCR_Register use record MSICAL at 0 range 0 .. 7; MSITRIM at 0 range 8 .. 15; HSICAL at 0 range 16 .. 23; HSITRIM at 0 range 24 .. 28; Reserved_29_31 at 0 range 29 .. 31; end record; subtype CFGR_SW_Field is HAL.UInt2; subtype CFGR_SWS_Field is HAL.UInt2; subtype CFGR_HPRE_Field is HAL.UInt4; -- CFGR_PPRE array element subtype CFGR_PPRE_Element is HAL.UInt3; -- CFGR_PPRE array type CFGR_PPRE_Field_Array is array (1 .. 2) of CFGR_PPRE_Element with Component_Size => 3, Size => 6; -- Type definition for CFGR_PPRE type CFGR_PPRE_Field (As_Array : Boolean := False) is record case As_Array is when False => -- PPRE as a value Val : HAL.UInt6; when True => -- PPRE as an array Arr : CFGR_PPRE_Field_Array; end case; end record with Unchecked_Union, Size => 6; for CFGR_PPRE_Field use record Val at 0 range 0 .. 5; Arr at 0 range 0 .. 5; end record; subtype CFGR_MCOSEL_Field is HAL.UInt3; subtype CFGR_MCOPRE_Field is HAL.UInt3; -- Clock configuration register type CFGR_Register is record -- System clock switch SW : CFGR_SW_Field := 16#0#; -- Read-only. System clock switch status SWS : CFGR_SWS_Field := 16#0#; -- AHB prescaler HPRE : CFGR_HPRE_Field := 16#0#; -- PB low-speed prescaler (APB1) PPRE : CFGR_PPRE_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_14_14 : HAL.Bit := 16#0#; -- Wakeup from Stop and CSS backup clock selection STOPWUCK : Boolean := False; -- unspecified Reserved_16_23 : HAL.UInt8 := 16#0#; -- Microcontroller clock output MCOSEL : CFGR_MCOSEL_Field := 16#0#; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Read-only. Microcontroller clock output prescaler MCOPRE : CFGR_MCOPRE_Field := 16#0#; -- unspecified Reserved_31_31 : HAL.Bit := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CFGR_Register use record SW at 0 range 0 .. 1; SWS at 0 range 2 .. 3; HPRE at 0 range 4 .. 7; PPRE at 0 range 8 .. 13; Reserved_14_14 at 0 range 14 .. 14; STOPWUCK at 0 range 15 .. 15; Reserved_16_23 at 0 range 16 .. 23; MCOSEL at 0 range 24 .. 26; Reserved_27_27 at 0 range 27 .. 27; MCOPRE at 0 range 28 .. 30; Reserved_31_31 at 0 range 31 .. 31; end record; subtype PLLCFGR_PLLSRC_Field is HAL.UInt2; subtype PLLCFGR_PLLM_Field is HAL.UInt3; subtype PLLCFGR_PLLN_Field is HAL.UInt7; subtype PLLCFGR_PLLQ_Field is HAL.UInt2; subtype PLLCFGR_PLLR_Field is HAL.UInt2; subtype PLLCFGR_PLLPDIV_Field is HAL.UInt5; -- PLL configuration register type PLLCFGR_Register is record -- Main PLL, PLLSAI1 and PLLSAI2 entry clock source PLLSRC : PLLCFGR_PLLSRC_Field := 16#0#; -- unspecified Reserved_2_3 : HAL.UInt2 := 16#0#; -- Division factor for the main PLL and audio PLL (PLLSAI1 and PLLSAI2) -- input clock PLLM : PLLCFGR_PLLM_Field := 16#0#; -- unspecified Reserved_7_7 : HAL.Bit := 16#0#; -- Main PLL multiplication factor for VCO PLLN : PLLCFGR_PLLN_Field := 16#10#; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- Main PLL PLLSAI3CLK output enable PLLPEN : Boolean := False; -- Main PLL division factor for PLLSAI3CLK (SAI1 and SAI2 clock) PLLP : Boolean := False; -- unspecified Reserved_18_19 : HAL.UInt2 := 16#0#; -- Main PLL PLLUSB1CLK output enable PLLQEN : Boolean := False; -- Main PLL division factor for PLLUSB1CLK(48 MHz clock) PLLQ : PLLCFGR_PLLQ_Field := 16#0#; -- unspecified Reserved_23_23 : HAL.Bit := 16#0#; -- Main PLL PLLCLK output enable PLLREN : Boolean := False; -- Main PLL division factor for PLLCLK (system clock) PLLR : PLLCFGR_PLLR_Field := 16#0#; -- Main PLL division factor for PLLSAI2CLK PLLPDIV : PLLCFGR_PLLPDIV_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PLLCFGR_Register use record PLLSRC at 0 range 0 .. 1; Reserved_2_3 at 0 range 2 .. 3; PLLM at 0 range 4 .. 6; Reserved_7_7 at 0 range 7 .. 7; PLLN at 0 range 8 .. 14; Reserved_15_15 at 0 range 15 .. 15; PLLPEN at 0 range 16 .. 16; PLLP at 0 range 17 .. 17; Reserved_18_19 at 0 range 18 .. 19; PLLQEN at 0 range 20 .. 20; PLLQ at 0 range 21 .. 22; Reserved_23_23 at 0 range 23 .. 23; PLLREN at 0 range 24 .. 24; PLLR at 0 range 25 .. 26; PLLPDIV at 0 range 27 .. 31; end record; subtype PLLSAI1CFGR_PLLSAI1N_Field is HAL.UInt7; subtype PLLSAI1CFGR_PLLSAI1Q_Field is HAL.UInt2; subtype PLLSAI1CFGR_PLLSAI1R_Field is HAL.UInt2; subtype PLLSAI1CFGR_PLLSAI1PDIV_Field is HAL.UInt5; -- PLLSAI1 configuration register type PLLSAI1CFGR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- SAI1PLL multiplication factor for VCO PLLSAI1N : PLLSAI1CFGR_PLLSAI1N_Field := 16#10#; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- SAI1PLL PLLSAI1CLK output enable PLLSAI1PEN : Boolean := False; -- SAI1PLL division factor for PLLSAI1CLK (SAI1 or SAI2 clock) PLLSAI1P : Boolean := False; -- unspecified Reserved_18_19 : HAL.UInt2 := 16#0#; -- SAI1PLL PLLUSB2CLK output enable PLLSAI1QEN : Boolean := False; -- SAI1PLL division factor for PLLUSB2CLK (48 MHz clock) PLLSAI1Q : PLLSAI1CFGR_PLLSAI1Q_Field := 16#0#; -- unspecified Reserved_23_23 : HAL.Bit := 16#0#; -- PLLSAI1 PLLADC1CLK output enable PLLSAI1REN : Boolean := False; -- PLLSAI1 division factor for PLLADC1CLK (ADC clock) PLLSAI1R : PLLSAI1CFGR_PLLSAI1R_Field := 16#0#; -- PLLSAI1 division factor for PLLSAI1CLK PLLSAI1PDIV : PLLSAI1CFGR_PLLSAI1PDIV_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PLLSAI1CFGR_Register use record Reserved_0_7 at 0 range 0 .. 7; PLLSAI1N at 0 range 8 .. 14; Reserved_15_15 at 0 range 15 .. 15; PLLSAI1PEN at 0 range 16 .. 16; PLLSAI1P at 0 range 17 .. 17; Reserved_18_19 at 0 range 18 .. 19; PLLSAI1QEN at 0 range 20 .. 20; PLLSAI1Q at 0 range 21 .. 22; Reserved_23_23 at 0 range 23 .. 23; PLLSAI1REN at 0 range 24 .. 24; PLLSAI1R at 0 range 25 .. 26; PLLSAI1PDIV at 0 range 27 .. 31; end record; -- Clock interrupt enable register type CIER_Register is record -- LSI ready interrupt enable LSIRDYIE : Boolean := False; -- LSE ready interrupt enable LSERDYIE : Boolean := False; -- MSI ready interrupt enable MSIRDYIE : Boolean := False; -- HSI ready interrupt enable HSIRDYIE : Boolean := False; -- HSE ready interrupt enable HSERDYIE : Boolean := False; -- PLL ready interrupt enable PLLRDYIE : Boolean := False; -- PLLSAI1 ready interrupt enable PLLSAI1RDYIE : Boolean := False; -- unspecified Reserved_7_8 : HAL.UInt2 := 16#0#; -- LSE clock security system interrupt enable LSECSSIE : Boolean := False; -- HSI48 ready interrupt enable HSI48RDYIE : Boolean := False; -- unspecified Reserved_11_31 : HAL.UInt21 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CIER_Register use record LSIRDYIE at 0 range 0 .. 0; LSERDYIE at 0 range 1 .. 1; MSIRDYIE at 0 range 2 .. 2; HSIRDYIE at 0 range 3 .. 3; HSERDYIE at 0 range 4 .. 4; PLLRDYIE at 0 range 5 .. 5; PLLSAI1RDYIE at 0 range 6 .. 6; Reserved_7_8 at 0 range 7 .. 8; LSECSSIE at 0 range 9 .. 9; HSI48RDYIE at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- Clock interrupt flag register type CIFR_Register is record -- Read-only. LSI ready interrupt flag LSIRDYF : Boolean; -- Read-only. LSE ready interrupt flag LSERDYF : Boolean; -- Read-only. MSI ready interrupt flag MSIRDYF : Boolean; -- Read-only. HSI ready interrupt flag HSIRDYF : Boolean; -- Read-only. HSE ready interrupt flag HSERDYF : Boolean; -- Read-only. PLL ready interrupt flag PLLRDYF : Boolean; -- Read-only. PLLSAI1 ready interrupt flag PLLSAI1RDYF : Boolean; -- unspecified Reserved_7_7 : HAL.Bit; -- Read-only. Clock security system interrupt flag CSSF : Boolean; -- Read-only. LSE Clock security system interrupt flag LSECSSF : Boolean; -- Read-only. HSI48 ready interrupt flag HSI48RDYF : Boolean; -- unspecified Reserved_11_31 : HAL.UInt21; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CIFR_Register use record LSIRDYF at 0 range 0 .. 0; LSERDYF at 0 range 1 .. 1; MSIRDYF at 0 range 2 .. 2; HSIRDYF at 0 range 3 .. 3; HSERDYF at 0 range 4 .. 4; PLLRDYF at 0 range 5 .. 5; PLLSAI1RDYF at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; CSSF at 0 range 8 .. 8; LSECSSF at 0 range 9 .. 9; HSI48RDYF at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- Clock interrupt clear register type CICR_Register is record -- Write-only. LSI ready interrupt clear LSIRDYC : Boolean := False; -- Write-only. LSE ready interrupt clear LSERDYC : Boolean := False; -- Write-only. MSI ready interrupt clear MSIRDYC : Boolean := False; -- Write-only. HSI ready interrupt clear HSIRDYC : Boolean := False; -- Write-only. HSE ready interrupt clear HSERDYC : Boolean := False; -- Write-only. PLL ready interrupt clear PLLRDYC : Boolean := False; -- Write-only. PLLSAI1 ready interrupt clear PLLSAI1RDYC : Boolean := False; -- unspecified Reserved_7_7 : HAL.Bit := 16#0#; -- Write-only. Clock security system interrupt clear CSSC : Boolean := False; -- Write-only. LSE Clock security system interrupt clear LSECSSC : Boolean := False; -- Write-only. HSI48 oscillator ready interrupt clear HSI48RDYC : Boolean := False; -- unspecified Reserved_11_31 : HAL.UInt21 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CICR_Register use record LSIRDYC at 0 range 0 .. 0; LSERDYC at 0 range 1 .. 1; MSIRDYC at 0 range 2 .. 2; HSIRDYC at 0 range 3 .. 3; HSERDYC at 0 range 4 .. 4; PLLRDYC at 0 range 5 .. 5; PLLSAI1RDYC at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; CSSC at 0 range 8 .. 8; LSECSSC at 0 range 9 .. 9; HSI48RDYC at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- AHB1 peripheral reset register type AHB1RSTR_Register is record -- DMA1 reset DMA1RST : Boolean := False; -- DMA2 reset DMA2RST : Boolean := False; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- Flash memory interface reset FLASHRST : Boolean := False; -- unspecified Reserved_9_10 : HAL.UInt2 := 16#0#; -- CRC reset CRCRST : Boolean := False; -- unspecified Reserved_12_15 : HAL.UInt4 := 16#0#; -- Touch Sensing Controller reset TSCRST : Boolean := False; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB1RSTR_Register use record DMA1RST at 0 range 0 .. 0; DMA2RST at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; FLASHRST at 0 range 8 .. 8; Reserved_9_10 at 0 range 9 .. 10; CRCRST at 0 range 11 .. 11; Reserved_12_15 at 0 range 12 .. 15; TSCRST at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; -- AHB2 peripheral reset register type AHB2RSTR_Register is record -- IO port A reset GPIOARST : Boolean := False; -- IO port B reset GPIOBRST : Boolean := False; -- IO port C reset GPIOCRST : Boolean := False; -- IO port D reset GPIODRST : Boolean := False; -- IO port E reset GPIOERST : Boolean := False; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#0#; -- IO port H reset GPIOHRST : Boolean := False; -- unspecified Reserved_8_12 : HAL.UInt5 := 16#0#; -- ADC reset ADCRST : Boolean := False; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- AES hardware accelerator reset AESRST : Boolean := False; -- unspecified Reserved_17_17 : HAL.Bit := 16#0#; -- Random number generator reset RNGRST : Boolean := False; -- unspecified Reserved_19_31 : HAL.UInt13 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB2RSTR_Register use record GPIOARST at 0 range 0 .. 0; GPIOBRST at 0 range 1 .. 1; GPIOCRST at 0 range 2 .. 2; GPIODRST at 0 range 3 .. 3; GPIOERST at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; GPIOHRST at 0 range 7 .. 7; Reserved_8_12 at 0 range 8 .. 12; ADCRST at 0 range 13 .. 13; Reserved_14_15 at 0 range 14 .. 15; AESRST at 0 range 16 .. 16; Reserved_17_17 at 0 range 17 .. 17; RNGRST at 0 range 18 .. 18; Reserved_19_31 at 0 range 19 .. 31; end record; -- AHB3 peripheral reset register type AHB3RSTR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- Quad SPI memory interface reset QSPIRST : Boolean := False; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB3RSTR_Register use record Reserved_0_7 at 0 range 0 .. 7; QSPIRST at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- APB1 peripheral reset register 1 type APB1RSTR1_Register is record -- TIM2 timer reset TIM2RST : Boolean := False; -- unspecified Reserved_1_3 : HAL.UInt3 := 16#0#; -- TIM6 timer reset TIM6RST : Boolean := False; -- TIM7 timer reset TIM7RST : Boolean := False; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- LCD interface reset LCDRST : Boolean := False; -- unspecified Reserved_10_13 : HAL.UInt4 := 16#0#; -- SPI2 reset SPI2RST : Boolean := False; -- SPI3 reset SPI3RST : Boolean := False; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; -- USART2 reset USART2RST : Boolean := False; -- USART1 reset USART1RST : Boolean := False; -- USART4 reset. USART4RST : Boolean := False; -- unspecified Reserved_20_20 : HAL.Bit := 16#0#; -- I2C1 reset I2C1RST : Boolean := False; -- I2C2 reset I2C2RST : Boolean := False; -- I2C3 reset I2C3RST : Boolean := False; -- CRS reset CRSRST : Boolean := False; -- CAN1 reset CAN1RST : Boolean := False; -- USB FS reset USBFSRST : Boolean := False; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Power interface reset PWRRST : Boolean := False; -- DAC1 interface reset DAC1RST : Boolean := False; -- OPAMP interface reset OPAMPRST : Boolean := False; -- Low Power Timer 1 reset LPTIM1RST : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1RSTR1_Register use record TIM2RST at 0 range 0 .. 0; Reserved_1_3 at 0 range 1 .. 3; TIM6RST at 0 range 4 .. 4; TIM7RST at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; LCDRST at 0 range 9 .. 9; Reserved_10_13 at 0 range 10 .. 13; SPI2RST at 0 range 14 .. 14; SPI3RST at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; USART2RST at 0 range 17 .. 17; USART1RST at 0 range 18 .. 18; USART4RST at 0 range 19 .. 19; Reserved_20_20 at 0 range 20 .. 20; I2C1RST at 0 range 21 .. 21; I2C2RST at 0 range 22 .. 22; I2C3RST at 0 range 23 .. 23; CRSRST at 0 range 24 .. 24; CAN1RST at 0 range 25 .. 25; USBFSRST at 0 range 26 .. 26; Reserved_27_27 at 0 range 27 .. 27; PWRRST at 0 range 28 .. 28; DAC1RST at 0 range 29 .. 29; OPAMPRST at 0 range 30 .. 30; LPTIM1RST at 0 range 31 .. 31; end record; -- APB1 peripheral reset register 2 type APB1RSTR2_Register is record -- Low-power UART 1 reset LPUART1RST : Boolean := False; -- I2C4 reset I2C4RST : Boolean := False; -- Single wire protocol reset SWPMI1RST : Boolean := False; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- Low-power timer 2 reset LPTIM2RST : Boolean := False; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1RSTR2_Register use record LPUART1RST at 0 range 0 .. 0; I2C4RST at 0 range 1 .. 1; SWPMI1RST at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; LPTIM2RST at 0 range 5 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; -- APB2 peripheral reset register type APB2RSTR_Register is record -- System configuration (SYSCFG) reset SYSCFGRST : Boolean := False; -- unspecified Reserved_1_9 : HAL.UInt9 := 16#0#; -- SDMMC reset SDMMCRST : Boolean := False; -- TIM1 timer reset TIM1RST : Boolean := False; -- SPI1 reset SPI1RST : Boolean := False; -- unspecified Reserved_13_13 : HAL.Bit := 16#0#; -- USART1 reset USART1RST : Boolean := False; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- TIM15 timer reset TIM15RST : Boolean := False; -- TIM16 timer reset TIM16RST : Boolean := False; -- unspecified Reserved_18_20 : HAL.UInt3 := 16#0#; -- Serial audio interface 1 (SAI1) reset SAI1RST : Boolean := False; -- unspecified Reserved_22_23 : HAL.UInt2 := 16#0#; -- DFSDM filter reset DFSDMRST : Boolean := False; -- unspecified Reserved_25_31 : HAL.UInt7 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB2RSTR_Register use record SYSCFGRST at 0 range 0 .. 0; Reserved_1_9 at 0 range 1 .. 9; SDMMCRST at 0 range 10 .. 10; TIM1RST at 0 range 11 .. 11; SPI1RST at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1RST at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; TIM15RST at 0 range 16 .. 16; TIM16RST at 0 range 17 .. 17; Reserved_18_20 at 0 range 18 .. 20; SAI1RST at 0 range 21 .. 21; Reserved_22_23 at 0 range 22 .. 23; DFSDMRST at 0 range 24 .. 24; Reserved_25_31 at 0 range 25 .. 31; end record; -- AHB1 peripheral clock enable register type AHB1ENR_Register is record -- DMA1 clock enable DMA1EN : Boolean := False; -- DMA2 clock enable DMA2EN : Boolean := False; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- Flash memory interface clock enable FLASHEN : Boolean := True; -- unspecified Reserved_9_11 : HAL.UInt3 := 16#0#; -- CRC clock enable CRCEN : Boolean := False; -- unspecified Reserved_13_15 : HAL.UInt3 := 16#0#; -- Touch Sensing Controller clock enable TSCEN : Boolean := False; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB1ENR_Register use record DMA1EN at 0 range 0 .. 0; DMA2EN at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; FLASHEN at 0 range 8 .. 8; Reserved_9_11 at 0 range 9 .. 11; CRCEN at 0 range 12 .. 12; Reserved_13_15 at 0 range 13 .. 15; TSCEN at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; -- AHB2 peripheral clock enable register type AHB2ENR_Register is record -- IO port A clock enable GPIOAEN : Boolean := False; -- IO port B clock enable GPIOBEN : Boolean := False; -- IO port C clock enable GPIOCEN : Boolean := False; -- IO port D clock enable GPIODEN : Boolean := False; -- IO port E clock enable GPIOEEN : Boolean := False; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#0#; -- IO port H clock enable GPIOHEN : Boolean := False; -- unspecified Reserved_8_12 : HAL.UInt5 := 16#0#; -- ADC clock enable ADCEN : Boolean := False; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- AES accelerator clock enable AESEN : Boolean := False; -- unspecified Reserved_17_17 : HAL.Bit := 16#0#; -- Random Number Generator clock enable RNGEN : Boolean := False; -- unspecified Reserved_19_31 : HAL.UInt13 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB2ENR_Register use record GPIOAEN at 0 range 0 .. 0; GPIOBEN at 0 range 1 .. 1; GPIOCEN at 0 range 2 .. 2; GPIODEN at 0 range 3 .. 3; GPIOEEN at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; GPIOHEN at 0 range 7 .. 7; Reserved_8_12 at 0 range 8 .. 12; ADCEN at 0 range 13 .. 13; Reserved_14_15 at 0 range 14 .. 15; AESEN at 0 range 16 .. 16; Reserved_17_17 at 0 range 17 .. 17; RNGEN at 0 range 18 .. 18; Reserved_19_31 at 0 range 19 .. 31; end record; -- AHB3 peripheral clock enable register type AHB3ENR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#0#; -- QSPIEN QSPIEN : Boolean := False; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB3ENR_Register use record Reserved_0_7 at 0 range 0 .. 7; QSPIEN at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- APB1ENR1 type APB1ENR1_Register is record -- TIM2 timer clock enable TIM2EN : Boolean := False; -- TIM3 timer clock enable TIM3EN : Boolean := False; -- unspecified Reserved_2_3 : HAL.UInt2 := 16#0#; -- TIM6 timer clock enable TIM6EN : Boolean := False; -- TIM7 timer clock enable TIM7EN : Boolean := False; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- LCD clock enable LCDEN : Boolean := False; -- RTC APB clock enable RTCAPBEN : Boolean := False; -- Window watchdog clock enable WWDGEN : Boolean := False; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- SPI1 clock enable SPI1EN : Boolean := False; -- SPI3 clock enable SPI3EN : Boolean := False; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; -- USART2 clock enable USART2EN : Boolean := False; -- USART1 clock enable USART1EN : Boolean := False; -- UART4 clock enable UART4EN : Boolean := False; -- unspecified Reserved_20_20 : HAL.Bit := 16#0#; -- I2C1 clock enable I2C1EN : Boolean := False; -- I2C2 clock enable I2C2EN : Boolean := False; -- I2C3 clock enable I2C3EN : Boolean := False; -- CRS clock enable CRSEN : Boolean := False; -- CAN1 clock enable CAN1EN : Boolean := False; -- USB FS clock enable USBF : Boolean := False; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Power interface clock enable PWREN : Boolean := False; -- DAC1 interface clock enable DAC1EN : Boolean := False; -- OPAMP interface clock enable OPAMPEN : Boolean := False; -- Low power timer 1 clock enable LPTIM1EN : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1ENR1_Register use record TIM2EN at 0 range 0 .. 0; TIM3EN at 0 range 1 .. 1; Reserved_2_3 at 0 range 2 .. 3; TIM6EN at 0 range 4 .. 4; TIM7EN at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; LCDEN at 0 range 9 .. 9; RTCAPBEN at 0 range 10 .. 10; WWDGEN at 0 range 11 .. 11; Reserved_12_13 at 0 range 12 .. 13; SPI1EN at 0 range 14 .. 14; SPI3EN at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; USART2EN at 0 range 17 .. 17; USART1EN at 0 range 18 .. 18; UART4EN at 0 range 19 .. 19; Reserved_20_20 at 0 range 20 .. 20; I2C1EN at 0 range 21 .. 21; I2C2EN at 0 range 22 .. 22; I2C3EN at 0 range 23 .. 23; CRSEN at 0 range 24 .. 24; CAN1EN at 0 range 25 .. 25; USBF at 0 range 26 .. 26; Reserved_27_27 at 0 range 27 .. 27; PWREN at 0 range 28 .. 28; DAC1EN at 0 range 29 .. 29; OPAMPEN at 0 range 30 .. 30; LPTIM1EN at 0 range 31 .. 31; end record; -- APB1 peripheral clock enable register 2 type APB1ENR2_Register is record -- Low power UART 1 clock enable LPUART1EN : Boolean := False; -- I2C4 clock enable I2C4EN : Boolean := False; -- Single wire protocol clock enable SWPMI1EN : Boolean := False; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- LPTIM2EN LPTIM2EN : Boolean := False; -- unspecified Reserved_6_23 : HAL.UInt18 := 16#0#; -- DFSDMEN enable DFSDMEN : Boolean := False; -- unspecified Reserved_25_31 : HAL.UInt7 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1ENR2_Register use record LPUART1EN at 0 range 0 .. 0; I2C4EN at 0 range 1 .. 1; SWPMI1EN at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; LPTIM2EN at 0 range 5 .. 5; Reserved_6_23 at 0 range 6 .. 23; DFSDMEN at 0 range 24 .. 24; Reserved_25_31 at 0 range 25 .. 31; end record; -- APB2ENR type APB2ENR_Register is record -- SYSCFG clock enable SYSCFGEN : Boolean := False; -- unspecified Reserved_1_6 : HAL.UInt6 := 16#0#; -- Firewall clock enable FIREWALLEN : Boolean := False; -- unspecified Reserved_8_9 : HAL.UInt2 := 16#0#; -- SDMMC clock enable SDMMCEN : Boolean := False; -- TIM1 timer clock enable TIM1EN : Boolean := False; -- SPI1 clock enable SPI1EN : Boolean := False; -- unspecified Reserved_13_13 : HAL.Bit := 16#0#; -- USART1clock enable USART1EN : Boolean := False; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- TIM15 timer clock enable TIM15EN : Boolean := False; -- TIM16 timer clock enable TIM16EN : Boolean := False; -- unspecified Reserved_18_20 : HAL.UInt3 := 16#0#; -- SAI1 clock enable SAI1EN : Boolean := False; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB2ENR_Register use record SYSCFGEN at 0 range 0 .. 0; Reserved_1_6 at 0 range 1 .. 6; FIREWALLEN at 0 range 7 .. 7; Reserved_8_9 at 0 range 8 .. 9; SDMMCEN at 0 range 10 .. 10; TIM1EN at 0 range 11 .. 11; SPI1EN at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1EN at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; TIM15EN at 0 range 16 .. 16; TIM16EN at 0 range 17 .. 17; Reserved_18_20 at 0 range 18 .. 20; SAI1EN at 0 range 21 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; -- AHB1 peripheral clocks enable in Sleep and Stop modes register type AHB1SMENR_Register is record -- DMA1 clocks enable during Sleep and Stop modes DMA1SMEN : Boolean := True; -- DMA2 clocks enable during Sleep and Stop modes DMA2SMEN : Boolean := True; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- Flash memory interface clocks enable during Sleep and Stop modes FLASHSMEN : Boolean := True; -- SRAM1 interface clocks enable during Sleep and Stop modes SRAM1SMEN : Boolean := True; -- unspecified Reserved_10_11 : HAL.UInt2 := 16#0#; -- CRCSMEN CRCSMEN : Boolean := True; -- unspecified Reserved_13_15 : HAL.UInt3 := 16#0#; -- Touch Sensing Controller clocks enable during Sleep and Stop modes TSCSMEN : Boolean := True; -- unspecified Reserved_17_31 : HAL.UInt15 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB1SMENR_Register use record DMA1SMEN at 0 range 0 .. 0; DMA2SMEN at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; FLASHSMEN at 0 range 8 .. 8; SRAM1SMEN at 0 range 9 .. 9; Reserved_10_11 at 0 range 10 .. 11; CRCSMEN at 0 range 12 .. 12; Reserved_13_15 at 0 range 13 .. 15; TSCSMEN at 0 range 16 .. 16; Reserved_17_31 at 0 range 17 .. 31; end record; -- AHB2 peripheral clocks enable in Sleep and Stop modes register type AHB2SMENR_Register is record -- IO port A clocks enable during Sleep and Stop modes GPIOASMEN : Boolean := True; -- IO port B clocks enable during Sleep and Stop modes GPIOBSMEN : Boolean := True; -- IO port C clocks enable during Sleep and Stop modes GPIOCSMEN : Boolean := True; -- IO port D clocks enable during Sleep and Stop modes GPIODSMEN : Boolean := True; -- IO port E clocks enable during Sleep and Stop modes GPIOESMEN : Boolean := True; -- unspecified Reserved_5_6 : HAL.UInt2 := 16#3#; -- IO port H clocks enable during Sleep and Stop modes GPIOHSMEN : Boolean := True; -- unspecified Reserved_8_8 : HAL.Bit := 16#0#; -- SRAM2 interface clocks enable during Sleep and Stop modes SRAM2SMEN : Boolean := True; -- unspecified Reserved_10_12 : HAL.UInt3 := 16#4#; -- ADC clocks enable during Sleep and Stop modes ADCFSSMEN : Boolean := True; -- unspecified Reserved_14_15 : HAL.UInt2 := 16#0#; -- AES accelerator clocks enable during Sleep and Stop modes AESSMEN : Boolean := True; -- unspecified Reserved_17_17 : HAL.Bit := 16#0#; -- Random Number Generator clocks enable during Sleep and Stop modes RNGSMEN : Boolean := True; -- unspecified Reserved_19_31 : HAL.UInt13 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB2SMENR_Register use record GPIOASMEN at 0 range 0 .. 0; GPIOBSMEN at 0 range 1 .. 1; GPIOCSMEN at 0 range 2 .. 2; GPIODSMEN at 0 range 3 .. 3; GPIOESMEN at 0 range 4 .. 4; Reserved_5_6 at 0 range 5 .. 6; GPIOHSMEN at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; SRAM2SMEN at 0 range 9 .. 9; Reserved_10_12 at 0 range 10 .. 12; ADCFSSMEN at 0 range 13 .. 13; Reserved_14_15 at 0 range 14 .. 15; AESSMEN at 0 range 16 .. 16; Reserved_17_17 at 0 range 17 .. 17; RNGSMEN at 0 range 18 .. 18; Reserved_19_31 at 0 range 19 .. 31; end record; -- AHB3 peripheral clocks enable in Sleep and Stop modes register type AHB3SMENR_Register is record -- unspecified Reserved_0_7 : HAL.UInt8 := 16#1#; -- QSPISMEN QSPISMEN : Boolean := True; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for AHB3SMENR_Register use record Reserved_0_7 at 0 range 0 .. 7; QSPISMEN at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- APB1SMENR1 type APB1SMENR1_Register is record -- TIM2 timer clocks enable during Sleep and Stop modes TIM2SMEN : Boolean := True; -- unspecified Reserved_1_3 : HAL.UInt3 := 16#7#; -- TIM6 timer clocks enable during Sleep and Stop modes TIM6SMEN : Boolean := True; -- TIM7 timer clocks enable during Sleep and Stop modes TIM7SMEN : Boolean := True; -- unspecified Reserved_6_8 : HAL.UInt3 := 16#0#; -- LCD clocks enable during Sleep and Stop modes LCDSMEN : Boolean := True; -- RTC APB clock enable during Sleep and Stop modes RTCAPBSMEN : Boolean := False; -- Window watchdog clocks enable during Sleep and Stop modes WWDGSMEN : Boolean := True; -- unspecified Reserved_12_13 : HAL.UInt2 := 16#0#; -- SPI2 clocks enable during Sleep and Stop modes SPI2SMEN : Boolean := True; -- SPI3 clocks enable during Sleep and Stop modes SP3SMEN : Boolean := True; -- unspecified Reserved_16_16 : HAL.Bit := 16#0#; -- USART1 clocks enable during Sleep and Stop modes USART1SMEN : Boolean := True; -- USART2 clocks enable during Sleep and Stop modes USART2SMEN : Boolean := True; -- unspecified Reserved_19_20 : HAL.UInt2 := 16#3#; -- I2C1 clocks enable during Sleep and Stop modes I2C1SMEN : Boolean := True; -- I2C2 clocks enable during Sleep and Stop modes I2C2SMEN : Boolean := True; -- I2C3 clocks enable during Sleep and Stop modes I2C3SMEN : Boolean := True; -- CRS clock enable during Sleep and Stop modes CRSSMEN : Boolean := False; -- CAN1 clocks enable during Sleep and Stop modes CAN1SMEN : Boolean := True; -- USB FS clock enable during Sleep and Stop modes USBFSSMEN : Boolean := False; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- Power interface clocks enable during Sleep and Stop modes PWRSMEN : Boolean := True; -- DAC1 interface clocks enable during Sleep and Stop modes DAC1SMEN : Boolean := True; -- OPAMP interface clocks enable during Sleep and Stop modes OPAMPSMEN : Boolean := True; -- Low power timer 1 clocks enable during Sleep and Stop modes LPTIM1SMEN : Boolean := True; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1SMENR1_Register use record TIM2SMEN at 0 range 0 .. 0; Reserved_1_3 at 0 range 1 .. 3; TIM6SMEN at 0 range 4 .. 4; TIM7SMEN at 0 range 5 .. 5; Reserved_6_8 at 0 range 6 .. 8; LCDSMEN at 0 range 9 .. 9; RTCAPBSMEN at 0 range 10 .. 10; WWDGSMEN at 0 range 11 .. 11; Reserved_12_13 at 0 range 12 .. 13; SPI2SMEN at 0 range 14 .. 14; SP3SMEN at 0 range 15 .. 15; Reserved_16_16 at 0 range 16 .. 16; USART1SMEN at 0 range 17 .. 17; USART2SMEN at 0 range 18 .. 18; Reserved_19_20 at 0 range 19 .. 20; I2C1SMEN at 0 range 21 .. 21; I2C2SMEN at 0 range 22 .. 22; I2C3SMEN at 0 range 23 .. 23; CRSSMEN at 0 range 24 .. 24; CAN1SMEN at 0 range 25 .. 25; USBFSSMEN at 0 range 26 .. 26; Reserved_27_27 at 0 range 27 .. 27; PWRSMEN at 0 range 28 .. 28; DAC1SMEN at 0 range 29 .. 29; OPAMPSMEN at 0 range 30 .. 30; LPTIM1SMEN at 0 range 31 .. 31; end record; -- APB1 peripheral clocks enable in Sleep and Stop modes register 2 type APB1SMENR2_Register is record -- Low power UART 1 clocks enable during Sleep and Stop modes LPUART1SMEN : Boolean := True; -- unspecified Reserved_1_1 : HAL.Bit := 16#0#; -- Single wire protocol clocks enable during Sleep and Stop modes SWPMI1SMEN : Boolean := True; -- unspecified Reserved_3_4 : HAL.UInt2 := 16#0#; -- LPTIM2SMEN LPTIM2SMEN : Boolean := True; -- unspecified Reserved_6_31 : HAL.UInt26 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB1SMENR2_Register use record LPUART1SMEN at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; SWPMI1SMEN at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; LPTIM2SMEN at 0 range 5 .. 5; Reserved_6_31 at 0 range 6 .. 31; end record; -- APB2SMENR type APB2SMENR_Register is record -- SYSCFG clocks enable during Sleep and Stop modes SYSCFGSMEN : Boolean := True; -- unspecified Reserved_1_9 : HAL.UInt9 := 16#0#; -- SDMMC clocks enable during Sleep and Stop modes SDMMCSMEN : Boolean := True; -- TIM1 timer clocks enable during Sleep and Stop modes TIM1SMEN : Boolean := True; -- SPI1 clocks enable during Sleep and Stop modes SPI1SMEN : Boolean := True; -- unspecified Reserved_13_13 : HAL.Bit := 16#1#; -- USART1clocks enable during Sleep and Stop modes USART1SMEN : Boolean := True; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- TIM15 timer clocks enable during Sleep and Stop modes TIM15SMEN : Boolean := True; -- TIM16 timer clocks enable during Sleep and Stop modes TIM16SMEN : Boolean := True; -- unspecified Reserved_18_20 : HAL.UInt3 := 16#1#; -- SAI1 clocks enable during Sleep and Stop modes SAI1SMEN : Boolean := True; -- unspecified Reserved_22_31 : HAL.UInt10 := 16#5#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for APB2SMENR_Register use record SYSCFGSMEN at 0 range 0 .. 0; Reserved_1_9 at 0 range 1 .. 9; SDMMCSMEN at 0 range 10 .. 10; TIM1SMEN at 0 range 11 .. 11; SPI1SMEN at 0 range 12 .. 12; Reserved_13_13 at 0 range 13 .. 13; USART1SMEN at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; TIM15SMEN at 0 range 16 .. 16; TIM16SMEN at 0 range 17 .. 17; Reserved_18_20 at 0 range 18 .. 20; SAI1SMEN at 0 range 21 .. 21; Reserved_22_31 at 0 range 22 .. 31; end record; subtype CCIPR_USART1SEL_Field is HAL.UInt2; subtype CCIPR_USART2SEL_Field is HAL.UInt2; subtype CCIPR_USART3SEL_Field is HAL.UInt2; subtype CCIPR_USART4SEL_Field is HAL.UInt2; subtype CCIPR_LPUART1SEL_Field is HAL.UInt2; subtype CCIPR_I2C1SEL_Field is HAL.UInt2; subtype CCIPR_I2C2SEL_Field is HAL.UInt2; subtype CCIPR_I2C3SEL_Field is HAL.UInt2; subtype CCIPR_LPTIM1SEL_Field is HAL.UInt2; subtype CCIPR_LPTIM2SEL_Field is HAL.UInt2; subtype CCIPR_SAI1SEL_Field is HAL.UInt2; subtype CCIPR_CLK48SEL_Field is HAL.UInt2; subtype CCIPR_ADCSEL_Field is HAL.UInt2; -- CCIPR type CCIPR_Register is record -- USART1 clock source selection USART1SEL : CCIPR_USART1SEL_Field := 16#0#; -- USART2 clock source selection USART2SEL : CCIPR_USART2SEL_Field := 16#0#; -- USART3 clock source selection USART3SEL : CCIPR_USART3SEL_Field := 16#0#; -- USART4 clock source selection USART4SEL : CCIPR_USART4SEL_Field := 16#0#; -- unspecified Reserved_8_9 : HAL.UInt2 := 16#0#; -- LPUART1 clock source selection LPUART1SEL : CCIPR_LPUART1SEL_Field := 16#0#; -- I2C1 clock source selection I2C1SEL : CCIPR_I2C1SEL_Field := 16#0#; -- I2C2 clock source selection I2C2SEL : CCIPR_I2C2SEL_Field := 16#0#; -- I2C3 clock source selection I2C3SEL : CCIPR_I2C3SEL_Field := 16#0#; -- Low power timer 1 clock source selection LPTIM1SEL : CCIPR_LPTIM1SEL_Field := 16#0#; -- Low power timer 2 clock source selection LPTIM2SEL : CCIPR_LPTIM2SEL_Field := 16#0#; -- SAI1 clock source selection SAI1SEL : CCIPR_SAI1SEL_Field := 16#0#; -- unspecified Reserved_24_25 : HAL.UInt2 := 16#0#; -- 48 MHz clock source selection CLK48SEL : CCIPR_CLK48SEL_Field := 16#0#; -- ADCs clock source selection ADCSEL : CCIPR_ADCSEL_Field := 16#0#; -- SWPMI1 clock source selection SWPMI1SEL : Boolean := False; -- unspecified Reserved_31_31 : HAL.Bit := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCIPR_Register use record USART1SEL at 0 range 0 .. 1; USART2SEL at 0 range 2 .. 3; USART3SEL at 0 range 4 .. 5; USART4SEL at 0 range 6 .. 7; Reserved_8_9 at 0 range 8 .. 9; LPUART1SEL at 0 range 10 .. 11; I2C1SEL at 0 range 12 .. 13; I2C2SEL at 0 range 14 .. 15; I2C3SEL at 0 range 16 .. 17; LPTIM1SEL at 0 range 18 .. 19; LPTIM2SEL at 0 range 20 .. 21; SAI1SEL at 0 range 22 .. 23; Reserved_24_25 at 0 range 24 .. 25; CLK48SEL at 0 range 26 .. 27; ADCSEL at 0 range 28 .. 29; SWPMI1SEL at 0 range 30 .. 30; Reserved_31_31 at 0 range 31 .. 31; end record; subtype BDCR_LSEDRV_Field is HAL.UInt2; subtype BDCR_RTCSEL_Field is HAL.UInt2; -- BDCR type BDCR_Register is record -- LSE oscillator enable LSEON : Boolean := False; -- Read-only. LSE oscillator ready LSERDY : Boolean := False; -- LSE oscillator bypass LSEBYP : Boolean := False; -- SE oscillator drive capability LSEDRV : BDCR_LSEDRV_Field := 16#0#; -- LSECSSON LSECSSON : Boolean := False; -- Read-only. LSECSSD LSECSSD : Boolean := False; -- unspecified Reserved_7_7 : HAL.Bit := 16#0#; -- RTC clock source selection RTCSEL : BDCR_RTCSEL_Field := 16#0#; -- unspecified Reserved_10_14 : HAL.UInt5 := 16#0#; -- RTC clock enable RTCEN : Boolean := False; -- Backup domain software reset BDRST : Boolean := False; -- unspecified Reserved_17_23 : HAL.UInt7 := 16#0#; -- Low speed clock output enable LSCOEN : Boolean := False; -- Low speed clock output selection LSCOSEL : Boolean := False; -- unspecified Reserved_26_31 : HAL.UInt6 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for BDCR_Register use record LSEON at 0 range 0 .. 0; LSERDY at 0 range 1 .. 1; LSEBYP at 0 range 2 .. 2; LSEDRV at 0 range 3 .. 4; LSECSSON at 0 range 5 .. 5; LSECSSD at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; RTCSEL at 0 range 8 .. 9; Reserved_10_14 at 0 range 10 .. 14; RTCEN at 0 range 15 .. 15; BDRST at 0 range 16 .. 16; Reserved_17_23 at 0 range 17 .. 23; LSCOEN at 0 range 24 .. 24; LSCOSEL at 0 range 25 .. 25; Reserved_26_31 at 0 range 26 .. 31; end record; subtype CSR_MSISRANGE_Field is HAL.UInt4; -- CSR type CSR_Register is record -- LSI oscillator enable LSION : Boolean := False; -- Read-only. LSI oscillator ready LSIRDY : Boolean := False; -- unspecified Reserved_2_7 : HAL.UInt6 := 16#0#; -- SI range after Standby mode MSISRANGE : CSR_MSISRANGE_Field := 16#6#; -- unspecified Reserved_12_22 : HAL.UInt11 := 16#0#; -- Remove reset flag RMVF : Boolean := False; -- Read-only. Firewall reset flag FIREWALLRSTF : Boolean := False; -- Read-only. Option byte loader reset flag OBLRSTF : Boolean := False; -- Read-only. Pin reset flag PINRSTF : Boolean := True; -- Read-only. BOR flag BORRSTF : Boolean := True; -- Read-only. Software reset flag SFTRSTF : Boolean := False; -- Read-only. Independent window watchdog reset flag IWDGRSTF : Boolean := False; -- Read-only. Window watchdog reset flag WWDGRSTF : Boolean := False; -- Read-only. Low-power reset flag LPWRSTF : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CSR_Register use record LSION at 0 range 0 .. 0; LSIRDY at 0 range 1 .. 1; Reserved_2_7 at 0 range 2 .. 7; MSISRANGE at 0 range 8 .. 11; Reserved_12_22 at 0 range 12 .. 22; RMVF at 0 range 23 .. 23; FIREWALLRSTF at 0 range 24 .. 24; OBLRSTF at 0 range 25 .. 25; PINRSTF at 0 range 26 .. 26; BORRSTF at 0 range 27 .. 27; SFTRSTF at 0 range 28 .. 28; IWDGRSTF at 0 range 29 .. 29; WWDGRSTF at 0 range 30 .. 30; LPWRSTF at 0 range 31 .. 31; end record; subtype CRRCR_HSI48CAL_Field is HAL.UInt9; -- Clock recovery RC register type CRRCR_Register is record -- HSI48 clock enable HSI48ON : Boolean := False; -- Read-only. HSI48 clock ready flag HSI48RDY : Boolean := False; -- unspecified Reserved_2_6 : HAL.UInt5 := 16#0#; -- Read-only. HSI48 clock calibration HSI48CAL : CRRCR_HSI48CAL_Field := 16#C#; -- unspecified Reserved_16_31 : HAL.UInt16 := 16#C00#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CRRCR_Register use record HSI48ON at 0 range 0 .. 0; HSI48RDY at 0 range 1 .. 1; Reserved_2_6 at 0 range 2 .. 6; HSI48CAL at 0 range 7 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Reset and clock control type RCC_Peripheral is record -- Clock control register CR : aliased CR_Register; -- Internal clock sources calibration register ICSCR : aliased ICSCR_Register; -- Clock configuration register CFGR : aliased CFGR_Register; -- PLL configuration register PLLCFGR : aliased PLLCFGR_Register; -- PLLSAI1 configuration register PLLSAI1CFGR : aliased PLLSAI1CFGR_Register; -- Clock interrupt enable register CIER : aliased CIER_Register; -- Clock interrupt flag register CIFR : aliased CIFR_Register; -- Clock interrupt clear register CICR : aliased CICR_Register; -- AHB1 peripheral reset register AHB1RSTR : aliased AHB1RSTR_Register; -- AHB2 peripheral reset register AHB2RSTR : aliased AHB2RSTR_Register; -- AHB3 peripheral reset register AHB3RSTR : aliased AHB3RSTR_Register; -- APB1 peripheral reset register 1 APB1RSTR1 : aliased APB1RSTR1_Register; -- APB1 peripheral reset register 2 APB1RSTR2 : aliased APB1RSTR2_Register; -- APB2 peripheral reset register APB2RSTR : aliased APB2RSTR_Register; -- AHB1 peripheral clock enable register AHB1ENR : aliased AHB1ENR_Register; -- AHB2 peripheral clock enable register AHB2ENR : aliased AHB2ENR_Register; -- AHB3 peripheral clock enable register AHB3ENR : aliased AHB3ENR_Register; -- APB1ENR1 APB1ENR1 : aliased APB1ENR1_Register; -- APB1 peripheral clock enable register 2 APB1ENR2 : aliased APB1ENR2_Register; -- APB2ENR APB2ENR : aliased APB2ENR_Register; -- AHB1 peripheral clocks enable in Sleep and Stop modes register AHB1SMENR : aliased AHB1SMENR_Register; -- AHB2 peripheral clocks enable in Sleep and Stop modes register AHB2SMENR : aliased AHB2SMENR_Register; -- AHB3 peripheral clocks enable in Sleep and Stop modes register AHB3SMENR : aliased AHB3SMENR_Register; -- APB1SMENR1 APB1SMENR1 : aliased APB1SMENR1_Register; -- APB1 peripheral clocks enable in Sleep and Stop modes register 2 APB1SMENR2 : aliased APB1SMENR2_Register; -- APB2SMENR APB2SMENR : aliased APB2SMENR_Register; -- CCIPR CCIPR : aliased CCIPR_Register; -- BDCR BDCR : aliased BDCR_Register; -- CSR CSR : aliased CSR_Register; -- Clock recovery RC register CRRCR : aliased CRRCR_Register; end record with Volatile; for RCC_Peripheral use record CR at 16#0# range 0 .. 31; ICSCR at 16#4# range 0 .. 31; CFGR at 16#8# range 0 .. 31; PLLCFGR at 16#C# range 0 .. 31; PLLSAI1CFGR at 16#10# range 0 .. 31; CIER at 16#18# range 0 .. 31; CIFR at 16#1C# range 0 .. 31; CICR at 16#20# range 0 .. 31; AHB1RSTR at 16#28# range 0 .. 31; AHB2RSTR at 16#2C# range 0 .. 31; AHB3RSTR at 16#30# range 0 .. 31; APB1RSTR1 at 16#38# range 0 .. 31; APB1RSTR2 at 16#3C# range 0 .. 31; APB2RSTR at 16#40# range 0 .. 31; AHB1ENR at 16#48# range 0 .. 31; AHB2ENR at 16#4C# range 0 .. 31; AHB3ENR at 16#50# range 0 .. 31; APB1ENR1 at 16#58# range 0 .. 31; APB1ENR2 at 16#5C# range 0 .. 31; APB2ENR at 16#60# range 0 .. 31; AHB1SMENR at 16#68# range 0 .. 31; AHB2SMENR at 16#6C# range 0 .. 31; AHB3SMENR at 16#70# range 0 .. 31; APB1SMENR1 at 16#78# range 0 .. 31; APB1SMENR2 at 16#7C# range 0 .. 31; APB2SMENR at 16#80# range 0 .. 31; CCIPR at 16#88# range 0 .. 31; BDCR at 16#90# range 0 .. 31; CSR at 16#94# range 0 .. 31; CRRCR at 16#98# range 0 .. 31; end record; -- Reset and clock control RCC_Periph : aliased RCC_Peripheral with Import, Address => System'To_Address (16#40021000#); end STM32_SVD.RCC;
-- Copyright 2017 Jeff Foley. All rights reserved. -- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file. local url = require("url") name = "Bing" type = "scrape" function start() setratelimit(1) end function vertical(ctx, domain) for i=1,201,10 do local ok = scrape(ctx, {['url']=buildurl(domain, i)}) if not ok then break end checkratelimit() end end function buildurl(domain, pagenum) local query = "domain:" .. domain local params = { q=query, first=pagenum, FORM="PORE", } return "http://www.bing.com/search?" .. url.build_query_string(params) end
---------------------------------------------------------------- -- ZLib for Ada thick binding. -- -- -- -- Copyright (C) 2002-2003 Dmitriy Anisimkov -- -- -- -- Open source license information is in the zlib.ads file. -- ---------------------------------------------------------------- -- Continuous test for ZLib multithreading. If the test would fail -- we should provide thread safe allocation routines for the Z_Stream. -- -- Id: mtest.adb,v 1.4 2004/07/23 07:49:54 vagul Exp with ZLib; with Ada.Streams; with Ada.Numerics.Discrete_Random; with Ada.Text_IO; with Ada.Exceptions; with Ada.Task_Identification; procedure MTest is use Ada.Streams; use ZLib; Stop : Boolean := False; pragma Atomic (Stop); subtype Visible_Symbols is Stream_Element range 16#20# .. 16#7E#; package Random_Elements is new Ada.Numerics.Discrete_Random (Visible_Symbols); task type Test_Task; task body Test_Task is Buffer : Stream_Element_Array (1 .. 100_000); Gen : Random_Elements.Generator; Buffer_First : Stream_Element_Offset; Compare_First : Stream_Element_Offset; Deflate : Filter_Type; Inflate : Filter_Type; procedure Further (Item : in Stream_Element_Array); procedure Read_Buffer (Item : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset); ------------- -- Further -- ------------- procedure Further (Item : in Stream_Element_Array) is procedure Compare (Item : in Stream_Element_Array); ------------- -- Compare -- ------------- procedure Compare (Item : in Stream_Element_Array) is Next_First : Stream_Element_Offset := Compare_First + Item'Length; begin if Buffer (Compare_First .. Next_First - 1) /= Item then raise Program_Error; end if; Compare_First := Next_First; end Compare; procedure Compare_Write is new ZLib.Write (Write => Compare); begin Compare_Write (Inflate, Item, No_Flush); end Further; ----------------- -- Read_Buffer -- ----------------- procedure Read_Buffer (Item : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset) is Buff_Diff : Stream_Element_Offset := Buffer'Last - Buffer_First; Next_First : Stream_Element_Offset; begin if Item'Length <= Buff_Diff then Last := Item'Last; Next_First := Buffer_First + Item'Length; Item := Buffer (Buffer_First .. Next_First - 1); Buffer_First := Next_First; else Last := Item'First + Buff_Diff; Item (Item'First .. Last) := Buffer (Buffer_First .. Buffer'Last); Buffer_First := Buffer'Last + 1; end if; end Read_Buffer; procedure Translate is new Generic_Translate (Data_In => Read_Buffer, Data_Out => Further); begin Random_Elements.Reset (Gen); Buffer := (others => 20); Main : loop for J in Buffer'Range loop Buffer (J) := Random_Elements.Random (Gen); Deflate_Init (Deflate); Inflate_Init (Inflate); Buffer_First := Buffer'First; Compare_First := Buffer'First; Translate (Deflate); if Compare_First /= Buffer'Last + 1 then raise Program_Error; end if; Ada.Text_IO.Put_Line (Ada.Task_Identification.Image (Ada.Task_Identification.Current_Task) & Stream_Element_Offset'Image (J) & ZLib.Count'Image (Total_Out (Deflate))); Close (Deflate); Close (Inflate); exit Main when Stop; end loop; end loop Main; exception when E : others => Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Information (E)); Stop := True; end Test_Task; Test : array (1 .. 4) of Test_Task; pragma Unreferenced (Test); Dummy : Character; begin Ada.Text_IO.Get_Immediate (Dummy); Stop := True; end MTest;
-- This file is part of the coreboot project. -- -- 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; version 2 of -- the License. -- -- 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. -- with HW.GFX.GMA; with HW.GFX.GMA.Display_Probing; use HW.GFX.GMA; use HW.GFX.GMA.Display_Probing; private package GMA.Mainboard is ports : constant Port_List := (DP1, DP2, DP3, HDMI1, HDMI2, HDMI3, Analog, Internal, others => Disabled); end GMA.Mainboard;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ C H 3 -- -- -- -- 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_Ch3 is procedure Analyze_Component_Declaration (N : Node_Id); procedure Analyze_Full_Type_Declaration (N : Node_Id); procedure Analyze_Incomplete_Type_Decl (N : Node_Id); procedure Analyze_Itype_Reference (N : Node_Id); procedure Analyze_Number_Declaration (N : Node_Id); procedure Analyze_Object_Declaration (N : Node_Id); procedure Analyze_Others_Choice (N : Node_Id); procedure Analyze_Private_Extension_Declaration (N : Node_Id); procedure Analyze_Subtype_Indication (N : Node_Id); procedure Analyze_Variant_Part (N : Node_Id); procedure Analyze_Subtype_Declaration (N : Node_Id; Skip : Boolean := False); -- Called to analyze a subtype declaration. The parameter Skip is used for -- Ada 2005 (AI-412). We set to True in order to avoid reentering the -- defining identifier of N when analyzing a rewritten incomplete subtype -- declaration. function Access_Definition (Related_Nod : Node_Id; N : Node_Id) return Entity_Id; -- An access definition defines a general access type for a formal -- parameter. The procedure is called when processing formals, when the -- current scope is the subprogram. The Implicit type is attached to the -- Related_Nod put into the enclosing scope, so that the only entities -- defined in the spec are the formals themselves. procedure Access_Subprogram_Declaration (T_Name : Entity_Id; T_Def : Node_Id); -- The subprogram specification yields the signature of an implicit -- type, whose Ekind is Access_Subprogram_Type. This implicit type is the -- designated type of the declared access type. In subprogram calls, the -- signature of the implicit type works like the profile of a regular -- subprogram. procedure Add_Internal_Interface_Entities (Tagged_Type : Entity_Id); -- Add to the list of primitives of Tagged_Type the internal entities -- associated with covered interface primitives. These entities link the -- interface primitives with the tagged type primitives that cover them. procedure Analyze_Declarations (L : List_Id); -- Called to analyze a list of declarations (in what context ???). Also -- performs necessary freezing actions (more description needed ???) procedure Analyze_Interface_Declaration (T : Entity_Id; Def : Node_Id); -- Analyze an interface declaration or a formal interface declaration procedure Array_Type_Declaration (T : in out Entity_Id; Def : Node_Id); -- Process an array type declaration. If the array is constrained, we -- create an implicit parent array type, with the same index types and -- component type. procedure Access_Type_Declaration (T : Entity_Id; Def : Node_Id); -- Process an access type declaration procedure Build_Itype_Reference (Ityp : Entity_Id; Nod : Node_Id); -- Create a reference to an internal type, for use by Gigi. The back-end -- elaborates itypes on demand, i.e. when their first use is seen. This can -- lead to scope anomalies if the first use is within a scope that is -- nested within the scope that contains the point of definition of the -- itype. The Itype_Reference node forces the elaboration of the itype -- in the proper scope. The node is inserted after Nod, which is the -- enclosing declaration that generated Ityp. -- -- A related mechanism is used during expansion, for itypes created in -- branches of conditionals. See Ensure_Defined in exp_util. Could both -- mechanisms be merged ??? procedure Check_Abstract_Overriding (T : Entity_Id); -- Check that all abstract subprograms inherited from T's parent type have -- been overridden as required, and that nonabstract subprograms have not -- been incorrectly overridden with an abstract subprogram. procedure Check_Aliased_Component_Types (T : Entity_Id); -- Given an array type or record type T, check that if the type is -- nonlimited, then the nominal subtype of any components of T that -- have discriminants must be constrained. procedure Check_Completion (Body_Id : Node_Id := Empty); -- At the end of a declarative part, verify that all entities that require -- completion have received one. If Body_Id is absent, the error indicating -- a missing completion is placed on the declaration that needs completion. -- If Body_Id is present, it is the defining identifier of a package body, -- and errors are posted on that node, rather than on the declarations that -- require completion in the package declaration. procedure Check_CPP_Type_Has_No_Defaults (T : Entity_Id); -- Check that components of imported CPP type T do not have default -- expressions because the constructor (if any) is on the C++ side. procedure Derive_Subprogram (New_Subp : out Entity_Id; Parent_Subp : Entity_Id; Derived_Type : Entity_Id; Parent_Type : Entity_Id; Actual_Subp : Entity_Id := Empty); -- Derive the subprogram Parent_Subp from Parent_Type, and replace the -- subsidiary subtypes with the derived type to build the specification of -- the inherited subprogram (returned in New_Subp). For tagged types, the -- derived subprogram is aliased to that of the actual (in the case where -- Actual_Subp is nonempty) rather than to the corresponding subprogram of -- the parent type. procedure Derive_Subprograms (Parent_Type : Entity_Id; Derived_Type : Entity_Id; Generic_Actual : Entity_Id := Empty); -- To complete type derivation, collect/retrieve the primitive operations -- of the parent type, and replace the subsidiary subtypes with the derived -- type, to build the specs of the inherited ops. For generic actuals, the -- mapping of the primitive operations to those of the parent type is also -- done by rederiving the operations within the instance. For tagged types, -- the derived subprograms are aliased to those of the actual, not those of -- the ancestor. -- -- Note: one might expect this to be private to the package body, but there -- is one rather unusual usage in package Exp_Dist. function Find_Hidden_Interface (Src : Elist_Id; Dest : Elist_Id) return Entity_Id; -- Ada 2005: Determine whether the interfaces in list Src are all present -- in the list Dest. Return the first differing interface, or Empty -- otherwise. function Find_Type_Of_Subtype_Indic (S : Node_Id) return Entity_Id; -- Given a subtype indication S (which is really an N_Subtype_Indication -- node or a plain N_Identifier), find the type of the subtype mark. function Find_Type_Name (N : Node_Id) return Entity_Id; -- Enter the identifier in a type definition, or find the entity already -- declared, in the case of the full declaration of an incomplete or -- private type. If the previous declaration is tagged then the class-wide -- entity is propagated to the identifier to prevent multiple incompatible -- class-wide types that may be created for self-referential anonymous -- access components. function Get_Discriminant_Value (Discriminant : Entity_Id; Typ_For_Constraint : Entity_Id; Constraint : Elist_Id) return Node_Id; -- ??? MORE DOCUMENTATION -- Given a discriminant somewhere in the Typ_For_Constraint tree and a -- Constraint, return the value of that discriminant. function Is_Null_Extension (T : Entity_Id) return Boolean; -- Returns True if the tagged type T has an N_Full_Type_Declaration that -- is a null extension, meaning that it has an extension part without any -- components and does not have a known discriminant part. function Is_Visible_Component (C : Entity_Id; N : Node_Id := Empty) return Boolean; -- Determines if a record component C is visible in the present context. -- Note that even though component C could appear in the entity chain of a -- record type, C may not be visible in the current context. For instance, -- C may be a component inherited in the full view of a private extension -- which is not visible in the current context. -- -- If present, N is the selected component of which C is the selector. If -- the prefix of N is a type conversion inserted for a discriminant check, -- C is automatically visible. procedure Make_Index (N : Node_Id; Related_Nod : Node_Id; Related_Id : Entity_Id := Empty; Suffix_Index : Pos := 1); -- Process an index that is given in an array declaration, an entry -- family declaration or a loop iteration. The index is given by an index -- declaration (a 'box'), or by a discrete range. The later can be the name -- of a discrete type, or a subtype indication. -- -- Related_Nod is the node where the potential generated implicit types -- will be inserted. The next last parameters are used for creating the -- name. procedure Make_Class_Wide_Type (T : Entity_Id); -- A Class_Wide_Type is created for each tagged type definition. The -- attributes of a class-wide type are inherited from those of the type T. -- If T is introduced by a private declaration, the corresponding class -- wide type is created at the same time, and therefore there is a private -- and a full declaration for the class-wide type as well. function OK_For_Limited_Init_In_05 (Typ : Entity_Id; Exp : Node_Id) return Boolean; -- Presuming Exp is an expression of an inherently limited type Typ, -- returns True if the expression is allowed in an initialization context -- by the rules of Ada 2005. We use the rule in RM-7.5(2.1/2), "...it is an -- aggregate, a function_call, or a parenthesized expression or qualified -- expression whose operand is permitted...". Note that in Ada 95 mode, -- we sometimes wish to give warnings based on whether the program _would_ -- be legal in Ada 2005. Note that Exp must already have been resolved, -- so we can know whether it's a function call (as opposed to an indexed -- component, for example). In the case where Typ is a limited interface's -- class-wide type, then the expression is allowed to be of any kind if its -- type is a nonlimited descendant of the interface. function OK_For_Limited_Init (Typ : Entity_Id; Exp : Node_Id) return Boolean; -- Always False in Ada 95 mode. Equivalent to OK_For_Limited_Init_In_05 in -- Ada 2005 mode. procedure Preanalyze_Assert_Expression (N : Node_Id; T : Entity_Id); -- Wrapper on Preanalyze_Spec_Expression for assertion expressions, so that -- In_Assertion_Expr can be properly adjusted. procedure Preanalyze_Spec_Expression (N : Node_Id; T : Entity_Id); -- Default and per object expressions do not freeze their components, and -- must be analyzed and resolved accordingly. The analysis is done by -- calling the Preanalyze_And_Resolve routine and setting the global -- In_Spec_Expression flag. See the documentation section entitled -- "Handling of Default and Per-Object Expressions" in sem.ads for full -- details. N is the expression to be analyzed, T is the expected type. -- This mechanism is also used for aspect specifications that have an -- expression parameter that needs similar preanalysis. procedure Process_Full_View (N : Node_Id; Full_T, Priv_T : Entity_Id); -- Process some semantic actions when the full view of a private type is -- encountered and analyzed. The first action is to create the full views -- of the dependant private subtypes. The second action is to recopy the -- primitive operations of the private view (in the tagged case). -- N is the N_Full_Type_Declaration node. -- -- Full_T is the full view of the type whose full declaration is in N. -- -- Priv_T is the private view of the type whose full declaration is in N. procedure Process_Range_Expr_In_Decl (R : Node_Id; T : Entity_Id; Subtyp : Entity_Id := Empty; Check_List : List_Id := No_List; R_Check_Off : Boolean := False); -- Process a range expression that appears in a declaration context. The -- range is analyzed and resolved with the base type of the given type, and -- an appropriate check for expressions in non-static contexts made on the -- bounds. R is analyzed and resolved using T, so the caller should if -- necessary link R into the tree before the call, and in particular in the -- case of a subtype declaration, it is appropriate to set the parent -- pointer of R so that the types get properly frozen. Check_List is used -- when the subprogram is called from Build_Record_Init_Proc and is used to -- return a set of constraint checking statements generated by the Checks -- package. R_Check_Off is set to True when the call to Range_Check is to -- be skipped. -- -- If Subtyp is given, then the range is for the named subtype Subtyp, and -- in this case the bounds are captured if necessary using this name. function Process_Subtype (S : Node_Id; Related_Nod : Node_Id; Related_Id : Entity_Id := Empty; Suffix : Character := ' ') return Entity_Id; -- Process a subtype indication S and return corresponding entity. -- Related_Nod is the node where the potential generated implicit types -- will be inserted. The Related_Id and Suffix parameters are used to -- build the associated Implicit type name. procedure Process_Discriminants (N : Node_Id; Prev : Entity_Id := Empty); -- Process the discriminants contained in an N_Full_Type_Declaration or -- N_Incomplete_Type_Decl node N. If the declaration is a completion, Prev -- is entity on the partial view, on which references are posted. However, -- note that Process_Discriminants is called for a completion only if -- partial view had no discriminants (else we just check conformance -- between the two views and do not call Process_Discriminants again -- for the completion). function Replace_Anonymous_Access_To_Protected_Subprogram (N : Node_Id) return Entity_Id; -- Ada 2005 (AI-254): Create and decorate an internal full type declaration -- for an anonymous access to protected subprogram. For a record component -- declaration, the type is created in the enclosing scope, for an array -- type declaration or an object declaration it is simply placed ahead of -- this declaration. procedure Set_Completion_Referenced (E : Entity_Id); -- If E is the completion of a private or incomplete type declaration, -- or the completion of a deferred constant declaration, mark the entity -- as referenced. Warnings on unused entities, if needed, go on the -- partial view. end Sem_Ch3;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . W I D E _ S T R I N G _ S P L I T -- -- -- -- S p e c -- -- -- -- Copyright (C) 2002-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. -- -- -- ------------------------------------------------------------------------------ -- Useful wide_string-manipulation routines: given a set of separators, split -- a wide_string wherever the separators appear, and provide direct access -- to the resulting slices. See GNAT.Array_Split for full documentation. with Ada.Strings.Wide_Maps; use Ada.Strings; with GNAT.Array_Split; package GNAT.Wide_String_Split is new GNAT.Array_Split (Element => Wide_Character, Element_Sequence => Wide_String, Element_Set => Wide_Maps.Wide_Character_Set, To_Set => Wide_Maps.To_Set, Is_In => Wide_Maps.Is_In);
------------------------------------------------------------------------------- -- LSE -- L-System Editor -- Author: Heziode -- -- License: -- MIT License -- -- Copyright (c) 2018 Quentin Dauprat (Heziode) <Heziode@protonmail.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. ------------------------------------------------------------------------------- package body LSE.Model.L_System.Error.Not_A_Angle is function Initialize return Instance is begin return Instance '(Error => Error_Type.Not_A_Angle); end Initialize; function Get_Error (This : Instance) return String is pragma Unreferenced (This); begin return "Value for Angle is not valid"; end Get_Error; end LSE.Model.L_System.Error.Not_A_Angle;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . G L O B A L _ L O C K S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1999-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. -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ -- This package contains the necessary routines to provide -- reliable system wide locking capability. package System.Global_Locks is Lock_Error : exception; -- Exception raised if a request cannot be executed on a lock type Lock_Type is private; -- Such a lock is a global lock between partitions. This lock is -- uniquely defined between the partitions because of its name. Null_Lock : constant Lock_Type; -- This needs comments ??? procedure Create_Lock (Lock : out Lock_Type; Name : String); -- Create or retrieve a global lock for the current partition using -- its Name. procedure Acquire_Lock (Lock : in out Lock_Type); -- If the lock cannot be acquired because someone already owns it, this -- procedure is supposed to wait and retry forever. procedure Release_Lock (Lock : in out Lock_Type); private type Lock_Type is new Natural; Null_Lock : constant Lock_Type := 0; end System.Global_Locks;
-- Copyright 2019 Simon Symeonidis (psyomn) -- -- 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 HTTP_Status; package Response_Helpers is function Headers (Status : HTTP_Status.Code) return String with Inline; function Response_Date return String with Inline; function Make_Response (Status : HTTP_Status.Code; S : String) return String with Inline; CRLF : constant String := ASCII.CR & ASCII.LF; private function First_Header_Line (Status : HTTP_Status.Code) return String with Inline; end Response_Helpers;
-- Copyright 2011-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 Last_Word : Word := 0; procedure Call_Me (W : Word) is begin Last_Word := W; end Call_Me; end Pck;
-- Abstract : -- -- Image with auxiliary data for instantiations of parent. -- -- Copyright (C) 2019 Free Software Foundation, Inc. -- -- This library is free software; you can redistribute it and/or modify it -- under terms of the GNU General Public License as published by the Free -- Software Foundation; either version 3, 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 MERCHAN- -- TABILITY 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. pragma License (Modified_GPL); generic type Aux_Data (<>) is private; with function Element_Image (Item : in Element_Type; Aux : in Aux_Data) return String; function SAL.Gen_Bounded_Definite_Stacks.Gen_Image_Aux (Item : in Stack; Aux : in Aux_Data; Depth : in SAL.Base_Peek_Type := 0) return String;
------------------------------------------------------------------------------ -- -- -- 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$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with League.Holders.Generic_Enumerations; package AMF.UML.Holders.Aggregation_Kinds is new League.Holders.Generic_Enumerations (AMF.UML.UML_Aggregation_Kind); pragma Preelaborate (AMF.UML.Holders.Aggregation_Kinds);
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . S H A R E D _ S T O R A G E -- -- -- -- S p e c -- -- -- -- Copyright (C) 1998-2006, 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 manages the shared/persistant storage required for -- full implementation of variables in Shared_Passive packages, more -- precisely variables whose enclosing dynamic scope is a shared -- passive package. This implementation is specific to GNAT and GLADE -- provides a more general implementation not dedicated to file -- storage. -- This unit (and shared passive partitions) are supported on all -- GNAT implementations except on OpenVMS (where problems arise from -- trying to share files, and with version numbers of files) -- -------------------------- -- -- Shared Storage Model -- -- -------------------------- -- The basic model used is that each partition that references the -- Shared_Passive package has a local copy of the package data that -- is initialized in accordance with the declarations of the package -- in the normal manner. The routines in System.Shared_Storage are -- then used to ensure that the values in these separate copies are -- properly synchronized with the state of the overall system. -- In the GNAT implementation, this synchronization is ensured by -- maintaining a set of files, in a designated directory. The -- directory is designated by setting the environment variable -- SHARED_MEMORY_DIRECTORY. This variable must be set for all -- partitions. If the environment variable is not defined, then the -- current directory is used. -- There is one storage for each variable. The name is the fully -- qualified name of the variable with all letters forced to lower -- case. For example, the variable Var in the shared passive package -- Pkg results in the storage name pkg.var. -- If the storage does not exist, it indicates that no partition has -- assigned a new value, so that the initial value is the correct -- one. This is the critical component of the model. It means that -- there is no system-wide synchronization required for initializing -- the package, since the shared storages need not (and do not) -- reflect the initial state. There is therefore no issue of -- synchronizing initialization and read/write access. -- ----------------------- -- -- Read/Write Access -- -- ----------------------- -- The approach is as follows: -- For each shared variable, var, an access routine varR is created whose -- body has the following form (this example is for Pkg.Var): -- procedure varR is -- S : Ada.Streams.Stream_IO.Stream_Access; -- begin -- S := Shared_Var_ROpen ("pkg.var"); -- if S /= null then -- typ'Read (S); -- Shared_Var_Close (S); -- end if; -- end varR; -- The routine Shared_Var_ROpen in package System.Shared_Storage -- either returns null if the storage does not exist, or otherwise a -- Stream_Access value that references the corresponding shared -- storage, ready to read the current value. -- Each reference to the shared variable, var, is preceded by a -- call to the corresponding varR procedure, which either leaves the -- initial value unchanged if the storage does not exist, or reads -- the current value from the shared storage. -- In addition, for each shared variable, var, an assignment routine -- is created whose body has the following form (again for Pkg.Var) -- procedure VarA is -- S : Ada.Streams.Stream_IO.Stream_Access; -- begin -- S := Shared_Var_WOpen ("pkg.var"); -- typ'Write (S, var); -- Shared_Var_Close (S); -- end VarA; -- The routine Shared_Var_WOpen in package System.Shared_Storage -- returns a Stream_Access value that references the corresponding -- shared storage, ready to write the new value. -- Each assignment to the shared variable, var, is followed by a call -- to the corresponding varA procedure, which writes the new value to -- the shared storage. -- Note that there is no general synchronization for these storage -- read and write operations, since it is assumed that a correctly -- operating programs will provide appropriate synchronization. In -- particular, variables can be protected using protected types with -- no entries. -- The routine Shared_Var_Close is called to indicate the end of a -- read/write operations. This can be useful even in the context of -- the GNAT implementation. For instance, when a read operation and a -- write operation occur at the same time on the same partition, as -- the same stream is used simultaneously, both operations can -- terminate abruptly by raising exception Mode_Error because the -- stream has been opened in read mode and then in write mode and at -- least used by the read opartion. To avoid this unexpected -- behaviour, we introduce a synchronization at the partition level. -- Note: a special circuit allows the use of stream attributes Read and -- Write for limited types (using the corresponding attribute for the -- full type), but there are limitations on the data that can be placed -- in shared passive partitions. See sem_smem.ads/adb for details. -- ---------------------------------------------------------------- -- -- Handling of Protected Objects in Shared Passive Partitions -- -- ---------------------------------------------------------------- -- In the context of GNAT, during the execution of a protected -- subprogram call, access is locked out using a locking mechanism -- per protected object, as provided by the GNAT.Lock_Files -- capability in the specific case of GNAT. This package contains the -- lock and unlock calls, and the expander generates a call to the -- lock routine before the protected call and a call to the unlock -- routine after the protected call. -- Within the code of the protected subprogram, the access to the -- protected object itself uses the local copy, without any special -- synchronization. Since global access is locked out, no other task -- or partition can attempt to read or write this data as long as the -- lock is held. -- The data in the local copy does however need synchronizing with -- the global values in the shared storage. This is achieved as -- follows: -- The protected object generates a read and assignment routine as -- described for other shared passive variables. The code for the -- 'Read and 'Write attributes (not normally allowed, but allowed -- in this special case) simply reads or writes the values of the -- components in the protected record. -- The lock call is followed by a call to the shared read routine to -- synchronize the local copy to contain the proper global value. -- The unlock call in the procedure case only is preceded by a call -- to the shared assign routine to synchronize the global shared -- storages with the (possibly modified) local copy. -- These calls to the read and assign routines, as well as the lock -- and unlock routines, are inserted by the expander (see exp_smem.adb). with Ada.Streams.Stream_IO; package System.Shared_Storage is package SIO renames Ada.Streams.Stream_IO; function Shared_Var_ROpen (Var : String) return SIO.Stream_Access; -- As described above, this routine returns null if the -- corresponding shared storage does not exist, and otherwise, if -- the storage does exist, a Stream_Access value that references -- the shared storage, ready to read the current value. function Shared_Var_WOpen (Var : String) return SIO.Stream_Access; -- As described above, this routine returns a Stream_Access value -- that references the shared storage, ready to write the new -- value. The storage is created by this call if it does not -- already exist. procedure Shared_Var_Close (Var : SIO.Stream_Access); -- This routine signals the end of a read/assign operation. It can -- be useful to embrace a read/write operation between a call to -- open and a call to close which protect the whole operation. -- Otherwise, two simultaneous operations can result in the -- raising of exception Data_Error by setting the access mode of -- the variable in an incorrect mode. procedure Shared_Var_Lock (Var : String); -- This procedure claims the shared storage lock. It is used for -- protected types in shared passive packages. A call to this -- locking routine is generated as the first operation in the code -- for the body of a protected subprogram, and it busy waits if -- the lock is busy. procedure Shared_Var_Unlock (Var : String); -- This procedure releases the shared storage lock obtaind by a -- prior call to the Shared_Mem_Lock procedure, and is to be -- generated as the last operation in the body of a protected -- subprogram. end System.Shared_Storage;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . W C H _ J I S -- -- -- -- B o d y -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ pragma Compiler_Unit_Warning; package body System.WCh_JIS is type Byte is mod 256; EUC_Hankaku_Kana : constant Byte := 16#8E#; -- Prefix byte in EUC for Hankaku Kana (small Katakana). Such characters -- in EUC are represented by a prefix byte followed by the code, which -- is in the upper half (the corresponding JIS internal code is in the -- range 16#0080# - 16#00FF#). function EUC_To_JIS (EUC1, EUC2 : Character) return Wide_Character is EUC1B : constant Byte := Character'Pos (EUC1); EUC2B : constant Byte := Character'Pos (EUC2); begin if EUC2B not in 16#A0# .. 16#FE# then raise Constraint_Error; end if; if EUC1B = EUC_Hankaku_Kana then return Wide_Character'Val (EUC2B); else if EUC1B not in 16#A0# .. 16#FE# then raise Constraint_Error; else return Wide_Character'Val (256 * Natural (EUC1B and 16#7F#) + Natural (EUC2B and 16#7F#)); end if; end if; end EUC_To_JIS; ---------------- -- JIS_To_EUC -- ---------------- procedure JIS_To_EUC (J : Wide_Character; EUC1 : out Character; EUC2 : out Character) is JIS1 : constant Natural := Wide_Character'Pos (J) / 256; JIS2 : constant Natural := Wide_Character'Pos (J) rem 256; begin -- Special case of small Katakana if JIS1 = 0 then -- The value must be in the range 16#80# to 16#FF# so that the upper -- bit is set in both bytes. if JIS2 < 16#80# then raise Constraint_Error; end if; EUC1 := Character'Val (EUC_Hankaku_Kana); EUC2 := Character'Val (JIS2); -- The upper bit of both characters must be clear, or this is not -- a valid character for representation in EUC form. elsif JIS1 > 16#7F# or else JIS2 > 16#7F# then raise Constraint_Error; -- Result is just the two characters with upper bits set else EUC1 := Character'Val (JIS1 + 16#80#); EUC2 := Character'Val (JIS2 + 16#80#); end if; end JIS_To_EUC; ---------------------- -- JIS_To_Shift_JIS -- ---------------------- procedure JIS_To_Shift_JIS (J : Wide_Character; SJ1 : out Character; SJ2 : out Character) is JIS1 : Byte; JIS2 : Byte; begin -- The following is the required algorithm, it's hard to make any -- more intelligent comments. This was copied from a public domain -- C program called etos.c (author unknown). JIS1 := Byte (Natural (Wide_Character'Pos (J) / 256)); JIS2 := Byte (Natural (Wide_Character'Pos (J) rem 256)); if JIS1 > 16#5F# then JIS1 := JIS1 + 16#80#; end if; if (JIS1 mod 2) = 0 then SJ1 := Character'Val ((JIS1 - 16#30#) / 2 + 16#88#); SJ2 := Character'Val (JIS2 + 16#7E#); else if JIS2 >= 16#60# then JIS2 := JIS2 + 16#01#; end if; SJ1 := Character'Val ((JIS1 - 16#31#) / 2 + 16#89#); SJ2 := Character'Val (JIS2 + 16#1F#); end if; end JIS_To_Shift_JIS; ---------------------- -- Shift_JIS_To_JIS -- ---------------------- function Shift_JIS_To_JIS (SJ1, SJ2 : Character) return Wide_Character is SJIS1 : Byte; SJIS2 : Byte; JIS1 : Byte; JIS2 : Byte; begin -- The following is the required algorithm, it's hard to make any -- more intelligent comments. This was copied from a public domain -- C program called stoj.c written by shige@csk.JUNET. SJIS1 := Character'Pos (SJ1); SJIS2 := Character'Pos (SJ2); if SJIS1 >= 16#E0# then SJIS1 := SJIS1 - 16#40#; end if; if SJIS2 >= 16#9F# then JIS1 := (SJIS1 - 16#88#) * 2 + 16#30#; JIS2 := SJIS2 - 16#7E#; else if SJIS2 >= 16#7F# then SJIS2 := SJIS2 - 16#01#; end if; JIS1 := (SJIS1 - 16#89#) * 2 + 16#31#; JIS2 := SJIS2 - 16#1F#; end if; if JIS1 not in 16#20# .. 16#7E# or else JIS2 not in 16#20# .. 16#7E# then raise Constraint_Error; else return Wide_Character'Val (256 * Natural (JIS1) + Natural (JIS2)); end if; end Shift_JIS_To_JIS; end System.WCh_JIS;
------------------------------------------------------------------------------ -- -- -- 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.Internals.UML_Packageable_Elements; with AMF.UML.Dependencies.Collections; with AMF.UML.Named_Elements; with AMF.UML.Namespaces; with AMF.UML.Observations.Collections; with AMF.UML.Packages.Collections; with AMF.UML.Parameterable_Elements; with AMF.UML.String_Expressions; with AMF.UML.Template_Parameters; with AMF.UML.Time_Expressions; with AMF.UML.Types; with AMF.UML.Value_Specifications; with AMF.Visitors; package AMF.Internals.UML_Time_Expressions is type UML_Time_Expression_Proxy is limited new AMF.Internals.UML_Packageable_Elements.UML_Packageable_Element_Proxy and AMF.UML.Time_Expressions.UML_Time_Expression with null record; overriding function Get_Expr (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Value_Specifications.UML_Value_Specification_Access; -- Getter of TimeExpression::expr. -- -- The value of the time expression. overriding procedure Set_Expr (Self : not null access UML_Time_Expression_Proxy; To : AMF.UML.Value_Specifications.UML_Value_Specification_Access); -- Setter of TimeExpression::expr. -- -- The value of the time expression. overriding function Get_Observation (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Observations.Collections.Set_Of_UML_Observation; -- Getter of TimeExpression::observation. -- -- Refers to the time and duration observations that are involved in expr. overriding function Get_Type (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Types.UML_Type_Access; -- Getter of TypedElement::type. -- -- The type of the TypedElement. -- This information is derived from the return result for this Operation. overriding procedure Set_Type (Self : not null access UML_Time_Expression_Proxy; To : AMF.UML.Types.UML_Type_Access); -- Setter of TypedElement::type. -- -- The type of the TypedElement. -- This information is derived from the return result for this Operation. overriding function Get_Client_Dependency (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency; -- Getter of NamedElement::clientDependency. -- -- Indicates the dependencies that reference the client. overriding function Get_Name_Expression (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.String_Expressions.UML_String_Expression_Access; -- Getter of NamedElement::nameExpression. -- -- The string expression used to define the name of this named element. overriding procedure Set_Name_Expression (Self : not null access UML_Time_Expression_Proxy; To : AMF.UML.String_Expressions.UML_String_Expression_Access); -- Setter of NamedElement::nameExpression. -- -- The string expression used to define the name of this named element. overriding function Get_Namespace (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access; -- Getter of NamedElement::namespace. -- -- Specifies the namespace that owns the NamedElement. overriding function Get_Qualified_Name (Self : not null access constant UML_Time_Expression_Proxy) return AMF.Optional_String; -- Getter of NamedElement::qualifiedName. -- -- A name which allows the NamedElement to be identified within a -- hierarchy of nested Namespaces. It is constructed from the names of the -- containing namespaces starting at the root of the hierarchy and ending -- with the name of the NamedElement itself. overriding function Get_Owning_Template_Parameter (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Template_Parameters.UML_Template_Parameter_Access; -- Getter of ParameterableElement::owningTemplateParameter. -- -- The formal template parameter that owns this element. overriding procedure Set_Owning_Template_Parameter (Self : not null access UML_Time_Expression_Proxy; To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access); -- Setter of ParameterableElement::owningTemplateParameter. -- -- The formal template parameter that owns this element. overriding function Get_Template_Parameter (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Template_Parameters.UML_Template_Parameter_Access; -- Getter of ParameterableElement::templateParameter. -- -- The template parameter that exposes this element as a formal parameter. overriding procedure Set_Template_Parameter (Self : not null access UML_Time_Expression_Proxy; To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access); -- Setter of ParameterableElement::templateParameter. -- -- The template parameter that exposes this element as a formal parameter. overriding function Boolean_Value (Self : not null access constant UML_Time_Expression_Proxy) return AMF.Optional_Boolean; -- Operation ValueSpecification::booleanValue. -- -- The query booleanValue() gives a single Boolean value when one can be -- computed. overriding function Integer_Value (Self : not null access constant UML_Time_Expression_Proxy) return AMF.Optional_Integer; -- Operation ValueSpecification::integerValue. -- -- The query integerValue() gives a single Integer value when one can be -- computed. overriding function Is_Compatible_With (Self : not null access constant UML_Time_Expression_Proxy; P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access) return Boolean; -- Operation ValueSpecification::isCompatibleWith. -- -- The query isCompatibleWith() determines if this parameterable element -- is compatible with the specified parameterable element. By default -- parameterable element P is compatible with parameterable element Q if -- the kind of P is the same or a subtype as the kind of Q. In addition, -- for ValueSpecification, the type must be conformant with the type of -- the specified parameterable element. overriding function Is_Computable (Self : not null access constant UML_Time_Expression_Proxy) return Boolean; -- Operation ValueSpecification::isComputable. -- -- The query isComputable() determines whether a value specification can -- be computed in a model. This operation cannot be fully defined in OCL. -- A conforming implementation is expected to deliver true for this -- operation for all value specifications that it can compute, and to -- compute all of those for which the operation is true. A conforming -- implementation is expected to be able to compute the value of all -- literals. overriding function Is_Null (Self : not null access constant UML_Time_Expression_Proxy) return Boolean; -- Operation ValueSpecification::isNull. -- -- The query isNull() returns true when it can be computed that the value -- is null. overriding function Real_Value (Self : not null access constant UML_Time_Expression_Proxy) return AMF.Optional_Real; -- Operation ValueSpecification::realValue. -- -- The query realValue() gives a single Real value when one can be -- computed. overriding function String_Value (Self : not null access constant UML_Time_Expression_Proxy) return AMF.Optional_String; -- Operation ValueSpecification::stringValue. -- -- The query stringValue() gives a single String value when one can be -- computed. overriding function Unlimited_Value (Self : not null access constant UML_Time_Expression_Proxy) return AMF.Optional_Unlimited_Natural; -- Operation ValueSpecification::unlimitedValue. -- -- The query unlimitedValue() gives a single UnlimitedNatural value when -- one can be computed. overriding function All_Owning_Packages (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Packages.Collections.Set_Of_UML_Package; -- Operation NamedElement::allOwningPackages. -- -- The query allOwningPackages() returns all the directly or indirectly -- owning packages. overriding function Is_Distinguishable_From (Self : not null access constant UML_Time_Expression_Proxy; N : AMF.UML.Named_Elements.UML_Named_Element_Access; Ns : AMF.UML.Namespaces.UML_Namespace_Access) return Boolean; -- Operation NamedElement::isDistinguishableFrom. -- -- The query isDistinguishableFrom() determines whether two NamedElements -- may logically co-exist within a Namespace. By default, two named -- elements are distinguishable if (a) they have unrelated types or (b) -- they have related types but different names. overriding function Namespace (Self : not null access constant UML_Time_Expression_Proxy) return AMF.UML.Namespaces.UML_Namespace_Access; -- Operation NamedElement::namespace. -- -- Missing derivation for NamedElement::/namespace : Namespace overriding function Is_Template_Parameter (Self : not null access constant UML_Time_Expression_Proxy) return Boolean; -- Operation ParameterableElement::isTemplateParameter. -- -- The query isTemplateParameter() determines if this parameterable -- element is exposed as a formal template parameter. overriding procedure Enter_Element (Self : not null access constant UML_Time_Expression_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of visitor interface. overriding procedure Leave_Element (Self : not null access constant UML_Time_Expression_Proxy; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of visitor interface. overriding procedure Visit_Element (Self : not null access constant UML_Time_Expression_Proxy; Iterator : in out AMF.Visitors.Abstract_Iterator'Class; Visitor : in out AMF.Visitors.Abstract_Visitor'Class; Control : in out AMF.Visitors.Traverse_Control); -- Dispatch call to corresponding subprogram of iterator interface. end AMF.Internals.UML_Time_Expressions;
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with swig; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_render_tri_fan_request_t is -- Item -- type Item is record major_opcode : aliased Interfaces.Unsigned_8; minor_opcode : aliased Interfaces.Unsigned_8; length : aliased Interfaces.Unsigned_16; op : aliased Interfaces.Unsigned_8; pad0 : aliased swig.int8_t_Array (0 .. 2); src : aliased xcb.xcb_render_picture_t; dst : aliased xcb.xcb_render_picture_t; mask_format : aliased xcb.xcb_render_pictformat_t; src_x : aliased Interfaces.Integer_16; src_y : aliased Interfaces.Integer_16; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_render_tri_fan_request_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_tri_fan_request_t.Item, Element_Array => xcb.xcb_render_tri_fan_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_render_tri_fan_request_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_render_tri_fan_request_t.Pointer, Element_Array => xcb.xcb_render_tri_fan_request_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_render_tri_fan_request_t;
-- NORX.Utils -- Some utility routines useful when writing the examples. -- Copyright (c) 2016, James Humphry - see LICENSE file for details generic package NORX.Utils is procedure Put_State(S : in NORX.State); -- Print out a hexadecimal representation of the state to the console procedure Put_Storage_Array(X : in Storage_Array); -- Print out a hexadecimal representation of the storage array to the console end NORX.Utils;
separate (Numerics.Sparse_Matrices) procedure Remove_Duplicates (Mat : in out Sparse_Matrix) is N, Iter : Pos := 0; J : Int_Array (1 .. Nat (Mat.P.Length)) := (others => 0); I : Int_Array (1 .. Pos (Mat.I.Length)); X : Real_Vector (1 .. Pos (Mat.X.Length)); begin for K in 1 .. Nat (Mat.P.Length) - 1 loop Iter := 0; for L in Mat.P (K) .. Mat.P (K + 1) - 1 loop if Iter /= Mat.I (L) then N := N + 1; Iter := Mat.I (L); I (N) := Iter; J (K) := J (K) + 1; X (N) := Mat.X (L); else X (N) := X (N) + Mat.X (L); end if; end loop; end loop; Cumulative_Sum (J); Set (Mat.I, I (1 .. N)); Set (Mat.X, X (1 .. N)); Set (Mat.P, J); end Remove_Duplicates;
------------------------------------------------------------------------------ -- -- -- GNAT RUNTIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ L L B -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993,1994,1995 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. -- -- -- ------------------------------------------------------------------------------ with System.Unsigned_Types; use System.Unsigned_Types; package body System.Img_LLB is --------------------------------------- -- Set_Image_Based_Long_Long_Integer -- --------------------------------------- procedure Set_Image_Based_Long_Long_Integer (V : Long_Long_Integer; B : Natural; W : Integer; S : out String; P : in out Natural) is Start : Natural; begin -- Positive case can just use the unsigned circuit directly if V >= 0 then Set_Image_Based_Long_Long_Unsigned (Long_Long_Unsigned (V), B, W, S, P); -- Negative case has to set a minus sign. Note also that we have to be -- careful not to generate overflow with the largest negative number. else P := P + 1; S (P) := ' '; Start := P; declare pragma Suppress (Overflow_Check); pragma Suppress (Range_Check); begin Set_Image_Based_Long_Long_Unsigned (Long_Long_Unsigned (-V), B, W - 1, S, P); end; -- Set minus sign in last leading blank location. Because of the -- code above, there must be at least one such location. while S (Start + 1) = ' ' loop Start := Start + 1; end loop; S (Start) := '-'; end if; end Set_Image_Based_Long_Long_Integer; ---------------------------------------- -- Set_Image_Based_Long_Long_Unsigned -- ---------------------------------------- procedure Set_Image_Based_Long_Long_Unsigned (V : Long_Long_Unsigned; B : Natural; W : Integer; S : out String; P : in out Natural) is Start : constant Natural := P; F, T : Natural; BU : constant Long_Long_Unsigned := Long_Long_Unsigned (B); Hex : constant array (Long_Long_Unsigned range 0 .. 15) of Character := "0123456789ABCDEF"; procedure Set_Digits (T : Long_Long_Unsigned); -- Set digits of absolute value of T procedure Set_Digits (T : Long_Long_Unsigned) is begin if T >= BU then Set_Digits (T / BU); P := P + 1; S (P) := Hex (T mod BU); else P := P + 1; S (P) := Hex (T); end if; end Set_Digits; -- Start of processing for Set_Image_Based_Long_Long_Unsigned begin if B >= 10 then P := P + 1; S (P) := '1'; end if; P := P + 1; S (P) := Character'Val (Character'Pos ('0') + B mod 10); P := P + 1; S (P) := '#'; Set_Digits (V); P := P + 1; S (P) := '#'; -- Add leading spaces if required by width parameter if P - Start < W then F := P; P := Start + W; T := P; while F > Start loop S (T) := S (F); T := T - 1; F := F - 1; end loop; for J in Start + 1 .. T loop S (J) := ' '; end loop; end if; end Set_Image_Based_Long_Long_Unsigned; end System.Img_LLB;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- G N A T . S E C U R E _ H A S H E S . S H A 1 -- -- -- -- S p e c -- -- -- -- Copyright (C) 2002-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 provides supporting code for implementation of the SHA-1 -- secure hash function as described in FIPS PUB 180-3. The complete text -- of FIPS PUB 180-3 can be found at: -- http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf -- This is an internal unit and should not be used directly in applications. -- Use GNAT.SHA1 instead. with GNAT.Byte_Swapping; with Interfaces; package GNAT.Secure_Hashes.SHA1 is package Hash_State is new Hash_Function_State (Word => Interfaces.Unsigned_32, Swap => GNAT.Byte_Swapping.Swap4, Hash_Bit_Order => System.High_Order_First); -- SHA-1 operates on 32-bit big endian words Block_Words : constant := 16; -- Messages are processed in chunks of 16 words procedure Transform (H : in out Hash_State.State; M : in out Message_State); -- Transformation function applied for each block Initial_State : constant Hash_State.State; -- Initialization vector private Initial_State : constant Hash_State.State := (0 => 16#67452301#, 1 => 16#EFCDAB89#, 2 => 16#98BADCFE#, 3 => 16#10325476#, 4 => 16#C3D2E1F0#); -- Initialization vector from FIPS PUB 180-3 end GNAT.Secure_Hashes.SHA1;
with STM32.Device; use STM32.Device; with STM32.GPIO; use STM32.GPIO; package body Framebuffer_RK043FN48H is LCD_BL_CTRL : GPIO_Point renames PK3; LCD_ENABLE : GPIO_Point renames PI12; LCD_HSYNC : GPIO_Point renames PI10; LCD_VSYNC : GPIO_Point renames PI9; LCD_CLK : GPIO_Point renames PI14; LCD_DE : GPIO_Point renames PK7; LCD_INT : GPIO_Point renames PI13; NC1 : GPIO_Point renames PI8; LCD_CTRL_PINS : constant GPIO_Points := (LCD_VSYNC, LCD_HSYNC, LCD_INT, LCD_CLK, LCD_DE, NC1); LCD_RGB_AF14 : constant GPIO_Points := (PI15, PJ0, PJ1, PJ2, PJ3, PJ4, PJ5, PJ6, -- Red PJ7, PJ8, PJ9, PJ10, PJ11, PK0, PK1, PK2, -- Green PE4, PJ13, PJ14, PJ15, PK4, PK5, PK6); -- Blue LCD_RGB_AF9 : constant GPIO_Points := (1 => PG12); -- B4 procedure Init_Pins; --------------- -- Init_Pins -- --------------- procedure Init_Pins is LTDC_Pins : constant GPIO_Points := LCD_CTRL_PINS & LCD_RGB_AF14 & LCD_RGB_AF9; begin Enable_Clock (LTDC_Pins); Configure_Alternate_Function (LCD_CTRL_PINS & LCD_RGB_AF14, GPIO_AF_LTDC); Configure_Alternate_Function (LCD_RGB_AF9, GPIO_AF_LTDC_2); Configure_IO (Points => LTDC_Pins, Config => (Speed => Speed_50MHz, Mode => Mode_AF, Output_Type => Push_Pull, Resistors => Floating)); Lock (LTDC_Pins); Configure_IO (GPIO_Points'(LCD_ENABLE, LCD_BL_CTRL), Config => (Speed => Speed_2MHz, Mode => Mode_Out, Output_Type => Push_Pull, Resistors => Pull_Down)); Lock (LCD_ENABLE & LCD_BL_CTRL); end Init_Pins; ---------------- -- Initialize -- ---------------- procedure Initialize (Display : in out Frame_Buffer; Orientation : HAL.Framebuffer.Display_Orientation := Default; Mode : HAL.Framebuffer.Wait_Mode := Interrupt) is begin Init_Pins; Display.Initialize (Width => LCD_Natural_Width, Height => LCD_Natural_Height, H_Sync => 41, H_Back_Porch => 13, H_Front_Porch => 32, V_Sync => 10, V_Back_Porch => 2, V_Front_Porch => 2, PLLSAI_N => 192, PLLSAI_R => 5, DivR => 4, Orientation => Orientation, Mode => Mode); STM32.GPIO.Set (LCD_ENABLE); STM32.GPIO.Set (LCD_BL_CTRL); end Initialize; end Framebuffer_RK043FN48H;
------------------------------------------------------------------------------ -- -- -- Ada User Repository Annex (AURA) -- -- ANNEXI-STRAYLINE Reference Implementation -- -- -- -- Core -- -- -- -- ------------------------------------------------------------------------ -- -- -- -- Copyright (C) 2019-2021, ANNEXI-STRAYLINE Trans-Human Ltd. -- -- All rights reserved. -- -- -- -- Original Contributors: -- -- * Richard Wai (ANNEXI-STRAYLINE) -- -- -- -- 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 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 -- -- 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. -- -- -- ------------------------------------------------------------------------------ with Ada.Exceptions; with Ada.Unchecked_Deallocation; with Ada.Containers.Synchronized_Queue_Interfaces; with Ada.Containers.Unbounded_Synchronized_Queues; with Workers.Reporting; package body Workers is use type Progress.Progress_Tracker_Access; -- -- Work_Queue -- type Order_Holder is access Work_Order'Class; procedure Deallocate is new Ada.Unchecked_Deallocation (Object => Work_Order'Class, Name => Order_Holder); type Queued_Order is record Holder : Order_Holder := null; Wait_Tracker: Progress.Progress_Tracker_Access := null; end record; package SQI is new Ada.Containers.Synchronized_Queue_Interfaces (Element_Type => Queued_Order); package USQ is new Ada.Containers.Unbounded_Synchronized_Queues (Queue_Interfaces => SQI); -- The Queues Work_Queue : USQ.Queue; Deferral_Queue: USQ.Queue; ------------------- -- Enqueue_Order -- ------------------- procedure Enqueue_Order (Order: in Work_Order'Class) is begin Work_Queue.Enqueue ((Holder => new Work_Order'Class'(Order), Wait_Tracker => null)); end Enqueue_Order; ----------------- -- Defer_Order -- ----------------- procedure Defer_Order (Order : in Work_Order'Class; Wait_Tracker: not null Progress.Progress_Tracker_Access) is begin Work_Queue.Enqueue ((Holder => new Work_Order'Class'(Order), Wait_Tracker => Wait_Tracker)); end Defer_Order; ----------------- -- Queue_Level -- ----------------- function Queue_Level return Count_Type is (Work_Queue.Current_Use); ---------------------- -- Peak_Queue_Level -- ---------------------- function Peak_Queue_Level return Count_Type is (Work_Queue.Peak_Use); -------------- -- Deferred -- -------------- function Deferred return Count_Type is (Deferral_Queue.Current_Use); ------------------- -- Peak_Deferred -- ------------------- function Peak_Deferred return Count_Type is (Deferral_Queue.Peak_Use); -- -- Worker Pool -- ---------------- -- Accounting -- ---------------- protected Worker_Accounting is entry Start_Job; procedure Finish_Job; entry Wait_Idle; function Busy_Workers return Worker_Count; function Peak_Busy_Workers return Worker_Count; procedure Set_Completion_Reports (New_Setting: in Boolean); function Completion_Reporting return Boolean; entry Phase_Trigger_Lock; procedure Phase_Trigger_Release; -- When the Phase_Trigger is active, no workers will accept new -- jobs. This ensures that any work scheduled during a phase -- trigger cannot be finished before the phase trigger finished. -- -- In a sense, the phase trigger lock is used to ensure a strict -- "fork-join" behaviour expected by the phase trigger feature private Busy_Count : Worker_Count := 0; Busy_Peak : Worker_Count := 0; Completion_Reports : Boolean := False; Phase_Trigger_Active: Boolean := False; end Worker_Accounting; protected body Worker_Accounting is --------------- -- Start_Job -- --------------- entry Start_Job when not Phase_Trigger_Active is begin Busy_Count := Busy_Count + 1; if Busy_Count > Busy_Peak then Busy_Peak := Busy_Count; end if; end Start_Job; ---------------- -- Finish_Job -- ---------------- procedure Finish_Job is begin Busy_Count := Busy_Count - 1; end Finish_Job; --------------- -- Wait_Idle -- --------------- entry Wait_Idle when Busy_Count = 0 is begin null; end Wait_Idle; --------------- -- Statitics -- --------------- function Busy_Workers return Worker_Count is (Busy_Count); function Peak_Busy_Workers return Worker_Count is (Busy_Peak); -------------------------- -- Completion Reporting -- -------------------------- procedure Set_Completion_Reports (New_Setting: in Boolean) is begin Completion_Reports := New_Setting; end Set_Completion_Reports; function Completion_Reporting return Boolean is (Completion_Reports); --------------------------- -- Phase_Trigger Locking -- --------------------------- entry Phase_Trigger_Lock when not Phase_Trigger_Active is begin Phase_Trigger_Active := True; end Phase_Trigger_Lock; procedure Phase_Trigger_Release is begin Phase_Trigger_Active := False; end Phase_Trigger_Release; end Worker_Accounting; ----------------------- -- Termination_Order -- ----------------------- type Termination_Order is new Work_Order with null record; -- Termination orders cause the targeted worker task to terminate overriding function Image (Order: Termination_Order) return String is (raise Program_Error); overriding procedure Execute (Order: in out Termination_Order) is begin raise Program_Error; end Execute; ----------------- -- Worker_Task -- ----------------- task body Worker_Task is function To_Report_String (Source: String) return Reporting.Report_String renames Reporting.To_Report_String; function Exception_Info (X: Ada.Exceptions.Exception_Occurrence) return String renames Ada.Exceptions.Exception_Information; Dequeued_Order: Queued_Order; Assigned_Order: Order_Holder renames Dequeued_Order.Holder; Busy: Boolean := False; procedure Start_Job is begin Worker_Accounting.Start_Job; Busy := True; end Start_Job; procedure Finish_Job is begin Worker_Accounting.Finish_Job; Busy := False; end Finish_Job; procedure Get_Next_Job is -- A roll-up procedure to obtain a new work order and change the -- busy state only as needed begin -- First drain the deferral queue loop select Deferral_Queue.Dequeue (Dequeued_Order); else exit; end select; Work_Queue.Enqueue (Dequeued_Order); end loop; -- Now grab an order loop select Work_Queue.Dequeue (Dequeued_Order); else -- Nothing is available right now -- If we're busy lets inciate that we're now idle while we wait if Busy then Finish_Job; end if; Work_Queue.Dequeue (Dequeued_Order); end select; -- If the order if a deferral order, it needs to be requeued on -- the deferral queue if it is not ready to execute yet if Dequeued_Order.Wait_Tracker /= null and then not Dequeued_Order.Wait_Tracker.Is_Complete then -- Not ready. Off to the deferral queue and try again Deferral_Queue.Enqueue (Dequeued_Order); else exit; end if; end loop; if not Busy then Start_Job; -- We will be held here if another worker is currently executing -- any Phase_Trigger end if; end Get_Next_Job; Phase_Trigger_Armed: Boolean; begin -- Wait for our very first job Get_Next_Job; loop Phase_Trigger_Armed := False; -- Termination orders if Assigned_Order.all in Termination_Order then -- Requeue for all other workers Work_Queue.Enqueue (Dequeued_Order); Finish_Job; exit; -- Proxy reports elsif Assigned_Order.all in Reporting.Proxy_Report'Class then declare Proxy_Report: Reporting.Work_Report (Reporting.Info); begin Proxy_Report.Work_Order_Information := To_Report_String (Assigned_Order.Image); Proxy_Report.Worker_Note := To_Report_String ("<<Proxy Report>>"); Reporting.Submit_Report (Proxy_Report); end; -- Normal work orders else declare use type Progress.Progress_Tracker_Access; begin Assigned_Order.Execute; if Assigned_Order.Tracker /= null then Assigned_Order.Tracker.Increment_Completed_Items (Completed => Phase_Trigger_Armed); end if; exception when e: others => if Assigned_Order.Tracker /= null then Assigned_Order.Tracker.Increment_Failed_Items (Completed => Phase_Trigger_Armed); end if; declare Report: Reporting.Work_Report (Reporting.Error); begin Report.Work_Order_Information := To_Report_String (Assigned_Order.Image); Report.Exception_Information := To_Report_String (Exception_Info (e)); Reporting.Submit_Report (Report); end; end; -- Execute the Phase_Trigger operation if this was the last order -- of a tracker if Phase_Trigger_Armed then Phase_Trigger_Armed := False; Worker_Accounting.Phase_Trigger_Lock; begin Assigned_Order.Phase_Trigger; exception when e: others => declare Report: Reporting.Work_Report (Reporting.Error); begin Report.Work_Order_Information := To_Report_String (Assigned_Order.Image); Report.Exception_Information := To_Report_String (Exception_Info (e)); Report.Worker_Note := To_Report_String ("Phase Trigger failed"); Reporting.Submit_Report (Report); end; end; Worker_Accounting.Phase_Trigger_Release; end if; -- File a completion report if enabled if Worker_Accounting.Completion_Reporting then declare Completion_Report: Reporting.Work_Report (Reporting.Info); begin Completion_Report.Work_Order_Information:= To_Report_String (Assigned_Order.Image); Completion_Report.Worker_Note := To_Report_String ("Work order completed"); Reporting.Submit_Report (Completion_Report); end; end if; end if; Deallocate (Assigned_Order); Get_Next_Job; end loop; exception when e: others => declare Report: Reporting.Work_Report (Reporting.Error); begin Report.Work_Order_Information := To_Report_String ("<<GENERAL WORKER FAILURE>>"); Report.Worker_Note := To_Report_String ("Worker task experienced an unhandled exception"); Report.Exception_Information := To_Report_String (Exception_Info (e)); Reporting.Submit_Report (Report); if Busy then Finish_Job; end if; end; end Worker_Task; ------------------------ -- Completion Reports -- ------------------------ procedure Enable_Completion_Reports is begin Worker_Accounting.Set_Completion_Reports (True); end Enable_Completion_Reports; procedure Disable_Completion_Reports is begin Worker_Accounting.Set_Completion_Reports (False); end Disable_Completion_Reports; ------------------ -- Wait_Workers -- ------------------ procedure Wait_Workers is begin Worker_Accounting.Wait_Idle; end Wait_Workers; -------------------------------------------------- procedure Wait_Workers (Timeout: in Duration; Timedout: out Boolean) is begin select Worker_Accounting.Wait_Idle; Timedout := False; or delay Timeout; Timedout := True; end select; end Wait_Workers; --------------------- -- Disband_Workers -- --------------------- procedure Disband_Workers is begin -- We simply insert a single Termination_Order on the queue, which -- will remain there Work_Queue.Enqueue ((Holder => new Termination_Order, Wait_Tracker => null)); end Disband_Workers; ------------------ -- Busy_Workers -- ------------------ function Busy_Workers return Worker_Count is (Worker_Accounting.Busy_Workers); ----------------------- -- Peak_Busy_Workers -- ----------------------- function Peak_Busy_Workers return Worker_Count is (Worker_Accounting.Peak_Busy_Workers); end Workers;
-- Advanced Resource Embedder 1.2.0 package Lines is type Content_Array is array (Positive range <>) of access constant String; type Content_Access is access constant Content_Array; Id_single_txt : aliased constant Content_Array; private L_1 : aliased constant String := "single line"; Id_single_txt : aliased constant Content_Array := (1 => L_0'Access); end Lines;
with Ada.Assertions; use Ada.Assertions; with Ada.Strings.Fixed; use Ada.Strings.Fixed; with Rejuvenation.Finder; use Rejuvenation.Finder; with Rejuvenation.Utils; use Rejuvenation.Utils; with String_Vectors; use String_Vectors; with String_Vectors_Utils; use String_Vectors_Utils; package body Rejuvenation.Replacer is function Is_Empty (Node : Ada_Node'Class; Replacements : Map) return Boolean with Pre => not Node.Is_Null; function Is_Empty (Node : Ada_Node'Class; Replacements : Map) return Boolean is begin return Is_Placeholder (Node) and then Replacements.Element (Get_Placeholder_Name (Node)) = ""; end Is_Empty; function Present_And_Empty (Node : Ada_Node'Class; Replacements : Map) return Boolean is (not Node.Is_Null and then Is_Empty (Node, Replacements)); function Is_Empty_List (List : Ada_List'Class; Replacements : Map) return Boolean; function Is_Empty_List (List : Ada_List'Class; Replacements : Map) return Boolean is begin return (for all Child of List.Children => Is_Empty (Child, Replacements)); end Is_Empty_List; function Is_Replacement_Node (Node : Ada_Node'Class; Replacements : Map) return Boolean; function Is_Replacement_Node (Node : Ada_Node'Class; Replacements : Map) return Boolean is begin if Is_Placeholder (Node) then return True; end if; case Node.Kind is when Ada_Object_Decl => declare O_D : constant Object_Decl := Node.As_Object_Decl; begin return Is_Empty_List (O_D.F_Ids, Replacements) or else Present_And_Empty (O_D.F_Default_Expr, Replacements); end; when Ada_Call_Expr => declare C_E : constant Call_Expr := Node.As_Call_Expr; Suffix : constant Ada_Node := C_E.F_Suffix; begin return Suffix.Kind = Ada_Assoc_List and then Is_Empty_List (C_E.F_Suffix.As_Ada_List, Replacements); end; when Ada_If_Stmt => declare I_S : constant If_Stmt := Node.As_If_Stmt; begin return Is_Empty_List (I_S.F_Else_Stmts, Replacements); end; when Ada_Decl_Block => declare D_B : constant Decl_Block := Node.As_Decl_Block; Decls : constant Declarative_Part := D_B.F_Decls; begin -- Check for empty declarative part: "declare begin .. end;" return not Decls.Is_Null and then (for all Child of Decls.F_Decls => Child.Kind = Ada_Object_Decl and then Is_Empty_List (Child.As_Object_Decl.F_Ids, Replacements)); end; when Ada_Param_Assoc => declare P_A : constant Param_Assoc := Node.As_Param_Assoc; begin return Present_And_Empty (P_A.F_Designator, Replacements); end; when Ada_Stmt_List => -- TODO: can lists be combined? declare S_L : constant Stmt_List := Node.As_Stmt_List; begin -- An empty stmt within a statement list is fine -- Only a completely empty statement list is problematic in some contexts -- including -- * if then else <empty> end if -- * when others => <empty> -- * begin <empty> end; return Is_Empty_List (S_L, Replacements); end; when Ada_Assoc_List | Ada_Aspect_Assoc_List => declare A_L : constant Ada_List := Node.As_Ada_List; begin -- When a child is empty, also a separator must be removed return (for some Child of A_L.Children => Is_Empty (Child, Replacements)); end; when Ada_Aspect_Spec => declare A_S : constant Aspect_Spec := Node.As_Aspect_Spec; begin -- When the list of aspects is empty, also the 'with' keyword must be removed return Is_Empty_List (A_S.F_Aspect_Assocs, Replacements); end; when others => return False; end case; end Is_Replacement_Node; function Get_Replacement_For_Node (Node : Ada_Node'Class; Replacements : Map) return String; function Get_Replacement_For_Node (Node : Ada_Node'Class; Replacements : Map) return String is begin if Is_Placeholder (Node) then return Replacements.Element (Get_Placeholder_Name (Node)); end if; case Node.Kind is when Ada_Object_Decl => declare O_D : constant Object_Decl := Node.As_Object_Decl; Ids : String_Vectors.Vector; begin for Id of O_D.F_Ids loop declare Value : constant String := Replace (Id, Replacements); begin if Value /= "" then Ids.Append (Value); end if; end; end loop; if Ids.Is_Empty then return ""; else declare Start : constant String := Join (Ids, ", ") & " : " & (if O_D.F_Has_Aliased then "aliased " else "") & (if O_D.F_Has_Constant then "constant " else "") & Replace (O_D.F_Type_Expr, Replacements) & " "; Default_Expr : constant String := Replace (O_D.F_Default_Expr, Replacements); Default_Expr_Tokens : constant String := (if Default_Expr = "" then "" else ":= " & Default_Expr & " "); Aspects : constant String := Replace (O_D.F_Aspects, Replacements); begin return Start & Default_Expr_Tokens & Aspects & ";"; end; end if; end; when Ada_Call_Expr => declare C_E : constant Call_Expr := Node.As_Call_Expr; Name : constant String := Replace (C_E.F_Name, Replacements); Suffix : constant String := (if C_E.F_Suffix.Kind = Ada_Assoc_List then (if Is_Empty_List (C_E.F_Suffix.As_Ada_List, Replacements) then "" else "(" & Replace (C_E.F_Suffix, Replacements) & ")") else Replace (C_E.F_Suffix, Replacements)); begin return Name & Suffix; end; when Ada_If_Stmt => declare I_S : constant If_Stmt := Node.As_If_Stmt; Cond_Expr : constant String := Replace (I_S.F_Cond_Expr, Replacements); Then_Stmts : constant String := Replace (I_S.F_Then_Stmts, Replacements); Else_Stmts : constant String := (if Is_Empty_List (I_S.F_Else_Stmts, Replacements) then "" else " else " & Replace (I_S.F_Else_Stmts, Replacements)); Alternatives : String_Vectors.Vector; begin for Alternative of I_S.F_Alternatives loop Alternatives.Append (Replace (Alternative, Replacements)); end loop; return "if " & Cond_Expr & " then " & Then_Stmts & Join (Alternatives) & Else_Stmts & " end if;"; end; when Ada_Decl_Block => declare D_B : constant Decl_Block := Node.As_Decl_Block; Decls : String_Vectors.Vector; begin for Decl of D_B.F_Decls.F_Decls loop declare Value : constant String := Replace (Decl, Replacements); begin if Value /= "" then Decls.Append (Value); end if; end; end loop; return (if Decls.Is_Empty then "" else "declare " & Join (Decls)) & " begin " & Replace (D_B.F_Stmts, Replacements) & " end;"; end; when Ada_Param_Assoc => declare P_A : constant Param_Assoc := Node.As_Param_Assoc; Designator : constant String := Replace (P_A.F_Designator, Replacements); R_Expr : constant String := Replace (P_A.F_R_Expr, Replacements); Designator_Tokens : constant String := (if Designator = "" then "" else Designator & " => "); begin return Designator_Tokens & R_Expr; end; when Ada_Aspect_Spec => declare A_S : constant Aspect_Spec := Node.As_Aspect_Spec; Aspect_Assocs : String_Vectors.Vector; begin for Aspect_Assoc of A_S.F_Aspect_Assocs loop declare Value : constant String := Replace (Aspect_Assoc, Replacements); begin if Value /= "" then Aspect_Assocs.Append (Value); end if; end; end loop; return (if Aspect_Assocs.Is_Empty then "" else "with " & Join (Aspect_Assocs, ", ")); end; when Ada_Stmt_List => declare S_L : constant Stmt_List := Node.As_Stmt_List; Stmts : String_Vectors.Vector; begin for Child of S_L.Children loop declare Value : constant String := Replace (Child, Replacements); begin if Value /= "" then Stmts.Append (Value); end if; end; end loop; return (if Stmts.Is_Empty then "null;" else Join (Stmts, (1 => ASCII.LF))); end; when Ada_Assoc_List | Ada_Aspect_Assoc_List => declare A_L : constant Ada_List := Node.As_Ada_List; Values : String_Vectors.Vector; begin for Child of A_L.Children loop declare Value : constant String := Replace (Child, Replacements); begin if Value /= "" then Values.Append (Value); end if; end; end loop; return Join (Values, ", "); end; when others => Assert (Check => False, Message => "Get_Replacement_For_Node: Unexpected kind " & Node.Kind'Image); return ""; end case; end Get_Replacement_For_Node; function Get_Nodes_To_Be_Replaced (Node : Ada_Node'Class; Replacements : Map) return Node_List.Vector; function Get_Nodes_To_Be_Replaced (Node : Ada_Node'Class; Replacements : Map) return Node_List.Vector is function Predicate (Node : Ada_Node'Class) return Boolean is (Is_Replacement_Node (Node, Replacements)); begin return Find_Non_Contained (Node, Predicate'Access); end Get_Nodes_To_Be_Replaced; function Tail (V : Node_List.Vector) return Node_List.Vector; function Tail (V : Node_List.Vector) return Node_List.Vector is Return_Value : Node_List.Vector := V.Copy; begin Node_List.Delete_First (Return_Value); return Return_Value; end Tail; function Replace (Original : String; Nodes_To_Be_Replaced : Node_List.Vector; Replacements : Map) return String; function Replace (Original : String; Nodes_To_Be_Replaced : Node_List.Vector; Replacements : Map) return String is begin if Nodes_To_Be_Replaced.Is_Empty then return Original; end if; declare Node_To_Be_Replaced : constant Ada_Node'Class := Nodes_To_Be_Replaced.First_Element; R_S : constant String := Raw_Signature (Node_To_Be_Replaced); First : constant Natural := Index (Original, R_S); Last : constant Natural := First + R_S'Length - 1; Replacement_Nodes_Tail : constant Node_List.Vector := Tail (Nodes_To_Be_Replaced); begin Assert (Check => First /= 0, Message => "Replacement_Node unexpectedly not found"); declare Prefix : String renames Original (Original'First .. First - 1); Remainder : String renames Original (Last + 1 .. Original'Last); Insert : constant String := Get_Replacement_For_Node (Node_To_Be_Replaced, Replacements); Tail : constant String := Replace (Remainder, Replacement_Nodes_Tail, Replacements); begin return Prefix & Insert & Tail; end; end; end Replace; function Replace (Node : Ada_Node'Class; Replacements : Map) return String is Nodes_To_Be_Replaced : constant Node_List.Vector := Get_Nodes_To_Be_Replaced (Node, Replacements); begin return Replace (Raw_Signature (Node), Nodes_To_Be_Replaced, Replacements); end Replace; end Rejuvenation.Replacer;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M -- -- -- -- S p e c -- -- (VxWorks 7.x PPC RTP) -- -- -- -- Copyright (C) 1992-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/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This is the VxWorks version of this package for RTPs package System is pragma Pure; -- Note that we take advantage of the implementation permission to make -- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada -- 2005, this is Pure in any case (AI-362). pragma No_Elaboration_Code_All; -- Allow the use of that restriction in units that WITH this unit type Name is (SYSTEM_NAME_GNAT); System_Name : constant Name := SYSTEM_NAME_GNAT; -- System-Dependent Named Numbers Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1); Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1; Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size; Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1; Max_Base_Digits : constant := Long_Long_Float'Digits; Max_Digits : constant := Long_Long_Float'Digits; Max_Mantissa : constant := 63; Fine_Delta : constant := 2.0 ** (-Max_Mantissa); Tick : constant := 1.0 / 60.0; -- Storage-related Declarations type Address is private; pragma Preelaborable_Initialization (Address); Null_Address : constant Address; Storage_Unit : constant := 8; Word_Size : constant := 32; Memory_Size : constant := 2 ** 32; -- Address comparison function "<" (Left, Right : Address) return Boolean; function "<=" (Left, Right : Address) return Boolean; function ">" (Left, Right : Address) return Boolean; function ">=" (Left, Right : Address) return Boolean; function "=" (Left, Right : Address) return Boolean; pragma Import (Intrinsic, "<"); pragma Import (Intrinsic, "<="); pragma Import (Intrinsic, ">"); pragma Import (Intrinsic, ">="); pragma Import (Intrinsic, "="); -- Other System-Dependent Declarations type Bit_Order is (High_Order_First, Low_Order_First); Default_Bit_Order : constant Bit_Order := High_Order_First; pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning -- Priority-related Declarations (RM D.1) -- Ada priorities are mapped to VxWorks priorities using the following -- transformation: 255 - Ada Priority -- Ada priorities are used as follows: -- 256 is reserved for the VxWorks kernel -- 248 - 255 correspond to hardware interrupt levels 0 .. 7 -- 247 is a catchall default "interrupt" priority for signals, -- allowing higher priority than normal tasks, but lower than -- hardware priority levels. Protected Object ceilings can -- override these values. -- 246 is used by the Interrupt_Manager task Max_Priority : constant Positive := 245; Max_Interrupt_Priority : constant Positive := 255; subtype Any_Priority is Integer range 0 .. 255; subtype Priority is Any_Priority range 0 .. 245; subtype Interrupt_Priority is Any_Priority range 246 .. 255; Default_Priority : constant Priority := 122; private pragma Linker_Options ("--specs=vxworks-ppc-link.spec"); -- Setup proper set of -L's for this configuration type Address is mod Memory_Size; Null_Address : constant Address := 0; -------------------------------------- -- System Implementation Parameters -- -------------------------------------- -- These parameters provide information about the target that is used -- by the compiler. They are in the private part of System, where they -- can be accessed using the special circuitry in the Targparm unit -- whose source should be consulted for more detailed descriptions -- of the individual switch values. Backend_Divide_Checks : constant Boolean := False; Backend_Overflow_Checks : constant Boolean := True; Command_Line_Args : constant Boolean := True; Configurable_Run_Time : constant Boolean := False; Denorm : constant Boolean := True; Duration_32_Bits : constant Boolean := False; Exit_Status_Supported : constant Boolean := True; Fractional_Fixed_Ops : constant Boolean := False; Frontend_Layout : constant Boolean := False; Machine_Overflows : constant Boolean := False; Machine_Rounds : constant Boolean := True; Preallocated_Stacks : constant Boolean := False; Signed_Zeros : constant Boolean := True; Stack_Check_Default : constant Boolean := False; Stack_Check_Probes : constant Boolean := True; Stack_Check_Limits : constant Boolean := False; Support_Aggregates : constant Boolean := True; Support_Composite_Assign : constant Boolean := True; Support_Composite_Compare : constant Boolean := True; Support_Long_Shifts : constant Boolean := True; Always_Compatible_Rep : constant Boolean := False; Suppress_Standard_Library : constant Boolean := False; Use_Ada_Main_Program_Name : constant Boolean := False; Frontend_Exceptions : constant Boolean := False; ZCX_By_Default : constant Boolean := True; Executable_Extension : constant String := ".vxe"; end System;
------------------------------------------------------------------------------ -- -- -- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M - S T A C K _ U S A G E -- -- -- -- B o d y -- -- -- -- Copyright (C) 2004-2020, Free Software Foundation, Inc. -- -- -- -- GNARL 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/>. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ with System.Parameters; with System.CRTL; with System.IO; package body System.Stack_Usage is use System.Storage_Elements; use System.IO; use Interfaces; ----------------- -- Stack_Slots -- ----------------- -- Stack_Slots is an internal data type to represent a sequence of real -- stack slots initialized with a provided pattern, with operations to -- abstract away the target call stack growth direction. type Stack_Slots is array (Integer range <>) of Pattern_Type; for Stack_Slots'Component_Size use Pattern_Type'Object_Size; -- We will carefully handle the initializations ourselves and might want -- to remap an initialized overlay later on with an address clause. pragma Suppress_Initialization (Stack_Slots); -- The abstract Stack_Slots operations all operate over the simple array -- memory model: -- memory addresses increasing ----> -- Slots('First) Slots('Last) -- | | -- V V -- +------------------------------------------------------------------+ -- |####| |####| -- +------------------------------------------------------------------+ -- What we call Top or Bottom always denotes call chain leaves or entry -- points respectively, and their relative positions in the stack array -- depends on the target stack growth direction: -- Stack_Grows_Down -- <----- calls push frames towards decreasing addresses -- Top(most) Slot Bottom(most) Slot -- | | -- V V -- +------------------------------------------------------------------+ -- |####| | leaf frame | ... | entry frame | -- +------------------------------------------------------------------+ -- Stack_Grows_Up -- calls push frames towards increasing addresses -----> -- Bottom(most) Slot Top(most) Slot -- | | -- V V -- +------------------------------------------------------------------+ -- | entry frame | ... | leaf frame | |####| -- +------------------------------------------------------------------+ ------------------- -- Unit Services -- ------------------- -- Now the implementation of the services offered by this unit, on top of -- the Stack_Slots abstraction above. Index_Str : constant String := "Index"; Task_Name_Str : constant String := "Task Name"; Stack_Size_Str : constant String := "Stack Size"; Actual_Size_Str : constant String := "Stack usage"; procedure Output_Result (Result_Id : Natural; Result : Task_Result; Max_Stack_Size_Len : Natural; Max_Actual_Use_Len : Natural); -- Prints the result on the standard output. Result Id is the number of -- the result in the array, and Result the contents of the actual result. -- Max_Stack_Size_Len and Max_Actual_Use_Len are used for displaying the -- proper layout. They hold the maximum length of the string representing -- the Stack_Size and Actual_Use values. ---------------- -- Initialize -- ---------------- procedure Initialize (Buffer_Size : Natural) is Stack_Size_Chars : System.Address; begin -- Initialize the buffered result array Result_Array := new Result_Array_Type (1 .. Buffer_Size); Result_Array.all := (others => (Task_Name => (others => ASCII.NUL), Value => 0, Stack_Size => 0)); -- Set the Is_Enabled flag to true, so that the task wrapper knows that -- it has to handle dynamic stack analysis Is_Enabled := True; Stack_Size_Chars := System.CRTL.getenv ("GNAT_STACK_LIMIT" & ASCII.NUL); -- If variable GNAT_STACK_LIMIT is set, then we will take care of the -- environment task, using GNAT_STASK_LIMIT as the size of the stack. -- It doesn't make sens to process the stack when no bound is set (e.g. -- limit is typically up to 4 GB). if Stack_Size_Chars /= Null_Address then declare My_Stack_Size : Integer; begin My_Stack_Size := System.CRTL.atoi (Stack_Size_Chars) * 1024; Initialize_Analyzer (Environment_Task_Analyzer, "ENVIRONMENT TASK", My_Stack_Size, 0, My_Stack_Size); Fill_Stack (Environment_Task_Analyzer); Compute_Environment_Task := True; end; -- GNAT_STACK_LIMIT not set else Compute_Environment_Task := False; end if; end Initialize; ---------------- -- Fill_Stack -- ---------------- procedure Fill_Stack (Analyzer : in out Stack_Analyzer) is -- Change the local variables and parameters of this function with -- super-extra care. The more the stack frame size of this function is -- big, the more an "instrumentation threshold at writing" error is -- likely to happen. Current_Stack_Level : aliased Integer; Guard : constant := 256; -- Guard space between the Current_Stack_Level'Address and the last -- allocated byte on the stack. begin if Parameters.Stack_Grows_Down then if Analyzer.Stack_Base - Stack_Address (Analyzer.Pattern_Size) > To_Stack_Address (Current_Stack_Level'Address) - Guard then -- No room for a pattern Analyzer.Pattern_Size := 0; return; end if; Analyzer.Pattern_Limit := Analyzer.Stack_Base - Stack_Address (Analyzer.Pattern_Size); if Analyzer.Stack_Base > To_Stack_Address (Current_Stack_Level'Address) - Guard then -- Reduce pattern size to prevent local frame overwrite Analyzer.Pattern_Size := Integer (To_Stack_Address (Current_Stack_Level'Address) - Guard - Analyzer.Pattern_Limit); end if; Analyzer.Pattern_Overlay_Address := To_Address (Analyzer.Pattern_Limit); else if Analyzer.Stack_Base + Stack_Address (Analyzer.Pattern_Size) < To_Stack_Address (Current_Stack_Level'Address) + Guard then -- No room for a pattern Analyzer.Pattern_Size := 0; return; end if; Analyzer.Pattern_Limit := Analyzer.Stack_Base + Stack_Address (Analyzer.Pattern_Size); if Analyzer.Stack_Base < To_Stack_Address (Current_Stack_Level'Address) + Guard then -- Reduce pattern size to prevent local frame overwrite Analyzer.Pattern_Size := Integer (Analyzer.Pattern_Limit - (To_Stack_Address (Current_Stack_Level'Address) + Guard)); end if; Analyzer.Pattern_Overlay_Address := To_Address (Analyzer.Pattern_Limit - Stack_Address (Analyzer.Pattern_Size)); end if; -- Declare and fill the pattern buffer declare Pattern : aliased Stack_Slots (1 .. Analyzer.Pattern_Size / Bytes_Per_Pattern); for Pattern'Address use Analyzer.Pattern_Overlay_Address; begin if System.Parameters.Stack_Grows_Down then for J in reverse Pattern'Range loop Pattern (J) := Analyzer.Pattern; end loop; else for J in Pattern'Range loop Pattern (J) := Analyzer.Pattern; end loop; end if; end; end Fill_Stack; ------------------------- -- Initialize_Analyzer -- ------------------------- procedure Initialize_Analyzer (Analyzer : in out Stack_Analyzer; Task_Name : String; Stack_Size : Natural; Stack_Base : Stack_Address; Pattern_Size : Natural; Pattern : Interfaces.Unsigned_32 := 16#DEAD_BEEF#) is begin -- Initialize the analyzer fields Analyzer.Stack_Base := Stack_Base; Analyzer.Stack_Size := Stack_Size; Analyzer.Pattern_Size := Pattern_Size; Analyzer.Pattern := Pattern; Analyzer.Result_Id := Next_Id; Analyzer.Task_Name := (others => ' '); -- Compute the task name, and truncate if bigger than Task_Name_Length if Task_Name'Length <= Task_Name_Length then Analyzer.Task_Name (1 .. Task_Name'Length) := Task_Name; else Analyzer.Task_Name := Task_Name (Task_Name'First .. Task_Name'First + Task_Name_Length - 1); end if; Next_Id := Next_Id + 1; end Initialize_Analyzer; ---------------- -- Stack_Size -- ---------------- function Stack_Size (SP_Low : Stack_Address; SP_High : Stack_Address) return Natural is begin if SP_Low > SP_High then return Natural (SP_Low - SP_High); else return Natural (SP_High - SP_Low); end if; end Stack_Size; -------------------- -- Compute_Result -- -------------------- procedure Compute_Result (Analyzer : in out Stack_Analyzer) is -- Change the local variables and parameters of this function with -- super-extra care. The larger the stack frame size of this function -- is, the more an "instrumentation threshold at reading" error is -- likely to happen. Stack : Stack_Slots (1 .. Analyzer.Pattern_Size / Bytes_Per_Pattern); for Stack'Address use Analyzer.Pattern_Overlay_Address; begin -- Value if the pattern was not modified if Parameters.Stack_Grows_Down then Analyzer.Topmost_Touched_Mark := Analyzer.Pattern_Limit + Stack_Address (Analyzer.Pattern_Size); else Analyzer.Topmost_Touched_Mark := Analyzer.Pattern_Limit - Stack_Address (Analyzer.Pattern_Size); end if; if Analyzer.Pattern_Size = 0 then return; end if; -- Look backward from the topmost possible end of the marked stack to -- the bottom of it. The first index not equals to the patterns marks -- the beginning of the used stack. if System.Parameters.Stack_Grows_Down then for J in Stack'Range loop if Stack (J) /= Analyzer.Pattern then Analyzer.Topmost_Touched_Mark := To_Stack_Address (Stack (J)'Address); exit; end if; end loop; else for J in reverse Stack'Range loop if Stack (J) /= Analyzer.Pattern then Analyzer.Topmost_Touched_Mark := To_Stack_Address (Stack (J)'Address); exit; end if; end loop; end if; end Compute_Result; --------------------- -- Output_Result -- --------------------- procedure Output_Result (Result_Id : Natural; Result : Task_Result; Max_Stack_Size_Len : Natural; Max_Actual_Use_Len : Natural) is Result_Id_Str : constant String := Natural'Image (Result_Id); Stack_Size_Str : constant String := Natural'Image (Result.Stack_Size); Actual_Use_Str : constant String := Natural'Image (Result.Value); Result_Id_Blanks : constant String (1 .. Index_Str'Length - Result_Id_Str'Length) := (others => ' '); Stack_Size_Blanks : constant String (1 .. Max_Stack_Size_Len - Stack_Size_Str'Length) := (others => ' '); Actual_Use_Blanks : constant String (1 .. Max_Actual_Use_Len - Actual_Use_Str'Length) := (others => ' '); begin Set_Output (Standard_Error); Put (Result_Id_Blanks & Natural'Image (Result_Id)); Put (" | "); Put (Result.Task_Name); Put (" | "); Put (Stack_Size_Blanks & Stack_Size_Str); Put (" | "); Put (Actual_Use_Blanks & Actual_Use_Str); New_Line; end Output_Result; --------------------- -- Output_Results -- --------------------- procedure Output_Results is Max_Stack_Size : Natural := 0; Max_Stack_Usage : Natural := 0; Max_Stack_Size_Len, Max_Actual_Use_Len : Natural := 0; Task_Name_Blanks : constant String (1 .. Task_Name_Length - Task_Name_Str'Length) := (others => ' '); begin Set_Output (Standard_Error); if Compute_Environment_Task then Compute_Result (Environment_Task_Analyzer); Report_Result (Environment_Task_Analyzer); end if; if Result_Array'Length > 0 then -- Computes the size of the largest strings that will get displayed, -- in order to do correct column alignment. for J in Result_Array'Range loop exit when J >= Next_Id; if Result_Array (J).Value > Max_Stack_Usage then Max_Stack_Usage := Result_Array (J).Value; end if; if Result_Array (J).Stack_Size > Max_Stack_Size then Max_Stack_Size := Result_Array (J).Stack_Size; end if; end loop; Max_Stack_Size_Len := Natural'Image (Max_Stack_Size)'Length; Max_Actual_Use_Len := Natural'Image (Max_Stack_Usage)'Length; -- Display the output header. Blanks will be added in front of the -- labels if needed. declare Stack_Size_Blanks : constant String (1 .. Max_Stack_Size_Len - Stack_Size_Str'Length) := (others => ' '); Stack_Usage_Blanks : constant String (1 .. Max_Actual_Use_Len - Actual_Size_Str'Length) := (others => ' '); begin if Stack_Size_Str'Length > Max_Stack_Size_Len then Max_Stack_Size_Len := Stack_Size_Str'Length; end if; if Actual_Size_Str'Length > Max_Actual_Use_Len then Max_Actual_Use_Len := Actual_Size_Str'Length; end if; Put (Index_Str & " | " & Task_Name_Str & Task_Name_Blanks & " | " & Stack_Size_Str & Stack_Size_Blanks & " | " & Stack_Usage_Blanks & Actual_Size_Str); end; New_Line; -- Now display the individual results for J in Result_Array'Range loop exit when J >= Next_Id; Output_Result (J, Result_Array (J), Max_Stack_Size_Len, Max_Actual_Use_Len); end loop; -- Case of no result stored, still display the labels else Put (Index_Str & " | " & Task_Name_Str & Task_Name_Blanks & " | " & Stack_Size_Str & " | " & Actual_Size_Str); New_Line; end if; end Output_Results; ------------------- -- Report_Result -- ------------------- procedure Report_Result (Analyzer : Stack_Analyzer) is Result : Task_Result := (Task_Name => Analyzer.Task_Name, Stack_Size => Analyzer.Stack_Size, Value => 0); begin if Analyzer.Pattern_Size = 0 then -- If we have that result, it means that we didn't do any computation -- at all (i.e. we used at least everything (and possibly more). Result.Value := Analyzer.Stack_Size; else Result.Value := Stack_Size (Analyzer.Topmost_Touched_Mark, Analyzer.Stack_Base); end if; if Analyzer.Result_Id in Result_Array'Range then -- If the result can be stored, then store it in Result_Array Result_Array (Analyzer.Result_Id) := Result; else -- If the result cannot be stored, then we display it right away declare Result_Str_Len : constant Natural := Natural'Image (Result.Value)'Length; Size_Str_Len : constant Natural := Natural'Image (Analyzer.Stack_Size)'Length; Max_Stack_Size_Len : Natural; Max_Actual_Use_Len : Natural; begin -- Take either the label size or the number image size for the -- size of the column "Stack Size". Max_Stack_Size_Len := (if Size_Str_Len > Stack_Size_Str'Length then Size_Str_Len else Stack_Size_Str'Length); -- Take either the label size or the number image size for the -- size of the column "Stack Usage". Max_Actual_Use_Len := (if Result_Str_Len > Actual_Size_Str'Length then Result_Str_Len else Actual_Size_Str'Length); Output_Result (Analyzer.Result_Id, Result, Max_Stack_Size_Len, Max_Actual_Use_Len); end; end if; end Report_Result; end System.Stack_Usage;
-- ___ _ ___ _ _ -- -- / __| |/ (_) | | Common SKilL implementation -- -- \__ \ ' <| | | |__ skills vector container implementation -- -- |___/_|\_\_|_|____| by: Dennis Przytarski, Timm Felden -- -- -- pragma Ada_2012; with Ada.Unchecked_Deallocation; package body Skill.Containers.Maps is procedure Advance (This : access Iterator_T) is begin HS.Next (This.Cursor); end Advance; procedure Free (This : access Iterator_T) is type T is access all Iterator_T; X : T := T (This); procedure Delete is new Ada.Unchecked_Deallocation (Iterator_T, T); begin Delete (X); end Free; procedure Update (This : access Map_T; K : Skill.Types.Box; V : Skill.Types.Box) is begin HS.Include (This.This, CastK (K), CastV (V)); end Update; procedure Remove (This : access Map_T; K : Skill.Types.Box) is begin HS.Exclude (This.This, CastK (K)); end Remove; function Make return Ref is begin return new Map_T'(This => HS.Empty_Map); end Make; end Skill.Containers.Maps;
package Giza.Bitmap_Fonts.FreeSerifBoldItalic12pt7b is Font : constant Giza.Font.Ref_Const; private FreeSerifBoldItalic12pt7bBitmaps : aliased constant Font_Bitmap := ( 16#07#, 16#07#, 16#07#, 16#0F#, 16#0E#, 16#0E#, 16#0C#, 16#0C#, 16#08#, 16#18#, 16#10#, 16#00#, 16#00#, 16#60#, 16#F0#, 16#F0#, 16#60#, 16#61#, 16#F1#, 16#F8#, 16#F8#, 16#6C#, 16#34#, 16#12#, 16#08#, 16#01#, 16#8C#, 16#06#, 16#60#, 16#31#, 16#80#, 16#CC#, 16#06#, 16#30#, 16#FF#, 16#F0#, 16#C6#, 16#03#, 16#18#, 16#0C#, 16#C0#, 16#63#, 16#0F#, 16#FF#, 16#0C#, 16#60#, 16#33#, 16#01#, 16#8C#, 16#06#, 16#30#, 16#19#, 16#80#, 16#00#, 16#80#, 16#08#, 16#07#, 16#C1#, 16#96#, 16#31#, 16#33#, 16#13#, 16#3A#, 16#23#, 16#E0#, 16#1E#, 16#01#, 16#F0#, 16#07#, 16#80#, 16#7C#, 16#05#, 16#C4#, 16#CC#, 16#48#, 16#CC#, 16#8C#, 16#F8#, 16#83#, 16#30#, 16#1E#, 16#01#, 16#00#, 16#00#, 16#02#, 16#07#, 16#83#, 16#03#, 16#9F#, 16#81#, 16#C4#, 16#20#, 16#71#, 16#10#, 16#3C#, 16#44#, 16#0E#, 16#22#, 16#03#, 16#88#, 16#80#, 16#E4#, 16#40#, 16#1E#, 16#21#, 16#E0#, 16#08#, 16#E4#, 16#04#, 16#71#, 16#01#, 16#3C#, 16#40#, 16#8E#, 16#10#, 16#23#, 16#88#, 16#10#, 16#E2#, 16#04#, 16#39#, 16#02#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#01#, 16#98#, 16#03#, 16#98#, 16#03#, 16#98#, 16#03#, 16#B0#, 16#03#, 16#E0#, 16#03#, 16#80#, 16#0F#, 16#9F#, 16#19#, 16#CE#, 16#31#, 16#CC#, 16#61#, 16#C8#, 16#E1#, 16#C8#, 16#E0#, 16#F0#, 16#E0#, 16#E0#, 16#F0#, 16#70#, 16#78#, 16#79#, 16#3F#, 16#BE#, 16#7F#, 16#ED#, 16#20#, 16#02#, 16#08#, 16#20#, 16#C3#, 16#0E#, 16#18#, 16#30#, 16#E1#, 16#83#, 16#06#, 16#0C#, 16#18#, 16#30#, 16#20#, 16#40#, 16#80#, 16#81#, 16#01#, 16#00#, 16#10#, 16#10#, 16#20#, 16#20#, 16#40#, 16#C1#, 16#83#, 16#06#, 16#0C#, 16#18#, 16#70#, 16#E1#, 16#83#, 16#0C#, 16#18#, 16#61#, 16#86#, 16#00#, 16#00#, 16#0C#, 16#33#, 16#6C#, 16#9B#, 16#AE#, 16#1C#, 16#3F#, 16#EC#, 16#9B#, 16#36#, 16#0C#, 16#02#, 16#00#, 16#06#, 16#00#, 16#60#, 16#06#, 16#00#, 16#60#, 16#06#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#60#, 16#06#, 16#00#, 16#60#, 16#06#, 16#00#, 16#60#, 16#31#, 16#CE#, 16#31#, 16#08#, 16#98#, 16#FF#, 16#FF#, 16#C0#, 16#6F#, 16#F6#, 16#00#, 16#80#, 16#60#, 16#10#, 16#0C#, 16#02#, 16#01#, 16#80#, 16#40#, 16#30#, 16#08#, 16#06#, 16#01#, 16#00#, 16#C0#, 16#20#, 16#18#, 16#06#, 16#03#, 16#00#, 16#03#, 16#81#, 16#C8#, 16#71#, 16#1C#, 16#33#, 16#86#, 16#E1#, 16#DC#, 16#3B#, 16#87#, 16#E0#, 16#FC#, 16#3B#, 16#87#, 16#70#, 16#EC#, 16#39#, 16#87#, 16#31#, 16#C2#, 16#30#, 16#3C#, 16#00#, 16#01#, 16#C3#, 16#F0#, 16#38#, 16#0E#, 16#03#, 16#81#, 16#C0#, 16#70#, 16#1C#, 16#07#, 16#03#, 16#80#, 16#E0#, 16#38#, 16#1C#, 16#07#, 16#01#, 16#C0#, 16#F0#, 16#FF#, 16#80#, 16#07#, 16#81#, 16#F8#, 16#47#, 16#90#, 16#70#, 16#0E#, 16#01#, 16#C0#, 16#30#, 16#0E#, 16#01#, 16#80#, 16#60#, 16#18#, 16#06#, 16#01#, 16#80#, 16#40#, 16#8F#, 16#E3#, 16#FC#, 16#FF#, 16#80#, 16#07#, 16#C3#, 16#3C#, 16#03#, 16#80#, 16#70#, 16#0C#, 16#03#, 16#81#, 16#C0#, 16#FC#, 16#07#, 16#C0#, 16#78#, 16#07#, 16#00#, 16#E0#, 16#1C#, 16#03#, 16#30#, 16#E7#, 16#10#, 16#7C#, 16#00#, 16#00#, 16#10#, 16#01#, 16#80#, 16#3C#, 16#02#, 16#E0#, 16#2E#, 16#02#, 16#70#, 16#23#, 16#82#, 16#38#, 16#21#, 16#C2#, 16#0E#, 16#1F#, 16#F9#, 16#FF#, 16#C0#, 16#38#, 16#01#, 16#C0#, 16#1C#, 16#00#, 16#E0#, 16#07#, 16#F0#, 16#7E#, 16#07#, 16#E0#, 16#80#, 16#08#, 16#01#, 16#E0#, 16#1F#, 16#83#, 16#F8#, 16#03#, 16#C0#, 16#1C#, 16#00#, 16#C0#, 16#0C#, 16#00#, 16#C0#, 16#08#, 16#61#, 16#8F#, 16#30#, 16#7C#, 16#00#, 16#00#, 16#60#, 16#78#, 16#1C#, 16#0F#, 16#01#, 16#C0#, 16#70#, 16#1F#, 16#C3#, 16#8C#, 16#E1#, 16#DC#, 16#3B#, 16#87#, 16#61#, 16#EC#, 16#3D#, 16#87#, 16#31#, 16#E2#, 16#38#, 16#3C#, 16#00#, 16#3F#, 16#EF#, 16#F9#, 16#FF#, 16#60#, 16#C8#, 16#10#, 16#06#, 16#00#, 16#80#, 16#30#, 16#0C#, 16#01#, 16#80#, 16#60#, 16#18#, 16#03#, 16#00#, 16#C0#, 16#18#, 16#06#, 16#00#, 16#03#, 16#81#, 16#88#, 16#61#, 16#8C#, 16#31#, 16#86#, 16#38#, 16#C7#, 16#B0#, 16#78#, 16#0F#, 16#86#, 16#71#, 16#87#, 16#60#, 16#6C#, 16#0D#, 16#81#, 16#B0#, 16#63#, 16#18#, 16#3E#, 16#00#, 16#07#, 16#81#, 16#C8#, 16#71#, 16#8E#, 16#33#, 16#C6#, 16#70#, 16#CE#, 16#39#, 16#C7#, 16#38#, 16#E3#, 16#38#, 16#3F#, 16#01#, 16#C0#, 16#38#, 16#0E#, 16#03#, 16#81#, 16#C0#, 16#E0#, 16#00#, 16#0C#, 16#3C#, 16#78#, 16#60#, 16#00#, 16#00#, 16#00#, 16#61#, 16#E3#, 16#C3#, 16#00#, 16#0E#, 16#0F#, 16#0F#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#38#, 16#38#, 16#18#, 16#10#, 16#20#, 16#40#, 16#00#, 16#10#, 16#07#, 16#01#, 16#F0#, 16#7C#, 16#3F#, 16#0F#, 16#80#, 16#E0#, 16#0F#, 16#80#, 16#3E#, 16#00#, 16#F8#, 16#03#, 16#E0#, 16#07#, 16#00#, 16#10#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#00#, 16#3F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#E0#, 16#1F#, 16#07#, 16#E0#, 16#F8#, 16#1F#, 16#01#, 16#E0#, 16#0C#, 16#00#, 16#00#, 16#1E#, 16#19#, 16#8C#, 16#E6#, 16#70#, 16#38#, 16#38#, 16#1C#, 16#18#, 16#18#, 16#08#, 16#08#, 16#00#, 16#00#, 16#03#, 16#03#, 16#C1#, 16#E0#, 16#60#, 16#00#, 16#03#, 16#F0#, 16#07#, 16#06#, 16#06#, 16#00#, 16#86#, 16#0E#, 16#66#, 16#0D#, 16#DB#, 16#0C#, 16#E7#, 16#06#, 16#33#, 16#83#, 16#31#, 16#C3#, 16#18#, 16#E1#, 16#8C#, 16#70#, 16#CC#, 16#4C#, 16#66#, 16#46#, 16#1F#, 16#C1#, 16#80#, 16#00#, 16#30#, 16#10#, 16#07#, 16#F0#, 16#00#, 16#10#, 16#00#, 16#30#, 16#00#, 16#70#, 16#00#, 16#70#, 16#00#, 16#F0#, 16#01#, 16#F8#, 16#01#, 16#78#, 16#03#, 16#78#, 16#02#, 16#38#, 16#04#, 16#38#, 16#0C#, 16#38#, 16#0F#, 16#FC#, 16#18#, 16#3C#, 16#30#, 16#3C#, 16#20#, 16#3C#, 16#60#, 16#3C#, 16#F8#, 16#7F#, 16#1F#, 16#FC#, 16#07#, 16#9E#, 16#07#, 16#0F#, 16#07#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#1E#, 16#0E#, 16#3C#, 16#0F#, 16#E0#, 16#1E#, 16#3C#, 16#1E#, 16#1E#, 16#1C#, 16#1E#, 16#3C#, 16#1E#, 16#3C#, 16#1E#, 16#3C#, 16#3E#, 16#38#, 16#3C#, 16#7C#, 16#78#, 16#FF#, 16#E0#, 16#01#, 16#F2#, 16#0E#, 16#1C#, 16#38#, 16#18#, 16#E0#, 16#33#, 16#C0#, 16#4F#, 16#00#, 16#9E#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#04#, 16#1E#, 16#30#, 16#0F#, 16#80#, 16#1F#, 16#FC#, 16#01#, 16#E3#, 16#C0#, 16#70#, 16#78#, 16#1C#, 16#0E#, 16#0F#, 16#03#, 16#C3#, 16#C0#, 16#F0#, 16#E0#, 16#3C#, 16#38#, 16#0F#, 16#1E#, 16#03#, 16#C7#, 16#81#, 16#F1#, 16#C0#, 16#78#, 16#F0#, 16#1E#, 16#3C#, 16#0F#, 16#0F#, 16#03#, 16#C3#, 16#81#, 16#C1#, 16#E1#, 16#E0#, 16#FF#, 16#E0#, 16#00#, 16#1F#, 16#FF#, 16#83#, 16#C1#, 16#C1#, 16#C0#, 16#40#, 16#E0#, 16#20#, 16#70#, 16#00#, 16#78#, 16#C0#, 16#38#, 16#40#, 16#1F#, 16#E0#, 16#1E#, 16#70#, 16#0F#, 16#18#, 16#07#, 16#08#, 16#03#, 16#84#, 16#03#, 16#C0#, 16#61#, 16#E0#, 16#20#, 16#E0#, 16#30#, 16#F8#, 16#78#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#07#, 16#87#, 16#07#, 16#02#, 16#07#, 16#02#, 16#07#, 16#00#, 16#0F#, 16#18#, 16#0E#, 16#10#, 16#0F#, 16#F0#, 16#1E#, 16#70#, 16#1E#, 16#30#, 16#1C#, 16#20#, 16#1C#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#38#, 16#00#, 16#7C#, 16#00#, 16#FE#, 16#00#, 16#01#, 16#F9#, 16#03#, 16#C3#, 16#83#, 16#81#, 16#83#, 16#80#, 16#43#, 16#C0#, 16#23#, 16#C0#, 16#01#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#F0#, 16#3F#, 16#F8#, 16#0F#, 16#3C#, 16#07#, 16#9E#, 16#03#, 16#CF#, 16#01#, 16#C3#, 16#80#, 16#E1#, 16#E0#, 16#F0#, 16#78#, 16#70#, 16#0F#, 16#E0#, 16#00#, 16#1F#, 16#E7#, 16#F0#, 16#78#, 16#3C#, 16#07#, 16#83#, 16#C0#, 16#70#, 16#38#, 16#0F#, 16#03#, 16#80#, 16#F0#, 16#78#, 16#0E#, 16#07#, 16#80#, 16#E0#, 16#70#, 16#1F#, 16#FF#, 16#01#, 16#E0#, 16#F0#, 16#1C#, 16#0E#, 16#03#, 16#C0#, 16#E0#, 16#3C#, 16#1E#, 16#03#, 16#C1#, 16#E0#, 16#38#, 16#1E#, 16#07#, 16#C3#, 16#E0#, 16#FE#, 16#7F#, 16#00#, 16#1F#, 16#C1#, 16#E0#, 16#70#, 16#1C#, 16#07#, 16#03#, 16#C0#, 16#E0#, 16#38#, 16#1E#, 16#07#, 16#81#, 16#C0#, 16#70#, 16#3C#, 16#0F#, 16#03#, 16#81#, 16#F0#, 16#FE#, 16#00#, 16#01#, 16#FC#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#38#, 16#00#, 16#E0#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#E0#, 16#07#, 16#80#, 16#1E#, 16#0E#, 16#70#, 16#3B#, 16#C0#, 16#CE#, 16#01#, 16#F0#, 16#00#, 16#1F#, 16#EF#, 16#83#, 16#C1#, 16#81#, 16#C1#, 16#80#, 16#E1#, 16#80#, 16#F1#, 16#80#, 16#79#, 16#00#, 16#39#, 16#00#, 16#1F#, 16#80#, 16#1F#, 16#E0#, 16#0F#, 16#70#, 16#07#, 16#3C#, 16#07#, 16#8E#, 16#03#, 16#C7#, 16#81#, 16#E3#, 16#C0#, 16#E0#, 16#E0#, 16#F8#, 16#78#, 16#FE#, 16#FE#, 16#00#, 16#1F#, 16#E0#, 16#0F#, 16#00#, 16#1C#, 16#00#, 16#38#, 16#00#, 16#70#, 16#01#, 16#E0#, 16#03#, 16#80#, 16#07#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#00#, 16#70#, 16#00#, 16#E0#, 16#03#, 16#C0#, 16#27#, 16#00#, 16#CE#, 16#03#, 16#3C#, 16#1E#, 16#FF#, 16#FC#, 16#0F#, 16#80#, 16#7E#, 16#0F#, 16#00#, 16#F0#, 16#1E#, 16#03#, 16#E0#, 16#3C#, 16#0F#, 16#80#, 16#B8#, 16#17#, 16#01#, 16#70#, 16#5E#, 16#02#, 16#F1#, 16#BC#, 16#05#, 16#E2#, 16#70#, 16#13#, 16#C8#, 16#E0#, 16#23#, 16#B3#, 16#C0#, 16#47#, 16#47#, 16#81#, 16#0F#, 16#8E#, 16#02#, 16#1E#, 16#1C#, 16#04#, 16#38#, 16#78#, 16#08#, 16#70#, 16#F0#, 16#30#, 16#C3#, 16#E0#, 16#F9#, 16#0F#, 16#E0#, 16#1F#, 16#03#, 16#E0#, 16#F0#, 16#38#, 16#1E#, 16#02#, 16#03#, 16#E0#, 16#C0#, 16#BC#, 16#10#, 16#13#, 16#C2#, 16#02#, 16#78#, 16#40#, 16#47#, 16#90#, 16#10#, 16#F2#, 16#02#, 16#0F#, 16#40#, 16#41#, 16#E8#, 16#10#, 16#1E#, 16#02#, 16#03#, 16#C0#, 16#40#, 16#38#, 16#08#, 16#06#, 16#03#, 16#00#, 16#40#, 16#10#, 16#08#, 16#00#, 16#01#, 16#F8#, 16#07#, 16#1C#, 16#0E#, 16#0E#, 16#1E#, 16#0F#, 16#3C#, 16#0F#, 16#3C#, 16#0F#, 16#78#, 16#0F#, 16#78#, 16#0F#, 16#F8#, 16#1F#, 16#F0#, 16#1E#, 16#F0#, 16#1E#, 16#F0#, 16#3C#, 16#F0#, 16#3C#, 16#F0#, 16#78#, 16#70#, 16#70#, 16#38#, 16#E0#, 16#1F#, 16#80#, 16#1F#, 16#FC#, 16#07#, 16#9E#, 16#07#, 16#0F#, 16#07#, 16#0F#, 16#07#, 16#0F#, 16#0F#, 16#0F#, 16#0E#, 16#1E#, 16#0E#, 16#3C#, 16#1F#, 16#F0#, 16#1E#, 16#00#, 16#1C#, 16#00#, 16#1C#, 16#00#, 16#3C#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#, 16#7C#, 16#00#, 16#FE#, 16#00#, 16#01#, 16#F8#, 16#07#, 16#1C#, 16#0E#, 16#0E#, 16#1E#, 16#0F#, 16#3C#, 16#0F#, 16#3C#, 16#0F#, 16#78#, 16#0F#, 16#78#, 16#1F#, 16#F8#, 16#1F#, 16#F0#, 16#1E#, 16#F0#, 16#1E#, 16#F0#, 16#3C#, 16#F0#, 16#3C#, 16#F0#, 16#78#, 16#70#, 16#70#, 16#39#, 16#C0#, 16#0E#, 16#00#, 16#08#, 16#02#, 16#3F#, 16#04#, 16#7F#, 16#F8#, 16#83#, 16#F0#, 16#1F#, 16#F8#, 16#07#, 16#9E#, 16#07#, 16#8F#, 16#07#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#0F#, 16#1E#, 16#0E#, 16#3C#, 16#1F#, 16#F0#, 16#1E#, 16#F0#, 16#1C#, 16#F0#, 16#3C#, 16#F0#, 16#3C#, 16#78#, 16#3C#, 16#78#, 16#3C#, 16#78#, 16#7C#, 16#3C#, 16#FE#, 16#3E#, 16#07#, 16#91#, 16#C7#, 16#18#, 16#63#, 16#82#, 16#38#, 16#23#, 16#C0#, 16#3E#, 16#01#, 16#F0#, 16#0F#, 16#80#, 16#7C#, 16#01#, 16#E0#, 16#1E#, 16#40#, 16#E4#, 16#0E#, 16#60#, 16#CE#, 16#1C#, 16#9F#, 16#00#, 16#7F#, 16#FE#, 16#E7#, 16#9D#, 16#0E#, 16#16#, 16#3C#, 16#20#, 16#78#, 16#40#, 16#E0#, 16#01#, 16#C0#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#1C#, 16#00#, 16#38#, 16#00#, 16#F0#, 16#01#, 16#C0#, 16#03#, 16#80#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#FF#, 16#00#, 16#7F#, 16#1F#, 16#3C#, 16#0E#, 16#38#, 16#04#, 16#38#, 16#0C#, 16#78#, 16#08#, 16#78#, 16#08#, 16#70#, 16#08#, 16#70#, 16#10#, 16#F0#, 16#10#, 16#F0#, 16#10#, 16#F0#, 16#10#, 16#F0#, 16#20#, 16#F0#, 16#20#, 16#F0#, 16#20#, 16#F0#, 16#40#, 16#78#, 16#C0#, 16#3F#, 16#00#, 16#FF#, 16#1F#, 16#3C#, 16#06#, 16#3C#, 16#04#, 16#3C#, 16#08#, 16#3C#, 16#08#, 16#3C#, 16#10#, 16#3C#, 16#20#, 16#1C#, 16#20#, 16#1E#, 16#40#, 16#1E#, 16#80#, 16#1E#, 16#80#, 16#1F#, 16#00#, 16#1E#, 16#00#, 16#0C#, 16#00#, 16#0C#, 16#00#, 16#08#, 16#00#, 16#FE#, 16#7C#, 16#79#, 16#E1#, 16#C1#, 16#8F#, 16#0E#, 16#08#, 16#78#, 16#70#, 16#43#, 16#C7#, 16#84#, 16#1E#, 16#3E#, 16#20#, 16#F2#, 16#F2#, 16#03#, 16#97#, 16#90#, 16#1D#, 16#3D#, 16#00#, 16#E8#, 16#E8#, 16#07#, 16#87#, 16#80#, 16#3C#, 16#38#, 16#01#, 16#C1#, 16#C0#, 16#0E#, 16#0C#, 16#00#, 16#20#, 16#60#, 16#01#, 16#02#, 16#00#, 16#1F#, 16#CF#, 16#83#, 16#C1#, 16#81#, 16#E1#, 16#80#, 16#71#, 16#80#, 16#39#, 16#80#, 16#1F#, 16#80#, 16#0F#, 16#00#, 16#03#, 16#80#, 16#01#, 16#E0#, 16#01#, 16#F0#, 16#00#, 16#B8#, 16#00#, 16#9E#, 16#00#, 16#8F#, 16#00#, 16#83#, 16#80#, 16#C1#, 16#C0#, 16#E0#, 16#F0#, 16#F9#, 16#FE#, 16#00#, 16#FE#, 16#7C#, 16#E0#, 16#63#, 16#81#, 16#0F#, 16#08#, 16#1C#, 16#40#, 16#71#, 16#01#, 16#E8#, 16#03#, 16#C0#, 16#0E#, 16#00#, 16#38#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#1C#, 16#00#, 16#70#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#FF#, 16#00#, 16#1F#, 16#FE#, 16#38#, 16#78#, 16#60#, 16#F1#, 16#83#, 16#C2#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#47#, 16#81#, 16#1E#, 16#06#, 16#3C#, 16#3C#, 16#FF#, 16#F0#, 16#07#, 16#C1#, 16#80#, 16#E0#, 16#30#, 16#0C#, 16#03#, 16#01#, 16#C0#, 16#60#, 16#18#, 16#06#, 16#03#, 16#80#, 16#C0#, 16#30#, 16#0C#, 16#07#, 16#01#, 16#C0#, 16#60#, 16#18#, 16#0E#, 16#03#, 16#E0#, 16#C3#, 16#06#, 16#18#, 16#61#, 16#83#, 16#0C#, 16#30#, 16#C1#, 16#86#, 16#18#, 16#60#, 16#C3#, 16#0F#, 16#81#, 16#C0#, 16#E0#, 16#60#, 16#30#, 16#18#, 16#1C#, 16#0C#, 16#06#, 16#03#, 16#03#, 16#81#, 16#80#, 16#C0#, 16#60#, 16#70#, 16#38#, 16#18#, 16#0C#, 16#0E#, 16#1F#, 16#00#, 16#0C#, 16#07#, 16#81#, 16#E0#, 16#DC#, 16#33#, 16#18#, 16#C6#, 16#1B#, 16#06#, 16#C0#, 16#C0#, 16#FF#, 16#F0#, 16#C7#, 16#0C#, 16#30#, 16#07#, 16#70#, 16#CE#, 16#1C#, 16#E3#, 16#8E#, 16#70#, 16#C7#, 16#0C#, 16#71#, 16#CE#, 16#1C#, 16#E1#, 16#8E#, 16#79#, 16#E9#, 16#A7#, 16#1C#, 16#02#, 16#07#, 16#C0#, 16#38#, 16#06#, 16#01#, 16#C0#, 16#38#, 16#06#, 16#71#, 16#F7#, 16#38#, 16#E7#, 16#1C#, 16#C3#, 16#B8#, 16#77#, 16#1C#, 16#E3#, 16#B8#, 16#E7#, 16#18#, 16#E6#, 16#0F#, 16#80#, 16#07#, 16#0C#, 16#CE#, 16#66#, 16#07#, 16#03#, 16#83#, 16#81#, 16#C0#, 16#E0#, 16#70#, 16#BC#, 16#87#, 16#80#, 16#00#, 16#08#, 16#03#, 16#E0#, 16#03#, 16#80#, 16#0E#, 16#00#, 16#70#, 16#01#, 16#C0#, 16#77#, 16#03#, 16#38#, 16#18#, 16#E0#, 16#E3#, 16#87#, 16#0E#, 16#1C#, 16#70#, 16#71#, 16#C3#, 16#87#, 16#0E#, 16#3C#, 16#38#, 16#E8#, 16#E5#, 16#A1#, 16#E7#, 16#00#, 16#07#, 16#0C#, 16#CE#, 16#66#, 16#37#, 16#33#, 16#BB#, 16#B1#, 16#E0#, 16#E0#, 16#70#, 16#B8#, 16#87#, 16#80#, 16#00#, 16#38#, 16#01#, 16#B0#, 16#0C#, 16#C0#, 16#30#, 16#01#, 16#C0#, 16#07#, 16#00#, 16#7E#, 16#00#, 16#E0#, 16#03#, 16#80#, 16#0E#, 16#00#, 16#30#, 16#01#, 16#C0#, 16#07#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#03#, 16#80#, 16#0E#, 16#00#, 16#38#, 16#00#, 16#C0#, 16#33#, 16#00#, 16#D8#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#73#, 16#C7#, 16#1C#, 16#38#, 16#E1#, 16#CF#, 16#06#, 16#70#, 16#1E#, 16#01#, 16#00#, 16#1C#, 16#00#, 16#F8#, 16#07#, 16#F0#, 16#C7#, 16#8C#, 16#0C#, 16#60#, 16#63#, 16#86#, 16#07#, 16#E0#, 16#01#, 16#00#, 16#F8#, 16#01#, 16#80#, 16#1C#, 16#00#, 16#E0#, 16#07#, 16#00#, 16#31#, 16#C3#, 16#BE#, 16#1E#, 16#70#, 16#E3#, 16#8F#, 16#38#, 16#71#, 16#C3#, 16#8E#, 16#1C#, 16#E1#, 16#C7#, 16#0E#, 16#3A#, 16#71#, 16#D3#, 16#0F#, 16#00#, 16#1C#, 16#71#, 16#C0#, 16#00#, 16#6F#, 16#8E#, 16#31#, 16#C7#, 16#18#, 16#63#, 16#8E#, 16#BC#, 16#E0#, 16#00#, 16#E0#, 16#1C#, 16#03#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#70#, 16#0E#, 16#01#, 16#C0#, 16#30#, 16#0E#, 16#01#, 16#C0#, 16#30#, 16#0E#, 16#01#, 16#C0#, 16#38#, 16#06#, 16#01#, 16#C3#, 16#38#, 16#6E#, 16#07#, 16#80#, 16#01#, 16#00#, 16#F8#, 16#01#, 16#C0#, 16#0C#, 16#00#, 16#E0#, 16#07#, 16#00#, 16#33#, 16#E1#, 16#8C#, 16#1C#, 16#C0#, 16#E4#, 16#06#, 16#40#, 16#7E#, 16#03#, 16#F0#, 16#1D#, 16#81#, 16#CE#, 16#0E#, 16#72#, 16#71#, 16#A3#, 16#8E#, 16#00#, 16#06#, 16#7C#, 16#70#, 16#E1#, 16#C3#, 16#0E#, 16#1C#, 16#30#, 16#61#, 16#C3#, 16#86#, 16#0C#, 16#38#, 16#72#, 16#E9#, 16#E0#, 16#3C#, 16#73#, 16#C7#, 16#7D#, 16#71#, 16#E7#, 16#9C#, 16#F1#, 16#CE#, 16#3C#, 16#F3#, 16#8E#, 16#39#, 16#C3#, 16#8E#, 16#70#, 16#C3#, 16#1C#, 16#71#, 16#C7#, 16#1C#, 16#71#, 16#D7#, 16#1C#, 16#7B#, 16#8E#, 16#1C#, 16#3C#, 16#F1#, 16#D7#, 16#1E#, 16#73#, 16#CE#, 16#3C#, 16#E3#, 16#8E#, 16#39#, 16#C7#, 16#9C#, 16#71#, 16#C7#, 16#1D#, 16#71#, 16#EE#, 16#1C#, 16#0F#, 16#06#, 16#63#, 16#9D#, 16#C7#, 16#71#, 16#F8#, 16#7E#, 16#3F#, 16#8E#, 16#E3#, 16#B9#, 16#C6#, 16#60#, 16#F0#, 16#0F#, 16#38#, 16#1F#, 16#70#, 16#71#, 16#C1#, 16#C7#, 16#0E#, 16#1C#, 16#38#, 16#F0#, 16#E3#, 16#83#, 16#8E#, 16#1C#, 16#70#, 16#71#, 16#C1#, 16#CE#, 16#07#, 16#E0#, 16#38#, 16#00#, 16#E0#, 16#03#, 16#80#, 16#3F#, 16#00#, 16#07#, 16#70#, 16#CE#, 16#18#, 16#E3#, 16#8E#, 16#70#, 16#E7#, 16#1C#, 16#F1#, 16#CE#, 16#1C#, 16#E3#, 16#8E#, 16#38#, 16#E7#, 16#87#, 16#B0#, 16#07#, 16#00#, 16#70#, 16#0F#, 16#03#, 16#F8#, 16#0D#, 16#DF#, 16#71#, 16#AC#, 16#F0#, 16#38#, 16#0E#, 16#03#, 16#81#, 16#C0#, 16#70#, 16#1C#, 16#0E#, 16#00#, 16#1D#, 16#99#, 16#8C#, 16#46#, 16#23#, 16#80#, 16#E0#, 16#70#, 16#1C#, 16#06#, 16#23#, 16#19#, 16#17#, 16#00#, 16#0C#, 16#10#, 16#E3#, 16#F3#, 16#86#, 16#1C#, 16#38#, 16#71#, 16#C3#, 16#87#, 16#0E#, 16#9E#, 16#38#, 16#00#, 16#F8#, 16#E3#, 16#8E#, 16#38#, 16#C3#, 16#9C#, 16#71#, 16#C7#, 16#18#, 16#71#, 16#86#, 16#38#, 16#E3#, 16#8E#, 16#FA#, 16#F3#, 16#AE#, 16#3C#, 16#F0#, 16#DC#, 16#33#, 16#0C#, 16#C2#, 16#31#, 16#8C#, 16#C3#, 16#60#, 16#F0#, 16#38#, 16#0C#, 16#02#, 16#00#, 16#E0#, 16#86#, 16#E3#, 16#0C#, 16#C6#, 16#19#, 16#9C#, 16#23#, 16#78#, 16#C7#, 16#F9#, 16#0E#, 16#74#, 16#1C#, 16#F0#, 16#31#, 16#C0#, 16#43#, 16#00#, 16#84#, 16#00#, 16#0E#, 16#31#, 16#F3#, 16#83#, 16#A0#, 16#0E#, 16#00#, 16#70#, 16#03#, 16#80#, 16#1C#, 16#00#, 16#E0#, 16#0B#, 16#02#, 16#5D#, 16#3C#, 16#F1#, 16#C3#, 16#00#, 16#04#, 16#67#, 16#8C#, 16#79#, 16#87#, 16#10#, 16#E2#, 16#1C#, 16#81#, 16#90#, 16#3A#, 16#07#, 16#80#, 16#F0#, 16#1C#, 16#03#, 16#00#, 16#40#, 16#08#, 16#32#, 16#07#, 16#80#, 16#3F#, 16#CF#, 16#E6#, 16#30#, 16#08#, 16#04#, 16#02#, 16#01#, 16#00#, 16#C0#, 16#30#, 16#1E#, 16#0F#, 16#98#, 16#76#, 16#07#, 16#00#, 16#01#, 16#E0#, 16#70#, 16#1C#, 16#03#, 16#80#, 16#60#, 16#1C#, 16#03#, 16#80#, 16#60#, 16#0C#, 16#03#, 16#80#, 16#F0#, 16#3C#, 16#07#, 16#00#, 16#40#, 16#0C#, 16#01#, 16#80#, 16#70#, 16#0E#, 16#01#, 16#C0#, 16#30#, 16#03#, 16#80#, 16#FF#, 16#FF#, 16#FF#, 16#FF#, 16#07#, 16#00#, 16#E0#, 16#18#, 16#06#, 16#01#, 16#80#, 16#E0#, 16#38#, 16#0C#, 16#03#, 16#00#, 16#C0#, 16#10#, 16#1F#, 16#07#, 16#03#, 16#80#, 16#E0#, 16#30#, 16#0C#, 16#07#, 16#01#, 16#80#, 16#E0#, 16#E0#, 16#00#, 16#38#, 16#0F#, 16#CD#, 16#1F#, 16#80#, 16#E0#); FreeSerifBoldItalic12pt7bGlyphs : aliased constant Glyph_Array := ( (0, 0, 0, 6, 0, 1), -- 0x20 ' ' (0, 8, 17, 9, 2, -15), -- 0x21 '!' (17, 9, 7, 13, 4, -15), -- 0x22 '"' (25, 14, 16, 12, -1, -15), -- 0x23 '#' (53, 12, 20, 12, 0, -17), -- 0x24 '$' (83, 18, 18, 20, 1, -16), -- 0x25 '%' (124, 16, 17, 19, 0, -15), -- 0x26 '&' (158, 3, 7, 7, 3, -15), -- 0x27 ''' (161, 7, 21, 8, 1, -15), -- 0x28 '(' (180, 7, 21, 8, -1, -15), -- 0x29 ')' (199, 10, 10, 12, 1, -15), -- 0x2A '*' (212, 12, 12, 14, 1, -11), -- 0x2B '+' (230, 5, 8, 6, -2, -3), -- 0x2C ',' (235, 6, 3, 8, 0, -6), -- 0x2D '-' (238, 4, 4, 6, 0, -2), -- 0x2E '.' (240, 10, 16, 8, 0, -15), -- 0x2F '/' (260, 11, 17, 12, 0, -15), -- 0x30 '0' (284, 10, 17, 12, 0, -15), -- 0x31 '1' (306, 11, 17, 12, 0, -15), -- 0x32 '2' (330, 11, 17, 12, 0, -15), -- 0x33 '3' (354, 13, 16, 12, 0, -15), -- 0x34 '4' (380, 12, 17, 12, 0, -15), -- 0x35 '5' (406, 11, 17, 12, 1, -15), -- 0x36 '6' (430, 11, 16, 12, 2, -15), -- 0x37 '7' (452, 11, 17, 12, 0, -15), -- 0x38 '8' (476, 11, 17, 12, 0, -15), -- 0x39 '9' (500, 7, 12, 6, 0, -10), -- 0x3A ':' (511, 8, 15, 6, -1, -10), -- 0x3B ';' (526, 12, 13, 14, 1, -12), -- 0x3C '<' (546, 12, 6, 14, 2, -8), -- 0x3D '=' (555, 13, 13, 14, 1, -12), -- 0x3E '>' (577, 9, 17, 12, 2, -15), -- 0x3F '?' (597, 17, 16, 20, 1, -15), -- 0x40 '@' (631, 16, 17, 17, 0, -15), -- 0x41 'A' (665, 16, 17, 15, 0, -15), -- 0x42 'B' (699, 15, 17, 15, 1, -15), -- 0x43 'C' (731, 18, 17, 17, 0, -15), -- 0x44 'D' (770, 17, 17, 15, 0, -15), -- 0x45 'E' (807, 16, 17, 15, 0, -15), -- 0x46 'F' (841, 17, 17, 17, 1, -15), -- 0x47 'G' (878, 20, 17, 18, 0, -15), -- 0x48 'H' (921, 10, 17, 9, 0, -15), -- 0x49 'I' (943, 14, 18, 12, 0, -15), -- 0x4A 'J' (975, 17, 17, 16, 0, -15), -- 0x4B 'K' (1012, 15, 17, 15, 0, -15), -- 0x4C 'L' (1044, 23, 17, 21, 0, -15), -- 0x4D 'M' (1093, 19, 17, 17, 0, -15), -- 0x4E 'N' (1134, 16, 17, 16, 1, -15), -- 0x4F 'O' (1168, 16, 17, 14, 0, -15), -- 0x50 'P' (1202, 16, 21, 16, 1, -15), -- 0x51 'Q' (1244, 16, 17, 16, 0, -15), -- 0x52 'R' (1278, 12, 17, 12, 0, -15), -- 0x53 'S' (1304, 15, 17, 14, 2, -15), -- 0x54 'T' (1336, 16, 17, 17, 3, -15), -- 0x55 'U' (1370, 16, 16, 17, 3, -15), -- 0x56 'V' (1402, 21, 16, 22, 3, -15), -- 0x57 'W' (1444, 17, 17, 17, 0, -15), -- 0x58 'X' (1481, 14, 17, 15, 3, -15), -- 0x59 'Y' (1511, 15, 17, 13, 0, -15), -- 0x5A 'Z' (1543, 10, 20, 8, -1, -15), -- 0x5B '[' (1568, 6, 16, 10, 3, -15), -- 0x5C '\' (1580, 9, 20, 8, -1, -15), -- 0x5D ']' (1603, 10, 9, 14, 2, -15), -- 0x5E '^' (1615, 12, 1, 12, 0, 4), -- 0x5F '_' (1617, 5, 4, 8, 2, -15), -- 0x60 '`' (1620, 12, 12, 12, 0, -10), -- 0x61 'a' (1638, 11, 18, 12, 1, -16), -- 0x62 'b' (1663, 9, 12, 10, 1, -10), -- 0x63 'c' (1677, 14, 18, 12, 0, -16), -- 0x64 'd' (1709, 9, 12, 10, 1, -10), -- 0x65 'e' (1723, 14, 22, 12, -2, -16), -- 0x66 'f' (1762, 13, 16, 12, -1, -10), -- 0x67 'g' (1788, 13, 18, 13, 0, -16), -- 0x68 'h' (1818, 6, 17, 7, 1, -15), -- 0x69 'i' (1831, 11, 21, 8, -2, -15), -- 0x6A 'j' (1860, 13, 18, 12, 0, -16), -- 0x6B 'k' (1890, 7, 18, 7, 1, -16), -- 0x6C 'l' (1906, 18, 12, 18, 0, -10), -- 0x6D 'm' (1933, 12, 12, 13, 0, -10), -- 0x6E 'n' (1951, 10, 12, 11, 1, -10), -- 0x6F 'o' (1966, 14, 16, 12, -2, -10), -- 0x70 'p' (1994, 12, 16, 12, 0, -10), -- 0x71 'q' (2018, 10, 11, 10, 0, -10), -- 0x72 'r' (2032, 9, 12, 9, 0, -10), -- 0x73 's' (2046, 7, 15, 7, 1, -13), -- 0x74 't' (2060, 12, 12, 13, 1, -10), -- 0x75 'u' (2078, 10, 11, 11, 1, -10), -- 0x76 'v' (2092, 15, 11, 16, 1, -10), -- 0x77 'w' (2113, 13, 12, 11, -1, -10), -- 0x78 'x' (2133, 11, 16, 10, -1, -10), -- 0x79 'y' (2155, 10, 13, 10, 0, -10), -- 0x7A 'z' (2172, 11, 21, 8, 0, -16), -- 0x7B '{' (2201, 2, 16, 6, 3, -15), -- 0x7C '|' (2205, 10, 21, 8, -3, -16), -- 0x7D '}' (2232, 11, 4, 14, 1, -7)); -- 0x7E '~' Font_D : aliased constant Bitmap_Font := (FreeSerifBoldItalic12pt7bBitmaps'Access, FreeSerifBoldItalic12pt7bGlyphs'Access, 28); Font : constant Giza.Font.Ref_Const := Font_D'Access; end Giza.Bitmap_Fonts.FreeSerifBoldItalic12pt7b;
-- -- Copyright (C) 2017 Iru Cai <mytbk920423@gmail.com> -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 2 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- with HW.GFX.GMA; with HW.GFX.GMA.Display_Probing; use HW.GFX.GMA; use HW.GFX.GMA.Display_Probing; private package GMA.Mainboard is ports : constant Port_List := (HDMI1, -- mainboard DVI port HDMI3, -- mainboard HDMI port Analog, others => Disabled); end GMA.Mainboard;
with Ada.Iterator_Interfaces; with Protypo.Api.Engine_Values.Handlers; generic type Cursor is private; with function Has_Element (Position : Cursor) return Boolean; with function Element (Position : Cursor) return Engine_Value; with package Basic_Iterators is new Ada.Iterator_Interfaces (Cursor => Cursor, Has_Element => Has_Element); package Protypo.Api.Engine_Values.Iterator_Wrappers is type Iterator_Wrapper is new Handlers.Iterator_Interface with private; type Iterator_Wrapper_Access is access Iterator_Wrapper; type Basic_Iterator_Access is access all Basic_Iterators.Reversible_Iterator'Class; function Make_Wrapper (Iter : Basic_Iterator_Access) return Iterator_Wrapper_Access; procedure Reset (Iter : in out Iterator_Wrapper); procedure Next (Iter : in out Iterator_Wrapper); function End_Of_Iteration (Iter : Iterator_Wrapper) return Boolean; function Element (Iter : Iterator_Wrapper) return Handler_Value; private type Iterator_Wrapper is new Handlers.Iterator_Interface with record Iterator : Basic_Iterator_Access; Position : Cursor; end record; end Protypo.Api.Engine_Values.Iterator_Wrappers;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . T R A C E B A C K . S Y M B O L I C -- -- -- -- S p e c -- -- -- -- Copyright (C) 1999-2020, 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. -- -- -- ------------------------------------------------------------------------------ -- Run-time symbolic traceback support -- The full capability is currently supported on the following targets: -- GNU/Linux x86, x86_64, ia64 -- Note: on targets other than those listed above, a dummy implementation -- of the body returns a series of LF separated strings of the form "0x..." -- corresponding to the addresses. -- The routines provided in this package assume that your application has been -- compiled with debugging information turned on, since this information is -- used to build a symbolic traceback. -- If you want to retrieve tracebacks from exception occurrences, it is also -- necessary to invoke the binder with -E switch. Please refer to the gnatbind -- documentation for more information. -- Note that it is also possible (and often recommended) to compute symbolic -- traceback outside the program execution, which in addition allows you to -- distribute the executable with no debug info: -- -- - build your executable with debug info -- - archive this executable -- - strip a copy of the executable and distribute/deploy this version -- - at run time, compute absolute traceback (-bargs -E) from your -- executable and log it using Ada.Exceptions.Exception_Information -- - off line, compute the symbolic traceback using the executable archived -- with debug info and addr2line or gdb (using info line *<addr>) on the -- absolute addresses logged by your application. -- In order to retrieve symbolic information, functions in this package will -- read on disk all the debug information of the executable file (found via -- Argument (0), and looked in the PATH if needed) or shared libraries using -- OS facilities, and load them in memory, causing a significant cpu and -- memory overhead. -- Symbolic traceback from shared libraries is only supported for Windows and -- Linux. On other targets symbolic tracebacks are only supported for the main -- executable. You should consider using gdb to obtain symbolic traceback in -- such cases. with Ada.Exceptions; package System.Traceback.Symbolic is pragma Elaborate_Body; function Symbolic_Traceback (Traceback : System.Traceback_Entries.Tracebacks_Array) return String; function Symbolic_Traceback_No_Hex (Traceback : System.Traceback_Entries.Tracebacks_Array) return String; -- Build a string containing a symbolic traceback of the given call -- chain. Note: These procedures may be installed by Set_Trace_Decorator, -- to get a symbolic traceback on all exceptions raised (see -- System.Exception_Traces). function Symbolic_Traceback (E : Ada.Exceptions.Exception_Occurrence) return String; function Symbolic_Traceback_No_Hex (E : Ada.Exceptions.Exception_Occurrence) return String; -- Build string containing symbolic traceback of given exception occurrence -- In the above, _No_Hex means do not print any hexadecimal addresses, even -- if the symbol is not available. This is useful for getting deterministic -- output from tests. procedure Enable_Cache (Include_Modules : Boolean := False); -- Read symbolic information from binary files and cache them in memory. -- This will speed up the above functions but will require more memory. If -- Include_Modules is true, shared modules (or DLL) will also be cached. -- This procedure may do nothing if not supported. The profile of this -- subprogram may change in the future (new parameters can be added -- with default value), but backward compatibility for direct calls -- is supported. end System.Traceback.Symbolic;
-------------------------------------------------------------------------------- -- * Prog name dfttest.adb -- * Project name dfttest -- * -- * Version 1.0 -- * Last update 11/9/08 -- * -- * Created by Adrian Hoe on 11/9/08. -- * Copyright (c) 2008 AdaStar Informatics http://adastarinformatics.com -- * All rights reserved. -- * -------------------------------------------------------------------------------- with Ada.Text_IO; With Ada.Float_Text_IO; with Dft; use Ada.Text_IO, Ada.Float_Text_IO; use Dft; procedure dfttest is Data : Value_Vector ( 1 .. 8 ); Result : Complex_Vector ( Data'Range ); begin Data := ( 0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0 ); Dft.Compute ( Data, Result ); for I in Result'Range loop Put ( Float ( Dft.Complex_Types.Modulus ( Result ( I ) ) ) , exp => 0 ); New_Line; end loop; end dfttest;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- U S A G E -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993,1994 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. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- Procedure to generate screen of usage information if no file name present procedure Usage;
-- Copyright 2007-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/>. with Pck; use Pck; procedure Foo is C : Character := 'a'; WC : Wide_Character := 'b'; WWC : Wide_Wide_Character := 'c'; begin Do_Nothing (C'Address); -- START Do_Nothing (WC'Address); Do_Nothing (WWC'Address); end Foo;
Pragma Ada_2012; Pragma Wide_Character_Encoding( UTF8 ); with Risi_Script.Types.Identifier.Scope_Package; Package Risi_Script.Types.Identifier.Scope is use Risi_Script.Types.Identifier.Scope_Package; Type Scope is new Vector with null record; Function "+"( Right : Scope ) Return Vector; Function "+"( Right : Vector ) Return Scope; Function Image( Input : Scope ) return String; Function Value( Input : String ) return Scope with Pre => Input(Input'First) /= '.' and Input(Input'Last) /= '.'; ----------------- -- Constants -- ----------------- Global : Constant Scope; Private Function "+"( Right : Scope ) Return Vector is ( Vector(Right) ); Function "+"( Right : Vector ) Return Scope is ( Right with null record ); Global : Constant Scope:= +Empty_Vector; End Risi_Script.Types.Identifier.Scope;
-- This spec has been automatically generated from STM32L4x3.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.NVIC is pragma Preelaborate; --------------- -- Registers -- --------------- -- IPR_IPR_N array element subtype IPR_IPR_N_Element is HAL.UInt8; -- IPR_IPR_N array type IPR_IPR_N_Field_Array is array (0 .. 3) of IPR_IPR_N_Element with Component_Size => 8, Size => 32; -- Interrupt Priority Register type IPR_Register (As_Array : Boolean := False) is record case As_Array is when False => -- IPR_N as a value Val : HAL.UInt32; when True => -- IPR_N as an array Arr : IPR_IPR_N_Field_Array; end case; end record with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for IPR_Register use record Val at 0 range 0 .. 31; Arr at 0 range 0 .. 31; end record; subtype STIR_INTID_Field is HAL.UInt9; -- Software trigger interrupt register type STIR_Register is record -- Software generated interrupt ID INTID : STIR_INTID_Field := 16#0#; -- unspecified Reserved_9_31 : HAL.UInt23 := 16#0#; end record with Volatile_Full_Access, Object_Size => 32, Bit_Order => System.Low_Order_First; for STIR_Register use record INTID at 0 range 0 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Nested Vectored Interrupt Controller type NVIC_Peripheral is record -- Interrupt Set-Enable Register ISER0 : aliased HAL.UInt32; -- Interrupt Set-Enable Register ISER1 : aliased HAL.UInt32; -- Interrupt Set-Enable Register ISER2 : aliased HAL.UInt32; -- Interrupt Clear-Enable Register ICER0 : aliased HAL.UInt32; -- Interrupt Clear-Enable Register ICER1 : aliased HAL.UInt32; -- Interrupt Clear-Enable Register ICER2 : aliased HAL.UInt32; -- Interrupt Set-Pending Register ISPR0 : aliased HAL.UInt32; -- Interrupt Set-Pending Register ISPR1 : aliased HAL.UInt32; -- Interrupt Set-Pending Register ISPR2 : aliased HAL.UInt32; -- Interrupt Clear-Pending Register ICPR0 : aliased HAL.UInt32; -- Interrupt Clear-Pending Register ICPR1 : aliased HAL.UInt32; -- Interrupt Clear-Pending Register ICPR2 : aliased HAL.UInt32; -- Interrupt Active Bit Register IABR0 : aliased HAL.UInt32; -- Interrupt Active Bit Register IABR1 : aliased HAL.UInt32; -- Interrupt Active Bit Register IABR2 : aliased HAL.UInt32; -- Interrupt Priority Register IPR0 : aliased IPR_Register; -- Interrupt Priority Register IPR1 : aliased IPR_Register; -- Interrupt Priority Register IPR2 : aliased IPR_Register; -- Interrupt Priority Register IPR3 : aliased IPR_Register; -- Interrupt Priority Register IPR4 : aliased IPR_Register; -- Interrupt Priority Register IPR5 : aliased IPR_Register; -- Interrupt Priority Register IPR6 : aliased IPR_Register; -- Interrupt Priority Register IPR7 : aliased IPR_Register; -- Interrupt Priority Register IPR8 : aliased IPR_Register; -- Interrupt Priority Register IPR9 : aliased IPR_Register; -- Interrupt Priority Register IPR10 : aliased IPR_Register; -- Interrupt Priority Register IPR11 : aliased IPR_Register; -- Interrupt Priority Register IPR12 : aliased IPR_Register; -- Interrupt Priority Register IPR13 : aliased IPR_Register; -- Interrupt Priority Register IPR14 : aliased IPR_Register; -- Interrupt Priority Register IPR15 : aliased IPR_Register; -- Interrupt Priority Register IPR16 : aliased IPR_Register; -- Interrupt Priority Register IPR17 : aliased IPR_Register; -- Interrupt Priority Register IPR18 : aliased IPR_Register; -- Interrupt Priority Register IPR19 : aliased IPR_Register; -- Interrupt Priority Register IPR20 : aliased IPR_Register; end record with Volatile; for NVIC_Peripheral use record ISER0 at 16#0# range 0 .. 31; ISER1 at 16#4# range 0 .. 31; ISER2 at 16#8# range 0 .. 31; ICER0 at 16#80# range 0 .. 31; ICER1 at 16#84# range 0 .. 31; ICER2 at 16#88# range 0 .. 31; ISPR0 at 16#100# range 0 .. 31; ISPR1 at 16#104# range 0 .. 31; ISPR2 at 16#108# range 0 .. 31; ICPR0 at 16#180# range 0 .. 31; ICPR1 at 16#184# range 0 .. 31; ICPR2 at 16#188# range 0 .. 31; IABR0 at 16#200# range 0 .. 31; IABR1 at 16#204# range 0 .. 31; IABR2 at 16#208# range 0 .. 31; IPR0 at 16#300# range 0 .. 31; IPR1 at 16#304# range 0 .. 31; IPR2 at 16#308# range 0 .. 31; IPR3 at 16#30C# range 0 .. 31; IPR4 at 16#310# range 0 .. 31; IPR5 at 16#314# range 0 .. 31; IPR6 at 16#318# range 0 .. 31; IPR7 at 16#31C# range 0 .. 31; IPR8 at 16#320# range 0 .. 31; IPR9 at 16#324# range 0 .. 31; IPR10 at 16#328# range 0 .. 31; IPR11 at 16#32C# range 0 .. 31; IPR12 at 16#330# range 0 .. 31; IPR13 at 16#334# range 0 .. 31; IPR14 at 16#338# range 0 .. 31; IPR15 at 16#33C# range 0 .. 31; IPR16 at 16#340# range 0 .. 31; IPR17 at 16#344# range 0 .. 31; IPR18 at 16#348# range 0 .. 31; IPR19 at 16#34C# range 0 .. 31; IPR20 at 16#350# range 0 .. 31; end record; -- Nested Vectored Interrupt Controller NVIC_Periph : aliased NVIC_Peripheral with Import, Address => NVIC_Base; -- Nested vectored interrupt controller type NVIC_STIR_Peripheral is record -- Software trigger interrupt register STIR : aliased STIR_Register; end record with Volatile; for NVIC_STIR_Peripheral use record STIR at 0 range 0 .. 31; end record; -- Nested vectored interrupt controller NVIC_STIR_Periph : aliased NVIC_STIR_Peripheral with Import, Address => NVIC_STIR_Base; end STM32_SVD.NVIC;
-- ________ ___ ______ ______ ___ -- /___ .. ._/ |.| |.___.\ /. __ .\ __|.| ____ -- / .. / |.| |.____/ |.|__|.| / .. ..| __\ .. \ -- _/ .. /___ |.| |.| === | .. __ .. ||. = .| | = .. | -- /_______/ |_| /__| /__| |_| \__\_| \__\_| -- Zip library -------------- -- Library for manipulating archive files in the Zip format -- -- Pure Ada 95 + code, 100% portable : OS - , CPU - and compiler - independent. -- -- Version / date / download info : see the version, reference, web strings -- defined at the end of the public part of this package. -- Legal licensing note: -- Copyright (c) 1999 .. 2012 Gautier de Montmollin -- 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. -- NB : this is the MIT License, as found 12 - Sep - 2007 on the site -- http://www.opensource.org/licenses/mit - license.php with Zip_Streams; with Ada.Calendar, Ada.Streams.Stream_IO, Ada.Text_IO, Ada.Strings.Unbounded; with Interfaces; package Zip is -------------- -- Zip_info -- -------------- -- Zip_info contains the Zip file name or input stream, -- and the archive's sorted directory type Zip_info is private; ----------------------------------------------------------------------- -- Load the whole .zip directory in archive (from) into a tree, for -- -- fast searching -- ----------------------------------------------------------------------- -- Load from a file procedure Load (info : out Zip_info; from : String; -- Zip file name case_sensitive : Boolean := False); -- Load from a stream procedure Load (info : out Zip_info; from : Zip_Streams.Zipstream_Class; case_sensitive : Boolean := False); Zip_file_Error, Zip_file_open_Error, Duplicate_name : exception; -- Parameter Form added to *_IO.[Open|Create] Form_For_IO_Open_N_Create : Ada.Strings.Unbounded.Unbounded_String := Ada.Strings.Unbounded.Null_Unbounded_String; -- See RM A.8.2 : File Management -- Example : "encoding=8bits" function Is_loaded (info : Zip_info) return Boolean; function Zip_name (info : Zip_info) return String; function Zip_comment (info : Zip_info) return String; function Zip_Stream (info : Zip_info) return Zip_Streams.Zipstream_Class; function Entries (info : Zip_info) return Natural; procedure Delete (info : in out Zip_info); Forgot_to_load_zip_info : exception; -- Data sizes in archive subtype File_size_type is Interfaces.Unsigned_32; --------- -- Compression methods or formats in the "official" PKWARE Zip format. -- Details in appnote.txt, part V.J -- C : supported for compressing -- D : supported for decompressing type PKZip_method is (store, -- C, D shrink, -- C, D reduce_1, -- C, D reduce_2, -- C, D reduce_3, -- C, D reduce_4, -- C, D implode, -- D tokenize, deflate, -- D deflate_e, -- D - Enhanced deflate bzip2, -- D lzma, ppmd, unknown ); -- Technical : translates the method code as set in zip archives function Method_from_code (x : Interfaces.Unsigned_16) return PKZip_method; function Method_from_code (x : Natural) return PKZip_method; -- Internal time definition subtype Time is Zip_Streams.Time; function Convert (date : Ada.Calendar.Time) return Time renames Zip_Streams.Calendar.Convert; function Convert (date : Time) return Ada.Calendar.Time renames Zip_Streams.Calendar.Convert; -- Traverse a whole Zip_info directory in sorted order, giving the -- name for each entry to an user - defined "Action" procedure. -- Concretely, you can process a whole Zip file that way, by extracting data -- with Extract, or open a reader stream with UnZip.Streams. -- See the Comp_Zip or Find_Zip tools as application examples. generic with procedure Action (name : String); -- 'name' is compressed entry's name procedure Traverse (z : Zip_info); -- Same as Traverse, but Action gives also technical informations about the -- compressed entry. generic with procedure Action ( name : String; -- 'name' is compressed entry's name file_index : Positive; comp_size : File_size_type; uncomp_size : File_size_type; crc_32 : Interfaces.Unsigned_32; date_time : Time; method : PKZip_method; unicode_file_name : Boolean ); procedure Traverse_verbose (z : Zip_info); -- Academic : see how well the name tree is balanced procedure Tree_stat (z : Zip_info; total : out Natural; max_depth : out Natural; avg_depth : out Float); -------------------------------------------------------------------------- -- Offsets - various procedures giving 1 - based indexes to local headers -- -------------------------------------------------------------------------- -- Find 1st offset in a Zip stream procedure Find_first_offset (file : Zip_Streams.Zipstream_Class; file_index : out Positive); -- Find offset of a certain compressed file -- in a Zip file (file opened and kept open) procedure Find_offset (file : Zip_Streams.Zipstream_Class; name : String; case_sensitive : Boolean; file_index : out Positive; comp_size : out File_size_type; uncomp_size : out File_size_type); -- Find offset of a certain compressed file in a Zip_info data procedure Find_offset (info : Zip_info; name : String; case_sensitive : Boolean; file_index : out Ada.Streams.Stream_IO.Positive_Count; comp_size : out File_size_type; uncomp_size : out File_size_type); File_name_not_found : exception; procedure Get_sizes (info : Zip_info; name : String; case_sensitive : Boolean; comp_size : out File_size_type; uncomp_size : out File_size_type); -- User - defined procedure for feedback occuring during -- compression or decompression (entry_skipped meaningful -- only for the latter) type Feedback_proc is access procedure (percents_done : Natural; -- %'s completed entry_skipped : Boolean; -- indicates one can show "skipped", no %'s user_abort : out Boolean); -- e.g. transmit a "click on Cancel" here ------------------------------------------------------------------------- -- Goodies - things used internally but that might be generally useful -- ------------------------------------------------------------------------- -- BlockRead : general - purpose procedure (nothing really specific to Zip / -- UnZip) : reads either the whole buffer from a file, or if the end of -- the file lays inbetween, a part of the buffer. -- -- The procedure's names and parameters match Borland Pascal / Delphi subtype Byte is Interfaces.Unsigned_8; type Byte_Buffer is array (Integer range <>) of aliased Byte; type p_Byte_Buffer is access Byte_Buffer; procedure BlockRead (file : Ada.Streams.Stream_IO.File_Type; buffer : out Byte_Buffer; actually_read : out Natural); -- = buffer'Length if no end of file before last buffer element -- Same for general streams -- procedure BlockRead (stream : Zip_Streams.Zipstream_Class; buffer : out Byte_Buffer; actually_read : out Natural); -- = buffer'Length if no end of stream before last buffer element -- Same, but instead of giving actually_read, raises End_Error if -- the buffer cannot be fully read. -- This mimics the 'Read stream attribute; can be a lot faster, depending -- on the compiler's run - time library. procedure BlockRead (stream : Zip_Streams.Zipstream_Class; buffer : out Byte_Buffer); -- This mimics the 'Write stream attribute; can be a lot faster, depending -- on the compiler's run - time library. -- NB : here we can use the root stream type : no question of size, index, .. . procedure BlockWrite (stream : in out Ada.Streams.Root_Stream_Type'Class; buffer : Byte_Buffer); -- This does the same as Ada 2005's Ada.Directories.Exists -- Just there as helper for Ada 95 only systems -- function Exists (name : String) return Boolean; -- Write a string containing line endings (possible from another system) -- into a text file, with the correct native line endings. -- Works for displaying/saving correctly -- CR&LF (DOS/Win), LF (UNIX), CR (Mac OS < 9) -- procedure Put_Multi_Line ( out_file : Ada.Text_IO.File_Type; text : String ); procedure Write_as_text ( out_file : Ada.Text_IO.File_Type; buffer : Byte_Buffer; last_char : in out Character -- track line - ending characters between writes ); -------------------------------------------------------------- -- Information about this package - e.g. for an "about" box -- -------------------------------------------------------------- version : constant String := "43 - pre"; reference : constant String := "14 - Jul - 2012"; web : constant String := "http://unzip - ada.sf.net/"; -- hopefully the latest version is at that URL .. . --- ^ ------------------- -- Private items -- ------------------- private -- Zip_info, 23.VI.1999. -- The PKZIP central directory is coded here as a binary tree -- to allow a fast retrieval of the searched offset in zip file. -- E.g. for a 1000 - file archive, the offset will be found in less -- than 11 moves : 2**10=1024 (balanced case), without any read -- in the archive. type Dir_node; type p_Dir_node is access Dir_node; type Dir_node (name_len : Natural) is record left, right : p_Dir_node; dico_name : String (1 .. name_len); -- UPPER if case - insensitive search file_name : String (1 .. name_len); file_index : Ada.Streams.Stream_IO.Positive_Count; comp_size : File_size_type; uncomp_size : File_size_type; crc_32 : Interfaces.Unsigned_32; date_time : Time; method : PKZip_method; unicode_file_name : Boolean; end record; type p_String is access String; type Zip_info is record loaded : Boolean := False; zip_file_name : p_String; -- a file name .. . zip_input_stream : Zip_Streams.Zipstream_Class; -- . .. or an input stream -- ^ when not null, we use this and not zip_file_name dir_binary_tree : p_Dir_node; total_entries : Natural; zip_file_comment : p_String; end record; end Zip;
package body Linear_Search with SPARK_Mode is function Search (A : Ar; I : Integer) return T is begin for Index in T range Ar'First .. Ar'Last loop if A (Index) = I then return Index; else null; end if; end loop; return 0; end Search; end Linear_Search;
-- This file is generated by SWIG. Please do *not* modify by hand. -- with Interfaces.C; with Interfaces.C; package gmp_c.a_a_mpf_struct is -- Item -- type Item is record a_mp_prec : aliased Interfaces.C.int; a_mp_size : aliased Interfaces.C.int; a_mp_exp : aliased gmp_c.mp_exp_t; a_mp_d : access gmp_c.mp_limb_t; end record; -- Items -- type Items is array (Interfaces.C.size_t range <>) of aliased gmp_c.a_a_mpf_struct.Item; -- Pointer -- type Pointer is access all gmp_c.a_a_mpf_struct.Item; -- Pointers -- type Pointers is array (Interfaces.C.size_t range <>) of aliased gmp_c.a_a_mpf_struct.Pointer; -- Pointer_Pointer -- type Pointer_Pointer is access all gmp_c.a_a_mpf_struct.Pointer; function construct return gmp_c.a_a_mpf_struct.Item; private pragma Import (C, construct, "Ada_new___mpf_struct"); end gmp_c.a_a_mpf_struct;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- E I N F O -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2016, 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. -- -- -- ------------------------------------------------------------------------------ pragma Style_Checks (All_Checks); -- Turn off subprogram ordering, not used for this unit with Atree; use Atree; with Elists; use Elists; with Namet; use Namet; with Nlists; use Nlists; with Output; use Output; with Sinfo; use Sinfo; with Stand; use Stand; package body Einfo is use Atree.Unchecked_Access; -- This is one of the packages that is allowed direct untyped access to -- the fields in a node, since it provides the next level abstraction -- which incorporates appropriate checks. ---------------------------------------------- -- Usage of Fields in Defining Entity Nodes -- ---------------------------------------------- -- Four of these fields are defined in Sinfo, since they in are the base -- part of the node. The access routines for these four fields and the -- corresponding set procedures are defined in Sinfo. These fields are -- present in all entities. Note that Homonym is also in the base part of -- the node, but has access routines that are more properly part of Einfo, -- which is why they are defined here. -- Chars Name1 -- Next_Entity Node2 -- Scope Node3 -- Etype Node5 -- Remaining fields are present only in extended nodes (i.e. entities). -- The following fields are present in all entities -- Homonym Node4 -- First_Rep_Item Node6 -- Freeze_Node Node7 -- Associated_Entity Node37 -- The usage of other fields (and the entity kinds to which it applies) -- depends on the particular field (see Einfo spec for details). -- Associated_Node_For_Itype Node8 -- Dependent_Instances Elist8 -- Hiding_Loop_Variable Node8 -- Mechanism Uint8 (but returns Mechanism_Type) -- Normalized_First_Bit Uint8 -- Refinement_Constituents Elist8 -- Return_Applies_To Node8 -- First_Exit_Statement Node8 -- Class_Wide_Type Node9 -- Current_Value Node9 -- Renaming_Map Uint9 -- Direct_Primitive_Operations Elist10 -- Discriminal_Link Node10 -- Float_Rep Uint10 (but returns Float_Rep_Kind) -- Handler_Records List10 -- Normalized_Position_Max Uint10 -- Part_Of_Constituents Elist10 -- Block_Node Node11 -- Component_Bit_Offset Uint11 -- Full_View Node11 -- Entry_Component Node11 -- Enumeration_Pos Uint11 -- Generic_Homonym Node11 -- Part_Of_References Elist11 -- Protected_Body_Subprogram Node11 -- Barrier_Function Node12 -- Enumeration_Rep Uint12 -- Esize Uint12 -- Next_Inlined_Subprogram Node12 -- Component_Clause Node13 -- Elaboration_Entity Node13 -- Extra_Accessibility Node13 -- RM_Size Uint13 -- Alignment Uint14 -- Normalized_Position Uint14 -- Postconditions_Proc Node14 -- Shadow_Entities List14 -- Discriminant_Number Uint15 -- DT_Position Uint15 -- DT_Entry_Count Uint15 -- Entry_Parameters_Type Node15 -- Extra_Formal Node15 -- Pending_Access_Types Elist15 -- Related_Instance Node15 -- Status_Flag_Or_Transient_Decl Node15 -- Access_Disp_Table Elist16 -- Body_References Elist16 -- Cloned_Subtype Node16 -- DTC_Entity Node16 -- Entry_Formal Node16 -- First_Private_Entity Node16 -- Lit_Strings Node16 -- Scale_Value Uint16 -- String_Literal_Length Uint16 -- Unset_Reference Node16 -- Actual_Subtype Node17 -- Digits_Value Uint17 -- Discriminal Node17 -- First_Entity Node17 -- First_Index Node17 -- First_Literal Node17 -- Master_Id Node17 -- Modulus Uint17 -- Prival Node17 -- Alias Node18 -- Corresponding_Concurrent_Type Node18 -- Corresponding_Protected_Entry Node18 -- Corresponding_Record_Type Node18 -- Delta_Value Ureal18 -- Enclosing_Scope Node18 -- Equivalent_Type Node18 -- Lit_Indexes Node18 -- Private_Dependents Elist18 -- Renamed_Entity Node18 -- Renamed_Object Node18 -- String_Literal_Low_Bound Node18 -- Body_Entity Node19 -- Corresponding_Discriminant Node19 -- Default_Aspect_Component_Value Node19 -- Default_Aspect_Value Node19 -- Entry_Bodies_Array Node19 -- Extra_Accessibility_Of_Result Node19 -- Non_Limited_View Node19 -- Parent_Subtype Node19 -- Size_Check_Code Node19 -- Spec_Entity Node19 -- Underlying_Full_View Node19 -- Component_Type Node20 -- Default_Value Node20 -- Directly_Designated_Type Node20 -- Discriminant_Checking_Func Node20 -- Discriminant_Default_Value Node20 -- Last_Entity Node20 -- Prival_Link Node20 -- Register_Exception_Call Node20 -- Scalar_Range Node20 -- Accept_Address Elist21 -- Default_Expr_Function Node21 -- Discriminant_Constraint Elist21 -- Interface_Name Node21 -- Original_Array_Type Node21 -- Small_Value Ureal21 -- Associated_Storage_Pool Node22 -- Component_Size Uint22 -- Corresponding_Remote_Type Node22 -- Enumeration_Rep_Expr Node22 -- Original_Record_Component Node22 -- Private_View Node22 -- Protected_Formal Node22 -- Scope_Depth_Value Uint22 -- Shared_Var_Procs_Instance Node22 -- CR_Discriminant Node23 -- Entry_Cancel_Parameter Node23 -- Enum_Pos_To_Rep Node23 -- Extra_Constrained Node23 -- Finalization_Master Node23 -- Generic_Renamings Elist23 -- Inner_Instances Elist23 -- Limited_View Node23 -- Packed_Array_Impl_Type Node23 -- Protection_Object Node23 -- Stored_Constraint Elist23 -- Incomplete_Actuals Elist24 -- Related_Expression Node24 -- Subps_Index Uint24 -- Contract_Wrapper Node25 -- Debug_Renaming_Link Node25 -- DT_Offset_To_Top_Func Node25 -- Interface_Alias Node25 -- Interfaces Elist25 -- Related_Array_Object Node25 -- Static_Discrete_Predicate List25 -- Static_Real_Or_String_Predicate Node25 -- Task_Body_Procedure Node25 -- Dispatch_Table_Wrappers Elist26 -- Last_Assignment Node26 -- Overridden_Operation Node26 -- Package_Instantiation Node26 -- Storage_Size_Variable Node26 -- Current_Use_Clause Node27 -- Related_Type Node27 -- Wrapped_Entity Node27 -- Extra_Formals Node28 -- Finalizer Node28 -- Initialization_Statements Node28 -- Original_Access_Type Node28 -- Relative_Deadline_Variable Node28 -- Underlying_Record_View Node28 -- Anonymous_Masters Elist29 -- BIP_Initialization_Call Node29 -- Subprograms_For_Type Elist29 -- Anonymous_Object Node30 -- Corresponding_Equality Node30 -- Last_Aggregate_Assignment Node30 -- Static_Initialization Node30 -- Derived_Type_Link Node31 -- Thunk_Entity Node31 -- Activation_Record_Component Node31 -- Corresponding_Function Node32 -- Corresponding_Procedure Node32 -- Encapsulating_State Node32 -- No_Tagged_Streams_Pragma Node32 -- Linker_Section_Pragma Node33 -- Contract Node34 -- Anonymous_Designated_Type Node35 -- Entry_Max_Queue_Lengths_Array Node35 -- Import_Pragma Node35 -- Class_Wide_Preconds List38 -- Class_Wide_Postconds List39 -- SPARK_Pragma Node40 -- Original_Protected_Subprogram Node41 -- SPARK_Aux_Pragma Node41 --------------------------------------------- -- Usage of Flags in Defining Entity Nodes -- --------------------------------------------- -- All flags are unique, there is no overlaying, so each flag is physically -- present in every entity. However, for many of the flags, it only makes -- sense for them to be set true for certain subsets of entity kinds. See -- the spec of Einfo for further details. -- Is_Inlined_Always Flag1 -- Is_Hidden_Non_Overridden_Subpgm Flag2 -- Has_Own_DIC Flag3 -- Is_Frozen Flag4 -- Has_Discriminants Flag5 -- Is_Dispatching_Operation Flag6 -- Is_Immediately_Visible Flag7 -- In_Use Flag8 -- Is_Potentially_Use_Visible Flag9 -- Is_Public Flag10 -- Is_Inlined Flag11 -- Is_Constrained Flag12 -- Is_Generic_Type Flag13 -- Depends_On_Private Flag14 -- Is_Aliased Flag15 -- Is_Volatile Flag16 -- Is_Internal Flag17 -- Has_Delayed_Freeze Flag18 -- Is_Abstract_Subprogram Flag19 -- Is_Concurrent_Record_Type Flag20 -- Has_Master_Entity Flag21 -- Needs_No_Actuals Flag22 -- Has_Storage_Size_Clause Flag23 -- Is_Imported Flag24 -- Is_Limited_Record Flag25 -- Has_Completion Flag26 -- Has_Pragma_Controlled Flag27 -- Is_Statically_Allocated Flag28 -- Has_Size_Clause Flag29 -- Has_Task Flag30 -- Checks_May_Be_Suppressed Flag31 -- Kill_Elaboration_Checks Flag32 -- Kill_Range_Checks Flag33 -- Has_Independent_Components Flag34 -- Is_Class_Wide_Equivalent_Type Flag35 -- Referenced_As_LHS Flag36 -- Is_Known_Non_Null Flag37 -- Can_Never_Be_Null Flag38 -- Has_Default_Aspect Flag39 -- Body_Needed_For_SAL Flag40 -- Treat_As_Volatile Flag41 -- Is_Controlled Flag42 -- Has_Controlled_Component Flag43 -- Is_Pure Flag44 -- In_Private_Part Flag45 -- Has_Alignment_Clause Flag46 -- Has_Exit Flag47 -- In_Package_Body Flag48 -- Reachable Flag49 -- Delay_Subprogram_Descriptors Flag50 -- Is_Packed Flag51 -- Is_Entry_Formal Flag52 -- Is_Private_Descendant Flag53 -- Return_Present Flag54 -- Is_Tagged_Type Flag55 -- Has_Homonym Flag56 -- Is_Hidden Flag57 -- Non_Binary_Modulus Flag58 -- Is_Preelaborated Flag59 -- Is_Shared_Passive Flag60 -- Is_Remote_Types Flag61 -- Is_Remote_Call_Interface Flag62 -- Is_Character_Type Flag63 -- Is_Intrinsic_Subprogram Flag64 -- Has_Record_Rep_Clause Flag65 -- Has_Enumeration_Rep_Clause Flag66 -- Has_Small_Clause Flag67 -- Has_Component_Size_Clause Flag68 -- Is_Access_Constant Flag69 -- Is_First_Subtype Flag70 -- Has_Completion_In_Body Flag71 -- Has_Unknown_Discriminants Flag72 -- Is_Child_Unit Flag73 -- Is_CPP_Class Flag74 -- Has_Non_Standard_Rep Flag75 -- Is_Constructor Flag76 -- Static_Elaboration_Desired Flag77 -- Is_Tag Flag78 -- Has_All_Calls_Remote Flag79 -- Is_Constr_Subt_For_U_Nominal Flag80 -- Is_Asynchronous Flag81 -- Has_Gigi_Rep_Item Flag82 -- Has_Machine_Radix_Clause Flag83 -- Machine_Radix_10 Flag84 -- Is_Atomic Flag85 -- Has_Atomic_Components Flag86 -- Has_Volatile_Components Flag87 -- Discard_Names Flag88 -- Is_Interrupt_Handler Flag89 -- Returns_By_Ref Flag90 -- Is_Itype Flag91 -- Size_Known_At_Compile_Time Flag92 -- Reverse_Storage_Order Flag93 -- Is_Generic_Actual_Type Flag94 -- Uses_Sec_Stack Flag95 -- Warnings_Off Flag96 -- Is_Controlling_Formal Flag97 -- Has_Controlling_Result Flag98 -- Is_Exported Flag99 -- Has_Specified_Layout Flag100 -- Has_Nested_Block_With_Handler Flag101 -- Is_Called Flag102 -- Is_Completely_Hidden Flag103 -- Address_Taken Flag104 -- Suppress_Initialization Flag105 -- Is_Limited_Composite Flag106 -- Is_Private_Composite Flag107 -- Default_Expressions_Processed Flag108 -- Is_Non_Static_Subtype Flag109 -- Has_Out_Or_In_Out_Parameter Flag110 -- Is_Formal_Subprogram Flag111 -- Is_Renaming_Of_Object Flag112 -- No_Return Flag113 -- Delay_Cleanups Flag114 -- Never_Set_In_Source Flag115 -- Is_Visible_Lib_Unit Flag116 -- Is_Unchecked_Union Flag117 -- Is_For_Access_Subtype Flag118 -- Has_Convention_Pragma Flag119 -- Has_Primitive_Operations Flag120 -- Has_Pragma_Pack Flag121 -- Is_Bit_Packed_Array Flag122 -- Has_Unchecked_Union Flag123 -- Is_Eliminated Flag124 -- C_Pass_By_Copy Flag125 -- Is_Instantiated Flag126 -- Is_Valued_Procedure Flag127 -- (used for Component_Alignment) Flag128 -- (used for Component_Alignment) Flag129 -- Is_Generic_Instance Flag130 -- No_Pool_Assigned Flag131 -- Is_DIC_Procedure Flag132 -- Has_Inherited_DIC Flag133 -- Has_Aliased_Components Flag135 -- No_Strict_Aliasing Flag136 -- Is_Machine_Code_Subprogram Flag137 -- Is_Packed_Array_Impl_Type Flag138 -- Has_Biased_Representation Flag139 -- Has_Complex_Representation Flag140 -- Is_Constr_Subt_For_UN_Aliased Flag141 -- Has_Missing_Return Flag142 -- Has_Recursive_Call Flag143 -- Is_Unsigned_Type Flag144 -- Strict_Alignment Flag145 -- Is_Abstract_Type Flag146 -- Needs_Debug_Info Flag147 -- Suppress_Elaboration_Warnings Flag148 -- Is_Compilation_Unit Flag149 -- Has_Pragma_Elaborate_Body Flag150 -- Has_Private_Ancestor Flag151 -- Entry_Accepted Flag152 -- Is_Obsolescent Flag153 -- Has_Per_Object_Constraint Flag154 -- Has_Private_Declaration Flag155 -- Referenced Flag156 -- Has_Pragma_Inline Flag157 -- Finalize_Storage_Only Flag158 -- From_Limited_With Flag159 -- Is_Package_Body_Entity Flag160 -- Has_Qualified_Name Flag161 -- Nonzero_Is_True Flag162 -- Is_True_Constant Flag163 -- Reverse_Bit_Order Flag164 -- Suppress_Style_Checks Flag165 -- Debug_Info_Off Flag166 -- Sec_Stack_Needed_For_Return Flag167 -- Materialize_Entity Flag168 -- Has_Pragma_Thread_Local_Storage Flag169 -- Is_Known_Valid Flag170 -- Is_Hidden_Open_Scope Flag171 -- Has_Object_Size_Clause Flag172 -- Has_Fully_Qualified_Name Flag173 -- Elaboration_Entity_Required Flag174 -- Has_Forward_Instantiation Flag175 -- Is_Discrim_SO_Function Flag176 -- Size_Depends_On_Discriminant Flag177 -- Is_Null_Init_Proc Flag178 -- Has_Pragma_Pure_Function Flag179 -- Has_Pragma_Unreferenced Flag180 -- Has_Contiguous_Rep Flag181 -- Has_Xref_Entry Flag182 -- Must_Be_On_Byte_Boundary Flag183 -- Has_Stream_Size_Clause Flag184 -- Is_Ada_2005_Only Flag185 -- Is_Interface Flag186 -- Has_Constrained_Partial_View Flag187 -- Uses_Lock_Free Flag188 -- Is_Pure_Unit_Access_Type Flag189 -- Has_Specified_Stream_Input Flag190 -- Has_Specified_Stream_Output Flag191 -- Has_Specified_Stream_Read Flag192 -- Has_Specified_Stream_Write Flag193 -- Is_Local_Anonymous_Access Flag194 -- Is_Primitive_Wrapper Flag195 -- Was_Hidden Flag196 -- Is_Limited_Interface Flag197 -- Has_Pragma_Ordered Flag198 -- Is_Ada_2012_Only Flag199 -- Has_Delayed_Aspects Flag200 -- Has_Pragma_No_Inline Flag201 -- Itype_Printed Flag202 -- Has_Pragma_Pure Flag203 -- Is_Known_Null Flag204 -- Low_Bound_Tested Flag205 -- Is_Visible_Formal Flag206 -- Known_To_Have_Preelab_Init Flag207 -- Must_Have_Preelab_Init Flag208 -- Is_Return_Object Flag209 -- Elaborate_Body_Desirable Flag210 -- Has_Static_Discriminants Flag211 -- Has_Pragma_Unreferenced_Objects Flag212 -- Requires_Overriding Flag213 -- Has_RACW Flag214 -- Is_Param_Block_Component_Type Flag215 -- Universal_Aliasing Flag216 -- Suppress_Value_Tracking_On_Call Flag217 -- Is_Primitive Flag218 -- Has_Initial_Value Flag219 -- Has_Dispatch_Table Flag220 -- Has_Pragma_Preelab_Init Flag221 -- Used_As_Generic_Actual Flag222 -- Is_Descendant_Of_Address Flag223 -- Is_Raised Flag224 -- Is_Thunk Flag225 -- Is_Only_Out_Parameter Flag226 -- Referenced_As_Out_Parameter Flag227 -- Has_Thunks Flag228 -- Can_Use_Internal_Rep Flag229 -- Has_Pragma_Inline_Always Flag230 -- Renamed_In_Spec Flag231 -- Has_Own_Invariants Flag232 -- Has_Pragma_Unmodified Flag233 -- Is_Dispatch_Table_Entity Flag234 -- Is_Trivial_Subprogram Flag235 -- Warnings_Off_Used Flag236 -- Warnings_Off_Used_Unmodified Flag237 -- Warnings_Off_Used_Unreferenced Flag238 -- OK_To_Reorder_Components Flag239 -- Has_Expanded_Contract Flag240 -- Optimize_Alignment_Space Flag241 -- Optimize_Alignment_Time Flag242 -- Overlays_Constant Flag243 -- Is_RACW_Stub_Type Flag244 -- Is_Private_Primitive Flag245 -- Is_Underlying_Record_View Flag246 -- OK_To_Rename Flag247 -- Has_Inheritable_Invariants Flag248 -- Is_Safe_To_Reevaluate Flag249 -- Has_Predicates Flag250 -- Has_Implicit_Dereference Flag251 -- Is_Finalized_Transient Flag252 -- Disable_Controlled Flag253 -- Is_Implementation_Defined Flag254 -- Is_Predicate_Function Flag255 -- Is_Predicate_Function_M Flag256 -- Is_Invariant_Procedure Flag257 -- Has_Dynamic_Predicate_Aspect Flag258 -- Has_Static_Predicate_Aspect Flag259 -- Has_Loop_Entry_Attributes Flag260 -- Has_Delayed_Rep_Aspects Flag261 -- May_Inherit_Delayed_Rep_Aspects Flag262 -- Has_Visible_Refinement Flag263 -- Is_Discriminant_Check_Function Flag264 -- SPARK_Pragma_Inherited Flag265 -- SPARK_Aux_Pragma_Inherited Flag266 -- Has_Shift_Operator Flag267 -- Is_Independent Flag268 -- Has_Static_Predicate Flag269 -- Stores_Attribute_Old_Prefix Flag270 -- Has_Protected Flag271 -- SSO_Set_Low_By_Default Flag272 -- SSO_Set_High_By_Default Flag273 -- Is_Generic_Actual_Subprogram Flag274 -- No_Predicate_On_Actual Flag275 -- No_Dynamic_Predicate_On_Actual Flag276 -- Is_Checked_Ghost_Entity Flag277 -- Is_Ignored_Ghost_Entity Flag278 -- Contains_Ignored_Ghost_Code Flag279 -- Partial_View_Has_Unknown_Discr Flag280 -- Is_Static_Type Flag281 -- Has_Nested_Subprogram Flag282 -- Is_Uplevel_Referenced_Entity Flag283 -- Is_Unimplemented Flag284 -- Is_Volatile_Full_Access Flag285 -- Is_Exception_Handler Flag286 -- Rewritten_For_C Flag287 -- Predicates_Ignored Flag288 -- Has_Timing_Event Flag289 -- (unused) Flag290 -- ??? flag breaks einfo.h -- Has_Inherited_Invariants Flag291 -- Is_Partial_Invariant_Procedure Flag292 -- Is_Actual_Subtype Flag293 -- Has_Pragma_Unused Flag294 -- Is_Ignored_Transient Flag295 -- Has_Partial_Visible_Refinement Flag296 -- Is_Entry_Wrapper Flag297 -- Is_Underlying_Full_View Flag298 -- (unused) Flag299 -- (unused) Flag300 -- (unused) Flag301 -- (unused) Flag302 -- (unused) Flag303 -- (unused) Flag304 -- (unused) Flag305 -- (unused) Flag306 -- (unused) Flag307 -- (unused) Flag308 -- (unused) Flag309 -- Note: Flag310-317 are defined in atree.ads/adb, but not yet in atree.h ----------------------- -- Local subprograms -- ----------------------- function Has_Option (State_Id : Entity_Id; Option_Nam : Name_Id) return Boolean; -- Determine whether abstract state State_Id has particular option denoted -- by the name Option_Nam. --------------- -- Float_Rep -- --------------- function Float_Rep (Id : E) return F is pragma Assert (Is_Floating_Point_Type (Id)); begin return F'Val (UI_To_Int (Uint10 (Base_Type (Id)))); end Float_Rep; ---------------- -- Has_Option -- ---------------- function Has_Option (State_Id : Entity_Id; Option_Nam : Name_Id) return Boolean is Decl : constant Node_Id := Parent (State_Id); Opt : Node_Id; Opt_Nam : Node_Id; begin pragma Assert (Ekind (State_Id) = E_Abstract_State); -- The declaration of abstract states with options appear as an -- extension aggregate. If this is not the case, the option is not -- available. if Nkind (Decl) /= N_Extension_Aggregate then return False; end if; -- Simple options Opt := First (Expressions (Decl)); while Present (Opt) loop if Nkind (Opt) = N_Identifier and then Chars (Opt) = Option_Nam then return True; end if; Next (Opt); end loop; -- Complex options with various specifiers Opt := First (Component_Associations (Decl)); while Present (Opt) loop Opt_Nam := First (Choices (Opt)); if Nkind (Opt_Nam) = N_Identifier and then Chars (Opt_Nam) = Option_Nam then return True; end if; Next (Opt); end loop; return False; end Has_Option; -------------------------------- -- Attribute Access Functions -- -------------------------------- function Abstract_States (Id : E) return L is begin pragma Assert (Ekind_In (Id, E_Generic_Package, E_Package)); return Elist25 (Id); end Abstract_States; function Accept_Address (Id : E) return L is begin return Elist21 (Id); end Accept_Address; function Access_Disp_Table (Id : E) return L is begin pragma Assert (Ekind_In (Id, E_Record_Type, E_Record_Type_With_Private, E_Record_Subtype)); return Elist16 (Implementation_Base_Type (Id)); end Access_Disp_Table; function Activation_Record_Component (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Constant, E_In_Parameter, E_In_Out_Parameter, E_Loop_Parameter, E_Out_Parameter, E_Variable)); return Node31 (Id); end Activation_Record_Component; function Actual_Subtype (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable, E_Generic_In_Out_Parameter) or else Is_Formal (Id)); return Node17 (Id); end Actual_Subtype; function Address_Taken (Id : E) return B is begin return Flag104 (Id); end Address_Taken; function Alias (Id : E) return E is begin pragma Assert (Is_Overloadable (Id) or else Ekind (Id) = E_Subprogram_Type); return Node18 (Id); end Alias; function Alignment (Id : E) return U is begin pragma Assert (Is_Type (Id) or else Is_Formal (Id) or else Ekind_In (Id, E_Loop_Parameter, E_Constant, E_Exception, E_Variable)); return Uint14 (Id); end Alignment; function Anonymous_Designated_Type (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Variable); return Node35 (Id); end Anonymous_Designated_Type; function Anonymous_Masters (Id : E) return L is begin pragma Assert (Ekind_In (Id, E_Function, E_Package, E_Procedure, E_Subprogram_Body)); return Elist29 (Id); end Anonymous_Masters; function Anonymous_Object (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Protected_Type, E_Task_Type)); return Node30 (Id); end Anonymous_Object; function Associated_Entity (Id : E) return E is begin return Node37 (Id); end Associated_Entity; function Associated_Formal_Package (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Package); return Node12 (Id); end Associated_Formal_Package; function Associated_Node_For_Itype (Id : E) return N is begin return Node8 (Id); end Associated_Node_For_Itype; function Associated_Storage_Pool (Id : E) return E is begin pragma Assert (Is_Access_Type (Id)); return Node22 (Root_Type (Id)); end Associated_Storage_Pool; function Barrier_Function (Id : E) return N is begin pragma Assert (Is_Entry (Id)); return Node12 (Id); end Barrier_Function; function Block_Node (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Block); return Node11 (Id); end Block_Node; function Body_Entity (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Package, E_Generic_Package)); return Node19 (Id); end Body_Entity; function Body_Needed_For_SAL (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Package or else Is_Subprogram (Id) or else Is_Generic_Unit (Id)); return Flag40 (Id); end Body_Needed_For_SAL; function Body_References (Id : E) return L is begin pragma Assert (Ekind (Id) = E_Abstract_State); return Elist16 (Id); end Body_References; function BIP_Initialization_Call (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); return Node29 (Id); end BIP_Initialization_Call; function C_Pass_By_Copy (Id : E) return B is begin pragma Assert (Is_Record_Type (Id)); return Flag125 (Implementation_Base_Type (Id)); end C_Pass_By_Copy; function Can_Never_Be_Null (Id : E) return B is begin return Flag38 (Id); end Can_Never_Be_Null; function Checks_May_Be_Suppressed (Id : E) return B is begin return Flag31 (Id); end Checks_May_Be_Suppressed; function Class_Wide_Postconds (Id : E) return S is begin pragma Assert (Is_Subprogram (Id)); return List39 (Id); end Class_Wide_Postconds; function Class_Wide_Preconds (Id : E) return S is begin pragma Assert (Is_Subprogram (Id)); return List38 (Id); end Class_Wide_Preconds; function Class_Wide_Type (Id : E) return E is begin pragma Assert (Is_Type (Id)); return Node9 (Id); end Class_Wide_Type; function Cloned_Subtype (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Record_Subtype, E_Class_Wide_Subtype)); return Node16 (Id); end Cloned_Subtype; function Component_Bit_Offset (Id : E) return U is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); return Uint11 (Id); end Component_Bit_Offset; function Component_Clause (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); return Node13 (Id); end Component_Clause; function Component_Size (Id : E) return U is begin pragma Assert (Is_Array_Type (Id)); return Uint22 (Implementation_Base_Type (Id)); end Component_Size; function Component_Type (Id : E) return E is begin pragma Assert (Is_Array_Type (Id)); return Node20 (Implementation_Base_Type (Id)); end Component_Type; function Corresponding_Concurrent_Type (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Record_Type); return Node18 (Id); end Corresponding_Concurrent_Type; function Corresponding_Discriminant (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Discriminant); return Node19 (Id); end Corresponding_Discriminant; function Corresponding_Equality (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Function and then not Comes_From_Source (Id) and then Chars (Id) = Name_Op_Ne); return Node30 (Id); end Corresponding_Equality; function Corresponding_Function (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Procedure); return Node32 (Id); end Corresponding_Function; function Corresponding_Procedure (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Function); return Node32 (Id); end Corresponding_Procedure; function Corresponding_Protected_Entry (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Subprogram_Body); return Node18 (Id); end Corresponding_Protected_Entry; function Corresponding_Record_Type (Id : E) return E is begin pragma Assert (Is_Concurrent_Type (Id)); return Node18 (Id); end Corresponding_Record_Type; function Corresponding_Remote_Type (Id : E) return E is begin return Node22 (Id); end Corresponding_Remote_Type; function Current_Use_Clause (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Package or else Is_Type (Id)); return Node27 (Id); end Current_Use_Clause; function Current_Value (Id : E) return N is begin pragma Assert (Ekind (Id) in Object_Kind); return Node9 (Id); end Current_Value; function CR_Discriminant (Id : E) return E is begin return Node23 (Id); end CR_Discriminant; function Debug_Info_Off (Id : E) return B is begin return Flag166 (Id); end Debug_Info_Off; function Debug_Renaming_Link (Id : E) return E is begin return Node25 (Id); end Debug_Renaming_Link; function Default_Aspect_Component_Value (Id : E) return N is begin pragma Assert (Is_Array_Type (Id)); return Node19 (Base_Type (Id)); end Default_Aspect_Component_Value; function Default_Aspect_Value (Id : E) return N is begin pragma Assert (Is_Scalar_Type (Id)); return Node19 (Base_Type (Id)); end Default_Aspect_Value; function Default_Expr_Function (Id : E) return E is begin pragma Assert (Is_Formal (Id)); return Node21 (Id); end Default_Expr_Function; function Default_Expressions_Processed (Id : E) return B is begin return Flag108 (Id); end Default_Expressions_Processed; function Default_Value (Id : E) return N is begin pragma Assert (Is_Formal (Id)); return Node20 (Id); end Default_Value; function Delay_Cleanups (Id : E) return B is begin return Flag114 (Id); end Delay_Cleanups; function Delay_Subprogram_Descriptors (Id : E) return B is begin return Flag50 (Id); end Delay_Subprogram_Descriptors; function Delta_Value (Id : E) return R is begin pragma Assert (Is_Fixed_Point_Type (Id)); return Ureal18 (Id); end Delta_Value; function Dependent_Instances (Id : E) return L is begin pragma Assert (Is_Generic_Instance (Id)); return Elist8 (Id); end Dependent_Instances; function Depends_On_Private (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag14 (Id); end Depends_On_Private; function Derived_Type_Link (Id : E) return E is begin pragma Assert (Is_Type (Id)); return Node31 (Base_Type (Id)); end Derived_Type_Link; function Digits_Value (Id : E) return U is begin pragma Assert (Is_Floating_Point_Type (Id) or else Is_Decimal_Fixed_Point_Type (Id)); return Uint17 (Id); end Digits_Value; function Direct_Primitive_Operations (Id : E) return L is begin pragma Assert (Is_Tagged_Type (Id)); return Elist10 (Id); end Direct_Primitive_Operations; function Directly_Designated_Type (Id : E) return E is begin pragma Assert (Is_Access_Type (Id)); return Node20 (Id); end Directly_Designated_Type; function Disable_Controlled (Id : E) return B is begin return Flag253 (Base_Type (Id)); end Disable_Controlled; function Discard_Names (Id : E) return B is begin return Flag88 (Id); end Discard_Names; function Discriminal (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Discriminant); return Node17 (Id); end Discriminal; function Discriminal_Link (Id : E) return N is begin return Node10 (Id); end Discriminal_Link; function Discriminant_Checking_Func (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Component); return Node20 (Id); end Discriminant_Checking_Func; function Discriminant_Constraint (Id : E) return L is begin pragma Assert (Is_Composite_Type (Id) and then Has_Discriminants (Id)); return Elist21 (Id); end Discriminant_Constraint; function Discriminant_Default_Value (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Discriminant); return Node20 (Id); end Discriminant_Default_Value; function Discriminant_Number (Id : E) return U is begin pragma Assert (Ekind (Id) = E_Discriminant); return Uint15 (Id); end Discriminant_Number; function Dispatch_Table_Wrappers (Id : E) return L is begin pragma Assert (Ekind_In (Id, E_Record_Type, E_Record_Subtype)); return Elist26 (Implementation_Base_Type (Id)); end Dispatch_Table_Wrappers; function DT_Entry_Count (Id : E) return U is begin pragma Assert (Ekind (Id) = E_Component and then Is_Tag (Id)); return Uint15 (Id); end DT_Entry_Count; function DT_Offset_To_Top_Func (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Component and then Is_Tag (Id)); return Node25 (Id); end DT_Offset_To_Top_Func; function DT_Position (Id : E) return U is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure) and then Present (DTC_Entity (Id))); return Uint15 (Id); end DT_Position; function DTC_Entity (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Node16 (Id); end DTC_Entity; function Elaborate_Body_Desirable (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Package); return Flag210 (Id); end Elaborate_Body_Desirable; function Elaboration_Entity (Id : E) return E is begin pragma Assert (Is_Subprogram (Id) or else Ekind (Id) = E_Package or else Is_Generic_Unit (Id)); return Node13 (Id); end Elaboration_Entity; function Elaboration_Entity_Required (Id : E) return B is begin pragma Assert (Is_Subprogram (Id) or else Ekind (Id) = E_Package or else Is_Generic_Unit (Id)); return Flag174 (Id); end Elaboration_Entity_Required; function Encapsulating_State (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Abstract_State, E_Constant, E_Variable)); return Node32 (Id); end Encapsulating_State; function Enclosing_Scope (Id : E) return E is begin return Node18 (Id); end Enclosing_Scope; function Entry_Accepted (Id : E) return B is begin pragma Assert (Is_Entry (Id)); return Flag152 (Id); end Entry_Accepted; function Entry_Bodies_Array (Id : E) return E is begin return Node19 (Id); end Entry_Bodies_Array; function Entry_Cancel_Parameter (Id : E) return E is begin return Node23 (Id); end Entry_Cancel_Parameter; function Entry_Component (Id : E) return E is begin return Node11 (Id); end Entry_Component; function Entry_Formal (Id : E) return E is begin return Node16 (Id); end Entry_Formal; function Entry_Index_Constant (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Entry_Index_Parameter); return Node18 (Id); end Entry_Index_Constant; function Entry_Max_Queue_Lengths_Array (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Protected_Type); return Node35 (Id); end Entry_Max_Queue_Lengths_Array; function Contains_Ignored_Ghost_Code (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Block, E_Function, E_Generic_Function, E_Generic_Package, E_Generic_Procedure, E_Package, E_Package_Body, E_Procedure, E_Subprogram_Body)); return Flag279 (Id); end Contains_Ignored_Ghost_Code; function Contract (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Protected_Type, -- concurrent variants E_Task_Body, E_Task_Type) or else Ekind_In (Id, E_Constant, -- object variants E_Variable) or else Ekind_In (Id, E_Entry, -- overloadable variants E_Entry_Family, E_Function, E_Generic_Function, E_Generic_Procedure, E_Operator, E_Procedure, E_Subprogram_Body) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body) or else Ekind (Id) = E_Void); -- special purpose return Node34 (Id); end Contract; function Contract_Wrapper (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family)); return Node25 (Id); end Contract_Wrapper; function Entry_Parameters_Type (Id : E) return E is begin return Node15 (Id); end Entry_Parameters_Type; function Enum_Pos_To_Rep (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Enumeration_Type); return Node23 (Id); end Enum_Pos_To_Rep; function Enumeration_Pos (Id : E) return Uint is begin pragma Assert (Ekind (Id) = E_Enumeration_Literal); return Uint11 (Id); end Enumeration_Pos; function Enumeration_Rep (Id : E) return U is begin pragma Assert (Ekind (Id) = E_Enumeration_Literal); return Uint12 (Id); end Enumeration_Rep; function Enumeration_Rep_Expr (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Enumeration_Literal); return Node22 (Id); end Enumeration_Rep_Expr; function Equivalent_Type (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Class_Wide_Type, E_Class_Wide_Subtype, E_Access_Subprogram_Type, E_Access_Protected_Subprogram_Type, E_Anonymous_Access_Protected_Subprogram_Type, E_Access_Subprogram_Type, E_Exception_Type)); return Node18 (Id); end Equivalent_Type; function Esize (Id : E) return Uint is begin return Uint12 (Id); end Esize; function Extra_Accessibility (Id : E) return E is begin pragma Assert (Is_Formal (Id) or else Ekind_In (Id, E_Variable, E_Constant)); return Node13 (Id); end Extra_Accessibility; function Extra_Accessibility_Of_Result (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Function, E_Operator, E_Subprogram_Type)); return Node19 (Id); end Extra_Accessibility_Of_Result; function Extra_Constrained (Id : E) return E is begin pragma Assert (Is_Formal (Id) or else Ekind (Id) = E_Variable); return Node23 (Id); end Extra_Constrained; function Extra_Formal (Id : E) return E is begin return Node15 (Id); end Extra_Formal; function Extra_Formals (Id : E) return E is begin pragma Assert (Is_Overloadable (Id) or else Ekind_In (Id, E_Entry_Family, E_Subprogram_Body, E_Subprogram_Type)); return Node28 (Id); end Extra_Formals; function Can_Use_Internal_Rep (Id : E) return B is begin pragma Assert (Is_Access_Subprogram_Type (Base_Type (Id))); return Flag229 (Base_Type (Id)); end Can_Use_Internal_Rep; function Finalization_Master (Id : E) return E is begin pragma Assert (Is_Access_Type (Id)); return Node23 (Root_Type (Id)); end Finalization_Master; function Finalize_Storage_Only (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag158 (Base_Type (Id)); end Finalize_Storage_Only; function Finalizer (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Package, E_Package_Body)); return Node28 (Id); end Finalizer; function First_Entity (Id : E) return E is begin return Node17 (Id); end First_Entity; function First_Exit_Statement (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Loop); return Node8 (Id); end First_Exit_Statement; function First_Index (Id : E) return N is begin pragma Assert (Is_Array_Type (Id)); return Node17 (Id); end First_Index; function First_Literal (Id : E) return E is begin pragma Assert (Is_Enumeration_Type (Id)); return Node17 (Id); end First_Literal; function First_Private_Entity (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Package, E_Generic_Package) or else Ekind (Id) in Concurrent_Kind); return Node16 (Id); end First_Private_Entity; function First_Rep_Item (Id : E) return E is begin return Node6 (Id); end First_Rep_Item; function Freeze_Node (Id : E) return N is begin return Node7 (Id); end Freeze_Node; function From_Limited_With (Id : E) return B is begin return Flag159 (Id); end From_Limited_With; function Full_View (Id : E) return E is begin pragma Assert (Is_Type (Id) or else Ekind (Id) = E_Constant); return Node11 (Id); end Full_View; function Generic_Homonym (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Generic_Package); return Node11 (Id); end Generic_Homonym; function Generic_Renamings (Id : E) return L is begin return Elist23 (Id); end Generic_Renamings; function Handler_Records (Id : E) return S is begin return List10 (Id); end Handler_Records; function Has_Aliased_Components (Id : E) return B is begin return Flag135 (Implementation_Base_Type (Id)); end Has_Aliased_Components; function Has_Alignment_Clause (Id : E) return B is begin return Flag46 (Id); end Has_Alignment_Clause; function Has_All_Calls_Remote (Id : E) return B is begin return Flag79 (Id); end Has_All_Calls_Remote; function Has_Atomic_Components (Id : E) return B is begin return Flag86 (Implementation_Base_Type (Id)); end Has_Atomic_Components; function Has_Biased_Representation (Id : E) return B is begin return Flag139 (Id); end Has_Biased_Representation; function Has_Completion (Id : E) return B is begin return Flag26 (Id); end Has_Completion; function Has_Completion_In_Body (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag71 (Id); end Has_Completion_In_Body; function Has_Complex_Representation (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag140 (Implementation_Base_Type (Id)); end Has_Complex_Representation; function Has_Component_Size_Clause (Id : E) return B is begin pragma Assert (Is_Array_Type (Id)); return Flag68 (Implementation_Base_Type (Id)); end Has_Component_Size_Clause; function Has_Constrained_Partial_View (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag187 (Id); end Has_Constrained_Partial_View; function Has_Controlled_Component (Id : E) return B is begin return Flag43 (Base_Type (Id)); end Has_Controlled_Component; function Has_Contiguous_Rep (Id : E) return B is begin return Flag181 (Id); end Has_Contiguous_Rep; function Has_Controlling_Result (Id : E) return B is begin return Flag98 (Id); end Has_Controlling_Result; function Has_Convention_Pragma (Id : E) return B is begin return Flag119 (Id); end Has_Convention_Pragma; function Has_Default_Aspect (Id : E) return B is begin return Flag39 (Base_Type (Id)); end Has_Default_Aspect; function Has_Delayed_Aspects (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag200 (Id); end Has_Delayed_Aspects; function Has_Delayed_Freeze (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag18 (Id); end Has_Delayed_Freeze; function Has_Delayed_Rep_Aspects (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag261 (Id); end Has_Delayed_Rep_Aspects; function Has_Discriminants (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag5 (Id); end Has_Discriminants; function Has_Dispatch_Table (Id : E) return B is begin pragma Assert (Is_Tagged_Type (Id)); return Flag220 (Id); end Has_Dispatch_Table; function Has_Dynamic_Predicate_Aspect (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag258 (Id); end Has_Dynamic_Predicate_Aspect; function Has_Enumeration_Rep_Clause (Id : E) return B is begin pragma Assert (Is_Enumeration_Type (Id)); return Flag66 (Id); end Has_Enumeration_Rep_Clause; function Has_Exit (Id : E) return B is begin return Flag47 (Id); end Has_Exit; function Has_Expanded_Contract (Id : E) return B is begin pragma Assert (Is_Subprogram (Id)); return Flag240 (Id); end Has_Expanded_Contract; function Has_Forward_Instantiation (Id : E) return B is begin return Flag175 (Id); end Has_Forward_Instantiation; function Has_Fully_Qualified_Name (Id : E) return B is begin return Flag173 (Id); end Has_Fully_Qualified_Name; function Has_Gigi_Rep_Item (Id : E) return B is begin return Flag82 (Id); end Has_Gigi_Rep_Item; function Has_Homonym (Id : E) return B is begin return Flag56 (Id); end Has_Homonym; function Has_Implicit_Dereference (Id : E) return B is begin return Flag251 (Id); end Has_Implicit_Dereference; function Has_Independent_Components (Id : E) return B is begin return Flag34 (Implementation_Base_Type (Id)); end Has_Independent_Components; function Has_Inheritable_Invariants (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag248 (Base_Type (Id)); end Has_Inheritable_Invariants; function Has_Inherited_DIC (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag133 (Base_Type (Id)); end Has_Inherited_DIC; function Has_Inherited_Invariants (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag291 (Base_Type (Id)); end Has_Inherited_Invariants; function Has_Initial_Value (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Variable or else Is_Formal (Id)); return Flag219 (Id); end Has_Initial_Value; function Has_Loop_Entry_Attributes (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Loop); return Flag260 (Id); end Has_Loop_Entry_Attributes; function Has_Machine_Radix_Clause (Id : E) return B is begin pragma Assert (Is_Decimal_Fixed_Point_Type (Id)); return Flag83 (Id); end Has_Machine_Radix_Clause; function Has_Master_Entity (Id : E) return B is begin return Flag21 (Id); end Has_Master_Entity; function Has_Missing_Return (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Generic_Function)); return Flag142 (Id); end Has_Missing_Return; function Has_Nested_Block_With_Handler (Id : E) return B is begin return Flag101 (Id); end Has_Nested_Block_With_Handler; function Has_Nested_Subprogram (Id : E) return B is begin pragma Assert (Is_Subprogram (Id)); return Flag282 (Id); end Has_Nested_Subprogram; function Has_Non_Standard_Rep (Id : E) return B is begin return Flag75 (Implementation_Base_Type (Id)); end Has_Non_Standard_Rep; function Has_Object_Size_Clause (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag172 (Id); end Has_Object_Size_Clause; function Has_Out_Or_In_Out_Parameter (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family) or else Is_Subprogram_Or_Generic_Subprogram (Id)); return Flag110 (Id); end Has_Out_Or_In_Out_Parameter; function Has_Own_DIC (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag3 (Base_Type (Id)); end Has_Own_DIC; function Has_Own_Invariants (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag232 (Base_Type (Id)); end Has_Own_Invariants; function Has_Partial_Visible_Refinement (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Abstract_State); return Flag296 (Id); end Has_Partial_Visible_Refinement; function Has_Per_Object_Constraint (Id : E) return B is begin return Flag154 (Id); end Has_Per_Object_Constraint; function Has_Pragma_Controlled (Id : E) return B is begin pragma Assert (Is_Access_Type (Id)); return Flag27 (Implementation_Base_Type (Id)); end Has_Pragma_Controlled; function Has_Pragma_Elaborate_Body (Id : E) return B is begin return Flag150 (Id); end Has_Pragma_Elaborate_Body; function Has_Pragma_Inline (Id : E) return B is begin return Flag157 (Id); end Has_Pragma_Inline; function Has_Pragma_Inline_Always (Id : E) return B is begin return Flag230 (Id); end Has_Pragma_Inline_Always; function Has_Pragma_No_Inline (Id : E) return B is begin return Flag201 (Id); end Has_Pragma_No_Inline; function Has_Pragma_Ordered (Id : E) return B is begin pragma Assert (Is_Enumeration_Type (Id)); return Flag198 (Implementation_Base_Type (Id)); end Has_Pragma_Ordered; function Has_Pragma_Pack (Id : E) return B is begin pragma Assert (Is_Record_Type (Id) or else Is_Array_Type (Id)); return Flag121 (Implementation_Base_Type (Id)); end Has_Pragma_Pack; function Has_Pragma_Preelab_Init (Id : E) return B is begin return Flag221 (Id); end Has_Pragma_Preelab_Init; function Has_Pragma_Pure (Id : E) return B is begin return Flag203 (Id); end Has_Pragma_Pure; function Has_Pragma_Pure_Function (Id : E) return B is begin return Flag179 (Id); end Has_Pragma_Pure_Function; function Has_Pragma_Thread_Local_Storage (Id : E) return B is begin return Flag169 (Id); end Has_Pragma_Thread_Local_Storage; function Has_Pragma_Unmodified (Id : E) return B is begin return Flag233 (Id); end Has_Pragma_Unmodified; function Has_Pragma_Unreferenced (Id : E) return B is begin return Flag180 (Id); end Has_Pragma_Unreferenced; function Has_Pragma_Unreferenced_Objects (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag212 (Id); end Has_Pragma_Unreferenced_Objects; function Has_Pragma_Unused (Id : E) return B is begin return Flag294 (Id); end Has_Pragma_Unused; function Has_Predicates (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag250 (Id); end Has_Predicates; function Has_Primitive_Operations (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag120 (Base_Type (Id)); end Has_Primitive_Operations; function Has_Private_Ancestor (Id : E) return B is begin return Flag151 (Id); end Has_Private_Ancestor; function Has_Private_Declaration (Id : E) return B is begin return Flag155 (Id); end Has_Private_Declaration; function Has_Protected (Id : E) return B is begin return Flag271 (Base_Type (Id)); end Has_Protected; function Has_Qualified_Name (Id : E) return B is begin return Flag161 (Id); end Has_Qualified_Name; function Has_RACW (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Package); return Flag214 (Id); end Has_RACW; function Has_Record_Rep_Clause (Id : E) return B is begin pragma Assert (Is_Record_Type (Id)); return Flag65 (Implementation_Base_Type (Id)); end Has_Record_Rep_Clause; function Has_Recursive_Call (Id : E) return B is begin pragma Assert (Is_Subprogram (Id)); return Flag143 (Id); end Has_Recursive_Call; function Has_Shift_Operator (Id : E) return B is begin pragma Assert (Is_Integer_Type (Id)); return Flag267 (Base_Type (Id)); end Has_Shift_Operator; function Has_Size_Clause (Id : E) return B is begin return Flag29 (Id); end Has_Size_Clause; function Has_Small_Clause (Id : E) return B is begin pragma Assert (Is_Ordinary_Fixed_Point_Type (Id)); return Flag67 (Id); end Has_Small_Clause; function Has_Specified_Layout (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag100 (Implementation_Base_Type (Id)); end Has_Specified_Layout; function Has_Specified_Stream_Input (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag190 (Id); end Has_Specified_Stream_Input; function Has_Specified_Stream_Output (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag191 (Id); end Has_Specified_Stream_Output; function Has_Specified_Stream_Read (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag192 (Id); end Has_Specified_Stream_Read; function Has_Specified_Stream_Write (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag193 (Id); end Has_Specified_Stream_Write; function Has_Static_Discriminants (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag211 (Id); end Has_Static_Discriminants; function Has_Static_Predicate (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag269 (Id); end Has_Static_Predicate; function Has_Static_Predicate_Aspect (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag259 (Id); end Has_Static_Predicate_Aspect; function Has_Storage_Size_Clause (Id : E) return B is begin pragma Assert (Is_Access_Type (Id) or else Is_Task_Type (Id)); return Flag23 (Implementation_Base_Type (Id)); end Has_Storage_Size_Clause; function Has_Stream_Size_Clause (Id : E) return B is begin return Flag184 (Id); end Has_Stream_Size_Clause; function Has_Task (Id : E) return B is begin return Flag30 (Base_Type (Id)); end Has_Task; function Has_Thunks (Id : E) return B is begin return Flag228 (Id); end Has_Thunks; function Has_Timing_Event (Id : E) return B is begin return Flag289 (Base_Type (Id)); end Has_Timing_Event; function Has_Unchecked_Union (Id : E) return B is begin return Flag123 (Base_Type (Id)); end Has_Unchecked_Union; function Has_Unknown_Discriminants (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag72 (Id); end Has_Unknown_Discriminants; function Has_Visible_Refinement (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Abstract_State); return Flag263 (Id); end Has_Visible_Refinement; function Has_Volatile_Components (Id : E) return B is begin return Flag87 (Implementation_Base_Type (Id)); end Has_Volatile_Components; function Has_Xref_Entry (Id : E) return B is begin return Flag182 (Id); end Has_Xref_Entry; function Hiding_Loop_Variable (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Variable); return Node8 (Id); end Hiding_Loop_Variable; function Homonym (Id : E) return E is begin return Node4 (Id); end Homonym; function Import_Pragma (Id : E) return E is begin pragma Assert (Is_Subprogram (Id)); return Node35 (Id); end Import_Pragma; function Incomplete_Actuals (Id : E) return L is begin pragma Assert (Ekind (Id) = E_Package); return Elist24 (Id); end Incomplete_Actuals; function Interface_Alias (Id : E) return E is begin pragma Assert (Is_Subprogram (Id)); return Node25 (Id); end Interface_Alias; function Interfaces (Id : E) return L is begin pragma Assert (Is_Record_Type (Id)); return Elist25 (Id); end Interfaces; function In_Package_Body (Id : E) return B is begin return Flag48 (Id); end In_Package_Body; function In_Private_Part (Id : E) return B is begin return Flag45 (Id); end In_Private_Part; function In_Use (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag8 (Id); end In_Use; function Initialization_Statements (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); return Node28 (Id); end Initialization_Statements; function Inner_Instances (Id : E) return L is begin return Elist23 (Id); end Inner_Instances; function Interface_Name (Id : E) return N is begin return Node21 (Id); end Interface_Name; function Is_Abstract_Subprogram (Id : E) return B is begin pragma Assert (Is_Overloadable (Id)); return Flag19 (Id); end Is_Abstract_Subprogram; function Is_Abstract_Type (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag146 (Id); end Is_Abstract_Type; function Is_Access_Constant (Id : E) return B is begin pragma Assert (Is_Access_Type (Id)); return Flag69 (Id); end Is_Access_Constant; function Is_Actual_Subtype (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag293 (Id); end Is_Actual_Subtype; function Is_Ada_2005_Only (Id : E) return B is begin return Flag185 (Id); end Is_Ada_2005_Only; function Is_Ada_2012_Only (Id : E) return B is begin return Flag199 (Id); end Is_Ada_2012_Only; function Is_Aliased (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag15 (Id); end Is_Aliased; function Is_Asynchronous (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Procedure or else Is_Type (Id)); return Flag81 (Id); end Is_Asynchronous; function Is_Atomic (Id : E) return B is begin return Flag85 (Id); end Is_Atomic; function Is_Bit_Packed_Array (Id : E) return B is begin return Flag122 (Implementation_Base_Type (Id)); end Is_Bit_Packed_Array; function Is_Called (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Procedure, E_Function)); return Flag102 (Id); end Is_Called; function Is_Character_Type (Id : E) return B is begin return Flag63 (Id); end Is_Character_Type; function Is_Checked_Ghost_Entity (Id : E) return B is begin -- Allow this attribute to appear on unanalyzed entities pragma Assert (Nkind (Id) in N_Entity or else Ekind (Id) = E_Void); return Flag277 (Id); end Is_Checked_Ghost_Entity; function Is_Child_Unit (Id : E) return B is begin return Flag73 (Id); end Is_Child_Unit; function Is_Class_Wide_Equivalent_Type (Id : E) return B is begin return Flag35 (Id); end Is_Class_Wide_Equivalent_Type; function Is_Compilation_Unit (Id : E) return B is begin return Flag149 (Id); end Is_Compilation_Unit; function Is_Completely_Hidden (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Discriminant); return Flag103 (Id); end Is_Completely_Hidden; function Is_Constr_Subt_For_U_Nominal (Id : E) return B is begin return Flag80 (Id); end Is_Constr_Subt_For_U_Nominal; function Is_Constr_Subt_For_UN_Aliased (Id : E) return B is begin return Flag141 (Id); end Is_Constr_Subt_For_UN_Aliased; function Is_Constrained (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag12 (Id); end Is_Constrained; function Is_Constructor (Id : E) return B is begin return Flag76 (Id); end Is_Constructor; function Is_Controlled (Id : E) return B is begin return Flag42 (Base_Type (Id)); end Is_Controlled; function Is_Controlling_Formal (Id : E) return B is begin pragma Assert (Is_Formal (Id)); return Flag97 (Id); end Is_Controlling_Formal; function Is_CPP_Class (Id : E) return B is begin return Flag74 (Id); end Is_CPP_Class; function Is_DIC_Procedure (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Flag132 (Id); end Is_DIC_Procedure; function Is_Descendant_Of_Address (Id : E) return B is begin return Flag223 (Id); end Is_Descendant_Of_Address; function Is_Discrim_SO_Function (Id : E) return B is begin return Flag176 (Id); end Is_Discrim_SO_Function; function Is_Discriminant_Check_Function (Id : E) return B is begin return Flag264 (Id); end Is_Discriminant_Check_Function; function Is_Dispatch_Table_Entity (Id : E) return B is begin return Flag234 (Id); end Is_Dispatch_Table_Entity; function Is_Dispatching_Operation (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag6 (Id); end Is_Dispatching_Operation; function Is_Eliminated (Id : E) return B is begin return Flag124 (Id); end Is_Eliminated; function Is_Entry_Formal (Id : E) return B is begin return Flag52 (Id); end Is_Entry_Formal; function Is_Entry_Wrapper (Id : E) return B is begin return Flag297 (Id); end Is_Entry_Wrapper; function Is_Exception_Handler (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Block); return Flag286 (Id); end Is_Exception_Handler; function Is_Exported (Id : E) return B is begin return Flag99 (Id); end Is_Exported; function Is_Finalized_Transient (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Constant, E_Loop_Parameter, E_Variable)); return Flag252 (Id); end Is_Finalized_Transient; function Is_First_Subtype (Id : E) return B is begin return Flag70 (Id); end Is_First_Subtype; function Is_For_Access_Subtype (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Record_Subtype, E_Private_Subtype)); return Flag118 (Id); end Is_For_Access_Subtype; function Is_Formal_Subprogram (Id : E) return B is begin return Flag111 (Id); end Is_Formal_Subprogram; function Is_Frozen (Id : E) return B is begin return Flag4 (Id); end Is_Frozen; function Is_Generic_Actual_Subprogram (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Function or else Ekind (Id) = E_Procedure); return Flag274 (Id); end Is_Generic_Actual_Subprogram; function Is_Generic_Actual_Type (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag94 (Id); end Is_Generic_Actual_Type; function Is_Generic_Instance (Id : E) return B is begin return Flag130 (Id); end Is_Generic_Instance; function Is_Generic_Type (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag13 (Id); end Is_Generic_Type; function Is_Hidden (Id : E) return B is begin return Flag57 (Id); end Is_Hidden; function Is_Hidden_Non_Overridden_Subpgm (Id : E) return B is begin return Flag2 (Id); end Is_Hidden_Non_Overridden_Subpgm; function Is_Hidden_Open_Scope (Id : E) return B is begin return Flag171 (Id); end Is_Hidden_Open_Scope; function Is_Ignored_Ghost_Entity (Id : E) return B is begin -- Allow this attribute to appear on unanalyzed entities pragma Assert (Nkind (Id) in N_Entity or else Ekind (Id) = E_Void); return Flag278 (Id); end Is_Ignored_Ghost_Entity; function Is_Ignored_Transient (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Constant, E_Loop_Parameter, E_Variable)); return Flag295 (Id); end Is_Ignored_Transient; function Is_Immediately_Visible (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag7 (Id); end Is_Immediately_Visible; function Is_Implementation_Defined (Id : E) return B is begin return Flag254 (Id); end Is_Implementation_Defined; function Is_Imported (Id : E) return B is begin return Flag24 (Id); end Is_Imported; function Is_Independent (Id : E) return B is begin return Flag268 (Id); end Is_Independent; function Is_Inlined (Id : E) return B is begin return Flag11 (Id); end Is_Inlined; function Is_Inlined_Always (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Function or else Ekind (Id) = E_Procedure); return Flag1 (Id); end Is_Inlined_Always; function Is_Interface (Id : E) return B is begin return Flag186 (Id); end Is_Interface; function Is_Instantiated (Id : E) return B is begin return Flag126 (Id); end Is_Instantiated; function Is_Internal (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag17 (Id); end Is_Internal; function Is_Interrupt_Handler (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag89 (Id); end Is_Interrupt_Handler; function Is_Intrinsic_Subprogram (Id : E) return B is begin return Flag64 (Id); end Is_Intrinsic_Subprogram; function Is_Invariant_Procedure (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Flag257 (Id); end Is_Invariant_Procedure; function Is_Itype (Id : E) return B is begin return Flag91 (Id); end Is_Itype; function Is_Known_Non_Null (Id : E) return B is begin return Flag37 (Id); end Is_Known_Non_Null; function Is_Known_Null (Id : E) return B is begin return Flag204 (Id); end Is_Known_Null; function Is_Known_Valid (Id : E) return B is begin return Flag170 (Id); end Is_Known_Valid; function Is_Limited_Composite (Id : E) return B is begin return Flag106 (Id); end Is_Limited_Composite; function Is_Limited_Interface (Id : E) return B is begin return Flag197 (Id); end Is_Limited_Interface; function Is_Limited_Record (Id : E) return B is begin return Flag25 (Id); end Is_Limited_Record; function Is_Local_Anonymous_Access (Id : E) return B is begin pragma Assert (Is_Access_Type (Id)); return Flag194 (Id); end Is_Local_Anonymous_Access; function Is_Machine_Code_Subprogram (Id : E) return B is begin pragma Assert (Is_Subprogram (Id)); return Flag137 (Id); end Is_Machine_Code_Subprogram; function Is_Non_Static_Subtype (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag109 (Id); end Is_Non_Static_Subtype; function Is_Null_Init_Proc (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Procedure); return Flag178 (Id); end Is_Null_Init_Proc; function Is_Obsolescent (Id : E) return B is begin return Flag153 (Id); end Is_Obsolescent; function Is_Only_Out_Parameter (Id : E) return B is begin pragma Assert (Is_Formal (Id)); return Flag226 (Id); end Is_Only_Out_Parameter; function Is_Package_Body_Entity (Id : E) return B is begin return Flag160 (Id); end Is_Package_Body_Entity; function Is_Packed (Id : E) return B is begin return Flag51 (Implementation_Base_Type (Id)); end Is_Packed; function Is_Packed_Array_Impl_Type (Id : E) return B is begin return Flag138 (Id); end Is_Packed_Array_Impl_Type; function Is_Param_Block_Component_Type (Id : E) return B is begin pragma Assert (Is_Access_Type (Id)); return Flag215 (Base_Type (Id)); end Is_Param_Block_Component_Type; function Is_Partial_Invariant_Procedure (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Flag292 (Id); end Is_Partial_Invariant_Procedure; function Is_Potentially_Use_Visible (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag9 (Id); end Is_Potentially_Use_Visible; function Is_Predicate_Function (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Flag255 (Id); end Is_Predicate_Function; function Is_Predicate_Function_M (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Flag256 (Id); end Is_Predicate_Function_M; function Is_Preelaborated (Id : E) return B is begin return Flag59 (Id); end Is_Preelaborated; function Is_Primitive (Id : E) return B is begin pragma Assert (Is_Overloadable (Id) or else Ekind_In (Id, E_Generic_Function, E_Generic_Procedure)); return Flag218 (Id); end Is_Primitive; function Is_Primitive_Wrapper (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Flag195 (Id); end Is_Primitive_Wrapper; function Is_Private_Composite (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag107 (Id); end Is_Private_Composite; function Is_Private_Descendant (Id : E) return B is begin return Flag53 (Id); end Is_Private_Descendant; function Is_Private_Primitive (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); return Flag245 (Id); end Is_Private_Primitive; function Is_Public (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag10 (Id); end Is_Public; function Is_Pure (Id : E) return B is begin return Flag44 (Id); end Is_Pure; function Is_Pure_Unit_Access_Type (Id : E) return B is begin pragma Assert (Is_Access_Type (Id)); return Flag189 (Id); end Is_Pure_Unit_Access_Type; function Is_RACW_Stub_Type (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag244 (Id); end Is_RACW_Stub_Type; function Is_Raised (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Exception); return Flag224 (Id); end Is_Raised; function Is_Remote_Call_Interface (Id : E) return B is begin return Flag62 (Id); end Is_Remote_Call_Interface; function Is_Remote_Types (Id : E) return B is begin return Flag61 (Id); end Is_Remote_Types; function Is_Renaming_Of_Object (Id : E) return B is begin return Flag112 (Id); end Is_Renaming_Of_Object; function Is_Return_Object (Id : E) return B is begin return Flag209 (Id); end Is_Return_Object; function Is_Safe_To_Reevaluate (Id : E) return B is begin return Flag249 (Id); end Is_Safe_To_Reevaluate; function Is_Shared_Passive (Id : E) return B is begin return Flag60 (Id); end Is_Shared_Passive; function Is_Static_Type (Id : E) return B is begin return Flag281 (Id); end Is_Static_Type; function Is_Statically_Allocated (Id : E) return B is begin return Flag28 (Id); end Is_Statically_Allocated; function Is_Tag (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); return Flag78 (Id); end Is_Tag; function Is_Tagged_Type (Id : E) return B is begin return Flag55 (Id); end Is_Tagged_Type; function Is_Thunk (Id : E) return B is begin return Flag225 (Id); end Is_Thunk; function Is_Trivial_Subprogram (Id : E) return B is begin return Flag235 (Id); end Is_Trivial_Subprogram; function Is_True_Constant (Id : E) return B is begin return Flag163 (Id); end Is_True_Constant; function Is_Unchecked_Union (Id : E) return B is begin return Flag117 (Implementation_Base_Type (Id)); end Is_Unchecked_Union; function Is_Underlying_Full_View (Id : E) return B is begin return Flag298 (Id); end Is_Underlying_Full_View; function Is_Underlying_Record_View (Id : E) return B is begin return Flag246 (Id); end Is_Underlying_Record_View; function Is_Unimplemented (Id : E) return B is begin return Flag284 (Id); end Is_Unimplemented; function Is_Unsigned_Type (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag144 (Id); end Is_Unsigned_Type; function Is_Uplevel_Referenced_Entity (Id : E) return B is begin return Flag283 (Id); end Is_Uplevel_Referenced_Entity; function Is_Valued_Procedure (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Procedure); return Flag127 (Id); end Is_Valued_Procedure; function Is_Visible_Formal (Id : E) return B is begin return Flag206 (Id); end Is_Visible_Formal; function Is_Visible_Lib_Unit (Id : E) return B is begin return Flag116 (Id); end Is_Visible_Lib_Unit; function Is_Volatile (Id : E) return B is begin pragma Assert (Nkind (Id) in N_Entity); if Is_Type (Id) then return Flag16 (Base_Type (Id)); else return Flag16 (Id); end if; end Is_Volatile; function Is_Volatile_Full_Access (Id : E) return B is begin return Flag285 (Id); end Is_Volatile_Full_Access; function Itype_Printed (Id : E) return B is begin pragma Assert (Is_Itype (Id)); return Flag202 (Id); end Itype_Printed; function Kill_Elaboration_Checks (Id : E) return B is begin return Flag32 (Id); end Kill_Elaboration_Checks; function Kill_Range_Checks (Id : E) return B is begin return Flag33 (Id); end Kill_Range_Checks; function Known_To_Have_Preelab_Init (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag207 (Id); end Known_To_Have_Preelab_Init; function Last_Aggregate_Assignment (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); return Node30 (Id); end Last_Aggregate_Assignment; function Last_Assignment (Id : E) return N is begin pragma Assert (Is_Assignable (Id)); return Node26 (Id); end Last_Assignment; function Last_Entity (Id : E) return E is begin return Node20 (Id); end Last_Entity; function Limited_View (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Package); return Node23 (Id); end Limited_View; function Linker_Section_Pragma (Id : E) return N is begin pragma Assert (Is_Type (Id) or else Is_Object (Id) or else Is_Subprogram (Id)); return Node33 (Id); end Linker_Section_Pragma; function Lit_Indexes (Id : E) return E is begin pragma Assert (Is_Enumeration_Type (Id)); return Node18 (Id); end Lit_Indexes; function Lit_Strings (Id : E) return E is begin pragma Assert (Is_Enumeration_Type (Id)); return Node16 (Id); end Lit_Strings; function Low_Bound_Tested (Id : E) return B is begin return Flag205 (Id); end Low_Bound_Tested; function Machine_Radix_10 (Id : E) return B is begin pragma Assert (Is_Decimal_Fixed_Point_Type (Id)); return Flag84 (Id); end Machine_Radix_10; function Master_Id (Id : E) return E is begin pragma Assert (Is_Access_Type (Id)); return Node17 (Id); end Master_Id; function Materialize_Entity (Id : E) return B is begin return Flag168 (Id); end Materialize_Entity; function May_Inherit_Delayed_Rep_Aspects (Id : E) return B is begin return Flag262 (Id); end May_Inherit_Delayed_Rep_Aspects; function Mechanism (Id : E) return M is begin pragma Assert (Ekind (Id) = E_Function or else Is_Formal (Id)); return UI_To_Int (Uint8 (Id)); end Mechanism; function Modulus (Id : E) return Uint is begin pragma Assert (Is_Modular_Integer_Type (Id)); return Uint17 (Base_Type (Id)); end Modulus; function Must_Be_On_Byte_Boundary (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag183 (Id); end Must_Be_On_Byte_Boundary; function Must_Have_Preelab_Init (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag208 (Id); end Must_Have_Preelab_Init; function Needs_Debug_Info (Id : E) return B is begin return Flag147 (Id); end Needs_Debug_Info; function Needs_No_Actuals (Id : E) return B is begin pragma Assert (Is_Overloadable (Id) or else Ekind_In (Id, E_Subprogram_Type, E_Entry_Family)); return Flag22 (Id); end Needs_No_Actuals; function Never_Set_In_Source (Id : E) return B is begin return Flag115 (Id); end Never_Set_In_Source; function Next_Inlined_Subprogram (Id : E) return E is begin return Node12 (Id); end Next_Inlined_Subprogram; function No_Dynamic_Predicate_On_Actual (Id : E) return Boolean is begin pragma Assert (Is_Discrete_Type (Id)); return Flag276 (Id); end No_Dynamic_Predicate_On_Actual; function No_Pool_Assigned (Id : E) return B is begin pragma Assert (Is_Access_Type (Id)); return Flag131 (Root_Type (Id)); end No_Pool_Assigned; function No_Predicate_On_Actual (Id : E) return Boolean is begin pragma Assert (Is_Discrete_Type (Id)); return Flag275 (Id); end No_Predicate_On_Actual; function No_Return (Id : E) return B is begin return Flag113 (Id); end No_Return; function No_Strict_Aliasing (Id : E) return B is begin pragma Assert (Is_Access_Type (Id)); return Flag136 (Base_Type (Id)); end No_Strict_Aliasing; function No_Tagged_Streams_Pragma (Id : E) return N is begin pragma Assert (Is_Tagged_Type (Id)); return Node32 (Id); end No_Tagged_Streams_Pragma; function Non_Binary_Modulus (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag58 (Base_Type (Id)); end Non_Binary_Modulus; function Non_Limited_View (Id : E) return E is begin pragma Assert (Ekind (Id) in Incomplete_Kind or else Ekind (Id) in Class_Wide_Kind or else Ekind (Id) = E_Abstract_State); return Node19 (Id); end Non_Limited_View; function Nonzero_Is_True (Id : E) return B is begin pragma Assert (Root_Type (Id) = Standard_Boolean); return Flag162 (Base_Type (Id)); end Nonzero_Is_True; function Normalized_First_Bit (Id : E) return U is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); return Uint8 (Id); end Normalized_First_Bit; function Normalized_Position (Id : E) return U is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); return Uint14 (Id); end Normalized_Position; function Normalized_Position_Max (Id : E) return U is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); return Uint10 (Id); end Normalized_Position_Max; function OK_To_Rename (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Variable); return Flag247 (Id); end OK_To_Rename; function OK_To_Reorder_Components (Id : E) return B is begin pragma Assert (Is_Record_Type (Id)); return Flag239 (Base_Type (Id)); end OK_To_Reorder_Components; function Optimize_Alignment_Space (Id : E) return B is begin pragma Assert (Is_Type (Id) or else Ekind_In (Id, E_Constant, E_Variable)); return Flag241 (Id); end Optimize_Alignment_Space; function Optimize_Alignment_Time (Id : E) return B is begin pragma Assert (Is_Type (Id) or else Ekind_In (Id, E_Constant, E_Variable)); return Flag242 (Id); end Optimize_Alignment_Time; function Original_Access_Type (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Access_Subprogram_Type); return Node28 (Id); end Original_Access_Type; function Original_Array_Type (Id : E) return E is begin pragma Assert (Is_Array_Type (Id) or else Is_Modular_Integer_Type (Id)); return Node21 (Id); end Original_Array_Type; function Original_Protected_Subprogram (Id : E) return N is begin return Node41 (Id); end Original_Protected_Subprogram; function Original_Record_Component (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Void, E_Component, E_Discriminant)); return Node22 (Id); end Original_Record_Component; function Overlays_Constant (Id : E) return B is begin return Flag243 (Id); end Overlays_Constant; function Overridden_Operation (Id : E) return E is begin pragma Assert (Is_Subprogram (Id) or else Is_Generic_Subprogram (Id)); return Node26 (Id); end Overridden_Operation; function Package_Instantiation (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Package, E_Generic_Package)); return Node26 (Id); end Package_Instantiation; function Packed_Array_Impl_Type (Id : E) return E is begin pragma Assert (Is_Array_Type (Id)); return Node23 (Id); end Packed_Array_Impl_Type; function Parent_Subtype (Id : E) return E is begin pragma Assert (Is_Record_Type (Id)); return Node19 (Base_Type (Id)); end Parent_Subtype; function Part_Of_Constituents (Id : E) return L is begin pragma Assert (Ekind_In (Id, E_Abstract_State, E_Variable)); return Elist10 (Id); end Part_Of_Constituents; function Part_Of_References (Id : E) return L is begin pragma Assert (Ekind (Id) = E_Variable); return Elist11 (Id); end Part_Of_References; function Partial_View_Has_Unknown_Discr (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag280 (Id); end Partial_View_Has_Unknown_Discr; function Pending_Access_Types (Id : E) return L is begin pragma Assert (Is_Type (Id)); return Elist15 (Id); end Pending_Access_Types; function Postconditions_Proc (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family, E_Function, E_Procedure)); return Node14 (Id); end Postconditions_Proc; function Predicates_Ignored (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag288 (Id); end Predicates_Ignored; function Prival (Id : E) return E is begin pragma Assert (Is_Protected_Component (Id)); return Node17 (Id); end Prival; function Prival_Link (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); return Node20 (Id); end Prival_Link; function Private_Dependents (Id : E) return L is begin pragma Assert (Is_Incomplete_Or_Private_Type (Id)); return Elist18 (Id); end Private_Dependents; function Private_View (Id : E) return N is begin pragma Assert (Is_Private_Type (Id)); return Node22 (Id); end Private_View; function Protected_Body_Subprogram (Id : E) return E is begin pragma Assert (Is_Subprogram (Id) or else Is_Entry (Id)); return Node11 (Id); end Protected_Body_Subprogram; function Protected_Formal (Id : E) return E is begin pragma Assert (Is_Formal (Id)); return Node22 (Id); end Protected_Formal; function Protection_Object (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family, E_Function, E_Procedure)); return Node23 (Id); end Protection_Object; function Reachable (Id : E) return B is begin return Flag49 (Id); end Reachable; function Referenced (Id : E) return B is begin return Flag156 (Id); end Referenced; function Referenced_As_LHS (Id : E) return B is begin return Flag36 (Id); end Referenced_As_LHS; function Referenced_As_Out_Parameter (Id : E) return B is begin return Flag227 (Id); end Referenced_As_Out_Parameter; function Refinement_Constituents (Id : E) return L is begin pragma Assert (Ekind (Id) = E_Abstract_State); return Elist8 (Id); end Refinement_Constituents; function Register_Exception_Call (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Exception); return Node20 (Id); end Register_Exception_Call; function Related_Array_Object (Id : E) return E is begin pragma Assert (Is_Array_Type (Id)); return Node25 (Id); end Related_Array_Object; function Related_Expression (Id : E) return N is begin pragma Assert (Ekind (Id) in Type_Kind or else Ekind_In (Id, E_Constant, E_Variable)); return Node24 (Id); end Related_Expression; function Related_Instance (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Package, E_Package_Body)); return Node15 (Id); end Related_Instance; function Related_Type (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Component, E_Constant, E_Variable)); return Node27 (Id); end Related_Type; function Relative_Deadline_Variable (Id : E) return E is begin pragma Assert (Is_Task_Type (Id)); return Node28 (Implementation_Base_Type (Id)); end Relative_Deadline_Variable; function Renamed_Entity (Id : E) return N is begin return Node18 (Id); end Renamed_Entity; function Renamed_In_Spec (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Package); return Flag231 (Id); end Renamed_In_Spec; function Renamed_Object (Id : E) return N is begin return Node18 (Id); end Renamed_Object; function Renaming_Map (Id : E) return U is begin return Uint9 (Id); end Renaming_Map; function Requires_Overriding (Id : E) return B is begin pragma Assert (Is_Overloadable (Id)); return Flag213 (Id); end Requires_Overriding; function Return_Present (Id : E) return B is begin return Flag54 (Id); end Return_Present; function Return_Applies_To (Id : E) return N is begin return Node8 (Id); end Return_Applies_To; function Returns_By_Ref (Id : E) return B is begin return Flag90 (Id); end Returns_By_Ref; function Reverse_Bit_Order (Id : E) return B is begin pragma Assert (Is_Record_Type (Id)); return Flag164 (Base_Type (Id)); end Reverse_Bit_Order; function Reverse_Storage_Order (Id : E) return B is begin pragma Assert (Is_Record_Type (Id) or else Is_Array_Type (Id)); return Flag93 (Base_Type (Id)); end Reverse_Storage_Order; function Rewritten_For_C (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Function); return Flag287 (Id); end Rewritten_For_C; function RM_Size (Id : E) return U is begin pragma Assert (Is_Type (Id)); return Uint13 (Id); end RM_Size; function Scalar_Range (Id : E) return N is begin return Node20 (Id); end Scalar_Range; function Scale_Value (Id : E) return U is begin return Uint16 (Id); end Scale_Value; function Scope_Depth_Value (Id : E) return U is begin return Uint22 (Id); end Scope_Depth_Value; function Sec_Stack_Needed_For_Return (Id : E) return B is begin return Flag167 (Id); end Sec_Stack_Needed_For_Return; function Shadow_Entities (Id : E) return S is begin pragma Assert (Ekind_In (Id, E_Package, E_Generic_Package)); return List14 (Id); end Shadow_Entities; function Shared_Var_Procs_Instance (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Variable); return Node22 (Id); end Shared_Var_Procs_Instance; function Size_Check_Code (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); return Node19 (Id); end Size_Check_Code; function Size_Depends_On_Discriminant (Id : E) return B is begin return Flag177 (Id); end Size_Depends_On_Discriminant; function Size_Known_At_Compile_Time (Id : E) return B is begin return Flag92 (Id); end Size_Known_At_Compile_Time; function Small_Value (Id : E) return R is begin pragma Assert (Is_Fixed_Point_Type (Id)); return Ureal21 (Id); end Small_Value; function SPARK_Aux_Pragma (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Protected_Type, -- concurrent variants E_Task_Type) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body)); return Node41 (Id); end SPARK_Aux_Pragma; function SPARK_Aux_Pragma_Inherited (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Protected_Type, -- concurrent variants E_Task_Type) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body)); return Flag266 (Id); end SPARK_Aux_Pragma_Inherited; function SPARK_Pragma (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Protected_Body, -- concurrent variants E_Protected_Type, E_Task_Body, E_Task_Type) or else Ekind_In (Id, E_Entry, -- overloadable variants E_Entry_Family, E_Function, E_Generic_Function, E_Generic_Procedure, E_Operator, E_Procedure, E_Subprogram_Body) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body) or else Ekind (Id) = E_Variable); -- variable return Node40 (Id); end SPARK_Pragma; function SPARK_Pragma_Inherited (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Protected_Body, -- concurrent variants E_Protected_Type, E_Task_Body, E_Task_Type) or else Ekind_In (Id, E_Entry, -- overloadable variants E_Entry_Family, E_Function, E_Generic_Function, E_Generic_Procedure, E_Operator, E_Procedure, E_Subprogram_Body) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body) or else Ekind (Id) = E_Variable); -- variable return Flag265 (Id); end SPARK_Pragma_Inherited; function Spec_Entity (Id : E) return E is begin pragma Assert (Ekind (Id) = E_Package_Body or else Is_Formal (Id)); return Node19 (Id); end Spec_Entity; function SSO_Set_High_By_Default (Id : E) return B is begin pragma Assert (Is_Record_Type (Id) or else Is_Array_Type (Id)); return Flag273 (Base_Type (Id)); end SSO_Set_High_By_Default; function SSO_Set_Low_By_Default (Id : E) return B is begin pragma Assert (Is_Record_Type (Id) or else Is_Array_Type (Id)); return Flag272 (Base_Type (Id)); end SSO_Set_Low_By_Default; function Static_Discrete_Predicate (Id : E) return S is begin pragma Assert (Is_Discrete_Type (Id)); return List25 (Id); end Static_Discrete_Predicate; function Static_Real_Or_String_Predicate (Id : E) return N is begin pragma Assert (Is_Real_Type (Id) or else Is_String_Type (Id)); return Node25 (Id); end Static_Real_Or_String_Predicate; function Status_Flag_Or_Transient_Decl (Id : E) return N is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); return Node15 (Id); end Status_Flag_Or_Transient_Decl; function Storage_Size_Variable (Id : E) return E is begin pragma Assert (Is_Access_Type (Id) or else Is_Task_Type (Id)); return Node26 (Implementation_Base_Type (Id)); end Storage_Size_Variable; function Static_Elaboration_Desired (Id : E) return B is begin pragma Assert (Ekind (Id) = E_Package); return Flag77 (Id); end Static_Elaboration_Desired; function Static_Initialization (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Procedure and then not Is_Dispatching_Operation (Id)); return Node30 (Id); end Static_Initialization; function Stored_Constraint (Id : E) return L is begin pragma Assert (Is_Composite_Type (Id) and then not Is_Array_Type (Id)); return Elist23 (Id); end Stored_Constraint; function Stores_Attribute_Old_Prefix (Id : E) return B is begin return Flag270 (Id); end Stores_Attribute_Old_Prefix; function Strict_Alignment (Id : E) return B is begin return Flag145 (Implementation_Base_Type (Id)); end Strict_Alignment; function String_Literal_Length (Id : E) return U is begin return Uint16 (Id); end String_Literal_Length; function String_Literal_Low_Bound (Id : E) return N is begin return Node18 (Id); end String_Literal_Low_Bound; function Subprograms_For_Type (Id : E) return L is begin pragma Assert (Is_Type (Id)); return Elist29 (Id); end Subprograms_For_Type; function Subps_Index (Id : E) return U is begin pragma Assert (Is_Subprogram (Id)); return Uint24 (Id); end Subps_Index; function Suppress_Elaboration_Warnings (Id : E) return B is begin return Flag148 (Id); end Suppress_Elaboration_Warnings; function Suppress_Initialization (Id : E) return B is begin pragma Assert (Is_Type (Id) or else Ekind (Id) = E_Variable); return Flag105 (Id); end Suppress_Initialization; function Suppress_Style_Checks (Id : E) return B is begin return Flag165 (Id); end Suppress_Style_Checks; function Suppress_Value_Tracking_On_Call (Id : E) return B is begin return Flag217 (Id); end Suppress_Value_Tracking_On_Call; function Task_Body_Procedure (Id : E) return N is begin pragma Assert (Ekind (Id) in Task_Kind); return Node25 (Id); end Task_Body_Procedure; function Thunk_Entity (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure) and then Is_Thunk (Id)); return Node31 (Id); end Thunk_Entity; function Treat_As_Volatile (Id : E) return B is begin return Flag41 (Id); end Treat_As_Volatile; function Underlying_Full_View (Id : E) return E is begin pragma Assert (Ekind (Id) in Private_Kind); return Node19 (Id); end Underlying_Full_View; function Underlying_Record_View (Id : E) return E is begin return Node28 (Id); end Underlying_Record_View; function Universal_Aliasing (Id : E) return B is begin pragma Assert (Is_Type (Id)); return Flag216 (Implementation_Base_Type (Id)); end Universal_Aliasing; function Unset_Reference (Id : E) return N is begin return Node16 (Id); end Unset_Reference; function Used_As_Generic_Actual (Id : E) return B is begin return Flag222 (Id); end Used_As_Generic_Actual; function Uses_Lock_Free (Id : E) return B is begin pragma Assert (Is_Protected_Type (Id)); return Flag188 (Id); end Uses_Lock_Free; function Uses_Sec_Stack (Id : E) return B is begin return Flag95 (Id); end Uses_Sec_Stack; function Warnings_Off (Id : E) return B is begin return Flag96 (Id); end Warnings_Off; function Warnings_Off_Used (Id : E) return B is begin return Flag236 (Id); end Warnings_Off_Used; function Warnings_Off_Used_Unmodified (Id : E) return B is begin return Flag237 (Id); end Warnings_Off_Used_Unmodified; function Warnings_Off_Used_Unreferenced (Id : E) return B is begin return Flag238 (Id); end Warnings_Off_Used_Unreferenced; function Wrapped_Entity (Id : E) return E is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure) and then Is_Primitive_Wrapper (Id)); return Node27 (Id); end Wrapped_Entity; function Was_Hidden (Id : E) return B is begin return Flag196 (Id); end Was_Hidden; ------------------------------ -- Classification Functions -- ------------------------------ function Is_Access_Type (Id : E) return B is begin return Ekind (Id) in Access_Kind; end Is_Access_Type; function Is_Access_Protected_Subprogram_Type (Id : E) return B is begin return Ekind (Id) in Access_Protected_Kind; end Is_Access_Protected_Subprogram_Type; function Is_Access_Subprogram_Type (Id : E) return B is begin return Ekind (Id) in Access_Subprogram_Kind; end Is_Access_Subprogram_Type; function Is_Aggregate_Type (Id : E) return B is begin return Ekind (Id) in Aggregate_Kind; end Is_Aggregate_Type; function Is_Array_Type (Id : E) return B is begin return Ekind (Id) in Array_Kind; end Is_Array_Type; function Is_Assignable (Id : E) return B is begin return Ekind (Id) in Assignable_Kind; end Is_Assignable; function Is_Class_Wide_Type (Id : E) return B is begin return Ekind (Id) in Class_Wide_Kind; end Is_Class_Wide_Type; function Is_Composite_Type (Id : E) return B is begin return Ekind (Id) in Composite_Kind; end Is_Composite_Type; function Is_Concurrent_Body (Id : E) return B is begin return Ekind (Id) in Concurrent_Body_Kind; end Is_Concurrent_Body; function Is_Concurrent_Record_Type (Id : E) return B is begin return Flag20 (Id); end Is_Concurrent_Record_Type; function Is_Concurrent_Type (Id : E) return B is begin return Ekind (Id) in Concurrent_Kind; end Is_Concurrent_Type; function Is_Decimal_Fixed_Point_Type (Id : E) return B is begin return Ekind (Id) in Decimal_Fixed_Point_Kind; end Is_Decimal_Fixed_Point_Type; function Is_Digits_Type (Id : E) return B is begin return Ekind (Id) in Digits_Kind; end Is_Digits_Type; function Is_Discrete_Or_Fixed_Point_Type (Id : E) return B is begin return Ekind (Id) in Discrete_Or_Fixed_Point_Kind; end Is_Discrete_Or_Fixed_Point_Type; function Is_Discrete_Type (Id : E) return B is begin return Ekind (Id) in Discrete_Kind; end Is_Discrete_Type; function Is_Elementary_Type (Id : E) return B is begin return Ekind (Id) in Elementary_Kind; end Is_Elementary_Type; function Is_Entry (Id : E) return B is begin return Ekind (Id) in Entry_Kind; end Is_Entry; function Is_Enumeration_Type (Id : E) return B is begin return Ekind (Id) in Enumeration_Kind; end Is_Enumeration_Type; function Is_Fixed_Point_Type (Id : E) return B is begin return Ekind (Id) in Fixed_Point_Kind; end Is_Fixed_Point_Type; function Is_Floating_Point_Type (Id : E) return B is begin return Ekind (Id) in Float_Kind; end Is_Floating_Point_Type; function Is_Formal (Id : E) return B is begin return Ekind (Id) in Formal_Kind; end Is_Formal; function Is_Formal_Object (Id : E) return B is begin return Ekind (Id) in Formal_Object_Kind; end Is_Formal_Object; function Is_Generic_Subprogram (Id : E) return B is begin return Ekind (Id) in Generic_Subprogram_Kind; end Is_Generic_Subprogram; function Is_Generic_Unit (Id : E) return B is begin return Ekind (Id) in Generic_Unit_Kind; end Is_Generic_Unit; function Is_Ghost_Entity (Id : Entity_Id) return Boolean is begin return Is_Checked_Ghost_Entity (Id) or else Is_Ignored_Ghost_Entity (Id); end Is_Ghost_Entity; function Is_Incomplete_Or_Private_Type (Id : E) return B is begin return Ekind (Id) in Incomplete_Or_Private_Kind; end Is_Incomplete_Or_Private_Type; function Is_Incomplete_Type (Id : E) return B is begin return Ekind (Id) in Incomplete_Kind; end Is_Incomplete_Type; function Is_Integer_Type (Id : E) return B is begin return Ekind (Id) in Integer_Kind; end Is_Integer_Type; function Is_Modular_Integer_Type (Id : E) return B is begin return Ekind (Id) in Modular_Integer_Kind; end Is_Modular_Integer_Type; function Is_Named_Number (Id : E) return B is begin return Ekind (Id) in Named_Kind; end Is_Named_Number; function Is_Numeric_Type (Id : E) return B is begin return Ekind (Id) in Numeric_Kind; end Is_Numeric_Type; function Is_Object (Id : E) return B is begin return Ekind (Id) in Object_Kind; end Is_Object; function Is_Ordinary_Fixed_Point_Type (Id : E) return B is begin return Ekind (Id) in Ordinary_Fixed_Point_Kind; end Is_Ordinary_Fixed_Point_Type; function Is_Overloadable (Id : E) return B is begin return Ekind (Id) in Overloadable_Kind; end Is_Overloadable; function Is_Private_Type (Id : E) return B is begin return Ekind (Id) in Private_Kind; end Is_Private_Type; function Is_Protected_Type (Id : E) return B is begin return Ekind (Id) in Protected_Kind; end Is_Protected_Type; function Is_Real_Type (Id : E) return B is begin return Ekind (Id) in Real_Kind; end Is_Real_Type; function Is_Record_Type (Id : E) return B is begin return Ekind (Id) in Record_Kind; end Is_Record_Type; function Is_Scalar_Type (Id : E) return B is begin return Ekind (Id) in Scalar_Kind; end Is_Scalar_Type; function Is_Signed_Integer_Type (Id : E) return B is begin return Ekind (Id) in Signed_Integer_Kind; end Is_Signed_Integer_Type; function Is_Subprogram (Id : E) return B is begin return Ekind (Id) in Subprogram_Kind; end Is_Subprogram; function Is_Subprogram_Or_Generic_Subprogram (Id : E) return B is begin return Ekind (Id) in Subprogram_Kind or else Ekind (Id) in Generic_Subprogram_Kind; end Is_Subprogram_Or_Generic_Subprogram; function Is_Task_Type (Id : E) return B is begin return Ekind (Id) in Task_Kind; end Is_Task_Type; function Is_Type (Id : E) return B is begin return Ekind (Id) in Type_Kind; end Is_Type; ------------------------------ -- Attribute Set Procedures -- ------------------------------ -- Note: in many of these set procedures an "obvious" assertion is missing. -- The reason for this is that in many cases, a field is set before the -- Ekind field is set, so that the field is set when Ekind = E_Void. It -- it is possible to add assertions that specifically include the E_Void -- possibility, but in some cases, we just omit the assertions. procedure Set_Abstract_States (Id : E; V : L) is begin pragma Assert (Ekind_In (Id, E_Generic_Package, E_Package)); Set_Elist25 (Id, V); end Set_Abstract_States; procedure Set_Accept_Address (Id : E; V : L) is begin Set_Elist21 (Id, V); end Set_Accept_Address; procedure Set_Access_Disp_Table (Id : E; V : L) is begin pragma Assert (Ekind (Id) = E_Record_Type and then Id = Implementation_Base_Type (Id)); pragma Assert (V = No_Elist or else Is_Tagged_Type (Id)); Set_Elist16 (Id, V); end Set_Access_Disp_Table; procedure Set_Anonymous_Designated_Type (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Variable); Set_Node35 (Id, V); end Set_Anonymous_Designated_Type; procedure Set_Anonymous_Masters (Id : E; V : L) is begin pragma Assert (Ekind_In (Id, E_Function, E_Package, E_Procedure, E_Subprogram_Body)); Set_Elist29 (Id, V); end Set_Anonymous_Masters; procedure Set_Anonymous_Object (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Protected_Type, E_Task_Type)); Set_Node30 (Id, V); end Set_Anonymous_Object; procedure Set_Associated_Entity (Id : E; V : E) is begin Set_Node37 (Id, V); end Set_Associated_Entity; procedure Set_Associated_Formal_Package (Id : E; V : E) is begin Set_Node12 (Id, V); end Set_Associated_Formal_Package; procedure Set_Associated_Node_For_Itype (Id : E; V : E) is begin Set_Node8 (Id, V); end Set_Associated_Node_For_Itype; procedure Set_Associated_Storage_Pool (Id : E; V : E) is begin pragma Assert (Is_Access_Type (Id) and then Is_Base_Type (Id)); Set_Node22 (Id, V); end Set_Associated_Storage_Pool; procedure Set_Activation_Record_Component (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Constant, E_In_Parameter, E_In_Out_Parameter, E_Loop_Parameter, E_Out_Parameter, E_Variable)); Set_Node31 (Id, V); end Set_Activation_Record_Component; procedure Set_Actual_Subtype (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable, E_Generic_In_Out_Parameter) or else Is_Formal (Id)); Set_Node17 (Id, V); end Set_Actual_Subtype; procedure Set_Address_Taken (Id : E; V : B := True) is begin Set_Flag104 (Id, V); end Set_Address_Taken; procedure Set_Alias (Id : E; V : E) is begin pragma Assert (Is_Overloadable (Id) or else Ekind (Id) = E_Subprogram_Type); Set_Node18 (Id, V); end Set_Alias; procedure Set_Alignment (Id : E; V : U) is begin pragma Assert (Is_Type (Id) or else Is_Formal (Id) or else Ekind_In (Id, E_Loop_Parameter, E_Constant, E_Exception, E_Variable)); Set_Uint14 (Id, V); end Set_Alignment; procedure Set_Barrier_Function (Id : E; V : N) is begin pragma Assert (Is_Entry (Id)); Set_Node12 (Id, V); end Set_Barrier_Function; procedure Set_Block_Node (Id : E; V : N) is begin pragma Assert (Ekind (Id) = E_Block); Set_Node11 (Id, V); end Set_Block_Node; procedure Set_Body_Entity (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Package, E_Generic_Package)); Set_Node19 (Id, V); end Set_Body_Entity; procedure Set_Body_Needed_For_SAL (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Package or else Is_Subprogram (Id) or else Is_Generic_Unit (Id)); Set_Flag40 (Id, V); end Set_Body_Needed_For_SAL; procedure Set_Body_References (Id : E; V : L) is begin pragma Assert (Ekind (Id) = E_Abstract_State); Set_Elist16 (Id, V); end Set_Body_References; procedure Set_BIP_Initialization_Call (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); Set_Node29 (Id, V); end Set_BIP_Initialization_Call; procedure Set_C_Pass_By_Copy (Id : E; V : B := True) is begin pragma Assert (Is_Record_Type (Id) and then Is_Base_Type (Id)); Set_Flag125 (Id, V); end Set_C_Pass_By_Copy; procedure Set_Can_Never_Be_Null (Id : E; V : B := True) is begin Set_Flag38 (Id, V); end Set_Can_Never_Be_Null; procedure Set_Can_Use_Internal_Rep (Id : E; V : B := True) is begin pragma Assert (Is_Access_Subprogram_Type (Id) and then Is_Base_Type (Id)); Set_Flag229 (Id, V); end Set_Can_Use_Internal_Rep; procedure Set_Checks_May_Be_Suppressed (Id : E; V : B := True) is begin Set_Flag31 (Id, V); end Set_Checks_May_Be_Suppressed; procedure Set_Class_Wide_Preconds (Id : E; V : S) is begin pragma Assert (Is_Subprogram (Id)); Set_List38 (Id, V); end Set_Class_Wide_Preconds; procedure Set_Class_Wide_Postconds (Id : E; V : S) is begin pragma Assert (Is_Subprogram (Id)); Set_List39 (Id, V); end Set_Class_Wide_Postconds; procedure Set_Class_Wide_Type (Id : E; V : E) is begin pragma Assert (Is_Type (Id)); Set_Node9 (Id, V); end Set_Class_Wide_Type; procedure Set_Cloned_Subtype (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Record_Subtype, E_Class_Wide_Subtype)); Set_Node16 (Id, V); end Set_Cloned_Subtype; procedure Set_Component_Bit_Offset (Id : E; V : U) is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); Set_Uint11 (Id, V); end Set_Component_Bit_Offset; procedure Set_Component_Clause (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); Set_Node13 (Id, V); end Set_Component_Clause; procedure Set_Component_Size (Id : E; V : U) is begin pragma Assert (Is_Array_Type (Id) and then Is_Base_Type (Id)); Set_Uint22 (Id, V); end Set_Component_Size; procedure Set_Component_Type (Id : E; V : E) is begin pragma Assert (Is_Array_Type (Id) and then Is_Base_Type (Id)); Set_Node20 (Id, V); end Set_Component_Type; procedure Set_Contains_Ignored_Ghost_Code (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Block, E_Function, E_Generic_Function, E_Generic_Package, E_Generic_Procedure, E_Package, E_Package_Body, E_Procedure, E_Subprogram_Body)); Set_Flag279 (Id, V); end Set_Contains_Ignored_Ghost_Code; procedure Set_Contract (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Protected_Type, -- concurrent variants E_Task_Body, E_Task_Type) or else Ekind_In (Id, E_Constant, -- object variants E_Variable) or else Ekind_In (Id, E_Entry, -- overloadable variants E_Entry_Family, E_Function, E_Generic_Function, E_Generic_Procedure, E_Operator, E_Procedure, E_Subprogram_Body) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body) or else Ekind (Id) = E_Void); -- special purpose Set_Node34 (Id, V); end Set_Contract; procedure Set_Contract_Wrapper (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family)); Set_Node25 (Id, V); end Set_Contract_Wrapper; procedure Set_Corresponding_Concurrent_Type (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Record_Type and then Is_Concurrent_Type (V)); Set_Node18 (Id, V); end Set_Corresponding_Concurrent_Type; procedure Set_Corresponding_Discriminant (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Discriminant); Set_Node19 (Id, V); end Set_Corresponding_Discriminant; procedure Set_Corresponding_Equality (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Function and then not Comes_From_Source (Id) and then Chars (Id) = Name_Op_Ne); Set_Node30 (Id, V); end Set_Corresponding_Equality; procedure Set_Corresponding_Function (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Procedure and then Rewritten_For_C (V)); Set_Node32 (Id, V); end Set_Corresponding_Function; procedure Set_Corresponding_Procedure (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Function and then Rewritten_For_C (Id)); Set_Node32 (Id, V); end Set_Corresponding_Procedure; procedure Set_Corresponding_Protected_Entry (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Void, E_Subprogram_Body)); Set_Node18 (Id, V); end Set_Corresponding_Protected_Entry; procedure Set_Corresponding_Record_Type (Id : E; V : E) is begin pragma Assert (Is_Concurrent_Type (Id)); Set_Node18 (Id, V); end Set_Corresponding_Record_Type; procedure Set_Corresponding_Remote_Type (Id : E; V : E) is begin Set_Node22 (Id, V); end Set_Corresponding_Remote_Type; procedure Set_Current_Use_Clause (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Package or else Is_Type (Id)); Set_Node27 (Id, V); end Set_Current_Use_Clause; procedure Set_Current_Value (Id : E; V : N) is begin pragma Assert (Ekind (Id) in Object_Kind or else Ekind (Id) = E_Void); Set_Node9 (Id, V); end Set_Current_Value; procedure Set_CR_Discriminant (Id : E; V : E) is begin Set_Node23 (Id, V); end Set_CR_Discriminant; procedure Set_Debug_Info_Off (Id : E; V : B := True) is begin Set_Flag166 (Id, V); end Set_Debug_Info_Off; procedure Set_Debug_Renaming_Link (Id : E; V : E) is begin Set_Node25 (Id, V); end Set_Debug_Renaming_Link; procedure Set_Default_Aspect_Component_Value (Id : E; V : E) is begin pragma Assert (Is_Array_Type (Id) and then Is_Base_Type (Id)); Set_Node19 (Id, V); end Set_Default_Aspect_Component_Value; procedure Set_Default_Aspect_Value (Id : E; V : E) is begin pragma Assert (Is_Scalar_Type (Id) and then Is_Base_Type (Id)); Set_Node19 (Id, V); end Set_Default_Aspect_Value; procedure Set_Default_Expr_Function (Id : E; V : E) is begin pragma Assert (Is_Formal (Id)); Set_Node21 (Id, V); end Set_Default_Expr_Function; procedure Set_Default_Expressions_Processed (Id : E; V : B := True) is begin Set_Flag108 (Id, V); end Set_Default_Expressions_Processed; procedure Set_Default_Value (Id : E; V : N) is begin pragma Assert (Is_Formal (Id)); Set_Node20 (Id, V); end Set_Default_Value; procedure Set_Delay_Cleanups (Id : E; V : B := True) is begin pragma Assert (Is_Subprogram (Id) or else Is_Task_Type (Id) or else Ekind (Id) = E_Block); Set_Flag114 (Id, V); end Set_Delay_Cleanups; procedure Set_Delay_Subprogram_Descriptors (Id : E; V : B := True) is begin pragma Assert (Is_Subprogram (Id) or else Ekind_In (Id, E_Package, E_Package_Body)); Set_Flag50 (Id, V); end Set_Delay_Subprogram_Descriptors; procedure Set_Delta_Value (Id : E; V : R) is begin pragma Assert (Is_Fixed_Point_Type (Id)); Set_Ureal18 (Id, V); end Set_Delta_Value; procedure Set_Dependent_Instances (Id : E; V : L) is begin pragma Assert (Is_Generic_Instance (Id)); Set_Elist8 (Id, V); end Set_Dependent_Instances; procedure Set_Depends_On_Private (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag14 (Id, V); end Set_Depends_On_Private; procedure Set_Derived_Type_Link (Id : E; V : E) is begin pragma Assert (Is_Type (Id) and then Is_Base_Type (Id)); Set_Node31 (Id, V); end Set_Derived_Type_Link; procedure Set_Digits_Value (Id : E; V : U) is begin pragma Assert (Is_Floating_Point_Type (Id) or else Is_Decimal_Fixed_Point_Type (Id)); Set_Uint17 (Id, V); end Set_Digits_Value; procedure Set_Directly_Designated_Type (Id : E; V : E) is begin Set_Node20 (Id, V); end Set_Directly_Designated_Type; procedure Set_Disable_Controlled (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) and then Is_Base_Type (Id)); Set_Flag253 (Id, V); end Set_Disable_Controlled; procedure Set_Discard_Names (Id : E; V : B := True) is begin Set_Flag88 (Id, V); end Set_Discard_Names; procedure Set_Discriminal (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Discriminant); Set_Node17 (Id, V); end Set_Discriminal; procedure Set_Discriminal_Link (Id : E; V : E) is begin Set_Node10 (Id, V); end Set_Discriminal_Link; procedure Set_Discriminant_Checking_Func (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Component); Set_Node20 (Id, V); end Set_Discriminant_Checking_Func; procedure Set_Discriminant_Constraint (Id : E; V : L) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Elist21 (Id, V); end Set_Discriminant_Constraint; procedure Set_Discriminant_Default_Value (Id : E; V : N) is begin Set_Node20 (Id, V); end Set_Discriminant_Default_Value; procedure Set_Discriminant_Number (Id : E; V : U) is begin Set_Uint15 (Id, V); end Set_Discriminant_Number; procedure Set_Dispatch_Table_Wrappers (Id : E; V : L) is begin pragma Assert (Ekind (Id) = E_Record_Type and then Id = Implementation_Base_Type (Id)); pragma Assert (V = No_Elist or else Is_Tagged_Type (Id)); Set_Elist26 (Id, V); end Set_Dispatch_Table_Wrappers; procedure Set_DT_Entry_Count (Id : E; V : U) is begin pragma Assert (Ekind (Id) = E_Component); Set_Uint15 (Id, V); end Set_DT_Entry_Count; procedure Set_DT_Offset_To_Top_Func (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Component and then Is_Tag (Id)); Set_Node25 (Id, V); end Set_DT_Offset_To_Top_Func; procedure Set_DT_Position (Id : E; V : U) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Uint15 (Id, V); end Set_DT_Position; procedure Set_DTC_Entity (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Node16 (Id, V); end Set_DTC_Entity; procedure Set_Elaborate_Body_Desirable (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Package); Set_Flag210 (Id, V); end Set_Elaborate_Body_Desirable; procedure Set_Elaboration_Entity (Id : E; V : E) is begin pragma Assert (Is_Subprogram (Id) or else Ekind (Id) = E_Package or else Is_Generic_Unit (Id)); Set_Node13 (Id, V); end Set_Elaboration_Entity; procedure Set_Elaboration_Entity_Required (Id : E; V : B := True) is begin pragma Assert (Is_Subprogram (Id) or else Ekind (Id) = E_Package or else Is_Generic_Unit (Id)); Set_Flag174 (Id, V); end Set_Elaboration_Entity_Required; procedure Set_Encapsulating_State (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Abstract_State, E_Constant, E_Variable)); Set_Node32 (Id, V); end Set_Encapsulating_State; procedure Set_Enclosing_Scope (Id : E; V : E) is begin Set_Node18 (Id, V); end Set_Enclosing_Scope; procedure Set_Entry_Accepted (Id : E; V : B := True) is begin pragma Assert (Is_Entry (Id)); Set_Flag152 (Id, V); end Set_Entry_Accepted; procedure Set_Entry_Bodies_Array (Id : E; V : E) is begin Set_Node19 (Id, V); end Set_Entry_Bodies_Array; procedure Set_Entry_Cancel_Parameter (Id : E; V : E) is begin Set_Node23 (Id, V); end Set_Entry_Cancel_Parameter; procedure Set_Entry_Component (Id : E; V : E) is begin Set_Node11 (Id, V); end Set_Entry_Component; procedure Set_Entry_Formal (Id : E; V : E) is begin Set_Node16 (Id, V); end Set_Entry_Formal; procedure Set_Entry_Index_Constant (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Entry_Index_Parameter); Set_Node18 (Id, V); end Set_Entry_Index_Constant; procedure Set_Entry_Max_Queue_Lengths_Array (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Protected_Type); Set_Node35 (Id, V); end Set_Entry_Max_Queue_Lengths_Array; procedure Set_Entry_Parameters_Type (Id : E; V : E) is begin Set_Node15 (Id, V); end Set_Entry_Parameters_Type; procedure Set_Enum_Pos_To_Rep (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Enumeration_Type); Set_Node23 (Id, V); end Set_Enum_Pos_To_Rep; procedure Set_Enumeration_Pos (Id : E; V : U) is begin pragma Assert (Ekind (Id) = E_Enumeration_Literal); Set_Uint11 (Id, V); end Set_Enumeration_Pos; procedure Set_Enumeration_Rep (Id : E; V : U) is begin pragma Assert (Ekind (Id) = E_Enumeration_Literal); Set_Uint12 (Id, V); end Set_Enumeration_Rep; procedure Set_Enumeration_Rep_Expr (Id : E; V : N) is begin pragma Assert (Ekind (Id) = E_Enumeration_Literal); Set_Node22 (Id, V); end Set_Enumeration_Rep_Expr; procedure Set_Equivalent_Type (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Class_Wide_Type, E_Class_Wide_Subtype, E_Access_Protected_Subprogram_Type, E_Anonymous_Access_Protected_Subprogram_Type, E_Access_Subprogram_Type, E_Exception_Type)); Set_Node18 (Id, V); end Set_Equivalent_Type; procedure Set_Esize (Id : E; V : U) is begin Set_Uint12 (Id, V); end Set_Esize; procedure Set_Extra_Accessibility (Id : E; V : E) is begin pragma Assert (Is_Formal (Id) or else Ekind_In (Id, E_Variable, E_Constant)); Set_Node13 (Id, V); end Set_Extra_Accessibility; procedure Set_Extra_Accessibility_Of_Result (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Function, E_Operator, E_Subprogram_Type)); Set_Node19 (Id, V); end Set_Extra_Accessibility_Of_Result; procedure Set_Extra_Constrained (Id : E; V : E) is begin pragma Assert (Is_Formal (Id) or else Ekind (Id) = E_Variable); Set_Node23 (Id, V); end Set_Extra_Constrained; procedure Set_Extra_Formal (Id : E; V : E) is begin Set_Node15 (Id, V); end Set_Extra_Formal; procedure Set_Extra_Formals (Id : E; V : E) is begin pragma Assert (Is_Overloadable (Id) or else Ekind_In (Id, E_Entry_Family, E_Subprogram_Body, E_Subprogram_Type)); Set_Node28 (Id, V); end Set_Extra_Formals; procedure Set_Finalization_Master (Id : E; V : E) is begin pragma Assert (Is_Access_Type (Id) and then Is_Base_Type (Id)); Set_Node23 (Id, V); end Set_Finalization_Master; procedure Set_Finalize_Storage_Only (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) and then Is_Base_Type (Id)); Set_Flag158 (Id, V); end Set_Finalize_Storage_Only; procedure Set_Finalizer (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Package, E_Package_Body)); Set_Node28 (Id, V); end Set_Finalizer; procedure Set_First_Entity (Id : E; V : E) is begin Set_Node17 (Id, V); end Set_First_Entity; procedure Set_First_Exit_Statement (Id : E; V : N) is begin pragma Assert (Ekind (Id) = E_Loop); Set_Node8 (Id, V); end Set_First_Exit_Statement; procedure Set_First_Index (Id : E; V : N) is begin pragma Assert (Is_Array_Type (Id)); Set_Node17 (Id, V); end Set_First_Index; procedure Set_First_Literal (Id : E; V : E) is begin pragma Assert (Is_Enumeration_Type (Id)); Set_Node17 (Id, V); end Set_First_Literal; procedure Set_First_Private_Entity (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Package, E_Generic_Package) or else Ekind (Id) in Concurrent_Kind); Set_Node16 (Id, V); end Set_First_Private_Entity; procedure Set_First_Rep_Item (Id : E; V : N) is begin Set_Node6 (Id, V); end Set_First_Rep_Item; procedure Set_Float_Rep (Id : E; V : F) is pragma Assert (Ekind (Id) = E_Floating_Point_Type); begin Set_Uint10 (Id, UI_From_Int (F'Pos (V))); end Set_Float_Rep; procedure Set_Freeze_Node (Id : E; V : N) is begin Set_Node7 (Id, V); end Set_Freeze_Node; procedure Set_From_Limited_With (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) or else Ekind_In (Id, E_Abstract_State, E_Package)); Set_Flag159 (Id, V); end Set_From_Limited_With; procedure Set_Full_View (Id : E; V : E) is begin pragma Assert (Is_Type (Id) or else Ekind (Id) = E_Constant); Set_Node11 (Id, V); end Set_Full_View; procedure Set_Generic_Homonym (Id : E; V : E) is begin Set_Node11 (Id, V); end Set_Generic_Homonym; procedure Set_Generic_Renamings (Id : E; V : L) is begin Set_Elist23 (Id, V); end Set_Generic_Renamings; procedure Set_Handler_Records (Id : E; V : S) is begin Set_List10 (Id, V); end Set_Handler_Records; procedure Set_Has_Aliased_Components (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag135 (Id, V); end Set_Has_Aliased_Components; procedure Set_Has_Alignment_Clause (Id : E; V : B := True) is begin Set_Flag46 (Id, V); end Set_Has_Alignment_Clause; procedure Set_Has_All_Calls_Remote (Id : E; V : B := True) is begin Set_Flag79 (Id, V); end Set_Has_All_Calls_Remote; procedure Set_Has_Atomic_Components (Id : E; V : B := True) is begin pragma Assert (not Is_Type (Id) or else Is_Base_Type (Id)); Set_Flag86 (Id, V); end Set_Has_Atomic_Components; procedure Set_Has_Biased_Representation (Id : E; V : B := True) is begin pragma Assert ((V = False) or else (Is_Discrete_Type (Id) or else Is_Object (Id))); Set_Flag139 (Id, V); end Set_Has_Biased_Representation; procedure Set_Has_Completion (Id : E; V : B := True) is begin Set_Flag26 (Id, V); end Set_Has_Completion; procedure Set_Has_Completion_In_Body (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag71 (Id, V); end Set_Has_Completion_In_Body; procedure Set_Has_Complex_Representation (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Record_Type); Set_Flag140 (Id, V); end Set_Has_Complex_Representation; procedure Set_Has_Component_Size_Clause (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Array_Type); Set_Flag68 (Id, V); end Set_Has_Component_Size_Clause; procedure Set_Has_Constrained_Partial_View (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag187 (Id, V); end Set_Has_Constrained_Partial_View; procedure Set_Has_Contiguous_Rep (Id : E; V : B := True) is begin Set_Flag181 (Id, V); end Set_Has_Contiguous_Rep; procedure Set_Has_Controlled_Component (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag43 (Id, V); end Set_Has_Controlled_Component; procedure Set_Has_Controlling_Result (Id : E; V : B := True) is begin Set_Flag98 (Id, V); end Set_Has_Controlling_Result; procedure Set_Has_Convention_Pragma (Id : E; V : B := True) is begin Set_Flag119 (Id, V); end Set_Has_Convention_Pragma; procedure Set_Has_Default_Aspect (Id : E; V : B := True) is begin pragma Assert ((Is_Scalar_Type (Id) or else Is_Array_Type (Id)) and then Is_Base_Type (Id)); Set_Flag39 (Id, V); end Set_Has_Default_Aspect; procedure Set_Has_Delayed_Aspects (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag200 (Id, V); end Set_Has_Delayed_Aspects; procedure Set_Has_Delayed_Freeze (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag18 (Id, V); end Set_Has_Delayed_Freeze; procedure Set_Has_Delayed_Rep_Aspects (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag261 (Id, V); end Set_Has_Delayed_Rep_Aspects; procedure Set_Has_Discriminants (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag5 (Id, V); end Set_Has_Discriminants; procedure Set_Has_Dispatch_Table (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Record_Type and then Is_Tagged_Type (Id)); Set_Flag220 (Id, V); end Set_Has_Dispatch_Table; procedure Set_Has_Dynamic_Predicate_Aspect (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag258 (Id, V); end Set_Has_Dynamic_Predicate_Aspect; procedure Set_Has_Enumeration_Rep_Clause (Id : E; V : B := True) is begin pragma Assert (Is_Enumeration_Type (Id)); Set_Flag66 (Id, V); end Set_Has_Enumeration_Rep_Clause; procedure Set_Has_Exit (Id : E; V : B := True) is begin Set_Flag47 (Id, V); end Set_Has_Exit; procedure Set_Has_Expanded_Contract (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family, E_Function, E_Procedure)); Set_Flag240 (Id, V); end Set_Has_Expanded_Contract; procedure Set_Has_Forward_Instantiation (Id : E; V : B := True) is begin Set_Flag175 (Id, V); end Set_Has_Forward_Instantiation; procedure Set_Has_Fully_Qualified_Name (Id : E; V : B := True) is begin Set_Flag173 (Id, V); end Set_Has_Fully_Qualified_Name; procedure Set_Has_Gigi_Rep_Item (Id : E; V : B := True) is begin Set_Flag82 (Id, V); end Set_Has_Gigi_Rep_Item; procedure Set_Has_Homonym (Id : E; V : B := True) is begin Set_Flag56 (Id, V); end Set_Has_Homonym; procedure Set_Has_Implicit_Dereference (Id : E; V : B := True) is begin Set_Flag251 (Id, V); end Set_Has_Implicit_Dereference; procedure Set_Has_Independent_Components (Id : E; V : B := True) is begin pragma Assert (not Is_Type (Id) or else Is_Base_Type (Id)); Set_Flag34 (Id, V); end Set_Has_Independent_Components; procedure Set_Has_Inheritable_Invariants (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag248 (Base_Type (Id), V); end Set_Has_Inheritable_Invariants; procedure Set_Has_Inherited_DIC (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag133 (Base_Type (Id), V); end Set_Has_Inherited_DIC; procedure Set_Has_Inherited_Invariants (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag291 (Base_Type (Id), V); end Set_Has_Inherited_Invariants; procedure Set_Has_Initial_Value (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Variable, E_Out_Parameter)); Set_Flag219 (Id, V); end Set_Has_Initial_Value; procedure Set_Has_Loop_Entry_Attributes (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Loop); Set_Flag260 (Id, V); end Set_Has_Loop_Entry_Attributes; procedure Set_Has_Machine_Radix_Clause (Id : E; V : B := True) is begin pragma Assert (Is_Decimal_Fixed_Point_Type (Id)); Set_Flag83 (Id, V); end Set_Has_Machine_Radix_Clause; procedure Set_Has_Master_Entity (Id : E; V : B := True) is begin Set_Flag21 (Id, V); end Set_Has_Master_Entity; procedure Set_Has_Missing_Return (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Function, E_Generic_Function)); Set_Flag142 (Id, V); end Set_Has_Missing_Return; procedure Set_Has_Nested_Block_With_Handler (Id : E; V : B := True) is begin Set_Flag101 (Id, V); end Set_Has_Nested_Block_With_Handler; procedure Set_Has_Nested_Subprogram (Id : E; V : B := True) is begin pragma Assert (Is_Subprogram (Id)); Set_Flag282 (Id, V); end Set_Has_Nested_Subprogram; procedure Set_Has_Non_Standard_Rep (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag75 (Id, V); end Set_Has_Non_Standard_Rep; procedure Set_Has_Object_Size_Clause (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag172 (Id, V); end Set_Has_Object_Size_Clause; procedure Set_Has_Out_Or_In_Out_Parameter (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family) or else Is_Subprogram_Or_Generic_Subprogram (Id)); Set_Flag110 (Id, V); end Set_Has_Out_Or_In_Out_Parameter; procedure Set_Has_Own_DIC (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag3 (Base_Type (Id), V); end Set_Has_Own_DIC; procedure Set_Has_Own_Invariants (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag232 (Base_Type (Id), V); end Set_Has_Own_Invariants; procedure Set_Has_Partial_Visible_Refinement (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Abstract_State); Set_Flag296 (Id, V); end Set_Has_Partial_Visible_Refinement; procedure Set_Has_Per_Object_Constraint (Id : E; V : B := True) is begin Set_Flag154 (Id, V); end Set_Has_Per_Object_Constraint; procedure Set_Has_Pragma_Controlled (Id : E; V : B := True) is begin pragma Assert (Is_Access_Type (Id)); Set_Flag27 (Base_Type (Id), V); end Set_Has_Pragma_Controlled; procedure Set_Has_Pragma_Elaborate_Body (Id : E; V : B := True) is begin Set_Flag150 (Id, V); end Set_Has_Pragma_Elaborate_Body; procedure Set_Has_Pragma_Inline (Id : E; V : B := True) is begin Set_Flag157 (Id, V); end Set_Has_Pragma_Inline; procedure Set_Has_Pragma_Inline_Always (Id : E; V : B := True) is begin Set_Flag230 (Id, V); end Set_Has_Pragma_Inline_Always; procedure Set_Has_Pragma_No_Inline (Id : E; V : B := True) is begin Set_Flag201 (Id, V); end Set_Has_Pragma_No_Inline; procedure Set_Has_Pragma_Ordered (Id : E; V : B := True) is begin pragma Assert (Is_Enumeration_Type (Id)); pragma Assert (Id = Base_Type (Id)); Set_Flag198 (Id, V); end Set_Has_Pragma_Ordered; procedure Set_Has_Pragma_Pack (Id : E; V : B := True) is begin pragma Assert (Is_Array_Type (Id) or else Is_Record_Type (Id)); pragma Assert (Id = Base_Type (Id)); Set_Flag121 (Id, V); end Set_Has_Pragma_Pack; procedure Set_Has_Pragma_Preelab_Init (Id : E; V : B := True) is begin Set_Flag221 (Id, V); end Set_Has_Pragma_Preelab_Init; procedure Set_Has_Pragma_Pure (Id : E; V : B := True) is begin Set_Flag203 (Id, V); end Set_Has_Pragma_Pure; procedure Set_Has_Pragma_Pure_Function (Id : E; V : B := True) is begin Set_Flag179 (Id, V); end Set_Has_Pragma_Pure_Function; procedure Set_Has_Pragma_Thread_Local_Storage (Id : E; V : B := True) is begin Set_Flag169 (Id, V); end Set_Has_Pragma_Thread_Local_Storage; procedure Set_Has_Pragma_Unmodified (Id : E; V : B := True) is begin Set_Flag233 (Id, V); end Set_Has_Pragma_Unmodified; procedure Set_Has_Pragma_Unreferenced (Id : E; V : B := True) is begin Set_Flag180 (Id, V); end Set_Has_Pragma_Unreferenced; procedure Set_Has_Pragma_Unreferenced_Objects (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag212 (Id, V); end Set_Has_Pragma_Unreferenced_Objects; procedure Set_Has_Pragma_Unused (Id : E; V : B := True) is begin Set_Flag294 (Id, V); end Set_Has_Pragma_Unused; procedure Set_Has_Predicates (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) or else Ekind (Id) = E_Void); Set_Flag250 (Id, V); end Set_Has_Predicates; procedure Set_Has_Primitive_Operations (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag120 (Id, V); end Set_Has_Primitive_Operations; procedure Set_Has_Private_Ancestor (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag151 (Id, V); end Set_Has_Private_Ancestor; procedure Set_Has_Private_Declaration (Id : E; V : B := True) is begin Set_Flag155 (Id, V); end Set_Has_Private_Declaration; procedure Set_Has_Protected (Id : E; V : B := True) is begin Set_Flag271 (Id, V); end Set_Has_Protected; procedure Set_Has_Qualified_Name (Id : E; V : B := True) is begin Set_Flag161 (Id, V); end Set_Has_Qualified_Name; procedure Set_Has_RACW (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Package); Set_Flag214 (Id, V); end Set_Has_RACW; procedure Set_Has_Record_Rep_Clause (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag65 (Id, V); end Set_Has_Record_Rep_Clause; procedure Set_Has_Recursive_Call (Id : E; V : B := True) is begin pragma Assert (Is_Subprogram (Id)); Set_Flag143 (Id, V); end Set_Has_Recursive_Call; procedure Set_Has_Shift_Operator (Id : E; V : B := True) is begin pragma Assert (Is_Integer_Type (Id) and then Is_Base_Type (Id)); Set_Flag267 (Id, V); end Set_Has_Shift_Operator; procedure Set_Has_Size_Clause (Id : E; V : B := True) is begin Set_Flag29 (Id, V); end Set_Has_Size_Clause; procedure Set_Has_Small_Clause (Id : E; V : B := True) is begin pragma Assert (Is_Ordinary_Fixed_Point_Type (Id)); Set_Flag67 (Id, V); end Set_Has_Small_Clause; procedure Set_Has_Specified_Layout (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag100 (Id, V); end Set_Has_Specified_Layout; procedure Set_Has_Specified_Stream_Input (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag190 (Id, V); end Set_Has_Specified_Stream_Input; procedure Set_Has_Specified_Stream_Output (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag191 (Id, V); end Set_Has_Specified_Stream_Output; procedure Set_Has_Specified_Stream_Read (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag192 (Id, V); end Set_Has_Specified_Stream_Read; procedure Set_Has_Specified_Stream_Write (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag193 (Id, V); end Set_Has_Specified_Stream_Write; procedure Set_Has_Static_Discriminants (Id : E; V : B := True) is begin Set_Flag211 (Id, V); end Set_Has_Static_Discriminants; procedure Set_Has_Static_Predicate (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag269 (Id, V); end Set_Has_Static_Predicate; procedure Set_Has_Static_Predicate_Aspect (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag259 (Id, V); end Set_Has_Static_Predicate_Aspect; procedure Set_Has_Storage_Size_Clause (Id : E; V : B := True) is begin pragma Assert (Is_Access_Type (Id) or else Is_Task_Type (Id)); pragma Assert (Id = Base_Type (Id)); Set_Flag23 (Id, V); end Set_Has_Storage_Size_Clause; procedure Set_Has_Stream_Size_Clause (Id : E; V : B := True) is begin pragma Assert (Is_Elementary_Type (Id)); Set_Flag184 (Id, V); end Set_Has_Stream_Size_Clause; procedure Set_Has_Task (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag30 (Id, V); end Set_Has_Task; procedure Set_Has_Thunks (Id : E; V : B := True) is begin pragma Assert (Is_Tag (Id)); Set_Flag228 (Id, V); end Set_Has_Thunks; procedure Set_Has_Timing_Event (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag289 (Id, V); end Set_Has_Timing_Event; procedure Set_Has_Unchecked_Union (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag123 (Id, V); end Set_Has_Unchecked_Union; procedure Set_Has_Unknown_Discriminants (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag72 (Id, V); end Set_Has_Unknown_Discriminants; procedure Set_Has_Visible_Refinement (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Abstract_State); Set_Flag263 (Id, V); end Set_Has_Visible_Refinement; procedure Set_Has_Volatile_Components (Id : E; V : B := True) is begin pragma Assert (not Is_Type (Id) or else Is_Base_Type (Id)); Set_Flag87 (Id, V); end Set_Has_Volatile_Components; procedure Set_Has_Xref_Entry (Id : E; V : B := True) is begin Set_Flag182 (Id, V); end Set_Has_Xref_Entry; procedure Set_Hiding_Loop_Variable (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Variable); Set_Node8 (Id, V); end Set_Hiding_Loop_Variable; procedure Set_Homonym (Id : E; V : E) is begin pragma Assert (Id /= V); Set_Node4 (Id, V); end Set_Homonym; procedure Set_Incomplete_Actuals (Id : E; V : L) is begin pragma Assert (Ekind (Id) = E_Package); Set_Elist24 (Id, V); end Set_Incomplete_Actuals; procedure Set_Import_Pragma (Id : E; V : E) is begin pragma Assert (Is_Subprogram (Id)); Set_Node35 (Id, V); end Set_Import_Pragma; procedure Set_Interface_Alias (Id : E; V : E) is begin pragma Assert (Is_Internal (Id) and then Is_Hidden (Id) and then (Ekind_In (Id, E_Procedure, E_Function))); Set_Node25 (Id, V); end Set_Interface_Alias; procedure Set_Interfaces (Id : E; V : L) is begin pragma Assert (Is_Record_Type (Id)); Set_Elist25 (Id, V); end Set_Interfaces; procedure Set_In_Package_Body (Id : E; V : B := True) is begin Set_Flag48 (Id, V); end Set_In_Package_Body; procedure Set_In_Private_Part (Id : E; V : B := True) is begin Set_Flag45 (Id, V); end Set_In_Private_Part; procedure Set_In_Use (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag8 (Id, V); end Set_In_Use; procedure Set_Initialization_Statements (Id : E; V : N) is begin -- Tolerate an E_Void entity since this can be called while resolving -- an aggregate used as the initialization expression for an object -- declaration, and this occurs before the Ekind for the object is set. pragma Assert (Ekind_In (Id, E_Void, E_Constant, E_Variable)); Set_Node28 (Id, V); end Set_Initialization_Statements; procedure Set_Inner_Instances (Id : E; V : L) is begin Set_Elist23 (Id, V); end Set_Inner_Instances; procedure Set_Interface_Name (Id : E; V : N) is begin Set_Node21 (Id, V); end Set_Interface_Name; procedure Set_Is_Abstract_Subprogram (Id : E; V : B := True) is begin pragma Assert (Is_Overloadable (Id)); Set_Flag19 (Id, V); end Set_Is_Abstract_Subprogram; procedure Set_Is_Abstract_Type (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag146 (Id, V); end Set_Is_Abstract_Type; procedure Set_Is_Local_Anonymous_Access (Id : E; V : B := True) is begin pragma Assert (Is_Access_Type (Id)); Set_Flag194 (Id, V); end Set_Is_Local_Anonymous_Access; procedure Set_Is_Access_Constant (Id : E; V : B := True) is begin pragma Assert (Is_Access_Type (Id)); Set_Flag69 (Id, V); end Set_Is_Access_Constant; procedure Set_Is_Actual_Subtype (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag293 (Id, V); end Set_Is_Actual_Subtype; procedure Set_Is_Ada_2005_Only (Id : E; V : B := True) is begin Set_Flag185 (Id, V); end Set_Is_Ada_2005_Only; procedure Set_Is_Ada_2012_Only (Id : E; V : B := True) is begin Set_Flag199 (Id, V); end Set_Is_Ada_2012_Only; procedure Set_Is_Aliased (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag15 (Id, V); end Set_Is_Aliased; procedure Set_Is_Asynchronous (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Procedure or else Is_Type (Id)); Set_Flag81 (Id, V); end Set_Is_Asynchronous; procedure Set_Is_Atomic (Id : E; V : B := True) is begin Set_Flag85 (Id, V); end Set_Is_Atomic; procedure Set_Is_Bit_Packed_Array (Id : E; V : B := True) is begin pragma Assert ((not V) or else (Is_Array_Type (Id) and then Is_Base_Type (Id))); Set_Flag122 (Id, V); end Set_Is_Bit_Packed_Array; procedure Set_Is_Called (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Procedure, E_Function)); Set_Flag102 (Id, V); end Set_Is_Called; procedure Set_Is_Character_Type (Id : E; V : B := True) is begin Set_Flag63 (Id, V); end Set_Is_Character_Type; procedure Set_Is_Checked_Ghost_Entity (Id : E; V : B := True) is begin -- Allow this attribute to appear on unanalyzed entities pragma Assert (Nkind (Id) in N_Entity or else Ekind (Id) = E_Void); Set_Flag277 (Id, V); end Set_Is_Checked_Ghost_Entity; procedure Set_Is_Child_Unit (Id : E; V : B := True) is begin Set_Flag73 (Id, V); end Set_Is_Child_Unit; procedure Set_Is_Class_Wide_Equivalent_Type (Id : E; V : B := True) is begin Set_Flag35 (Id, V); end Set_Is_Class_Wide_Equivalent_Type; procedure Set_Is_Compilation_Unit (Id : E; V : B := True) is begin Set_Flag149 (Id, V); end Set_Is_Compilation_Unit; procedure Set_Is_Completely_Hidden (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Discriminant); Set_Flag103 (Id, V); end Set_Is_Completely_Hidden; procedure Set_Is_Concurrent_Record_Type (Id : E; V : B := True) is begin Set_Flag20 (Id, V); end Set_Is_Concurrent_Record_Type; procedure Set_Is_Constr_Subt_For_U_Nominal (Id : E; V : B := True) is begin Set_Flag80 (Id, V); end Set_Is_Constr_Subt_For_U_Nominal; procedure Set_Is_Constr_Subt_For_UN_Aliased (Id : E; V : B := True) is begin Set_Flag141 (Id, V); end Set_Is_Constr_Subt_For_UN_Aliased; procedure Set_Is_Constrained (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag12 (Id, V); end Set_Is_Constrained; procedure Set_Is_Constructor (Id : E; V : B := True) is begin Set_Flag76 (Id, V); end Set_Is_Constructor; procedure Set_Is_Controlled (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag42 (Id, V); end Set_Is_Controlled; procedure Set_Is_Controlling_Formal (Id : E; V : B := True) is begin pragma Assert (Is_Formal (Id)); Set_Flag97 (Id, V); end Set_Is_Controlling_Formal; procedure Set_Is_CPP_Class (Id : E; V : B := True) is begin Set_Flag74 (Id, V); end Set_Is_CPP_Class; procedure Set_Is_DIC_Procedure (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Procedure); Set_Flag132 (Id, V); end Set_Is_DIC_Procedure; procedure Set_Is_Descendant_Of_Address (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag223 (Id, V); end Set_Is_Descendant_Of_Address; procedure Set_Is_Discrim_SO_Function (Id : E; V : B := True) is begin Set_Flag176 (Id, V); end Set_Is_Discrim_SO_Function; procedure Set_Is_Discriminant_Check_Function (Id : E; V : B := True) is begin Set_Flag264 (Id, V); end Set_Is_Discriminant_Check_Function; procedure Set_Is_Dispatch_Table_Entity (Id : E; V : B := True) is begin Set_Flag234 (Id, V); end Set_Is_Dispatch_Table_Entity; procedure Set_Is_Dispatching_Operation (Id : E; V : B := True) is begin pragma Assert (V = False or else Is_Overloadable (Id) or else Ekind (Id) = E_Subprogram_Type); Set_Flag6 (Id, V); end Set_Is_Dispatching_Operation; procedure Set_Is_Eliminated (Id : E; V : B := True) is begin Set_Flag124 (Id, V); end Set_Is_Eliminated; procedure Set_Is_Entry_Formal (Id : E; V : B := True) is begin Set_Flag52 (Id, V); end Set_Is_Entry_Formal; procedure Set_Is_Entry_Wrapper (Id : E; V : B := True) is begin Set_Flag297 (Id, V); end Set_Is_Entry_Wrapper; procedure Set_Is_Exception_Handler (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Block); Set_Flag286 (Id, V); end Set_Is_Exception_Handler; procedure Set_Is_Exported (Id : E; V : B := True) is begin Set_Flag99 (Id, V); end Set_Is_Exported; procedure Set_Is_Finalized_Transient (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Loop_Parameter, E_Variable)); Set_Flag252 (Id, V); end Set_Is_Finalized_Transient; procedure Set_Is_First_Subtype (Id : E; V : B := True) is begin Set_Flag70 (Id, V); end Set_Is_First_Subtype; procedure Set_Is_For_Access_Subtype (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Record_Subtype, E_Private_Subtype)); Set_Flag118 (Id, V); end Set_Is_For_Access_Subtype; procedure Set_Is_Formal_Subprogram (Id : E; V : B := True) is begin Set_Flag111 (Id, V); end Set_Is_Formal_Subprogram; procedure Set_Is_Frozen (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag4 (Id, V); end Set_Is_Frozen; procedure Set_Is_Generic_Actual_Subprogram (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Flag274 (Id, V); end Set_Is_Generic_Actual_Subprogram; procedure Set_Is_Generic_Actual_Type (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag94 (Id, V); end Set_Is_Generic_Actual_Type; procedure Set_Is_Generic_Instance (Id : E; V : B := True) is begin Set_Flag130 (Id, V); end Set_Is_Generic_Instance; procedure Set_Is_Generic_Type (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag13 (Id, V); end Set_Is_Generic_Type; procedure Set_Is_Hidden (Id : E; V : B := True) is begin Set_Flag57 (Id, V); end Set_Is_Hidden; procedure Set_Is_Hidden_Non_Overridden_Subpgm (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Flag2 (Id, V); end Set_Is_Hidden_Non_Overridden_Subpgm; procedure Set_Is_Hidden_Open_Scope (Id : E; V : B := True) is begin Set_Flag171 (Id, V); end Set_Is_Hidden_Open_Scope; procedure Set_Is_Ignored_Ghost_Entity (Id : E; V : B := True) is begin -- Allow this attribute to appear on unanalyzed entities pragma Assert (Nkind (Id) in N_Entity or else Ekind (Id) = E_Void); Set_Flag278 (Id, V); end Set_Is_Ignored_Ghost_Entity; procedure Set_Is_Ignored_Transient (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Loop_Parameter, E_Variable)); Set_Flag295 (Id, V); end Set_Is_Ignored_Transient; procedure Set_Is_Immediately_Visible (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag7 (Id, V); end Set_Is_Immediately_Visible; procedure Set_Is_Implementation_Defined (Id : E; V : B := True) is begin Set_Flag254 (Id, V); end Set_Is_Implementation_Defined; procedure Set_Is_Imported (Id : E; V : B := True) is begin Set_Flag24 (Id, V); end Set_Is_Imported; procedure Set_Is_Independent (Id : E; V : B := True) is begin Set_Flag268 (Id, V); end Set_Is_Independent; procedure Set_Is_Inlined (Id : E; V : B := True) is begin Set_Flag11 (Id, V); end Set_Is_Inlined; procedure Set_Is_Inlined_Always (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Function or else Ekind (Id) = E_Procedure); Set_Flag1 (Id, V); end Set_Is_Inlined_Always; procedure Set_Is_Interface (Id : E; V : B := True) is begin pragma Assert (Is_Record_Type (Id)); Set_Flag186 (Id, V); end Set_Is_Interface; procedure Set_Is_Instantiated (Id : E; V : B := True) is begin Set_Flag126 (Id, V); end Set_Is_Instantiated; procedure Set_Is_Internal (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag17 (Id, V); end Set_Is_Internal; procedure Set_Is_Interrupt_Handler (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag89 (Id, V); end Set_Is_Interrupt_Handler; procedure Set_Is_Intrinsic_Subprogram (Id : E; V : B := True) is begin Set_Flag64 (Id, V); end Set_Is_Intrinsic_Subprogram; procedure Set_Is_Invariant_Procedure (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Procedure); Set_Flag257 (Id, V); end Set_Is_Invariant_Procedure; procedure Set_Is_Itype (Id : E; V : B := True) is begin Set_Flag91 (Id, V); end Set_Is_Itype; procedure Set_Is_Known_Non_Null (Id : E; V : B := True) is begin Set_Flag37 (Id, V); end Set_Is_Known_Non_Null; procedure Set_Is_Known_Null (Id : E; V : B := True) is begin Set_Flag204 (Id, V); end Set_Is_Known_Null; procedure Set_Is_Known_Valid (Id : E; V : B := True) is begin Set_Flag170 (Id, V); end Set_Is_Known_Valid; procedure Set_Is_Limited_Composite (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag106 (Id, V); end Set_Is_Limited_Composite; procedure Set_Is_Limited_Interface (Id : E; V : B := True) is begin pragma Assert (Is_Interface (Id)); Set_Flag197 (Id, V); end Set_Is_Limited_Interface; procedure Set_Is_Limited_Record (Id : E; V : B := True) is begin Set_Flag25 (Id, V); end Set_Is_Limited_Record; procedure Set_Is_Machine_Code_Subprogram (Id : E; V : B := True) is begin pragma Assert (Is_Subprogram (Id)); Set_Flag137 (Id, V); end Set_Is_Machine_Code_Subprogram; procedure Set_Is_Non_Static_Subtype (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag109 (Id, V); end Set_Is_Non_Static_Subtype; procedure Set_Is_Null_Init_Proc (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Procedure); Set_Flag178 (Id, V); end Set_Is_Null_Init_Proc; procedure Set_Is_Obsolescent (Id : E; V : B := True) is begin Set_Flag153 (Id, V); end Set_Is_Obsolescent; procedure Set_Is_Only_Out_Parameter (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Out_Parameter); Set_Flag226 (Id, V); end Set_Is_Only_Out_Parameter; procedure Set_Is_Package_Body_Entity (Id : E; V : B := True) is begin Set_Flag160 (Id, V); end Set_Is_Package_Body_Entity; procedure Set_Is_Packed (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag51 (Id, V); end Set_Is_Packed; procedure Set_Is_Packed_Array_Impl_Type (Id : E; V : B := True) is begin Set_Flag138 (Id, V); end Set_Is_Packed_Array_Impl_Type; procedure Set_Is_Param_Block_Component_Type (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Void, E_General_Access_Type)); Set_Flag215 (Id, V); end Set_Is_Param_Block_Component_Type; procedure Set_Is_Partial_Invariant_Procedure (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Procedure); Set_Flag292 (Id, V); end Set_Is_Partial_Invariant_Procedure; procedure Set_Is_Potentially_Use_Visible (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag9 (Id, V); end Set_Is_Potentially_Use_Visible; procedure Set_Is_Predicate_Function (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Function); Set_Flag255 (Id, V); end Set_Is_Predicate_Function; procedure Set_Is_Predicate_Function_M (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Flag256 (Id, V); end Set_Is_Predicate_Function_M; procedure Set_Is_Preelaborated (Id : E; V : B := True) is begin Set_Flag59 (Id, V); end Set_Is_Preelaborated; procedure Set_Is_Primitive (Id : E; V : B := True) is begin pragma Assert (Is_Overloadable (Id) or else Ekind_In (Id, E_Generic_Function, E_Generic_Procedure)); Set_Flag218 (Id, V); end Set_Is_Primitive; procedure Set_Is_Primitive_Wrapper (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Flag195 (Id, V); end Set_Is_Primitive_Wrapper; procedure Set_Is_Private_Composite (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag107 (Id, V); end Set_Is_Private_Composite; procedure Set_Is_Private_Descendant (Id : E; V : B := True) is begin Set_Flag53 (Id, V); end Set_Is_Private_Descendant; procedure Set_Is_Private_Primitive (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Flag245 (Id, V); end Set_Is_Private_Primitive; procedure Set_Is_Public (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag10 (Id, V); end Set_Is_Public; procedure Set_Is_Pure (Id : E; V : B := True) is begin Set_Flag44 (Id, V); end Set_Is_Pure; procedure Set_Is_Pure_Unit_Access_Type (Id : E; V : B := True) is begin pragma Assert (Is_Access_Type (Id)); Set_Flag189 (Id, V); end Set_Is_Pure_Unit_Access_Type; procedure Set_Is_RACW_Stub_Type (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag244 (Id, V); end Set_Is_RACW_Stub_Type; procedure Set_Is_Raised (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Exception); Set_Flag224 (Id, V); end Set_Is_Raised; procedure Set_Is_Remote_Call_Interface (Id : E; V : B := True) is begin Set_Flag62 (Id, V); end Set_Is_Remote_Call_Interface; procedure Set_Is_Remote_Types (Id : E; V : B := True) is begin Set_Flag61 (Id, V); end Set_Is_Remote_Types; procedure Set_Is_Renaming_Of_Object (Id : E; V : B := True) is begin Set_Flag112 (Id, V); end Set_Is_Renaming_Of_Object; procedure Set_Is_Return_Object (Id : E; V : B := True) is begin Set_Flag209 (Id, V); end Set_Is_Return_Object; procedure Set_Is_Safe_To_Reevaluate (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Variable); Set_Flag249 (Id, V); end Set_Is_Safe_To_Reevaluate; procedure Set_Is_Shared_Passive (Id : E; V : B := True) is begin Set_Flag60 (Id, V); end Set_Is_Shared_Passive; procedure Set_Is_Static_Type (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag281 (Id, V); end Set_Is_Static_Type; procedure Set_Is_Statically_Allocated (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) or else Ekind_In (Id, E_Exception, E_Variable, E_Constant, E_Void)); Set_Flag28 (Id, V); end Set_Is_Statically_Allocated; procedure Set_Is_Tag (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Component, E_Constant, E_Variable)); Set_Flag78 (Id, V); end Set_Is_Tag; procedure Set_Is_Tagged_Type (Id : E; V : B := True) is begin Set_Flag55 (Id, V); end Set_Is_Tagged_Type; procedure Set_Is_Thunk (Id : E; V : B := True) is begin pragma Assert (Is_Subprogram (Id)); Set_Flag225 (Id, V); end Set_Is_Thunk; procedure Set_Is_Trivial_Subprogram (Id : E; V : B := True) is begin Set_Flag235 (Id, V); end Set_Is_Trivial_Subprogram; procedure Set_Is_True_Constant (Id : E; V : B := True) is begin Set_Flag163 (Id, V); end Set_Is_True_Constant; procedure Set_Is_Unchecked_Union (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag117 (Id, V); end Set_Is_Unchecked_Union; procedure Set_Is_Underlying_Full_View (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag298 (Id, V); end Set_Is_Underlying_Full_View; procedure Set_Is_Underlying_Record_View (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Record_Type); Set_Flag246 (Id, V); end Set_Is_Underlying_Record_View; procedure Set_Is_Unimplemented (Id : E; V : B := True) is begin Set_Flag284 (Id, V); end Set_Is_Unimplemented; procedure Set_Is_Unsigned_Type (Id : E; V : B := True) is begin pragma Assert (Is_Discrete_Or_Fixed_Point_Type (Id)); Set_Flag144 (Id, V); end Set_Is_Unsigned_Type; procedure Set_Is_Uplevel_Referenced_Entity (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable) or else Is_Formal (Id) or else Is_Type (Id)); Set_Flag283 (Id, V); end Set_Is_Uplevel_Referenced_Entity; procedure Set_Is_Valued_Procedure (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Procedure); Set_Flag127 (Id, V); end Set_Is_Valued_Procedure; procedure Set_Is_Visible_Formal (Id : E; V : B := True) is begin Set_Flag206 (Id, V); end Set_Is_Visible_Formal; procedure Set_Is_Visible_Lib_Unit (Id : E; V : B := True) is begin Set_Flag116 (Id, V); end Set_Is_Visible_Lib_Unit; procedure Set_Is_Volatile (Id : E; V : B := True) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Flag16 (Id, V); end Set_Is_Volatile; procedure Set_Is_Volatile_Full_Access (Id : E; V : B := True) is begin Set_Flag285 (Id, V); end Set_Is_Volatile_Full_Access; procedure Set_Itype_Printed (Id : E; V : B := True) is begin pragma Assert (Is_Itype (Id)); Set_Flag202 (Id, V); end Set_Itype_Printed; procedure Set_Kill_Elaboration_Checks (Id : E; V : B := True) is begin Set_Flag32 (Id, V); end Set_Kill_Elaboration_Checks; procedure Set_Kill_Range_Checks (Id : E; V : B := True) is begin Set_Flag33 (Id, V); end Set_Kill_Range_Checks; procedure Set_Known_To_Have_Preelab_Init (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag207 (Id, V); end Set_Known_To_Have_Preelab_Init; procedure Set_Last_Aggregate_Assignment (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); Set_Node30 (Id, V); end Set_Last_Aggregate_Assignment; procedure Set_Last_Assignment (Id : E; V : N) is begin pragma Assert (Is_Assignable (Id)); Set_Node26 (Id, V); end Set_Last_Assignment; procedure Set_Last_Entity (Id : E; V : E) is begin Set_Node20 (Id, V); end Set_Last_Entity; procedure Set_Limited_View (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Package); Set_Node23 (Id, V); end Set_Limited_View; procedure Set_Linker_Section_Pragma (Id : E; V : N) is begin pragma Assert (Is_Type (Id) or else Ekind_In (Id, E_Constant, E_Variable) or else Is_Subprogram (Id)); Set_Node33 (Id, V); end Set_Linker_Section_Pragma; procedure Set_Lit_Indexes (Id : E; V : E) is begin pragma Assert (Is_Enumeration_Type (Id) and then Root_Type (Id) = Id); Set_Node18 (Id, V); end Set_Lit_Indexes; procedure Set_Lit_Strings (Id : E; V : E) is begin pragma Assert (Is_Enumeration_Type (Id) and then Root_Type (Id) = Id); Set_Node16 (Id, V); end Set_Lit_Strings; procedure Set_Low_Bound_Tested (Id : E; V : B := True) is begin pragma Assert (Is_Formal (Id)); Set_Flag205 (Id, V); end Set_Low_Bound_Tested; procedure Set_Machine_Radix_10 (Id : E; V : B := True) is begin pragma Assert (Is_Decimal_Fixed_Point_Type (Id)); Set_Flag84 (Id, V); end Set_Machine_Radix_10; procedure Set_Master_Id (Id : E; V : E) is begin pragma Assert (Is_Access_Type (Id)); Set_Node17 (Id, V); end Set_Master_Id; procedure Set_Materialize_Entity (Id : E; V : B := True) is begin Set_Flag168 (Id, V); end Set_Materialize_Entity; procedure Set_May_Inherit_Delayed_Rep_Aspects (Id : E; V : B := True) is begin Set_Flag262 (Id, V); end Set_May_Inherit_Delayed_Rep_Aspects; procedure Set_Mechanism (Id : E; V : M) is begin pragma Assert (Ekind (Id) = E_Function or else Is_Formal (Id)); Set_Uint8 (Id, UI_From_Int (V)); end Set_Mechanism; procedure Set_Modulus (Id : E; V : U) is begin pragma Assert (Ekind (Id) = E_Modular_Integer_Type); Set_Uint17 (Id, V); end Set_Modulus; procedure Set_Must_Be_On_Byte_Boundary (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag183 (Id, V); end Set_Must_Be_On_Byte_Boundary; procedure Set_Must_Have_Preelab_Init (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag208 (Id, V); end Set_Must_Have_Preelab_Init; procedure Set_Needs_Debug_Info (Id : E; V : B := True) is begin Set_Flag147 (Id, V); end Set_Needs_Debug_Info; procedure Set_Needs_No_Actuals (Id : E; V : B := True) is begin pragma Assert (Is_Overloadable (Id) or else Ekind_In (Id, E_Subprogram_Type, E_Entry_Family)); Set_Flag22 (Id, V); end Set_Needs_No_Actuals; procedure Set_Never_Set_In_Source (Id : E; V : B := True) is begin Set_Flag115 (Id, V); end Set_Never_Set_In_Source; procedure Set_Next_Inlined_Subprogram (Id : E; V : E) is begin Set_Node12 (Id, V); end Set_Next_Inlined_Subprogram; procedure Set_No_Dynamic_Predicate_On_Actual (Id : E; V : B := True) is begin pragma Assert (Is_Discrete_Type (Id)); Set_Flag276 (Id, V); end Set_No_Dynamic_Predicate_On_Actual; procedure Set_No_Pool_Assigned (Id : E; V : B := True) is begin pragma Assert (Is_Access_Type (Id) and then Is_Base_Type (Id)); Set_Flag131 (Id, V); end Set_No_Pool_Assigned; procedure Set_No_Predicate_On_Actual (Id : E; V : B := True) is begin pragma Assert (Is_Discrete_Type (Id)); Set_Flag275 (Id, V); end Set_No_Predicate_On_Actual; procedure Set_No_Return (Id : E; V : B := True) is begin pragma Assert (V = False or else Ekind_In (Id, E_Procedure, E_Generic_Procedure)); Set_Flag113 (Id, V); end Set_No_Return; procedure Set_No_Strict_Aliasing (Id : E; V : B := True) is begin pragma Assert (Is_Access_Type (Id) and then Is_Base_Type (Id)); Set_Flag136 (Id, V); end Set_No_Strict_Aliasing; procedure Set_No_Tagged_Streams_Pragma (Id : E; V : E) is begin pragma Assert (Is_Tagged_Type (Id)); Set_Node32 (Id, V); end Set_No_Tagged_Streams_Pragma; procedure Set_Non_Binary_Modulus (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) and then Is_Base_Type (Id)); Set_Flag58 (Id, V); end Set_Non_Binary_Modulus; procedure Set_Non_Limited_View (Id : E; V : E) is begin pragma Assert (Ekind (Id) in Incomplete_Kind or else Ekind_In (Id, E_Abstract_State, E_Class_Wide_Type)); Set_Node19 (Id, V); end Set_Non_Limited_View; procedure Set_Nonzero_Is_True (Id : E; V : B := True) is begin pragma Assert (Root_Type (Id) = Standard_Boolean and then Ekind (Id) = E_Enumeration_Type); Set_Flag162 (Id, V); end Set_Nonzero_Is_True; procedure Set_Normalized_First_Bit (Id : E; V : U) is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); Set_Uint8 (Id, V); end Set_Normalized_First_Bit; procedure Set_Normalized_Position (Id : E; V : U) is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); Set_Uint14 (Id, V); end Set_Normalized_Position; procedure Set_Normalized_Position_Max (Id : E; V : U) is begin pragma Assert (Ekind_In (Id, E_Component, E_Discriminant)); Set_Uint10 (Id, V); end Set_Normalized_Position_Max; procedure Set_OK_To_Rename (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Variable); Set_Flag247 (Id, V); end Set_OK_To_Rename; procedure Set_OK_To_Reorder_Components (Id : E; V : B := True) is begin pragma Assert (Is_Record_Type (Id) and then Is_Base_Type (Id)); Set_Flag239 (Id, V); end Set_OK_To_Reorder_Components; procedure Set_Optimize_Alignment_Space (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) or else Ekind_In (Id, E_Constant, E_Variable)); Set_Flag241 (Id, V); end Set_Optimize_Alignment_Space; procedure Set_Optimize_Alignment_Time (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) or else Ekind_In (Id, E_Constant, E_Variable)); Set_Flag242 (Id, V); end Set_Optimize_Alignment_Time; procedure Set_Original_Access_Type (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Access_Subprogram_Type); Set_Node28 (Id, V); end Set_Original_Access_Type; procedure Set_Original_Array_Type (Id : E; V : E) is begin pragma Assert (Is_Array_Type (Id) or else Is_Modular_Integer_Type (Id)); Set_Node21 (Id, V); end Set_Original_Array_Type; procedure Set_Original_Protected_Subprogram (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure)); Set_Node41 (Id, V); end Set_Original_Protected_Subprogram; procedure Set_Original_Record_Component (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Void, E_Component, E_Discriminant)); Set_Node22 (Id, V); end Set_Original_Record_Component; procedure Set_Overlays_Constant (Id : E; V : B := True) is begin Set_Flag243 (Id, V); end Set_Overlays_Constant; procedure Set_Overridden_Operation (Id : E; V : E) is begin pragma Assert (Is_Subprogram (Id) or else Is_Generic_Subprogram (Id)); Set_Node26 (Id, V); end Set_Overridden_Operation; procedure Set_Package_Instantiation (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Void, E_Generic_Package, E_Package)); Set_Node26 (Id, V); end Set_Package_Instantiation; procedure Set_Packed_Array_Impl_Type (Id : E; V : E) is begin pragma Assert (Is_Array_Type (Id)); Set_Node23 (Id, V); end Set_Packed_Array_Impl_Type; procedure Set_Parent_Subtype (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Record_Type); Set_Node19 (Id, V); end Set_Parent_Subtype; procedure Set_Part_Of_Constituents (Id : E; V : L) is begin pragma Assert (Ekind_In (Id, E_Abstract_State, E_Variable)); Set_Elist10 (Id, V); end Set_Part_Of_Constituents; procedure Set_Part_Of_References (Id : E; V : L) is begin pragma Assert (Ekind (Id) = E_Variable); Set_Elist11 (Id, V); end Set_Part_Of_References; procedure Set_Partial_View_Has_Unknown_Discr (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id)); Set_Flag280 (Id, V); end Set_Partial_View_Has_Unknown_Discr; procedure Set_Pending_Access_Types (Id : E; V : L) is begin pragma Assert (Is_Type (Id)); Set_Elist15 (Id, V); end Set_Pending_Access_Types; procedure Set_Postconditions_Proc (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family, E_Function, E_Procedure)); Set_Node14 (Id, V); end Set_Postconditions_Proc; procedure Set_Predicates_Ignored (Id : E; V : B) is begin pragma Assert (Is_Type (Id)); Set_Flag288 (Id, V); end Set_Predicates_Ignored; procedure Set_Direct_Primitive_Operations (Id : E; V : L) is begin pragma Assert (Is_Tagged_Type (Id)); Set_Elist10 (Id, V); end Set_Direct_Primitive_Operations; procedure Set_Prival (Id : E; V : E) is begin pragma Assert (Is_Protected_Component (Id)); Set_Node17 (Id, V); end Set_Prival; procedure Set_Prival_Link (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); Set_Node20 (Id, V); end Set_Prival_Link; procedure Set_Private_Dependents (Id : E; V : L) is begin pragma Assert (Is_Incomplete_Or_Private_Type (Id)); Set_Elist18 (Id, V); end Set_Private_Dependents; procedure Set_Private_View (Id : E; V : N) is begin pragma Assert (Is_Private_Type (Id)); Set_Node22 (Id, V); end Set_Private_View; procedure Set_Protected_Body_Subprogram (Id : E; V : E) is begin pragma Assert (Is_Subprogram (Id) or else Is_Entry (Id)); Set_Node11 (Id, V); end Set_Protected_Body_Subprogram; procedure Set_Protected_Formal (Id : E; V : E) is begin pragma Assert (Is_Formal (Id)); Set_Node22 (Id, V); end Set_Protected_Formal; procedure Set_Protection_Object (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Entry, E_Entry_Family, E_Function, E_Procedure)); Set_Node23 (Id, V); end Set_Protection_Object; procedure Set_Reachable (Id : E; V : B := True) is begin Set_Flag49 (Id, V); end Set_Reachable; procedure Set_Referenced (Id : E; V : B := True) is begin Set_Flag156 (Id, V); end Set_Referenced; procedure Set_Referenced_As_LHS (Id : E; V : B := True) is begin Set_Flag36 (Id, V); end Set_Referenced_As_LHS; procedure Set_Referenced_As_Out_Parameter (Id : E; V : B := True) is begin Set_Flag227 (Id, V); end Set_Referenced_As_Out_Parameter; procedure Set_Refinement_Constituents (Id : E; V : L) is begin pragma Assert (Ekind (Id) = E_Abstract_State); Set_Elist8 (Id, V); end Set_Refinement_Constituents; procedure Set_Register_Exception_Call (Id : E; V : N) is begin pragma Assert (Ekind (Id) = E_Exception); Set_Node20 (Id, V); end Set_Register_Exception_Call; procedure Set_Related_Array_Object (Id : E; V : E) is begin pragma Assert (Is_Array_Type (Id)); Set_Node25 (Id, V); end Set_Related_Array_Object; procedure Set_Related_Expression (Id : E; V : N) is begin pragma Assert (Ekind (Id) in Type_Kind or else Ekind_In (Id, E_Constant, E_Variable, E_Void)); Set_Node24 (Id, V); end Set_Related_Expression; procedure Set_Related_Instance (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Package, E_Package_Body)); Set_Node15 (Id, V); end Set_Related_Instance; procedure Set_Related_Type (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Component, E_Constant, E_Variable)); Set_Node27 (Id, V); end Set_Related_Type; procedure Set_Relative_Deadline_Variable (Id : E; V : E) is begin pragma Assert (Is_Task_Type (Id) and then Is_Base_Type (Id)); Set_Node28 (Id, V); end Set_Relative_Deadline_Variable; procedure Set_Renamed_Entity (Id : E; V : N) is begin Set_Node18 (Id, V); end Set_Renamed_Entity; procedure Set_Renamed_In_Spec (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Package); Set_Flag231 (Id, V); end Set_Renamed_In_Spec; procedure Set_Renamed_Object (Id : E; V : N) is begin Set_Node18 (Id, V); end Set_Renamed_Object; procedure Set_Renaming_Map (Id : E; V : U) is begin Set_Uint9 (Id, V); end Set_Renaming_Map; procedure Set_Requires_Overriding (Id : E; V : B := True) is begin pragma Assert (Is_Overloadable (Id)); Set_Flag213 (Id, V); end Set_Requires_Overriding; procedure Set_Return_Present (Id : E; V : B := True) is begin Set_Flag54 (Id, V); end Set_Return_Present; procedure Set_Return_Applies_To (Id : E; V : N) is begin Set_Node8 (Id, V); end Set_Return_Applies_To; procedure Set_Returns_By_Ref (Id : E; V : B := True) is begin Set_Flag90 (Id, V); end Set_Returns_By_Ref; procedure Set_Reverse_Bit_Order (Id : E; V : B := True) is begin pragma Assert (Is_Record_Type (Id) and then Is_Base_Type (Id)); Set_Flag164 (Id, V); end Set_Reverse_Bit_Order; procedure Set_Reverse_Storage_Order (Id : E; V : B := True) is begin pragma Assert (Is_Base_Type (Id) and then (Is_Record_Type (Id) or else Is_Array_Type (Id))); Set_Flag93 (Id, V); end Set_Reverse_Storage_Order; procedure Set_Rewritten_For_C (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Function); Set_Flag287 (Id, V); end Set_Rewritten_For_C; procedure Set_RM_Size (Id : E; V : U) is begin pragma Assert (Is_Type (Id)); Set_Uint13 (Id, V); end Set_RM_Size; procedure Set_Scalar_Range (Id : E; V : N) is begin Set_Node20 (Id, V); end Set_Scalar_Range; procedure Set_Scale_Value (Id : E; V : U) is begin Set_Uint16 (Id, V); end Set_Scale_Value; procedure Set_Scope_Depth_Value (Id : E; V : U) is begin pragma Assert (not Is_Record_Type (Id)); Set_Uint22 (Id, V); end Set_Scope_Depth_Value; procedure Set_Sec_Stack_Needed_For_Return (Id : E; V : B := True) is begin Set_Flag167 (Id, V); end Set_Sec_Stack_Needed_For_Return; procedure Set_Shadow_Entities (Id : E; V : S) is begin pragma Assert (Ekind_In (Id, E_Package, E_Generic_Package)); Set_List14 (Id, V); end Set_Shadow_Entities; procedure Set_Shared_Var_Procs_Instance (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Variable); Set_Node22 (Id, V); end Set_Shared_Var_Procs_Instance; procedure Set_Size_Check_Code (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); Set_Node19 (Id, V); end Set_Size_Check_Code; procedure Set_Size_Depends_On_Discriminant (Id : E; V : B := True) is begin Set_Flag177 (Id, V); end Set_Size_Depends_On_Discriminant; procedure Set_Size_Known_At_Compile_Time (Id : E; V : B := True) is begin Set_Flag92 (Id, V); end Set_Size_Known_At_Compile_Time; procedure Set_Small_Value (Id : E; V : R) is begin pragma Assert (Is_Fixed_Point_Type (Id)); Set_Ureal21 (Id, V); end Set_Small_Value; procedure Set_SPARK_Aux_Pragma (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Protected_Type, -- concurrent variants E_Task_Type) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body)); Set_Node41 (Id, V); end Set_SPARK_Aux_Pragma; procedure Set_SPARK_Aux_Pragma_Inherited (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Protected_Type, -- concurrent variants E_Task_Type) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body)); Set_Flag266 (Id, V); end Set_SPARK_Aux_Pragma_Inherited; procedure Set_SPARK_Pragma (Id : E; V : N) is begin pragma Assert (Ekind_In (Id, E_Protected_Body, -- concurrent variants E_Protected_Type, E_Task_Body, E_Task_Type) or else Ekind_In (Id, E_Entry, -- overloadable variants E_Entry_Family, E_Function, E_Generic_Function, E_Generic_Procedure, E_Operator, E_Procedure, E_Subprogram_Body) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body) or else Ekind (Id) = E_Variable); -- variable Set_Node40 (Id, V); end Set_SPARK_Pragma; procedure Set_SPARK_Pragma_Inherited (Id : E; V : B := True) is begin pragma Assert (Ekind_In (Id, E_Protected_Body, -- concurrent variants E_Protected_Type, E_Task_Body, E_Task_Type) or else Ekind_In (Id, E_Entry, -- overloadable variants E_Entry_Family, E_Function, E_Generic_Function, E_Generic_Procedure, E_Operator, E_Procedure, E_Subprogram_Body) or else Ekind_In (Id, E_Generic_Package, -- package variants E_Package, E_Package_Body) or else Ekind (Id) = E_Variable); -- variable Set_Flag265 (Id, V); end Set_SPARK_Pragma_Inherited; procedure Set_Spec_Entity (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Package_Body or else Is_Formal (Id)); Set_Node19 (Id, V); end Set_Spec_Entity; procedure Set_SSO_Set_High_By_Default (Id : E; V : B := True) is begin pragma Assert (Is_Base_Type (Id) and then (Is_Record_Type (Id) or else Is_Array_Type (Id))); Set_Flag273 (Id, V); end Set_SSO_Set_High_By_Default; procedure Set_SSO_Set_Low_By_Default (Id : E; V : B := True) is begin pragma Assert (Is_Base_Type (Id) and then (Is_Record_Type (Id) or else Is_Array_Type (Id))); Set_Flag272 (Id, V); end Set_SSO_Set_Low_By_Default; procedure Set_Static_Discrete_Predicate (Id : E; V : S) is begin pragma Assert (Is_Discrete_Type (Id) and then Has_Predicates (Id)); Set_List25 (Id, V); end Set_Static_Discrete_Predicate; procedure Set_Static_Real_Or_String_Predicate (Id : E; V : N) is begin pragma Assert ((Is_Real_Type (Id) or else Is_String_Type (Id)) and then Has_Predicates (Id)); Set_Node25 (Id, V); end Set_Static_Real_Or_String_Predicate; procedure Set_Status_Flag_Or_Transient_Decl (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Constant, E_Variable)); Set_Node15 (Id, V); end Set_Status_Flag_Or_Transient_Decl; procedure Set_Storage_Size_Variable (Id : E; V : E) is begin pragma Assert (Is_Access_Type (Id) or else Is_Task_Type (Id)); pragma Assert (Id = Base_Type (Id)); Set_Node26 (Id, V); end Set_Storage_Size_Variable; procedure Set_Static_Elaboration_Desired (Id : E; V : B) is begin pragma Assert (Ekind (Id) = E_Package); Set_Flag77 (Id, V); end Set_Static_Elaboration_Desired; procedure Set_Static_Initialization (Id : E; V : N) is begin pragma Assert (Ekind (Id) = E_Procedure and then not Is_Dispatching_Operation (Id)); Set_Node30 (Id, V); end Set_Static_Initialization; procedure Set_Stored_Constraint (Id : E; V : L) is begin pragma Assert (Nkind (Id) in N_Entity); Set_Elist23 (Id, V); end Set_Stored_Constraint; procedure Set_Stores_Attribute_Old_Prefix (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Constant); Set_Flag270 (Id, V); end Set_Stores_Attribute_Old_Prefix; procedure Set_Strict_Alignment (Id : E; V : B := True) is begin pragma Assert (Id = Base_Type (Id)); Set_Flag145 (Id, V); end Set_Strict_Alignment; procedure Set_String_Literal_Length (Id : E; V : U) is begin pragma Assert (Ekind (Id) = E_String_Literal_Subtype); Set_Uint16 (Id, V); end Set_String_Literal_Length; procedure Set_String_Literal_Low_Bound (Id : E; V : N) is begin pragma Assert (Ekind (Id) = E_String_Literal_Subtype); Set_Node18 (Id, V); end Set_String_Literal_Low_Bound; procedure Set_Subprograms_For_Type (Id : E; V : L) is begin pragma Assert (Is_Type (Id)); Set_Elist29 (Id, V); end Set_Subprograms_For_Type; procedure Set_Subps_Index (Id : E; V : U) is begin pragma Assert (Is_Subprogram (Id)); Set_Uint24 (Id, V); end Set_Subps_Index; procedure Set_Suppress_Elaboration_Warnings (Id : E; V : B := True) is begin Set_Flag148 (Id, V); end Set_Suppress_Elaboration_Warnings; procedure Set_Suppress_Initialization (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) or else Ekind (Id) = E_Variable); Set_Flag105 (Id, V); end Set_Suppress_Initialization; procedure Set_Suppress_Style_Checks (Id : E; V : B := True) is begin Set_Flag165 (Id, V); end Set_Suppress_Style_Checks; procedure Set_Suppress_Value_Tracking_On_Call (Id : E; V : B := True) is begin Set_Flag217 (Id, V); end Set_Suppress_Value_Tracking_On_Call; procedure Set_Task_Body_Procedure (Id : E; V : N) is begin pragma Assert (Ekind (Id) in Task_Kind); Set_Node25 (Id, V); end Set_Task_Body_Procedure; procedure Set_Thunk_Entity (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure) and then Is_Thunk (Id)); Set_Node31 (Id, V); end Set_Thunk_Entity; procedure Set_Treat_As_Volatile (Id : E; V : B := True) is begin Set_Flag41 (Id, V); end Set_Treat_As_Volatile; procedure Set_Underlying_Full_View (Id : E; V : E) is begin pragma Assert (Ekind (Id) in Private_Kind); Set_Node19 (Id, V); end Set_Underlying_Full_View; procedure Set_Underlying_Record_View (Id : E; V : E) is begin pragma Assert (Ekind (Id) = E_Record_Type); Set_Node28 (Id, V); end Set_Underlying_Record_View; procedure Set_Universal_Aliasing (Id : E; V : B := True) is begin pragma Assert (Is_Type (Id) and then Is_Base_Type (Id)); Set_Flag216 (Id, V); end Set_Universal_Aliasing; procedure Set_Unset_Reference (Id : E; V : N) is begin Set_Node16 (Id, V); end Set_Unset_Reference; procedure Set_Used_As_Generic_Actual (Id : E; V : B := True) is begin Set_Flag222 (Id, V); end Set_Used_As_Generic_Actual; procedure Set_Uses_Lock_Free (Id : E; V : B := True) is begin pragma Assert (Ekind (Id) = E_Protected_Type); Set_Flag188 (Id, V); end Set_Uses_Lock_Free; procedure Set_Uses_Sec_Stack (Id : E; V : B := True) is begin Set_Flag95 (Id, V); end Set_Uses_Sec_Stack; procedure Set_Warnings_Off (Id : E; V : B := True) is begin Set_Flag96 (Id, V); end Set_Warnings_Off; procedure Set_Warnings_Off_Used (Id : E; V : B := True) is begin Set_Flag236 (Id, V); end Set_Warnings_Off_Used; procedure Set_Warnings_Off_Used_Unmodified (Id : E; V : B := True) is begin Set_Flag237 (Id, V); end Set_Warnings_Off_Used_Unmodified; procedure Set_Warnings_Off_Used_Unreferenced (Id : E; V : B := True) is begin Set_Flag238 (Id, V); end Set_Warnings_Off_Used_Unreferenced; procedure Set_Was_Hidden (Id : E; V : B := True) is begin Set_Flag196 (Id, V); end Set_Was_Hidden; procedure Set_Wrapped_Entity (Id : E; V : E) is begin pragma Assert (Ekind_In (Id, E_Function, E_Procedure) and then Is_Primitive_Wrapper (Id)); Set_Node27 (Id, V); end Set_Wrapped_Entity; ----------------------------------- -- Field Initialization Routines -- ----------------------------------- procedure Init_Alignment (Id : E) is begin Set_Uint14 (Id, Uint_0); end Init_Alignment; procedure Init_Alignment (Id : E; V : Int) is begin Set_Uint14 (Id, UI_From_Int (V)); end Init_Alignment; procedure Init_Component_Bit_Offset (Id : E) is begin Set_Uint11 (Id, No_Uint); end Init_Component_Bit_Offset; procedure Init_Component_Bit_Offset (Id : E; V : Int) is begin Set_Uint11 (Id, UI_From_Int (V)); end Init_Component_Bit_Offset; procedure Init_Component_Size (Id : E) is begin Set_Uint22 (Id, Uint_0); end Init_Component_Size; procedure Init_Component_Size (Id : E; V : Int) is begin Set_Uint22 (Id, UI_From_Int (V)); end Init_Component_Size; procedure Init_Digits_Value (Id : E) is begin Set_Uint17 (Id, Uint_0); end Init_Digits_Value; procedure Init_Digits_Value (Id : E; V : Int) is begin Set_Uint17 (Id, UI_From_Int (V)); end Init_Digits_Value; procedure Init_Esize (Id : E) is begin Set_Uint12 (Id, Uint_0); end Init_Esize; procedure Init_Esize (Id : E; V : Int) is begin Set_Uint12 (Id, UI_From_Int (V)); end Init_Esize; procedure Init_Normalized_First_Bit (Id : E) is begin Set_Uint8 (Id, No_Uint); end Init_Normalized_First_Bit; procedure Init_Normalized_First_Bit (Id : E; V : Int) is begin Set_Uint8 (Id, UI_From_Int (V)); end Init_Normalized_First_Bit; procedure Init_Normalized_Position (Id : E) is begin Set_Uint14 (Id, No_Uint); end Init_Normalized_Position; procedure Init_Normalized_Position (Id : E; V : Int) is begin Set_Uint14 (Id, UI_From_Int (V)); end Init_Normalized_Position; procedure Init_Normalized_Position_Max (Id : E) is begin Set_Uint10 (Id, No_Uint); end Init_Normalized_Position_Max; procedure Init_Normalized_Position_Max (Id : E; V : Int) is begin Set_Uint10 (Id, UI_From_Int (V)); end Init_Normalized_Position_Max; procedure Init_RM_Size (Id : E) is begin Set_Uint13 (Id, Uint_0); end Init_RM_Size; procedure Init_RM_Size (Id : E; V : Int) is begin Set_Uint13 (Id, UI_From_Int (V)); end Init_RM_Size; ----------------------------- -- Init_Component_Location -- ----------------------------- procedure Init_Component_Location (Id : E) is begin Set_Uint8 (Id, No_Uint); -- Normalized_First_Bit Set_Uint10 (Id, No_Uint); -- Normalized_Position_Max Set_Uint11 (Id, No_Uint); -- Component_Bit_Offset Set_Uint12 (Id, Uint_0); -- Esize Set_Uint14 (Id, No_Uint); -- Normalized_Position end Init_Component_Location; ---------------------------- -- Init_Object_Size_Align -- ---------------------------- procedure Init_Object_Size_Align (Id : E) is begin Set_Uint12 (Id, Uint_0); -- Esize Set_Uint14 (Id, Uint_0); -- Alignment end Init_Object_Size_Align; --------------- -- Init_Size -- --------------- procedure Init_Size (Id : E; V : Int) is begin pragma Assert (not Is_Object (Id)); Set_Uint12 (Id, UI_From_Int (V)); -- Esize Set_Uint13 (Id, UI_From_Int (V)); -- RM_Size end Init_Size; --------------------- -- Init_Size_Align -- --------------------- procedure Init_Size_Align (Id : E) is begin pragma Assert (not Is_Object (Id)); Set_Uint12 (Id, Uint_0); -- Esize Set_Uint13 (Id, Uint_0); -- RM_Size Set_Uint14 (Id, Uint_0); -- Alignment end Init_Size_Align; ---------------------------------------------- -- Type Representation Attribute Predicates -- ---------------------------------------------- function Known_Alignment (E : Entity_Id) return B is begin return Uint14 (E) /= Uint_0 and then Uint14 (E) /= No_Uint; end Known_Alignment; function Known_Component_Bit_Offset (E : Entity_Id) return B is begin return Uint11 (E) /= No_Uint; end Known_Component_Bit_Offset; function Known_Component_Size (E : Entity_Id) return B is begin return Uint22 (Base_Type (E)) /= Uint_0 and then Uint22 (Base_Type (E)) /= No_Uint; end Known_Component_Size; function Known_Esize (E : Entity_Id) return B is begin return Uint12 (E) /= Uint_0 and then Uint12 (E) /= No_Uint; end Known_Esize; function Known_Normalized_First_Bit (E : Entity_Id) return B is begin return Uint8 (E) /= No_Uint; end Known_Normalized_First_Bit; function Known_Normalized_Position (E : Entity_Id) return B is begin return Uint14 (E) /= No_Uint; end Known_Normalized_Position; function Known_Normalized_Position_Max (E : Entity_Id) return B is begin return Uint10 (E) /= No_Uint; end Known_Normalized_Position_Max; function Known_RM_Size (E : Entity_Id) return B is begin return Uint13 (E) /= No_Uint and then (Uint13 (E) /= Uint_0 or else Is_Discrete_Type (E) or else Is_Fixed_Point_Type (E)); end Known_RM_Size; function Known_Static_Component_Bit_Offset (E : Entity_Id) return B is begin return Uint11 (E) /= No_Uint and then Uint11 (E) >= Uint_0; end Known_Static_Component_Bit_Offset; function Known_Static_Component_Size (E : Entity_Id) return B is begin return Uint22 (Base_Type (E)) > Uint_0; end Known_Static_Component_Size; function Known_Static_Esize (E : Entity_Id) return B is begin return Uint12 (E) > Uint_0 and then not Is_Generic_Type (E); end Known_Static_Esize; function Known_Static_Normalized_First_Bit (E : Entity_Id) return B is begin return Uint8 (E) /= No_Uint and then Uint8 (E) >= Uint_0; end Known_Static_Normalized_First_Bit; function Known_Static_Normalized_Position (E : Entity_Id) return B is begin return Uint14 (E) /= No_Uint and then Uint14 (E) >= Uint_0; end Known_Static_Normalized_Position; function Known_Static_Normalized_Position_Max (E : Entity_Id) return B is begin return Uint10 (E) /= No_Uint and then Uint10 (E) >= Uint_0; end Known_Static_Normalized_Position_Max; function Known_Static_RM_Size (E : Entity_Id) return B is begin return (Uint13 (E) > Uint_0 or else Is_Discrete_Type (E) or else Is_Fixed_Point_Type (E)) and then not Is_Generic_Type (E); end Known_Static_RM_Size; function Unknown_Alignment (E : Entity_Id) return B is begin return Uint14 (E) = Uint_0 or else Uint14 (E) = No_Uint; end Unknown_Alignment; function Unknown_Component_Bit_Offset (E : Entity_Id) return B is begin return Uint11 (E) = No_Uint; end Unknown_Component_Bit_Offset; function Unknown_Component_Size (E : Entity_Id) return B is begin return Uint22 (Base_Type (E)) = Uint_0 or else Uint22 (Base_Type (E)) = No_Uint; end Unknown_Component_Size; function Unknown_Esize (E : Entity_Id) return B is begin return Uint12 (E) = No_Uint or else Uint12 (E) = Uint_0; end Unknown_Esize; function Unknown_Normalized_First_Bit (E : Entity_Id) return B is begin return Uint8 (E) = No_Uint; end Unknown_Normalized_First_Bit; function Unknown_Normalized_Position (E : Entity_Id) return B is begin return Uint14 (E) = No_Uint; end Unknown_Normalized_Position; function Unknown_Normalized_Position_Max (E : Entity_Id) return B is begin return Uint10 (E) = No_Uint; end Unknown_Normalized_Position_Max; function Unknown_RM_Size (E : Entity_Id) return B is begin return (Uint13 (E) = Uint_0 and then not Is_Discrete_Type (E) and then not Is_Fixed_Point_Type (E)) or else Uint13 (E) = No_Uint; end Unknown_RM_Size; -------------------- -- Address_Clause -- -------------------- function Address_Clause (Id : E) return N is begin return Get_Attribute_Definition_Clause (Id, Attribute_Address); end Address_Clause; --------------- -- Aft_Value -- --------------- function Aft_Value (Id : E) return U is Result : Nat := 1; Delta_Val : Ureal := Delta_Value (Id); begin while Delta_Val < Ureal_Tenth loop Delta_Val := Delta_Val * Ureal_10; Result := Result + 1; end loop; return UI_From_Int (Result); end Aft_Value; ---------------------- -- Alignment_Clause -- ---------------------- function Alignment_Clause (Id : E) return N is begin return Get_Attribute_Definition_Clause (Id, Attribute_Alignment); end Alignment_Clause; ------------------- -- Append_Entity -- ------------------- procedure Append_Entity (Id : Entity_Id; V : Entity_Id) is begin if Last_Entity (V) = Empty then Set_First_Entity (Id => V, V => Id); else Set_Next_Entity (Last_Entity (V), Id); end if; Set_Next_Entity (Id, Empty); Set_Scope (Id, V); Set_Last_Entity (Id => V, V => Id); end Append_Entity; --------------- -- Base_Type -- --------------- function Base_Type (Id : E) return E is begin if Is_Base_Type (Id) then return Id; else pragma Assert (Is_Type (Id)); return Etype (Id); end if; end Base_Type; ------------------------- -- Component_Alignment -- ------------------------- -- Component Alignment is encoded using two flags, Flag128/129 as -- follows. Note that both flags False = Align_Default, so that the -- default initialization of flags to False initializes component -- alignment to the default value as required. -- Flag128 Flag129 Value -- ------- ------- ----- -- False False Calign_Default -- False True Calign_Component_Size -- True False Calign_Component_Size_4 -- True True Calign_Storage_Unit function Component_Alignment (Id : E) return C is BT : constant Node_Id := Base_Type (Id); begin pragma Assert (Is_Array_Type (Id) or else Is_Record_Type (Id)); if Flag128 (BT) then if Flag129 (BT) then return Calign_Storage_Unit; else return Calign_Component_Size_4; end if; else if Flag129 (BT) then return Calign_Component_Size; else return Calign_Default; end if; end if; end Component_Alignment; ---------------------- -- Declaration_Node -- ---------------------- function Declaration_Node (Id : E) return N is P : Node_Id; begin if Ekind (Id) = E_Incomplete_Type and then Present (Full_View (Id)) then P := Parent (Full_View (Id)); else P := Parent (Id); end if; loop if Nkind (P) /= N_Selected_Component and then Nkind (P) /= N_Expanded_Name and then not (Nkind (P) = N_Defining_Program_Unit_Name and then Is_Child_Unit (Id)) then return P; else P := Parent (P); end if; end loop; end Declaration_Node; --------------------- -- Designated_Type -- --------------------- function Designated_Type (Id : E) return E is Desig_Type : E; begin Desig_Type := Directly_Designated_Type (Id); if Ekind (Desig_Type) = E_Incomplete_Type and then Present (Full_View (Desig_Type)) then return Full_View (Desig_Type); elsif Is_Class_Wide_Type (Desig_Type) and then Ekind (Etype (Desig_Type)) = E_Incomplete_Type and then Present (Full_View (Etype (Desig_Type))) and then Present (Class_Wide_Type (Full_View (Etype (Desig_Type)))) then return Class_Wide_Type (Full_View (Etype (Desig_Type))); else return Desig_Type; end if; end Designated_Type; ------------------- -- DIC_Procedure -- ------------------- function DIC_Procedure (Id : E) return E is Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id)); Subps := Subprograms_For_Type (Base_Type (Id)); if Present (Subps) then Subp_Elmt := First_Elmt (Subps); while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Is_DIC_Procedure (Subp_Id) then return Subp_Id; end if; Next_Elmt (Subp_Elmt); end loop; end if; return Empty; end DIC_Procedure; ---------------------- -- Entry_Index_Type -- ---------------------- function Entry_Index_Type (Id : E) return N is begin pragma Assert (Ekind (Id) = E_Entry_Family); return Etype (Discrete_Subtype_Definition (Parent (Id))); end Entry_Index_Type; --------------------- -- First_Component -- --------------------- function First_Component (Id : E) return E is Comp_Id : E; begin pragma Assert (Is_Concurrent_Type (Id) or else Is_Incomplete_Or_Private_Type (Id) or else Is_Record_Type (Id)); Comp_Id := First_Entity (Id); while Present (Comp_Id) loop exit when Ekind (Comp_Id) = E_Component; Comp_Id := Next_Entity (Comp_Id); end loop; return Comp_Id; end First_Component; ------------------------------------- -- First_Component_Or_Discriminant -- ------------------------------------- function First_Component_Or_Discriminant (Id : E) return E is Comp_Id : E; begin pragma Assert (Is_Concurrent_Type (Id) or else Is_Incomplete_Or_Private_Type (Id) or else Is_Record_Type (Id) or else Has_Discriminants (Id)); Comp_Id := First_Entity (Id); while Present (Comp_Id) loop exit when Ekind_In (Comp_Id, E_Component, E_Discriminant); Comp_Id := Next_Entity (Comp_Id); end loop; return Comp_Id; end First_Component_Or_Discriminant; ------------------ -- First_Formal -- ------------------ function First_Formal (Id : E) return E is Formal : E; begin pragma Assert (Is_Generic_Subprogram (Id) or else Is_Overloadable (Id) or else Ekind_In (Id, E_Entry_Family, E_Subprogram_Body, E_Subprogram_Type)); if Ekind (Id) = E_Enumeration_Literal then return Empty; else Formal := First_Entity (Id); -- Deal with the common, non-generic case first if No (Formal) or else Is_Formal (Formal) then return Formal; end if; -- The first/next entity chain of a generic subprogram contains all -- generic formal parameters, followed by the formal parameters. if Is_Generic_Subprogram (Id) then while Present (Formal) and then not Is_Formal (Formal) loop Next_Entity (Formal); end loop; return Formal; else return Empty; end if; end if; end First_Formal; ------------------------------ -- First_Formal_With_Extras -- ------------------------------ function First_Formal_With_Extras (Id : E) return E is Formal : E; begin pragma Assert (Is_Generic_Subprogram (Id) or else Is_Overloadable (Id) or else Ekind_In (Id, E_Entry_Family, E_Subprogram_Body, E_Subprogram_Type)); if Ekind (Id) = E_Enumeration_Literal then return Empty; else Formal := First_Entity (Id); -- The first/next entity chain of a generic subprogram contains all -- generic formal parameters, followed by the formal parameters. Go -- directly to the parameters by skipping the formal part. if Is_Generic_Subprogram (Id) then while Present (Formal) and then not Is_Formal (Formal) loop Next_Entity (Formal); end loop; end if; if Present (Formal) and then Is_Formal (Formal) then return Formal; else return Extra_Formals (Id); -- Empty if no extra formals end if; end if; end First_Formal_With_Extras; ------------------------------------- -- Get_Attribute_Definition_Clause -- ------------------------------------- function Get_Attribute_Definition_Clause (E : Entity_Id; Id : Attribute_Id) return Node_Id is N : Node_Id; begin N := First_Rep_Item (E); while Present (N) loop if Nkind (N) = N_Attribute_Definition_Clause and then Get_Attribute_Id (Chars (N)) = Id then return N; else Next_Rep_Item (N); end if; end loop; return Empty; end Get_Attribute_Definition_Clause; ------------------- -- Get_Full_View -- ------------------- function Get_Full_View (T : Entity_Id) return Entity_Id is begin if Ekind (T) = E_Incomplete_Type and then Present (Full_View (T)) then return Full_View (T); elsif Is_Class_Wide_Type (T) and then Ekind (Root_Type (T)) = E_Incomplete_Type and then Present (Full_View (Root_Type (T))) then return Class_Wide_Type (Full_View (Root_Type (T))); else return T; end if; end Get_Full_View; ---------------- -- Get_Pragma -- ---------------- function Get_Pragma (E : Entity_Id; Id : Pragma_Id) return Node_Id is -- Classification pragmas Is_CLS : constant Boolean := Id = Pragma_Abstract_State or else Id = Pragma_Attach_Handler or else Id = Pragma_Async_Readers or else Id = Pragma_Async_Writers or else Id = Pragma_Constant_After_Elaboration or else Id = Pragma_Depends or else Id = Pragma_Effective_Reads or else Id = Pragma_Effective_Writes or else Id = Pragma_Extensions_Visible or else Id = Pragma_Global or else Id = Pragma_Initial_Condition or else Id = Pragma_Initializes or else Id = Pragma_Interrupt_Handler or else Id = Pragma_Part_Of or else Id = Pragma_Refined_Depends or else Id = Pragma_Refined_Global or else Id = Pragma_Refined_State or else Id = Pragma_Volatile_Function; -- Contract / test case pragmas Is_CTC : constant Boolean := Id = Pragma_Contract_Cases or else Id = Pragma_Test_Case; -- Pre / postcondition pragmas Is_PPC : constant Boolean := Id = Pragma_Precondition or else Id = Pragma_Postcondition or else Id = Pragma_Refined_Post; In_Contract : constant Boolean := Is_CLS or Is_CTC or Is_PPC; Item : Node_Id; Items : Node_Id; begin -- Handle pragmas that appear in N_Contract nodes. Those have to be -- extracted from their specialized list. if In_Contract then Items := Contract (E); if No (Items) then return Empty; elsif Is_CLS then Item := Classifications (Items); elsif Is_CTC then Item := Contract_Test_Cases (Items); else Item := Pre_Post_Conditions (Items); end if; -- Regular pragmas else Item := First_Rep_Item (E); end if; while Present (Item) loop if Nkind (Item) = N_Pragma and then Get_Pragma_Id (Pragma_Name_Unmapped (Item)) = Id then return Item; -- All nodes in N_Contract are chained using Next_Pragma elsif In_Contract then Item := Next_Pragma (Item); -- Regular pragmas else Next_Rep_Item (Item); end if; end loop; return Empty; end Get_Pragma; -------------------------------------- -- Get_Record_Representation_Clause -- -------------------------------------- function Get_Record_Representation_Clause (E : Entity_Id) return Node_Id is N : Node_Id; begin N := First_Rep_Item (E); while Present (N) loop if Nkind (N) = N_Record_Representation_Clause then return N; end if; Next_Rep_Item (N); end loop; return Empty; end Get_Record_Representation_Clause; ------------------------ -- Has_Attach_Handler -- ------------------------ function Has_Attach_Handler (Id : E) return B is Ritem : Node_Id; begin pragma Assert (Is_Protected_Type (Id)); Ritem := First_Rep_Item (Id); while Present (Ritem) loop if Nkind (Ritem) = N_Pragma and then Pragma_Name (Ritem) = Name_Attach_Handler then return True; else Next_Rep_Item (Ritem); end if; end loop; return False; end Has_Attach_Handler; ------------- -- Has_DIC -- ------------- function Has_DIC (Id : E) return B is begin return Has_Own_DIC (Id) or else Has_Inherited_DIC (Id); end Has_DIC; ----------------- -- Has_Entries -- ----------------- function Has_Entries (Id : E) return B is Ent : Entity_Id; begin pragma Assert (Is_Concurrent_Type (Id)); Ent := First_Entity (Id); while Present (Ent) loop if Is_Entry (Ent) then return True; end if; Ent := Next_Entity (Ent); end loop; return False; end Has_Entries; ---------------------------- -- Has_Foreign_Convention -- ---------------------------- function Has_Foreign_Convention (Id : E) return B is begin -- While regular Intrinsics such as the Standard operators fit in the -- "Ada" convention, those with an Interface_Name materialize GCC -- builtin imports for which Ada special treatments shouldn't apply. return Convention (Id) in Foreign_Convention or else (Convention (Id) = Convention_Intrinsic and then Present (Interface_Name (Id))); end Has_Foreign_Convention; --------------------------- -- Has_Interrupt_Handler -- --------------------------- function Has_Interrupt_Handler (Id : E) return B is Ritem : Node_Id; begin pragma Assert (Is_Protected_Type (Id)); Ritem := First_Rep_Item (Id); while Present (Ritem) loop if Nkind (Ritem) = N_Pragma and then Pragma_Name (Ritem) = Name_Interrupt_Handler then return True; else Next_Rep_Item (Ritem); end if; end loop; return False; end Has_Interrupt_Handler; -------------------- -- Has_Invariants -- -------------------- function Has_Invariants (Id : E) return B is begin return Has_Own_Invariants (Id) or else Has_Inherited_Invariants (Id); end Has_Invariants; -------------------------- -- Has_Non_Limited_View -- -------------------------- function Has_Non_Limited_View (Id : E) return B is begin return (Ekind (Id) in Incomplete_Kind or else Ekind (Id) in Class_Wide_Kind or else Ekind (Id) = E_Abstract_State) and then Present (Non_Limited_View (Id)); end Has_Non_Limited_View; --------------------------------- -- Has_Non_Null_Abstract_State -- --------------------------------- function Has_Non_Null_Abstract_State (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Generic_Package, E_Package)); return Present (Abstract_States (Id)) and then not Is_Null_State (Node (First_Elmt (Abstract_States (Id)))); end Has_Non_Null_Abstract_State; ------------------------------------- -- Has_Non_Null_Visible_Refinement -- ------------------------------------- function Has_Non_Null_Visible_Refinement (Id : E) return B is Constits : Elist_Id; begin -- "Refinement" is a concept applicable only to abstract states pragma Assert (Ekind (Id) = E_Abstract_State); Constits := Refinement_Constituents (Id); -- A partial refinement is always non-null. For a full refinement to be -- non-null, the first constituent must be anything other than null. return Has_Partial_Visible_Refinement (Id) or else (Has_Visible_Refinement (Id) and then Present (Constits) and then Nkind (Node (First_Elmt (Constits))) /= N_Null); end Has_Non_Null_Visible_Refinement; ----------------------------- -- Has_Null_Abstract_State -- ----------------------------- function Has_Null_Abstract_State (Id : E) return B is begin pragma Assert (Ekind_In (Id, E_Generic_Package, E_Package)); return Present (Abstract_States (Id)) and then Is_Null_State (Node (First_Elmt (Abstract_States (Id)))); end Has_Null_Abstract_State; --------------------------------- -- Has_Null_Visible_Refinement -- --------------------------------- function Has_Null_Visible_Refinement (Id : E) return B is Constits : Elist_Id; begin -- "Refinement" is a concept applicable only to abstract states pragma Assert (Ekind (Id) = E_Abstract_State); Constits := Refinement_Constituents (Id); -- For a refinement to be null, the state's sole constituent must be a -- null. return Has_Visible_Refinement (Id) and then Present (Constits) and then Nkind (Node (First_Elmt (Constits))) = N_Null; end Has_Null_Visible_Refinement; -------------------- -- Has_Unmodified -- -------------------- function Has_Unmodified (E : Entity_Id) return Boolean is begin if Has_Pragma_Unmodified (E) then return True; elsif Warnings_Off (E) then Set_Warnings_Off_Used_Unmodified (E); return True; else return False; end if; end Has_Unmodified; --------------------- -- Has_Unreferenced -- --------------------- function Has_Unreferenced (E : Entity_Id) return Boolean is begin if Has_Pragma_Unreferenced (E) then return True; elsif Warnings_Off (E) then Set_Warnings_Off_Used_Unreferenced (E); return True; else return False; end if; end Has_Unreferenced; ---------------------- -- Has_Warnings_Off -- ---------------------- function Has_Warnings_Off (E : Entity_Id) return Boolean is begin if Warnings_Off (E) then Set_Warnings_Off_Used (E); return True; else return False; end if; end Has_Warnings_Off; ------------------------------ -- Implementation_Base_Type -- ------------------------------ function Implementation_Base_Type (Id : E) return E is Bastyp : Entity_Id; Imptyp : Entity_Id; begin Bastyp := Base_Type (Id); if Is_Incomplete_Or_Private_Type (Bastyp) then Imptyp := Underlying_Type (Bastyp); -- If we have an implementation type, then just return it, -- otherwise we return the Base_Type anyway. This can only -- happen in error situations and should avoid some error bombs. if Present (Imptyp) then return Base_Type (Imptyp); else return Bastyp; end if; else return Bastyp; end if; end Implementation_Base_Type; ------------------------- -- Invariant_Procedure -- ------------------------- function Invariant_Procedure (Id : E) return E is Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id)); Subps := Subprograms_For_Type (Base_Type (Id)); if Present (Subps) then Subp_Elmt := First_Elmt (Subps); while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Is_Invariant_Procedure (Subp_Id) then return Subp_Id; end if; Next_Elmt (Subp_Elmt); end loop; end if; return Empty; end Invariant_Procedure; ---------------------- -- Is_Atomic_Or_VFA -- ---------------------- function Is_Atomic_Or_VFA (Id : E) return B is begin return Is_Atomic (Id) or else Is_Volatile_Full_Access (Id); end Is_Atomic_Or_VFA; ------------------ -- Is_Base_Type -- ------------------ -- Global flag table allowing rapid computation of this function Entity_Is_Base_Type : constant array (Entity_Kind) of Boolean := (E_Enumeration_Subtype | E_Incomplete_Type | E_Signed_Integer_Subtype | E_Modular_Integer_Subtype | E_Floating_Point_Subtype | E_Ordinary_Fixed_Point_Subtype | E_Decimal_Fixed_Point_Subtype | E_Array_Subtype | E_Record_Subtype | E_Private_Subtype | E_Record_Subtype_With_Private | E_Limited_Private_Subtype | E_Access_Subtype | E_Protected_Subtype | E_Task_Subtype | E_String_Literal_Subtype | E_Class_Wide_Subtype => False, others => True); function Is_Base_Type (Id : E) return Boolean is begin return Entity_Is_Base_Type (Ekind (Id)); end Is_Base_Type; --------------------- -- Is_Boolean_Type -- --------------------- function Is_Boolean_Type (Id : E) return B is begin return Root_Type (Id) = Standard_Boolean; end Is_Boolean_Type; ------------------------ -- Is_Constant_Object -- ------------------------ function Is_Constant_Object (Id : E) return B is K : constant Entity_Kind := Ekind (Id); begin return K = E_Constant or else K = E_In_Parameter or else K = E_Loop_Parameter; end Is_Constant_Object; -------------------------- -- Is_Controlled_Active -- -------------------------- function Is_Controlled_Active (Id : E) return B is begin return Is_Controlled (Id) and then not Disable_Controlled (Id); end Is_Controlled_Active; -------------------- -- Is_Discriminal -- -------------------- function Is_Discriminal (Id : E) return B is begin return (Ekind_In (Id, E_Constant, E_In_Parameter) and then Present (Discriminal_Link (Id))); end Is_Discriminal; ---------------------- -- Is_Dynamic_Scope -- ---------------------- function Is_Dynamic_Scope (Id : E) return B is begin return Ekind (Id) = E_Block or else Ekind (Id) = E_Function or else Ekind (Id) = E_Procedure or else Ekind (Id) = E_Subprogram_Body or else Ekind (Id) = E_Task_Type or else (Ekind (Id) = E_Limited_Private_Type and then Present (Full_View (Id)) and then Ekind (Full_View (Id)) = E_Task_Type) or else Ekind (Id) = E_Entry or else Ekind (Id) = E_Entry_Family or else Ekind (Id) = E_Return_Statement; end Is_Dynamic_Scope; -------------------- -- Is_Entity_Name -- -------------------- function Is_Entity_Name (N : Node_Id) return Boolean is Kind : constant Node_Kind := Nkind (N); begin -- Identifiers, operator symbols, expanded names are entity names return Kind = N_Identifier or else Kind = N_Operator_Symbol or else Kind = N_Expanded_Name -- Attribute references are entity names if they refer to an entity. -- Note that we don't do this by testing for the presence of the -- Entity field in the N_Attribute_Reference node, since it may not -- have been set yet. or else (Kind = N_Attribute_Reference and then Is_Entity_Attribute_Name (Attribute_Name (N))); end Is_Entity_Name; ----------------------- -- Is_External_State -- ----------------------- function Is_External_State (Id : E) return B is begin return Ekind (Id) = E_Abstract_State and then Has_Option (Id, Name_External); end Is_External_State; ------------------ -- Is_Finalizer -- ------------------ function Is_Finalizer (Id : E) return B is begin return Ekind (Id) = E_Procedure and then Chars (Id) = Name_uFinalizer; end Is_Finalizer; ------------------- -- Is_Null_State -- ------------------- function Is_Null_State (Id : E) return B is begin return Ekind (Id) = E_Abstract_State and then Nkind (Parent (Id)) = N_Null; end Is_Null_State; --------------------- -- Is_Packed_Array -- --------------------- function Is_Packed_Array (Id : E) return B is begin return Is_Array_Type (Id) and then Is_Packed (Id); end Is_Packed_Array; ----------------------------------- -- Is_Package_Or_Generic_Package -- ----------------------------------- function Is_Package_Or_Generic_Package (Id : E) return B is begin return Ekind_In (Id, E_Generic_Package, E_Package); end Is_Package_Or_Generic_Package; --------------- -- Is_Prival -- --------------- function Is_Prival (Id : E) return B is begin return (Ekind_In (Id, E_Constant, E_Variable) and then Present (Prival_Link (Id))); end Is_Prival; ---------------------------- -- Is_Protected_Component -- ---------------------------- function Is_Protected_Component (Id : E) return B is begin return Ekind (Id) = E_Component and then Is_Protected_Type (Scope (Id)); end Is_Protected_Component; ---------------------------- -- Is_Protected_Interface -- ---------------------------- function Is_Protected_Interface (Id : E) return B is Typ : constant Entity_Id := Base_Type (Id); begin if not Is_Interface (Typ) then return False; elsif Is_Class_Wide_Type (Typ) then return Is_Protected_Interface (Etype (Typ)); else return Protected_Present (Type_Definition (Parent (Typ))); end if; end Is_Protected_Interface; ------------------------------ -- Is_Protected_Record_Type -- ------------------------------ function Is_Protected_Record_Type (Id : E) return B is begin return Is_Concurrent_Record_Type (Id) and then Is_Protected_Type (Corresponding_Concurrent_Type (Id)); end Is_Protected_Record_Type; -------------------------------- -- Is_Standard_Character_Type -- -------------------------------- function Is_Standard_Character_Type (Id : E) return B is begin if Is_Type (Id) then declare R : constant Entity_Id := Root_Type (Id); begin return R = Standard_Character or else R = Standard_Wide_Character or else R = Standard_Wide_Wide_Character; end; else return False; end if; end Is_Standard_Character_Type; ----------------------------- -- Is_Standard_String_Type -- ----------------------------- function Is_Standard_String_Type (Id : E) return B is begin if Is_Type (Id) then declare R : constant Entity_Id := Root_Type (Id); begin return R = Standard_String or else R = Standard_Wide_String or else R = Standard_Wide_Wide_String; end; else return False; end if; end Is_Standard_String_Type; -------------------- -- Is_String_Type -- -------------------- function Is_String_Type (Id : E) return B is begin return Is_Array_Type (Id) and then Id /= Any_Composite and then Number_Dimensions (Id) = 1 and then Is_Character_Type (Component_Type (Id)); end Is_String_Type; ------------------------------- -- Is_Synchronized_Interface -- ------------------------------- function Is_Synchronized_Interface (Id : E) return B is Typ : constant Entity_Id := Base_Type (Id); begin if not Is_Interface (Typ) then return False; elsif Is_Class_Wide_Type (Typ) then return Is_Synchronized_Interface (Etype (Typ)); else return Protected_Present (Type_Definition (Parent (Typ))) or else Synchronized_Present (Type_Definition (Parent (Typ))) or else Task_Present (Type_Definition (Parent (Typ))); end if; end Is_Synchronized_Interface; --------------------------- -- Is_Synchronized_State -- --------------------------- function Is_Synchronized_State (Id : E) return B is begin return Ekind (Id) = E_Abstract_State and then Has_Option (Id, Name_Synchronous); end Is_Synchronized_State; ----------------------- -- Is_Task_Interface -- ----------------------- function Is_Task_Interface (Id : E) return B is Typ : constant Entity_Id := Base_Type (Id); begin if not Is_Interface (Typ) then return False; elsif Is_Class_Wide_Type (Typ) then return Is_Task_Interface (Etype (Typ)); else return Task_Present (Type_Definition (Parent (Typ))); end if; end Is_Task_Interface; ------------------------- -- Is_Task_Record_Type -- ------------------------- function Is_Task_Record_Type (Id : E) return B is begin return Is_Concurrent_Record_Type (Id) and then Is_Task_Type (Corresponding_Concurrent_Type (Id)); end Is_Task_Record_Type; ------------------------ -- Is_Wrapper_Package -- ------------------------ function Is_Wrapper_Package (Id : E) return B is begin return (Ekind (Id) = E_Package and then Present (Related_Instance (Id))); end Is_Wrapper_Package; ----------------- -- Last_Formal -- ----------------- function Last_Formal (Id : E) return E is Formal : E; begin pragma Assert (Is_Overloadable (Id) or else Ekind_In (Id, E_Entry_Family, E_Subprogram_Body, E_Subprogram_Type)); if Ekind (Id) = E_Enumeration_Literal then return Empty; else Formal := First_Formal (Id); if Present (Formal) then while Present (Next_Formal (Formal)) loop Formal := Next_Formal (Formal); end loop; end if; return Formal; end if; end Last_Formal; function Model_Emin_Value (Id : E) return Uint is begin return Machine_Emin_Value (Id); end Model_Emin_Value; ------------------------- -- Model_Epsilon_Value -- ------------------------- function Model_Epsilon_Value (Id : E) return Ureal is Radix : constant Ureal := UR_From_Uint (Machine_Radix_Value (Id)); begin return Radix ** (1 - Model_Mantissa_Value (Id)); end Model_Epsilon_Value; -------------------------- -- Model_Mantissa_Value -- -------------------------- function Model_Mantissa_Value (Id : E) return Uint is begin return Machine_Mantissa_Value (Id); end Model_Mantissa_Value; ----------------------- -- Model_Small_Value -- ----------------------- function Model_Small_Value (Id : E) return Ureal is Radix : constant Ureal := UR_From_Uint (Machine_Radix_Value (Id)); begin return Radix ** (Model_Emin_Value (Id) - 1); end Model_Small_Value; ------------------------ -- Machine_Emax_Value -- ------------------------ function Machine_Emax_Value (Id : E) return Uint is Digs : constant Pos := UI_To_Int (Digits_Value (Base_Type (Id))); begin case Float_Rep (Id) is when IEEE_Binary => case Digs is when 1 .. 6 => return Uint_128; when 7 .. 15 => return 2**10; when 16 .. 33 => return 2**14; when others => return No_Uint; end case; when AAMP => return Uint_2 ** Uint_7 - Uint_1; end case; end Machine_Emax_Value; ------------------------ -- Machine_Emin_Value -- ------------------------ function Machine_Emin_Value (Id : E) return Uint is begin case Float_Rep (Id) is when IEEE_Binary => return Uint_3 - Machine_Emax_Value (Id); when AAMP => return -Machine_Emax_Value (Id); end case; end Machine_Emin_Value; ---------------------------- -- Machine_Mantissa_Value -- ---------------------------- function Machine_Mantissa_Value (Id : E) return Uint is Digs : constant Pos := UI_To_Int (Digits_Value (Base_Type (Id))); begin case Float_Rep (Id) is when IEEE_Binary => case Digs is when 1 .. 6 => return Uint_24; when 7 .. 15 => return UI_From_Int (53); when 16 .. 18 => return Uint_64; when 19 .. 33 => return UI_From_Int (113); when others => return No_Uint; end case; when AAMP => case Digs is when 1 .. 6 => return Uint_24; when 7 .. 9 => return UI_From_Int (40); when others => return No_Uint; end case; end case; end Machine_Mantissa_Value; ------------------------- -- Machine_Radix_Value -- ------------------------- function Machine_Radix_Value (Id : E) return U is begin case Float_Rep (Id) is when AAMP | IEEE_Binary => return Uint_2; end case; end Machine_Radix_Value; -------------------- -- Next_Component -- -------------------- function Next_Component (Id : E) return E is Comp_Id : E; begin Comp_Id := Next_Entity (Id); while Present (Comp_Id) loop exit when Ekind (Comp_Id) = E_Component; Comp_Id := Next_Entity (Comp_Id); end loop; return Comp_Id; end Next_Component; ------------------------------------ -- Next_Component_Or_Discriminant -- ------------------------------------ function Next_Component_Or_Discriminant (Id : E) return E is Comp_Id : E; begin Comp_Id := Next_Entity (Id); while Present (Comp_Id) loop exit when Ekind_In (Comp_Id, E_Component, E_Discriminant); Comp_Id := Next_Entity (Comp_Id); end loop; return Comp_Id; end Next_Component_Or_Discriminant; ----------------------- -- Next_Discriminant -- ----------------------- -- This function actually implements both Next_Discriminant and -- Next_Stored_Discriminant by making sure that the Discriminant -- returned is of the same variety as Id. function Next_Discriminant (Id : E) return E is -- Derived Tagged types with private extensions look like this... -- E_Discriminant d1 -- E_Discriminant d2 -- E_Component _tag -- E_Discriminant d1 -- E_Discriminant d2 -- ... -- so it is critical not to go past the leading discriminants D : E := Id; begin pragma Assert (Ekind (Id) = E_Discriminant); loop D := Next_Entity (D); if No (D) or else (Ekind (D) /= E_Discriminant and then not Is_Itype (D)) then return Empty; end if; exit when Ekind (D) = E_Discriminant and then (Is_Completely_Hidden (D) = Is_Completely_Hidden (Id)); end loop; return D; end Next_Discriminant; ----------------- -- Next_Formal -- ----------------- function Next_Formal (Id : E) return E is P : E; begin -- Follow the chain of declared entities as long as the kind of the -- entity corresponds to a formal parameter. Skip internal entities -- that may have been created for implicit subtypes, in the process -- of analyzing default expressions. P := Id; loop Next_Entity (P); if No (P) or else Is_Formal (P) then return P; elsif not Is_Internal (P) then return Empty; end if; end loop; end Next_Formal; ----------------------------- -- Next_Formal_With_Extras -- ----------------------------- function Next_Formal_With_Extras (Id : E) return E is begin if Present (Extra_Formal (Id)) then return Extra_Formal (Id); else return Next_Formal (Id); end if; end Next_Formal_With_Extras; ---------------- -- Next_Index -- ---------------- function Next_Index (Id : Node_Id) return Node_Id is begin return Next (Id); end Next_Index; ------------------ -- Next_Literal -- ------------------ function Next_Literal (Id : E) return E is begin pragma Assert (Nkind (Id) in N_Entity); return Next (Id); end Next_Literal; ------------------------------ -- Next_Stored_Discriminant -- ------------------------------ function Next_Stored_Discriminant (Id : E) return E is begin -- See comment in Next_Discriminant return Next_Discriminant (Id); end Next_Stored_Discriminant; ----------------------- -- Number_Dimensions -- ----------------------- function Number_Dimensions (Id : E) return Pos is N : Int; T : Node_Id; begin if Ekind (Id) = E_String_Literal_Subtype then return 1; else N := 0; T := First_Index (Id); while Present (T) loop N := N + 1; Next_Index (T); end loop; return N; end if; end Number_Dimensions; -------------------- -- Number_Entries -- -------------------- function Number_Entries (Id : E) return Nat is N : Int; Ent : Entity_Id; begin pragma Assert (Is_Concurrent_Type (Id)); N := 0; Ent := First_Entity (Id); while Present (Ent) loop if Is_Entry (Ent) then N := N + 1; end if; Ent := Next_Entity (Ent); end loop; return N; end Number_Entries; -------------------- -- Number_Formals -- -------------------- function Number_Formals (Id : E) return Pos is N : Int; Formal : Entity_Id; begin N := 0; Formal := First_Formal (Id); while Present (Formal) loop N := N + 1; Formal := Next_Formal (Formal); end loop; return N; end Number_Formals; -------------------- -- Parameter_Mode -- -------------------- function Parameter_Mode (Id : E) return Formal_Kind is begin return Ekind (Id); end Parameter_Mode; --------------------------------- -- Partial_Invariant_Procedure -- --------------------------------- function Partial_Invariant_Procedure (Id : E) return E is Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id)); Subps := Subprograms_For_Type (Base_Type (Id)); if Present (Subps) then Subp_Elmt := First_Elmt (Subps); while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Is_Partial_Invariant_Procedure (Subp_Id) then return Subp_Id; end if; Next_Elmt (Subp_Elmt); end loop; end if; return Empty; end Partial_Invariant_Procedure; ------------------------------------- -- Partial_Refinement_Constituents -- ------------------------------------- function Partial_Refinement_Constituents (Id : E) return L is Constits : Elist_Id := No_Elist; procedure Add_Usable_Constituents (Item : E); -- Add global item Item and/or its constituents to list Constits when -- they can be used in a global refinement within the current scope. The -- criteria are: -- 1) If Item is an abstract state with full refinement visible, add -- its constituents. -- 2) If Item is an abstract state with only partial refinement -- visible, add both Item and its constituents. -- 3) If Item is an abstract state without a visible refinement, add -- it. -- 4) If Id is not an abstract state, add it. procedure Add_Usable_Constituents (List : Elist_Id); -- Apply Add_Usable_Constituents to every constituent in List ----------------------------- -- Add_Usable_Constituents -- ----------------------------- procedure Add_Usable_Constituents (Item : E) is begin if Ekind (Item) = E_Abstract_State then if Has_Visible_Refinement (Item) then Add_Usable_Constituents (Refinement_Constituents (Item)); elsif Has_Partial_Visible_Refinement (Item) then Append_New_Elmt (Item, Constits); Add_Usable_Constituents (Part_Of_Constituents (Item)); else Append_New_Elmt (Item, Constits); end if; else Append_New_Elmt (Item, Constits); end if; end Add_Usable_Constituents; procedure Add_Usable_Constituents (List : Elist_Id) is Constit_Elmt : Elmt_Id; begin if Present (List) then Constit_Elmt := First_Elmt (List); while Present (Constit_Elmt) loop Add_Usable_Constituents (Node (Constit_Elmt)); Next_Elmt (Constit_Elmt); end loop; end if; end Add_Usable_Constituents; -- Start of processing for Partial_Refinement_Constituents begin -- "Refinement" is a concept applicable only to abstract states pragma Assert (Ekind (Id) = E_Abstract_State); if Has_Visible_Refinement (Id) then Constits := Refinement_Constituents (Id); -- A refinement may be partially visible when objects declared in the -- private part of a package are subject to a Part_Of indicator. elsif Has_Partial_Visible_Refinement (Id) then Add_Usable_Constituents (Part_Of_Constituents (Id)); -- Function should only be called when full or partial refinement is -- visible. else raise Program_Error; end if; return Constits; end Partial_Refinement_Constituents; ------------------------ -- Predicate_Function -- ------------------------ function Predicate_Function (Id : E) return E is Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; Typ : Entity_Id; begin pragma Assert (Is_Type (Id)); -- If type is private and has a completion, predicate may be defined on -- the full view. if Is_Private_Type (Id) and then (not Has_Predicates (Id) or else No (Subprograms_For_Type (Id))) and then Present (Full_View (Id)) then Typ := Full_View (Id); else Typ := Id; end if; Subps := Subprograms_For_Type (Typ); if Present (Subps) then Subp_Elmt := First_Elmt (Subps); while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Ekind (Subp_Id) = E_Function and then Is_Predicate_Function (Subp_Id) then return Subp_Id; end if; Next_Elmt (Subp_Elmt); end loop; end if; return Empty; end Predicate_Function; -------------------------- -- Predicate_Function_M -- -------------------------- function Predicate_Function_M (Id : E) return E is Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; Typ : Entity_Id; begin pragma Assert (Is_Type (Id)); -- If type is private and has a completion, predicate may be defined on -- the full view. if Is_Private_Type (Id) and then (not Has_Predicates (Id) or else No (Subprograms_For_Type (Id))) and then Present (Full_View (Id)) then Typ := Full_View (Id); else Typ := Id; end if; Subps := Subprograms_For_Type (Typ); if Present (Subps) then Subp_Elmt := First_Elmt (Subps); while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Ekind (Subp_Id) = E_Function and then Is_Predicate_Function_M (Subp_Id) then return Subp_Id; end if; Next_Elmt (Subp_Elmt); end loop; end if; return Empty; end Predicate_Function_M; ------------------------- -- Present_In_Rep_Item -- ------------------------- function Present_In_Rep_Item (E : Entity_Id; N : Node_Id) return Boolean is Ritem : Node_Id; begin Ritem := First_Rep_Item (E); while Present (Ritem) loop if Ritem = N then return True; end if; Next_Rep_Item (Ritem); end loop; return False; end Present_In_Rep_Item; -------------------------- -- Primitive_Operations -- -------------------------- function Primitive_Operations (Id : E) return L is begin if Is_Concurrent_Type (Id) then if Present (Corresponding_Record_Type (Id)) then return Direct_Primitive_Operations (Corresponding_Record_Type (Id)); -- If expansion is disabled the corresponding record type is absent, -- but if the type has ancestors it may have primitive operations. elsif Is_Tagged_Type (Id) then return Direct_Primitive_Operations (Id); else return No_Elist; end if; else return Direct_Primitive_Operations (Id); end if; end Primitive_Operations; --------------------- -- Record_Rep_Item -- --------------------- procedure Record_Rep_Item (E : Entity_Id; N : Node_Id) is begin Set_Next_Rep_Item (N, First_Rep_Item (E)); Set_First_Rep_Item (E, N); end Record_Rep_Item; --------------- -- Root_Type -- --------------- function Root_Type (Id : E) return E is T, Etyp : E; begin pragma Assert (Nkind (Id) in N_Entity); T := Base_Type (Id); if Ekind (T) = E_Class_Wide_Type then return Etype (T); -- Other cases else loop Etyp := Etype (T); if T = Etyp then return T; -- Following test catches some error cases resulting from -- previous errors. elsif No (Etyp) then Check_Error_Detected; return T; elsif Is_Private_Type (T) and then Etyp = Full_View (T) then return T; elsif Is_Private_Type (Etyp) and then Full_View (Etyp) = T then return T; end if; T := Etyp; -- Return if there is a circularity in the inheritance chain. This -- happens in some error situations and we do not want to get -- stuck in this loop. if T = Base_Type (Id) then return T; end if; end loop; end if; end Root_Type; --------------------- -- Safe_Emax_Value -- --------------------- function Safe_Emax_Value (Id : E) return Uint is begin return Machine_Emax_Value (Id); end Safe_Emax_Value; ---------------------- -- Safe_First_Value -- ---------------------- function Safe_First_Value (Id : E) return Ureal is begin return -Safe_Last_Value (Id); end Safe_First_Value; --------------------- -- Safe_Last_Value -- --------------------- function Safe_Last_Value (Id : E) return Ureal is Radix : constant Uint := Machine_Radix_Value (Id); Mantissa : constant Uint := Machine_Mantissa_Value (Id); Emax : constant Uint := Safe_Emax_Value (Id); Significand : constant Uint := Radix ** Mantissa - 1; Exponent : constant Uint := Emax - Mantissa; begin if Radix = 2 then return UR_From_Components (Num => Significand * 2 ** (Exponent mod 4), Den => -Exponent / 4, Rbase => 16); else return UR_From_Components (Num => Significand, Den => -Exponent, Rbase => 16); end if; end Safe_Last_Value; ----------------- -- Scope_Depth -- ----------------- function Scope_Depth (Id : E) return Uint is Scop : Entity_Id; begin Scop := Id; while Is_Record_Type (Scop) loop Scop := Scope (Scop); end loop; return Scope_Depth_Value (Scop); end Scope_Depth; --------------------- -- Scope_Depth_Set -- --------------------- function Scope_Depth_Set (Id : E) return B is begin return not Is_Record_Type (Id) and then Field22 (Id) /= Union_Id (Empty); end Scope_Depth_Set; ----------------------------- -- Set_Component_Alignment -- ----------------------------- -- Component Alignment is encoded using two flags, Flag128/129 as -- follows. Note that both flags False = Align_Default, so that the -- default initialization of flags to False initializes component -- alignment to the default value as required. -- Flag128 Flag129 Value -- ------- ------- ----- -- False False Calign_Default -- False True Calign_Component_Size -- True False Calign_Component_Size_4 -- True True Calign_Storage_Unit procedure Set_Component_Alignment (Id : E; V : C) is begin pragma Assert ((Is_Array_Type (Id) or else Is_Record_Type (Id)) and then Is_Base_Type (Id)); case V is when Calign_Default => Set_Flag128 (Id, False); Set_Flag129 (Id, False); when Calign_Component_Size => Set_Flag128 (Id, False); Set_Flag129 (Id, True); when Calign_Component_Size_4 => Set_Flag128 (Id, True); Set_Flag129 (Id, False); when Calign_Storage_Unit => Set_Flag128 (Id, True); Set_Flag129 (Id, True); end case; end Set_Component_Alignment; ----------------------- -- Set_DIC_Procedure -- ----------------------- procedure Set_DIC_Procedure (Id : E; V : E) is Base_Typ : Entity_Id; Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id)); Base_Typ := Base_Type (Id); Subps := Subprograms_For_Type (Base_Typ); if No (Subps) then Subps := New_Elmt_List; Set_Subprograms_For_Type (Base_Typ, Subps); end if; Subp_Elmt := First_Elmt (Subps); Prepend_Elmt (V, Subps); -- Check for a duplicate default initial condition procedure while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Is_DIC_Procedure (Subp_Id) then raise Program_Error; end if; Next_Elmt (Subp_Elmt); end loop; end Set_DIC_Procedure; ----------------------------- -- Set_Invariant_Procedure -- ----------------------------- procedure Set_Invariant_Procedure (Id : E; V : E) is Base_Typ : Entity_Id; Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id)); Base_Typ := Base_Type (Id); Subps := Subprograms_For_Type (Base_Typ); if No (Subps) then Subps := New_Elmt_List; Set_Subprograms_For_Type (Base_Typ, Subps); end if; Subp_Elmt := First_Elmt (Subps); Prepend_Elmt (V, Subps); -- Check for a duplicate invariant procedure while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Is_Invariant_Procedure (Subp_Id) then raise Program_Error; end if; Next_Elmt (Subp_Elmt); end loop; end Set_Invariant_Procedure; ------------------------------------- -- Set_Partial_Invariant_Procedure -- ------------------------------------- procedure Set_Partial_Invariant_Procedure (Id : E; V : E) is Base_Typ : Entity_Id; Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id)); Base_Typ := Base_Type (Id); Subps := Subprograms_For_Type (Base_Typ); if No (Subps) then Subps := New_Elmt_List; Set_Subprograms_For_Type (Base_Typ, Subps); end if; Subp_Elmt := First_Elmt (Subps); Prepend_Elmt (V, Subps); -- Check for a duplicate partial invariant procedure while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Is_Partial_Invariant_Procedure (Subp_Id) then raise Program_Error; end if; Next_Elmt (Subp_Elmt); end loop; end Set_Partial_Invariant_Procedure; ---------------------------- -- Set_Predicate_Function -- ---------------------------- procedure Set_Predicate_Function (Id : E; V : E) is Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id) and then Has_Predicates (Id)); Subps := Subprograms_For_Type (Id); if No (Subps) then Subps := New_Elmt_List; Set_Subprograms_For_Type (Id, Subps); end if; Subp_Elmt := First_Elmt (Subps); Prepend_Elmt (V, Subps); -- Check for a duplicate predication function while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Ekind (Subp_Id) = E_Function and then Is_Predicate_Function (Subp_Id) then raise Program_Error; end if; Next_Elmt (Subp_Elmt); end loop; end Set_Predicate_Function; ------------------------------ -- Set_Predicate_Function_M -- ------------------------------ procedure Set_Predicate_Function_M (Id : E; V : E) is Subp_Elmt : Elmt_Id; Subp_Id : Entity_Id; Subps : Elist_Id; begin pragma Assert (Is_Type (Id) and then Has_Predicates (Id)); Subps := Subprograms_For_Type (Id); if No (Subps) then Subps := New_Elmt_List; Set_Subprograms_For_Type (Id, Subps); end if; Subp_Elmt := First_Elmt (Subps); Prepend_Elmt (V, Subps); -- Check for a duplicate predication function while Present (Subp_Elmt) loop Subp_Id := Node (Subp_Elmt); if Ekind (Subp_Id) = E_Function and then Is_Predicate_Function_M (Subp_Id) then raise Program_Error; end if; Next_Elmt (Subp_Elmt); end loop; end Set_Predicate_Function_M; ----------------- -- Size_Clause -- ----------------- function Size_Clause (Id : E) return N is begin return Get_Attribute_Definition_Clause (Id, Attribute_Size); end Size_Clause; ------------------------ -- Stream_Size_Clause -- ------------------------ function Stream_Size_Clause (Id : E) return N is begin return Get_Attribute_Definition_Clause (Id, Attribute_Stream_Size); end Stream_Size_Clause; ------------------ -- Subtype_Kind -- ------------------ function Subtype_Kind (K : Entity_Kind) return Entity_Kind is Kind : Entity_Kind; begin case K is when Access_Kind => Kind := E_Access_Subtype; when E_Array_Subtype | E_Array_Type => Kind := E_Array_Subtype; when E_Class_Wide_Subtype | E_Class_Wide_Type => Kind := E_Class_Wide_Subtype; when E_Decimal_Fixed_Point_Subtype | E_Decimal_Fixed_Point_Type => Kind := E_Decimal_Fixed_Point_Subtype; when E_Ordinary_Fixed_Point_Subtype | E_Ordinary_Fixed_Point_Type => Kind := E_Ordinary_Fixed_Point_Subtype; when E_Private_Subtype | E_Private_Type => Kind := E_Private_Subtype; when E_Limited_Private_Subtype | E_Limited_Private_Type => Kind := E_Limited_Private_Subtype; when E_Record_Subtype_With_Private | E_Record_Type_With_Private => Kind := E_Record_Subtype_With_Private; when E_Record_Subtype | E_Record_Type => Kind := E_Record_Subtype; when Enumeration_Kind => Kind := E_Enumeration_Subtype; when Float_Kind => Kind := E_Floating_Point_Subtype; when Signed_Integer_Kind => Kind := E_Signed_Integer_Subtype; when Modular_Integer_Kind => Kind := E_Modular_Integer_Subtype; when Protected_Kind => Kind := E_Protected_Subtype; when Task_Kind => Kind := E_Task_Subtype; when others => Kind := E_Void; raise Program_Error; end case; return Kind; end Subtype_Kind; --------------------- -- Type_High_Bound -- --------------------- function Type_High_Bound (Id : E) return Node_Id is Rng : constant Node_Id := Scalar_Range (Id); begin if Nkind (Rng) = N_Subtype_Indication then return High_Bound (Range_Expression (Constraint (Rng))); else return High_Bound (Rng); end if; end Type_High_Bound; -------------------- -- Type_Low_Bound -- -------------------- function Type_Low_Bound (Id : E) return Node_Id is Rng : constant Node_Id := Scalar_Range (Id); begin if Nkind (Rng) = N_Subtype_Indication then return Low_Bound (Range_Expression (Constraint (Rng))); else return Low_Bound (Rng); end if; end Type_Low_Bound; --------------------- -- Underlying_Type -- --------------------- function Underlying_Type (Id : E) return E is begin -- For record_with_private the underlying type is always the direct -- full view. Never try to take the full view of the parent it -- doesn't make sense. if Ekind (Id) = E_Record_Type_With_Private then return Full_View (Id); elsif Ekind (Id) in Incomplete_Or_Private_Kind then -- If we have an incomplete or private type with a full view, -- then we return the Underlying_Type of this full view. if Present (Full_View (Id)) then if Id = Full_View (Id) then -- Previous error in declaration return Empty; else return Underlying_Type (Full_View (Id)); end if; -- If we have a private type with an underlying full view, then we -- return the Underlying_Type of this underlying full view. elsif Ekind (Id) in Private_Kind and then Present (Underlying_Full_View (Id)) then return Underlying_Type (Underlying_Full_View (Id)); -- If we have an incomplete entity that comes from the limited -- view then we return the Underlying_Type of its non-limited -- view. elsif From_Limited_With (Id) and then Present (Non_Limited_View (Id)) then return Underlying_Type (Non_Limited_View (Id)); -- Otherwise check for the case where we have a derived type or -- subtype, and if so get the Underlying_Type of the parent type. elsif Etype (Id) /= Id then return Underlying_Type (Etype (Id)); -- Otherwise we have an incomplete or private type that has -- no full view, which means that we have not encountered the -- completion, so return Empty to indicate the underlying type -- is not yet known. else return Empty; end if; -- For non-incomplete, non-private types, return the type itself Also -- for entities that are not types at all return the entity itself. else return Id; end if; end Underlying_Type; ------------------------ -- Write_Entity_Flags -- ------------------------ procedure Write_Entity_Flags (Id : Entity_Id; Prefix : String) is procedure W (Flag_Name : String; Flag : Boolean); -- Write out given flag if it is set ------- -- W -- ------- procedure W (Flag_Name : String; Flag : Boolean) is begin if Flag then Write_Str (Prefix); Write_Str (Flag_Name); Write_Str (" = True"); Write_Eol; end if; end W; -- Start of processing for Write_Entity_Flags begin if (Is_Array_Type (Id) or else Is_Record_Type (Id)) and then Is_Base_Type (Id) then Write_Str (Prefix); Write_Str ("Component_Alignment = "); case Component_Alignment (Id) is when Calign_Default => Write_Str ("Calign_Default"); when Calign_Component_Size => Write_Str ("Calign_Component_Size"); when Calign_Component_Size_4 => Write_Str ("Calign_Component_Size_4"); when Calign_Storage_Unit => Write_Str ("Calign_Storage_Unit"); end case; Write_Eol; end if; W ("Address_Taken", Flag104 (Id)); W ("Body_Needed_For_SAL", Flag40 (Id)); W ("C_Pass_By_Copy", Flag125 (Id)); W ("Can_Never_Be_Null", Flag38 (Id)); W ("Checks_May_Be_Suppressed", Flag31 (Id)); W ("Contains_Ignored_Ghost_Code", Flag279 (Id)); W ("Debug_Info_Off", Flag166 (Id)); W ("Default_Expressions_Processed", Flag108 (Id)); W ("Delay_Cleanups", Flag114 (Id)); W ("Delay_Subprogram_Descriptors", Flag50 (Id)); W ("Depends_On_Private", Flag14 (Id)); W ("Discard_Names", Flag88 (Id)); W ("Elaboration_Entity_Required", Flag174 (Id)); W ("Elaborate_Body_Desirable", Flag210 (Id)); W ("Entry_Accepted", Flag152 (Id)); W ("Can_Use_Internal_Rep", Flag229 (Id)); W ("Finalize_Storage_Only", Flag158 (Id)); W ("From_Limited_With", Flag159 (Id)); W ("Has_Aliased_Components", Flag135 (Id)); W ("Has_Alignment_Clause", Flag46 (Id)); W ("Has_All_Calls_Remote", Flag79 (Id)); W ("Has_Atomic_Components", Flag86 (Id)); W ("Has_Biased_Representation", Flag139 (Id)); W ("Has_Completion", Flag26 (Id)); W ("Has_Completion_In_Body", Flag71 (Id)); W ("Has_Complex_Representation", Flag140 (Id)); W ("Has_Component_Size_Clause", Flag68 (Id)); W ("Has_Contiguous_Rep", Flag181 (Id)); W ("Has_Controlled_Component", Flag43 (Id)); W ("Has_Controlling_Result", Flag98 (Id)); W ("Has_Convention_Pragma", Flag119 (Id)); W ("Has_Default_Aspect", Flag39 (Id)); W ("Has_Delayed_Aspects", Flag200 (Id)); W ("Has_Delayed_Freeze", Flag18 (Id)); W ("Has_Delayed_Rep_Aspects", Flag261 (Id)); W ("Has_Discriminants", Flag5 (Id)); W ("Has_Dispatch_Table", Flag220 (Id)); W ("Has_Dynamic_Predicate_Aspect", Flag258 (Id)); W ("Has_Enumeration_Rep_Clause", Flag66 (Id)); W ("Has_Exit", Flag47 (Id)); W ("Has_Expanded_Contract", Flag240 (Id)); W ("Has_Forward_Instantiation", Flag175 (Id)); W ("Has_Fully_Qualified_Name", Flag173 (Id)); W ("Has_Gigi_Rep_Item", Flag82 (Id)); W ("Has_Homonym", Flag56 (Id)); W ("Has_Implicit_Dereference", Flag251 (Id)); W ("Has_Independent_Components", Flag34 (Id)); W ("Has_Inheritable_Invariants", Flag248 (Id)); W ("Has_Inherited_DIC", Flag133 (Id)); W ("Has_Inherited_Invariants", Flag291 (Id)); W ("Has_Initial_Value", Flag219 (Id)); W ("Has_Loop_Entry_Attributes", Flag260 (Id)); W ("Has_Machine_Radix_Clause", Flag83 (Id)); W ("Has_Master_Entity", Flag21 (Id)); W ("Has_Missing_Return", Flag142 (Id)); W ("Has_Nested_Block_With_Handler", Flag101 (Id)); W ("Has_Nested_Subprogram", Flag282 (Id)); W ("Has_Non_Standard_Rep", Flag75 (Id)); W ("Has_Out_Or_In_Out_Parameter", Flag110 (Id)); W ("Has_Object_Size_Clause", Flag172 (Id)); W ("Has_Own_DIC", Flag3 (Id)); W ("Has_Own_Invariants", Flag232 (Id)); W ("Has_Per_Object_Constraint", Flag154 (Id)); W ("Has_Pragma_Controlled", Flag27 (Id)); W ("Has_Pragma_Elaborate_Body", Flag150 (Id)); W ("Has_Pragma_Inline", Flag157 (Id)); W ("Has_Pragma_Inline_Always", Flag230 (Id)); W ("Has_Pragma_No_Inline", Flag201 (Id)); W ("Has_Pragma_Ordered", Flag198 (Id)); W ("Has_Pragma_Pack", Flag121 (Id)); W ("Has_Pragma_Preelab_Init", Flag221 (Id)); W ("Has_Pragma_Pure", Flag203 (Id)); W ("Has_Pragma_Pure_Function", Flag179 (Id)); W ("Has_Pragma_Thread_Local_Storage", Flag169 (Id)); W ("Has_Pragma_Unmodified", Flag233 (Id)); W ("Has_Pragma_Unreferenced", Flag180 (Id)); W ("Has_Pragma_Unreferenced_Objects", Flag212 (Id)); W ("Has_Pragma_Unused", Flag294 (Id)); W ("Has_Predicates", Flag250 (Id)); W ("Has_Primitive_Operations", Flag120 (Id)); W ("Has_Private_Ancestor", Flag151 (Id)); W ("Has_Private_Declaration", Flag155 (Id)); W ("Has_Protected", Flag271 (Id)); W ("Has_Qualified_Name", Flag161 (Id)); W ("Has_RACW", Flag214 (Id)); W ("Has_Record_Rep_Clause", Flag65 (Id)); W ("Has_Recursive_Call", Flag143 (Id)); W ("Has_Shift_Operator", Flag267 (Id)); W ("Has_Size_Clause", Flag29 (Id)); W ("Has_Small_Clause", Flag67 (Id)); W ("Has_Specified_Layout", Flag100 (Id)); W ("Has_Specified_Stream_Input", Flag190 (Id)); W ("Has_Specified_Stream_Output", Flag191 (Id)); W ("Has_Specified_Stream_Read", Flag192 (Id)); W ("Has_Specified_Stream_Write", Flag193 (Id)); W ("Has_Static_Discriminants", Flag211 (Id)); W ("Has_Static_Predicate", Flag269 (Id)); W ("Has_Static_Predicate_Aspect", Flag259 (Id)); W ("Has_Storage_Size_Clause", Flag23 (Id)); W ("Has_Stream_Size_Clause", Flag184 (Id)); W ("Has_Task", Flag30 (Id)); W ("Has_Timing_Event", Flag289 (Id)); W ("Has_Thunks", Flag228 (Id)); W ("Has_Unchecked_Union", Flag123 (Id)); W ("Has_Unknown_Discriminants", Flag72 (Id)); W ("Has_Visible_Refinement", Flag263 (Id)); W ("Has_Volatile_Components", Flag87 (Id)); W ("Has_Xref_Entry", Flag182 (Id)); W ("In_Package_Body", Flag48 (Id)); W ("In_Private_Part", Flag45 (Id)); W ("In_Use", Flag8 (Id)); W ("Is_Abstract_Subprogram", Flag19 (Id)); W ("Is_Abstract_Type", Flag146 (Id)); W ("Is_Access_Constant", Flag69 (Id)); W ("Is_Actual_Subtype", Flag293 (Id)); W ("Is_Ada_2005_Only", Flag185 (Id)); W ("Is_Ada_2012_Only", Flag199 (Id)); W ("Is_Aliased", Flag15 (Id)); W ("Is_Asynchronous", Flag81 (Id)); W ("Is_Atomic", Flag85 (Id)); W ("Is_Bit_Packed_Array", Flag122 (Id)); W ("Is_CPP_Class", Flag74 (Id)); W ("Is_Called", Flag102 (Id)); W ("Is_Character_Type", Flag63 (Id)); W ("Is_Checked_Ghost_Entity", Flag277 (Id)); W ("Is_Child_Unit", Flag73 (Id)); W ("Is_Class_Wide_Equivalent_Type", Flag35 (Id)); W ("Is_Compilation_Unit", Flag149 (Id)); W ("Is_Completely_Hidden", Flag103 (Id)); W ("Is_Concurrent_Record_Type", Flag20 (Id)); W ("Is_Constr_Subt_For_UN_Aliased", Flag141 (Id)); W ("Is_Constr_Subt_For_U_Nominal", Flag80 (Id)); W ("Is_Constrained", Flag12 (Id)); W ("Is_Constructor", Flag76 (Id)); W ("Is_Controlled", Flag42 (Id)); W ("Is_Controlling_Formal", Flag97 (Id)); W ("Is_Descendant_Of_Address", Flag223 (Id)); W ("Is_DIC_Procedure", Flag132 (Id)); W ("Is_Discrim_SO_Function", Flag176 (Id)); W ("Is_Discriminant_Check_Function", Flag264 (Id)); W ("Is_Dispatch_Table_Entity", Flag234 (Id)); W ("Is_Dispatching_Operation", Flag6 (Id)); W ("Is_Eliminated", Flag124 (Id)); W ("Is_Entry_Formal", Flag52 (Id)); W ("Is_Exception_Handler", Flag286 (Id)); W ("Is_Exported", Flag99 (Id)); W ("Is_Finalized_Transient", Flag252 (Id)); W ("Is_First_Subtype", Flag70 (Id)); W ("Is_For_Access_Subtype", Flag118 (Id)); W ("Is_Formal_Subprogram", Flag111 (Id)); W ("Is_Frozen", Flag4 (Id)); W ("Is_Generic_Actual_Subprogram", Flag274 (Id)); W ("Is_Generic_Actual_Type", Flag94 (Id)); W ("Is_Generic_Instance", Flag130 (Id)); W ("Is_Generic_Type", Flag13 (Id)); W ("Is_Hidden", Flag57 (Id)); W ("Is_Hidden_Non_Overridden_Subpgm", Flag2 (Id)); W ("Is_Hidden_Open_Scope", Flag171 (Id)); W ("Is_Ignored_Ghost_Entity", Flag278 (Id)); W ("Is_Ignored_Transient", Flag295 (Id)); W ("Is_Immediately_Visible", Flag7 (Id)); W ("Is_Implementation_Defined", Flag254 (Id)); W ("Is_Imported", Flag24 (Id)); W ("Is_Independent", Flag268 (Id)); W ("Is_Inlined", Flag11 (Id)); W ("Is_Inlined_Always", Flag1 (Id)); W ("Is_Instantiated", Flag126 (Id)); W ("Is_Interface", Flag186 (Id)); W ("Is_Internal", Flag17 (Id)); W ("Is_Interrupt_Handler", Flag89 (Id)); W ("Is_Intrinsic_Subprogram", Flag64 (Id)); W ("Is_Invariant_Procedure", Flag257 (Id)); W ("Is_Itype", Flag91 (Id)); W ("Is_Known_Non_Null", Flag37 (Id)); W ("Is_Known_Null", Flag204 (Id)); W ("Is_Known_Valid", Flag170 (Id)); W ("Is_Limited_Composite", Flag106 (Id)); W ("Is_Limited_Interface", Flag197 (Id)); W ("Is_Limited_Record", Flag25 (Id)); W ("Is_Local_Anonymous_Access", Flag194 (Id)); W ("Is_Machine_Code_Subprogram", Flag137 (Id)); W ("Is_Non_Static_Subtype", Flag109 (Id)); W ("Is_Null_Init_Proc", Flag178 (Id)); W ("Is_Obsolescent", Flag153 (Id)); W ("Is_Only_Out_Parameter", Flag226 (Id)); W ("Is_Package_Body_Entity", Flag160 (Id)); W ("Is_Packed", Flag51 (Id)); W ("Is_Packed_Array_Impl_Type", Flag138 (Id)); W ("Is_Param_Block_Component_Type", Flag215 (Id)); W ("Is_Partial_Invariant_Procedure", Flag292 (Id)); W ("Is_Potentially_Use_Visible", Flag9 (Id)); W ("Is_Predicate_Function", Flag255 (Id)); W ("Is_Predicate_Function_M", Flag256 (Id)); W ("Is_Preelaborated", Flag59 (Id)); W ("Is_Primitive", Flag218 (Id)); W ("Is_Primitive_Wrapper", Flag195 (Id)); W ("Is_Private_Composite", Flag107 (Id)); W ("Is_Private_Descendant", Flag53 (Id)); W ("Is_Private_Primitive", Flag245 (Id)); W ("Is_Public", Flag10 (Id)); W ("Is_Pure", Flag44 (Id)); W ("Is_Pure_Unit_Access_Type", Flag189 (Id)); W ("Is_RACW_Stub_Type", Flag244 (Id)); W ("Is_Raised", Flag224 (Id)); W ("Is_Remote_Call_Interface", Flag62 (Id)); W ("Is_Remote_Types", Flag61 (Id)); W ("Is_Renaming_Of_Object", Flag112 (Id)); W ("Is_Return_Object", Flag209 (Id)); W ("Is_Safe_To_Reevaluate", Flag249 (Id)); W ("Is_Shared_Passive", Flag60 (Id)); W ("Is_Static_Type", Flag281 (Id)); W ("Is_Statically_Allocated", Flag28 (Id)); W ("Is_Tag", Flag78 (Id)); W ("Is_Tagged_Type", Flag55 (Id)); W ("Is_Thunk", Flag225 (Id)); W ("Is_Trivial_Subprogram", Flag235 (Id)); W ("Is_True_Constant", Flag163 (Id)); W ("Is_Unchecked_Union", Flag117 (Id)); W ("Is_Underlying_Full_View", Flag298 (Id)); W ("Is_Underlying_Record_View", Flag246 (Id)); W ("Is_Unimplemented", Flag284 (Id)); W ("Is_Unsigned_Type", Flag144 (Id)); W ("Is_Uplevel_Referenced_Entity", Flag283 (Id)); W ("Is_Valued_Procedure", Flag127 (Id)); W ("Is_Visible_Formal", Flag206 (Id)); W ("Is_Visible_Lib_Unit", Flag116 (Id)); W ("Is_Volatile", Flag16 (Id)); W ("Is_Volatile_Full_Access", Flag285 (Id)); W ("Itype_Printed", Flag202 (Id)); W ("Kill_Elaboration_Checks", Flag32 (Id)); W ("Kill_Range_Checks", Flag33 (Id)); W ("Known_To_Have_Preelab_Init", Flag207 (Id)); W ("Low_Bound_Tested", Flag205 (Id)); W ("Machine_Radix_10", Flag84 (Id)); W ("Materialize_Entity", Flag168 (Id)); W ("May_Inherit_Delayed_Rep_Aspects", Flag262 (Id)); W ("Must_Be_On_Byte_Boundary", Flag183 (Id)); W ("Must_Have_Preelab_Init", Flag208 (Id)); W ("Needs_Debug_Info", Flag147 (Id)); W ("Needs_No_Actuals", Flag22 (Id)); W ("Never_Set_In_Source", Flag115 (Id)); W ("No_Dynamic_Predicate_On_actual", Flag276 (Id)); W ("No_Pool_Assigned", Flag131 (Id)); W ("No_Predicate_On_actual", Flag275 (Id)); W ("No_Return", Flag113 (Id)); W ("No_Strict_Aliasing", Flag136 (Id)); W ("Non_Binary_Modulus", Flag58 (Id)); W ("Nonzero_Is_True", Flag162 (Id)); W ("OK_To_Rename", Flag247 (Id)); W ("OK_To_Reorder_Components", Flag239 (Id)); W ("Optimize_Alignment_Space", Flag241 (Id)); W ("Optimize_Alignment_Time", Flag242 (Id)); W ("Overlays_Constant", Flag243 (Id)); W ("Partial_View_Has_Unknown_Discr", Flag280 (Id)); W ("Reachable", Flag49 (Id)); W ("Referenced", Flag156 (Id)); W ("Referenced_As_LHS", Flag36 (Id)); W ("Referenced_As_Out_Parameter", Flag227 (Id)); W ("Renamed_In_Spec", Flag231 (Id)); W ("Requires_Overriding", Flag213 (Id)); W ("Return_Present", Flag54 (Id)); W ("Returns_By_Ref", Flag90 (Id)); W ("Reverse_Bit_Order", Flag164 (Id)); W ("Reverse_Storage_Order", Flag93 (Id)); W ("Rewritten_For_C", Flag287 (Id)); W ("Predicates_Ignored", Flag288 (Id)); W ("Sec_Stack_Needed_For_Return", Flag167 (Id)); W ("Size_Depends_On_Discriminant", Flag177 (Id)); W ("Size_Known_At_Compile_Time", Flag92 (Id)); W ("SPARK_Aux_Pragma_Inherited", Flag266 (Id)); W ("SPARK_Pragma_Inherited", Flag265 (Id)); W ("SSO_Set_High_By_Default", Flag273 (Id)); W ("SSO_Set_Low_By_Default", Flag272 (Id)); W ("Static_Elaboration_Desired", Flag77 (Id)); W ("Stores_Attribute_Old_Prefix", Flag270 (Id)); W ("Strict_Alignment", Flag145 (Id)); W ("Suppress_Elaboration_Warnings", Flag148 (Id)); W ("Suppress_Initialization", Flag105 (Id)); W ("Suppress_Style_Checks", Flag165 (Id)); W ("Suppress_Value_Tracking_On_Call", Flag217 (Id)); W ("Treat_As_Volatile", Flag41 (Id)); W ("Universal_Aliasing", Flag216 (Id)); W ("Used_As_Generic_Actual", Flag222 (Id)); W ("Uses_Sec_Stack", Flag95 (Id)); W ("Warnings_Off", Flag96 (Id)); W ("Warnings_Off_Used", Flag236 (Id)); W ("Warnings_Off_Used_Unmodified", Flag237 (Id)); W ("Warnings_Off_Used_Unreferenced", Flag238 (Id)); W ("Was_Hidden", Flag196 (Id)); end Write_Entity_Flags; ----------------------- -- Write_Entity_Info -- ----------------------- procedure Write_Entity_Info (Id : Entity_Id; Prefix : String) is procedure Write_Attribute (Which : String; Nam : E); -- Write attribute value with given string name procedure Write_Kind (Id : Entity_Id); -- Write Ekind field of entity --------------------- -- Write_Attribute -- --------------------- procedure Write_Attribute (Which : String; Nam : E) is begin Write_Str (Prefix); Write_Str (Which); Write_Int (Int (Nam)); Write_Str (" "); Write_Name (Chars (Nam)); Write_Str (" "); end Write_Attribute; ---------------- -- Write_Kind -- ---------------- procedure Write_Kind (Id : Entity_Id) is K : constant String := Entity_Kind'Image (Ekind (Id)); begin Write_Str (Prefix); Write_Str (" Kind "); if Is_Type (Id) and then Is_Tagged_Type (Id) then Write_Str ("TAGGED "); end if; Write_Str (K (3 .. K'Length)); Write_Str (" "); if Is_Type (Id) and then Depends_On_Private (Id) then Write_Str ("Depends_On_Private "); end if; end Write_Kind; -- Start of processing for Write_Entity_Info begin Write_Eol; Write_Attribute ("Name ", Id); Write_Int (Int (Id)); Write_Eol; Write_Kind (Id); Write_Eol; Write_Attribute (" Type ", Etype (Id)); Write_Eol; Write_Attribute (" Scope ", Scope (Id)); Write_Eol; case Ekind (Id) is when Discrete_Kind => Write_Str ("Bounds: Id = "); if Present (Scalar_Range (Id)) then Write_Int (Int (Type_Low_Bound (Id))); Write_Str (" .. Id = "); Write_Int (Int (Type_High_Bound (Id))); else Write_Str ("Empty"); end if; Write_Eol; when Array_Kind => declare Index : E; begin Write_Attribute (" Component Type ", Component_Type (Id)); Write_Eol; Write_Str (Prefix); Write_Str (" Indexes "); Index := First_Index (Id); while Present (Index) loop Write_Attribute (" ", Etype (Index)); Index := Next_Index (Index); end loop; Write_Eol; end; when Access_Kind => Write_Attribute (" Directly Designated Type ", Directly_Designated_Type (Id)); Write_Eol; when Overloadable_Kind => if Present (Homonym (Id)) then Write_Str (" Homonym "); Write_Name (Chars (Homonym (Id))); Write_Str (" "); Write_Int (Int (Homonym (Id))); Write_Eol; end if; Write_Eol; when E_Component => if Ekind (Scope (Id)) in Record_Kind then Write_Attribute ( " Original_Record_Component ", Original_Record_Component (Id)); Write_Int (Int (Original_Record_Component (Id))); Write_Eol; end if; when others => null; end case; end Write_Entity_Info; ----------------------- -- Write_Field6_Name -- ----------------------- procedure Write_Field6_Name (Id : Entity_Id) is pragma Unreferenced (Id); begin Write_Str ("First_Rep_Item"); end Write_Field6_Name; ----------------------- -- Write_Field7_Name -- ----------------------- procedure Write_Field7_Name (Id : Entity_Id) is pragma Unreferenced (Id); begin Write_Str ("Freeze_Node"); end Write_Field7_Name; ----------------------- -- Write_Field8_Name -- ----------------------- procedure Write_Field8_Name (Id : Entity_Id) is begin case Ekind (Id) is when Type_Kind => Write_Str ("Associated_Node_For_Itype"); when E_Package => Write_Str ("Dependent_Instances"); when E_Loop => Write_Str ("First_Exit_Statement"); when E_Variable => Write_Str ("Hiding_Loop_Variable"); when Formal_Kind | E_Function | E_Subprogram_Body => Write_Str ("Mechanism"); when E_Component | E_Discriminant => Write_Str ("Normalized_First_Bit"); when E_Abstract_State => Write_Str ("Refinement_Constituents"); when E_Return_Statement => Write_Str ("Return_Applies_To"); when others => Write_Str ("Field8??"); end case; end Write_Field8_Name; ----------------------- -- Write_Field9_Name -- ----------------------- procedure Write_Field9_Name (Id : Entity_Id) is begin case Ekind (Id) is when Type_Kind => Write_Str ("Class_Wide_Type"); when Object_Kind => Write_Str ("Current_Value"); when E_Function | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Package | E_Procedure => Write_Str ("Renaming_Map"); when others => Write_Str ("Field9??"); end case; end Write_Field9_Name; ------------------------ -- Write_Field10_Name -- ------------------------ procedure Write_Field10_Name (Id : Entity_Id) is begin case Ekind (Id) is when Class_Wide_Kind | Incomplete_Kind | E_Record_Type | E_Record_Subtype | Private_Kind | Concurrent_Kind => Write_Str ("Direct_Primitive_Operations"); when E_Constant | E_In_Parameter => Write_Str ("Discriminal_Link"); when Float_Kind => Write_Str ("Float_Rep"); when E_Function | E_Package | E_Package_Body | E_Procedure => Write_Str ("Handler_Records"); when E_Component | E_Discriminant => Write_Str ("Normalized_Position_Max"); when E_Abstract_State | E_Variable => Write_Str ("Part_Of_Constituents"); when others => Write_Str ("Field10??"); end case; end Write_Field10_Name; ------------------------ -- Write_Field11_Name -- ------------------------ procedure Write_Field11_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Block => Write_Str ("Block_Node"); when E_Component | E_Discriminant => Write_Str ("Component_Bit_Offset"); when Formal_Kind => Write_Str ("Entry_Component"); when E_Enumeration_Literal => Write_Str ("Enumeration_Pos"); when Type_Kind | E_Constant => Write_Str ("Full_View"); when E_Generic_Package => Write_Str ("Generic_Homonym"); when E_Variable => Write_Str ("Part_Of_References"); when E_Entry | E_Entry_Family | E_Function | E_Procedure => Write_Str ("Protected_Body_Subprogram"); when others => Write_Str ("Field11??"); end case; end Write_Field11_Name; ------------------------ -- Write_Field12_Name -- ------------------------ procedure Write_Field12_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Package => Write_Str ("Associated_Formal_Package"); when Entry_Kind => Write_Str ("Barrier_Function"); when E_Enumeration_Literal => Write_Str ("Enumeration_Rep"); when Type_Kind | E_Component | E_Constant | E_Discriminant | E_Exception | E_In_Parameter | E_In_Out_Parameter | E_Out_Parameter | E_Loop_Parameter | E_Variable => Write_Str ("Esize"); when E_Function | E_Procedure => Write_Str ("Next_Inlined_Subprogram"); when others => Write_Str ("Field12??"); end case; end Write_Field12_Name; ------------------------ -- Write_Field13_Name -- ------------------------ procedure Write_Field13_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Component | E_Discriminant => Write_Str ("Component_Clause"); when E_Function | E_Procedure | E_Package | Generic_Unit_Kind => Write_Str ("Elaboration_Entity"); when Formal_Kind | E_Variable => Write_Str ("Extra_Accessibility"); when Type_Kind => Write_Str ("RM_Size"); when others => Write_Str ("Field13??"); end case; end Write_Field13_Name; ----------------------- -- Write_Field14_Name -- ----------------------- procedure Write_Field14_Name (Id : Entity_Id) is begin case Ekind (Id) is when Type_Kind | Formal_Kind | E_Constant | E_Exception | E_Loop_Parameter | E_Variable => Write_Str ("Alignment"); when E_Component | E_Discriminant => Write_Str ("Normalized_Position"); when E_Entry | E_Entry_Family | E_Function | E_Procedure => Write_Str ("Postconditions_Proc"); when E_Generic_Package | E_Package => Write_Str ("Shadow_Entities"); when others => Write_Str ("Field14??"); end case; end Write_Field14_Name; ------------------------ -- Write_Field15_Name -- ------------------------ procedure Write_Field15_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Discriminant => Write_Str ("Discriminant_Number"); when E_Component => Write_Str ("DT_Entry_Count"); when E_Function | E_Procedure => Write_Str ("DT_Position"); when Entry_Kind => Write_Str ("Entry_Parameters_Type"); when Formal_Kind => Write_Str ("Extra_Formal"); when Type_Kind => Write_Str ("Pending_Access_Types"); when E_Package | E_Package_Body => Write_Str ("Related_Instance"); when E_Constant | E_Variable => Write_Str ("Status_Flag_Or_Transient_Decl"); when others => Write_Str ("Field15??"); end case; end Write_Field15_Name; ------------------------ -- Write_Field16_Name -- ------------------------ procedure Write_Field16_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Record_Type | E_Record_Type_With_Private => Write_Str ("Access_Disp_Table"); when E_Abstract_State => Write_Str ("Body_References"); when E_Class_Wide_Subtype | E_Record_Subtype => Write_Str ("Cloned_Subtype"); when E_Function | E_Procedure => Write_Str ("DTC_Entity"); when E_Component => Write_Str ("Entry_Formal"); when Concurrent_Kind | E_Generic_Package | E_Package => Write_Str ("First_Private_Entity"); when Enumeration_Kind => Write_Str ("Lit_Strings"); when Decimal_Fixed_Point_Kind => Write_Str ("Scale_Value"); when E_String_Literal_Subtype => Write_Str ("String_Literal_Length"); when E_Out_Parameter | E_Variable => Write_Str ("Unset_Reference"); when others => Write_Str ("Field16??"); end case; end Write_Field16_Name; ------------------------ -- Write_Field17_Name -- ------------------------ procedure Write_Field17_Name (Id : Entity_Id) is begin case Ekind (Id) is when Formal_Kind | E_Constant | E_Generic_In_Out_Parameter | E_Variable => Write_Str ("Actual_Subtype"); when Digits_Kind => Write_Str ("Digits_Value"); when E_Discriminant => Write_Str ("Discriminal"); when Class_Wide_Kind | Concurrent_Kind | Private_Kind | E_Block | E_Entry | E_Entry_Family | E_Function | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Loop | E_Operator | E_Package | E_Package_Body | E_Procedure | E_Record_Type | E_Record_Subtype | E_Return_Statement | E_Subprogram_Body | E_Subprogram_Type => Write_Str ("First_Entity"); when Array_Kind => Write_Str ("First_Index"); when Enumeration_Kind => Write_Str ("First_Literal"); when Access_Kind => Write_Str ("Master_Id"); when Modular_Integer_Kind => Write_Str ("Modulus"); when E_Component => Write_Str ("Prival"); when others => Write_Str ("Field17??"); end case; end Write_Field17_Name; ------------------------ -- Write_Field18_Name -- ------------------------ procedure Write_Field18_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Enumeration_Literal | E_Function | E_Operator | E_Procedure => Write_Str ("Alias"); when E_Record_Type => Write_Str ("Corresponding_Concurrent_Type"); when E_Subprogram_Body => Write_Str ("Corresponding_Protected_Entry"); when Concurrent_Kind => Write_Str ("Corresponding_Record_Type"); when E_Block | E_Label | E_Loop => Write_Str ("Enclosing_Scope"); when E_Entry_Index_Parameter => Write_Str ("Entry_Index_Constant"); when E_Access_Protected_Subprogram_Type | E_Access_Subprogram_Type | E_Anonymous_Access_Protected_Subprogram_Type | E_Exception_Type | E_Class_Wide_Subtype => Write_Str ("Equivalent_Type"); when Fixed_Point_Kind => Write_Str ("Delta_Value"); when Enumeration_Kind => Write_Str ("Lit_Indexes"); when Incomplete_Or_Private_Kind | E_Record_Subtype => Write_Str ("Private_Dependents"); when E_Exception | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Package => Write_Str ("Renamed_Entity"); when Object_Kind => Write_Str ("Renamed_Object"); when E_String_Literal_Subtype => Write_Str ("String_Literal_Low_Bound"); when others => Write_Str ("Field18??"); end case; end Write_Field18_Name; ----------------------- -- Write_Field19_Name -- ----------------------- procedure Write_Field19_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Generic_Package | E_Package => Write_Str ("Body_Entity"); when E_Discriminant => Write_Str ("Corresponding_Discriminant"); when Scalar_Kind => Write_Str ("Default_Aspect_Value"); when E_Array_Type => Write_Str ("Default_Component_Value"); when E_Protected_Type => Write_Str ("Entry_Bodies_Array"); when E_Function | E_Operator | E_Subprogram_Type => Write_Str ("Extra_Accessibility_Of_Result"); when E_Abstract_State | E_Class_Wide_Type | E_Incomplete_Type => Write_Str ("Non_Limited_View"); when E_Incomplete_Subtype => if From_Limited_With (Id) then Write_Str ("Non_Limited_View"); end if; when E_Record_Type => Write_Str ("Parent_Subtype"); when E_Constant | E_Variable => Write_Str ("Size_Check_Code"); when Formal_Kind | E_Package_Body => Write_Str ("Spec_Entity"); when Private_Kind => Write_Str ("Underlying_Full_View"); when others => Write_Str ("Field19??"); end case; end Write_Field19_Name; ----------------------- -- Write_Field20_Name -- ----------------------- procedure Write_Field20_Name (Id : Entity_Id) is begin case Ekind (Id) is when Array_Kind => Write_Str ("Component_Type"); when E_Generic_In_Parameter | E_In_Parameter => Write_Str ("Default_Value"); when Access_Kind => Write_Str ("Directly_Designated_Type"); when E_Component => Write_Str ("Discriminant_Checking_Func"); when E_Discriminant => Write_Str ("Discriminant_Default_Value"); when Class_Wide_Kind | Concurrent_Kind | Private_Kind | E_Block | E_Entry | E_Entry_Family | E_Function | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Loop | E_Operator | E_Package | E_Package_Body | E_Procedure | E_Record_Type | E_Record_Subtype | E_Return_Statement | E_Subprogram_Body | E_Subprogram_Type => Write_Str ("Last_Entity"); when E_Constant | E_Variable => Write_Str ("Prival_Link"); when E_Exception => Write_Str ("Register_Exception_Call"); when Scalar_Kind => Write_Str ("Scalar_Range"); when others => Write_Str ("Field20??"); end case; end Write_Field20_Name; ----------------------- -- Write_Field21_Name -- ----------------------- procedure Write_Field21_Name (Id : Entity_Id) is begin case Ekind (Id) is when Entry_Kind => Write_Str ("Accept_Address"); when E_In_Parameter => Write_Str ("Default_Expr_Function"); when Concurrent_Kind | Incomplete_Or_Private_Kind | Class_Wide_Kind | E_Record_Type | E_Record_Subtype => Write_Str ("Discriminant_Constraint"); when E_Constant | E_Exception | E_Function | E_Generic_Function | E_Generic_Procedure | E_Procedure | E_Variable => Write_Str ("Interface_Name"); when Array_Kind | Modular_Integer_Kind => Write_Str ("Original_Array_Type"); when Fixed_Point_Kind => Write_Str ("Small_Value"); when others => Write_Str ("Field21??"); end case; end Write_Field21_Name; ----------------------- -- Write_Field22_Name -- ----------------------- procedure Write_Field22_Name (Id : Entity_Id) is begin case Ekind (Id) is when Access_Kind => Write_Str ("Associated_Storage_Pool"); when Array_Kind => Write_Str ("Component_Size"); when E_Record_Type => Write_Str ("Corresponding_Remote_Type"); when E_Component | E_Discriminant => Write_Str ("Original_Record_Component"); when E_Enumeration_Literal => Write_Str ("Enumeration_Rep_Expr"); when E_Limited_Private_Subtype | E_Limited_Private_Type | E_Private_Subtype | E_Private_Type | E_Record_Subtype_With_Private | E_Record_Type_With_Private => Write_Str ("Private_View"); when Formal_Kind => Write_Str ("Protected_Formal"); when E_Block | E_Entry | E_Entry_Family | E_Function | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Loop | E_Package | E_Package_Body | E_Procedure | E_Protected_Type | E_Return_Statement | E_Subprogram_Body | E_Task_Type => Write_Str ("Scope_Depth_Value"); when E_Variable => Write_Str ("Shared_Var_Procs_Instance"); when others => Write_Str ("Field22??"); end case; end Write_Field22_Name; ------------------------ -- Write_Field23_Name -- ------------------------ procedure Write_Field23_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Discriminant => Write_Str ("CR_Discriminant"); when E_Block => Write_Str ("Entry_Cancel_Parameter"); when E_Enumeration_Type => Write_Str ("Enum_Pos_To_Rep"); when Formal_Kind | E_Variable => Write_Str ("Extra_Constrained"); when Access_Kind => Write_Str ("Finalization_Master"); when E_Generic_Function | E_Generic_Package | E_Generic_Procedure => Write_Str ("Inner_Instances"); when Array_Kind => Write_Str ("Packed_Array_Impl_Type"); when Entry_Kind => Write_Str ("Protection_Object"); when Class_Wide_Kind | Concurrent_Kind | Incomplete_Or_Private_Kind | E_Record_Type | E_Record_Subtype => Write_Str ("Stored_Constraint"); when E_Function | E_Procedure => if Present (Scope (Id)) and then Is_Protected_Type (Scope (Id)) then Write_Str ("Protection_Object"); else Write_Str ("Generic_Renamings"); end if; when E_Package => if Is_Generic_Instance (Id) then Write_Str ("Generic_Renamings"); else Write_Str ("Limited_View"); end if; when others => Write_Str ("Field23??"); end case; end Write_Field23_Name; ------------------------ -- Write_Field24_Name -- ------------------------ procedure Write_Field24_Name (Id : Entity_Id) is begin case Ekind (Id) is when Type_Kind | E_Constant | E_Variable => Write_Str ("Related_Expression"); when E_Function | E_Operator | E_Procedure => Write_Str ("Subps_Index"); when E_Package => Write_Str ("Incomplete_Actuals"); when others => Write_Str ("Field24???"); end case; end Write_Field24_Name; ------------------------ -- Write_Field25_Name -- ------------------------ procedure Write_Field25_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Generic_Package | E_Package => Write_Str ("Abstract_States"); when E_Entry | E_Entry_Family => Write_Str ("Contract_Wrapper"); when E_Variable => Write_Str ("Debug_Renaming_Link"); when E_Component => Write_Str ("DT_Offset_To_Top_Func"); when E_Function | E_Procedure => Write_Str ("Interface_Alias"); when E_Record_Subtype | E_Record_Subtype_With_Private | E_Record_Type | E_Record_Type_With_Private => Write_Str ("Interfaces"); when E_Array_Subtype | E_Array_Type => Write_Str ("Related_Array_Object"); when Discrete_Kind => Write_Str ("Static_Discrete_Predicate"); when Real_Kind => Write_Str ("Static_Real_Or_String_Predicate"); when Task_Kind => Write_Str ("Task_Body_Procedure"); when others => Write_Str ("Field25??"); end case; end Write_Field25_Name; ------------------------ -- Write_Field26_Name -- ------------------------ procedure Write_Field26_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Record_Type | E_Record_Type_With_Private => Write_Str ("Dispatch_Table_Wrappers"); when E_In_Out_Parameter | E_Out_Parameter | E_Variable => Write_Str ("Last_Assignment"); when E_Function | E_Procedure => Write_Str ("Overridden_Operation"); when E_Generic_Package | E_Package => Write_Str ("Package_Instantiation"); when E_Component | E_Constant => Write_Str ("Related_Type"); when Access_Kind | Task_Kind => Write_Str ("Storage_Size_Variable"); when others => Write_Str ("Field26??"); end case; end Write_Field26_Name; ------------------------ -- Write_Field27_Name -- ------------------------ procedure Write_Field27_Name (Id : Entity_Id) is begin case Ekind (Id) is when Type_Kind | E_Package => Write_Str ("Current_Use_Clause"); when E_Component | E_Constant | E_Variable => Write_Str ("Related_Type"); when E_Function | E_Procedure => Write_Str ("Wrapped_Entity"); when others => Write_Str ("Field27??"); end case; end Write_Field27_Name; ------------------------ -- Write_Field28_Name -- ------------------------ procedure Write_Field28_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Entry | E_Entry_Family | E_Function | E_Procedure | E_Subprogram_Body | E_Subprogram_Type => Write_Str ("Extra_Formals"); when E_Package | E_Package_Body => Write_Str ("Finalizer"); when E_Constant | E_Variable => Write_Str ("Initialization_Statements"); when E_Access_Subprogram_Type => Write_Str ("Original_Access_Type"); when Task_Kind => Write_Str ("Relative_Deadline_Variable"); when E_Record_Type => Write_Str ("Underlying_Record_View"); when others => Write_Str ("Field28??"); end case; end Write_Field28_Name; ------------------------ -- Write_Field29_Name -- ------------------------ procedure Write_Field29_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Function | E_Package | E_Procedure | E_Subprogram_Body => Write_Str ("Anonymous_Masters"); when E_Constant | E_Variable => Write_Str ("BIP_Initialization_Call"); when Type_Kind => Write_Str ("Subprograms_For_Type"); when others => Write_Str ("Field29??"); end case; end Write_Field29_Name; ------------------------ -- Write_Field30_Name -- ------------------------ procedure Write_Field30_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Protected_Type | E_Task_Type => Write_Str ("Anonymous_Object"); when E_Function => Write_Str ("Corresponding_Equality"); when E_Constant | E_Variable => Write_Str ("Last_Aggregate_Assignment"); when E_Procedure => Write_Str ("Static_Initialization"); when others => Write_Str ("Field30??"); end case; end Write_Field30_Name; ------------------------ -- Write_Field31_Name -- ------------------------ procedure Write_Field31_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Constant | E_In_Parameter | E_In_Out_Parameter | E_Loop_Parameter | E_Out_Parameter | E_Variable => Write_Str ("Activation_Record_Component"); when Type_Kind => Write_Str ("Derived_Type_Link"); when E_Function | E_Procedure => Write_Str ("Thunk_Entity"); when others => Write_Str ("Field31??"); end case; end Write_Field31_Name; ------------------------ -- Write_Field32_Name -- ------------------------ procedure Write_Field32_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Procedure => Write_Str ("Corresponding_Function"); when E_Function => Write_Str ("Corresponding_Procedure"); when E_Abstract_State | E_Constant | E_Variable => Write_Str ("Encapsulating_State"); when Type_Kind => Write_Str ("No_Tagged_Streams_Pragma"); when others => Write_Str ("Field32??"); end case; end Write_Field32_Name; ------------------------ -- Write_Field33_Name -- ------------------------ procedure Write_Field33_Name (Id : Entity_Id) is begin case Ekind (Id) is when Subprogram_Kind | Type_Kind | E_Constant | E_Variable => Write_Str ("Linker_Section_Pragma"); when others => Write_Str ("Field33??"); end case; end Write_Field33_Name; ------------------------ -- Write_Field34_Name -- ------------------------ procedure Write_Field34_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Constant | E_Entry | E_Entry_Family | E_Function | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Operator | E_Package | E_Package_Body | E_Procedure | E_Protected_Type | E_Subprogram_Body | E_Task_Body | E_Task_Type | E_Variable | E_Void => Write_Str ("Contract"); when others => Write_Str ("Field34??"); end case; end Write_Field34_Name; ------------------------ -- Write_Field35_Name -- ------------------------ procedure Write_Field35_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Variable => Write_Str ("Anonymous_Designated_Type"); when E_Entry | E_Entry_Family => Write_Str ("Entry_Max_Queue_Lenghts_Array"); when Subprogram_Kind => Write_Str ("Import_Pragma"); when others => Write_Str ("Field35??"); end case; end Write_Field35_Name; ------------------------ -- Write_Field36_Name -- ------------------------ procedure Write_Field36_Name (Id : Entity_Id) is pragma Unreferenced (Id); begin Write_Str ("Field36??"); end Write_Field36_Name; ------------------------ -- Write_Field37_Name -- ------------------------ procedure Write_Field37_Name (Id : Entity_Id) is pragma Unreferenced (Id); begin Write_Str ("Associated_Entity"); end Write_Field37_Name; ------------------------ -- Write_Field38_Name -- ------------------------ procedure Write_Field38_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Function | E_Procedure => Write_Str ("Class_Wide_Preconditions"); when others => Write_Str ("Field38??"); end case; end Write_Field38_Name; ------------------------ -- Write_Field39_Name -- ------------------------ procedure Write_Field39_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Function | E_Procedure => Write_Str ("Class_Wide_Postcondition"); when others => Write_Str ("Field39??"); end case; end Write_Field39_Name; ------------------------ -- Write_Field40_Name -- ------------------------ procedure Write_Field40_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Entry | E_Entry_Family | E_Function | E_Generic_Function | E_Generic_Package | E_Generic_Procedure | E_Operator | E_Package | E_Package_Body | E_Procedure | E_Protected_Body | E_Protected_Type | E_Subprogram_Body | E_Task_Body | E_Task_Type | E_Variable => Write_Str ("SPARK_Pragma"); when others => Write_Str ("Field40??"); end case; end Write_Field40_Name; ------------------------ -- Write_Field41_Name -- ------------------------ procedure Write_Field41_Name (Id : Entity_Id) is begin case Ekind (Id) is when E_Function | E_Procedure => Write_Str ("Original_Protected_Subprogram"); when E_Generic_Package | E_Package | E_Package_Body | E_Protected_Type | E_Task_Type => Write_Str ("SPARK_Aux_Pragma"); when others => Write_Str ("Field41??"); end case; end Write_Field41_Name; ------------------------- -- Iterator Procedures -- ------------------------- procedure Proc_Next_Component (N : in out Node_Id) is begin N := Next_Component (N); end Proc_Next_Component; procedure Proc_Next_Component_Or_Discriminant (N : in out Node_Id) is begin N := Next_Entity (N); while Present (N) loop exit when Ekind_In (N, E_Component, E_Discriminant); N := Next_Entity (N); end loop; end Proc_Next_Component_Or_Discriminant; procedure Proc_Next_Discriminant (N : in out Node_Id) is begin N := Next_Discriminant (N); end Proc_Next_Discriminant; procedure Proc_Next_Formal (N : in out Node_Id) is begin N := Next_Formal (N); end Proc_Next_Formal; procedure Proc_Next_Formal_With_Extras (N : in out Node_Id) is begin N := Next_Formal_With_Extras (N); end Proc_Next_Formal_With_Extras; procedure Proc_Next_Index (N : in out Node_Id) is begin N := Next_Index (N); end Proc_Next_Index; procedure Proc_Next_Inlined_Subprogram (N : in out Node_Id) is begin N := Next_Inlined_Subprogram (N); end Proc_Next_Inlined_Subprogram; procedure Proc_Next_Literal (N : in out Node_Id) is begin N := Next_Literal (N); end Proc_Next_Literal; procedure Proc_Next_Stored_Discriminant (N : in out Node_Id) is begin N := Next_Stored_Discriminant (N); end Proc_Next_Stored_Discriminant; end Einfo;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . I M G _ B O O L -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2009, 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. -- -- -- ------------------------------------------------------------------------------ -- Boolean'Image package System.Img_Bool is pragma Pure; procedure Image_Boolean (V : Boolean; S : in out String; P : out Natural); -- Computes Boolean'Image (V) and stores the result in S (1 .. P) -- setting the resulting value of P. The caller guarantees that S -- is long enough to hold the result, and that S'First is 1. end System.Img_Bool;
-- Copyright 2014-2017 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 Result1 : Data_Type; GGG1 : GADataType'Class := GADataType'Class (Result1); begin Do_Nothing (GGG1'Address); -- BREAK end Foo;
-- This file is freely given to the Public Domain. -- with Ada.Command_Line; use Ada.Command_Line; with Ada.Text_IO; use Ada.Text_IO; with Ada.Strings.Unbounded; with Vole_Tokens; with kv.avm.Vole_Lex; with Vole_Lex_IO; with kv.avm.vole_parser; with kv.avm.vole_tree; with kv.avm.Tree_Dots; with kv.avm.Tree_Rewrite; with kv.avm.Code_Generator; procedure parse_test is subtype String_Type is Ada.Strings.Unbounded.Unbounded_String; -- Conversion operators to go back and forth between strings and unbounded strings. -- function "+"(S : String) return String_Type renames Ada.Strings.Unbounded.To_Unbounded_String; function "+"(U : String_Type) return String renames Ada.Strings.Unbounded.To_String; File_Name : String_Type := +"test_1.vole"; Grapher : aliased kv.avm.Tree_Dots.Grapher_Class; Rewriter : aliased kv.avm.Tree_Rewrite.Rewriter_Class; Code_Gen : aliased kv.avm.Code_Generator.Code_Generator_Class; begin for I in 1 .. Argument_Count loop if Argument(I) = "-v" then kv.avm.vole_parser.Verbose := True; else File_Name := +Argument(I); end if; end loop; Put_Line("//parse_test -- the vole parser test "&(+File_Name)); Vole_Lex_IO.open_input(+File_Name); Vole_Lex_IO.create_output; kv.avm.vole_parser.yyparse; Vole_Lex_IO.close_input; Vole_Lex_IO.close_output; Rewriter.Init; kv.avm.vole_tree.Get_Program.Visit(Rewriter'ACCESS, 0); Rewriter.Finalize; Grapher.Init("program.dot"); kv.avm.vole_tree.Get_Program.Visit(Grapher'ACCESS, 0); Grapher.Finalize; Code_Gen.Init; kv.avm.vole_tree.Get_Program.Visit(Code_Gen'ACCESS, 0); Code_Gen.Print; Code_Gen.Finalize; end parse_test;
-- TITLE aflex - main program -- -- AUTHOR: John Self (UCI) -- DESCRIPTION main subprogram of aflex, calls the major routines in order -- $Header: /co/ua/self/arcadia/aflex/ada/src/RCS/aflex.a,v 1.11 90/10/15 20:00:40 self Exp Locker: self $ --*************************************************************************** -- aflex -- version 1.4a --*************************************************************************** -- -- Arcadia Project -- Department of Information and Computer Science -- University of California -- Irvine, California 92717 -- -- Send requests for aflex information to alex-info@ics.uci.edu -- -- Send bug reports for aflex to alex-bugs@ics.uci.edu -- -- Copyright (c) 1990 Regents of the University of California. -- All rights reserved. -- -- This software was developed by John Self of the Arcadia project -- at the University of California, Irvine. -- -- Redistribution and use in source and binary forms are permitted -- provided that the above copyright notice and this paragraph are -- duplicated in all such forms and that any documentation, -- advertising materials, and other materials related to such -- distribution and use acknowledge that the software was developed -- by the University of California, Irvine. The name of the -- University may not be used to endorse or promote products derived -- from this software without specific prior written permission. -- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR -- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED -- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. -- -- This program is based on the flex program written by Vern Paxson. -- -- The following is the copyright notice from flex, from which aflex is -- derived. -- Copyright (c) 1989 The Regents of the University of California. -- All rights reserved. -- -- This code is derived from software contributed to Berkeley by -- Vern Paxson. -- -- The United States Government has rights in this work pursuant to -- contract no. DE-AC03-76SF00098 between the United States Department of -- Energy and the University of California. -- -- Redistribution and use in source and binary forms are permitted -- provided that the above copyright notice and this paragraph are -- duplicated in all such forms and that any documentation, -- advertising materials, and other materials related to such -- distribution and use acknowledge that the software was developed -- by the University of California, Berkeley. The name of the -- University may not be used to endorse or promote products derived -- from this software without specific prior written permission. -- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR -- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED -- WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. -- --*************************************************************************** with Ada.Wide_Wide_Text_IO; with MAIN_BODY, DFA, GEN, MISC_DEFS, MISC; with TEMPLATE_MANAGER; use MISC_DEFS; function Aflex return Integer is Copyright : constant String := "@(#) Copyright (c) 1990 Regents of the University of California."; Copyright_2 : constant String := "All rights reserved."; pragma Unreferenced (Copyright, Copyright_2); begin MAIN_BODY.Aflex_Init; MAIN_BODY.READIN; if (SYNTAXERROR) then Main_Body.Aflex_End (1); end if; if (PERFORMANCE_REPORT) then if (INTERACTIVE) then Ada.Wide_Wide_Text_IO.Put_Line (Ada.Wide_Wide_Text_IO.Standard_Error, "-I (interactive) entails a minor performance penalty"); end if; end if; if (VARIABLE_TRAILING_CONTEXT_RULES) then Misc.Aflex_Error ("can't handle variable trailing context rules"); end if; -- convert the ndfa to a dfa DFA.NTOD; -- generate the Ada state transition tables from the DFA GEN.MAKE_TABLES; TEMPLATE_MANAGER.GENERATE_IO_FILE; TEMPLATE_MANAGER.GENERATE_DFA_FILE; Main_Body.Aflex_End (0); return 0; exception when MAIN_BODY.AFLEX_TERMINATE => return MAIN_BODY.TERMINATION_STATUS; end Aflex;
with TTS_Example2; with Ada.Exceptions; use Ada.Exceptions; with Ada.Real_Time; with Ada.Text_IO; use Ada.Text_IO; procedure Main2 is begin TTS_Example2.Main; delay until Ada.Real_Time.Time_Last; exception when E : others => Put_Line (Exception_Message (E)); end Main2;
-- { dg-do run } -- { dg-options "-gnat05 -O2" } with Enum2_Pkg; use Enum2_Pkg; procedure Enum2 is type Enum is (A, B, C, D); Table : array (B .. C, 1 .. 1) of F_String := (others => (others => Null_String)); begin Table := (others => (others => Null_String)); end;
-- This package is intended to set up and tear down the test environment. -- Once created by GNATtest, this package will never be overwritten -- automatically. Contents of this package can be modified in any way -- except for sections surrounded by a 'read only' marker. with Ada.Directories; use Ada.Directories; with Ada.Text_IO; use Ada.Text_IO; with Config; use Config; with Log; use Log; package body Game.Test_Data is procedure Set_Up(Gnattest_T: in out Test) is pragma Unreferenced(Gnattest_T); begin if Data_Directory = To_Unbounded_String("../../bin/data/") then return; end if; Data_Directory := To_Unbounded_String("../../bin/data/"); Save_Directory := To_Unbounded_String("../../bin/data/saves/"); Create_Path(To_String(Save_Directory)); Doc_Directory := To_Unbounded_String("../../bin/doc/"); Mods_Directory := To_Unbounded_String("../../bin/data/mods/"); Themes_Directory := To_Unbounded_String("../../bin/data/themes/"); Debug_Mode := EVERYTHING; Start_Logging; Load_Config; declare Message: constant String := Load_Game_Data; begin if Message'Length > 0 then Put_Line("Can't load the game data. Reason: " & Message); end if; end; New_Game_Settings.Player_Faction := To_Unbounded_String("POLEIS"); New_Game_Settings.Player_Career := To_Unbounded_String("general"); New_Game_Settings.Starting_Base := To_Unbounded_String("1"); New_Game; end Set_Up; procedure Tear_Down(Gnattest_T: in out Test) is pragma Unreferenced(Gnattest_T); begin null; end Tear_Down; end Game.Test_Data;
with Interfaces; use Interfaces; package body Natools.Static_Maps.S_Expressions.Templates.Integers.AC is P : constant array (0 .. 0) of Natural := (0 .. 0 => 1); T1 : constant array (0 .. 0) of Unsigned_8 := (0 .. 0 => 3); T2 : constant array (0 .. 0) of Unsigned_8 := (0 .. 0 => 5); G : constant array (0 .. 6) of Unsigned_8 := (0, 0, 0, 0, 0, 1, 2); function Hash (S : String) return Natural is F : constant Natural := S'First - 1; L : constant Natural := S'Length; F1, F2 : Natural := 0; J : Natural; begin for K in P'Range loop exit when L < P (K); J := Character'Pos (S (P (K) + F)); F1 := (F1 + Natural (T1 (K)) * J) mod 7; F2 := (F2 + Natural (T2 (K)) * J) mod 7; end loop; return (Natural (G (F1)) + Natural (G (F2))) mod 3; end Hash; end Natools.Static_Maps.S_Expressions.Templates.Integers.AC;
------------------------------------------------------------------------ -- -- Copyright (c) 2018, Brendan T Malone All Rights Reserved. -- -- 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 AUnit.Reporter.Text; with AUnit.Run; with Alog_Suite; procedure Test_Alog is procedure Runner is new AUnit.Run.Test_Runner (Alog_Suite.Suite); Reporter : AUnit.Reporter.Text.Text_Reporter; begin Runner (Reporter); end Test_Alog;
----------------------------------------------------------------------- -- awa-users-servlets -- OpenID verification servlet for user authentication -- 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. ----------------------------------------------------------------------- with ASF.Principals; with ASF.Security.Servlets; with ASF.Requests; with ASF.Responses; with Security.Auth; package AWA.Users.Servlets is -- ------------------------------ -- OpenID Request Servlet -- ------------------------------ -- The <b>Request_Auth_Servlet</b> servlet implements the first steps of an OpenID -- authentication. type Request_Auth_Servlet is new ASF.Security.Servlets.Request_Auth_Servlet with null record; -- Proceed to the OpenID authentication with an OpenID provider. -- Find the OpenID provider URL and starts the discovery, association phases -- during which a private key is obtained from the OpenID provider. -- After OpenID discovery and association, the user will be redirected to -- the OpenID provider. overriding procedure Do_Get (Server : in Request_Auth_Servlet; Request : in out ASF.Requests.Request'Class; Response : in out ASF.Responses.Response'Class); -- ------------------------------ -- OpenID Verification Servlet -- ------------------------------ -- The <b>Verify_Auth_Servlet</b> verifies the authentication result and -- extract authentication from the callback URL. We override the default implementation -- to provide our own user principal once the authentication succeeded. At the same time, -- if this is the first time we see the user, s/he will be registered by using the -- user service. type Verify_Auth_Servlet is new ASF.Security.Servlets.Verify_Auth_Servlet with private; -- Create a principal object that correspond to the authenticated user identified -- by the <b>Auth</b> information. The principal will be attached to the session -- and will be destroyed when the session is closed. overriding procedure Create_Principal (Server : in Verify_Auth_Servlet; Auth : in Security.Auth.Authentication; Result : out ASF.Principals.Principal_Access); -- Verify the authentication result that was returned by the OpenID provider. -- If the authentication succeeded and the signature was correct, sets a -- user principals on the session. overriding procedure Do_Get (Server : in Verify_Auth_Servlet; Request : in out ASF.Requests.Request'Class; Response : in out ASF.Responses.Response'Class); private type Verify_Auth_Servlet is new ASF.Security.Servlets.Verify_Auth_Servlet with null record; end AWA.Users.Servlets;
With Ada.Streams, Ada.Strings.Less_Case_Insensitive, Ada.Strings.Equal_Case_Insensitive, Ada.Containers.Indefinite_Ordered_Maps; Package INI with Preelaborate, Elaborate_Body is Type Value_Type is ( vt_String, vt_Float, vt_Integer, vt_Boolean ); Type Instance(Convert : Boolean) is private; Function Exists( Object : in Instance; Key : in String; Section: in String:= "" ) return Boolean; -- Return the type of the associated value. Function Value( Object : in Instance; Key : in String; Section: in String:= "" ) return Value_Type with Pre => Exists(Object, Key, Section); -- Return the value associated with the key in the indicated section. Function Value( Object : in Instance; Key : in String; Section: in String:= "" ) return String with Pre => Exists(Object, Key, Section); Function Value( Object : in Instance; Key : in String; Section: in String:= "" ) return Float with Pre => Exists(Object, Key, Section); Function Value( Object : in Instance; Key : in String; Section: in String:= "" ) return Integer with Pre => Exists(Object, Key, Section); Function Value( Object : in Instance; Key : in String; Section: in String:= "" ) return Boolean with Pre => Exists(Object, Key, Section); -- Associates a value with the given key in the indicated section. Procedure Value( Object : in out Instance; Key : in String; Value : in String; Section: in String:= "" ) with Post => Exists(Object, Key, Section); Procedure Value( Object : in out Instance; Key : in String; Value : in Float; Section: in String:= "" ) with Post => Exists(Object, Key, Section); Procedure Value( Object : in out Instance; Key : in String; Value : in Integer; Section: in String:= "" ) with Post => Exists(Object, Key, Section); Procedure Value( Object : in out Instance; Key : in String; Value : in Boolean; Section: in String:= "" ) with Post => Exists(Object, Key, Section); -- This value sets the Convert discriminant for the object that is generated -- by the 'Input attribute. Default_Conversion : Boolean := False; Empty : Constant Instance; Private Type Value_Object( Kind : Value_Type; Length : Natural ) ; Function "ABS"( Object : Value_Object ) return String; Function "="(Left, Right : Value_Object) return Boolean; Package Object_Package is procedure Value_Output( Stream : not null access Ada.Streams.Root_Stream_Type'Class; Item : in Value_Object ) is null; function Value_Input( Stream : not null access Ada.Streams.Root_Stream_Type'Class ) return Value_Object; End Object_Package; Type Value_Object( Kind : Value_Type; Length : Natural ) is record case Kind is when vt_String => String_Value : String(1..Length):= (Others=>' '); when vt_Float => Float_Value : Float := 0.0; when vt_Integer => Integer_Value: Integer := 0; when vt_Boolean => Boolean_Value: Boolean := False; end case; end record; -- with Input => Object_Package.Value_Input, -- Output => Object_Package.Value_Output; Package KEY_VALUE_MAP is new Ada.Containers.Indefinite_Ordered_Maps( -- "=" => , "<" => Ada.Strings.Less_Case_Insensitive, Key_Type => String, Element_Type => Value_Object ); Function "="(Left, Right : KEY_VALUE_MAP.Map) return Boolean; Package KEY_SECTION_MAP is new Ada.Containers.Indefinite_Ordered_Maps( "=" => "=", "<" => Ada.Strings.Less_Case_Insensitive, Key_Type => String, Element_Type => KEY_VALUE_MAP.Map ); procedure INI_Output( Stream : not null access Ada.Streams.Root_Stream_Type'Class; Item : in Instance ); function INI_Input( Stream : not null access Ada.Streams.Root_Stream_Type'Class ) return Instance; Type Instance(Convert : Boolean) is new KEY_SECTION_MAP.Map with null record with Input => INI_Input, Output => INI_Output; overriding function Copy (Source : Instance) return Instance is ( Source ); Empty : Constant Instance:= (KEY_SECTION_MAP.map with Convert => True, others => <>); End INI;
with Ada.Numerics.Discrete_Random; package Oversize is subtype M1 is Integer range 1 .. 200; -- Won't trigger type R1 (D : M1 := 100) is record Name : String (1 .. D); end record; type M2 is new Integer range 1 .. 200; -- Won't trigger for M2'Size use 64; type M2S is array (M2 range <>) of Character; type R2 (D : M2 := 100) is record Name : M2S (1 .. D); end record; subtype M3 is Integer; -- Will trigger type R3 (D : M3 := 100) -- { dg-error "may raise Storage_Error" } is record Name : String (1 .. D); end record; type M4 is new Positive; -- Will trigger type M4S is array (M4 range <>) of Character; type R4 (D : M4 := 100) -- { dg-error "may raise Storage_Error" } is record Name : M4S (1 .. D); end record; type M5 is new Positive; -- Will trigger for M5'Size use Integer'Size - 1; type M5S is array (M5 range <>) of Character; type R5 (D : M5 := 100) -- { dg-error "may raise Storage_Error" } is record Name : M5S (1 .. D); end record; subtype M6 is Integer range 1 .. (Integer'Last + 1)/2; -- Won't trigger type R6 (D : M6 := 100) is record Name : String (1 .. D); end record; subtype M7 is Integer range 1 .. (Integer'Last + 1)/2+1; -- Will trigger type R7 (D : M7 := 100) -- { dg-error "may raise Storage_Error" } is record Name : String (1 .. D); end record; package P8 is new Ada.Numerics.Discrete_Random (Natural); G8 : P8.Generator; subtype M8 is Integer range 1 .. P8.Random (G8); -- Won't trigger type R8 (D : M8 := 100) is record Name : String (1 .. D); end record; end Oversize;
with Ada.Text_IO; procedure main is Δ : Integer; begin Δ := 41; Δ := Δ + 1; Ada.Text_IO.Put_Line (Δ'Img); end main;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . T E X T _ I O . E N U M E R A T I O N _ I O -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2015, 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.Text_IO.Enumeration_Aux; package body Ada.Text_IO.Enumeration_IO is package Aux renames Ada.Text_IO.Enumeration_Aux; --------- -- Get -- --------- procedure Get (File : File_Type; Item : out Enum) is Buf : String (1 .. Enum'Width + 1); Buflen : Natural; begin Aux.Get_Enum_Lit (File, Buf, Buflen); declare Buf_Str : String renames Buf (1 .. Buflen); pragma Unsuppress (Range_Check); begin Item := Enum'Value (Buf_Str); end; exception when Constraint_Error => raise Data_Error; end Get; procedure Get (Item : out Enum) is pragma Unsuppress (Range_Check); begin Get (Current_In, Item); end Get; procedure Get (From : String; Item : out Enum; Last : out Positive) is Start : Natural; begin Aux.Scan_Enum_Lit (From, Start, Last); declare From_Str : String renames From (Start .. Last); pragma Unsuppress (Range_Check); begin Item := Enum'Value (From_Str); end; exception when Constraint_Error => raise Data_Error; end Get; --------- -- Put -- --------- procedure Put (File : File_Type; Item : Enum; Width : Field := Default_Width; Set : Type_Set := Default_Setting) is begin -- Ensure that Item is valid before attempting to retrieve the Image, to -- prevent the possibility of out-of-bounds addressing of index or image -- tables. Units in the run-time library are normally compiled with -- checks suppressed, which includes instantiated generics. if not Item'Valid then raise Constraint_Error with "invalid enumeration value"; end if; Aux.Put (File, Enum'Image (Item), Width, Set); end Put; procedure Put (Item : Enum; Width : Field := Default_Width; Set : Type_Set := Default_Setting) is begin Put (Current_Out, Item, Width, Set); end Put; procedure Put (To : out String; Item : Enum; Set : Type_Set := Default_Setting) is begin -- Ensure that Item is valid before attempting to retrieve the Image, to -- prevent the possibility of out-of-bounds addressing of index or image -- tables. Units in the run-time library are normally compiled with -- checks suppressed, which includes instantiated generics. if not Item'Valid then raise Constraint_Error with "invalid enumeration value"; end if; Aux.Puts (To, Enum'Image (Item), Set); end Put; end Ada.Text_IO.Enumeration_IO;
-- pugi_xml.adb - Fri Jun 10 21:55:55 2016 -- -- (c) Warren W. Gay VE3WWG ve3wwg@gmail.com -- -- Protected under the following license: -- GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 -- with Ada.Text_IO; package body Pugi_Xml is function Strlen(C_Ptr : System.Address) return Natural is function UX_strlen(cstr : System.Address) return Interfaces.C.Unsigned; pragma Import(C,UX_strlen,"pugi_c_strlen"); begin return Natural(UX_strlen(C_Ptr)); end Strlen; pragma Inline(Strlen); function C_String(Ada_String: String) return String is T : String(Ada_String'First..Ada_String'Last+1); begin T(T'First..T'Last-1) := Ada_String; T(T'Last) := Character'Val(0); return T; end C_String; procedure Initialize(Obj: in out Xml_Document) is function new_xml_document return System.Address; pragma Import(C,new_xml_document,"pugi_new_xml_document"); begin Obj.Doc := new_xml_document; end Initialize; procedure Finalize(Obj: in out Xml_Document) is procedure delete_xml_document(Doc: System.Address); pragma Import(C,delete_xml_document,"pugi_delete_xml_document"); begin delete_xml_document(Obj.Doc); Obj.Doc := System.Null_Address; end Finalize; procedure Initialize(Obj: in out Xml_Node) is begin Obj.Node := System.Null_Address; end Initialize; procedure Finalize(Obj: in out Xml_Node) is begin Obj.Node := System.Null_Address; end Finalize; procedure Initialize(Obj: in out Xml_Attribute) is begin Obj.Attr := System.Null_Address; end Initialize; procedure Finalize(Obj: in out Xml_Attribute) is begin Obj.Attr := System.Null_Address; end Finalize; function Root(Obj: XML_Document'Class) return XML_Node is function root(Doc: System.Address) return System.Address; pragma Import(C,root,"pugi_doc_root"); Node: XML_Node; begin Node.Node := root(Obj.Doc); return Node; end Root; procedure Load( Obj: XML_Document; Pathname: String; Options: XML_Parse_Flags := Parse_Default_Flags; Encoding_Option: XML_Encoding := Encoding_Auto; Result: out XML_Parse_Result'Class ) is procedure load_xml_file(Doc, Path, Status, Offset, Encoding_Option, OK, C_Desc, Options: System.Address; EncOpt: Standard.Integer); pragma Import(C,load_xml_file,"pugi_load_xml_file"); Flags: aliased XML_Parse_Flags := Options; Enc_Opt: aliased Standard.Integer := XML_Encoding'Pos(Encoding_Option); C_Path: aliased String := C_String(Pathname); Status: aliased Standard.Integer; Offset: aliased Interfaces.C.Unsigned; Encoding: aliased Standard.Integer; OK: aliased Standard.Integer; C_Desc: aliased System.Address; begin load_xml_file(Obj.Doc,C_Path'Address,Status'Address,Offset'Address,Encoding'Address,OK'Address,C_Desc'Address,Flags'Address,Enc_Opt); Result.Status := XML_Parse_Status'Val(Status); Result.Offset := Offset; Result.Encoding := XML_Encoding'Val(Encoding); Result.OK := OK /= 0; Result.C_Desc := C_Desc; end Load; procedure Load_In_Place( Obj: XML_Document; Contents: System.Address; Bytes: Standard.Integer; Options: XML_Parse_Flags := Parse_Default_Flags; Encoding: XML_Encoding := Encoding_Auto; Result: out XML_Parse_Result'Class ) is procedure load_in_place(Obj, Contents, Status, Offset, Enc, OK, C_Desc: System.Address; Options: System.Address; Size, Encoding: Standard.Integer); pragma Import(C,load_in_place,"pugi_load_in_place"); Status: aliased Standard.Integer; Offset: aliased Interfaces.C.Unsigned; Enc: aliased Standard.Integer; OK: aliased Standard.Integer; C_Desc: aliased System.Address; Flags: aliased XML_Parse_Flags := Options; begin load_in_place( Obj => Obj.Doc, Contents => Contents, Status => Status'Address, Offset => Offset'Address, Enc => Enc'Address, OK => OK'Address, C_Desc => C_Desc'Address, Size => Bytes, Options => Flags'Address, Encoding => XML_Encoding'Pos(Encoding) ); Result.Status := XML_Parse_Status'Val(Status); Result.Offset := Offset; Result.Encoding := XML_Encoding'Val(Enc); Result.OK := OK /= 0; Result.C_Desc := C_Desc; end Load_In_Place; procedure Save( Obj: XML_Document; Pathname: String; OK: out Boolean; Indent: String := Indent_Default; Encoding: XML_Encoding := Encoding_Auto; Format: XML_Format_Flags := Format_Default_Flags ) is function save(Doc, Path, Indent: System.Address; Encoding: Standard.Integer; Format: System.Address) return Standard.Integer; pragma Import(C,save,"pugi_save_file"); Flags: aliased XML_Format_Flags := Format; C_Path: aliased String := C_String(Pathname); C_Indent: aliased String := C_String(Indent); begin OK := save(Obj.Doc,C_Path'Address,C_Indent'Address,XML_Encoding'Pos(Encoding),Format'Address) /= 0; end Save; function Child(Obj: XML_Document'Class; Name: String) return XML_Node is function xml_child(Doc: System.Address; Name: System.Address) return System.Address; pragma Import(C,xml_child,"pugi_xml_child"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := xml_child(Obj.Doc,C_Name'Address); return Node; end Child; procedure Reset(Obj: XML_Document) is procedure reset(Doc: System.Address); pragma Import(C,reset,"pugi_reset"); begin reset(Obj.Doc); end Reset; procedure Reset(Obj: XML_Document; Proto: XML_Document'Class) is procedure reset(Doc, Proto: System.Address); pragma Import(C,reset,"pugi_reset_proto"); begin reset(Obj.Doc,Proto.Doc); end Reset; function Child(Obj: XML_Node'Class; Name: String) return XML_Node is function xml_child(Doc: System.Address; Name: System.Address) return System.Address; pragma Import(C,xml_child,"pugi_node_child"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := xml_child(Obj.Node,C_Name'Address); return Node; end Child; function Name(Obj: XML_Node) return String is function node_name(Node: System.Address) return System.Address; pragma Import(C,node_name,"pugi_node_name"); C_Str : constant System.Address := node_name(Obj.Node); Len : constant Natural := Strlen(C_Str); Name : String(1..Len); for Name'Address use C_Str; begin return Name; end Name; function Parent(Obj: XML_Node'Class) return XML_Node is function xml_parent(Node: System.Address) return System.Address; pragma Import(C,xml_parent,"pugi_xml_parent"); Node: XML_Node; begin Node.Node := xml_parent(Obj.Node); return Node; end Parent; function Empty(Obj: XML_Node) return Boolean is function xml_node_empty(Node: System.Address) return Standard.Integer; pragma Import(C,xml_node_empty,"pugi_node_empty"); begin return xml_node_empty(Obj'Address) /= 0; end Empty; function Node_Type(Obj: XML_Node) return XML_Node_Type is function get_xml_node_type(Node: System.Address) return Standard.Integer; pragma Import(C,get_xml_node_type,"pugi_node_type"); begin return XML_Node_Type'Val(get_xml_node_type(Obj.Node)); end Node_Type; function Value(Obj: XML_Node) return String is function node_value(Node: System.Address) return System.Address; pragma Import(C,node_value,"pugi_node_value"); C_Str : constant System.Address := node_value(Obj.Node); Len : constant Natural := Strlen(C_Str); V : String(1..Len); for V'Address use C_Str; begin return V; end Value; function First_Child(Obj: XML_Node'Class) return XML_Node is function get_first_child(Node: System.Address) return System.Address; pragma Import(C,get_first_child,"pugi_first_child"); Node: XML_Node; begin Node.Node := get_first_child(Obj.Node); return Node; end First_Child; function Last_Child(Obj: XML_Node'Class) return XML_Node is function get_last_child(Node: System.Address) return System.Address; pragma Import(C,get_last_child,"pugi_last_child"); Node: XML_Node; begin Node.Node := get_last_child(Obj.Node); return Node; end Last_Child; function Root(Obj: XML_Node'Class) return XML_Node is function get_root_node(Node: System.Address) return System.Address; pragma Import(C,get_root_node,"pugi_root_node"); Node: XML_Node; begin Node.Node := get_root_node(Obj.Node); return Node; end Root; function Next(Obj: XML_Node'Class) return XML_Node is function get_next_sibling(Node: System.Address) return System.Address; pragma Import(C,get_next_sibling,"pugi_next_sibling"); Node: XML_Node; begin Node.Node := get_next_sibling(Obj.Node); return Node; end Next; function Next(Obj: XML_Node'Class; Name: String) return XML_Node is function get_next_sibling(Node, Name: System.Address) return System.Address; pragma Import(C,get_next_sibling,"pugi_next_named_sibling"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := get_next_sibling(Obj.Node,C_Name'Address); return Node; end Next; function Previous(Obj: XML_Node'Class) return XML_Node is function get_prev_sibling(Node: System.Address) return System.Address; pragma Import(C,get_prev_sibling,"pugi_prev_sibling"); Node: XML_Node; begin Node.Node := get_prev_sibling(Obj.Node); return Node; end Previous; function Previous(Obj: XML_Node'Class; Name: String) return XML_Node is function get_prev_sibling(Node, Name: System.Address) return System.Address; pragma Import(C,get_prev_sibling,"pugi_prev_named_sibling"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := get_prev_sibling(Obj.Node,C_Name'Address); return Node; end Previous; function Is_Null(Obj: XML_Node) return Boolean is Node_Info : XML_Node_Type := Node_Type(Obj); begin return Node_Info = Node_Null; end Is_Null; function Child_Value(Obj: XML_Node) return String is function child_value(Node: System.Address) return System.Address; pragma Import(C,child_value,"pugi_child_value"); C_Str : constant System.Address := child_value(Obj.Node); Len : constant Natural := Strlen(C_Str); V : String(1..Len); for V'Address use C_Str; begin return V; end Child_Value; function Child_Value(Obj: XML_Node; Name: String) return String is function child_value(Node: System.Address; Name: System.Address) return System.Address; pragma Import(C,child_value,"pugi_named_child_value"); C_Name: aliased String := C_String(Name); C_Str : constant System.Address := child_value(Obj.Node,C_Name'Address); Len : constant Natural := Strlen(C_Str); V : String(1..Len); for V'Address use C_Str; begin return V; end Child_Value; function Set_Name(Obj: XML_Node; Data: String) return Boolean is function set_name(Node, Data: System.Address) return Standard.Integer; pragma Import(C,set_name,"pugi_set_name"); C_Data: aliased String := C_String(Data); begin return set_name(Obj.Node,C_Data'Address) /= 0; end Set_Name; function Set_Value(Obj: XML_Node; Data: String) return Boolean is function set_value(Node, Data: System.Address) return Standard.Integer; pragma Import(C,set_value,"pugi_set_value"); C_Data: aliased String := C_String(Data); begin return set_value(Obj.Node,C_Data'Address) /= 0; end Set_Value; function "="(Left: XML_Node; Right: XML_Node) return Boolean is function is_eq(Left, Right: System.Address) return Standard.Integer; pragma Import(C,is_eq,"pugi_is_eq"); begin return is_eq(Left.Node'Address,Right.Node'Address) /= 0; end "="; function First_Attribute(Obj: XML_Node'Class) return XML_Attribute is function get_first(Obj: System.Address) return System.Address; pragma Import(C,get_first,"pugi_first_attr"); Attr: XML_Attribute; begin Attr.Attr := get_first(Obj.Node); return Attr; end First_Attribute; function Last_Attribute(Obj: XML_Node'Class) return XML_Attribute is function get_last(Obj: System.Address) return System.Address; pragma Import(C,get_last,"pugi_last_attr"); Attr: XML_Attribute; begin Attr.Attr := get_last(Obj.Node); return Attr; end Last_Attribute; function Text(Obj: XML_Node) return String is function text(Node: System.Address) return System.Address; pragma Import(C,text,"pugi_text"); C_Str : constant System.Address := text(Obj.Node); Len : constant Natural := Strlen(C_Str); V : String(1..Len); for V'Address use C_Str; begin return V; end Text; function Attribute(Obj: XML_Node'Class; Name: String) return XML_Attribute is function get_attr(Node: System.Address; Name: System.Address) return System.Address; pragma Import(C,get_attr,"pugi_attr"); C_Name: aliased String := C_String(Name); Attr: XML_Attribute; begin Attr.Attr := get_attr(Obj.Node,C_Name'Address); return Attr; end Attribute; function Name(Obj: XML_Attribute) return String is function get_name(Attr: System.Address) return System.Address; pragma Import(C,get_name,"pugi_attr_name"); C_Str : constant System.Address := get_name(Obj.Attr); Len : constant Natural := Strlen(C_Str); V : String(1..Len); for V'Address use C_Str; begin return V; end Name; function Value(Obj: XML_Attribute) return String is function get_value(Attr: System.Address) return System.Address; pragma Import(C,get_value,"pugi_attr_value"); C_Str : constant System.Address := get_value(Obj.Attr); Len : constant Natural := Strlen(C_Str); V : String(1..Len); for V'Address use C_Str; begin return V; end Value; function Empty(Obj: XML_Attribute) return Boolean is function attr_empty(Node: System.Address) return Standard.Integer; pragma Import(C,attr_empty,"pugi_attr_empty"); begin return attr_empty(Obj'Address) /= 0; end Empty; function "="(Left, Right: XML_Attribute) return Boolean is function is_eq(Left, Right: System.Address) return Standard.Integer; pragma Import(C,is_eq,"pugi_is_attr_eq"); begin return is_eq(Left.Attr'Address,Right.Attr'Address) /= 0; end "="; function Append_Attribute(Obj: XML_Node'Class; Name: String) return XML_Attribute is function insert(Obj, Name: System.Address) return System.Address; pragma Import(C,insert,"pugi_append_attr"); C_Name: aliased String := C_String(Name); Attr: XML_Attribute; begin Attr.Attr := insert(Obj.Node,C_Name'Address); return Attr; end Append_Attribute; function Prepend_Attribute(Obj: XML_Node'Class; Name: String) return XML_Attribute is function insert(Obj, Name: System.Address) return System.Address; pragma Import(C,insert,"pugi_prepend_attr"); C_Name: aliased String := C_String(Name); Attr: XML_Attribute; begin Attr.Attr := insert(Obj.Node,C_Name'Address); return Attr; end Prepend_Attribute; function Insert_Attribute_After(Obj: XML_Node'Class; Name: String; Other: XML_Attribute'Class) return XML_Attribute is function insert(Obj, Name, Other: System.Address) return System.Address; pragma Import(C,insert,"pugi_append_after"); C_Name: aliased String := C_String(Name); Attr: XML_Attribute; begin Attr.Attr := insert(Obj.Node,C_Name'Address,Other.Attr); return Attr; end Insert_Attribute_After; function Insert_Attribute_Before(Obj: XML_Node'Class; Name: String; Other: XML_Attribute'Class) return XML_Attribute is function insert(Obj, Name, Other: System.Address) return System.Address; pragma Import(C,insert,"pugi_append_before"); C_Name: aliased String := C_String(Name); Attr: XML_Attribute; begin Attr.Attr := insert(Obj.Node,C_Name'Address,Other.Attr); return Attr; end Insert_Attribute_Before; function Next(Obj: XML_Attribute'Class) return XML_Attribute is function get_next(Obj: System.Address) return System.Address; pragma Import(C,get_next,"pugi_next_attr"); Attr: XML_Attribute; begin Attr.Attr := get_next(Obj.Attr); return Attr; end Next; function Previous(Obj: XML_Attribute'Class) return XML_Attribute is function get_prev(Obj: System.Address) return System.Address; pragma Import(C,get_prev,"pugi_prev_attr"); Attr: XML_Attribute; begin Attr.Attr := get_prev(Obj.Attr); return Attr; end Previous; function Is_Null(Obj: XML_Attribute) return Boolean is use System; begin return Obj.Attr = System.Null_Address; end Is_Null; function Append_Copy(Obj: XML_Node'Class; Proto: XML_Attribute'Class) return XML_Attribute is function append(Obj, Proto: System.Address) return System.Address; pragma Import(C,append,"pugi_append_copy"); Attr: XML_Attribute; begin Attr.Attr := append(Obj.Node,Proto.Attr); return Attr; end Append_Copy; function Prepend_Copy(Obj: XML_Node'Class; Proto: XML_Attribute'Class) return XML_Attribute is function prepend(Obj, Proto: System.Address) return System.Address; pragma Import(C,prepend,"pugi_prepend_copy"); Attr: XML_Attribute; begin Attr.Attr := prepend(Obj.Node,Proto.Attr); return Attr; end Prepend_Copy; function Insert_Copy_After(Obj: XML_Node'Class; After: XML_Attribute'Class; Proto: XML_Attribute'Class) return XML_Attribute is function insert(Obj, After, Proto: System.Address) return System.Address; pragma Import(C,insert,"pugi_insert_copy_after"); Attr: XML_Attribute; begin Attr.Attr := insert(Obj.Node,After.Attr,Proto.Attr); return Attr; end Insert_Copy_After; function Insert_Copy_Before(Obj: XML_Node'Class; Before: XML_Attribute'Class; Proto: XML_Attribute'Class) return XML_Attribute is function insert(Obj, Before, Proto: System.Address) return System.Address; pragma Import(C,insert,"pugi_insert_copy_before"); Attr: XML_Attribute; begin Attr.Attr := insert(Obj.Node,Before.Attr,Proto.Attr); return Attr; end Insert_Copy_Before; function Append_Child(Obj: XML_Node'Class; Node_Type: XML_Node_Type) return XML_Node is function append(Obj: System.Address; Node_Type: Standard.Integer) return System.Address; pragma Import(C,append,"pugi_append_child_type"); Node: XML_Node; begin Node.Node := append(Obj.Node,XML_Node_Type'Pos(Node_Type)); return Node; end Append_Child; function Prepend_Child(Obj: XML_Node'Class; Node_Type: XML_Node_Type) return XML_Node is function prepend(Obj: System.Address; Node_Type: Standard.Integer) return System.Address; pragma Import(C,prepend,"pugi_prepend_child_type"); Node: XML_Node; begin Node.Node := prepend(Obj.Node,XML_Node_Type'Pos(Node_Type)); return Node; end Prepend_Child; function Insert_Child_After(Obj: XML_Node'Class; After: XML_Node'Class; Node_Type: XML_Node_Type) return XML_Node is function insert(Obj, After: System.Address; Node_Type: Standard.Integer) return System.Address; pragma Import(C,insert,"pugi_insert_child_type_after"); Node: XML_Node; begin Node.Node := insert(Obj.Node,After.Node,XML_Node_Type'Pos(Node_Type)); return Node; end Insert_Child_After; function Insert_Child_Before(Obj: XML_Node'Class; Before: XML_Node'Class; Node_Type: XML_Node_Type) return XML_Node is function insert(Obj, Before: System.Address; Node_Type: Standard.Integer) return System.Address; pragma Import(C,insert,"pugi_insert_child_type_before"); Node: XML_Node; begin Node.Node := insert(Obj.Node,Before.Node,XML_Node_Type'Pos(Node_Type)); return Node; end Insert_Child_Before; function Append_Child(Obj: XML_Node'Class; Name: String) return XML_Node is function append(Obj, Name: System.Address) return System.Address; pragma Import(C,append,"pugi_append_child_node"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := append(Obj.Node,C_Name'Address); return Node; end Append_Child; function Prepend_Child(Obj: XML_Node'Class; Name: String) return XML_Node is function prepend(Obj, Name: System.Address) return System.Address; pragma Import(C,prepend,"pugi_prepend_child_node"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := prepend(Obj.Node,C_Name'Address); return Node; end Prepend_Child; function Insert_Child_After(Obj: XML_Node'Class; After: XML_Node'Class; Name: String) return XML_Node is function insert(Obj, After, Name: System.Address) return System.Address; pragma Import(C,insert,"pugi_insert_child_node_after"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := insert(Obj.Node,After.Node,C_Name'Address); return Node; end Insert_Child_After; function Insert_Child_Before(Obj: XML_Node'Class; Before: XML_Node'Class; Name: String) return XML_Node is function insert(Obj, Before, Name: System.Address) return System.Address; pragma Import(C,insert,"pugi_insert_child_node_before"); C_Name: aliased String := C_String(Name); Node: XML_Node; begin Node.Node := insert(Obj.Node,Before.Node,C_Name'Address); return Node; end Insert_Child_Before; function Append_Copy(Obj: XML_Node'Class; Proto: XML_Node'Class) return XML_Node is function append(Obj, Proto: System.Address) return System.Address; pragma Import(C,append,"pugi_append_copy_node"); Node: XML_Node; begin Node.Node := append(Obj.Node,Proto.Node); return Node; end Append_Copy; function Prepend_Copy(Obj: XML_Node'Class; Proto: XML_Node'Class) return XML_Node is function prepend(Obj, Proto: System.Address) return System.Address; pragma Import(C,prepend,"pugi_prepend_copy_node"); Node: XML_Node; begin Node.Node := prepend(Obj.Node,Proto.Node); return Node; end Prepend_Copy; function Insert_Copy_After(Obj: XML_Node'Class; After, Proto: XML_Node'Class) return XML_Node is function insert(Obj, After, Proto: System.Address) return System.Address; pragma Import(C,insert,"pugi_insert_copy_node_after"); Node: XML_Node; begin Node.Node := insert(Obj.Node,After.Node,Proto.Node); return Node; end Insert_Copy_After; function Insert_Copy_Before(Obj: XML_Node'Class; Before, Proto: XML_Node'Class) return XML_Node is function insert(Obj, Before, Proto: System.Address) return System.Address; pragma Import(C,insert,"pugi_insert_copy_node_before"); Node: XML_Node; begin Node.Node := insert(Obj.Node,Before.Node,Proto.Node); return Node; end Insert_Copy_Before; function Remove_Attribute(Obj: XML_Node; Attr: XML_Attribute'Class) return Boolean is function remove(Obj, Attr: System.Address) return Standard.Integer; pragma Import(C,remove,"pugi_remove_attr"); begin return remove(Obj.Node,Attr.Attr) /= 0; end Remove_Attribute; function Remove_Attribute(Obj: XML_Node; Name: String) return Boolean is function remove(Obj, Name: System.Address) return Standard.Integer; pragma Import(C,remove,"pugi_remove_attr_name"); C_Name: aliased String := C_String(Name); begin return remove(Obj.Node,C_Name'Address) /= 0; end Remove_Attribute; function Remove_Child(Obj: XML_Node; Node: XML_Node'Class) return Boolean is function remove(Obj, Attr: System.Address) return Standard.Integer; pragma Import(C,remove,"pugi_remove_attr"); begin return remove(Obj.Node,Node.Node) /= 0; end Remove_Child; function Remove_Child(Obj: XML_Node; Name: String) return Boolean is function remove(Obj, Name: System.Address) return Standard.Integer; pragma Import(C,remove,"pugi_remove_child_name"); C_Name: aliased String := C_String(Name); begin return remove(Obj.Node,C_Name'Address) /= 0; end Remove_Child; function Find_First_By_Path(Obj: XML_Node; Path: String; Delimiter: Character := '/') return XML_Node is function find(Obj, Path: System.Address; Delim: Character) return System.Address; pragma Import(C,find,"pugi_find_by_path"); C_Path: aliased String := C_String(Path); Node: XML_Node; begin Node.Node := find(Obj.Node,C_Path'Address,Delimiter); return Node; end Find_First_By_Path; function As_Int(Obj: XML_Attribute) return Standard.Integer is function as_value(Obj: System.Address) return Standard.Integer; pragma Import(C,as_value,"pugi_attr_as_int"); begin return as_value(Obj.Attr); end As_Int; function As_Uint(Obj: XML_Attribute) return Interfaces.C.unsigned is function as_value(Obj: System.Address) return Interfaces.C.unsigned; pragma Import(C,as_value,"pugi_attr_as_uint"); begin return as_value(Obj.Attr); end As_Uint; function As_Double(Obj: XML_Attribute) return Interfaces.C.double is function as_value(Obj: System.Address) return Interfaces.C.double; pragma Import(C,as_value,"pugi_attr_as_double"); begin return as_value(Obj.Attr); end As_Double; function As_Float(Obj: XML_Attribute) return Standard.Float is function as_value(Obj: System.Address) return Interfaces.C.C_float; pragma Import(C,as_value,"pugi_attr_as_float"); begin return Standard.Float(as_value(Obj.Attr)); end As_Float; function As_Boolean(Obj: XML_Attribute) return Boolean is function as_value(Obj: System.Address) return Standard.Integer; pragma Import(C,as_value,"pugi_attr_as_bool"); begin return as_value(Obj.Attr) /= 0; end As_Boolean; function Set_Name(Obj: XML_Attribute; Name: String) return Boolean is function set_name(Obj, Name: System.Address) return Standard.Integer; pragma Import(C,set_name,"pugi_set_attr_name"); C_Name: aliased String := C_String(Name); begin return set_name(Obj.Attr,C_Name'Address) /= 0; end Set_Name; function Set_Value(Obj: XML_Attribute; Value: String) return Boolean is function set_value(Obj, Name: System.Address) return Standard.Integer; pragma Import(C,set_value,"pugi_set_attr_value"); C_Value: aliased String := C_String(Value); begin return set_value(Obj.Attr,C_Value'Address) /= 0; end Set_Value; function Set_Value(Obj: XML_Attribute; Value: Standard.Integer) return Boolean is function set_value(Obj: System.Address; Value: Standard.Integer) return Standard.Integer; pragma Import(C,set_value,"pugi_set_attr_int"); begin return set_value(Obj.Attr,Value) /= 0; end Set_Value; function Set_Value(Obj: XML_Attribute; Value: Interfaces.C.Unsigned) return Boolean is function set_value(Obj: System.Address; Value: Interfaces.C.Unsigned) return Standard.Integer; pragma Import(C,set_value,"pugi_set_attr_uint"); begin return set_value(Obj.Attr,Value) /= 0; end Set_Value; function Set_Value(Obj: XML_Attribute; Value: Standard.Float) return Boolean is function set_value(Obj: System.Address; Value: Standard.Float) return Standard.Integer; pragma Import(C,set_value,"pugi_set_attr_float"); begin return set_value(Obj.Attr,Value) /= 0; end Set_Value; function Set_Value(Obj: XML_Attribute; Value: Interfaces.C.Double) return Boolean is function set_value(Obj: System.Address; Value: Interfaces.C.Double) return Standard.Integer; pragma Import(C,set_value,"pugi_set_attr_double"); begin return set_value(Obj.Attr,Value) /= 0; end Set_Value; function Set_Value(Obj: XML_Attribute; Value: Boolean) return Boolean is function set_value(Obj: System.Address; Value: Standard.Integer) return Standard.Integer; pragma Import(C,set_value,"pugi_set_attr_bool"); begin if Value then return set_value(Obj.Attr,1) /= 0; else return set_value(Obj.Attr,0) /= 0; end if; end Set_Value; function Status(Obj: XML_Parse_Result) return XML_Parse_Status is begin return Obj.Status; end Status; function Offset(Obj: XML_Parse_Result) return Natural is begin return Natural(Obj.Offset); end Offset; function Encoding(Obj: XML_Parse_Result) return XML_Encoding is begin return Obj.Encoding; end Encoding; function Description(Obj: XML_Parse_Result) return String is Len : constant Natural := Strlen(Obj.C_Desc); Desc : String(1..Len); for Desc'Address use Obj.C_Desc; begin return Desc; end Description; function OK(Obj: XML_Parse_Result) return Boolean is function is_ok(Obj: System.Address) return Standard.Integer; pragma Import(C,is_ok,"pugi_is_parse_ok"); begin return Obj.OK; end OK; end Pugi_Xml;
pragma License (Unrestricted); -- extended unit with Ada.Iterator_Interfaces; -- diff (Copy_On_Write) private with Ada.Containers.Hash_Tables; private with Ada.Finalization; private with Ada.Streams; generic type Key_Type (<>) is limited private; type Element_Type (<>) is limited private; with function Hash (Key : Key_Type) return Hash_Type; with function Equivalent_Keys (Left, Right : Key_Type) return Boolean; -- diff ("=") package Ada.Containers.Limited_Hashed_Maps is pragma Preelaborate; pragma Remote_Types; type Map is tagged limited private with Constant_Indexing => Constant_Reference, Variable_Indexing => Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type; pragma Preelaborable_Initialization (Map); type Cursor is private; pragma Preelaborable_Initialization (Cursor); -- diff -- Empty_Map : constant Map; function Empty_Map return Map; No_Element : constant Cursor; function Has_Element (Position : Cursor) return Boolean; package Map_Iterator_Interfaces is new Iterator_Interfaces (Cursor, Has_Element); -- diff ("=") function Capacity (Container : Map) return Count_Type; procedure Reserve_Capacity ( Container : in out Map; Capacity : Count_Type); function Length (Container : Map) return Count_Type; function Is_Empty (Container : Map) return Boolean; procedure Clear (Container : in out Map); type Key_Reference_Type ( Element : not null access constant Key_Type) is private with Implicit_Dereference => Element; function Key (Position : Cursor) return Key_Reference_Type; -- diff (Element) -- diff (Replace_Element) -- -- -- procedure Query_Element ( Position : Cursor; Process : not null access procedure ( Key : Key_Type; Element : Element_Type)); -- modified procedure Update_Element ( Container : in out Map'Class; -- not primitive Position : Cursor; Process : not null access procedure ( Key : Key_Type; Element : in out Element_Type)); type Constant_Reference_Type ( Element : not null access constant Element_Type) is private with Implicit_Dereference => Element; type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference => Element; function Constant_Reference (Container : aliased Map; Position : Cursor) return Constant_Reference_Type; function Reference (Container : aliased in out Map; Position : Cursor) return Reference_Type; function Constant_Reference (Container : aliased Map; Key : Key_Type) return Constant_Reference_Type; function Reference (Container : aliased in out Map; Key : Key_Type) return Reference_Type; -- diff (Assign) -- diff (Copy) procedure Move (Target : in out Map; Source : in out Map); procedure Insert ( Container : in out Map'Class; New_Key : not null access function return Key_Type; New_Item : not null access function return Element_Type; Position : out Cursor; Inserted : out Boolean); -- diff (Insert) -- -- -- -- procedure Insert ( Container : in out Map'Class; Key : not null access function return Key_Type; New_Item : not null access function return Element_Type); -- diff (Include) -- -- -- -- diff (Replace) -- -- -- procedure Exclude (Container : in out Map; Key : Key_Type); procedure Delete (Container : in out Map; Key : Key_Type); procedure Delete (Container : in out Map; Position : in out Cursor); function First (Container : Map) return Cursor; function Next (Position : Cursor) return Cursor; procedure Next (Position : in out Cursor); function Find (Container : Map; Key : Key_Type) return Cursor; -- diff (Element) -- -- -- -- function Contains (Container : Map; Key : Key_Type) return Boolean; function Equivalent_Keys (Left, Right : Cursor) return Boolean; function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean; function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean; -- modified procedure Iterate ( Container : Map'Class; -- not primitive Process : not null access procedure (Position : Cursor)); -- modified function Iterate (Container : Map'Class) -- not primitive return Map_Iterator_Interfaces.Forward_Iterator'Class; -- extended generic with function "=" (Left, Right : Element_Type) return Boolean is <>; package Equivalent is function "=" (Left, Right : Map) return Boolean; end Equivalent; private type Key_Access is access Key_Type; type Element_Access is access Element_Type; type Node is limited record Super : aliased Hash_Tables.Node; Key : Key_Access; Element : Element_Access; end record; -- place Super at first whether Element_Type is controlled-type for Node use record Super at 0 range 0 .. Hash_Tables.Node_Size - 1; end record; -- diff (Data) -- -- -- -- -- diff (Data_Access) type Map is limited new Finalization.Limited_Controlled with record Table : Hash_Tables.Table_Access; Length : Count_Type := 0; end record; -- diff (Adjust) overriding procedure Finalize (Object : in out Map) renames Clear; type Cursor is access Node; type Key_Reference_Type ( Element : not null access constant Key_Type) is null record; type Constant_Reference_Type ( Element : not null access constant Element_Type) is null record; type Reference_Type (Element : not null access Element_Type) is null record; type Map_Access is access constant Map; for Map_Access'Storage_Size use 0; type Map_Iterator is new Map_Iterator_Interfaces.Forward_Iterator with record First : Cursor; end record; overriding function First (Object : Map_Iterator) return Cursor; overriding function Next (Object : Map_Iterator; Position : Cursor) return Cursor; package Streaming is -- diff (Read) -- -- -- diff (Write) -- -- procedure Missing_Read ( Stream : access Streams.Root_Stream_Type'Class; Item : out Cursor) with Import, Convention => Ada, External_Name => "__drake_program_error"; procedure Missing_Write ( Stream : access Streams.Root_Stream_Type'Class; Item : Cursor) with Import, Convention => Ada, External_Name => "__drake_program_error"; procedure Missing_Read ( Stream : access Streams.Root_Stream_Type'Class; Item : out Key_Reference_Type) with Import, Convention => Ada, External_Name => "__drake_program_error"; procedure Missing_Write ( Stream : access Streams.Root_Stream_Type'Class; Item : Key_Reference_Type) with Import, Convention => Ada, External_Name => "__drake_program_error"; procedure Missing_Read ( Stream : access Streams.Root_Stream_Type'Class; Item : out Constant_Reference_Type) with Import, Convention => Ada, External_Name => "__drake_program_error"; procedure Missing_Write ( Stream : access Streams.Root_Stream_Type'Class; Item : Constant_Reference_Type) with Import, Convention => Ada, External_Name => "__drake_program_error"; procedure Missing_Read ( Stream : access Streams.Root_Stream_Type'Class; Item : out Reference_Type) with Import, Convention => Ada, External_Name => "__drake_program_error"; procedure Missing_Write ( Stream : access Streams.Root_Stream_Type'Class; Item : Reference_Type) with Import, Convention => Ada, External_Name => "__drake_program_error"; end Streaming; -- diff ('Read) -- diff ('Write) for Cursor'Read use Streaming.Missing_Read; for Cursor'Write use Streaming.Missing_Write; for Key_Reference_Type'Read use Streaming.Missing_Read; for Key_Reference_Type'Write use Streaming.Missing_Write; for Constant_Reference_Type'Read use Streaming.Missing_Read; for Constant_Reference_Type'Write use Streaming.Missing_Write; for Reference_Type'Read use Streaming.Missing_Read; for Reference_Type'Write use Streaming.Missing_Write; No_Element : constant Cursor := null; end Ada.Containers.Limited_Hashed_Maps;
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . A S S E R T I O N S -- -- -- -- B o d y -- -- -- -- 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 version is for restricted run times (ZFP, Ravenscar, Cert) package body System.Assertions is -------------------------- -- Raise_Assert_Failure -- -------------------------- procedure Raise_Assert_Failure (Msg : String) is begin raise Assert_Failure with Msg; end Raise_Assert_Failure; end System.Assertions;
<?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>zeropad2d_cl_array_array_ap_fixed_32u_config23_s</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>64</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>data_V_data_0_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>data.V.data[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <direction>0</direction> <if_type>3</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>2</id> <name>data_V_data_1_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[1].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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>3</id> <name>data_V_data_2_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[2].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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>4</id> <name>data_V_data_3_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[3].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_5"> <Value> <Obj> <type>1</type> <id>5</id> <name>data_V_data_4_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[4].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_6"> <Value> <Obj> <type>1</type> <id>6</id> <name>data_V_data_5_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[5].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_7"> <Value> <Obj> <type>1</type> <id>7</id> <name>data_V_data_6_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[6].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_8"> <Value> <Obj> <type>1</type> <id>8</id> <name>data_V_data_7_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[7].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_9"> <Value> <Obj> <type>1</type> <id>9</id> <name>data_V_data_8_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[8].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_10"> <Value> <Obj> <type>1</type> <id>10</id> <name>data_V_data_9_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[9].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_11"> <Value> <Obj> <type>1</type> <id>11</id> <name>data_V_data_10_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[10].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_12"> <Value> <Obj> <type>1</type> <id>12</id> <name>data_V_data_11_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[11].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_13"> <Value> <Obj> <type>1</type> <id>13</id> <name>data_V_data_12_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[12].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_14"> <Value> <Obj> <type>1</type> <id>14</id> <name>data_V_data_13_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[13].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_15"> <Value> <Obj> <type>1</type> <id>15</id> <name>data_V_data_14_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[14].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_16"> <Value> <Obj> <type>1</type> <id>16</id> <name>data_V_data_15_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[15].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_17"> <Value> <Obj> <type>1</type> <id>17</id> <name>data_V_data_16_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[16].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_18"> <Value> <Obj> <type>1</type> <id>18</id> <name>data_V_data_17_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[17].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_19"> <Value> <Obj> <type>1</type> <id>19</id> <name>data_V_data_18_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[18].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_20"> <Value> <Obj> <type>1</type> <id>20</id> <name>data_V_data_19_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[19].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_21"> <Value> <Obj> <type>1</type> <id>21</id> <name>data_V_data_20_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[20].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_22"> <Value> <Obj> <type>1</type> <id>22</id> <name>data_V_data_21_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[21].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_23"> <Value> <Obj> <type>1</type> <id>23</id> <name>data_V_data_22_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[22].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_24"> <Value> <Obj> <type>1</type> <id>24</id> <name>data_V_data_23_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[23].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_25"> <Value> <Obj> <type>1</type> <id>25</id> <name>data_V_data_24_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[24].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_26"> <Value> <Obj> <type>1</type> <id>26</id> <name>data_V_data_25_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[25].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_27"> <Value> <Obj> <type>1</type> <id>27</id> <name>data_V_data_26_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[26].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_28"> <Value> <Obj> <type>1</type> <id>28</id> <name>data_V_data_27_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[27].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_29"> <Value> <Obj> <type>1</type> <id>29</id> <name>data_V_data_28_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[28].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_30"> <Value> <Obj> <type>1</type> <id>30</id> <name>data_V_data_29_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[29].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_31"> <Value> <Obj> <type>1</type> <id>31</id> <name>data_V_data_30_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[30].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_32"> <Value> <Obj> <type>1</type> <id>32</id> <name>data_V_data_31_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>data.V.data[31].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_33"> <Value> <Obj> <type>1</type> <id>33</id> <name>res_V_data_0_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_34"> <Value> <Obj> <type>1</type> <id>34</id> <name>res_V_data_1_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[1].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_35"> <Value> <Obj> <type>1</type> <id>35</id> <name>res_V_data_2_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[2].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_36"> <Value> <Obj> <type>1</type> <id>36</id> <name>res_V_data_3_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[3].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_37"> <Value> <Obj> <type>1</type> <id>37</id> <name>res_V_data_4_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[4].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_38"> <Value> <Obj> <type>1</type> <id>38</id> <name>res_V_data_5_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[5].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_39"> <Value> <Obj> <type>1</type> <id>39</id> <name>res_V_data_6_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[6].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_40"> <Value> <Obj> <type>1</type> <id>40</id> <name>res_V_data_7_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[7].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_41"> <Value> <Obj> <type>1</type> <id>41</id> <name>res_V_data_8_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[8].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_42"> <Value> <Obj> <type>1</type> <id>42</id> <name>res_V_data_9_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[9].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_43"> <Value> <Obj> <type>1</type> <id>43</id> <name>res_V_data_10_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[10].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_44"> <Value> <Obj> <type>1</type> <id>44</id> <name>res_V_data_11_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[11].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_45"> <Value> <Obj> <type>1</type> <id>45</id> <name>res_V_data_12_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[12].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_46"> <Value> <Obj> <type>1</type> <id>46</id> <name>res_V_data_13_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[13].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_47"> <Value> <Obj> <type>1</type> <id>47</id> <name>res_V_data_14_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[14].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_48"> <Value> <Obj> <type>1</type> <id>48</id> <name>res_V_data_15_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[15].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_49"> <Value> <Obj> <type>1</type> <id>49</id> <name>res_V_data_16_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[16].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_50"> <Value> <Obj> <type>1</type> <id>50</id> <name>res_V_data_17_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[17].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_51"> <Value> <Obj> <type>1</type> <id>51</id> <name>res_V_data_18_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[18].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_52"> <Value> <Obj> <type>1</type> <id>52</id> <name>res_V_data_19_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[19].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_53"> <Value> <Obj> <type>1</type> <id>53</id> <name>res_V_data_20_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[20].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_54"> <Value> <Obj> <type>1</type> <id>54</id> <name>res_V_data_21_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[21].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_55"> <Value> <Obj> <type>1</type> <id>55</id> <name>res_V_data_22_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[22].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_56"> <Value> <Obj> <type>1</type> <id>56</id> <name>res_V_data_23_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[23].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_57"> <Value> <Obj> <type>1</type> <id>57</id> <name>res_V_data_24_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[24].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_58"> <Value> <Obj> <type>1</type> <id>58</id> <name>res_V_data_25_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[25].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_59"> <Value> <Obj> <type>1</type> <id>59</id> <name>res_V_data_26_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[26].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_60"> <Value> <Obj> <type>1</type> <id>60</id> <name>res_V_data_27_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[27].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_61"> <Value> <Obj> <type>1</type> <id>61</id> <name>res_V_data_28_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[28].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_62"> <Value> <Obj> <type>1</type> <id>62</id> <name>res_V_data_29_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[29].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_63"> <Value> <Obj> <type>1</type> <id>63</id> <name>res_V_data_30_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[30].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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="_64"> <Value> <Obj> <type>1</type> <id>64</id> <name>res_V_data_31_V</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>res.V.data[31].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</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>75</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_65"> <Value> <Obj> <type>0</type> <id>131</id> <name>_ln56</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</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>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>56</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>243</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_66"> <Value> <Obj> <type>0</type> <id>133</id> <name>j_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>245</item> <item>246</item> <item>247</item> <item>248</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_67"> <Value> <Obj> <type>0</type> <id>134</id> <name>icmp_ln56</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>56</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>249</item> <item>251</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_68"> <Value> <Obj> <type>0</type> <id>136</id> <name>j</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>252</item> <item>254</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.73</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_69"> <Value> <Obj> <type>0</type> <id>137</id> <name>_ln56</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>56</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>255</item> <item>256</item> <item>257</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_70"> <Value> <Obj> <type>0</type> <id>140</id> <name>res_V_data_0_V_write_ln16</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>16</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>57</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>65</count> <item_version>0</item_version> <item>259</item> <item>260</item> <item>261</item> <item>262</item> <item>263</item> <item>264</item> <item>265</item> <item>266</item> <item>267</item> <item>268</item> <item>269</item> <item>270</item> <item>271</item> <item>272</item> <item>273</item> <item>274</item> <item>275</item> <item>276</item> <item>277</item> <item>278</item> <item>279</item> <item>280</item> <item>281</item> <item>282</item> <item>283</item> <item>284</item> <item>285</item> <item>286</item> <item>287</item> <item>288</item> <item>289</item> <item>290</item> <item>291</item> <item>293</item> <item>294</item> <item>295</item> <item>296</item> <item>297</item> <item>298</item> <item>299</item> <item>300</item> <item>301</item> <item>302</item> <item>303</item> <item>304</item> <item>305</item> <item>306</item> <item>307</item> <item>308</item> <item>309</item> <item>310</item> <item>311</item> <item>312</item> <item>313</item> <item>314</item> <item>315</item> <item>316</item> <item>317</item> <item>318</item> <item>319</item> <item>320</item> <item>321</item> <item>322</item> <item>323</item> <item>324</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.63</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_71"> <Value> <Obj> <type>0</type> <id>141</id> <name>_ln56</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>56</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>325</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_72"> <Value> <Obj> <type>0</type> <id>144</id> <name>_ln61</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>61</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>326</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_73"> <Value> <Obj> <type>0</type> <id>146</id> <name>i1_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>327</item> <item>328</item> <item>329</item> <item>330</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_74"> <Value> <Obj> <type>0</type> <id>147</id> <name>icmp_ln61</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>61</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>331</item> <item>333</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_75"> <Value> <Obj> <type>0</type> <id>149</id> <name>i_2</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>61</second> </item> </second> </item> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>334</item> <item>335</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.73</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_76"> <Value> <Obj> <type>0</type> <id>150</id> <name>_ln61</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>61</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>336</item> <item>337</item> <item>338</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_77"> <Value> <Obj> <type>0</type> <id>155</id> <name>res_V_data_0_V_write_ln16</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>16</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>63</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>65</count> <item_version>0</item_version> <item>340</item> <item>341</item> <item>342</item> <item>343</item> <item>344</item> <item>345</item> <item>346</item> <item>347</item> <item>348</item> <item>349</item> <item>350</item> <item>351</item> <item>352</item> <item>353</item> <item>354</item> <item>355</item> <item>356</item> <item>357</item> <item>358</item> <item>359</item> <item>360</item> <item>361</item> <item>362</item> <item>363</item> <item>364</item> <item>365</item> <item>366</item> <item>367</item> <item>368</item> <item>369</item> <item>370</item> <item>371</item> <item>372</item> <item>373</item> <item>374</item> <item>375</item> <item>376</item> <item>377</item> <item>378</item> <item>379</item> <item>380</item> <item>381</item> <item>382</item> <item>383</item> <item>384</item> <item>385</item> <item>386</item> <item>387</item> <item>388</item> <item>389</item> <item>390</item> <item>391</item> <item>392</item> <item>393</item> <item>394</item> <item>395</item> <item>396</item> <item>397</item> <item>398</item> <item>399</item> <item>400</item> <item>401</item> <item>402</item> <item>403</item> <item>404</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.63</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_78"> <Value> <Obj> <type>0</type> <id>156</id> <name>_ln65</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>65</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>405</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_79"> <Value> <Obj> <type>0</type> <id>158</id> <name>j3_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>406</item> <item>407</item> <item>408</item> <item>409</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_80"> <Value> <Obj> <type>0</type> <id>159</id> <name>icmp_ln65</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>65</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>410</item> <item>411</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_81"> <Value> <Obj> <type>0</type> <id>161</id> <name>j_4</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>65</second> </item> </second> </item> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>412</item> <item>413</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.73</m_delay> <m_topoIndex>18</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_82"> <Value> <Obj> <type>0</type> <id>162</id> <name>_ln65</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</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>414</item> <item>415</item> <item>416</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>19</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_83"> <Value> <Obj> <type>0</type> <id>165</id> <name>empty_41</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>256</bitwidth> </Value> <oprand_edges> <count>33</count> <item_version>0</item_version> <item>419</item> <item>420</item> <item>421</item> <item>422</item> <item>423</item> <item>424</item> <item>425</item> <item>426</item> <item>427</item> <item>428</item> <item>429</item> <item>430</item> <item>431</item> <item>432</item> <item>433</item> <item>434</item> <item>435</item> <item>436</item> <item>437</item> <item>438</item> <item>439</item> <item>440</item> <item>441</item> <item>442</item> <item>443</item> <item>444</item> <item>445</item> <item>446</item> <item>447</item> <item>448</item> <item>449</item> <item>450</item> <item>451</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.63</m_delay> <m_topoIndex>20</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_84"> <Value> <Obj> <type>0</type> <id>166</id> <name>tmp_data_0_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[0].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>452</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>21</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_85"> <Value> <Obj> <type>0</type> <id>167</id> <name>tmp_data_1_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[1].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>453</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>22</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_86"> <Value> <Obj> <type>0</type> <id>168</id> <name>tmp_data_2_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[2].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>454</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_87"> <Value> <Obj> <type>0</type> <id>169</id> <name>tmp_data_3_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[3].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>455</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>24</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_88"> <Value> <Obj> <type>0</type> <id>170</id> <name>tmp_data_4_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[4].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>456</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_89"> <Value> <Obj> <type>0</type> <id>171</id> <name>tmp_data_5_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[5].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>457</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>26</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_90"> <Value> <Obj> <type>0</type> <id>172</id> <name>tmp_data_6_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[6].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>458</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>27</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_91"> <Value> <Obj> <type>0</type> <id>173</id> <name>tmp_data_7_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[7].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>459</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>28</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_92"> <Value> <Obj> <type>0</type> <id>174</id> <name>tmp_data_8_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[8].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>460</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>29</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_93"> <Value> <Obj> <type>0</type> <id>175</id> <name>tmp_data_9_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[9].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>461</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>30</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_94"> <Value> <Obj> <type>0</type> <id>176</id> <name>tmp_data_10_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[10].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>462</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>31</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_95"> <Value> <Obj> <type>0</type> <id>177</id> <name>tmp_data_11_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[11].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>463</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>32</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_96"> <Value> <Obj> <type>0</type> <id>178</id> <name>tmp_data_12_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[12].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>464</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>33</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_97"> <Value> <Obj> <type>0</type> <id>179</id> <name>tmp_data_13_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[13].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>465</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>34</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_98"> <Value> <Obj> <type>0</type> <id>180</id> <name>tmp_data_14_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[14].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>466</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>35</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_99"> <Value> <Obj> <type>0</type> <id>181</id> <name>tmp_data_15_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[15].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>467</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>36</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_100"> <Value> <Obj> <type>0</type> <id>182</id> <name>tmp_data_16_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[16].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>468</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>37</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_101"> <Value> <Obj> <type>0</type> <id>183</id> <name>tmp_data_17_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[17].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>469</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>38</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_102"> <Value> <Obj> <type>0</type> <id>184</id> <name>tmp_data_18_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[18].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>470</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>39</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_103"> <Value> <Obj> <type>0</type> <id>185</id> <name>tmp_data_19_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[19].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>471</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>40</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_104"> <Value> <Obj> <type>0</type> <id>186</id> <name>tmp_data_20_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[20].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>472</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>41</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_105"> <Value> <Obj> <type>0</type> <id>187</id> <name>tmp_data_21_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[21].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>473</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>42</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_106"> <Value> <Obj> <type>0</type> <id>188</id> <name>tmp_data_22_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[22].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>474</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>43</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_107"> <Value> <Obj> <type>0</type> <id>189</id> <name>tmp_data_23_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[23].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>475</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>44</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_108"> <Value> <Obj> <type>0</type> <id>190</id> <name>tmp_data_24_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[24].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>476</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>45</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_109"> <Value> <Obj> <type>0</type> <id>191</id> <name>tmp_data_25_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[25].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>477</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>46</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_110"> <Value> <Obj> <type>0</type> <id>192</id> <name>tmp_data_26_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[26].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>478</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>47</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_111"> <Value> <Obj> <type>0</type> <id>193</id> <name>tmp_data_27_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[27].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>479</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>48</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_112"> <Value> <Obj> <type>0</type> <id>194</id> <name>tmp_data_28_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[28].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>480</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>49</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_113"> <Value> <Obj> <type>0</type> <id>195</id> <name>tmp_data_29_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[29].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>481</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>50</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_114"> <Value> <Obj> <type>0</type> <id>196</id> <name>tmp_data_30_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[30].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>482</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>51</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_115"> <Value> <Obj> <type>0</type> <id>197</id> <name>tmp_data_31_V</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>22</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>22</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.data[31].V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>483</item> </oprand_edges> <opcode>extractvalue</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>52</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_116"> <Value> <Obj> <type>0</type> <id>198</id> <name>res_V_data_0_V_write_ln28</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>28</lineNumber> <contextFuncName>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_data&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>28</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>66</count> <item_version>0</item_version> <item>484</item> <item>485</item> <item>486</item> <item>487</item> <item>488</item> <item>489</item> <item>490</item> <item>491</item> <item>492</item> <item>493</item> <item>494</item> <item>495</item> <item>496</item> <item>497</item> <item>498</item> <item>499</item> <item>500</item> <item>501</item> <item>502</item> <item>503</item> <item>504</item> <item>505</item> <item>506</item> <item>507</item> <item>508</item> <item>509</item> <item>510</item> <item>511</item> <item>512</item> <item>513</item> <item>514</item> <item>515</item> <item>516</item> <item>517</item> <item>518</item> <item>519</item> <item>520</item> <item>521</item> <item>522</item> <item>523</item> <item>524</item> <item>525</item> <item>526</item> <item>527</item> <item>528</item> <item>529</item> <item>530</item> <item>531</item> <item>532</item> <item>533</item> <item>534</item> <item>535</item> <item>536</item> <item>537</item> <item>538</item> <item>539</item> <item>540</item> <item>541</item> <item>542</item> <item>543</item> <item>544</item> <item>545</item> <item>546</item> <item>547</item> <item>548</item> <item>1919</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.63</m_delay> <m_topoIndex>53</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_117"> <Value> <Obj> <type>0</type> <id>199</id> <name>_ln65</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>65</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>65</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>549</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>54</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_118"> <Value> <Obj> <type>0</type> <id>201</id> <name>_ln68</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</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>417</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>55</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_119"> <Value> <Obj> <type>0</type> <id>203</id> <name>j4_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>550</item> <item>551</item> <item>553</item> <item>554</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>56</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_120"> <Value> <Obj> <type>0</type> <id>204</id> <name>icmp_ln68</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>68</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>555</item> <item>557</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.95</m_delay> <m_topoIndex>57</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_121"> <Value> <Obj> <type>0</type> <id>206</id> <name>j_6</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>68</second> </item> </second> </item> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>558</item> <item>560</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.56</m_delay> <m_topoIndex>58</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_122"> <Value> <Obj> <type>0</type> <id>207</id> <name>_ln68</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</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>561</item> <item>562</item> <item>563</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>59</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_123"> <Value> <Obj> <type>0</type> <id>210</id> <name>res_V_data_0_V_write_ln16</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>16</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>69</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>66</count> <item_version>0</item_version> <item>564</item> <item>565</item> <item>566</item> <item>567</item> <item>568</item> <item>569</item> <item>570</item> <item>571</item> <item>572</item> <item>573</item> <item>574</item> <item>575</item> <item>576</item> <item>577</item> <item>578</item> <item>579</item> <item>580</item> <item>581</item> <item>582</item> <item>583</item> <item>584</item> <item>585</item> <item>586</item> <item>587</item> <item>588</item> <item>589</item> <item>590</item> <item>591</item> <item>592</item> <item>593</item> <item>594</item> <item>595</item> <item>596</item> <item>597</item> <item>598</item> <item>599</item> <item>600</item> <item>601</item> <item>602</item> <item>603</item> <item>604</item> <item>605</item> <item>606</item> <item>607</item> <item>608</item> <item>609</item> <item>610</item> <item>611</item> <item>612</item> <item>613</item> <item>614</item> <item>615</item> <item>616</item> <item>617</item> <item>618</item> <item>619</item> <item>620</item> <item>621</item> <item>622</item> <item>623</item> <item>624</item> <item>625</item> <item>626</item> <item>627</item> <item>628</item> <item>1920</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.63</m_delay> <m_topoIndex>60</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_124"> <Value> <Obj> <type>0</type> <id>211</id> <name>_ln68</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>68</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</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>629</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>61</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_125"> <Value> <Obj> <type>0</type> <id>214</id> <name>_ln61</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>61</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>61</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>630</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>62</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_126"> <Value> <Obj> <type>0</type> <id>216</id> <name>_ln73</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>73</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>339</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_127"> <Value> <Obj> <type>0</type> <id>218</id> <name>i5_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>631</item> <item>632</item> <item>633</item> <item>634</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>63</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_128"> <Value> <Obj> <type>0</type> <id>219</id> <name>icmp_ln73</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>73</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>635</item> <item>636</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.95</m_delay> <m_topoIndex>64</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_129"> <Value> <Obj> <type>0</type> <id>221</id> <name>i</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName>i</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>2</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>637</item> <item>638</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.56</m_delay> <m_topoIndex>65</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_130"> <Value> <Obj> <type>0</type> <id>222</id> <name>_ln73</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>73</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>639</item> <item>640</item> <item>641</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>66</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_131"> <Value> <Obj> <type>0</type> <id>226</id> <name>_ln74</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>74</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>642</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>67</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_132"> <Value> <Obj> <type>0</type> <id>228</id> <name>j6_0</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>643</item> <item>644</item> <item>645</item> <item>646</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>69</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_133"> <Value> <Obj> <type>0</type> <id>229</id> <name>icmp_ln74</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>74</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>647</item> <item>648</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>70</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_134"> <Value> <Obj> <type>0</type> <id>231</id> <name>j_5</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>74</second> </item> </second> </item> </inlineStackInfo> <originalName>j</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>4</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>649</item> <item>650</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.73</m_delay> <m_topoIndex>71</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_135"> <Value> <Obj> <type>0</type> <id>232</id> <name>_ln74</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>74</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>651</item> <item>652</item> <item>653</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>72</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_136"> <Value> <Obj> <type>0</type> <id>235</id> <name>res_V_data_0_V_write_ln16</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>16</lineNumber> <contextFuncName>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>fill_zero&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>16</second> </item> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>75</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>65</count> <item_version>0</item_version> <item>654</item> <item>655</item> <item>656</item> <item>657</item> <item>658</item> <item>659</item> <item>660</item> <item>661</item> <item>662</item> <item>663</item> <item>664</item> <item>665</item> <item>666</item> <item>667</item> <item>668</item> <item>669</item> <item>670</item> <item>671</item> <item>672</item> <item>673</item> <item>674</item> <item>675</item> <item>676</item> <item>677</item> <item>678</item> <item>679</item> <item>680</item> <item>681</item> <item>682</item> <item>683</item> <item>684</item> <item>685</item> <item>686</item> <item>687</item> <item>688</item> <item>689</item> <item>690</item> <item>691</item> <item>692</item> <item>693</item> <item>694</item> <item>695</item> <item>696</item> <item>697</item> <item>698</item> <item>699</item> <item>700</item> <item>701</item> <item>702</item> <item>703</item> <item>704</item> <item>705</item> <item>706</item> <item>707</item> <item>708</item> <item>709</item> <item>710</item> <item>711</item> <item>712</item> <item>713</item> <item>714</item> <item>715</item> <item>716</item> <item>717</item> <item>718</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.63</m_delay> <m_topoIndex>73</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_137"> <Value> <Obj> <type>0</type> <id>236</id> <name>_ln74</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>74</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>719</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>74</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_138"> <Value> <Obj> <type>0</type> <id>239</id> <name>_ln73</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>73</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>720</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>75</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_139"> <Value> <Obj> <type>0</type> <id>241</id> <name>_ln78</name> <fileName>firmware/nnet_utils/nnet_padding_stream.h</fileName> <fileDirectory>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</fileDirectory> <lineNumber>78</lineNumber> <contextFuncName>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/data/armita/Andy/platform_ml_models/eembc/CIFAR10_ResNetv1/my-hls-test-quantized-tiny2</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>firmware/nnet_utils/nnet_padding_stream.h</first> <second>zeropad2d_cl&amp;lt;nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, nnet::array&amp;lt;ap_fixed&amp;lt;8, 3, 0, 0, 0&amp;gt;, 32&amp;gt;, config23&amp;gt;</second> </first> <second>78</second> </item> </second> </item> </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_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>68</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>8</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_140"> <Value> <Obj> <type>2</type> <id>244</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="_141"> <Value> <Obj> <type>2</type> <id>250</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>11</content> </item> <item class_id_reference="16" object_id="_142"> <Value> <Obj> <type>2</type> <id>253</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>1</content> </item> <item class_id_reference="16" object_id="_143"> <Value> <Obj> <type>2</type> <id>292</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>0</content> </item> <item class_id_reference="16" object_id="_144"> <Value> <Obj> <type>2</type> <id>332</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>8</content> </item> <item class_id_reference="16" object_id="_145"> <Value> <Obj> <type>2</type> <id>552</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>2</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_146"> <Value> <Obj> <type>2</type> <id>556</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>2</bitwidth> </Value> <const_type>0</const_type> <content>2</content> </item> <item class_id_reference="16" object_id="_147"> <Value> <Obj> <type>2</type> <id>559</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>2</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>19</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_148"> <Obj> <type>3</type> <id>132</id> <name>PadTop_begin</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>131</item> </node_objs> </item> <item class_id_reference="18" object_id="_149"> <Obj> <type>3</type> <id>138</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>133</item> <item>134</item> <item>136</item> <item>137</item> </node_objs> </item> <item class_id_reference="18" object_id="_150"> <Obj> <type>3</type> <id>142</id> <name>_ZrsILi32ELb0EEN11ap_int_baseIXT_EXT0_EE5RTypeIXT_EXT0_EE4arg1ERKS1_i.exit2.i.i.i.i.i47.0</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>140</item> <item>141</item> </node_objs> </item> <item class_id_reference="18" object_id="_151"> <Obj> <type>3</type> <id>145</id> <name>PadTop_end</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>144</item> </node_objs> </item> <item class_id_reference="18" object_id="_152"> <Obj> <type>3</type> <id>151</id> <name>.preheader3</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>146</item> <item>147</item> <item>149</item> <item>150</item> </node_objs> </item> <item class_id_reference="18" object_id="_153"> <Obj> <type>3</type> <id>157</id> <name>PadMain_begin</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>155</item> <item>156</item> </node_objs> </item> <item class_id_reference="18" object_id="_154"> <Obj> <type>3</type> <id>163</id> <name>.preheader2</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>158</item> <item>159</item> <item>161</item> <item>162</item> </node_objs> </item> <item class_id_reference="18" object_id="_155"> <Obj> <type>3</type> <id>200</id> <name>fill_data&lt;array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 32u&gt;, array&lt;ap_fixed&lt;8, 3, 0, 0, 0&gt;, 32u&gt;, config23&gt;.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>35</count> <item_version>0</item_version> <item>165</item> <item>166</item> <item>167</item> <item>168</item> <item>169</item> <item>170</item> <item>171</item> <item>172</item> <item>173</item> <item>174</item> <item>175</item> <item>176</item> <item>177</item> <item>178</item> <item>179</item> <item>180</item> <item>181</item> <item>182</item> <item>183</item> <item>184</item> <item>185</item> <item>186</item> <item>187</item> <item>188</item> <item>189</item> <item>190</item> <item>191</item> <item>192</item> <item>193</item> <item>194</item> <item>195</item> <item>196</item> <item>197</item> <item>198</item> <item>199</item> </node_objs> </item> <item class_id_reference="18" object_id="_156"> <Obj> <type>3</type> <id>202</id> <name>.preheader1.preheader</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>201</item> </node_objs> </item> <item class_id_reference="18" object_id="_157"> <Obj> <type>3</type> <id>208</id> <name>.preheader1</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>203</item> <item>204</item> <item>206</item> <item>207</item> </node_objs> </item> <item class_id_reference="18" object_id="_158"> <Obj> <type>3</type> <id>212</id> <name>_ZrsILi32ELb0EEN11ap_int_baseIXT_EXT0_EE5RTypeIXT_EXT0_EE4arg1ERKS1_i.exit2.i.i.i.i.i27.0</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>210</item> <item>211</item> </node_objs> </item> <item class_id_reference="18" object_id="_159"> <Obj> <type>3</type> <id>215</id> <name>PadMain_end</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>214</item> </node_objs> </item> <item class_id_reference="18" object_id="_160"> <Obj> <type>3</type> <id>217</id> <name>.preheader.preheader</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>216</item> </node_objs> </item> <item class_id_reference="18" object_id="_161"> <Obj> <type>3</type> <id>223</id> <name>.preheader</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>218</item> <item>219</item> <item>221</item> <item>222</item> </node_objs> </item> <item class_id_reference="18" object_id="_162"> <Obj> <type>3</type> <id>227</id> <name>PadBottom_begin</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>226</item> </node_objs> </item> <item class_id_reference="18" object_id="_163"> <Obj> <type>3</type> <id>233</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>228</item> <item>229</item> <item>231</item> <item>232</item> </node_objs> </item> <item class_id_reference="18" object_id="_164"> <Obj> <type>3</type> <id>237</id> <name>_ZrsILi32ELb0EEN11ap_int_baseIXT_EXT0_EE5RTypeIXT_EXT0_EE4arg1ERKS1_i.exit2.i.i.i.i.i.0</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>235</item> <item>236</item> </node_objs> </item> <item class_id_reference="18" object_id="_165"> <Obj> <type>3</type> <id>240</id> <name>PadBottom_end</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>239</item> </node_objs> </item> <item class_id_reference="18" object_id="_166"> <Obj> <type>3</type> <id>242</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>1</count> <item_version>0</item_version> <item>241</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>488</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_167"> <id>243</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>131</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_168"> <id>245</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_169"> <id>246</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>133</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_170"> <id>247</id> <edge_type>1</edge_type> <source_obj>136</source_obj> <sink_obj>133</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_171"> <id>248</id> <edge_type>2</edge_type> <source_obj>142</source_obj> <sink_obj>133</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_172"> <id>249</id> <edge_type>1</edge_type> <source_obj>133</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_173"> <id>251</id> <edge_type>1</edge_type> <source_obj>250</source_obj> <sink_obj>134</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_174"> <id>252</id> <edge_type>1</edge_type> <source_obj>133</source_obj> <sink_obj>136</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_175"> <id>254</id> <edge_type>1</edge_type> <source_obj>253</source_obj> <sink_obj>136</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_176"> <id>255</id> <edge_type>1</edge_type> <source_obj>134</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_177"> <id>256</id> <edge_type>2</edge_type> <source_obj>142</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_178"> <id>257</id> <edge_type>2</edge_type> <source_obj>145</source_obj> <sink_obj>137</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_179"> <id>260</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_180"> <id>261</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_181"> <id>262</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_182"> <id>263</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_183"> <id>264</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_184"> <id>265</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_185"> <id>266</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_186"> <id>267</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_187"> <id>268</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_188"> <id>269</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_189"> <id>270</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_190"> <id>271</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_191"> <id>272</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_192"> <id>273</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_193"> <id>274</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_194"> <id>275</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_195"> <id>276</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_196"> <id>277</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_197"> <id>278</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_198"> <id>279</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_199"> <id>280</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_200"> <id>281</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_201"> <id>282</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_202"> <id>283</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_203"> <id>284</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_204"> <id>285</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_205"> <id>286</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_206"> <id>287</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_207"> <id>288</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_208"> <id>289</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_209"> <id>290</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_210"> <id>291</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_211"> <id>293</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_212"> <id>294</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_213"> <id>295</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_214"> <id>296</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_215"> <id>297</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_216"> <id>298</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_217"> <id>299</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_218"> <id>300</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_219"> <id>301</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_220"> <id>302</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_221"> <id>303</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_222"> <id>304</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_223"> <id>305</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_224"> <id>306</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_225"> <id>307</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_226"> <id>308</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_227"> <id>309</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_228"> <id>310</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_229"> <id>311</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_230"> <id>312</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_231"> <id>313</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_232"> <id>314</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_233"> <id>315</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_234"> <id>316</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_235"> <id>317</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_236"> <id>318</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_237"> <id>319</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_238"> <id>320</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_239"> <id>321</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_240"> <id>322</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_241"> <id>323</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_242"> <id>324</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>140</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_243"> <id>325</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>141</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_244"> <id>326</id> <edge_type>2</edge_type> <source_obj>151</source_obj> <sink_obj>144</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_245"> <id>327</id> <edge_type>1</edge_type> <source_obj>149</source_obj> <sink_obj>146</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_246"> <id>328</id> <edge_type>2</edge_type> <source_obj>215</source_obj> <sink_obj>146</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_247"> <id>329</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_248"> <id>330</id> <edge_type>2</edge_type> <source_obj>145</source_obj> <sink_obj>146</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_249"> <id>331</id> <edge_type>1</edge_type> <source_obj>146</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_250"> <id>333</id> <edge_type>1</edge_type> <source_obj>332</source_obj> <sink_obj>147</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_251"> <id>334</id> <edge_type>1</edge_type> <source_obj>146</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_252"> <id>335</id> <edge_type>1</edge_type> <source_obj>253</source_obj> <sink_obj>149</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_253"> <id>336</id> <edge_type>1</edge_type> <source_obj>147</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_254"> <id>337</id> <edge_type>2</edge_type> <source_obj>157</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_255"> <id>338</id> <edge_type>2</edge_type> <source_obj>217</source_obj> <sink_obj>150</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_256"> <id>339</id> <edge_type>2</edge_type> <source_obj>223</source_obj> <sink_obj>216</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_257"> <id>341</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_258"> <id>342</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_259"> <id>343</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_260"> <id>344</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_261"> <id>345</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_262"> <id>346</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_263"> <id>347</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_264"> <id>348</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_265"> <id>349</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_266"> <id>350</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_267"> <id>351</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_268"> <id>352</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_269"> <id>353</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_270"> <id>354</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_271"> <id>355</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_272"> <id>356</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_273"> <id>357</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_274"> <id>358</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_275"> <id>359</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_276"> <id>360</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_277"> <id>361</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_278"> <id>362</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_279"> <id>363</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_280"> <id>364</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_281"> <id>365</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_282"> <id>366</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_283"> <id>367</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_284"> <id>368</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_285"> <id>369</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_286"> <id>370</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_287"> <id>371</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_288"> <id>372</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_289"> <id>373</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_290"> <id>374</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_291"> <id>375</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_292"> <id>376</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_293"> <id>377</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_294"> <id>378</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_295"> <id>379</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_296"> <id>380</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_297"> <id>381</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_298"> <id>382</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_299"> <id>383</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_300"> <id>384</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_301"> <id>385</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_302"> <id>386</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_303"> <id>387</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_304"> <id>388</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_305"> <id>389</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_306"> <id>390</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_307"> <id>391</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_308"> <id>392</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_309"> <id>393</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_310"> <id>394</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_311"> <id>395</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_312"> <id>396</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_313"> <id>397</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_314"> <id>398</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_315"> <id>399</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_316"> <id>400</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_317"> <id>401</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_318"> <id>402</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_319"> <id>403</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_320"> <id>404</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>155</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_321"> <id>405</id> <edge_type>2</edge_type> <source_obj>163</source_obj> <sink_obj>156</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_322"> <id>406</id> <edge_type>1</edge_type> <source_obj>161</source_obj> <sink_obj>158</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_323"> <id>407</id> <edge_type>2</edge_type> <source_obj>200</source_obj> <sink_obj>158</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_324"> <id>408</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>158</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_325"> <id>409</id> <edge_type>2</edge_type> <source_obj>157</source_obj> <sink_obj>158</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_326"> <id>410</id> <edge_type>1</edge_type> <source_obj>158</source_obj> <sink_obj>159</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_327"> <id>411</id> <edge_type>1</edge_type> <source_obj>332</source_obj> <sink_obj>159</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_328"> <id>412</id> <edge_type>1</edge_type> <source_obj>158</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_329"> <id>413</id> <edge_type>1</edge_type> <source_obj>253</source_obj> <sink_obj>161</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_330"> <id>414</id> <edge_type>1</edge_type> <source_obj>159</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_331"> <id>415</id> <edge_type>2</edge_type> <source_obj>200</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_332"> <id>416</id> <edge_type>2</edge_type> <source_obj>202</source_obj> <sink_obj>162</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_333"> <id>417</id> <edge_type>2</edge_type> <source_obj>208</source_obj> <sink_obj>201</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_334"> <id>420</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_335"> <id>421</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_336"> <id>422</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_337"> <id>423</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_338"> <id>424</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_339"> <id>425</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_340"> <id>426</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_341"> <id>427</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_342"> <id>428</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_343"> <id>429</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_344"> <id>430</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_345"> <id>431</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_346"> <id>432</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_347"> <id>433</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_348"> <id>434</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_349"> <id>435</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_350"> <id>436</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_351"> <id>437</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_352"> <id>438</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_353"> <id>439</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_354"> <id>440</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_355"> <id>441</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_356"> <id>442</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_357"> <id>443</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_358"> <id>444</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_359"> <id>445</id> <edge_type>1</edge_type> <source_obj>26</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_360"> <id>446</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_361"> <id>447</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_362"> <id>448</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_363"> <id>449</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_364"> <id>450</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_365"> <id>451</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>165</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_366"> <id>452</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>166</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_367"> <id>453</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>167</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_368"> <id>454</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>168</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_369"> <id>455</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>169</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_370"> <id>456</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>170</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_371"> <id>457</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>171</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_372"> <id>458</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>172</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_373"> <id>459</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>173</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_374"> <id>460</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>174</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_375"> <id>461</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>175</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_376"> <id>462</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>176</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_377"> <id>463</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>177</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_378"> <id>464</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>178</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_379"> <id>465</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>179</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_380"> <id>466</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>180</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_381"> <id>467</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>181</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_382"> <id>468</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>182</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_383"> <id>469</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>183</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_384"> <id>470</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>184</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_385"> <id>471</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>185</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_386"> <id>472</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>186</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_387"> <id>473</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>187</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_388"> <id>474</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>188</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_389"> <id>475</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>189</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_390"> <id>476</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>190</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_391"> <id>477</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>191</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_392"> <id>478</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>192</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_393"> <id>479</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>193</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_394"> <id>480</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>194</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_395"> <id>481</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>195</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_396"> <id>482</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>196</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_397"> <id>483</id> <edge_type>1</edge_type> <source_obj>165</source_obj> <sink_obj>197</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_398"> <id>485</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_399"> <id>486</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_400"> <id>487</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_401"> <id>488</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_402"> <id>489</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_403"> <id>490</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_404"> <id>491</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_405"> <id>492</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_406"> <id>493</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_407"> <id>494</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_408"> <id>495</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_409"> <id>496</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_410"> <id>497</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_411"> <id>498</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_412"> <id>499</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_413"> <id>500</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_414"> <id>501</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_415"> <id>502</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_416"> <id>503</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_417"> <id>504</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_418"> <id>505</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_419"> <id>506</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_420"> <id>507</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_421"> <id>508</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_422"> <id>509</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_423"> <id>510</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_424"> <id>511</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_425"> <id>512</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_426"> <id>513</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_427"> <id>514</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_428"> <id>515</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_429"> <id>516</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_430"> <id>517</id> <edge_type>1</edge_type> <source_obj>166</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_431"> <id>518</id> <edge_type>1</edge_type> <source_obj>167</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_432"> <id>519</id> <edge_type>1</edge_type> <source_obj>168</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_433"> <id>520</id> <edge_type>1</edge_type> <source_obj>169</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_434"> <id>521</id> <edge_type>1</edge_type> <source_obj>170</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_435"> <id>522</id> <edge_type>1</edge_type> <source_obj>171</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_436"> <id>523</id> <edge_type>1</edge_type> <source_obj>172</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_437"> <id>524</id> <edge_type>1</edge_type> <source_obj>173</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_438"> <id>525</id> <edge_type>1</edge_type> <source_obj>174</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_439"> <id>526</id> <edge_type>1</edge_type> <source_obj>175</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_440"> <id>527</id> <edge_type>1</edge_type> <source_obj>176</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_441"> <id>528</id> <edge_type>1</edge_type> <source_obj>177</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_442"> <id>529</id> <edge_type>1</edge_type> <source_obj>178</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_443"> <id>530</id> <edge_type>1</edge_type> <source_obj>179</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_444"> <id>531</id> <edge_type>1</edge_type> <source_obj>180</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_445"> <id>532</id> <edge_type>1</edge_type> <source_obj>181</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_446"> <id>533</id> <edge_type>1</edge_type> <source_obj>182</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_447"> <id>534</id> <edge_type>1</edge_type> <source_obj>183</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_448"> <id>535</id> <edge_type>1</edge_type> <source_obj>184</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_449"> <id>536</id> <edge_type>1</edge_type> <source_obj>185</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_450"> <id>537</id> <edge_type>1</edge_type> <source_obj>186</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_451"> <id>538</id> <edge_type>1</edge_type> <source_obj>187</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_452"> <id>539</id> <edge_type>1</edge_type> <source_obj>188</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_453"> <id>540</id> <edge_type>1</edge_type> <source_obj>189</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_454"> <id>541</id> <edge_type>1</edge_type> <source_obj>190</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_455"> <id>542</id> <edge_type>1</edge_type> <source_obj>191</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_456"> <id>543</id> <edge_type>1</edge_type> <source_obj>192</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_457"> <id>544</id> <edge_type>1</edge_type> <source_obj>193</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_458"> <id>545</id> <edge_type>1</edge_type> <source_obj>194</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_459"> <id>546</id> <edge_type>1</edge_type> <source_obj>195</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_460"> <id>547</id> <edge_type>1</edge_type> <source_obj>196</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_461"> <id>548</id> <edge_type>1</edge_type> <source_obj>197</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_462"> <id>549</id> <edge_type>2</edge_type> <source_obj>163</source_obj> <sink_obj>199</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_463"> <id>550</id> <edge_type>1</edge_type> <source_obj>206</source_obj> <sink_obj>203</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_464"> <id>551</id> <edge_type>2</edge_type> <source_obj>212</source_obj> <sink_obj>203</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_465"> <id>553</id> <edge_type>1</edge_type> <source_obj>552</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_466"> <id>554</id> <edge_type>2</edge_type> <source_obj>202</source_obj> <sink_obj>203</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_467"> <id>555</id> <edge_type>1</edge_type> <source_obj>203</source_obj> <sink_obj>204</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_468"> <id>557</id> <edge_type>1</edge_type> <source_obj>556</source_obj> <sink_obj>204</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_469"> <id>558</id> <edge_type>1</edge_type> <source_obj>203</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_470"> <id>560</id> <edge_type>1</edge_type> <source_obj>559</source_obj> <sink_obj>206</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_471"> <id>561</id> <edge_type>1</edge_type> <source_obj>204</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_472"> <id>562</id> <edge_type>2</edge_type> <source_obj>212</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_473"> <id>563</id> <edge_type>2</edge_type> <source_obj>215</source_obj> <sink_obj>207</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_474"> <id>565</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_475"> <id>566</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_476"> <id>567</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_477"> <id>568</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_478"> <id>569</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_479"> <id>570</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_480"> <id>571</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_481"> <id>572</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_482"> <id>573</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_483"> <id>574</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_484"> <id>575</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_485"> <id>576</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_486"> <id>577</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_487"> <id>578</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_488"> <id>579</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_489"> <id>580</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_490"> <id>581</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_491"> <id>582</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_492"> <id>583</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_493"> <id>584</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_494"> <id>585</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_495"> <id>586</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_496"> <id>587</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_497"> <id>588</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_498"> <id>589</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_499"> <id>590</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_500"> <id>591</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_501"> <id>592</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_502"> <id>593</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_503"> <id>594</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_504"> <id>595</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_505"> <id>596</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_506"> <id>597</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_507"> <id>598</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_508"> <id>599</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_509"> <id>600</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_510"> <id>601</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_511"> <id>602</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_512"> <id>603</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_513"> <id>604</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_514"> <id>605</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_515"> <id>606</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_516"> <id>607</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_517"> <id>608</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_518"> <id>609</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_519"> <id>610</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_520"> <id>611</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_521"> <id>612</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_522"> <id>613</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_523"> <id>614</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_524"> <id>615</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_525"> <id>616</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_526"> <id>617</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_527"> <id>618</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_528"> <id>619</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_529"> <id>620</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_530"> <id>621</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_531"> <id>622</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_532"> <id>623</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_533"> <id>624</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_534"> <id>625</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_535"> <id>626</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_536"> <id>627</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_537"> <id>628</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_538"> <id>629</id> <edge_type>2</edge_type> <source_obj>208</source_obj> <sink_obj>211</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_539"> <id>630</id> <edge_type>2</edge_type> <source_obj>151</source_obj> <sink_obj>214</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_540"> <id>631</id> <edge_type>1</edge_type> <source_obj>221</source_obj> <sink_obj>218</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_541"> <id>632</id> <edge_type>2</edge_type> <source_obj>240</source_obj> <sink_obj>218</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_542"> <id>633</id> <edge_type>1</edge_type> <source_obj>552</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_543"> <id>634</id> <edge_type>2</edge_type> <source_obj>217</source_obj> <sink_obj>218</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_544"> <id>635</id> <edge_type>1</edge_type> <source_obj>218</source_obj> <sink_obj>219</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_545"> <id>636</id> <edge_type>1</edge_type> <source_obj>556</source_obj> <sink_obj>219</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_546"> <id>637</id> <edge_type>1</edge_type> <source_obj>218</source_obj> <sink_obj>221</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_547"> <id>638</id> <edge_type>1</edge_type> <source_obj>559</source_obj> <sink_obj>221</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_548"> <id>639</id> <edge_type>1</edge_type> <source_obj>219</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_549"> <id>640</id> <edge_type>2</edge_type> <source_obj>227</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_550"> <id>641</id> <edge_type>2</edge_type> <source_obj>242</source_obj> <sink_obj>222</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_551"> <id>642</id> <edge_type>2</edge_type> <source_obj>233</source_obj> <sink_obj>226</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_552"> <id>643</id> <edge_type>1</edge_type> <source_obj>244</source_obj> <sink_obj>228</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_553"> <id>644</id> <edge_type>2</edge_type> <source_obj>227</source_obj> <sink_obj>228</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_554"> <id>645</id> <edge_type>1</edge_type> <source_obj>231</source_obj> <sink_obj>228</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_555"> <id>646</id> <edge_type>2</edge_type> <source_obj>237</source_obj> <sink_obj>228</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_556"> <id>647</id> <edge_type>1</edge_type> <source_obj>228</source_obj> <sink_obj>229</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_557"> <id>648</id> <edge_type>1</edge_type> <source_obj>250</source_obj> <sink_obj>229</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_558"> <id>649</id> <edge_type>1</edge_type> <source_obj>228</source_obj> <sink_obj>231</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_559"> <id>650</id> <edge_type>1</edge_type> <source_obj>253</source_obj> <sink_obj>231</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_560"> <id>651</id> <edge_type>1</edge_type> <source_obj>229</source_obj> <sink_obj>232</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_561"> <id>652</id> <edge_type>2</edge_type> <source_obj>237</source_obj> <sink_obj>232</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_562"> <id>653</id> <edge_type>2</edge_type> <source_obj>240</source_obj> <sink_obj>232</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_563"> <id>655</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_564"> <id>656</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_565"> <id>657</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_566"> <id>658</id> <edge_type>1</edge_type> <source_obj>36</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_567"> <id>659</id> <edge_type>1</edge_type> <source_obj>37</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_568"> <id>660</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_569"> <id>661</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_570"> <id>662</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_571"> <id>663</id> <edge_type>1</edge_type> <source_obj>41</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_572"> <id>664</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_573"> <id>665</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_574"> <id>666</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_575"> <id>667</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_576"> <id>668</id> <edge_type>1</edge_type> <source_obj>46</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_577"> <id>669</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_578"> <id>670</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_579"> <id>671</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_580"> <id>672</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_581"> <id>673</id> <edge_type>1</edge_type> <source_obj>51</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_582"> <id>674</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_583"> <id>675</id> <edge_type>1</edge_type> <source_obj>53</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_584"> <id>676</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_585"> <id>677</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_586"> <id>678</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_587"> <id>679</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_588"> <id>680</id> <edge_type>1</edge_type> <source_obj>58</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_589"> <id>681</id> <edge_type>1</edge_type> <source_obj>59</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_590"> <id>682</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_591"> <id>683</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_592"> <id>684</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_593"> <id>685</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_594"> <id>686</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_595"> <id>687</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_596"> <id>688</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_597"> <id>689</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_598"> <id>690</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_599"> <id>691</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_600"> <id>692</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_601"> <id>693</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_602"> <id>694</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_603"> <id>695</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_604"> <id>696</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_605"> <id>697</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_606"> <id>698</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_607"> <id>699</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_608"> <id>700</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_609"> <id>701</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_610"> <id>702</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_611"> <id>703</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_612"> <id>704</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_613"> <id>705</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_614"> <id>706</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_615"> <id>707</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_616"> <id>708</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_617"> <id>709</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_618"> <id>710</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_619"> <id>711</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_620"> <id>712</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_621"> <id>713</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_622"> <id>714</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_623"> <id>715</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_624"> <id>716</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_625"> <id>717</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_626"> <id>718</id> <edge_type>1</edge_type> <source_obj>292</source_obj> <sink_obj>235</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_627"> <id>719</id> <edge_type>2</edge_type> <source_obj>233</source_obj> <sink_obj>236</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_628"> <id>720</id> <edge_type>2</edge_type> <source_obj>223</source_obj> <sink_obj>239</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_629"> <id>1895</id> <edge_type>2</edge_type> <source_obj>132</source_obj> <sink_obj>138</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_630"> <id>1896</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>145</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_631"> <id>1897</id> <edge_type>2</edge_type> <source_obj>138</source_obj> <sink_obj>142</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_632"> <id>1898</id> <edge_type>2</edge_type> <source_obj>142</source_obj> <sink_obj>138</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_633"> <id>1899</id> <edge_type>2</edge_type> <source_obj>145</source_obj> <sink_obj>151</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_634"> <id>1900</id> <edge_type>2</edge_type> <source_obj>151</source_obj> <sink_obj>217</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_635"> <id>1901</id> <edge_type>2</edge_type> <source_obj>151</source_obj> <sink_obj>157</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_636"> <id>1902</id> <edge_type>2</edge_type> <source_obj>157</source_obj> <sink_obj>163</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_637"> <id>1903</id> <edge_type>2</edge_type> <source_obj>163</source_obj> <sink_obj>202</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_638"> <id>1904</id> <edge_type>2</edge_type> <source_obj>163</source_obj> <sink_obj>200</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_639"> <id>1905</id> <edge_type>2</edge_type> <source_obj>200</source_obj> <sink_obj>163</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_640"> <id>1906</id> <edge_type>2</edge_type> <source_obj>202</source_obj> <sink_obj>208</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_641"> <id>1907</id> <edge_type>2</edge_type> <source_obj>208</source_obj> <sink_obj>215</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_642"> <id>1908</id> <edge_type>2</edge_type> <source_obj>208</source_obj> <sink_obj>212</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_643"> <id>1909</id> <edge_type>2</edge_type> <source_obj>212</source_obj> <sink_obj>208</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_644"> <id>1910</id> <edge_type>2</edge_type> <source_obj>215</source_obj> <sink_obj>151</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_645"> <id>1911</id> <edge_type>2</edge_type> <source_obj>217</source_obj> <sink_obj>223</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_646"> <id>1912</id> <edge_type>2</edge_type> <source_obj>223</source_obj> <sink_obj>242</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_647"> <id>1913</id> <edge_type>2</edge_type> <source_obj>223</source_obj> <sink_obj>227</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_648"> <id>1914</id> <edge_type>2</edge_type> <source_obj>227</source_obj> <sink_obj>233</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_649"> <id>1915</id> <edge_type>2</edge_type> <source_obj>233</source_obj> <sink_obj>240</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_650"> <id>1916</id> <edge_type>2</edge_type> <source_obj>233</source_obj> <sink_obj>237</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_651"> <id>1917</id> <edge_type>2</edge_type> <source_obj>237</source_obj> <sink_obj>233</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_652"> <id>1918</id> <edge_type>2</edge_type> <source_obj>240</source_obj> <sink_obj>223</sink_obj> <is_back_edge>1</is_back_edge> </item> <item class_id_reference="20" object_id="_653"> <id>1919</id> <edge_type>4</edge_type> <source_obj>155</source_obj> <sink_obj>198</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_654"> <id>1920</id> <edge_type>4</edge_type> <source_obj>155</source_obj> <sink_obj>210</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>16</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_655"> <mId>1</mId> <mTag>zeropad2d_cl&lt;array,array&lt;ap_fixed,32u&gt;,config23&gt;</mTag> <mType>0</mType> <sub_regions> <count>7</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> <item>5</item> <item>11</item> <item>12</item> <item>16</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>144</mMinLatency> <mMaxLatency>144</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_656"> <mId>2</mId> <mTag>Entry</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>132</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_657"> <mId>3</mId> <mTag>PadTopWidth</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>138</item> <item>142</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>11</mMinTripCount> <mMaxTripCount>11</mMaxTripCount> <mMinLatency>11</mMinLatency> <mMaxLatency>11</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_658"> <mId>4</mId> <mTag>Region 1</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>145</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_659"> <mId>5</mId> <mTag>PadMain</mTag> <mType>1</mType> <sub_regions> <count>5</count> <item_version>0</item_version> <item>6</item> <item>7</item> <item>8</item> <item>9</item> <item>10</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>8</mMinTripCount> <mMaxTripCount>8</mMaxTripCount> <mMinLatency>104</mMinLatency> <mMaxLatency>104</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_660"> <mId>6</mId> <mTag>Region 2</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>151</item> <item>157</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_661"> <mId>7</mId> <mTag>CopyMain</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>163</item> <item>200</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>8</mMinTripCount> <mMaxTripCount>8</mMaxTripCount> <mMinLatency>8</mMinLatency> <mMaxLatency>8</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_662"> <mId>8</mId> <mTag>Region 3</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>202</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_663"> <mId>9</mId> <mTag>PadRight</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>208</item> <item>212</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>2</mMinTripCount> <mMaxTripCount>2</mMaxTripCount> <mMinLatency>2</mMinLatency> <mMaxLatency>2</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_664"> <mId>10</mId> <mTag>Region 4</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>215</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_665"> <mId>11</mId> <mTag>Region 5</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>217</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_666"> <mId>12</mId> <mTag>PadBottom</mTag> <mType>1</mType> <sub_regions> <count>3</count> <item_version>0</item_version> <item>13</item> <item>14</item> <item>15</item> </sub_regions> <basic_blocks> <count>0</count> <item_version>0</item_version> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>2</mMinTripCount> <mMaxTripCount>2</mMaxTripCount> <mMinLatency>26</mMinLatency> <mMaxLatency>26</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_667"> <mId>13</mId> <mTag>Region 6</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>223</item> <item>227</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_668"> <mId>14</mId> <mTag>PadBottomWidth</mTag> <mType>1</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>2</count> <item_version>0</item_version> <item>233</item> <item>237</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>11</mMinTripCount> <mMaxTripCount>11</mMaxTripCount> <mMinLatency>11</mMinLatency> <mMaxLatency>11</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_669"> <mId>15</mId> <mTag>Region 7</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>240</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> <item class_id_reference="22" object_id="_670"> <mId>16</mId> <mTag>Return</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>242</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</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>75</count> <item_version>0</item_version> <item class_id="27" tracking_level="0" version="0"> <first>131</first> <second class_id="28" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>133</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>134</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>136</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>137</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>140</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>141</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>144</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>146</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>147</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>149</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>150</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>155</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>156</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>158</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>159</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>161</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>162</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>165</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>166</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>167</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>168</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>169</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>170</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>171</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>172</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>173</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>174</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>175</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>176</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>177</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>178</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>179</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>180</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>181</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>182</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>183</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>184</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>185</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>186</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>187</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>188</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>189</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>190</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>191</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>192</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>193</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>194</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>195</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>196</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>197</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>198</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>199</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>201</first> <second> <first>3</first> <second>0</second> </second> </item> <item> <first>203</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>204</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>206</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>207</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>210</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>211</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>214</first> <second> <first>4</first> <second>0</second> </second> </item> <item> <first>216</first> <second> <first>2</first> <second>0</second> </second> </item> <item> <first>218</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>219</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>221</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>222</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>226</first> <second> <first>5</first> <second>0</second> </second> </item> <item> <first>228</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>229</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>231</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>232</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>235</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>236</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>239</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>241</first> <second> <first>5</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="29" tracking_level="0" version="0"> <count>19</count> <item_version>0</item_version> <item class_id="30" tracking_level="0" version="0"> <first>132</first> <second class_id="31" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>138</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>142</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>145</first> <second> <first>1</first> <second>1</second> </second> </item> <item> <first>151</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>157</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>163</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>200</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>202</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>208</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>212</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>215</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>217</first> <second> <first>2</first> <second>2</second> </second> </item> <item> <first>223</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>227</first> <second> <first>3</first> <second>3</second> </second> </item> <item> <first>233</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>237</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>240</first> <second> <first>4</first> <second>4</second> </second> </item> <item> <first>242</first> <second> <first>3</first> <second>3</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>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="34" 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="35" 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="36" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core class_id="37" 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>
package Inline2_Pkg is function Valid_Real (Number : Float) return Boolean; pragma Inline (Valid_Real); function Invalid_Real return Float; pragma Inline (Invalid_Real); end Inline2_Pkg;
------------------------------------------------------------------------------ -- -- -- 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$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Elements.Generic_Hash; function AMF.CMOF.Classes.Hash is new AMF.Elements.Generic_Hash (CMOF_Class, CMOF_Class_Access);
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . P O O L _ G L O B A L -- -- -- -- B o d y -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ with System.Storage_Pools; use System.Storage_Pools; with System.Memory; package body System.Pool_Global is package SSE renames System.Storage_Elements; -------------- -- Allocate -- -------------- overriding procedure Allocate (Pool : in out Unbounded_No_Reclaim_Pool; Address : out System.Address; Storage_Size : SSE.Storage_Count; Alignment : SSE.Storage_Count) is use SSE; pragma Warnings (Off, Pool); Aligned_Size : Storage_Count := Storage_Size; Aligned_Address : System.Address; Allocated : System.Address; begin if Alignment > Standard'System_Allocator_Alignment then Aligned_Size := Aligned_Size + Alignment; end if; Allocated := Memory.Alloc (Memory.size_t (Aligned_Size)); -- The call to Alloc returns an address whose alignment is compatible -- with the worst case alignment requirement for the machine; thus the -- Alignment argument can be safely ignored. if Allocated = Null_Address then raise Storage_Error; end if; -- Case where alignment requested is greater than the alignment that is -- guaranteed to be provided by the system allocator. if Alignment > Standard'System_Allocator_Alignment then -- Realign the returned address Aligned_Address := To_Address (To_Integer (Allocated) + Integer_Address (Alignment) - (To_Integer (Allocated) mod Integer_Address (Alignment))); -- Save the block address declare Saved_Address : System.Address; pragma Import (Ada, Saved_Address); for Saved_Address'Address use Aligned_Address - Storage_Offset (System.Address'Size / Storage_Unit); begin Saved_Address := Allocated; end; Address := Aligned_Address; else Address := Allocated; end if; end Allocate; ---------------- -- Deallocate -- ---------------- overriding procedure Deallocate (Pool : in out Unbounded_No_Reclaim_Pool; Address : System.Address; Storage_Size : SSE.Storage_Count; Alignment : SSE.Storage_Count) is use System.Storage_Elements; pragma Warnings (Off, Pool); pragma Warnings (Off, Storage_Size); begin -- Case where the alignment of the block exceeds the guaranteed -- alignment required by the system storage allocator, meaning that -- this was specially wrapped at allocation time. if Alignment > Standard'System_Allocator_Alignment then -- Retrieve the block address declare Saved_Address : System.Address; pragma Import (Ada, Saved_Address); for Saved_Address'Address use Address - Storage_Offset (System.Address'Size / Storage_Unit); begin Memory.Free (Saved_Address); end; else Memory.Free (Address); end if; end Deallocate; ------------------ -- Storage_Size -- ------------------ overriding function Storage_Size (Pool : Unbounded_No_Reclaim_Pool) return SSE.Storage_Count is pragma Warnings (Off, Pool); begin -- Intuitively, should return System.Memory_Size. But on Sun/Alsys, -- System.Memory_Size > System.Max_Int, which means all you can do with -- it is raise CONSTRAINT_ERROR... return SSE.Storage_Count'Last; end Storage_Size; end System.Pool_Global;
------------------------------------------------------------------------------ -- -- -- 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. -- -- -- -- -- -- -- -- -- -- -- -- 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 file provides register declarations for those actually used by this -- demonstration, for the STM32F4 (ARM Cortex M4F) microcontrollers from -- ST Microelectronics. with System; with STM32F4; use STM32F4; with STM32F4.GPIO; use STM32F4.GPIO; with STM32F4.Reset_Clock_Control; use STM32F4.Reset_Clock_Control; with STM32F4.SYSCONFIG_Control; use STM32F4.SYSCONFIG_Control; package Registers is pragma Warnings (Off, "*may call Last_Chance_Handler"); pragma Warnings (Off, "*may be incompatible with alignment of object"); RCC : RCC_Register with Volatile, Address => System'To_Address (RCC_Base); GPIOA : GPIO_Register with Volatile, Address => System'To_Address (GPIOA_Base); pragma Import (Ada, GPIOA); GPIOD : GPIO_Register with Volatile, Address => System'To_Address (GPIOD_Base); pragma Import (Ada, GPIOD); EXTI : EXTI_Register with Volatile, Address => System'To_Address (EXTI_Base); pragma Import (Ada, EXTI); SYSCFG : SYSCFG_Register with Volatile, Address => System'To_Address (SYSCFG_Base); pragma Import (Ada, SYSCFG); pragma Warnings (On, "*may call Last_Chance_Handler"); pragma Warnings (On, "*may be incompatible with alignment of object"); end Registers;
with Ada.Text_IO; with Ada.Containers.Ordered_Maps; package body Problem_14 is package IO renames Ada.Text_IO; procedure Solve is type Collatz_Count is new Positive; package Integer_Map is new Ada.Containers.Ordered_Maps(Key_Type => Long_Long_Integer, Element_Type => Collatz_Count); table : Integer_Map.Map; function Next(current : in Long_Long_Integer) return Long_Long_Integer is begin if current mod 2 = 0 then -- even return current / 2; else return 3*current + 1; end if; end Next; function Collatz(start : in Long_Long_Integer) return Collatz_Count is begin if not table.Contains(start) then table.Insert(start, 1 + Collatz(Next(start))); end if; return table.Element(start); end; Max : Collatz_Count := 1; Max_Pos : Long_Long_Integer := 1; begin table.Insert(1, 1); for index in Long_Long_Integer(2) .. Long_Long_Integer(1_000_000) loop declare n : constant Collatz_Count := Collatz(index); begin if n > max then Max := n; Max_Pos := index; end if; end; end loop; IO.Put_Line(Long_Long_Integer'Image(Max_Pos) & " with a chain of " & Collatz_Count'Image(Max)); end Solve; end Problem_14;
with GNATCOLL.Mmap; generic Separator_Sequence : in String; package Linereader is use GNATCOLL.Mmap; End_Of_Input_Exception : Exception; type Reader (Str : Str_Access; Len : Natural) is tagged private; -- Read a line of text function Get_Line (Self : in out Reader) return String; -- Has the last call to Get_Line or Get_Ramainder reached the end? function End_Of_Input (Self : Reader) return Boolean; -- Backup current position procedure Backup (Self : in out Reader); -- Restore backed up position procedure Restore (Self : in out Reader); -- Get remainder: position .. last function Get_Remainder (Self : in out Reader) return String; private type Reader( Str : Str_Access; Len : Natural) is tagged record Source : Str_Access := Str; Backup : Positive := 1; Position : Positive := 1; Last : Natural := Len; End_Of_Input : Boolean := false; end record; end Linereader;
with Leds; use Leds; with Interfaces.EFM32; use Interfaces.EFM32; package body Leds is procedure Led_Init is begin CMU_Periph.CTRL.HFPERCLKEN := 1; CMU_Periph.HFBUSCLKEN0.GPIO := 1; GPIO_Periph.PA_MODEH.Arr(12) := PUSHPULL; GPIO_Periph.PA_MODEH.Arr(13) := PUSHPULL; GPIO_Periph.PA_MODEH.Arr(14) := PUSHPULL; GPIO_Periph.PD_MODEL.Arr(6) := PUSHPULL; GPIO_Periph.PF_MODEH.Arr(12) := PUSHPULL; GPIO_Periph.PE_MODEH.Arr(12) := PUSHPULL; Led_Set(LED0, Blue); Led_Set(LED1, Green); end Led_Init; procedure GPIO_Set_Pin(Port : Port_Type; Pin : Pin_Type) is begin case Port is when PA => GPIO_Periph.PA_DOUT.DOUT := GPIO_Periph.PA_DOUT.DOUT or Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PB => GPIO_Periph.PB_DOUT.DOUT := GPIO_Periph.PB_DOUT.DOUT or Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PC => GPIO_Periph.PC_DOUT.DOUT := GPIO_Periph.PC_DOUT.DOUT or Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PD => GPIO_Periph.PD_DOUT.DOUT := GPIO_Periph.PD_DOUT.DOUT or Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PE => GPIO_Periph.PE_DOUT.DOUT := GPIO_Periph.PE_DOUT.DOUT or Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PF => GPIO_Periph.PF_DOUT.DOUT := GPIO_Periph.PF_DOUT.DOUT or Shift_Left(16#0001#, Pin_Type'Pos(Pin)); end case; end GPIO_Set_Pin; procedure GPIO_Clr_Pin(Port : Port_Type; Pin : Pin_Type) is begin case Port is when PA => GPIO_Periph.PA_DOUT.DOUT := GPIO_Periph.PA_DOUT.DOUT and not Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PB => GPIO_Periph.PB_DOUT.DOUT := GPIO_Periph.PB_DOUT.DOUT and not Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PC => GPIO_Periph.PC_DOUT.DOUT := GPIO_Periph.PC_DOUT.DOUT and not Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PD => GPIO_Periph.PD_DOUT.DOUT := GPIO_Periph.PD_DOUT.DOUT and not Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PE => GPIO_Periph.PE_DOUT.DOUT := GPIO_Periph.PE_DOUT.DOUT and not Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PF => GPIO_Periph.PF_DOUT.DOUT := GPIO_Periph.PF_DOUT.DOUT and not Shift_Left(16#0001#, Pin_Type'Pos(Pin)); end case; end GPIO_Clr_Pin; Procedure GPIO_Tgl_Pin(Port : Port_Type; Pin : Pin_Type) is begin case Port is when PA => GPIO_Periph.PA_DOUTTGL.DOUTTGL := Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PB => GPIO_Periph.PB_DOUTTGL.DOUTTGL := Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PC => GPIO_Periph.PC_DOUTTGL.DOUTTGL := Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PD => GPIO_Periph.PD_DOUTTGL.DOUTTGL := Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PE => GPIO_Periph.PE_DOUTTGL.DOUTTGL := Shift_Left(16#0001#, Pin_Type'Pos(Pin)); when PF => GPIO_Periph.PF_DOUTTGL.DOUTTGL := Shift_Left(16#0001#, Pin_Type'Pos(Pin)); end case; end GPIO_Tgl_Pin; procedure Led_Set (LED : Led_No; Led_Color : Color) is begin case Led_Color is when Blue => case LED is when LED0 => GPIO_Set_Pin(PA, P12); GPIO_Set_Pin(PA, P14); GPIO_Clr_Pin(PA, P13); when LED1 => GPIO_Set_Pin(PD, P6); GPIO_Set_Pin(PF, P12); GPIO_Clr_Pin(PE, P12); end case; when Green => case LED is when LED0 => GPIO_Set_Pin(PA, P12); GPIO_Clr_Pin(PA, P14); GPIO_Set_Pin(PA, P13); when LED1 => GPIO_Set_Pin(PD, P6); GPIO_Clr_Pin(PF, P12); GPIO_Set_Pin(PE, P12); end case; when Cyan => case LED is when LED0 => GPIO_Set_Pin(PA, P12); GPIO_Clr_Pin(PA, P14); GPIO_Clr_Pin(PA, P13); when LED1 => GPIO_Set_Pin(PD, P6); GPIO_Clr_Pin(PF, P12); GPIO_Clr_Pin(PE, P12); end case; when Red => case LED is when LED0 => GPIO_Clr_Pin(PA, P12); GPIO_Set_Pin(PA, P14); GPIO_Set_Pin(PA, P13); when LED1 => GPIO_Clr_Pin(PD, P6); GPIO_Set_Pin(PF, P12); GPIO_Set_Pin(PE, P12); end case; when Magenta => case LED is when LED0 => GPIO_Clr_Pin(PA, P12); GPIO_Set_Pin(PA, P14); GPIO_Clr_Pin(PA, P13); when LED1 => GPIO_Clr_Pin(PD, P6); GPIO_Set_Pin(PF, P12); GPIO_Clr_Pin(PE, P12); end case; when Yellow => case LED is when LED0 => GPIO_Clr_Pin(PA, P12); GPIO_Clr_Pin(PA, P14); GPIO_Set_Pin(PA, P13); when LED1 => GPIO_Clr_Pin(PD, P6); GPIO_Clr_Pin(PF, P12); GPIO_Set_Pin(PE, P12); end case; when White => case LED is when LED0 => GPIO_Clr_Pin(PA, P12); GPIO_Clr_Pin(PA, P14); GPIO_Clr_Pin(PA, P13); when LED1 => GPIO_Clr_Pin(PD, P6); GPIO_Clr_Pin(PF, P12); GPIO_Clr_Pin(PE, P12); end case; when Black => case LED is when LED0 => GPIO_Set_Pin(PA, P12); GPIO_Set_Pin(PA, P14); GPIO_Set_Pin(PA, P13); when LED1 => GPIO_Set_Pin(PD, P6); GPIO_Set_Pin(PF, P12); GPIO_Set_Pin(PE, P12); end case; end case; end Led_Set; procedure Blink(LED: Led_No; Led_Color : Color) is Iterator : Integer := 0; begin Led_Set(LED, Led_Color); Iterator := 0; while Iterator < 200000 loop Iterator := Iterator + 1; end loop; Led_Set(LED, Black); Iterator := 0; while Iterator < 100000 loop Iterator := Iterator + 1; end loop; end Blink; end Leds;
-- Copyright 2012-2017 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 System; package Pck is type Base is tagged record X : Integer := 42; end record; type Extension is new Base with record Y : Float := 42.0; end record; function Ident (I : Integer) return Integer; procedure Do_Nothing (A : System.Address); end Pck;
----------------------------------------------------------------------- -- asf.filters.dump -- Filter to dump the request information -- Copyright (C) 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. ----------------------------------------------------------------------- with ASF.Requests; with ASF.Responses; with ASF.Servlets; -- The <b>ASF.Filters.Dump</b> package provides a debugging filter which -- can be activated in the request flow to dump the request content into -- some log file before processing the request. package ASF.Filters.Dump is type Dump_Filter is new ASF.Filters.Filter with null record; -- The Do_Filter method of the Filter is called by the container each time -- a request/response pair is passed through the chain due to a client request -- for a resource at the end of the chain. The Filter_Chain passed in to this -- method allows the Filter to pass on the request and response to the next -- entity in the chain. -- -- A typical implementation of this method would follow the following pattern: -- 1. Examine the request -- 2. Optionally wrap the request object with a custom implementation to -- filter content or headers for input filtering -- 3. Optionally wrap the response object with a custom implementation to -- filter content or headers for output filtering -- 4. Either invoke the next entity in the chain using the FilterChain -- object (chain.Do_Filter()), -- or, not pass on the request/response pair to the next entity in the -- filter chain to block the request processing -- 5. Directly set headers on the response after invocation of the next -- entity in the filter chain. procedure Do_Filter (F : in Dump_Filter; Request : in out Requests.Request'Class; Response : in out Responses.Response'Class; Chain : in out ASF.Servlets.Filter_Chain); end ASF.Filters.Dump;
------------------------------------------------------------------------------ -- -- -- Copyright (C) 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 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. -- -- -- ------------------------------------------------------------------------------ with HAL; with USB.HAL.Device; package USB.Logging.Device is procedure Log (Evt : USB.HAL.Device.UDC_Event); procedure Log_MIDI_Init; procedure Log_MIDI_Config; procedure Log_MIDI_Send; procedure Log_MIDI_Receive; procedure Log_MIDI_Out_TC; procedure Log_MIDI_In_TC; procedure Log_MIDI_Setup_TX; procedure Log_MIDI_Setup_RX; procedure Log_MIDI_RX_Discarded; procedure Log_MIDI_TX_Discarded; procedure Log_MIDI_Write_Packet; private type Log_Event_Kind is (None, UDC_Evt, -- MIDI Class -- MIDI_Init, MIDI_Config, MIDI_Send, MIDI_Receive, MIDI_Out_TC, MIDI_In_TC, MIDI_Setup_TX, MIDI_Setup_RX, MIDI_RX_Discarded, MIDI_TX_Discarded, MIDI_Write_Packet ); type Log_Event_ID is new Standard.HAL.UInt16; type Log_Event (Kind : Log_Event_Kind := None) is record ID : Log_Event_ID; case Kind is when UDC_Evt => UDC_Event : USB.HAL.Device.UDC_Event; when others => null; end case; end record; Event_Buffer_Size : constant := 256; type Event_Index is mod Event_Buffer_Size; Event_Buffer : array (Event_Index) of Log_Event := (others => (Kind => None, ID => 0)); Index : Event_Index := Event_Index'First; ID : Log_Event_ID; procedure Log (Evt : Log_Event); end USB.Logging.Device;
private package Testsuite.Encode.Multiframe_Tests is procedure Add_Tests (Suite : in out AUnit.Test_Suites.Test_Suite'Class); end Testsuite.Encode.Multiframe_Tests;
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- A D A . C O N T A I N E R S -- -- -- -- S p e c -- -- -- -- This specification is adapted from the Ada Reference Manual for use with -- -- GNAT. In accordance with the copyright of that document, you can freely -- -- copy and modify this specification, provided that if you redistribute a -- -- modified version, any changes that you have made are clearly indicated. -- -- -- ------------------------------------------------------------------------------ package Ada_Containers is pragma Pure; type Hash_Type is mod 2**32; type Count_Type is range 0 .. 2**31 - 1; end Ada_Containers;
----------------------------------------------------------------------------- -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P A R . C H 4 -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2016, 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. -- -- -- ------------------------------------------------------------------------------ pragma Style_Checks (All_Checks); -- Turn off subprogram body ordering check. Subprograms are in order -- by RM section rather than alphabetical with Stringt; use Stringt; separate (Par) package body Ch4 is -- Attributes that cannot have arguments Is_Parameterless_Attribute : constant Attribute_Class_Array := (Attribute_Base => True, Attribute_Body_Version => True, Attribute_Class => True, Attribute_External_Tag => True, Attribute_Img => True, Attribute_Loop_Entry => True, Attribute_Old => True, Attribute_Result => True, Attribute_Stub_Type => True, Attribute_Version => True, Attribute_Type_Key => True, others => False); -- This map contains True for parameterless attributes that return a -- string or a type. For those attributes, a left parenthesis after -- the attribute should not be analyzed as the beginning of a parameters -- list because it may denote a slice operation (X'Img (1 .. 2)) or -- a type conversion (X'Class (Y)). The Ada2012 attribute 'Old is in -- this category. -- Note: Loop_Entry is in this list because, although it can take an -- optional argument (the loop name), we can't distinguish that at parse -- time from the case where no loop name is given and a legitimate index -- expression is present. So we parse the argument as an indexed component -- and the semantic analysis sorts out this syntactic ambiguity based on -- the type and form of the expression. -- Note that this map designates the minimum set of attributes where a -- construct in parentheses that is not an argument can appear right -- after the attribute. For attributes like 'Size, we do not put them -- in the map. If someone writes X'Size (3), that's illegal in any case, -- but we get a better error message by parsing the (3) as an illegal -- argument to the attribute, rather than some meaningless junk that -- follows the attribute. ----------------------- -- Local Subprograms -- ----------------------- function P_Aggregate_Or_Paren_Expr return Node_Id; function P_Allocator return Node_Id; function P_Case_Expression_Alternative return Node_Id; function P_Iterated_Component_Association return Node_Id; function P_Record_Or_Array_Component_Association return Node_Id; function P_Factor return Node_Id; function P_Primary return Node_Id; function P_Relation return Node_Id; function P_Term return Node_Id; function P_Binary_Adding_Operator return Node_Kind; function P_Logical_Operator return Node_Kind; function P_Multiplying_Operator return Node_Kind; function P_Relational_Operator return Node_Kind; function P_Unary_Adding_Operator return Node_Kind; procedure Bad_Range_Attribute (Loc : Source_Ptr); -- Called to place complaint about bad range attribute at the given -- source location. Terminates by raising Error_Resync. procedure Check_Bad_Exp; -- Called after scanning a**b, posts error if ** detected procedure P_Membership_Test (N : Node_Id); -- N is the node for a N_In or N_Not_In node whose right operand has not -- yet been processed. It is called just after scanning out the IN keyword. -- On return, either Right_Opnd or Alternatives is set, as appropriate. function P_Range_Attribute_Reference (Prefix_Node : Node_Id) return Node_Id; -- Scan a range attribute reference. The caller has scanned out the -- prefix. The current token is known to be an apostrophe and the -- following token is known to be RANGE. function P_Unparen_Cond_Case_Quant_Expression return Node_Id; -- This function is called with Token pointing to IF, CASE, or FOR, in a -- context that allows a case, conditional, or quantified expression if -- it is surrounded by parentheses. If not surrounded by parentheses, the -- expression is still returned, but an error message is issued. ------------------------- -- Bad_Range_Attribute -- ------------------------- procedure Bad_Range_Attribute (Loc : Source_Ptr) is begin Error_Msg ("range attribute cannot be used in expression!", Loc); Resync_Expression; end Bad_Range_Attribute; ------------------- -- Check_Bad_Exp -- ------------------- procedure Check_Bad_Exp is begin if Token = Tok_Double_Asterisk then Error_Msg_SC ("parenthesization required for '*'*"); Scan; -- past ** Discard_Junk_Node (P_Primary); Check_Bad_Exp; end if; end Check_Bad_Exp; -------------------------- -- 4.1 Name (also 6.4) -- -------------------------- -- NAME ::= -- DIRECT_NAME | EXPLICIT_DEREFERENCE -- | INDEXED_COMPONENT | SLICE -- | SELECTED_COMPONENT | ATTRIBUTE -- | TYPE_CONVERSION | FUNCTION_CALL -- | CHARACTER_LITERAL | TARGET_NAME -- DIRECT_NAME ::= IDENTIFIER | OPERATOR_SYMBOL -- PREFIX ::= NAME | IMPLICIT_DEREFERENCE -- EXPLICIT_DEREFERENCE ::= NAME . all -- IMPLICIT_DEREFERENCE ::= NAME -- INDEXED_COMPONENT ::= PREFIX (EXPRESSION {, EXPRESSION}) -- SLICE ::= PREFIX (DISCRETE_RANGE) -- SELECTED_COMPONENT ::= PREFIX . SELECTOR_NAME -- SELECTOR_NAME ::= IDENTIFIER | CHARACTER_LITERAL | OPERATOR_SYMBOL -- ATTRIBUTE_REFERENCE ::= PREFIX ' ATTRIBUTE_DESIGNATOR -- ATTRIBUTE_DESIGNATOR ::= -- IDENTIFIER [(static_EXPRESSION)] -- | access | delta | digits -- FUNCTION_CALL ::= -- function_NAME -- | function_PREFIX ACTUAL_PARAMETER_PART -- ACTUAL_PARAMETER_PART ::= -- (PARAMETER_ASSOCIATION {,PARAMETER_ASSOCIATION}) -- PARAMETER_ASSOCIATION ::= -- [formal_parameter_SELECTOR_NAME =>] EXPLICIT_ACTUAL_PARAMETER -- EXPLICIT_ACTUAL_PARAMETER ::= EXPRESSION | variable_NAME -- TARGET_NAME ::= @ (AI12-0125-3: abbreviation for LHS) -- Note: syntactically a procedure call looks just like a function call, -- so this routine is in practice used to scan out procedure calls as well. -- On return, Expr_Form is set to either EF_Name or EF_Simple_Name -- Error recovery: can raise Error_Resync -- Note: if on return Token = Tok_Apostrophe, then the apostrophe must be -- followed by either a left paren (qualified expression case), or by -- range (range attribute case). All other uses of apostrophe (i.e. all -- other attributes) are handled in this routine. -- Error recovery: can raise Error_Resync function P_Name return Node_Id is Scan_State : Saved_Scan_State; Name_Node : Node_Id; Prefix_Node : Node_Id; Ident_Node : Node_Id; Expr_Node : Node_Id; Range_Node : Node_Id; Arg_Node : Node_Id; Arg_List : List_Id := No_List; -- kill junk warning Attr_Name : Name_Id := No_Name; -- kill junk warning begin -- Case of not a name if Token not in Token_Class_Name then -- If it looks like start of expression, complain and scan expression if Token in Token_Class_Literal or else Token = Tok_Left_Paren then Error_Msg_SC ("name expected"); return P_Expression; -- Otherwise some other junk, not much we can do else Error_Msg_AP ("name expected"); raise Error_Resync; end if; end if; -- Loop through designators in qualified name -- AI12-0125 : target_name if Token = Tok_At_Sign then Scan_Reserved_Identifier (Force_Msg => False); end if; Name_Node := Token_Node; loop Scan; -- past designator exit when Token /= Tok_Dot; Save_Scan_State (Scan_State); -- at dot Scan; -- past dot -- If we do not have another designator after the dot, then join -- the normal circuit to handle a dot extension (may be .all or -- character literal case). Otherwise loop back to scan the next -- designator. if Token not in Token_Class_Desig then goto Scan_Name_Extension_Dot; else Prefix_Node := Name_Node; Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr); Set_Prefix (Name_Node, Prefix_Node); Set_Selector_Name (Name_Node, Token_Node); end if; end loop; -- We have now scanned out a qualified designator. If the last token is -- an operator symbol, then we certainly do not have the Snam case, so -- we can just use the normal name extension check circuit if Prev_Token = Tok_Operator_Symbol then goto Scan_Name_Extension; end if; -- We have scanned out a qualified simple name, check for name extension -- Note that we know there is no dot here at this stage, so the only -- possible cases of name extension are apostrophe and left paren. if Token = Tok_Apostrophe then Save_Scan_State (Scan_State); -- at apostrophe Scan; -- past apostrophe -- Qualified expression in Ada 2012 mode (treated as a name) if Ada_Version >= Ada_2012 and then Token = Tok_Left_Paren then goto Scan_Name_Extension_Apostrophe; -- If left paren not in Ada 2012, then it is not part of the name, -- since qualified expressions are not names in prior versions of -- Ada, so return with Token backed up to point to the apostrophe. -- The treatment for the range attribute is similar (we do not -- consider x'range to be a name in this grammar). elsif Token = Tok_Left_Paren or else Token = Tok_Range then Restore_Scan_State (Scan_State); -- to apostrophe Expr_Form := EF_Simple_Name; return Name_Node; -- Otherwise we have the case of a name extended by an attribute else goto Scan_Name_Extension_Apostrophe; end if; -- Check case of qualified simple name extended by a left parenthesis elsif Token = Tok_Left_Paren then Scan; -- past left paren goto Scan_Name_Extension_Left_Paren; -- Otherwise the qualified simple name is not extended, so return else Expr_Form := EF_Simple_Name; return Name_Node; end if; -- Loop scanning past name extensions. A label is used for control -- transfer for this loop for ease of interfacing with the finite state -- machine in the parenthesis scanning circuit, and also to allow for -- passing in control to the appropriate point from the above code. <<Scan_Name_Extension>> -- Character literal used as name cannot be extended. Also this -- cannot be a call, since the name for a call must be a designator. -- Return in these cases, or if there is no name extension if Token not in Token_Class_Namext or else Prev_Token = Tok_Char_Literal then Expr_Form := EF_Name; return Name_Node; end if; -- Merge here when we know there is a name extension <<Scan_Name_Extension_OK>> if Token = Tok_Left_Paren then Scan; -- past left paren goto Scan_Name_Extension_Left_Paren; elsif Token = Tok_Apostrophe then Save_Scan_State (Scan_State); -- at apostrophe Scan; -- past apostrophe goto Scan_Name_Extension_Apostrophe; else -- Token = Tok_Dot Save_Scan_State (Scan_State); -- at dot Scan; -- past dot goto Scan_Name_Extension_Dot; end if; -- Case of name extended by dot (selection), dot is already skipped -- and the scan state at the point of the dot is saved in Scan_State. <<Scan_Name_Extension_Dot>> -- Explicit dereference case if Token = Tok_All then Prefix_Node := Name_Node; Name_Node := New_Node (N_Explicit_Dereference, Token_Ptr); Set_Prefix (Name_Node, Prefix_Node); Scan; -- past ALL goto Scan_Name_Extension; -- Selected component case elsif Token in Token_Class_Name then Prefix_Node := Name_Node; Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr); Set_Prefix (Name_Node, Prefix_Node); Set_Selector_Name (Name_Node, Token_Node); Scan; -- past selector goto Scan_Name_Extension; -- Reserved identifier as selector elsif Is_Reserved_Identifier then Scan_Reserved_Identifier (Force_Msg => False); Prefix_Node := Name_Node; Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr); Set_Prefix (Name_Node, Prefix_Node); Set_Selector_Name (Name_Node, Token_Node); Scan; -- past identifier used as selector goto Scan_Name_Extension; -- If dot is at end of line and followed by nothing legal, -- then assume end of name and quit (dot will be taken as -- an incorrect form of some other punctuation by our caller). elsif Token_Is_At_Start_Of_Line then Restore_Scan_State (Scan_State); return Name_Node; -- Here if nothing legal after the dot else Error_Msg_AP ("selector expected"); raise Error_Resync; end if; -- Here for an apostrophe as name extension. The scan position at the -- apostrophe has already been saved, and the apostrophe scanned out. <<Scan_Name_Extension_Apostrophe>> Scan_Apostrophe : declare function Apostrophe_Should_Be_Semicolon return Boolean; -- Checks for case where apostrophe should probably be -- a semicolon, and if so, gives appropriate message, -- resets the scan pointer to the apostrophe, changes -- the current token to Tok_Semicolon, and returns True. -- Otherwise returns False. ------------------------------------ -- Apostrophe_Should_Be_Semicolon -- ------------------------------------ function Apostrophe_Should_Be_Semicolon return Boolean is begin if Token_Is_At_Start_Of_Line then Restore_Scan_State (Scan_State); -- to apostrophe Error_Msg_SC ("|""''"" should be "";"""); Token := Tok_Semicolon; return True; else return False; end if; end Apostrophe_Should_Be_Semicolon; -- Start of processing for Scan_Apostrophe begin -- Check for qualified expression case in Ada 2012 mode if Ada_Version >= Ada_2012 and then Token = Tok_Left_Paren then Name_Node := P_Qualified_Expression (Name_Node); goto Scan_Name_Extension; -- If range attribute after apostrophe, then return with Token -- pointing to the apostrophe. Note that in this case the prefix -- need not be a simple name (cases like A.all'range). Similarly -- if there is a left paren after the apostrophe, then we also -- return with Token pointing to the apostrophe (this is the -- aggregate case, or some error case). elsif Token = Tok_Range or else Token = Tok_Left_Paren then Restore_Scan_State (Scan_State); -- to apostrophe Expr_Form := EF_Name; return Name_Node; -- Here for cases where attribute designator is an identifier elsif Token = Tok_Identifier then Attr_Name := Token_Name; if not Is_Attribute_Name (Attr_Name) then if Apostrophe_Should_Be_Semicolon then Expr_Form := EF_Name; return Name_Node; -- Here for a bad attribute name else Signal_Bad_Attribute; Scan; -- past bad identifier if Token = Tok_Left_Paren then Scan; -- past left paren loop Discard_Junk_Node (P_Expression_If_OK); exit when not Comma_Present; end loop; T_Right_Paren; end if; return Error; end if; end if; if Style_Check then Style.Check_Attribute_Name (False); end if; -- Here for case of attribute designator is not an identifier else if Token = Tok_Delta then Attr_Name := Name_Delta; elsif Token = Tok_Digits then Attr_Name := Name_Digits; elsif Token = Tok_Access then Attr_Name := Name_Access; elsif Token = Tok_Mod and then Ada_Version >= Ada_95 then Attr_Name := Name_Mod; elsif Apostrophe_Should_Be_Semicolon then Expr_Form := EF_Name; return Name_Node; else Error_Msg_AP ("attribute designator expected"); raise Error_Resync; end if; if Style_Check then Style.Check_Attribute_Name (True); end if; end if; -- We come here with an OK attribute scanned, and corresponding -- Attribute identifier node stored in Ident_Node. Prefix_Node := Name_Node; Name_Node := New_Node (N_Attribute_Reference, Prev_Token_Ptr); Scan; -- past attribute designator Set_Prefix (Name_Node, Prefix_Node); Set_Attribute_Name (Name_Node, Attr_Name); -- Scan attribute arguments/designator. We skip this if we know -- that the attribute cannot have an argument (see documentation -- of Is_Parameterless_Attribute for further details). if Token = Tok_Left_Paren and then not Is_Parameterless_Attribute (Get_Attribute_Id (Attr_Name)) then -- Attribute Update contains an array or record association -- list which provides new values for various components or -- elements. The list is parsed as an aggregate, and we get -- better error handling by knowing that in the parser. if Attr_Name = Name_Update then Set_Expressions (Name_Node, New_List); Append (P_Aggregate, Expressions (Name_Node)); -- All other cases of parsing attribute arguments else Set_Expressions (Name_Node, New_List); Scan; -- past left paren loop declare Expr : constant Node_Id := P_Expression_If_OK; Rnam : Node_Id; begin -- Case of => for named notation if Token = Tok_Arrow then -- Named notation allowed only for the special -- case of System'Restriction_Set (No_Dependence => -- unit_NAME), in which case construct a parameter -- assocation node and append to the arguments. if Attr_Name = Name_Restriction_Set and then Nkind (Expr) = N_Identifier and then Chars (Expr) = Name_No_Dependence then Scan; -- past arrow Rnam := P_Name; Append_To (Expressions (Name_Node), Make_Parameter_Association (Sloc (Rnam), Selector_Name => Expr, Explicit_Actual_Parameter => Rnam)); exit; -- For all other cases named notation is illegal else Error_Msg_SC ("named parameters not permitted " & "for attributes"); Scan; -- past junk arrow end if; -- Here for normal case (not => for named parameter) else Append (Expr, Expressions (Name_Node)); exit when not Comma_Present; end if; end; end loop; T_Right_Paren; end if; end if; goto Scan_Name_Extension; end Scan_Apostrophe; -- Here for left parenthesis extending name (left paren skipped) <<Scan_Name_Extension_Left_Paren>> -- We now have to scan through a list of items, terminated by a -- right parenthesis. The scan is handled by a finite state -- machine. The possibilities are: -- (discrete_range) -- This is a slice. This case is handled in LP_State_Init -- (expression, expression, ..) -- This is interpreted as an indexed component, i.e. as a -- case of a name which can be extended in the normal manner. -- This case is handled by LP_State_Name or LP_State_Expr. -- Note: if and case expressions (without an extra level of -- parentheses) are permitted in this context). -- (..., identifier => expression , ...) -- If there is at least one occurrence of identifier => (but -- none of the other cases apply), then we have a call. -- Test for Id => case if Token = Tok_Identifier then Save_Scan_State (Scan_State); -- at Id Scan; -- past Id -- Test for => (allow := as an error substitute) if Token = Tok_Arrow or else Token = Tok_Colon_Equal then Restore_Scan_State (Scan_State); -- to Id Arg_List := New_List; goto LP_State_Call; else Restore_Scan_State (Scan_State); -- to Id end if; end if; -- Here we have an expression after all Expr_Node := P_Expression_Or_Range_Attribute_If_OK; -- Check cases of discrete range for a slice -- First possibility: Range_Attribute_Reference if Expr_Form = EF_Range_Attr then Range_Node := Expr_Node; -- Second possibility: Simple_expression .. Simple_expression elsif Token = Tok_Dot_Dot then Check_Simple_Expression (Expr_Node); Range_Node := New_Node (N_Range, Token_Ptr); Set_Low_Bound (Range_Node, Expr_Node); Scan; -- past .. Expr_Node := P_Expression; Check_Simple_Expression (Expr_Node); Set_High_Bound (Range_Node, Expr_Node); -- Third possibility: Type_name range Range elsif Token = Tok_Range then if Expr_Form /= EF_Simple_Name then Error_Msg_SC ("subtype mark must precede RANGE"); raise Error_Resync; end if; Range_Node := P_Subtype_Indication (Expr_Node); -- Otherwise we just have an expression. It is true that we might -- have a subtype mark without a range constraint but this case -- is syntactically indistinguishable from the expression case. else Arg_List := New_List; goto LP_State_Expr; end if; -- Fall through here with unmistakable Discrete range scanned, -- which means that we definitely have the case of a slice. The -- Discrete range is in Range_Node. if Token = Tok_Comma then Error_Msg_SC ("slice cannot have more than one dimension"); raise Error_Resync; elsif Token /= Tok_Right_Paren then if Token = Tok_Arrow then -- This may be an aggregate that is missing a qualification Error_Msg_SC ("context of aggregate must be a qualified expression"); raise Error_Resync; else T_Right_Paren; raise Error_Resync; end if; else Scan; -- past right paren Prefix_Node := Name_Node; Name_Node := New_Node (N_Slice, Sloc (Prefix_Node)); Set_Prefix (Name_Node, Prefix_Node); Set_Discrete_Range (Name_Node, Range_Node); -- An operator node is legal as a prefix to other names, -- but not for a slice. if Nkind (Prefix_Node) = N_Operator_Symbol then Error_Msg_N ("illegal prefix for slice", Prefix_Node); end if; -- If we have a name extension, go scan it if Token in Token_Class_Namext then goto Scan_Name_Extension_OK; -- Otherwise return (a slice is a name, but is not a call) else Expr_Form := EF_Name; return Name_Node; end if; end if; -- In LP_State_Expr, we have scanned one or more expressions, and -- so we have a call or an indexed component which is a name. On -- entry we have the expression just scanned in Expr_Node and -- Arg_List contains the list of expressions encountered so far <<LP_State_Expr>> Append (Expr_Node, Arg_List); if Token = Tok_Arrow then Error_Msg ("expect identifier in parameter association", Sloc (Expr_Node)); Scan; -- past arrow elsif not Comma_Present then T_Right_Paren; Prefix_Node := Name_Node; Name_Node := New_Node (N_Indexed_Component, Sloc (Prefix_Node)); Set_Prefix (Name_Node, Prefix_Node); Set_Expressions (Name_Node, Arg_List); goto Scan_Name_Extension; end if; -- Comma present (and scanned out), test for identifier => case -- Test for identifier => case if Token = Tok_Identifier then Save_Scan_State (Scan_State); -- at Id Scan; -- past Id -- Test for => (allow := as error substitute) if Token = Tok_Arrow or else Token = Tok_Colon_Equal then Restore_Scan_State (Scan_State); -- to Id goto LP_State_Call; -- Otherwise it's just an expression after all, so backup else Restore_Scan_State (Scan_State); -- to Id end if; end if; -- Here we have an expression after all, so stay in this state Expr_Node := P_Expression_If_OK; goto LP_State_Expr; -- LP_State_Call corresponds to the situation in which at least one -- instance of Id => Expression has been encountered, so we know that -- we do not have a name, but rather a call. We enter it with the -- scan pointer pointing to the next argument to scan, and Arg_List -- containing the list of arguments scanned so far. <<LP_State_Call>> -- Test for case of Id => Expression (named parameter) if Token = Tok_Identifier then Save_Scan_State (Scan_State); -- at Id Ident_Node := Token_Node; Scan; -- past Id -- Deal with => (allow := as incorrect substitute) if Token = Tok_Arrow or else Token = Tok_Colon_Equal then Arg_Node := New_Node (N_Parameter_Association, Prev_Token_Ptr); Set_Selector_Name (Arg_Node, Ident_Node); T_Arrow; Set_Explicit_Actual_Parameter (Arg_Node, P_Expression); Append (Arg_Node, Arg_List); -- If a comma follows, go back and scan next entry if Comma_Present then goto LP_State_Call; -- Otherwise we have the end of a call else Prefix_Node := Name_Node; Name_Node := New_Node (N_Function_Call, Sloc (Prefix_Node)); Set_Name (Name_Node, Prefix_Node); Set_Parameter_Associations (Name_Node, Arg_List); T_Right_Paren; if Token in Token_Class_Namext then goto Scan_Name_Extension_OK; -- This is a case of a call which cannot be a name else Expr_Form := EF_Name; return Name_Node; end if; end if; -- Not named parameter: Id started an expression after all else Restore_Scan_State (Scan_State); -- to Id end if; end if; -- Here if entry did not start with Id => which means that it -- is a positional parameter, which is not allowed, since we -- have seen at least one named parameter already. Error_Msg_SC ("positional parameter association " & "not allowed after named one"); Expr_Node := P_Expression_If_OK; -- Leaving the '>' in an association is not unusual, so suggest -- a possible fix. if Nkind (Expr_Node) = N_Op_Eq then Error_Msg_N ("\maybe `='>` was intended", Expr_Node); end if; -- We go back to scanning out expressions, so that we do not get -- multiple error messages when several positional parameters -- follow a named parameter. goto LP_State_Expr; -- End of treatment for name extensions starting with left paren -- End of loop through name extensions end P_Name; -- This function parses a restricted form of Names which are either -- designators, or designators preceded by a sequence of prefixes -- that are direct names. -- Error recovery: cannot raise Error_Resync function P_Function_Name return Node_Id is Designator_Node : Node_Id; Prefix_Node : Node_Id; Selector_Node : Node_Id; Dot_Sloc : Source_Ptr := No_Location; begin -- Prefix_Node is set to the gathered prefix so far, Empty means that -- no prefix has been scanned. This allows us to build up the result -- in the required right recursive manner. Prefix_Node := Empty; -- Loop through prefixes loop Designator_Node := Token_Node; if Token not in Token_Class_Desig then return P_Identifier; -- let P_Identifier issue the error message else -- Token in Token_Class_Desig Scan; -- past designator exit when Token /= Tok_Dot; end if; -- Here at a dot, with token just before it in Designator_Node if No (Prefix_Node) then Prefix_Node := Designator_Node; else Selector_Node := New_Node (N_Selected_Component, Dot_Sloc); Set_Prefix (Selector_Node, Prefix_Node); Set_Selector_Name (Selector_Node, Designator_Node); Prefix_Node := Selector_Node; end if; Dot_Sloc := Token_Ptr; Scan; -- past dot end loop; -- Fall out of the loop having just scanned a designator if No (Prefix_Node) then return Designator_Node; else Selector_Node := New_Node (N_Selected_Component, Dot_Sloc); Set_Prefix (Selector_Node, Prefix_Node); Set_Selector_Name (Selector_Node, Designator_Node); return Selector_Node; end if; exception when Error_Resync => return Error; end P_Function_Name; -- This function parses a restricted form of Names which are either -- identifiers, or identifiers preceded by a sequence of prefixes -- that are direct names. -- Error recovery: cannot raise Error_Resync function P_Qualified_Simple_Name return Node_Id is Designator_Node : Node_Id; Prefix_Node : Node_Id; Selector_Node : Node_Id; Dot_Sloc : Source_Ptr := No_Location; begin -- Prefix node is set to the gathered prefix so far, Empty means that -- no prefix has been scanned. This allows us to build up the result -- in the required right recursive manner. Prefix_Node := Empty; -- Loop through prefixes loop Designator_Node := Token_Node; if Token = Tok_Identifier then Scan; -- past identifier exit when Token /= Tok_Dot; elsif Token not in Token_Class_Desig then return P_Identifier; -- let P_Identifier issue the error message else Scan; -- past designator if Token /= Tok_Dot then Error_Msg_SP ("identifier expected"); return Error; end if; end if; -- Here at a dot, with token just before it in Designator_Node if No (Prefix_Node) then Prefix_Node := Designator_Node; else Selector_Node := New_Node (N_Selected_Component, Dot_Sloc); Set_Prefix (Selector_Node, Prefix_Node); Set_Selector_Name (Selector_Node, Designator_Node); Prefix_Node := Selector_Node; end if; Dot_Sloc := Token_Ptr; Scan; -- past dot end loop; -- Fall out of the loop having just scanned an identifier if No (Prefix_Node) then return Designator_Node; else Selector_Node := New_Node (N_Selected_Component, Dot_Sloc); Set_Prefix (Selector_Node, Prefix_Node); Set_Selector_Name (Selector_Node, Designator_Node); return Selector_Node; end if; exception when Error_Resync => return Error; end P_Qualified_Simple_Name; -- This procedure differs from P_Qualified_Simple_Name only in that it -- raises Error_Resync if any error is encountered. It only returns after -- scanning a valid qualified simple name. -- Error recovery: can raise Error_Resync function P_Qualified_Simple_Name_Resync return Node_Id is Designator_Node : Node_Id; Prefix_Node : Node_Id; Selector_Node : Node_Id; Dot_Sloc : Source_Ptr := No_Location; begin Prefix_Node := Empty; -- Loop through prefixes loop Designator_Node := Token_Node; if Token = Tok_Identifier then Scan; -- past identifier exit when Token /= Tok_Dot; elsif Token not in Token_Class_Desig then Discard_Junk_Node (P_Identifier); -- to issue the error message raise Error_Resync; else Scan; -- past designator if Token /= Tok_Dot then Error_Msg_SP ("identifier expected"); raise Error_Resync; end if; end if; -- Here at a dot, with token just before it in Designator_Node if No (Prefix_Node) then Prefix_Node := Designator_Node; else Selector_Node := New_Node (N_Selected_Component, Dot_Sloc); Set_Prefix (Selector_Node, Prefix_Node); Set_Selector_Name (Selector_Node, Designator_Node); Prefix_Node := Selector_Node; end if; Dot_Sloc := Token_Ptr; Scan; -- past period end loop; -- Fall out of the loop having just scanned an identifier if No (Prefix_Node) then return Designator_Node; else Selector_Node := New_Node (N_Selected_Component, Dot_Sloc); Set_Prefix (Selector_Node, Prefix_Node); Set_Selector_Name (Selector_Node, Designator_Node); return Selector_Node; end if; end P_Qualified_Simple_Name_Resync; ---------------------- -- 4.1 Direct_Name -- ---------------------- -- Parsed by P_Name and other functions in section 4.1 ----------------- -- 4.1 Prefix -- ----------------- -- Parsed by P_Name (4.1) ------------------------------- -- 4.1 Explicit Dereference -- ------------------------------- -- Parsed by P_Name (4.1) ------------------------------- -- 4.1 Implicit_Dereference -- ------------------------------- -- Parsed by P_Name (4.1) ---------------------------- -- 4.1 Indexed Component -- ---------------------------- -- Parsed by P_Name (4.1) ---------------- -- 4.1 Slice -- ---------------- -- Parsed by P_Name (4.1) ----------------------------- -- 4.1 Selected_Component -- ----------------------------- -- Parsed by P_Name (4.1) ------------------------ -- 4.1 Selector Name -- ------------------------ -- Parsed by P_Name (4.1) ------------------------------ -- 4.1 Attribute Reference -- ------------------------------ -- Parsed by P_Name (4.1) ------------------------------- -- 4.1 Attribute Designator -- ------------------------------- -- Parsed by P_Name (4.1) -------------------------------------- -- 4.1.4 Range Attribute Reference -- -------------------------------------- -- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR -- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)] -- In the grammar, a RANGE attribute is simply a name, but its use is -- highly restricted, so in the parser, we do not regard it as a name. -- Instead, P_Name returns without scanning the 'RANGE part of the -- attribute, and the caller uses the following function to construct -- a range attribute in places where it is appropriate. -- Note that RANGE here is treated essentially as an identifier, -- rather than a reserved word. -- The caller has parsed the prefix, i.e. a name, and Token points to -- the apostrophe. The token after the apostrophe is known to be RANGE -- at this point. The prefix node becomes the prefix of the attribute. -- Error_Recovery: Cannot raise Error_Resync function P_Range_Attribute_Reference (Prefix_Node : Node_Id) return Node_Id is Attr_Node : Node_Id; begin Attr_Node := New_Node (N_Attribute_Reference, Token_Ptr); Set_Prefix (Attr_Node, Prefix_Node); Scan; -- past apostrophe if Style_Check then Style.Check_Attribute_Name (True); end if; Set_Attribute_Name (Attr_Node, Name_Range); Scan; -- past RANGE if Token = Tok_Left_Paren then Scan; -- past left paren Set_Expressions (Attr_Node, New_List (P_Expression_If_OK)); T_Right_Paren; end if; return Attr_Node; end P_Range_Attribute_Reference; --------------------------------------- -- 4.1.4 Range Attribute Designator -- --------------------------------------- -- Parsed by P_Range_Attribute_Reference (4.4) -------------------- -- 4.3 Aggregate -- -------------------- -- AGGREGATE ::= RECORD_AGGREGATE | EXTENSION_AGGREGATE | ARRAY_AGGREGATE -- Parsed by P_Aggregate_Or_Paren_Expr (4.3), except in the case where -- an aggregate is known to be required (code statement, extension -- aggregate), in which cases this routine performs the necessary check -- that we have an aggregate rather than a parenthesized expression -- Error recovery: can raise Error_Resync function P_Aggregate return Node_Id is Aggr_Sloc : constant Source_Ptr := Token_Ptr; Aggr_Node : constant Node_Id := P_Aggregate_Or_Paren_Expr; begin if Nkind (Aggr_Node) /= N_Aggregate and then Nkind (Aggr_Node) /= N_Extension_Aggregate then Error_Msg ("aggregate may not have single positional component", Aggr_Sloc); return Error; else return Aggr_Node; end if; end P_Aggregate; ------------------------------------------------ -- 4.3 Aggregate or Parenthesized Expression -- ------------------------------------------------ -- This procedure parses out either an aggregate or a parenthesized -- expression (these two constructs are closely related, since a -- parenthesized expression looks like an aggregate with a single -- positional component). -- AGGREGATE ::= -- RECORD_AGGREGATE | EXTENSION_AGGREGATE | ARRAY_AGGREGATE -- RECORD_AGGREGATE ::= (RECORD_COMPONENT_ASSOCIATION_LIST) -- RECORD_COMPONENT_ASSOCIATION_LIST ::= -- RECORD_COMPONENT_ASSOCIATION {, RECORD_COMPONENT_ASSOCIATION} -- | null record -- RECORD_COMPONENT_ASSOCIATION ::= -- [COMPONENT_CHOICE_LIST =>] EXPRESSION -- COMPONENT_CHOICE_LIST ::= -- component_SELECTOR_NAME {| component_SELECTOR_NAME} -- | others -- EXTENSION_AGGREGATE ::= -- (ANCESTOR_PART with RECORD_COMPONENT_ASSOCIATION_LIST) -- ANCESTOR_PART ::= EXPRESSION | SUBTYPE_MARK -- ARRAY_AGGREGATE ::= -- POSITIONAL_ARRAY_AGGREGATE | NAMED_ARRAY_AGGREGATE -- POSITIONAL_ARRAY_AGGREGATE ::= -- (EXPRESSION, EXPRESSION {, EXPRESSION}) -- | (EXPRESSION {, EXPRESSION}, others => EXPRESSION) -- | (EXPRESSION {, EXPRESSION}, others => <>) -- NAMED_ARRAY_AGGREGATE ::= -- (ARRAY_COMPONENT_ASSOCIATION {, ARRAY_COMPONENT_ASSOCIATION}) -- PRIMARY ::= (EXPRESSION); -- Error recovery: can raise Error_Resync -- Note: POSITIONAL_ARRAY_AGGREGATE rule has been extended to give support -- to Ada 2005 limited aggregates (AI-287) function P_Aggregate_Or_Paren_Expr return Node_Id is Aggregate_Node : Node_Id; Expr_List : List_Id; Assoc_List : List_Id; Expr_Node : Node_Id; Lparen_Sloc : Source_Ptr; Scan_State : Saved_Scan_State; procedure Box_Error; -- Called if <> is encountered as positional aggregate element. Issues -- error message and sets Expr_Node to Error. function Is_Quantified_Expression return Boolean; -- The presence of iterated component associations requires a one -- token lookahead to distinguish it from quantified expressions. --------------- -- Box_Error -- --------------- procedure Box_Error is begin if Ada_Version < Ada_2005 then Error_Msg_SC ("box in aggregate is an Ada 2005 extension"); end if; -- Ada 2005 (AI-287): The box notation is allowed only with named -- notation because positional notation might be error prone. For -- example, in "(X, <>, Y, <>)", there is no type associated with -- the boxes, so you might not be leaving out the components you -- thought you were leaving out. Error_Msg_SC ("(Ada 2005) box only allowed with named notation"); Scan; -- past box Expr_Node := Error; end Box_Error; ------------------------------ -- Is_Quantified_Expression -- ------------------------------ function Is_Quantified_Expression return Boolean is Maybe : Boolean; Scan_State : Saved_Scan_State; begin Save_Scan_State (Scan_State); Scan; -- past FOR Maybe := Token = Tok_All or else Token = Tok_Some; Restore_Scan_State (Scan_State); -- to FOR return Maybe; end Is_Quantified_Expression; -- Start of processing for P_Aggregate_Or_Paren_Expr begin Lparen_Sloc := Token_Ptr; T_Left_Paren; -- Note on parentheses count. For cases like an if expression, the -- parens here really count as real parentheses for the paren count, -- so we adjust the paren count accordingly after scanning the expr. -- If expression if Token = Tok_If then Expr_Node := P_If_Expression; T_Right_Paren; Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1); return Expr_Node; -- Case expression elsif Token = Tok_Case then Expr_Node := P_Case_Expression; T_Right_Paren; Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1); return Expr_Node; -- Quantified expression elsif Token = Tok_For and then Is_Quantified_Expression then Expr_Node := P_Quantified_Expression; T_Right_Paren; Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1); return Expr_Node; -- Note: the mechanism used here of rescanning the initial expression -- is distinctly unpleasant, but it saves a lot of fiddling in scanning -- out the discrete choice list. -- Deal with expression and extension aggregates first elsif Token /= Tok_Others then Save_Scan_State (Scan_State); -- at start of expression -- Deal with (NULL RECORD) if Token = Tok_Null then Scan; -- past NULL if Token = Tok_Record then Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc); Set_Null_Record_Present (Aggregate_Node, True); Scan; -- past RECORD T_Right_Paren; return Aggregate_Node; else Restore_Scan_State (Scan_State); -- to NULL that must be expr end if; elsif Token = Tok_For then Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc); Expr_Node := P_Iterated_Component_Association; goto Aggregate; end if; -- Scan expression, handling box appearing as positional argument if Token = Tok_Box then Box_Error; else Expr_Node := P_Expression_Or_Range_Attribute_If_OK; end if; -- Extension or Delta aggregate if Token = Tok_With then if Nkind (Expr_Node) = N_Attribute_Reference and then Attribute_Name (Expr_Node) = Name_Range then Bad_Range_Attribute (Sloc (Expr_Node)); return Error; end if; if Ada_Version = Ada_83 then Error_Msg_SC ("(Ada 83) extension aggregate not allowed"); end if; Scan; -- past WITH if Token = Tok_Delta then Scan; -- past DELTA Aggregate_Node := New_Node (N_Delta_Aggregate, Lparen_Sloc); Set_Expression (Aggregate_Node, Expr_Node); Expr_Node := Empty; goto Aggregate; else Aggregate_Node := New_Node (N_Extension_Aggregate, Lparen_Sloc); Set_Ancestor_Part (Aggregate_Node, Expr_Node); end if; -- Deal with WITH NULL RECORD case if Token = Tok_Null then Save_Scan_State (Scan_State); -- at NULL Scan; -- past NULL if Token = Tok_Record then Scan; -- past RECORD Set_Null_Record_Present (Aggregate_Node, True); T_Right_Paren; return Aggregate_Node; else Restore_Scan_State (Scan_State); -- to NULL that must be expr end if; end if; if Token /= Tok_Others then Save_Scan_State (Scan_State); Expr_Node := P_Expression; else Expr_Node := Empty; end if; -- Expression elsif Token = Tok_Right_Paren or else Token in Token_Class_Eterm then if Nkind (Expr_Node) = N_Attribute_Reference and then Attribute_Name (Expr_Node) = Name_Range then Error_Msg ("|parentheses not allowed for range attribute", Lparen_Sloc); Scan; -- past right paren return Expr_Node; end if; -- Bump paren count of expression if Expr_Node /= Error then Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1); end if; T_Right_Paren; -- past right paren (error message if none) return Expr_Node; -- Normal aggregate else Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc); end if; -- Others else Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc); Expr_Node := Empty; end if; -- Prepare to scan list of component associations <<Aggregate>> Expr_List := No_List; -- don't set yet, maybe all named entries Assoc_List := No_List; -- don't set yet, maybe all positional entries -- This loop scans through component associations. On entry to the -- loop, an expression has been scanned at the start of the current -- association unless initial token was OTHERS, in which case -- Expr_Node is set to Empty. loop -- Deal with others association first. This is a named association if No (Expr_Node) then if No (Assoc_List) then Assoc_List := New_List; end if; Append (P_Record_Or_Array_Component_Association, Assoc_List); -- Improper use of WITH elsif Token = Tok_With then Error_Msg_SC ("WITH must be preceded by single expression in " & "extension aggregate"); raise Error_Resync; -- Range attribute can only appear as part of a discrete choice list elsif Nkind (Expr_Node) = N_Attribute_Reference and then Attribute_Name (Expr_Node) = Name_Range and then Token /= Tok_Arrow and then Token /= Tok_Vertical_Bar then Bad_Range_Attribute (Sloc (Expr_Node)); return Error; -- Assume positional case if comma, right paren, or literal or -- identifier or OTHERS follows (the latter cases are missing -- comma cases). Also assume positional if a semicolon follows, -- which can happen if there are missing parens. elsif Nkind (Expr_Node) = N_Iterated_Component_Association then if No (Assoc_List) then Assoc_List := New_List (Expr_Node); else Append_To (Assoc_List, Expr_Node); end if; elsif Token = Tok_Comma or else Token = Tok_Right_Paren or else Token = Tok_Others or else Token in Token_Class_Lit_Or_Name or else Token = Tok_Semicolon then if Present (Assoc_List) then Error_Msg_BC -- CODEFIX ("""='>"" expected (positional association cannot follow " & "named association)"); end if; if No (Expr_List) then Expr_List := New_List; end if; Append (Expr_Node, Expr_List); -- Check for aggregate followed by left parent, maybe missing comma elsif Nkind (Expr_Node) = N_Aggregate and then Token = Tok_Left_Paren then T_Comma; if No (Expr_List) then Expr_List := New_List; end if; Append (Expr_Node, Expr_List); -- Anything else is assumed to be a named association else Restore_Scan_State (Scan_State); -- to start of expression if No (Assoc_List) then Assoc_List := New_List; end if; Append (P_Record_Or_Array_Component_Association, Assoc_List); end if; exit when not Comma_Present; -- If we are at an expression terminator, something is seriously -- wrong, so let's get out now, before we start eating up stuff -- that doesn't belong to us. if Token in Token_Class_Eterm and then Token /= Tok_For then Error_Msg_AP ("expecting expression or component association"); exit; end if; -- Deal with misused box if Token = Tok_Box then Box_Error; -- Otherwise initiate for reentry to top of loop by scanning an -- initial expression, unless the first token is OTHERS or FOR, -- which indicates an iterated component association. elsif Token = Tok_Others then Expr_Node := Empty; elsif Token = Tok_For then Expr_Node := P_Iterated_Component_Association; else Save_Scan_State (Scan_State); -- at start of expression Expr_Node := P_Expression_Or_Range_Attribute_If_OK; end if; end loop; -- All component associations (positional and named) have been scanned T_Right_Paren; if Nkind (Aggregate_Node) /= N_Delta_Aggregate then Set_Expressions (Aggregate_Node, Expr_List); end if; Set_Component_Associations (Aggregate_Node, Assoc_List); return Aggregate_Node; end P_Aggregate_Or_Paren_Expr; ------------------------------------------------ -- 4.3 Record or Array Component Association -- ------------------------------------------------ -- RECORD_COMPONENT_ASSOCIATION ::= -- [COMPONENT_CHOICE_LIST =>] EXPRESSION -- | COMPONENT_CHOICE_LIST => <> -- COMPONENT_CHOICE_LIST => -- component_SELECTOR_NAME {| component_SELECTOR_NAME} -- | others -- ARRAY_COMPONENT_ASSOCIATION ::= -- DISCRETE_CHOICE_LIST => EXPRESSION -- | DISCRETE_CHOICE_LIST => <> -- | ITERATED_COMPONENT_ASSOCIATION -- Note: this routine only handles the named cases, including others. -- Cases where the component choice list is not present have already -- been handled directly. -- Error recovery: can raise Error_Resync -- Note: RECORD_COMPONENT_ASSOCIATION and ARRAY_COMPONENT_ASSOCIATION -- rules have been extended to give support to Ada 2005 limited -- aggregates (AI-287) function P_Record_Or_Array_Component_Association return Node_Id is Assoc_Node : Node_Id; begin if Token = Tok_For then return P_Iterated_Component_Association; end if; Assoc_Node := New_Node (N_Component_Association, Token_Ptr); Set_Choices (Assoc_Node, P_Discrete_Choice_List); Set_Sloc (Assoc_Node, Token_Ptr); TF_Arrow; if Token = Tok_Box then -- Ada 2005(AI-287): The box notation is used to indicate the -- default initialization of aggregate components if Ada_Version < Ada_2005 then Error_Msg_SP ("component association with '<'> is an Ada 2005 extension"); Error_Msg_SP ("\unit must be compiled with -gnat05 switch"); end if; Set_Box_Present (Assoc_Node); Scan; -- Past box else Set_Expression (Assoc_Node, P_Expression); end if; return Assoc_Node; end P_Record_Or_Array_Component_Association; ----------------------------- -- 4.3.1 Record Aggregate -- ----------------------------- -- Case of enumeration aggregate is parsed by P_Aggregate (4.3) -- All other cases are parsed by P_Aggregate_Or_Paren_Expr (4.3) ---------------------------------------------- -- 4.3.1 Record Component Association List -- ---------------------------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) ---------------------------------- -- 4.3.1 Component Choice List -- ---------------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) -------------------------------- -- 4.3.1 Extension Aggregate -- -------------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) -------------------------- -- 4.3.1 Ancestor Part -- -------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) ---------------------------- -- 4.3.1 Array Aggregate -- ---------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) --------------------------------------- -- 4.3.1 Positional Array Aggregate -- --------------------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) ---------------------------------- -- 4.3.1 Named Array Aggregate -- ---------------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) ---------------------------------------- -- 4.3.1 Array Component Association -- ---------------------------------------- -- Parsed by P_Aggregate_Or_Paren_Expr (4.3) --------------------- -- 4.4 Expression -- --------------------- -- This procedure parses EXPRESSION or CHOICE_EXPRESSION -- EXPRESSION ::= -- RELATION {LOGICAL_OPERATOR RELATION} -- CHOICE_EXPRESSION ::= -- CHOICE_RELATION {LOGICAL_OPERATOR CHOICE_RELATION} -- LOGICAL_OPERATOR ::= and | and then | or | or else | xor -- On return, Expr_Form indicates the categorization of the expression -- EF_Range_Attr is not a possible value (if a range attribute is found, -- an error message is given, and Error is returned). -- Error recovery: cannot raise Error_Resync function P_Expression return Node_Id is Logical_Op : Node_Kind; Prev_Logical_Op : Node_Kind; Op_Location : Source_Ptr; Node1 : Node_Id; Node2 : Node_Id; begin Node1 := P_Relation; if Token in Token_Class_Logop then Prev_Logical_Op := N_Empty; loop Op_Location := Token_Ptr; Logical_Op := P_Logical_Operator; if Prev_Logical_Op /= N_Empty and then Logical_Op /= Prev_Logical_Op then Error_Msg ("mixed logical operators in expression", Op_Location); Prev_Logical_Op := N_Empty; else Prev_Logical_Op := Logical_Op; end if; Node2 := Node1; Node1 := New_Op_Node (Logical_Op, Op_Location); Set_Left_Opnd (Node1, Node2); Set_Right_Opnd (Node1, P_Relation); -- Check for case of errant comma or semicolon if Token = Tok_Comma or else Token = Tok_Semicolon then declare Com : constant Boolean := Token = Tok_Comma; Scan_State : Saved_Scan_State; Logop : Node_Kind; begin Save_Scan_State (Scan_State); -- at comma/semicolon Scan; -- past comma/semicolon -- Check for AND THEN or OR ELSE after comma/semicolon. We -- do not deal with AND/OR because those cases get mixed up -- with the select alternatives case. if Token = Tok_And or else Token = Tok_Or then Logop := P_Logical_Operator; Restore_Scan_State (Scan_State); -- to comma/semicolon if Nkind_In (Logop, N_And_Then, N_Or_Else) then Scan; -- past comma/semicolon if Com then Error_Msg_SP -- CODEFIX ("|extra "","" ignored"); else Error_Msg_SP -- CODEFIX ("|extra "";"" ignored"); end if; else Restore_Scan_State (Scan_State); -- to comma/semicolon end if; else Restore_Scan_State (Scan_State); -- to comma/semicolon end if; end; end if; exit when Token not in Token_Class_Logop; end loop; Expr_Form := EF_Non_Simple; end if; if Token = Tok_Apostrophe then Bad_Range_Attribute (Token_Ptr); return Error; else return Node1; end if; end P_Expression; -- This function is identical to the normal P_Expression, except that it -- also permits the appearance of a case, conditional, or quantified -- expression if the call immediately follows a left paren, and followed -- by a right parenthesis. These forms are allowed if these conditions -- are not met, but an error message will be issued. function P_Expression_If_OK return Node_Id is begin -- Case of conditional, case or quantified expression if Token = Tok_Case or else Token = Tok_If or else Token = Tok_For then return P_Unparen_Cond_Case_Quant_Expression; -- Normal case, not case/conditional/quantified expression else return P_Expression; end if; end P_Expression_If_OK; -- This function is identical to the normal P_Expression, except that it -- checks that the expression scan did not stop on a right paren. It is -- called in all contexts where a right parenthesis cannot legitimately -- follow an expression. -- Error recovery: can not raise Error_Resync function P_Expression_No_Right_Paren return Node_Id is Expr : constant Node_Id := P_Expression; begin Ignore (Tok_Right_Paren); return Expr; end P_Expression_No_Right_Paren; ---------------------------------------- -- 4.4 Expression_Or_Range_Attribute -- ---------------------------------------- -- EXPRESSION ::= -- RELATION {and RELATION} | RELATION {and then RELATION} -- | RELATION {or RELATION} | RELATION {or else RELATION} -- | RELATION {xor RELATION} -- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR -- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)] -- On return, Expr_Form indicates the categorization of the expression -- and EF_Range_Attr is one of the possibilities. -- Error recovery: cannot raise Error_Resync -- In the grammar, a RANGE attribute is simply a name, but its use is -- highly restricted, so in the parser, we do not regard it as a name. -- Instead, P_Name returns without scanning the 'RANGE part of the -- attribute, and P_Expression_Or_Range_Attribute handles the range -- attribute reference. In the normal case where a range attribute is -- not allowed, an error message is issued by P_Expression. function P_Expression_Or_Range_Attribute return Node_Id is Logical_Op : Node_Kind; Prev_Logical_Op : Node_Kind; Op_Location : Source_Ptr; Node1 : Node_Id; Node2 : Node_Id; Attr_Node : Node_Id; begin Node1 := P_Relation; if Token = Tok_Apostrophe then Attr_Node := P_Range_Attribute_Reference (Node1); Expr_Form := EF_Range_Attr; return Attr_Node; elsif Token in Token_Class_Logop then Prev_Logical_Op := N_Empty; loop Op_Location := Token_Ptr; Logical_Op := P_Logical_Operator; if Prev_Logical_Op /= N_Empty and then Logical_Op /= Prev_Logical_Op then Error_Msg ("mixed logical operators in expression", Op_Location); Prev_Logical_Op := N_Empty; else Prev_Logical_Op := Logical_Op; end if; Node2 := Node1; Node1 := New_Op_Node (Logical_Op, Op_Location); Set_Left_Opnd (Node1, Node2); Set_Right_Opnd (Node1, P_Relation); exit when Token not in Token_Class_Logop; end loop; Expr_Form := EF_Non_Simple; end if; if Token = Tok_Apostrophe then Bad_Range_Attribute (Token_Ptr); return Error; else return Node1; end if; end P_Expression_Or_Range_Attribute; -- Version that allows a non-parenthesized case, conditional, or quantified -- expression if the call immediately follows a left paren, and followed -- by a right parenthesis. These forms are allowed if these conditions -- are not met, but an error message will be issued. function P_Expression_Or_Range_Attribute_If_OK return Node_Id is begin -- Case of conditional, case or quantified expression if Token = Tok_Case or else Token = Tok_If or else Token = Tok_For then return P_Unparen_Cond_Case_Quant_Expression; -- Normal case, not one of the above expression types else return P_Expression_Or_Range_Attribute; end if; end P_Expression_Or_Range_Attribute_If_OK; ------------------- -- 4.4 Relation -- ------------------- -- This procedure scans both relations and choice relations -- CHOICE_RELATION ::= -- SIMPLE_EXPRESSION [RELATIONAL_OPERATOR SIMPLE_EXPRESSION] -- RELATION ::= -- SIMPLE_EXPRESSION [not] in MEMBERSHIP_CHOICE_LIST -- | RAISE_EXPRESSION -- MEMBERSHIP_CHOICE_LIST ::= -- MEMBERSHIP_CHOICE {'|' MEMBERSHIP CHOICE} -- MEMBERSHIP_CHOICE ::= -- CHOICE_EXPRESSION | RANGE | SUBTYPE_MARK -- RAISE_EXPRESSION ::= raise exception_NAME [with string_EXPRESSION] -- On return, Expr_Form indicates the categorization of the expression -- Note: if Token = Tok_Apostrophe on return, then Expr_Form is set to -- EF_Simple_Name and the following token is RANGE (range attribute case). -- Error recovery: cannot raise Error_Resync. If an error occurs within an -- expression, then tokens are scanned until either a non-expression token, -- a right paren (not matched by a left paren) or a comma, is encountered. function P_Relation return Node_Id is Node1, Node2 : Node_Id; Optok : Source_Ptr; begin -- First check for raise expression if Token = Tok_Raise then Expr_Form := EF_Non_Simple; return P_Raise_Expression; end if; -- All other cases Node1 := P_Simple_Expression; if Token not in Token_Class_Relop then return Node1; else -- Here we have a relational operator following. If so then scan it -- out. Note that the assignment symbol := is treated as a relational -- operator to improve the error recovery when it is misused for =. -- P_Relational_Operator also parses the IN and NOT IN operations. Optok := Token_Ptr; Node2 := New_Op_Node (P_Relational_Operator, Optok); Set_Left_Opnd (Node2, Node1); -- Case of IN or NOT IN if Prev_Token = Tok_In then P_Membership_Test (Node2); -- Case of relational operator (= /= < <= > >=) else Set_Right_Opnd (Node2, P_Simple_Expression); end if; Expr_Form := EF_Non_Simple; if Token in Token_Class_Relop then Error_Msg_SC ("unexpected relational operator"); raise Error_Resync; end if; return Node2; end if; -- If any error occurs, then scan to the next expression terminator symbol -- or comma or right paren at the outer (i.e. current) parentheses level. -- The flags are set to indicate a normal simple expression. exception when Error_Resync => Resync_Expression; Expr_Form := EF_Simple; return Error; end P_Relation; ---------------------------- -- 4.4 Simple Expression -- ---------------------------- -- SIMPLE_EXPRESSION ::= -- [UNARY_ADDING_OPERATOR] TERM {BINARY_ADDING_OPERATOR TERM} -- On return, Expr_Form indicates the categorization of the expression -- Note: if Token = Tok_Apostrophe on return, then Expr_Form is set to -- EF_Simple_Name and the following token is RANGE (range attribute case). -- Error recovery: cannot raise Error_Resync. If an error occurs within an -- expression, then tokens are scanned until either a non-expression token, -- a right paren (not matched by a left paren) or a comma, is encountered. -- Note: P_Simple_Expression is called only internally by higher level -- expression routines. In cases in the grammar where a simple expression -- is required, the approach is to scan an expression, and then post an -- appropriate error message if the expression obtained is not simple. This -- gives better error recovery and treatment. function P_Simple_Expression return Node_Id is Scan_State : Saved_Scan_State; Node1 : Node_Id; Node2 : Node_Id; Tokptr : Source_Ptr; function At_Start_Of_Attribute return Boolean; -- Tests if we have quote followed by attribute name, if so, return True -- otherwise return False. --------------------------- -- At_Start_Of_Attribute -- --------------------------- function At_Start_Of_Attribute return Boolean is begin if Token /= Tok_Apostrophe then return False; else declare Scan_State : Saved_Scan_State; begin Save_Scan_State (Scan_State); Scan; -- past quote if Token = Tok_Identifier and then Is_Attribute_Name (Chars (Token_Node)) then Restore_Scan_State (Scan_State); return True; else Restore_Scan_State (Scan_State); return False; end if; end; end if; end At_Start_Of_Attribute; -- Start of processing for P_Simple_Expression begin -- Check for cases starting with a name. There are two reasons for -- special casing. First speed things up by catching a common case -- without going through several routine layers. Second the caller must -- be informed via Expr_Form when the simple expression is a name. if Token in Token_Class_Name then Node1 := P_Name; -- Deal with apostrophe cases if Token = Tok_Apostrophe then Save_Scan_State (Scan_State); -- at apostrophe Scan; -- past apostrophe -- If qualified expression, scan it out and fall through if Token = Tok_Left_Paren then Node1 := P_Qualified_Expression (Node1); Expr_Form := EF_Simple; -- If range attribute, then we return with Token pointing to the -- apostrophe. Note: avoid the normal error check on exit. We -- know that the expression really is complete in this case. else -- Token = Tok_Range then Restore_Scan_State (Scan_State); -- to apostrophe Expr_Form := EF_Simple_Name; return Node1; end if; end if; -- If an expression terminator follows, the previous processing -- completely scanned out the expression (a common case), and -- left Expr_Form set appropriately for returning to our caller. if Token in Token_Class_Sterm then null; -- If we do not have an expression terminator, then complete the -- scan of a simple expression. This code duplicates the code -- found in P_Term and P_Factor. else if Token = Tok_Double_Asterisk then if Style_Check then Style.Check_Exponentiation_Operator; end if; Node2 := New_Op_Node (N_Op_Expon, Token_Ptr); Scan; -- past ** Set_Left_Opnd (Node2, Node1); Set_Right_Opnd (Node2, P_Primary); Check_Bad_Exp; Node1 := Node2; end if; loop exit when Token not in Token_Class_Mulop; Tokptr := Token_Ptr; Node2 := New_Op_Node (P_Multiplying_Operator, Tokptr); if Style_Check then Style.Check_Binary_Operator; end if; Scan; -- past operator Set_Left_Opnd (Node2, Node1); Set_Right_Opnd (Node2, P_Factor); Node1 := Node2; end loop; loop exit when Token not in Token_Class_Binary_Addop; Tokptr := Token_Ptr; Node2 := New_Op_Node (P_Binary_Adding_Operator, Tokptr); if Style_Check then Style.Check_Binary_Operator; end if; Scan; -- past operator Set_Left_Opnd (Node2, Node1); Set_Right_Opnd (Node2, P_Term); Node1 := Node2; end loop; Expr_Form := EF_Simple; end if; -- Cases where simple expression does not start with a name else -- Scan initial sign and initial Term if Token in Token_Class_Unary_Addop then Tokptr := Token_Ptr; Node1 := New_Op_Node (P_Unary_Adding_Operator, Tokptr); if Style_Check then Style.Check_Unary_Plus_Or_Minus (Inside_Depends); end if; Scan; -- past operator Set_Right_Opnd (Node1, P_Term); else Node1 := P_Term; end if; -- In the following, we special-case a sequence of concatenations of -- string literals, such as "aaa" & "bbb" & ... & "ccc", with nothing -- else mixed in. For such a sequence, we return a tree representing -- "" & "aaabbb...ccc" (a single concatenation). This is done only if -- the number of concatenations is large. If semantic analysis -- resolves the "&" to a predefined one, then this folding gives the -- right answer. Otherwise, semantic analysis will complain about a -- capacity-exceeded error. The purpose of this trick is to avoid -- creating a deeply nested tree, which would cause deep recursion -- during semantics, causing stack overflow. This way, we can handle -- enormous concatenations in the normal case of predefined "&". We -- first build up the normal tree, and then rewrite it if -- appropriate. declare Num_Concats_Threshold : constant Positive := 1000; -- Arbitrary threshold value to enable optimization First_Node : constant Node_Id := Node1; Is_Strlit_Concat : Boolean; -- True iff we've parsed a sequence of concatenations of string -- literals, with nothing else mixed in. Num_Concats : Natural; -- Number of "&" operators if Is_Strlit_Concat is True begin Is_Strlit_Concat := Nkind (Node1) = N_String_Literal and then Token = Tok_Ampersand; Num_Concats := 0; -- Scan out sequence of terms separated by binary adding operators loop exit when Token not in Token_Class_Binary_Addop; Tokptr := Token_Ptr; Node2 := New_Op_Node (P_Binary_Adding_Operator, Tokptr); if Style_Check and then not Debug_Flag_Dot_QQ then Style.Check_Binary_Operator; end if; Scan; -- past operator Set_Left_Opnd (Node2, Node1); Node1 := P_Term; Set_Right_Opnd (Node2, Node1); -- Check if we're still concatenating string literals Is_Strlit_Concat := Is_Strlit_Concat and then Nkind (Node2) = N_Op_Concat and then Nkind (Node1) = N_String_Literal; if Is_Strlit_Concat then Num_Concats := Num_Concats + 1; end if; Node1 := Node2; end loop; -- If we have an enormous series of concatenations of string -- literals, rewrite as explained above. The Is_Folded_In_Parser -- flag tells semantic analysis that if the "&" is not predefined, -- the folded value is wrong. if Is_Strlit_Concat and then Num_Concats >= Num_Concats_Threshold then declare Empty_String_Val : String_Id; -- String_Id for "" Strlit_Concat_Val : String_Id; -- Contains the folded value (which will be correct if the -- "&" operators are the predefined ones). Cur_Node : Node_Id; -- For walking up the tree New_Node : Node_Id; -- Folded node to replace Node1 Loc : constant Source_Ptr := Sloc (First_Node); begin -- Walk up the tree starting at the leftmost string literal -- (First_Node), building up the Strlit_Concat_Val as we -- go. Note that we do not use recursion here -- the whole -- point is to avoid recursively walking that enormous tree. Start_String; Store_String_Chars (Strval (First_Node)); Cur_Node := Parent (First_Node); while Present (Cur_Node) loop pragma Assert (Nkind (Cur_Node) = N_Op_Concat and then Nkind (Right_Opnd (Cur_Node)) = N_String_Literal); Store_String_Chars (Strval (Right_Opnd (Cur_Node))); Cur_Node := Parent (Cur_Node); end loop; Strlit_Concat_Val := End_String; -- Create new folded node, and rewrite result with a concat- -- enation of an empty string literal and the folded node. Start_String; Empty_String_Val := End_String; New_Node := Make_Op_Concat (Loc, Make_String_Literal (Loc, Empty_String_Val), Make_String_Literal (Loc, Strlit_Concat_Val, Is_Folded_In_Parser => True)); Rewrite (Node1, New_Node); end; end if; end; -- All done, we clearly do not have name or numeric literal so this -- is a case of a simple expression which is some other possibility. Expr_Form := EF_Simple; end if; -- Come here at end of simple expression, where we do a couple of -- special checks to improve error recovery. -- Special test to improve error recovery. If the current token is a -- period, then someone is trying to do selection on something that is -- not a name, e.g. a qualified expression. if Token = Tok_Dot then Error_Msg_SC ("prefix for selection is not a name"); -- If qualified expression, comment and continue, otherwise something -- is pretty nasty so do an Error_Resync call. if Ada_Version < Ada_2012 and then Nkind (Node1) = N_Qualified_Expression then Error_Msg_SC ("\would be legal in Ada 2012 mode"); else raise Error_Resync; end if; end if; -- Special test to improve error recovery: If the current token is -- not the first token on a line (as determined by checking the -- previous token position with the start of the current line), -- then we insist that we have an appropriate terminating token. -- Consider the following two examples: -- 1) if A nad B then ... -- 2) A := B -- C := D -- In the first example, we would like to issue a binary operator -- expected message and resynchronize to the then. In the second -- example, we do not want to issue a binary operator message, so -- that instead we will get the missing semicolon message. This -- distinction is of course a heuristic which does not always work, -- but in practice it is quite effective. -- Note: the one case in which we do not go through this circuit is -- when we have scanned a range attribute and want to return with -- Token pointing to the apostrophe. The apostrophe is not normally -- an expression terminator, and is not in Token_Class_Sterm, but -- in this special case we know that the expression is complete. if not Token_Is_At_Start_Of_Line and then Token not in Token_Class_Sterm then -- Normally the right error message is indeed that we expected a -- binary operator, but in the case of being between a right and left -- paren, e.g. in an aggregate, a more likely error is missing comma. if Prev_Token = Tok_Right_Paren and then Token = Tok_Left_Paren then T_Comma; -- And if we have a quote, we may have a bad attribute elsif At_Start_Of_Attribute then Error_Msg_SC ("prefix of attribute must be a name"); if Ada_Version >= Ada_2012 then Error_Msg_SC ("\qualify expression to turn it into a name"); end if; -- Normal case for binary operator expected message else Error_Msg_AP ("binary operator expected"); end if; raise Error_Resync; else return Node1; end if; -- If any error occurs, then scan to next expression terminator symbol -- or comma, right paren or vertical bar at the outer (i.e. current) paren -- level. Expr_Form is set to indicate a normal simple expression. exception when Error_Resync => Resync_Expression; Expr_Form := EF_Simple; return Error; end P_Simple_Expression; ----------------------------------------------- -- 4.4 Simple Expression or Range Attribute -- ----------------------------------------------- -- SIMPLE_EXPRESSION ::= -- [UNARY_ADDING_OPERATOR] TERM {BINARY_ADDING_OPERATOR TERM} -- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR -- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)] -- Error recovery: cannot raise Error_Resync function P_Simple_Expression_Or_Range_Attribute return Node_Id is Sexpr : Node_Id; Attr_Node : Node_Id; begin -- We don't just want to roar ahead and call P_Simple_Expression -- here, since we want to handle the case of a parenthesized range -- attribute cleanly. if Token = Tok_Left_Paren then declare Lptr : constant Source_Ptr := Token_Ptr; Scan_State : Saved_Scan_State; begin Save_Scan_State (Scan_State); Scan; -- past left paren Sexpr := P_Simple_Expression; if Token = Tok_Apostrophe then Attr_Node := P_Range_Attribute_Reference (Sexpr); Expr_Form := EF_Range_Attr; if Token = Tok_Right_Paren then Scan; -- scan past right paren if present end if; Error_Msg ("parentheses not allowed for range attribute", Lptr); return Attr_Node; end if; Restore_Scan_State (Scan_State); end; end if; -- Here after dealing with parenthesized range attribute Sexpr := P_Simple_Expression; if Token = Tok_Apostrophe then Attr_Node := P_Range_Attribute_Reference (Sexpr); Expr_Form := EF_Range_Attr; return Attr_Node; else return Sexpr; end if; end P_Simple_Expression_Or_Range_Attribute; --------------- -- 4.4 Term -- --------------- -- TERM ::= FACTOR {MULTIPLYING_OPERATOR FACTOR} -- Error recovery: can raise Error_Resync function P_Term return Node_Id is Node1, Node2 : Node_Id; Tokptr : Source_Ptr; begin Node1 := P_Factor; loop exit when Token not in Token_Class_Mulop; Tokptr := Token_Ptr; Node2 := New_Op_Node (P_Multiplying_Operator, Tokptr); if Style_Check and then not Debug_Flag_Dot_QQ then Style.Check_Binary_Operator; end if; Scan; -- past operator Set_Left_Opnd (Node2, Node1); Set_Right_Opnd (Node2, P_Factor); Node1 := Node2; end loop; return Node1; end P_Term; ----------------- -- 4.4 Factor -- ----------------- -- FACTOR ::= PRIMARY [** PRIMARY] | abs PRIMARY | not PRIMARY -- Error recovery: can raise Error_Resync function P_Factor return Node_Id is Node1 : Node_Id; Node2 : Node_Id; begin if Token = Tok_Abs then Node1 := New_Op_Node (N_Op_Abs, Token_Ptr); if Style_Check then Style.Check_Abs_Not; end if; Scan; -- past ABS Set_Right_Opnd (Node1, P_Primary); return Node1; elsif Token = Tok_Not then Node1 := New_Op_Node (N_Op_Not, Token_Ptr); if Style_Check then Style.Check_Abs_Not; end if; Scan; -- past NOT Set_Right_Opnd (Node1, P_Primary); return Node1; else Node1 := P_Primary; if Token = Tok_Double_Asterisk then Node2 := New_Op_Node (N_Op_Expon, Token_Ptr); Scan; -- past ** Set_Left_Opnd (Node2, Node1); Set_Right_Opnd (Node2, P_Primary); Check_Bad_Exp; return Node2; else return Node1; end if; end if; end P_Factor; ------------------ -- 4.4 Primary -- ------------------ -- PRIMARY ::= -- NUMERIC_LITERAL | null -- | STRING_LITERAL | AGGREGATE -- | NAME | QUALIFIED_EXPRESSION -- | ALLOCATOR | (EXPRESSION) | QUANTIFIED_EXPRESSION -- Error recovery: can raise Error_Resync function P_Primary return Node_Id is Scan_State : Saved_Scan_State; Node1 : Node_Id; Lparen : constant Boolean := Prev_Token = Tok_Left_Paren; -- Remember if previous token is a left parenthesis. This is used to -- deal with checking whether IF/CASE/FOR expressions appearing as -- primaries require extra parenthesization. begin -- The loop runs more than once only if misplaced pragmas are found -- or if a misplaced unary minus is skipped. loop case Token is -- Name token can start a name, call or qualified expression, all -- of which are acceptable possibilities for primary. Note also -- that string literal is included in name (as operator symbol) -- and type conversion is included in name (as indexed component). when Tok_Char_Literal | Tok_Identifier | Tok_Operator_Symbol => Node1 := P_Name; -- All done unless apostrophe follows if Token /= Tok_Apostrophe then return Node1; -- Apostrophe following means that we have either just parsed -- the subtype mark of a qualified expression, or the prefix -- or a range attribute. else -- Token = Tok_Apostrophe Save_Scan_State (Scan_State); -- at apostrophe Scan; -- past apostrophe -- If range attribute, then this is always an error, since -- the only legitimate case (where the scanned expression is -- a qualified simple name) is handled at the level of the -- Simple_Expression processing. This case corresponds to a -- usage such as 3 + A'Range, which is always illegal. if Token = Tok_Range then Restore_Scan_State (Scan_State); -- to apostrophe Bad_Range_Attribute (Token_Ptr); return Error; -- If left paren, then we have a qualified expression. -- Note that P_Name guarantees that in this case, where -- Token = Tok_Apostrophe on return, the only two possible -- tokens following the apostrophe are left paren and -- RANGE, so we know we have a left paren here. else -- Token = Tok_Left_Paren return P_Qualified_Expression (Node1); end if; end if; -- Numeric or string literal when Tok_Integer_Literal | Tok_Real_Literal | Tok_String_Literal => Node1 := Token_Node; Scan; -- past number return Node1; -- Left paren, starts aggregate or parenthesized expression when Tok_Left_Paren => declare Expr : constant Node_Id := P_Aggregate_Or_Paren_Expr; begin if Nkind (Expr) = N_Attribute_Reference and then Attribute_Name (Expr) = Name_Range then Bad_Range_Attribute (Sloc (Expr)); end if; return Expr; end; -- Allocator when Tok_New => return P_Allocator; -- Null when Tok_Null => Scan; -- past NULL return New_Node (N_Null, Prev_Token_Ptr); -- Pragma, not allowed here, so just skip past it when Tok_Pragma => P_Pragmas_Misplaced; -- Deal with IF (possible unparenthesized if expression) when Tok_If => -- If this looks like a real if, defined as an IF appearing at -- the start of a new line, then we consider we have a missing -- operand. If in Ada 2012 and the IF is not properly indented -- for a statement, we prefer to issue a message about an ill- -- parenthesized if expression. if Token_Is_At_Start_Of_Line and then not (Ada_Version >= Ada_2012 and then Style_Check_Indentation /= 0 and then Start_Column rem Style_Check_Indentation /= 0) then Error_Msg_AP ("missing operand"); return Error; -- If this looks like an if expression, then treat it that way -- with an error message if not explicitly surrounded by -- parentheses. elsif Ada_Version >= Ada_2012 then Node1 := P_If_Expression; if not (Lparen and then Token = Tok_Right_Paren) then Error_Msg ("if expression must be parenthesized", Sloc (Node1)); end if; return Node1; -- Otherwise treat as misused identifier else return P_Identifier; end if; -- Deal with CASE (possible unparenthesized case expression) when Tok_Case => -- If this looks like a real case, defined as a CASE appearing -- the start of a new line, then we consider we have a missing -- operand. If in Ada 2012 and the CASE is not properly -- indented for a statement, we prefer to issue a message about -- an ill-parenthesized case expression. if Token_Is_At_Start_Of_Line and then not (Ada_Version >= Ada_2012 and then Style_Check_Indentation /= 0 and then Start_Column rem Style_Check_Indentation /= 0) then Error_Msg_AP ("missing operand"); return Error; -- If this looks like a case expression, then treat it that way -- with an error message if not within parentheses. elsif Ada_Version >= Ada_2012 then Node1 := P_Case_Expression; if not (Lparen and then Token = Tok_Right_Paren) then Error_Msg ("case expression must be parenthesized", Sloc (Node1)); end if; return Node1; -- Otherwise treat as misused identifier else return P_Identifier; end if; -- For [all | some] indicates a quantified expression when Tok_For => if Token_Is_At_Start_Of_Line then Error_Msg_AP ("misplaced loop"); return Error; elsif Ada_Version >= Ada_2012 then Save_Scan_State (Scan_State); Scan; -- past FOR if Token = Tok_All or else Token = Tok_Some then Restore_Scan_State (Scan_State); -- To FOR Node1 := P_Quantified_Expression; if not (Lparen and then Token = Tok_Right_Paren) then Error_Msg ("quantified expression must be parenthesized", Sloc (Node1)); end if; else Restore_Scan_State (Scan_State); -- To FOR Node1 := P_Iterated_Component_Association; end if; return Node1; -- Otherwise treat as misused identifier else return P_Identifier; end if; -- Minus may well be an improper attempt at a unary minus. Give -- a message, skip the minus and keep going. when Tok_Minus => Error_Msg_SC ("parentheses required for unary minus"); Scan; -- past minus when Tok_At_Sign => -- AI12-0125 : target_name if Ada_Version < Ada_2020 then Error_Msg_SC ("target name is an Ada 2020 extension"); Error_Msg_SC ("\compile with -gnatX"); end if; Node1 := P_Name; return Node1; -- Anything else is illegal as the first token of a primary, but -- we test for some common errors, to improve error messages. when others => if Is_Reserved_Identifier then return P_Identifier; elsif Prev_Token = Tok_Comma then Error_Msg_SP -- CODEFIX ("|extra "","" ignored"); raise Error_Resync; else Error_Msg_AP ("missing operand"); raise Error_Resync; end if; end case; end loop; end P_Primary; ------------------------------- -- 4.4 Quantified_Expression -- ------------------------------- -- QUANTIFIED_EXPRESSION ::= -- for QUANTIFIER LOOP_PARAMETER_SPECIFICATION => PREDICATE | -- for QUANTIFIER ITERATOR_SPECIFICATION => PREDICATE function P_Quantified_Expression return Node_Id is I_Spec : Node_Id; Node1 : Node_Id; begin Error_Msg_Ada_2012_Feature ("quantified expression", Token_Ptr); Scan; -- past FOR Node1 := New_Node (N_Quantified_Expression, Prev_Token_Ptr); if Token = Tok_All then Set_All_Present (Node1); elsif Token /= Tok_Some then Error_Msg_AP ("missing quantifier"); raise Error_Resync; end if; Scan; -- past ALL or SOME I_Spec := P_Loop_Parameter_Specification; if Nkind (I_Spec) = N_Loop_Parameter_Specification then Set_Loop_Parameter_Specification (Node1, I_Spec); else Set_Iterator_Specification (Node1, I_Spec); end if; if Token = Tok_Arrow then Scan; Set_Condition (Node1, P_Expression); return Node1; else Error_Msg_AP ("missing arrow"); raise Error_Resync; end if; end P_Quantified_Expression; --------------------------- -- 4.5 Logical Operator -- --------------------------- -- LOGICAL_OPERATOR ::= and | or | xor -- Note: AND THEN and OR ELSE are also treated as logical operators -- by the parser (even though they are not operators semantically) -- The value returned is the appropriate Node_Kind code for the operator -- On return, Token points to the token following the scanned operator. -- The caller has checked that the first token is a legitimate logical -- operator token (i.e. is either XOR, AND, OR). -- Error recovery: cannot raise Error_Resync function P_Logical_Operator return Node_Kind is begin if Token = Tok_And then if Style_Check then Style.Check_Binary_Operator; end if; Scan; -- past AND if Token = Tok_Then then Scan; -- past THEN return N_And_Then; else return N_Op_And; end if; elsif Token = Tok_Or then if Style_Check then Style.Check_Binary_Operator; end if; Scan; -- past OR if Token = Tok_Else then Scan; -- past ELSE return N_Or_Else; else return N_Op_Or; end if; else -- Token = Tok_Xor if Style_Check then Style.Check_Binary_Operator; end if; Scan; -- past XOR return N_Op_Xor; end if; end P_Logical_Operator; ------------------------------ -- 4.5 Relational Operator -- ------------------------------ -- RELATIONAL_OPERATOR ::= = | /= | < | <= | > | >= -- The value returned is the appropriate Node_Kind code for the operator. -- On return, Token points to the operator token, NOT past it. -- The caller has checked that the first token is a legitimate relational -- operator token (i.e. is one of the operator tokens listed above). -- Error recovery: cannot raise Error_Resync function P_Relational_Operator return Node_Kind is Op_Kind : Node_Kind; Relop_Node : constant array (Token_Class_Relop) of Node_Kind := (Tok_Less => N_Op_Lt, Tok_Equal => N_Op_Eq, Tok_Greater => N_Op_Gt, Tok_Not_Equal => N_Op_Ne, Tok_Greater_Equal => N_Op_Ge, Tok_Less_Equal => N_Op_Le, Tok_In => N_In, Tok_Not => N_Not_In, Tok_Box => N_Op_Ne); begin if Token = Tok_Box then Error_Msg_SC -- CODEFIX ("|""'<'>"" should be ""/="""); end if; Op_Kind := Relop_Node (Token); if Style_Check then Style.Check_Binary_Operator; end if; Scan; -- past operator token -- Deal with NOT IN, if previous token was NOT, we must have IN now if Prev_Token = Tok_Not then -- Style check, for NOT IN, we require one space between NOT and IN if Style_Check and then Token = Tok_In then Style.Check_Not_In; end if; T_In; end if; return Op_Kind; end P_Relational_Operator; --------------------------------- -- 4.5 Binary Adding Operator -- --------------------------------- -- BINARY_ADDING_OPERATOR ::= + | - | & -- The value returned is the appropriate Node_Kind code for the operator. -- On return, Token points to the operator token (NOT past it). -- The caller has checked that the first token is a legitimate adding -- operator token (i.e. is one of the operator tokens listed above). -- Error recovery: cannot raise Error_Resync function P_Binary_Adding_Operator return Node_Kind is Addop_Node : constant array (Token_Class_Binary_Addop) of Node_Kind := (Tok_Ampersand => N_Op_Concat, Tok_Minus => N_Op_Subtract, Tok_Plus => N_Op_Add); begin return Addop_Node (Token); end P_Binary_Adding_Operator; -------------------------------- -- 4.5 Unary Adding Operator -- -------------------------------- -- UNARY_ADDING_OPERATOR ::= + | - -- The value returned is the appropriate Node_Kind code for the operator. -- On return, Token points to the operator token (NOT past it). -- The caller has checked that the first token is a legitimate adding -- operator token (i.e. is one of the operator tokens listed above). -- Error recovery: cannot raise Error_Resync function P_Unary_Adding_Operator return Node_Kind is Addop_Node : constant array (Token_Class_Unary_Addop) of Node_Kind := (Tok_Minus => N_Op_Minus, Tok_Plus => N_Op_Plus); begin return Addop_Node (Token); end P_Unary_Adding_Operator; ------------------------------- -- 4.5 Multiplying Operator -- ------------------------------- -- MULTIPLYING_OPERATOR ::= * | / | mod | rem -- The value returned is the appropriate Node_Kind code for the operator. -- On return, Token points to the operator token (NOT past it). -- The caller has checked that the first token is a legitimate multiplying -- operator token (i.e. is one of the operator tokens listed above). -- Error recovery: cannot raise Error_Resync function P_Multiplying_Operator return Node_Kind is Mulop_Node : constant array (Token_Class_Mulop) of Node_Kind := (Tok_Asterisk => N_Op_Multiply, Tok_Mod => N_Op_Mod, Tok_Rem => N_Op_Rem, Tok_Slash => N_Op_Divide); begin return Mulop_Node (Token); end P_Multiplying_Operator; -------------------------------------- -- 4.5 Highest Precedence Operator -- -------------------------------------- -- Parsed by P_Factor (4.4) -- Note: this rule is not in fact used by the grammar at any point -------------------------- -- 4.6 Type Conversion -- -------------------------- -- Parsed by P_Primary as a Name (4.1) ------------------------------- -- 4.7 Qualified Expression -- ------------------------------- -- QUALIFIED_EXPRESSION ::= -- SUBTYPE_MARK ' (EXPRESSION) | SUBTYPE_MARK ' AGGREGATE -- The caller has scanned the name which is the Subtype_Mark parameter -- and scanned past the single quote following the subtype mark. The -- caller has not checked that this name is in fact appropriate for -- a subtype mark name (i.e. it is a selected component or identifier). -- Error_Recovery: cannot raise Error_Resync function P_Qualified_Expression (Subtype_Mark : Node_Id) return Node_Id is Qual_Node : Node_Id; begin Qual_Node := New_Node (N_Qualified_Expression, Prev_Token_Ptr); Set_Subtype_Mark (Qual_Node, Check_Subtype_Mark (Subtype_Mark)); Set_Expression (Qual_Node, P_Aggregate_Or_Paren_Expr); return Qual_Node; end P_Qualified_Expression; -------------------- -- 4.8 Allocator -- -------------------- -- ALLOCATOR ::= -- new [SUBPOOL_SPECIFICATION] SUBTYPE_INDICATION -- | new [SUBPOOL_SPECIFICATION] QUALIFIED_EXPRESSION -- -- SUBPOOL_SPECIFICATION ::= (subpool_handle_NAME) -- The caller has checked that the initial token is NEW -- Error recovery: can raise Error_Resync function P_Allocator return Node_Id is Alloc_Node : Node_Id; Type_Node : Node_Id; Null_Exclusion_Present : Boolean; begin Alloc_Node := New_Node (N_Allocator, Token_Ptr); T_New; -- Scan subpool_specification if present (Ada 2012 (AI05-0111-3)) -- Scan Null_Exclusion if present (Ada 2005 (AI-231)) if Token = Tok_Left_Paren then Scan; -- past ( Set_Subpool_Handle_Name (Alloc_Node, P_Name); T_Right_Paren; Error_Msg_Ada_2012_Feature ("|subpool specification", Sloc (Subpool_Handle_Name (Alloc_Node))); end if; Null_Exclusion_Present := P_Null_Exclusion; Set_Null_Exclusion_Present (Alloc_Node, Null_Exclusion_Present); Type_Node := P_Subtype_Mark_Resync; if Token = Tok_Apostrophe then Scan; -- past apostrophe Set_Expression (Alloc_Node, P_Qualified_Expression (Type_Node)); else Set_Expression (Alloc_Node, P_Subtype_Indication (Type_Node, Null_Exclusion_Present)); -- AI05-0104: An explicit null exclusion is not allowed for an -- allocator without initialization. In previous versions of the -- language it just raises constraint error. if Ada_Version >= Ada_2012 and then Null_Exclusion_Present then Error_Msg_N ("an allocator with a subtype indication " & "cannot have a null exclusion", Alloc_Node); end if; end if; return Alloc_Node; end P_Allocator; ----------------------- -- P_Case_Expression -- ----------------------- function P_Case_Expression return Node_Id is Loc : constant Source_Ptr := Token_Ptr; Case_Node : Node_Id; Save_State : Saved_Scan_State; begin Error_Msg_Ada_2012_Feature ("|case expression", Token_Ptr); Scan; -- past CASE Case_Node := Make_Case_Expression (Loc, Expression => P_Expression_No_Right_Paren, Alternatives => New_List); T_Is; -- We now have scanned out CASE expression IS, scan alternatives loop T_When; Append_To (Alternatives (Case_Node), P_Case_Expression_Alternative); -- Missing comma if WHEN (more alternatives present) if Token = Tok_When then T_Comma; -- If comma/WHEN, skip comma and we have another alternative elsif Token = Tok_Comma then Save_Scan_State (Save_State); Scan; -- past comma if Token /= Tok_When then Restore_Scan_State (Save_State); exit; end if; -- If no comma or WHEN, definitely done else exit; end if; end loop; -- If we have an END CASE, diagnose as not needed if Token = Tok_End then Error_Msg_SC ("`END CASE` not allowed at end of case expression"); Scan; -- past END if Token = Tok_Case then Scan; -- past CASE; end if; end if; -- Return the Case_Expression node return Case_Node; end P_Case_Expression; ----------------------------------- -- P_Case_Expression_Alternative -- ----------------------------------- -- CASE_STATEMENT_ALTERNATIVE ::= -- when DISCRETE_CHOICE_LIST => -- EXPRESSION -- The caller has checked that and scanned past the initial WHEN token -- Error recovery: can raise Error_Resync function P_Case_Expression_Alternative return Node_Id is Case_Alt_Node : Node_Id; begin Case_Alt_Node := New_Node (N_Case_Expression_Alternative, Token_Ptr); Set_Discrete_Choices (Case_Alt_Node, P_Discrete_Choice_List); TF_Arrow; Set_Expression (Case_Alt_Node, P_Expression); return Case_Alt_Node; end P_Case_Expression_Alternative; -------------------------------------- -- P_Iterated_Component_Association -- -------------------------------------- -- ITERATED_COMPONENT_ASSOCIATION ::= -- for DEFINING_IDENTIFIER in DISCRETE_CHOICE_LIST => EXPRESSION function P_Iterated_Component_Association return Node_Id is Assoc_Node : Node_Id; begin Scan; -- past FOR Assoc_Node := New_Node (N_Iterated_Component_Association, Prev_Token_Ptr); Set_Defining_Identifier (Assoc_Node, P_Defining_Identifier); T_In; Set_Discrete_Choices (Assoc_Node, P_Discrete_Choice_List); TF_Arrow; Set_Expression (Assoc_Node, P_Expression); return Assoc_Node; end P_Iterated_Component_Association; --------------------- -- P_If_Expression -- --------------------- -- IF_EXPRESSION ::= -- if CONDITION then DEPENDENT_EXPRESSION -- {elsif CONDITION then DEPENDENT_EXPRESSION} -- [else DEPENDENT_EXPRESSION] -- DEPENDENT_EXPRESSION ::= EXPRESSION function P_If_Expression return Node_Id is function P_If_Expression_Internal (Loc : Source_Ptr; Cond : Node_Id) return Node_Id; -- This is the internal recursive routine that does all the work, it is -- recursive since it is used to process ELSIF parts, which internally -- are N_If_Expression nodes with the Is_Elsif flag set. The calling -- sequence is like the outer function except that the caller passes -- the conditional expression (scanned using P_Expression), and the -- scan pointer points just past this expression. Loc points to the -- IF or ELSIF token. ------------------------------ -- P_If_Expression_Internal -- ------------------------------ function P_If_Expression_Internal (Loc : Source_Ptr; Cond : Node_Id) return Node_Id is Exprs : constant List_Id := New_List; Expr : Node_Id; State : Saved_Scan_State; Eptr : Source_Ptr; begin -- All cases except where we are at right paren if Token /= Tok_Right_Paren then TF_Then; Append_To (Exprs, P_Condition (Cond)); Append_To (Exprs, P_Expression); -- Case of right paren (missing THEN phrase). Note that we know this -- is the IF case, since the caller dealt with this possibility in -- the ELSIF case. else Error_Msg_BC ("missing THEN phrase"); Append_To (Exprs, P_Condition (Cond)); end if; -- We now have scanned out IF expr THEN expr -- Check for common error of semicolon before the ELSE if Token = Tok_Semicolon then Save_Scan_State (State); Scan; -- past semicolon if Token = Tok_Else or else Token = Tok_Elsif then Error_Msg_SP -- CODEFIX ("|extra "";"" ignored"); else Restore_Scan_State (State); end if; end if; -- Scan out ELSIF sequence if present if Token = Tok_Elsif then Eptr := Token_Ptr; Scan; -- past ELSIF Expr := P_Expression; -- If we are at a right paren, we assume the ELSIF should be ELSE if Token = Tok_Right_Paren then Error_Msg ("ELSIF should be ELSE", Eptr); Append_To (Exprs, Expr); -- Otherwise we have an OK ELSIF else Expr := P_If_Expression_Internal (Eptr, Expr); Set_Is_Elsif (Expr); Append_To (Exprs, Expr); end if; -- Scan out ELSE phrase if present elsif Token = Tok_Else then -- Scan out ELSE expression Scan; -- Past ELSE Append_To (Exprs, P_Expression); -- Skip redundant ELSE parts while Token = Tok_Else loop Error_Msg_SC ("only one ELSE part is allowed"); Scan; -- past ELSE Discard_Junk_Node (P_Expression); end loop; -- Two expression case (implied True, filled in during semantics) else null; end if; -- If we have an END IF, diagnose as not needed if Token = Tok_End then Error_Msg_SC ("`END IF` not allowed at end of if expression"); Scan; -- past END if Token = Tok_If then Scan; -- past IF; end if; end if; -- Return the If_Expression node return Make_If_Expression (Loc, Expressions => Exprs); end P_If_Expression_Internal; -- Local variables Loc : constant Source_Ptr := Token_Ptr; If_Expr : Node_Id; -- Start of processing for P_If_Expression begin Error_Msg_Ada_2012_Feature ("|if expression", Token_Ptr); Scan; -- past IF Inside_If_Expression := Inside_If_Expression + 1; If_Expr := P_If_Expression_Internal (Loc, P_Expression); Inside_If_Expression := Inside_If_Expression - 1; return If_Expr; end P_If_Expression; ----------------------- -- P_Membership_Test -- ----------------------- -- MEMBERSHIP_CHOICE_LIST ::= MEMBERHIP_CHOICE {'|' MEMBERSHIP_CHOICE} -- MEMBERSHIP_CHOICE ::= CHOICE_EXPRESSION | range | subtype_mark procedure P_Membership_Test (N : Node_Id) is Alt : constant Node_Id := P_Range_Or_Subtype_Mark (Allow_Simple_Expression => (Ada_Version >= Ada_2012)); begin -- Set case if Token = Tok_Vertical_Bar then Error_Msg_Ada_2012_Feature ("set notation", Token_Ptr); Set_Alternatives (N, New_List (Alt)); Set_Right_Opnd (N, Empty); -- Loop to accumulate alternatives while Token = Tok_Vertical_Bar loop Scan; -- past vertical bar Append_To (Alternatives (N), P_Range_Or_Subtype_Mark (Allow_Simple_Expression => True)); end loop; -- Not set case else Set_Right_Opnd (N, Alt); Set_Alternatives (N, No_List); end if; end P_Membership_Test; ------------------------------------------ -- P_Unparen_Cond_Case_Quant_Expression -- ------------------------------------------ function P_Unparen_Cond_Case_Quant_Expression return Node_Id is Lparen : constant Boolean := Prev_Token = Tok_Left_Paren; Result : Node_Id; Scan_State : Saved_Scan_State; begin -- Case expression if Token = Tok_Case then Result := P_Case_Expression; if not (Lparen and then Token = Tok_Right_Paren) then Error_Msg_N ("case expression must be parenthesized!", Result); end if; -- If expression elsif Token = Tok_If then Result := P_If_Expression; if not (Lparen and then Token = Tok_Right_Paren) then Error_Msg_N ("if expression must be parenthesized!", Result); end if; -- Quantified expression or iterated component association elsif Token = Tok_For then Save_Scan_State (Scan_State); Scan; -- past FOR if Token = Tok_All or else Token = Tok_Some then Restore_Scan_State (Scan_State); Result := P_Quantified_Expression; if not (Lparen and then Token = Tok_Right_Paren) then Error_Msg_N ("quantified expression must be parenthesized!", Result); end if; else -- If no quantifier keyword, this is an iterated component in -- an aggregate. Restore_Scan_State (Scan_State); Result := P_Iterated_Component_Association; end if; -- No other possibility should exist (caller was supposed to check) else raise Program_Error; end if; -- Return expression (possibly after having given message) return Result; end P_Unparen_Cond_Case_Quant_Expression; end Ch4;
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_grab_button_request_t is -- Item -- type Item is record major_opcode : aliased Interfaces.Unsigned_8; owner_events : aliased Interfaces.Unsigned_8; length : aliased Interfaces.Unsigned_16; grab_window : aliased xcb.xcb_window_t; event_mask : aliased Interfaces.Unsigned_16; pointer_mode : aliased Interfaces.Unsigned_8; keyboard_mode : aliased Interfaces.Unsigned_8; confine_to : aliased xcb.xcb_window_t; cursor : aliased xcb.xcb_cursor_t; button : aliased Interfaces.Unsigned_8; pad0 : aliased Interfaces.Unsigned_8; modifiers : aliased Interfaces.Unsigned_16; end record; -- Item_Array -- type Item_Array is array (Interfaces.C.size_t range <>) of aliased xcb.xcb_grab_button_request_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_grab_button_request_t.Item, Element_Array => xcb.xcb_grab_button_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_grab_button_request_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_grab_button_request_t.Pointer, Element_Array => xcb.xcb_grab_button_request_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_grab_button_request_t;
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S E M _ A U X -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2010, 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. -- -- -- -- 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. -- -- -- ------------------------------------------------------------------------------ with Atree; use Atree; with Einfo; use Einfo; with Namet; use Namet; with Sinfo; use Sinfo; with Snames; use Snames; with Stand; use Stand; package body Sem_Aux is ---------------------- -- Ancestor_Subtype -- ---------------------- function Ancestor_Subtype (Typ : Entity_Id) return Entity_Id is begin -- If this is first subtype, or is a base type, then there is no -- ancestor subtype, so we return Empty to indicate this fact. if Is_First_Subtype (Typ) or else Is_Base_Type (Typ) then return Empty; end if; declare D : constant Node_Id := Declaration_Node (Typ); begin -- If we have a subtype declaration, get the ancestor subtype if Nkind (D) = N_Subtype_Declaration then if Nkind (Subtype_Indication (D)) = N_Subtype_Indication then return Entity (Subtype_Mark (Subtype_Indication (D))); else return Entity (Subtype_Indication (D)); end if; -- If not, then no subtype indication is available else return Empty; end if; end; end Ancestor_Subtype; -------------------- -- Available_View -- -------------------- function Available_View (Typ : Entity_Id) return Entity_Id is begin if Is_Incomplete_Type (Typ) and then Present (Non_Limited_View (Typ)) then -- The non-limited view may itself be an incomplete type, in which -- case get its full view. return Get_Full_View (Non_Limited_View (Typ)); elsif Is_Class_Wide_Type (Typ) and then Is_Incomplete_Type (Etype (Typ)) and then Present (Non_Limited_View (Etype (Typ))) then return Class_Wide_Type (Non_Limited_View (Etype (Typ))); else return Typ; end if; end Available_View; -------------------- -- Constant_Value -- -------------------- function Constant_Value (Ent : Entity_Id) return Node_Id is D : constant Node_Id := Declaration_Node (Ent); Full_D : Node_Id; begin -- If we have no declaration node, then return no constant value. Not -- clear how this can happen, but it does sometimes and this is the -- safest approach. if No (D) then return Empty; -- Normal case where a declaration node is present elsif Nkind (D) = N_Object_Renaming_Declaration then return Renamed_Object (Ent); -- If this is a component declaration whose entity is a constant, it is -- a prival within a protected function (and so has no constant value). elsif Nkind (D) = N_Component_Declaration then return Empty; -- If there is an expression, return it elsif Present (Expression (D)) then return (Expression (D)); -- For a constant, see if we have a full view elsif Ekind (Ent) = E_Constant and then Present (Full_View (Ent)) then Full_D := Parent (Full_View (Ent)); -- The full view may have been rewritten as an object renaming if Nkind (Full_D) = N_Object_Renaming_Declaration then return Name (Full_D); else return Expression (Full_D); end if; -- Otherwise we have no expression to return else return Empty; end if; end Constant_Value; ----------------------------- -- Enclosing_Dynamic_Scope -- ----------------------------- function Enclosing_Dynamic_Scope (Ent : Entity_Id) return Entity_Id is S : Entity_Id; begin -- The following test is an error defense against some syntax errors -- that can leave scopes very messed up. if Ent = Standard_Standard then return Ent; end if; -- Normal case, search enclosing scopes -- Note: the test for Present (S) should not be required, it defends -- against an ill-formed tree. S := Scope (Ent); loop -- If we somehow got an empty value for Scope, the tree must be -- malformed. Rather than blow up we return Standard in this case. if No (S) then return Standard_Standard; -- Quit if we get to standard or a dynamic scope elsif S = Standard_Standard or else Is_Dynamic_Scope (S) then return S; -- Otherwise keep climbing else S := Scope (S); end if; end loop; end Enclosing_Dynamic_Scope; ------------------------ -- First_Discriminant -- ------------------------ function First_Discriminant (Typ : Entity_Id) return Entity_Id is Ent : Entity_Id; begin pragma Assert (Has_Discriminants (Typ) or else Has_Unknown_Discriminants (Typ)); Ent := First_Entity (Typ); -- The discriminants are not necessarily contiguous, because access -- discriminants will generate itypes. They are not the first entities -- either, because tag and controller record must be ahead of them. if Chars (Ent) = Name_uTag then Ent := Next_Entity (Ent); end if; if Chars (Ent) = Name_uController then Ent := Next_Entity (Ent); end if; -- Skip all hidden stored discriminants if any while Present (Ent) loop exit when Ekind (Ent) = E_Discriminant and then not Is_Completely_Hidden (Ent); Ent := Next_Entity (Ent); end loop; pragma Assert (Ekind (Ent) = E_Discriminant); return Ent; end First_Discriminant; ------------------------------- -- First_Stored_Discriminant -- ------------------------------- function First_Stored_Discriminant (Typ : Entity_Id) return Entity_Id is Ent : Entity_Id; function Has_Completely_Hidden_Discriminant (Typ : Entity_Id) return Boolean; -- Scans the Discriminants to see whether any are Completely_Hidden -- (the mechanism for describing non-specified stored discriminants) ---------------------------------------- -- Has_Completely_Hidden_Discriminant -- ---------------------------------------- function Has_Completely_Hidden_Discriminant (Typ : Entity_Id) return Boolean is Ent : Entity_Id; begin pragma Assert (Ekind (Typ) = E_Discriminant); Ent := Typ; while Present (Ent) and then Ekind (Ent) = E_Discriminant loop if Is_Completely_Hidden (Ent) then return True; end if; Ent := Next_Entity (Ent); end loop; return False; end Has_Completely_Hidden_Discriminant; -- Start of processing for First_Stored_Discriminant begin pragma Assert (Has_Discriminants (Typ) or else Has_Unknown_Discriminants (Typ)); Ent := First_Entity (Typ); if Chars (Ent) = Name_uTag then Ent := Next_Entity (Ent); end if; if Chars (Ent) = Name_uController then Ent := Next_Entity (Ent); end if; if Has_Completely_Hidden_Discriminant (Ent) then while Present (Ent) loop exit when Is_Completely_Hidden (Ent); Ent := Next_Entity (Ent); end loop; end if; pragma Assert (Ekind (Ent) = E_Discriminant); return Ent; end First_Stored_Discriminant; ------------------- -- First_Subtype -- ------------------- function First_Subtype (Typ : Entity_Id) return Entity_Id is B : constant Entity_Id := Base_Type (Typ); F : constant Node_Id := Freeze_Node (B); Ent : Entity_Id; begin -- If the base type has no freeze node, it is a type in Standard, and -- always acts as its own first subtype, except where it is one of the -- predefined integer types. If the type is formal, it is also a first -- subtype, and its base type has no freeze node. On the other hand, a -- subtype of a generic formal is not its own first subtype. Its base -- type, if anonymous, is attached to the formal type decl. from which -- the first subtype is obtained. if No (F) then if B = Base_Type (Standard_Integer) then return Standard_Integer; elsif B = Base_Type (Standard_Long_Integer) then return Standard_Long_Integer; elsif B = Base_Type (Standard_Short_Short_Integer) then return Standard_Short_Short_Integer; elsif B = Base_Type (Standard_Short_Integer) then return Standard_Short_Integer; elsif B = Base_Type (Standard_Long_Long_Integer) then return Standard_Long_Long_Integer; elsif Is_Generic_Type (Typ) then if Present (Parent (B)) then return Defining_Identifier (Parent (B)); else return Defining_Identifier (Associated_Node_For_Itype (B)); end if; else return B; end if; -- Otherwise we check the freeze node, if it has a First_Subtype_Link -- then we use that link, otherwise (happens with some Itypes), we use -- the base type itself. else Ent := First_Subtype_Link (F); if Present (Ent) then return Ent; else return B; end if; end if; end First_Subtype; ------------------------- -- First_Tag_Component -- ------------------------- function First_Tag_Component (Typ : Entity_Id) return Entity_Id is Comp : Entity_Id; Ctyp : Entity_Id; begin Ctyp := Typ; pragma Assert (Is_Tagged_Type (Ctyp)); if Is_Class_Wide_Type (Ctyp) then Ctyp := Root_Type (Ctyp); end if; if Is_Private_Type (Ctyp) then Ctyp := Underlying_Type (Ctyp); -- If the underlying type is missing then the source program has -- errors and there is nothing else to do (the full-type declaration -- associated with the private type declaration is missing). if No (Ctyp) then return Empty; end if; end if; Comp := First_Entity (Ctyp); while Present (Comp) loop if Is_Tag (Comp) then return Comp; end if; Comp := Next_Entity (Comp); end loop; -- No tag component found return Empty; end First_Tag_Component; ---------------- -- Initialize -- ---------------- procedure Initialize is begin Obsolescent_Warnings.Init; end Initialize; --------------------- -- Is_By_Copy_Type -- --------------------- function Is_By_Copy_Type (Ent : Entity_Id) return Boolean is begin -- If Id is a private type whose full declaration has not been seen, -- we assume for now that it is not a By_Copy type. Clearly this -- attribute should not be used before the type is frozen, but it is -- needed to build the associated record of a protected type. Another -- place where some lookahead for a full view is needed ??? return Is_Elementary_Type (Ent) or else (Is_Private_Type (Ent) and then Present (Underlying_Type (Ent)) and then Is_Elementary_Type (Underlying_Type (Ent))); end Is_By_Copy_Type; -------------------------- -- Is_By_Reference_Type -- -------------------------- function Is_By_Reference_Type (Ent : Entity_Id) return Boolean is Btype : constant Entity_Id := Base_Type (Ent); begin if Error_Posted (Ent) or else Error_Posted (Btype) then return False; elsif Is_Private_Type (Btype) then declare Utyp : constant Entity_Id := Underlying_Type (Btype); begin if No (Utyp) then return False; else return Is_By_Reference_Type (Utyp); end if; end; elsif Is_Incomplete_Type (Btype) then declare Ftyp : constant Entity_Id := Full_View (Btype); begin if No (Ftyp) then return False; else return Is_By_Reference_Type (Ftyp); end if; end; elsif Is_Concurrent_Type (Btype) then return True; elsif Is_Record_Type (Btype) then if Is_Limited_Record (Btype) or else Is_Tagged_Type (Btype) or else Is_Volatile (Btype) then return True; else declare C : Entity_Id; begin C := First_Component (Btype); while Present (C) loop if Is_By_Reference_Type (Etype (C)) or else Is_Volatile (Etype (C)) then return True; end if; C := Next_Component (C); end loop; end; return False; end if; elsif Is_Array_Type (Btype) then return Is_Volatile (Btype) or else Is_By_Reference_Type (Component_Type (Btype)) or else Is_Volatile (Component_Type (Btype)) or else Has_Volatile_Components (Btype); else return False; end if; end Is_By_Reference_Type; --------------------- -- Is_Derived_Type -- --------------------- function Is_Derived_Type (Ent : E) return B is Par : Node_Id; begin if Is_Type (Ent) and then Base_Type (Ent) /= Root_Type (Ent) and then not Is_Class_Wide_Type (Ent) then if not Is_Numeric_Type (Root_Type (Ent)) then return True; else Par := Parent (First_Subtype (Ent)); return Present (Par) and then Nkind (Par) = N_Full_Type_Declaration and then Nkind (Type_Definition (Par)) = N_Derived_Type_Definition; end if; else return False; end if; end Is_Derived_Type; ----------------------- -- Is_Generic_Formal -- ----------------------- function Is_Generic_Formal (E : Entity_Id) return Boolean is Kind : Node_Kind; begin if No (E) then return False; else Kind := Nkind (Parent (E)); return Nkind_In (Kind, N_Formal_Object_Declaration, N_Formal_Package_Declaration, N_Formal_Type_Declaration) or else Is_Formal_Subprogram (E); end if; end Is_Generic_Formal; --------------------------- -- Is_Indefinite_Subtype -- --------------------------- function Is_Indefinite_Subtype (Ent : Entity_Id) return Boolean is K : constant Entity_Kind := Ekind (Ent); begin if Is_Constrained (Ent) then return False; elsif K in Array_Kind or else K in Class_Wide_Kind or else Has_Unknown_Discriminants (Ent) then return True; -- Known discriminants: indefinite if there are no default values elsif K in Record_Kind or else Is_Incomplete_Or_Private_Type (Ent) or else Is_Concurrent_Type (Ent) then return (Has_Discriminants (Ent) and then No (Discriminant_Default_Value (First_Discriminant (Ent)))); else return False; end if; end Is_Indefinite_Subtype; ------------------------------- -- Is_Immutably_Limited_Type -- ------------------------------- function Is_Immutably_Limited_Type (Ent : Entity_Id) return Boolean is Btype : constant Entity_Id := Base_Type (Ent); begin if Is_Limited_Record (Btype) then return True; elsif Ekind (Btype) = E_Limited_Private_Type and then Nkind (Parent (Btype)) = N_Formal_Type_Declaration then return not In_Package_Body (Scope ((Btype))); end if; if Is_Private_Type (Btype) then -- AI05-0063: A type derived from a limited private formal type is -- not immutably limited in a generic body. if Is_Derived_Type (Btype) and then Is_Generic_Type (Etype (Btype)) then if not Is_Limited_Type (Etype (Btype)) then return False; -- A descendant of a limited formal type is not immutably limited -- in the generic body, or in the body of a generic child. elsif Ekind (Scope (Etype (Btype))) = E_Generic_Package then return not In_Package_Body (Scope (Btype)); else return False; end if; else declare Utyp : constant Entity_Id := Underlying_Type (Btype); begin if No (Utyp) then return False; else return Is_Immutably_Limited_Type (Utyp); end if; end; end if; elsif Is_Concurrent_Type (Btype) then return True; elsif Is_Record_Type (Btype) then -- Note that we return True for all limited interfaces, even though -- (unsynchronized) limited interfaces can have descendants that are -- nonlimited, because this is a predicate on the type itself, and -- things like functions with limited interface results need to be -- handled as build in place even though they might return objects -- of a type that is not inherently limited. if Is_Class_Wide_Type (Btype) then return Is_Immutably_Limited_Type (Root_Type (Btype)); else declare C : Entity_Id; begin C := First_Component (Btype); while Present (C) loop -- Don't consider components with interface types (which can -- only occur in the case of a _parent component anyway). -- They don't have any components, plus it would cause this -- function to return true for nonlimited types derived from -- limited interfaces. if not Is_Interface (Etype (C)) and then Is_Immutably_Limited_Type (Etype (C)) then return True; end if; C := Next_Component (C); end loop; end; return False; end if; elsif Is_Array_Type (Btype) then return Is_Immutably_Limited_Type (Component_Type (Btype)); else return False; end if; end Is_Immutably_Limited_Type; --------------------- -- Is_Limited_Type -- --------------------- function Is_Limited_Type (Ent : Entity_Id) return Boolean is Btype : constant E := Base_Type (Ent); Rtype : constant E := Root_Type (Btype); begin if not Is_Type (Ent) then return False; elsif Ekind (Btype) = E_Limited_Private_Type or else Is_Limited_Composite (Btype) then return True; elsif Is_Concurrent_Type (Btype) then return True; -- The Is_Limited_Record flag normally indicates that the type is -- limited. The exception is that a type does not inherit limitedness -- from its interface ancestor. So the type may be derived from a -- limited interface, but is not limited. elsif Is_Limited_Record (Ent) and then not Is_Interface (Ent) then return True; -- Otherwise we will look around to see if there is some other reason -- for it to be limited, except that if an error was posted on the -- entity, then just assume it is non-limited, because it can cause -- trouble to recurse into a murky erroneous entity! elsif Error_Posted (Ent) then return False; elsif Is_Record_Type (Btype) then if Is_Limited_Interface (Ent) then return True; -- AI-419: limitedness is not inherited from a limited interface elsif Is_Limited_Record (Rtype) then return not Is_Interface (Rtype) or else Is_Protected_Interface (Rtype) or else Is_Synchronized_Interface (Rtype) or else Is_Task_Interface (Rtype); elsif Is_Class_Wide_Type (Btype) then return Is_Limited_Type (Rtype); else declare C : E; begin C := First_Component (Btype); while Present (C) loop if Is_Limited_Type (Etype (C)) then return True; end if; C := Next_Component (C); end loop; end; return False; end if; elsif Is_Array_Type (Btype) then return Is_Limited_Type (Component_Type (Btype)); else return False; end if; end Is_Limited_Type; ---------------------- -- Nearest_Ancestor -- ---------------------- function Nearest_Ancestor (Typ : Entity_Id) return Entity_Id is D : constant Node_Id := Declaration_Node (Typ); begin -- If we have a subtype declaration, get the ancestor subtype if Nkind (D) = N_Subtype_Declaration then if Nkind (Subtype_Indication (D)) = N_Subtype_Indication then return Entity (Subtype_Mark (Subtype_Indication (D))); else return Entity (Subtype_Indication (D)); end if; -- If derived type declaration, find who we are derived from elsif Nkind (D) = N_Full_Type_Declaration and then Nkind (Type_Definition (D)) = N_Derived_Type_Definition then declare DTD : constant Entity_Id := Type_Definition (D); SI : constant Entity_Id := Subtype_Indication (DTD); begin if Is_Entity_Name (SI) then return Entity (SI); else return Entity (Subtype_Mark (SI)); end if; end; -- Otherwise, nothing useful to return, return Empty else return Empty; end if; end Nearest_Ancestor; --------------------------- -- Nearest_Dynamic_Scope -- --------------------------- function Nearest_Dynamic_Scope (Ent : Entity_Id) return Entity_Id is begin if Is_Dynamic_Scope (Ent) then return Ent; else return Enclosing_Dynamic_Scope (Ent); end if; end Nearest_Dynamic_Scope; ------------------------ -- Next_Tag_Component -- ------------------------ function Next_Tag_Component (Tag : Entity_Id) return Entity_Id is Comp : Entity_Id; begin pragma Assert (Is_Tag (Tag)); -- Loop to look for next tag component Comp := Next_Entity (Tag); while Present (Comp) loop if Is_Tag (Comp) then pragma Assert (Chars (Comp) /= Name_uTag); return Comp; end if; Comp := Next_Entity (Comp); end loop; -- No tag component found return Empty; end Next_Tag_Component; -------------------------- -- Number_Discriminants -- -------------------------- function Number_Discriminants (Typ : Entity_Id) return Pos is N : Int; Discr : Entity_Id; begin N := 0; Discr := First_Discriminant (Typ); while Present (Discr) loop N := N + 1; Discr := Next_Discriminant (Discr); end loop; return N; end Number_Discriminants; --------------- -- Tree_Read -- --------------- procedure Tree_Read is begin Obsolescent_Warnings.Tree_Read; end Tree_Read; ---------------- -- Tree_Write -- ---------------- procedure Tree_Write is begin Obsolescent_Warnings.Tree_Write; end Tree_Write; -------------------- -- Ultimate_Alias -- -------------------- function Ultimate_Alias (Prim : Entity_Id) return Entity_Id is E : Entity_Id := Prim; begin while Present (Alias (E)) loop pragma Assert (Alias (E) /= E); E := Alias (E); end loop; return E; end Ultimate_Alias; end Sem_Aux;
with Ada.Integer_Text_IO; with Ada.Text_IO; package body Problem_08 is package IO renames Ada.Text_IO; package I_IO renames Ada.Integer_Text_IO; procedure Solve is Big_Num : constant String := "73167176531330624919225119674426574742355349194934" &"96983520312774506326239578318016984801869478851843" &"85861560789112949495459501737958331952853208805511" &"12540698747158523863050715693290963295227443043557" &"66896648950445244523161731856403098711121722383113" &"62229893423380308135336276614282806444486645238749" &"30358907296290491560440772390713810515859307960866" &"70172427121883998797908792274921901699720888093776" &"65727333001053367881220235421809751254540594752243" &"52584907711670556013604839586446706324415722155397" &"53697817977846174064955149290862569321978468622482" &"83972241375657056057490261407972968652414535100474" &"82166370484403199890008895243450658541227588666881" &"16427171479924442928230863465674813919123162824586" &"17866458359124566529476545682848912883142607690042" &"24219022671055626321111109370544217506941658960408" &"07198403850962455444362981230987879927244284909188" &"84580156166097919133875499200524063689912560717606" &"05886116467109405077541002256983155200055935729725" &"71636269561882670428252483600823257530420752963450"; type Last_5 is mod 5; numbers : Array (Last_5'Range) of Natural; numbers_index : Last_5 := Last_5'Last; biggest : Natural := 0; function Product_Of return Natural is product : Natural := 1; begin for index in numbers'Range loop declare number : constant Natural := numbers(index); begin product := product * number; end; end loop; return product; end; begin for index in Last_5'First .. Last_5'Last - 1 loop numbers(index) := Character'Pos(Big_Num(Big_Num'First + Integer(index))) - Character'Pos('0'); end loop; for index in Big_Num'First + Integer(numbers_index) .. Big_Num'Last loop numbers(numbers_index) := Character'Pos(Big_Num(index)) - Character'Pos('0'); numbers_index := numbers_index + 1; declare product : constant Natural := Product_Of; begin if product > biggest then biggest := product; end if; end; end loop; I_IO.Put(biggest); IO.New_Line; end Solve; end Problem_08;
----------------------------------------------------------------------- -- awa-wikis-tests -- Unit tests for wikis module -- Copyright (C) 2018 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 Util.Tests; with AWA.Tests; with Ada.Strings.Unbounded; package AWA.Wikis.Tests is procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite); type Test is new AWA.Tests.Test with record Wiki_Ident : Ada.Strings.Unbounded.Unbounded_String; Page_Ident : Ada.Strings.Unbounded.Unbounded_String; end record; -- Get some access on the wiki page as anonymous users. procedure Verify_Anonymous (T : in out Test; Page : in String; Title : in String); -- Verify that the wiki lists contain the given page. procedure Verify_List_Contains (T : in out Test; Page : in String); -- Test access to the wiki as anonymous user. procedure Test_Anonymous_Access (T : in out Test); -- Test creation of wiki space and page by simulating web requests. procedure Test_Create_Wiki (T : in out Test); -- Test getting a wiki page which does not exist. procedure Test_Missing_Page (T : in out Test); end AWA.Wikis.Tests;