CombinedText stringlengths 4 3.42M |
|---|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f407xx.h et al. --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief CMSIS STM32F407xx Device Peripheral Access Layer Header File. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
-- This file provides register definitions for the STM32F4 (ARM Cortex M4F)
-- microcontrollers from ST Microelectronics.
with STM32_SVD; use STM32_SVD;
with STM32_SVD.EXTI; use STM32_SVD.EXTI;
package body STM32GD.EXTI is
-------------------------------
-- Enable_External_Interrupt --
-------------------------------
procedure Enable_External_Interrupt
(Line : External_Line_Number;
Trigger : Interrupt_Triggers)
is
Index : constant Natural := External_Line_Number'Pos (Line);
begin
EXTI_Periph.IMR.MR.Arr (Index) := 1;
EXTI_Periph.RTSR.TR.Arr (Index) :=
(if Trigger in Interrupt_Rising_Edge | Interrupt_Rising_Falling_Edge then 1 else 0);
EXTI_Periph.FTSR.TR.Arr (Index) :=
(if Trigger in Interrupt_Falling_Edge | Interrupt_Rising_Falling_Edge then 1 else 0);
end Enable_External_Interrupt;
--------------------------------
-- Disable_External_Interrupt --
--------------------------------
procedure Disable_External_Interrupt (Line : External_Line_Number) is
Index : constant Natural := External_Line_Number'Pos (Line);
begin
EXTI_Periph.IMR.MR.Arr (Index) := 0;
EXTI_Periph.RTSR.TR.Arr (Index) := 0;
EXTI_Periph.FTSR.TR.Arr (Index) := 0;
end Disable_External_Interrupt;
---------------------------
-- Enable_External_Event --
---------------------------
procedure Enable_External_Event
(Line : External_Line_Number;
Trigger : Event_Triggers)
is
Index : constant Natural := External_Line_Number'Pos (Line);
begin
EXTI_Periph.EMR.MR.Arr (Index) := 1;
EXTI_Periph.RTSR.TR.Arr (Index) :=
(if Trigger in Interrupt_Rising_Edge | Interrupt_Rising_Falling_Edge then 1 else 0);
EXTI_Periph.FTSR.TR.Arr (Index) :=
(if Trigger in Interrupt_Falling_Edge | Interrupt_Rising_Falling_Edge then 1 else 0);
end Enable_External_Event;
----------------------------
-- Disable_External_Event --
----------------------------
procedure Disable_External_Event (Line : External_Line_Number) is
Index : constant Natural := External_Line_Number'Pos (Line);
begin
EXTI_Periph.EMR.MR.Arr (Index) := 0;
EXTI_Periph.RTSR.TR.Arr (Index) := 0;
EXTI_Periph.FTSR.TR.Arr (Index) := 0;
end Disable_External_Event;
------------------
-- Generate_SWI --
------------------
procedure Generate_SWI (Line : External_Line_Number) is
begin
EXTI_Periph.SWIER.SWIER.Arr (External_Line_Number'Pos (Line)) := 1;
end Generate_SWI;
--------------------------------
-- External_Interrupt_Pending --
--------------------------------
function External_Interrupt_Pending (Line : External_Line_Number)
return Boolean
is (EXTI_Periph.PR.PR.Arr (External_Line_Number'Pos (Line)) = 1);
------------------------------
-- Clear_External_Interrupt --
------------------------------
procedure Clear_External_Interrupt (Line : External_Line_Number) is
begin
-- yes, one to clear
EXTI_Periph.PR.PR.Arr (External_Line_Number'Pos (Line)) := 1;
end Clear_External_Interrupt;
end STM32GD.EXTI;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- I N T E R F A C E S . L E O N 3 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-2002 Universidad Politecnica de Madrid --
-- Copyright (C) 2003-2006 The European Space Agency --
-- Copyright (C) 2003-2017, AdaCore --
-- --
-- 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. GNARL 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. --
-- --
-- The port of GNARL to bare board targets was initially developed by the --
-- Real-Time Systems Group at the Technical University of Madrid. --
-- --
------------------------------------------------------------------------------
-- This package provides the appropriate mapping for the system registers.
-- This is a LEON3 specific package, based on the UT699 LEON 3FT/SPARC V8
-- Micro-Processor Advanced Users Manual, dated March 2, 2009 from
-- www.aeroflex.com/LEON, referenced hereafter as AUM.
package Interfaces.Leon3 is
pragma No_Elaboration_Code_All;
pragma Preelaborate;
-- Pragma Suppress_Initialization (register_type) must be used in order
-- to keep eficiency. Otherwise, initialization procedures are always
-- generated for objects of packed boolean array types and of record types
-- that have components of these types.
----------------------------
-- Local type definitions --
----------------------------
type Reserved_2 is array (0 .. 1) of Boolean;
for Reserved_2'Size use 2;
pragma Pack (Reserved_2);
type Reserved_3 is array (0 .. 2) of Boolean;
for Reserved_3'Size use 3;
pragma Pack (Reserved_3);
type Reserved_8 is array (0 .. 7) of Boolean;
for Reserved_8'Size use 8;
pragma Pack (Reserved_8);
type Reserved_9 is array (0 .. 8) of Boolean;
for Reserved_9'Size use 9;
pragma Pack (Reserved_9);
type Reserved_16 is array (0 .. 15) of Boolean;
for Reserved_16'Size use 16;
pragma Pack (Reserved_16);
type Reserved_20 is array (0 .. 19) of Boolean;
for Reserved_20'Size use 20;
pragma Pack (Reserved_20);
type Reserved_21 is array (0 .. 20) of Boolean;
for Reserved_21'Size use 21;
pragma Pack (Reserved_21);
type Reserved_22 is array (0 .. 21) of Boolean;
for Reserved_22'Size use 22;
pragma Pack (Reserved_22);
type Reserved_23 is array (0 .. 22) of Boolean;
for Reserved_23'Size use 23;
pragma Pack (Reserved_23);
type Reserved_24 is array (0 .. 23) of Boolean;
for Reserved_24'Size use 24;
pragma Pack (Reserved_24);
type Reserved_25 is array (0 .. 24) of Boolean;
for Reserved_25'Size use 25;
pragma Pack (Reserved_25);
type Reserved_27 is array (0 .. 26) of Boolean;
for Reserved_27'Size use 27;
pragma Pack (Reserved_27);
-- Mapping between bits in a 32-bit register as used in the hardware
-- documentation and bit order as used by Ada.
-- This makes it easier to verify correctness against the AUM. Ranges will
-- need to be reversed, but the compiler will check this.
Bit00 : constant := 31; Bit01 : constant := 30; Bit02 : constant := 29;
Bit03 : constant := 28; Bit04 : constant := 27; Bit05 : constant := 26;
Bit06 : constant := 25; Bit07 : constant := 24; Bit08 : constant := 23;
Bit09 : constant := 22; Bit10 : constant := 21; Bit11 : constant := 20;
Bit12 : constant := 19; Bit13 : constant := 18; Bit14 : constant := 17;
Bit15 : constant := 16; Bit16 : constant := 15; Bit17 : constant := 14;
Bit18 : constant := 13; Bit19 : constant := 12; Bit20 : constant := 11;
Bit21 : constant := 10; Bit22 : constant := 09; Bit23 : constant := 08;
Bit24 : constant := 7; Bit25 : constant := 06; Bit26 : constant := 05;
Bit27 : constant := 4; Bit28 : constant := 03; Bit29 : constant := 02;
Bit30 : constant := 1; Bit31 : constant := 00;
end Interfaces.Leon3;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . R E A L _ T I M E . D E L A Y S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, 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 2, or (at your option) any later ver- --
-- sion. GNARL 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 GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, 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. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Exceptions;
-- Used for Raise_Exception
with System.Tasking;
-- Used for Task_Id
with System.Task_Primitives.Operations;
-- Used for Timed_Delay
-- Self
package body Ada.Real_Time.Delays is
package STPO renames System.Task_Primitives.Operations;
----------------
-- Local Data --
----------------
Absolute_RT : constant := 2;
-----------------
-- Delay_Until --
-----------------
procedure Delay_Until (T : Time) is
Self_Id : constant System.Tasking.Task_Id := STPO.Self;
begin
-- If pragma Detect_Blocking is active, Program_Error must be
-- raised if this potentially blocking operation is called from a
-- protected action.
if System.Tasking.Detect_Blocking
and then Self_Id.Common.Protected_Action_Nesting > 0
then
Ada.Exceptions.Raise_Exception
(Program_Error'Identity, "potentially blocking operation");
else
STPO.Timed_Delay (Self_Id, To_Duration (T), Absolute_RT);
end if;
end Delay_Until;
-----------------
-- To_Duration --
-----------------
function To_Duration (T : Time) return Duration is
begin
return To_Duration (Time_Span (T));
end To_Duration;
end Ada.Real_Time.Delays;
|
-- Copyright 2010-2021 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 Mixed is
procedure Start_Test;
end Mixed;
|
-----------------------------------------------------------------------
-- nodes-facelets -- Facelets composition nodes
-- Copyright (C) 2009, 2010, 2011, 2012, 2013, 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.
-----------------------------------------------------------------------
-- The <b>ASF.Views.Nodes.Facelets</b> package defines some pre-defined
-- tags for composing a view.
--
-- xmlns:ui="http://java.sun.com/jsf/facelets"
--
-- The following Facelets core elements are defined:
-- <ui:include src="..."/>
-- <ui:decorate view="..."/>
-- <ui:define name="..."/>
-- <ui:insert name="..."/>
-- <ui:param name="..." value="..."/>
-- <ui:composition .../>
--
with Ada.Strings.Hash;
with ASF.Factory;
with Ada.Containers.Indefinite_Hashed_Maps;
package ASF.Views.Nodes.Facelets is
-- Register the facelets component factory.
procedure Register (Factory : in out ASF.Factory.Component_Factory);
-- ------------------------------
-- Include Tag
-- ------------------------------
-- The <ui:include src="..."/>
type Include_Tag_Node is new Tag_Node with private;
type Include_Tag_Node_Access is access all Include_Tag_Node'Class;
-- Create the Include Tag
function Create_Include_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
overriding
procedure Build_Components (Node : access Include_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class);
-- ------------------------------
-- Composition Tag
-- ------------------------------
-- The <ui:composition template="..."/>
type Composition_Tag_Node is new Tag_Node with private;
type Composition_Tag_Node_Access is access all Composition_Tag_Node'Class;
-- Create the Composition Tag
function Create_Composition_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
overriding
procedure Build_Components (Node : access Composition_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class);
-- Freeze the tag node tree and perform any initialization steps
-- necessary to build the components efficiently. After this call
-- the tag node tree should not be modified and it represents a read-only
-- tree.
overriding
procedure Freeze (Node : access Composition_Tag_Node);
-- Include in the component tree the definition identified by the name.
-- Upon completion, return in <b>Found</b> whether the definition was found
-- within this composition context.
procedure Include_Definition (Node : access Composition_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class;
Name : in Unbounded_String;
Found : out Boolean);
-- ------------------------------
-- Debug Tag
-- ------------------------------
-- The <ui:debug/>
type Debug_Tag_Node is new Tag_Node with private;
type Debug_Tag_Node_Access is access all Debug_Tag_Node'Class;
-- Create the Debug Tag
function Create_Debug_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
overriding
procedure Build_Components (Node : access Debug_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class);
-- ------------------------------
-- Decorate Tag
-- ------------------------------
-- The <ui:decorate template="...">...</ui:decorate>
type Decorate_Tag_Node is new Composition_Tag_Node with private;
type Decorate_Tag_Node_Access is access all Decorate_Tag_Node'Class;
-- Create the Decorate Tag
function Create_Decorate_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- ------------------------------
-- Define Tag
-- ------------------------------
-- The <ui:define name="...">...</ui:define>
type Define_Tag_Node is new Tag_Node with private;
type Define_Tag_Node_Access is access all Define_Tag_Node'Class;
-- Create the Define Tag
function Create_Define_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
overriding
procedure Build_Components (Node : access Define_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class);
-- ------------------------------
-- Insert Tag
-- ------------------------------
-- The <ui:insert name="...">...</ui:insert>
type Insert_Tag_Node is new Tag_Node with private;
type Insert_Tag_Node_Access is access all Insert_Tag_Node'Class;
-- Create the Insert Tag
function Create_Insert_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
overriding
procedure Build_Components (Node : access Insert_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class);
-- ------------------------------
-- Param Tag
-- ------------------------------
-- The <ui:param name="name" value="#{expr}"/> parameter creation.
-- The parameter is created in the faces context.
type Param_Tag_Node is new Tag_Node with private;
type Param_Tag_Node_Access is access all Param_Tag_Node'Class;
-- Create the Param Tag
function Create_Param_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
overriding
procedure Build_Components (Node : access Param_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class);
-- ------------------------------
-- Comment Tag
-- ------------------------------
-- The <ui:comment condition="...">...</ui:comment>
type Comment_Tag_Node is new Tag_Node with private;
type Comment_Tag_Node_Access is access all Comment_Tag_Node'Class;
-- Create the Comment Tag
function Create_Comment_Tag_Node (Binding : in Binding_Type;
Line : in Line_Info;
Parent : in Tag_Node_Access;
Attributes : in Tag_Attribute_Array_Access)
return Tag_Node_Access;
-- Build the component tree from the tag node and attach it as
-- the last child of the given parent. Calls recursively the
-- method to create children.
overriding
procedure Build_Components (Node : access Comment_Tag_Node;
Parent : in UIComponent_Access;
Context : in out Facelet_Context'Class);
private
-- Tag library map indexed on the library namespace.
package Define_Maps is new
Ada.Containers.Indefinite_Hashed_Maps (Key_Type => String,
Element_Type => Define_Tag_Node_Access,
Hash => Ada.Strings.Hash,
Equivalent_Keys => "=");
type Include_Tag_Node is new Tag_Node with record
Source : Tag_Attribute_Access;
end record;
type Composition_Tag_Node is new Tag_Node with record
Template : Tag_Attribute_Access;
Defines : Define_Maps.Map;
end record;
type Debug_Tag_Node is new Tag_Node with record
Source : Tag_Attribute_Access;
end record;
type Decorate_Tag_Node is new Composition_Tag_Node with null record;
type Define_Tag_Node is new Tag_Node with record
Define_Name : Unbounded_String;
end record;
type Insert_Tag_Node is new Tag_Node with record
Insert_Name : Tag_Attribute_Access;
end record;
type Param_Tag_Node is new Tag_Node with record
Var : Tag_Attribute_Access;
Value : Tag_Attribute_Access;
end record;
type Comment_Tag_Node is new Tag_Node with record
Condition : Tag_Attribute_Access;
end record;
end ASF.Views.Nodes.Facelets;
|
--
-- Copyright 2018 The wookey project team <wookey@ssi.gouv.fr>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- 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 soc.devmap;
with soc.rcc;
package body soc.rng
with spark_mode => off
is
last_random : unsigned_32;
procedure init
(success : out boolean)
is
begin
soc.rcc.enable_clock (soc.devmap.RNG);
RNG.CR.RNGEN := true;
loop
exit when RNG.SR.DRDY;
end loop;
if RNG.SR.SECS or RNG.SR.CECS then
success := false;
else
success := true;
end if;
last_random := RNG.DR.RNDATA;
end init;
procedure random
(rand : out unsigned_32;
success : out boolean)
is
begin
loop
exit when RNG.SR.DRDY;
end loop;
rand := RNG.DR.RNDATA;
if rand = last_random or RNG.SR.SECS then
success := false;
else
success := true;
end if;
end random;
end soc.rng;
|
-----------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_dma.c --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief DMA HAL module driver. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
-- --
-- Modified for the STM32F10x series. That series has only channel, no --
-- streams --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with System.Storage_Elements;
with STM32_SVD.DMA; use STM32_SVD.DMA;
package body STM32.DMA is
function To_Bit is new Ada.Unchecked_Conversion (Boolean, Bit);
type CCR_Ptr is access all CCR_Register;
function Get_Channel
(Port : DMA_Controller;
Num : DMA_Channel_Selector) return CCR_Ptr;
-- procedure Set_Interrupt_Enabler
-- (This_Channel : DMA_Channel;
-- Source : DMA_Interrupt;
-- Value : Boolean);
-- An internal routine, used to enable and disable the specified interrupt
----------------
-- Get_Channel --
----------------
function Get_Channel
(Port : DMA_Controller;
Num : DMA_Channel_Selector) return CCR_Ptr
is
Addr : System.Address;
function To_CCR is new Ada.Unchecked_Conversion
(System.Address, CCR_Ptr);
begin
case Num is
when Channel_1 =>
Addr := Port.CCR1'Address;
when Channel_2 =>
Addr := Port.CCR2'Address;
when Channel_3 =>
Addr := Port.CCR3'Address;
when Channel_4 =>
Addr := Port.CCR4'Address;
when Channel_5 =>
Addr := Port.CCR5'Address;
when Channel_6 =>
Addr := Port.CCR6'Address;
when Channel_7 =>
Addr := Port.CCR7'Address;
end case;
return To_CCR (Addr);
end Get_Channel;
------------
-- Enable --
------------
procedure Enable
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector)
is
begin
Get_Channel (This, Channel).EN := True;
end Enable;
-------------
-- Enabled --
-------------
function Enabled
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return Boolean
is
begin
return Get_Channel (This, Channel).EN;
end Enabled;
-------------
-- Disable --
-------------
procedure Disable
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector)
is
begin
Get_Channel (This, Channel).EN := False;
loop
exit when not Enabled (This, Channel);
end loop;
end Disable;
----------------------
-- Enable_Interrupt --
----------------------
procedure Enable_Interrupt
(This : DMA_Controller;
Channel : DMA_Channel_Selector;
Source : DMA_Interrupt)
is
Ch : CCR_Ptr := Get_Channel (This, Channel);
begin
case Source is
when Transfer_Error_Interrupt =>
Ch.TEIE := True;
when Half_Transfer_Complete_Interrupt =>
Ch.HTIE := True;
when Transfer_Complete_Interrupt =>
Ch.TCIE := True;
end case;
end Enable_Interrupt;
-----------------------
-- Disable_Interrupt --
-----------------------
procedure Disable_Interrupt
(This : DMA_Controller;
Channel : DMA_Channel_Selector;
Source : DMA_Interrupt)
is
Ch : CCR_Ptr := Get_Channel (This, Channel);
begin
case Source is
when Transfer_Error_Interrupt =>
Ch.TEIE := False;
when Half_Transfer_Complete_Interrupt =>
Ch.HTIE := False;
when Transfer_Complete_Interrupt =>
Ch.TCIE := False;
end case;
end Disable_Interrupt;
-----------------------
-- Interrupt_Enabled --
-----------------------
function Interrupt_Enabled
(This : DMA_Controller;
Channel : DMA_Channel_Selector;
Source : DMA_Interrupt)
return Boolean
is
Ch : CCR_Ptr := Get_Channel (This, Channel);
Result : Boolean := False;
begin
case Source is
when Transfer_Error_Interrupt =>
Result := Ch.TEIE;
when Half_Transfer_Complete_Interrupt =>
Result := Ch.HTIE;
when Transfer_Complete_Interrupt =>
Result := Ch.TCIE;
end case;
return Result;
end Interrupt_Enabled;
--------------------
-- Start_Transfer --
--------------------
procedure Start_Transfer
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector;
Source : Address;
Destination : Address;
Data_Count : UInt16)
is
begin
Disable (This, Channel);
Configure_Data_Flow
(This,
Channel,
Source => Source,
Destination => Destination,
Data_Count => Data_Count);
Enable (This, Channel);
end Start_Transfer;
------------------------------------
-- Start_Transfer_with_Interrupts --
------------------------------------
procedure Start_Transfer_with_Interrupts
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector;
Source : Address;
Destination : Address;
Data_Count : UInt16;
Enabled_Interrupts : Interrupt_Selections := (others => True))
is
begin
Disable (This, Channel);
Configure_Data_Flow
(This,
Channel,
Source => Source,
Destination => Destination,
Data_Count => Data_Count);
for Selected_Interrupt in Enabled_Interrupts'Range loop
if Enabled_Interrupts (Selected_Interrupt) then
Enable_Interrupt (This, Channel, Selected_Interrupt);
end if;
end loop;
Enable (This, Channel);
end Start_Transfer_with_Interrupts;
-------------------------
-- Configure_Data_Flow --
-------------------------
procedure Configure_Data_Flow
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector;
Source : Address;
Destination : Address;
Data_Count : UInt16)
is
function W is new Ada.Unchecked_Conversion
(Address, UInt32);
Addr1 : Address;
Addr2 : Address;
begin
if Get_Channel (This, Channel).DIR then
Addr1 := Source;
Addr2 := Destination;
else
Addr1 := Destination;
Addr2 := Source;
end if;
case Channel is
when Channel_1 =>
This.CNDTR1.NDT := Data_Count;
This.CMAR1 := W (Addr1);
This.CPAR1 := W (Addr2);
when Channel_2 =>
This.CNDTR2.NDT := Data_Count;
This.CMAR2 := W (Addr1);
This.CPAR2 := W (Addr2);
when Channel_3 =>
This.CNDTR3.NDT := Data_Count;
This.CMAR3 := W (Addr1);
This.CPAR3 := W (Addr2);
when Channel_4 =>
This.CNDTR4.NDT := Data_Count;
This.CMAR4 := W (Addr1);
This.CPAR4 := W (Addr2);
when Channel_5 =>
This.CNDTR5.NDT := Data_Count;
This.CMAR5 := W (Addr1);
This.CPAR5 := W (Addr2);
when Channel_6 =>
This.CNDTR6.NDT := Data_Count;
This.CMAR6 := W (Addr1);
This.CPAR6 := W (Addr2);
when Channel_7 =>
This.CNDTR7.NDT := Data_Count;
This.CMAR7 := W (Addr1);
This.CPAR7 := W (Addr2);
end case;
end Configure_Data_Flow;
--------------------
-- Abort_Transfer --
--------------------
procedure Abort_Transfer
(This : DMA_Controller;
Channel : DMA_Channel_Selector;
Result : out DMA_Error_Code)
is
begin
Result := DMA_No_Error;
end Abort_Transfer;
-------------------------
-- Poll_For_Completion --
-------------------------
procedure Poll_For_Completion
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector;
Expected_Level : DMA_Transfer_Level;
Timeout : Time_Span;
Result : out DMA_Error_Code)
is
begin
Result := DMA_No_Error; -- initially anyway
end Poll_For_Completion;
------------------
-- Clear_Status --
------------------
procedure Clear_Status
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector;
Flag : DMA_Status_Flag)
is
begin
case Flag is
when Transfer_Complete_Indicated =>
case Channel is
when Channel_1 =>
This.IFCR.CTCIF1 := True;
when Channel_2 =>
This.IFCR.CTCIF2 := True;
when Channel_3 =>
This.IFCR.CTCIF3 := True;
when Channel_4 =>
This.IFCR.CTCIF4 := True;
when Channel_5 =>
This.IFCR.CTCIF5 := True;
when Channel_6 =>
This.IFCR.CTCIF6 := True;
when Channel_7 =>
This.IFCR.CTCIF7 := True;
end case;
when Transfer_Error_Indicated =>
case Channel is
when Channel_1 =>
This.IFCR.CTEIF1 := True;
when Channel_2 =>
This.IFCR.CTEIF2 := True;
when Channel_3 =>
This.IFCR.CTEIF3 := True;
when Channel_4 =>
This.IFCR.CTEIF4 := True;
when Channel_5 =>
This.IFCR.CTEIF5 := True;
when Channel_6 =>
This.IFCR.CTEIF6 := True;
when Channel_7 =>
This.IFCR.CTEIF7 := True;
end case;
when Half_Transfer_Complete_Indicated =>
case Channel is
when Channel_1 =>
This.IFCR.CHTIF1 := True;
when Channel_2 =>
This.IFCR.CHTIF2 := True;
when Channel_3 =>
This.IFCR.CHTIF3 := True;
when Channel_4 =>
This.IFCR.CHTIF4 := True;
when Channel_5 =>
This.IFCR.CHTIF5 := True;
when Channel_6 =>
This.IFCR.CHTIF6 := True;
when Channel_7 =>
This.IFCR.CHTIF7 := True;
end case;
end case;
end Clear_Status;
----------------------
-- Clear_All_Status --
----------------------
procedure Clear_All_Status
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector)
is
begin
for Flag in DMA_Status_Flag'Range loop
Clear_Status (This, Channel, Flag);
end loop;
end Clear_All_Status;
------------
-- Status --
------------
function Status
(This : DMA_Controller;
Channel : DMA_Channel_Selector;
Flag : DMA_Status_Flag)
return Boolean
is
Result : Boolean := False;
begin
case Flag is
when Transfer_Complete_Indicated =>
case Channel is
when Channel_1 =>
Result := This.ISR.TCIF1;
when Channel_2 =>
Result := This.ISR.TCIF2;
when Channel_3 =>
Result := This.ISR.TCIF3;
when Channel_4 =>
Result := This.ISR.TCIF4;
when Channel_5 =>
Result := This.ISR.TCIF5;
when Channel_6 =>
Result := This.ISR.TCIF6;
when Channel_7 =>
Result := This.ISR.TCIF7;
end case;
when Transfer_Error_Indicated =>
case Channel is
when Channel_1 =>
Result := This.ISR.TEIF1;
when Channel_2 =>
Result := This.ISR.TEIF2;
when Channel_3 =>
Result := This.ISR.TEIF3;
when Channel_4 =>
Result := This.ISR.TEIF4;
when Channel_5 =>
Result := This.ISR.TEIF5;
when Channel_6 =>
Result := This.ISR.TEIF6;
when Channel_7 =>
Result := This.ISR.TEIF7;
end case;
when Half_Transfer_Complete_Indicated =>
case Channel is
when Channel_1 =>
Result := This.ISR.HTIF1;
when Channel_2 =>
Result := This.ISR.HTIF2;
when Channel_3 =>
Result := This.ISR.HTIF3;
when Channel_4 =>
Result := This.ISR.HTIF4;
when Channel_5 =>
Result := This.ISR.HTIF5;
when Channel_6 =>
Result := This.ISR.HTIF6;
when Channel_7 =>
Result := This.ISR.HTIF7;
end case;
end case;
return Result;
end Status;
-----------------
-- Set_Counter --
-----------------
procedure Set_NDT
(This : DMA_Controller;
Channel : DMA_Channel_Selector;
Data_Count : UInt16)
is
begin
null;
end Set_NDT;
function Items_Transferred
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return UInt16
is
begin
return 0;
end Items_Transferred;
function Current_NDT
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return UInt16
is
begin
return 0;
end Current_NDT;
-------------------
-- Circular_Mode --
-------------------
function Circular_Mode
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return Boolean
is
begin
return False;
end Circular_Mode;
---------------
-- Configure --
---------------
procedure Configure
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector;
Config : DMA_Channel_Configuration)
is
Ch : CCR_Ptr := Get_Channel (This, Channel);
begin
Disable (This, Channel);
case Config.Direction is
when Peripheral_To_Memory =>
Ch.DIR := False;
Ch.MEM2MEM := False;
when Memory_To_Peripheral =>
Ch.DIR := True;
Ch.MEM2MEM := False;
when Memory_To_Memory =>
Ch.MEM2MEM := True;
end case;
Ch.PINC := Config.Increment_Peripheral_Address;
Ch.MINC := Config.Increment_Memory_Address;
Ch.PSIZE :=
DMA_Data_Transfer_Widths'Enum_Rep (Config.Peripheral_Data_Format);
Ch.MSIZE :=
DMA_Data_Transfer_Widths'Enum_Rep (Config.Memory_Data_Format);
Ch.PL :=
DMA_Priority_Level'Enum_Rep (Config.Priority);
if Config.Operation_Mode = Circular_Mode then
Ch.CIRC := True; -- Enable circular mode
end if;
end Configure;
-----------
-- Reset --
-----------
procedure Reset
(This : in out DMA_Controller;
Channel : DMA_Channel_Selector)
is
begin
Disable (This, Channel);
-- This_Stream.CR := (others => <>);
-- This_Stream.NDTR.NDT := 0;
-- This_Stream.PAR := 0;
-- This_Stream.M0AR := 0;
-- This_Stream.M1AR := 0;
-- This_Stream.FCR := (others => <>);
Clear_All_Status (This, Channel);
end Reset;
---------------------------
-- Peripheral_Data_Width --
---------------------------
function Peripheral_Data_Width
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return DMA_Data_Transfer_Widths
is
Size : UInt2;
begin
case Channel is
when Channel_1 =>
Size := This.CCR1.PSIZE;
when Channel_2 =>
Size := This.CCR2.PSIZE;
when Channel_3 =>
Size := This.CCR3.PSIZE;
when Channel_4 =>
Size := This.CCR4.PSIZE;
when Channel_5 =>
Size := This.CCR5.PSIZE;
when Channel_6 =>
Size := This.CCR6.PSIZE;
when Channel_7 =>
Size := This.CCR7.PSIZE;
end case;
return DMA_Data_Transfer_Widths'Val (Size);
end Peripheral_Data_Width;
-----------------------
-- Memory_Data_Width --
-----------------------
function Memory_Data_Width
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return DMA_Data_Transfer_Widths
is
begin
return DMA_Data_Transfer_Widths'Val
(Get_Channel (This, Channel).MSIZE);
end Memory_Data_Width;
------------------------
-- Transfer_Direction --
------------------------
function Transfer_Direction
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return DMA_Data_Transfer_Direction
is
Dir : Boolean := Get_Channel (This, Channel).DIR;
begin
return DMA_Data_Transfer_Direction'Val (To_Bit (Dir));
end Transfer_Direction;
--------------------
-- Operating_Mode --
--------------------
function Operating_Mode
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return DMA_Mode
is
begin
if Get_Channel (This, Channel).CIRC then
return Circular_Mode;
end if;
return Normal_Mode;
end Operating_Mode;
--------------
-- Priority --
--------------
function Priority
(This : DMA_Controller;
Channel : DMA_Channel_Selector)
return DMA_Priority_Level
is
begin
return DMA_Priority_Level'Val (Get_Channel (This, Channel).PL);
end Priority;
-------------
-- Aligned --
-------------
function Aligned (This : Address;
Width : DMA_Data_Transfer_Widths)
return Boolean
is
use System.Storage_Elements;
begin
return True;
end Aligned;
end STM32.DMA;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Matreshka.Atomics.Counters;
with Matreshka.JSON_Types;
package Matreshka.JSON_Documents is
pragma Preelaborate;
type Shared_JSON_Document is limited record
Counter : Matreshka.Atomics.Counters.Counter;
Array_Value : Matreshka.JSON_Types.Shared_JSON_Array_Access;
Object_Value : Matreshka.JSON_Types.Shared_JSON_Object_Access;
end record;
type Shared_JSON_Document_Access is access all Shared_JSON_Document;
Empty_Shared_JSON_Document : aliased Shared_JSON_Document
:= (Counter => <>, Array_Value => null, Object_Value => null);
procedure Reference (Self : not null Shared_JSON_Document_Access);
-- Increments internal reference counter.
procedure Dereference (Self : in out Shared_JSON_Document_Access);
-- Decrements internal reference counter and deallocates shared document
-- when counter reach zero. Sets Self to null.
procedure Mutate (Self : in out not null Shared_JSON_Document_Access);
-- Mutate object: new shared object is allocated when reference counter is
-- greater than one, reference counter of original object is decremented
-- and original value is copied. Otherwise, shared object is unchanged.
end Matreshka.JSON_Documents;
|
------------------------------------------------------------------------------
-- Copyright (c) 2014, Natacha Porté --
-- --
-- Permission to use, copy, modify, and 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. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.S_Expressions.Atom_Buffers implements an unbounded Atom designed --
-- to be used as an input buffer, accumulating data and extracting it as a --
-- single Atom object. --
-- It also provides an individual Octet accessor, used in parser internal --
-- recursive buffer. --
------------------------------------------------------------------------------
with Natools.S_Expressions.Atom_Refs;
package Natools.S_Expressions.Atom_Buffers is
pragma Preelaborate (Atom_Buffers);
type Atom_Buffer is new Ada.Streams.Root_Stream_Type with private;
pragma Preelaborable_Initialization (Atom_Buffer);
overriding procedure Write
(Buffer : in out Atom_Buffer;
Item : in Ada.Streams.Stream_Element_Array);
overriding procedure Read
(Buffer : in out Atom_Buffer;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
procedure Preallocate (Buffer : in out Atom_Buffer; Length : in Count);
-- Preallocate enough memory to append Length octets without
-- any further allocation.
procedure Append (Buffer : in out Atom_Buffer; Data : in Atom);
procedure Append (Buffer : in out Atom_Buffer; Data : in Octet);
-- Append Data after the end of Buffer
procedure Append_Reverse (Buffer : in out Atom_Buffer; Data : in Atom);
-- Append bytes from Atom from last to first
procedure Invert (Buffer : in out Atom_Buffer);
-- Invert the order of bytes (first becomes last, etc)
function Length (Buffer : Atom_Buffer) return Count;
function Capacity (Buffer : Atom_Buffer) return Count;
function Data (Buffer : Atom_Buffer) return Atom;
procedure Query
(Buffer : in Atom_Buffer;
Process : not null access procedure (Data : in Atom));
procedure Peek
(Buffer : in Atom_Buffer;
Data : out Atom;
Length : out Count);
function Element (Buffer : Atom_Buffer; Position : Count) return Octet;
-- Accessors to the whole buffer as an Atom
procedure Pop (Buffer : in out Atom_Buffer; Data : out Octet);
-- Remove last octet from Buffer and store it in Data
function Raw_Query (Buffer : Atom_Buffer) return Atom_Refs.Accessor;
-- Accessor to the whole allocated memory
procedure Hard_Reset (Buffer : in out Atom_Buffer);
-- Clear buffer and release internal memory
procedure Soft_Reset (Buffer : in out Atom_Buffer);
-- Clear buffer keeping internal memory
private
type Atom_Buffer is new Ada.Streams.Root_Stream_Type with record
Ref : Atom_Refs.Reference;
Available, Used : Count := 0;
end record;
end Natools.S_Expressions.Atom_Buffers;
|
------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2013, 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 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. --
-- --
-- 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; use System;
with Interfaces; use Interfaces;
package Nettftp is
procedure Open;
procedure Read (Off : Unsigned_32;
Data : Address;
Count : in out Natural);
procedure Close;
end Nettftp;
|
--------------------------------------------------------------------------------
-- Copyright (C) 2020 by Heisenbug Ltd. (gh+owm@heisenbug.eu)
--
-- This work is free. You can redistribute it and/or modify it under the
-- terms of the Do What The Fuck You Want To Public License, Version 2,
-- as published by Sam Hocevar. See the LICENSE file for more details.
--------------------------------------------------------------------------------
pragma License (Unrestricted);
--------------------------------------------------------------------------------
--% @summary
--% Open_Weather_Map.API.Query (private)
--
--% @description
--% Provides the abstract tagged type implementing a context where query timings
--% are stored.
--------------------------------------------------------------------------------
private package Open_Weather_Map.API.Query is
-----------------------------------------------------------------------------
-- Abstract context base type, and its primitive operations.
-----------------------------------------------------------------------------
type T is abstract new Open_Weather_Map.API.T with private;
-----------------------------------------------------------------------------
-- Initialize
-----------------------------------------------------------------------------
procedure Initialize (Self : out T);
--% Initializes the object.
--
--% @param Self
--% The object to be initialized.
-----------------------------------------------------------------------------
-- Last_Query
-----------------------------------------------------------------------------
overriding function Last_Query (Self : in T) return Ada.Real_Time.Time with
Inline => True;
--% Returns the time of the last query done with that context.
--
--% @param Self
--% The object to retrive its last update time from.
--
--% @return
--% Time of the last server update for This.
-----------------------------------------------------------------------------
-- Set_Last_Query
-----------------------------------------------------------------------------
procedure Set_Last_Query (Self : in out T;
Value : in Ada.Real_Time.Time);
--% Sets a new last time a query has been executed. Should be called by
--% derived types whenever a query is about to be performed.
--
--% @param Self
--% The object to be updated.
--
--% @param Value
--% The new time to be set for the last update being performed.
private
type T is abstract new Open_Weather_Map.API.T with
record
Last_Query : Ada.Real_Time.Time;
--% @field Last_Query
--% Stores the last time the object has been updated from the server.
-- Used to implement and caching and rate limiting.
end record;
-----------------------------------------------------------------------------
-- Last_Query
-----------------------------------------------------------------------------
overriding function Last_Query (Self : in T) return Ada.Real_Time.Time is
(Self.Last_Query);
end Open_Weather_Map.API.Query;
|
with Ada.Containers.Vectors;
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Sockets; use Sockets;
procedure Chat_Server is
package Client_Vectors is new Ada.Containers.Vectors
(Element_Type => Socket_FD, Index_Type => Positive);
All_Clients : Client_Vectors.Vector;
procedure Write (S : String) is
procedure Output (Position : Client_Vectors.Cursor) is
Sock : Socket_FD := Client_Vectors.Element (Position);
begin
Put_Line (Sock, S);
end Output;
begin
All_Clients.Iterate (Output'Access);
end Write;
task type Client_Task is
entry Start (FD : Socket_FD);
end Client_Task;
task body Client_Task is
Sock : Socket_FD;
Sock_ID : Positive;
Name : Unbounded_String;
begin
select
accept Start (FD : Socket_FD) do
Sock := FD;
end Start;
or
terminate;
end select;
while Name = Null_Unbounded_String loop
Put (Sock, "Enter Name:");
Name := To_Unbounded_String (Get_Line (Sock));
end loop;
Write (To_String (Name) & " joined.");
All_Clients.Append (Sock);
Sock_ID := All_Clients.Find_Index (Sock);
loop
declare
Input : String := Get_Line (Sock);
begin
Write (To_String (Name) & ": " & Input);
end;
end loop;
exception
when Connection_Closed =>
Put_Line ("Connection closed");
Shutdown (Sock, Both);
All_Clients.Delete (Sock_ID);
Write (To_String (Name) & " left.");
end Client_Task;
Accepting_Socket : Socket_FD;
Incoming_Socket : Socket_FD;
type Client_Access is access Client_Task;
Dummy : Client_Access;
begin
if Argument_Count /= 1 then
Raise_Exception (Constraint_Error'Identity,
"Usage: " & Command_Name & " port");
end if;
Socket (Accepting_Socket, PF_INET, SOCK_STREAM);
Setsockopt (Accepting_Socket, SOL_SOCKET, SO_REUSEADDR, 1);
Bind (Accepting_Socket, Positive'Value (Argument (1)));
Listen (Accepting_Socket);
loop
Put_Line ("Waiting for new connection");
Accept_Socket (Accepting_Socket, Incoming_Socket);
Put_Line ("New connection acknowledged");
Dummy := new Client_Task;
Dummy.Start (Incoming_Socket);
end loop;
end Chat_Server;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . R E L A T I V E _ D E L A Y S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2016-2021, 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. --
-- --
-- --
-- --
-- --
-- --
-- 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 Ada.Real_Time; use Ada.Real_Time;
package body System.Relative_Delays is
procedure Delay_For (D : Duration) is
begin
-- Simple expression, not very efficient as the implementation of
-- delay until also reads the clock.
delay until Clock + To_Time_Span (D);
end Delay_For;
end System.Relative_Delays;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2019-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 System;
with HAL;
private with SAM_SVD.ADC;
package SAM.ADC is
type ADC_Internal is private;
type ADC_Device
(Periph : not null access ADC_Internal)
is tagged private;
type Conversion_Resolution is (Res_12bit, Res_16bit, Res_10bit, Res_8bit);
type Reference_Kind is (Internal_Bandgap, Half_VDDANA, VDDANA,
External_A, External_B, External_C);
type Prescaler_Kind is (Pre_2, Pre_4, Pre_8, Pre_16,
Pre_32, Pre_64, Pre_128, Pre_256);
procedure Configure (This : in out ADC_Device;
Resolution : Conversion_Resolution;
Reference : Reference_Kind;
Prescaler : Prescaler_Kind;
Free_Running : Boolean;
Differential_Mode : Boolean;
Window_Monitor_Event_Out : Boolean := False;
Result_Ready_Event_Out : Boolean := False;
Start_Conversion_Event_Invert : Boolean := False;
Flush_Event_Invert : Boolean := False;
Start_Conversion_Event_Input : Boolean := False;
Flush_Event_Input : Boolean := False);
procedure Enable (This : in out ADC_Device);
-- Enable the ADC channel
procedure Disable (This : in out ADC_Device);
-- Disable the ADC channel
type Negative_Selection is (AIN0, AIN1, AIN2, AIN3, AIN4, AIN5, AIN6, AIN7,
GND);
type Positive_Selection is (AIN0, AIN1, AIN2, AIN3, AIN4, AIN5, AIN6, AIN7,
AIN8, AIN9, AIN10, AIN11, AIN12, AIN13, AIN14,
AIN15, AIN16, AIN17, AIN18, AIN19, AIN20, AIN21,
AIN22, AIN23,
SCALEDCOREVCC, SCALEDVBAT, SCALEDIOVCC,
BANDGAP, PTAT, CTAT, DAC);
procedure Set_Inputs (This : in out ADC_Device;
Negative : Negative_Selection;
Positive : Positive_Selection);
-- Set the negative and positive inputs for the conversion
procedure Software_Start (This : in out ADC_Device);
-- Start a conversion
function Conversion_Done (This : in out ADC_Device) return Boolean;
-- Return True if the conversion is done
function Result (This : in out ADC_Device) return HAL.UInt16;
-- Return the result of a conversion
-- DMA --
function Result_Address (This : ADC_Device) return System.Address;
-- Return the address of the result register for DMA transfers
private
type ADC_Internal is new SAM_SVD.ADC.ADC_Peripheral;
type ADC_Device
(Periph : not null access ADC_Internal)
is tagged null record;
for Conversion_Resolution use (Res_12bit => 0,
Res_16bit => 1,
Res_10bit => 2,
Res_8bit => 3);
for Reference_Kind use (Internal_Bandgap => 0,
Half_VDDANA => 2,
VDDANA => 3,
External_A => 4,
External_B => 5,
External_C => 6);
for Negative_Selection use (AIN0 => 16#00#,
AIN1 => 16#01#,
AIN2 => 16#02#,
AIN3 => 16#03#,
AIN4 => 16#04#,
AIN5 => 16#05#,
AIN6 => 16#06#,
AIN7 => 16#07#,
GND => 16#18#);
for Positive_Selection use (AIN0 => 16#00#,
AIN1 => 16#01#,
AIN2 => 16#02#,
AIN3 => 16#03#,
AIN4 => 16#04#,
AIN5 => 16#05#,
AIN6 => 16#06#,
AIN7 => 16#07#,
AIN8 => 16#08#,
AIN9 => 16#09#,
AIN10 => 16#0A#,
AIN11 => 16#0B#,
AIN12 => 16#0C#,
AIN13 => 16#0D#,
AIN14 => 16#0E#,
AIN15 => 16#0F#,
AIN16 => 16#10#,
AIN17 => 16#11#,
AIN18 => 16#12#,
AIN19 => 16#13#,
AIN20 => 16#14#,
AIN21 => 16#15#,
AIN22 => 16#16#,
AIN23 => 16#17#,
SCALEDCOREVCC => 16#18#,
SCALEDVBAT => 16#19#,
SCALEDIOVCC => 16#1A#,
BANDGAP => 16#1B#,
PTAT => 16#1C#,
CTAT => 16#1D#,
DAC => 16#1E#);
end SAM.ADC;
|
------------------------------------------------------------------------------
-- --
-- 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.Generic_Collections;
package AMF.UMLDI.UML_Class_Or_Composite_Structure_Diagrams.Collections is
pragma Preelaborate;
package UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections is
new AMF.Generic_Collections
(UMLDI_UML_Class_Or_Composite_Structure_Diagram,
UMLDI_UML_Class_Or_Composite_Structure_Diagram_Access);
type Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Set with null record;
Empty_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
type Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
type Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Bag with null record;
Empty_Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
type Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Sequence with null record;
Empty_Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
private
Empty_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Set with null record);
Empty_Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Ordered_Set with null record);
Empty_Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Bag with null record);
Empty_Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Sequence with null record);
end AMF.UMLDI.UML_Class_Or_Composite_Structure_Diagrams.Collections;
|
------------------------------------------------------------------------------
-- --
-- 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_Primitive_Types is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type
(AMF.UML.Primitive_Types.UML_Primitive_Type_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type
(AMF.UML.Primitive_Types.UML_Primitive_Type_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type
(Visitor,
AMF.UML.Primitive_Types.UML_Primitive_Type_Access (Self),
Control);
end if;
end Visit_Element;
-------------------------
-- Get_Owned_Attribute --
-------------------------
overriding function Get_Owned_Attribute
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Properties.Collections.Ordered_Set_Of_UML_Property is
begin
return
AMF.UML.Properties.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Attribute
(Self.Element)));
end Get_Owned_Attribute;
-------------------------
-- Get_Owned_Operation --
-------------------------
overriding function Get_Owned_Operation
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Operations.Collections.Ordered_Set_Of_UML_Operation is
begin
return
AMF.UML.Operations.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Operation
(Self.Element)));
end Get_Owned_Operation;
-------------------
-- Get_Attribute --
-------------------
overriding function Get_Attribute
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property is
begin
return
AMF.UML.Properties.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Attribute
(Self.Element)));
end Get_Attribute;
---------------------------
-- Get_Collaboration_Use --
---------------------------
overriding function Get_Collaboration_Use
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Collaboration_Uses.Collections.Set_Of_UML_Collaboration_Use is
begin
return
AMF.UML.Collaboration_Uses.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Collaboration_Use
(Self.Element)));
end Get_Collaboration_Use;
-----------------
-- Get_Feature --
-----------------
overriding function Get_Feature
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
return
AMF.UML.Features.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Feature
(Self.Element)));
end Get_Feature;
-----------------
-- Get_General --
-----------------
overriding function Get_General
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_General
(Self.Element)));
end Get_General;
------------------------
-- Get_Generalization --
------------------------
overriding function Get_Generalization
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization is
begin
return
AMF.UML.Generalizations.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Generalization
(Self.Element)));
end Get_Generalization;
--------------------------
-- Get_Inherited_Member --
--------------------------
overriding function Get_Inherited_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Inherited_Member
(Self.Element)));
end Get_Inherited_Member;
---------------------
-- Get_Is_Abstract --
---------------------
overriding function Get_Is_Abstract
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Abstract
(Self.Element);
end Get_Is_Abstract;
---------------------------------
-- Get_Is_Final_Specialization --
---------------------------------
overriding function Get_Is_Final_Specialization
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Final_Specialization
(Self.Element);
end Get_Is_Final_Specialization;
---------------------------------
-- Set_Is_Final_Specialization --
---------------------------------
overriding procedure Set_Is_Final_Specialization
(Self : not null access UML_Primitive_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Final_Specialization
(Self.Element, To);
end Set_Is_Final_Specialization;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access is
begin
return
AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
------------------------
-- Get_Owned_Use_Case --
------------------------
overriding function Get_Owned_Use_Case
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Use_Case
(Self.Element)));
end Get_Owned_Use_Case;
--------------------------
-- Get_Powertype_Extent --
--------------------------
overriding function Get_Powertype_Extent
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Generalization_Sets.Collections.Set_Of_UML_Generalization_Set is
begin
return
AMF.UML.Generalization_Sets.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Powertype_Extent
(Self.Element)));
end Get_Powertype_Extent;
------------------------------
-- Get_Redefined_Classifier --
------------------------------
overriding function Get_Redefined_Classifier
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefined_Classifier
(Self.Element)));
end Get_Redefined_Classifier;
------------------------
-- Get_Representation --
------------------------
overriding function Get_Representation
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access is
begin
return
AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Representation
(Self.Element)));
end Get_Representation;
------------------------
-- Set_Representation --
------------------------
overriding procedure Set_Representation
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Representation
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Representation;
----------------------
-- Get_Substitution --
----------------------
overriding function Get_Substitution
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Substitutions.Collections.Set_Of_UML_Substitution is
begin
return
AMF.UML.Substitutions.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Substitution
(Self.Element)));
end Get_Substitution;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access is
begin
return
AMF.UML.Classifier_Template_Parameters.UML_Classifier_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_Primitive_Type_Proxy;
To : AMF.UML.Classifier_Template_Parameters.UML_Classifier_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;
------------------
-- Get_Use_Case --
------------------
overriding function Get_Use_Case
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Use_Case
(Self.Element)));
end Get_Use_Case;
------------------------
-- Get_Element_Import --
------------------------
overriding function Get_Element_Import
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import is
begin
return
AMF.UML.Element_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Element_Import
(Self.Element)));
end Get_Element_Import;
-------------------------
-- Get_Imported_Member --
-------------------------
overriding function Get_Imported_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
return
AMF.UML.Packageable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Imported_Member
(Self.Element)));
end Get_Imported_Member;
----------------
-- Get_Member --
----------------
overriding function Get_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Member
(Self.Element)));
end Get_Member;
----------------------
-- Get_Owned_Member --
----------------------
overriding function Get_Owned_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Member
(Self.Element)));
end Get_Owned_Member;
--------------------
-- Get_Owned_Rule --
--------------------
overriding function Get_Owned_Rule
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint is
begin
return
AMF.UML.Constraints.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Rule
(Self.Element)));
end Get_Owned_Rule;
------------------------
-- Get_Package_Import --
------------------------
overriding function Get_Package_Import
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import is
begin
return
AMF.UML.Package_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Package_Import
(Self.Element)));
end Get_Package_Import;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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_Package --
-----------------
overriding function Get_Package
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Packages.UML_Package_Access is
begin
return
AMF.UML.Packages.UML_Package_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Package
(Self.Element)));
end Get_Package;
-----------------
-- Set_Package --
-----------------
overriding procedure Set_Package
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Packages.UML_Package_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Package
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Package;
-----------------------------------
-- Get_Owning_Template_Parameter --
-----------------------------------
overriding function Get_Owning_Template_Parameter
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Template_Signatures.UML_Template_Signature_Access is
begin
return
AMF.UML.Template_Signatures.UML_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access UML_Primitive_Type_Proxy;
To : AMF.UML.Template_Signatures.UML_Template_Signature_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
--------------------------
-- Get_Template_Binding --
--------------------------
overriding function Get_Template_Binding
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Template_Bindings.Collections.Set_Of_UML_Template_Binding is
begin
return
AMF.UML.Template_Bindings.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Template_Binding
(Self.Element)));
end Get_Template_Binding;
-----------------
-- Get_Is_Leaf --
-----------------
overriding function Get_Is_Leaf
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Leaf
(Self.Element);
end Get_Is_Leaf;
-----------------
-- Set_Is_Leaf --
-----------------
overriding procedure Set_Is_Leaf
(Self : not null access UML_Primitive_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Leaf
(Self.Element, To);
end Set_Is_Leaf;
---------------------------
-- Get_Redefined_Element --
---------------------------
overriding function Get_Redefined_Element
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element is
begin
return
AMF.UML.Redefinable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefined_Element
(Self.Element)));
end Get_Redefined_Element;
------------------------------
-- Get_Redefinition_Context --
------------------------------
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Redefinition_Context
(Self.Element)));
end Get_Redefinition_Context;
-------------
-- Inherit --
-------------
overriding function Inherit
(Self : not null access constant UML_Primitive_Type_Proxy;
Inhs : AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherit unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Inherit";
return Inherit (Self, Inhs);
end Inherit;
------------------
-- All_Features --
------------------
overriding function All_Features
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Features unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.All_Features";
return All_Features (Self);
end All_Features;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant UML_Primitive_Type_Proxy;
Other : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
-------------
-- General --
-------------
overriding function General
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "General unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.General";
return General (Self);
end General;
-----------------------
-- Has_Visibility_Of --
-----------------------
overriding function Has_Visibility_Of
(Self : not null access constant UML_Primitive_Type_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Has_Visibility_Of unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Has_Visibility_Of";
return Has_Visibility_Of (Self, N);
end Has_Visibility_Of;
-------------------------
-- Inheritable_Members --
-------------------------
overriding function Inheritable_Members
(Self : not null access constant UML_Primitive_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inheritable_Members unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Inheritable_Members";
return Inheritable_Members (Self, C);
end Inheritable_Members;
----------------------
-- Inherited_Member --
----------------------
overriding function Inherited_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherited_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Inherited_Member";
return Inherited_Member (Self);
end Inherited_Member;
-----------------
-- Is_Template --
-----------------
overriding function Is_Template
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Is_Template";
return Is_Template (Self);
end Is_Template;
-------------------------
-- May_Specialize_Type --
-------------------------
overriding function May_Specialize_Type
(Self : not null access constant UML_Primitive_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "May_Specialize_Type unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.May_Specialize_Type";
return May_Specialize_Type (Self, C);
end May_Specialize_Type;
------------------------
-- Exclude_Collisions --
------------------------
overriding function Exclude_Collisions
(Self : not null access constant UML_Primitive_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Exclude_Collisions unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Exclude_Collisions";
return Exclude_Collisions (Self, Imps);
end Exclude_Collisions;
-------------------------
-- Get_Names_Of_Member --
-------------------------
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Primitive_Type_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Get_Names_Of_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Get_Names_Of_Member";
return Get_Names_Of_Member (Self, Element);
end Get_Names_Of_Member;
--------------------
-- Import_Members --
--------------------
overriding function Import_Members
(Self : not null access constant UML_Primitive_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Import_Members unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Import_Members";
return Import_Members (Self, Imps);
end Import_Members;
---------------------
-- Imported_Member --
---------------------
overriding function Imported_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Imported_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Imported_Member";
return Imported_Member (Self);
end Imported_Member;
---------------------------------
-- Members_Are_Distinguishable --
---------------------------------
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Primitive_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Members_Are_Distinguishable unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Members_Are_Distinguishable";
return Members_Are_Distinguishable (Self);
end Members_Are_Distinguishable;
------------------
-- Owned_Member --
------------------
overriding function Owned_Member
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Owned_Member unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Owned_Member";
return Owned_Member (Self);
end Owned_Member;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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_Primitive_Type_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_Primitive_Type_Proxy.Namespace";
return Namespace (Self);
end Namespace;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant UML_Primitive_Type_Proxy;
Other : AMF.UML.Types.UML_Type_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
------------------------
-- Is_Compatible_With --
------------------------
overriding function Is_Compatible_With
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type_Proxy.Is_Compatible_With";
return Is_Compatible_With (Self, P);
end Is_Compatible_With;
---------------------------
-- Is_Template_Parameter --
---------------------------
overriding function Is_Template_Parameter
(Self : not null access constant UML_Primitive_Type_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_Primitive_Type_Proxy.Is_Template_Parameter";
return Is_Template_Parameter (Self);
end Is_Template_Parameter;
----------------------------
-- Parameterable_Elements --
----------------------------
overriding function Parameterable_Elements
(Self : not null access constant UML_Primitive_Type_Proxy)
return AMF.UML.Parameterable_Elements.Collections.Set_Of_UML_Parameterable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Parameterable_Elements unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Parameterable_Elements";
return Parameterable_Elements (Self);
end Parameterable_Elements;
------------------------
-- Is_Consistent_With --
------------------------
overriding function Is_Consistent_With
(Self : not null access constant UML_Primitive_Type_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Consistent_With unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Is_Consistent_With";
return Is_Consistent_With (Self, Redefinee);
end Is_Consistent_With;
-----------------------------------
-- Is_Redefinition_Context_Valid --
-----------------------------------
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Primitive_Type_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Redefinition_Context_Valid unimplemented");
raise Program_Error with "Unimplemented procedure UML_Primitive_Type_Proxy.Is_Redefinition_Context_Valid";
return Is_Redefinition_Context_Valid (Self, Redefined);
end Is_Redefinition_Context_Valid;
end AMF.Internals.UML_Primitive_Types;
|
-------------------------------------------------------------------------------
-- 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.Grammar.Symbol.LogoForward is
procedure Initialize (This : out Instance)
is
begin
This := Instance '(Representation => 'f');
end Initialize;
procedure Interpret (This : in out Instance;
T : in out Holder)
is
pragma Unreferenced (This);
begin
T.Reference.Forward;
end Interpret;
end LSE.Model.Grammar.Symbol.LogoForward;
|
package GESTE_Fonts.FreeMonoBold24pt7b is
Font : constant Bitmap_Font_Ref;
private
FreeMonoBold24pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#0F#, 16#C0#, 16#00#, 16#7C#, 16#3F#, 16#00#, 16#01#, 16#F0#, 16#FC#,
16#00#, 16#07#, 16#C3#, 16#E0#, 16#00#, 16#1F#, 16#0F#, 16#80#, 16#00#,
16#7C#, 16#1E#, 16#00#, 16#01#, 16#F0#, 16#78#, 16#00#, 16#07#, 16#C1#,
16#E0#, 16#00#, 16#1E#, 16#07#, 16#80#, 16#00#, 16#38#, 16#1E#, 16#00#,
16#00#, 16#E0#, 16#78#, 16#00#, 16#03#, 16#81#, 16#C0#, 16#00#, 16#0E#,
16#07#, 16#00#, 16#00#, 16#38#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#38#,
16#00#, 16#01#, 16#E1#, 16#F0#, 16#00#, 16#07#, 16#C7#, 16#C0#, 16#00#,
16#1E#, 16#1F#, 16#00#, 16#00#, 16#78#, 16#78#, 16#00#, 16#01#, 16#E1#,
16#E0#, 16#00#, 16#0F#, 16#87#, 16#80#, 16#00#, 16#3E#, 16#3E#, 16#00#,
16#00#, 16#F8#, 16#F8#, 16#00#, 16#03#, 16#E3#, 16#E0#, 16#00#, 16#7F#,
16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#,
16#80#, 16#3F#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#F0#, 16#00#,
16#3E#, 16#3E#, 16#00#, 16#00#, 16#F8#, 16#F8#, 16#00#, 16#03#, 16#C3#,
16#C0#, 16#00#, 16#0F#, 16#0F#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#80#,
16#1F#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FC#, 16#01#, 16#FF#,
16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#01#, 16#F1#, 16#F0#,
16#00#, 16#07#, 16#C7#, 16#C0#, 16#00#, 16#1F#, 16#1F#, 16#00#, 16#00#,
16#7C#, 16#7C#, 16#00#, 16#01#, 16#F1#, 16#F0#, 16#00#, 16#07#, 16#C7#,
16#C0#, 16#00#, 16#1F#, 16#1F#, 16#00#, 16#00#, 16#78#, 16#7C#, 16#00#,
16#01#, 16#E1#, 16#E0#, 16#00#, 16#07#, 16#87#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#7F#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#1F#,
16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#F0#, 16#7E#,
16#00#, 16#1F#, 16#80#, 16#F8#, 16#00#, 16#7C#, 16#01#, 16#E0#, 16#01#,
16#F0#, 16#07#, 16#80#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#FC#,
16#00#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#,
16#00#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#,
16#1F#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#07#, 16#00#, 16#1F#,
16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#,
16#E0#, 16#0F#, 16#C0#, 16#0F#, 16#E0#, 16#7F#, 16#00#, 16#3F#, 16#FF#,
16#F8#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#FE#, 16#00#,
16#07#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#1E#, 16#1E#, 16#00#, 16#00#, 16#F0#, 16#38#, 16#00#, 16#03#,
16#80#, 16#E0#, 16#00#, 16#0E#, 16#03#, 16#80#, 16#00#, 16#38#, 16#0E#,
16#00#, 16#00#, 16#F0#, 16#38#, 16#00#, 16#01#, 16#E1#, 16#E0#, 16#00#,
16#03#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#3C#, 16#00#, 16#0F#,
16#87#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#F0#,
16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#03#,
16#F0#, 16#7C#, 16#00#, 16#0E#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#3F#,
16#F0#, 16#00#, 16#01#, 16#F1#, 16#E0#, 16#00#, 16#07#, 16#03#, 16#C0#,
16#00#, 16#1C#, 16#07#, 16#00#, 16#00#, 16#70#, 16#1C#, 16#00#, 16#01#,
16#C0#, 16#70#, 16#00#, 16#07#, 16#03#, 16#C0#, 16#00#, 16#1E#, 16#1E#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#C0#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#,
16#01#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#C7#, 16#80#, 16#00#, 16#3E#,
16#08#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#F8#,
16#00#, 16#00#, 16#7F#, 16#E3#, 16#E0#, 16#01#, 16#FF#, 16#CF#, 16#C0#,
16#0F#, 16#DF#, 16#FF#, 16#00#, 16#3E#, 16#3F#, 16#F8#, 16#00#, 16#F0#,
16#FF#, 16#C0#, 16#03#, 16#C1#, 16#FE#, 16#00#, 16#0F#, 16#03#, 16#F8#,
16#00#, 16#3E#, 16#0F#, 16#E0#, 16#00#, 16#FC#, 16#3F#, 16#E0#, 16#03#,
16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#00#, 16#0F#, 16#FF#,
16#FC#, 16#00#, 16#1F#, 16#FB#, 16#E0#, 16#00#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#7E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#01#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#83#, 16#C0#, 16#00#, 16#0F#, 16#CF#, 16#3F#,
16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#01#,
16#FF#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#FF#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#,
16#00#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#E7#, 16#E0#, 16#00#, 16#1F#,
16#0F#, 16#80#, 16#00#, 16#7C#, 16#3E#, 16#00#, 16#00#, 16#E0#, 16#78#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#FF#,
16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#, 16#FF#, 16#FC#, 16#07#,
16#FF#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#E0#,
16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#,
16#FF#, 16#FC#, 16#07#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#60#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#3F#, 16#FE#, 16#00#,
16#01#, 16#FF#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#7F#,
16#0F#, 16#E0#, 16#01#, 16#F8#, 16#0F#, 16#80#, 16#07#, 16#C0#, 16#3E#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#,
16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#0F#, 16#00#, 16#3E#, 16#00#,
16#3C#, 16#00#, 16#F8#, 16#00#, 16#F0#, 16#03#, 16#E0#, 16#03#, 16#C0#,
16#0F#, 16#80#, 16#0F#, 16#00#, 16#3E#, 16#00#, 16#3C#, 16#00#, 16#F8#,
16#00#, 16#F0#, 16#03#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#,
16#E0#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#3E#, 16#00#, 16#1F#, 16#80#,
16#F8#, 16#00#, 16#3F#, 16#0F#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#00#,
16#01#, 16#FF#, 16#F8#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#03#,
16#FB#, 16#C0#, 16#00#, 16#0F#, 16#8F#, 16#00#, 16#00#, 16#3C#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#7F#,
16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#,
16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#,
16#FF#, 16#FE#, 16#00#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#,
16#F0#, 16#00#, 16#FE#, 16#0F#, 16#E0#, 16#03#, 16#E0#, 16#0F#, 16#80#,
16#1F#, 16#80#, 16#3E#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#E0#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#1F#,
16#C0#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#0E#,
16#00#, 16#7F#, 16#00#, 16#7C#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#07#,
16#FF#, 16#FF#, 16#C0#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#,
16#FC#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#00#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#FE#, 16#00#,
16#07#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#F8#, 16#00#, 16#7C#,
16#07#, 16#E0#, 16#01#, 16#C0#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#7F#,
16#F0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#FC#, 16#00#,
16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#,
16#0F#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#10#, 16#00#,
16#7C#, 16#01#, 16#F0#, 16#07#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#80#,
16#1F#, 16#FF#, 16#FE#, 16#00#, 16#3F#, 16#FF#, 16#F0#, 16#00#, 16#7F#,
16#FF#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#F8#,
16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#7F#,
16#E0#, 16#00#, 16#03#, 16#EF#, 16#80#, 16#00#, 16#1F#, 16#BE#, 16#00#,
16#00#, 16#7C#, 16#F8#, 16#00#, 16#03#, 16#E3#, 16#E0#, 16#00#, 16#0F#,
16#8F#, 16#80#, 16#00#, 16#7C#, 16#3E#, 16#00#, 16#03#, 16#E0#, 16#F8#,
16#00#, 16#0F#, 16#83#, 16#E0#, 16#00#, 16#7C#, 16#0F#, 16#80#, 16#03#,
16#F0#, 16#3E#, 16#00#, 16#0F#, 16#FF#, 16#FE#, 16#00#, 16#3F#, 16#FF#,
16#FC#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#C0#,
16#0F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#FF#, 16#E0#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#1F#, 16#FF#,
16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#,
16#FF#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#,
16#F0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F7#, 16#F0#, 16#00#, 16#03#, 16#FF#, 16#F0#,
16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#,
16#FF#, 16#FF#, 16#80#, 16#01#, 16#E0#, 16#7F#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#38#, 16#00#, 16#FC#, 16#01#, 16#F8#, 16#07#, 16#F0#, 16#07#,
16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#,
16#E0#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#F8#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#03#, 16#FF#, 16#E0#,
16#00#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#07#,
16#F8#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#E3#, 16#E0#, 16#00#, 16#1F#, 16#3F#,
16#E0#, 16#00#, 16#7D#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#FF#, 16#80#,
16#07#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#F0#, 16#FC#, 16#00#, 16#7F#,
16#01#, 16#F8#, 16#01#, 16#F8#, 16#03#, 16#E0#, 16#07#, 16#E0#, 16#0F#,
16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7E#, 16#00#, 16#F8#, 16#00#,
16#F8#, 16#03#, 16#E0#, 16#03#, 16#E0#, 16#0F#, 16#80#, 16#0F#, 16#C0#,
16#7E#, 16#00#, 16#1F#, 16#83#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#C0#,
16#00#, 16#FF#, 16#FE#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#00#, 16#03#,
16#FF#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#FF#,
16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#,
16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#F0#, 16#01#, 16#F0#, 16#03#,
16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#,
16#7F#, 16#FE#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#0F#, 16#FF#,
16#F8#, 16#00#, 16#7F#, 16#07#, 16#E0#, 16#01#, 16#F0#, 16#0F#, 16#C0#,
16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#01#, 16#F0#, 16#01#, 16#E0#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#3E#,
16#00#, 16#0F#, 16#C1#, 16#F8#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#,
16#7F#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#FF#,
16#E0#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#01#, 16#FC#, 16#1F#, 16#80#,
16#0F#, 16#C0#, 16#3F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#00#, 16#F0#, 16#03#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#3F#, 16#00#, 16#7C#, 16#00#, 16#FE#, 16#07#, 16#F0#, 16#01#,
16#FF#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#07#, 16#FF#,
16#F0#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#,
16#01#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#, 16#F8#, 16#00#, 16#3F#,
16#07#, 16#F0#, 16#00#, 16#F8#, 16#0F#, 16#C0#, 16#07#, 16#C0#, 16#1F#,
16#00#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#,
16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#1F#, 16#80#, 16#0F#, 16#80#,
16#FE#, 16#00#, 16#3F#, 16#07#, 16#F8#, 16#00#, 16#7F#, 16#FF#, 16#E0#,
16#01#, 16#FF#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#07#,
16#FC#, 16#F8#, 16#00#, 16#07#, 16#E3#, 16#E0#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#07#,
16#F0#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#FF#, 16#FC#, 16#00#,
16#07#, 16#FF#, 16#E0#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#3F#,
16#F8#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#1F#, 16#C0#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#00#,
16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#,
16#00#, 16#7F#, 16#C0#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#7F#,
16#C0#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#,
16#07#, 16#FE#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#03#, 16#FF#,
16#80#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#80#,
16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#,
16#01#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#01#,
16#FE#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#E0#,
16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#,
16#FF#, 16#FC#, 16#07#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#FF#, 16#FF#,
16#FF#, 16#03#, 16#FF#, 16#FF#, 16#FC#, 16#0F#, 16#FF#, 16#FF#, 16#F0#,
16#1F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#FE#,
16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#80#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#0F#,
16#F8#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#00#, 16#7F#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#,
16#01#, 16#FF#, 16#F0#, 16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#7F#,
16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#07#, 16#E0#, 16#7F#,
16#00#, 16#1F#, 16#00#, 16#7C#, 16#00#, 16#78#, 16#01#, 16#F0#, 16#00#,
16#E0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#80#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#,
16#FE#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#F8#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#F0#,
16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#3F#, 16#0F#, 16#C0#, 16#00#,
16#F0#, 16#0F#, 16#00#, 16#07#, 16#C0#, 16#1E#, 16#00#, 16#1E#, 16#00#,
16#78#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#03#, 16#C0#, 16#07#, 16#80#,
16#0F#, 16#00#, 16#FE#, 16#00#, 16#38#, 16#0F#, 16#F8#, 16#00#, 16#E0#,
16#7F#, 16#E0#, 16#03#, 16#83#, 16#FF#, 16#80#, 16#0E#, 16#1F#, 16#9E#,
16#00#, 16#38#, 16#78#, 16#78#, 16#00#, 16#E3#, 16#C1#, 16#E0#, 16#03#,
16#8F#, 16#07#, 16#80#, 16#0E#, 16#3C#, 16#1E#, 16#00#, 16#38#, 16#F0#,
16#78#, 16#00#, 16#E1#, 16#E1#, 16#E0#, 16#03#, 16#87#, 16#C7#, 16#80#,
16#0E#, 16#1F#, 16#FE#, 16#00#, 16#38#, 16#3F#, 16#FC#, 16#00#, 16#F0#,
16#7F#, 16#F0#, 16#03#, 16#C0#, 16#7F#, 16#80#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1C#, 16#00#, 16#0F#, 16#C0#,
16#F0#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#FF#, 16#00#,
16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#7F#, 16#FE#,
16#00#, 16#01#, 16#FF#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#,
16#0F#, 16#FF#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#F9#, 16#F0#,
16#00#, 16#03#, 16#E7#, 16#E0#, 16#00#, 16#1F#, 16#0F#, 16#80#, 16#00#,
16#7C#, 16#3F#, 16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#, 16#0F#, 16#81#,
16#F0#, 16#00#, 16#7C#, 16#07#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#80#,
16#07#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#FF#,
16#FF#, 16#F8#, 16#07#, 16#FF#, 16#FF#, 16#E0#, 16#1F#, 16#00#, 16#0F#,
16#80#, 16#FC#, 16#00#, 16#3F#, 16#0F#, 16#FC#, 16#07#, 16#FF#, 16#3F#,
16#F8#, 16#1F#, 16#FE#, 16#FF#, 16#E0#, 16#FF#, 16#FB#, 16#FF#, 16#81#,
16#FF#, 16#EF#, 16#FC#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#FF#, 16#E0#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#07#, 16#FF#,
16#FF#, 16#C0#, 16#1F#, 16#FF#, 16#FF#, 16#80#, 16#3F#, 16#FF#, 16#FF#,
16#00#, 16#3E#, 16#00#, 16#FC#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#03#,
16#E0#, 16#03#, 16#E0#, 16#0F#, 16#80#, 16#0F#, 16#80#, 16#3E#, 16#00#,
16#7E#, 16#00#, 16#F8#, 16#03#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#80#,
16#0F#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#F8#, 16#00#, 16#FF#,
16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#80#, 16#1F#,
16#C0#, 16#3E#, 16#00#, 16#1F#, 16#80#, 16#F8#, 16#00#, 16#3E#, 16#03#,
16#E0#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#03#, 16#E0#, 16#3E#, 16#00#,
16#1F#, 16#83#, 16#FF#, 16#FF#, 16#FC#, 16#1F#, 16#FF#, 16#FF#, 16#F0#,
16#7F#, 16#FF#, 16#FF#, 16#81#, 16#FF#, 16#FF#, 16#FC#, 16#03#, 16#FF#,
16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#F3#,
16#80#, 16#07#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#01#,
16#FF#, 16#FF#, 16#F0#, 16#0F#, 16#F0#, 16#3F#, 16#C0#, 16#7F#, 16#00#,
16#3F#, 16#01#, 16#F8#, 16#00#, 16#7C#, 16#0F#, 16#C0#, 16#01#, 16#F0#,
16#3E#, 16#00#, 16#07#, 16#C0#, 16#F8#, 16#00#, 16#0E#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#01#, 16#C0#, 16#7F#, 16#00#, 16#0F#, 16#00#, 16#FF#,
16#01#, 16#FE#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#,
16#C0#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#,
16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FF#,
16#C0#, 16#07#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#, 16#00#,
16#3F#, 16#FF#, 16#FE#, 16#00#, 16#7C#, 16#03#, 16#FC#, 16#01#, 16#F0#,
16#03#, 16#F0#, 16#07#, 16#C0#, 16#07#, 16#E0#, 16#1F#, 16#00#, 16#0F#,
16#80#, 16#7C#, 16#00#, 16#3E#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#07#,
16#C0#, 16#01#, 16#F0#, 16#1F#, 16#00#, 16#07#, 16#C0#, 16#7C#, 16#00#,
16#1F#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#07#, 16#C0#, 16#01#, 16#F0#,
16#1F#, 16#00#, 16#07#, 16#C0#, 16#7C#, 16#00#, 16#1F#, 16#01#, 16#F0#,
16#00#, 16#F8#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#1F#, 16#00#, 16#1F#,
16#80#, 16#7C#, 16#01#, 16#FC#, 16#03#, 16#FF#, 16#FF#, 16#F0#, 16#1F#,
16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#,
16#C0#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#FF#, 16#FF#, 16#81#, 16#FF#, 16#FF#, 16#FE#, 16#07#, 16#FF#,
16#FF#, 16#F8#, 16#1F#, 16#FF#, 16#FF#, 16#E0#, 16#3F#, 16#FF#, 16#FF#,
16#80#, 16#3E#, 16#00#, 16#3E#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#03#,
16#E0#, 16#E3#, 16#E0#, 16#0F#, 16#87#, 16#8F#, 16#80#, 16#3E#, 16#1F#,
16#1C#, 16#00#, 16#F8#, 16#7C#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#,
16#0F#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#FF#,
16#FC#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#0F#, 16#87#, 16#C0#,
16#00#, 16#3E#, 16#1F#, 16#0E#, 16#00#, 16#F8#, 16#38#, 16#7C#, 16#03#,
16#E0#, 16#01#, 16#F0#, 16#0F#, 16#80#, 16#07#, 16#C0#, 16#3E#, 16#00#,
16#1F#, 16#03#, 16#FF#, 16#FF#, 16#FC#, 16#1F#, 16#FF#, 16#FF#, 16#F0#,
16#7F#, 16#FF#, 16#FF#, 16#C1#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#,
16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#,
16#C1#, 16#FF#, 16#FF#, 16#FF#, 16#07#, 16#FF#, 16#FF#, 16#FC#, 16#1F#,
16#FF#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#3E#, 16#00#,
16#1F#, 16#00#, 16#F8#, 16#00#, 16#7C#, 16#03#, 16#E0#, 16#01#, 16#F0#,
16#0F#, 16#83#, 16#87#, 16#C0#, 16#3E#, 16#1E#, 16#0E#, 16#00#, 16#F8#,
16#7C#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#0F#, 16#FF#, 16#C0#,
16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#03#,
16#FF#, 16#F0#, 16#00#, 16#0F#, 16#87#, 16#C0#, 16#00#, 16#3E#, 16#1F#,
16#00#, 16#00#, 16#F8#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#E0#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#FF#,
16#F0#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#7F#, 16#FF#, 16#80#,
16#01#, 16#FF#, 16#FE#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#,
16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#01#, 16#FF#, 16#FF#, 16#F0#,
16#0F#, 16#F0#, 16#1F#, 16#C0#, 16#7F#, 16#00#, 16#3F#, 16#01#, 16#F0#,
16#00#, 16#7C#, 16#0F#, 16#C0#, 16#01#, 16#F0#, 16#3E#, 16#00#, 16#03#,
16#80#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#3F#, 16#FE#, 16#0F#, 16#01#, 16#FF#, 16#FC#,
16#3C#, 16#07#, 16#FF#, 16#F0#, 16#F0#, 16#1F#, 16#FF#, 16#C3#, 16#E0#,
16#3F#, 16#FE#, 16#0F#, 16#80#, 16#01#, 16#F0#, 16#3F#, 16#00#, 16#07#,
16#C0#, 16#7E#, 16#00#, 16#1F#, 16#01#, 16#FE#, 16#01#, 16#FC#, 16#03#,
16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#,
16#FE#, 16#00#, 16#0F#, 16#FF#, 16#E0#, 16#00#, 16#07#, 16#FC#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#F0#, 16#FF#, 16#80#, 16#FF#, 16#E3#, 16#FF#, 16#03#, 16#FF#,
16#9F#, 16#FC#, 16#0F#, 16#FE#, 16#3F#, 16#F0#, 16#1F#, 16#F0#, 16#FF#,
16#80#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#,
16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#,
16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#C0#,
16#0F#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#FF#,
16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#,
16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#,
16#7C#, 16#03#, 16#FF#, 16#0F#, 16#FC#, 16#1F#, 16#FE#, 16#3F#, 16#F8#,
16#7F#, 16#F9#, 16#FF#, 16#E1#, 16#FF#, 16#E3#, 16#FF#, 16#83#, 16#FF#,
16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FE#,
16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#03#,
16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#7F#,
16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#,
16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#F0#, 16#00#, 16#FF#,
16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#FE#,
16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#0F#, 16#80#,
16#1E#, 16#00#, 16#3E#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#01#, 16#E0#,
16#03#, 16#E0#, 16#07#, 16#80#, 16#0F#, 16#80#, 16#1E#, 16#00#, 16#3E#,
16#00#, 16#78#, 16#01#, 16#F8#, 16#01#, 16#FC#, 16#1F#, 16#C0#, 16#07#,
16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#7F#, 16#FF#,
16#C0#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7F#, 16#F8#, 16#7F#, 16#C1#, 16#FF#, 16#F3#, 16#FF#, 16#87#, 16#FF#,
16#CF#, 16#FE#, 16#1F#, 16#FF#, 16#3F#, 16#F8#, 16#3F#, 16#F8#, 16#7F#,
16#C0#, 16#3E#, 16#01#, 16#F8#, 16#00#, 16#F8#, 16#1F#, 16#C0#, 16#03#,
16#E0#, 16#FE#, 16#00#, 16#0F#, 16#87#, 16#F0#, 16#00#, 16#3E#, 16#3F#,
16#80#, 16#00#, 16#FB#, 16#F8#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#,
16#0F#, 16#FF#, 16#80#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#FF#,
16#FE#, 16#00#, 16#03#, 16#F9#, 16#FC#, 16#00#, 16#0F#, 16#C3#, 16#F8#,
16#00#, 16#3E#, 16#07#, 16#E0#, 16#00#, 16#F8#, 16#0F#, 16#C0#, 16#03#,
16#E0#, 16#1F#, 16#00#, 16#0F#, 16#80#, 16#7E#, 16#00#, 16#3E#, 16#00#,
16#F8#, 16#03#, 16#FF#, 16#83#, 16#FE#, 16#1F#, 16#FF#, 16#07#, 16#FC#,
16#7F#, 16#FC#, 16#1F#, 16#F1#, 16#FF#, 16#F0#, 16#7F#, 16#C3#, 16#FF#,
16#80#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#80#,
16#00#, 16#FF#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#0F#,
16#FF#, 16#F0#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#70#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#,
16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#83#, 16#FF#,
16#FF#, 16#FE#, 16#0F#, 16#FF#, 16#FF#, 16#F8#, 16#3F#, 16#FF#, 16#FF#,
16#E0#, 16#FF#, 16#FF#, 16#FF#, 16#81#, 16#FF#, 16#FF#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#0F#, 16#F3#, 16#FC#, 16#00#,
16#3F#, 16#EF#, 16#F8#, 16#01#, 16#FF#, 16#BF#, 16#E0#, 16#07#, 16#FE#,
16#FF#, 16#C0#, 16#1F#, 16#F0#, 16#FF#, 16#00#, 16#FF#, 16#03#, 16#FE#,
16#03#, 16#FC#, 16#0F#, 16#F8#, 16#1F#, 16#F0#, 16#3F#, 16#F0#, 16#7F#,
16#C0#, 16#FF#, 16#C3#, 16#FF#, 16#03#, 16#FF#, 16#8F#, 16#BC#, 16#0F#,
16#BE#, 16#7E#, 16#F0#, 16#3E#, 16#FD#, 16#F3#, 16#C0#, 16#F9#, 16#FF#,
16#CF#, 16#03#, 16#E7#, 16#FE#, 16#3C#, 16#0F#, 16#8F#, 16#F8#, 16#F0#,
16#3E#, 16#3F#, 16#C3#, 16#C0#, 16#F8#, 16#7F#, 16#0F#, 16#03#, 16#E1#,
16#F8#, 16#3C#, 16#0F#, 16#83#, 16#E0#, 16#F0#, 16#3E#, 16#00#, 16#03#,
16#C0#, 16#F8#, 16#00#, 16#0F#, 16#0F#, 16#FE#, 16#03#, 16#FF#, 16#3F#,
16#F8#, 16#1F#, 16#FE#, 16#FF#, 16#E0#, 16#7F#, 16#FB#, 16#FF#, 16#81#,
16#FF#, 16#EF#, 16#FC#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#00#, 16#FF#, 16#E3#, 16#FE#, 16#03#, 16#FF#, 16#CF#, 16#FC#,
16#0F#, 16#FF#, 16#3F#, 16#F0#, 16#3F#, 16#FC#, 16#7F#, 16#E0#, 16#7F#,
16#E0#, 16#7F#, 16#C0#, 16#3E#, 16#01#, 16#FF#, 16#80#, 16#F8#, 16#07#,
16#FE#, 16#03#, 16#E0#, 16#1F#, 16#FC#, 16#0F#, 16#80#, 16#7F#, 16#F8#,
16#3E#, 16#01#, 16#F7#, 16#E0#, 16#F8#, 16#07#, 16#CF#, 16#C3#, 16#E0#,
16#1F#, 16#1F#, 16#8F#, 16#80#, 16#7C#, 16#7E#, 16#3E#, 16#01#, 16#F0#,
16#FC#, 16#F8#, 16#07#, 16#C1#, 16#FB#, 16#E0#, 16#1F#, 16#07#, 16#EF#,
16#80#, 16#7C#, 16#0F#, 16#FE#, 16#01#, 16#F0#, 16#1F#, 16#F8#, 16#07#,
16#C0#, 16#7F#, 16#E0#, 16#1F#, 16#00#, 16#FF#, 16#80#, 16#7C#, 16#01#,
16#FE#, 16#03#, 16#FF#, 16#07#, 16#F8#, 16#1F#, 16#FE#, 16#0F#, 16#E0#,
16#7F#, 16#F8#, 16#1F#, 16#81#, 16#FF#, 16#E0#, 16#7E#, 16#03#, 16#FF#,
16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#F0#,
16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#01#,
16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#E0#, 16#7F#, 16#80#, 16#7F#, 16#00#,
16#7E#, 16#01#, 16#F0#, 16#00#, 16#FC#, 16#0F#, 16#C0#, 16#01#, 16#F0#,
16#3E#, 16#00#, 16#07#, 16#C1#, 16#F0#, 16#00#, 16#0F#, 16#87#, 16#C0#,
16#00#, 16#3E#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#7C#, 16#00#, 16#03#,
16#E1#, 16#F0#, 16#00#, 16#07#, 16#87#, 16#C0#, 16#00#, 16#3E#, 16#1F#,
16#00#, 16#00#, 16#F8#, 16#7C#, 16#00#, 16#03#, 16#E1#, 16#F0#, 16#00#,
16#0F#, 16#83#, 16#E0#, 16#00#, 16#7C#, 16#0F#, 16#C0#, 16#01#, 16#F0#,
16#1F#, 16#00#, 16#0F#, 16#C0#, 16#7F#, 16#00#, 16#7E#, 16#00#, 16#FE#,
16#07#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#FE#,
16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#FF#,
16#E0#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#1F#, 16#FF#, 16#FF#, 16#80#,
16#3F#, 16#FF#, 16#FF#, 16#00#, 16#3E#, 16#01#, 16#FC#, 16#00#, 16#F8#,
16#01#, 16#F8#, 16#03#, 16#E0#, 16#03#, 16#E0#, 16#0F#, 16#80#, 16#0F#,
16#80#, 16#3E#, 16#00#, 16#3E#, 16#00#, 16#F8#, 16#00#, 16#F8#, 16#03#,
16#E0#, 16#07#, 16#E0#, 16#0F#, 16#80#, 16#7F#, 16#00#, 16#3F#, 16#FF#,
16#FC#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#00#,
16#0F#, 16#FF#, 16#F8#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#1F#,
16#FF#, 16#E0#, 16#00#, 16#7F#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FE#,
16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#00#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#7F#,
16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#E0#, 16#7F#,
16#00#, 16#7E#, 16#00#, 16#7E#, 16#03#, 16#F0#, 16#00#, 16#FC#, 16#0F#,
16#80#, 16#01#, 16#F0#, 16#3E#, 16#00#, 16#07#, 16#E1#, 16#F0#, 16#00#,
16#0F#, 16#87#, 16#C0#, 16#00#, 16#3E#, 16#1F#, 16#00#, 16#00#, 16#F8#,
16#7C#, 16#00#, 16#03#, 16#E1#, 16#F0#, 16#00#, 16#0F#, 16#87#, 16#C0#,
16#00#, 16#3E#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#7C#, 16#00#, 16#03#,
16#E0#, 16#F8#, 16#00#, 16#1F#, 16#83#, 16#E0#, 16#00#, 16#7C#, 16#0F#,
16#C0#, 16#03#, 16#F0#, 16#1F#, 16#80#, 16#1F#, 16#80#, 16#3F#, 16#81#,
16#FC#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#80#,
16#01#, 16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#07#,
16#F8#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C1#,
16#C0#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#3F#, 16#FF#, 16#FE#, 16#01#,
16#FF#, 16#FF#, 16#F8#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#0F#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#80#,
16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#3F#,
16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#3E#, 16#01#,
16#FC#, 16#00#, 16#F8#, 16#03#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#,
16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#03#, 16#F0#, 16#03#, 16#E0#, 16#3F#, 16#80#, 16#0F#, 16#FF#, 16#FE#,
16#00#, 16#3F#, 16#FF#, 16#F0#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#03#,
16#FF#, 16#F8#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#3E#, 16#0F#,
16#E0#, 16#00#, 16#F8#, 16#1F#, 16#C0#, 16#03#, 16#E0#, 16#3F#, 16#80#,
16#0F#, 16#80#, 16#7F#, 16#00#, 16#3E#, 16#00#, 16#FE#, 16#07#, 16#FF#,
16#01#, 16#FF#, 16#3F#, 16#FE#, 16#03#, 16#FC#, 16#FF#, 16#F8#, 16#0F#,
16#FB#, 16#FF#, 16#E0#, 16#1F#, 16#C7#, 16#FF#, 16#00#, 16#3F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#F1#, 16#C0#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#07#, 16#FF#,
16#FC#, 16#00#, 16#3F#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#C0#,
16#0F#, 16#E0#, 16#7F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#00#, 16#F0#, 16#03#, 16#E0#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#0E#,
16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#01#,
16#FF#, 16#F8#, 16#00#, 16#03#, 16#FF#, 16#F8#, 16#00#, 16#07#, 16#FF#,
16#F8#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#E0#,
16#00#, 16#F8#, 16#07#, 16#80#, 16#03#, 16#E0#, 16#1F#, 16#00#, 16#0F#,
16#80#, 16#7E#, 16#00#, 16#7E#, 16#01#, 16#FE#, 16#03#, 16#F8#, 16#07#,
16#FF#, 16#FF#, 16#C0#, 16#1F#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#,
16#F0#, 16#00#, 16#EF#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#,
16#FF#, 16#FC#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#FF#,
16#C0#, 16#F8#, 16#3C#, 16#0F#, 16#03#, 16#E0#, 16#F0#, 16#3C#, 16#0F#,
16#83#, 16#C0#, 16#F0#, 16#3E#, 16#0F#, 16#03#, 16#C0#, 16#F8#, 16#3C#,
16#0F#, 16#03#, 16#C0#, 16#F0#, 16#3C#, 16#07#, 16#03#, 16#C0#, 16#E0#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#FF#, 16#FF#, 16#00#,
16#03#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#1F#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#FF#,
16#E1#, 16#FF#, 16#E3#, 16#FF#, 16#CF#, 16#FF#, 16#9F#, 16#FF#, 16#1F#,
16#FE#, 16#3F#, 16#FC#, 16#3F#, 16#F0#, 16#FF#, 16#E0#, 16#7C#, 16#00#,
16#3E#, 16#01#, 16#F0#, 16#00#, 16#F8#, 16#07#, 16#C0#, 16#03#, 16#E0#,
16#1F#, 16#00#, 16#0F#, 16#80#, 16#7C#, 16#00#, 16#3E#, 16#01#, 16#F0#,
16#00#, 16#F8#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#1F#, 16#00#, 16#0F#,
16#80#, 16#7C#, 16#00#, 16#3E#, 16#01#, 16#F0#, 16#00#, 16#F8#, 16#07#,
16#C0#, 16#03#, 16#E0#, 16#1F#, 16#00#, 16#0F#, 16#80#, 16#7C#, 16#00#,
16#3E#, 16#01#, 16#F0#, 16#00#, 16#F8#, 16#07#, 16#C0#, 16#03#, 16#E0#,
16#0F#, 16#80#, 16#1F#, 16#80#, 16#3F#, 16#00#, 16#FC#, 16#00#, 16#FE#,
16#07#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#FC#,
16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#,
16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#3F#, 16#F3#, 16#FF#, 16#81#,
16#FF#, 16#EF#, 16#FE#, 16#07#, 16#FF#, 16#BF#, 16#F8#, 16#1F#, 16#FE#,
16#FF#, 16#C0#, 16#3F#, 16#F0#, 16#FC#, 16#00#, 16#1F#, 16#01#, 16#F0#,
16#00#, 16#F8#, 16#07#, 16#E0#, 16#03#, 16#E0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#7C#, 16#01#, 16#F0#, 16#01#,
16#F0#, 16#0F#, 16#80#, 16#07#, 16#E0#, 16#3E#, 16#00#, 16#0F#, 16#81#,
16#F0#, 16#00#, 16#3F#, 16#07#, 16#C0#, 16#00#, 16#7C#, 16#3E#, 16#00#,
16#01#, 16#F8#, 16#F8#, 16#00#, 16#03#, 16#E3#, 16#E0#, 16#00#, 16#0F#,
16#9F#, 16#00#, 16#00#, 16#3F#, 16#7C#, 16#00#, 16#00#, 16#7F#, 16#E0#,
16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#,
16#0F#, 16#F0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#FF#, 16#E0#, 16#7F#, 16#F3#, 16#FF#, 16#C3#, 16#FF#, 16#CF#, 16#FF#,
16#0F#, 16#FF#, 16#BF#, 16#FC#, 16#3F#, 16#FE#, 16#FF#, 16#E0#, 16#7F#,
16#F0#, 16#F8#, 16#00#, 16#0F#, 16#03#, 16#E0#, 16#F8#, 16#3C#, 16#0F#,
16#87#, 16#E0#, 16#F0#, 16#3E#, 16#1F#, 16#87#, 16#C0#, 16#F8#, 16#7F#,
16#1F#, 16#03#, 16#E3#, 16#FC#, 16#7C#, 16#07#, 16#8F#, 16#F1#, 16#F0#,
16#1F#, 16#3F#, 16#E7#, 16#C0#, 16#7D#, 16#FF#, 16#9E#, 16#01#, 16#F7#,
16#FE#, 16#78#, 16#07#, 16#DF#, 16#7F#, 16#E0#, 16#1F#, 16#F9#, 16#FF#,
16#80#, 16#7F#, 16#E7#, 16#FE#, 16#01#, 16#FF#, 16#8F#, 16#F8#, 16#03#,
16#FC#, 16#3F#, 16#E0#, 16#0F#, 16#F0#, 16#FF#, 16#00#, 16#3F#, 16#C1#,
16#FC#, 16#00#, 16#FE#, 16#07#, 16#F0#, 16#03#, 16#F8#, 16#1F#, 16#C0#,
16#0F#, 16#E0#, 16#3F#, 16#00#, 16#3F#, 16#00#, 16#FC#, 16#00#, 16#7C#,
16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#3F#,
16#C1#, 16#FF#, 16#81#, 16#FF#, 16#87#, 16#FE#, 16#07#, 16#FE#, 16#1F#,
16#F8#, 16#1F#, 16#F8#, 16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#3F#, 16#00#,
16#FC#, 16#00#, 16#7E#, 16#07#, 16#E0#, 16#00#, 16#FC#, 16#3F#, 16#00#,
16#01#, 16#F9#, 16#F8#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#07#,
16#FF#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#E7#,
16#E0#, 16#00#, 16#3F#, 16#8F#, 16#C0#, 16#01#, 16#FC#, 16#1F#, 16#80#,
16#07#, 16#E0#, 16#3F#, 16#00#, 16#3F#, 16#00#, 16#FC#, 16#07#, 16#FE#,
16#07#, 16#FE#, 16#1F#, 16#FC#, 16#3F#, 16#FC#, 16#FF#, 16#F0#, 16#FF#,
16#F1#, 16#FF#, 16#C3#, 16#FF#, 16#C7#, 16#FE#, 16#07#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#7F#, 16#C1#, 16#FF#, 16#81#,
16#FF#, 16#87#, 16#FE#, 16#07#, 16#FE#, 16#1F#, 16#F8#, 16#1F#, 16#F8#,
16#3F#, 16#C0#, 16#3F#, 16#C0#, 16#3F#, 16#00#, 16#FC#, 16#00#, 16#7E#,
16#07#, 16#E0#, 16#00#, 16#FC#, 16#1F#, 16#00#, 16#01#, 16#F0#, 16#FC#,
16#00#, 16#07#, 16#E7#, 16#E0#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#FF#,
16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#,
16#FF#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#,
16#F0#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#7F#,
16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#,
16#00#, 16#1E#, 16#01#, 16#F8#, 16#00#, 16#78#, 16#0F#, 16#C0#, 16#01#,
16#E0#, 16#3E#, 16#00#, 16#07#, 16#81#, 16#F8#, 16#00#, 16#1E#, 16#0F#,
16#C0#, 16#00#, 16#70#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#FC#, 16#07#,
16#00#, 16#07#, 16#E0#, 16#3E#, 16#00#, 16#3F#, 16#00#, 16#F8#, 16#00#,
16#FC#, 16#03#, 16#E0#, 16#07#, 16#E0#, 16#0F#, 16#80#, 16#3F#, 16#00#,
16#3E#, 16#01#, 16#FF#, 16#FF#, 16#F8#, 16#07#, 16#FF#, 16#FF#, 16#E0#,
16#1F#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FE#, 16#01#, 16#FF#,
16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#,
16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#FC#,
16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3F#,
16#E0#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#00#,
16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#,
16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#01#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#,
16#03#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#,
16#FF#, 16#C0#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FC#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#,
16#60#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#80#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#,
16#3F#, 16#FC#, 16#00#, 16#00#, 16#FF#, 16#F8#, 16#00#, 16#07#, 16#E7#,
16#E0#, 16#00#, 16#3F#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#1F#, 16#80#,
16#0F#, 16#C0#, 16#3F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#00#, 16#F0#, 16#01#, 16#C0#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#FC#, 16#FF#, 16#FF#, 16#FF#,
16#F3#, 16#FF#, 16#FF#, 16#FF#, 16#CF#, 16#FF#, 16#FF#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#,
16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#,
16#0F#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#01#, 16#FF#, 16#F8#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#01#,
16#FF#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#,
16#F8#, 16#01#, 16#FC#, 16#03#, 16#E0#, 16#0F#, 16#C0#, 16#0F#, 16#80#,
16#3E#, 16#00#, 16#3E#, 16#00#, 16#F8#, 16#01#, 16#F8#, 16#03#, 16#F0#,
16#3F#, 16#FC#, 16#0F#, 16#FF#, 16#FF#, 16#F8#, 16#1F#, 16#FF#, 16#FF#,
16#E0#, 16#3F#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FB#, 16#FC#, 16#00#,
16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#3F#,
16#C0#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#3F#, 16#80#, 16#01#, 16#F3#,
16#FF#, 16#80#, 16#07#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#,
16#00#, 16#7F#, 16#FF#, 16#FE#, 16#01#, 16#FF#, 16#03#, 16#F8#, 16#07#,
16#F0#, 16#03#, 16#F0#, 16#1F#, 16#80#, 16#07#, 16#C0#, 16#7E#, 16#00#,
16#1F#, 16#81#, 16#F0#, 16#00#, 16#3E#, 16#07#, 16#C0#, 16#00#, 16#F8#,
16#1F#, 16#00#, 16#03#, 16#E0#, 16#7C#, 16#00#, 16#0F#, 16#81#, 16#F0#,
16#00#, 16#3E#, 16#07#, 16#E0#, 16#01#, 16#F0#, 16#1F#, 16#C0#, 16#07#,
16#C0#, 16#7F#, 16#80#, 16#3F#, 16#07#, 16#FF#, 16#03#, 16#F8#, 16#3F#,
16#FF#, 16#FF#, 16#E0#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#, 16#FF#,
16#F8#, 16#07#, 16#F3#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#8E#, 16#00#, 16#0F#, 16#FF#, 16#F8#, 16#00#,
16#7F#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#1F#, 16#FF#,
16#FE#, 16#00#, 16#FF#, 16#03#, 16#F8#, 16#03#, 16#F0#, 16#03#, 16#E0#,
16#1F#, 16#80#, 16#0F#, 16#80#, 16#7C#, 16#00#, 16#1E#, 16#01#, 16#F0#,
16#00#, 16#78#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#01#, 16#80#, 16#7E#, 16#00#,
16#0F#, 16#00#, 16#FF#, 16#00#, 16#FE#, 16#01#, 16#FF#, 16#FF#, 16#F0#,
16#07#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FE#, 16#00#, 16#0F#,
16#FF#, 16#E0#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#,
16#07#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#7F#,
16#80#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#01#, 16#FE#,
16#3E#, 16#00#, 16#1F#, 16#FE#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#E0#,
16#07#, 16#FF#, 16#FF#, 16#80#, 16#3F#, 16#FF#, 16#FE#, 16#01#, 16#FC#,
16#0F#, 16#F8#, 16#07#, 16#E0#, 16#0F#, 16#E0#, 16#3F#, 16#00#, 16#1F#,
16#80#, 16#F8#, 16#00#, 16#3E#, 16#03#, 16#E0#, 16#00#, 16#F8#, 16#0F#,
16#00#, 16#03#, 16#E0#, 16#3C#, 16#00#, 16#0F#, 16#80#, 16#F0#, 16#00#,
16#3E#, 16#03#, 16#E0#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#07#, 16#E0#,
16#3F#, 16#00#, 16#1F#, 16#80#, 16#7E#, 16#00#, 16#FE#, 16#01#, 16#FC#,
16#0F#, 16#FF#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#07#, 16#FF#, 16#FF#,
16#F8#, 16#0F#, 16#FF#, 16#FF#, 16#E0#, 16#1F#, 16#FE#, 16#FF#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#00#, 16#00#, 16#FF#, 16#FE#, 16#00#, 16#07#, 16#FF#, 16#FC#,
16#00#, 16#3F#, 16#FF#, 16#F8#, 16#01#, 16#FE#, 16#07#, 16#F0#, 16#07#,
16#E0#, 16#07#, 16#E0#, 16#3F#, 16#00#, 16#0F#, 16#80#, 16#F8#, 16#00#,
16#3E#, 16#03#, 16#FF#, 16#FF#, 16#FC#, 16#0F#, 16#FF#, 16#FF#, 16#F0#,
16#3F#, 16#FF#, 16#FF#, 16#C0#, 16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#,
16#FF#, 16#FC#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#,
16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#01#, 16#F8#, 16#03#,
16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#,
16#FE#, 16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#FC#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#F8#,
16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#03#,
16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#,
16#FC#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#,
16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#,
16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#C0#,
16#0F#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FC#, 16#00#, 16#7F#,
16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#,
16#00#, 16#00#, 16#1F#, 16#FD#, 16#FE#, 16#00#, 16#FF#, 16#FF#, 16#FC#,
16#07#, 16#FF#, 16#FF#, 16#F0#, 16#3F#, 16#FF#, 16#FF#, 16#C1#, 16#FC#,
16#1F#, 16#FE#, 16#07#, 16#E0#, 16#1F#, 16#C0#, 16#3F#, 16#00#, 16#3F#,
16#00#, 16#F8#, 16#00#, 16#FC#, 16#03#, 16#E0#, 16#01#, 16#F0#, 16#0F#,
16#00#, 16#07#, 16#C0#, 16#3C#, 16#00#, 16#1F#, 16#00#, 16#F0#, 16#00#,
16#7C#, 16#03#, 16#C0#, 16#01#, 16#F0#, 16#0F#, 16#80#, 16#07#, 16#C0#,
16#3F#, 16#00#, 16#3F#, 16#00#, 16#FE#, 16#01#, 16#FC#, 16#01#, 16#FC#,
16#1F#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#,
16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#1F#, 16#FD#, 16#F0#, 16#00#,
16#1F#, 16#C7#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#80#,
16#01#, 16#FF#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#1F#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#1F#,
16#E0#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#01#, 16#FE#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#1F#, 16#80#, 16#00#, 16#F9#,
16#FF#, 16#80#, 16#03#, 16#EF#, 16#FF#, 16#00#, 16#0F#, 16#FF#, 16#FE#,
16#00#, 16#3F#, 16#FF#, 16#F8#, 16#00#, 16#FF#, 16#83#, 16#F0#, 16#03#,
16#F8#, 16#07#, 16#C0#, 16#0F#, 16#C0#, 16#1F#, 16#00#, 16#3E#, 16#00#,
16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#,
16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#03#, 16#FF#, 16#07#, 16#FC#, 16#1F#,
16#FC#, 16#3F#, 16#F8#, 16#7F#, 16#F8#, 16#FF#, 16#E1#, 16#FF#, 16#C3#,
16#FF#, 16#83#, 16#FF#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#01#,
16#FF#, 16#C0#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#1F#, 16#FC#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#E0#,
16#1F#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#7E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#,
16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#FF#, 16#00#,
16#0F#, 16#FF#, 16#FC#, 16#00#, 16#3F#, 16#FF#, 16#F0#, 16#00#, 16#7F#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#01#, 16#FF#, 16#FE#, 16#00#,
16#0F#, 16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#80#, 16#00#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#7F#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#0F#,
16#F0#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#3F#, 16#F0#, 16#01#, 16#F1#, 16#FF#, 16#C0#, 16#07#, 16#C7#, 16#FF#,
16#80#, 16#1F#, 16#1F#, 16#FC#, 16#00#, 16#7C#, 16#3F#, 16#F0#, 16#01#,
16#F3#, 16#FC#, 16#00#, 16#07#, 16#DF#, 16#C0#, 16#00#, 16#1F#, 16#FE#,
16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#,
16#07#, 16#FF#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#7F#,
16#FC#, 16#00#, 16#01#, 16#F3#, 16#F8#, 16#00#, 16#07#, 16#C7#, 16#F0#,
16#00#, 16#1F#, 16#0F#, 16#F0#, 16#03#, 16#FC#, 16#0F#, 16#FC#, 16#0F#,
16#F0#, 16#7F#, 16#F8#, 16#3F#, 16#C1#, 16#FF#, 16#E0#, 16#FF#, 16#07#,
16#FF#, 16#81#, 16#FC#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#,
16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#,
16#07#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#FF#, 16#E0#,
16#1F#, 16#FF#, 16#FF#, 16#80#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#FF#,
16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#,
16#F8#, 16#0F#, 16#FF#, 16#CF#, 16#F0#, 16#3F#, 16#FF#, 16#BF#, 16#E0#,
16#FF#, 16#FF#, 16#FF#, 16#C3#, 16#FF#, 16#FF#, 16#FF#, 16#0F#, 16#F8#,
16#FC#, 16#7C#, 16#0F#, 16#83#, 16#E0#, 16#F0#, 16#3E#, 16#0F#, 16#83#,
16#C0#, 16#F8#, 16#3E#, 16#0F#, 16#03#, 16#E0#, 16#F8#, 16#3C#, 16#0F#,
16#83#, 16#E0#, 16#F0#, 16#3E#, 16#0F#, 16#83#, 16#C0#, 16#F8#, 16#3E#,
16#0F#, 16#03#, 16#E0#, 16#F8#, 16#3C#, 16#0F#, 16#83#, 16#E0#, 16#F0#,
16#3E#, 16#0F#, 16#83#, 16#C0#, 16#F8#, 16#3E#, 16#0F#, 16#0F#, 16#F8#,
16#FC#, 16#3F#, 16#3F#, 16#E3#, 16#F8#, 16#FE#, 16#FF#, 16#CF#, 16#E3#,
16#FB#, 16#FE#, 16#3F#, 16#8F#, 16#EF#, 16#F0#, 16#FC#, 16#3F#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#01#, 16#F9#,
16#FF#, 16#80#, 16#0F#, 16#EF#, 16#FF#, 16#00#, 16#3F#, 16#FF#, 16#FE#,
16#00#, 16#FF#, 16#FF#, 16#F8#, 16#01#, 16#FF#, 16#83#, 16#F0#, 16#03#,
16#F8#, 16#07#, 16#C0#, 16#0F#, 16#C0#, 16#1F#, 16#00#, 16#3E#, 16#00#,
16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#,
16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#03#, 16#FF#, 16#07#, 16#FC#, 16#1F#,
16#FC#, 16#1F#, 16#F8#, 16#7F#, 16#F8#, 16#FF#, 16#E1#, 16#FF#, 16#C1#,
16#FF#, 16#83#, 16#FF#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#FE#, 16#00#, 16#3F#, 16#FF#,
16#FC#, 16#00#, 16#FE#, 16#07#, 16#F0#, 16#07#, 16#E0#, 16#07#, 16#E0#,
16#1F#, 16#00#, 16#0F#, 16#80#, 16#F8#, 16#00#, 16#1F#, 16#03#, 16#E0#,
16#00#, 16#7C#, 16#0F#, 16#80#, 16#01#, 16#F0#, 16#3E#, 16#00#, 16#03#,
16#C0#, 16#F8#, 16#00#, 16#1F#, 16#03#, 16#E0#, 16#00#, 16#7C#, 16#0F#,
16#80#, 16#01#, 16#F0#, 16#1F#, 16#00#, 16#0F#, 16#C0#, 16#7E#, 16#00#,
16#7E#, 16#00#, 16#FE#, 16#07#, 16#F8#, 16#03#, 16#FF#, 16#FF#, 16#C0#,
16#07#, 16#FF#, 16#FE#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#0F#,
16#FF#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#80#, 16#07#, 16#F9#, 16#FF#, 16#C0#, 16#3F#, 16#FF#, 16#FF#, 16#80#,
16#FF#, 16#FF#, 16#FF#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#07#, 16#FF#,
16#83#, 16#FC#, 16#03#, 16#F8#, 16#03#, 16#F0#, 16#0F#, 16#C0#, 16#07#,
16#E0#, 16#3E#, 16#00#, 16#0F#, 16#80#, 16#F8#, 16#00#, 16#3E#, 16#03#,
16#E0#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#03#, 16#E0#, 16#3E#, 16#00#,
16#0F#, 16#80#, 16#F8#, 16#00#, 16#3E#, 16#03#, 16#F0#, 16#01#, 16#F8#,
16#0F#, 16#E0#, 16#0F#, 16#C0#, 16#3F#, 16#C0#, 16#7F#, 16#00#, 16#FF#,
16#FF#, 16#F8#, 16#03#, 16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FE#,
16#00#, 16#3E#, 16#FF#, 16#F0#, 16#00#, 16#F8#, 16#7F#, 16#00#, 16#03#,
16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#00#,
16#FF#, 16#FC#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#0F#, 16#FF#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#3F#,
16#FC#, 16#FE#, 16#01#, 16#FF#, 16#FB#, 16#FC#, 16#0F#, 16#FF#, 16#FF#,
16#F0#, 16#7F#, 16#FF#, 16#FF#, 16#C3#, 16#FC#, 16#0F#, 16#FE#, 16#0F#,
16#C0#, 16#1F#, 16#C0#, 16#3E#, 16#00#, 16#3F#, 16#01#, 16#F0#, 16#00#,
16#7C#, 16#07#, 16#C0#, 16#01#, 16#F0#, 16#1F#, 16#00#, 16#03#, 16#C0#,
16#7C#, 16#00#, 16#0F#, 16#01#, 16#F0#, 16#00#, 16#7C#, 16#07#, 16#C0#,
16#01#, 16#F0#, 16#1F#, 16#80#, 16#07#, 16#C0#, 16#3F#, 16#00#, 16#7F#,
16#00#, 16#FF#, 16#03#, 16#FC#, 16#01#, 16#FF#, 16#FF#, 16#F0#, 16#03#,
16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#EF#, 16#00#, 16#0F#, 16#FF#,
16#3C#, 16#00#, 16#07#, 16#F0#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#03#, 16#FF#,
16#F0#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#FF#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#7F#, 16#8F#, 16#F8#, 16#03#,
16#FE#, 16#7F#, 16#F0#, 16#0F#, 16#FB#, 16#FF#, 16#E0#, 16#3F#, 16#FF#,
16#FF#, 16#80#, 16#7F#, 16#FE#, 16#1C#, 16#00#, 16#3F#, 16#F0#, 16#00#,
16#00#, 16#FF#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#0F#,
16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#,
16#00#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#, 16#80#,
16#1F#, 16#FF#, 16#FE#, 16#00#, 16#7F#, 16#FF#, 16#F8#, 16#00#, 16#FF#,
16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#,
16#18#, 16#00#, 16#0F#, 16#FF#, 16#F0#, 16#00#, 16#FF#, 16#FF#, 16#C0#,
16#07#, 16#FF#, 16#FF#, 16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#FE#,
16#03#, 16#F0#, 16#03#, 16#F0#, 16#07#, 16#C0#, 16#0F#, 16#C0#, 16#0E#,
16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#,
16#FF#, 16#FF#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#01#, 16#FF#,
16#FC#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#03#, 16#80#, 16#0F#, 16#E0#,
16#0F#, 16#00#, 16#0F#, 16#80#, 16#7E#, 16#00#, 16#7E#, 16#01#, 16#FE#,
16#07#, 16#F8#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#1F#, 16#FF#, 16#FF#,
16#00#, 16#3F#, 16#FF#, 16#F8#, 16#00#, 16#FF#, 16#FF#, 16#80#, 16#00#,
16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#FF#, 16#80#, 16#1F#, 16#FF#, 16#FF#, 16#00#, 16#7F#, 16#FF#, 16#FC#,
16#01#, 16#FF#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#FF#, 16#80#, 16#01#,
16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#1C#, 16#00#, 16#7E#, 16#03#, 16#F8#, 16#00#,
16#FF#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#07#, 16#FF#,
16#F8#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#0F#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#0F#, 16#F0#, 16#1F#,
16#E0#, 16#7F#, 16#C0#, 16#7F#, 16#81#, 16#FF#, 16#01#, 16#FE#, 16#07#,
16#FC#, 16#03#, 16#F8#, 16#1F#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#,
16#0F#, 16#80#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#,
16#01#, 16#F0#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#01#, 16#F0#, 16#03#,
16#E0#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#3F#, 16#00#, 16#1F#, 16#01#,
16#FC#, 16#00#, 16#7E#, 16#0F#, 16#FC#, 16#01#, 16#FF#, 16#FF#, 16#F8#,
16#03#, 16#FF#, 16#FF#, 16#E0#, 16#0F#, 16#FF#, 16#FF#, 16#80#, 16#0F#,
16#F9#, 16#FC#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#FF#, 16#07#, 16#FE#, 16#3F#, 16#FC#, 16#3F#, 16#FC#,
16#FF#, 16#F0#, 16#FF#, 16#F3#, 16#FF#, 16#C3#, 16#FF#, 16#C7#, 16#FE#,
16#07#, 16#FE#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#0F#, 16#C0#, 16#3F#,
16#00#, 16#1F#, 16#00#, 16#F8#, 16#00#, 16#7E#, 16#07#, 16#E0#, 16#00#,
16#F8#, 16#1F#, 16#00#, 16#03#, 16#F0#, 16#FC#, 16#00#, 16#07#, 16#C3#,
16#E0#, 16#00#, 16#1F#, 16#8F#, 16#80#, 16#00#, 16#3E#, 16#7C#, 16#00#,
16#00#, 16#FD#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#,
16#01#, 16#FE#, 16#3F#, 16#F0#, 16#0F#, 16#FC#, 16#FF#, 16#E0#, 16#3F#,
16#F3#, 16#FF#, 16#00#, 16#FF#, 16#C7#, 16#FC#, 16#01#, 16#FE#, 16#07#,
16#C3#, 16#E1#, 16#F0#, 16#1F#, 16#0F#, 16#87#, 16#80#, 16#7C#, 16#7E#,
16#3E#, 16#01#, 16#F1#, 16#FC#, 16#F8#, 16#03#, 16#EF#, 16#F3#, 16#E0#,
16#0F#, 16#BF#, 16#EF#, 16#00#, 16#3E#, 16#FF#, 16#FC#, 16#00#, 16#FF#,
16#FF#, 16#F0#, 16#01#, 16#FF#, 16#7F#, 16#C0#, 16#07#, 16#F9#, 16#FE#,
16#00#, 16#1F#, 16#E7#, 16#F8#, 16#00#, 16#7F#, 16#8F#, 16#E0#, 16#00#,
16#FC#, 16#3F#, 16#80#, 16#03#, 16#F0#, 16#7C#, 16#00#, 16#0F#, 16#C1#,
16#F0#, 16#00#, 16#3E#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#07#, 16#F8#, 16#0F#,
16#FC#, 16#3F#, 16#F0#, 16#3F#, 16#F0#, 16#FF#, 16#C0#, 16#FF#, 16#C3#,
16#FF#, 16#01#, 16#FE#, 16#07#, 16#F8#, 16#01#, 16#FC#, 16#3F#, 16#80#,
16#03#, 16#FD#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#C0#,
16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#,
16#7F#, 16#FF#, 16#00#, 16#07#, 16#F8#, 16#FE#, 16#00#, 16#3F#, 16#81#,
16#FC#, 16#03#, 16#FE#, 16#07#, 16#FC#, 16#1F#, 16#FC#, 16#3F#, 16#F8#,
16#7F#, 16#F0#, 16#FF#, 16#E1#, 16#FF#, 16#C3#, 16#FF#, 16#83#, 16#FE#,
16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#FE#, 16#03#, 16#FC#, 16#1F#, 16#F8#, 16#1F#, 16#F8#,
16#7F#, 16#E0#, 16#7F#, 16#E1#, 16#FF#, 16#81#, 16#FF#, 16#83#, 16#FC#,
16#03#, 16#FC#, 16#03#, 16#E0#, 16#07#, 16#E0#, 16#0F#, 16#80#, 16#1F#,
16#00#, 16#1F#, 16#00#, 16#F8#, 16#00#, 16#7C#, 16#03#, 16#E0#, 16#00#,
16#F8#, 16#1F#, 16#00#, 16#03#, 16#F0#, 16#7C#, 16#00#, 16#07#, 16#C3#,
16#E0#, 16#00#, 16#1F#, 16#9F#, 16#80#, 16#00#, 16#3E#, 16#7C#, 16#00#,
16#00#, 16#FF#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#07#,
16#FE#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#80#,
16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#,
16#7F#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#07#, 16#FF#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#,
16#FF#, 16#F0#, 16#01#, 16#FF#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#FF#,
16#00#, 16#1F#, 16#FF#, 16#FC#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#01#,
16#E0#, 16#3F#, 16#00#, 16#07#, 16#81#, 16#F8#, 16#00#, 16#1E#, 16#0F#,
16#C0#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#0F#,
16#E0#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#0F#,
16#00#, 16#1F#, 16#C0#, 16#3C#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#03#,
16#FF#, 16#FF#, 16#C0#, 16#0F#, 16#FF#, 16#FF#, 16#00#, 16#3F#, 16#FF#,
16#FC#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#01#, 16#FE#, 16#00#,
16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#,
16#FC#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#1F#,
16#E0#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#FC#, 16#00#,
16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#,
16#01#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#03#, 16#FC#,
16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#00#,
16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#,
16#7F#, 16#80#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#,
16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#1F#,
16#F0#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#01#, 16#FC#, 16#00#,
16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#81#, 16#C0#,
16#0F#, 16#FF#, 16#0F#, 16#80#, 16#7F#, 16#FE#, 16#7E#, 16#01#, 16#F9#,
16#FF#, 16#F8#, 16#07#, 16#C3#, 16#FF#, 16#C0#, 16#0E#, 16#07#, 16#FE#,
16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#);
Font_D : aliased constant Bitmap_Font :=
(
Bytes_Per_Glyph => 176,
Glyph_Width => 30,
Glyph_Height => 47,
Data => FreeMonoBold24pt7bBitmaps'Access);
Font : constant Bitmap_Font_Ref := Font_D'Access;
end GESTE_Fonts.FreeMonoBold24pt7b;
|
------------------------------------------------------------------------------
-- --
-- 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.CMOF;
with AMF.Internals.Tables.CMOF_Attributes;
with AMF.Internals.Tables.DG_String_Data_00;
with AMF.Internals.Tables.DG_String_Data_01;
package body AMF.Internals.Tables.DG_Metamodel.Properties is
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Initialize_1;
Initialize_2;
Initialize_3;
Initialize_4;
Initialize_5;
Initialize_6;
Initialize_7;
Initialize_8;
Initialize_9;
Initialize_10;
Initialize_11;
Initialize_12;
Initialize_13;
Initialize_14;
Initialize_15;
Initialize_16;
Initialize_17;
Initialize_18;
Initialize_19;
Initialize_20;
Initialize_21;
Initialize_22;
Initialize_23;
Initialize_24;
Initialize_25;
Initialize_26;
Initialize_27;
Initialize_28;
Initialize_29;
Initialize_30;
Initialize_31;
Initialize_32;
Initialize_33;
Initialize_34;
Initialize_35;
Initialize_36;
Initialize_37;
Initialize_38;
Initialize_39;
Initialize_40;
Initialize_41;
Initialize_42;
Initialize_43;
Initialize_44;
Initialize_45;
Initialize_46;
Initialize_47;
Initialize_48;
Initialize_49;
Initialize_50;
Initialize_51;
Initialize_52;
Initialize_53;
Initialize_54;
Initialize_55;
Initialize_56;
Initialize_57;
Initialize_58;
Initialize_59;
Initialize_60;
Initialize_61;
Initialize_62;
Initialize_63;
Initialize_64;
Initialize_65;
Initialize_66;
Initialize_67;
Initialize_68;
Initialize_69;
Initialize_70;
Initialize_71;
Initialize_72;
Initialize_73;
Initialize_74;
Initialize_75;
Initialize_76;
Initialize_77;
Initialize_78;
Initialize_79;
Initialize_80;
Initialize_81;
Initialize_82;
Initialize_83;
Initialize_84;
Initialize_85;
Initialize_86;
Initialize_87;
Initialize_88;
Initialize_89;
Initialize_90;
Initialize_91;
Initialize_92;
Initialize_93;
Initialize_94;
Initialize_95;
Initialize_96;
Initialize_97;
Initialize_98;
Initialize_99;
Initialize_100;
Initialize_101;
Initialize_102;
Initialize_103;
Initialize_104;
Initialize_105;
Initialize_106;
Initialize_107;
Initialize_108;
Initialize_109;
Initialize_110;
Initialize_111;
Initialize_112;
Initialize_113;
Initialize_114;
Initialize_115;
Initialize_116;
Initialize_117;
Initialize_118;
Initialize_119;
Initialize_120;
Initialize_121;
Initialize_122;
Initialize_123;
Initialize_124;
Initialize_125;
Initialize_126;
Initialize_127;
Initialize_128;
Initialize_129;
Initialize_130;
Initialize_131;
Initialize_132;
Initialize_133;
Initialize_134;
Initialize_135;
Initialize_136;
Initialize_137;
Initialize_138;
Initialize_139;
Initialize_140;
Initialize_141;
Initialize_142;
Initialize_143;
Initialize_144;
Initialize_145;
Initialize_146;
Initialize_147;
Initialize_148;
Initialize_149;
Initialize_150;
Initialize_151;
Initialize_152;
Initialize_153;
Initialize_154;
Initialize_155;
Initialize_156;
Initialize_157;
Initialize_158;
Initialize_159;
Initialize_160;
Initialize_161;
Initialize_162;
Initialize_163;
Initialize_164;
Initialize_165;
Initialize_166;
Initialize_167;
Initialize_168;
Initialize_169;
Initialize_170;
Initialize_171;
Initialize_172;
Initialize_173;
Initialize_174;
Initialize_175;
Initialize_176;
Initialize_177;
Initialize_178;
Initialize_179;
Initialize_180;
Initialize_181;
Initialize_182;
Initialize_183;
Initialize_184;
Initialize_185;
Initialize_186;
Initialize_187;
Initialize_188;
Initialize_189;
Initialize_190;
Initialize_191;
Initialize_192;
Initialize_193;
Initialize_194;
Initialize_195;
Initialize_196;
Initialize_197;
Initialize_198;
Initialize_199;
Initialize_200;
Initialize_201;
Initialize_202;
Initialize_203;
Initialize_204;
Initialize_205;
Initialize_206;
Initialize_207;
Initialize_208;
Initialize_209;
Initialize_210;
Initialize_211;
Initialize_212;
Initialize_213;
Initialize_214;
Initialize_215;
Initialize_216;
Initialize_217;
Initialize_218;
Initialize_219;
Initialize_220;
Initialize_221;
Initialize_222;
Initialize_223;
Initialize_224;
Initialize_225;
Initialize_226;
Initialize_227;
Initialize_228;
Initialize_229;
Initialize_230;
Initialize_231;
Initialize_232;
Initialize_233;
Initialize_234;
Initialize_235;
Initialize_236;
Initialize_237;
Initialize_238;
Initialize_239;
Initialize_240;
Initialize_241;
Initialize_242;
Initialize_243;
Initialize_244;
Initialize_245;
Initialize_246;
Initialize_247;
Initialize_248;
Initialize_249;
Initialize_250;
Initialize_251;
Initialize_252;
Initialize_253;
Initialize_254;
Initialize_255;
Initialize_256;
Initialize_257;
Initialize_258;
Initialize_259;
Initialize_260;
Initialize_261;
Initialize_262;
Initialize_263;
Initialize_264;
Initialize_265;
Initialize_266;
Initialize_267;
Initialize_268;
Initialize_269;
Initialize_270;
Initialize_271;
Initialize_272;
Initialize_273;
Initialize_274;
Initialize_275;
Initialize_276;
Initialize_277;
Initialize_278;
Initialize_279;
Initialize_280;
Initialize_281;
Initialize_282;
Initialize_283;
Initialize_284;
Initialize_285;
Initialize_286;
Initialize_287;
Initialize_288;
Initialize_289;
Initialize_290;
Initialize_291;
Initialize_292;
Initialize_293;
Initialize_294;
Initialize_295;
Initialize_296;
Initialize_297;
Initialize_298;
Initialize_299;
Initialize_300;
Initialize_301;
Initialize_302;
Initialize_303;
Initialize_304;
Initialize_305;
Initialize_306;
Initialize_307;
Initialize_308;
Initialize_309;
Initialize_310;
Initialize_311;
Initialize_312;
Initialize_313;
Initialize_314;
Initialize_315;
Initialize_316;
Initialize_317;
Initialize_318;
Initialize_319;
Initialize_320;
Initialize_321;
Initialize_322;
end Initialize;
------------------
-- Initialize_1 --
------------------
procedure Initialize_1 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 1,
AMF.Internals.Tables.DG_String_Data_01.MS_010C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 1, (Is_Empty => True));
end Initialize_1;
------------------
-- Initialize_2 --
------------------
procedure Initialize_2 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 2,
AMF.Internals.Tables.DG_String_Data_00.MS_0096'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 2, (Is_Empty => True));
end Initialize_2;
------------------
-- Initialize_3 --
------------------
procedure Initialize_3 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 3,
AMF.Internals.Tables.DG_String_Data_00.MS_0048'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 3, (Is_Empty => True));
end Initialize_3;
------------------
-- Initialize_4 --
------------------
procedure Initialize_4 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 4,
AMF.Internals.Tables.DG_String_Data_00.MS_00E5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 4, (Is_Empty => True));
end Initialize_4;
------------------
-- Initialize_5 --
------------------
procedure Initialize_5 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 5, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 5,
AMF.Internals.Tables.DG_String_Data_00.MS_0027'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 5, (Is_Empty => True));
end Initialize_5;
------------------
-- Initialize_6 --
------------------
procedure Initialize_6 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 6, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 6,
AMF.Internals.Tables.DG_String_Data_01.MS_011F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 6, (Is_Empty => True));
end Initialize_6;
------------------
-- Initialize_7 --
------------------
procedure Initialize_7 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Abstract (Base + 7, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 7,
AMF.Internals.Tables.DG_String_Data_00.MS_00F3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 7, (Is_Empty => True));
end Initialize_7;
------------------
-- Initialize_8 --
------------------
procedure Initialize_8 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 8,
AMF.Internals.Tables.DG_String_Data_01.MS_0122'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 8, (Is_Empty => True));
end Initialize_8;
------------------
-- Initialize_9 --
------------------
procedure Initialize_9 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 9,
AMF.Internals.Tables.DG_String_Data_00.MS_0046'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 9, (Is_Empty => True));
end Initialize_9;
-------------------
-- Initialize_10 --
-------------------
procedure Initialize_10 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 10,
AMF.Internals.Tables.DG_String_Data_00.MS_0033'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 10, (Is_Empty => True));
end Initialize_10;
-------------------
-- Initialize_11 --
-------------------
procedure Initialize_11 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 11,
AMF.Internals.Tables.DG_String_Data_00.MS_008F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 11, (Is_Empty => True));
end Initialize_11;
-------------------
-- Initialize_12 --
-------------------
procedure Initialize_12 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 12,
AMF.Internals.Tables.DG_String_Data_00.MS_00CA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 12, (Is_Empty => True));
end Initialize_12;
-------------------
-- Initialize_13 --
-------------------
procedure Initialize_13 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 13,
AMF.Internals.Tables.DG_String_Data_00.MS_005F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 13, (Is_Empty => True));
end Initialize_13;
-------------------
-- Initialize_14 --
-------------------
procedure Initialize_14 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 14,
AMF.Internals.Tables.DG_String_Data_00.MS_0072'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 14, (Is_Empty => True));
end Initialize_14;
-------------------
-- Initialize_15 --
-------------------
procedure Initialize_15 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 15,
AMF.Internals.Tables.DG_String_Data_00.MS_00D7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 15, (Is_Empty => True));
end Initialize_15;
-------------------
-- Initialize_16 --
-------------------
procedure Initialize_16 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 16,
AMF.Internals.Tables.DG_String_Data_00.MS_00E2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 16, (Is_Empty => True));
end Initialize_16;
-------------------
-- Initialize_17 --
-------------------
procedure Initialize_17 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 17,
AMF.Internals.Tables.DG_String_Data_00.MS_007C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 17, (Is_Empty => True));
end Initialize_17;
-------------------
-- Initialize_18 --
-------------------
procedure Initialize_18 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 18,
AMF.Internals.Tables.DG_String_Data_00.MS_002D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 18, (Is_Empty => True));
end Initialize_18;
-------------------
-- Initialize_19 --
-------------------
procedure Initialize_19 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 19,
AMF.Internals.Tables.DG_String_Data_00.MS_0029'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 19, (Is_Empty => True));
end Initialize_19;
-------------------
-- Initialize_20 --
-------------------
procedure Initialize_20 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 20,
AMF.Internals.Tables.DG_String_Data_00.MS_00DE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 20, (Is_Empty => True));
end Initialize_20;
-------------------
-- Initialize_21 --
-------------------
procedure Initialize_21 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 21,
AMF.Internals.Tables.DG_String_Data_00.MS_003B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 21, (Is_Empty => True));
end Initialize_21;
-------------------
-- Initialize_22 --
-------------------
procedure Initialize_22 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 22, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 22, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 22,
AMF.Internals.Tables.DG_String_Data_01.MS_0107'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 22, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 22, (False, AMF.CMOF.Public_Visibility));
end Initialize_22;
-------------------
-- Initialize_23 --
-------------------
procedure Initialize_23 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 23, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 23, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 23,
AMF.Internals.Tables.DG_String_Data_00.MS_00BF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 23, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 23, (False, AMF.CMOF.Public_Visibility));
end Initialize_23;
-------------------
-- Initialize_24 --
-------------------
procedure Initialize_24 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 24, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 24, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 24,
AMF.Internals.Tables.DG_String_Data_01.MS_0108'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 24, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 24, (False, AMF.CMOF.Public_Visibility));
end Initialize_24;
-------------------
-- Initialize_25 --
-------------------
procedure Initialize_25 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 25, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 25, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 25, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 25,
AMF.Internals.Tables.DG_String_Data_00.MS_0056'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 25, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 25, (False, AMF.CMOF.Public_Visibility));
end Initialize_25;
-------------------
-- Initialize_26 --
-------------------
procedure Initialize_26 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 26, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 26, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 26,
AMF.Internals.Tables.DG_String_Data_00.MS_00A4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 26, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 26, (False, AMF.CMOF.Public_Visibility));
end Initialize_26;
-------------------
-- Initialize_27 --
-------------------
procedure Initialize_27 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 27, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 27, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 27, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 27,
AMF.Internals.Tables.DG_String_Data_01.MS_011D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 27, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 27, (False, AMF.CMOF.Public_Visibility));
end Initialize_27;
-------------------
-- Initialize_28 --
-------------------
procedure Initialize_28 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 28, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 28,
AMF.Internals.Tables.DG_String_Data_01.MS_0117'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 28, (False, AMF.CMOF.Public_Visibility));
end Initialize_28;
-------------------
-- Initialize_29 --
-------------------
procedure Initialize_29 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 29, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 29,
AMF.Internals.Tables.DG_String_Data_01.MS_0114'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 29, (False, AMF.CMOF.Public_Visibility));
end Initialize_29;
-------------------
-- Initialize_30 --
-------------------
procedure Initialize_30 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 30,
AMF.Internals.Tables.DG_String_Data_00.MS_00BE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 30, (False, AMF.CMOF.Public_Visibility));
end Initialize_30;
-------------------
-- Initialize_31 --
-------------------
procedure Initialize_31 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 31,
AMF.Internals.Tables.DG_String_Data_00.MS_00EF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 31, (False, AMF.CMOF.Public_Visibility));
end Initialize_31;
-------------------
-- Initialize_32 --
-------------------
procedure Initialize_32 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 32,
AMF.Internals.Tables.DG_String_Data_00.MS_0017'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 32, (False, AMF.CMOF.Public_Visibility));
end Initialize_32;
-------------------
-- Initialize_33 --
-------------------
procedure Initialize_33 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 33,
AMF.Internals.Tables.DG_String_Data_00.MS_00BE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 33, (False, AMF.CMOF.Public_Visibility));
end Initialize_33;
-------------------
-- Initialize_34 --
-------------------
procedure Initialize_34 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 34,
AMF.Internals.Tables.DG_String_Data_00.MS_0036'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 34, (False, AMF.CMOF.Public_Visibility));
end Initialize_34;
-------------------
-- Initialize_35 --
-------------------
procedure Initialize_35 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 35,
AMF.Internals.Tables.DG_String_Data_00.MS_00B3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 35, (False, AMF.CMOF.Public_Visibility));
end Initialize_35;
-------------------
-- Initialize_36 --
-------------------
procedure Initialize_36 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 36, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Unique (Base + 36, False);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 36, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 36,
AMF.Internals.Tables.DG_String_Data_00.MS_00A5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 36, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 36, (False, AMF.CMOF.Public_Visibility));
end Initialize_36;
-------------------
-- Initialize_37 --
-------------------
procedure Initialize_37 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 37, (False, 2));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 37,
AMF.Internals.Tables.DG_String_Data_00.MS_0066'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 37, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 37, (False, AMF.CMOF.Public_Visibility));
end Initialize_37;
-------------------
-- Initialize_38 --
-------------------
procedure Initialize_38 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 38, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 38, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 38,
AMF.Internals.Tables.DG_String_Data_00.MS_003A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 38, (False, AMF.CMOF.Public_Visibility));
end Initialize_38;
-------------------
-- Initialize_39 --
-------------------
procedure Initialize_39 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 39, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 39,
AMF.Internals.Tables.DG_String_Data_00.MS_0016'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 39, (False, AMF.CMOF.Public_Visibility));
end Initialize_39;
-------------------
-- Initialize_40 --
-------------------
procedure Initialize_40 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 40, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Unique (Base + 40, False);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 40, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 40,
AMF.Internals.Tables.DG_String_Data_00.MS_00A5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 40, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 40, (False, AMF.CMOF.Public_Visibility));
end Initialize_40;
-------------------
-- Initialize_41 --
-------------------
procedure Initialize_41 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 41,
AMF.Internals.Tables.DG_String_Data_00.MS_008E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 41, (False, AMF.CMOF.Public_Visibility));
end Initialize_41;
-------------------
-- Initialize_42 --
-------------------
procedure Initialize_42 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 42,
AMF.Internals.Tables.DG_String_Data_00.MS_0081'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 42, (False, AMF.CMOF.Public_Visibility));
end Initialize_42;
-------------------
-- Initialize_43 --
-------------------
procedure Initialize_43 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 43,
AMF.Internals.Tables.DG_String_Data_00.MS_00F4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 43, (False, AMF.CMOF.Public_Visibility));
end Initialize_43;
-------------------
-- Initialize_44 --
-------------------
procedure Initialize_44 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 44,
AMF.Internals.Tables.DG_String_Data_00.MS_0023'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 44, (False, AMF.CMOF.Public_Visibility));
end Initialize_44;
-------------------
-- Initialize_45 --
-------------------
procedure Initialize_45 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 45,
AMF.Internals.Tables.DG_String_Data_00.MS_007B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 45, (False, AMF.CMOF.Public_Visibility));
end Initialize_45;
-------------------
-- Initialize_46 --
-------------------
procedure Initialize_46 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 46,
AMF.Internals.Tables.DG_String_Data_01.MS_0121'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 46,
AMF.Internals.Tables.DG_String_Data_00.MS_0006'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 46, (False, AMF.CMOF.Public_Visibility));
end Initialize_46;
-------------------
-- Initialize_47 --
-------------------
procedure Initialize_47 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 47,
AMF.Internals.Tables.DG_String_Data_00.MS_0037'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 47,
AMF.Internals.Tables.DG_String_Data_00.MS_0025'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 47, (False, AMF.CMOF.Public_Visibility));
end Initialize_47;
-------------------
-- Initialize_48 --
-------------------
procedure Initialize_48 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 48,
AMF.Internals.Tables.DG_String_Data_01.MS_0121'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 48,
AMF.Internals.Tables.DG_String_Data_00.MS_00A7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 48, (False, AMF.CMOF.Public_Visibility));
end Initialize_48;
-------------------
-- Initialize_49 --
-------------------
procedure Initialize_49 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 49,
AMF.Internals.Tables.DG_String_Data_00.MS_0037'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 49,
AMF.Internals.Tables.DG_String_Data_00.MS_0086'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 49, (False, AMF.CMOF.Public_Visibility));
end Initialize_49;
-------------------
-- Initialize_50 --
-------------------
procedure Initialize_50 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 50, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 50,
AMF.Internals.Tables.DG_String_Data_00.MS_00BD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 50, (False, AMF.CMOF.Public_Visibility));
end Initialize_50;
-------------------
-- Initialize_51 --
-------------------
procedure Initialize_51 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 51, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 51,
AMF.Internals.Tables.DG_String_Data_00.MS_00AE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 51, (False, AMF.CMOF.Public_Visibility));
end Initialize_51;
-------------------
-- Initialize_52 --
-------------------
procedure Initialize_52 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 52, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 52,
AMF.Internals.Tables.DG_String_Data_01.MS_0120'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 52, (False, AMF.CMOF.Public_Visibility));
end Initialize_52;
-------------------
-- Initialize_53 --
-------------------
procedure Initialize_53 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 53,
AMF.Internals.Tables.DG_String_Data_00.MS_00B3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 53, (False, AMF.CMOF.Public_Visibility));
end Initialize_53;
-------------------
-- Initialize_54 --
-------------------
procedure Initialize_54 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 54,
AMF.Internals.Tables.DG_String_Data_00.MS_0067'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 54, (False, AMF.CMOF.Public_Visibility));
end Initialize_54;
-------------------
-- Initialize_55 --
-------------------
procedure Initialize_55 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 55,
AMF.Internals.Tables.DG_String_Data_00.MS_0079'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 55, (False, AMF.CMOF.Public_Visibility));
end Initialize_55;
-------------------
-- Initialize_56 --
-------------------
procedure Initialize_56 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 56, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Unique (Base + 56, False);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 56, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 56,
AMF.Internals.Tables.DG_String_Data_01.MS_010A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 56, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 56, (False, AMF.CMOF.Public_Visibility));
end Initialize_56;
-------------------
-- Initialize_57 --
-------------------
procedure Initialize_57 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 57,
AMF.Internals.Tables.DG_String_Data_00.MS_008E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 57, (False, AMF.CMOF.Public_Visibility));
end Initialize_57;
-------------------
-- Initialize_58 --
-------------------
procedure Initialize_58 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Composite (Base + 58, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 58,
AMF.Internals.Tables.DG_String_Data_00.MS_0014'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 58, (False, AMF.CMOF.Public_Visibility));
end Initialize_58;
-------------------
-- Initialize_59 --
-------------------
procedure Initialize_59 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 59, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Unique (Base + 59, False);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 59, (False, 3));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 59,
AMF.Internals.Tables.DG_String_Data_00.MS_00FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 59, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 59, (False, AMF.CMOF.Public_Visibility));
end Initialize_59;
-------------------
-- Initialize_60 --
-------------------
procedure Initialize_60 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 60, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Unique (Base + 60, False);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 60, (False, 2));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 60,
AMF.Internals.Tables.DG_String_Data_00.MS_00FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 60, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 60, (False, AMF.CMOF.Public_Visibility));
end Initialize_60;
-------------------
-- Initialize_61 --
-------------------
procedure Initialize_61 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 61,
AMF.Internals.Tables.DG_String_Data_00.MS_0019'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 61,
AMF.Internals.Tables.DG_String_Data_00.MS_000E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 61, (False, AMF.CMOF.Public_Visibility));
end Initialize_61;
-------------------
-- Initialize_62 --
-------------------
procedure Initialize_62 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 62,
AMF.Internals.Tables.DG_String_Data_00.MS_0019'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 62,
AMF.Internals.Tables.DG_String_Data_00.MS_00B1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 62, (False, AMF.CMOF.Public_Visibility));
end Initialize_62;
-------------------
-- Initialize_63 --
-------------------
procedure Initialize_63 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 63,
AMF.Internals.Tables.DG_String_Data_00.MS_0019'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 63,
AMF.Internals.Tables.DG_String_Data_00.MS_00A8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 63, (False, AMF.CMOF.Public_Visibility));
end Initialize_63;
-------------------
-- Initialize_64 --
-------------------
procedure Initialize_64 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 64,
AMF.Internals.Tables.DG_String_Data_00.MS_0019'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 64,
AMF.Internals.Tables.DG_String_Data_00.MS_009D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 64, (False, AMF.CMOF.Public_Visibility));
end Initialize_64;
-------------------
-- Initialize_65 --
-------------------
procedure Initialize_65 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 65,
AMF.Internals.Tables.DG_String_Data_00.MS_0019'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 65,
AMF.Internals.Tables.DG_String_Data_00.MS_00EF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 65, (False, AMF.CMOF.Public_Visibility));
end Initialize_65;
-------------------
-- Initialize_66 --
-------------------
procedure Initialize_66 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 66,
AMF.Internals.Tables.DG_String_Data_00.MS_008E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 66, (False, AMF.CMOF.Public_Visibility));
end Initialize_66;
-------------------
-- Initialize_67 --
-------------------
procedure Initialize_67 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 67,
AMF.Internals.Tables.DG_String_Data_01.MS_0121'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 67,
AMF.Internals.Tables.DG_String_Data_00.MS_0039'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 67, (False, AMF.CMOF.Public_Visibility));
end Initialize_67;
-------------------
-- Initialize_68 --
-------------------
procedure Initialize_68 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 68, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 68,
AMF.Internals.Tables.DG_String_Data_01.MS_010D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 68, (False, AMF.CMOF.Public_Visibility));
end Initialize_68;
-------------------
-- Initialize_69 --
-------------------
procedure Initialize_69 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 69, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 69,
AMF.Internals.Tables.DG_String_Data_00.MS_0022'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 69, (False, AMF.CMOF.Public_Visibility));
end Initialize_69;
-------------------
-- Initialize_70 --
-------------------
procedure Initialize_70 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 70, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 70,
AMF.Internals.Tables.DG_String_Data_00.MS_0095'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 70, (False, AMF.CMOF.Public_Visibility));
end Initialize_70;
-------------------
-- Initialize_71 --
-------------------
procedure Initialize_71 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 71, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 71,
AMF.Internals.Tables.DG_String_Data_00.MS_00A9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 71, (False, AMF.CMOF.Public_Visibility));
end Initialize_71;
-------------------
-- Initialize_72 --
-------------------
procedure Initialize_72 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 72, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 72,
AMF.Internals.Tables.DG_String_Data_00.MS_00A1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 72, (False, AMF.CMOF.Public_Visibility));
end Initialize_72;
-------------------
-- Initialize_73 --
-------------------
procedure Initialize_73 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 73, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 73,
AMF.Internals.Tables.DG_String_Data_01.MS_0119'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 73, (False, AMF.CMOF.Public_Visibility));
end Initialize_73;
-------------------
-- Initialize_74 --
-------------------
procedure Initialize_74 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 74, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 74,
AMF.Internals.Tables.DG_String_Data_00.MS_0080'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 74, (False, AMF.CMOF.Public_Visibility));
end Initialize_74;
-------------------
-- Initialize_75 --
-------------------
procedure Initialize_75 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 75, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 75,
AMF.Internals.Tables.DG_String_Data_00.MS_0044'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 75, (False, AMF.CMOF.Public_Visibility));
end Initialize_75;
-------------------
-- Initialize_76 --
-------------------
procedure Initialize_76 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 76, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 76,
AMF.Internals.Tables.DG_String_Data_00.MS_00AF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 76, (False, AMF.CMOF.Public_Visibility));
end Initialize_76;
-------------------
-- Initialize_77 --
-------------------
procedure Initialize_77 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 77, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 77,
AMF.Internals.Tables.DG_String_Data_00.MS_001D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 77, (False, AMF.CMOF.Public_Visibility));
end Initialize_77;
-------------------
-- Initialize_78 --
-------------------
procedure Initialize_78 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 78, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 78,
AMF.Internals.Tables.DG_String_Data_00.MS_00A2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 78, (False, AMF.CMOF.Public_Visibility));
end Initialize_78;
-------------------
-- Initialize_79 --
-------------------
procedure Initialize_79 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Ordered (Base + 79, True);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Is_Unique (Base + 79, False);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 79, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 79,
AMF.Internals.Tables.DG_String_Data_01.MS_011C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 79, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 79, (False, AMF.CMOF.Public_Visibility));
end Initialize_79;
-------------------
-- Initialize_80 --
-------------------
procedure Initialize_80 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 80, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 80,
AMF.Internals.Tables.DG_String_Data_00.MS_0034'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 80, (False, AMF.CMOF.Public_Visibility));
end Initialize_80;
-------------------
-- Initialize_81 --
-------------------
procedure Initialize_81 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 81, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 81,
AMF.Internals.Tables.DG_String_Data_00.MS_006D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 81, (False, AMF.CMOF.Public_Visibility));
end Initialize_81;
-------------------
-- Initialize_82 --
-------------------
procedure Initialize_82 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 82,
AMF.Internals.Tables.DG_String_Data_00.MS_00E1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 82, (False, AMF.CMOF.Public_Visibility));
end Initialize_82;
-------------------
-- Initialize_83 --
-------------------
procedure Initialize_83 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 83,
AMF.Internals.Tables.DG_String_Data_00.MS_008E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 83, (False, AMF.CMOF.Public_Visibility));
end Initialize_83;
-------------------
-- Initialize_84 --
-------------------
procedure Initialize_84 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 84,
AMF.Internals.Tables.DG_String_Data_00.MS_00EE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 84, (False, AMF.CMOF.Public_Visibility));
end Initialize_84;
-------------------
-- Initialize_85 --
-------------------
procedure Initialize_85 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 85,
AMF.Internals.Tables.DG_String_Data_00.MS_00AD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 85, (False, AMF.CMOF.Private_Visibility));
end Initialize_85;
-------------------
-- Initialize_86 --
-------------------
procedure Initialize_86 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 86, (False, AMF.CMOF.Private_Visibility));
end Initialize_86;
-------------------
-- Initialize_87 --
-------------------
procedure Initialize_87 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 87,
AMF.Internals.Tables.DG_String_Data_01.MS_010F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 87, (False, AMF.CMOF.Private_Visibility));
end Initialize_87;
-------------------
-- Initialize_88 --
-------------------
procedure Initialize_88 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 88,
AMF.Internals.Tables.DG_String_Data_00.MS_001B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 88, (False, AMF.CMOF.Private_Visibility));
end Initialize_88;
-------------------
-- Initialize_89 --
-------------------
procedure Initialize_89 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 89,
AMF.Internals.Tables.DG_String_Data_00.MS_002C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 89, (False, AMF.CMOF.Private_Visibility));
end Initialize_89;
-------------------
-- Initialize_90 --
-------------------
procedure Initialize_90 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 90,
AMF.Internals.Tables.DG_String_Data_00.MS_0069'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 90, (False, AMF.CMOF.Private_Visibility));
end Initialize_90;
-------------------
-- Initialize_91 --
-------------------
procedure Initialize_91 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 91,
AMF.Internals.Tables.DG_String_Data_00.MS_0042'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 91, (False, AMF.CMOF.Private_Visibility));
end Initialize_91;
-------------------
-- Initialize_92 --
-------------------
procedure Initialize_92 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 92,
AMF.Internals.Tables.DG_String_Data_01.MS_0113'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 92, (False, AMF.CMOF.Private_Visibility));
end Initialize_92;
-------------------
-- Initialize_93 --
-------------------
procedure Initialize_93 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 93,
AMF.Internals.Tables.DG_String_Data_00.MS_00EB'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 93, (False, AMF.CMOF.Private_Visibility));
end Initialize_93;
-------------------
-- Initialize_94 --
-------------------
procedure Initialize_94 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 94,
AMF.Internals.Tables.DG_String_Data_00.MS_0068'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 94, (False, AMF.CMOF.Private_Visibility));
end Initialize_94;
-------------------
-- Initialize_95 --
-------------------
procedure Initialize_95 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 95,
AMF.Internals.Tables.DG_String_Data_00.MS_003C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 95, (False, AMF.CMOF.Private_Visibility));
end Initialize_95;
-------------------
-- Initialize_96 --
-------------------
procedure Initialize_96 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 96,
AMF.Internals.Tables.DG_String_Data_00.MS_004E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 96, (False, AMF.CMOF.Private_Visibility));
end Initialize_96;
-------------------
-- Initialize_97 --
-------------------
procedure Initialize_97 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 97,
AMF.Internals.Tables.DG_String_Data_00.MS_0055'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 97, (False, AMF.CMOF.Private_Visibility));
end Initialize_97;
-------------------
-- Initialize_98 --
-------------------
procedure Initialize_98 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 98,
AMF.Internals.Tables.DG_String_Data_00.MS_00F8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Uri
(Base + 98,
AMF.Internals.Tables.DG_String_Data_00.MS_00F7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 98, (Is_Empty => True));
end Initialize_98;
-------------------
-- Initialize_99 --
-------------------
procedure Initialize_99 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 99,
AMF.Internals.Tables.DG_String_Data_00.MS_0007'Access);
end Initialize_99;
--------------------
-- Initialize_100 --
--------------------
procedure Initialize_100 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 100, AMF.CMOF.Public_Visibility);
end Initialize_100;
--------------------
-- Initialize_101 --
--------------------
procedure Initialize_101 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 101,
AMF.Internals.Tables.DG_String_Data_01.MS_0103'Access);
end Initialize_101;
--------------------
-- Initialize_102 --
--------------------
procedure Initialize_102 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 102,
AMF.Internals.Tables.DG_String_Data_00.MS_0011'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 102, (Is_Empty => True));
end Initialize_102;
--------------------
-- Initialize_103 --
--------------------
procedure Initialize_103 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 103,
AMF.Internals.Tables.DG_String_Data_00.MS_0043'Access);
end Initialize_103;
--------------------
-- Initialize_104 --
--------------------
procedure Initialize_104 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 104, (Is_Empty => True));
end Initialize_104;
--------------------
-- Initialize_105 --
--------------------
procedure Initialize_105 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 105,
AMF.Internals.Tables.DG_String_Data_01.MS_011A'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 105, (Is_Empty => True));
end Initialize_105;
--------------------
-- Initialize_106 --
--------------------
procedure Initialize_106 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 106,
AMF.Internals.Tables.DG_String_Data_00.MS_002A'Access);
end Initialize_106;
--------------------
-- Initialize_107 --
--------------------
procedure Initialize_107 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 107, (Is_Empty => True));
end Initialize_107;
--------------------
-- Initialize_108 --
--------------------
procedure Initialize_108 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 108,
AMF.Internals.Tables.DG_String_Data_00.MS_002B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 108, (Is_Empty => True));
end Initialize_108;
--------------------
-- Initialize_109 --
--------------------
procedure Initialize_109 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 109,
AMF.Internals.Tables.DG_String_Data_00.MS_0084'Access);
end Initialize_109;
--------------------
-- Initialize_110 --
--------------------
procedure Initialize_110 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 110, (Is_Empty => True));
end Initialize_110;
--------------------
-- Initialize_111 --
--------------------
procedure Initialize_111 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 111,
AMF.Internals.Tables.DG_String_Data_00.MS_00EA'Access);
end Initialize_111;
--------------------
-- Initialize_112 --
--------------------
procedure Initialize_112 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 112,
AMF.Internals.Tables.DG_String_Data_00.MS_003F'Access);
end Initialize_112;
--------------------
-- Initialize_113 --
--------------------
procedure Initialize_113 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 113,
AMF.Internals.Tables.DG_String_Data_00.MS_0065'Access);
end Initialize_113;
--------------------
-- Initialize_114 --
--------------------
procedure Initialize_114 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 114,
AMF.Internals.Tables.DG_String_Data_00.MS_00CB'Access);
end Initialize_114;
--------------------
-- Initialize_115 --
--------------------
procedure Initialize_115 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 115,
AMF.Internals.Tables.DG_String_Data_00.MS_0060'Access);
end Initialize_115;
--------------------
-- Initialize_116 --
--------------------
procedure Initialize_116 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 116,
AMF.Internals.Tables.DG_String_Data_00.MS_004A'Access);
end Initialize_116;
--------------------
-- Initialize_117 --
--------------------
procedure Initialize_117 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 117,
AMF.Internals.Tables.DG_String_Data_00.MS_005A'Access);
end Initialize_117;
--------------------
-- Initialize_118 --
--------------------
procedure Initialize_118 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 118,
AMF.Internals.Tables.DG_String_Data_00.MS_0018'Access);
end Initialize_118;
--------------------
-- Initialize_119 --
--------------------
procedure Initialize_119 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 119,
AMF.Internals.Tables.DG_String_Data_00.MS_0070'Access);
end Initialize_119;
--------------------
-- Initialize_120 --
--------------------
procedure Initialize_120 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 120,
AMF.Internals.Tables.DG_String_Data_00.MS_006C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 120, (Is_Empty => True));
end Initialize_120;
--------------------
-- Initialize_121 --
--------------------
procedure Initialize_121 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 121,
AMF.Internals.Tables.DG_String_Data_00.MS_0057'Access);
end Initialize_121;
--------------------
-- Initialize_122 --
--------------------
procedure Initialize_122 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 122, (Is_Empty => True));
end Initialize_122;
--------------------
-- Initialize_123 --
--------------------
procedure Initialize_123 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 123,
AMF.Internals.Tables.DG_String_Data_00.MS_00FC'Access);
end Initialize_123;
--------------------
-- Initialize_124 --
--------------------
procedure Initialize_124 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 124,
AMF.Internals.Tables.DG_String_Data_01.MS_0102'Access);
end Initialize_124;
--------------------
-- Initialize_125 --
--------------------
procedure Initialize_125 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 125,
AMF.Internals.Tables.DG_String_Data_00.MS_00C3'Access);
end Initialize_125;
--------------------
-- Initialize_126 --
--------------------
procedure Initialize_126 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 126,
AMF.Internals.Tables.DG_String_Data_01.MS_010E'Access);
end Initialize_126;
--------------------
-- Initialize_127 --
--------------------
procedure Initialize_127 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 127,
AMF.Internals.Tables.DG_String_Data_00.MS_0092'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 127, (Is_Empty => True));
end Initialize_127;
--------------------
-- Initialize_128 --
--------------------
procedure Initialize_128 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 128,
AMF.Internals.Tables.DG_String_Data_00.MS_00C0'Access);
end Initialize_128;
--------------------
-- Initialize_129 --
--------------------
procedure Initialize_129 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 129,
AMF.Internals.Tables.DG_String_Data_00.MS_008D'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 129, (Is_Empty => True));
end Initialize_129;
--------------------
-- Initialize_130 --
--------------------
procedure Initialize_130 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 130,
AMF.Internals.Tables.DG_String_Data_00.MS_0020'Access);
end Initialize_130;
--------------------
-- Initialize_131 --
--------------------
procedure Initialize_131 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 131, (Is_Empty => True));
end Initialize_131;
--------------------
-- Initialize_132 --
--------------------
procedure Initialize_132 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 132,
AMF.Internals.Tables.DG_String_Data_00.MS_00F1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 132, (Is_Empty => True));
end Initialize_132;
--------------------
-- Initialize_133 --
--------------------
procedure Initialize_133 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 133,
AMF.Internals.Tables.DG_String_Data_00.MS_002E'Access);
end Initialize_133;
--------------------
-- Initialize_134 --
--------------------
procedure Initialize_134 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 134, (Is_Empty => True));
end Initialize_134;
--------------------
-- Initialize_135 --
--------------------
procedure Initialize_135 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 135,
AMF.Internals.Tables.DG_String_Data_00.MS_00EC'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 135, (False, AMF.CMOF.Public_Visibility));
end Initialize_135;
--------------------
-- Initialize_136 --
--------------------
procedure Initialize_136 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 136,
AMF.Internals.Tables.DG_String_Data_00.MS_00BB'Access);
end Initialize_136;
--------------------
-- Initialize_137 --
--------------------
procedure Initialize_137 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 137,
AMF.Internals.Tables.DG_String_Data_00.MS_00F9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 137, (False, AMF.CMOF.Public_Visibility));
end Initialize_137;
--------------------
-- Initialize_138 --
--------------------
procedure Initialize_138 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 138,
AMF.Internals.Tables.DG_String_Data_01.MS_0123'Access);
end Initialize_138;
--------------------
-- Initialize_139 --
--------------------
procedure Initialize_139 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 139,
AMF.Internals.Tables.DG_String_Data_00.MS_0037'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 139,
AMF.Internals.Tables.DG_String_Data_00.MS_0000'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 139, (False, AMF.CMOF.Public_Visibility));
end Initialize_139;
--------------------
-- Initialize_140 --
--------------------
procedure Initialize_140 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 140,
AMF.Internals.Tables.DG_String_Data_00.MS_0051'Access);
end Initialize_140;
--------------------
-- Initialize_141 --
--------------------
procedure Initialize_141 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 141,
AMF.Internals.Tables.DG_String_Data_00.MS_000A'Access);
end Initialize_141;
--------------------
-- Initialize_142 --
--------------------
procedure Initialize_142 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 142,
AMF.Internals.Tables.DG_String_Data_00.MS_001C'Access);
end Initialize_142;
--------------------
-- Initialize_143 --
--------------------
procedure Initialize_143 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 143,
AMF.Internals.Tables.DG_String_Data_00.MS_0082'Access);
end Initialize_143;
--------------------
-- Initialize_144 --
--------------------
procedure Initialize_144 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 144,
AMF.Internals.Tables.DG_String_Data_00.MS_000B'Access);
end Initialize_144;
--------------------
-- Initialize_145 --
--------------------
procedure Initialize_145 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 145,
AMF.Internals.Tables.DG_String_Data_00.MS_0050'Access);
end Initialize_145;
--------------------
-- Initialize_146 --
--------------------
procedure Initialize_146 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 146,
AMF.Internals.Tables.DG_String_Data_00.MS_00E6'Access);
end Initialize_146;
--------------------
-- Initialize_147 --
--------------------
procedure Initialize_147 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 147,
AMF.Internals.Tables.DG_String_Data_00.MS_00A6'Access);
end Initialize_147;
--------------------
-- Initialize_148 --
--------------------
procedure Initialize_148 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 148,
AMF.Internals.Tables.DG_String_Data_01.MS_0115'Access);
end Initialize_148;
--------------------
-- Initialize_149 --
--------------------
procedure Initialize_149 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 149,
AMF.Internals.Tables.DG_String_Data_00.MS_0038'Access);
end Initialize_149;
--------------------
-- Initialize_150 --
--------------------
procedure Initialize_150 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 150,
AMF.Internals.Tables.DG_String_Data_00.MS_007D'Access);
end Initialize_150;
--------------------
-- Initialize_151 --
--------------------
procedure Initialize_151 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 151,
AMF.Internals.Tables.DG_String_Data_00.MS_00E8'Access);
end Initialize_151;
--------------------
-- Initialize_152 --
--------------------
procedure Initialize_152 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 152,
AMF.Internals.Tables.DG_String_Data_01.MS_0109'Access);
end Initialize_152;
--------------------
-- Initialize_153 --
--------------------
procedure Initialize_153 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 153,
AMF.Internals.Tables.DG_String_Data_00.MS_00D2'Access);
end Initialize_153;
--------------------
-- Initialize_154 --
--------------------
procedure Initialize_154 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 154,
AMF.Internals.Tables.DG_String_Data_00.MS_009F'Access);
end Initialize_154;
--------------------
-- Initialize_155 --
--------------------
procedure Initialize_155 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 155,
AMF.Internals.Tables.DG_String_Data_00.MS_00AC'Access);
end Initialize_155;
--------------------
-- Initialize_156 --
--------------------
procedure Initialize_156 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 156,
AMF.Internals.Tables.DG_String_Data_00.MS_0049'Access);
end Initialize_156;
--------------------
-- Initialize_157 --
--------------------
procedure Initialize_157 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 157,
AMF.Internals.Tables.DG_String_Data_00.MS_0074'Access);
end Initialize_157;
--------------------
-- Initialize_158 --
--------------------
procedure Initialize_158 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 158,
AMF.Internals.Tables.DG_String_Data_00.MS_0058'Access);
end Initialize_158;
--------------------
-- Initialize_159 --
--------------------
procedure Initialize_159 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 159,
AMF.Internals.Tables.DG_String_Data_01.MS_0116'Access);
end Initialize_159;
--------------------
-- Initialize_160 --
--------------------
procedure Initialize_160 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 160,
AMF.Internals.Tables.DG_String_Data_00.MS_00DC'Access);
end Initialize_160;
--------------------
-- Initialize_161 --
--------------------
procedure Initialize_161 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 161,
AMF.Internals.Tables.DG_String_Data_00.MS_00D6'Access);
end Initialize_161;
--------------------
-- Initialize_162 --
--------------------
procedure Initialize_162 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 162,
AMF.Internals.Tables.DG_String_Data_00.MS_00E0'Access);
end Initialize_162;
--------------------
-- Initialize_163 --
--------------------
procedure Initialize_163 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 163,
AMF.Internals.Tables.DG_String_Data_00.MS_00B7'Access);
end Initialize_163;
--------------------
-- Initialize_164 --
--------------------
procedure Initialize_164 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 164,
AMF.Internals.Tables.DG_String_Data_00.MS_007A'Access);
end Initialize_164;
--------------------
-- Initialize_165 --
--------------------
procedure Initialize_165 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 165,
AMF.Internals.Tables.DG_String_Data_00.MS_00A3'Access);
end Initialize_165;
--------------------
-- Initialize_166 --
--------------------
procedure Initialize_166 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 166,
AMF.Internals.Tables.DG_String_Data_00.MS_006A'Access);
end Initialize_166;
--------------------
-- Initialize_167 --
--------------------
procedure Initialize_167 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 167,
AMF.Internals.Tables.DG_String_Data_00.MS_00E3'Access);
end Initialize_167;
--------------------
-- Initialize_168 --
--------------------
procedure Initialize_168 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 168,
AMF.Internals.Tables.DG_String_Data_00.MS_00B4'Access);
end Initialize_168;
--------------------
-- Initialize_169 --
--------------------
procedure Initialize_169 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 169,
AMF.Internals.Tables.DG_String_Data_00.MS_0077'Access);
end Initialize_169;
--------------------
-- Initialize_170 --
--------------------
procedure Initialize_170 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 170,
AMF.Internals.Tables.DG_String_Data_00.MS_0012'Access);
end Initialize_170;
--------------------
-- Initialize_171 --
--------------------
procedure Initialize_171 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 171,
AMF.Internals.Tables.DG_String_Data_00.MS_0028'Access);
end Initialize_171;
--------------------
-- Initialize_172 --
--------------------
procedure Initialize_172 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 172,
AMF.Internals.Tables.DG_String_Data_00.MS_00DA'Access);
end Initialize_172;
--------------------
-- Initialize_173 --
--------------------
procedure Initialize_173 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 173,
AMF.Internals.Tables.DG_String_Data_00.MS_0063'Access);
end Initialize_173;
--------------------
-- Initialize_174 --
--------------------
procedure Initialize_174 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 174,
AMF.Internals.Tables.DG_String_Data_00.MS_00F2'Access);
end Initialize_174;
--------------------
-- Initialize_175 --
--------------------
procedure Initialize_175 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 175,
AMF.Internals.Tables.DG_String_Data_00.MS_0008'Access);
end Initialize_175;
--------------------
-- Initialize_176 --
--------------------
procedure Initialize_176 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 176,
AMF.Internals.Tables.DG_String_Data_00.MS_0004'Access);
end Initialize_176;
--------------------
-- Initialize_177 --
--------------------
procedure Initialize_177 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 177,
AMF.Internals.Tables.DG_String_Data_00.MS_005D'Access);
end Initialize_177;
--------------------
-- Initialize_178 --
--------------------
procedure Initialize_178 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 178,
AMF.Internals.Tables.DG_String_Data_00.MS_00BA'Access);
end Initialize_178;
--------------------
-- Initialize_179 --
--------------------
procedure Initialize_179 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 179,
AMF.Internals.Tables.DG_String_Data_00.MS_00FB'Access);
end Initialize_179;
--------------------
-- Initialize_180 --
--------------------
procedure Initialize_180 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 180,
AMF.Internals.Tables.DG_String_Data_00.MS_0061'Access);
end Initialize_180;
--------------------
-- Initialize_181 --
--------------------
procedure Initialize_181 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 181,
AMF.Internals.Tables.DG_String_Data_00.MS_001F'Access);
end Initialize_181;
--------------------
-- Initialize_182 --
--------------------
procedure Initialize_182 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 182,
AMF.Internals.Tables.DG_String_Data_00.MS_00CE'Access);
end Initialize_182;
--------------------
-- Initialize_183 --
--------------------
procedure Initialize_183 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 183,
AMF.Internals.Tables.DG_String_Data_00.MS_005B'Access);
end Initialize_183;
--------------------
-- Initialize_184 --
--------------------
procedure Initialize_184 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 184,
AMF.Internals.Tables.DG_String_Data_00.MS_003D'Access);
end Initialize_184;
--------------------
-- Initialize_185 --
--------------------
procedure Initialize_185 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 185,
AMF.Internals.Tables.DG_String_Data_00.MS_0071'Access);
end Initialize_185;
--------------------
-- Initialize_186 --
--------------------
procedure Initialize_186 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 186,
AMF.Internals.Tables.DG_String_Data_01.MS_0104'Access);
end Initialize_186;
--------------------
-- Initialize_187 --
--------------------
procedure Initialize_187 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 187,
AMF.Internals.Tables.DG_String_Data_00.MS_00B5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 187, (Is_Empty => True));
end Initialize_187;
--------------------
-- Initialize_188 --
--------------------
procedure Initialize_188 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 188,
AMF.Internals.Tables.DG_String_Data_00.MS_001A'Access);
end Initialize_188;
--------------------
-- Initialize_189 --
--------------------
procedure Initialize_189 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 189,
AMF.Internals.Tables.DG_String_Data_00.MS_00C9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 189, (Is_Empty => True));
end Initialize_189;
--------------------
-- Initialize_190 --
--------------------
procedure Initialize_190 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 190,
AMF.Internals.Tables.DG_String_Data_00.MS_008C'Access);
end Initialize_190;
--------------------
-- Initialize_191 --
--------------------
procedure Initialize_191 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 191,
AMF.Internals.Tables.DG_String_Data_00.MS_00A0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 191, (False, AMF.CMOF.Public_Visibility));
end Initialize_191;
--------------------
-- Initialize_192 --
--------------------
procedure Initialize_192 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 192,
AMF.Internals.Tables.DG_String_Data_00.MS_001E'Access);
end Initialize_192;
--------------------
-- Initialize_193 --
--------------------
procedure Initialize_193 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 193,
AMF.Internals.Tables.DG_String_Data_00.MS_009E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 193, (False, AMF.CMOF.Public_Visibility));
end Initialize_193;
--------------------
-- Initialize_194 --
--------------------
procedure Initialize_194 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 194,
AMF.Internals.Tables.DG_String_Data_00.MS_00B6'Access);
end Initialize_194;
--------------------
-- Initialize_195 --
--------------------
procedure Initialize_195 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 195,
AMF.Internals.Tables.DG_String_Data_00.MS_0088'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 195, (Is_Empty => True));
end Initialize_195;
--------------------
-- Initialize_196 --
--------------------
procedure Initialize_196 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 196,
AMF.Internals.Tables.DG_String_Data_00.MS_0009'Access);
end Initialize_196;
--------------------
-- Initialize_197 --
--------------------
procedure Initialize_197 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 197,
AMF.Internals.Tables.DG_String_Data_00.MS_00C7'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 197, (Is_Empty => True));
end Initialize_197;
--------------------
-- Initialize_198 --
--------------------
procedure Initialize_198 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 198,
AMF.Internals.Tables.DG_String_Data_01.MS_0112'Access);
end Initialize_198;
--------------------
-- Initialize_199 --
--------------------
procedure Initialize_199 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 199, (Is_Empty => True));
end Initialize_199;
--------------------
-- Initialize_200 --
--------------------
procedure Initialize_200 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 200,
AMF.Internals.Tables.DG_String_Data_00.MS_00ED'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 200, (False, AMF.CMOF.Public_Visibility));
end Initialize_200;
--------------------
-- Initialize_201 --
--------------------
procedure Initialize_201 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 201,
AMF.Internals.Tables.DG_String_Data_00.MS_00FA'Access);
end Initialize_201;
--------------------
-- Initialize_202 --
--------------------
procedure Initialize_202 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 202,
AMF.Internals.Tables.DG_String_Data_00.MS_0087'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 202, (False, AMF.CMOF.Public_Visibility));
end Initialize_202;
--------------------
-- Initialize_203 --
--------------------
procedure Initialize_203 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 203,
AMF.Internals.Tables.DG_String_Data_00.MS_0053'Access);
end Initialize_203;
--------------------
-- Initialize_204 --
--------------------
procedure Initialize_204 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 204,
AMF.Internals.Tables.DG_String_Data_01.MS_0110'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 204, (Is_Empty => True));
end Initialize_204;
--------------------
-- Initialize_205 --
--------------------
procedure Initialize_205 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 205,
AMF.Internals.Tables.DG_String_Data_00.MS_00AB'Access);
end Initialize_205;
--------------------
-- Initialize_206 --
--------------------
procedure Initialize_206 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 206,
AMF.Internals.Tables.DG_String_Data_01.MS_010B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 206, (False, AMF.CMOF.Public_Visibility));
end Initialize_206;
--------------------
-- Initialize_207 --
--------------------
procedure Initialize_207 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 207,
AMF.Internals.Tables.DG_String_Data_00.MS_004D'Access);
end Initialize_207;
--------------------
-- Initialize_208 --
--------------------
procedure Initialize_208 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 208, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 208,
AMF.Internals.Tables.DG_String_Data_00.MS_00BE'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 208, (False, AMF.CMOF.Public_Visibility));
end Initialize_208;
--------------------
-- Initialize_209 --
--------------------
procedure Initialize_209 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 209,
AMF.Internals.Tables.DG_String_Data_00.MS_0045'Access);
end Initialize_209;
--------------------
-- Initialize_210 --
--------------------
procedure Initialize_210 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 210, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 210,
AMF.Internals.Tables.DG_String_Data_00.MS_004C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 210, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 210, (False, AMF.CMOF.Public_Visibility));
end Initialize_210;
--------------------
-- Initialize_211 --
--------------------
procedure Initialize_211 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 211, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 211,
AMF.Internals.Tables.DG_String_Data_00.MS_004C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 211, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 211, (False, AMF.CMOF.Public_Visibility));
end Initialize_211;
--------------------
-- Initialize_212 --
--------------------
procedure Initialize_212 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 212,
AMF.Internals.Tables.DG_String_Data_00.MS_0015'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 212, (Is_Empty => True));
end Initialize_212;
--------------------
-- Initialize_213 --
--------------------
procedure Initialize_213 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 213,
AMF.Internals.Tables.DG_String_Data_00.MS_0041'Access);
end Initialize_213;
--------------------
-- Initialize_214 --
--------------------
procedure Initialize_214 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 214,
AMF.Internals.Tables.DG_String_Data_00.MS_00B8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 214, (False, AMF.CMOF.Public_Visibility));
end Initialize_214;
--------------------
-- Initialize_215 --
--------------------
procedure Initialize_215 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 215,
AMF.Internals.Tables.DG_String_Data_00.MS_0093'Access);
end Initialize_215;
--------------------
-- Initialize_216 --
--------------------
procedure Initialize_216 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 216,
AMF.Internals.Tables.DG_String_Data_00.MS_00F0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 216, (False, AMF.CMOF.Public_Visibility));
end Initialize_216;
--------------------
-- Initialize_217 --
--------------------
procedure Initialize_217 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 217,
AMF.Internals.Tables.DG_String_Data_00.MS_0032'Access);
end Initialize_217;
--------------------
-- Initialize_218 --
--------------------
procedure Initialize_218 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 218, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 218,
AMF.Internals.Tables.DG_String_Data_00.MS_004C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 218, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 218, (False, AMF.CMOF.Public_Visibility));
end Initialize_218;
--------------------
-- Initialize_219 --
--------------------
procedure Initialize_219 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 219,
AMF.Internals.Tables.DG_String_Data_00.MS_000F'Access);
end Initialize_219;
--------------------
-- Initialize_220 --
--------------------
procedure Initialize_220 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 220,
AMF.Internals.Tables.DG_String_Data_00.MS_0078'Access);
end Initialize_220;
--------------------
-- Initialize_221 --
--------------------
procedure Initialize_221 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 221,
AMF.Internals.Tables.DG_String_Data_00.MS_00E7'Access);
end Initialize_221;
--------------------
-- Initialize_222 --
--------------------
procedure Initialize_222 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 222,
AMF.Internals.Tables.DG_String_Data_00.MS_0040'Access);
end Initialize_222;
--------------------
-- Initialize_223 --
--------------------
procedure Initialize_223 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 223,
AMF.Internals.Tables.DG_String_Data_00.MS_00D8'Access);
end Initialize_223;
--------------------
-- Initialize_224 --
--------------------
procedure Initialize_224 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 224,
AMF.Internals.Tables.DG_String_Data_00.MS_0094'Access);
end Initialize_224;
--------------------
-- Initialize_225 --
--------------------
procedure Initialize_225 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 225,
AMF.Internals.Tables.DG_String_Data_00.MS_00C6'Access);
end Initialize_225;
--------------------
-- Initialize_226 --
--------------------
procedure Initialize_226 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 226,
AMF.Internals.Tables.DG_String_Data_00.MS_0024'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 226, (Is_Empty => True));
end Initialize_226;
--------------------
-- Initialize_227 --
--------------------
procedure Initialize_227 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 227,
AMF.Internals.Tables.DG_String_Data_00.MS_00B2'Access);
end Initialize_227;
--------------------
-- Initialize_228 --
--------------------
procedure Initialize_228 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 228, (Is_Empty => True));
end Initialize_228;
--------------------
-- Initialize_229 --
--------------------
procedure Initialize_229 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 229,
AMF.Internals.Tables.DG_String_Data_01.MS_0111'Access);
end Initialize_229;
--------------------
-- Initialize_230 --
--------------------
procedure Initialize_230 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 230,
AMF.Internals.Tables.DG_String_Data_00.MS_00BC'Access);
end Initialize_230;
--------------------
-- Initialize_231 --
--------------------
procedure Initialize_231 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 231,
AMF.Internals.Tables.DG_String_Data_00.MS_00CC'Access);
end Initialize_231;
--------------------
-- Initialize_232 --
--------------------
procedure Initialize_232 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 232,
AMF.Internals.Tables.DG_String_Data_00.MS_00D5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 232, (Is_Empty => True));
end Initialize_232;
--------------------
-- Initialize_233 --
--------------------
procedure Initialize_233 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 233,
AMF.Internals.Tables.DG_String_Data_00.MS_006E'Access);
end Initialize_233;
--------------------
-- Initialize_234 --
--------------------
procedure Initialize_234 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 234, (Is_Empty => True));
end Initialize_234;
--------------------
-- Initialize_235 --
--------------------
procedure Initialize_235 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 235,
AMF.Internals.Tables.DG_String_Data_00.MS_0031'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 235, (Is_Empty => True));
end Initialize_235;
--------------------
-- Initialize_236 --
--------------------
procedure Initialize_236 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 236,
AMF.Internals.Tables.DG_String_Data_00.MS_00E4'Access);
end Initialize_236;
--------------------
-- Initialize_237 --
--------------------
procedure Initialize_237 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 237, (Is_Empty => True));
end Initialize_237;
--------------------
-- Initialize_238 --
--------------------
procedure Initialize_238 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 238,
AMF.Internals.Tables.DG_String_Data_00.MS_0035'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 238, (Is_Empty => True));
end Initialize_238;
--------------------
-- Initialize_239 --
--------------------
procedure Initialize_239 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 239,
AMF.Internals.Tables.DG_String_Data_00.MS_00E4'Access);
end Initialize_239;
--------------------
-- Initialize_240 --
--------------------
procedure Initialize_240 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 240, (Is_Empty => True));
end Initialize_240;
--------------------
-- Initialize_241 --
--------------------
procedure Initialize_241 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 241,
AMF.Internals.Tables.DG_String_Data_00.MS_005E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 241, (Is_Empty => True));
end Initialize_241;
--------------------
-- Initialize_242 --
--------------------
procedure Initialize_242 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 242,
AMF.Internals.Tables.DG_String_Data_00.MS_008A'Access);
end Initialize_242;
--------------------
-- Initialize_243 --
--------------------
procedure Initialize_243 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 243, (Is_Empty => True));
end Initialize_243;
--------------------
-- Initialize_244 --
--------------------
procedure Initialize_244 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 244,
AMF.Internals.Tables.DG_String_Data_00.MS_0076'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 244, (Is_Empty => True));
end Initialize_244;
--------------------
-- Initialize_245 --
--------------------
procedure Initialize_245 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 245,
AMF.Internals.Tables.DG_String_Data_00.MS_0005'Access);
end Initialize_245;
--------------------
-- Initialize_246 --
--------------------
procedure Initialize_246 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 246, (Is_Empty => True));
end Initialize_246;
--------------------
-- Initialize_247 --
--------------------
procedure Initialize_247 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 247,
AMF.Internals.Tables.DG_String_Data_01.MS_0106'Access);
end Initialize_247;
--------------------
-- Initialize_248 --
--------------------
procedure Initialize_248 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 248,
AMF.Internals.Tables.DG_String_Data_00.MS_00C5'Access);
end Initialize_248;
--------------------
-- Initialize_249 --
--------------------
procedure Initialize_249 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 249,
AMF.Internals.Tables.DG_String_Data_00.MS_005C'Access);
end Initialize_249;
--------------------
-- Initialize_250 --
--------------------
procedure Initialize_250 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 250,
AMF.Internals.Tables.DG_String_Data_00.MS_00DF'Access);
end Initialize_250;
--------------------
-- Initialize_251 --
--------------------
procedure Initialize_251 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 251,
AMF.Internals.Tables.DG_String_Data_01.MS_0105'Access);
end Initialize_251;
--------------------
-- Initialize_252 --
--------------------
procedure Initialize_252 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 252,
AMF.Internals.Tables.DG_String_Data_00.MS_006B'Access);
end Initialize_252;
--------------------
-- Initialize_253 --
--------------------
procedure Initialize_253 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 253,
AMF.Internals.Tables.DG_String_Data_00.MS_0030'Access);
end Initialize_253;
--------------------
-- Initialize_254 --
--------------------
procedure Initialize_254 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 254,
AMF.Internals.Tables.DG_String_Data_00.MS_0089'Access);
end Initialize_254;
--------------------
-- Initialize_255 --
--------------------
procedure Initialize_255 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 255,
AMF.Internals.Tables.DG_String_Data_00.MS_007E'Access);
end Initialize_255;
--------------------
-- Initialize_256 --
--------------------
procedure Initialize_256 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 256,
AMF.Internals.Tables.DG_String_Data_00.MS_0003'Access);
end Initialize_256;
--------------------
-- Initialize_257 --
--------------------
procedure Initialize_257 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 257,
AMF.Internals.Tables.DG_String_Data_00.MS_00B0'Access);
end Initialize_257;
--------------------
-- Initialize_258 --
--------------------
procedure Initialize_258 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 258,
AMF.Internals.Tables.DG_String_Data_00.MS_00F6'Access);
end Initialize_258;
--------------------
-- Initialize_259 --
--------------------
procedure Initialize_259 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 259,
AMF.Internals.Tables.DG_String_Data_00.MS_00B9'Access);
end Initialize_259;
--------------------
-- Initialize_260 --
--------------------
procedure Initialize_260 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 260,
AMF.Internals.Tables.DG_String_Data_00.MS_0091'Access);
end Initialize_260;
--------------------
-- Initialize_261 --
--------------------
procedure Initialize_261 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 261, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 261,
AMF.Internals.Tables.DG_String_Data_00.MS_00F5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 261, (False, AMF.CMOF.Public_Visibility));
end Initialize_261;
--------------------
-- Initialize_262 --
--------------------
procedure Initialize_262 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 262,
AMF.Internals.Tables.DG_String_Data_00.MS_0021'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 262, (Is_Empty => True));
end Initialize_262;
--------------------
-- Initialize_263 --
--------------------
procedure Initialize_263 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 263,
AMF.Internals.Tables.DG_String_Data_00.MS_0075'Access);
end Initialize_263;
--------------------
-- Initialize_264 --
--------------------
procedure Initialize_264 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 264,
AMF.Internals.Tables.DG_String_Data_01.MS_0101'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 264, (False, AMF.CMOF.Public_Visibility));
end Initialize_264;
--------------------
-- Initialize_265 --
--------------------
procedure Initialize_265 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 265,
AMF.Internals.Tables.DG_String_Data_00.MS_00D1'Access);
end Initialize_265;
--------------------
-- Initialize_266 --
--------------------
procedure Initialize_266 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 266,
AMF.Internals.Tables.DG_String_Data_00.MS_009B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 266, (False, AMF.CMOF.Public_Visibility));
end Initialize_266;
--------------------
-- Initialize_267 --
--------------------
procedure Initialize_267 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 267,
AMF.Internals.Tables.DG_String_Data_00.MS_002F'Access);
end Initialize_267;
--------------------
-- Initialize_268 --
--------------------
procedure Initialize_268 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 268,
AMF.Internals.Tables.DG_String_Data_00.MS_00C1'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 268, (False, AMF.CMOF.Public_Visibility));
end Initialize_268;
--------------------
-- Initialize_269 --
--------------------
procedure Initialize_269 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 269,
AMF.Internals.Tables.DG_String_Data_00.MS_000C'Access);
end Initialize_269;
--------------------
-- Initialize_270 --
--------------------
procedure Initialize_270 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 270,
AMF.Internals.Tables.DG_String_Data_00.MS_0002'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 270, (False, AMF.CMOF.Public_Visibility));
end Initialize_270;
--------------------
-- Initialize_271 --
--------------------
procedure Initialize_271 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 271,
AMF.Internals.Tables.DG_String_Data_00.MS_00DD'Access);
end Initialize_271;
--------------------
-- Initialize_272 --
--------------------
procedure Initialize_272 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 272,
AMF.Internals.Tables.DG_String_Data_00.MS_00C8'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 272, (False, AMF.CMOF.Public_Visibility));
end Initialize_272;
--------------------
-- Initialize_273 --
--------------------
procedure Initialize_273 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 273,
AMF.Internals.Tables.DG_String_Data_00.MS_0010'Access);
end Initialize_273;
--------------------
-- Initialize_274 --
--------------------
procedure Initialize_274 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 274,
AMF.Internals.Tables.DG_String_Data_01.MS_0118'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 274, (False, AMF.CMOF.Public_Visibility));
end Initialize_274;
--------------------
-- Initialize_275 --
--------------------
procedure Initialize_275 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 275,
AMF.Internals.Tables.DG_String_Data_00.MS_00C4'Access);
end Initialize_275;
--------------------
-- Initialize_276 --
--------------------
procedure Initialize_276 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 276,
AMF.Internals.Tables.DG_String_Data_00.MS_00AA'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 276, (Is_Empty => True));
end Initialize_276;
--------------------
-- Initialize_277 --
--------------------
procedure Initialize_277 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 277,
AMF.Internals.Tables.DG_String_Data_00.MS_009A'Access);
end Initialize_277;
--------------------
-- Initialize_278 --
--------------------
procedure Initialize_278 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Default
(Base + 278,
AMF.Internals.Tables.DG_String_Data_00.MS_0090'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 278,
AMF.Internals.Tables.DG_String_Data_00.MS_007F'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 278, (False, AMF.CMOF.Public_Visibility));
end Initialize_278;
--------------------
-- Initialize_279 --
--------------------
procedure Initialize_279 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 279,
AMF.Internals.Tables.DG_String_Data_00.MS_000D'Access);
end Initialize_279;
--------------------
-- Initialize_280 --
--------------------
procedure Initialize_280 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 280,
AMF.Internals.Tables.DG_String_Data_00.MS_0059'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 280, (Is_Empty => True));
end Initialize_280;
--------------------
-- Initialize_281 --
--------------------
procedure Initialize_281 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 281,
AMF.Internals.Tables.DG_String_Data_00.MS_0054'Access);
end Initialize_281;
--------------------
-- Initialize_282 --
--------------------
procedure Initialize_282 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 282,
AMF.Internals.Tables.DG_String_Data_00.MS_00FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 282, (False, AMF.CMOF.Public_Visibility));
end Initialize_282;
--------------------
-- Initialize_283 --
--------------------
procedure Initialize_283 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 283,
AMF.Internals.Tables.DG_String_Data_00.MS_0013'Access);
end Initialize_283;
--------------------
-- Initialize_284 --
--------------------
procedure Initialize_284 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 284,
AMF.Internals.Tables.DG_String_Data_01.MS_0100'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 284, (Is_Empty => True));
end Initialize_284;
--------------------
-- Initialize_285 --
--------------------
procedure Initialize_285 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 285,
AMF.Internals.Tables.DG_String_Data_00.MS_00FE'Access);
end Initialize_285;
--------------------
-- Initialize_286 --
--------------------
procedure Initialize_286 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 286,
AMF.Internals.Tables.DG_String_Data_00.MS_00FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 286, (False, AMF.CMOF.Public_Visibility));
end Initialize_286;
--------------------
-- Initialize_287 --
--------------------
procedure Initialize_287 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 287,
AMF.Internals.Tables.DG_String_Data_00.MS_003E'Access);
end Initialize_287;
--------------------
-- Initialize_288 --
--------------------
procedure Initialize_288 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 288,
AMF.Internals.Tables.DG_String_Data_01.MS_011E'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 288, (Is_Empty => True));
end Initialize_288;
--------------------
-- Initialize_289 --
--------------------
procedure Initialize_289 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 289,
AMF.Internals.Tables.DG_String_Data_00.MS_006F'Access);
end Initialize_289;
--------------------
-- Initialize_290 --
--------------------
procedure Initialize_290 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 290,
AMF.Internals.Tables.DG_String_Data_00.MS_00FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 290, (False, AMF.CMOF.Public_Visibility));
end Initialize_290;
--------------------
-- Initialize_291 --
--------------------
procedure Initialize_291 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 291,
AMF.Internals.Tables.DG_String_Data_00.MS_00CF'Access);
end Initialize_291;
--------------------
-- Initialize_292 --
--------------------
procedure Initialize_292 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 292,
AMF.Internals.Tables.DG_String_Data_00.MS_0026'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 292, (False, AMF.CMOF.Public_Visibility));
end Initialize_292;
--------------------
-- Initialize_293 --
--------------------
procedure Initialize_293 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 293,
AMF.Internals.Tables.DG_String_Data_00.MS_0097'Access);
end Initialize_293;
--------------------
-- Initialize_294 --
--------------------
procedure Initialize_294 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 294,
AMF.Internals.Tables.DG_String_Data_00.MS_00C2'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 294, (False, AMF.CMOF.Public_Visibility));
end Initialize_294;
--------------------
-- Initialize_295 --
--------------------
procedure Initialize_295 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 295,
AMF.Internals.Tables.DG_String_Data_00.MS_00DB'Access);
end Initialize_295;
--------------------
-- Initialize_296 --
--------------------
procedure Initialize_296 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 296,
AMF.Internals.Tables.DG_String_Data_00.MS_0085'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 296, (Is_Empty => True));
end Initialize_296;
--------------------
-- Initialize_297 --
--------------------
procedure Initialize_297 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 297,
AMF.Internals.Tables.DG_String_Data_00.MS_0001'Access);
end Initialize_297;
--------------------
-- Initialize_298 --
--------------------
procedure Initialize_298 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 298,
AMF.Internals.Tables.DG_String_Data_00.MS_00FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 298, (False, AMF.CMOF.Public_Visibility));
end Initialize_298;
--------------------
-- Initialize_299 --
--------------------
procedure Initialize_299 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 299,
AMF.Internals.Tables.DG_String_Data_00.MS_004B'Access);
end Initialize_299;
--------------------
-- Initialize_300 --
--------------------
procedure Initialize_300 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 300,
AMF.Internals.Tables.DG_String_Data_00.MS_00D9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 300, (False, AMF.CMOF.Public_Visibility));
end Initialize_300;
--------------------
-- Initialize_301 --
--------------------
procedure Initialize_301 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 301,
AMF.Internals.Tables.DG_String_Data_00.MS_004F'Access);
end Initialize_301;
--------------------
-- Initialize_302 --
--------------------
procedure Initialize_302 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 302,
AMF.Internals.Tables.DG_String_Data_00.MS_00D0'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 302, (Is_Empty => True));
end Initialize_302;
--------------------
-- Initialize_303 --
--------------------
procedure Initialize_303 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 303,
AMF.Internals.Tables.DG_String_Data_00.MS_0064'Access);
end Initialize_303;
--------------------
-- Initialize_304 --
--------------------
procedure Initialize_304 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 304,
AMF.Internals.Tables.DG_String_Data_00.MS_00FF'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 304, (False, AMF.CMOF.Public_Visibility));
end Initialize_304;
--------------------
-- Initialize_305 --
--------------------
procedure Initialize_305 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 305,
AMF.Internals.Tables.DG_String_Data_00.MS_0099'Access);
end Initialize_305;
--------------------
-- Initialize_306 --
--------------------
procedure Initialize_306 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 306,
AMF.Internals.Tables.DG_String_Data_00.MS_0036'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 306, (False, AMF.CMOF.Public_Visibility));
end Initialize_306;
--------------------
-- Initialize_307 --
--------------------
procedure Initialize_307 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 307,
AMF.Internals.Tables.DG_String_Data_00.MS_0062'Access);
end Initialize_307;
--------------------
-- Initialize_308 --
--------------------
procedure Initialize_308 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 308,
AMF.Internals.Tables.DG_String_Data_00.MS_00D4'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 308, (False, AMF.CMOF.Public_Visibility));
end Initialize_308;
--------------------
-- Initialize_309 --
--------------------
procedure Initialize_309 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 309,
AMF.Internals.Tables.DG_String_Data_00.MS_0073'Access);
end Initialize_309;
--------------------
-- Initialize_310 --
--------------------
procedure Initialize_310 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 310,
AMF.Internals.Tables.DG_String_Data_00.MS_0052'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 310, (False, AMF.CMOF.Public_Visibility));
end Initialize_310;
--------------------
-- Initialize_311 --
--------------------
procedure Initialize_311 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 311,
AMF.Internals.Tables.DG_String_Data_00.MS_008B'Access);
end Initialize_311;
--------------------
-- Initialize_312 --
--------------------
procedure Initialize_312 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 312,
AMF.Internals.Tables.DG_String_Data_00.MS_00FD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 312, (False, AMF.CMOF.Public_Visibility));
end Initialize_312;
--------------------
-- Initialize_313 --
--------------------
procedure Initialize_313 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 313,
AMF.Internals.Tables.DG_String_Data_00.MS_0083'Access);
end Initialize_313;
--------------------
-- Initialize_314 --
--------------------
procedure Initialize_314 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 314,
AMF.Internals.Tables.DG_String_Data_01.MS_011B'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 314, (Is_Empty => True));
end Initialize_314;
--------------------
-- Initialize_315 --
--------------------
procedure Initialize_315 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Body
(Base + 315,
AMF.Internals.Tables.DG_String_Data_00.MS_00D3'Access);
end Initialize_315;
--------------------
-- Initialize_316 --
--------------------
procedure Initialize_316 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 316, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 316,
AMF.Internals.Tables.DG_String_Data_00.MS_009C'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 316, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 316, (False, AMF.CMOF.Public_Visibility));
end Initialize_316;
--------------------
-- Initialize_317 --
--------------------
procedure Initialize_317 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 317, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 317,
AMF.Internals.Tables.DG_String_Data_00.MS_00F5'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 317, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 317, (False, AMF.CMOF.Public_Visibility));
end Initialize_317;
--------------------
-- Initialize_318 --
--------------------
procedure Initialize_318 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 318, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 318,
AMF.Internals.Tables.DG_String_Data_00.MS_00B3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Upper (Base + 318, (False, (Unlimited => True)));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 318, (False, AMF.CMOF.Public_Visibility));
end Initialize_318;
--------------------
-- Initialize_319 --
--------------------
procedure Initialize_319 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Lower (Base + 319, (False, 0));
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 319,
AMF.Internals.Tables.DG_String_Data_00.MS_00CD'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 319, (False, AMF.CMOF.Public_Visibility));
end Initialize_319;
--------------------
-- Initialize_320 --
--------------------
procedure Initialize_320 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 320,
AMF.Internals.Tables.DG_String_Data_00.MS_00B3'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Visibility (Base + 320, (False, AMF.CMOF.Public_Visibility));
end Initialize_320;
--------------------
-- Initialize_321 --
--------------------
procedure Initialize_321 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 321,
AMF.Internals.Tables.DG_String_Data_00.MS_00E9'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Value
(Base + 321,
AMF.Internals.Tables.DG_String_Data_00.MS_0098'Access);
end Initialize_321;
--------------------
-- Initialize_322 --
--------------------
procedure Initialize_322 is
begin
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Name
(Base + 322,
AMF.Internals.Tables.DG_String_Data_00.MS_0047'Access);
AMF.Internals.Tables.CMOF_Attributes.Internal_Set_Value
(Base + 322,
AMF.Internals.Tables.DG_String_Data_00.MS_00F7'Access);
end Initialize_322;
end AMF.Internals.Tables.DG_Metamodel.Properties;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Char_Code is
begin
Put_Line (Character'Val (97) & " =" & Integer'Image (Character'Pos ('a')));
end Char_Code;
|
pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with utypes_uuint64_t_h;
package random_h is
-- BSD 3-Clause License
-- *
-- * Copyright © 2008-2021, Jice and the libtcod contributors.
-- * All rights reserved.
-- *
-- * 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.
--
--*
-- Return the next random uint64_t from a SplitMix64 generator.
-- `state[1]` is a non-NULL pointer to the internal state of the generator.
-- There is no initializer function because the first value of `state[1]` is
-- itself the seed which can start at any value.
-- `state[1]` will be updated by this call.
-- This function is provisional and may change.
--
function TCOD_rng_splitmix64_next (state : access utypes_uuint64_t_h.uint64_t) return utypes_uuint64_t_h.uint64_t -- random.h:51
with Import => True,
Convention => C,
External_Name => "TCOD_rng_splitmix64_next";
-- Based on http://xoshiro.di.unimi.it/splitmix64.c
-- extern "C"
end random_h;
|
-- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
package Interfaces.C.Strings is
pragma Preelaborate (Strings);
type char_array_access is access all char_array;
type chars_ptr is private;
pragma Preelaborable_Initialization (chars_ptr);
type chars_ptr_array is array (size_t range <>) of aliased chars_ptr;
Null_Ptr : constant chars_ptr;
function To_Chars_Ptr (Item : in char_array_access;
Nul_Check : in Boolean := False)
return chars_ptr;
function New_Char_Array (Chars : in char_array) return chars_ptr;
function New_String (Str : in String) return chars_ptr;
procedure Free (Item : in out chars_ptr);
Dereference_Error : exception;
function Value (Item : in chars_ptr) return char_array;
function Value (Item : in chars_ptr; Length : in size_t)
return char_array;
function Value (Item : in chars_ptr) return String;
function Value (Item : in chars_ptr; Length : in size_t)
return String;
function Strlen (Item : in chars_ptr) return size_t;
procedure Update (Item : in chars_ptr;
Offset : in size_t;
Chars : in char_array;
Check : in Boolean := True);
procedure Update (Item : in chars_ptr;
Offset : in size_t;
Str : in String;
Check : in Boolean := True);
Update_Error : exception;
private
pragma Import (Ada, chars_ptr);
pragma Import (Ada, Null_Ptr);
end Interfaces.C.Strings;
|
-- ___ _ ___ _ _ --
-- / __| |/ (_) | | Common SKilL implementation --
-- \__ \ ' <| | | |__ file partitioning info --
-- |___/_|\_\_|_|____| by: Timm Felden --
-- --
pragma Ada_2012;
with Ada.Containers.Vectors;
with Skill.Types;
with Skill.Containers.Vectors;
-- documentation can be found in java common
package Skill.Internal.Parts is
type Block is record
BPO : Skill.Types.Skill_ID_T;
Static_Count : Skill.Types.Skill_ID_T;
Dynamic_Count : Skill.Types.Skill_ID_T;
end record;
package Blocks_P is new Skill.Containers.Vectors (Natural, Block);
subtype Blocks is Blocks_P.Vector;
type Chunk_T is abstract tagged record
First : Skill.Types.v64;
Last : Skill.Types.v64;
Count : Skill.Types.Skill_ID_T;
end record;
type Chunk is access Chunk_T'Class;
procedure Free (This : access Chunk_T) is abstract;
type Simple_Chunk is new Chunk_T with record
BPO : Skill.Types.Skill_ID_T;
end record;
type Simple_Chunk_X is not null access all Simple_Chunk;
function To_Simple (This : access Chunk_T'Class) return Simple_Chunk_X;
type Bulk_Chunk is new Chunk_T with record
-- The Number of Blocks, Starting From The First That Have To Be Updated
Block_Count : Natural;
end record;
type Bulk_Chunk_X is not null access all Bulk_Chunk;
function To_Bulk (This : access Chunk_T'Class) return Bulk_Chunk_X;
package Chunks is new Ada.Containers.Vectors (Natural, Chunk);
procedure Free (This : access Simple_Chunk);
procedure Free (This : access Bulk_Chunk);
end Skill.Internal.Parts;
|
-- Copyright 2011-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
type Char_Enum_Type is ('A', 'B', 'C', 'D', 'E');
Char : Char_Enum_Type := 'D';
begin
Do_Nothing (Char'Address); -- STOP
end Foo;
|
with USB_Testing; use USB_Testing;
with USB_Testing.UDC_Stub; use USB_Testing.UDC_Stub;
with USB_Testing.UDC_Scenarios;
with HAL; use HAL;
with USB;
procedure Main is
Scenario : aliased constant UDC_Stub.Stub_Scenario :=
UDC_Scenarios.Enumeration (Verbose => False)
& UDC_Scenarios.Get_Config (Verbose => False)
-- Get string #1 usually manufacturer from device desc
& UDC_Scenarios.Get_String (Verbose => True, Id => 1, Ack => True)
-- Get string #2 usually product from device desc
& UDC_Scenarios.Get_String (Verbose => True, Id => 2, Ack => True)
-- Get string #3 usually serial number from device desc
& UDC_Scenarios.Get_String (Verbose => True, Id => 3, Ack => True)
-- Get invalid string
& UDC_Scenarios.Get_String (Verbose => True, Id => 42, Ack => False);
RX_Data : aliased constant UInt8_Array := (0 .. 1 => 0);
begin
USB_Testing.UDC_Scenarios.Basic_UDC_Test (Scenario, RX_Data);
end Main;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016-2020, 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: 5703 $ $Date: 2017-01-20 22:17:20 +0300 (Fri, 20 Jan 2017) $
------------------------------------------------------------------------------
package Web.Core.Connectables.Slots_0 is
pragma Preelaborate;
-- type Slot (<>) is abstract tagged limited private;
-- XXX GNATLLVM: instantiation erorr of Slot_1.
type Slot is abstract tagged limited private;
type Signal is limited interface;
not overriding procedure Connect
(Self : in out Signal;
Slot : Web.Core.Connectables.Slots_0.Slot'Class) is abstract;
private
type Slot_End_0 is abstract new Slot_End_Base with null record;
not overriding procedure Invoke (Self : in out Slot_End_0) is abstract;
type Slot is abstract tagged limited null record;
not overriding function Create_Slot_End
(Self : Slot) return not null Slot_End_Access;
end Web.Core.Connectables.Slots_0;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dct_dct_2d</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</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>in_block</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</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>out_block</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_block</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>64</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>69</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>4</id>
<name>row_outbuf</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>row_outbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>col_outbuf</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>col_outbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>col_inbuf</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf</originalName>
<rtlName>col_inbuf_U</rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>alloca</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>105</item>
<item>106</item>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond5_fu_224_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>109</item>
<item>111</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>i_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_4_fu_230_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>112</item>
<item>114</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>115</item>
<item>116</item>
<item>117</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_dct_dct_1d_fu_209</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
<item>121</item>
<item>122</item>
<item>123</item>
<item>262</item>
</oprand_edges>
<opcode>call</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>124</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>indvar_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>125</item>
<item>126</item>
<item>128</item>
<item>129</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>j</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>i_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
<item>136</item>
<item>137</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>exitcond_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten_fu_236_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>138</item>
<item>140</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>indvar_flatten_next</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next_fu_242_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>141</item>
<item>143</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>exitcond</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_fu_248_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>147</item>
<item>148</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>i_1_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>i_1_mid2_fu_254_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>j_s</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_s_fu_262_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>152</item>
<item>153</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>j_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_mid2_fu_268_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>154</item>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_2_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_trn_cast_fu_309_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>157</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_trn_cast_fu_276_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_280_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
<item>163</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>p_addr_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr_cast_fu_288_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>p_addr5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr5_fu_292_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>165</item>
<item>166</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_6_fu_298_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>167</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>row_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>168</item>
<item>170</item>
<item>171</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>row_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_7_fu_312_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
<item>175</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>p_addr6_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr6_cast_fu_319_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>176</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_addr7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr7_fu_323_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_8</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_8_fu_329_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>col_inbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>180</item>
<item>181</item>
<item>182</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>183</item>
<item>184</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>i_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_6_fu_303_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>187</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>i_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>188</item>
<item>189</item>
<item>190</item>
<item>191</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>exitcond2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond2_fu_334_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>192</item>
<item>193</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>i_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_5_fu_340_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>194</item>
<item>195</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
<item>198</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_dct_dct_1d_fu_209</rtlName>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>199</item>
<item>200</item>
<item>201</item>
<item>202</item>
<item>203</item>
<item>263</item>
</oprand_edges>
<opcode>call</opcode>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>indvar_flatten2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>205</item>
<item>206</item>
<item>207</item>
<item>208</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>j_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>209</item>
<item>210</item>
<item>211</item>
<item>212</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>i_3</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>213</item>
<item>214</item>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>exitcond_flatten2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten2_fu_346_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>indvar_flatten_next2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next2_fu_352_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>219</item>
<item>220</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>221</item>
<item>222</item>
<item>223</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>exitcond1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond1_fu_358_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>224</item>
<item>225</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>i_3_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>i_3_mid2_fu_364_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>226</item>
<item>227</item>
<item>228</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>j_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_2_fu_372_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>j_1_mid2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>j_1_mid2_fu_378_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>231</item>
<item>232</item>
<item>233</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>tmp_4_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_4_trn_cast_fu_419_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>234</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>tmp_3_trn_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_trn_cast_fu_386_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>235</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>tmp_s</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_s_fu_390_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>236</item>
<item>237</item>
<item>238</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>p_addr8_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr8_cast_fu_398_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>p_addr9</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr9_fu_402_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>tmp_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_1_fu_408_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>242</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>col_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>243</item>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>col_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>246</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>tmp_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_fu_422_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>247</item>
<item>248</item>
<item>249</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>p_addr3_cast</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr3_cast_fu_429_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>250</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>p_addr4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_addr4_fu_433_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>251</item>
<item>252</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>tmp_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_3_fu_439_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>253</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>out_block_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>254</item>
<item>255</item>
<item>256</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>257</item>
<item>258</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>i_7</name>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_7_fu_413_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>259</item>
<item>260</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>261</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name/>
<fileName>dct.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>96</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_72">
<Value>
<Obj>
<type>2</type>
<id>99</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_73">
<Value>
<Obj>
<type>2</type>
<id>104</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_74">
<Value>
<Obj>
<type>2</type>
<id>110</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_75">
<Value>
<Obj>
<type>2</type>
<id>113</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>118</id>
<name>dct_dct_1d</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:dct_dct_1d></content>
</item>
<item class_id_reference="16" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>127</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>139</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>142</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>162</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>169</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_82">
<Obj>
<type>3</type>
<id>8</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_83">
<Obj>
<type>3</type>
<id>14</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_84">
<Obj>
<type>3</type>
<id>18</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_85">
<Obj>
<type>3</type>
<id>25</id>
<name>.preheader7.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_86">
<Obj>
<type>3</type>
<id>52</id>
<name>.preheader7</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>20</count>
<item_version>0</item_version>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>50</item>
<item>51</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_87">
<Obj>
<type>3</type>
<id>58</id>
<name>.preheader6</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>56</item>
<item>57</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_88">
<Obj>
<type>3</type>
<id>62</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>60</item>
<item>61</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>69</id>
<name>.preheader.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>67</item>
<item>68</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>96</id>
<name>.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>20</count>
<item_version>0</item_version>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>94</item>
<item>95</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>98</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>163</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_92">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>4</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>103</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>106</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>116</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>117</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>124</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>126</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>129</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>131</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>133</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>135</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>137</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>146</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>187</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>189</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>204</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>206</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>208</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>210</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>212</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>214</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>216</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>222</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_226">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_227">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_228">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_229">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_230">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_231">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_232">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_233">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_234">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_235">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_236">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_237">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_238">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_239">
<id>261</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_240">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_241">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_242">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_243">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_244">
<id>332</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_245">
<id>333</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_246">
<id>334</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_247">
<id>335</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_248">
<id>336</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_249">
<id>337</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_250">
<id>338</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_251">
<id>339</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_252">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_253">
<id>341</id>
<edge_type>2</edge_type>
<source_obj>69</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_254">
<id>342</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>69</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_255">
<mId>1</mId>
<mTag>dct_dct_2d</mTag>
<mType>0</mType>
<sub_regions>
<count>6</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</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>1717</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_256">
<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>8</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_257">
<mId>3</mId>
<mTag>Row_DCT_Loop</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>14</item>
<item>18</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>792</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_258">
<mId>4</mId>
<mTag>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</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>25</item>
<item>52</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_259">
<mId>5</mId>
<mTag>Col_DCT_Loop</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>58</item>
<item>62</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>792</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_260">
<mId>6</mId>
<mTag>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</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>69</item>
<item>96</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_261">
<mId>7</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>98</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_262">
<states class_id="25" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_263">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_264">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_268">
<id>2</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_269">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_271">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>16</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_275">
<id>3</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_276">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>16</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_278">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_279">
<id>4</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_280">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_287">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_292">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_293">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_296">
<id>42</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_297">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_298">
<id>5</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_299">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_300">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_301">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_302">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_303">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_304">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_305">
<id>42</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_307">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_308">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_309">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_310">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_311">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_312">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_313">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_314">
<id>6</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_315">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_316">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_317">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_318">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_319">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_320">
<id>60</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_321">
<id>7</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_322">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_323">
<id>60</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_324">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_325">
<id>8</id>
<operations>
<count>18</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_326">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_327">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_328">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_329">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_330">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_331">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_332">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_333">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_334">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_335">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_336">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_337">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_338">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_339">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_340">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_341">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_342">
<id>86</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_343">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_344">
<id>9</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_345">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_346">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_347">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_348">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_349">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_350">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_351">
<id>86</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_352">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_353">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_354">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_355">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_356">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_357">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_358">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_359">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_360">
<id>10</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_361">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_362">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>51</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_363">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>54</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>10</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_364">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>53</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>10</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_365">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>57</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_366">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>66</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>54</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_367">
<inState>6</inState>
<outState>8</outState>
<condition>
<id>65</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>54</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_368">
<inState>7</inState>
<outState>6</outState>
<condition>
<id>69</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_369">
<inState>5</inState>
<outState>4</outState>
<condition>
<id>77</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_370">
<inState>4</inState>
<outState>6</outState>
<condition>
<id>76</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_371">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>78</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_372">
<inState>9</inState>
<outState>8</outState>
<condition>
<id>80</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_373">
<inState>8</inState>
<outState>10</outState>
<condition>
<id>79</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>66</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_374">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>81</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>66</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_375">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>grp_dct_dct_1d_fu_209 (dct_dct_1d)</first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>BRAM</first>
<second>0</second>
</item>
<item>
<first>DSP48E</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>111</second>
</item>
<item>
<first>LUT</first>
<second>122</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>22</count>
<item_version>0</item_version>
<item>
<first>exitcond1_fu_358_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond2_fu_334_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond5_fu_224_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten2_fu_346_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_236_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>exitcond_fu_248_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>i_1_mid2_fu_254_p3 ( Select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>(2P2)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_mid2_fu_364_p3 ( Select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>(2P2)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_4_fu_230_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_5_fu_340_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_6_fu_303_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_7_fu_413_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_fu_352_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_242_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>j_1_mid2_fu_378_p3 ( Select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>4</second>
</item>
<item>
<first>(2P2)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_2_fu_372_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_mid2_fu_268_p3 ( Select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>4</second>
</item>
<item>
<first>(2P2)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_s_fu_262_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>p_addr4_fu_433_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_addr5_fu_292_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_addr7_fu_323_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>p_addr9_fu_402_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>col_inbuf_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>64</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>23</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>9</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>9</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>col_inbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>col_outbuf_we0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>grp_dct_dct_1d_fu_209_src_q0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>16</second>
</item>
<item>
<first>(2Count)</first>
<second>48</second>
</item>
<item>
<first>LUT</first>
<second>16</second>
</item>
</second>
</item>
<item>
<first>grp_dct_dct_1d_fu_209_tmp_1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>grp_dct_dct_1d_fu_209_tmp_11</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_1_reg_153</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>in_block_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten2_reg_176</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>7</second>
</item>
<item>
<first>(2Count)</first>
<second>14</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_131</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>7</second>
</item>
<item>
<first>(2Count)</first>
<second>14</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>j_1_phi_fu_191_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_phi_fu_146_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>18</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_ce0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>row_outbuf_we0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>22</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppiten_pp0_it0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppiten_pp0_it1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppiten_pp1_it0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_reg_ppiten_pp1_it1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten2_reg_492</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_453</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>grp_dct_dct_1d_fu_209_ap_start_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>i_1_mid2_reg_462</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_1_reg_153</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_mid2_reg_501</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_4_reg_448</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_5_reg_487</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten2_reg_176</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>7</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_131</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>7</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>j_1_mid2_reg_506</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_mid2_reg_467</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>grp_dct_dct_1d_fu_209 (dct_dct_1d)</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>60</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>22</count>
<item_version>0</item_version>
<item>
<first>exitcond1_fu_358_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>exitcond2_fu_334_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>exitcond5_fu_224_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>exitcond_flatten2_fu_346_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_236_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>exitcond_fu_248_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>i_1_mid2_fu_254_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>i_3_mid2_fu_364_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>i_4_fu_230_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_5_fu_340_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>i_6_fu_303_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_7_fu_413_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_fu_352_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_242_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>j_1_mid2_fu_378_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>j_2_fu_372_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>j_mid2_fu_268_p3 ( Select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>j_s_fu_262_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_addr4_fu_433_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>p_addr5_fu_292_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_addr7_fu_323_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_addr9_fu_402_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>3</count>
<item_version>0</item_version>
<item>
<first>col_inbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</second>
</item>
<item>
<first>col_outbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</second>
</item>
<item>
<first>row_outbuf_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>147</item>
</second>
</item>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>69</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>4</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>8</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_376">
<region_name>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>25</item>
<item>52</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
<item class_id_reference="50" object_id="_377">
<region_name>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>69</item>
<item>96</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>58</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>78</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>42</item>
</second>
</item>
<item>
<first>83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>89</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>95</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>101</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>86</item>
<item>86</item>
</second>
</item>
<item>
<first>106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>209</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>60</item>
<item>60</item>
</second>
</item>
<item>
<first>224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>280</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>413</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>433</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>53</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>col_inbuf_addr_gep_fu_83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>col_inbuf_alloca_fu_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>col_outbuf_addr_gep_fu_95</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>col_outbuf_alloca_fu_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>exitcond1_fu_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>exitcond2_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>exitcond5_fu_224</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>exitcond_flatten2_fu_346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>exitcond_fu_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>i_1_mid2_fu_254</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>i_1_phi_fu_157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>i_2_phi_fu_168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>i_3_mid2_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>i_3_phi_fu_202</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>i_4_fu_230</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_5_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>i_6_fu_303</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_7_fu_413</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>i_phi_fu_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten2_phi_fu_180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_fu_352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_242</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_1_mid2_fu_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>j_1_phi_fu_191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>j_2_fu_372</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>j_mid2_fu_268</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>j_phi_fu_146</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>j_s_fu_262</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>out_block_addr_gep_fu_106</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>p_addr3_cast_fu_429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>p_addr4_fu_433</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>p_addr5_fu_292</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_addr6_cast_fu_319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>p_addr7_fu_323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_addr8_cast_fu_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>p_addr9_fu_402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>p_addr_cast_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>row_outbuf_addr_gep_fu_72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>row_outbuf_alloca_fu_60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>4</item>
</second>
</item>
<item>
<first>tmp_1_fu_408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_2_fu_422</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>tmp_2_trn_cast_fu_309</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_3_fu_439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>tmp_3_trn_cast_fu_386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>tmp_4_trn_cast_fu_419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>tmp_6_fu_298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>tmp_7_fu_312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_8_fu_329</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_fu_280</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_s_fu_390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>tmp_trn_cast_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_dct_dct_1d_fu_209</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>16</item>
<item>60</item>
<item>60</item>
</second>
</item>
</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="56" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="57" tracking_level="0" version="0">
<first class_id="58" tracking_level="0" version="0">
<first>col_inbuf</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>
<first>col_inbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>86</item>
<item>86</item>
</second>
</item>
<item>
<first>
<first>col_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>
<first>dct_coeff_table</first>
<second>100</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>60</item>
</second>
</item>
<item>
<first>
<first>out_block</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>42</item>
</second>
</item>
<item>
<first>
<first>row_outbuf</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>457</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>col_outbuf_addr_reg_512</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>exitcond2_reg_483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>exitcond5_reg_444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>exitcond_flatten2_reg_492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>i_1_mid2_reg_462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>i_1_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>i_3_mid2_reg_501</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>i_4_reg_448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_5_reg_487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>i_6_reg_478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>i_7_reg_517</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten2_reg_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>indvar_flatten_next2_reg_496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_457</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_1_mid2_reg_506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>j_mid2_reg_467</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>row_outbuf_addr_reg_473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>8</count>
<item_version>0</item_version>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>8</count>
<item_version>0</item_version>
<item>
<first>i_1_reg_153</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>i_2_reg_164</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>i_3_reg_198</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>i_reg_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten2_reg_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>j_1_reg_187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>j_reg_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="59" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>out_block(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="61" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="62" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>3</count>
<item_version>0</item_version>
<item>
<first>4</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S T O R A G E _ E L E M E N T S --
-- --
-- B o d y --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit_Warning;
with Ada.Unchecked_Conversion;
package body System.Storage_Elements is
pragma Suppress (All_Checks);
-- Conversion to/from address
-- Note qualification below of To_Address to avoid ambiguities systems
-- where Address is a visible integer type.
function To_Address is
new Ada.Unchecked_Conversion (Storage_Offset, Address);
function To_Offset is
new Ada.Unchecked_Conversion (Address, Storage_Offset);
-- Conversion to/from integers
-- These functions must be place first because they are inlined_always
-- and are used and inlined in other subprograms defined in this unit.
----------------
-- To_Address --
----------------
function To_Address (Value : Integer_Address) return Address is
begin
return Address (Value);
end To_Address;
----------------
-- To_Integer --
----------------
function To_Integer (Value : Address) return Integer_Address is
begin
return Integer_Address (Value);
end To_Integer;
-- Address arithmetic
---------
-- "+" --
---------
function "+" (Left : Address; Right : Storage_Offset) return Address is
begin
return Storage_Elements.To_Address
(To_Integer (Left) + To_Integer (To_Address (Right)));
end "+";
function "+" (Left : Storage_Offset; Right : Address) return Address is
begin
return Storage_Elements.To_Address
(To_Integer (To_Address (Left)) + To_Integer (Right));
end "+";
---------
-- "-" --
---------
function "-" (Left : Address; Right : Storage_Offset) return Address is
begin
return Storage_Elements.To_Address
(To_Integer (Left) - To_Integer (To_Address (Right)));
end "-";
function "-" (Left, Right : Address) return Storage_Offset is
begin
return To_Offset (Storage_Elements.To_Address
(To_Integer (Left) - To_Integer (Right)));
end "-";
-----------
-- "mod" --
-----------
function "mod"
(Left : Address;
Right : Storage_Offset) return Storage_Offset
is
begin
if Right > 0 then
return Storage_Offset
(To_Integer (Left) mod Integer_Address (Right));
-- The negative case makes no sense since it is a case of a mod where
-- the left argument is unsigned and the right argument is signed. In
-- accordance with the (spirit of the) permission of RM 13.7.1(16),
-- we raise CE, and also include the zero case here. Yes, the RM says
-- PE, but this really is so obviously more like a constraint error.
else
raise Constraint_Error;
end if;
end "mod";
end System.Storage_Elements;
|
-- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <reznikmm@gmail.com>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Containers;
generic
with package Bounded is
new Ada.Strings.Bounded.Generic_Bounded_Length (<>);
function Ada.Strings.Bounded.Hash (Key : in Bounded.Bounded_String)
return Containers.Hash_Type;
pragma Preelaborate (Hash);
|
-- { dg-do run }
procedure Enum3 is
type Enum is (Aaa, Bbb, Ccc);
for Enum use (1,2,4);
begin
for Lo in Enum loop
for Hi in Enum loop
declare
subtype S is Enum range Lo .. Hi;
type Vector is array (S) of Integer;
Vec : Vector;
begin
for I in S loop
Vec (I) := 0;
end loop;
if Vec /= (S => 0) then
raise Program_Error;
end if;
end;
end loop;
end loop;
end;
|
-- Copyright 2014-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 Ada.Text_IO; use Ada.Text_IO;
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Agen; use Agen;
with Argument_Stack;
package body Actions.Func is
procedure Help is
begin
Put_Line(" (func|function) name:return_type [parameter:type]* - Print the generated function");
end Help;
function Try_Act return Boolean is
Func : Parameter;
begin
if Argument_Stack.Is_Empty then goto Fail; end if;
declare
Action : constant String := Argument_Stack.Pop;
begin
if To_Upper(Action) /= "FUNC" and To_Upper(Action) /= "FUNCTION" then
goto Fail;
end if;
end;
if Argument_Stack.Is_Empty then
Put_Line(Standard_Error, "Error: No function signature was specified");
goto Fail;
end if;
if not Try_Parse(Argument_Stack.Pop, Func) then
Put_Line(Standard_Error, "Error: The function signature was invalid");
goto Fail;
end if;
if Argument_Stack.Is_Empty then
Print_Function(Func);
else
declare
Params : Parameter_Array(1 .. Argument_Stack.Length);
begin
for I in 1 .. Argument_Stack.Length loop
if not Try_Parse(Argument_Stack.Pop, Params(I)) then
Argument_Stack.Push_Back;
Put_Line(Standard_Error, "Error: The parameter signature """ & Argument_Stack.Pop & """ was invalid");
goto Fail;
end if;
end loop;
Print_Function(Func, Params);
end;
end if;
return True;
<<Fail>>
Argument_Stack.Reset;
return False;
end Try_Act;
end Actions.Func;
|
package body Rejuvenation.Finder is
-- Public: Find Node_Kind --------
function Find
(Node : Ada_Node'Class;
Predicate : not null access function
(Node : Ada_Node'Class) return Boolean)
return Node_List.Vector is
(Find_Predicate (Node, Predicate, Into));
function Find_Non_Contained
(Node : Ada_Node'Class;
Predicate : not null access function
(Node : Ada_Node'Class) return Boolean)
return Node_List.Vector is
(Find_Predicate (Node, Predicate, Over));
function Find
(Node : Ada_Node'Class; Node_Kind : Ada_Node_Kind_Type)
return Node_List.Vector
is
function Predicate (Node : Ada_Node'Class) return Boolean;
function Predicate (Node : Ada_Node'Class) return Boolean is
begin
return Node.Kind = Node_Kind;
end Predicate;
begin
return Find_Predicate (Node, Predicate'Access, Into);
end Find;
function Find_Non_Contained
(Node : Ada_Node'Class; Node_Kind : Ada_Node_Kind_Type)
return Node_List.Vector
is
function Predicate (Node : Ada_Node'Class) return Boolean;
function Predicate (Node : Ada_Node'Class) return Boolean is
begin
return Node.Kind = Node_Kind;
end Predicate;
begin
return Find_Predicate (Node, Predicate'Access, Over);
end Find_Non_Contained;
function Find_First
(Node : Ada_Node'Class; Node_Kind : Ada_Node_Kind_Type) return Ada_Node
is
function Predicate (Node : Ada_Node'Class) return Boolean;
function Predicate (Node : Ada_Node'Class) return Boolean is
begin
return Node.Kind = Node_Kind;
end Predicate;
use Node_List;
Results : constant Node_List.Vector :=
Find_Predicate (Node, Predicate'Access, Stop);
begin
return
(if Results.Is_Empty then No_Ada_Node else Element (Results.First));
end Find_First;
function Find_Sub_List
(Node : Ada_Node'Class; Node_Kinds : Node_Kind_Type_Array)
return Node_List_List.Vector
is
begin
return Find_NK_Sub_List (Node, Node_Kinds);
end Find_Sub_List;
-- Public: Find Match_Pattern --------
function Find_Full
(Node : Ada_Node'Class; Find_Pattern : Pattern)
return Match_Pattern_List.Vector
is
begin
return Find_MP (Node, Find_Pattern.As_Ada_Node, Into);
end Find_Full;
function Find_Non_Contained_Full
(Node : Ada_Node'Class; Find_Pattern : Pattern)
return Match_Pattern_List.Vector
is
begin
return Find_MP (Node, Find_Pattern.As_Ada_Node, Over);
end Find_Non_Contained_Full;
function Find_First_Full
(Node : Ada_Node'Class; Find_Pattern : Pattern;
Result : out Match_Pattern) return Boolean
is
use Match_Pattern_List;
Results : constant Match_Pattern_List.Vector :=
Find_MP (Node, Find_Pattern.As_Ada_Node, Stop);
begin
if Results.Is_Empty then
return False;
else
Result := Element (Results.First);
return True;
end if;
end Find_First_Full;
function Find_Sub_List
(Node : Ada_Node'Class; Find_Pattern : Pattern; Next : Containment)
return Match_Pattern_List.Vector;
function Find_Sub_List
(Node : Ada_Node'Class; Find_Pattern : Pattern; Next : Containment)
return Match_Pattern_List.Vector
is
Find_Node : constant Ada_Node := Find_Pattern.As_Ada_Node;
begin
if Find_Node.Kind in Ada_Ada_List then
return Find_MP_Sub_List (Node, Find_Node.Children, Next);
else
raise Pattern_Is_No_List_Exception;
end if;
end Find_Sub_List;
function Find_Sub_List
(Node : Ada_Node'Class; Find_Pattern : Pattern)
return Match_Pattern_List.Vector is
(Find_Sub_List (Node, Find_Pattern, Contained));
function Find_Non_Contained_Sub_List
(Node : Ada_Node'Class; Find_Pattern : Pattern)
return Match_Pattern_List.Vector is
(Find_Sub_List (Node, Find_Pattern, Non_Contained));
function Find_Full
(Node : Ada_Node'Class; Find_Patterns : Pattern_Array)
return Match_Pattern_List.Vector
is
Result : Match_Pattern_List.Vector;
begin
for Find_Pattern of Find_Patterns loop
Result.Append (Find_Full (Node, Find_Pattern));
end loop;
return Result;
end Find_Full;
-- Private --------
function Find_Predicate
(Node : Ada_Node'Class;
Predicate : not null access function
(Node : Ada_Node'Class) return Boolean;
Next : Visit_Status) return Node_List.Vector
is
Result : Node_List.Vector;
function Visit (Node : Ada_Node'Class) return Visit_Status;
function Visit (Node : Ada_Node'Class) return Visit_Status is
begin
if Predicate (Node) then
Result.Append (Ada_Node (Node));
-- TODO: look up which was prefer Node.As_Ada_Node or this
return Next;
else
return Into;
end if;
end Visit;
begin
Node.Traverse (Visit'Access);
return Result;
end Find_Predicate;
function Find_MP
(Node : Ada_Node'Class; Pattern : Ada_Node; Next : Visit_Status)
return Match_Pattern_List.Vector
is
Result : Match_Pattern_List.Vector;
function Visit (Node : Ada_Node'Class) return Visit_Status;
function Visit (Node : Ada_Node'Class) return Visit_Status is
MP : Match_Pattern;
Success : constant Boolean :=
MP.Match_Full (Pattern, Ada_Node (Node));
begin
if Success then
Result.Append (MP);
return Next;
else
return Into;
end if;
end Visit;
begin
Node.Traverse (Visit'Access);
return Result;
end Find_MP;
function Find_NK_Sub_List
(Node : Ada_Node'Class; Node_Kinds : Node_Kind_Type_Array)
return Node_List_List.Vector
is
Result : Node_List_List.Vector;
function Visit (Node : Ada_Node'Class) return Visit_Status;
function Visit (Node : Ada_Node'Class) return Visit_Status is
begin
if Node.Kind in Ada_Ada_List then
for Node_Index in
Node.Children'First .. (Node.Children'Last - Node_Kinds'Last)
loop
declare
Success : Boolean;
Nodes : Node_List.Vector;
begin
Success := True;
for Kind_Index in Node_Kinds'Range
loop -- array range starts at 0
if Node.Child (Node_Index + Kind_Index).Kind =
Node_Kinds (Kind_Index)
then
Nodes.Append (Node.Child (Node_Index + Kind_Index));
else
Success := False;
end if;
end loop;
if Success then
Result.Append (Nodes);
end if;
end;
end loop;
end if;
return Into;
end Visit;
begin
Node.Traverse (Visit'Access);
return Result;
end Find_NK_Sub_List;
function Find_MP_Sub_List
(Node : Ada_Node'Class; Pattern : Ada_Node_Array; Next : Containment)
return Match_Pattern_List.Vector
-- Special cases:
-- We do not allow matches to contain overlapping nodes
-- E.g. When the pattern $S_Stmt1; $S_Stmt2;
-- is used to find a sublist in the list of nodes "A; B; C; D;"
-- We find "A; B;" and "C; D;"
-- Hence "B; C;" is NOT found
--
-- Non-Contained:
-- Don't go into matches, but when no match go into!
is
Result : Match_Pattern_List.Vector;
function Visit (Node : Ada_Node'Class) return Visit_Status;
function Visit (Node : Ada_Node'Class) return Visit_Status is
begin
if Node.Kind in Ada_Ada_List then
declare
Upperbound : constant Integer :=
Node.Last_Child_Index - Pattern'Length + 1;
-- last possible index / start position to fit the whole pattern
-- into remaining tail of the list
Skip : Natural := Node.First_Child_Index - 1;
-- skip counter to prevent overlapping matches
begin
for Node_Index in Node.Children'Range loop
if Node_Index > Skip and then Node_Index <= Upperbound then
declare
MP : Match_Pattern;
Success : constant Boolean :=
MP.Match_Prefix (Pattern, Node.Children, Node_Index);
begin
if Success then
Result.Append (MP);
Skip := Node_Index + Pattern'Length - 1;
end if;
end;
end if;
-- Do we need to vist this node?
if Next = Contained or else Node_Index > Skip then
Node.Child (Node_Index).Traverse (Visit'Access);
end if;
end loop;
return Over;
end;
end if;
return Into;
end Visit;
begin
Node.Traverse (Visit'Access);
return Result;
end Find_MP_Sub_List;
end Rejuvenation.Finder;
|
-- 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 --
-- --
-- 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.Containers.Vectors;
with Ada.Containers.Indefinite_Hashed_Maps;
with Ada.Strings.Hash;
with Ada_GUI.Gnoga.Colors;
package Ada_GUI.Gnoga.Gui.Element is
-------------------------------------------------------------------------
-- Element_Type
-------------------------------------------------------------------------
type Element_Type is new Gnoga.Gui.Base_Type with private;
type Element_Access is access all Element_Type;
type Pointer_To_Element_Class is access all Element_Type'Class;
-- Element_Type is the parent class of all Gnoga GUI elements.
-- It is generally used internally to create and bind Gnoga elements to
-- HTML5 DOM elements.
package Element_Type_Arrays is
new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Pointer_To_Element_Class,
"=" => Element."=");
package Element_Type_Maps is
new Ada.Containers.Indefinite_Hashed_Maps (String,
Pointer_To_Element_Class,
Ada.Strings.Hash,
Equivalent_Keys => "=");
subtype Element_Type_Array is Element_Type_Arrays.Vector;
-- Arrays of Base_Types
subtype Element_Type_Map is Element_Type_Maps.Map;
-- String to Base_Type associative array
-------------------------------------------------------------------------
-- Element_Type - Creation Methods
-------------------------------------------------------------------------
procedure Create_From_HTML (Element : in out Element_Type;
Parent : in out Gnoga.Gui.Base_Type'Class;
HTML : in String;
ID : in String := "");
-- Create a Gnoga element with HTML not attached to the DOM. If ID is blank
-- Gnoga will generate a unique one for it. The created object will be
-- stored on the browser but will not be inserted in to the DOM until
-- Place_Inside_Top_Of, Place_Inside_Bottom_Of, Place_Before, Place_After
-- is called. This is done automatically if Parent is a child type of
-- Gnoga_Gui.View.View_Base_Type unless the Auto_Place property is
-- set to False _before_ any creation method is called.
-- Quotes in HTML have to be escaped if any.
--
-- Note: All IDs _must_ be unique for use in Gnoga.
HTML_Namespace : constant String := "http://www.w3.org/1999/xhtml";
MathML_Namespace : constant String := "http://www.w3.org/1998/Math/MathML";
SVG_Namespace : constant String := "http://www.w3.org/2000/svg";
XLink_Namespace : constant String := "http://www.w3.org/1999/xlink";
XMLNS_Namespace : constant String := "http://www.w3.org/2000/xmlns/";
XML_Namespace : constant String :=
"http://www.w3.org/XML/1998/namespace";
procedure Create_XML_Element
(Element : in out Element_Type;
Parent : in out Gnoga.Gui.Base_Type'Class;
Namespace : in String;
Element_Type : in String;
ID : in String := "");
-- Create an XML element using XML Namespace.
-------------------------------------------------------------------------
-- Element_Type - Properties
-------------------------------------------------------------------------
-- Element Properties --
procedure Access_Key (Element : in out Element_Type; Value : String);
function Access_Key (Element : Element_Type) return String;
-- Used for hot key access to element. [special key] + Access_Key
-- The [special key] per browser and platform is:
--
-- Browser Windows Linux Mac
-- ----------------- ------- ----- ---
-- Internet Explorer [Alt] N/A N/A
-- Chrome [Alt] [Alt] [Control][Alt]
-- Firefox [Alt][Shift] [Alt][Shift] [Control][Alt]
-- Safari [Alt] N/A [Control][Alt]
-- Opera 15+ [Alt] [Alt] [Alt]
procedure Advisory_Title (Element : in out Element_Type; Value : in String);
function Advisory_Title (Element : Element_Type) return String;
-- Advisory_Title of Element, usually used for body and image maps
procedure Class_Name (Element : in out Element_Type; Value : in String);
function Class_Name (Element : Element_Type) return String;
-- CSS Class name, can be multiple separated by <space>
-- See Add_Class, Remove_Class and Toggle_Class Methods for adding and
-- removing individual or groups of classes in an easier way.
procedure Editable (Element : in out Element_Type;
Value : in Boolean := True);
function Editable (Element : Element_Type) return Boolean;
-- Note: This will make almost any element with content editable, even
-- non form types in most browsers.
procedure Draggable (Element : in out Element_Type;
Value : in Boolean := True);
function Draggable (Element : Element_Type) return Boolean;
-- In order to make an object draggable in addition to Draggable being true
-- the On_Drag_Start event _must_ be bound as well to set the Drag_Text.
-- To receive a drop, you need to bind On_Drop. See Gnoga.Gui
procedure Inner_HTML (Element : in out Element_Type; Value : in String);
function Inner_HTML (Element : Element_Type) return String;
-- This will completely replace the inner html of an element. This will
-- remove any Elements within Element from the DOM. If those elements
-- have ID_Types of Gnoga_ID they are still available and can be placed
-- in the DOM again using the Element.Place_* methods. However if they
-- were of ID_Type DOM_ID they are lost forever.
function Outer_HTML (Element : Element_Type) return String;
-- Returns the HTML for Element and all its contents.
-- Text Content Properties --
-- <tag>Text Content</tag> - Text content is the content contained by the
-- tag. This should not be confused with the
-- "Value" of a Form Tag.
-- (See. Gnoga.Gui.Element.Form.Value)
procedure Language_Code (Element : in out Element_Type; Value : in String);
function Language_Code (Element : Element_Type) return String;
procedure Tab_Index (Element : in out Element_Type; Value : in Natural);
function Tab_Index (Element : Element_Type) return Natural;
procedure Spell_Check (Element : in out Element_Type;
Value : in Boolean := True);
function Spell_Check (Element : Element_Type) return Boolean;
-- If true Element is subject to browser spell checking if Editable is
-- also true.
procedure Text (Element : in out Element_Type; Value : in String);
function Text (Element : Element_Type) return String;
-- Text content of element.
type Text_Direction_Type is (Left_To_Right, Right_To_Left);
procedure Text_Direction (Element : in out Element_Type;
Value : in Text_Direction_Type);
function Text_Direction (Element : Element_Type) return Text_Direction_Type;
-- BiDi text direction
-- Visibility and Layout Properties --
procedure Hidden (Element : in out Element_Type;
Value : in Boolean := True);
function Hidden (Element : Element_Type) return Boolean;
-- The hidden property will make an element invisible, however unlike
-- the property Visible which uses CSS to hide the Element, Hidden implies
-- the element is semantically not relevant not just visually and will
-- _also_ remove it from layout similar to setting Element.Display (None).
procedure Visible (Element : in out Element_Type;
Value : in Boolean := True);
function Visible (Element : Element_Type) return Boolean;
-- This will cause the Element to no longer be visible but it will still
-- take up space where it was in the layout. Use Element.Hidden to also
-- remove from layout.
-- Note: that each property, Visible, Hidden and Display (None) all work
-- independently and do not reflect the actual client side visual state
-- but the property state. To check if an object is for sure not visible
-- would require checking all three properties.
procedure Display (Element : in out Element_Type;
Value : in String);
function Display (Element : Element_Type) return String;
-- Display sets the CSS Display property that handles how elements are
-- treated by the browser layout engine.
--
-- Common Values:
--
-- none - Remove Element from layout but remain in the DOM this is
-- similar to Element.Hidden, but not like Element.Visible
-- that makes the element not visible but still take up
-- space in layout.
--
-- block - Displays an element starting on a new line and stretches
-- out to the left and right as far as it can. e.g. <div> by
-- default
--
-- inline - Wraps with text in a paragraph. e.g. <span> by default
--
-- inline-block - Flows with paragraph but will always fill from left to
-- right.
--
-- flex - Use the "flexbox" model
-- Box Properties --
type Clear_Side_Type is (Left, Right, Both);
procedure Clear_Side (Element : in out Element_Type;
Value : in Clear_Side_Type);
-- When using "float" for layout sets if the right or left side
-- of Block should be clear of any "floated" Element.
type Float_Type is (None, Left, Right);
procedure Layout_Float (Element : in out Element_Type;
Value : in Float_Type);
-- Sets if Element should "float" to the left or right until touching
-- the closest element.
type Overflow_Type is (Visible, Hidden, Scroll, Auto);
procedure Overflow (Element : in out Element_Type;
Value : in Overflow_Type);
function Overflow (Element : Element_Type) return Overflow_Type;
-- How to handle overflow of contents of an element's box
-- The default is Visible - no clipping.
procedure Overflow_X (Element : in out Element_Type;
Value : in Overflow_Type);
procedure Overflow_Y (Element : in out Element_Type;
Value : in Overflow_Type);
-- How to handle overflow of contents of an element's box for X or Y
-- The default is Visible - no clipping.
type Resizable_Type is (None, Both, Horizontal, Vertical);
procedure Resizable (Element : in out Element_Type;
Value : in Resizable_Type);
function Resizable (Element : Element_Type) return Resizable_Type;
-- If overflow is not set to visible, sets if element can be resized
-- by user.
type Position_Type is (Static, Absolute, Fixed, Relative);
procedure Position (Element : in out Element_Type;
Value : in Position_Type);
function Position (Element : Element_Type) return Position_Type;
-- Determines how the properties left, right, top and bottom are
-- interpreted.
--
-- Static - According to document flow, position properties have no
-- affect.
-- Absolute - Position properties are relative to the first non-static
-- element in the DOM before Element
-- Fixed - Position properties are relative to browser window
-- Relative - Position properties are relative to where the static position
-- of the element would in the normal document flow.
type Vertical_Align_Type is (Baseline, Sub, Super, Top, Middle, Bottom,
Text_Top, Text_Bottom);
procedure Vertical_Align (Element : in out Element_Type;
Value : in Vertical_Align_Type);
-- Vertical alignment of Element
type Box_Sizing_Type is (Content_Box, Border_Box);
procedure Box_Sizing (Element : in out Element_Type;
Value : in Box_Sizing_Type);
function Box_Sizing (Element : Element_Type) return Box_Sizing_Type;
-- Affects if height and width properties represent just the content or
-- the border, margin, padding, scroll and content area as a whole.
-- The default is Content_Box
procedure Z_Index (Element : in out Element_Type;
Value : in Integer);
-- Set stack order of element
-- Note: Z_Index only works on Elements with Position Type of absolute,
-- relative and fixed.
procedure Margin (Element : in out Element_Type;
Top : in String := "0";
Right : in String := "0";
Bottom : in String := "0";
Left : in String := "0");
-- Each can be - length|auto|initial|inherit
procedure Padding (Element : in out Element_Type;
Top : in String := "0";
Right : in String := "0";
Bottom : in String := "0";
Left : in String := "0");
-- Each can be - length|initial|inherit
function Position_Top (Element : Element_Type) return Integer;
function Position_Left (Element : Element_Type) return Integer;
-- Position in pixels relative to Element's parent in the DOM
function Offset_From_Top (Element : Element_Type) return Integer;
function Offset_From_Left (Element : Element_Type) return Integer;
-- Position in pixels relative to the document
procedure Left (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Left (Element : in out Element_Type;
Value : in String);
function Left (Element : Element_Type) return String;
procedure Right (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Right (Element : in out Element_Type;
Value : in String);
function Right (Element : Element_Type) return String;
procedure Top (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Top (Element : in out Element_Type;
Value : in String);
function Top (Element : Element_Type) return String;
procedure Bottom (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Bottom (Element : in out Element_Type;
Value : in String);
function Bottom (Element : Element_Type) return String;
procedure Box_Height (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Box_Height (Element : in out Element_Type;
Value : in String);
function Box_Height (Element : Element_Type) return String;
-- Box height based on Box_Sizing
procedure Box_Width (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Box_Width (Element : in out Element_Type;
Value : in String);
function Box_Width (Element : Element_Type) return String;
-- Box with based on Box_Sizing
procedure Minimum_Height (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Minimum_Height (Element : in out Element_Type;
Value : in String);
function Minimum_Height (Element : Element_Type) return String;
procedure Maximum_Height (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Maximum_Height (Element : in out Element_Type;
Value : in String);
function Maximum_Height (Element : Element_Type) return String;
procedure Minimum_Width (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Minimum_Width (Element : in out Element_Type;
Value : in String);
function Minimum_Width (Element : Element_Type) return String;
procedure Maximum_Width (Element : in out Element_Type;
Value : in Integer;
Unit : in String := "px");
procedure Maximum_Width (Element : in out Element_Type;
Value : in String);
function Maximum_Width (Element : Element_Type) return String;
-- For reference:
-- | Margin | Border | Padding | Scroll | [Element] | Scroll | Padding ...
-- Height and Width of Element are in Base_Type
-- All the following have the advantage of the CSS related size properties
-- in that the results are always pixels and numeric.
procedure Inner_Height (Element : in out Element_Type; Value : in Integer);
function Inner_Height (Element : Element_Type) return Integer;
-- Includes padding but not border
procedure Inner_Width (Element : in out Element_Type; Value : in Integer);
function Inner_Width (Element : Element_Type) return Integer;
-- Includes padding but not border
function Outer_Height (Element : Element_Type) return Integer;
-- Includes padding and border but not margin
function Outer_Width (Element : Element_Type) return Integer;
-- Includes padding and border but not margin
function Outer_Height_To_Margin (Element : Element_Type) return Integer;
-- Includes padding and border and margin
function Outer_Width_To_Margin
(Element : Element_Type) return Integer;
-- Includes padding and border and margin
function Client_Width (Element : Element_Type) return Natural;
-- Inner width of an element in pixels.
-- CSS width + CSS padding - width of vertical scrollbar (if present)
-- Does not include the border or margin.
function Client_Height (Element : Element_Type) return Natural;
-- Inner height of an element in pixels.
-- CSS height + CSS padding - height of horizontal scrollbar (if present)
-- Does not include the border or margin.
function Client_Left (Element : Element_Type) return Natural;
-- The width of the left border of an element in pixels.
--. It does not include the margin or padding.
function Client_Top (Element : Element_Type) return Natural;
-- The width of the top border of an element in pixels.
--. It does not include the margin or padding.
function Offset_Width (Element : Element_Type) return Integer;
-- CSS width + CSS padding + width of vertical scrollbar (if present) +
-- Border
function Offset_Height (Element : Element_Type) return Integer;
-- CSS height + CSS padding + height of horizontal scrollbar (if present) +
-- Border
function Offset_Left (Element : Element_Type) return Integer;
-- The width from parent element border to child border left
function Offset_Top (Element : Element_Type) return Integer;
-- The width from parent element border to child border top
function Scroll_Width (Element : Element_Type) return Natural;
-- Either the width in pixels of the content of an element or the width of
-- the element itself, whichever is greater
function Scroll_Height (Element : Element_Type) return Natural;
-- Height of an element's content, including content not visible on the
-- screen due to overflow.
procedure Scroll_Left (Element : in out Element_Type; Value : Integer);
function Scroll_Left (Element : Element_Type) return Integer;
-- The number of pixels that an element's content is scrolled to the left.
-- For RTL languages is negative.
procedure Scroll_Top (Element : in out Element_Type; Value : Integer);
function Scroll_Top (Element : Element_Type) return Integer;
-- The number of pixels that an element's content has been scrolled
-- upward.
-- Style Properties --
-- Color --
procedure Color (Element : in out Element_Type; Value : String);
procedure Color (Element : in out Element_Type;
RGBA : in Gnoga.RGBA_Type);
procedure Color (Element : in out Element_Type;
Enum : Gnoga.Colors.Color_Enumeration);
function Color (Element : Element_Type) return Gnoga.RGBA_Type;
procedure Opacity (Element : in out Element_Type;
Alpha : in Gnoga.Alpha_Type);
function Opacity (Element : Element_Type) return Gnoga.Alpha_Type;
-- Background --
type Background_Attachment_Type is (Scroll, Fixed, Local);
procedure Background_Attachment
(Element : in out Element_Type;
Value : in Background_Attachment_Type);
function Background_Attachment (Element : Element_Type)
return Background_Attachment_Type;
procedure Background_Color (Element : in out Element_Type;
Value : in String);
procedure Background_Color (Element : in out Element_Type;
RGBA : in Gnoga.RGBA_Type);
procedure Background_Color
(Element : in out Element_Type;
Enum : in Gnoga.Colors.Color_Enumeration);
function Background_Color (Element : Element_Type)
return Gnoga.RGBA_Type;
procedure Background_Image (Element : in out Element_Type;
Value : in String);
function Background_Image (Element : Element_Type) return String;
-- proper syntax is "url(...)" | "" to clear
procedure Background_Position (Element : in out Element_Type;
Value : in String);
function Background_Position (Element : Element_Type) return String;
-- combination of 2 - left/right/center/top/bottom | %x %y | x y
procedure Background_Origin (Element : in out Element_Type;
Value : in String);
function Background_Origin (Element : Element_Type) return String;
-- Background position property is relative to origin of:
-- padding-box|border-box|content-box
procedure Background_Repeat (Element : in out Element_Type;
Value : in String);
function Background_Repeat (Element : Element_Type) return String;
-- repeat|repeat-x|repeat-y|no-repeat
procedure Background_Clip (Element : in out Element_Type;
Value : in String);
function Background_Clip (Element : Element_Type) return String;
-- border-box|padding-box|content-box
procedure Background_Size (Element : in out Element_Type;
Value : in String);
function Background_Size (Element : Element_Type) return String;
-- auto| w h | % = cover of parent | contain
-- Border --
type Border_Style is (None, Hidden, Dotted, Dashed, Solid, Double, Groove,
Ridge, Inset, Outset);
procedure Border (Element : in out Element_Type;
Width : in String := "medium";
Style : in Border_Style := Solid;
Color : in Gnoga.Colors.Color_Enumeration :=
Gnoga.Colors.Black);
-- Width = medium|thin|thick|length|initial|inherit;
-- If Color is "" then border is same as Element.Color
procedure Border_Radius (Element : in out Element_Type;
Radius : in String := "0");
-- Curve of borders
-- Radius = length|%|initial|inherit
procedure Shadow (Element : in out Element_Type;
Horizontal_Position : in String;
Vertical_Position : in String;
Blur : in String := "";
Spread : in String := "";
Color : in Gnoga.Colors.Color_Enumeration := Gnoga.Colors.Black;
Inset_Shadow : in Boolean := False);
procedure Shadow_None (Element : in out Element_Type);
type Outline_Style_Type is (None, Hidden, Dotted, Dashed, Solid, Double,
Groove, Ridge, Inset, Outset);
procedure Outline (Element : in out Element_Type;
Color : in String := "invert";
Style : in Outline_Style_Type := None;
Width : in String := "medium");
procedure Cursor (Element : in out Element_Type;
Value : in String);
function Cursor (Element : Element_Type) return String;
-- Sets the cursor to a standard type or an image
-- if set to url(url_to_image). When using a url is best
-- to suggest an alternate cursor, e.g. "url(url_to_image),auto"
-- A list of standard cursor types can be found at:
-- http://www.w3schools.com/cssref/pr_class_cursor.asp
-- Text --
type Font_Style_Type is (Normal, Italic, Oblique);
type Font_Weight_Type is (Weight_Normal, Weight_Bold,
Weight_Bolder, Weight_Lighter,
Weight_100, Weight_200, Weight_300,
Weight_400, Weight_500, Weight_600,
Weight_700, Weight_800, Weight_900);
function Image (Value : in Gnoga.Gui.Element.Font_Weight_Type) return String;
function Value (Value : in String) return Gnoga.Gui.Element.Font_Weight_Type;
type Font_Variant_Type is (Normal, Small_Caps);
type System_Font_Type is (Caption, Icon, Menu, Message_Box, Small_Caption,
Status_Bar);
procedure Font (Element : in out Element_Type;
Family : in String := "sans-serif";
Height : in String := "medium";
Style : in Font_Style_Type := Normal;
Weight : in Font_Weight_Type := Weight_Normal;
Variant : in Font_Variant_Type := Normal);
procedure Font (Element : in out Element_Type;
System_Font : in System_Font_Type);
-- Sets or returns the current font properties for text content
type Alignment_Type is (Left, Right, Center, At_Start, To_End);
procedure Text_Alignment (Element : in out Element_Type;
Value : in Alignment_Type);
-- Text Alignment, At_Start = Left, and To_End = Right in ltr languages
-- in rtl languages At_Start = Right, and To_End = Left.
-- Framework Properties --
procedure Auto_Place (Element : in out Element_Type; Value : Boolean);
function Auto_Place (Element : Element_Type) return Boolean;
-- Elements by default are created outside the DOM and therefore not
-- visible. If Auto_Place is set to false _before_ Create is called on
-- an Element, View's will not place the Element in to the DOM as is
-- the View's default behavior. Custom widgets that have child widgets
-- should be designed to respect this property. Auto_Place if set to
-- False will also prevent Auto_Set_View if Element's Parent is a Window
-- General Access to Element --
procedure Style (Element : in out Element_Type;
Name : in String;
Value : in String);
procedure Style (Element : in out Element_Type;
Name : in String;
Value : in Integer);
function Style (Element : Element_Type; Name : String) return String;
function Style (Element : Element_Type; Name : String) return Integer;
-- General access to style Name
procedure Attribute (Element : in out Element_Type;
Name : in String;
Value : in String);
function Attribute (Element : Element_Type; Name : String) return String;
-- General access to attribute Name
-- Traversal Properties --
procedure First_Child (Element : in out Element_Type;
Child : in out Element_Type'Class);
-- If Child does not have an html id than Element_Type will have an
-- ID of undefined and therefore attached to no actual HTML element.
procedure Next_Sibling (Element : in out Element_Type;
Sibling : in out Element_Type'Class);
-- If Sibling does not have an html id than Element_Type will have an
-- ID of undefined and therefore attached to no actual HTML element.
-- Internal Properties --
function HTML_Tag (Element : Element_Type) return String;
-------------------------------------------------------------------------
-- Element_Type - Methods
-------------------------------------------------------------------------
-- Element Methods --
procedure Click (Element : in out Element_Type);
-- Simulate click on element
procedure Add_Class (Element : in out Element_Type; Class_Name : in String);
-- Adds one or more Class_Name(s) to Element
procedure Remove_Class (Element : in out Element_Type;
Class_Name : in String);
-- Removes one or more Class_Name(s) to Element
procedure Toggle_Class (Element : in out Element_Type;
Class_Name : in String);
-- Toggles on and off one or more Class_Name(s) to Element
-- DOM Placement Methods --
procedure Place_Inside_Top_Of (Element : in out Element_Type;
Target : in out Element_Type'Class);
procedure Place_Inside_Bottom_Of (Element : in out Element_Type;
Target : in out Element_Type'Class);
procedure Place_Before (Element : in out Element_Type;
Target : in out Element_Type'Class);
procedure Place_After (Element : in out Element_Type;
Target : in out Element_Type'Class);
procedure Remove (Element : in out Element_Type);
-- Removes an element from the DOM, if the ID_Type is DOM_ID, the ID
-- will be changed to a unique Gnoga_ID before removal.
private
type Element_Type is new Gnoga.Gui.Base_Type with
record
Auto_Place : Boolean := True;
end record;
end Ada_GUI.Gnoga.Gui.Element;
|
-- --
-- package Copyright (c) Dmitry A. Kazakov --
-- Strings_Edit.Streams Luebeck --
-- Implementation Spring, 2009 --
-- --
-- Last revision : 13:11 14 Sep 2019 --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public License as --
-- published by the Free Software Foundation; either version 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from --
-- this unit, or you link this unit with other files to produce an --
-- executable, this unit does not by itself cause the resulting --
-- executable to be covered by the GNU General Public License. This --
-- exception does not however invalidate any other reasons why the --
-- executable file might be covered by the GNU Public License. --
--____________________________________________________________________--
--
with Ada.IO_Exceptions; use Ada.IO_Exceptions;
package body Strings_Edit.Streams is
procedure Increment
( Left : in out Integer;
Right : Stream_Element_Offset
) is
pragma Inline (Increment);
begin
Left := Left + Integer (Right) * Char_Count;
end Increment;
function Get (Stream : String_Stream) return String is
begin
return Stream.Data (1..Stream.Position - 1);
end Get;
function Get_Size (Stream : String_Stream)
return Stream_Element_Count is
begin
return
( Stream_Element_Offset (Stream.Data'Last - Stream.Position + 1)
/ Char_Count
);
end Get_Size;
procedure Read
( Stream : in out String_Stream;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset
) is
begin
if Stream.Position > Stream.Length then
raise End_Error;
end if;
declare
subtype Space is Stream_Element_Array (1..Get_Size (Stream));
Data : Space;
pragma Import (Ada, Data);
for Data'Address use Stream.Data (Stream.Position)'Address;
begin
if Space'Length >= Item'Length then
Last := Item'Last;
Item := Data (1..Item'Length);
Increment (Stream.Position, Item'Length);
else
Last := Item'First + Data'Length - 1;
Item (Item'First..Last) := Data;
Stream.Position := Stream.Data'Last + 1;
end if;
end;
end Read;
procedure Rewind (Stream : in out String_Stream) is
begin
Stream.Position := 1;
end Rewind;
procedure Set (Stream : in out String_Stream; Content : String) is
begin
if Content'Length > Stream.Length then
raise Constraint_Error;
end if;
Stream.Position := Stream.Length - Content'Length + 1;
Stream.Data (Stream.Position..Stream.Length) := Content;
end Set;
procedure Write
( Stream : in out String_Stream;
Item : Stream_Element_Array
) is
begin
if Stream.Position > Stream.Length then
raise End_Error;
end if;
declare
subtype Space is Stream_Element_Array (1..Get_Size (Stream));
Data : Space;
pragma Import (Ada, Data);
for Data'Address use Stream.Data (Stream.Position)'Address;
begin
if Item'Length > Space'Length then
raise End_Error;
end if;
Data (1..Item'Length) := Item;
Increment (Stream.Position, Item'Length);
end;
end Write;
end Strings_Edit.Streams;
|
pragma License (Unrestricted);
-- implementation unit required by compiler
with Ada.Exceptions;
with Ada.Finalization;
with Ada.Unchecked_Conversion;
package System.Tasking.Protected_Objects.Entries is
type Node is limited record
Super : aliased Synchronous_Objects.Queue_Node;
E : Protected_Entry_Index;
Uninterpreted_Data : Address;
Caller : Task_Id;
Action : Boolean;
Requeued : Boolean;
Waiting : aliased Synchronous_Objects.Event;
X : Ada.Exceptions.Exception_Occurrence;
end record;
pragma Suppress_Initialization (Node);
type Node_Access is access all Node;
function Downcast is
new Ada.Unchecked_Conversion (
Synchronous_Objects.Queue_Node_Access,
Node_Access);
type Find_Body_Index_Access is access function (
O : Address;
E : Protected_Entry_Index)
return Protected_Entry_Index;
type Protected_Entry_Queue_Max_Array is
array (Positive_Protected_Entry_Index range <>) of Natural;
type Protected_Entry_Queue_Max_Access is
access constant Protected_Entry_Queue_Max_Array;
-- required by compiler
type Protected_Entry_Body_Array is
array (Positive_Protected_Entry_Index range <>) of Entry_Body;
pragma Suppress_Initialization (Protected_Entry_Body_Array);
type Protected_Entry_Body_Access is
access constant Protected_Entry_Body_Array;
-- required by compiler
-- (if it is not controlled type, compiler may be crashed!)
type Protection_Entries (Num_Entries : Protected_Entry_Index) is
limited new Ada.Finalization.Limited_Controlled with
record
Mutex : aliased Synchronous_Objects.Mutex;
Calling : aliased Synchronous_Objects.Queue;
Compiler_Info : Address;
Entry_Bodies : Protected_Entry_Body_Access;
Find_Body_Index : Find_Body_Index_Access;
Raised_On_Barrier : Boolean;
Current_Calling : access Node;
end record;
-- required for synchronized interface by compiler
type Protection_Entries_Access is access all Protection_Entries'Class;
for Protection_Entries_Access'Storage_Size use 0;
-- required by compiler
procedure Initialize_Protection_Entries (
Object : not null access Protection_Entries'Class;
Ceiling_Priority : Integer;
Compiler_Info : Address;
Entry_Queue_Maxes : Protected_Entry_Queue_Max_Access;
Entry_Bodies : Protected_Entry_Body_Access;
Find_Body_Index : Find_Body_Index_Access);
overriding procedure Finalize (Object : in out Protection_Entries);
-- required by compiler
procedure Lock_Entries (
Object : not null access Protection_Entries'Class);
procedure Unlock_Entries (
Object : not null access Protection_Entries'Class);
-- for System.Tasking.Protected_Objects.Operations.Service_Entries
procedure Cancel_Calls (Object : in out Protection_Entries'Class);
-- required by compiler (s-tpoben.ads)
function Get_Ceiling (Object : not null access Protection_Entries'Class)
return Any_Priority;
-- unimplemented subprograms required by compiler
-- Set_Ceiling
end System.Tasking.Protected_Objects.Entries;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S P I T B O L . T A B L E _ I N T E G E R --
-- --
-- S p e c --
-- --
-- Copyright (C) 1997-2010, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- SPITBOL tables with integer values
-- This package provides a predefined instantiation of the table abstraction
-- for type Standard.Integer. The largest negative integer is used as the
-- null value for the table. This package is based on Macro-SPITBOL created
-- by Robert Dewar.
package GNAT.Spitbol.Table_Integer is
new GNAT.Spitbol.Table (Integer, Integer'First, Integer'Image);
pragma Preelaborate (Table_Integer);
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2019, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with SAM_SVD.DAC; use SAM_SVD.DAC;
package body SAM.DAC is
-------------
-- Enabled --
-------------
function Enabled return Boolean is
begin
return DAC_Periph.CTRLA.ENABLE;
end Enabled;
---------------
-- Configure --
---------------
procedure Configure (Mode : Mode_Kind; Vref : Reference_Volage) is
begin
DAC_Periph.CTRLA.SWRST := True;
-- Wait for synchro
while DAC_Periph.SYNCBUSY.SWRST loop
null;
end loop;
DAC_Periph.CTRLB :=
(DIFF => Mode = Differential_Mode,
REFSEL => CTRLB_REFSELSelect'Enum_Val (Vref'Enum_Rep),
others => <>);
end Configure;
-----------------------
-- Configure_Channel --
-----------------------
procedure Configure_Channel
(Chan : Channel_ID;
Oversampling : Oversampling_Ratio;
Refresh : Refresh_Period;
Enable_Dithering : Boolean;
Run_In_Standby : Boolean;
Standalone_Filter : Boolean;
Current : Current_Control;
Adjustement : Data_Adjustment;
Enable_Filter_Result_Ready_Evt : Boolean;
Enable_Data_Buffer_Empty_Evt : Boolean;
Enable_Convert_On_Input_Evt : Boolean;
Invert_Input_Evt : Boolean;
Enable_Overrun_Int : Boolean;
Enable_Underrun_Int : Boolean;
Enable_Result_Ready_Int : Boolean;
Enable_Buffer_Empty_Int : Boolean)
is
CTRL : DAC_DACCTRL_Register := DAC_Periph.DACCTRL (Integer (Chan));
begin
-- Control --
CTRL.LEFTADJ := Adjustement = Left_Adjusted;
CTRL.CCTRL := DACCTRL_CCTRLSelect'Enum_Val (Current'Enum_Rep);
CTRL.FEXT := Standalone_Filter;
CTRL.RUNSTDBY := Run_In_Standby;
CTRL.DITHER := Enable_Dithering;
CTRL.REFRESH := DAC_DACCTRL_REFRESH_Field (Refresh);
CTRL.OSR := DAC_DACCTRL_OSR_Field (Oversampling'Enum_Rep);
DAC_Periph.DACCTRL (Integer (Chan)) := CTRL;
-- Events --
DAC_Periph.EVCTRL.INVEI.Arr (Integer (Chan)) := Invert_Input_Evt;
DAC_Periph.EVCTRL.EMPTYEO.Arr (Integer (Chan)) := Enable_Data_Buffer_Empty_Evt;
DAC_Periph.EVCTRL.STARTEI.Arr (Integer (Chan)) := Enable_Convert_On_Input_Evt;
DAC_Periph.EVCTRL.RESRDYEO.Arr (Integer (Chan)) := Enable_Filter_Result_Ready_Evt;
-- Interrupts --
if Enable_Overrun_Int then
DAC_Periph.INTENSET.OVERRUN.Arr (Integer (Chan)) := True;
else
DAC_Periph.INTENSET.OVERRUN.Arr (Integer (Chan)) := True;
end if;
if Enable_Result_Ready_Int then
DAC_Periph.INTENSET.RESRDY.Arr (Integer (Chan)) := True;
else
DAC_Periph.INTENSET.RESRDY.Arr (Integer (Chan)) := True;
end if;
if Enable_Underrun_Int then
DAC_Periph.INTENSET.UNDERRUN.Arr (Integer (Chan)) := True;
else
DAC_Periph.INTENSET.UNDERRUN.Arr (Integer (Chan)) := True;
end if;
if Enable_Buffer_Empty_Int then
DAC_Periph.INTENSET.EMPTY.Arr (Integer (Chan)) := True;
else
DAC_Periph.INTENSET.EMPTY.Arr (Integer (Chan)) := True;
end if;
end Configure_Channel;
------------
-- Enable --
------------
procedure Enable (Chan_0 : Boolean; Chan_1 : Boolean) is
begin
if Enabled then
DAC_Periph.CTRLA.ENABLE := False;
-- Wait for sync
while DAC_Periph.SYNCBUSY.ENABLE loop
null;
end loop;
end if;
DAC_Periph.DACCTRL (0).ENABLE := Chan_0;
DAC_Periph.DACCTRL (1).ENABLE := Chan_1;
if Chan_1 or else Chan_1 then
DAC_Periph.CTRLA.ENABLE := True;
-- Wait for sync
while DAC_Periph.SYNCBUSY.ENABLE loop
null;
end loop;
end if;
end Enable;
-----------
-- Write --
-----------
procedure Write (Chan : Channel_ID; Data : HAL.UInt16) is
begin
DAC_Periph.DATA (Integer (Chan)) := Data;
end Write;
------------------
-- Write_Buffer --
------------------
procedure Write_Buffer (Chan : Channel_ID; Data : HAL.UInt16) is
begin
DAC_Periph.DATABUF (Integer (Chan)) := Data;
end Write_Buffer;
------------
-- Result --
------------
function Result (Chan : Channel_ID) return HAL.UInt16 is
begin
return DAC_Periph.RESULT (Integer (Chan));
end Result;
------------------
-- Data_Address --
------------------
function Data_Address (Chan : Channel_ID) return System.Address is
begin
return DAC_Periph.DATA (Integer (Chan))'Address;
end Data_Address;
---------------------
-- Debug_Stop_Mode --
---------------------
procedure Debug_Stop_Mode (Enabled : Boolean := True) is
begin
DAC_Periph.DBGCTRL.DBGRUN := not Enabled;
end Debug_Stop_Mode;
end SAM.DAC;
|
-- Copyright 2005-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/>.
procedure First is
procedure Break_Me is
begin
null;
end Break_Me;
begin
Break_Me;
end First;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . E X P I N T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-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 System.Exp_Int is
-----------------
-- Exp_Integer --
-----------------
-- Note that negative exponents get a constraint error because the
-- subtype of the Right argument (the exponent) is Natural.
function Exp_Integer
(Left : Integer;
Right : Natural)
return Integer
is
Result : Integer := 1;
Factor : Integer := Left;
Exp : Natural := Right;
begin
-- We use the standard logarithmic approach, Exp gets shifted right
-- testing successive low order bits and Factor is the value of the
-- base raised to the next power of 2.
-- Note: it is not worth special casing base values -1, 0, +1 since
-- the expander does this when the base is a literal, and other cases
-- will be extremely rare.
if Exp /= 0 then
loop
if Exp rem 2 /= 0 then
declare
pragma Unsuppress (All_Checks);
begin
Result := Result * Factor;
end;
end if;
Exp := Exp / 2;
exit when Exp = 0;
declare
pragma Unsuppress (All_Checks);
begin
Factor := Factor * Factor;
end;
end loop;
end if;
return Result;
end Exp_Integer;
end System.Exp_Int;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ W I D E _ T E X T _ I O . M O D U L A R _ A U X --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-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. --
-- --
------------------------------------------------------------------------------
with Ada.Wide_Wide_Text_IO.Generic_Aux; use Ada.Wide_Wide_Text_IO.Generic_Aux;
with System.Img_BIU; use System.Img_BIU;
with System.Img_Uns; use System.Img_Uns;
with System.Img_LLB; use System.Img_LLB;
with System.Img_LLU; use System.Img_LLU;
with System.Img_LLW; use System.Img_LLW;
with System.Img_WIU; use System.Img_WIU;
with System.Val_Uns; use System.Val_Uns;
with System.Val_LLU; use System.Val_LLU;
package body Ada.Wide_Wide_Text_IO.Modular_Aux is
use System.Unsigned_Types;
-----------------------
-- Local Subprograms --
-----------------------
procedure Load_Modular
(File : File_Type;
Buf : out String;
Ptr : in out Natural);
-- This is an auxiliary routine that is used to load an possibly signed
-- modular literal value from the input file into Buf, starting at Ptr + 1.
-- Ptr is left set to the last character stored.
-------------
-- Get_LLU --
-------------
procedure Get_LLU
(File : File_Type;
Item : out Long_Long_Unsigned;
Width : Field)
is
Buf : String (1 .. Field'Last);
Stop : Integer := 0;
Ptr : aliased Integer := 1;
begin
if Width /= 0 then
Load_Width (File, Width, Buf, Stop);
String_Skip (Buf, Ptr);
else
Load_Modular (File, Buf, Stop);
end if;
Item := Scan_Long_Long_Unsigned (Buf, Ptr'Access, Stop);
Check_End_Of_Field (Buf, Stop, Ptr, Width);
end Get_LLU;
-------------
-- Get_Uns --
-------------
procedure Get_Uns
(File : File_Type;
Item : out Unsigned;
Width : Field)
is
Buf : String (1 .. Field'Last);
Stop : Integer := 0;
Ptr : aliased Integer := 1;
begin
if Width /= 0 then
Load_Width (File, Width, Buf, Stop);
String_Skip (Buf, Ptr);
else
Load_Modular (File, Buf, Stop);
end if;
Item := Scan_Unsigned (Buf, Ptr'Access, Stop);
Check_End_Of_Field (Buf, Stop, Ptr, Width);
end Get_Uns;
--------------
-- Gets_LLU --
--------------
procedure Gets_LLU
(From : String;
Item : out Long_Long_Unsigned;
Last : out Positive)
is
Pos : aliased Integer;
begin
String_Skip (From, Pos);
Item := Scan_Long_Long_Unsigned (From, Pos'Access, From'Last);
Last := Pos - 1;
exception
when Constraint_Error =>
raise Data_Error;
end Gets_LLU;
--------------
-- Gets_Uns --
--------------
procedure Gets_Uns
(From : String;
Item : out Unsigned;
Last : out Positive)
is
Pos : aliased Integer;
begin
String_Skip (From, Pos);
Item := Scan_Unsigned (From, Pos'Access, From'Last);
Last := Pos - 1;
exception
when Constraint_Error =>
raise Data_Error;
end Gets_Uns;
------------------
-- Load_Modular --
------------------
procedure Load_Modular
(File : File_Type;
Buf : out String;
Ptr : in out Natural)
is
Hash_Loc : Natural;
Loaded : Boolean;
begin
Load_Skip (File);
-- Note: it is a bit strange to allow a minus sign here, but it seems
-- consistent with the general behavior expected by the ACVC tests
-- which is to scan past junk and then signal data error, see ACVC
-- test CE3704F, case (6), which is for signed integer exponents,
-- which seems a similar case.
Load (File, Buf, Ptr, '+', '-');
Load_Digits (File, Buf, Ptr, Loaded);
if Loaded then
-- Deal with based case. We recognize either the standard '#' or the
-- allowed alternative replacement ':' (see RM J.2(3)).
Load (File, Buf, Ptr, '#', ':', Loaded);
if Loaded then
Hash_Loc := Ptr;
Load_Extended_Digits (File, Buf, Ptr);
Load (File, Buf, Ptr, Buf (Hash_Loc));
end if;
Load (File, Buf, Ptr, 'E', 'e', Loaded);
if Loaded then
-- Note: it is strange to allow a minus sign, since the syntax
-- does not, but that is what ACVC test CE3704F, case (6) wants
-- for the signed case, and there seems no good reason to treat
-- exponents differently for the signed and unsigned cases.
Load (File, Buf, Ptr, '+', '-');
Load_Digits (File, Buf, Ptr);
end if;
end if;
end Load_Modular;
-------------
-- Put_LLU --
-------------
procedure Put_LLU
(File : File_Type;
Item : Long_Long_Unsigned;
Width : Field;
Base : Number_Base)
is
Buf : String (1 .. Field'Last);
Ptr : Natural := 0;
begin
if Base = 10 and then Width = 0 then
Set_Image_Long_Long_Unsigned (Item, Buf, Ptr);
elsif Base = 10 then
Set_Image_Width_Long_Long_Unsigned (Item, Width, Buf, Ptr);
else
Set_Image_Based_Long_Long_Unsigned (Item, Base, Width, Buf, Ptr);
end if;
Put_Item (File, Buf (1 .. Ptr));
end Put_LLU;
-------------
-- Put_Uns --
-------------
procedure Put_Uns
(File : File_Type;
Item : Unsigned;
Width : Field;
Base : Number_Base)
is
Buf : String (1 .. Field'Last);
Ptr : Natural := 0;
begin
if Base = 10 and then Width = 0 then
Set_Image_Unsigned (Item, Buf, Ptr);
elsif Base = 10 then
Set_Image_Width_Unsigned (Item, Width, Buf, Ptr);
else
Set_Image_Based_Unsigned (Item, Base, Width, Buf, Ptr);
end if;
Put_Item (File, Buf (1 .. Ptr));
end Put_Uns;
--------------
-- Puts_LLU --
--------------
procedure Puts_LLU
(To : out String;
Item : Long_Long_Unsigned;
Base : Number_Base)
is
Buf : String (1 .. Field'Last);
Ptr : Natural := 0;
begin
if Base = 10 then
Set_Image_Width_Long_Long_Unsigned (Item, To'Length, Buf, Ptr);
else
Set_Image_Based_Long_Long_Unsigned (Item, Base, To'Length, Buf, Ptr);
end if;
if Ptr > To'Length then
raise Layout_Error;
else
To (To'First .. To'First + Ptr - 1) := Buf (1 .. Ptr);
end if;
end Puts_LLU;
--------------
-- Puts_Uns --
--------------
procedure Puts_Uns
(To : out String;
Item : Unsigned;
Base : Number_Base)
is
Buf : String (1 .. Field'Last);
Ptr : Natural := 0;
begin
if Base = 10 then
Set_Image_Width_Unsigned (Item, To'Length, Buf, Ptr);
else
Set_Image_Based_Unsigned (Item, Base, To'Length, Buf, Ptr);
end if;
if Ptr > To'Length then
raise Layout_Error;
else
To (To'First .. To'First + Ptr - 1) := Buf (1 .. Ptr);
end if;
end Puts_Uns;
end Ada.Wide_Wide_Text_IO.Modular_Aux;
|
pragma License (Unrestricted);
-- implementation unit
package Ada.Streams.Naked_Stream_IO.Standard_Files is
pragma Elaborate_Body;
Standard_Input : aliased constant Non_Controlled_File_Type;
Standard_Output : aliased constant Non_Controlled_File_Type;
Standard_Error : aliased constant Non_Controlled_File_Type;
private
Standard_Input_Name : aliased System.Native_IO.Name_String (0 .. 6) := (
System.Native_IO.Name_Character'Val (Character'Pos ('*')),
System.Native_IO.Name_Character'Val (Character'Pos ('s')),
System.Native_IO.Name_Character'Val (Character'Pos ('t')),
System.Native_IO.Name_Character'Val (Character'Pos ('d')),
System.Native_IO.Name_Character'Val (Character'Pos ('i')),
System.Native_IO.Name_Character'Val (Character'Pos ('n')),
System.Native_IO.Name_Character'Val (0));
Standard_Input_Stream : aliased Stream_Type := (
Handle => System.Native_IO.Uninitialized_Standard_Input,
Mode => System.Native_IO.Read_Only_Mode,
Name => Standard_Input_Name (0)'Access,
Form => Default_Form,
Kind => Standard_Handle,
Has_Full_Name => False,
Buffer_Inline => 0,
Buffer => System.Null_Address,
Buffer_Length => Uninitialized_Buffer,
Buffer_Index => 0,
Reading_Index => 0,
Writing_Index => 0,
Closer => null,
Dispatcher => (Tags.No_Tag, null));
Standard_Output_Name : aliased System.Native_IO.Name_String (0 .. 7) := (
System.Native_IO.Name_Character'Val (Character'Pos ('*')),
System.Native_IO.Name_Character'Val (Character'Pos ('s')),
System.Native_IO.Name_Character'Val (Character'Pos ('t')),
System.Native_IO.Name_Character'Val (Character'Pos ('d')),
System.Native_IO.Name_Character'Val (Character'Pos ('o')),
System.Native_IO.Name_Character'Val (Character'Pos ('u')),
System.Native_IO.Name_Character'Val (Character'Pos ('t')),
System.Native_IO.Name_Character'Val (0));
Standard_Output_Stream : aliased Stream_Type := (
Handle => System.Native_IO.Uninitialized_Standard_Output,
Mode => System.Native_IO.Write_Only_Mode,
Name => Standard_Output_Name (0)'Access,
Form => Default_Form,
Kind => Standard_Handle,
Has_Full_Name => False,
Buffer_Inline => 0,
Buffer => System.Null_Address,
Buffer_Length => Uninitialized_Buffer,
Buffer_Index => 0,
Reading_Index => 0,
Writing_Index => 0,
Closer => null,
Dispatcher => (Tags.No_Tag, null));
Standard_Error_Name : aliased System.Native_IO.Name_String (0 .. 7) := (
System.Native_IO.Name_Character'Val (Character'Pos ('*')),
System.Native_IO.Name_Character'Val (Character'Pos ('s')),
System.Native_IO.Name_Character'Val (Character'Pos ('t')),
System.Native_IO.Name_Character'Val (Character'Pos ('d')),
System.Native_IO.Name_Character'Val (Character'Pos ('e')),
System.Native_IO.Name_Character'Val (Character'Pos ('r')),
System.Native_IO.Name_Character'Val (Character'Pos ('r')),
System.Native_IO.Name_Character'Val (0));
Standard_Error_Stream : aliased Stream_Type := (
Handle => System.Native_IO.Uninitialized_Standard_Error,
Mode => System.Native_IO.Write_Only_Mode,
Name => Standard_Error_Name (0)'Access,
Form => Default_Form,
Kind => Standard_Handle,
Has_Full_Name => False,
Buffer_Inline => 0,
Buffer => System.Null_Address,
Buffer_Length => Uninitialized_Buffer,
Buffer_Index => 0,
Reading_Index => 0,
Writing_Index => 0,
Closer => null,
Dispatcher => (Tags.No_Tag, null));
Standard_Input : aliased constant Non_Controlled_File_Type :=
Standard_Input_Stream'Access;
Standard_Output : aliased constant Non_Controlled_File_Type :=
Standard_Output_Stream'Access;
Standard_Error : aliased constant Non_Controlled_File_Type :=
Standard_Error_Stream'Access;
end Ada.Streams.Naked_Stream_IO.Standard_Files;
|
with Ada.Text_IO;
with Ada.Command_Line;
with Stemmer;
with Stemmer.Factory;
procedure Stemargs is
use Stemmer.Factory;
function Get_Language (Name : in String) return Language_Type;
function Get_Language (Name : in String) return Language_Type is
begin
return Language_Type'Value ("L_" & Name);
exception
when Constraint_Error =>
Ada.Text_IO.Put_Line ("Unsupported language: " & Ada.Command_Line.Argument (1));
return L_ENGLISH;
end Get_Language;
Count : constant Natural := Ada.Command_Line.Argument_Count;
begin
if Count <= 1 then
Ada.Text_IO.Put_Line ("Usage: stemargs language words...");
return;
end if;
declare
Lang : constant Language_Type := Get_Language (Ada.Command_Line.Argument (1));
begin
for I in 2 .. Count loop
Ada.Text_IO.Put_Line (Stem (Lang, Ada.Command_Line.Argument (I)));
end loop;
end;
end Stemargs;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
procedure Life is
-- D: Die, S: Stay the same, G: Grow a new cell
type Rules_Type is (D, S, G);
type Rule_Set is array (Natural range 0 .. 8) of Rules_Type;
type Grid_Type is array (Natural range <>, Natural range <>) of Boolean;
type Points_Type is array(Natural range <>, Natural range <>) of Natural;
type Life (Width : Natural := 10;
Height : Natural := 10) is
record
Generation : Natural := 0;
Rules : Rule_Set := (D, D, S, G, D, D, D, D, D);
Grid : Grid_Type (1 .. Width, 1 .. Height) := (others => (others => false));
Next_Grid : Grid_Type (1 .. Width, 1 .. Height) := (others => (others => false));
end record;
function Get(Self : Life;
X : Natural;
Y : Natural) return Boolean is
begin
if X > 0 and X <= Self.Width and Y > 0 and Y <= Self.Height then
return Self.Grid (X, Y);
end if;
return false;
end get;
function Get_Neighbors(Self : Life;
X : Natural;
Y : Natural) return Natural is
Neighbors: Natural;
begin
Neighbors := 0;
for X_Offset in Integer range -1 .. 1 loop
for Y_Offset in Integer range -1 .. 1 loop
-- Don't count the offset 0, 0
if X_Offset /= 0 or Y_Offset /= 0 then
if get(Self, X+X_Offset, Y+Y_Offset) then
Neighbors := Neighbors + 1;
end if;
end if;
end loop;
end loop;
return Neighbors;
end Get_Neighbors;
procedure Print_Grid(Self : Life) is
begin
Put ("Generation ");
Put (Self.Generation);
Put_Line("");
Put ("+");
for X in Self.Grid'Range (1) loop
Put ("-");
end loop;
Put_Line ("+");
for Y in Self.Grid'Range (2) loop
Put ("|");
for X in Self.Grid'Range (1) loop
if Get(Self, X, Y) then
Put("0");
else
Put(" ");
end if;
end loop;
Put_Line ("|");
end loop;
Put ("+");
for X in Self.Grid'Range (1) loop
Put ("-");
end loop;
Put_Line ("+");
end Print_Grid;
procedure Next_Generation(Self : out Life) is
Neighbors : Natural;
Next_State : Rules_Type;
begin
for X in Integer range 1 .. Self.Width loop
for Y in Integer range 1 .. Self.Height loop
Neighbors := Get_Neighbors(Self, x, y);
Next_State := Self.Rules (Neighbors);
if Next_State = G then
Self.Next_Grid (X, Y) := TRUE;
elsif Next_State = D then
Self.Next_Grid (X, Y) := FALSE;
end if;
end loop;
end loop;
Self.Generation := Self.Generation + 1;
for X in Integer range 1 .. Self.Width loop
for Y in Integer range 1 .. Self.Height loop
Self.Grid (X, Y) := Self.Next_Grid(X, Y);
end loop;
end loop;
end Next_Generation;
procedure Add_Figure(Self : out Life;
X : in Natural;
Y : in Natural;
Points : in Points_Type) is
begin
for I in points'Range loop
Self.Grid(X+Points(I, 0), Y+Points(I, 1)) := TRUE;
Self.Next_Grid(X+Points(I, 0), Y+Points(I, 1)) := TRUE;
end loop;
end Add_Figure;
Rpentomino : Points_Type := ((1, 0), (2, 0), (0, 1), (1, 1), (1, 2));
Block : Points_Type := ((0, 0), (1, 0), (0, 1), (1, 1));
Blinker : Points_Type := ((1, 0), (1, 1), (1, 2));
Beacon : Points_Type := ((0, 0), (0, 1), (1, 0), (2, 3), (3, 2), (3, 3));
Rules : Rule_Set := (D, D, S, G, D, D, D, D, D);
Game : Life(Width => 20, Height => 10);
begin
Add_Figure(Game, 15, 3, BEACON);
Add_Figure(Game, 5, 5, Rpentomino);
loop
Print_Grid(Game);
Next_Generation(Game);
delay(1.0);
end loop;
end Life;
|
with soc.dma; use soc.dma;
package body soc.devmap
with spark_mode => off
is
function find_periph
(addr : system_address;
size : unsigned_32)
return t_periph_id
is
begin
for id in periphs'range loop
if periphs(id).addr = addr and periphs(id).size = size then
return id;
end if;
end loop;
return NO_PERIPH;
end find_periph;
function find_dma_periph
(id : soc.dma.t_dma_periph_index;
stream : soc.dma.t_stream_index)
return t_periph_id
is
begin
case id is
when ID_DMA1 =>
case stream is
when 0 => return DMA1_STR0;
when 1 => return DMA1_STR1;
when 2 => return DMA1_STR2;
when 3 => return DMA1_STR3;
when 4 => return DMA1_STR4;
when 5 => return DMA1_STR5;
when 6 => return DMA1_STR6;
when 7 => return DMA1_STR7;
end case;
when ID_DMA2 =>
case stream is
when 0 => return DMA2_STR0;
when 1 => return DMA2_STR1;
when 2 => return DMA2_STR2;
when 3 => return DMA2_STR3;
when 4 => return DMA2_STR4;
when 5 => return DMA2_STR5;
when 6 => return DMA2_STR6;
when 7 => return DMA2_STR7;
end case;
end case;
end find_dma_periph;
end soc.devmap;
|
<?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>demux</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>6</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>4</id>
<name>accCtrl2demux_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></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>256</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>5</id>
<name>metadataBuffer_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</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="_3">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>keyBuffer_V_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>demux2getPath_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>45</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>demux2setPathMetadat_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>45</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="_6">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>demux2setPathValue_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>66</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>125</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>demuxState_load</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>161</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>186</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>wordCounter_V_load</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>187</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>valueLength_V_load</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>240</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>240</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>188</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>161</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>8</count>
<item_version>0</item_version>
<item>189</item>
<item>190</item>
<item>192</item>
<item>193</item>
<item>195</item>
<item>196</item>
<item>198</item>
<item>199</item>
</oprand_edges>
<opcode>switch</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.87</m_delay>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp_9</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.9</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>256</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>471</item>
<item>472</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>metadataWrWord_keyVa_2</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>metadataWrWord.keyValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>473</item>
<item>474</item>
<item>475</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>metadataWrWord_value</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>metadataWrWord.valueValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>476</item>
<item>477</item>
<item>479</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>metadataWrWord_EOP_V_2</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>metadataWrWord.EOP.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>480</item>
<item>481</item>
<item>482</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>setData_data_V_2</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>setData.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>483</item>
<item>484</item>
<item>485</item>
<item>486</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tmp_V</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>230</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>487</item>
<item>488</item>
<item>489</item>
<item>490</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_445</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>232</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>232</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>491</item>
<item>492</item>
<item>493</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>232</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>232</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>494</item>
<item>495</item>
<item>496</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_10</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>234</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>234</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.10</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>497</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>234</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>234</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>498</item>
<item>499</item>
<item>500</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp_201_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>235</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>235</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>501</item>
<item>502</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>235</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>235</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>503</item>
<item>504</item>
<item>782</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>236</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>236</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>505</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>237</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>237</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>506</item>
<item>507</item>
<item>508</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>238</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>238</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>509</item>
<item>510</item>
<item>511</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>238</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>238</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>512</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_203_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>240</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>240</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>513</item>
<item>515</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.18</m_delay>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>240</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>240</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>516</item>
<item>517</item>
<item>518</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_204_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>519</item>
<item>521</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.30</m_delay>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>243</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>522</item>
<item>523</item>
<item>785</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>524</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp_EOP_V_7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.EOP.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>526</item>
<item>527</item>
<item>528</item>
<item>529</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>244</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>244</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>530</item>
<item>531</item>
<item>532</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>tmp_11</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>245</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>245</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.11</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>66</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>533</item>
<item>534</item>
<item>535</item>
<item>536</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>245</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>245</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>537</item>
<item>538</item>
<item>539</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>245</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>245</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>540</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>246</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>246</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>541</item>
<item>542</item>
<item>543</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>247</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>247</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>544</item>
<item>545</item>
<item>788</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>247</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>247</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>546</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>248</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>248</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>547</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_441</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>422</item>
<item>423</item>
<item>424</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>212</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>425</item>
<item>426</item>
<item>427</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>tmp_7</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp.7</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>256</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>428</item>
<item>429</item>
<item>792</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>metadataWrWord_keyVa_1</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>214</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>metadataWrWord.keyValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>430</item>
<item>431</item>
<item>432</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>metadataWrWord_EOP_V</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>214</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>metadataWrWord.EOP.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>433</item>
<item>434</item>
<item>435</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>tmp_V_54</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>214</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>436</item>
<item>437</item>
<item>438</item>
<item>439</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>tmp_451</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>441</item>
<item>442</item>
<item>443</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>216</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>444</item>
<item>445</item>
<item>446</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>tmp_8</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>218</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>218</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.8</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>447</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>218</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>218</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>448</item>
<item>449</item>
<item>450</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>tmp_202_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>219</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>219</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>451</item>
<item>452</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>219</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>219</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>453</item>
<item>454</item>
<item>784</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>220</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>220</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>455</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>221</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>221</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>456</item>
<item>457</item>
<item>458</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>222</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>222</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>459</item>
<item>460</item>
<item>461</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>222</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>222</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>462</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>223</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>223</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>463</item>
<item>464</item>
<item>465</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>224</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>466</item>
<item>467</item>
<item>787</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>224</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>468</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>225</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>469</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>226</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>226</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>470</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>tmp</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>201</item>
<item>202</item>
<item>204</item>
</oprand_edges>
<opcode>nbreadreq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>165</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>165</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>205</item>
<item>206</item>
<item>207</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>tmp308</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tmp308</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>256</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>209</item>
<item>210</item>
<item>793</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>p_Val2_s</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>124</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>211</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>metadataWrWord_SOP_V</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>metadataWrWord.SOP.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>213</item>
<item>214</item>
<item>216</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>metadataWrWord_keyVa</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>metadataWrWord.keyValid.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
<item>220</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>setData_data_V</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>setData.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>222</item>
<item>223</item>
<item>225</item>
<item>227</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>tmp_V_55</name>
<fileName>sources/valueStore/../globals.h</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/pratik0509/xillinx/Vivado/2018.2/common/technology/autopilot/hls_stream.h</first>
<second>read</second>
</first>
<second>127</second>
</item>
<item>
<first>
<first>sources/valueStore/../globals.h</first>
<second>operator=</second>
</first>
<second>104</second>
</item>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>167</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>228</item>
<item>229</item>
<item>231</item>
<item>233</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>168</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>234</item>
<item>235</item>
<item>236</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>170</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>170</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>237</item>
<item>238</item>
<item>783</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>tmp_453</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>171</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>239</item>
<item>240</item>
<item>242</item>
</oprand_edges>
<opcode>bitselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>171</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>243</item>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>p_Result_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>171</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>247</item>
<item>248</item>
<item>250</item>
<item>252</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>tmp_455</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>171</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>253</item>
<item>255</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>tmp_456</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>171</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>256</item>
<item>258</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>tmp_457</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>171</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>259</item>
<item>260</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.48</m_delay>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>171</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>171</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>261</item>
<item>262</item>
<item>263</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>tmp_205_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>179</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>300</item>
<item>302</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>179</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>303</item>
<item>304</item>
<item>305</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>tmp_206_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>189</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>189</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>349</item>
<item>351</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>189</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>189</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>352</item>
<item>353</item>
<item>354</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>tmp_64_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>192</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>192</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>355</item>
<item>356</item>
<item>357</item>
<item>358</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>122</id>
<name>tmp_4</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>192</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>192</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.4</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>359</item>
<item>360</item>
<item>361</item>
<item>362</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>192</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>192</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>363</item>
<item>364</item>
<item>365</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>setMd_address_V</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>193</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>193</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>setMd.address.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>366</item>
<item>367</item>
<item>368</item>
<item>369</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name>setMd_length_V</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>193</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>193</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>setMd.length.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>370</item>
<item>371</item>
<item>372</item>
<item>373</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>tmp_5</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>194</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>194</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.5</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>45</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>374</item>
<item>375</item>
<item>376</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>194</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>194</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>377</item>
<item>378</item>
<item>379</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>128</id>
<name>p_Result_55_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>196</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>196</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>381</item>
<item>382</item>
<item>383</item>
<item>385</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>tmp_EOP_V_8</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.EOP.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>386</item>
<item>388</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.02</m_delay>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>tmp_209_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>200</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>200</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>389</item>
<item>391</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>1.33</m_delay>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name>storemerge_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>392</item>
<item>393</item>
<item>394</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.60</m_delay>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>132</id>
<name>storemerge_cast_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>395</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>196</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>196</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>396</item>
<item>397</item>
<item>790</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.85</m_delay>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>134</id>
<name>tmp_6</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>201</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>201</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.6</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>66</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>399</item>
<item>400</item>
<item>401</item>
<item>402</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>201</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>201</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>404</item>
<item>405</item>
<item>406</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>202</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>202</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>407</item>
<item>408</item>
<item>409</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>203</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>410</item>
<item>411</item>
<item>412</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>139</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>203</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>413</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>204</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>791</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>205</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>205</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>416</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>417</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>146</id>
<name>tmp_63_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>182</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>182</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>306</item>
<item>307</item>
<item>308</item>
<item>309</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name>tmp_2</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>182</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>182</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.2</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>310</item>
<item>311</item>
<item>312</item>
<item>313</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>148</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>182</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>182</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>314</item>
<item>315</item>
<item>316</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name>getMd_address_V</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>183</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>183</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>getMd.address.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>318</item>
<item>319</item>
<item>321</item>
<item>323</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>150</id>
<name>getMd_length_V</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>183</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>183</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>getMd.length.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>325</item>
<item>326</item>
<item>328</item>
<item>330</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>151</id>
<name>tmp_3</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.3</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>45</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>332</item>
<item>333</item>
<item>334</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>152</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>184</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>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>153</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>185</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>185</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>339</item>
<item>340</item>
<item>341</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_112">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>186</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>342</item>
<item>343</item>
<item>344</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>156</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>186</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>345</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>158</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>187</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>187</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>346</item>
<item>347</item>
<item>789</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_115">
<Value>
<Obj>
<type>0</type>
<id>159</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>188</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>188</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>348</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_116">
<Value>
<Obj>
<type>0</type>
<id>161</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>418</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_117">
<Value>
<Obj>
<type>0</type>
<id>163</id>
<name>tmp_62_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>174</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>265</item>
<item>266</item>
<item>267</item>
<item>269</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_118">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name>tmp_1</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>174</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.1</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>271</item>
<item>272</item>
<item>274</item>
<item>275</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_119">
<Value>
<Obj>
<type>0</type>
<id>165</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>174</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>277</item>
<item>278</item>
<item>279</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_120">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>175</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>175</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>280</item>
<item>281</item>
<item>282</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_121">
<Value>
<Obj>
<type>0</type>
<id>168</id>
<name>p_Result_53_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>175</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>175</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>283</item>
<item>284</item>
<item>285</item>
<item>286</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_122">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name>tmp_207_i</name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>175</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>175</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>287</item>
<item>288</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.86</m_delay>
</item>
<item class_id_reference="9" object_id="_123">
<Value>
<Obj>
<type>0</type>
<id>170</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>175</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>175</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>289</item>
<item>290</item>
<item>291</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_124">
<Value>
<Obj>
<type>0</type>
<id>172</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>176</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>176</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>293</item>
<item>294</item>
<item>295</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>2.39</m_delay>
</item>
<item class_id_reference="9" object_id="_125">
<Value>
<Obj>
<type>0</type>
<id>173</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>176</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>176</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>296</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_126">
<Value>
<Obj>
<type>0</type>
<id>175</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>177</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>297</item>
<item>298</item>
<item>786</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.92</m_delay>
</item>
<item class_id_reference="9" object_id="_127">
<Value>
<Obj>
<type>0</type>
<id>176</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>178</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>178</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>299</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_128">
<Value>
<Obj>
<type>0</type>
<id>178</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>206</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>419</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_129">
<Value>
<Obj>
<type>0</type>
<id>180</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>207</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>207</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>420</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_130">
<Value>
<Obj>
<type>0</type>
<id>182</id>
<name></name>
<fileName>sources/valueStore/valueStore.cpp</fileName>
<fileDirectory>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</fileDirectory>
<lineNumber>208</lineNumber>
<contextFuncName>demux</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/pratik0509/Projects/HLx_Examples/Acceleration/memcached/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>sources/valueStore/valueStore.cpp</first>
<second>demux</second>
</first>
<second>208</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>421</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
<item class_id_reference="9" object_id="_131">
<Value>
<Obj>
<type>0</type>
<id>184</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_delay>0.00</m_delay>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>30</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_132">
<Value>
<Obj>
<type>2</type>
<id>191</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="_133">
<Value>
<Obj>
<type>2</type>
<id>194</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="_134">
<Value>
<Obj>
<type>2</type>
<id>197</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>
<item class_id_reference="16" object_id="_135">
<Value>
<Obj>
<type>2</type>
<id>203</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_136">
<Value>
<Obj>
<type>2</type>
<id>215</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>124</content>
</item>
<item class_id_reference="16" object_id="_137">
<Value>
<Obj>
<type>2</type>
<id>219</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>125</content>
</item>
<item class_id_reference="16" object_id="_138">
<Value>
<Obj>
<type>2</type>
<id>224</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>128</content>
</item>
<item class_id_reference="16" object_id="_139">
<Value>
<Obj>
<type>2</type>
<id>226</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>191</content>
</item>
<item class_id_reference="16" object_id="_140">
<Value>
<Obj>
<type>2</type>
<id>230</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>192</content>
</item>
<item class_id_reference="16" object_id="_141">
<Value>
<Obj>
<type>2</type>
<id>232</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>255</content>
</item>
<item class_id_reference="16" object_id="_142">
<Value>
<Obj>
<type>2</type>
<id>241</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>112</content>
</item>
<item class_id_reference="16" object_id="_143">
<Value>
<Obj>
<type>2</type>
<id>249</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>104</content>
</item>
<item class_id_reference="16" object_id="_144">
<Value>
<Obj>
<type>2</type>
<id>251</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>111</content>
</item>
<item class_id_reference="16" object_id="_145">
<Value>
<Obj>
<type>2</type>
<id>254</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_146">
<Value>
<Obj>
<type>2</type>
<id>257</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>4</content>
</item>
<item class_id_reference="16" object_id="_147">
<Value>
<Obj>
<type>2</type>
<id>268</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>127</content>
</item>
<item class_id_reference="16" object_id="_148">
<Value>
<Obj>
<type>2</type>
<id>273</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_149">
<Value>
<Obj>
<type>2</type>
<id>301</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="_150">
<Value>
<Obj>
<type>2</type>
<id>320</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>72</content>
</item>
<item class_id_reference="16" object_id="_151">
<Value>
<Obj>
<type>2</type>
<id>322</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>103</content>
</item>
<item class_id_reference="16" object_id="_152">
<Value>
<Obj>
<type>2</type>
<id>327</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_153">
<Value>
<Obj>
<type>2</type>
<id>329</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>20</content>
</item>
<item class_id_reference="16" object_id="_154">
<Value>
<Obj>
<type>2</type>
<id>350</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>1</content>
</item>
<item class_id_reference="16" object_id="_155">
<Value>
<Obj>
<type>2</type>
<id>384</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>19</content>
</item>
<item class_id_reference="16" object_id="_156">
<Value>
<Obj>
<type>2</type>
<id>387</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>12</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_157">
<Value>
<Obj>
<type>2</type>
<id>390</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>12</bitwidth>
</Value>
<const_type>0</const_type>
<content>4088</content>
</item>
<item class_id_reference="16" object_id="_158">
<Value>
<Obj>
<type>2</type>
<id>478</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>126</content>
</item>
<item class_id_reference="16" object_id="_159">
<Value>
<Obj>
<type>2</type>
<id>514</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>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>9</content>
</item>
<item class_id_reference="16" object_id="_160">
<Value>
<Obj>
<type>2</type>
<id>520</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>16</bitwidth>
</Value>
<const_type>0</const_type>
<content>65528</content>
</item>
<item class_id_reference="16" object_id="_161">
<Value>
<Obj>
<type>2</type>
<id>525</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>43</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_162">
<Obj>
<type>3</type>
<id>22</id>
<name>entry</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_163">
<Obj>
<type>3</type>
<id>31</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_164">
<Obj>
<type>3</type>
<id>37</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>5</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_165">
<Obj>
<type>3</type>
<id>39</id>
<name>._crit_edge19.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_166">
<Obj>
<type>3</type>
<id>42</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_167">
<Obj>
<type>3</type>
<id>45</id>
<name>._crit_edge20.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_168">
<Obj>
<type>3</type>
<id>49</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>3</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_169">
<Obj>
<type>3</type>
<id>52</id>
<name>._crit_edge21.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_170">
<Obj>
<type>3</type>
<id>56</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>3</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>55</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_171">
<Obj>
<type>3</type>
<id>58</id>
<name>._crit_edge22.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_172">
<Obj>
<type>3</type>
<id>61</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_173">
<Obj>
<type>3</type>
<id>63</id>
<name>._crit_edge23.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_174">
<Obj>
<type>3</type>
<id>66</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_175">
<Obj>
<type>3</type>
<id>73</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>6</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_176">
<Obj>
<type>3</type>
<id>79</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>5</count>
<item_version>0</item_version>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_177">
<Obj>
<type>3</type>
<id>81</id>
<name>._crit_edge16.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_178">
<Obj>
<type>3</type>
<id>84</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>82</item>
<item>83</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_179">
<Obj>
<type>3</type>
<id>86</id>
<name>._crit_edge17.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_180">
<Obj>
<type>3</type>
<id>89</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>87</item>
<item>88</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_181">
<Obj>
<type>3</type>
<id>91</id>
<name>._crit_edge18.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_182">
<Obj>
<type>3</type>
<id>93</id>
<name>._crit_edge15.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_183">
<Obj>
<type>3</type>
<id>96</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>94</item>
<item>95</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_184">
<Obj>
<type>3</type>
<id>104</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>7</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_185">
<Obj>
<type>3</type>
<id>108</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>3</count>
<item_version>0</item_version>
<item>105</item>
<item>106</item>
<item>107</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_186">
<Obj>
<type>3</type>
<id>114</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>5</count>
<item_version>0</item_version>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
<item>113</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_187">
<Obj>
<type>3</type>
<id>117</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>115</item>
<item>116</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_188">
<Obj>
<type>3</type>
<id>120</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>118</item>
<item>119</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_189">
<Obj>
<type>3</type>
<id>137</id>
<name>._crit_edge13.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>16</count>
<item_version>0</item_version>
<item>121</item>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>131</item>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
<item>136</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_190">
<Obj>
<type>3</type>
<id>140</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>138</item>
<item>139</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_191">
<Obj>
<type>3</type>
<id>143</id>
<name>._crit_edge14.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_192">
<Obj>
<type>3</type>
<id>145</id>
<name>._crit_edge12.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_193">
<Obj>
<type>3</type>
<id>154</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>146</item>
<item>147</item>
<item>148</item>
<item>149</item>
<item>150</item>
<item>151</item>
<item>152</item>
<item>153</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_194">
<Obj>
<type>3</type>
<id>157</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_195">
<Obj>
<type>3</type>
<id>160</id>
<name>._crit_edge11.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>158</item>
<item>159</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_196">
<Obj>
<type>3</type>
<id>162</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>161</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_197">
<Obj>
<type>3</type>
<id>167</id>
<name>._crit_edge6.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
<item>165</item>
<item>166</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_198">
<Obj>
<type>3</type>
<id>171</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>3</count>
<item_version>0</item_version>
<item>168</item>
<item>169</item>
<item>170</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_199">
<Obj>
<type>3</type>
<id>174</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>172</item>
<item>173</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_200">
<Obj>
<type>3</type>
<id>177</id>
<name>._crit_edge9.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_201">
<Obj>
<type>3</type>
<id>179</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>178</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_202">
<Obj>
<type>3</type>
<id>181</id>
<name>._crit_edge5.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>180</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_203">
<Obj>
<type>3</type>
<id>183</id>
<name>._crit_edge4.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>182</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_204">
<Obj>
<type>3</type>
<id>185</id>
<name>demux.exit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>184</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>340</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_205">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>190</id>
<edge_type>2</edge_type>
<source_obj>185</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>193</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>194</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>196</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>206</id>
<edge_type>2</edge_type>
<source_obj>183</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>207</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>215</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>226</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>230</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>235</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>236</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>103</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>241</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>244</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>245</id>
<edge_type>2</edge_type>
<source_obj>167</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>249</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>251</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>257</source_obj>
<sink_obj>111</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>262</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>263</id>
<edge_type>2</edge_type>
<source_obj>167</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>268</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>278</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="_262">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>165</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>281</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>282</id>
<edge_type>2</edge_type>
<source_obj>171</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>249</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>286</id>
<edge_type>1</edge_type>
<source_obj>251</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_269">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_270">
<id>288</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>290</id>
<edge_type>2</edge_type>
<source_obj>174</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>291</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_276">
<id>296</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_277">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>194</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>299</id>
<edge_type>2</edge_type>
<source_obj>179</source_obj>
<sink_obj>176</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>301</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>304</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>305</id>
<edge_type>2</edge_type>
<source_obj>154</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>307</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>268</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>311</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="_289">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>313</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>148</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_293">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>320</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>323</id>
<edge_type>1</edge_type>
<source_obj>322</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>327</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>329</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>150</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>152</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>160</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>341</id>
<edge_type>2</edge_type>
<source_obj>157</source_obj>
<sink_obj>153</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>344</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>345</id>
<edge_type>2</edge_type>
<source_obj>160</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>346</id>
<edge_type>1</edge_type>
<source_obj>194</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>348</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>349</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>351</id>
<edge_type>1</edge_type>
<source_obj>350</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>352</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>353</id>
<edge_type>2</edge_type>
<source_obj>145</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_316">
<id>354</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>357</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>268</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_320">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>364</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>365</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>367</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>368</id>
<edge_type>1</edge_type>
<source_obj>320</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>369</id>
<edge_type>1</edge_type>
<source_obj>322</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>371</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_329">
<id>372</id>
<edge_type>1</edge_type>
<source_obj>327</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>373</id>
<edge_type>1</edge_type>
<source_obj>329</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>375</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_332">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_333">
<id>378</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_334">
<id>379</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_335">
<id>382</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_336">
<id>383</id>
<edge_type>1</edge_type>
<source_obj>327</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_337">
<id>385</id>
<edge_type>1</edge_type>
<source_obj>384</source_obj>
<sink_obj>128</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_338">
<id>386</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_339">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>387</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_340">
<id>389</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_341">
<id>391</id>
<edge_type>1</edge_type>
<source_obj>390</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_342">
<id>392</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_343">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_344">
<id>394</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_345">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>132</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_346">
<id>396</id>
<edge_type>1</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="_347">
<id>397</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_348">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_349">
<id>401</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_350">
<id>402</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_351">
<id>405</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_352">
<id>406</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_353">
<id>407</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_354">
<id>408</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_355">
<id>409</id>
<edge_type>2</edge_type>
<source_obj>140</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_356">
<id>411</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_357">
<id>412</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_358">
<id>413</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_359">
<id>414</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_360">
<id>415</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_361">
<id>416</id>
<edge_type>2</edge_type>
<source_obj>145</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_362">
<id>417</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_363">
<id>418</id>
<edge_type>2</edge_type>
<source_obj>179</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_364">
<id>419</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_365">
<id>420</id>
<edge_type>2</edge_type>
<source_obj>183</source_obj>
<sink_obj>180</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_366">
<id>421</id>
<edge_type>2</edge_type>
<source_obj>185</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_367">
<id>423</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_368">
<id>424</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_369">
<id>425</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_370">
<id>426</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_371">
<id>427</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_372">
<id>429</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_373">
<id>431</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_374">
<id>432</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_375">
<id>434</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_376">
<id>435</id>
<edge_type>1</edge_type>
<source_obj>268</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_377">
<id>437</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_378">
<id>438</id>
<edge_type>1</edge_type>
<source_obj>230</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_379">
<id>439</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_380">
<id>442</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_381">
<id>443</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_382">
<id>444</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_383">
<id>445</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_384">
<id>446</id>
<edge_type>2</edge_type>
<source_obj>81</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_385">
<id>447</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_386">
<id>449</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_387">
<id>450</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_388">
<id>451</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_389">
<id>452</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_390">
<id>453</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_391">
<id>454</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_392">
<id>455</id>
<edge_type>2</edge_type>
<source_obj>81</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_393">
<id>456</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_394">
<id>457</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_395">
<id>458</id>
<edge_type>2</edge_type>
<source_obj>84</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_396">
<id>460</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_397">
<id>461</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_398">
<id>462</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_399">
<id>463</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_400">
<id>464</id>
<edge_type>2</edge_type>
<source_obj>91</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_401">
<id>465</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_402">
<id>466</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_403">
<id>467</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_404">
<id>468</id>
<edge_type>2</edge_type>
<source_obj>91</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_405">
<id>469</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_406">
<id>470</id>
<edge_type>2</edge_type>
<source_obj>185</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_407">
<id>472</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_408">
<id>474</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_409">
<id>475</id>
<edge_type>1</edge_type>
<source_obj>219</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_410">
<id>477</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_411">
<id>479</id>
<edge_type>1</edge_type>
<source_obj>478</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_412">
<id>481</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_413">
<id>482</id>
<edge_type>1</edge_type>
<source_obj>268</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_414">
<id>484</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_415">
<id>485</id>
<edge_type>1</edge_type>
<source_obj>224</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_416">
<id>486</id>
<edge_type>1</edge_type>
<source_obj>226</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_417">
<id>488</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_418">
<id>489</id>
<edge_type>1</edge_type>
<source_obj>230</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_419">
<id>490</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_420">
<id>492</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_421">
<id>493</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_422">
<id>494</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_423">
<id>495</id>
<edge_type>2</edge_type>
<source_obj>37</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_424">
<id>496</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_425">
<id>497</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_426">
<id>499</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_427">
<id>500</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_428">
<id>501</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_429">
<id>502</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_430">
<id>503</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_431">
<id>504</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_432">
<id>505</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_433">
<id>506</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_434">
<id>507</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_435">
<id>508</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_436">
<id>510</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_437">
<id>511</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_438">
<id>512</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_439">
<id>513</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_440">
<id>515</id>
<edge_type>1</edge_type>
<source_obj>514</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_441">
<id>516</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_442">
<id>517</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_443">
<id>518</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_444">
<id>519</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_445">
<id>521</id>
<edge_type>1</edge_type>
<source_obj>520</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_446">
<id>522</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_447">
<id>523</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_448">
<id>524</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_449">
<id>526</id>
<edge_type>1</edge_type>
<source_obj>525</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_450">
<id>527</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_451">
<id>528</id>
<edge_type>1</edge_type>
<source_obj>273</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_452">
<id>529</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_453">
<id>530</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_454">
<id>531</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_455">
<id>532</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_456">
<id>534</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_457">
<id>535</id>
<edge_type>1</edge_type>
<source_obj>525</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_458">
<id>536</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_459">
<id>538</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_460">
<id>539</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_461">
<id>540</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_462">
<id>541</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_463">
<id>542</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_464">
<id>543</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_465">
<id>544</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_466">
<id>545</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_467">
<id>546</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_468">
<id>547</id>
<edge_type>2</edge_type>
<source_obj>185</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_469">
<id>717</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_470">
<id>718</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_471">
<id>719</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_472">
<id>720</id>
<edge_type>2</edge_type>
<source_obj>22</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_473">
<id>721</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_474">
<id>722</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_475">
<id>723</id>
<edge_type>2</edge_type>
<source_obj>37</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_476">
<id>724</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_477">
<id>725</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_478">
<id>726</id>
<edge_type>2</edge_type>
<source_obj>42</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_479">
<id>727</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_480">
<id>728</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_481">
<id>729</id>
<edge_type>2</edge_type>
<source_obj>49</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_482">
<id>730</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_483">
<id>731</id>
<edge_type>2</edge_type>
<source_obj>52</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_484">
<id>732</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_485">
<id>733</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_486">
<id>734</id>
<edge_type>2</edge_type>
<source_obj>58</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_487">
<id>735</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>63</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_488">
<id>736</id>
<edge_type>2</edge_type>
<source_obj>63</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_489">
<id>737</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_490">
<id>738</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_491">
<id>739</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_492">
<id>740</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_493">
<id>741</id>
<edge_type>2</edge_type>
<source_obj>79</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_494">
<id>742</id>
<edge_type>2</edge_type>
<source_obj>81</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_495">
<id>743</id>
<edge_type>2</edge_type>
<source_obj>81</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_496">
<id>744</id>
<edge_type>2</edge_type>
<source_obj>84</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_497">
<id>745</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_498">
<id>746</id>
<edge_type>2</edge_type>
<source_obj>86</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_499">
<id>747</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_500">
<id>748</id>
<edge_type>2</edge_type>
<source_obj>91</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_501">
<id>749</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_502">
<id>750</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_503">
<id>751</id>
<edge_type>2</edge_type>
<source_obj>96</source_obj>
<sink_obj>183</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_504">
<id>752</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_505">
<id>753</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_506">
<id>754</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_507">
<id>755</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_508">
<id>756</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>167</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_509">
<id>757</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_510">
<id>758</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_511">
<id>759</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_512">
<id>760</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_513">
<id>761</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_514">
<id>762</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_515">
<id>763</id>
<edge_type>2</edge_type>
<source_obj>137</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_516">
<id>764</id>
<edge_type>2</edge_type>
<source_obj>140</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_517">
<id>765</id>
<edge_type>2</edge_type>
<source_obj>143</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_518">
<id>766</id>
<edge_type>2</edge_type>
<source_obj>145</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_519">
<id>767</id>
<edge_type>2</edge_type>
<source_obj>154</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_520">
<id>768</id>
<edge_type>2</edge_type>
<source_obj>154</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_521">
<id>769</id>
<edge_type>2</edge_type>
<source_obj>157</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_522">
<id>770</id>
<edge_type>2</edge_type>
<source_obj>160</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_523">
<id>771</id>
<edge_type>2</edge_type>
<source_obj>162</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_524">
<id>772</id>
<edge_type>2</edge_type>
<source_obj>167</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_525">
<id>773</id>
<edge_type>2</edge_type>
<source_obj>167</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_526">
<id>774</id>
<edge_type>2</edge_type>
<source_obj>171</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_527">
<id>775</id>
<edge_type>2</edge_type>
<source_obj>171</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_528">
<id>776</id>
<edge_type>2</edge_type>
<source_obj>174</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_529">
<id>777</id>
<edge_type>2</edge_type>
<source_obj>177</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_530">
<id>778</id>
<edge_type>2</edge_type>
<source_obj>179</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_531">
<id>779</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>183</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_532">
<id>780</id>
<edge_type>2</edge_type>
<source_obj>183</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_533">
<id>782</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_534">
<id>783</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_535">
<id>784</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_536">
<id>785</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_537">
<id>786</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_538">
<id>787</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_539">
<id>788</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_540">
<id>789</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_541">
<id>790</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>133</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_542">
<id>791</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_543">
<id>792</id>
<edge_type>4</edge_type>
<source_obj>64</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_544">
<id>793</id>
<edge_type>4</edge_type>
<source_obj>94</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_545">
<mId>1</mId>
<mTag>demux</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>43</count>
<item_version>0</item_version>
<item>22</item>
<item>31</item>
<item>37</item>
<item>39</item>
<item>42</item>
<item>45</item>
<item>49</item>
<item>52</item>
<item>56</item>
<item>58</item>
<item>61</item>
<item>63</item>
<item>66</item>
<item>73</item>
<item>79</item>
<item>81</item>
<item>84</item>
<item>86</item>
<item>89</item>
<item>91</item>
<item>93</item>
<item>96</item>
<item>104</item>
<item>108</item>
<item>114</item>
<item>117</item>
<item>120</item>
<item>137</item>
<item>140</item>
<item>143</item>
<item>145</item>
<item>154</item>
<item>157</item>
<item>160</item>
<item>162</item>
<item>167</item>
<item>171</item>
<item>174</item>
<item>177</item>
<item>179</item>
<item>181</item>
<item>183</item>
<item>185</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1</mMinLatency>
<mMaxLatency>1</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>125</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>18</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>139</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>142</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>0</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>148</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>152</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>153</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>159</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>165</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>170</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>172</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>173</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>175</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>176</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>178</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>180</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>182</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>184</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>43</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>22</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>154</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>167</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>171</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>174</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>177</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>179</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>181</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>183</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>185</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_546">
<region_name>demux</region_name>
<basic_blocks>
<count>43</count>
<item_version>0</item_version>
<item>22</item>
<item>31</item>
<item>37</item>
<item>39</item>
<item>42</item>
<item>45</item>
<item>49</item>
<item>52</item>
<item>56</item>
<item>58</item>
<item>61</item>
<item>63</item>
<item>66</item>
<item>73</item>
<item>79</item>
<item>81</item>
<item>84</item>
<item>86</item>
<item>89</item>
<item>91</item>
<item>93</item>
<item>96</item>
<item>104</item>
<item>108</item>
<item>114</item>
<item>117</item>
<item>120</item>
<item>137</item>
<item>140</item>
<item>143</item>
<item>145</item>
<item>154</item>
<item>157</item>
<item>160</item>
<item>162</item>
<item>167</item>
<item>171</item>
<item>174</item>
<item>177</item>
<item>179</item>
<item>181</item>
<item>183</item>
<item>185</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
-- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- The primary authors of ayacc were David Taback and Deepak Tolani.
-- Enhancements were made by Ronald J. Schmalz.
--
-- Send requests for ayacc information to ayacc-info@ics.uci.edu
-- Send bug reports for ayacc to ayacc-bugs@ics.uci.edu
--
-- 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.
-- Module : lr0_machine.ada
-- Component of : ayacc
-- Version : 1.2
-- Date : 11/21/86 12:30:58
-- SCCS File : disk21~/rschm/hasee/sccs/ayacc/sccs/sxlr0_machine.ada
-- $Header: /dc/uc/self/tmp/gnat_ayacc_new/lr0bad/RCS/lr0_machine.ads,v 1.1 1995/02/16 17:28:09 self Exp self $
-- $Log: lr0_machine.ads,v $
-- Revision 0.1 86/04/01 15:06:19 ada
-- This version fixes some minor bugs with empty grammars
-- and $$ expansion. It also uses vads5.1b enhancements
-- such as pragma inline.
--
--
-- Revision 0.0 86/02/19 18:37:14 ada
--
-- These files comprise the initial version of Ayacc
-- designed and implemented by David Taback and Deepak Tolani.
-- Ayacc has been compiled and tested under the Verdix Ada compiler
-- version 4.06 on a vax 11/750 running Unix 4.2BSD.
--
with Rule_Table, Symbol_Table, Set_Pack;
use Rule_Table, Symbol_Table;
package LR0_Machine is
type Parse_State is range -1..5_000;
Null_Parse_State : constant Parse_State := -1;
type Item is
record
Rule_ID : Rule;
Dot_Position : Natural;
end record;
type Transition is
record
Symbol : Grammar_Symbol;
State_ID : Parse_State;
end record;
function "<" (Item_1, Item_2 : Item) return Boolean;
function "<" (Trans_1, Trans_2 : Transition) return Boolean;
package Parse_State_Set_Pack is new Set_Pack(Parse_State, "<");
package Item_Set_Pack is new Set_Pack(Item, "<");
package Transition_Set_Pack is new Set_Pack(Transition, "<");
package Grammar_Symbol_Set_Pack is new Set_Pack(Grammar_Symbol, "<");
subtype Parse_State_Set is Parse_State_Set_Pack.Set;
subtype Item_Set is Item_Set_Pack.Set;
subtype Transition_Set is Transition_Set_Pack.Set;
subtype Grammar_Symbol_Set is Grammar_Symbol_Set_Pack.Set;
subtype Parse_State_Iterator is Parse_State_Set_Pack.Set_Iterator;
subtype Item_Iterator is Item_Set_Pack.Set_Iterator;
subtype Transition_Iterator is Transition_Set_Pack.Set_Iterator;
subtype Grammar_Symbol_Iterator is Grammar_Symbol_Set_Pack.Set_Iterator;
procedure LR0_Initialize; -- must be called first.
function First_Parse_State return Parse_State;
function Last_Parse_State return Parse_State;
function Get_Goto
(State_ID : Parse_State;
Sym : Grammar_Symbol) return Parse_State;
-- Returns the predecessor states of STATE_ID and the item I.
-- Must be called with PRED_SET empty!
procedure Get_Pred_Set
(State_ID : in Parse_State;
I : in Item;
Pred_Set : in out Parse_State_Set);
type Transition_Type is (Terminals, Nonterminals, Grammar_Symbols);
procedure Get_Transitions
(State_ID : in Parse_State;
Kind : in Transition_Type;
Set_1 : in out Transition_Set);
procedure Get_Transition_Symbols
(State_ID : in Parse_State;
Kind : in Transition_Type;
Set_1 : in out Grammar_Symbol_Set);
procedure Get_Kernel
(State_ID : in Parse_State;
Set_1 : in out Item_Set);
procedure Closure (Set_1 : in out Item_Set);
--
-- The following routines allow the user to iterate over the
-- items in the kernel of a particular state.
--
type Kernel_Iterator is limited private;
procedure Initialize
(Iterator : in out Kernel_Iterator;
State_ID : in Parse_State);
function More(Iterator : Kernel_Iterator) return Boolean;
procedure Next(Iterator : in out Kernel_Iterator; I : out Item);
--
-- The following routines allow the user to iterate over the
-- nonterminal transitions of a particular state
--
type Nt_Transition_Iterator is limited private;
procedure Initialize
(Iterator : in out Nt_Transition_Iterator;
State_ID : in Parse_State);
function More (Iterator : Nt_Transition_Iterator) return Boolean;
procedure Next
(Iterator : in out Nt_Transition_Iterator;
Trans : out Transition);
-- The following routines allow iteration over the Terminal transitions
-- of a particular state.
type T_Transition_Iterator is limited private; -- For Terminals
procedure Initialize
(Iterator : in out T_Transition_Iterator;
State_ID : in Parse_State);
function More (Iterator : T_Transition_Iterator) return Boolean;
procedure Next
(Iterator : in out T_Transition_Iterator;
Trans : out Transition);
To_Many_States : exception;
No_More_Iterations : exception;
State_Out_of_Bounds : exception;
--RJS pragma inline(more); --DEC Ada Bug: , next);
private
type Item_Array_Index is range 0..5_000; -- An arbitrarily big number
----- type Item_Array;
type Item_Array is array (Item_Array_Index range <>) of Item;
type Item_Array_Pointer is access Item_Array;
type Kernel_Iterator is
record
Kernel : Item_Array_Pointer;
Curser : Item_Array_Index;
end record;
----- type Transition_Array;
-- The type declarations for storing the nonterminal transitions of
-- the DFA in the states.
type Transition_Array is
array(Integer range <>) of Transition;
type Transition_Array_Pointer is access Transition_Array;
type Nt_Transition_Iterator is
record
Nonterm_Trans : Transition_Array_Pointer;
Curser : Integer; -- Use a derived type instead ???
end record;
type T_Transition_Iterator is
record
Term_Trans : Transition_Array_Pointer;
Curser : Integer;
end record;
end LR0_Machine;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ M A P S --
-- --
-- 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. --
-- --
-- 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 Ada.Strings.Wide_Maps is
---------
-- "-" --
---------
function "-"
(Left, Right : Wide_Character_Set) return Wide_Character_Set
is
LS : constant Wide_Character_Ranges_Access := Left.Set;
RS : constant Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Character_Ranges (1 .. LS'Last + RS'Last);
-- Each range on the right can generate at least one more range in
-- the result, by splitting one of the left operand ranges.
N : Natural := 0;
R : Natural := 1;
L : Natural := 1;
Left_Low : Wide_Character;
-- Left_Low is lowest character of the L'th range not yet dealt with
begin
if LS'Last = 0 or else RS'Last = 0 then
return Left;
end if;
Left_Low := LS (L).Low;
while R <= RS'Last loop
-- If next right range is below current left range, skip it
if RS (R).High < Left_Low then
R := R + 1;
-- If next right range above current left range, copy remainder
-- of the left range to the result
elsif RS (R).Low > LS (L).High then
N := N + 1;
Result (N).Low := Left_Low;
Result (N).High := LS (L).High;
L := L + 1;
exit when L > LS'Last;
Left_Low := LS (L).Low;
else
-- Next right range overlaps bottom of left range
if RS (R).Low <= Left_Low then
-- Case of right range complete overlaps left range
if RS (R).High >= LS (L).High then
L := L + 1;
exit when L > LS'Last;
Left_Low := LS (L).Low;
-- Case of right range eats lower part of left range
else
Left_Low := Wide_Character'Succ (RS (R).High);
R := R + 1;
end if;
-- Next right range overlaps some of left range, but not bottom
else
N := N + 1;
Result (N).Low := Left_Low;
Result (N).High := Wide_Character'Pred (RS (R).Low);
-- Case of right range splits left range
if RS (R).High < LS (L).High then
Left_Low := Wide_Character'Succ (RS (R).High);
R := R + 1;
-- Case of right range overlaps top of left range
else
L := L + 1;
exit when L > LS'Last;
Left_Low := LS (L).Low;
end if;
end if;
end if;
end loop;
-- Copy remainder of left ranges to result
if L <= LS'Last then
N := N + 1;
Result (N).Low := Left_Low;
Result (N).High := LS (L).High;
loop
L := L + 1;
exit when L > LS'Last;
N := N + 1;
Result (N) := LS (L);
end loop;
end if;
return (AF.Controlled with
Set => new Wide_Character_Ranges'(Result (1 .. N)));
end "-";
---------
-- "=" --
---------
-- The sorted, discontiguous form is canonical, so equality can be used
function "=" (Left, Right : Wide_Character_Set) return Boolean is
begin
return Left.Set.all = Right.Set.all;
end "=";
-----------
-- "and" --
-----------
function "and"
(Left, Right : Wide_Character_Set) return Wide_Character_Set
is
LS : constant Wide_Character_Ranges_Access := Left.Set;
RS : constant Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Character_Ranges (1 .. LS'Last + RS'Last);
N : Natural := 0;
L, R : Natural := 1;
begin
-- Loop to search for overlapping character ranges
while L <= LS'Last and then R <= RS'Last loop
if LS (L).High < RS (R).Low then
L := L + 1;
elsif RS (R).High < LS (L).Low then
R := R + 1;
-- Here we have LS (L).High >= RS (R).Low
-- and RS (R).High >= LS (L).Low
-- so we have an overlapping range
else
N := N + 1;
Result (N).Low := Wide_Character'Max (LS (L).Low, RS (R).Low);
Result (N).High :=
Wide_Character'Min (LS (L).High, RS (R).High);
if RS (R).High = LS (L).High then
L := L + 1;
R := R + 1;
elsif RS (R).High < LS (L).High then
R := R + 1;
else
L := L + 1;
end if;
end if;
end loop;
return (AF.Controlled with
Set => new Wide_Character_Ranges'(Result (1 .. N)));
end "and";
-----------
-- "not" --
-----------
function "not"
(Right : Wide_Character_Set) return Wide_Character_Set
is
RS : constant Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Character_Ranges (1 .. RS'Last + 1);
N : Natural := 0;
begin
if RS'Last = 0 then
N := 1;
Result (1) := (Low => Wide_Character'First,
High => Wide_Character'Last);
else
if RS (1).Low /= Wide_Character'First then
N := N + 1;
Result (N).Low := Wide_Character'First;
Result (N).High := Wide_Character'Pred (RS (1).Low);
end if;
for K in 1 .. RS'Last - 1 loop
N := N + 1;
Result (N).Low := Wide_Character'Succ (RS (K).High);
Result (N).High := Wide_Character'Pred (RS (K + 1).Low);
end loop;
if RS (RS'Last).High /= Wide_Character'Last then
N := N + 1;
Result (N).Low := Wide_Character'Succ (RS (RS'Last).High);
Result (N).High := Wide_Character'Last;
end if;
end if;
return (AF.Controlled with
Set => new Wide_Character_Ranges'(Result (1 .. N)));
end "not";
----------
-- "or" --
----------
function "or"
(Left, Right : Wide_Character_Set) return Wide_Character_Set
is
LS : constant Wide_Character_Ranges_Access := Left.Set;
RS : constant Wide_Character_Ranges_Access := Right.Set;
Result : Wide_Character_Ranges (1 .. LS'Last + RS'Last);
N : Natural;
L, R : Natural;
begin
N := 0;
L := 1;
R := 1;
-- Loop through ranges in output file
loop
-- If no left ranges left, copy next right range
if L > LS'Last then
exit when R > RS'Last;
N := N + 1;
Result (N) := RS (R);
R := R + 1;
-- If no right ranges left, copy next left range
elsif R > RS'Last then
N := N + 1;
Result (N) := LS (L);
L := L + 1;
else
-- We have two ranges, choose lower one
N := N + 1;
if LS (L).Low <= RS (R).Low then
Result (N) := LS (L);
L := L + 1;
else
Result (N) := RS (R);
R := R + 1;
end if;
-- Loop to collapse ranges into last range
loop
-- Collapse next length range into current result range
-- if possible.
if L <= LS'Last
and then LS (L).Low <= Wide_Character'Succ (Result (N).High)
then
Result (N).High :=
Wide_Character'Max (Result (N).High, LS (L).High);
L := L + 1;
-- Collapse next right range into current result range
-- if possible
elsif R <= RS'Last
and then RS (R).Low <=
Wide_Character'Succ (Result (N).High)
then
Result (N).High :=
Wide_Character'Max (Result (N).High, RS (R).High);
R := R + 1;
-- If neither range collapses, then done with this range
else
exit;
end if;
end loop;
end if;
end loop;
return (AF.Controlled with
Set => new Wide_Character_Ranges'(Result (1 .. N)));
end "or";
-----------
-- "xor" --
-----------
function "xor"
(Left, Right : Wide_Character_Set) return Wide_Character_Set
is
begin
return (Left or Right) - (Left and Right);
end "xor";
------------
-- Adjust --
------------
procedure Adjust (Object : in out Wide_Character_Mapping) is
begin
Object.Map := new Wide_Character_Mapping_Values'(Object.Map.all);
end Adjust;
procedure Adjust (Object : in out Wide_Character_Set) is
begin
Object.Set := new Wide_Character_Ranges'(Object.Set.all);
end Adjust;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Wide_Character_Mapping) is
procedure Free is new Ada.Unchecked_Deallocation
(Wide_Character_Mapping_Values,
Wide_Character_Mapping_Values_Access);
begin
if Object.Map /= Null_Map'Unrestricted_Access then
Free (Object.Map);
end if;
end Finalize;
procedure Finalize (Object : in out Wide_Character_Set) is
procedure Free is new Ada.Unchecked_Deallocation
(Wide_Character_Ranges,
Wide_Character_Ranges_Access);
begin
if Object.Set /= Null_Range'Unrestricted_Access then
Free (Object.Set);
end if;
end Finalize;
----------------
-- Initialize --
----------------
procedure Initialize (Object : in out Wide_Character_Mapping) is
begin
Object := Identity;
end Initialize;
procedure Initialize (Object : in out Wide_Character_Set) is
begin
Object := Null_Set;
end Initialize;
-----------
-- Is_In --
-----------
function Is_In
(Element : Wide_Character;
Set : Wide_Character_Set) return Boolean
is
L, R, M : Natural;
SS : constant Wide_Character_Ranges_Access := Set.Set;
begin
L := 1;
R := SS'Last;
-- Binary search loop. The invariant is that if Element is in any of
-- of the constituent ranges it is in one between Set (L) and Set (R).
loop
if L > R then
return False;
else
M := (L + R) / 2;
if Element > SS (M).High then
L := M + 1;
elsif Element < SS (M).Low then
R := M - 1;
else
return True;
end if;
end if;
end loop;
end Is_In;
---------------
-- Is_Subset --
---------------
function Is_Subset
(Elements : Wide_Character_Set;
Set : Wide_Character_Set) return Boolean
is
ES : constant Wide_Character_Ranges_Access := Elements.Set;
SS : constant Wide_Character_Ranges_Access := Set.Set;
S : Positive := 1;
E : Positive := 1;
begin
loop
-- If no more element ranges, done, and result is true
if E > ES'Last then
return True;
-- If more element ranges, but no more set ranges, result is false
elsif S > SS'Last then
return False;
-- Remove irrelevant set range
elsif SS (S).High < ES (E).Low then
S := S + 1;
-- Get rid of element range that is properly covered by set
elsif SS (S).Low <= ES (E).Low
and then ES (E).High <= SS (S).High
then
E := E + 1;
-- Otherwise we have a non-covered element range, result is false
else
return False;
end if;
end loop;
end Is_Subset;
---------------
-- To_Domain --
---------------
function To_Domain
(Map : Wide_Character_Mapping) return Wide_Character_Sequence
is
begin
return Map.Map.Domain;
end To_Domain;
----------------
-- To_Mapping --
----------------
function To_Mapping
(From, To : Wide_Character_Sequence) return Wide_Character_Mapping
is
Domain : Wide_Character_Sequence (1 .. From'Length);
Rangev : Wide_Character_Sequence (1 .. To'Length);
N : Natural := 0;
begin
if From'Length /= To'Length then
raise Translation_Error;
else
pragma Warnings (Off); -- apparent uninit use of Domain
for J in From'Range loop
for M in 1 .. N loop
if From (J) = Domain (M) then
raise Translation_Error;
elsif From (J) < Domain (M) then
Domain (M + 1 .. N + 1) := Domain (M .. N);
Rangev (M + 1 .. N + 1) := Rangev (M .. N);
Domain (M) := From (J);
Rangev (M) := To (J);
goto Continue;
end if;
end loop;
Domain (N + 1) := From (J);
Rangev (N + 1) := To (J);
<<Continue>>
N := N + 1;
end loop;
pragma Warnings (On);
return (AF.Controlled with
Map => new Wide_Character_Mapping_Values'(
Length => N,
Domain => Domain (1 .. N),
Rangev => Rangev (1 .. N)));
end if;
end To_Mapping;
--------------
-- To_Range --
--------------
function To_Range
(Map : Wide_Character_Mapping) return Wide_Character_Sequence
is
begin
return Map.Map.Rangev;
end To_Range;
---------------
-- To_Ranges --
---------------
function To_Ranges
(Set : Wide_Character_Set) return Wide_Character_Ranges
is
begin
return Set.Set.all;
end To_Ranges;
-----------------
-- To_Sequence --
-----------------
function To_Sequence
(Set : Wide_Character_Set) return Wide_Character_Sequence
is
SS : constant Wide_Character_Ranges_Access := Set.Set;
N : Natural := 0;
Count : Natural := 0;
begin
for J in SS'Range loop
Count :=
Count + (Wide_Character'Pos (SS (J).High) -
Wide_Character'Pos (SS (J).Low) + 1);
end loop;
return Result : Wide_String (1 .. Count) do
for J in SS'Range loop
for K in SS (J).Low .. SS (J).High loop
N := N + 1;
Result (N) := K;
end loop;
end loop;
end return;
end To_Sequence;
------------
-- To_Set --
------------
-- Case of multiple range input
function To_Set
(Ranges : Wide_Character_Ranges) return Wide_Character_Set
is
Result : Wide_Character_Ranges (Ranges'Range);
N : Natural := 0;
J : Natural;
begin
-- The output of To_Set is required to be sorted by increasing Low
-- values, and discontiguous, so first we sort them as we enter them,
-- using a simple insertion sort.
pragma Warnings (Off);
-- Kill bogus warning on Result being uninitialized
for J in Ranges'Range loop
for K in 1 .. N loop
if Ranges (J).Low < Result (K).Low then
Result (K + 1 .. N + 1) := Result (K .. N);
Result (K) := Ranges (J);
goto Continue;
end if;
end loop;
Result (N + 1) := Ranges (J);
<<Continue>>
N := N + 1;
end loop;
pragma Warnings (On);
-- Now collapse any contiguous or overlapping ranges
J := 1;
while J < N loop
if Result (J).High < Result (J).Low then
N := N - 1;
Result (J .. N) := Result (J + 1 .. N + 1);
elsif Wide_Character'Succ (Result (J).High) >= Result (J + 1).Low then
Result (J).High :=
Wide_Character'Max (Result (J).High, Result (J + 1).High);
N := N - 1;
Result (J + 1 .. N) := Result (J + 2 .. N + 1);
else
J := J + 1;
end if;
end loop;
if N > 0 and then Result (N).High < Result (N).Low then
N := N - 1;
end if;
return (AF.Controlled with
Set => new Wide_Character_Ranges'(Result (1 .. N)));
end To_Set;
-- Case of single range input
function To_Set
(Span : Wide_Character_Range) return Wide_Character_Set
is
begin
if Span.Low > Span.High then
return Null_Set;
-- This is safe, because there is no procedure with parameter
-- Wide_Character_Set of mode "out" or "in out".
else
return (AF.Controlled with
Set => new Wide_Character_Ranges'(1 => Span));
end if;
end To_Set;
-- Case of wide string input
function To_Set
(Sequence : Wide_Character_Sequence) return Wide_Character_Set
is
R : Wide_Character_Ranges (1 .. Sequence'Length);
begin
for J in R'Range loop
R (J) := (Sequence (J), Sequence (J));
end loop;
return To_Set (R);
end To_Set;
-- Case of single wide character input
function To_Set
(Singleton : Wide_Character) return Wide_Character_Set
is
begin
return
(AF.Controlled with
Set => new Wide_Character_Ranges'(1 => (Singleton, Singleton)));
end To_Set;
-----------
-- Value --
-----------
function Value
(Map : Wide_Character_Mapping;
Element : Wide_Character) return Wide_Character
is
L, R, M : Natural;
MV : constant Wide_Character_Mapping_Values_Access := Map.Map;
begin
L := 1;
R := MV.Domain'Last;
-- Binary search loop
loop
-- If not found, identity
if L > R then
return Element;
-- Otherwise do binary divide
else
M := (L + R) / 2;
if Element < MV.Domain (M) then
R := M - 1;
elsif Element > MV.Domain (M) then
L := M + 1;
else -- Element = MV.Domain (M) then
return MV.Rangev (M);
end if;
end if;
end loop;
end Value;
end Ada.Strings.Wide_Maps;
|
with Ada.Text_IO,Ada.Numerics.Discrete_Random,Ada.Calendar;
use Ada.Text_IO;
procedure Market is
subtype Index is Positive range 1..10;
package randomPos is new Ada.Numerics.Discrete_Random(Index);
infected_count : Natural := 0;
type Position is record
x: Natural;
y: Natural;
end record;
type Direction is (left,right,up,down);
package randomDir is new Ada.Numerics.Discrete_Random(Direction);
protected Generator is
procedure Init;
function GetRandPos return Position;
function GetRandDir return Direction;
private
k:randomPos.Generator;
l:randomDir.Generator;
end Generator;
protected body Generator is
procedure Init is
begin
randomPos.Reset(k);
randomDir.Reset(l);
end Init;
function GetRandPos return Position is
x:Index;
y:Index;
begin
x:=randomPos.Random(k);
y:=randomPos.Random(k);
return (x,y);
end GetRandPos;
function GetRandDir return Direction is
begin
return randomDir.Random(l);
end GetRandDir;
end Generator;
protected Monitor is
procedure Print(s:String);
end Monitor;
protected body Monitor is
procedure Print(s:String) is
begin
Put_Line(s);
end Print;
end Monitor;
type Barr is array (Natural range <>,Natural range <>) of Boolean;
protected Area is
procedure Init;
function inArea(pos:Position) return Boolean;
procedure infectCell(pos:Position);
function isInfected(pos:Position) return Boolean;
function getInfectedPerc return Natural;
private
a : Barr(1..10,1..10);
end Area;
protected body Area is
procedure Init is
begin
for i in 1..10 loop
for j in 1..10 loop
a(i,j):=False; --no covid at first
end loop;
end loop;
end Init;
procedure infectCell(pos:Position) is
begin
a(pos.x,pos.y):=True;
end infectCell;
function isInfected(pos:Position) return Boolean is
begin
return a(pos.x,pos.y);
end isInfected;
function inArea(pos:Position) return Boolean is
begin
if (pos.x>=1 and then pos.x<=10 and then
pos.y>=1 and then pos.y<=10)
then
return True;
else
return False;
end if;
end inArea;
function getInfectedPerc return Natural is
cnt : Natural:=0;
begin
for i in 1..10 loop
for j in 1..10 loop
if a(i,j) then
cnt:=cnt+1;
end if;
end loop;
end loop;
return cnt;
end getInfectedPerc;
end Area;
type Pstr is access String;
task type Customer(name : Pstr ; is_infected : Boolean);
task Organizer is
entry Create;
end Organizer;
task body Customer is
pos:Position:=Generator.GetRandPos;
movement:Natural:=0;
is_sick : Boolean := is_infected;
procedure move is
tmp:Position;
dir:Direction;
begin
loop
tmp:=pos;
dir:=Generator.GetRandDir;
case dir is
when left => tmp.x:=pos.x-1;
when right => tmp.x:=pos.x+1;
when up => tmp.y:=pos.y-1;
when down => tmp.y:=pos.y+1;
end case;
exit when Area.inArea(tmp);
end loop;
pos:=tmp;
end move;
begin
while movement<4 loop
--if not Organizer'Callable then
-- exit;
--end if;
--Monitor.Print("Current position : " & pos.x'Image & " , "& pos.y'Image);
if is_sick then
Area.infectCell(pos);
--Monitor.Print("One more cell infected");
end if;
if Area.isInfected(pos) then
is_sick := True;
end if;
movement:=movement+1;
delay 0.5;
move;
end loop;
if is_sick then
Monitor.Print(name.all &" named customer has infected");
infected_count := infected_count + 1;
end if;
if Organizer'Callable then
Monitor.Print( name.all &" named customer finished"); -- this means 4 movements so 2 mins done
Organizer.Create;
end if;
end Customer;
type CustomerPtr is access Customer;
task body Organizer is
start : Ada.Calendar.Time;
a,b,c,d,e,tmp: CustomerPtr;
total_customers : Natural := 5;
begin
Generator.Init;
Area.Init;
a:=new Customer(new String'("c1"),True);
b:=new Customer(new String'("c2"),True);
c:=new Customer(new String'("c3"),True);
d:=new Customer(new String'("c4"),True);
e:=new Customer(new String'("c5"),True);
start:=Ada.Calendar.Clock;
loop
if Ada.Calendar."-"( Ada.Calendar.Clock, start ) >=60.0 then
exit;
end if;
select
accept Create do
tmp:=new Customer(new String'("cus "& total_customers'Image),False);
Monitor.Print("Created new customer");
total_customers := total_customers + 1;
end Create;
end select;
end loop;
Monitor.Print("Percentage of territory is infected : " & Area.getInfectedPerc'Image);
--Monitor.Print("Infected customers : " & infected_count'Image);
--Monitor.Print("Total customers : " & total_customers'Image);
Monitor.Print("Out of "& total_customers'Image &" customers, "& infected_count'Image & " got infected.");
--exit;
end Organizer;
begin
-- Insert code here.
null;
end Market;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- tour --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 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: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.9 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Sample; use Sample;
procedure Tour is
begin
Whow;
end Tour;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M A C H I N E _ C O D E --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with System.Machine_Code;
package Machine_Code renames System.Machine_Code;
|
-- { dg-do run }
with Interfaces; use Interfaces;
procedure Array6 is
type buf_t is array (unsigned_32 range <>) of character;
type v_str_t (first, last : unsigned_32) is
record
buf : buf_t (first .. last) := (others => ' ');
end record;
type v_str_ptr_t is access all v_str_t;
v_str : v_str_ptr_t;
function build_v_str (f, l : unsigned_32) return v_str_ptr_t is
vp : v_str_ptr_t := new v_str_t (f, l);
begin
return vp;
end;
begin
v_str := build_v_str (unsigned_32'last/2 - 256,
unsigned_32'last/2 + 1024*1024);
end;
|
------------------------------------------------------------------------------
-- --
-- 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.UML.Remove_Structural_Feature_Value_Actions.Hash is
new AMF.Elements.Generic_Hash (UML_Remove_Structural_Feature_Value_Action, UML_Remove_Structural_Feature_Value_Action_Access);
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with umingw_h;
package malloc_h is
-- arg-macro: procedure alloca (x)
-- __builtin_alloca((x))
type u_heapinfo is record
u_pentry : access int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:47
u_size : aliased umingw_h.size_t; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:48
u_useflag : aliased int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:49
end record;
pragma Convention (C_Pass_By_Copy, u_heapinfo); -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:46
-- skipped func _resetstkoflw
-- skipped func _set_malloc_crt_max_wait
-- skipped func _expand
-- skipped func _msize
-- skipped func _get_sbh_threshold
-- skipped func _set_sbh_threshold
-- skipped func _set_amblksiz
-- skipped func _get_amblksiz
-- skipped func _heapadd
-- skipped func _heapchk
-- skipped func _heapmin
-- skipped func _heapset
-- skipped func _heapwalk
-- skipped func _heapused
-- skipped func _get_heap_handle
-- skipped func _MarkAllocaS
-- skipped func _freea
end malloc_h;
|
-- Copyright 2007-2021 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
First : Character := 'a';
begin
Procedure_Result := ' ';
Same (First); -- STOP
Next (First);
end Foo;
|
------------------------------------------------------------------------------
-- --
-- THIS IS AN AUTOMATICALLY GENERATED FILE! DO NOT EDIT! --
-- --
-- WAVEFILES --
-- --
-- Wavefile data I/O operations --
-- --
-- The MIT License (MIT) --
-- --
-- Copyright (c) 2015 -- 2021 Gustavo A. Hoffmann --
-- --
-- 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. --
------------------------------------------------------------------------------
private generic
#if (NUM_TYPE = "FLOAT") then
type Wav_Sample is digits <>;
#else
type Wav_Sample is delta <>;
#end if;
type Channel_Range is (<>);
type Wav_MC_Sample is array (Channel_Range range <>) of Wav_Sample;
#if NUM_TYPE'Defined and then (NUM_TYPE = "FLOAT") then
package Audio.Wavefiles.Generic_Float_Wav_IO is
#else
package Audio.Wavefiles.Generic_Fixed_Wav_IO is
#end if;
function Get (WF : in out Wavefile) return Wav_MC_Sample
with Inline, Pre => Mode (WF) = In_File;
procedure Get (WF : in out Wavefile;
Wav : out Wav_MC_Sample)
with Inline, Pre => Mode (WF) = In_File;
procedure Put (WF : in out Wavefile;
Wav : Wav_MC_Sample)
with Inline,
Pre => Mode (WF) = Out_File
and Wav'Length >= Number_Of_Channels (WF);
#if NUM_TYPE'Defined and then (NUM_TYPE = "FLOAT") then
end Audio.Wavefiles.Generic_Float_Wav_IO;
#else
end Audio.Wavefiles.Generic_Fixed_Wav_IO;
#end if;
|
-- AOC 2020, Day 18
package Day is
function hw_sum(filename : in String) return Long_Integer;
function hw_newmath_sum(filename : in String) return Long_Integer;
private
function eval_string(expr : in String) return Long_Integer;
function eval_newmath_string(expr : in String) return Long_Integer;
end Day;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . O R D E R E D _ S E T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
with Ada.Containers.Helpers;
private with Ada.Containers.Red_Black_Trees;
private with Ada.Finalization;
private with Ada.Streams;
private with Ada.Strings.Text_Output;
generic
type Element_Type is private;
with function "<" (Left, Right : Element_Type) return Boolean is <>;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Ordered_Sets with
SPARK_Mode => Off
is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Preelaborate;
pragma Remote_Types;
function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
type Set is tagged private
with Constant_Indexing => Constant_Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type;
-- Aggregate => (Empty => Empty,
-- Add_Unnamed => Include);
pragma Preelaborable_Initialization (Set);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
function Has_Element (Position : Cursor) return Boolean;
Empty_Set : constant Set;
function Empty return Set;
No_Element : constant Cursor;
package Set_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
function "=" (Left, Right : Set) return Boolean;
function Equivalent_Sets (Left, Right : Set) return Boolean;
function To_Set (New_Item : Element_Type) return Set;
function Length (Container : Set) return Count_Type;
function Is_Empty (Container : Set) return Boolean;
procedure Clear (Container : in out Set);
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Set;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
private
with
Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Set;
Position : Cursor) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
procedure Assign (Target : in out Set; Source : Set);
function Copy (Source : Set) return Set;
procedure Move (Target : in out Set; Source : in out Set);
procedure Insert
(Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
procedure Insert
(Container : in out Set;
New_Item : Element_Type);
procedure Include
(Container : in out Set;
New_Item : Element_Type);
procedure Replace
(Container : in out Set;
New_Item : Element_Type);
procedure Exclude
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Position : in out Cursor);
procedure Delete_First (Container : in out Set);
procedure Delete_Last (Container : in out Set);
procedure Union (Target : in out Set; Source : Set);
function Union (Left, Right : Set) return Set;
function "or" (Left, Right : Set) return Set renames Union;
procedure Intersection (Target : in out Set; Source : Set);
function Intersection (Left, Right : Set) return Set;
function "and" (Left, Right : Set) return Set renames Intersection;
procedure Difference (Target : in out Set; Source : Set);
function Difference (Left, Right : Set) return Set;
function "-" (Left, Right : Set) return Set renames Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set);
function Symmetric_Difference (Left, Right : Set) return Set;
function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean;
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
function First (Container : Set) return Cursor;
function First_Element (Container : Set) return Element_Type;
function Last (Container : Set) return Cursor;
function Last_Element (Container : Set) return Element_Type;
function Next (Position : Cursor) return Cursor;
procedure Next (Position : in out Cursor);
function Previous (Position : Cursor) return Cursor;
procedure Previous (Position : in out Cursor);
function Find (Container : Set; Item : Element_Type) return Cursor;
function Floor (Container : Set; Item : Element_Type) return Cursor;
function Ceiling (Container : Set; Item : Element_Type) return Cursor;
function Contains (Container : Set; Item : Element_Type) return Boolean;
function "<" (Left, Right : Cursor) return Boolean;
function ">" (Left, Right : Cursor) return Boolean;
function "<" (Left : Cursor; Right : Element_Type) return Boolean;
function ">" (Left : Cursor; Right : Element_Type) return Boolean;
function "<" (Left : Element_Type; Right : Cursor) return Boolean;
function ">" (Left : Element_Type; Right : Cursor) return Boolean;
procedure Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
function Iterate
(Container : Set)
return Set_Iterator_Interfaces.Reversible_Iterator'class;
function Iterate
(Container : Set;
Start : Cursor)
return Set_Iterator_Interfaces.Reversible_Iterator'class;
generic
type Key_Type (<>) is private;
with function Key (Element : Element_Type) return Key_Type;
with function "<" (Left, Right : Key_Type) return Boolean is <>;
package Generic_Keys is
function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
function Key (Position : Cursor) return Key_Type;
function Element (Container : Set; Key : Key_Type) return Element_Type;
procedure Replace
(Container : in out Set;
Key : Key_Type;
New_Item : Element_Type);
procedure Exclude (Container : in out Set; Key : Key_Type);
procedure Delete (Container : in out Set; Key : Key_Type);
function Find (Container : Set; Key : Key_Type) return Cursor;
function Floor (Container : Set; Key : Key_Type) return Cursor;
function Ceiling (Container : Set; Key : Key_Type) return Cursor;
function Contains (Container : Set; Key : Key_Type) return Boolean;
procedure Update_Element_Preserving_Key
(Container : in out Set;
Position : Cursor;
Process : not null access
procedure (Element : in out Element_Type));
type Reference_Type (Element : not null access Element_Type) is private
with
Implicit_Dereference => Element;
function Reference_Preserving_Key
(Container : aliased in out Set;
Position : Cursor) return Reference_Type;
function Constant_Reference
(Container : aliased Set;
Key : Key_Type) return Constant_Reference_Type;
function Reference_Preserving_Key
(Container : aliased in out Set;
Key : Key_Type) return Reference_Type;
private
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
type Key_Access is access all Key_Type;
package Impl is new Helpers.Generic_Implementation;
type Reference_Control_Type is
new Impl.Reference_Control_Type with
record
Container : Set_Access;
Pos : Cursor;
Old_Key : Key_Access;
end record;
overriding procedure Finalize (Control : in out Reference_Control_Type);
pragma Inline (Finalize);
type Reference_Type (Element : not null access Element_Type) is record
Control : Reference_Control_Type;
end record;
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
end Generic_Keys;
private
pragma Inline (Next);
pragma Inline (Previous);
type Node_Type;
type Node_Access is access Node_Type;
type Node_Type is limited record
Parent : Node_Access;
Left : Node_Access;
Right : Node_Access;
Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
Element : aliased Element_Type;
end record;
package Tree_Types is
new Red_Black_Trees.Generic_Tree_Types (Node_Type, Node_Access);
type Set is new Ada.Finalization.Controlled with record
Tree : Tree_Types.Tree_Type;
end record with Put_Image => Put_Image;
procedure Put_Image
(S : in out Ada.Strings.Text_Output.Sink'Class; V : Set);
overriding procedure Adjust (Container : in out Set);
overriding procedure Finalize (Container : in out Set) renames Clear;
use Red_Black_Trees;
use Tree_Types, Tree_Types.Implementation;
use Ada.Finalization;
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Set);
for Set'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Set);
for Set'Read use Read;
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
type Cursor is record
Container : Set_Access;
Node : Node_Access;
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-- It is necessary to rename this here, so that the compiler can find it
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
-- Three operations are used to optimize in the expansion of "for ... of"
-- loops: the Next(Cursor) procedure in the visible part, and the following
-- Pseudo_Reference and Get_Element_Access functions. See Sem_Ch5 for
-- details.
function Pseudo_Reference
(Container : aliased Set'Class) return Reference_Control_Type;
pragma Inline (Pseudo_Reference);
-- Creates an object of type Reference_Control_Type pointing to the
-- container, and increments the Lock. Finalization of this object will
-- decrement the Lock.
type Element_Access is access all Element_Type with
Storage_Size => 0;
function Get_Element_Access
(Position : Cursor) return not null Element_Access;
-- Returns a pointer to the element designated by Position.
Empty_Set : constant Set := (Controlled with others => <>);
function Empty return Set is (Empty_Set);
No_Element : constant Cursor := Cursor'(null, null);
type Iterator is new Limited_Controlled and
Set_Iterator_Interfaces.Reversible_Iterator with
record
Container : Set_Access;
Node : Node_Access;
end record
with Disable_Controlled => not T_Check;
overriding procedure Finalize (Object : in out Iterator);
overriding function First (Object : Iterator) return Cursor;
overriding function Last (Object : Iterator) return Cursor;
overriding function Next
(Object : Iterator;
Position : Cursor) return Cursor;
overriding function Previous
(Object : Iterator;
Position : Cursor) return Cursor;
end Ada.Containers.Ordered_Sets;
|
with AUnit.Test_Caller;
with SA_Arrays_Tests;
with SA_Definite_Tests;
package body Safe_Alloc_Suite is
package SA_Arrays_Test_Caller is new AUnit.Test_Caller(SA_Arrays_Tests.Test_Fixture);
package SA_Definite_Test_Caller is new AUnit.Test_Caller(SA_Definite_Tests.Test_Fixture);
function Suite return Access_Test_Suite is
SA_Suite : constant Access_Test_Suite := new Test_Suite;
begin
-- Add Arrays Tests ---------------------------------
SA_Suite.Add_Test(SA_Arrays_Test_Caller.Create("Test Arrays Alloc with trying to force Storage_Error => Returns `null`", SA_Arrays_Tests.TestAlloc_WithForcingStorageError_ResultNullReturned'Access));
-- Add Definite Tests ---------------------------------
SA_Suite.Add_Test(SA_Definite_Test_Caller.Create("Test Definite Alloc with trying to force Storage_Error => Returns `null`", SA_Definite_Tests.TestAlloc_WithForcingStorageError_ResultNullReturned'Access));
return SA_Suite;
end Suite;
end Safe_Alloc_Suite;
|
-- CD5012M.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT AN ADDRESS CLAUSE CAN BE GIVEN FOR A VARIABLE OF A
-- LIMITED PRIVATE TYPE IN THE DECLARATIVE PART OF A GENERIC
-- SUBPROGRAM.
-- HISTORY:
-- DHH 09/15/87 CREATED ORIGINAL TEST.
-- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'.
WITH SYSTEM; USE SYSTEM;
WITH REPORT; USE REPORT;
WITH SPPRT13;
PROCEDURE CD5012M IS
BEGIN
TEST ("CD5012M", "AN ADDRESS CLAUSE CAN BE " &
"GIVEN FOR A VARIABLE OF A LIMITED " &
"PRIVATE TYPE IN THE DECLARATIVE " &
"PART OF A GENERIC SUBPROGRAM");
DECLARE
PACKAGE P IS
TYPE FIXED IS LIMITED PRIVATE;
PRIVATE
TYPE FIXED IS DELTA 2.0**(-4) RANGE -10.0..10.0;
END P;
USE P;
GENERIC
PROCEDURE GENPROC;
PROCEDURE GENPROC IS
TESTFIX : FIXED;
FOR TESTFIX USE AT
SPPRT13.VARIABLE_ADDRESS;
BEGIN
IF TESTFIX'ADDRESS /= SPPRT13.VARIABLE_ADDRESS THEN
FAILED ("WRONG ADDRESS FOR LIMITED PRIVATE " &
"TYPE VARIABLE IN GENERIC PROCEDURE");
END IF;
END GENPROC;
PROCEDURE PROC IS NEW GENPROC;
BEGIN
PROC;
END;
RESULT;
END CD5012M;
|
-- CD4051B.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 RECORD REPRESENTATION CLAUSE WHICH CHANGES THE
-- ORDER OF THE COMPONENT STORAGE CAN BE GIVEN FOR A DERIVED TYPE
-- WHOSE PARENT TYPE IS A RECORD WITHOUT A DISCRIMINANT.
-- HISTORY:
-- BCB 03/20/89 CHANGED EXTENSION FROM '.ADA' TO '.DEP'.
-- RJW 08/25/87 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
WITH SYSTEM;
PROCEDURE CD4051B IS
UNITS_PER_INTEGER : CONSTANT :=
(INTEGER'SIZE + SYSTEM.STORAGE_UNIT - 1) /
SYSTEM.STORAGE_UNIT;
TYPE BASIC_CLAUSE IS RECORD
INT_COMP : INTEGER;
CHAR_COMP : CHARACTER;
END RECORD;
TYPE CHECK_CLAUSE IS NEW BASIC_CLAUSE;
FOR CHECK_CLAUSE USE
RECORD
INT_COMP AT 1*UNITS_PER_INTEGER
RANGE 0..INTEGER'SIZE - 1;
CHAR_COMP AT 0
RANGE 0..CHARACTER'SIZE - 1;
END RECORD;
CHECK_RECORD : CHECK_CLAUSE := (1, 'A');
BEGIN
TEST ("CD4051B", "CHECK THAT A RECORD REPRESENTATION " &
"CLAUSE WHICH CHANGES THE ORDER OF COMPONENT " &
"STORAGE CAN BE GIVEN FOR A DERIVED TYPE " &
"WHOSE PARENT TYPE IS IS A RECORD TYPE " &
"WITHOUT DISCRIMINANTS");
IF CHECK_RECORD.INT_COMP'FIRST_BIT /= 0 THEN
FAILED ("INCORRECT VALUE FOR FIRST_BIT OF INT_COMP");
END IF;
IF CHECK_RECORD.INT_COMP'LAST_BIT /= INTEGER'SIZE - 1 THEN
FAILED ("INCORRECT VALUE FOR LAST_BIT OF INT_COMP");
END IF;
IF CHECK_RECORD.INT_COMP'POSITION /=
IDENT_INT (UNITS_PER_INTEGER) THEN
FAILED ("INCORRECT VALUE FOR POSITION OF INT_COMP");
END IF;
IF CHECK_RECORD.CHAR_COMP'FIRST_BIT /= IDENT_INT (0) THEN
FAILED ("INCORRECT VALUE FOR FIRST_BIT OF CHAR_COMP");
END IF;
IF CHECK_RECORD.CHAR_COMP'LAST_BIT /=
IDENT_INT (CHARACTER'SIZE - 1) THEN
FAILED ("INCORRECT VALUE FOR LAST_BIT OF CHAR_COMP");
END IF;
IF CHECK_RECORD.CHAR_COMP'POSITION /=
IDENT_INT (0) THEN
FAILED ("INCORRECT VALUE FOR POSITION OF CHAR_COMP");
END IF;
RESULT;
END CD4051B;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . C _ S T R E A M S --
-- --
-- S p e c --
-- --
-- $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. --
-- --
------------------------------------------------------------------------------
-- This package provides an interface between Ada.Text_IO and the
-- C streams. This allows sharing of a stream between Ada and C or C++,
-- as well as allowing the Ada program to operate directly on the stream.
with Interfaces.C_Streams;
package Ada.Text_IO.C_Streams is
package ICS renames Interfaces.C_Streams;
function C_Stream (F : File_Type) return ICS.FILEs;
-- Obtain stream from existing open file
procedure Open
(File : in out File_Type;
Mode : in File_Mode;
C_Stream : in ICS.FILEs;
Form : in String := "");
-- Create new file from existing stream
end Ada.Text_IO.C_Streams;
|
with
openGL.Model,
openGL.Visual,
openGL.Light,
openGL.Palette,
openGL.Demo;
procedure launch_render_Models
--
-- Exercise the renderer with an example of all the models.
--
is
use openGL,
openGL.Math,
openGL.linear_Algebra_3D,
openGL.Palette;
begin
Demo.print_Usage ("Use space ' ' to cycle through models.");
Demo.define ("openGL 'Render Models' Demo");
Demo.Camera.Position_is ((0.0, 2.0, 10.0),
y_Rotation_from (to_Radians (0.0)));
declare
use openGL.Light;
the_Light : openGL.Light.item := Demo.Renderer.new_Light;
begin
-- the_Light.Kind_is (Diffuse);
-- the_Light.Site_is ((0.0, 0.0, 5.0));
the_Light.Site_is ((5_000.0, 2_000.0, 5_000.0));
-- the_Light.Site_is ((000.0, 5_000.0, 000.0));
the_Light.Color_is (White);
-- the_Light.ambient_Coefficient_is (0.91);
Demo.Renderer.set (the_Light);
end;
-- Set the lights initial position to far behind and far to the left.
--
-- declare
-- use openGL.Palette;
--
-- initial_Site : constant openGL.Vector_3 := (0.0, 0.0, 15.0);
-- cone_Direction : constant openGL.Vector_3 := (0.0, 0.0, -1.0);
--
-- Light : openGL.Light.diffuse.item := Demo.Renderer.Light (Id => 1);
-- begin
-- Light.Color_is (Ambient => (Grey, Opaque),
-- Diffuse => (White, Opaque));
-- -- Specular => (White, Opaque));
--
-- Light.Position_is (initial_Site);
-- Light.cone_Direction_is (cone_Direction);
--
-- Demo.Renderer.Light_is (Id => 1, Now => Light);
-- end;
declare
-- The models.
--
the_Models : constant openGL.Model.views := openGL.Demo.Models;
-- The visuals.
--
use openGL.Visual.Forge;
the_Visuals : openGL.Visual.views (the_Models'Range);
Current : Integer := the_Visuals'First;
begin
for i in the_Visuals'Range
loop
the_Visuals (i) := new_Visual (the_Models (i));
end loop;
the_Visuals (3).Site_is ((0.0, 0.0, -50.0));
-- Main loop.
--
while not Demo.Done
loop
Demo.Dolly.evolve;
Demo.Done := Demo.Dolly.quit_Requested;
declare
Command : Character;
Avail : Boolean;
begin
Demo.Dolly.get_last_Character (Command, Avail);
if Avail
then
case Command
is
when ' ' =>
if Current = the_Visuals'Last
then Current := the_Visuals'First;
else Current := Current + 1;
end if;
when others =>
null;
end case;
end if;
end;
-- Render all visuals.
--
Demo.Camera.render ((1 => the_Visuals (Current)));
while not Demo.Camera.cull_Completed
loop
delay Duration'Small;
end loop;
Demo.Renderer.render;
Demo.FPS_Counter.increment; -- Frames per second display.
delay 1.0 / 60.0;
end loop;
end;
Demo.destroy;
end launch_render_Models;
|
generic
type Element is (<>);
with function "+" (Left, Right : Element) return Element is <>;
with function "-" (Left, Right : Element) return Element is <>;
package Coordinates_2D is
type Coordinate_2D is record
Line, Column : Element;
end record;
function "+" (Left, Right : Coordinate_2D) return Coordinate_2D is
((Line => Left.Line + Right.Line,
Column => Left.Column + Right.Column));
function "-" (Left, Right : Coordinate_2D) return Coordinate_2D is
((Line => Left.Line - Right.Line,
Column => Left.Column - Right.Column));
end Coordinates_2D;
|
-- Copyright (c) 2016 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.
with Ada.Streams.Stream_IO;
with Ada.Unchecked_Deallocation;
with Ahven; use Ahven;
with JSON.Parsers;
with JSON.Streams;
with JSON.Types;
package body Test_Streams is
package Types is new JSON.Types (Long_Integer, Long_Float);
package Parsers is new JSON.Parsers (Types);
overriding
procedure Initialize (T : in out Test) is
begin
T.Set_Name ("Streams");
T.Add_Test_Routine (Test_Stream_IO'Access, "Parse float_number.txt");
end Initialize;
use Types;
use Ada.Streams;
type Stream_Element_Array_Access is access Stream_Element_Array;
procedure Free is new Ada.Unchecked_Deallocation
(Object => Stream_Element_Array, Name => Stream_Element_Array_Access);
procedure Test_Stream_IO is
File : Stream_IO.File_Type;
File_Name : constant String := "float_number.txt";
Bytes : Stream_Element_Array_Access;
begin
Stream_IO.Open (File, Stream_IO.In_File, File_Name);
declare
File_Size : constant Stream_Element_Offset
:= Stream_Element_Offset (Stream_IO.Size (File));
subtype Byte_Array is Stream_Element_Array (1 .. File_Size);
begin
Bytes := new Byte_Array;
Byte_Array'Read (Stream_IO.Stream (File), Bytes.all);
declare
Stream : JSON.Streams.Stream'Class := JSON.Streams.Create_Stream (Bytes);
Allocator : Types.Memory_Allocator;
Value : constant JSON_Value := Parsers.Parse (Stream, Allocator);
begin
Assert (Value.Kind = Float_Kind, "Not a float");
Assert (Value.Value = 3.14, "Expected float value to be equal to 3.14");
end;
end;
Stream_IO.Close (File);
Free (Bytes);
exception
when others =>
Stream_IO.Close (File);
Free (Bytes);
raise;
end Test_Stream_IO;
end Test_Streams;
|
--
-- Intentionally not providing a Copyright header to verify that
-- having -copyright in the config for our module does indeed turn
-- this check off.
--
package Pck is
end Pck;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ 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. --
-- --
------------------------------------------------------------------------------
with Aspects; use Aspects;
with Atree; use Atree;
with Debug; use Debug;
with Einfo; use Einfo;
with Elists; use Elists;
with Errout; use Errout;
with Exp_Util; use Exp_Util;
with Fname; use Fname;
with Itypes; use Itypes;
with Lib; use Lib;
with Lib.Xref; use Lib.Xref;
with Namet; use Namet;
with Namet.Sp; use Namet.Sp;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Output; use Output;
with Restrict; use Restrict;
with Rident; use Rident;
with Sem; use Sem;
with Sem_Aux; use Sem_Aux;
with Sem_Case; use Sem_Case;
with Sem_Cat; use Sem_Cat;
with Sem_Ch3; use Sem_Ch3;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
with Sem_Dim; use Sem_Dim;
with Sem_Disp; use Sem_Disp;
with Sem_Dist; use Sem_Dist;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sem_Warn; use Sem_Warn;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
package body Sem_Ch4 is
-- Tables which speed up the identification of dangerous calls to Ada 2012
-- functions with writable actuals (AI05-0144).
-- The following table enumerates the Ada constructs which may evaluate in
-- arbitrary order. It does not cover all the language constructs which can
-- be evaluated in arbitrary order but the subset needed for AI05-0144.
Has_Arbitrary_Evaluation_Order : constant array (Node_Kind) of Boolean :=
(N_Aggregate => True,
N_Assignment_Statement => True,
N_Entry_Call_Statement => True,
N_Extension_Aggregate => True,
N_Full_Type_Declaration => True,
N_Indexed_Component => True,
N_Object_Declaration => True,
N_Pragma => True,
N_Range => True,
N_Slice => True,
N_Array_Type_Definition => True,
N_Membership_Test => True,
N_Binary_Op => True,
N_Subprogram_Call => True,
others => False);
-- The following table enumerates the nodes on which we stop climbing when
-- locating the outermost Ada construct that can be evaluated in arbitrary
-- order.
Stop_Subtree_Climbing : constant array (Node_Kind) of Boolean :=
(N_Aggregate => True,
N_Assignment_Statement => True,
N_Entry_Call_Statement => True,
N_Extended_Return_Statement => True,
N_Extension_Aggregate => True,
N_Full_Type_Declaration => True,
N_Object_Declaration => True,
N_Object_Renaming_Declaration => True,
N_Package_Specification => True,
N_Pragma => True,
N_Procedure_Call_Statement => True,
N_Simple_Return_Statement => True,
N_Has_Condition => True,
others => False);
-----------------------
-- Local Subprograms --
-----------------------
procedure Analyze_Concatenation_Rest (N : Node_Id);
-- Does the "rest" of the work of Analyze_Concatenation, after the left
-- operand has been analyzed. See Analyze_Concatenation for details.
procedure Analyze_Expression (N : Node_Id);
-- For expressions that are not names, this is just a call to analyze. If
-- the expression is a name, it may be a call to a parameterless function,
-- and if so must be converted into an explicit call node and analyzed as
-- such. This deproceduring must be done during the first pass of overload
-- resolution, because otherwise a procedure call with overloaded actuals
-- may fail to resolve.
procedure Analyze_Operator_Call (N : Node_Id; Op_Id : Entity_Id);
-- Analyze a call of the form "+"(x, y), etc. The prefix of the call is an
-- operator name or an expanded name whose selector is an operator name,
-- and one possible interpretation is as a predefined operator.
procedure Analyze_Overloaded_Selected_Component (N : Node_Id);
-- If the prefix of a selected_component is overloaded, the proper
-- interpretation that yields a record type with the proper selector
-- name must be selected.
procedure Analyze_User_Defined_Binary_Op (N : Node_Id; Op_Id : Entity_Id);
-- Procedure to analyze a user defined binary operator, which is resolved
-- like a function, but instead of a list of actuals it is presented
-- with the left and right operands of an operator node.
procedure Analyze_User_Defined_Unary_Op (N : Node_Id; Op_Id : Entity_Id);
-- Procedure to analyze a user defined unary operator, which is resolved
-- like a function, but instead of a list of actuals, it is presented with
-- the operand of the operator node.
procedure Ambiguous_Operands (N : Node_Id);
-- For equality, membership, and comparison operators with overloaded
-- arguments, list possible interpretations.
procedure Analyze_One_Call
(N : Node_Id;
Nam : Entity_Id;
Report : Boolean;
Success : out Boolean;
Skip_First : Boolean := False);
-- Check one interpretation of an overloaded subprogram name for
-- compatibility with the types of the actuals in a call. If there is a
-- single interpretation which does not match, post error if Report is
-- set to True.
--
-- Nam is the entity that provides the formals against which the actuals
-- are checked. Nam is either the name of a subprogram, or the internal
-- subprogram type constructed for an access_to_subprogram. If the actuals
-- are compatible with Nam, then Nam is added to the list of candidate
-- interpretations for N, and Success is set to True.
--
-- The flag Skip_First is used when analyzing a call that was rewritten
-- from object notation. In this case the first actual may have to receive
-- an explicit dereference, depending on the first formal of the operation
-- being called. The caller will have verified that the object is legal
-- for the call. If the remaining parameters match, the first parameter
-- will rewritten as a dereference if needed, prior to completing analysis.
procedure Check_Misspelled_Selector
(Prefix : Entity_Id;
Sel : Node_Id);
-- Give possible misspelling message if Sel seems likely to be a mis-
-- spelling of one of the selectors of the Prefix. This is called by
-- Analyze_Selected_Component after producing an invalid selector error
-- message.
function Defined_In_Scope (T : Entity_Id; S : Entity_Id) return Boolean;
-- Verify that type T is declared in scope S. Used to find interpretations
-- for operators given by expanded names. This is abstracted as a separate
-- function to handle extensions to System, where S is System, but T is
-- declared in the extension.
procedure Find_Arithmetic_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- L and R are the operands of an arithmetic operator. Find consistent
-- pairs of interpretations for L and R that have a numeric type consistent
-- with the semantics of the operator.
procedure Find_Comparison_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- L and R are operands of a comparison operator. Find consistent pairs of
-- interpretations for L and R.
procedure Find_Concatenation_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- For the four varieties of concatenation
procedure Find_Equality_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- Ditto for equality operators
procedure Find_Boolean_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- Ditto for binary logical operations
procedure Find_Negation_Types
(R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- Find consistent interpretation for operand of negation operator
procedure Find_Non_Universal_Interpretations
(N : Node_Id;
R : Node_Id;
Op_Id : Entity_Id;
T1 : Entity_Id);
-- For equality and comparison operators, the result is always boolean, and
-- the legality of the operation is determined from the visibility of the
-- operand types. If one of the operands has a universal interpretation,
-- the legality check uses some compatible non-universal interpretation of
-- the other operand. N can be an operator node, or a function call whose
-- name is an operator designator. Any_Access, which is the initial type of
-- the literal NULL, is a universal type for the purpose of this routine.
function Find_Primitive_Operation (N : Node_Id) return Boolean;
-- Find candidate interpretations for the name Obj.Proc when it appears in
-- a subprogram renaming declaration.
procedure Find_Unary_Types
(R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- Unary arithmetic types: plus, minus, abs
procedure Check_Arithmetic_Pair
(T1, T2 : Entity_Id;
Op_Id : Entity_Id;
N : Node_Id);
-- Subsidiary procedure to Find_Arithmetic_Types. T1 and T2 are valid types
-- for left and right operand. Determine whether they constitute a valid
-- pair for the given operator, and record the corresponding interpretation
-- of the operator node. The node N may be an operator node (the usual
-- case) or a function call whose prefix is an operator designator. In
-- both cases Op_Id is the operator name itself.
procedure Diagnose_Call (N : Node_Id; Nam : Node_Id);
-- Give detailed information on overloaded call where none of the
-- interpretations match. N is the call node, Nam the designator for
-- the overloaded entity being called.
function Junk_Operand (N : Node_Id) return Boolean;
-- Test for an operand that is an inappropriate entity (e.g. a package
-- name or a label). If so, issue an error message and return True. If
-- the operand is not an inappropriate entity kind, return False.
procedure Operator_Check (N : Node_Id);
-- Verify that an operator has received some valid interpretation. If none
-- was found, determine whether a use clause would make the operation
-- legal. The variable Candidate_Type (defined in Sem_Type) is set for
-- every type compatible with the operator, even if the operator for the
-- type is not directly visible. The routine uses this type to emit a more
-- informative message.
function Process_Implicit_Dereference_Prefix
(E : Entity_Id;
P : Node_Id) return Entity_Id;
-- Called when P is the prefix of an implicit dereference, denoting an
-- object E. The function returns the designated type of the prefix, taking
-- into account that the designated type of an anonymous access type may be
-- a limited view, when the non-limited view is visible.
--
-- If in semantics only mode (-gnatc or generic), the function also records
-- that the prefix is a reference to E, if any. Normally, such a reference
-- is generated only when the implicit dereference is expanded into an
-- explicit one, but for consistency we must generate the reference when
-- expansion is disabled as well.
procedure Remove_Abstract_Operations (N : Node_Id);
-- Ada 2005: implementation of AI-310. An abstract non-dispatching
-- operation is not a candidate interpretation.
function Try_Container_Indexing
(N : Node_Id;
Prefix : Node_Id;
Exprs : List_Id) return Boolean;
-- AI05-0139: Generalized indexing to support iterators over containers
function Try_Indexed_Call
(N : Node_Id;
Nam : Entity_Id;
Typ : Entity_Id;
Skip_First : Boolean) return Boolean;
-- If a function has defaults for all its actuals, a call to it may in fact
-- be an indexing on the result of the call. Try_Indexed_Call attempts the
-- interpretation as an indexing, prior to analysis as a call. If both are
-- possible, the node is overloaded with both interpretations (same symbol
-- but two different types). If the call is written in prefix form, the
-- prefix becomes the first parameter in the call, and only the remaining
-- actuals must be checked for the presence of defaults.
function Try_Indirect_Call
(N : Node_Id;
Nam : Entity_Id;
Typ : Entity_Id) return Boolean;
-- Similarly, a function F that needs no actuals can return an access to a
-- subprogram, and the call F (X) interpreted as F.all (X). In this case
-- the call may be overloaded with both interpretations.
procedure wpo (T : Entity_Id);
pragma Warnings (Off, wpo);
-- Used for debugging: obtain list of primitive operations even if
-- type is not frozen and dispatch table is not built yet.
------------------------
-- Ambiguous_Operands --
------------------------
procedure Ambiguous_Operands (N : Node_Id) is
procedure List_Operand_Interps (Opnd : Node_Id);
--------------------------
-- List_Operand_Interps --
--------------------------
procedure List_Operand_Interps (Opnd : Node_Id) is
Nam : Node_Id;
Err : Node_Id := N;
begin
if Is_Overloaded (Opnd) then
if Nkind (Opnd) in N_Op then
Nam := Opnd;
elsif Nkind (Opnd) = N_Function_Call then
Nam := Name (Opnd);
elsif Ada_Version >= Ada_2012 then
declare
It : Interp;
I : Interp_Index;
begin
Get_First_Interp (Opnd, I, It);
while Present (It.Nam) loop
if Has_Implicit_Dereference (It.Typ) then
Error_Msg_N
("can be interpreted as implicit dereference", Opnd);
return;
end if;
Get_Next_Interp (I, It);
end loop;
end;
return;
end if;
else
return;
end if;
if Opnd = Left_Opnd (N) then
Error_Msg_N
("\left operand has the following interpretations", N);
else
Error_Msg_N
("\right operand has the following interpretations", N);
Err := Opnd;
end if;
List_Interps (Nam, Err);
end List_Operand_Interps;
-- Start of processing for Ambiguous_Operands
begin
if Nkind (N) in N_Membership_Test then
Error_Msg_N ("ambiguous operands for membership", N);
elsif Nkind_In (N, N_Op_Eq, N_Op_Ne) then
Error_Msg_N ("ambiguous operands for equality", N);
else
Error_Msg_N ("ambiguous operands for comparison", N);
end if;
if All_Errors_Mode then
List_Operand_Interps (Left_Opnd (N));
List_Operand_Interps (Right_Opnd (N));
else
Error_Msg_N ("\use -gnatf switch for details", N);
end if;
end Ambiguous_Operands;
-----------------------
-- Analyze_Aggregate --
-----------------------
-- Most of the analysis of Aggregates requires that the type be known,
-- and is therefore put off until resolution.
procedure Analyze_Aggregate (N : Node_Id) is
begin
if No (Etype (N)) then
Set_Etype (N, Any_Composite);
end if;
end Analyze_Aggregate;
-----------------------
-- Analyze_Allocator --
-----------------------
procedure Analyze_Allocator (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Sav_Errs : constant Nat := Serious_Errors_Detected;
E : Node_Id := Expression (N);
Acc_Type : Entity_Id;
Type_Id : Entity_Id;
P : Node_Id;
C : Node_Id;
Onode : Node_Id;
begin
Check_SPARK_05_Restriction ("allocator is not allowed", N);
-- Deal with allocator restrictions
-- In accordance with H.4(7), the No_Allocators restriction only applies
-- to user-written allocators. The same consideration applies to the
-- No_Standard_Allocators_Before_Elaboration restriction.
if Comes_From_Source (N) then
Check_Restriction (No_Allocators, N);
-- Processing for No_Standard_Allocators_After_Elaboration, loop to
-- look at enclosing context, checking task/main subprogram case.
C := N;
P := Parent (C);
while Present (P) loop
-- For the task case we need a handled sequence of statements,
-- where the occurrence of the allocator is within the statements
-- and the parent is a task body
if Nkind (P) = N_Handled_Sequence_Of_Statements
and then Is_List_Member (C)
and then List_Containing (C) = Statements (P)
then
Onode := Original_Node (Parent (P));
-- Check for allocator within task body, this is a definite
-- violation of No_Allocators_After_Elaboration we can detect
-- at compile time.
if Nkind (Onode) = N_Task_Body then
Check_Restriction
(No_Standard_Allocators_After_Elaboration, N);
exit;
end if;
end if;
-- The other case is appearance in a subprogram body. This is
-- a violation if this is a library level subprogram with no
-- parameters. Note that this is now a static error even if the
-- subprogram is not the main program (this is a change, in an
-- earlier version only the main program was affected, and the
-- check had to be done in the binder.
if Nkind (P) = N_Subprogram_Body
and then Nkind (Parent (P)) = N_Compilation_Unit
and then No (Parameter_Specifications (Specification (P)))
then
Check_Restriction
(No_Standard_Allocators_After_Elaboration, N);
end if;
C := P;
P := Parent (C);
end loop;
end if;
-- Ada 2012 (AI05-0111-3): Analyze the subpool_specification, if
-- any. The expected type for the name is any type. A non-overloading
-- rule then requires it to be of a type descended from
-- System.Storage_Pools.Subpools.Subpool_Handle.
-- This isn't exactly what the AI says, but it seems to be the right
-- rule. The AI should be fixed.???
declare
Subpool : constant Node_Id := Subpool_Handle_Name (N);
begin
if Present (Subpool) then
Analyze (Subpool);
if Is_Overloaded (Subpool) then
Error_Msg_N ("ambiguous subpool handle", Subpool);
end if;
-- Check that Etype (Subpool) is descended from Subpool_Handle
Resolve (Subpool);
end if;
end;
-- Analyze the qualified expression or subtype indication
if Nkind (E) = N_Qualified_Expression then
Acc_Type := Create_Itype (E_Allocator_Type, N);
Set_Etype (Acc_Type, Acc_Type);
Find_Type (Subtype_Mark (E));
-- Analyze the qualified expression, and apply the name resolution
-- rule given in 4.7(3).
Analyze (E);
Type_Id := Etype (E);
Set_Directly_Designated_Type (Acc_Type, Type_Id);
-- A qualified expression requires an exact match of the type,
-- class-wide matching is not allowed.
-- if Is_Class_Wide_Type (Type_Id)
-- and then Base_Type
-- (Etype (Expression (E))) /= Base_Type (Type_Id)
-- then
-- Wrong_Type (Expression (E), Type_Id);
-- end if;
-- We don't analyze the qualified expression itself because it's
-- part of the allocator. It is fully analyzed and resolved when
-- the allocator is resolved with the context type.
Set_Etype (E, Type_Id);
-- Case where allocator has a subtype indication
else
declare
Def_Id : Entity_Id;
Base_Typ : Entity_Id;
begin
-- If the allocator includes a N_Subtype_Indication then a
-- constraint is present, otherwise the node is a subtype mark.
-- Introduce an explicit subtype declaration into the tree
-- defining some anonymous subtype and rewrite the allocator to
-- use this subtype rather than the subtype indication.
-- It is important to introduce the explicit subtype declaration
-- so that the bounds of the subtype indication are attached to
-- the tree in case the allocator is inside a generic unit.
-- Finally, if there is no subtype indication and the type is
-- a tagged unconstrained type with discriminants, the designated
-- object is constrained by their default values, and it is
-- simplest to introduce an explicit constraint now. In some cases
-- this is done during expansion, but freeze actions are certain
-- to be emitted in the proper order if constraint is explicit.
if Is_Entity_Name (E) and then Expander_Active then
Find_Type (E);
Type_Id := Entity (E);
if Is_Tagged_Type (Type_Id)
and then Has_Discriminants (Type_Id)
and then not Is_Constrained (Type_Id)
and then
Present
(Discriminant_Default_Value
(First_Discriminant (Type_Id)))
then
declare
Constr : constant List_Id := New_List;
Loc : constant Source_Ptr := Sloc (E);
Discr : Entity_Id := First_Discriminant (Type_Id);
begin
if Present (Discriminant_Default_Value (Discr)) then
while Present (Discr) loop
Append (Discriminant_Default_Value (Discr), Constr);
Next_Discriminant (Discr);
end loop;
Rewrite (E,
Make_Subtype_Indication (Loc,
Subtype_Mark => New_Occurrence_Of (Type_Id, Loc),
Constraint =>
Make_Index_Or_Discriminant_Constraint (Loc,
Constraints => Constr)));
end if;
end;
end if;
end if;
if Nkind (E) = N_Subtype_Indication then
-- A constraint is only allowed for a composite type in Ada
-- 95. In Ada 83, a constraint is also allowed for an
-- access-to-composite type, but the constraint is ignored.
Find_Type (Subtype_Mark (E));
Base_Typ := Entity (Subtype_Mark (E));
if Is_Elementary_Type (Base_Typ) then
if not (Ada_Version = Ada_83
and then Is_Access_Type (Base_Typ))
then
Error_Msg_N ("constraint not allowed here", E);
if Nkind (Constraint (E)) =
N_Index_Or_Discriminant_Constraint
then
Error_Msg_N -- CODEFIX
("\if qualified expression was meant, " &
"use apostrophe", Constraint (E));
end if;
end if;
-- Get rid of the bogus constraint:
Rewrite (E, New_Copy_Tree (Subtype_Mark (E)));
Analyze_Allocator (N);
return;
end if;
if Expander_Active then
Def_Id := Make_Temporary (Loc, 'S');
Insert_Action (E,
Make_Subtype_Declaration (Loc,
Defining_Identifier => Def_Id,
Subtype_Indication => Relocate_Node (E)));
if Sav_Errs /= Serious_Errors_Detected
and then Nkind (Constraint (E)) =
N_Index_Or_Discriminant_Constraint
then
Error_Msg_N -- CODEFIX
("if qualified expression was meant, "
& "use apostrophe!", Constraint (E));
end if;
E := New_Occurrence_Of (Def_Id, Loc);
Rewrite (Expression (N), E);
end if;
end if;
Type_Id := Process_Subtype (E, N);
Acc_Type := Create_Itype (E_Allocator_Type, N);
Set_Etype (Acc_Type, Acc_Type);
Set_Directly_Designated_Type (Acc_Type, Type_Id);
Check_Fully_Declared (Type_Id, N);
-- Ada 2005 (AI-231): If the designated type is itself an access
-- type that excludes null, its default initialization will
-- be a null object, and we can insert an unconditional raise
-- before the allocator.
-- Ada 2012 (AI-104): A not null indication here is altogether
-- illegal.
if Can_Never_Be_Null (Type_Id) then
declare
Not_Null_Check : constant Node_Id :=
Make_Raise_Constraint_Error (Sloc (E),
Reason => CE_Null_Not_Allowed);
begin
if Expander_Active then
Insert_Action (N, Not_Null_Check);
Analyze (Not_Null_Check);
elsif Warn_On_Ada_2012_Compatibility then
Error_Msg_N
("null value not allowed here in Ada 2012?y?", E);
end if;
end;
end if;
-- Check for missing initialization. Skip this check if we already
-- had errors on analyzing the allocator, since in that case these
-- are probably cascaded errors.
if not Is_Definite_Subtype (Type_Id)
and then Serious_Errors_Detected = Sav_Errs
then
-- The build-in-place machinery may produce an allocator when
-- the designated type is indefinite but the underlying type is
-- not. In this case the unknown discriminants are meaningless
-- and should not trigger error messages. Check the parent node
-- because the allocator is marked as coming from source.
if Present (Underlying_Type (Type_Id))
and then Is_Definite_Subtype (Underlying_Type (Type_Id))
and then not Comes_From_Source (Parent (N))
then
null;
-- An unusual case arises when the parent of a derived type is
-- a limited record extension with unknown discriminants, and
-- its full view has no discriminants.
--
-- A more general fix might be to create the proper underlying
-- type for such a derived type, but it is a record type with
-- no private attributes, so this required extending the
-- meaning of this attribute. ???
elsif Ekind (Etype (Type_Id)) = E_Record_Type_With_Private
and then Present (Underlying_Type (Etype (Type_Id)))
and then
not Has_Discriminants (Underlying_Type (Etype (Type_Id)))
and then not Comes_From_Source (Parent (N))
then
null;
elsif Is_Class_Wide_Type (Type_Id) then
Error_Msg_N
("initialization required in class-wide allocation", N);
else
if Ada_Version < Ada_2005
and then Is_Limited_Type (Type_Id)
then
Error_Msg_N ("unconstrained allocation not allowed", N);
if Is_Array_Type (Type_Id) then
Error_Msg_N
("\constraint with array bounds required", N);
elsif Has_Unknown_Discriminants (Type_Id) then
null;
else pragma Assert (Has_Discriminants (Type_Id));
Error_Msg_N
("\constraint with discriminant values required", N);
end if;
-- Limited Ada 2005 and general non-limited case
else
Error_Msg_N
("uninitialized unconstrained allocation not "
& "allowed", N);
if Is_Array_Type (Type_Id) then
Error_Msg_N
("\qualified expression or constraint with "
& "array bounds required", N);
elsif Has_Unknown_Discriminants (Type_Id) then
Error_Msg_N ("\qualified expression required", N);
else pragma Assert (Has_Discriminants (Type_Id));
Error_Msg_N
("\qualified expression or constraint with "
& "discriminant values required", N);
end if;
end if;
end if;
end if;
end;
end if;
if Is_Abstract_Type (Type_Id) then
Error_Msg_N ("cannot allocate abstract object", E);
end if;
if Has_Task (Designated_Type (Acc_Type)) then
Check_Restriction (No_Tasking, N);
Check_Restriction (Max_Tasks, N);
Check_Restriction (No_Task_Allocators, N);
end if;
-- Check restriction against dynamically allocated protected objects
if Has_Protected (Designated_Type (Acc_Type)) then
Check_Restriction (No_Protected_Type_Allocators, N);
end if;
-- AI05-0013-1: No_Nested_Finalization forbids allocators if the access
-- type is nested, and the designated type needs finalization. The rule
-- is conservative in that class-wide types need finalization.
if Needs_Finalization (Designated_Type (Acc_Type))
and then not Is_Library_Level_Entity (Acc_Type)
then
Check_Restriction (No_Nested_Finalization, N);
end if;
-- Check that an allocator of a nested access type doesn't create a
-- protected object when restriction No_Local_Protected_Objects applies.
if Has_Protected (Designated_Type (Acc_Type))
and then not Is_Library_Level_Entity (Acc_Type)
then
Check_Restriction (No_Local_Protected_Objects, N);
end if;
-- Likewise for No_Local_Timing_Events
if Has_Timing_Event (Designated_Type (Acc_Type))
and then not Is_Library_Level_Entity (Acc_Type)
then
Check_Restriction (No_Local_Timing_Events, N);
end if;
-- If the No_Streams restriction is set, check that the type of the
-- object is not, and does not contain, any subtype derived from
-- Ada.Streams.Root_Stream_Type. Note that we guard the call to
-- Has_Stream just for efficiency reasons. There is no point in
-- spending time on a Has_Stream check if the restriction is not set.
if Restriction_Check_Required (No_Streams) then
if Has_Stream (Designated_Type (Acc_Type)) then
Check_Restriction (No_Streams, N);
end if;
end if;
Set_Etype (N, Acc_Type);
if not Is_Library_Level_Entity (Acc_Type) then
Check_Restriction (No_Local_Allocators, N);
end if;
if Serious_Errors_Detected > Sav_Errs then
Set_Error_Posted (N);
Set_Etype (N, Any_Type);
end if;
end Analyze_Allocator;
---------------------------
-- Analyze_Arithmetic_Op --
---------------------------
procedure Analyze_Arithmetic_Op (N : Node_Id) is
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
Op_Id : Entity_Id;
begin
Candidate_Type := Empty;
Analyze_Expression (L);
Analyze_Expression (R);
-- If the entity is already set, the node is the instantiation of a
-- generic node with a non-local reference, or was manufactured by a
-- call to Make_Op_xxx. In either case the entity is known to be valid,
-- and we do not need to collect interpretations, instead we just get
-- the single possible interpretation.
Op_Id := Entity (N);
if Present (Op_Id) then
if Ekind (Op_Id) = E_Operator then
if Nkind_In (N, N_Op_Divide, N_Op_Mod, N_Op_Multiply, N_Op_Rem)
and then Treat_Fixed_As_Integer (N)
then
null;
else
Set_Etype (N, Any_Type);
Find_Arithmetic_Types (L, R, Op_Id, N);
end if;
else
Set_Etype (N, Any_Type);
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
-- Entity is not already set, so we do need to collect interpretations
else
Set_Etype (N, Any_Type);
Op_Id := Get_Name_Entity_Id (Chars (N));
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator
and then Present (Next_Entity (First_Entity (Op_Id)))
then
Find_Arithmetic_Types (L, R, Op_Id, N);
-- The following may seem superfluous, because an operator cannot
-- be generic, but this ignores the cleverness of the author of
-- ACVC bc1013a.
elsif Is_Overloadable (Op_Id) then
Analyze_User_Defined_Binary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
end if;
Operator_Check (N);
Check_Function_Writable_Actuals (N);
end Analyze_Arithmetic_Op;
------------------
-- Analyze_Call --
------------------
-- Function, procedure, and entry calls are checked here. The Name in
-- the call may be overloaded. The actuals have been analyzed and may
-- themselves be overloaded. On exit from this procedure, the node N
-- may have zero, one or more interpretations. In the first case an
-- error message is produced. In the last case, the node is flagged
-- as overloaded and the interpretations are collected in All_Interp.
-- If the name is an Access_To_Subprogram, it cannot be overloaded, but
-- the type-checking is similar to that of other calls.
procedure Analyze_Call (N : Node_Id) is
Actuals : constant List_Id := Parameter_Associations (N);
Loc : constant Source_Ptr := Sloc (N);
Nam : Node_Id;
X : Interp_Index;
It : Interp;
Nam_Ent : Entity_Id;
Success : Boolean := False;
Deref : Boolean := False;
-- Flag indicates whether an interpretation of the prefix is a
-- parameterless call that returns an access_to_subprogram.
procedure Check_Mixed_Parameter_And_Named_Associations;
-- Check that parameter and named associations are not mixed. This is
-- a restriction in SPARK mode.
procedure Check_Writable_Actuals (N : Node_Id);
-- If the call has out or in-out parameters then mark its outermost
-- enclosing construct as a node on which the writable actuals check
-- must be performed.
function Name_Denotes_Function return Boolean;
-- If the type of the name is an access to subprogram, this may be the
-- type of a name, or the return type of the function being called. If
-- the name is not an entity then it can denote a protected function.
-- Until we distinguish Etype from Return_Type, we must use this routine
-- to resolve the meaning of the name in the call.
procedure No_Interpretation;
-- Output error message when no valid interpretation exists
--------------------------------------------------
-- Check_Mixed_Parameter_And_Named_Associations --
--------------------------------------------------
procedure Check_Mixed_Parameter_And_Named_Associations is
Actual : Node_Id;
Named_Seen : Boolean;
begin
Named_Seen := False;
Actual := First (Actuals);
while Present (Actual) loop
case Nkind (Actual) is
when N_Parameter_Association =>
if Named_Seen then
Check_SPARK_05_Restriction
("named association cannot follow positional one",
Actual);
exit;
end if;
when others =>
Named_Seen := True;
end case;
Next (Actual);
end loop;
end Check_Mixed_Parameter_And_Named_Associations;
----------------------------
-- Check_Writable_Actuals --
----------------------------
-- The identification of conflicts in calls to functions with writable
-- actuals is performed in the analysis phase of the front end to ensure
-- that it reports exactly the same errors compiling with and without
-- expansion enabled. It is performed in two stages:
-- 1) When a call to a function with out-mode parameters is found,
-- we climb to the outermost enclosing construct that can be
-- evaluated in arbitrary order and we mark it with the flag
-- Check_Actuals.
-- 2) When the analysis of the marked node is complete, we traverse
-- its decorated subtree searching for conflicts (see function
-- Sem_Util.Check_Function_Writable_Actuals).
-- The unique exception to this general rule is for aggregates, since
-- their analysis is performed by the front end in the resolution
-- phase. For aggregates we do not climb to their enclosing construct:
-- we restrict the analysis to the subexpressions initializing the
-- aggregate components.
-- This implies that the analysis of expressions containing aggregates
-- is not complete, since there may be conflicts on writable actuals
-- involving subexpressions of the enclosing logical or arithmetic
-- expressions. However, we cannot wait and perform the analysis when
-- the whole subtree is resolved, since the subtrees may be transformed,
-- thus adding extra complexity and computation cost to identify and
-- report exactly the same errors compiling with and without expansion
-- enabled.
procedure Check_Writable_Actuals (N : Node_Id) is
begin
if Comes_From_Source (N)
and then Present (Get_Subprogram_Entity (N))
and then Has_Out_Or_In_Out_Parameter (Get_Subprogram_Entity (N))
then
-- For procedures and entries there is no need to climb since
-- we only need to check if the actuals of this call invoke
-- functions whose out-mode parameters overlap.
if Nkind (N) /= N_Function_Call then
Set_Check_Actuals (N);
-- For calls to functions we climb to the outermost enclosing
-- construct where the out-mode actuals of this function may
-- introduce conflicts.
else
declare
Outermost : Node_Id;
P : Node_Id := N;
begin
while Present (P) loop
-- For object declarations we can climb to the node from
-- its object definition branch or from its initializing
-- expression. We prefer to mark the child node as the
-- outermost construct to avoid adding further complexity
-- to the routine that will later take care of
-- performing the writable actuals check.
if Has_Arbitrary_Evaluation_Order (Nkind (P))
and then not Nkind_In (P, N_Assignment_Statement,
N_Object_Declaration)
then
Outermost := P;
end if;
-- Avoid climbing more than needed!
exit when Stop_Subtree_Climbing (Nkind (P))
or else (Nkind (P) = N_Range
and then not
Nkind_In (Parent (P), N_In, N_Not_In));
P := Parent (P);
end loop;
Set_Check_Actuals (Outermost);
end;
end if;
end if;
end Check_Writable_Actuals;
---------------------------
-- Name_Denotes_Function --
---------------------------
function Name_Denotes_Function return Boolean is
begin
if Is_Entity_Name (Nam) then
return Ekind (Entity (Nam)) = E_Function;
elsif Nkind (Nam) = N_Selected_Component then
return Ekind (Entity (Selector_Name (Nam))) = E_Function;
else
return False;
end if;
end Name_Denotes_Function;
-----------------------
-- No_Interpretation --
-----------------------
procedure No_Interpretation is
L : constant Boolean := Is_List_Member (N);
K : constant Node_Kind := Nkind (Parent (N));
begin
-- If the node is in a list whose parent is not an expression then it
-- must be an attempted procedure call.
if L and then K not in N_Subexpr then
if Ekind (Entity (Nam)) = E_Generic_Procedure then
Error_Msg_NE
("must instantiate generic procedure& before call",
Nam, Entity (Nam));
else
Error_Msg_N ("procedure or entry name expected", Nam);
end if;
-- Check for tasking cases where only an entry call will do
elsif not L
and then Nkind_In (K, N_Entry_Call_Alternative,
N_Triggering_Alternative)
then
Error_Msg_N ("entry name expected", Nam);
-- Otherwise give general error message
else
Error_Msg_N ("invalid prefix in call", Nam);
end if;
end No_Interpretation;
-- Start of processing for Analyze_Call
begin
if Restriction_Check_Required (SPARK_05) then
Check_Mixed_Parameter_And_Named_Associations;
end if;
-- Initialize the type of the result of the call to the error type,
-- which will be reset if the type is successfully resolved.
Set_Etype (N, Any_Type);
Nam := Name (N);
if not Is_Overloaded (Nam) then
-- Only one interpretation to check
if Ekind (Etype (Nam)) = E_Subprogram_Type then
Nam_Ent := Etype (Nam);
-- If the prefix is an access_to_subprogram, this may be an indirect
-- call. This is the case if the name in the call is not an entity
-- name, or if it is a function name in the context of a procedure
-- call. In this latter case, we have a call to a parameterless
-- function that returns a pointer_to_procedure which is the entity
-- being called. Finally, F (X) may be a call to a parameterless
-- function that returns a pointer to a function with parameters.
-- Note that if F returns an access-to-subprogram whose designated
-- type is an array, F (X) cannot be interpreted as an indirect call
-- through the result of the call to F.
elsif Is_Access_Type (Etype (Nam))
and then Ekind (Designated_Type (Etype (Nam))) = E_Subprogram_Type
and then
(not Name_Denotes_Function
or else Nkind (N) = N_Procedure_Call_Statement
or else
(Nkind (Parent (N)) /= N_Explicit_Dereference
and then Is_Entity_Name (Nam)
and then No (First_Formal (Entity (Nam)))
and then not
Is_Array_Type (Etype (Designated_Type (Etype (Nam))))
and then Present (Actuals)))
then
Nam_Ent := Designated_Type (Etype (Nam));
Insert_Explicit_Dereference (Nam);
-- Selected component case. Simple entry or protected operation,
-- where the entry name is given by the selector name.
elsif Nkind (Nam) = N_Selected_Component then
Nam_Ent := Entity (Selector_Name (Nam));
if not Ekind_In (Nam_Ent, E_Entry,
E_Entry_Family,
E_Function,
E_Procedure)
then
Error_Msg_N ("name in call is not a callable entity", Nam);
Set_Etype (N, Any_Type);
return;
end if;
-- If the name is an Indexed component, it can be a call to a member
-- of an entry family. The prefix must be a selected component whose
-- selector is the entry. Analyze_Procedure_Call normalizes several
-- kinds of call into this form.
elsif Nkind (Nam) = N_Indexed_Component then
if Nkind (Prefix (Nam)) = N_Selected_Component then
Nam_Ent := Entity (Selector_Name (Prefix (Nam)));
else
Error_Msg_N ("name in call is not a callable entity", Nam);
Set_Etype (N, Any_Type);
return;
end if;
elsif not Is_Entity_Name (Nam) then
Error_Msg_N ("name in call is not a callable entity", Nam);
Set_Etype (N, Any_Type);
return;
else
Nam_Ent := Entity (Nam);
-- If not overloadable, this may be a generalized indexing
-- operation with named associations. Rewrite again as an
-- indexed component and analyze as container indexing.
if not Is_Overloadable (Nam_Ent) then
if Present
(Find_Value_Of_Aspect
(Etype (Nam_Ent), Aspect_Constant_Indexing))
then
Replace (N,
Make_Indexed_Component (Sloc (N),
Prefix => Nam,
Expressions => Parameter_Associations (N)));
if Try_Container_Indexing (N, Nam, Expressions (N)) then
return;
else
No_Interpretation;
end if;
else
No_Interpretation;
end if;
return;
end if;
end if;
-- Operations generated for RACW stub types are called only through
-- dispatching, and can never be the static interpretation of a call.
if Is_RACW_Stub_Type_Operation (Nam_Ent) then
No_Interpretation;
return;
end if;
Analyze_One_Call (N, Nam_Ent, True, Success);
-- If this is an indirect call, the return type of the access_to
-- subprogram may be an incomplete type. At the point of the call,
-- use the full type if available, and at the same time update the
-- return type of the access_to_subprogram.
if Success
and then Nkind (Nam) = N_Explicit_Dereference
and then Ekind (Etype (N)) = E_Incomplete_Type
and then Present (Full_View (Etype (N)))
then
Set_Etype (N, Full_View (Etype (N)));
Set_Etype (Nam_Ent, Etype (N));
end if;
-- Overloaded call
else
-- An overloaded selected component must denote overloaded operations
-- of a concurrent type. The interpretations are attached to the
-- simple name of those operations.
if Nkind (Nam) = N_Selected_Component then
Nam := Selector_Name (Nam);
end if;
Get_First_Interp (Nam, X, It);
while Present (It.Nam) loop
Nam_Ent := It.Nam;
Deref := False;
-- Name may be call that returns an access to subprogram, or more
-- generally an overloaded expression one of whose interpretations
-- yields an access to subprogram. If the name is an entity, we do
-- not dereference, because the node is a call that returns the
-- access type: note difference between f(x), where the call may
-- return an access subprogram type, and f(x)(y), where the type
-- returned by the call to f is implicitly dereferenced to analyze
-- the outer call.
if Is_Access_Type (Nam_Ent) then
Nam_Ent := Designated_Type (Nam_Ent);
elsif Is_Access_Type (Etype (Nam_Ent))
and then
(not Is_Entity_Name (Nam)
or else Nkind (N) = N_Procedure_Call_Statement)
and then Ekind (Designated_Type (Etype (Nam_Ent)))
= E_Subprogram_Type
then
Nam_Ent := Designated_Type (Etype (Nam_Ent));
if Is_Entity_Name (Nam) then
Deref := True;
end if;
end if;
-- If the call has been rewritten from a prefixed call, the first
-- parameter has been analyzed, but may need a subsequent
-- dereference, so skip its analysis now.
if N /= Original_Node (N)
and then Nkind (Original_Node (N)) = Nkind (N)
and then Nkind (Name (N)) /= Nkind (Name (Original_Node (N)))
and then Present (Parameter_Associations (N))
and then Present (Etype (First (Parameter_Associations (N))))
then
Analyze_One_Call
(N, Nam_Ent, False, Success, Skip_First => True);
else
Analyze_One_Call (N, Nam_Ent, False, Success);
end if;
-- If the interpretation succeeds, mark the proper type of the
-- prefix (any valid candidate will do). If not, remove the
-- candidate interpretation. If this is a parameterless call
-- on an anonymous access to subprogram, X is a variable with
-- an access discriminant D, the entity in the interpretation is
-- D, so rewrite X as X.D.all.
if Success then
if Deref
and then Nkind (Parent (N)) /= N_Explicit_Dereference
then
if Ekind (It.Nam) = E_Discriminant
and then Has_Implicit_Dereference (It.Nam)
then
Rewrite (Name (N),
Make_Explicit_Dereference (Loc,
Prefix =>
Make_Selected_Component (Loc,
Prefix =>
New_Occurrence_Of (Entity (Nam), Loc),
Selector_Name =>
New_Occurrence_Of (It.Nam, Loc))));
Analyze (N);
return;
else
Set_Entity (Nam, It.Nam);
Insert_Explicit_Dereference (Nam);
Set_Etype (Nam, Nam_Ent);
end if;
else
Set_Etype (Nam, It.Typ);
end if;
elsif Nkind_In (Name (N), N_Function_Call, N_Selected_Component)
then
Remove_Interp (X);
end if;
Get_Next_Interp (X, It);
end loop;
-- If the name is the result of a function call, it can only be a
-- call to a function returning an access to subprogram. Insert
-- explicit dereference.
if Nkind (Nam) = N_Function_Call then
Insert_Explicit_Dereference (Nam);
end if;
if Etype (N) = Any_Type then
-- None of the interpretations is compatible with the actuals
Diagnose_Call (N, Nam);
-- Special checks for uninstantiated put routines
if Nkind (N) = N_Procedure_Call_Statement
and then Is_Entity_Name (Nam)
and then Chars (Nam) = Name_Put
and then List_Length (Actuals) = 1
then
declare
Arg : constant Node_Id := First (Actuals);
Typ : Entity_Id;
begin
if Nkind (Arg) = N_Parameter_Association then
Typ := Etype (Explicit_Actual_Parameter (Arg));
else
Typ := Etype (Arg);
end if;
if Is_Signed_Integer_Type (Typ) then
Error_Msg_N
("possible missing instantiation of "
& "'Text_'I'O.'Integer_'I'O!", Nam);
elsif Is_Modular_Integer_Type (Typ) then
Error_Msg_N
("possible missing instantiation of "
& "'Text_'I'O.'Modular_'I'O!", Nam);
elsif Is_Floating_Point_Type (Typ) then
Error_Msg_N
("possible missing instantiation of "
& "'Text_'I'O.'Float_'I'O!", Nam);
elsif Is_Ordinary_Fixed_Point_Type (Typ) then
Error_Msg_N
("possible missing instantiation of "
& "'Text_'I'O.'Fixed_'I'O!", Nam);
elsif Is_Decimal_Fixed_Point_Type (Typ) then
Error_Msg_N
("possible missing instantiation of "
& "'Text_'I'O.'Decimal_'I'O!", Nam);
elsif Is_Enumeration_Type (Typ) then
Error_Msg_N
("possible missing instantiation of "
& "'Text_'I'O.'Enumeration_'I'O!", Nam);
end if;
end;
end if;
elsif not Is_Overloaded (N)
and then Is_Entity_Name (Nam)
then
-- Resolution yields a single interpretation. Verify that the
-- reference has capitalization consistent with the declaration.
Set_Entity_With_Checks (Nam, Entity (Nam));
Generate_Reference (Entity (Nam), Nam);
Set_Etype (Nam, Etype (Entity (Nam)));
else
Remove_Abstract_Operations (N);
end if;
End_Interp_List;
end if;
if Ada_Version >= Ada_2012 then
-- Check if the call contains a function with writable actuals
Check_Writable_Actuals (N);
-- If found and the outermost construct that can be evaluated in
-- an arbitrary order is precisely this call, then check all its
-- actuals.
Check_Function_Writable_Actuals (N);
end if;
end Analyze_Call;
-----------------------------
-- Analyze_Case_Expression --
-----------------------------
procedure Analyze_Case_Expression (N : Node_Id) is
procedure Non_Static_Choice_Error (Choice : Node_Id);
-- Error routine invoked by the generic instantiation below when
-- the case expression has a non static choice.
package Case_Choices_Analysis is new
Generic_Analyze_Choices
(Process_Associated_Node => No_OP);
use Case_Choices_Analysis;
package Case_Choices_Checking is new
Generic_Check_Choices
(Process_Empty_Choice => No_OP,
Process_Non_Static_Choice => Non_Static_Choice_Error,
Process_Associated_Node => No_OP);
use Case_Choices_Checking;
-----------------------------
-- Non_Static_Choice_Error --
-----------------------------
procedure Non_Static_Choice_Error (Choice : Node_Id) is
begin
Flag_Non_Static_Expr
("choice given in case expression is not static!", Choice);
end Non_Static_Choice_Error;
-- Local variables
Expr : constant Node_Id := Expression (N);
Alt : Node_Id;
Exp_Type : Entity_Id;
Exp_Btype : Entity_Id;
FirstX : Node_Id := Empty;
-- First expression in the case for which there is some type information
-- available, i.e. it is not Any_Type, which can happen because of some
-- error, or from the use of e.g. raise Constraint_Error.
Others_Present : Boolean;
-- Indicates if Others was present
Wrong_Alt : Node_Id := Empty;
-- For error reporting
-- Start of processing for Analyze_Case_Expression
begin
if Comes_From_Source (N) then
Check_Compiler_Unit ("case expression", N);
end if;
Analyze_And_Resolve (Expr, Any_Discrete);
Check_Unset_Reference (Expr);
Exp_Type := Etype (Expr);
Exp_Btype := Base_Type (Exp_Type);
Alt := First (Alternatives (N));
while Present (Alt) loop
Analyze (Expression (Alt));
if No (FirstX) and then Etype (Expression (Alt)) /= Any_Type then
FirstX := Expression (Alt);
end if;
Next (Alt);
end loop;
-- Get our initial type from the first expression for which we got some
-- useful type information from the expression.
if not Is_Overloaded (FirstX) then
Set_Etype (N, Etype (FirstX));
else
declare
I : Interp_Index;
It : Interp;
begin
Set_Etype (N, Any_Type);
Get_First_Interp (FirstX, I, It);
while Present (It.Nam) loop
-- For each interpretation of the first expression, we only
-- add the interpretation if every other expression in the
-- case expression alternatives has a compatible type.
Alt := Next (First (Alternatives (N)));
while Present (Alt) loop
exit when not Has_Compatible_Type (Expression (Alt), It.Typ);
Next (Alt);
end loop;
if No (Alt) then
Add_One_Interp (N, It.Typ, It.Typ);
else
Wrong_Alt := Alt;
end if;
Get_Next_Interp (I, It);
end loop;
end;
end if;
Exp_Btype := Base_Type (Exp_Type);
-- The expression must be of a discrete type which must be determinable
-- independently of the context in which the expression occurs, but
-- using the fact that the expression must be of a discrete type.
-- Moreover, the type this expression must not be a character literal
-- (which is always ambiguous).
-- If error already reported by Resolve, nothing more to do
if Exp_Btype = Any_Discrete or else Exp_Btype = Any_Type then
return;
-- Special casee message for character literal
elsif Exp_Btype = Any_Character then
Error_Msg_N
("character literal as case expression is ambiguous", Expr);
return;
end if;
if Etype (N) = Any_Type and then Present (Wrong_Alt) then
Error_Msg_N
("type incompatible with that of previous alternatives",
Expression (Wrong_Alt));
return;
end if;
-- If the case expression is a formal object of mode in out, then
-- treat it as having a nonstatic subtype by forcing use of the base
-- type (which has to get passed to Check_Case_Choices below). Also
-- use base type when the case expression is parenthesized.
if Paren_Count (Expr) > 0
or else (Is_Entity_Name (Expr)
and then Ekind (Entity (Expr)) = E_Generic_In_Out_Parameter)
then
Exp_Type := Exp_Btype;
end if;
-- The case expression alternatives cover the range of a static subtype
-- subject to aspect Static_Predicate. Do not check the choices when the
-- case expression has not been fully analyzed yet because this may lead
-- to bogus errors.
if Is_OK_Static_Subtype (Exp_Type)
and then Has_Static_Predicate_Aspect (Exp_Type)
and then In_Spec_Expression
then
null;
-- Call Analyze_Choices and Check_Choices to do the rest of the work
else
Analyze_Choices (Alternatives (N), Exp_Type);
Check_Choices (N, Alternatives (N), Exp_Type, Others_Present);
end if;
if Exp_Type = Universal_Integer and then not Others_Present then
Error_Msg_N
("case on universal integer requires OTHERS choice", Expr);
end if;
end Analyze_Case_Expression;
---------------------------
-- Analyze_Comparison_Op --
---------------------------
procedure Analyze_Comparison_Op (N : Node_Id) is
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
Op_Id : Entity_Id := Entity (N);
begin
Set_Etype (N, Any_Type);
Candidate_Type := Empty;
Analyze_Expression (L);
Analyze_Expression (R);
if Present (Op_Id) then
if Ekind (Op_Id) = E_Operator then
Find_Comparison_Types (L, R, Op_Id, N);
else
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
if Is_Overloaded (L) then
Set_Etype (L, Intersect_Types (L, R));
end if;
else
Op_Id := Get_Name_Entity_Id (Chars (N));
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator then
Find_Comparison_Types (L, R, Op_Id, N);
else
Analyze_User_Defined_Binary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
end if;
Operator_Check (N);
Check_Function_Writable_Actuals (N);
end Analyze_Comparison_Op;
---------------------------
-- Analyze_Concatenation --
---------------------------
procedure Analyze_Concatenation (N : Node_Id) is
-- We wish to avoid deep recursion, because concatenations are often
-- deeply nested, as in A&B&...&Z. Therefore, we walk down the left
-- operands nonrecursively until we find something that is not a
-- concatenation (A in this case), or has already been analyzed. We
-- analyze that, and then walk back up the tree following Parent
-- pointers, calling Analyze_Concatenation_Rest to do the rest of the
-- work at each level. The Parent pointers allow us to avoid recursion,
-- and thus avoid running out of memory.
NN : Node_Id := N;
L : Node_Id;
begin
Candidate_Type := Empty;
-- The following code is equivalent to:
-- Set_Etype (N, Any_Type);
-- Analyze_Expression (Left_Opnd (N));
-- Analyze_Concatenation_Rest (N);
-- where the Analyze_Expression call recurses back here if the left
-- operand is a concatenation.
-- Walk down left operands
loop
Set_Etype (NN, Any_Type);
L := Left_Opnd (NN);
exit when Nkind (L) /= N_Op_Concat or else Analyzed (L);
NN := L;
end loop;
-- Now (given the above example) NN is A&B and L is A
-- First analyze L ...
Analyze_Expression (L);
-- ... then walk NN back up until we reach N (where we started), calling
-- Analyze_Concatenation_Rest along the way.
loop
Analyze_Concatenation_Rest (NN);
exit when NN = N;
NN := Parent (NN);
end loop;
end Analyze_Concatenation;
--------------------------------
-- Analyze_Concatenation_Rest --
--------------------------------
-- If the only one-dimensional array type in scope is String,
-- this is the resulting type of the operation. Otherwise there
-- will be a concatenation operation defined for each user-defined
-- one-dimensional array.
procedure Analyze_Concatenation_Rest (N : Node_Id) is
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
Op_Id : Entity_Id := Entity (N);
LT : Entity_Id;
RT : Entity_Id;
begin
Analyze_Expression (R);
-- If the entity is present, the node appears in an instance, and
-- denotes a predefined concatenation operation. The resulting type is
-- obtained from the arguments when possible. If the arguments are
-- aggregates, the array type and the concatenation type must be
-- visible.
if Present (Op_Id) then
if Ekind (Op_Id) = E_Operator then
LT := Base_Type (Etype (L));
RT := Base_Type (Etype (R));
if Is_Array_Type (LT)
and then (RT = LT or else RT = Base_Type (Component_Type (LT)))
then
Add_One_Interp (N, Op_Id, LT);
elsif Is_Array_Type (RT)
and then LT = Base_Type (Component_Type (RT))
then
Add_One_Interp (N, Op_Id, RT);
-- If one operand is a string type or a user-defined array type,
-- and the other is a literal, result is of the specific type.
elsif
(Root_Type (LT) = Standard_String
or else Scope (LT) /= Standard_Standard)
and then Etype (R) = Any_String
then
Add_One_Interp (N, Op_Id, LT);
elsif
(Root_Type (RT) = Standard_String
or else Scope (RT) /= Standard_Standard)
and then Etype (L) = Any_String
then
Add_One_Interp (N, Op_Id, RT);
elsif not Is_Generic_Type (Etype (Op_Id)) then
Add_One_Interp (N, Op_Id, Etype (Op_Id));
else
-- Type and its operations must be visible
Set_Entity (N, Empty);
Analyze_Concatenation (N);
end if;
else
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
else
Op_Id := Get_Name_Entity_Id (Name_Op_Concat);
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator then
-- Do not consider operators declared in dead code, they can
-- not be part of the resolution.
if Is_Eliminated (Op_Id) then
null;
else
Find_Concatenation_Types (L, R, Op_Id, N);
end if;
else
Analyze_User_Defined_Binary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
end if;
Operator_Check (N);
end Analyze_Concatenation_Rest;
-------------------------
-- Analyze_Equality_Op --
-------------------------
procedure Analyze_Equality_Op (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
Op_Id : Entity_Id;
begin
Set_Etype (N, Any_Type);
Candidate_Type := Empty;
Analyze_Expression (L);
Analyze_Expression (R);
-- If the entity is set, the node is a generic instance with a non-local
-- reference to the predefined operator or to a user-defined function.
-- It can also be an inequality that is expanded into the negation of a
-- call to a user-defined equality operator.
-- For the predefined case, the result is Boolean, regardless of the
-- type of the operands. The operands may even be limited, if they are
-- generic actuals. If they are overloaded, label the left argument with
-- the common type that must be present, or with the type of the formal
-- of the user-defined function.
if Present (Entity (N)) then
Op_Id := Entity (N);
if Ekind (Op_Id) = E_Operator then
Add_One_Interp (N, Op_Id, Standard_Boolean);
else
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
if Is_Overloaded (L) then
if Ekind (Op_Id) = E_Operator then
Set_Etype (L, Intersect_Types (L, R));
else
Set_Etype (L, Etype (First_Formal (Op_Id)));
end if;
end if;
else
Op_Id := Get_Name_Entity_Id (Chars (N));
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator then
Find_Equality_Types (L, R, Op_Id, N);
else
Analyze_User_Defined_Binary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
end if;
-- If there was no match, and the operator is inequality, this may be
-- a case where inequality has not been made explicit, as for tagged
-- types. Analyze the node as the negation of an equality operation.
-- This cannot be done earlier, because before analysis we cannot rule
-- out the presence of an explicit inequality.
if Etype (N) = Any_Type
and then Nkind (N) = N_Op_Ne
then
Op_Id := Get_Name_Entity_Id (Name_Op_Eq);
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator then
Find_Equality_Types (L, R, Op_Id, N);
else
Analyze_User_Defined_Binary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
if Etype (N) /= Any_Type then
Op_Id := Entity (N);
Rewrite (N,
Make_Op_Not (Loc,
Right_Opnd =>
Make_Op_Eq (Loc,
Left_Opnd => Left_Opnd (N),
Right_Opnd => Right_Opnd (N))));
Set_Entity (Right_Opnd (N), Op_Id);
Analyze (N);
end if;
end if;
Operator_Check (N);
Check_Function_Writable_Actuals (N);
end Analyze_Equality_Op;
----------------------------------
-- Analyze_Explicit_Dereference --
----------------------------------
procedure Analyze_Explicit_Dereference (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
P : constant Node_Id := Prefix (N);
T : Entity_Id;
I : Interp_Index;
It : Interp;
New_N : Node_Id;
function Is_Function_Type return Boolean;
-- Check whether node may be interpreted as an implicit function call
----------------------
-- Is_Function_Type --
----------------------
function Is_Function_Type return Boolean is
I : Interp_Index;
It : Interp;
begin
if not Is_Overloaded (N) then
return Ekind (Base_Type (Etype (N))) = E_Subprogram_Type
and then Etype (Base_Type (Etype (N))) /= Standard_Void_Type;
else
Get_First_Interp (N, I, It);
while Present (It.Nam) loop
if Ekind (Base_Type (It.Typ)) /= E_Subprogram_Type
or else Etype (Base_Type (It.Typ)) = Standard_Void_Type
then
return False;
end if;
Get_Next_Interp (I, It);
end loop;
return True;
end if;
end Is_Function_Type;
-- Start of processing for Analyze_Explicit_Dereference
begin
-- If source node, check SPARK restriction. We guard this with the
-- source node check, because ???
if Comes_From_Source (N) then
Check_SPARK_05_Restriction ("explicit dereference is not allowed", N);
end if;
-- In formal verification mode, keep track of all reads and writes
-- through explicit dereferences.
if GNATprove_Mode then
SPARK_Specific.Generate_Dereference (N);
end if;
Analyze (P);
Set_Etype (N, Any_Type);
-- Test for remote access to subprogram type, and if so return
-- after rewriting the original tree.
if Remote_AST_E_Dereference (P) then
return;
end if;
-- Normal processing for other than remote access to subprogram type
if not Is_Overloaded (P) then
if Is_Access_Type (Etype (P)) then
-- Set the Etype. We need to go through Is_For_Access_Subtypes to
-- avoid other problems caused by the Private_Subtype and it is
-- safe to go to the Base_Type because this is the same as
-- converting the access value to its Base_Type.
declare
DT : Entity_Id := Designated_Type (Etype (P));
begin
if Ekind (DT) = E_Private_Subtype
and then Is_For_Access_Subtype (DT)
then
DT := Base_Type (DT);
end if;
-- An explicit dereference is a legal occurrence of an
-- incomplete type imported through a limited_with clause, if
-- the full view is visible, or if we are within an instance
-- body, where the enclosing body has a regular with_clause
-- on the unit.
if From_Limited_With (DT)
and then not From_Limited_With (Scope (DT))
and then
(Is_Immediately_Visible (Scope (DT))
or else
(Is_Child_Unit (Scope (DT))
and then Is_Visible_Lib_Unit (Scope (DT)))
or else In_Instance_Body)
then
Set_Etype (N, Available_View (DT));
else
Set_Etype (N, DT);
end if;
end;
elsif Etype (P) /= Any_Type then
Error_Msg_N ("prefix of dereference must be an access type", N);
return;
end if;
else
Get_First_Interp (P, I, It);
while Present (It.Nam) loop
T := It.Typ;
if Is_Access_Type (T) then
Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
end if;
Get_Next_Interp (I, It);
end loop;
-- Error if no interpretation of the prefix has an access type
if Etype (N) = Any_Type then
Error_Msg_N
("access type required in prefix of explicit dereference", P);
Set_Etype (N, Any_Type);
return;
end if;
end if;
if Is_Function_Type
and then Nkind (Parent (N)) /= N_Indexed_Component
and then (Nkind (Parent (N)) /= N_Function_Call
or else N /= Name (Parent (N)))
and then (Nkind (Parent (N)) /= N_Procedure_Call_Statement
or else N /= Name (Parent (N)))
and then Nkind (Parent (N)) /= N_Subprogram_Renaming_Declaration
and then (Nkind (Parent (N)) /= N_Attribute_Reference
or else
(Attribute_Name (Parent (N)) /= Name_Address
and then
Attribute_Name (Parent (N)) /= Name_Access))
then
-- Name is a function call with no actuals, in a context that
-- requires deproceduring (including as an actual in an enclosing
-- function or procedure call). There are some pathological cases
-- where the prefix might include functions that return access to
-- subprograms and others that return a regular type. Disambiguation
-- of those has to take place in Resolve.
New_N :=
Make_Function_Call (Loc,
Name => Make_Explicit_Dereference (Loc, P),
Parameter_Associations => New_List);
-- If the prefix is overloaded, remove operations that have formals,
-- we know that this is a parameterless call.
if Is_Overloaded (P) then
Get_First_Interp (P, I, It);
while Present (It.Nam) loop
T := It.Typ;
if No (First_Formal (Base_Type (Designated_Type (T)))) then
Set_Etype (P, T);
else
Remove_Interp (I);
end if;
Get_Next_Interp (I, It);
end loop;
end if;
Rewrite (N, New_N);
Analyze (N);
elsif not Is_Function_Type
and then Is_Overloaded (N)
then
-- The prefix may include access to subprograms and other access
-- types. If the context selects the interpretation that is a
-- function call (not a procedure call) we cannot rewrite the node
-- yet, but we include the result of the call interpretation.
Get_First_Interp (N, I, It);
while Present (It.Nam) loop
if Ekind (Base_Type (It.Typ)) = E_Subprogram_Type
and then Etype (Base_Type (It.Typ)) /= Standard_Void_Type
and then Nkind (Parent (N)) /= N_Procedure_Call_Statement
then
Add_One_Interp (N, Etype (It.Typ), Etype (It.Typ));
end if;
Get_Next_Interp (I, It);
end loop;
end if;
-- A value of remote access-to-class-wide must not be dereferenced
-- (RM E.2.2(16)).
Validate_Remote_Access_To_Class_Wide_Type (N);
end Analyze_Explicit_Dereference;
------------------------
-- Analyze_Expression --
------------------------
procedure Analyze_Expression (N : Node_Id) is
begin
-- If the expression is an indexed component that will be rewritten
-- as a container indexing, it has already been analyzed.
if Nkind (N) = N_Indexed_Component
and then Present (Generalized_Indexing (N))
then
null;
else
Analyze (N);
Check_Parameterless_Call (N);
end if;
end Analyze_Expression;
-------------------------------------
-- Analyze_Expression_With_Actions --
-------------------------------------
procedure Analyze_Expression_With_Actions (N : Node_Id) is
A : Node_Id;
begin
A := First (Actions (N));
while Present (A) loop
Analyze (A);
Next (A);
end loop;
Analyze_Expression (Expression (N));
Set_Etype (N, Etype (Expression (N)));
end Analyze_Expression_With_Actions;
---------------------------
-- Analyze_If_Expression --
---------------------------
procedure Analyze_If_Expression (N : Node_Id) is
Condition : constant Node_Id := First (Expressions (N));
Then_Expr : constant Node_Id := Next (Condition);
Else_Expr : Node_Id;
begin
-- Defend against error of missing expressions from previous error
if No (Then_Expr) then
Check_Error_Detected;
return;
end if;
if Comes_From_Source (N) then
Check_SPARK_05_Restriction ("if expression is not allowed", N);
end if;
Else_Expr := Next (Then_Expr);
if Comes_From_Source (N) then
Check_Compiler_Unit ("if expression", N);
end if;
-- Analyze and resolve the condition. We need to resolve this now so
-- that it gets folded to True/False if possible, before we analyze
-- the THEN/ELSE branches, because when analyzing these branches, we
-- may call Is_Statically_Unevaluated, which expects the condition of
-- an enclosing IF to have been analyze/resolved/evaluated.
Analyze_Expression (Condition);
Resolve (Condition, Any_Boolean);
-- Analyze THEN expression and (if present) ELSE expression. For those
-- we delay resolution in the normal manner, because of overloading etc.
Analyze_Expression (Then_Expr);
if Present (Else_Expr) then
Analyze_Expression (Else_Expr);
end if;
-- If then expression not overloaded, then that decides the type
if not Is_Overloaded (Then_Expr) then
Set_Etype (N, Etype (Then_Expr));
-- Case where then expression is overloaded
else
declare
I : Interp_Index;
It : Interp;
begin
Set_Etype (N, Any_Type);
-- Loop through interpretations of Then_Expr
Get_First_Interp (Then_Expr, I, It);
while Present (It.Nam) loop
-- Add possible interpretation of Then_Expr if no Else_Expr, or
-- Else_Expr is present and has a compatible type.
if No (Else_Expr)
or else Has_Compatible_Type (Else_Expr, It.Typ)
then
Add_One_Interp (N, It.Typ, It.Typ);
end if;
Get_Next_Interp (I, It);
end loop;
-- If no valid interpretation has been found, then the type of the
-- ELSE expression does not match any interpretation of the THEN
-- expression.
if Etype (N) = Any_Type then
Error_Msg_N
("type incompatible with that of `THEN` expression",
Else_Expr);
return;
end if;
end;
end if;
end Analyze_If_Expression;
------------------------------------
-- Analyze_Indexed_Component_Form --
------------------------------------
procedure Analyze_Indexed_Component_Form (N : Node_Id) is
P : constant Node_Id := Prefix (N);
Exprs : constant List_Id := Expressions (N);
Exp : Node_Id;
P_T : Entity_Id;
E : Node_Id;
U_N : Entity_Id;
procedure Process_Function_Call;
-- Prefix in indexed component form is an overloadable entity, so the
-- node is a function call. Reformat it as such.
procedure Process_Indexed_Component;
-- Prefix in indexed component form is actually an indexed component.
-- This routine processes it, knowing that the prefix is already
-- resolved.
procedure Process_Indexed_Component_Or_Slice;
-- An indexed component with a single index may designate a slice if
-- the index is a subtype mark. This routine disambiguates these two
-- cases by resolving the prefix to see if it is a subtype mark.
procedure Process_Overloaded_Indexed_Component;
-- If the prefix of an indexed component is overloaded, the proper
-- interpretation is selected by the index types and the context.
---------------------------
-- Process_Function_Call --
---------------------------
procedure Process_Function_Call is
Loc : constant Source_Ptr := Sloc (N);
Actual : Node_Id;
begin
Change_Node (N, N_Function_Call);
Set_Name (N, P);
Set_Parameter_Associations (N, Exprs);
-- Analyze actuals prior to analyzing the call itself
Actual := First (Parameter_Associations (N));
while Present (Actual) loop
Analyze (Actual);
Check_Parameterless_Call (Actual);
-- Move to next actual. Note that we use Next, not Next_Actual
-- here. The reason for this is a bit subtle. If a function call
-- includes named associations, the parser recognizes the node
-- as a call, and it is analyzed as such. If all associations are
-- positional, the parser builds an indexed_component node, and
-- it is only after analysis of the prefix that the construct
-- is recognized as a call, in which case Process_Function_Call
-- rewrites the node and analyzes the actuals. If the list of
-- actuals is malformed, the parser may leave the node as an
-- indexed component (despite the presence of named associations).
-- The iterator Next_Actual is equivalent to Next if the list is
-- positional, but follows the normalized chain of actuals when
-- named associations are present. In this case normalization has
-- not taken place, and actuals remain unanalyzed, which leads to
-- subsequent crashes or loops if there is an attempt to continue
-- analysis of the program.
-- IF there is a single actual and it is a type name, the node
-- can only be interpreted as a slice of a parameterless call.
-- Rebuild the node as such and analyze.
if No (Next (Actual))
and then Is_Entity_Name (Actual)
and then Is_Type (Entity (Actual))
and then Is_Discrete_Type (Entity (Actual))
then
Replace (N,
Make_Slice (Loc,
Prefix => P,
Discrete_Range =>
New_Occurrence_Of (Entity (Actual), Loc)));
Analyze (N);
return;
else
Next (Actual);
end if;
end loop;
Analyze_Call (N);
end Process_Function_Call;
-------------------------------
-- Process_Indexed_Component --
-------------------------------
procedure Process_Indexed_Component is
Exp : Node_Id;
Array_Type : Entity_Id;
Index : Node_Id;
Pent : Entity_Id := Empty;
begin
Exp := First (Exprs);
if Is_Overloaded (P) then
Process_Overloaded_Indexed_Component;
else
Array_Type := Etype (P);
if Is_Entity_Name (P) then
Pent := Entity (P);
elsif Nkind (P) = N_Selected_Component
and then Is_Entity_Name (Selector_Name (P))
then
Pent := Entity (Selector_Name (P));
end if;
-- Prefix must be appropriate for an array type, taking into
-- account a possible implicit dereference.
if Is_Access_Type (Array_Type) then
Error_Msg_NW
(Warn_On_Dereference, "?d?implicit dereference", N);
Array_Type := Process_Implicit_Dereference_Prefix (Pent, P);
end if;
if Is_Array_Type (Array_Type) then
-- In order to correctly access First_Index component later,
-- replace string literal subtype by its parent type.
if Ekind (Array_Type) = E_String_Literal_Subtype then
Array_Type := Etype (Array_Type);
end if;
elsif Present (Pent) and then Ekind (Pent) = E_Entry_Family then
Analyze (Exp);
Set_Etype (N, Any_Type);
if not Has_Compatible_Type (Exp, Entry_Index_Type (Pent)) then
Error_Msg_N ("invalid index type in entry name", N);
elsif Present (Next (Exp)) then
Error_Msg_N ("too many subscripts in entry reference", N);
else
Set_Etype (N, Etype (P));
end if;
return;
elsif Is_Record_Type (Array_Type)
and then Remote_AST_I_Dereference (P)
then
return;
elsif Try_Container_Indexing (N, P, Exprs) then
return;
elsif Array_Type = Any_Type then
Set_Etype (N, Any_Type);
-- In most cases the analysis of the prefix will have emitted
-- an error already, but if the prefix may be interpreted as a
-- call in prefixed notation, the report is left to the caller.
-- To prevent cascaded errors, report only if no previous ones.
if Serious_Errors_Detected = 0 then
Error_Msg_N ("invalid prefix in indexed component", P);
if Nkind (P) = N_Expanded_Name then
Error_Msg_NE ("\& is not visible", P, Selector_Name (P));
end if;
end if;
return;
-- Here we definitely have a bad indexing
else
if Nkind (Parent (N)) = N_Requeue_Statement
and then Present (Pent) and then Ekind (Pent) = E_Entry
then
Error_Msg_N
("REQUEUE does not permit parameters", First (Exprs));
elsif Is_Entity_Name (P)
and then Etype (P) = Standard_Void_Type
then
Error_Msg_NE ("incorrect use of &", P, Entity (P));
else
Error_Msg_N ("array type required in indexed component", P);
end if;
Set_Etype (N, Any_Type);
return;
end if;
Index := First_Index (Array_Type);
while Present (Index) and then Present (Exp) loop
if not Has_Compatible_Type (Exp, Etype (Index)) then
Wrong_Type (Exp, Etype (Index));
Set_Etype (N, Any_Type);
return;
end if;
Next_Index (Index);
Next (Exp);
end loop;
Set_Etype (N, Component_Type (Array_Type));
Check_Implicit_Dereference (N, Etype (N));
if Present (Index) then
Error_Msg_N
("too few subscripts in array reference", First (Exprs));
elsif Present (Exp) then
Error_Msg_N ("too many subscripts in array reference", Exp);
end if;
end if;
end Process_Indexed_Component;
----------------------------------------
-- Process_Indexed_Component_Or_Slice --
----------------------------------------
procedure Process_Indexed_Component_Or_Slice is
begin
Exp := First (Exprs);
while Present (Exp) loop
Analyze_Expression (Exp);
Next (Exp);
end loop;
Exp := First (Exprs);
-- If one index is present, and it is a subtype name, then the node
-- denotes a slice (note that the case of an explicit range for a
-- slice was already built as an N_Slice node in the first place,
-- so that case is not handled here).
-- We use a replace rather than a rewrite here because this is one
-- of the cases in which the tree built by the parser is plain wrong.
if No (Next (Exp))
and then Is_Entity_Name (Exp)
and then Is_Type (Entity (Exp))
then
Replace (N,
Make_Slice (Sloc (N),
Prefix => P,
Discrete_Range => New_Copy (Exp)));
Analyze (N);
-- Otherwise (more than one index present, or single index is not
-- a subtype name), then we have the indexed component case.
else
Process_Indexed_Component;
end if;
end Process_Indexed_Component_Or_Slice;
------------------------------------------
-- Process_Overloaded_Indexed_Component --
------------------------------------------
procedure Process_Overloaded_Indexed_Component is
Exp : Node_Id;
I : Interp_Index;
It : Interp;
Typ : Entity_Id;
Index : Node_Id;
Found : Boolean;
begin
Set_Etype (N, Any_Type);
Get_First_Interp (P, I, It);
while Present (It.Nam) loop
Typ := It.Typ;
if Is_Access_Type (Typ) then
Typ := Designated_Type (Typ);
Error_Msg_NW
(Warn_On_Dereference, "?d?implicit dereference", N);
end if;
if Is_Array_Type (Typ) then
-- Got a candidate: verify that index types are compatible
Index := First_Index (Typ);
Found := True;
Exp := First (Exprs);
while Present (Index) and then Present (Exp) loop
if Has_Compatible_Type (Exp, Etype (Index)) then
null;
else
Found := False;
Remove_Interp (I);
exit;
end if;
Next_Index (Index);
Next (Exp);
end loop;
if Found and then No (Index) and then No (Exp) then
declare
CT : constant Entity_Id :=
Base_Type (Component_Type (Typ));
begin
Add_One_Interp (N, CT, CT);
Check_Implicit_Dereference (N, CT);
end;
end if;
elsif Try_Container_Indexing (N, P, Exprs) then
return;
end if;
Get_Next_Interp (I, It);
end loop;
if Etype (N) = Any_Type then
Error_Msg_N ("no legal interpretation for indexed component", N);
Set_Is_Overloaded (N, False);
end if;
End_Interp_List;
end Process_Overloaded_Indexed_Component;
-- Start of processing for Analyze_Indexed_Component_Form
begin
-- Get name of array, function or type
Analyze (P);
-- If P is an explicit dereference whose prefix is of a remote access-
-- to-subprogram type, then N has already been rewritten as a subprogram
-- call and analyzed.
if Nkind (N) in N_Subprogram_Call then
return;
-- When the prefix is attribute 'Loop_Entry and the sole expression of
-- the indexed component denotes a loop name, the indexed form is turned
-- into an attribute reference.
elsif Nkind (N) = N_Attribute_Reference
and then Attribute_Name (N) = Name_Loop_Entry
then
return;
end if;
pragma Assert (Nkind (N) = N_Indexed_Component);
P_T := Base_Type (Etype (P));
if Is_Entity_Name (P) and then Present (Entity (P)) then
U_N := Entity (P);
if Is_Type (U_N) then
-- Reformat node as a type conversion
E := Remove_Head (Exprs);
if Present (First (Exprs)) then
Error_Msg_N
("argument of type conversion must be single expression", N);
end if;
Change_Node (N, N_Type_Conversion);
Set_Subtype_Mark (N, P);
Set_Etype (N, U_N);
Set_Expression (N, E);
-- After changing the node, call for the specific Analysis
-- routine directly, to avoid a double call to the expander.
Analyze_Type_Conversion (N);
return;
end if;
if Is_Overloadable (U_N) then
Process_Function_Call;
elsif Ekind (Etype (P)) = E_Subprogram_Type
or else (Is_Access_Type (Etype (P))
and then
Ekind (Designated_Type (Etype (P))) =
E_Subprogram_Type)
then
-- Call to access_to-subprogram with possible implicit dereference
Process_Function_Call;
elsif Is_Generic_Subprogram (U_N) then
-- A common beginner's (or C++ templates fan) error
Error_Msg_N ("generic subprogram cannot be called", N);
Set_Etype (N, Any_Type);
return;
else
Process_Indexed_Component_Or_Slice;
end if;
-- If not an entity name, prefix is an expression that may denote
-- an array or an access-to-subprogram.
else
if Ekind (P_T) = E_Subprogram_Type
or else (Is_Access_Type (P_T)
and then
Ekind (Designated_Type (P_T)) = E_Subprogram_Type)
then
Process_Function_Call;
elsif Nkind (P) = N_Selected_Component
and then Present (Entity (Selector_Name (P)))
and then Is_Overloadable (Entity (Selector_Name (P)))
then
Process_Function_Call;
-- In ASIS mode within a generic, a prefixed call is analyzed and
-- partially rewritten but the original indexed component has not
-- yet been rewritten as a call. Perform the replacement now.
elsif Nkind (P) = N_Selected_Component
and then Nkind (Parent (P)) = N_Function_Call
and then ASIS_Mode
then
Rewrite (N, Parent (P));
Analyze (N);
else
-- Indexed component, slice, or a call to a member of a family
-- entry, which will be converted to an entry call later.
Process_Indexed_Component_Or_Slice;
end if;
end if;
Analyze_Dimension (N);
end Analyze_Indexed_Component_Form;
------------------------
-- Analyze_Logical_Op --
------------------------
procedure Analyze_Logical_Op (N : Node_Id) is
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
Op_Id : Entity_Id := Entity (N);
begin
Set_Etype (N, Any_Type);
Candidate_Type := Empty;
Analyze_Expression (L);
Analyze_Expression (R);
if Present (Op_Id) then
if Ekind (Op_Id) = E_Operator then
Find_Boolean_Types (L, R, Op_Id, N);
else
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
else
Op_Id := Get_Name_Entity_Id (Chars (N));
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator then
Find_Boolean_Types (L, R, Op_Id, N);
else
Analyze_User_Defined_Binary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
end if;
Operator_Check (N);
Check_Function_Writable_Actuals (N);
end Analyze_Logical_Op;
---------------------------
-- Analyze_Membership_Op --
---------------------------
procedure Analyze_Membership_Op (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
Index : Interp_Index;
It : Interp;
Found : Boolean := False;
I_F : Interp_Index;
T_F : Entity_Id;
procedure Try_One_Interp (T1 : Entity_Id);
-- Routine to try one proposed interpretation. Note that the context
-- of the operation plays no role in resolving the arguments, so that
-- if there is more than one interpretation of the operands that is
-- compatible with a membership test, the operation is ambiguous.
--------------------
-- Try_One_Interp --
--------------------
procedure Try_One_Interp (T1 : Entity_Id) is
begin
if Has_Compatible_Type (R, T1) then
if Found
and then Base_Type (T1) /= Base_Type (T_F)
then
It := Disambiguate (L, I_F, Index, Any_Type);
if It = No_Interp then
Ambiguous_Operands (N);
Set_Etype (L, Any_Type);
return;
else
T_F := It.Typ;
end if;
else
Found := True;
T_F := T1;
I_F := Index;
end if;
Set_Etype (L, T_F);
end if;
end Try_One_Interp;
procedure Analyze_Set_Membership;
-- If a set of alternatives is present, analyze each and find the
-- common type to which they must all resolve.
----------------------------
-- Analyze_Set_Membership --
----------------------------
procedure Analyze_Set_Membership is
Alt : Node_Id;
Index : Interp_Index;
It : Interp;
Candidate_Interps : Node_Id;
Common_Type : Entity_Id := Empty;
begin
if Comes_From_Source (N) then
Check_Compiler_Unit ("set membership", N);
end if;
Analyze (L);
Candidate_Interps := L;
if not Is_Overloaded (L) then
Common_Type := Etype (L);
Alt := First (Alternatives (N));
while Present (Alt) loop
Analyze (Alt);
if not Has_Compatible_Type (Alt, Common_Type) then
Wrong_Type (Alt, Common_Type);
end if;
Next (Alt);
end loop;
else
Alt := First (Alternatives (N));
while Present (Alt) loop
Analyze (Alt);
if not Is_Overloaded (Alt) then
Common_Type := Etype (Alt);
else
Get_First_Interp (Alt, Index, It);
while Present (It.Typ) loop
if not
Has_Compatible_Type (Candidate_Interps, It.Typ)
then
Remove_Interp (Index);
end if;
Get_Next_Interp (Index, It);
end loop;
Get_First_Interp (Alt, Index, It);
if No (It.Typ) then
Error_Msg_N ("alternative has no legal type", Alt);
return;
end if;
-- If alternative is not overloaded, we have a unique type
-- for all of them.
Set_Etype (Alt, It.Typ);
Get_Next_Interp (Index, It);
if No (It.Typ) then
Set_Is_Overloaded (Alt, False);
Common_Type := Etype (Alt);
end if;
Candidate_Interps := Alt;
end if;
Next (Alt);
end loop;
end if;
Set_Etype (N, Standard_Boolean);
if Present (Common_Type) then
Set_Etype (L, Common_Type);
-- The left operand may still be overloaded, to be resolved using
-- the Common_Type.
else
Error_Msg_N ("cannot resolve membership operation", N);
end if;
end Analyze_Set_Membership;
-- Start of processing for Analyze_Membership_Op
begin
Analyze_Expression (L);
if No (R) and then Ada_Version >= Ada_2012 then
Analyze_Set_Membership;
Check_Function_Writable_Actuals (N);
return;
end if;
if Nkind (R) = N_Range
or else (Nkind (R) = N_Attribute_Reference
and then Attribute_Name (R) = Name_Range)
then
Analyze (R);
if not Is_Overloaded (L) then
Try_One_Interp (Etype (L));
else
Get_First_Interp (L, Index, It);
while Present (It.Typ) loop
Try_One_Interp (It.Typ);
Get_Next_Interp (Index, It);
end loop;
end if;
-- If not a range, it can be a subtype mark, or else it is a degenerate
-- membership test with a singleton value, i.e. a test for equality,
-- if the types are compatible.
else
Analyze (R);
if Is_Entity_Name (R)
and then Is_Type (Entity (R))
then
Find_Type (R);
Check_Fully_Declared (Entity (R), R);
elsif Ada_Version >= Ada_2012
and then Has_Compatible_Type (R, Etype (L))
then
if Nkind (N) = N_In then
Rewrite (N,
Make_Op_Eq (Loc,
Left_Opnd => L,
Right_Opnd => R));
else
Rewrite (N,
Make_Op_Ne (Loc,
Left_Opnd => L,
Right_Opnd => R));
end if;
Analyze (N);
return;
else
-- In all versions of the language, if we reach this point there
-- is a previous error that will be diagnosed below.
Find_Type (R);
end if;
end if;
-- Compatibility between expression and subtype mark or range is
-- checked during resolution. The result of the operation is Boolean
-- in any case.
Set_Etype (N, Standard_Boolean);
if Comes_From_Source (N)
and then Present (Right_Opnd (N))
and then Is_CPP_Class (Etype (Etype (Right_Opnd (N))))
then
Error_Msg_N ("membership test not applicable to cpp-class types", N);
end if;
Check_Function_Writable_Actuals (N);
end Analyze_Membership_Op;
-----------------
-- Analyze_Mod --
-----------------
procedure Analyze_Mod (N : Node_Id) is
begin
-- A special warning check, if we have an expression of the form:
-- expr mod 2 * literal
-- where literal is 64 or less, then probably what was meant was
-- expr mod 2 ** literal
-- so issue an appropriate warning.
if Warn_On_Suspicious_Modulus_Value
and then Nkind (Right_Opnd (N)) = N_Integer_Literal
and then Intval (Right_Opnd (N)) = Uint_2
and then Nkind (Parent (N)) = N_Op_Multiply
and then Nkind (Right_Opnd (Parent (N))) = N_Integer_Literal
and then Intval (Right_Opnd (Parent (N))) <= Uint_64
then
Error_Msg_N
("suspicious MOD value, was '*'* intended'??M?", Parent (N));
end if;
-- Remaining processing is same as for other arithmetic operators
Analyze_Arithmetic_Op (N);
end Analyze_Mod;
----------------------
-- Analyze_Negation --
----------------------
procedure Analyze_Negation (N : Node_Id) is
R : constant Node_Id := Right_Opnd (N);
Op_Id : Entity_Id := Entity (N);
begin
Set_Etype (N, Any_Type);
Candidate_Type := Empty;
Analyze_Expression (R);
if Present (Op_Id) then
if Ekind (Op_Id) = E_Operator then
Find_Negation_Types (R, Op_Id, N);
else
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
else
Op_Id := Get_Name_Entity_Id (Chars (N));
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator then
Find_Negation_Types (R, Op_Id, N);
else
Analyze_User_Defined_Unary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
end if;
Operator_Check (N);
end Analyze_Negation;
------------------
-- Analyze_Null --
------------------
procedure Analyze_Null (N : Node_Id) is
begin
Check_SPARK_05_Restriction ("null is not allowed", N);
Set_Etype (N, Any_Access);
end Analyze_Null;
----------------------
-- Analyze_One_Call --
----------------------
procedure Analyze_One_Call
(N : Node_Id;
Nam : Entity_Id;
Report : Boolean;
Success : out Boolean;
Skip_First : Boolean := False)
is
Actuals : constant List_Id := Parameter_Associations (N);
Prev_T : constant Entity_Id := Etype (N);
Must_Skip : constant Boolean := Skip_First
or else Nkind (Original_Node (N)) = N_Selected_Component
or else
(Nkind (Original_Node (N)) = N_Indexed_Component
and then Nkind (Prefix (Original_Node (N)))
= N_Selected_Component);
-- The first formal must be omitted from the match when trying to find
-- a primitive operation that is a possible interpretation, and also
-- after the call has been rewritten, because the corresponding actual
-- is already known to be compatible, and because this may be an
-- indexing of a call with default parameters.
Formal : Entity_Id;
Actual : Node_Id;
Is_Indexed : Boolean := False;
Is_Indirect : Boolean := False;
Subp_Type : constant Entity_Id := Etype (Nam);
Norm_OK : Boolean;
function Compatible_Types_In_Predicate
(T1 : Entity_Id;
T2 : Entity_Id) return Boolean;
-- For an Ada 2012 predicate or invariant, a call may mention an
-- incomplete type, while resolution of the corresponding predicate
-- function may see the full view, as a consequence of the delayed
-- resolution of the corresponding expressions. This may occur in
-- the body of a predicate function, or in a call to such. Anomalies
-- involving private and full views can also happen. In each case,
-- rewrite node or add conversions to remove spurious type errors.
procedure Indicate_Name_And_Type;
-- If candidate interpretation matches, indicate name and type of result
-- on call node.
function Operator_Hidden_By (Fun : Entity_Id) return Boolean;
-- There may be a user-defined operator that hides the current
-- interpretation. We must check for this independently of the
-- analysis of the call with the user-defined operation, because
-- the parameter names may be wrong and yet the hiding takes place.
-- This fixes a problem with ACATS test B34014O.
--
-- When the type Address is a visible integer type, and the DEC
-- system extension is visible, the predefined operator may be
-- hidden as well, by one of the address operations in auxdec.
-- Finally, The abstract operations on address do not hide the
-- predefined operator (this is the purpose of making them abstract).
-----------------------------------
-- Compatible_Types_In_Predicate --
-----------------------------------
function Compatible_Types_In_Predicate
(T1 : Entity_Id;
T2 : Entity_Id) return Boolean
is
function Common_Type (T : Entity_Id) return Entity_Id;
-- Find non-private full view if any, without going to ancestor type
-- (as opposed to Underlying_Type).
-----------------
-- Common_Type --
-----------------
function Common_Type (T : Entity_Id) return Entity_Id is
begin
if Is_Private_Type (T) and then Present (Full_View (T)) then
return Base_Type (Full_View (T));
else
return Base_Type (T);
end if;
end Common_Type;
-- Start of processing for Compatible_Types_In_Predicate
begin
if (Ekind (Current_Scope) = E_Function
and then Is_Predicate_Function (Current_Scope))
or else
(Ekind (Nam) = E_Function
and then Is_Predicate_Function (Nam))
then
if Is_Incomplete_Type (T1)
and then Present (Full_View (T1))
and then Full_View (T1) = T2
then
Set_Etype (Formal, Etype (Actual));
return True;
elsif Common_Type (T1) = Common_Type (T2) then
Rewrite (Actual, Unchecked_Convert_To (Etype (Formal), Actual));
return True;
else
return False;
end if;
else
return False;
end if;
end Compatible_Types_In_Predicate;
----------------------------
-- Indicate_Name_And_Type --
----------------------------
procedure Indicate_Name_And_Type is
begin
Add_One_Interp (N, Nam, Etype (Nam));
Check_Implicit_Dereference (N, Etype (Nam));
Success := True;
-- If the prefix of the call is a name, indicate the entity
-- being called. If it is not a name, it is an expression that
-- denotes an access to subprogram or else an entry or family. In
-- the latter case, the name is a selected component, and the entity
-- being called is noted on the selector.
if not Is_Type (Nam) then
if Is_Entity_Name (Name (N)) then
Set_Entity (Name (N), Nam);
Set_Etype (Name (N), Etype (Nam));
elsif Nkind (Name (N)) = N_Selected_Component then
Set_Entity (Selector_Name (Name (N)), Nam);
end if;
end if;
if Debug_Flag_E and not Report then
Write_Str (" Overloaded call ");
Write_Int (Int (N));
Write_Str (" compatible with ");
Write_Int (Int (Nam));
Write_Eol;
end if;
end Indicate_Name_And_Type;
------------------------
-- Operator_Hidden_By --
------------------------
function Operator_Hidden_By (Fun : Entity_Id) return Boolean is
Act1 : constant Node_Id := First_Actual (N);
Act2 : constant Node_Id := Next_Actual (Act1);
Form1 : constant Entity_Id := First_Formal (Fun);
Form2 : constant Entity_Id := Next_Formal (Form1);
begin
if Ekind (Fun) /= E_Function or else Is_Abstract_Subprogram (Fun) then
return False;
elsif not Has_Compatible_Type (Act1, Etype (Form1)) then
return False;
elsif Present (Form2) then
if No (Act2)
or else not Has_Compatible_Type (Act2, Etype (Form2))
then
return False;
end if;
elsif Present (Act2) then
return False;
end if;
-- Now we know that the arity of the operator matches the function,
-- and the function call is a valid interpretation. The function
-- hides the operator if it has the right signature, or if one of
-- its operands is a non-abstract operation on Address when this is
-- a visible integer type.
return Hides_Op (Fun, Nam)
or else Is_Descendant_Of_Address (Etype (Form1))
or else
(Present (Form2)
and then Is_Descendant_Of_Address (Etype (Form2)));
end Operator_Hidden_By;
-- Start of processing for Analyze_One_Call
begin
Success := False;
-- If the subprogram has no formals or if all the formals have defaults,
-- and the return type is an array type, the node may denote an indexing
-- of the result of a parameterless call. In Ada 2005, the subprogram
-- may have one non-defaulted formal, and the call may have been written
-- in prefix notation, so that the rebuilt parameter list has more than
-- one actual.
if not Is_Overloadable (Nam)
and then Ekind (Nam) /= E_Subprogram_Type
and then Ekind (Nam) /= E_Entry_Family
then
return;
end if;
-- An indexing requires at least one actual. The name of the call cannot
-- be an implicit indirect call, so it cannot be a generated explicit
-- dereference.
if not Is_Empty_List (Actuals)
and then
(Needs_No_Actuals (Nam)
or else
(Needs_One_Actual (Nam)
and then Present (Next_Actual (First (Actuals)))))
then
if Is_Array_Type (Subp_Type)
and then
(Nkind (Name (N)) /= N_Explicit_Dereference
or else Comes_From_Source (Name (N)))
then
Is_Indexed := Try_Indexed_Call (N, Nam, Subp_Type, Must_Skip);
elsif Is_Access_Type (Subp_Type)
and then Is_Array_Type (Designated_Type (Subp_Type))
then
Is_Indexed :=
Try_Indexed_Call
(N, Nam, Designated_Type (Subp_Type), Must_Skip);
-- The prefix can also be a parameterless function that returns an
-- access to subprogram, in which case this is an indirect call.
-- If this succeeds, an explicit dereference is added later on,
-- in Analyze_Call or Resolve_Call.
elsif Is_Access_Type (Subp_Type)
and then Ekind (Designated_Type (Subp_Type)) = E_Subprogram_Type
then
Is_Indirect := Try_Indirect_Call (N, Nam, Subp_Type);
end if;
end if;
-- If the call has been transformed into a slice, it is of the form
-- F (Subtype) where F is parameterless. The node has been rewritten in
-- Try_Indexed_Call and there is nothing else to do.
if Is_Indexed
and then Nkind (N) = N_Slice
then
return;
end if;
Normalize_Actuals
(N, Nam, (Report and not Is_Indexed and not Is_Indirect), Norm_OK);
if not Norm_OK then
-- If an indirect call is a possible interpretation, indicate
-- success to the caller. This may be an indexing of an explicit
-- dereference of a call that returns an access type (see above).
if Is_Indirect
or else (Is_Indexed
and then Nkind (Name (N)) = N_Explicit_Dereference
and then Comes_From_Source (Name (N)))
then
Success := True;
return;
-- Mismatch in number or names of parameters
elsif Debug_Flag_E then
Write_Str (" normalization fails in call ");
Write_Int (Int (N));
Write_Str (" with subprogram ");
Write_Int (Int (Nam));
Write_Eol;
end if;
-- If the context expects a function call, discard any interpretation
-- that is a procedure. If the node is not overloaded, leave as is for
-- better error reporting when type mismatch is found.
elsif Nkind (N) = N_Function_Call
and then Is_Overloaded (Name (N))
and then Ekind (Nam) = E_Procedure
then
return;
-- Ditto for function calls in a procedure context
elsif Nkind (N) = N_Procedure_Call_Statement
and then Is_Overloaded (Name (N))
and then Etype (Nam) /= Standard_Void_Type
then
return;
elsif No (Actuals) then
-- If Normalize succeeds, then there are default parameters for
-- all formals.
Indicate_Name_And_Type;
elsif Ekind (Nam) = E_Operator then
if Nkind (N) = N_Procedure_Call_Statement then
return;
end if;
-- This can occur when the prefix of the call is an operator
-- name or an expanded name whose selector is an operator name.
Analyze_Operator_Call (N, Nam);
if Etype (N) /= Prev_T then
-- Check that operator is not hidden by a function interpretation
if Is_Overloaded (Name (N)) then
declare
I : Interp_Index;
It : Interp;
begin
Get_First_Interp (Name (N), I, It);
while Present (It.Nam) loop
if Operator_Hidden_By (It.Nam) then
Set_Etype (N, Prev_T);
return;
end if;
Get_Next_Interp (I, It);
end loop;
end;
end if;
-- If operator matches formals, record its name on the call.
-- If the operator is overloaded, Resolve will select the
-- correct one from the list of interpretations. The call
-- node itself carries the first candidate.
Set_Entity (Name (N), Nam);
Success := True;
elsif Report and then Etype (N) = Any_Type then
Error_Msg_N ("incompatible arguments for operator", N);
end if;
else
-- Normalize_Actuals has chained the named associations in the
-- correct order of the formals.
Actual := First_Actual (N);
Formal := First_Formal (Nam);
-- If we are analyzing a call rewritten from object notation, skip
-- first actual, which may be rewritten later as an explicit
-- dereference.
if Must_Skip then
Next_Actual (Actual);
Next_Formal (Formal);
end if;
while Present (Actual) and then Present (Formal) loop
if Nkind (Parent (Actual)) /= N_Parameter_Association
or else Chars (Selector_Name (Parent (Actual))) = Chars (Formal)
then
-- The actual can be compatible with the formal, but we must
-- also check that the context is not an address type that is
-- visibly an integer type. In this case the use of literals is
-- illegal, except in the body of descendants of system, where
-- arithmetic operations on address are of course used.
if Has_Compatible_Type (Actual, Etype (Formal))
and then
(Etype (Actual) /= Universal_Integer
or else not Is_Descendant_Of_Address (Etype (Formal))
or else
Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (N))))
then
Next_Actual (Actual);
Next_Formal (Formal);
-- In Allow_Integer_Address mode, we allow an actual integer to
-- match a formal address type and vice versa. We only do this
-- if we are certain that an error will otherwise be issued
elsif Address_Integer_Convert_OK
(Etype (Actual), Etype (Formal))
and then (Report and not Is_Indexed and not Is_Indirect)
then
-- Handle this case by introducing an unchecked conversion
Rewrite (Actual,
Unchecked_Convert_To (Etype (Formal),
Relocate_Node (Actual)));
Analyze_And_Resolve (Actual, Etype (Formal));
Next_Actual (Actual);
Next_Formal (Formal);
-- Under relaxed RM semantics silently replace occurrences of
-- null by System.Address_Null. We only do this if we know that
-- an error will otherwise be issued.
elsif Null_To_Null_Address_Convert_OK (Actual, Etype (Formal))
and then (Report and not Is_Indexed and not Is_Indirect)
then
Replace_Null_By_Null_Address (Actual);
Analyze_And_Resolve (Actual, Etype (Formal));
Next_Actual (Actual);
Next_Formal (Formal);
elsif Compatible_Types_In_Predicate
(Etype (Formal), Etype (Actual))
then
Next_Actual (Actual);
Next_Formal (Formal);
-- In a complex case where an enclosing generic and a nested
-- generic package, both declared with partially parameterized
-- formal subprograms with the same names, are instantiated
-- with the same type, the types of the actual parameter and
-- that of the formal may appear incompatible at first sight.
-- generic
-- type Outer_T is private;
-- with function Func (Formal : Outer_T)
-- return ... is <>;
-- package Outer_Gen is
-- generic
-- type Inner_T is private;
-- with function Func (Formal : Inner_T) -- (1)
-- return ... is <>;
-- package Inner_Gen is
-- function Inner_Func (Formal : Inner_T) -- (2)
-- return ... is (Func (Formal));
-- end Inner_Gen;
-- end Outer_Generic;
-- package Outer_Inst is new Outer_Gen (Actual_T);
-- package Inner_Inst is new Outer_Inst.Inner_Gen (Actual_T);
-- In the example above, the type of parameter
-- Inner_Func.Formal at (2) is incompatible with the type of
-- Func.Formal at (1) in the context of instantiations
-- Outer_Inst and Inner_Inst. In reality both types are generic
-- actual subtypes renaming base type Actual_T as part of the
-- generic prologues for the instantiations.
-- Recognize this case and add a type conversion to allow this
-- kind of generic actual subtype conformance. Note that this
-- is done only when the call is non-overloaded because the
-- resolution mechanism already has the means to disambiguate
-- similar cases.
elsif not Is_Overloaded (Name (N))
and then Is_Type (Etype (Actual))
and then Is_Type (Etype (Formal))
and then Is_Generic_Actual_Type (Etype (Actual))
and then Is_Generic_Actual_Type (Etype (Formal))
and then Base_Type (Etype (Actual)) =
Base_Type (Etype (Formal))
then
Rewrite (Actual,
Convert_To (Etype (Formal), Relocate_Node (Actual)));
Analyze_And_Resolve (Actual, Etype (Formal));
Next_Actual (Actual);
Next_Formal (Formal);
-- Handle failed type check
else
if Debug_Flag_E then
Write_Str (" type checking fails in call ");
Write_Int (Int (N));
Write_Str (" with formal ");
Write_Int (Int (Formal));
Write_Str (" in subprogram ");
Write_Int (Int (Nam));
Write_Eol;
end if;
-- Comment needed on the following test???
if Report and not Is_Indexed and not Is_Indirect then
-- Ada 2005 (AI-251): Complete the error notification
-- to help new Ada 2005 users.
if Is_Class_Wide_Type (Etype (Formal))
and then Is_Interface (Etype (Etype (Formal)))
and then not Interface_Present_In_Ancestor
(Typ => Etype (Actual),
Iface => Etype (Etype (Formal)))
then
Error_Msg_NE
("(Ada 2005) does not implement interface }",
Actual, Etype (Etype (Formal)));
end if;
Wrong_Type (Actual, Etype (Formal));
if Nkind (Actual) = N_Op_Eq
and then Nkind (Left_Opnd (Actual)) = N_Identifier
then
Formal := First_Formal (Nam);
while Present (Formal) loop
if Chars (Left_Opnd (Actual)) = Chars (Formal) then
Error_Msg_N -- CODEFIX
("possible misspelling of `='>`!", Actual);
exit;
end if;
Next_Formal (Formal);
end loop;
end if;
if All_Errors_Mode then
Error_Msg_Sloc := Sloc (Nam);
if Etype (Formal) = Any_Type then
Error_Msg_N
("there is no legal actual parameter", Actual);
end if;
if Is_Overloadable (Nam)
and then Present (Alias (Nam))
and then not Comes_From_Source (Nam)
then
Error_Msg_NE
("\\ =='> in call to inherited operation & #!",
Actual, Nam);
elsif Ekind (Nam) = E_Subprogram_Type then
declare
Access_To_Subprogram_Typ :
constant Entity_Id :=
Defining_Identifier
(Associated_Node_For_Itype (Nam));
begin
Error_Msg_NE
("\\ =='> in call to dereference of &#!",
Actual, Access_To_Subprogram_Typ);
end;
else
Error_Msg_NE
("\\ =='> in call to &#!", Actual, Nam);
end if;
end if;
end if;
return;
end if;
else
-- Normalize_Actuals has verified that a default value exists
-- for this formal. Current actual names a subsequent formal.
Next_Formal (Formal);
end if;
end loop;
-- On exit, all actuals match
Indicate_Name_And_Type;
end if;
end Analyze_One_Call;
---------------------------
-- Analyze_Operator_Call --
---------------------------
procedure Analyze_Operator_Call (N : Node_Id; Op_Id : Entity_Id) is
Op_Name : constant Name_Id := Chars (Op_Id);
Act1 : constant Node_Id := First_Actual (N);
Act2 : constant Node_Id := Next_Actual (Act1);
begin
-- Binary operator case
if Present (Act2) then
-- If more than two operands, then not binary operator after all
if Present (Next_Actual (Act2)) then
return;
end if;
-- Otherwise action depends on operator
case Op_Name is
when Name_Op_Add
| Name_Op_Divide
| Name_Op_Expon
| Name_Op_Mod
| Name_Op_Multiply
| Name_Op_Rem
| Name_Op_Subtract
=>
Find_Arithmetic_Types (Act1, Act2, Op_Id, N);
when Name_Op_And
| Name_Op_Or
| Name_Op_Xor
=>
Find_Boolean_Types (Act1, Act2, Op_Id, N);
when Name_Op_Ge
| Name_Op_Gt
| Name_Op_Le
| Name_Op_Lt
=>
Find_Comparison_Types (Act1, Act2, Op_Id, N);
when Name_Op_Eq
| Name_Op_Ne
=>
Find_Equality_Types (Act1, Act2, Op_Id, N);
when Name_Op_Concat =>
Find_Concatenation_Types (Act1, Act2, Op_Id, N);
-- Is this when others, or should it be an abort???
when others =>
null;
end case;
-- Unary operator case
else
case Op_Name is
when Name_Op_Abs
| Name_Op_Add
| Name_Op_Subtract
=>
Find_Unary_Types (Act1, Op_Id, N);
when Name_Op_Not =>
Find_Negation_Types (Act1, Op_Id, N);
-- Is this when others correct, or should it be an abort???
when others =>
null;
end case;
end if;
end Analyze_Operator_Call;
-------------------------------------------
-- Analyze_Overloaded_Selected_Component --
-------------------------------------------
procedure Analyze_Overloaded_Selected_Component (N : Node_Id) is
Nam : constant Node_Id := Prefix (N);
Sel : constant Node_Id := Selector_Name (N);
Comp : Entity_Id;
I : Interp_Index;
It : Interp;
T : Entity_Id;
begin
Set_Etype (Sel, Any_Type);
Get_First_Interp (Nam, I, It);
while Present (It.Typ) loop
if Is_Access_Type (It.Typ) then
T := Designated_Type (It.Typ);
Error_Msg_NW (Warn_On_Dereference, "?d?implicit dereference", N);
else
T := It.Typ;
end if;
-- Locate the component. For a private prefix the selector can denote
-- a discriminant.
if Is_Record_Type (T) or else Is_Private_Type (T) then
-- If the prefix is a class-wide type, the visible components are
-- those of the base type.
if Is_Class_Wide_Type (T) then
T := Etype (T);
end if;
Comp := First_Entity (T);
while Present (Comp) loop
if Chars (Comp) = Chars (Sel)
and then Is_Visible_Component (Comp)
then
-- AI05-105: if the context is an object renaming with
-- an anonymous access type, the expected type of the
-- object must be anonymous. This is a name resolution rule.
if Nkind (Parent (N)) /= N_Object_Renaming_Declaration
or else No (Access_Definition (Parent (N)))
or else Ekind (Etype (Comp)) = E_Anonymous_Access_Type
or else
Ekind (Etype (Comp)) = E_Anonymous_Access_Subprogram_Type
then
Set_Entity (Sel, Comp);
Set_Etype (Sel, Etype (Comp));
Add_One_Interp (N, Etype (Comp), Etype (Comp));
Check_Implicit_Dereference (N, Etype (Comp));
-- This also specifies a candidate to resolve the name.
-- Further overloading will be resolved from context.
-- The selector name itself does not carry overloading
-- information.
Set_Etype (Nam, It.Typ);
else
-- Named access type in the context of a renaming
-- declaration with an access definition. Remove
-- inapplicable candidate.
Remove_Interp (I);
end if;
end if;
Next_Entity (Comp);
end loop;
elsif Is_Concurrent_Type (T) then
Comp := First_Entity (T);
while Present (Comp)
and then Comp /= First_Private_Entity (T)
loop
if Chars (Comp) = Chars (Sel) then
if Is_Overloadable (Comp) then
Add_One_Interp (Sel, Comp, Etype (Comp));
else
Set_Entity_With_Checks (Sel, Comp);
Generate_Reference (Comp, Sel);
end if;
Set_Etype (Sel, Etype (Comp));
Set_Etype (N, Etype (Comp));
Set_Etype (Nam, It.Typ);
-- For access type case, introduce explicit dereference for
-- more uniform treatment of entry calls. Do this only once
-- if several interpretations yield an access type.
if Is_Access_Type (Etype (Nam))
and then Nkind (Nam) /= N_Explicit_Dereference
then
Insert_Explicit_Dereference (Nam);
Error_Msg_NW
(Warn_On_Dereference, "?d?implicit dereference", N);
end if;
end if;
Next_Entity (Comp);
end loop;
Set_Is_Overloaded (N, Is_Overloaded (Sel));
end if;
Get_Next_Interp (I, It);
end loop;
if Etype (N) = Any_Type
and then not Try_Object_Operation (N)
then
Error_Msg_NE ("undefined selector& for overloaded prefix", N, Sel);
Set_Entity (Sel, Any_Id);
Set_Etype (Sel, Any_Type);
end if;
end Analyze_Overloaded_Selected_Component;
----------------------------------
-- Analyze_Qualified_Expression --
----------------------------------
procedure Analyze_Qualified_Expression (N : Node_Id) is
Mark : constant Entity_Id := Subtype_Mark (N);
Expr : constant Node_Id := Expression (N);
I : Interp_Index;
It : Interp;
T : Entity_Id;
begin
Analyze_Expression (Expr);
Set_Etype (N, Any_Type);
Find_Type (Mark);
T := Entity (Mark);
Set_Etype (N, T);
if T = Any_Type then
return;
end if;
Check_Fully_Declared (T, N);
-- If expected type is class-wide, check for exact match before
-- expansion, because if the expression is a dispatching call it
-- may be rewritten as explicit dereference with class-wide result.
-- If expression is overloaded, retain only interpretations that
-- will yield exact matches.
if Is_Class_Wide_Type (T) then
if not Is_Overloaded (Expr) then
if Base_Type (Etype (Expr)) /= Base_Type (T) then
if Nkind (Expr) = N_Aggregate then
Error_Msg_N ("type of aggregate cannot be class-wide", Expr);
else
Wrong_Type (Expr, T);
end if;
end if;
else
Get_First_Interp (Expr, I, It);
while Present (It.Nam) loop
if Base_Type (It.Typ) /= Base_Type (T) then
Remove_Interp (I);
end if;
Get_Next_Interp (I, It);
end loop;
end if;
end if;
Set_Etype (N, T);
end Analyze_Qualified_Expression;
-----------------------------------
-- Analyze_Quantified_Expression --
-----------------------------------
procedure Analyze_Quantified_Expression (N : Node_Id) is
function Is_Empty_Range (Typ : Entity_Id) return Boolean;
-- If the iterator is part of a quantified expression, and the range is
-- known to be statically empty, emit a warning and replace expression
-- with its static value. Returns True if the replacement occurs.
function No_Else_Or_Trivial_True (If_Expr : Node_Id) return Boolean;
-- Determine whether if expression If_Expr lacks an else part or if it
-- has one, it evaluates to True.
--------------------
-- Is_Empty_Range --
--------------------
function Is_Empty_Range (Typ : Entity_Id) return Boolean is
Loc : constant Source_Ptr := Sloc (N);
begin
if Is_Array_Type (Typ)
and then Compile_Time_Known_Bounds (Typ)
and then
(Expr_Value (Type_Low_Bound (Etype (First_Index (Typ)))) >
Expr_Value (Type_High_Bound (Etype (First_Index (Typ)))))
then
Preanalyze_And_Resolve (Condition (N), Standard_Boolean);
if All_Present (N) then
Error_Msg_N
("??quantified expression with ALL "
& "over a null range has value True", N);
Rewrite (N, New_Occurrence_Of (Standard_True, Loc));
else
Error_Msg_N
("??quantified expression with SOME "
& "over a null range has value False", N);
Rewrite (N, New_Occurrence_Of (Standard_False, Loc));
end if;
Analyze (N);
return True;
else
return False;
end if;
end Is_Empty_Range;
-----------------------------
-- No_Else_Or_Trivial_True --
-----------------------------
function No_Else_Or_Trivial_True (If_Expr : Node_Id) return Boolean is
Else_Expr : constant Node_Id :=
Next (Next (First (Expressions (If_Expr))));
begin
return
No (Else_Expr)
or else (Compile_Time_Known_Value (Else_Expr)
and then Is_True (Expr_Value (Else_Expr)));
end No_Else_Or_Trivial_True;
-- Local variables
Cond : constant Node_Id := Condition (N);
Loop_Id : Entity_Id;
QE_Scop : Entity_Id;
-- Start of processing for Analyze_Quantified_Expression
begin
Check_SPARK_05_Restriction ("quantified expression is not allowed", N);
-- Create a scope to emulate the loop-like behavior of the quantified
-- expression. The scope is needed to provide proper visibility of the
-- loop variable.
QE_Scop := New_Internal_Entity (E_Loop, Current_Scope, Sloc (N), 'L');
Set_Etype (QE_Scop, Standard_Void_Type);
Set_Scope (QE_Scop, Current_Scope);
Set_Parent (QE_Scop, N);
Push_Scope (QE_Scop);
-- All constituents are preanalyzed and resolved to avoid untimely
-- generation of various temporaries and types. Full analysis and
-- expansion is carried out when the quantified expression is
-- transformed into an expression with actions.
if Present (Iterator_Specification (N)) then
Preanalyze (Iterator_Specification (N));
-- Do not proceed with the analysis when the range of iteration is
-- empty. The appropriate error is issued by Is_Empty_Range.
if Is_Entity_Name (Name (Iterator_Specification (N)))
and then Is_Empty_Range (Etype (Name (Iterator_Specification (N))))
then
return;
end if;
else pragma Assert (Present (Loop_Parameter_Specification (N)));
declare
Loop_Par : constant Node_Id := Loop_Parameter_Specification (N);
begin
Preanalyze (Loop_Par);
if Nkind (Discrete_Subtype_Definition (Loop_Par)) = N_Function_Call
and then Parent (Loop_Par) /= N
then
-- The parser cannot distinguish between a loop specification
-- and an iterator specification. If after pre-analysis the
-- proper form has been recognized, rewrite the expression to
-- reflect the right kind. This is needed for proper ASIS
-- navigation. If expansion is enabled, the transformation is
-- performed when the expression is rewritten as a loop.
Set_Iterator_Specification (N,
New_Copy_Tree (Iterator_Specification (Parent (Loop_Par))));
Set_Defining_Identifier (Iterator_Specification (N),
Relocate_Node (Defining_Identifier (Loop_Par)));
Set_Name (Iterator_Specification (N),
Relocate_Node (Discrete_Subtype_Definition (Loop_Par)));
Set_Comes_From_Source (Iterator_Specification (N),
Comes_From_Source (Loop_Parameter_Specification (N)));
Set_Loop_Parameter_Specification (N, Empty);
end if;
end;
end if;
Preanalyze_And_Resolve (Cond, Standard_Boolean);
End_Scope;
Set_Etype (N, Standard_Boolean);
-- Verify that the loop variable is used within the condition of the
-- quantified expression.
if Present (Iterator_Specification (N)) then
Loop_Id := Defining_Identifier (Iterator_Specification (N));
else
Loop_Id := Defining_Identifier (Loop_Parameter_Specification (N));
end if;
if Warn_On_Suspicious_Contract
and then not Referenced (Loop_Id, Cond)
then
-- Generating C, this check causes spurious warnings on inlined
-- postconditions; we can safely disable it because this check
-- was previously performed when analyzing the internally built
-- postconditions procedure.
if Modify_Tree_For_C and then In_Inlined_Body then
null;
else
Error_Msg_N ("?T?unused variable &", Loop_Id);
end if;
end if;
-- Diagnose a possible misuse of the SOME existential quantifier. When
-- we have a quantified expression of the form:
-- for some X => (if P then Q [else True])
-- any value for X that makes P False results in the if expression being
-- trivially True, and so also results in the quantified expression
-- being trivially True.
if Warn_On_Suspicious_Contract
and then not All_Present (N)
and then Nkind (Cond) = N_If_Expression
and then No_Else_Or_Trivial_True (Cond)
then
Error_Msg_N ("?T?suspicious expression", N);
Error_Msg_N ("\\did you mean (for all X ='> (if P then Q))", N);
Error_Msg_N ("\\or (for some X ='> P and then Q) instead'?", N);
end if;
end Analyze_Quantified_Expression;
-------------------
-- Analyze_Range --
-------------------
procedure Analyze_Range (N : Node_Id) is
L : constant Node_Id := Low_Bound (N);
H : constant Node_Id := High_Bound (N);
I1, I2 : Interp_Index;
It1, It2 : Interp;
procedure Check_Common_Type (T1, T2 : Entity_Id);
-- Verify the compatibility of two types, and choose the
-- non universal one if the other is universal.
procedure Check_High_Bound (T : Entity_Id);
-- Test one interpretation of the low bound against all those
-- of the high bound.
procedure Check_Universal_Expression (N : Node_Id);
-- In Ada 83, reject bounds of a universal range that are not literals
-- or entity names.
-----------------------
-- Check_Common_Type --
-----------------------
procedure Check_Common_Type (T1, T2 : Entity_Id) is
begin
if Covers (T1 => T1, T2 => T2)
or else
Covers (T1 => T2, T2 => T1)
then
if T1 = Universal_Integer
or else T1 = Universal_Real
or else T1 = Any_Character
then
Add_One_Interp (N, Base_Type (T2), Base_Type (T2));
elsif T1 = T2 then
Add_One_Interp (N, T1, T1);
else
Add_One_Interp (N, Base_Type (T1), Base_Type (T1));
end if;
end if;
end Check_Common_Type;
----------------------
-- Check_High_Bound --
----------------------
procedure Check_High_Bound (T : Entity_Id) is
begin
if not Is_Overloaded (H) then
Check_Common_Type (T, Etype (H));
else
Get_First_Interp (H, I2, It2);
while Present (It2.Typ) loop
Check_Common_Type (T, It2.Typ);
Get_Next_Interp (I2, It2);
end loop;
end if;
end Check_High_Bound;
-----------------------------
-- Is_Universal_Expression --
-----------------------------
procedure Check_Universal_Expression (N : Node_Id) is
begin
if Etype (N) = Universal_Integer
and then Nkind (N) /= N_Integer_Literal
and then not Is_Entity_Name (N)
and then Nkind (N) /= N_Attribute_Reference
then
Error_Msg_N ("illegal bound in discrete range", N);
end if;
end Check_Universal_Expression;
-- Start of processing for Analyze_Range
begin
Set_Etype (N, Any_Type);
Analyze_Expression (L);
Analyze_Expression (H);
if Etype (L) = Any_Type or else Etype (H) = Any_Type then
return;
else
if not Is_Overloaded (L) then
Check_High_Bound (Etype (L));
else
Get_First_Interp (L, I1, It1);
while Present (It1.Typ) loop
Check_High_Bound (It1.Typ);
Get_Next_Interp (I1, It1);
end loop;
end if;
-- If result is Any_Type, then we did not find a compatible pair
if Etype (N) = Any_Type then
Error_Msg_N ("incompatible types in range ", N);
end if;
end if;
if Ada_Version = Ada_83
and then
(Nkind (Parent (N)) = N_Loop_Parameter_Specification
or else Nkind (Parent (N)) = N_Constrained_Array_Definition)
then
Check_Universal_Expression (L);
Check_Universal_Expression (H);
end if;
Check_Function_Writable_Actuals (N);
end Analyze_Range;
-----------------------
-- Analyze_Reference --
-----------------------
procedure Analyze_Reference (N : Node_Id) is
P : constant Node_Id := Prefix (N);
E : Entity_Id;
T : Entity_Id;
Acc_Type : Entity_Id;
begin
Analyze (P);
-- An interesting error check, if we take the 'Ref of an object for
-- which a pragma Atomic or Volatile has been given, and the type of the
-- object is not Atomic or Volatile, then we are in trouble. The problem
-- is that no trace of the atomic/volatile status will remain for the
-- backend to respect when it deals with the resulting pointer, since
-- the pointer type will not be marked atomic (it is a pointer to the
-- base type of the object).
-- It is not clear if that can ever occur, but in case it does, we will
-- generate an error message. Not clear if this message can ever be
-- generated, and pretty clear that it represents a bug if it is, still
-- seems worth checking, except in CodePeer mode where we do not really
-- care and don't want to bother the user.
T := Etype (P);
if Is_Entity_Name (P)
and then Is_Object_Reference (P)
and then not CodePeer_Mode
then
E := Entity (P);
T := Etype (P);
if (Has_Atomic_Components (E)
and then not Has_Atomic_Components (T))
or else
(Has_Volatile_Components (E)
and then not Has_Volatile_Components (T))
or else (Is_Atomic (E) and then not Is_Atomic (T))
or else (Is_Volatile (E) and then not Is_Volatile (T))
then
Error_Msg_N ("cannot take reference to Atomic/Volatile object", N);
end if;
end if;
-- Carry on with normal processing
Acc_Type := Create_Itype (E_Allocator_Type, N);
Set_Etype (Acc_Type, Acc_Type);
Set_Directly_Designated_Type (Acc_Type, Etype (P));
Set_Etype (N, Acc_Type);
end Analyze_Reference;
--------------------------------
-- Analyze_Selected_Component --
--------------------------------
-- Prefix is a record type or a task or protected type. In the latter case,
-- the selector must denote a visible entry.
procedure Analyze_Selected_Component (N : Node_Id) is
Name : constant Node_Id := Prefix (N);
Sel : constant Node_Id := Selector_Name (N);
Act_Decl : Node_Id;
Comp : Entity_Id;
Has_Candidate : Boolean := False;
In_Scope : Boolean;
Parent_N : Node_Id;
Pent : Entity_Id := Empty;
Prefix_Type : Entity_Id;
Type_To_Use : Entity_Id;
-- In most cases this is the Prefix_Type, but if the Prefix_Type is
-- a class-wide type, we use its root type, whose components are
-- present in the class-wide type.
Is_Single_Concurrent_Object : Boolean;
-- Set True if the prefix is a single task or a single protected object
procedure Find_Component_In_Instance (Rec : Entity_Id);
-- In an instance, a component of a private extension may not be visible
-- while it was visible in the generic. Search candidate scope for a
-- component with the proper identifier. This is only done if all other
-- searches have failed. If a match is found, the Etype of both N and
-- Sel are set from this component, and the entity of Sel is set to
-- reference this component. If no match is found, Entity (Sel) remains
-- unset. For a derived type that is an actual of the instance, the
-- desired component may be found in any ancestor.
function Has_Mode_Conformant_Spec (Comp : Entity_Id) return Boolean;
-- It is known that the parent of N denotes a subprogram call. Comp
-- is an overloadable component of the concurrent type of the prefix.
-- Determine whether all formals of the parent of N and Comp are mode
-- conformant. If the parent node is not analyzed yet it may be an
-- indexed component rather than a function call.
function Has_Dereference (Nod : Node_Id) return Boolean;
-- Check whether prefix includes a dereference at any level.
--------------------------------
-- Find_Component_In_Instance --
--------------------------------
procedure Find_Component_In_Instance (Rec : Entity_Id) is
Comp : Entity_Id;
Typ : Entity_Id;
begin
Typ := Rec;
while Present (Typ) loop
Comp := First_Component (Typ);
while Present (Comp) loop
if Chars (Comp) = Chars (Sel) then
Set_Entity_With_Checks (Sel, Comp);
Set_Etype (Sel, Etype (Comp));
Set_Etype (N, Etype (Comp));
return;
end if;
Next_Component (Comp);
end loop;
-- If not found, the component may be declared in the parent
-- type or its full view, if any.
if Is_Derived_Type (Typ) then
Typ := Etype (Typ);
if Is_Private_Type (Typ) then
Typ := Full_View (Typ);
end if;
else
return;
end if;
end loop;
-- If we fall through, no match, so no changes made
return;
end Find_Component_In_Instance;
------------------------------
-- Has_Mode_Conformant_Spec --
------------------------------
function Has_Mode_Conformant_Spec (Comp : Entity_Id) return Boolean is
Comp_Param : Entity_Id;
Param : Node_Id;
Param_Typ : Entity_Id;
begin
Comp_Param := First_Formal (Comp);
if Nkind (Parent (N)) = N_Indexed_Component then
Param := First (Expressions (Parent (N)));
else
Param := First (Parameter_Associations (Parent (N)));
end if;
while Present (Comp_Param)
and then Present (Param)
loop
Param_Typ := Find_Parameter_Type (Param);
if Present (Param_Typ)
and then
not Conforming_Types
(Etype (Comp_Param), Param_Typ, Mode_Conformant)
then
return False;
end if;
Next_Formal (Comp_Param);
Next (Param);
end loop;
-- One of the specs has additional formals; there is no match, unless
-- this may be an indexing of a parameterless call.
-- Note that when expansion is disabled, the corresponding record
-- type of synchronized types is not constructed, so that there is
-- no point is attempting an interpretation as a prefixed call, as
-- this is bound to fail because the primitive operations will not
-- be properly located.
if Present (Comp_Param) or else Present (Param) then
if Needs_No_Actuals (Comp)
and then Is_Array_Type (Etype (Comp))
and then not Expander_Active
then
return True;
else
return False;
end if;
end if;
return True;
end Has_Mode_Conformant_Spec;
---------------------
-- Has_Dereference --
---------------------
function Has_Dereference (Nod : Node_Id) return Boolean is
begin
if Nkind (Nod) = N_Explicit_Dereference then
return True;
-- When expansion is disabled an explicit dereference may not have
-- been inserted, but if this is an access type the indirection makes
-- the call safe.
elsif Is_Access_Type (Etype (Nod)) then
return True;
elsif Nkind_In (Nod, N_Indexed_Component, N_Selected_Component) then
return Has_Dereference (Prefix (Nod));
else
return False;
end if;
end Has_Dereference;
-- Start of processing for Analyze_Selected_Component
begin
Set_Etype (N, Any_Type);
if Is_Overloaded (Name) then
Analyze_Overloaded_Selected_Component (N);
return;
elsif Etype (Name) = Any_Type then
Set_Entity (Sel, Any_Id);
Set_Etype (Sel, Any_Type);
return;
else
Prefix_Type := Etype (Name);
end if;
if Is_Access_Type (Prefix_Type) then
-- A RACW object can never be used as prefix of a selected component
-- since that means it is dereferenced without being a controlling
-- operand of a dispatching operation (RM E.2.2(16/1)). Before
-- reporting an error, we must check whether this is actually a
-- dispatching call in prefix form.
if Is_Remote_Access_To_Class_Wide_Type (Prefix_Type)
and then Comes_From_Source (N)
then
if Try_Object_Operation (N) then
return;
else
Error_Msg_N
("invalid dereference of a remote access-to-class-wide value",
N);
end if;
-- Normal case of selected component applied to access type
else
Error_Msg_NW (Warn_On_Dereference, "?d?implicit dereference", N);
if Is_Entity_Name (Name) then
Pent := Entity (Name);
elsif Nkind (Name) = N_Selected_Component
and then Is_Entity_Name (Selector_Name (Name))
then
Pent := Entity (Selector_Name (Name));
end if;
Prefix_Type := Process_Implicit_Dereference_Prefix (Pent, Name);
end if;
-- If we have an explicit dereference of a remote access-to-class-wide
-- value, then issue an error (see RM-E.2.2(16/1)). However we first
-- have to check for the case of a prefix that is a controlling operand
-- of a prefixed dispatching call, as the dereference is legal in that
-- case. Normally this condition is checked in Validate_Remote_Access_
-- To_Class_Wide_Type, but we have to defer the checking for selected
-- component prefixes because of the prefixed dispatching call case.
-- Note that implicit dereferences are checked for this just above.
elsif Nkind (Name) = N_Explicit_Dereference
and then Is_Remote_Access_To_Class_Wide_Type (Etype (Prefix (Name)))
and then Comes_From_Source (N)
then
if Try_Object_Operation (N) then
return;
else
Error_Msg_N
("invalid dereference of a remote access-to-class-wide value",
N);
end if;
end if;
-- (Ada 2005): if the prefix is the limited view of a type, and
-- the context already includes the full view, use the full view
-- in what follows, either to retrieve a component of to find
-- a primitive operation. If the prefix is an explicit dereference,
-- set the type of the prefix to reflect this transformation.
-- If the non-limited view is itself an incomplete type, get the
-- full view if available.
if From_Limited_With (Prefix_Type)
and then Has_Non_Limited_View (Prefix_Type)
then
Prefix_Type := Get_Full_View (Non_Limited_View (Prefix_Type));
if Nkind (N) = N_Explicit_Dereference then
Set_Etype (Prefix (N), Prefix_Type);
end if;
end if;
if Ekind (Prefix_Type) = E_Private_Subtype then
Prefix_Type := Base_Type (Prefix_Type);
end if;
Type_To_Use := Prefix_Type;
-- For class-wide types, use the entity list of the root type. This
-- indirection is specially important for private extensions because
-- only the root type get switched (not the class-wide type).
if Is_Class_Wide_Type (Prefix_Type) then
Type_To_Use := Root_Type (Prefix_Type);
end if;
-- If the prefix is a single concurrent object, use its name in error
-- messages, rather than that of its anonymous type.
Is_Single_Concurrent_Object :=
Is_Concurrent_Type (Prefix_Type)
and then Is_Internal_Name (Chars (Prefix_Type))
and then not Is_Derived_Type (Prefix_Type)
and then Is_Entity_Name (Name);
Comp := First_Entity (Type_To_Use);
-- If the selector has an original discriminant, the node appears in
-- an instance. Replace the discriminant with the corresponding one
-- in the current discriminated type. For nested generics, this must
-- be done transitively, so note the new original discriminant.
if Nkind (Sel) = N_Identifier
and then In_Instance
and then Present (Original_Discriminant (Sel))
then
Comp := Find_Corresponding_Discriminant (Sel, Prefix_Type);
-- Mark entity before rewriting, for completeness and because
-- subsequent semantic checks might examine the original node.
Set_Entity (Sel, Comp);
Rewrite (Selector_Name (N), New_Occurrence_Of (Comp, Sloc (N)));
Set_Original_Discriminant (Selector_Name (N), Comp);
Set_Etype (N, Etype (Comp));
Check_Implicit_Dereference (N, Etype (Comp));
if Is_Access_Type (Etype (Name)) then
Insert_Explicit_Dereference (Name);
Error_Msg_NW (Warn_On_Dereference, "?d?implicit dereference", N);
end if;
elsif Is_Record_Type (Prefix_Type) then
-- Find component with given name. In an instance, if the node is
-- known as a prefixed call, do not examine components whose
-- visibility may be accidental.
while Present (Comp) and then not Is_Prefixed_Call (N) loop
if Chars (Comp) = Chars (Sel)
and then Is_Visible_Component (Comp, N)
then
Set_Entity_With_Checks (Sel, Comp);
Set_Etype (Sel, Etype (Comp));
if Ekind (Comp) = E_Discriminant then
if Is_Unchecked_Union (Base_Type (Prefix_Type)) then
Error_Msg_N
("cannot reference discriminant of unchecked union",
Sel);
end if;
if Is_Generic_Type (Prefix_Type)
or else
Is_Generic_Type (Root_Type (Prefix_Type))
then
Set_Original_Discriminant (Sel, Comp);
end if;
end if;
-- Resolve the prefix early otherwise it is not possible to
-- build the actual subtype of the component: it may need
-- to duplicate this prefix and duplication is only allowed
-- on fully resolved expressions.
Resolve (Name);
-- Ada 2005 (AI-50217): Check wrong use of incomplete types or
-- subtypes in a package specification.
-- Example:
-- limited with Pkg;
-- package Pkg is
-- type Acc_Inc is access Pkg.T;
-- X : Acc_Inc;
-- N : Natural := X.all.Comp; -- ERROR, limited view
-- end Pkg; -- Comp is not visible
if Nkind (Name) = N_Explicit_Dereference
and then From_Limited_With (Etype (Prefix (Name)))
and then not Is_Potentially_Use_Visible (Etype (Name))
and then Nkind (Parent (Cunit_Entity (Current_Sem_Unit))) =
N_Package_Specification
then
Error_Msg_NE
("premature usage of incomplete}", Prefix (Name),
Etype (Prefix (Name)));
end if;
-- We never need an actual subtype for the case of a selection
-- for a indexed component of a non-packed array, since in
-- this case gigi generates all the checks and can find the
-- necessary bounds information.
-- We also do not need an actual subtype for the case of a
-- first, last, length, or range attribute applied to a
-- non-packed array, since gigi can again get the bounds in
-- these cases (gigi cannot handle the packed case, since it
-- has the bounds of the packed array type, not the original
-- bounds of the type). However, if the prefix is itself a
-- selected component, as in a.b.c (i), gigi may regard a.b.c
-- as a dynamic-sized temporary, so we do generate an actual
-- subtype for this case.
Parent_N := Parent (N);
if not Is_Packed (Etype (Comp))
and then
((Nkind (Parent_N) = N_Indexed_Component
and then Nkind (Name) /= N_Selected_Component)
or else
(Nkind (Parent_N) = N_Attribute_Reference
and then
Nam_In (Attribute_Name (Parent_N), Name_First,
Name_Last,
Name_Length,
Name_Range)))
then
Set_Etype (N, Etype (Comp));
-- If full analysis is not enabled, we do not generate an
-- actual subtype, because in the absence of expansion
-- reference to a formal of a protected type, for example,
-- will not be properly transformed, and will lead to
-- out-of-scope references in gigi.
-- In all other cases, we currently build an actual subtype.
-- It seems likely that many of these cases can be avoided,
-- but right now, the front end makes direct references to the
-- bounds (e.g. in generating a length check), and if we do
-- not make an actual subtype, we end up getting a direct
-- reference to a discriminant, which will not do.
elsif Full_Analysis then
Act_Decl :=
Build_Actual_Subtype_Of_Component (Etype (Comp), N);
Insert_Action (N, Act_Decl);
if No (Act_Decl) then
Set_Etype (N, Etype (Comp));
else
-- Component type depends on discriminants. Enter the
-- main attributes of the subtype.
declare
Subt : constant Entity_Id :=
Defining_Identifier (Act_Decl);
begin
Set_Etype (Subt, Base_Type (Etype (Comp)));
Set_Ekind (Subt, Ekind (Etype (Comp)));
Set_Etype (N, Subt);
end;
end if;
-- If Full_Analysis not enabled, just set the Etype
else
Set_Etype (N, Etype (Comp));
end if;
Check_Implicit_Dereference (N, Etype (N));
return;
end if;
-- If the prefix is a private extension, check only the visible
-- components of the partial view. This must include the tag,
-- which can appear in expanded code in a tag check.
if Ekind (Type_To_Use) = E_Record_Type_With_Private
and then Chars (Selector_Name (N)) /= Name_uTag
then
exit when Comp = Last_Entity (Type_To_Use);
end if;
Next_Entity (Comp);
end loop;
-- Ada 2005 (AI-252): The selected component can be interpreted as
-- a prefixed view of a subprogram. Depending on the context, this is
-- either a name that can appear in a renaming declaration, or part
-- of an enclosing call given in prefix form.
-- Ada 2005 (AI05-0030): In the case of dispatching requeue, the
-- selected component should resolve to a name.
if Ada_Version >= Ada_2005
and then Is_Tagged_Type (Prefix_Type)
and then not Is_Concurrent_Type (Prefix_Type)
then
if Nkind (Parent (N)) = N_Generic_Association
or else Nkind (Parent (N)) = N_Requeue_Statement
or else Nkind (Parent (N)) = N_Subprogram_Renaming_Declaration
then
if Find_Primitive_Operation (N) then
return;
end if;
elsif Try_Object_Operation (N) then
return;
end if;
-- If the transformation fails, it will be necessary to redo the
-- analysis with all errors enabled, to indicate candidate
-- interpretations and reasons for each failure ???
end if;
elsif Is_Private_Type (Prefix_Type) then
-- Allow access only to discriminants of the type. If the type has
-- no full view, gigi uses the parent type for the components, so we
-- do the same here.
if No (Full_View (Prefix_Type)) then
Type_To_Use := Root_Type (Base_Type (Prefix_Type));
Comp := First_Entity (Type_To_Use);
end if;
while Present (Comp) loop
if Chars (Comp) = Chars (Sel) then
if Ekind (Comp) = E_Discriminant then
Set_Entity_With_Checks (Sel, Comp);
Generate_Reference (Comp, Sel);
Set_Etype (Sel, Etype (Comp));
Set_Etype (N, Etype (Comp));
Check_Implicit_Dereference (N, Etype (N));
if Is_Generic_Type (Prefix_Type)
or else Is_Generic_Type (Root_Type (Prefix_Type))
then
Set_Original_Discriminant (Sel, Comp);
end if;
-- Before declaring an error, check whether this is tagged
-- private type and a call to a primitive operation.
elsif Ada_Version >= Ada_2005
and then Is_Tagged_Type (Prefix_Type)
and then Try_Object_Operation (N)
then
return;
else
Error_Msg_Node_2 := First_Subtype (Prefix_Type);
Error_Msg_NE ("invisible selector& for }", N, Sel);
Set_Entity (Sel, Any_Id);
Set_Etype (N, Any_Type);
end if;
return;
end if;
Next_Entity (Comp);
end loop;
elsif Is_Concurrent_Type (Prefix_Type) then
-- Find visible operation with given name. For a protected type,
-- the possible candidates are discriminants, entries or protected
-- procedures. For a task type, the set can only include entries or
-- discriminants if the task type is not an enclosing scope. If it
-- is an enclosing scope (e.g. in an inner task) then all entities
-- are visible, but the prefix must denote the enclosing scope, i.e.
-- can only be a direct name or an expanded name.
Set_Etype (Sel, Any_Type);
In_Scope := In_Open_Scopes (Prefix_Type);
while Present (Comp) loop
-- Do not examine private operations of the type if not within
-- its scope.
if Chars (Comp) = Chars (Sel) then
if Is_Overloadable (Comp)
and then (In_Scope
or else Comp /= First_Private_Entity (Type_To_Use))
then
Add_One_Interp (Sel, Comp, Etype (Comp));
-- If the prefix is tagged, the correct interpretation may
-- lie in the primitive or class-wide operations of the
-- type. Perform a simple conformance check to determine
-- whether Try_Object_Operation should be invoked even if
-- a visible entity is found.
if Is_Tagged_Type (Prefix_Type)
and then Nkind_In (Parent (N), N_Function_Call,
N_Indexed_Component,
N_Procedure_Call_Statement)
and then Has_Mode_Conformant_Spec (Comp)
then
Has_Candidate := True;
end if;
-- Note: a selected component may not denote a component of a
-- protected type (4.1.3(7)).
elsif Ekind_In (Comp, E_Discriminant, E_Entry_Family)
or else (In_Scope
and then not Is_Protected_Type (Prefix_Type)
and then Is_Entity_Name (Name))
then
Set_Entity_With_Checks (Sel, Comp);
Generate_Reference (Comp, Sel);
-- The selector is not overloadable, so we have a candidate
-- interpretation.
Has_Candidate := True;
else
goto Next_Comp;
end if;
Set_Etype (Sel, Etype (Comp));
Set_Etype (N, Etype (Comp));
if Ekind (Comp) = E_Discriminant then
Set_Original_Discriminant (Sel, Comp);
end if;
-- For access type case, introduce explicit dereference for
-- more uniform treatment of entry calls.
if Is_Access_Type (Etype (Name)) then
Insert_Explicit_Dereference (Name);
Error_Msg_NW
(Warn_On_Dereference, "?d?implicit dereference", N);
end if;
end if;
<<Next_Comp>>
Next_Entity (Comp);
exit when not In_Scope
and then
Comp = First_Private_Entity (Base_Type (Prefix_Type));
end loop;
-- If the scope is a current instance, the prefix cannot be an
-- expression of the same type, unless the selector designates a
-- public operation (otherwise that would represent an attempt to
-- reach an internal entity of another synchronized object).
-- This is legal if prefix is an access to such type and there is
-- a dereference, or is a component with a dereferenced prefix.
-- It is also legal if the prefix is a component of a task type,
-- and the selector is one of the task operations.
if In_Scope
and then not Is_Entity_Name (Name)
and then not Has_Dereference (Name)
then
if Is_Task_Type (Prefix_Type)
and then Present (Entity (Sel))
and then Ekind_In (Entity (Sel), E_Entry, E_Entry_Family)
then
null;
else
Error_Msg_NE
("invalid reference to internal operation of some object of "
& "type &", N, Type_To_Use);
Set_Entity (Sel, Any_Id);
Set_Etype (Sel, Any_Type);
return;
end if;
end if;
-- If there is no visible entity with the given name or none of the
-- visible entities are plausible interpretations, check whether
-- there is some other primitive operation with that name.
if Ada_Version >= Ada_2005 and then Is_Tagged_Type (Prefix_Type) then
if (Etype (N) = Any_Type
or else not Has_Candidate)
and then Try_Object_Operation (N)
then
return;
-- If the context is not syntactically a procedure call, it
-- may be a call to a primitive function declared outside of
-- the synchronized type.
-- If the context is a procedure call, there might still be
-- an overloading between an entry and a primitive procedure
-- declared outside of the synchronized type, called in prefix
-- notation. This is harder to disambiguate because in one case
-- the controlling formal is implicit ???
elsif Nkind (Parent (N)) /= N_Procedure_Call_Statement
and then Nkind (Parent (N)) /= N_Indexed_Component
and then Try_Object_Operation (N)
then
return;
end if;
-- Ada 2012 (AI05-0090-1): If we found a candidate of a call to an
-- entry or procedure of a tagged concurrent type we must check
-- if there are class-wide subprograms covering the primitive. If
-- true then Try_Object_Operation reports the error.
if Has_Candidate
and then Is_Concurrent_Type (Prefix_Type)
and then Nkind (Parent (N)) = N_Procedure_Call_Statement
then
-- Duplicate the call. This is required to avoid problems with
-- the tree transformations performed by Try_Object_Operation.
-- Set properly the parent of the copied call, because it is
-- about to be reanalyzed.
declare
Par : constant Node_Id := New_Copy_Tree (Parent (N));
begin
Set_Parent (Par, Parent (Parent (N)));
if Try_Object_Operation
(Sinfo.Name (Par), CW_Test_Only => True)
then
return;
end if;
end;
end if;
end if;
if Etype (N) = Any_Type and then Is_Protected_Type (Prefix_Type) then
-- Case of a prefix of a protected type: selector might denote
-- an invisible private component.
Comp := First_Private_Entity (Base_Type (Prefix_Type));
while Present (Comp) and then Chars (Comp) /= Chars (Sel) loop
Next_Entity (Comp);
end loop;
if Present (Comp) then
if Is_Single_Concurrent_Object then
Error_Msg_Node_2 := Entity (Name);
Error_Msg_NE ("invisible selector& for &", N, Sel);
else
Error_Msg_Node_2 := First_Subtype (Prefix_Type);
Error_Msg_NE ("invisible selector& for }", N, Sel);
end if;
return;
end if;
end if;
Set_Is_Overloaded (N, Is_Overloaded (Sel));
else
-- Invalid prefix
Error_Msg_NE ("invalid prefix in selected component&", N, Sel);
end if;
-- If N still has no type, the component is not defined in the prefix
if Etype (N) = Any_Type then
if Is_Single_Concurrent_Object then
Error_Msg_Node_2 := Entity (Name);
Error_Msg_NE ("no selector& for&", N, Sel);
Check_Misspelled_Selector (Type_To_Use, Sel);
-- If this is a derived formal type, the parent may have different
-- visibility at this point. Try for an inherited component before
-- reporting an error.
elsif Is_Generic_Type (Prefix_Type)
and then Ekind (Prefix_Type) = E_Record_Type_With_Private
and then Prefix_Type /= Etype (Prefix_Type)
and then Is_Record_Type (Etype (Prefix_Type))
then
Set_Etype (Prefix (N), Etype (Prefix_Type));
Analyze_Selected_Component (N);
return;
-- Similarly, if this is the actual for a formal derived type, or
-- a derived type thereof, the component inherited from the generic
-- parent may not be visible in the actual, but the selected
-- component is legal. Climb up the derivation chain of the generic
-- parent type until we find the proper ancestor type.
elsif In_Instance and then Is_Tagged_Type (Prefix_Type) then
declare
Par : Entity_Id := Prefix_Type;
begin
-- Climb up derivation chain to generic actual subtype
while not Is_Generic_Actual_Type (Par) loop
if Ekind (Par) = E_Record_Type then
Par := Parent_Subtype (Par);
exit when No (Par);
else
exit when Par = Etype (Par);
Par := Etype (Par);
end if;
end loop;
if Present (Par) and then Is_Generic_Actual_Type (Par) then
-- Now look for component in ancestor types
Par := Generic_Parent_Type (Declaration_Node (Par));
loop
Find_Component_In_Instance (Par);
exit when Present (Entity (Sel))
or else Par = Etype (Par);
Par := Etype (Par);
end loop;
-- Another special case: the type is an extension of a private
-- type T, is an actual in an instance, and we are in the body
-- of the instance, so the generic body had a full view of the
-- type declaration for T or of some ancestor that defines the
-- component in question.
elsif Is_Derived_Type (Type_To_Use)
and then Used_As_Generic_Actual (Type_To_Use)
and then In_Instance_Body
then
Find_Component_In_Instance (Parent_Subtype (Type_To_Use));
-- In ASIS mode the generic parent type may be absent. Examine
-- the parent type directly for a component that may have been
-- visible in a parent generic unit.
elsif Is_Derived_Type (Prefix_Type) then
Par := Etype (Prefix_Type);
Find_Component_In_Instance (Par);
end if;
end;
-- The search above must have eventually succeeded, since the
-- selected component was legal in the generic.
if No (Entity (Sel)) then
raise Program_Error;
end if;
return;
-- Component not found, specialize error message when appropriate
else
if Ekind (Prefix_Type) = E_Record_Subtype then
-- Check whether this is a component of the base type which
-- is absent from a statically constrained subtype. This will
-- raise constraint error at run time, but is not a compile-
-- time error. When the selector is illegal for base type as
-- well fall through and generate a compilation error anyway.
Comp := First_Component (Base_Type (Prefix_Type));
while Present (Comp) loop
if Chars (Comp) = Chars (Sel)
and then Is_Visible_Component (Comp)
then
Set_Entity_With_Checks (Sel, Comp);
Generate_Reference (Comp, Sel);
Set_Etype (Sel, Etype (Comp));
Set_Etype (N, Etype (Comp));
-- Emit appropriate message. The node will be replaced
-- by an appropriate raise statement.
-- Note that in SPARK mode, as with all calls to apply a
-- compile time constraint error, this will be made into
-- an error to simplify the processing of the formal
-- verification backend.
Apply_Compile_Time_Constraint_Error
(N, "component not present in }??",
CE_Discriminant_Check_Failed,
Ent => Prefix_Type, Rep => False);
Set_Raises_Constraint_Error (N);
return;
end if;
Next_Component (Comp);
end loop;
end if;
Error_Msg_Node_2 := First_Subtype (Prefix_Type);
Error_Msg_NE ("no selector& for}", N, Sel);
-- Add information in the case of an incomplete prefix
if Is_Incomplete_Type (Type_To_Use) then
declare
Inc : constant Entity_Id := First_Subtype (Type_To_Use);
begin
if From_Limited_With (Scope (Type_To_Use)) then
Error_Msg_NE
("\limited view of& has no components", N, Inc);
else
Error_Msg_NE
("\premature usage of incomplete type&", N, Inc);
if Nkind (Parent (Inc)) =
N_Incomplete_Type_Declaration
then
-- Record location of premature use in entity so that
-- a continuation message is generated when the
-- completion is seen.
Set_Premature_Use (Parent (Inc), N);
end if;
end if;
end;
end if;
Check_Misspelled_Selector (Type_To_Use, Sel);
end if;
Set_Entity (Sel, Any_Id);
Set_Etype (Sel, Any_Type);
end if;
end Analyze_Selected_Component;
---------------------------
-- Analyze_Short_Circuit --
---------------------------
procedure Analyze_Short_Circuit (N : Node_Id) is
L : constant Node_Id := Left_Opnd (N);
R : constant Node_Id := Right_Opnd (N);
Ind : Interp_Index;
It : Interp;
begin
Analyze_Expression (L);
Analyze_Expression (R);
Set_Etype (N, Any_Type);
if not Is_Overloaded (L) then
if Root_Type (Etype (L)) = Standard_Boolean
and then Has_Compatible_Type (R, Etype (L))
then
Add_One_Interp (N, Etype (L), Etype (L));
end if;
else
Get_First_Interp (L, Ind, It);
while Present (It.Typ) loop
if Root_Type (It.Typ) = Standard_Boolean
and then Has_Compatible_Type (R, It.Typ)
then
Add_One_Interp (N, It.Typ, It.Typ);
end if;
Get_Next_Interp (Ind, It);
end loop;
end if;
-- Here we have failed to find an interpretation. Clearly we know that
-- it is not the case that both operands can have an interpretation of
-- Boolean, but this is by far the most likely intended interpretation.
-- So we simply resolve both operands as Booleans, and at least one of
-- these resolutions will generate an error message, and we do not need
-- to give another error message on the short circuit operation itself.
if Etype (N) = Any_Type then
Resolve (L, Standard_Boolean);
Resolve (R, Standard_Boolean);
Set_Etype (N, Standard_Boolean);
end if;
end Analyze_Short_Circuit;
-------------------
-- Analyze_Slice --
-------------------
procedure Analyze_Slice (N : Node_Id) is
D : constant Node_Id := Discrete_Range (N);
P : constant Node_Id := Prefix (N);
Array_Type : Entity_Id;
Index_Type : Entity_Id;
procedure Analyze_Overloaded_Slice;
-- If the prefix is overloaded, select those interpretations that
-- yield a one-dimensional array type.
------------------------------
-- Analyze_Overloaded_Slice --
------------------------------
procedure Analyze_Overloaded_Slice is
I : Interp_Index;
It : Interp;
Typ : Entity_Id;
begin
Set_Etype (N, Any_Type);
Get_First_Interp (P, I, It);
while Present (It.Nam) loop
Typ := It.Typ;
if Is_Access_Type (Typ) then
Typ := Designated_Type (Typ);
Error_Msg_NW
(Warn_On_Dereference, "?d?implicit dereference", N);
end if;
if Is_Array_Type (Typ)
and then Number_Dimensions (Typ) = 1
and then Has_Compatible_Type (D, Etype (First_Index (Typ)))
then
Add_One_Interp (N, Typ, Typ);
end if;
Get_Next_Interp (I, It);
end loop;
if Etype (N) = Any_Type then
Error_Msg_N ("expect array type in prefix of slice", N);
end if;
end Analyze_Overloaded_Slice;
-- Start of processing for Analyze_Slice
begin
if Comes_From_Source (N) then
Check_SPARK_05_Restriction ("slice is not allowed", N);
end if;
Analyze (P);
Analyze (D);
if Is_Overloaded (P) then
Analyze_Overloaded_Slice;
else
Array_Type := Etype (P);
Set_Etype (N, Any_Type);
if Is_Access_Type (Array_Type) then
Array_Type := Designated_Type (Array_Type);
Error_Msg_NW (Warn_On_Dereference, "?d?implicit dereference", N);
end if;
if not Is_Array_Type (Array_Type) then
Wrong_Type (P, Any_Array);
elsif Number_Dimensions (Array_Type) > 1 then
Error_Msg_N
("type is not one-dimensional array in slice prefix", N);
else
if Ekind (Array_Type) = E_String_Literal_Subtype then
Index_Type := Etype (String_Literal_Low_Bound (Array_Type));
else
Index_Type := Etype (First_Index (Array_Type));
end if;
if not Has_Compatible_Type (D, Index_Type) then
Wrong_Type (D, Index_Type);
else
Set_Etype (N, Array_Type);
end if;
end if;
end if;
end Analyze_Slice;
-----------------------------
-- Analyze_Type_Conversion --
-----------------------------
procedure Analyze_Type_Conversion (N : Node_Id) is
Expr : constant Node_Id := Expression (N);
Typ : Entity_Id;
begin
-- If Conversion_OK is set, then the Etype is already set, and the only
-- processing required is to analyze the expression. This is used to
-- construct certain "illegal" conversions which are not allowed by Ada
-- semantics, but can be handled by Gigi, see Sinfo for further details.
if Conversion_OK (N) then
Analyze (Expr);
return;
end if;
-- Otherwise full type analysis is required, as well as some semantic
-- checks to make sure the argument of the conversion is appropriate.
Find_Type (Subtype_Mark (N));
Typ := Entity (Subtype_Mark (N));
Set_Etype (N, Typ);
Check_Fully_Declared (Typ, N);
Analyze_Expression (Expr);
Validate_Remote_Type_Type_Conversion (N);
-- Only remaining step is validity checks on the argument. These
-- are skipped if the conversion does not come from the source.
if not Comes_From_Source (N) then
return;
-- If there was an error in a generic unit, no need to replicate the
-- error message. Conversely, constant-folding in the generic may
-- transform the argument of a conversion into a string literal, which
-- is legal. Therefore the following tests are not performed in an
-- instance. The same applies to an inlined body.
elsif In_Instance or In_Inlined_Body then
return;
elsif Nkind (Expr) = N_Null then
Error_Msg_N ("argument of conversion cannot be null", N);
Error_Msg_N ("\use qualified expression instead", N);
Set_Etype (N, Any_Type);
elsif Nkind (Expr) = N_Aggregate then
Error_Msg_N ("argument of conversion cannot be aggregate", N);
Error_Msg_N ("\use qualified expression instead", N);
elsif Nkind (Expr) = N_Allocator then
Error_Msg_N ("argument of conversion cannot be an allocator", N);
Error_Msg_N ("\use qualified expression instead", N);
elsif Nkind (Expr) = N_String_Literal then
Error_Msg_N ("argument of conversion cannot be string literal", N);
Error_Msg_N ("\use qualified expression instead", N);
elsif Nkind (Expr) = N_Character_Literal then
if Ada_Version = Ada_83 then
Resolve (Expr, Typ);
else
Error_Msg_N ("argument of conversion cannot be character literal",
N);
Error_Msg_N ("\use qualified expression instead", N);
end if;
elsif Nkind (Expr) = N_Attribute_Reference
and then Nam_In (Attribute_Name (Expr), Name_Access,
Name_Unchecked_Access,
Name_Unrestricted_Access)
then
Error_Msg_N ("argument of conversion cannot be access", N);
Error_Msg_N ("\use qualified expression instead", N);
end if;
-- A formal parameter of a specific tagged type whose related subprogram
-- is subject to pragma Extensions_Visible with value "False" cannot
-- appear in a class-wide conversion (SPARK RM 6.1.7(3)). Do not check
-- internally generated expressions.
if Is_Class_Wide_Type (Typ)
and then Comes_From_Source (Expr)
and then Is_EVF_Expression (Expr)
then
Error_Msg_N
("formal parameter cannot be converted to class-wide type when "
& "Extensions_Visible is False", Expr);
end if;
end Analyze_Type_Conversion;
----------------------
-- Analyze_Unary_Op --
----------------------
procedure Analyze_Unary_Op (N : Node_Id) is
R : constant Node_Id := Right_Opnd (N);
Op_Id : Entity_Id := Entity (N);
begin
Set_Etype (N, Any_Type);
Candidate_Type := Empty;
Analyze_Expression (R);
if Present (Op_Id) then
if Ekind (Op_Id) = E_Operator then
Find_Unary_Types (R, Op_Id, N);
else
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
else
Op_Id := Get_Name_Entity_Id (Chars (N));
while Present (Op_Id) loop
if Ekind (Op_Id) = E_Operator then
if No (Next_Entity (First_Entity (Op_Id))) then
Find_Unary_Types (R, Op_Id, N);
end if;
elsif Is_Overloadable (Op_Id) then
Analyze_User_Defined_Unary_Op (N, Op_Id);
end if;
Op_Id := Homonym (Op_Id);
end loop;
end if;
Operator_Check (N);
end Analyze_Unary_Op;
----------------------------------
-- Analyze_Unchecked_Expression --
----------------------------------
procedure Analyze_Unchecked_Expression (N : Node_Id) is
begin
Analyze (Expression (N), Suppress => All_Checks);
Set_Etype (N, Etype (Expression (N)));
Save_Interps (Expression (N), N);
end Analyze_Unchecked_Expression;
---------------------------------------
-- Analyze_Unchecked_Type_Conversion --
---------------------------------------
procedure Analyze_Unchecked_Type_Conversion (N : Node_Id) is
begin
Find_Type (Subtype_Mark (N));
Analyze_Expression (Expression (N));
Set_Etype (N, Entity (Subtype_Mark (N)));
end Analyze_Unchecked_Type_Conversion;
------------------------------------
-- Analyze_User_Defined_Binary_Op --
------------------------------------
procedure Analyze_User_Defined_Binary_Op
(N : Node_Id;
Op_Id : Entity_Id)
is
begin
-- Only do analysis if the operator Comes_From_Source, since otherwise
-- the operator was generated by the expander, and all such operators
-- always refer to the operators in package Standard.
if Comes_From_Source (N) then
declare
F1 : constant Entity_Id := First_Formal (Op_Id);
F2 : constant Entity_Id := Next_Formal (F1);
begin
-- Verify that Op_Id is a visible binary function. Note that since
-- we know Op_Id is overloaded, potentially use visible means use
-- visible for sure (RM 9.4(11)).
if Ekind (Op_Id) = E_Function
and then Present (F2)
and then (Is_Immediately_Visible (Op_Id)
or else Is_Potentially_Use_Visible (Op_Id))
and then Has_Compatible_Type (Left_Opnd (N), Etype (F1))
and then Has_Compatible_Type (Right_Opnd (N), Etype (F2))
then
Add_One_Interp (N, Op_Id, Etype (Op_Id));
-- If the left operand is overloaded, indicate that the current
-- type is a viable candidate. This is redundant in most cases,
-- but for equality and comparison operators where the context
-- does not impose a type on the operands, setting the proper
-- type is necessary to avoid subsequent ambiguities during
-- resolution, when both user-defined and predefined operators
-- may be candidates.
if Is_Overloaded (Left_Opnd (N)) then
Set_Etype (Left_Opnd (N), Etype (F1));
end if;
if Debug_Flag_E then
Write_Str ("user defined operator ");
Write_Name (Chars (Op_Id));
Write_Str (" on node ");
Write_Int (Int (N));
Write_Eol;
end if;
end if;
end;
end if;
end Analyze_User_Defined_Binary_Op;
-----------------------------------
-- Analyze_User_Defined_Unary_Op --
-----------------------------------
procedure Analyze_User_Defined_Unary_Op
(N : Node_Id;
Op_Id : Entity_Id)
is
begin
-- Only do analysis if the operator Comes_From_Source, since otherwise
-- the operator was generated by the expander, and all such operators
-- always refer to the operators in package Standard.
if Comes_From_Source (N) then
declare
F : constant Entity_Id := First_Formal (Op_Id);
begin
-- Verify that Op_Id is a visible unary function. Note that since
-- we know Op_Id is overloaded, potentially use visible means use
-- visible for sure (RM 9.4(11)).
if Ekind (Op_Id) = E_Function
and then No (Next_Formal (F))
and then (Is_Immediately_Visible (Op_Id)
or else Is_Potentially_Use_Visible (Op_Id))
and then Has_Compatible_Type (Right_Opnd (N), Etype (F))
then
Add_One_Interp (N, Op_Id, Etype (Op_Id));
end if;
end;
end if;
end Analyze_User_Defined_Unary_Op;
---------------------------
-- Check_Arithmetic_Pair --
---------------------------
procedure Check_Arithmetic_Pair
(T1, T2 : Entity_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Op_Name : constant Name_Id := Chars (Op_Id);
function Has_Fixed_Op (Typ : Entity_Id; Op : Entity_Id) return Boolean;
-- Check whether the fixed-point type Typ has a user-defined operator
-- (multiplication or division) that should hide the corresponding
-- predefined operator. Used to implement Ada 2005 AI-264, to make
-- such operators more visible and therefore useful.
--
-- If the name of the operation is an expanded name with prefix
-- Standard, the predefined universal fixed operator is available,
-- as specified by AI-420 (RM 4.5.5 (19.1/2)).
function Specific_Type (T1, T2 : Entity_Id) return Entity_Id;
-- Get specific type (i.e. non-universal type if there is one)
------------------
-- Has_Fixed_Op --
------------------
function Has_Fixed_Op (Typ : Entity_Id; Op : Entity_Id) return Boolean is
Bas : constant Entity_Id := Base_Type (Typ);
Ent : Entity_Id;
F1 : Entity_Id;
F2 : Entity_Id;
begin
-- If the universal_fixed operation is given explicitly the rule
-- concerning primitive operations of the type do not apply.
if Nkind (N) = N_Function_Call
and then Nkind (Name (N)) = N_Expanded_Name
and then Entity (Prefix (Name (N))) = Standard_Standard
then
return False;
end if;
-- The operation is treated as primitive if it is declared in the
-- same scope as the type, and therefore on the same entity chain.
Ent := Next_Entity (Typ);
while Present (Ent) loop
if Chars (Ent) = Chars (Op) then
F1 := First_Formal (Ent);
F2 := Next_Formal (F1);
-- The operation counts as primitive if either operand or
-- result are of the given base type, and both operands are
-- fixed point types.
if (Base_Type (Etype (F1)) = Bas
and then Is_Fixed_Point_Type (Etype (F2)))
or else
(Base_Type (Etype (F2)) = Bas
and then Is_Fixed_Point_Type (Etype (F1)))
or else
(Base_Type (Etype (Ent)) = Bas
and then Is_Fixed_Point_Type (Etype (F1))
and then Is_Fixed_Point_Type (Etype (F2)))
then
return True;
end if;
end if;
Next_Entity (Ent);
end loop;
return False;
end Has_Fixed_Op;
-------------------
-- Specific_Type --
-------------------
function Specific_Type (T1, T2 : Entity_Id) return Entity_Id is
begin
if T1 = Universal_Integer or else T1 = Universal_Real then
return Base_Type (T2);
else
return Base_Type (T1);
end if;
end Specific_Type;
-- Start of processing for Check_Arithmetic_Pair
begin
if Nam_In (Op_Name, Name_Op_Add, Name_Op_Subtract) then
if Is_Numeric_Type (T1)
and then Is_Numeric_Type (T2)
and then (Covers (T1 => T1, T2 => T2)
or else
Covers (T1 => T2, T2 => T1))
then
Add_One_Interp (N, Op_Id, Specific_Type (T1, T2));
end if;
elsif Nam_In (Op_Name, Name_Op_Multiply, Name_Op_Divide) then
if Is_Fixed_Point_Type (T1)
and then (Is_Fixed_Point_Type (T2) or else T2 = Universal_Real)
then
-- If Treat_Fixed_As_Integer is set then the Etype is already set
-- and no further processing is required (this is the case of an
-- operator constructed by Exp_Fixd for a fixed point operation)
-- Otherwise add one interpretation with universal fixed result
-- If the operator is given in functional notation, it comes
-- from source and Fixed_As_Integer cannot apply.
if (Nkind (N) not in N_Op
or else not Treat_Fixed_As_Integer (N))
and then
(not Has_Fixed_Op (T1, Op_Id)
or else Nkind (Parent (N)) = N_Type_Conversion)
then
Add_One_Interp (N, Op_Id, Universal_Fixed);
end if;
elsif Is_Fixed_Point_Type (T2)
and then (Nkind (N) not in N_Op
or else not Treat_Fixed_As_Integer (N))
and then T1 = Universal_Real
and then
(not Has_Fixed_Op (T1, Op_Id)
or else Nkind (Parent (N)) = N_Type_Conversion)
then
Add_One_Interp (N, Op_Id, Universal_Fixed);
elsif Is_Numeric_Type (T1)
and then Is_Numeric_Type (T2)
and then (Covers (T1 => T1, T2 => T2)
or else
Covers (T1 => T2, T2 => T1))
then
Add_One_Interp (N, Op_Id, Specific_Type (T1, T2));
elsif Is_Fixed_Point_Type (T1)
and then (Base_Type (T2) = Base_Type (Standard_Integer)
or else T2 = Universal_Integer)
then
Add_One_Interp (N, Op_Id, T1);
elsif T2 = Universal_Real
and then Base_Type (T1) = Base_Type (Standard_Integer)
and then Op_Name = Name_Op_Multiply
then
Add_One_Interp (N, Op_Id, Any_Fixed);
elsif T1 = Universal_Real
and then Base_Type (T2) = Base_Type (Standard_Integer)
then
Add_One_Interp (N, Op_Id, Any_Fixed);
elsif Is_Fixed_Point_Type (T2)
and then (Base_Type (T1) = Base_Type (Standard_Integer)
or else T1 = Universal_Integer)
and then Op_Name = Name_Op_Multiply
then
Add_One_Interp (N, Op_Id, T2);
elsif T1 = Universal_Real and then T2 = Universal_Integer then
Add_One_Interp (N, Op_Id, T1);
elsif T2 = Universal_Real
and then T1 = Universal_Integer
and then Op_Name = Name_Op_Multiply
then
Add_One_Interp (N, Op_Id, T2);
end if;
elsif Op_Name = Name_Op_Mod or else Op_Name = Name_Op_Rem then
-- Note: The fixed-point operands case with Treat_Fixed_As_Integer
-- set does not require any special processing, since the Etype is
-- already set (case of operation constructed by Exp_Fixed).
if Is_Integer_Type (T1)
and then (Covers (T1 => T1, T2 => T2)
or else
Covers (T1 => T2, T2 => T1))
then
Add_One_Interp (N, Op_Id, Specific_Type (T1, T2));
end if;
elsif Op_Name = Name_Op_Expon then
if Is_Numeric_Type (T1)
and then not Is_Fixed_Point_Type (T1)
and then (Base_Type (T2) = Base_Type (Standard_Integer)
or else T2 = Universal_Integer)
then
Add_One_Interp (N, Op_Id, Base_Type (T1));
end if;
else pragma Assert (Nkind (N) in N_Op_Shift);
-- If not one of the predefined operators, the node may be one
-- of the intrinsic functions. Its kind is always specific, and
-- we can use it directly, rather than the name of the operation.
if Is_Integer_Type (T1)
and then (Base_Type (T2) = Base_Type (Standard_Integer)
or else T2 = Universal_Integer)
then
Add_One_Interp (N, Op_Id, Base_Type (T1));
end if;
end if;
end Check_Arithmetic_Pair;
-------------------------------
-- Check_Misspelled_Selector --
-------------------------------
procedure Check_Misspelled_Selector
(Prefix : Entity_Id;
Sel : Node_Id)
is
Max_Suggestions : constant := 2;
Nr_Of_Suggestions : Natural := 0;
Suggestion_1 : Entity_Id := Empty;
Suggestion_2 : Entity_Id := Empty;
Comp : Entity_Id;
begin
-- All the components of the prefix of selector Sel are matched against
-- Sel and a count is maintained of possible misspellings. When at
-- the end of the analysis there are one or two (not more) possible
-- misspellings, these misspellings will be suggested as possible
-- correction.
if not (Is_Private_Type (Prefix) or else Is_Record_Type (Prefix)) then
-- Concurrent types should be handled as well ???
return;
end if;
Comp := First_Entity (Prefix);
while Nr_Of_Suggestions <= Max_Suggestions and then Present (Comp) loop
if Is_Visible_Component (Comp) then
if Is_Bad_Spelling_Of (Chars (Comp), Chars (Sel)) then
Nr_Of_Suggestions := Nr_Of_Suggestions + 1;
case Nr_Of_Suggestions is
when 1 => Suggestion_1 := Comp;
when 2 => Suggestion_2 := Comp;
when others => null;
end case;
end if;
end if;
Comp := Next_Entity (Comp);
end loop;
-- Report at most two suggestions
if Nr_Of_Suggestions = 1 then
Error_Msg_NE -- CODEFIX
("\possible misspelling of&", Sel, Suggestion_1);
elsif Nr_Of_Suggestions = 2 then
Error_Msg_Node_2 := Suggestion_2;
Error_Msg_NE -- CODEFIX
("\possible misspelling of& or&", Sel, Suggestion_1);
end if;
end Check_Misspelled_Selector;
----------------------
-- Defined_In_Scope --
----------------------
function Defined_In_Scope (T : Entity_Id; S : Entity_Id) return Boolean
is
S1 : constant Entity_Id := Scope (Base_Type (T));
begin
return S1 = S
or else (S1 = System_Aux_Id and then S = Scope (S1));
end Defined_In_Scope;
-------------------
-- Diagnose_Call --
-------------------
procedure Diagnose_Call (N : Node_Id; Nam : Node_Id) is
Actual : Node_Id;
X : Interp_Index;
It : Interp;
Err_Mode : Boolean;
New_Nam : Node_Id;
Void_Interp_Seen : Boolean := False;
Success : Boolean;
pragma Warnings (Off, Boolean);
begin
if Ada_Version >= Ada_2005 then
Actual := First_Actual (N);
while Present (Actual) loop
-- Ada 2005 (AI-50217): Post an error in case of premature
-- usage of an entity from the limited view.
if not Analyzed (Etype (Actual))
and then From_Limited_With (Etype (Actual))
then
Error_Msg_Qual_Level := 1;
Error_Msg_NE
("missing with_clause for scope of imported type&",
Actual, Etype (Actual));
Error_Msg_Qual_Level := 0;
end if;
Next_Actual (Actual);
end loop;
end if;
-- Before listing the possible candidates, check whether this is
-- a prefix of a selected component that has been rewritten as a
-- parameterless function call because there is a callable candidate
-- interpretation. If there is a hidden package in the list of homonyms
-- of the function name (bad programming style in any case) suggest that
-- this is the intended entity.
if No (Parameter_Associations (N))
and then Nkind (Parent (N)) = N_Selected_Component
and then Nkind (Parent (Parent (N))) in N_Declaration
and then Is_Overloaded (Nam)
then
declare
Ent : Entity_Id;
begin
Ent := Current_Entity (Nam);
while Present (Ent) loop
if Ekind (Ent) = E_Package then
Error_Msg_N
("no legal interpretations as function call,!", Nam);
Error_Msg_NE ("\package& is not visible", N, Ent);
Rewrite (Parent (N),
New_Occurrence_Of (Any_Type, Sloc (N)));
return;
end if;
Ent := Homonym (Ent);
end loop;
end;
end if;
-- Analyze each candidate call again, with full error reporting for
-- each.
Error_Msg_N
("no candidate interpretations match the actuals:!", Nam);
Err_Mode := All_Errors_Mode;
All_Errors_Mode := True;
-- If this is a call to an operation of a concurrent type,
-- the failed interpretations have been removed from the
-- name. Recover them to provide full diagnostics.
if Nkind (Parent (Nam)) = N_Selected_Component then
Set_Entity (Nam, Empty);
New_Nam := New_Copy_Tree (Parent (Nam));
Set_Is_Overloaded (New_Nam, False);
Set_Is_Overloaded (Selector_Name (New_Nam), False);
Set_Parent (New_Nam, Parent (Parent (Nam)));
Analyze_Selected_Component (New_Nam);
Get_First_Interp (Selector_Name (New_Nam), X, It);
else
Get_First_Interp (Nam, X, It);
end if;
while Present (It.Nam) loop
if Etype (It.Nam) = Standard_Void_Type then
Void_Interp_Seen := True;
end if;
Analyze_One_Call (N, It.Nam, True, Success);
Get_Next_Interp (X, It);
end loop;
if Nkind (N) = N_Function_Call then
Get_First_Interp (Nam, X, It);
while Present (It.Nam) loop
if Ekind_In (It.Nam, E_Function, E_Operator) then
return;
else
Get_Next_Interp (X, It);
end if;
end loop;
-- If all interpretations are procedures, this deserves a
-- more precise message. Ditto if this appears as the prefix
-- of a selected component, which may be a lexical error.
Error_Msg_N
("\context requires function call, found procedure name", Nam);
if Nkind (Parent (N)) = N_Selected_Component
and then N = Prefix (Parent (N))
then
Error_Msg_N -- CODEFIX
("\period should probably be semicolon", Parent (N));
end if;
elsif Nkind (N) = N_Procedure_Call_Statement
and then not Void_Interp_Seen
then
Error_Msg_N (
"\function name found in procedure call", Nam);
end if;
All_Errors_Mode := Err_Mode;
end Diagnose_Call;
---------------------------
-- Find_Arithmetic_Types --
---------------------------
procedure Find_Arithmetic_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Index1 : Interp_Index;
Index2 : Interp_Index;
It1 : Interp;
It2 : Interp;
procedure Check_Right_Argument (T : Entity_Id);
-- Check right operand of operator
--------------------------
-- Check_Right_Argument --
--------------------------
procedure Check_Right_Argument (T : Entity_Id) is
begin
if not Is_Overloaded (R) then
Check_Arithmetic_Pair (T, Etype (R), Op_Id, N);
else
Get_First_Interp (R, Index2, It2);
while Present (It2.Typ) loop
Check_Arithmetic_Pair (T, It2.Typ, Op_Id, N);
Get_Next_Interp (Index2, It2);
end loop;
end if;
end Check_Right_Argument;
-- Start of processing for Find_Arithmetic_Types
begin
if not Is_Overloaded (L) then
Check_Right_Argument (Etype (L));
else
Get_First_Interp (L, Index1, It1);
while Present (It1.Typ) loop
Check_Right_Argument (It1.Typ);
Get_Next_Interp (Index1, It1);
end loop;
end if;
end Find_Arithmetic_Types;
------------------------
-- Find_Boolean_Types --
------------------------
procedure Find_Boolean_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Index : Interp_Index;
It : Interp;
procedure Check_Numeric_Argument (T : Entity_Id);
-- Special case for logical operations one of whose operands is an
-- integer literal. If both are literal the result is any modular type.
----------------------------
-- Check_Numeric_Argument --
----------------------------
procedure Check_Numeric_Argument (T : Entity_Id) is
begin
if T = Universal_Integer then
Add_One_Interp (N, Op_Id, Any_Modular);
elsif Is_Modular_Integer_Type (T) then
Add_One_Interp (N, Op_Id, T);
end if;
end Check_Numeric_Argument;
-- Start of processing for Find_Boolean_Types
begin
if not Is_Overloaded (L) then
if Etype (L) = Universal_Integer
or else Etype (L) = Any_Modular
then
if not Is_Overloaded (R) then
Check_Numeric_Argument (Etype (R));
else
Get_First_Interp (R, Index, It);
while Present (It.Typ) loop
Check_Numeric_Argument (It.Typ);
Get_Next_Interp (Index, It);
end loop;
end if;
-- If operands are aggregates, we must assume that they may be
-- boolean arrays, and leave disambiguation for the second pass.
-- If only one is an aggregate, verify that the other one has an
-- interpretation as a boolean array
elsif Nkind (L) = N_Aggregate then
if Nkind (R) = N_Aggregate then
Add_One_Interp (N, Op_Id, Etype (L));
elsif not Is_Overloaded (R) then
if Valid_Boolean_Arg (Etype (R)) then
Add_One_Interp (N, Op_Id, Etype (R));
end if;
else
Get_First_Interp (R, Index, It);
while Present (It.Typ) loop
if Valid_Boolean_Arg (It.Typ) then
Add_One_Interp (N, Op_Id, It.Typ);
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
elsif Valid_Boolean_Arg (Etype (L))
and then Has_Compatible_Type (R, Etype (L))
then
Add_One_Interp (N, Op_Id, Etype (L));
end if;
else
Get_First_Interp (L, Index, It);
while Present (It.Typ) loop
if Valid_Boolean_Arg (It.Typ)
and then Has_Compatible_Type (R, It.Typ)
then
Add_One_Interp (N, Op_Id, It.Typ);
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
end Find_Boolean_Types;
---------------------------
-- Find_Comparison_Types --
---------------------------
procedure Find_Comparison_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Index : Interp_Index;
It : Interp;
Found : Boolean := False;
I_F : Interp_Index;
T_F : Entity_Id;
Scop : Entity_Id := Empty;
procedure Try_One_Interp (T1 : Entity_Id);
-- Routine to try one proposed interpretation. Note that the context
-- of the operator plays no role in resolving the arguments, so that
-- if there is more than one interpretation of the operands that is
-- compatible with comparison, the operation is ambiguous.
--------------------
-- Try_One_Interp --
--------------------
procedure Try_One_Interp (T1 : Entity_Id) is
begin
-- If the operator is an expanded name, then the type of the operand
-- must be defined in the corresponding scope. If the type is
-- universal, the context will impose the correct type.
if Present (Scop)
and then not Defined_In_Scope (T1, Scop)
and then T1 /= Universal_Integer
and then T1 /= Universal_Real
and then T1 /= Any_String
and then T1 /= Any_Composite
then
return;
end if;
if Valid_Comparison_Arg (T1) and then Has_Compatible_Type (R, T1) then
if Found and then Base_Type (T1) /= Base_Type (T_F) then
It := Disambiguate (L, I_F, Index, Any_Type);
if It = No_Interp then
Ambiguous_Operands (N);
Set_Etype (L, Any_Type);
return;
else
T_F := It.Typ;
end if;
else
Found := True;
T_F := T1;
I_F := Index;
end if;
Set_Etype (L, T_F);
Find_Non_Universal_Interpretations (N, R, Op_Id, T1);
end if;
end Try_One_Interp;
-- Start of processing for Find_Comparison_Types
begin
-- If left operand is aggregate, the right operand has to
-- provide a usable type for it.
if Nkind (L) = N_Aggregate and then Nkind (R) /= N_Aggregate then
Find_Comparison_Types (L => R, R => L, Op_Id => Op_Id, N => N);
return;
end if;
if Nkind (N) = N_Function_Call
and then Nkind (Name (N)) = N_Expanded_Name
then
Scop := Entity (Prefix (Name (N)));
-- The prefix may be a package renaming, and the subsequent test
-- requires the original package.
if Ekind (Scop) = E_Package
and then Present (Renamed_Entity (Scop))
then
Scop := Renamed_Entity (Scop);
Set_Entity (Prefix (Name (N)), Scop);
end if;
end if;
if not Is_Overloaded (L) then
Try_One_Interp (Etype (L));
else
Get_First_Interp (L, Index, It);
while Present (It.Typ) loop
Try_One_Interp (It.Typ);
Get_Next_Interp (Index, It);
end loop;
end if;
end Find_Comparison_Types;
----------------------------------------
-- Find_Non_Universal_Interpretations --
----------------------------------------
procedure Find_Non_Universal_Interpretations
(N : Node_Id;
R : Node_Id;
Op_Id : Entity_Id;
T1 : Entity_Id)
is
Index : Interp_Index;
It : Interp;
begin
if T1 = Universal_Integer or else T1 = Universal_Real
-- If the left operand of an equality operator is null, the visibility
-- of the operator must be determined from the interpretation of the
-- right operand. This processing must be done for Any_Access, which
-- is the internal representation of the type of the literal null.
or else T1 = Any_Access
then
if not Is_Overloaded (R) then
Add_One_Interp (N, Op_Id, Standard_Boolean, Base_Type (Etype (R)));
else
Get_First_Interp (R, Index, It);
while Present (It.Typ) loop
if Covers (It.Typ, T1) then
Add_One_Interp
(N, Op_Id, Standard_Boolean, Base_Type (It.Typ));
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
else
Add_One_Interp (N, Op_Id, Standard_Boolean, Base_Type (T1));
end if;
end Find_Non_Universal_Interpretations;
------------------------------
-- Find_Concatenation_Types --
------------------------------
procedure Find_Concatenation_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Op_Type : constant Entity_Id := Etype (Op_Id);
begin
if Is_Array_Type (Op_Type)
and then not Is_Limited_Type (Op_Type)
and then (Has_Compatible_Type (L, Op_Type)
or else
Has_Compatible_Type (L, Component_Type (Op_Type)))
and then (Has_Compatible_Type (R, Op_Type)
or else
Has_Compatible_Type (R, Component_Type (Op_Type)))
then
Add_One_Interp (N, Op_Id, Op_Type);
end if;
end Find_Concatenation_Types;
-------------------------
-- Find_Equality_Types --
-------------------------
procedure Find_Equality_Types
(L, R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Index : Interp_Index;
It : Interp;
Found : Boolean := False;
I_F : Interp_Index;
T_F : Entity_Id;
Scop : Entity_Id := Empty;
procedure Try_One_Interp (T1 : Entity_Id);
-- The context of the equality operator plays no role in resolving the
-- arguments, so that if there is more than one interpretation of the
-- operands that is compatible with equality, the construct is ambiguous
-- and an error can be emitted now, after trying to disambiguate, i.e.
-- applying preference rules.
--------------------
-- Try_One_Interp --
--------------------
procedure Try_One_Interp (T1 : Entity_Id) is
Bas : constant Entity_Id := Base_Type (T1);
begin
-- If the operator is an expanded name, then the type of the operand
-- must be defined in the corresponding scope. If the type is
-- universal, the context will impose the correct type. An anonymous
-- type for a 'Access reference is also universal in this sense, as
-- the actual type is obtained from context.
-- In Ada 2005, the equality operator for anonymous access types
-- is declared in Standard, and preference rules apply to it.
if Present (Scop) then
if Defined_In_Scope (T1, Scop)
or else T1 = Universal_Integer
or else T1 = Universal_Real
or else T1 = Any_Access
or else T1 = Any_String
or else T1 = Any_Composite
or else (Ekind (T1) = E_Access_Subprogram_Type
and then not Comes_From_Source (T1))
then
null;
elsif Ekind (T1) = E_Anonymous_Access_Type
and then Scop = Standard_Standard
then
null;
else
-- The scope does not contain an operator for the type
return;
end if;
-- If we have infix notation, the operator must be usable. Within
-- an instance, if the type is already established we know it is
-- correct. If an operand is universal it is compatible with any
-- numeric type.
elsif In_Open_Scopes (Scope (Bas))
or else Is_Potentially_Use_Visible (Bas)
or else In_Use (Bas)
or else (In_Use (Scope (Bas)) and then not Is_Hidden (Bas))
-- In an instance, the type may have been immediately visible.
-- Either the types are compatible, or one operand is universal
-- (numeric or null).
or else (In_Instance
and then
(First_Subtype (T1) = First_Subtype (Etype (R))
or else Nkind (R) = N_Null
or else
(Is_Numeric_Type (T1)
and then Is_Universal_Numeric_Type (Etype (R)))))
-- In Ada 2005, the equality on anonymous access types is declared
-- in Standard, and is always visible.
or else Ekind (T1) = E_Anonymous_Access_Type
then
null;
else
-- Save candidate type for subsequent error message, if any
if not Is_Limited_Type (T1) then
Candidate_Type := T1;
end if;
return;
end if;
-- Ada 2005 (AI-230): Keep restriction imposed by Ada 83 and 95:
-- Do not allow anonymous access types in equality operators.
if Ada_Version < Ada_2005
and then Ekind (T1) = E_Anonymous_Access_Type
then
return;
end if;
-- If the right operand has a type compatible with T1, check for an
-- acceptable interpretation, unless T1 is limited (no predefined
-- equality available), or this is use of a "/=" for a tagged type.
-- In the latter case, possible interpretations of equality need
-- to be considered, we don't want the default inequality declared
-- in Standard to be chosen, and the "/=" will be rewritten as a
-- negation of "=" (see the end of Analyze_Equality_Op). This ensures
-- that rewriting happens during analysis rather than being
-- delayed until expansion (this is needed for ASIS, which only sees
-- the unexpanded tree). Note that if the node is N_Op_Ne, but Op_Id
-- is Name_Op_Eq then we still proceed with the interpretation,
-- because that indicates the potential rewriting case where the
-- interpretation to consider is actually "=" and the node may be
-- about to be rewritten by Analyze_Equality_Op.
if T1 /= Standard_Void_Type
and then Has_Compatible_Type (R, T1)
and then
((not Is_Limited_Type (T1)
and then not Is_Limited_Composite (T1))
or else
(Is_Array_Type (T1)
and then not Is_Limited_Type (Component_Type (T1))
and then Available_Full_View_Of_Component (T1)))
and then
(Nkind (N) /= N_Op_Ne
or else not Is_Tagged_Type (T1)
or else Chars (Op_Id) = Name_Op_Eq)
then
if Found
and then Base_Type (T1) /= Base_Type (T_F)
then
It := Disambiguate (L, I_F, Index, Any_Type);
if It = No_Interp then
Ambiguous_Operands (N);
Set_Etype (L, Any_Type);
return;
else
T_F := It.Typ;
end if;
else
Found := True;
T_F := T1;
I_F := Index;
end if;
if not Analyzed (L) then
Set_Etype (L, T_F);
end if;
Find_Non_Universal_Interpretations (N, R, Op_Id, T1);
-- Case of operator was not visible, Etype still set to Any_Type
if Etype (N) = Any_Type then
Found := False;
end if;
elsif Scop = Standard_Standard
and then Ekind (T1) = E_Anonymous_Access_Type
then
Found := True;
end if;
end Try_One_Interp;
-- Start of processing for Find_Equality_Types
begin
-- If left operand is aggregate, the right operand has to
-- provide a usable type for it.
if Nkind (L) = N_Aggregate
and then Nkind (R) /= N_Aggregate
then
Find_Equality_Types (L => R, R => L, Op_Id => Op_Id, N => N);
return;
end if;
if Nkind (N) = N_Function_Call
and then Nkind (Name (N)) = N_Expanded_Name
then
Scop := Entity (Prefix (Name (N)));
-- The prefix may be a package renaming, and the subsequent test
-- requires the original package.
if Ekind (Scop) = E_Package
and then Present (Renamed_Entity (Scop))
then
Scop := Renamed_Entity (Scop);
Set_Entity (Prefix (Name (N)), Scop);
end if;
end if;
if not Is_Overloaded (L) then
Try_One_Interp (Etype (L));
else
Get_First_Interp (L, Index, It);
while Present (It.Typ) loop
Try_One_Interp (It.Typ);
Get_Next_Interp (Index, It);
end loop;
end if;
end Find_Equality_Types;
-------------------------
-- Find_Negation_Types --
-------------------------
procedure Find_Negation_Types
(R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Index : Interp_Index;
It : Interp;
begin
if not Is_Overloaded (R) then
if Etype (R) = Universal_Integer then
Add_One_Interp (N, Op_Id, Any_Modular);
elsif Valid_Boolean_Arg (Etype (R)) then
Add_One_Interp (N, Op_Id, Etype (R));
end if;
else
Get_First_Interp (R, Index, It);
while Present (It.Typ) loop
if Valid_Boolean_Arg (It.Typ) then
Add_One_Interp (N, Op_Id, It.Typ);
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
end Find_Negation_Types;
------------------------------
-- Find_Primitive_Operation --
------------------------------
function Find_Primitive_Operation (N : Node_Id) return Boolean is
Obj : constant Node_Id := Prefix (N);
Op : constant Node_Id := Selector_Name (N);
Prim : Elmt_Id;
Prims : Elist_Id;
Typ : Entity_Id;
begin
Set_Etype (Op, Any_Type);
if Is_Access_Type (Etype (Obj)) then
Typ := Designated_Type (Etype (Obj));
else
Typ := Etype (Obj);
end if;
if Is_Class_Wide_Type (Typ) then
Typ := Root_Type (Typ);
end if;
Prims := Primitive_Operations (Typ);
Prim := First_Elmt (Prims);
while Present (Prim) loop
if Chars (Node (Prim)) = Chars (Op) then
Add_One_Interp (Op, Node (Prim), Etype (Node (Prim)));
Set_Etype (N, Etype (Node (Prim)));
end if;
Next_Elmt (Prim);
end loop;
-- Now look for class-wide operations of the type or any of its
-- ancestors by iterating over the homonyms of the selector.
declare
Cls_Type : constant Entity_Id := Class_Wide_Type (Typ);
Hom : Entity_Id;
begin
Hom := Current_Entity (Op);
while Present (Hom) loop
if (Ekind (Hom) = E_Procedure
or else
Ekind (Hom) = E_Function)
and then Scope (Hom) = Scope (Typ)
and then Present (First_Formal (Hom))
and then
(Base_Type (Etype (First_Formal (Hom))) = Cls_Type
or else
(Is_Access_Type (Etype (First_Formal (Hom)))
and then
Ekind (Etype (First_Formal (Hom))) =
E_Anonymous_Access_Type
and then
Base_Type
(Designated_Type (Etype (First_Formal (Hom)))) =
Cls_Type))
then
Add_One_Interp (Op, Hom, Etype (Hom));
Set_Etype (N, Etype (Hom));
end if;
Hom := Homonym (Hom);
end loop;
end;
return Etype (Op) /= Any_Type;
end Find_Primitive_Operation;
----------------------
-- Find_Unary_Types --
----------------------
procedure Find_Unary_Types
(R : Node_Id;
Op_Id : Entity_Id;
N : Node_Id)
is
Index : Interp_Index;
It : Interp;
begin
if not Is_Overloaded (R) then
if Is_Numeric_Type (Etype (R)) then
-- In an instance a generic actual may be a numeric type even if
-- the formal in the generic unit was not. In that case, the
-- predefined operator was not a possible interpretation in the
-- generic, and cannot be one in the instance, unless the operator
-- is an actual of an instance.
if In_Instance
and then
not Is_Numeric_Type (Corresponding_Generic_Type (Etype (R)))
then
null;
else
Add_One_Interp (N, Op_Id, Base_Type (Etype (R)));
end if;
end if;
else
Get_First_Interp (R, Index, It);
while Present (It.Typ) loop
if Is_Numeric_Type (It.Typ) then
if In_Instance
and then
not Is_Numeric_Type
(Corresponding_Generic_Type (Etype (It.Typ)))
then
null;
else
Add_One_Interp (N, Op_Id, Base_Type (It.Typ));
end if;
end if;
Get_Next_Interp (Index, It);
end loop;
end if;
end Find_Unary_Types;
------------------
-- Junk_Operand --
------------------
function Junk_Operand (N : Node_Id) return Boolean is
Enode : Node_Id;
begin
if Error_Posted (N) then
return False;
end if;
-- Get entity to be tested
if Is_Entity_Name (N)
and then Present (Entity (N))
then
Enode := N;
-- An odd case, a procedure name gets converted to a very peculiar
-- function call, and here is where we detect this happening.
elsif Nkind (N) = N_Function_Call
and then Is_Entity_Name (Name (N))
and then Present (Entity (Name (N)))
then
Enode := Name (N);
-- Another odd case, there are at least some cases of selected
-- components where the selected component is not marked as having
-- an entity, even though the selector does have an entity
elsif Nkind (N) = N_Selected_Component
and then Present (Entity (Selector_Name (N)))
then
Enode := Selector_Name (N);
else
return False;
end if;
-- Now test the entity we got to see if it is a bad case
case Ekind (Entity (Enode)) is
when E_Package =>
Error_Msg_N
("package name cannot be used as operand", Enode);
when Generic_Unit_Kind =>
Error_Msg_N
("generic unit name cannot be used as operand", Enode);
when Type_Kind =>
Error_Msg_N
("subtype name cannot be used as operand", Enode);
when Entry_Kind =>
Error_Msg_N
("entry name cannot be used as operand", Enode);
when E_Procedure =>
Error_Msg_N
("procedure name cannot be used as operand", Enode);
when E_Exception =>
Error_Msg_N
("exception name cannot be used as operand", Enode);
when E_Block
| E_Label
| E_Loop
=>
Error_Msg_N
("label name cannot be used as operand", Enode);
when others =>
return False;
end case;
return True;
end Junk_Operand;
--------------------
-- Operator_Check --
--------------------
procedure Operator_Check (N : Node_Id) is
begin
Remove_Abstract_Operations (N);
-- Test for case of no interpretation found for operator
if Etype (N) = Any_Type then
declare
L : Node_Id;
R : Node_Id;
Op_Id : Entity_Id := Empty;
begin
R := Right_Opnd (N);
if Nkind (N) in N_Binary_Op then
L := Left_Opnd (N);
else
L := Empty;
end if;
-- If either operand has no type, then don't complain further,
-- since this simply means that we have a propagated error.
if R = Error
or else Etype (R) = Any_Type
or else (Nkind (N) in N_Binary_Op and then Etype (L) = Any_Type)
then
-- For the rather unusual case where one of the operands is
-- a Raise_Expression, whose initial type is Any_Type, use
-- the type of the other operand.
if Nkind (L) = N_Raise_Expression then
Set_Etype (L, Etype (R));
Set_Etype (N, Etype (R));
elsif Nkind (R) = N_Raise_Expression then
Set_Etype (R, Etype (L));
Set_Etype (N, Etype (L));
end if;
return;
-- We explicitly check for the case of concatenation of component
-- with component to avoid reporting spurious matching array types
-- that might happen to be lurking in distant packages (such as
-- run-time packages). This also prevents inconsistencies in the
-- messages for certain ACVC B tests, which can vary depending on
-- types declared in run-time interfaces. Another improvement when
-- aggregates are present is to look for a well-typed operand.
elsif Present (Candidate_Type)
and then (Nkind (N) /= N_Op_Concat
or else Is_Array_Type (Etype (L))
or else Is_Array_Type (Etype (R)))
then
if Nkind (N) = N_Op_Concat then
if Etype (L) /= Any_Composite
and then Is_Array_Type (Etype (L))
then
Candidate_Type := Etype (L);
elsif Etype (R) /= Any_Composite
and then Is_Array_Type (Etype (R))
then
Candidate_Type := Etype (R);
end if;
end if;
Error_Msg_NE -- CODEFIX
("operator for} is not directly visible!",
N, First_Subtype (Candidate_Type));
declare
U : constant Node_Id :=
Cunit (Get_Source_Unit (Candidate_Type));
begin
if Unit_Is_Visible (U) then
Error_Msg_N -- CODEFIX
("use clause would make operation legal!", N);
else
Error_Msg_NE -- CODEFIX
("add with_clause and use_clause for&!",
N, Defining_Entity (Unit (U)));
end if;
end;
return;
-- If either operand is a junk operand (e.g. package name), then
-- post appropriate error messages, but do not complain further.
-- Note that the use of OR in this test instead of OR ELSE is
-- quite deliberate, we may as well check both operands in the
-- binary operator case.
elsif Junk_Operand (R)
or -- really mean OR here and not OR ELSE, see above
(Nkind (N) in N_Binary_Op and then Junk_Operand (L))
then
return;
-- If we have a logical operator, one of whose operands is
-- Boolean, then we know that the other operand cannot resolve to
-- Boolean (since we got no interpretations), but in that case we
-- pretty much know that the other operand should be Boolean, so
-- resolve it that way (generating an error).
elsif Nkind_In (N, N_Op_And, N_Op_Or, N_Op_Xor) then
if Etype (L) = Standard_Boolean then
Resolve (R, Standard_Boolean);
return;
elsif Etype (R) = Standard_Boolean then
Resolve (L, Standard_Boolean);
return;
end if;
-- For an arithmetic operator or comparison operator, if one
-- of the operands is numeric, then we know the other operand
-- is not the same numeric type. If it is a non-numeric type,
-- then probably it is intended to match the other operand.
elsif Nkind_In (N, N_Op_Add,
N_Op_Divide,
N_Op_Ge,
N_Op_Gt,
N_Op_Le)
or else
Nkind_In (N, N_Op_Lt,
N_Op_Mod,
N_Op_Multiply,
N_Op_Rem,
N_Op_Subtract)
then
-- If Allow_Integer_Address is active, check whether the
-- operation becomes legal after converting an operand.
if Is_Numeric_Type (Etype (L))
and then not Is_Numeric_Type (Etype (R))
then
if Address_Integer_Convert_OK (Etype (R), Etype (L)) then
Rewrite (R,
Unchecked_Convert_To (Etype (L), Relocate_Node (R)));
if Nkind_In (N, N_Op_Ge, N_Op_Gt, N_Op_Le, N_Op_Lt) then
Analyze_Comparison_Op (N);
else
Analyze_Arithmetic_Op (N);
end if;
else
Resolve (R, Etype (L));
end if;
return;
elsif Is_Numeric_Type (Etype (R))
and then not Is_Numeric_Type (Etype (L))
then
if Address_Integer_Convert_OK (Etype (L), Etype (R)) then
Rewrite (L,
Unchecked_Convert_To (Etype (R), Relocate_Node (L)));
if Nkind_In (N, N_Op_Ge, N_Op_Gt, N_Op_Le, N_Op_Lt) then
Analyze_Comparison_Op (N);
else
Analyze_Arithmetic_Op (N);
end if;
return;
else
Resolve (L, Etype (R));
end if;
return;
elsif Allow_Integer_Address
and then Is_Descendant_Of_Address (Etype (L))
and then Is_Descendant_Of_Address (Etype (R))
and then not Error_Posted (N)
then
declare
Addr_Type : constant Entity_Id := Etype (L);
begin
Rewrite (L,
Unchecked_Convert_To (
Standard_Integer, Relocate_Node (L)));
Rewrite (R,
Unchecked_Convert_To (
Standard_Integer, Relocate_Node (R)));
if Nkind_In (N, N_Op_Ge, N_Op_Gt, N_Op_Le, N_Op_Lt) then
Analyze_Comparison_Op (N);
else
Analyze_Arithmetic_Op (N);
end if;
-- If this is an operand in an enclosing arithmetic
-- operation, Convert the result as an address so that
-- arithmetic folding of address can continue.
if Nkind (Parent (N)) in N_Op then
Rewrite (N,
Unchecked_Convert_To (Addr_Type, Relocate_Node (N)));
end if;
return;
end;
-- Under relaxed RM semantics silently replace occurrences of
-- null by System.Address_Null.
elsif Null_To_Null_Address_Convert_OK (N) then
Replace_Null_By_Null_Address (N);
if Nkind_In (N, N_Op_Ge, N_Op_Gt, N_Op_Le, N_Op_Lt) then
Analyze_Comparison_Op (N);
else
Analyze_Arithmetic_Op (N);
end if;
return;
end if;
-- Comparisons on A'Access are common enough to deserve a
-- special message.
elsif Nkind_In (N, N_Op_Eq, N_Op_Ne)
and then Ekind (Etype (L)) = E_Access_Attribute_Type
and then Ekind (Etype (R)) = E_Access_Attribute_Type
then
Error_Msg_N
("two access attributes cannot be compared directly", N);
Error_Msg_N
("\use qualified expression for one of the operands",
N);
return;
-- Another one for C programmers
elsif Nkind (N) = N_Op_Concat
and then Valid_Boolean_Arg (Etype (L))
and then Valid_Boolean_Arg (Etype (R))
then
Error_Msg_N ("invalid operands for concatenation", N);
Error_Msg_N -- CODEFIX
("\maybe AND was meant", N);
return;
-- A special case for comparison of access parameter with null
elsif Nkind (N) = N_Op_Eq
and then Is_Entity_Name (L)
and then Nkind (Parent (Entity (L))) = N_Parameter_Specification
and then Nkind (Parameter_Type (Parent (Entity (L)))) =
N_Access_Definition
and then Nkind (R) = N_Null
then
Error_Msg_N ("access parameter is not allowed to be null", L);
Error_Msg_N ("\(call would raise Constraint_Error)", L);
return;
-- Another special case for exponentiation, where the right
-- operand must be Natural, independently of the base.
elsif Nkind (N) = N_Op_Expon
and then Is_Numeric_Type (Etype (L))
and then not Is_Overloaded (R)
and then
First_Subtype (Base_Type (Etype (R))) /= Standard_Integer
and then Base_Type (Etype (R)) /= Universal_Integer
then
if Ada_Version >= Ada_2012
and then Has_Dimension_System (Etype (L))
then
Error_Msg_NE
("exponent for dimensioned type must be a rational" &
", found}", R, Etype (R));
else
Error_Msg_NE
("exponent must be of type Natural, found}", R, Etype (R));
end if;
return;
elsif Nkind_In (N, N_Op_Eq, N_Op_Ne) then
if Address_Integer_Convert_OK (Etype (R), Etype (L)) then
Rewrite (R,
Unchecked_Convert_To (Etype (L), Relocate_Node (R)));
Analyze_Equality_Op (N);
return;
-- Under relaxed RM semantics silently replace occurrences of
-- null by System.Address_Null.
elsif Null_To_Null_Address_Convert_OK (N) then
Replace_Null_By_Null_Address (N);
Analyze_Equality_Op (N);
return;
end if;
end if;
-- If we fall through then just give general message. Note that in
-- the following messages, if the operand is overloaded we choose
-- an arbitrary type to complain about, but that is probably more
-- useful than not giving a type at all.
if Nkind (N) in N_Unary_Op then
Error_Msg_Node_2 := Etype (R);
Error_Msg_N ("operator& not defined for}", N);
return;
else
if Nkind (N) in N_Binary_Op then
if not Is_Overloaded (L)
and then not Is_Overloaded (R)
and then Base_Type (Etype (L)) = Base_Type (Etype (R))
then
Error_Msg_Node_2 := First_Subtype (Etype (R));
Error_Msg_N ("there is no applicable operator& for}", N);
else
-- Another attempt to find a fix: one of the candidate
-- interpretations may not be use-visible. This has
-- already been checked for predefined operators, so
-- we examine only user-defined functions.
Op_Id := Get_Name_Entity_Id (Chars (N));
while Present (Op_Id) loop
if Ekind (Op_Id) /= E_Operator
and then Is_Overloadable (Op_Id)
then
if not Is_Immediately_Visible (Op_Id)
and then not In_Use (Scope (Op_Id))
and then not Is_Abstract_Subprogram (Op_Id)
and then not Is_Hidden (Op_Id)
and then Ekind (Scope (Op_Id)) = E_Package
and then
Has_Compatible_Type
(L, Etype (First_Formal (Op_Id)))
and then Present
(Next_Formal (First_Formal (Op_Id)))
and then
Has_Compatible_Type
(R,
Etype (Next_Formal (First_Formal (Op_Id))))
then
Error_Msg_N
("No legal interpretation for operator&", N);
Error_Msg_NE
("\use clause on& would make operation legal",
N, Scope (Op_Id));
exit;
end if;
end if;
Op_Id := Homonym (Op_Id);
end loop;
if No (Op_Id) then
Error_Msg_N ("invalid operand types for operator&", N);
if Nkind (N) /= N_Op_Concat then
Error_Msg_NE ("\left operand has}!", N, Etype (L));
Error_Msg_NE ("\right operand has}!", N, Etype (R));
-- For concatenation operators it is more difficult to
-- determine which is the wrong operand. It is worth
-- flagging explicitly an access type, for those who
-- might think that a dereference happens here.
elsif Is_Access_Type (Etype (L)) then
Error_Msg_N ("\left operand is access type", N);
elsif Is_Access_Type (Etype (R)) then
Error_Msg_N ("\right operand is access type", N);
end if;
end if;
end if;
end if;
end if;
end;
end if;
end Operator_Check;
-----------------------------------------
-- Process_Implicit_Dereference_Prefix --
-----------------------------------------
function Process_Implicit_Dereference_Prefix
(E : Entity_Id;
P : Entity_Id) return Entity_Id
is
Ref : Node_Id;
Typ : constant Entity_Id := Designated_Type (Etype (P));
begin
if Present (E)
and then (Operating_Mode = Check_Semantics or else not Expander_Active)
then
-- We create a dummy reference to E to ensure that the reference is
-- not considered as part of an assignment (an implicit dereference
-- can never assign to its prefix). The Comes_From_Source attribute
-- needs to be propagated for accurate warnings.
Ref := New_Occurrence_Of (E, Sloc (P));
Set_Comes_From_Source (Ref, Comes_From_Source (P));
Generate_Reference (E, Ref);
end if;
-- An implicit dereference is a legal occurrence of an incomplete type
-- imported through a limited_with clause, if the full view is visible.
if From_Limited_With (Typ)
and then not From_Limited_With (Scope (Typ))
and then
(Is_Immediately_Visible (Scope (Typ))
or else
(Is_Child_Unit (Scope (Typ))
and then Is_Visible_Lib_Unit (Scope (Typ))))
then
return Available_View (Typ);
else
return Typ;
end if;
end Process_Implicit_Dereference_Prefix;
--------------------------------
-- Remove_Abstract_Operations --
--------------------------------
procedure Remove_Abstract_Operations (N : Node_Id) is
Abstract_Op : Entity_Id := Empty;
Address_Descendant : Boolean := False;
I : Interp_Index;
It : Interp;
-- AI-310: If overloaded, remove abstract non-dispatching operations. We
-- activate this if either extensions are enabled, or if the abstract
-- operation in question comes from a predefined file. This latter test
-- allows us to use abstract to make operations invisible to users. In
-- particular, if type Address is non-private and abstract subprograms
-- are used to hide its operators, they will be truly hidden.
type Operand_Position is (First_Op, Second_Op);
Univ_Type : constant Entity_Id := Universal_Interpretation (N);
procedure Remove_Address_Interpretations (Op : Operand_Position);
-- Ambiguities may arise when the operands are literal and the address
-- operations in s-auxdec are visible. In that case, remove the
-- interpretation of a literal as Address, to retain the semantics
-- of Address as a private type.
------------------------------------
-- Remove_Address_Interpretations --
------------------------------------
procedure Remove_Address_Interpretations (Op : Operand_Position) is
Formal : Entity_Id;
begin
if Is_Overloaded (N) then
Get_First_Interp (N, I, It);
while Present (It.Nam) loop
Formal := First_Entity (It.Nam);
if Op = Second_Op then
Formal := Next_Entity (Formal);
end if;
if Is_Descendant_Of_Address (Etype (Formal)) then
Address_Descendant := True;
Remove_Interp (I);
end if;
Get_Next_Interp (I, It);
end loop;
end if;
end Remove_Address_Interpretations;
-- Start of processing for Remove_Abstract_Operations
begin
if Is_Overloaded (N) then
if Debug_Flag_V then
Write_Str ("Remove_Abstract_Operations: ");
Write_Overloads (N);
end if;
Get_First_Interp (N, I, It);
while Present (It.Nam) loop
if Is_Overloadable (It.Nam)
and then Is_Abstract_Subprogram (It.Nam)
and then not Is_Dispatching_Operation (It.Nam)
then
Abstract_Op := It.Nam;
if Is_Descendant_Of_Address (It.Typ) then
Address_Descendant := True;
Remove_Interp (I);
exit;
-- In Ada 2005, this operation does not participate in overload
-- resolution. If the operation is defined in a predefined
-- unit, it is one of the operations declared abstract in some
-- variants of System, and it must be removed as well.
elsif Ada_Version >= Ada_2005
or else Is_Predefined_File_Name
(Unit_File_Name (Get_Source_Unit (It.Nam)))
then
Remove_Interp (I);
exit;
end if;
end if;
Get_Next_Interp (I, It);
end loop;
if No (Abstract_Op) then
-- If some interpretation yields an integer type, it is still
-- possible that there are address interpretations. Remove them
-- if one operand is a literal, to avoid spurious ambiguities
-- on systems where Address is a visible integer type.
if Is_Overloaded (N)
and then Nkind (N) in N_Op
and then Is_Integer_Type (Etype (N))
then
if Nkind (N) in N_Binary_Op then
if Nkind (Right_Opnd (N)) = N_Integer_Literal then
Remove_Address_Interpretations (Second_Op);
elsif Nkind (Right_Opnd (N)) = N_Integer_Literal then
Remove_Address_Interpretations (First_Op);
end if;
end if;
end if;
elsif Nkind (N) in N_Op then
-- Remove interpretations that treat literals as addresses. This
-- is never appropriate, even when Address is defined as a visible
-- Integer type. The reason is that we would really prefer Address
-- to behave as a private type, even in this case. If Address is a
-- visible integer type, we get lots of overload ambiguities.
if Nkind (N) in N_Binary_Op then
declare
U1 : constant Boolean :=
Present (Universal_Interpretation (Right_Opnd (N)));
U2 : constant Boolean :=
Present (Universal_Interpretation (Left_Opnd (N)));
begin
if U1 then
Remove_Address_Interpretations (Second_Op);
end if;
if U2 then
Remove_Address_Interpretations (First_Op);
end if;
if not (U1 and U2) then
-- Remove corresponding predefined operator, which is
-- always added to the overload set.
Get_First_Interp (N, I, It);
while Present (It.Nam) loop
if Scope (It.Nam) = Standard_Standard
and then Base_Type (It.Typ) =
Base_Type (Etype (Abstract_Op))
then
Remove_Interp (I);
end if;
Get_Next_Interp (I, It);
end loop;
elsif Is_Overloaded (N)
and then Present (Univ_Type)
then
-- If both operands have a universal interpretation,
-- it is still necessary to remove interpretations that
-- yield Address. Any remaining ambiguities will be
-- removed in Disambiguate.
Get_First_Interp (N, I, It);
while Present (It.Nam) loop
if Is_Descendant_Of_Address (It.Typ) then
Remove_Interp (I);
elsif not Is_Type (It.Nam) then
Set_Entity (N, It.Nam);
end if;
Get_Next_Interp (I, It);
end loop;
end if;
end;
end if;
elsif Nkind (N) = N_Function_Call
and then
(Nkind (Name (N)) = N_Operator_Symbol
or else
(Nkind (Name (N)) = N_Expanded_Name
and then
Nkind (Selector_Name (Name (N))) = N_Operator_Symbol))
then
declare
Arg1 : constant Node_Id := First (Parameter_Associations (N));
U1 : constant Boolean :=
Present (Universal_Interpretation (Arg1));
U2 : constant Boolean :=
Present (Next (Arg1)) and then
Present (Universal_Interpretation (Next (Arg1)));
begin
if U1 then
Remove_Address_Interpretations (First_Op);
end if;
if U2 then
Remove_Address_Interpretations (Second_Op);
end if;
if not (U1 and U2) then
Get_First_Interp (N, I, It);
while Present (It.Nam) loop
if Scope (It.Nam) = Standard_Standard
and then It.Typ = Base_Type (Etype (Abstract_Op))
then
Remove_Interp (I);
end if;
Get_Next_Interp (I, It);
end loop;
end if;
end;
end if;
-- If the removal has left no valid interpretations, emit an error
-- message now and label node as illegal.
if Present (Abstract_Op) then
Get_First_Interp (N, I, It);
if No (It.Nam) then
-- Removal of abstract operation left no viable candidate
Set_Etype (N, Any_Type);
Error_Msg_Sloc := Sloc (Abstract_Op);
Error_Msg_NE
("cannot call abstract operation& declared#", N, Abstract_Op);
-- In Ada 2005, an abstract operation may disable predefined
-- operators. Since the context is not yet known, we mark the
-- predefined operators as potentially hidden. Do not include
-- predefined operators when addresses are involved since this
-- case is handled separately.
elsif Ada_Version >= Ada_2005 and then not Address_Descendant then
while Present (It.Nam) loop
if Is_Numeric_Type (It.Typ)
and then Scope (It.Typ) = Standard_Standard
then
Set_Abstract_Op (I, Abstract_Op);
end if;
Get_Next_Interp (I, It);
end loop;
end if;
end if;
if Debug_Flag_V then
Write_Str ("Remove_Abstract_Operations done: ");
Write_Overloads (N);
end if;
end if;
end Remove_Abstract_Operations;
----------------------------
-- Try_Container_Indexing --
----------------------------
function Try_Container_Indexing
(N : Node_Id;
Prefix : Node_Id;
Exprs : List_Id) return Boolean
is
Pref_Typ : constant Entity_Id := Etype (Prefix);
function Constant_Indexing_OK return Boolean;
-- Constant_Indexing is legal if there is no Variable_Indexing defined
-- for the type, or else node not a target of assignment, or an actual
-- for an IN OUT or OUT formal (RM 4.1.6 (11)).
function Find_Indexing_Operations
(T : Entity_Id;
Nam : Name_Id;
Is_Constant : Boolean) return Node_Id;
-- Return a reference to the primitive operation of type T denoted by
-- name Nam. If the operation is overloaded, the reference carries all
-- interpretations. Flag Is_Constant should be set when the context is
-- constant indexing.
--------------------------
-- Constant_Indexing_OK --
--------------------------
function Constant_Indexing_OK return Boolean is
Par : Node_Id;
begin
if No (Find_Value_Of_Aspect (Pref_Typ, Aspect_Variable_Indexing)) then
return True;
elsif not Is_Variable (Prefix) then
return True;
end if;
Par := N;
while Present (Par) loop
if Nkind (Parent (Par)) = N_Assignment_Statement
and then Par = Name (Parent (Par))
then
return False;
-- The call may be overloaded, in which case we assume that its
-- resolution does not depend on the type of the parameter that
-- includes the indexing operation.
elsif Nkind_In (Parent (Par), N_Function_Call,
N_Procedure_Call_Statement)
and then Is_Entity_Name (Name (Parent (Par)))
then
declare
Actual : Node_Id;
Formal : Entity_Id;
Proc : Entity_Id;
begin
-- We should look for an interpretation with the proper
-- number of formals, and determine whether it is an
-- In_Parameter, but for now we examine the formal that
-- corresponds to the indexing, and assume that variable
-- indexing is required if some interpretation has an
-- assignable formal at that position. Still does not
-- cover the most complex cases ???
if Is_Overloaded (Name (Parent (Par))) then
declare
Proc : constant Node_Id := Name (Parent (Par));
A : Node_Id;
F : Entity_Id;
I : Interp_Index;
It : Interp;
begin
Get_First_Interp (Proc, I, It);
while Present (It.Nam) loop
F := First_Formal (It.Nam);
A := First (Parameter_Associations (Parent (Par)));
while Present (F) and then Present (A) loop
if A = Par then
if Ekind (F) /= E_In_Parameter then
return False;
else
exit; -- interpretation is safe
end if;
end if;
Next_Formal (F);
Next_Actual (A);
end loop;
Get_Next_Interp (I, It);
end loop;
end;
return True;
else
Proc := Entity (Name (Parent (Par)));
-- If this is an indirect call, get formals from
-- designated type.
if Is_Access_Subprogram_Type (Etype (Proc)) then
Proc := Designated_Type (Etype (Proc));
end if;
end if;
Formal := First_Formal (Proc);
Actual := First_Actual (Parent (Par));
-- Find corresponding actual
while Present (Actual) loop
exit when Actual = Par;
Next_Actual (Actual);
if Present (Formal) then
Next_Formal (Formal);
-- Otherwise this is a parameter mismatch, the error is
-- reported elsewhere.
else
return False;
end if;
end loop;
return Ekind (Formal) = E_In_Parameter;
end;
elsif Nkind (Parent (Par)) = N_Object_Renaming_Declaration then
return False;
-- If the indexed component is a prefix it may be the first actual
-- of a prefixed call. Retrieve the called entity, if any, and
-- check its first formal. Determine if the context is a procedure
-- or function call.
elsif Nkind (Parent (Par)) = N_Selected_Component then
declare
Sel : constant Node_Id := Selector_Name (Parent (Par));
Nam : constant Entity_Id := Current_Entity (Sel);
begin
if Present (Nam) and then Is_Overloadable (Nam) then
if Nkind (Parent (Parent (Par))) =
N_Procedure_Call_Statement
then
return False;
elsif Ekind (Nam) = E_Function
and then Present (First_Formal (Nam))
then
return Ekind (First_Formal (Nam)) = E_In_Parameter;
end if;
end if;
end;
elsif Nkind (Par) in N_Op then
return True;
end if;
Par := Parent (Par);
end loop;
-- In all other cases, constant indexing is legal
return True;
end Constant_Indexing_OK;
------------------------------
-- Find_Indexing_Operations --
------------------------------
function Find_Indexing_Operations
(T : Entity_Id;
Nam : Name_Id;
Is_Constant : Boolean) return Node_Id
is
procedure Inspect_Declarations
(Typ : Entity_Id;
Ref : in out Node_Id);
-- Traverse the declarative list where type Typ resides and collect
-- all suitable interpretations in node Ref.
procedure Inspect_Primitives
(Typ : Entity_Id;
Ref : in out Node_Id);
-- Traverse the list of primitive operations of type Typ and collect
-- all suitable interpretations in node Ref.
function Is_OK_Candidate
(Subp_Id : Entity_Id;
Typ : Entity_Id) return Boolean;
-- Determine whether subprogram Subp_Id is a suitable indexing
-- operation for type Typ. To qualify as such, the subprogram must
-- be a function, have at least two parameters, and the type of the
-- first parameter must be either Typ, or Typ'Class, or access [to
-- constant] with designated type Typ or Typ'Class.
procedure Record_Interp (Subp_Id : Entity_Id; Ref : in out Node_Id);
-- Store subprogram Subp_Id as an interpretation in node Ref
--------------------------
-- Inspect_Declarations --
--------------------------
procedure Inspect_Declarations
(Typ : Entity_Id;
Ref : in out Node_Id)
is
Typ_Decl : constant Node_Id := Declaration_Node (Typ);
Decl : Node_Id;
Subp_Id : Entity_Id;
begin
-- Ensure that the routine is not called with itypes, which lack a
-- declarative node.
pragma Assert (Present (Typ_Decl));
pragma Assert (Is_List_Member (Typ_Decl));
Decl := First (List_Containing (Typ_Decl));
while Present (Decl) loop
if Nkind (Decl) = N_Subprogram_Declaration then
Subp_Id := Defining_Entity (Decl);
if Is_OK_Candidate (Subp_Id, Typ) then
Record_Interp (Subp_Id, Ref);
end if;
end if;
Next (Decl);
end loop;
end Inspect_Declarations;
------------------------
-- Inspect_Primitives --
------------------------
procedure Inspect_Primitives
(Typ : Entity_Id;
Ref : in out Node_Id)
is
Prim_Elmt : Elmt_Id;
Prim_Id : Entity_Id;
begin
Prim_Elmt := First_Elmt (Primitive_Operations (Typ));
while Present (Prim_Elmt) loop
Prim_Id := Node (Prim_Elmt);
if Is_OK_Candidate (Prim_Id, Typ) then
Record_Interp (Prim_Id, Ref);
end if;
Next_Elmt (Prim_Elmt);
end loop;
end Inspect_Primitives;
---------------------
-- Is_OK_Candidate --
---------------------
function Is_OK_Candidate
(Subp_Id : Entity_Id;
Typ : Entity_Id) return Boolean
is
Formal : Entity_Id;
Formal_Typ : Entity_Id;
Param_Typ : Node_Id;
begin
-- To classify as a suitable candidate, the subprogram must be a
-- function whose name matches the argument of aspect Constant or
-- Variable_Indexing.
if Ekind (Subp_Id) = E_Function and then Chars (Subp_Id) = Nam then
Formal := First_Formal (Subp_Id);
-- The candidate requires at least two parameters
if Present (Formal) and then Present (Next_Formal (Formal)) then
Formal_Typ := Empty;
Param_Typ := Parameter_Type (Parent (Formal));
-- Use the designated type when the first parameter is of an
-- access type.
if Nkind (Param_Typ) = N_Access_Definition
and then Present (Subtype_Mark (Param_Typ))
then
-- When the context is a constant indexing, the access
-- definition must be access-to-constant. This does not
-- apply to variable indexing.
if not Is_Constant
or else Constant_Present (Param_Typ)
then
Formal_Typ := Etype (Subtype_Mark (Param_Typ));
end if;
-- Otherwise use the parameter type
else
Formal_Typ := Etype (Param_Typ);
end if;
if Present (Formal_Typ) then
-- Use the specific type when the parameter type is
-- class-wide.
if Is_Class_Wide_Type (Formal_Typ) then
Formal_Typ := Etype (Base_Type (Formal_Typ));
end if;
-- Use the full view when the parameter type is private
-- or incomplete.
if Is_Incomplete_Or_Private_Type (Formal_Typ)
and then Present (Full_View (Formal_Typ))
then
Formal_Typ := Full_View (Formal_Typ);
end if;
-- The type of the first parameter must denote the type
-- of the container or acts as its ancestor type.
return
Formal_Typ = Typ
or else Is_Ancestor (Formal_Typ, Typ);
end if;
end if;
end if;
return False;
end Is_OK_Candidate;
-------------------
-- Record_Interp --
-------------------
procedure Record_Interp (Subp_Id : Entity_Id; Ref : in out Node_Id) is
begin
if Present (Ref) then
Add_One_Interp (Ref, Subp_Id, Etype (Subp_Id));
-- Otherwise this is the first interpretation. Create a reference
-- where all remaining interpretations will be collected.
else
Ref := New_Occurrence_Of (Subp_Id, Sloc (T));
end if;
end Record_Interp;
-- Local variables
Ref : Node_Id;
Typ : Entity_Id;
-- Start of processing for Find_Indexing_Operations
begin
Typ := T;
-- Use the specific type when the parameter type is class-wide
if Is_Class_Wide_Type (Typ) then
Typ := Root_Type (Typ);
end if;
Ref := Empty;
Typ := Underlying_Type (Base_Type (Typ));
Inspect_Primitives (Typ, Ref);
-- Now look for explicit declarations of an indexing operation.
-- If the type is private the operation may be declared in the
-- visible part that contains the partial view.
if Is_Private_Type (T) then
Inspect_Declarations (T, Ref);
end if;
Inspect_Declarations (Typ, Ref);
return Ref;
end Find_Indexing_Operations;
-- Local variables
Loc : constant Source_Ptr := Sloc (N);
Assoc : List_Id;
C_Type : Entity_Id;
Func : Entity_Id;
Func_Name : Node_Id;
Indexing : Node_Id;
Is_Constant_Indexing : Boolean := False;
-- This flag reflects the nature of the container indexing. Note that
-- the context may be suited for constant indexing, but the type may
-- lack a Constant_Indexing annotation.
-- Start of processing for Try_Container_Indexing
begin
-- Node may have been analyzed already when testing for a prefixed
-- call, in which case do not redo analysis.
if Present (Generalized_Indexing (N)) then
return True;
end if;
C_Type := Pref_Typ;
-- If indexing a class-wide container, obtain indexing primitive from
-- specific type.
if Is_Class_Wide_Type (C_Type) then
C_Type := Etype (Base_Type (C_Type));
end if;
-- Check whether the type has a specified indexing aspect
Func_Name := Empty;
-- The context is suitable for constant indexing, so obtain the name of
-- the indexing function from aspect Constant_Indexing.
if Constant_Indexing_OK then
Func_Name :=
Find_Value_Of_Aspect (Pref_Typ, Aspect_Constant_Indexing);
end if;
if Present (Func_Name) then
Is_Constant_Indexing := True;
-- Otherwise attempt variable indexing
else
Func_Name :=
Find_Value_Of_Aspect (Pref_Typ, Aspect_Variable_Indexing);
end if;
-- The type is not subject to either form of indexing, therefore the
-- indexed component does not denote container indexing. If this is a
-- true error, it is diagnosed by the caller.
if No (Func_Name) then
-- The prefix itself may be an indexing of a container. Rewrite it
-- as such and retry.
if Has_Implicit_Dereference (Pref_Typ) then
Build_Explicit_Dereference (Prefix, First_Discriminant (Pref_Typ));
return Try_Container_Indexing (N, Prefix, Exprs);
-- Otherwise this is definitely not container indexing
else
return False;
end if;
-- If the container type is derived from another container type, the
-- value of the inherited aspect is the Reference operation declared
-- for the parent type.
-- However, Reference is also a primitive operation of the type, and the
-- inherited operation has a different signature. We retrieve the right
-- ones (the function may be overloaded) from the list of primitive
-- operations of the derived type.
-- Note that predefined containers are typically all derived from one of
-- the Controlled types. The code below is motivated by containers that
-- are derived from other types with a Reference aspect.
elsif Is_Derived_Type (C_Type)
and then Etype (First_Formal (Entity (Func_Name))) /= Pref_Typ
then
Func_Name :=
Find_Indexing_Operations
(T => C_Type,
Nam => Chars (Func_Name),
Is_Constant => Is_Constant_Indexing);
end if;
Assoc := New_List (Relocate_Node (Prefix));
-- A generalized indexing may have nore than one index expression, so
-- transfer all of them to the argument list to be used in the call.
-- Note that there may be named associations, in which case the node
-- was rewritten earlier as a call, and has been transformed back into
-- an indexed expression to share the following processing.
-- The generalized indexing node is the one on which analysis and
-- resolution take place. Before expansion the original node is replaced
-- with the generalized indexing node, which is a call, possibly with a
-- dereference operation.
if Comes_From_Source (N) then
Check_Compiler_Unit ("generalized indexing", N);
end if;
-- Create argument list for function call that represents generalized
-- indexing. Note that indices (i.e. actuals) may themselves be
-- overloaded.
declare
Arg : Node_Id;
New_Arg : Node_Id;
begin
Arg := First (Exprs);
while Present (Arg) loop
New_Arg := Relocate_Node (Arg);
-- The arguments can be parameter associations, in which case the
-- explicit actual parameter carries the overloadings.
if Nkind (New_Arg) /= N_Parameter_Association then
Save_Interps (Arg, New_Arg);
end if;
Append (New_Arg, Assoc);
Next (Arg);
end loop;
end;
if not Is_Overloaded (Func_Name) then
Func := Entity (Func_Name);
Indexing :=
Make_Function_Call (Loc,
Name => New_Occurrence_Of (Func, Loc),
Parameter_Associations => Assoc);
Set_Parent (Indexing, Parent (N));
Set_Generalized_Indexing (N, Indexing);
Analyze (Indexing);
Set_Etype (N, Etype (Indexing));
-- If the return type of the indexing function is a reference type,
-- add the dereference as a possible interpretation. Note that the
-- indexing aspect may be a function that returns the element type
-- with no intervening implicit dereference, and that the reference
-- discriminant is not the first discriminant.
if Has_Discriminants (Etype (Func)) then
Check_Implicit_Dereference (N, Etype (Func));
end if;
else
-- If there are multiple indexing functions, build a function call
-- and analyze it for each of the possible interpretations.
Indexing :=
Make_Function_Call (Loc,
Name =>
Make_Identifier (Loc, Chars (Func_Name)),
Parameter_Associations => Assoc);
Set_Parent (Indexing, Parent (N));
Set_Generalized_Indexing (N, Indexing);
Set_Etype (N, Any_Type);
Set_Etype (Name (Indexing), Any_Type);
declare
I : Interp_Index;
It : Interp;
Success : Boolean;
begin
Get_First_Interp (Func_Name, I, It);
Set_Etype (Indexing, Any_Type);
-- Analyze each candidate function with the given actuals
while Present (It.Nam) loop
Analyze_One_Call (Indexing, It.Nam, False, Success);
Get_Next_Interp (I, It);
end loop;
-- If there are several successful candidates, resolution will
-- be by result. Mark the interpretations of the function name
-- itself.
if Is_Overloaded (Indexing) then
Get_First_Interp (Indexing, I, It);
while Present (It.Nam) loop
Add_One_Interp (Name (Indexing), It.Nam, It.Typ);
Get_Next_Interp (I, It);
end loop;
else
Set_Etype (Name (Indexing), Etype (Indexing));
end if;
-- Now add the candidate interpretations to the indexing node
-- itself, to be replaced later by the function call.
if Is_Overloaded (Name (Indexing)) then
Get_First_Interp (Name (Indexing), I, It);
while Present (It.Nam) loop
Add_One_Interp (N, It.Nam, It.Typ);
-- Add dereference interpretation if the result type has
-- implicit reference discriminants.
if Has_Discriminants (Etype (It.Nam)) then
Check_Implicit_Dereference (N, Etype (It.Nam));
end if;
Get_Next_Interp (I, It);
end loop;
else
Set_Etype (N, Etype (Name (Indexing)));
if Has_Discriminants (Etype (N)) then
Check_Implicit_Dereference (N, Etype (N));
end if;
end if;
end;
end if;
if Etype (Indexing) = Any_Type then
Error_Msg_NE
("container cannot be indexed with&", N, Etype (First (Exprs)));
Rewrite (N, New_Occurrence_Of (Any_Id, Loc));
end if;
return True;
end Try_Container_Indexing;
-----------------------
-- Try_Indirect_Call --
-----------------------
function Try_Indirect_Call
(N : Node_Id;
Nam : Entity_Id;
Typ : Entity_Id) return Boolean
is
Actual : Node_Id;
Formal : Entity_Id;
Call_OK : Boolean;
pragma Warnings (Off, Call_OK);
begin
Normalize_Actuals (N, Designated_Type (Typ), False, Call_OK);
Actual := First_Actual (N);
Formal := First_Formal (Designated_Type (Typ));
while Present (Actual) and then Present (Formal) loop
if not Has_Compatible_Type (Actual, Etype (Formal)) then
return False;
end if;
Next (Actual);
Next_Formal (Formal);
end loop;
if No (Actual) and then No (Formal) then
Add_One_Interp (N, Nam, Etype (Designated_Type (Typ)));
-- Nam is a candidate interpretation for the name in the call,
-- if it is not an indirect call.
if not Is_Type (Nam)
and then Is_Entity_Name (Name (N))
then
Set_Entity (Name (N), Nam);
end if;
return True;
else
return False;
end if;
end Try_Indirect_Call;
----------------------
-- Try_Indexed_Call --
----------------------
function Try_Indexed_Call
(N : Node_Id;
Nam : Entity_Id;
Typ : Entity_Id;
Skip_First : Boolean) return Boolean
is
Loc : constant Source_Ptr := Sloc (N);
Actuals : constant List_Id := Parameter_Associations (N);
Actual : Node_Id;
Index : Entity_Id;
begin
Actual := First (Actuals);
-- If the call was originally written in prefix form, skip the first
-- actual, which is obviously not defaulted.
if Skip_First then
Next (Actual);
end if;
Index := First_Index (Typ);
while Present (Actual) and then Present (Index) loop
-- If the parameter list has a named association, the expression
-- is definitely a call and not an indexed component.
if Nkind (Actual) = N_Parameter_Association then
return False;
end if;
if Is_Entity_Name (Actual)
and then Is_Type (Entity (Actual))
and then No (Next (Actual))
then
-- A single actual that is a type name indicates a slice if the
-- type is discrete, and an error otherwise.
if Is_Discrete_Type (Entity (Actual)) then
Rewrite (N,
Make_Slice (Loc,
Prefix =>
Make_Function_Call (Loc,
Name => Relocate_Node (Name (N))),
Discrete_Range =>
New_Occurrence_Of (Entity (Actual), Sloc (Actual))));
Analyze (N);
else
Error_Msg_N ("invalid use of type in expression", Actual);
Set_Etype (N, Any_Type);
end if;
return True;
elsif not Has_Compatible_Type (Actual, Etype (Index)) then
return False;
end if;
Next (Actual);
Next_Index (Index);
end loop;
if No (Actual) and then No (Index) then
Add_One_Interp (N, Nam, Component_Type (Typ));
-- Nam is a candidate interpretation for the name in the call,
-- if it is not an indirect call.
if not Is_Type (Nam)
and then Is_Entity_Name (Name (N))
then
Set_Entity (Name (N), Nam);
end if;
return True;
else
return False;
end if;
end Try_Indexed_Call;
--------------------------
-- Try_Object_Operation --
--------------------------
function Try_Object_Operation
(N : Node_Id; CW_Test_Only : Boolean := False) return Boolean
is
K : constant Node_Kind := Nkind (Parent (N));
Is_Subprg_Call : constant Boolean := K in N_Subprogram_Call;
Loc : constant Source_Ptr := Sloc (N);
Obj : constant Node_Id := Prefix (N);
Subprog : constant Node_Id :=
Make_Identifier (Sloc (Selector_Name (N)),
Chars => Chars (Selector_Name (N)));
-- Identifier on which possible interpretations will be collected
Report_Error : Boolean := False;
-- If no candidate interpretation matches the context, redo analysis
-- with Report_Error True to provide additional information.
Actual : Node_Id;
Candidate : Entity_Id := Empty;
New_Call_Node : Node_Id := Empty;
Node_To_Replace : Node_Id;
Obj_Type : Entity_Id := Etype (Obj);
Success : Boolean := False;
function Valid_Candidate
(Success : Boolean;
Call : Node_Id;
Subp : Entity_Id) return Entity_Id;
-- If the subprogram is a valid interpretation, record it, and add
-- to the list of interpretations of Subprog. Otherwise return Empty.
procedure Complete_Object_Operation
(Call_Node : Node_Id;
Node_To_Replace : Node_Id);
-- Make Subprog the name of Call_Node, replace Node_To_Replace with
-- Call_Node, insert the object (or its dereference) as the first actual
-- in the call, and complete the analysis of the call.
procedure Report_Ambiguity (Op : Entity_Id);
-- If a prefixed procedure call is ambiguous, indicate whether the
-- call includes an implicit dereference or an implicit 'Access.
procedure Transform_Object_Operation
(Call_Node : out Node_Id;
Node_To_Replace : out Node_Id);
-- Transform Obj.Operation (X, Y,,) into Operation (Obj, X, Y ..)
-- Call_Node is the resulting subprogram call, Node_To_Replace is
-- either N or the parent of N, and Subprog is a reference to the
-- subprogram we are trying to match.
function Try_Class_Wide_Operation
(Call_Node : Node_Id;
Node_To_Replace : Node_Id) return Boolean;
-- Traverse all ancestor types looking for a class-wide subprogram
-- for which the current operation is a valid non-dispatching call.
procedure Try_One_Prefix_Interpretation (T : Entity_Id);
-- If prefix is overloaded, its interpretation may include different
-- tagged types, and we must examine the primitive operations and
-- the class-wide operations of each in order to find candidate
-- interpretations for the call as a whole.
function Try_Primitive_Operation
(Call_Node : Node_Id;
Node_To_Replace : Node_Id) return Boolean;
-- Traverse the list of primitive subprograms looking for a dispatching
-- operation for which the current node is a valid call .
---------------------
-- Valid_Candidate --
---------------------
function Valid_Candidate
(Success : Boolean;
Call : Node_Id;
Subp : Entity_Id) return Entity_Id
is
Arr_Type : Entity_Id;
Comp_Type : Entity_Id;
begin
-- If the subprogram is a valid interpretation, record it in global
-- variable Subprog, to collect all possible overloadings.
if Success then
if Subp /= Entity (Subprog) then
Add_One_Interp (Subprog, Subp, Etype (Subp));
end if;
end if;
-- If the call may be an indexed call, retrieve component type of
-- resulting expression, and add possible interpretation.
Arr_Type := Empty;
Comp_Type := Empty;
if Nkind (Call) = N_Function_Call
and then Nkind (Parent (N)) = N_Indexed_Component
and then Needs_One_Actual (Subp)
then
if Is_Array_Type (Etype (Subp)) then
Arr_Type := Etype (Subp);
elsif Is_Access_Type (Etype (Subp))
and then Is_Array_Type (Designated_Type (Etype (Subp)))
then
Arr_Type := Designated_Type (Etype (Subp));
end if;
end if;
if Present (Arr_Type) then
-- Verify that the actuals (excluding the object) match the types
-- of the indexes.
declare
Actual : Node_Id;
Index : Node_Id;
begin
Actual := Next (First_Actual (Call));
Index := First_Index (Arr_Type);
while Present (Actual) and then Present (Index) loop
if not Has_Compatible_Type (Actual, Etype (Index)) then
Arr_Type := Empty;
exit;
end if;
Next_Actual (Actual);
Next_Index (Index);
end loop;
if No (Actual)
and then No (Index)
and then Present (Arr_Type)
then
Comp_Type := Component_Type (Arr_Type);
end if;
end;
if Present (Comp_Type)
and then Etype (Subprog) /= Comp_Type
then
Add_One_Interp (Subprog, Subp, Comp_Type);
end if;
end if;
if Etype (Call) /= Any_Type then
return Subp;
else
return Empty;
end if;
end Valid_Candidate;
-------------------------------
-- Complete_Object_Operation --
-------------------------------
procedure Complete_Object_Operation
(Call_Node : Node_Id;
Node_To_Replace : Node_Id)
is
Control : constant Entity_Id := First_Formal (Entity (Subprog));
Formal_Type : constant Entity_Id := Etype (Control);
First_Actual : Node_Id;
begin
-- Place the name of the operation, with its interpretations,
-- on the rewritten call.
Set_Name (Call_Node, Subprog);
First_Actual := First (Parameter_Associations (Call_Node));
-- For cross-reference purposes, treat the new node as being in the
-- source if the original one is. Set entity and type, even though
-- they may be overwritten during resolution if overloaded.
Set_Comes_From_Source (Subprog, Comes_From_Source (N));
Set_Comes_From_Source (Call_Node, Comes_From_Source (N));
if Nkind (N) = N_Selected_Component
and then not Inside_A_Generic
then
Set_Entity (Selector_Name (N), Entity (Subprog));
Set_Etype (Selector_Name (N), Etype (Entity (Subprog)));
end if;
-- If need be, rewrite first actual as an explicit dereference. If
-- the call is overloaded, the rewriting can only be done once the
-- primitive operation is identified.
if Is_Overloaded (Subprog) then
-- The prefix itself may be overloaded, and its interpretations
-- must be propagated to the new actual in the call.
if Is_Overloaded (Obj) then
Save_Interps (Obj, First_Actual);
end if;
Rewrite (First_Actual, Obj);
elsif not Is_Access_Type (Formal_Type)
and then Is_Access_Type (Etype (Obj))
then
Rewrite (First_Actual,
Make_Explicit_Dereference (Sloc (Obj), Obj));
Analyze (First_Actual);
-- If we need to introduce an explicit dereference, verify that
-- the resulting actual is compatible with the mode of the formal.
if Ekind (First_Formal (Entity (Subprog))) /= E_In_Parameter
and then Is_Access_Constant (Etype (Obj))
then
Error_Msg_NE
("expect variable in call to&", Prefix (N), Entity (Subprog));
end if;
-- Conversely, if the formal is an access parameter and the object
-- is not, replace the actual with a 'Access reference. Its analysis
-- will check that the object is aliased.
elsif Is_Access_Type (Formal_Type)
and then not Is_Access_Type (Etype (Obj))
then
-- A special case: A.all'access is illegal if A is an access to a
-- constant and the context requires an access to a variable.
if not Is_Access_Constant (Formal_Type) then
if (Nkind (Obj) = N_Explicit_Dereference
and then Is_Access_Constant (Etype (Prefix (Obj))))
or else not Is_Variable (Obj)
then
Error_Msg_NE
("actual for & must be a variable", Obj, Control);
end if;
end if;
Rewrite (First_Actual,
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Access,
Prefix => Relocate_Node (Obj)));
if not Is_Aliased_View (Obj) then
Error_Msg_NE
("object in prefixed call to & must be aliased "
& "(RM 4.1.3 (13 1/2))", Prefix (First_Actual), Subprog);
end if;
Analyze (First_Actual);
else
if Is_Overloaded (Obj) then
Save_Interps (Obj, First_Actual);
end if;
Rewrite (First_Actual, Obj);
end if;
-- The operation is obtained from the dispatch table and not by
-- visibility, and may be declared in a unit that is not explicitly
-- referenced in the source, but is nevertheless required in the
-- context of the current unit. Indicate that operation and its scope
-- are referenced, to prevent spurious and misleading warnings. If
-- the operation is overloaded, all primitives are in the same scope
-- and we can use any of them.
Set_Referenced (Entity (Subprog), True);
Set_Referenced (Scope (Entity (Subprog)), True);
Rewrite (Node_To_Replace, Call_Node);
-- Propagate the interpretations collected in subprog to the new
-- function call node, to be resolved from context.
if Is_Overloaded (Subprog) then
Save_Interps (Subprog, Node_To_Replace);
else
-- The type of the subprogram may be a limited view obtained
-- transitively from another unit. If full view is available,
-- use it to analyze call.
declare
T : constant Entity_Id := Etype (Subprog);
begin
if From_Limited_With (T) then
Set_Etype (Entity (Subprog), Available_View (T));
end if;
end;
Analyze (Node_To_Replace);
-- If the operation has been rewritten into a call, which may get
-- subsequently an explicit dereference, preserve the type on the
-- original node (selected component or indexed component) for
-- subsequent legality tests, e.g. Is_Variable. which examines
-- the original node.
if Nkind (Node_To_Replace) = N_Function_Call then
Set_Etype
(Original_Node (Node_To_Replace), Etype (Node_To_Replace));
end if;
end if;
end Complete_Object_Operation;
----------------------
-- Report_Ambiguity --
----------------------
procedure Report_Ambiguity (Op : Entity_Id) is
Access_Actual : constant Boolean :=
Is_Access_Type (Etype (Prefix (N)));
Access_Formal : Boolean := False;
begin
Error_Msg_Sloc := Sloc (Op);
if Present (First_Formal (Op)) then
Access_Formal := Is_Access_Type (Etype (First_Formal (Op)));
end if;
if Access_Formal and then not Access_Actual then
if Nkind (Parent (Op)) = N_Full_Type_Declaration then
Error_Msg_N
("\possible interpretation "
& "(inherited, with implicit 'Access) #", N);
else
Error_Msg_N
("\possible interpretation (with implicit 'Access) #", N);
end if;
elsif not Access_Formal and then Access_Actual then
if Nkind (Parent (Op)) = N_Full_Type_Declaration then
Error_Msg_N
("\possible interpretation "
& "(inherited, with implicit dereference) #", N);
else
Error_Msg_N
("\possible interpretation (with implicit dereference) #", N);
end if;
else
if Nkind (Parent (Op)) = N_Full_Type_Declaration then
Error_Msg_N ("\possible interpretation (inherited)#", N);
else
Error_Msg_N -- CODEFIX
("\possible interpretation#", N);
end if;
end if;
end Report_Ambiguity;
--------------------------------
-- Transform_Object_Operation --
--------------------------------
procedure Transform_Object_Operation
(Call_Node : out Node_Id;
Node_To_Replace : out Node_Id)
is
Dummy : constant Node_Id := New_Copy (Obj);
-- Placeholder used as a first parameter in the call, replaced
-- eventually by the proper object.
Parent_Node : constant Node_Id := Parent (N);
Actual : Node_Id;
Actuals : List_Id;
begin
-- Common case covering 1) Call to a procedure and 2) Call to a
-- function that has some additional actuals.
if Nkind (Parent_Node) in N_Subprogram_Call
-- N is a selected component node containing the name of the
-- subprogram. If N is not the name of the parent node we must
-- not replace the parent node by the new construct. This case
-- occurs when N is a parameterless call to a subprogram that
-- is an actual parameter of a call to another subprogram. For
-- example:
-- Some_Subprogram (..., Obj.Operation, ...)
and then Name (Parent_Node) = N
then
Node_To_Replace := Parent_Node;
Actuals := Parameter_Associations (Parent_Node);
if Present (Actuals) then
Prepend (Dummy, Actuals);
else
Actuals := New_List (Dummy);
end if;
if Nkind (Parent_Node) = N_Procedure_Call_Statement then
Call_Node :=
Make_Procedure_Call_Statement (Loc,
Name => New_Copy (Subprog),
Parameter_Associations => Actuals);
else
Call_Node :=
Make_Function_Call (Loc,
Name => New_Copy (Subprog),
Parameter_Associations => Actuals);
end if;
-- Before analysis, a function call appears as an indexed component
-- if there are no named associations.
elsif Nkind (Parent_Node) = N_Indexed_Component
and then N = Prefix (Parent_Node)
then
Node_To_Replace := Parent_Node;
Actuals := Expressions (Parent_Node);
Actual := First (Actuals);
while Present (Actual) loop
Analyze (Actual);
Next (Actual);
end loop;
Prepend (Dummy, Actuals);
Call_Node :=
Make_Function_Call (Loc,
Name => New_Copy (Subprog),
Parameter_Associations => Actuals);
-- Parameterless call: Obj.F is rewritten as F (Obj)
else
Node_To_Replace := N;
Call_Node :=
Make_Function_Call (Loc,
Name => New_Copy (Subprog),
Parameter_Associations => New_List (Dummy));
end if;
end Transform_Object_Operation;
------------------------------
-- Try_Class_Wide_Operation --
------------------------------
function Try_Class_Wide_Operation
(Call_Node : Node_Id;
Node_To_Replace : Node_Id) return Boolean
is
Anc_Type : Entity_Id;
Matching_Op : Entity_Id := Empty;
Error : Boolean;
procedure Traverse_Homonyms
(Anc_Type : Entity_Id;
Error : out Boolean);
-- Traverse the homonym chain of the subprogram searching for those
-- homonyms whose first formal has the Anc_Type's class-wide type,
-- or an anonymous access type designating the class-wide type. If
-- an ambiguity is detected, then Error is set to True.
procedure Traverse_Interfaces
(Anc_Type : Entity_Id;
Error : out Boolean);
-- Traverse the list of interfaces, if any, associated with Anc_Type
-- and search for acceptable class-wide homonyms associated with each
-- interface. If an ambiguity is detected, then Error is set to True.
-----------------------
-- Traverse_Homonyms --
-----------------------
procedure Traverse_Homonyms
(Anc_Type : Entity_Id;
Error : out Boolean)
is
Cls_Type : Entity_Id;
Hom : Entity_Id;
Hom_Ref : Node_Id;
Success : Boolean;
begin
Error := False;
Cls_Type := Class_Wide_Type (Anc_Type);
Hom := Current_Entity (Subprog);
-- Find a non-hidden operation whose first parameter is of the
-- class-wide type, a subtype thereof, or an anonymous access
-- to same. If in an instance, the operation can be considered
-- even if hidden (it may be hidden because the instantiation
-- is expanded after the containing package has been analyzed).
while Present (Hom) loop
if Ekind_In (Hom, E_Procedure, E_Function)
and then (not Is_Hidden (Hom) or else In_Instance)
and then Scope (Hom) = Scope (Anc_Type)
and then Present (First_Formal (Hom))
and then
(Base_Type (Etype (First_Formal (Hom))) = Cls_Type
or else
(Is_Access_Type (Etype (First_Formal (Hom)))
and then
Ekind (Etype (First_Formal (Hom))) =
E_Anonymous_Access_Type
and then
Base_Type
(Designated_Type (Etype (First_Formal (Hom)))) =
Cls_Type))
then
-- If the context is a procedure call, ignore functions
-- in the name of the call.
if Ekind (Hom) = E_Function
and then Nkind (Parent (N)) = N_Procedure_Call_Statement
and then N = Name (Parent (N))
then
goto Next_Hom;
-- If the context is a function call, ignore procedures
-- in the name of the call.
elsif Ekind (Hom) = E_Procedure
and then Nkind (Parent (N)) /= N_Procedure_Call_Statement
then
goto Next_Hom;
end if;
Set_Etype (Call_Node, Any_Type);
Set_Is_Overloaded (Call_Node, False);
Success := False;
if No (Matching_Op) then
Hom_Ref := New_Occurrence_Of (Hom, Sloc (Subprog));
Set_Etype (Call_Node, Any_Type);
Set_Parent (Call_Node, Parent (Node_To_Replace));
Set_Name (Call_Node, Hom_Ref);
Analyze_One_Call
(N => Call_Node,
Nam => Hom,
Report => Report_Error,
Success => Success,
Skip_First => True);
Matching_Op :=
Valid_Candidate (Success, Call_Node, Hom);
else
Analyze_One_Call
(N => Call_Node,
Nam => Hom,
Report => Report_Error,
Success => Success,
Skip_First => True);
if Present (Valid_Candidate (Success, Call_Node, Hom))
and then Nkind (Call_Node) /= N_Function_Call
then
Error_Msg_NE ("ambiguous call to&", N, Hom);
Report_Ambiguity (Matching_Op);
Report_Ambiguity (Hom);
Error := True;
return;
end if;
end if;
end if;
<<Next_Hom>>
Hom := Homonym (Hom);
end loop;
end Traverse_Homonyms;
-------------------------
-- Traverse_Interfaces --
-------------------------
procedure Traverse_Interfaces
(Anc_Type : Entity_Id;
Error : out Boolean)
is
Intface_List : constant List_Id :=
Abstract_Interface_List (Anc_Type);
Intface : Node_Id;
begin
Error := False;
if Is_Non_Empty_List (Intface_List) then
Intface := First (Intface_List);
while Present (Intface) loop
-- Look for acceptable class-wide homonyms associated with
-- the interface.
Traverse_Homonyms (Etype (Intface), Error);
if Error then
return;
end if;
-- Continue the search by looking at each of the interface's
-- associated interface ancestors.
Traverse_Interfaces (Etype (Intface), Error);
if Error then
return;
end if;
Next (Intface);
end loop;
end if;
end Traverse_Interfaces;
-- Start of processing for Try_Class_Wide_Operation
begin
-- If we are searching only for conflicting class-wide subprograms
-- then initialize directly Matching_Op with the target entity.
if CW_Test_Only then
Matching_Op := Entity (Selector_Name (N));
end if;
-- Loop through ancestor types (including interfaces), traversing
-- the homonym chain of the subprogram, trying out those homonyms
-- whose first formal has the class-wide type of the ancestor, or
-- an anonymous access type designating the class-wide type.
Anc_Type := Obj_Type;
loop
-- Look for a match among homonyms associated with the ancestor
Traverse_Homonyms (Anc_Type, Error);
if Error then
return True;
end if;
-- Continue the search for matches among homonyms associated with
-- any interfaces implemented by the ancestor.
Traverse_Interfaces (Anc_Type, Error);
if Error then
return True;
end if;
exit when Etype (Anc_Type) = Anc_Type;
Anc_Type := Etype (Anc_Type);
end loop;
if Present (Matching_Op) then
Set_Etype (Call_Node, Etype (Matching_Op));
end if;
return Present (Matching_Op);
end Try_Class_Wide_Operation;
-----------------------------------
-- Try_One_Prefix_Interpretation --
-----------------------------------
procedure Try_One_Prefix_Interpretation (T : Entity_Id) is
-- If the interpretation does not have a valid candidate type,
-- preserve current value of Obj_Type for subsequent errors.
Prev_Obj_Type : constant Entity_Id := Obj_Type;
begin
Obj_Type := T;
if Is_Access_Type (Obj_Type) then
Obj_Type := Designated_Type (Obj_Type);
end if;
if Ekind (Obj_Type) = E_Private_Subtype then
Obj_Type := Base_Type (Obj_Type);
end if;
if Is_Class_Wide_Type (Obj_Type) then
Obj_Type := Etype (Class_Wide_Type (Obj_Type));
end if;
-- The type may have be obtained through a limited_with clause,
-- in which case the primitive operations are available on its
-- non-limited view. If still incomplete, retrieve full view.
if Ekind (Obj_Type) = E_Incomplete_Type
and then From_Limited_With (Obj_Type)
and then Has_Non_Limited_View (Obj_Type)
then
Obj_Type := Get_Full_View (Non_Limited_View (Obj_Type));
end if;
-- If the object is not tagged, or the type is still an incomplete
-- type, this is not a prefixed call.
if not Is_Tagged_Type (Obj_Type)
or else Is_Incomplete_Type (Obj_Type)
then
-- Restore previous type if current one is not legal candidate
Obj_Type := Prev_Obj_Type;
return;
end if;
declare
Dup_Call_Node : constant Node_Id := New_Copy (New_Call_Node);
CW_Result : Boolean;
Prim_Result : Boolean;
pragma Unreferenced (CW_Result);
begin
if not CW_Test_Only then
Prim_Result :=
Try_Primitive_Operation
(Call_Node => New_Call_Node,
Node_To_Replace => Node_To_Replace);
end if;
-- Check if there is a class-wide subprogram covering the
-- primitive. This check must be done even if a candidate
-- was found in order to report ambiguous calls.
if not (Prim_Result) then
CW_Result :=
Try_Class_Wide_Operation
(Call_Node => New_Call_Node,
Node_To_Replace => Node_To_Replace);
-- If we found a primitive we search for class-wide subprograms
-- using a duplicate of the call node (done to avoid missing its
-- decoration if there is no ambiguity).
else
CW_Result :=
Try_Class_Wide_Operation
(Call_Node => Dup_Call_Node,
Node_To_Replace => Node_To_Replace);
end if;
end;
end Try_One_Prefix_Interpretation;
-----------------------------
-- Try_Primitive_Operation --
-----------------------------
function Try_Primitive_Operation
(Call_Node : Node_Id;
Node_To_Replace : Node_Id) return Boolean
is
Elmt : Elmt_Id;
Prim_Op : Entity_Id;
Matching_Op : Entity_Id := Empty;
Prim_Op_Ref : Node_Id := Empty;
Corr_Type : Entity_Id := Empty;
-- If the prefix is a synchronized type, the controlling type of
-- the primitive operation is the corresponding record type, else
-- this is the object type itself.
Success : Boolean := False;
function Collect_Generic_Type_Ops (T : Entity_Id) return Elist_Id;
-- For tagged types the candidate interpretations are found in
-- the list of primitive operations of the type and its ancestors.
-- For formal tagged types we have to find the operations declared
-- in the same scope as the type (including in the generic formal
-- part) because the type itself carries no primitive operations,
-- except for formal derived types that inherit the operations of
-- the parent and progenitors.
--
-- If the context is a generic subprogram body, the generic formals
-- are visible by name, but are not in the entity list of the
-- subprogram because that list starts with the subprogram formals.
-- We retrieve the candidate operations from the generic declaration.
function Extended_Primitive_Ops (T : Entity_Id) return Elist_Id;
-- Prefix notation can also be used on operations that are not
-- primitives of the type, but are declared in the same immediate
-- declarative part, which can only mean the corresponding package
-- body (See RM 4.1.3 (9.2/3)). If we are in that body we extend the
-- list of primitives with body operations with the same name that
-- may be candidates, so that Try_Primitive_Operations can examine
-- them if no real primitive is found.
function Is_Private_Overriding (Op : Entity_Id) return Boolean;
-- An operation that overrides an inherited operation in the private
-- part of its package may be hidden, but if the inherited operation
-- is visible a direct call to it will dispatch to the private one,
-- which is therefore a valid candidate.
function Names_Match
(Obj_Type : Entity_Id;
Prim_Op : Entity_Id;
Subprog : Entity_Id) return Boolean;
-- Return True if the names of Prim_Op and Subprog match. If Obj_Type
-- is a protected type then compare also the original name of Prim_Op
-- with the name of Subprog (since the expander may have added a
-- prefix to its original name --see Exp_Ch9.Build_Selected_Name).
function Valid_First_Argument_Of (Op : Entity_Id) return Boolean;
-- Verify that the prefix, dereferenced if need be, is a valid
-- controlling argument in a call to Op. The remaining actuals
-- are checked in the subsequent call to Analyze_One_Call.
------------------------------
-- Collect_Generic_Type_Ops --
------------------------------
function Collect_Generic_Type_Ops (T : Entity_Id) return Elist_Id is
Bas : constant Entity_Id := Base_Type (T);
Candidates : constant Elist_Id := New_Elmt_List;
Subp : Entity_Id;
Formal : Entity_Id;
procedure Check_Candidate;
-- The operation is a candidate if its first parameter is a
-- controlling operand of the desired type.
-----------------------
-- Check_Candidate; --
-----------------------
procedure Check_Candidate is
begin
Formal := First_Formal (Subp);
if Present (Formal)
and then Is_Controlling_Formal (Formal)
and then
(Base_Type (Etype (Formal)) = Bas
or else
(Is_Access_Type (Etype (Formal))
and then Designated_Type (Etype (Formal)) = Bas))
then
Append_Elmt (Subp, Candidates);
end if;
end Check_Candidate;
-- Start of processing for Collect_Generic_Type_Ops
begin
if Is_Derived_Type (T) then
return Primitive_Operations (T);
elsif Ekind_In (Scope (T), E_Procedure, E_Function) then
-- Scan the list of generic formals to find subprograms
-- that may have a first controlling formal of the type.
if Nkind (Unit_Declaration_Node (Scope (T))) =
N_Generic_Subprogram_Declaration
then
declare
Decl : Node_Id;
begin
Decl :=
First (Generic_Formal_Declarations
(Unit_Declaration_Node (Scope (T))));
while Present (Decl) loop
if Nkind (Decl) in N_Formal_Subprogram_Declaration then
Subp := Defining_Entity (Decl);
Check_Candidate;
end if;
Next (Decl);
end loop;
end;
end if;
return Candidates;
else
-- Scan the list of entities declared in the same scope as
-- the type. In general this will be an open scope, given that
-- the call we are analyzing can only appear within a generic
-- declaration or body (either the one that declares T, or a
-- child unit).
-- For a subtype representing a generic actual type, go to the
-- base type.
if Is_Generic_Actual_Type (T) then
Subp := First_Entity (Scope (Base_Type (T)));
else
Subp := First_Entity (Scope (T));
end if;
while Present (Subp) loop
if Is_Overloadable (Subp) then
Check_Candidate;
end if;
Next_Entity (Subp);
end loop;
return Candidates;
end if;
end Collect_Generic_Type_Ops;
----------------------------
-- Extended_Primitive_Ops --
----------------------------
function Extended_Primitive_Ops (T : Entity_Id) return Elist_Id is
Type_Scope : constant Entity_Id := Scope (T);
Body_Decls : List_Id;
Op_Found : Boolean;
Op : Entity_Id;
Op_List : Elist_Id;
begin
Op_List := Primitive_Operations (T);
if Ekind (Type_Scope) = E_Package
and then In_Package_Body (Type_Scope)
and then In_Open_Scopes (Type_Scope)
then
-- Retrieve list of declarations of package body.
Body_Decls :=
Declarations
(Unit_Declaration_Node
(Corresponding_Body
(Unit_Declaration_Node (Type_Scope))));
Op := Current_Entity (Subprog);
Op_Found := False;
while Present (Op) loop
if Comes_From_Source (Op)
and then Is_Overloadable (Op)
-- Exclude overriding primitive operations of a type
-- extension declared in the package body, to prevent
-- duplicates in extended list.
and then not Is_Primitive (Op)
and then Is_List_Member (Unit_Declaration_Node (Op))
and then List_Containing (Unit_Declaration_Node (Op)) =
Body_Decls
then
if not Op_Found then
-- Copy list of primitives so it is not affected for
-- other uses.
Op_List := New_Copy_Elist (Op_List);
Op_Found := True;
end if;
Append_Elmt (Op, Op_List);
end if;
Op := Homonym (Op);
end loop;
end if;
return Op_List;
end Extended_Primitive_Ops;
---------------------------
-- Is_Private_Overriding --
---------------------------
function Is_Private_Overriding (Op : Entity_Id) return Boolean is
Visible_Op : constant Entity_Id := Homonym (Op);
begin
return Present (Visible_Op)
and then Scope (Op) = Scope (Visible_Op)
and then not Comes_From_Source (Visible_Op)
and then Alias (Visible_Op) = Op
and then not Is_Hidden (Visible_Op);
end Is_Private_Overriding;
-----------------
-- Names_Match --
-----------------
function Names_Match
(Obj_Type : Entity_Id;
Prim_Op : Entity_Id;
Subprog : Entity_Id) return Boolean is
begin
-- Common case: exact match
if Chars (Prim_Op) = Chars (Subprog) then
return True;
-- For protected type primitives the expander may have built the
-- name of the dispatching primitive prepending the type name to
-- avoid conflicts with the name of the protected subprogram (see
-- Exp_Ch9.Build_Selected_Name).
elsif Is_Protected_Type (Obj_Type) then
return
Present (Original_Protected_Subprogram (Prim_Op))
and then Chars (Original_Protected_Subprogram (Prim_Op)) =
Chars (Subprog);
end if;
return False;
end Names_Match;
-----------------------------
-- Valid_First_Argument_Of --
-----------------------------
function Valid_First_Argument_Of (Op : Entity_Id) return Boolean is
Typ : Entity_Id := Etype (First_Formal (Op));
begin
if Is_Concurrent_Type (Typ)
and then Present (Corresponding_Record_Type (Typ))
then
Typ := Corresponding_Record_Type (Typ);
end if;
-- Simple case. Object may be a subtype of the tagged type or may
-- be the corresponding record of a synchronized type.
return Obj_Type = Typ
or else Base_Type (Obj_Type) = Typ
or else Corr_Type = Typ
-- Object may be of a derived type whose parent has unknown
-- discriminants, in which case the type matches the underlying
-- record view of its base.
or else
(Has_Unknown_Discriminants (Typ)
and then Typ = Underlying_Record_View (Base_Type (Obj_Type)))
-- Prefix can be dereferenced
or else
(Is_Access_Type (Corr_Type)
and then Designated_Type (Corr_Type) = Typ)
-- Formal is an access parameter, for which the object can
-- provide an access.
or else
(Ekind (Typ) = E_Anonymous_Access_Type
and then
Base_Type (Designated_Type (Typ)) = Base_Type (Corr_Type));
end Valid_First_Argument_Of;
-- Start of processing for Try_Primitive_Operation
begin
-- Look for subprograms in the list of primitive operations. The name
-- must be identical, and the kind of call indicates the expected
-- kind of operation (function or procedure). If the type is a
-- (tagged) synchronized type, the primitive ops are attached to the
-- corresponding record (base) type.
if Is_Concurrent_Type (Obj_Type) then
if Present (Corresponding_Record_Type (Obj_Type)) then
Corr_Type := Base_Type (Corresponding_Record_Type (Obj_Type));
Elmt := First_Elmt (Primitive_Operations (Corr_Type));
else
Corr_Type := Obj_Type;
Elmt := First_Elmt (Collect_Generic_Type_Ops (Obj_Type));
end if;
elsif not Is_Generic_Type (Obj_Type) then
Corr_Type := Obj_Type;
Elmt := First_Elmt (Extended_Primitive_Ops (Obj_Type));
else
Corr_Type := Obj_Type;
Elmt := First_Elmt (Collect_Generic_Type_Ops (Obj_Type));
end if;
while Present (Elmt) loop
Prim_Op := Node (Elmt);
if Names_Match (Obj_Type, Prim_Op, Subprog)
and then Present (First_Formal (Prim_Op))
and then Valid_First_Argument_Of (Prim_Op)
and then
(Nkind (Call_Node) = N_Function_Call)
=
(Ekind (Prim_Op) = E_Function)
then
-- Ada 2005 (AI-251): If this primitive operation corresponds
-- to an immediate ancestor interface there is no need to add
-- it to the list of interpretations; the corresponding aliased
-- primitive is also in this list of primitive operations and
-- will be used instead.
if (Present (Interface_Alias (Prim_Op))
and then Is_Ancestor (Find_Dispatching_Type
(Alias (Prim_Op)), Corr_Type))
-- Do not consider hidden primitives unless the type is in an
-- open scope or we are within an instance, where visibility
-- is known to be correct, or else if this is an overriding
-- operation in the private part for an inherited operation.
or else (Is_Hidden (Prim_Op)
and then not Is_Immediately_Visible (Obj_Type)
and then not In_Instance
and then not Is_Private_Overriding (Prim_Op))
then
goto Continue;
end if;
Set_Etype (Call_Node, Any_Type);
Set_Is_Overloaded (Call_Node, False);
if No (Matching_Op) then
Prim_Op_Ref := New_Occurrence_Of (Prim_Op, Sloc (Subprog));
Candidate := Prim_Op;
Set_Parent (Call_Node, Parent (Node_To_Replace));
Set_Name (Call_Node, Prim_Op_Ref);
Success := False;
Analyze_One_Call
(N => Call_Node,
Nam => Prim_Op,
Report => Report_Error,
Success => Success,
Skip_First => True);
Matching_Op := Valid_Candidate (Success, Call_Node, Prim_Op);
-- More than one interpretation, collect for subsequent
-- disambiguation. If this is a procedure call and there
-- is another match, report ambiguity now.
else
Analyze_One_Call
(N => Call_Node,
Nam => Prim_Op,
Report => Report_Error,
Success => Success,
Skip_First => True);
if Present (Valid_Candidate (Success, Call_Node, Prim_Op))
and then Nkind (Call_Node) /= N_Function_Call
then
Error_Msg_NE ("ambiguous call to&", N, Prim_Op);
Report_Ambiguity (Matching_Op);
Report_Ambiguity (Prim_Op);
return True;
end if;
end if;
end if;
<<Continue>>
Next_Elmt (Elmt);
end loop;
if Present (Matching_Op) then
Set_Etype (Call_Node, Etype (Matching_Op));
end if;
return Present (Matching_Op);
end Try_Primitive_Operation;
-- Start of processing for Try_Object_Operation
begin
Analyze_Expression (Obj);
-- Analyze the actuals if node is known to be a subprogram call
if Is_Subprg_Call and then N = Name (Parent (N)) then
Actual := First (Parameter_Associations (Parent (N)));
while Present (Actual) loop
Analyze_Expression (Actual);
Next (Actual);
end loop;
end if;
-- Build a subprogram call node, using a copy of Obj as its first
-- actual. This is a placeholder, to be replaced by an explicit
-- dereference when needed.
Transform_Object_Operation
(Call_Node => New_Call_Node,
Node_To_Replace => Node_To_Replace);
Set_Etype (New_Call_Node, Any_Type);
Set_Etype (Subprog, Any_Type);
Set_Parent (New_Call_Node, Parent (Node_To_Replace));
if not Is_Overloaded (Obj) then
Try_One_Prefix_Interpretation (Obj_Type);
else
declare
I : Interp_Index;
It : Interp;
begin
Get_First_Interp (Obj, I, It);
while Present (It.Nam) loop
Try_One_Prefix_Interpretation (It.Typ);
Get_Next_Interp (I, It);
end loop;
end;
end if;
if Etype (New_Call_Node) /= Any_Type then
-- No need to complete the tree transformations if we are only
-- searching for conflicting class-wide subprograms
if CW_Test_Only then
return False;
else
Complete_Object_Operation
(Call_Node => New_Call_Node,
Node_To_Replace => Node_To_Replace);
return True;
end if;
elsif Present (Candidate) then
-- The argument list is not type correct. Re-analyze with error
-- reporting enabled, and use one of the possible candidates.
-- In All_Errors_Mode, re-analyze all failed interpretations.
if All_Errors_Mode then
Report_Error := True;
if Try_Primitive_Operation
(Call_Node => New_Call_Node,
Node_To_Replace => Node_To_Replace)
or else
Try_Class_Wide_Operation
(Call_Node => New_Call_Node,
Node_To_Replace => Node_To_Replace)
then
null;
end if;
else
Analyze_One_Call
(N => New_Call_Node,
Nam => Candidate,
Report => True,
Success => Success,
Skip_First => True);
end if;
-- No need for further errors
return True;
else
-- There was no candidate operation, so report it as an error
-- in the caller: Analyze_Selected_Component.
return False;
end if;
end Try_Object_Operation;
---------
-- wpo --
---------
procedure wpo (T : Entity_Id) is
Op : Entity_Id;
E : Elmt_Id;
begin
if not Is_Tagged_Type (T) then
return;
end if;
E := First_Elmt (Primitive_Operations (Base_Type (T)));
while Present (E) loop
Op := Node (E);
Write_Int (Int (Op));
Write_Str (" === ");
Write_Name (Chars (Op));
Write_Str (" in ");
Write_Name (Chars (Scope (Op)));
Next_Elmt (E);
Write_Eol;
end loop;
end wpo;
end Sem_Ch4;
|
package body Common with SPARK_Mode is
-------------------
-- Append_To_Msg --
-------------------
procedure Append_To_Msg (Msg : in out Unbounded_String; Tail : String) is
begin
if Length (Msg) < Natural'Last and then Tail'Length > 0 then
declare
Max_Length : constant Positive := Natural'Last - Length (Msg);
begin
if Max_Length <= Tail'Length then
Append (Msg, Tail (Tail'First .. Tail'First - 1 + Max_Length));
else
Append (Msg, Tail);
end if;
end;
end if;
end Append_To_Msg;
procedure Append_To_Msg (Msg : in out Unbounded_String; Tail : Unbounded_String) is
begin
if Length (Msg) < Natural'Last then
declare
Max_Length : constant Positive := Natural'Last - Length (Msg);
begin
Append (Msg, Slice (Tail, 1, Natural'Min (Length (Tail), Max_Length)));
end;
end if;
end Append_To_Msg;
procedure Append_To_Msg (Msg : in out Unbounded_String; Tail : Character) is
begin
if Length (Msg) < Natural'Last then
Append (Msg, Tail);
end if;
end Append_To_Msg;
end Common;
|
package BSSNBase.Data_IO is
procedure read_data (file_name : String := "data.txt");
procedure read_grid (file_name : String := "grid.txt");
procedure write_data (file_name : String := "data.txt");
procedure write_grid (file_name : String := "grid.txt");
procedure read_data_fmt (file_name : String := "data.txt");
procedure read_grid_fmt (file_name : String := "grid.txt");
procedure write_data_fmt (file_name : String := "data.txt");
procedure write_grid_fmt (file_name : String := "grid.txt");
end BSSNBase.Data_IO;
|
-- This package was generated by the Ada_Drivers_Library project wizard script
package ADL_Config is
Max_Mount_Points : constant := 2; -- From default value
Max_Mount_Name_Length : constant := 128; -- From default value
Has_Ravenscar_Full_Runtime : constant String := "False"; -- From default value
Board : constant String := "Native"; -- From command line
Has_ZFP_Runtime : constant String := "False"; -- From default value
Has_Ravenscar_SFP_Runtime : constant String := "False"; -- From default value
Max_Path_Length : constant := 1024; -- From default value
Architecture : constant String := "Native"; -- From board definition
end ADL_Config;
|
-----------------------------------------------------------------------
-- awa-storages-stores-databases -- Database store
-- Copyright (C) 2012 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 ADO.Sessions;
with AWA.Storages.Models;
-- === Database store ===
-- The `AWA.Storages.Stores.Databases` store uses the database to save a data content.
-- The data is saved in a specific table in a database blob column.
-- The database store uses another store service to temporarily save the data content
-- in a local file when the application needs a file access to the data.
package AWA.Storages.Stores.Databases is
-- ------------------------------
-- Storage Service
-- ------------------------------
type Database_Store is new AWA.Storages.Stores.Store with record
Tmp : AWA.Storages.Stores.Store_Access;
end record;
-- Save the file represented by the `Path` variable into a store and associate that
-- content with the storage reference represented by `Into`.
procedure Save (Storage : in Database_Store;
Session : in out ADO.Sessions.Master_Session;
Into : in out AWA.Storages.Models.Storage_Ref'Class;
Path : in String);
procedure Load (Storage : in Database_Store;
Session : in out ADO.Sessions.Session'Class;
From : in AWA.Storages.Models.Storage_Ref'Class;
Into : in out AWA.Storages.Storage_File);
-- Create a storage
procedure Create (Storage : in Database_Store;
Session : in out ADO.Sessions.Master_Session;
From : in AWA.Storages.Models.Storage_Ref'Class;
Into : in out AWA.Storages.Storage_File);
-- Delete the content associate with the storage represented by `From`.
procedure Delete (Storage : in Database_Store;
Session : in out ADO.Sessions.Master_Session;
From : in out AWA.Storages.Models.Storage_Ref'Class);
end AWA.Storages.Stores.Databases;
|
-- C34007J.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 THE REQUIRED PREDEFINED OPERATIONS ARE DECLARED
-- (IMPLICITLY) FOR DERIVED ACCESS TYPES WHOSE DESIGNATED TYPE
-- IS A TASK TYPE.
-- HISTORY:
-- JRK 09/26/86 CREATED ORIGINAL TEST.
-- JLH 09/25/87 REFORMATTED HEADER.
-- BCB 09/26/88 REMOVED COMPARISION INVOLVING OBJECT SIZE.
-- BCB 03/07/90 PUT CHECK FOR 'STORAGE_SIZE IN EXCEPTION HANDLER.
-- THS 09/18/90 REMOVED DECLARATION OF B, MADE THE BODY OF
-- PROCEDURE A NULL, AND DELETED ALL REFERENCES TO B.
-- PWN 01/31/95 REMOVED INCONSISTENCIES WITH ADA 9X.
WITH SYSTEM; USE SYSTEM;
WITH REPORT; USE REPORT;
PROCEDURE C34007J IS
TASK TYPE DESIGNATED IS
ENTRY E (I : IN OUT INTEGER);
ENTRY F (1 .. 3) (I : INTEGER; J : OUT INTEGER);
ENTRY R (I : OUT INTEGER);
ENTRY W (I : INTEGER);
END DESIGNATED;
TYPE PARENT IS ACCESS DESIGNATED;
TYPE T IS NEW PARENT;
X : T;
K : INTEGER := X'SIZE;
Y : T;
W : PARENT;
I : INTEGER := 0;
J : INTEGER := 0;
PROCEDURE A (X : ADDRESS) IS
BEGIN
NULL;
END A;
FUNCTION V RETURN T IS
BEGIN
RETURN NEW DESIGNATED;
END V;
FUNCTION IDENT (X : T) RETURN T IS
BEGIN
IF (X = NULL OR ELSE X'CALLABLE) OR IDENT_BOOL (TRUE) THEN
RETURN X; -- ALWAYS EXECUTED.
END IF;
RETURN NEW DESIGNATED;
END IDENT;
TASK BODY DESIGNATED IS
N : INTEGER := 1;
BEGIN
LOOP
SELECT
ACCEPT E (I : IN OUT INTEGER) DO
I := I + N;
END E;
OR
ACCEPT F (2) (I : INTEGER; J : OUT INTEGER) DO
J := I + N;
END F;
OR
ACCEPT R (I : OUT INTEGER) DO
I := N;
END R;
OR
ACCEPT W (I : INTEGER) DO
N := I;
END W;
OR
TERMINATE;
END SELECT;
END LOOP;
END DESIGNATED;
BEGIN
TEST ("C34007J", "CHECK THAT THE REQUIRED PREDEFINED OPERATIONS " &
"ARE DECLARED (IMPLICITLY) FOR DERIVED " &
"ACCESS TYPES WHOSE DESIGNATED TYPE IS A " &
"TASK TYPE");
X := NEW DESIGNATED;
Y := NEW DESIGNATED;
W := NEW DESIGNATED;
IF Y = NULL THEN
FAILED ("INCORRECT INITIALIZATION - 1");
ELSE Y.W (2);
Y.R (I);
IF I /= 2 THEN
FAILED ("INCORRECT INITIALIZATION - 2");
END IF;
END IF;
X := IDENT (Y);
IF X /= Y THEN
FAILED ("INCORRECT :=");
END IF;
IF T'(X) /= Y THEN
FAILED ("INCORRECT QUALIFICATION");
END IF;
IF T (X) /= Y THEN
FAILED ("INCORRECT SELF CONVERSION");
END IF;
IF EQUAL (3, 3) THEN
W := NEW DESIGNATED;
W.W (3);
END IF;
X := T (W);
IF X = NULL OR X = Y THEN
FAILED ("INCORRECT CONVERSION FROM PARENT - 1");
ELSE I := 5;
X.E (I);
IF I /= 8 THEN
FAILED ("INCORRECT CONVERSION FROM PARENT - 2");
END IF;
END IF;
X := IDENT (Y);
W := PARENT (X);
IF W = NULL OR T (W) /= Y THEN
FAILED ("INCORRECT CONVERSION TO PARENT - 1");
ELSE I := 5;
W.E (I);
IF I /= 7 THEN
FAILED ("INCORRECT CONVERSION TO PARENT - 2");
END IF;
END IF;
IF IDENT (NULL) /= NULL OR X = NULL THEN
FAILED ("INCORRECT NULL");
END IF;
X := IDENT (NEW DESIGNATED);
IF X = NULL OR X = Y THEN
FAILED ("INCORRECT ALLOCATOR - 1");
ELSE I := 5;
X.E (I);
IF I /= 6 THEN
FAILED ("INCORRECT ALLOCATOR - 2");
END IF;
END IF;
X := IDENT (Y);
I := 5;
X.E (I);
IF I /= 7 THEN
FAILED ("INCORRECT SELECTION (ENTRY)");
END IF;
I := 5;
X.F (IDENT_INT (2)) (I, J);
IF J /= 7 THEN
FAILED ("INCORRECT SELECTION (FAMILY)");
END IF;
I := 5;
X.ALL.E (I);
IF I /= 7 THEN
FAILED ("INCORRECT .ALL");
END IF;
X := IDENT (NULL);
BEGIN
IF X.ALL'CALLABLE THEN
FAILED ("NO EXCEPTION FOR NULL.ALL - 1");
ELSE FAILED ("NO EXCEPTION FOR NULL.ALL - 2");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION FOR NULL.ALL");
END;
X := IDENT (Y);
IF X = NULL OR X = NEW DESIGNATED OR NOT (X = Y) THEN
FAILED ("INCORRECT =");
END IF;
IF X /= Y OR NOT (X /= NULL) THEN
FAILED ("INCORRECT /=");
END IF;
IF NOT (X IN T) THEN
FAILED ("INCORRECT ""IN""");
END IF;
IF X NOT IN T THEN
FAILED ("INCORRECT ""NOT IN""");
END IF;
A (X'ADDRESS);
IF NOT X'CALLABLE THEN
FAILED ("INCORRECT OBJECT'CALLABLE");
END IF;
IF NOT V'CALLABLE THEN
FAILED ("INCORRECT VALUE'CALLABLE");
END IF;
BEGIN
IF T'STORAGE_SIZE /= PARENT'STORAGE_SIZE THEN
FAILED ("COLLECTION SIZE OF DERIVED TYPE IS NOT " &
"EQUAL TO COLLECTION SIZE OF PARENT TYPE");
END IF;
EXCEPTION
WHEN PROGRAM_ERROR =>
COMMENT ("PROGRAM_ERROR RAISED FOR " &
"UNDEFINED STORAGE_SIZE (AI-00608)");
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED");
END;
IF X'TERMINATED THEN
FAILED ("INCORRECT OBJECT'TERMINATED");
END IF;
IF V'TERMINATED THEN
FAILED ("INCORRECT VALUE'TERMINATED");
END IF;
RESULT;
END C34007J;
|
-- Copyright 2018-2020 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 VsizeLim is
Small : String := Ident ("1234567890");
Larger : String := Ident ("1234567890|1234567890|1234567890");
begin
Do_Nothing (Small'Address); -- STOP
Do_Nothing (Larger'Address);
end VsizeLim;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ C H 9 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-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. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Checks; use Checks;
with Einfo; use Einfo;
with Errout; use Errout;
with Exp_Ch9; use Exp_Ch9;
with Elists; use Elists;
with Freeze; use Freeze;
with Itypes; use Itypes;
with Lib.Xref; use Lib.Xref;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Restrict; use Restrict;
with Rident; use Rident;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Ch3; use Sem_Ch3;
with Sem_Ch5; use Sem_Ch5;
with Sem_Ch6; use Sem_Ch6;
with Sem_Ch8; use Sem_Ch8;
with Sem_Eval; use Sem_Eval;
with Sem_Res; use Sem_Res;
with Sem_Type; use Sem_Type;
with Sem_Util; use Sem_Util;
with Sem_Warn; use Sem_Warn;
with Snames; use Snames;
with Stand; use Stand;
with Sinfo; use Sinfo;
with Style;
with Tbuild; use Tbuild;
with Uintp; use Uintp;
package body Sem_Ch9 is
-----------------------
-- Local Subprograms --
-----------------------
procedure Check_Max_Entries (D : Node_Id; R : All_Parameter_Restrictions);
-- Given either a protected definition or a task definition in D, check
-- the corresponding restriction parameter identifier R, and if it is set,
-- count the entries (checking the static requirement), and compare with
-- the given maximum.
procedure Check_Overriding_Indicator (Def : Node_Id);
-- Ada 2005 (AI-397): Check the overriding indicator of entries and
-- subprograms of protected or task types. Def is the definition of the
-- protected or task type.
function Find_Concurrent_Spec (Body_Id : Entity_Id) return Entity_Id;
-- Find entity in corresponding task or protected declaration. Use full
-- view if first declaration was for an incomplete type.
procedure Install_Declarations (Spec : Entity_Id);
-- Utility to make visible in corresponding body the entities defined in
-- task, protected type declaration, or entry declaration.
-----------------------------
-- Analyze_Abort_Statement --
-----------------------------
procedure Analyze_Abort_Statement (N : Node_Id) is
T_Name : Node_Id;
begin
Tasking_Used := True;
T_Name := First (Names (N));
while Present (T_Name) loop
Analyze (T_Name);
if Is_Task_Type (Etype (T_Name))
or else (Ada_Version >= Ada_05
and then Ekind (Etype (T_Name)) = E_Class_Wide_Type
and then Is_Interface (Etype (T_Name))
and then Is_Task_Interface (Etype (T_Name)))
then
Resolve (T_Name);
else
if Ada_Version >= Ada_05 then
Error_Msg_N ("expect task name or task interface class-wide "
& "object for ABORT", T_Name);
else
Error_Msg_N ("expect task name for ABORT", T_Name);
end if;
return;
end if;
Next (T_Name);
end loop;
Check_Restriction (No_Abort_Statements, N);
Check_Potentially_Blocking_Operation (N);
end Analyze_Abort_Statement;
--------------------------------
-- Analyze_Accept_Alternative --
--------------------------------
procedure Analyze_Accept_Alternative (N : Node_Id) is
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Present (Condition (N)) then
Analyze_And_Resolve (Condition (N), Any_Boolean);
end if;
Analyze (Accept_Statement (N));
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Accept_Alternative;
------------------------------
-- Analyze_Accept_Statement --
------------------------------
procedure Analyze_Accept_Statement (N : Node_Id) is
Nam : constant Entity_Id := Entry_Direct_Name (N);
Formals : constant List_Id := Parameter_Specifications (N);
Index : constant Node_Id := Entry_Index (N);
Stats : constant Node_Id := Handled_Statement_Sequence (N);
Accept_Id : Entity_Id;
Entry_Nam : Entity_Id;
E : Entity_Id;
Kind : Entity_Kind;
Task_Nam : Entity_Id;
-----------------------
-- Actual_Index_Type --
-----------------------
function Actual_Index_Type (E : Entity_Id) return Entity_Id;
-- If the bounds of an entry family depend on task discriminants, create
-- a new index type where a discriminant is replaced by the local
-- variable that renames it in the task body.
function Actual_Index_Type (E : Entity_Id) return Entity_Id is
Typ : constant Entity_Id := Entry_Index_Type (E);
Lo : constant Node_Id := Type_Low_Bound (Typ);
Hi : constant Node_Id := Type_High_Bound (Typ);
New_T : Entity_Id;
function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id;
-- If bound is discriminant reference, replace with corresponding
-- local variable of the same name.
-----------------------------
-- Actual_Discriminant_Ref --
-----------------------------
function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id is
Typ : constant Entity_Id := Etype (Bound);
Ref : Node_Id;
begin
if not Is_Entity_Name (Bound)
or else Ekind (Entity (Bound)) /= E_Discriminant
then
return Bound;
else
Ref := Make_Identifier (Sloc (N), Chars (Entity (Bound)));
Analyze (Ref);
Resolve (Ref, Typ);
return Ref;
end if;
end Actual_Discriminant_Ref;
-- Start of processing for Actual_Index_Type
begin
if not Has_Discriminants (Task_Nam)
or else (not Is_Entity_Name (Lo)
and then not Is_Entity_Name (Hi))
then
return Entry_Index_Type (E);
else
New_T := Create_Itype (Ekind (Typ), N);
Set_Etype (New_T, Base_Type (Typ));
Set_Size_Info (New_T, Typ);
Set_RM_Size (New_T, RM_Size (Typ));
Set_Scalar_Range (New_T,
Make_Range (Sloc (N),
Low_Bound => Actual_Discriminant_Ref (Lo),
High_Bound => Actual_Discriminant_Ref (Hi)));
return New_T;
end if;
end Actual_Index_Type;
-- Start of processing for Analyze_Accept_Statement
begin
Tasking_Used := True;
-- Entry name is initialized to Any_Id. It should get reset to the
-- matching entry entity. An error is signalled if it is not reset.
Entry_Nam := Any_Id;
for J in reverse 0 .. Scope_Stack.Last loop
Task_Nam := Scope_Stack.Table (J).Entity;
exit when Ekind (Etype (Task_Nam)) = E_Task_Type;
Kind := Ekind (Task_Nam);
if Kind /= E_Block and then Kind /= E_Loop
and then not Is_Entry (Task_Nam)
then
Error_Msg_N ("enclosing body of accept must be a task", N);
return;
end if;
end loop;
if Ekind (Etype (Task_Nam)) /= E_Task_Type then
Error_Msg_N ("invalid context for accept statement", N);
return;
end if;
-- In order to process the parameters, we create a defining
-- identifier that can be used as the name of the scope. The
-- name of the accept statement itself is not a defining identifier,
-- and we cannot use its name directly because the task may have
-- any number of accept statements for the same entry.
if Present (Index) then
Accept_Id := New_Internal_Entity
(E_Entry_Family, Current_Scope, Sloc (N), 'E');
else
Accept_Id := New_Internal_Entity
(E_Entry, Current_Scope, Sloc (N), 'E');
end if;
Set_Etype (Accept_Id, Standard_Void_Type);
Set_Accept_Address (Accept_Id, New_Elmt_List);
if Present (Formals) then
New_Scope (Accept_Id);
Process_Formals (Formals, N);
Create_Extra_Formals (Accept_Id);
End_Scope;
end if;
-- We set the default expressions processed flag because we don't need
-- default expression functions. This is really more like body entity
-- than a spec entity anyway.
Set_Default_Expressions_Processed (Accept_Id);
E := First_Entity (Etype (Task_Nam));
while Present (E) loop
if Chars (E) = Chars (Nam)
and then (Ekind (E) = Ekind (Accept_Id))
and then Type_Conformant (Accept_Id, E)
then
Entry_Nam := E;
exit;
end if;
Next_Entity (E);
end loop;
if Entry_Nam = Any_Id then
Error_Msg_N ("no entry declaration matches accept statement", N);
return;
else
Set_Entity (Nam, Entry_Nam);
Generate_Reference (Entry_Nam, Nam, 'b', Set_Ref => False);
Style.Check_Identifier (Nam, Entry_Nam);
end if;
-- Verify that the entry is not hidden by a procedure declared in the
-- current block (pathological but possible).
if Current_Scope /= Task_Nam then
declare
E1 : Entity_Id;
begin
E1 := First_Entity (Current_Scope);
while Present (E1) loop
if Ekind (E1) = E_Procedure
and then Chars (E1) = Chars (Entry_Nam)
and then Type_Conformant (E1, Entry_Nam)
then
Error_Msg_N ("entry name is not visible", N);
end if;
Next_Entity (E1);
end loop;
end;
end if;
Set_Convention (Accept_Id, Convention (Entry_Nam));
Check_Fully_Conformant (Accept_Id, Entry_Nam, N);
for J in reverse 0 .. Scope_Stack.Last loop
exit when Task_Nam = Scope_Stack.Table (J).Entity;
if Entry_Nam = Scope_Stack.Table (J).Entity then
Error_Msg_N ("duplicate accept statement for same entry", N);
end if;
end loop;
declare
P : Node_Id := N;
begin
loop
P := Parent (P);
case Nkind (P) is
when N_Task_Body | N_Compilation_Unit =>
exit;
when N_Asynchronous_Select =>
Error_Msg_N ("accept statements are not allowed within" &
" an asynchronous select inner" &
" to the enclosing task body", N);
exit;
when others =>
null;
end case;
end loop;
end;
if Ekind (E) = E_Entry_Family then
if No (Index) then
Error_Msg_N ("missing entry index in accept for entry family", N);
else
Analyze_And_Resolve (Index, Entry_Index_Type (E));
Apply_Range_Check (Index, Actual_Index_Type (E));
end if;
elsif Present (Index) then
Error_Msg_N ("invalid entry index in accept for simple entry", N);
end if;
-- If label declarations present, analyze them. They are declared in the
-- enclosing task, but their enclosing scope is the entry itself, so
-- that goto's to the label are recognized as local to the accept.
if Present (Declarations (N)) then
declare
Decl : Node_Id;
Id : Entity_Id;
begin
Decl := First (Declarations (N));
while Present (Decl) loop
Analyze (Decl);
pragma Assert
(Nkind (Decl) = N_Implicit_Label_Declaration);
Id := Defining_Identifier (Decl);
Set_Enclosing_Scope (Id, Entry_Nam);
Next (Decl);
end loop;
end;
end if;
-- If statements are present, they must be analyzed in the context of
-- the entry, so that references to formals are correctly resolved. We
-- also have to add the declarations that are required by the expansion
-- of the accept statement in this case if expansion active.
-- In the case of a select alternative of a selective accept, the
-- expander references the address declaration even if there is no
-- statement list.
-- We also need to create the renaming declarations for the local
-- variables that will replace references to the formals within the
-- accept statement.
Exp_Ch9.Expand_Accept_Declarations (N, Entry_Nam);
-- Set Never_Set_In_Source and clear Is_True_Constant/Current_Value
-- fields on all entry formals (this loop ignores all other entities).
-- Reset Set_Referenced and Has_Pragma_Unreferenced as well, so that we
-- can post accurate warnings on each accept statement for the same
-- entry.
E := First_Entity (Entry_Nam);
while Present (E) loop
if Is_Formal (E) then
Set_Never_Set_In_Source (E, True);
Set_Is_True_Constant (E, False);
Set_Current_Value (E, Empty);
Set_Referenced (E, False);
Set_Has_Pragma_Unreferenced (E, False);
end if;
Next_Entity (E);
end loop;
-- Analyze statements if present
if Present (Stats) then
New_Scope (Entry_Nam);
Install_Declarations (Entry_Nam);
Set_Actual_Subtypes (N, Current_Scope);
Analyze (Stats);
Process_End_Label (Handled_Statement_Sequence (N), 't', Entry_Nam);
End_Scope;
end if;
-- Some warning checks
Check_Potentially_Blocking_Operation (N);
Check_References (Entry_Nam, N);
Set_Entry_Accepted (Entry_Nam);
end Analyze_Accept_Statement;
---------------------------------
-- Analyze_Asynchronous_Select --
---------------------------------
procedure Analyze_Asynchronous_Select (N : Node_Id) is
Param : Node_Id;
Trigger : Node_Id;
begin
Tasking_Used := True;
Check_Restriction (Max_Asynchronous_Select_Nesting, N);
Check_Restriction (No_Select_Statements, N);
if Ada_Version >= Ada_05 then
Trigger := Triggering_Statement (Triggering_Alternative (N));
Analyze (Trigger);
-- The trigger is a dispatching procedure. Postpone the analysis of
-- the triggering and abortable statements until the expansion of
-- this asynchronous select in Expand_N_Asynchronous_Select. This
-- action is required since otherwise we would get a gigi abort from
-- the code replication in Expand_N_Asynchronous_Select of an already
-- analyzed statement list.
if Expander_Active
and then Nkind (Trigger) = N_Procedure_Call_Statement
and then Present (Parameter_Associations (Trigger))
then
Param := First (Parameter_Associations (Trigger));
if Is_Controlling_Actual (Param)
and then Is_Interface (Etype (Param))
then
if Is_Limited_Record (Etype (Param)) then
return;
else
Error_Msg_N
("dispatching operation of limited or synchronized " &
"interface required ('R'M 9.7.2(3))!", N);
end if;
end if;
end if;
end if;
-- Analyze the statements. We analyze statements in the abortable part,
-- because this is the section that is executed first, and that way our
-- remembering of saved values and checks is accurate.
Analyze_Statements (Statements (Abortable_Part (N)));
Analyze (Triggering_Alternative (N));
end Analyze_Asynchronous_Select;
------------------------------------
-- Analyze_Conditional_Entry_Call --
------------------------------------
procedure Analyze_Conditional_Entry_Call (N : Node_Id) is
begin
Check_Restriction (No_Select_Statements, N);
Tasking_Used := True;
Analyze (Entry_Call_Alternative (N));
if List_Length (Else_Statements (N)) = 1
and then Nkind (First (Else_Statements (N))) in N_Delay_Statement
then
Error_Msg_N
("suspicious form of conditional entry call?", N);
Error_Msg_N
("\`SELECT OR` may be intended rather than `SELECT ELSE`", N);
end if;
Analyze_Statements (Else_Statements (N));
end Analyze_Conditional_Entry_Call;
--------------------------------
-- Analyze_Delay_Alternative --
--------------------------------
procedure Analyze_Delay_Alternative (N : Node_Id) is
Expr : Node_Id;
Typ : Entity_Id;
begin
Tasking_Used := True;
Check_Restriction (No_Delay, N);
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Nkind (Parent (N)) = N_Selective_Accept
or else Nkind (Parent (N)) = N_Timed_Entry_Call
then
Expr := Expression (Delay_Statement (N));
-- Defer full analysis until the statement is expanded, to insure
-- that generated code does not move past the guard. The delay
-- expression is only evaluated if the guard is open.
if Nkind (Delay_Statement (N)) = N_Delay_Relative_Statement then
Pre_Analyze_And_Resolve (Expr, Standard_Duration);
else
Pre_Analyze_And_Resolve (Expr);
end if;
Typ := First_Subtype (Etype (Expr));
if Nkind (Delay_Statement (N)) = N_Delay_Until_Statement
and then not Is_RTE (Typ, RO_CA_Time)
and then not Is_RTE (Typ, RO_RT_Time)
then
Error_Msg_N ("expect Time types for `DELAY UNTIL`", Expr);
end if;
Check_Restriction (No_Fixed_Point, Expr);
else
Analyze (Delay_Statement (N));
end if;
if Present (Condition (N)) then
Analyze_And_Resolve (Condition (N), Any_Boolean);
end if;
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Delay_Alternative;
----------------------------
-- Analyze_Delay_Relative --
----------------------------
procedure Analyze_Delay_Relative (N : Node_Id) is
E : constant Node_Id := Expression (N);
begin
Check_Restriction (No_Relative_Delay, N);
Tasking_Used := True;
Check_Restriction (No_Delay, N);
Check_Potentially_Blocking_Operation (N);
Analyze_And_Resolve (E, Standard_Duration);
Check_Restriction (No_Fixed_Point, E);
end Analyze_Delay_Relative;
-------------------------
-- Analyze_Delay_Until --
-------------------------
procedure Analyze_Delay_Until (N : Node_Id) is
E : constant Node_Id := Expression (N);
Typ : Entity_Id;
begin
Tasking_Used := True;
Check_Restriction (No_Delay, N);
Check_Potentially_Blocking_Operation (N);
Analyze (E);
Typ := First_Subtype (Etype (E));
if not Is_RTE (Typ, RO_CA_Time) and then
not Is_RTE (Typ, RO_RT_Time)
then
Error_Msg_N ("expect Time types for `DELAY UNTIL`", E);
end if;
end Analyze_Delay_Until;
------------------------
-- Analyze_Entry_Body --
------------------------
procedure Analyze_Entry_Body (N : Node_Id) is
Id : constant Entity_Id := Defining_Identifier (N);
Decls : constant List_Id := Declarations (N);
Stats : constant Node_Id := Handled_Statement_Sequence (N);
Formals : constant Node_Id := Entry_Body_Formal_Part (N);
P_Type : constant Entity_Id := Current_Scope;
Entry_Name : Entity_Id;
E : Entity_Id;
begin
Tasking_Used := True;
-- Entry_Name is initialized to Any_Id. It should get reset to the
-- matching entry entity. An error is signalled if it is not reset
Entry_Name := Any_Id;
Analyze (Formals);
if Present (Entry_Index_Specification (Formals)) then
Set_Ekind (Id, E_Entry_Family);
else
Set_Ekind (Id, E_Entry);
end if;
Set_Scope (Id, Current_Scope);
Set_Etype (Id, Standard_Void_Type);
Set_Accept_Address (Id, New_Elmt_List);
E := First_Entity (P_Type);
while Present (E) loop
if Chars (E) = Chars (Id)
and then (Ekind (E) = Ekind (Id))
and then Type_Conformant (Id, E)
then
Entry_Name := E;
Set_Convention (Id, Convention (E));
Set_Corresponding_Body (Parent (Entry_Name), Id);
Check_Fully_Conformant (Id, E, N);
if Ekind (Id) = E_Entry_Family then
if not Fully_Conformant_Discrete_Subtypes (
Discrete_Subtype_Definition (Parent (E)),
Discrete_Subtype_Definition
(Entry_Index_Specification (Formals)))
then
Error_Msg_N
("index not fully conformant with previous declaration",
Discrete_Subtype_Definition
(Entry_Index_Specification (Formals)));
else
-- The elaboration of the entry body does not recompute the
-- bounds of the index, which may have side effects. Inherit
-- the bounds from the entry declaration. This is critical
-- if the entry has a per-object constraint. If a bound is
-- given by a discriminant, it must be reanalyzed in order
-- to capture the discriminal of the current entry, rather
-- than that of the protected type.
declare
Index_Spec : constant Node_Id :=
Entry_Index_Specification (Formals);
Def : constant Node_Id :=
New_Copy_Tree
(Discrete_Subtype_Definition (Parent (E)));
begin
if Nkind
(Original_Node
(Discrete_Subtype_Definition (Index_Spec))) = N_Range
then
Set_Etype (Def, Empty);
Set_Analyzed (Def, False);
-- Keep the original subtree to ensure a properly
-- formed tree (e.g. for ASIS use).
Rewrite
(Discrete_Subtype_Definition (Index_Spec), Def);
Set_Analyzed (Low_Bound (Def), False);
Set_Analyzed (High_Bound (Def), False);
if Denotes_Discriminant (Low_Bound (Def)) then
Set_Entity (Low_Bound (Def), Empty);
end if;
if Denotes_Discriminant (High_Bound (Def)) then
Set_Entity (High_Bound (Def), Empty);
end if;
Analyze (Def);
Make_Index (Def, Index_Spec);
Set_Etype
(Defining_Identifier (Index_Spec), Etype (Def));
end if;
end;
end if;
end if;
exit;
end if;
Next_Entity (E);
end loop;
if Entry_Name = Any_Id then
Error_Msg_N ("no entry declaration matches entry body", N);
return;
elsif Has_Completion (Entry_Name) then
Error_Msg_N ("duplicate entry body", N);
return;
else
Set_Has_Completion (Entry_Name);
Generate_Reference (Entry_Name, Id, 'b', Set_Ref => False);
Style.Check_Identifier (Id, Entry_Name);
end if;
Exp_Ch9.Expand_Entry_Barrier (N, Entry_Name);
New_Scope (Entry_Name);
Exp_Ch9.Expand_Entry_Body_Declarations (N);
Install_Declarations (Entry_Name);
Set_Actual_Subtypes (N, Current_Scope);
-- The entity for the protected subprogram corresponding to the entry
-- has been created. We retain the name of this entity in the entry
-- body, for use when the corresponding subprogram body is created.
-- Note that entry bodies have no corresponding_spec, and there is no
-- easy link back in the tree between the entry body and the entity for
-- the entry itself, which is why we must propagate some attributes
-- explicitly from spec to body.
Set_Protected_Body_Subprogram
(Id, Protected_Body_Subprogram (Entry_Name));
Set_Entry_Parameters_Type
(Id, Entry_Parameters_Type (Entry_Name));
if Present (Decls) then
Analyze_Declarations (Decls);
end if;
if Present (Stats) then
Analyze (Stats);
end if;
-- Check for unreferenced variables etc. Before the Check_References
-- call, we transfer Never_Set_In_Source and Referenced flags from
-- parameters in the spec to the corresponding entities in the body,
-- since we want the warnings on the body entities. Note that we do
-- not have to transfer Referenced_As_LHS, since that flag can only
-- be set for simple variables.
-- At the same time, we set the flags on the spec entities to suppress
-- any warnings on the spec formals, since we also scan the spec.
-- Finally, we propagate the Entry_Component attribute to the body
-- formals, for use in the renaming declarations created later for the
-- formals (see exp_ch9.Add_Formal_Renamings).
declare
E1 : Entity_Id;
E2 : Entity_Id;
begin
E1 := First_Entity (Entry_Name);
while Present (E1) loop
E2 := First_Entity (Id);
while Present (E2) loop
exit when Chars (E1) = Chars (E2);
Next_Entity (E2);
end loop;
-- If no matching body entity, then we already had a detected
-- error of some kind, so just forget about worrying about these
-- warnings.
if No (E2) then
goto Continue;
end if;
if Ekind (E1) = E_Out_Parameter then
Set_Never_Set_In_Source (E2, Never_Set_In_Source (E1));
Set_Never_Set_In_Source (E1, False);
end if;
Set_Referenced (E2, Referenced (E1));
Set_Referenced (E1);
Set_Entry_Component (E2, Entry_Component (E1));
<<Continue>>
Next_Entity (E1);
end loop;
Check_References (Id);
end;
-- We still need to check references for the spec, since objects
-- declared in the body are chained (in the First_Entity sense) to
-- the spec rather than the body in the case of entries.
Check_References (Entry_Name);
-- Process the end label, and terminate the scope
Process_End_Label (Handled_Statement_Sequence (N), 't', Entry_Name);
End_Scope;
-- If this is an entry family, remove the loop created to provide
-- a scope for the entry index.
if Ekind (Id) = E_Entry_Family
and then Present (Entry_Index_Specification (Formals))
then
End_Scope;
end if;
end Analyze_Entry_Body;
------------------------------------
-- Analyze_Entry_Body_Formal_Part --
------------------------------------
procedure Analyze_Entry_Body_Formal_Part (N : Node_Id) is
Id : constant Entity_Id := Defining_Identifier (Parent (N));
Index : constant Node_Id := Entry_Index_Specification (N);
Formals : constant List_Id := Parameter_Specifications (N);
begin
Tasking_Used := True;
if Present (Index) then
Analyze (Index);
end if;
if Present (Formals) then
Set_Scope (Id, Current_Scope);
New_Scope (Id);
Process_Formals (Formals, Parent (N));
End_Scope;
end if;
end Analyze_Entry_Body_Formal_Part;
------------------------------------
-- Analyze_Entry_Call_Alternative --
------------------------------------
procedure Analyze_Entry_Call_Alternative (N : Node_Id) is
Call : constant Node_Id := Entry_Call_Statement (N);
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Nkind (Call) = N_Attribute_Reference then
-- Possibly a stream attribute, but definitely illegal. Other
-- illegalitles, such as procedure calls, are diagnosed after
-- resolution.
Error_Msg_N ("entry call alternative requires an entry call", Call);
return;
end if;
Analyze (Call);
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Entry_Call_Alternative;
-------------------------------
-- Analyze_Entry_Declaration --
-------------------------------
procedure Analyze_Entry_Declaration (N : Node_Id) is
Formals : constant List_Id := Parameter_Specifications (N);
Id : constant Entity_Id := Defining_Identifier (N);
D_Sdef : constant Node_Id := Discrete_Subtype_Definition (N);
begin
Generate_Definition (Id);
Tasking_Used := True;
if No (D_Sdef) then
Set_Ekind (Id, E_Entry);
else
Enter_Name (Id);
Set_Ekind (Id, E_Entry_Family);
Analyze (D_Sdef);
Make_Index (D_Sdef, N, Id);
end if;
Set_Etype (Id, Standard_Void_Type);
Set_Convention (Id, Convention_Entry);
Set_Accept_Address (Id, New_Elmt_List);
if Present (Formals) then
Set_Scope (Id, Current_Scope);
New_Scope (Id);
Process_Formals (Formals, N);
Create_Extra_Formals (Id);
End_Scope;
end if;
if Ekind (Id) = E_Entry then
New_Overloaded_Entity (Id);
end if;
end Analyze_Entry_Declaration;
---------------------------------------
-- Analyze_Entry_Index_Specification --
---------------------------------------
-- The Defining_Identifier of the entry index specification is local to the
-- entry body, but it must be available in the entry barrier which is
-- evaluated outside of the entry body. The index is eventually renamed as
-- a run-time object, so is visibility is strictly a front-end concern. In
-- order to make it available to the barrier, we create an additional
-- scope, as for a loop, whose only declaration is the index name. This
-- loop is not attached to the tree and does not appear as an entity local
-- to the protected type, so its existence need only be knwown to routines
-- that process entry families.
procedure Analyze_Entry_Index_Specification (N : Node_Id) is
Iden : constant Node_Id := Defining_Identifier (N);
Def : constant Node_Id := Discrete_Subtype_Definition (N);
Loop_Id : constant Entity_Id :=
Make_Defining_Identifier (Sloc (N),
Chars => New_Internal_Name ('L'));
begin
Tasking_Used := True;
Analyze (Def);
-- There is no elaboration of the entry index specification. Therefore,
-- if the index is a range, it is not resolved and expanded, but the
-- bounds are inherited from the entry declaration, and reanalyzed.
-- See Analyze_Entry_Body.
if Nkind (Def) /= N_Range then
Make_Index (Def, N);
end if;
Set_Ekind (Loop_Id, E_Loop);
Set_Scope (Loop_Id, Current_Scope);
New_Scope (Loop_Id);
Enter_Name (Iden);
Set_Ekind (Iden, E_Entry_Index_Parameter);
Set_Etype (Iden, Etype (Def));
end Analyze_Entry_Index_Specification;
----------------------------
-- Analyze_Protected_Body --
----------------------------
procedure Analyze_Protected_Body (N : Node_Id) is
Body_Id : constant Entity_Id := Defining_Identifier (N);
Last_E : Entity_Id;
Spec_Id : Entity_Id;
-- This is initially the entity of the protected object or protected
-- type involved, but is replaced by the protected type always in the
-- case of a single protected declaration, since this is the proper
-- scope to be used.
Ref_Id : Entity_Id;
-- This is the entity of the protected object or protected type
-- involved, and is the entity used for cross-reference purposes
-- (it differs from Spec_Id in the case of a single protected
-- object, since Spec_Id is set to the protected type in this case).
begin
Tasking_Used := True;
Set_Ekind (Body_Id, E_Protected_Body);
Spec_Id := Find_Concurrent_Spec (Body_Id);
if Present (Spec_Id)
and then Ekind (Spec_Id) = E_Protected_Type
then
null;
elsif Present (Spec_Id)
and then Ekind (Etype (Spec_Id)) = E_Protected_Type
and then not Comes_From_Source (Etype (Spec_Id))
then
null;
else
Error_Msg_N ("missing specification for protected body", Body_Id);
return;
end if;
Ref_Id := Spec_Id;
Generate_Reference (Ref_Id, Body_Id, 'b', Set_Ref => False);
Style.Check_Identifier (Body_Id, Spec_Id);
-- The declarations are always attached to the type
if Ekind (Spec_Id) /= E_Protected_Type then
Spec_Id := Etype (Spec_Id);
end if;
New_Scope (Spec_Id);
Set_Corresponding_Spec (N, Spec_Id);
Set_Corresponding_Body (Parent (Spec_Id), Body_Id);
Set_Has_Completion (Spec_Id);
Install_Declarations (Spec_Id);
Exp_Ch9.Expand_Protected_Body_Declarations (N, Spec_Id);
Last_E := Last_Entity (Spec_Id);
Analyze_Declarations (Declarations (N));
-- For visibility purposes, all entities in the body are private. Set
-- First_Private_Entity accordingly, if there was no private part in the
-- protected declaration.
if No (First_Private_Entity (Spec_Id)) then
if Present (Last_E) then
Set_First_Private_Entity (Spec_Id, Next_Entity (Last_E));
else
Set_First_Private_Entity (Spec_Id, First_Entity (Spec_Id));
end if;
end if;
Check_Completion (Body_Id);
Check_References (Spec_Id);
Process_End_Label (N, 't', Ref_Id);
End_Scope;
end Analyze_Protected_Body;
----------------------------------
-- Analyze_Protected_Definition --
----------------------------------
procedure Analyze_Protected_Definition (N : Node_Id) is
E : Entity_Id;
L : Entity_Id;
begin
Tasking_Used := True;
Analyze_Declarations (Visible_Declarations (N));
if Present (Private_Declarations (N))
and then not Is_Empty_List (Private_Declarations (N))
then
L := Last_Entity (Current_Scope);
Analyze_Declarations (Private_Declarations (N));
if Present (L) then
Set_First_Private_Entity (Current_Scope, Next_Entity (L));
else
Set_First_Private_Entity (Current_Scope,
First_Entity (Current_Scope));
end if;
end if;
E := First_Entity (Current_Scope);
while Present (E) loop
if Ekind (E) = E_Function
or else Ekind (E) = E_Procedure
then
Set_Convention (E, Convention_Protected);
elsif Is_Task_Type (Etype (E))
or else Has_Task (Etype (E))
then
Set_Has_Task (Current_Scope);
end if;
Next_Entity (E);
end loop;
Check_Max_Entries (N, Max_Protected_Entries);
Process_End_Label (N, 'e', Current_Scope);
Check_Overriding_Indicator (N);
end Analyze_Protected_Definition;
----------------------------
-- Analyze_Protected_Type --
----------------------------
procedure Analyze_Protected_Type (N : Node_Id) is
E : Entity_Id;
T : Entity_Id;
Def_Id : constant Entity_Id := Defining_Identifier (N);
Iface : Node_Id;
Iface_Def : Node_Id;
Iface_Typ : Entity_Id;
begin
if No_Run_Time_Mode then
Error_Msg_CRT ("protected type", N);
return;
end if;
Tasking_Used := True;
Check_Restriction (No_Protected_Types, N);
T := Find_Type_Name (N);
if Ekind (T) = E_Incomplete_Type then
T := Full_View (T);
Set_Completion_Referenced (T);
end if;
Set_Ekind (T, E_Protected_Type);
Set_Is_First_Subtype (T, True);
Init_Size_Align (T);
Set_Etype (T, T);
Set_Has_Delayed_Freeze (T, True);
Set_Stored_Constraint (T, No_Elist);
New_Scope (T);
-- Ada 2005 (AI-345)
if Present (Interface_List (N)) then
Set_Is_Tagged_Type (T);
Iface := First (Interface_List (N));
while Present (Iface) loop
Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
Iface_Def := Type_Definition (Parent (Iface_Typ));
if not Is_Interface (Iface_Typ) then
Error_Msg_NE ("(Ada 2005) & must be an interface",
Iface, Iface_Typ);
else
-- Ada 2005 (AI-251): "The declaration of a specific descendant
-- of an interface type freezes the interface type" RM 13.14.
Freeze_Before (N, Etype (Iface));
-- Ada 2005 (AI-345): Protected types can only implement
-- limited, synchronized or protected interfaces.
if Limited_Present (Iface_Def)
or else Synchronized_Present (Iface_Def)
or else Protected_Present (Iface_Def)
then
null;
elsif Task_Present (Iface_Def) then
Error_Msg_N ("(Ada 2005) protected type cannot implement a "
& "task interface", Iface);
else
Error_Msg_N ("(Ada 2005) protected type cannot implement a "
& "non-limited interface", Iface);
end if;
end if;
Next (Iface);
end loop;
-- If this is the full-declaration associated with a private
-- declaration that implement interfaces, then the private type
-- declaration must be limited.
if Has_Private_Declaration (T) then
declare
E : Entity_Id;
begin
E := First_Entity (Scope (T));
loop
pragma Assert (Present (E));
if Is_Type (E) and then Present (Full_View (E)) then
exit when Full_View (E) = T;
end if;
Next_Entity (E);
end loop;
if not Is_Limited_Record (E) then
Error_Msg_Sloc := Sloc (E);
Error_Msg_N
("(Ada 2005) private type declaration # must be limited",
T);
end if;
end;
end if;
end if;
if Present (Discriminant_Specifications (N)) then
if Has_Discriminants (T) then
-- Install discriminants. Also, verify conformance of
-- discriminants of previous and current view. ???
Install_Declarations (T);
else
Process_Discriminants (N);
end if;
end if;
Set_Is_Constrained (T, not Has_Discriminants (T));
Analyze (Protected_Definition (N));
-- Protected types with entries are controlled (because of the
-- Protection component if nothing else), same for any protected type
-- with interrupt handlers. Note that we need to analyze the protected
-- definition to set Has_Entries and such.
if (Abort_Allowed or else Restriction_Active (No_Entry_Queue) = False
or else Number_Entries (T) > 1)
and then
(Has_Entries (T)
or else Has_Interrupt_Handler (T)
or else Has_Attach_Handler (T))
then
Set_Has_Controlled_Component (T, True);
end if;
-- The Ekind of components is E_Void during analysis to detect illegal
-- uses. Now it can be set correctly.
E := First_Entity (Current_Scope);
while Present (E) loop
if Ekind (E) = E_Void then
Set_Ekind (E, E_Component);
Init_Component_Location (E);
end if;
Next_Entity (E);
end loop;
End_Scope;
if T /= Def_Id
and then Is_Private_Type (Def_Id)
and then Has_Discriminants (Def_Id)
and then Expander_Active
then
Exp_Ch9.Expand_N_Protected_Type_Declaration (N);
Process_Full_View (N, T, Def_Id);
end if;
end Analyze_Protected_Type;
---------------------
-- Analyze_Requeue --
---------------------
procedure Analyze_Requeue (N : Node_Id) is
Count : Natural := 0;
Entry_Name : Node_Id := Name (N);
Entry_Id : Entity_Id;
I : Interp_Index;
It : Interp;
Enclosing : Entity_Id;
Target_Obj : Node_Id := Empty;
Req_Scope : Entity_Id;
Outer_Ent : Entity_Id;
begin
Check_Restriction (No_Requeue_Statements, N);
Check_Unreachable_Code (N);
Tasking_Used := True;
Enclosing := Empty;
for J in reverse 0 .. Scope_Stack.Last loop
Enclosing := Scope_Stack.Table (J).Entity;
exit when Is_Entry (Enclosing);
if Ekind (Enclosing) /= E_Block
and then Ekind (Enclosing) /= E_Loop
then
Error_Msg_N ("requeue must appear within accept or entry body", N);
return;
end if;
end loop;
Analyze (Entry_Name);
if Etype (Entry_Name) = Any_Type then
return;
end if;
if Nkind (Entry_Name) = N_Selected_Component then
Target_Obj := Prefix (Entry_Name);
Entry_Name := Selector_Name (Entry_Name);
end if;
-- If an explicit target object is given then we have to check the
-- restrictions of 9.5.4(6).
if Present (Target_Obj) then
-- Locate containing concurrent unit and determine enclosing entry
-- body or outermost enclosing accept statement within the unit.
Outer_Ent := Empty;
for S in reverse 0 .. Scope_Stack.Last loop
Req_Scope := Scope_Stack.Table (S).Entity;
exit when Ekind (Req_Scope) in Task_Kind
or else Ekind (Req_Scope) in Protected_Kind;
if Is_Entry (Req_Scope) then
Outer_Ent := Req_Scope;
end if;
end loop;
pragma Assert (Present (Outer_Ent));
-- Check that the accessibility level of the target object is not
-- greater or equal to the outermost enclosing accept statement (or
-- entry body) unless it is a parameter of the innermost enclosing
-- accept statement (or entry body).
if Object_Access_Level (Target_Obj) >= Scope_Depth (Outer_Ent)
and then
(not Is_Entity_Name (Target_Obj)
or else Ekind (Entity (Target_Obj)) not in Formal_Kind
or else Enclosing /= Scope (Entity (Target_Obj)))
then
Error_Msg_N
("target object has invalid level for requeue", Target_Obj);
end if;
end if;
-- Overloaded case, find right interpretation
if Is_Overloaded (Entry_Name) then
Entry_Id := Empty;
Get_First_Interp (Entry_Name, I, It);
while Present (It.Nam) loop
if No (First_Formal (It.Nam))
or else Subtype_Conformant (Enclosing, It.Nam)
then
-- Ada 2005 (AI-345): Since protected and task types have
-- primitive entry wrappers, we only consider source entries.
if Comes_From_Source (It.Nam) then
Count := Count + 1;
Entry_Id := It.Nam;
else
Remove_Interp (I);
end if;
end if;
Get_Next_Interp (I, It);
end loop;
if Count = 0 then
Error_Msg_N ("no entry matches context", N);
return;
elsif Count > 1 then
Error_Msg_N ("ambiguous entry name in requeue", N);
return;
else
Set_Is_Overloaded (Entry_Name, False);
Set_Entity (Entry_Name, Entry_Id);
end if;
-- Non-overloaded cases
-- For the case of a reference to an element of an entry family, the
-- Entry_Name is an indexed component.
elsif Nkind (Entry_Name) = N_Indexed_Component then
-- Requeue to an entry out of the body
if Nkind (Prefix (Entry_Name)) = N_Selected_Component then
Entry_Id := Entity (Selector_Name (Prefix (Entry_Name)));
-- Requeue from within the body itself
elsif Nkind (Prefix (Entry_Name)) = N_Identifier then
Entry_Id := Entity (Prefix (Entry_Name));
else
Error_Msg_N ("invalid entry_name specified", N);
return;
end if;
-- If we had a requeue of the form REQUEUE A (B), then the parser
-- accepted it (because it could have been a requeue on an entry index.
-- If A turns out not to be an entry family, then the analysis of A (B)
-- turned it into a function call.
elsif Nkind (Entry_Name) = N_Function_Call then
Error_Msg_N
("arguments not allowed in requeue statement",
First (Parameter_Associations (Entry_Name)));
return;
-- Normal case of no entry family, no argument
else
Entry_Id := Entity (Entry_Name);
end if;
-- Resolve entry, and check that it is subtype conformant with the
-- enclosing construct if this construct has formals (RM 9.5.4(5)).
if not Is_Entry (Entry_Id) then
Error_Msg_N ("expect entry name in requeue statement", Name (N));
elsif Ekind (Entry_Id) = E_Entry_Family
and then Nkind (Entry_Name) /= N_Indexed_Component
then
Error_Msg_N ("missing index for entry family component", Name (N));
else
Resolve_Entry (Name (N));
Generate_Reference (Entry_Id, Entry_Name);
if Present (First_Formal (Entry_Id)) then
Check_Subtype_Conformant (Enclosing, Entry_Id, Name (N));
-- Processing for parameters accessed by the requeue
declare
Ent : Entity_Id;
begin
Ent := First_Formal (Enclosing);
while Present (Ent) loop
-- For OUT or IN OUT parameter, the effect of the requeue is
-- to assign the parameter a value on exit from the requeued
-- body, so we can set it as source assigned. We also clear
-- the Is_True_Constant indication. We do not need to clear
-- Current_Value, since the effect of the requeue is to
-- perform an unconditional goto so that any further
-- references will not occur anyway.
if Ekind (Ent) = E_Out_Parameter
or else
Ekind (Ent) = E_In_Out_Parameter
then
Set_Never_Set_In_Source (Ent, False);
Set_Is_True_Constant (Ent, False);
end if;
-- For all parameters, the requeue acts as a reference,
-- since the value of the parameter is passed to the new
-- entry, so we want to suppress unreferenced warnings.
Set_Referenced (Ent);
Next_Formal (Ent);
end loop;
end;
end if;
end if;
end Analyze_Requeue;
------------------------------
-- Analyze_Selective_Accept --
------------------------------
procedure Analyze_Selective_Accept (N : Node_Id) is
Alts : constant List_Id := Select_Alternatives (N);
Alt : Node_Id;
Accept_Present : Boolean := False;
Terminate_Present : Boolean := False;
Delay_Present : Boolean := False;
Relative_Present : Boolean := False;
Alt_Count : Uint := Uint_0;
begin
Check_Restriction (No_Select_Statements, N);
Tasking_Used := True;
-- Loop to analyze alternatives
Alt := First (Alts);
while Present (Alt) loop
Alt_Count := Alt_Count + 1;
Analyze (Alt);
if Nkind (Alt) = N_Delay_Alternative then
if Delay_Present then
if Relative_Present /=
(Nkind (Delay_Statement (Alt)) = N_Delay_Relative_Statement)
then
Error_Msg_N
("delay_until and delay_relative alternatives ", Alt);
Error_Msg_N
("\cannot appear in the same selective_wait", Alt);
end if;
else
Delay_Present := True;
Relative_Present :=
Nkind (Delay_Statement (Alt)) = N_Delay_Relative_Statement;
end if;
elsif Nkind (Alt) = N_Terminate_Alternative then
if Terminate_Present then
Error_Msg_N ("only one terminate alternative allowed", N);
else
Terminate_Present := True;
Check_Restriction (No_Terminate_Alternatives, N);
end if;
elsif Nkind (Alt) = N_Accept_Alternative then
Accept_Present := True;
-- Check for duplicate accept
declare
Alt1 : Node_Id;
Stm : constant Node_Id := Accept_Statement (Alt);
EDN : constant Node_Id := Entry_Direct_Name (Stm);
Ent : Entity_Id;
begin
if Nkind (EDN) = N_Identifier
and then No (Condition (Alt))
and then Present (Entity (EDN)) -- defend against junk
and then Ekind (Entity (EDN)) = E_Entry
then
Ent := Entity (EDN);
Alt1 := First (Alts);
while Alt1 /= Alt loop
if Nkind (Alt1) = N_Accept_Alternative
and then No (Condition (Alt1))
then
declare
Stm1 : constant Node_Id := Accept_Statement (Alt1);
EDN1 : constant Node_Id := Entry_Direct_Name (Stm1);
begin
if Nkind (EDN1) = N_Identifier then
if Entity (EDN1) = Ent then
Error_Msg_Sloc := Sloc (Stm1);
Error_Msg_N
("?accept duplicates one on line#", Stm);
exit;
end if;
end if;
end;
end if;
Next (Alt1);
end loop;
end if;
end;
end if;
Next (Alt);
end loop;
Check_Restriction (Max_Select_Alternatives, N, Alt_Count);
Check_Potentially_Blocking_Operation (N);
if Terminate_Present and Delay_Present then
Error_Msg_N ("at most one of terminate or delay alternative", N);
elsif not Accept_Present then
Error_Msg_N
("select must contain at least one accept alternative", N);
end if;
if Present (Else_Statements (N)) then
if Terminate_Present or Delay_Present then
Error_Msg_N ("else part not allowed with other alternatives", N);
end if;
Analyze_Statements (Else_Statements (N));
end if;
end Analyze_Selective_Accept;
------------------------------
-- Analyze_Single_Protected --
------------------------------
procedure Analyze_Single_Protected (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Id : constant Node_Id := Defining_Identifier (N);
T : Entity_Id;
T_Decl : Node_Id;
O_Decl : Node_Id;
O_Name : constant Entity_Id := New_Copy (Id);
begin
Generate_Definition (Id);
Tasking_Used := True;
-- The node is rewritten as a protected type declaration, in exact
-- analogy with what is done with single tasks.
T :=
Make_Defining_Identifier (Sloc (Id),
New_External_Name (Chars (Id), 'T'));
T_Decl :=
Make_Protected_Type_Declaration (Loc,
Defining_Identifier => T,
Protected_Definition => Relocate_Node (Protected_Definition (N)),
Interface_List => Interface_List (N));
O_Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => O_Name,
Object_Definition => Make_Identifier (Loc, Chars (T)));
Rewrite (N, T_Decl);
Insert_After (N, O_Decl);
Mark_Rewrite_Insertion (O_Decl);
-- Enter names of type and object before analysis, because the name of
-- the object may be used in its own body.
Enter_Name (T);
Set_Ekind (T, E_Protected_Type);
Set_Etype (T, T);
Enter_Name (O_Name);
Set_Ekind (O_Name, E_Variable);
Set_Etype (O_Name, T);
-- Instead of calling Analyze on the new node, call the proper analysis
-- procedure directly. Otherwise the node would be expanded twice, with
-- disastrous result.
Analyze_Protected_Type (N);
end Analyze_Single_Protected;
-------------------------
-- Analyze_Single_Task --
-------------------------
procedure Analyze_Single_Task (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Id : constant Node_Id := Defining_Identifier (N);
T : Entity_Id;
T_Decl : Node_Id;
O_Decl : Node_Id;
O_Name : constant Entity_Id := New_Copy (Id);
begin
Generate_Definition (Id);
Tasking_Used := True;
-- The node is rewritten as a task type declaration, followed by an
-- object declaration of that anonymous task type.
T :=
Make_Defining_Identifier (Sloc (Id),
New_External_Name (Chars (Id), Suffix => "TK"));
T_Decl :=
Make_Task_Type_Declaration (Loc,
Defining_Identifier => T,
Task_Definition => Relocate_Node (Task_Definition (N)),
Interface_List => Interface_List (N));
O_Decl :=
Make_Object_Declaration (Loc,
Defining_Identifier => O_Name,
Object_Definition => Make_Identifier (Loc, Chars (T)));
Rewrite (N, T_Decl);
Insert_After (N, O_Decl);
Mark_Rewrite_Insertion (O_Decl);
-- Enter names of type and object before analysis, because the name of
-- the object may be used in its own body.
Enter_Name (T);
Set_Ekind (T, E_Task_Type);
Set_Etype (T, T);
Enter_Name (O_Name);
Set_Ekind (O_Name, E_Variable);
Set_Etype (O_Name, T);
-- Instead of calling Analyze on the new node, call the proper analysis
-- procedure directly. Otherwise the node would be expanded twice, with
-- disastrous result.
Analyze_Task_Type (N);
end Analyze_Single_Task;
-----------------------
-- Analyze_Task_Body --
-----------------------
procedure Analyze_Task_Body (N : Node_Id) is
Body_Id : constant Entity_Id := Defining_Identifier (N);
Last_E : Entity_Id;
Spec_Id : Entity_Id;
-- This is initially the entity of the task or task type involved, but
-- is replaced by the task type always in the case of a single task
-- declaration, since this is the proper scope to be used.
Ref_Id : Entity_Id;
-- This is the entity of the task or task type, and is the entity used
-- for cross-reference purposes (it differs from Spec_Id in the case of
-- a single task, since Spec_Id is set to the task type)
begin
Tasking_Used := True;
Set_Ekind (Body_Id, E_Task_Body);
Set_Scope (Body_Id, Current_Scope);
Spec_Id := Find_Concurrent_Spec (Body_Id);
-- The spec is either a task type declaration, or a single task
-- declaration for which we have created an anonymous type.
if Present (Spec_Id)
and then Ekind (Spec_Id) = E_Task_Type
then
null;
elsif Present (Spec_Id)
and then Ekind (Etype (Spec_Id)) = E_Task_Type
and then not Comes_From_Source (Etype (Spec_Id))
then
null;
else
Error_Msg_N ("missing specification for task body", Body_Id);
return;
end if;
if Has_Completion (Spec_Id)
and then Present (Corresponding_Body (Parent (Spec_Id)))
then
if Nkind (Parent (Spec_Id)) = N_Task_Type_Declaration then
Error_Msg_NE ("duplicate body for task type&", N, Spec_Id);
else
Error_Msg_NE ("duplicate body for task&", N, Spec_Id);
end if;
end if;
Ref_Id := Spec_Id;
Generate_Reference (Ref_Id, Body_Id, 'b', Set_Ref => False);
Style.Check_Identifier (Body_Id, Spec_Id);
-- Deal with case of body of single task (anonymous type was created)
if Ekind (Spec_Id) = E_Variable then
Spec_Id := Etype (Spec_Id);
end if;
New_Scope (Spec_Id);
Set_Corresponding_Spec (N, Spec_Id);
Set_Corresponding_Body (Parent (Spec_Id), Body_Id);
Set_Has_Completion (Spec_Id);
Install_Declarations (Spec_Id);
Last_E := Last_Entity (Spec_Id);
Analyze_Declarations (Declarations (N));
-- For visibility purposes, all entities in the body are private. Set
-- First_Private_Entity accordingly, if there was no private part in the
-- protected declaration.
if No (First_Private_Entity (Spec_Id)) then
if Present (Last_E) then
Set_First_Private_Entity (Spec_Id, Next_Entity (Last_E));
else
Set_First_Private_Entity (Spec_Id, First_Entity (Spec_Id));
end if;
end if;
Analyze (Handled_Statement_Sequence (N));
Check_Completion (Body_Id);
Check_References (Body_Id);
Check_References (Spec_Id);
-- Check for entries with no corresponding accept
declare
Ent : Entity_Id;
begin
Ent := First_Entity (Spec_Id);
while Present (Ent) loop
if Is_Entry (Ent)
and then not Entry_Accepted (Ent)
and then Comes_From_Source (Ent)
then
Error_Msg_NE ("no accept for entry &?", N, Ent);
end if;
Next_Entity (Ent);
end loop;
end;
Process_End_Label (Handled_Statement_Sequence (N), 't', Ref_Id);
End_Scope;
end Analyze_Task_Body;
-----------------------------
-- Analyze_Task_Definition --
-----------------------------
procedure Analyze_Task_Definition (N : Node_Id) is
L : Entity_Id;
begin
Tasking_Used := True;
if Present (Visible_Declarations (N)) then
Analyze_Declarations (Visible_Declarations (N));
end if;
if Present (Private_Declarations (N)) then
L := Last_Entity (Current_Scope);
Analyze_Declarations (Private_Declarations (N));
if Present (L) then
Set_First_Private_Entity
(Current_Scope, Next_Entity (L));
else
Set_First_Private_Entity
(Current_Scope, First_Entity (Current_Scope));
end if;
end if;
Check_Max_Entries (N, Max_Task_Entries);
Process_End_Label (N, 'e', Current_Scope);
Check_Overriding_Indicator (N);
end Analyze_Task_Definition;
-----------------------
-- Analyze_Task_Type --
-----------------------
procedure Analyze_Task_Type (N : Node_Id) is
T : Entity_Id;
Def_Id : constant Entity_Id := Defining_Identifier (N);
Iface : Node_Id;
Iface_Def : Node_Id;
Iface_Typ : Entity_Id;
begin
Check_Restriction (No_Tasking, N);
Tasking_Used := True;
T := Find_Type_Name (N);
Generate_Definition (T);
if Ekind (T) = E_Incomplete_Type then
T := Full_View (T);
Set_Completion_Referenced (T);
end if;
Set_Ekind (T, E_Task_Type);
Set_Is_First_Subtype (T, True);
Set_Has_Task (T, True);
Init_Size_Align (T);
Set_Etype (T, T);
Set_Has_Delayed_Freeze (T, True);
Set_Stored_Constraint (T, No_Elist);
New_Scope (T);
-- Ada 2005 (AI-345)
if Present (Interface_List (N)) then
Set_Is_Tagged_Type (T);
Iface := First (Interface_List (N));
while Present (Iface) loop
Iface_Typ := Find_Type_Of_Subtype_Indic (Iface);
Iface_Def := Type_Definition (Parent (Iface_Typ));
if not Is_Interface (Iface_Typ) then
Error_Msg_NE ("(Ada 2005) & must be an interface",
Iface, Iface_Typ);
else
-- Ada 2005 (AI-251): The declaration of a specific descendant
-- of an interface type freezes the interface type (RM 13.14).
Freeze_Before (N, Etype (Iface));
-- Ada 2005 (AI-345): Task types can only implement limited,
-- synchronized or task interfaces.
if Limited_Present (Iface_Def)
or else Synchronized_Present (Iface_Def)
or else Task_Present (Iface_Def)
then
null;
elsif Protected_Present (Iface_Def) then
Error_Msg_N ("(Ada 2005) task type cannot implement a " &
"protected interface", Iface);
else
Error_Msg_N ("(Ada 2005) task type cannot implement a " &
"non-limited interface", Iface);
end if;
end if;
Next (Iface);
end loop;
-- If this is the full-declaration associated with a private
-- declaration that implement interfaces, then the private
-- type declaration must be limited.
if Has_Private_Declaration (T) then
declare
E : Entity_Id;
begin
E := First_Entity (Scope (T));
loop
pragma Assert (Present (E));
if Is_Type (E) and then Present (Full_View (E)) then
exit when Full_View (E) = T;
end if;
Next_Entity (E);
end loop;
if not Is_Limited_Record (E) then
Error_Msg_Sloc := Sloc (E);
Error_Msg_N
("(Ada 2005) private type declaration # must be limited",
T);
end if;
end;
end if;
end if;
if Present (Discriminant_Specifications (N)) then
if Ada_Version = Ada_83 and then Comes_From_Source (N) then
Error_Msg_N ("(Ada 83) task discriminant not allowed!", N);
end if;
if Has_Discriminants (T) then
-- Install discriminants. Also, verify conformance of
-- discriminants of previous and current view. ???
Install_Declarations (T);
else
Process_Discriminants (N);
end if;
end if;
Set_Is_Constrained (T, not Has_Discriminants (T));
if Present (Task_Definition (N)) then
Analyze_Task_Definition (Task_Definition (N));
end if;
if not Is_Library_Level_Entity (T) then
Check_Restriction (No_Task_Hierarchy, N);
end if;
End_Scope;
if T /= Def_Id
and then Is_Private_Type (Def_Id)
and then Has_Discriminants (Def_Id)
and then Expander_Active
then
Exp_Ch9.Expand_N_Task_Type_Declaration (N);
Process_Full_View (N, T, Def_Id);
end if;
end Analyze_Task_Type;
-----------------------------------
-- Analyze_Terminate_Alternative --
-----------------------------------
procedure Analyze_Terminate_Alternative (N : Node_Id) is
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
if Present (Condition (N)) then
Analyze_And_Resolve (Condition (N), Any_Boolean);
end if;
end Analyze_Terminate_Alternative;
------------------------------
-- Analyze_Timed_Entry_Call --
------------------------------
procedure Analyze_Timed_Entry_Call (N : Node_Id) is
begin
Check_Restriction (No_Select_Statements, N);
Tasking_Used := True;
Analyze (Entry_Call_Alternative (N));
Analyze (Delay_Alternative (N));
end Analyze_Timed_Entry_Call;
------------------------------------
-- Analyze_Triggering_Alternative --
------------------------------------
procedure Analyze_Triggering_Alternative (N : Node_Id) is
Trigger : constant Node_Id := Triggering_Statement (N);
begin
Tasking_Used := True;
if Present (Pragmas_Before (N)) then
Analyze_List (Pragmas_Before (N));
end if;
Analyze (Trigger);
if Comes_From_Source (Trigger)
and then Nkind (Trigger) not in N_Delay_Statement
and then Nkind (Trigger) /= N_Entry_Call_Statement
then
if Ada_Version < Ada_05 then
Error_Msg_N
("triggering statement must be delay or entry call", Trigger);
-- Ada 2005 (AI-345): If a procedure_call_statement is used for a
-- procedure_or_entry_call, the procedure_name or pro- cedure_prefix
-- of the procedure_call_statement shall denote an entry renamed by a
-- procedure, or (a view of) a primitive subprogram of a limited
-- interface whose first parameter is a controlling parameter.
elsif Nkind (Trigger) = N_Procedure_Call_Statement
and then not Is_Renamed_Entry (Entity (Name (Trigger)))
and then not Is_Controlling_Limited_Procedure
(Entity (Name (Trigger)))
then
Error_Msg_N ("triggering statement must be delay, procedure " &
"or entry call", Trigger);
end if;
end if;
if Is_Non_Empty_List (Statements (N)) then
Analyze_Statements (Statements (N));
end if;
end Analyze_Triggering_Alternative;
-----------------------
-- Check_Max_Entries --
-----------------------
procedure Check_Max_Entries (D : Node_Id; R : All_Parameter_Restrictions) is
Ecount : Uint;
procedure Count (L : List_Id);
-- Count entries in given declaration list
-----------
-- Count --
-----------
procedure Count (L : List_Id) is
D : Node_Id;
begin
if No (L) then
return;
end if;
D := First (L);
while Present (D) loop
if Nkind (D) = N_Entry_Declaration then
declare
DSD : constant Node_Id :=
Discrete_Subtype_Definition (D);
begin
-- If not an entry family, then just one entry
if No (DSD) then
Ecount := Ecount + 1;
-- If entry family with static bounds, count entries
elsif Is_OK_Static_Subtype (Etype (DSD)) then
declare
Lo : constant Uint :=
Expr_Value
(Type_Low_Bound (Etype (DSD)));
Hi : constant Uint :=
Expr_Value
(Type_High_Bound (Etype (DSD)));
begin
if Hi >= Lo then
Ecount := Ecount + Hi - Lo + 1;
end if;
end;
-- Entry family with non-static bounds
else
-- If restriction is set, then this is an error
if Restrictions.Set (R) then
Error_Msg_N
("static subtype required by Restriction pragma",
DSD);
-- Otherwise we record an unknown count restriction
else
Check_Restriction (R, D);
end if;
end if;
end;
end if;
Next (D);
end loop;
end Count;
-- Start of processing for Check_Max_Entries
begin
Ecount := Uint_0;
Count (Visible_Declarations (D));
Count (Private_Declarations (D));
if Ecount > 0 then
Check_Restriction (R, D, Ecount);
end if;
end Check_Max_Entries;
--------------------------------
-- Check_Overriding_Indicator --
--------------------------------
procedure Check_Overriding_Indicator (Def : Node_Id) is
Aliased_Hom : Entity_Id;
Decl : Node_Id;
Def_Id : Entity_Id;
Hom : Entity_Id;
Ifaces : constant List_Id := Interface_List (Parent (Def));
Overrides : Boolean;
Spec : Node_Id;
Vis_Decls : constant List_Id := Visible_Declarations (Def);
function Matches_Prefixed_View_Profile
(Ifaces : List_Id;
Entry_Params : List_Id;
Proc_Params : List_Id) return Boolean;
-- Ada 2005 (AI-397): Determine if an entry parameter profile matches
-- the prefixed view profile of an abstract procedure. Also determine
-- whether the abstract procedure belongs to an implemented interface.
-----------------------------------
-- Matches_Prefixed_View_Profile --
-----------------------------------
function Matches_Prefixed_View_Profile
(Ifaces : List_Id;
Entry_Params : List_Id;
Proc_Params : List_Id) return Boolean
is
Entry_Param : Node_Id;
Proc_Param : Node_Id;
Proc_Param_Typ : Entity_Id;
function Includes_Interface
(Iface : Entity_Id;
Ifaces : List_Id) return Boolean;
-- Determine if an interface is contained in a list of interfaces
------------------------
-- Includes_Interface --
------------------------
function Includes_Interface
(Iface : Entity_Id;
Ifaces : List_Id) return Boolean
is
Ent : Entity_Id;
begin
Ent := First (Ifaces);
while Present (Ent) loop
if Etype (Ent) = Iface then
return True;
end if;
Next (Ent);
end loop;
return False;
end Includes_Interface;
-- Start of processing for Matches_Prefixed_View_Profile
begin
Proc_Param := First (Proc_Params);
Proc_Param_Typ := Etype (Parameter_Type (Proc_Param));
-- The first parameter of the abstract procedure must be of an
-- interface type. The task or protected type must also implement
-- that interface.
if not Is_Interface (Proc_Param_Typ)
or else not Includes_Interface (Proc_Param_Typ, Ifaces)
then
return False;
end if;
Entry_Param := First (Entry_Params);
Proc_Param := Next (Proc_Param);
while Present (Entry_Param) and then Present (Proc_Param) loop
-- The two parameters must be mode conformant and have the exact
-- same types.
if Ekind (Defining_Identifier (Entry_Param)) /=
Ekind (Defining_Identifier (Proc_Param))
or else Etype (Parameter_Type (Entry_Param)) /=
Etype (Parameter_Type (Proc_Param))
then
return False;
end if;
Next (Entry_Param);
Next (Proc_Param);
end loop;
-- One of the lists is longer than the other
if Present (Entry_Param) or else Present (Proc_Param) then
return False;
end if;
return True;
end Matches_Prefixed_View_Profile;
-- Start of processing for Check_Overriding_Indicator
begin
if Present (Ifaces) then
Decl := First (Vis_Decls);
while Present (Decl) loop
-- Consider entries with either "overriding" or "not overriding"
-- indicator present.
if Nkind (Decl) = N_Entry_Declaration
and then (Must_Override (Decl)
or else
Must_Not_Override (Decl))
then
Def_Id := Defining_Identifier (Decl);
Overrides := False;
Hom := Homonym (Def_Id);
while Present (Hom) loop
-- The current entry may override a procedure from an
-- implemented interface.
if Ekind (Hom) = E_Procedure
and then (Is_Abstract (Hom)
or else
Null_Present (Parent (Hom)))
then
Aliased_Hom := Hom;
while Present (Alias (Aliased_Hom)) loop
Aliased_Hom := Alias (Aliased_Hom);
end loop;
if Matches_Prefixed_View_Profile (Ifaces,
Parameter_Specifications (Decl),
Parameter_Specifications (Parent (Aliased_Hom)))
then
Overrides := True;
exit;
end if;
end if;
Hom := Homonym (Hom);
end loop;
if Overrides then
if Must_Not_Override (Decl) then
Error_Msg_NE ("entry& is overriding", Def_Id, Def_Id);
end if;
else
if Must_Override (Decl) then
Error_Msg_NE ("entry& is not overriding", Def_Id, Def_Id);
end if;
end if;
-- Consider subprograms with either "overriding" or "not
-- overriding" indicator present.
elsif Nkind (Decl) = N_Subprogram_Declaration
and then (Must_Override (Specification (Decl))
or else
Must_Not_Override (Specification (Decl)))
then
Spec := Specification (Decl);
Def_Id := Defining_Unit_Name (Spec);
Overrides := False;
Hom := Homonym (Def_Id);
while Present (Hom) loop
-- Function
if Ekind (Def_Id) = E_Function
and then Ekind (Hom) = E_Function
and then Is_Abstract (Hom)
and then Matches_Prefixed_View_Profile (Ifaces,
Parameter_Specifications (Spec),
Parameter_Specifications (Parent (Hom)))
and then Etype (Result_Definition (Spec)) =
Etype (Result_Definition (Parent (Hom)))
then
Overrides := True;
exit;
-- Procedure
elsif Ekind (Def_Id) = E_Procedure
and then Ekind (Hom) = E_Procedure
and then (Is_Abstract (Hom)
or else
Null_Present (Parent (Hom)))
and then Matches_Prefixed_View_Profile (Ifaces,
Parameter_Specifications (Spec),
Parameter_Specifications (Parent (Hom)))
then
Overrides := True;
exit;
end if;
Hom := Homonym (Hom);
end loop;
if Overrides then
if Must_Not_Override (Spec) then
Error_Msg_NE
("subprogram& is overriding", Def_Id, Def_Id);
end if;
else
if Must_Override (Spec) then
Error_Msg_NE
("subprogram& is not overriding", Def_Id, Def_Id);
end if;
end if;
end if;
Next (Decl);
end loop;
-- The protected or task type is not implementing an interface, we need
-- to check for the presence of "overriding" entries or subprograms and
-- flag them as erroneous.
else
Decl := First (Vis_Decls);
while Present (Decl) loop
if Nkind (Decl) = N_Entry_Declaration
and then Must_Override (Decl)
then
Def_Id := Defining_Identifier (Decl);
Error_Msg_NE ("entry& is not overriding", Def_Id, Def_Id);
elsif Nkind (Decl) = N_Subprogram_Declaration
and then Must_Override (Specification (Decl))
then
Def_Id := Defining_Identifier (Specification (Decl));
Error_Msg_NE ("subprogram& is not overriding", Def_Id, Def_Id);
end if;
Next (Decl);
end loop;
end if;
end Check_Overriding_Indicator;
--------------------------
-- Find_Concurrent_Spec --
--------------------------
function Find_Concurrent_Spec (Body_Id : Entity_Id) return Entity_Id is
Spec_Id : Entity_Id := Current_Entity_In_Scope (Body_Id);
begin
-- The type may have been given by an incomplete type declaration.
-- Find full view now.
if Present (Spec_Id) and then Ekind (Spec_Id) = E_Incomplete_Type then
Spec_Id := Full_View (Spec_Id);
end if;
return Spec_Id;
end Find_Concurrent_Spec;
--------------------------
-- Install_Declarations --
--------------------------
procedure Install_Declarations (Spec : Entity_Id) is
E : Entity_Id;
Prev : Entity_Id;
begin
E := First_Entity (Spec);
while Present (E) loop
Prev := Current_Entity (E);
Set_Current_Entity (E);
Set_Is_Immediately_Visible (E);
Set_Homonym (E, Prev);
Next_Entity (E);
end loop;
end Install_Declarations;
end Sem_Ch9;
|
-- Copyright 2019-2020 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
procedure Do_Nothing (A : System.Address);
end Pck;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . V E C T O R S . B O O L E A N _ O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2002-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 System.Vectors.Boolean_Operations is
SU : constant := Storage_Unit;
-- Convenient short hand, used throughout
-- The coding of this unit depends on the fact that the Component_Size
-- of a normally declared array of Boolean is equal to Storage_Unit. We
-- can't use the Component_Size directly since it is non-static. The
-- following declaration checks that this declaration is correct
type Boolean_Array is array (Integer range <>) of Boolean;
pragma Compile_Time_Error
(Boolean_Array'Component_Size /= SU, "run time compile failure");
-- NOTE: The boolean literals must be qualified here to avoid visibility
-- anomalies when this package is compiled through Rtsfind, in a context
-- that includes a user-defined type derived from boolean.
True_Val : constant Vector := Standard.True'Enum_Rep
+ Standard.True'Enum_Rep * 2**SU
+ Standard.True'Enum_Rep * 2**(SU * 2)
+ Standard.True'Enum_Rep * 2**(SU * 3)
+ Standard.True'Enum_Rep * 2**(SU * 4)
+ Standard.True'Enum_Rep * 2**(SU * 5)
+ Standard.True'Enum_Rep * 2**(SU * 6)
+ Standard.True'Enum_Rep * 2**(SU * 7);
-- This constant represents the bits to be flipped to perform a logical
-- "not" on a vector of booleans, independent of the actual
-- representation of True.
-- The representations of (False, True) are assumed to be zero/one and
-- the maximum number of unpacked booleans per Vector is assumed to be 8.
pragma Assert (Standard.False'Enum_Rep = 0);
pragma Assert (Standard.True'Enum_Rep = 1);
pragma Assert (Vector'Size / Storage_Unit <= 8);
-- The reason we need to do these gymnastics is that no call to
-- Unchecked_Conversion can be made at the library level since this
-- unit is pure. Also a conversion from the array type to the Vector type
-- inside the body of "not" is inefficient because of alignment issues.
-----------
-- "not" --
-----------
function "not" (Item : Vectors.Vector) return Vectors.Vector is
begin
return Item xor True_Val;
end "not";
----------
-- Nand --
----------
function Nand (Left, Right : Boolean) return Boolean is
begin
return not (Left and Right);
end Nand;
function Nand (Left, Right : Vectors.Vector) return Vectors.Vector is
begin
return not (Left and Right);
end Nand;
---------
-- Nor --
---------
function Nor (Left, Right : Boolean) return Boolean is
begin
return not (Left or Right);
end Nor;
function Nor (Left, Right : Vectors.Vector) return Vectors.Vector is
begin
return not (Left or Right);
end Nor;
----------
-- Nxor --
----------
function Nxor (Left, Right : Boolean) return Boolean is
begin
return not (Left xor Right);
end Nxor;
function Nxor (Left, Right : Vectors.Vector) return Vectors.Vector is
begin
return not (Left xor Right);
end Nxor;
end System.Vectors.Boolean_Operations;
|
-- -----------------------------------------------------------------------------
-- smk, the smart make (http://lionel.draghi.free.fr/smk/)
-- © 2018, 2019 Lionel Draghi <lionel.draghi@free.fr>
-- SPDX-License-Identifier: APSL-2.0
-- -----------------------------------------------------------------------------
-- 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 Smk.IO;
with Ada.Characters.Latin_1;
with Ada.Directories;
with Ada.Strings.Fixed;
with Ada.Strings.Maps.Constants;
with Ada.Text_IO; use Ada.Text_IO;
with Smk.Settings; use Smk.Settings;
-- -----------------------------------------------------------------------------
package body Smk.Smkfiles is
Debug : constant Boolean := False;
Prefix : constant String := "";
-- --------------------------------------------------------------------------
function "+" (Name : Smk_File_Name) return String is
(Files."+" (Files.File_Name (Name)));
function "+" (Name : String) return Smk_File_Name is
(Smk_File_Name (Files."+" (Name)));
use Ada.Strings;
use Ada.Strings.Fixed;
Current_Section : Section_Names := Default_Section;
use Ada.Strings.Maps;
use Ada.Strings.Maps.Constants;
Whitespace_Set : constant Ada.Strings.Maps.Character_Set
:= Ada.Strings.Maps.To_Set
(Ada.Characters.Latin_1.HT & Ada.Characters.Latin_1.Space & '@');
Identifier_Set : constant Ada.Strings.Maps.Character_Set
:= Alphanumeric_Set or To_Set (".-_");
-- --------------------------------------------------------------------------
function Is_Empty (Line : in String) return Boolean is
(Index_Non_Blank (Line) = 0);
-- --------------------------------------------------------------------------
function Is_A_Comment (Line : in String) return Boolean is
begin
return
Head (Line, Count => 1) = "#" or else -- Shell style comment
Head (Line, Count => 2) = "--" or else -- Ada style comment
Head (Line, Count => 2) = "//"; -- Java style comment
end Is_A_Comment;
-- --------------------------------------------------------------------------
function Is_A_Section (Line : in String) return Boolean is
-- A section line starts with an identifier immediatly followed by
-- a semicolon, e.g. "mrproper:"
-- Warning: this function updates the global Current_Section variable
First : Positive;
Last : Natural;
begin
Find_Token (Source => Line,
Set => Identifier_Set,
Test => Inside,
First => First,
Last => Last);
if Last = 0 then
-- The line don't start with an identifier, can't be a section
return False;
elsif Last = Line'Last then
-- There is only an identifier on this line
return False;
else
if Line (Last + 1) = ':' then
Current_Section := +(Line (First .. Last));
return True;
else
return False;
end if;
end if;
end Is_A_Section;
-- --------------------------------------------------------------------------
function Load_Smkfile return Smkfile
is
Make_Fl : Ada.Text_IO.File_Type;
Entry_List : Smkfile_Entry_Lists.List;
In_A_Multiline : Boolean := False;
Multiline : Command_Lines := Null_Command_Line;
Line_List : Smkfile;
begin
Open (Make_Fl, In_File, Smkfile_Name);
Analysis : while not End_Of_File (Make_Fl) loop
declare
-- Line = Get_Line, but heading blanks or tabs character are removed
-- If there is not heading blank, First_Non_Blank will be null,
-- and Line will start at 1.
Line : constant String := Trim (Get_Line (Make_Fl),
Left => Whitespace_Set,
Right => Whitespace_Set);
Line_Nb : constant Integer := Integer (Ada.Text_IO.Line (Make_Fl));
begin
if Is_A_Comment (Line) then
IO.Put_Debug_Line (Line & "<",
Debug => Debug,
Prefix => Prefix & "Comment >",
File => Smkfile_Name,
Line => Line_Nb);
elsif Is_Empty (Line) then
IO.Put_Debug_Line (Line & "<",
Debug => Debug,
Prefix => Prefix & "Empty line >",
File => Smkfile_Name,
Line => Line_Nb);
elsif Is_A_Section (Line) then
IO.Put_Debug_Line (+Current_Section & "<",
Debug => Debug,
Prefix => Prefix & "Section >",
File => Smkfile_Name,
Line => Line_Nb);
else
-- Last but not least, it's a command line.
if Line (Line'Last) = '\' then
-- first or continuation line of the multiline
declare
Last_Non_Blank_Before_Backslash : constant Natural
:= Index (Source => Line (Line'First .. Line'Last - 1),
Set => Whitespace_Set,
Test => Outside,
Going => Backward);
begin
-- we replace all all blanks and tab befor '\' with
-- a single blank
Multiline := Multiline
& Line (Line'First .. Last_Non_Blank_Before_Backslash)
& " ";
In_A_Multiline := True;
IO.Put_Debug_Line
((+Multiline) & "<",
Debug => Debug,
Prefix => Prefix & "First or continuation >",
File => Smkfile_Name,
Line => Line_Nb);
end;
else
if In_A_Multiline then
-- last line of the multiline
Multiline := Multiline & Line;
Entry_List.Append ((Line => Line_Nb - 1, -- why -1 ???
Section => Current_Section,
Command => Multiline,
Was_Run => False));
IO.Put_Debug_Line (+Multiline & "<",
Debug => Debug,
Prefix => Prefix & "Last line >",
File => Smkfile_Name,
Line => Line_Nb);
Multiline := Null_Command_Line;
In_A_Multiline := False;
else
-- single line command
Entry_List.Append ((Line => Line_Nb - 1, -- why -1 ???
Section => Current_Section,
Command => +(Line),
Was_Run => False));
IO.Put_Debug_Line (Line & "<",
Debug => Debug,
Prefix => Prefix & "Single line >",
File => Smkfile_Name,
Line => Line_Nb);
end if;
end if;
end if;
end;
end loop Analysis;
if In_A_Multiline then
IO.Put_Error (Smkfile_Name
& " ends with incomplete multine, last command ignored");
end if;
Close (Make_Fl);
declare
use Ada.Directories;
begin
Line_List := (Name => +Smkfile_Name,
Time_Tag => Modification_Time (Smkfile_Name),
Entries => Entry_List);
end;
return Line_List;
end Load_Smkfile;
-- --------------------------------------------------------------------------
procedure Dump is
The_Smkfile : constant Smkfile := Load_Smkfile;
Time_Tag : constant String := IO.Image (The_Smkfile.Time_Tag);
begin
IO.Put_Line (+The_Smkfile.Name & " (" & Time_Tag & ") :");
for E of The_Smkfile.Entries loop
IO.Put_Line (Trim (Positive'Image (E.Line), Left)
& ": [" & (+E.Section) & "] " & (+E.Command));
end loop;
end Dump;
-- --------------------------------------------------------------------------
function Contains (The_Smkfile : in Smkfile;
The_Command : in Command_Lines)
return Boolean is
(for some E of The_Smkfile.Entries => E.Command = The_Command);
-- --------------------------------------------------------------------------
procedure Add_To_Smkfile (Cmd_Line : String) is
Smk_File : Ada.Text_IO.File_Type;
The_Smkfile : Smkfiles.Smkfile;
begin
if Ada.Directories.Exists (Smkfile_Name) then
The_Smkfile := Smkfiles.Load_Smkfile;
Open (Smk_File, Mode => Append_File, Name => Smkfile_Name);
else
Create (Smk_File, Mode => Append_File, Name => Smkfile_Name);
end if;
if not Smkfiles.Contains (The_Smkfile, +Cmd_Line) then
Put_Line (Smk_File, Cmd_Line);
end if;
Close (Smk_File);
end Add_To_Smkfile;
end Smk.Smkfiles;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with OpenMV;
with OpenMV.LCD_Shield;
with OpenMV.Sensor;
with Last_Chance_Handler;
pragma Unreferenced (Last_Chance_Handler);
procedure Main is
begin
OpenMV.Initialize_LEDs;
OpenMV.Set_RGB_LED (OpenMV.Off);
OpenMV.LCD_Shield.Initialize;
OpenMV.Sensor.Initialize;
loop
-- Take a snapshot...
OpenMV.Sensor.Snapshot (OpenMV.LCD_Shield.Bitmap);
-- ...and display it.
OpenMV.LCD_Shield.Display;
end loop;
end Main;
|
-----------------------------------------------------------------------
-- awa-workspaces-tests -- Unit tests for workspaces and invitations
-- Copyright (C) 2017 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Tests;
with ADO;
with AWA.Tests;
package AWA.Workspaces.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new AWA.Tests.Test with record
Member_Id : ADO.Identifier;
Key : Ada.Strings.Unbounded.Unbounded_String;
end record;
-- Verify the anonymous access for the invitation page.
procedure Verify_Anonymous (T : in out Test;
Key : in String);
-- Test sending an invitation.
procedure Test_Invite_User (T : in out Test);
-- Test deleting the member.
procedure Test_Delete_Member (T : in out Test);
-- Test accepting the invitation.
procedure Test_Accept_Invitation (T : in out Test);
-- Test listing the members of the workspace.
procedure Test_List_Members (T : in out Test);
end AWA.Workspaces.Tests;
|
-- Copyright 2014-2020 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;
with Pck; use Pck;
procedure Foo is
type Array2_First is array (24 .. 26) of Integer;
type Array2_Second is array (1 .. 2) of Array2_First;
A2 : Array2_Second := ((10, 11, 12), (13, 14, 15));
begin
Do_Nothing (A2'Address); -- START
end Foo;
|
-- CD5014K.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT AN ADDRESS CLAUSE CAN BE GIVEN IN THE PRIVATE PART
-- OF A GENERIC PACKAGE SPECIFICATION FOR A VARIABLE OF A RECORD
-- TYPE, WHERE THE VARIABLE IS DECLARED IN THE VISIBLE PART OF THE
-- SPECIFICATION.
-- HISTORY:
-- CDJ 07/24/87 CREATED ORIGINAL TEST.
-- BCB 10/01/87 CHANGED TEST TO STANDARD FORMAT.
-- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'.
-- MCH 04/03/90 ADDED INSTANTIATION.
WITH SYSTEM; USE SYSTEM;
WITH SPPRT13; USE SPPRT13;
WITH REPORT; USE REPORT;
PROCEDURE CD5014K IS
BEGIN
TEST ("CD5014K", " AN ADDRESS CLAUSE CAN BE GIVEN " &
"IN THE PRIVATE PART OF A GENERIC PACKAGE " &
"SPECIFICATION FOR A VARIABLE OF A RECORD " &
"TYPE, WHERE THE VARIABLE IS DECLARED IN THE " &
"VISIBLE PART OF THE SPECIFICATION");
DECLARE
GENERIC
PACKAGE PKG IS
TYPE REC_TYPE IS RECORD
VAL : INTEGER;
END RECORD;
REC_OBJ1 : REC_TYPE := (VAL => 10);
PRIVATE
FOR REC_OBJ1 USE AT VARIABLE_ADDRESS;
END PKG;
PACKAGE BODY PKG IS
BEGIN
IF EQUAL(3,3) THEN
REC_OBJ1.VAL := 100;
END IF;
IF REC_OBJ1.VAL /= 100 THEN
FAILED ("INCORRECT VALUE FOR RECORD VARIABLE COMPONENT");
END IF;
IF REC_OBJ1'ADDRESS /= VARIABLE_ADDRESS THEN
FAILED ("INCORRECT ADDRESS FOR RECORD VARIABLE");
END IF;
END PKG;
PACKAGE INSTANTIATE IS NEW PKG;
BEGIN
NULL;
END;
RESULT;
END CD5014K;
|
-- This spec has been automatically generated from cm0.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package Cortex_M_SVD is
pragma Preelaborate;
--------------------
-- Base addresses --
--------------------
NVIC_Base : constant System.Address :=
System'To_Address (16#E000E100#);
SCB_Base : constant System.Address :=
System'To_Address (16#E000ED00#);
SysTick_Base : constant System.Address :=
System'To_Address (16#E000E010#);
Debug_Base : constant System.Address :=
System'To_Address (16#E000ED00#);
DWT_Base : constant System.Address :=
System'To_Address (16#E0001000#);
end Cortex_M_SVD;
|
-- { dg-do compile }
with Ada.Finalization;
with Controlled1_Pkg; use Controlled1_Pkg;
package Controlled1 is
type Collection is new Ada.Finalization.Controlled with null record;
type Object_Kind_Type is (One, Two);
type Byte_Array is array (Natural range <>) of Integer;
type Bounded_Byte_Array_Type is record
A : Byte_Array (1 .. Value);
end record;
type Object_Type is tagged record
A : Bounded_Byte_Array_Type;
end record;
type R_Object_Type is new Object_Type with record
L : Collection;
end record;
type Obj_Type (Kind : Object_Kind_Type := One) is record
case Kind is
when One => R : R_Object_Type;
when others => null;
end case;
end record;
type Obj_Array_Type is array (Positive range <>) of Obj_Type;
end Controlled1;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
-- Purpose:
-- Create and declare implicit declaration
with Asis.Gela.Classes;
with Asis.Gela.Visibility;
package Asis.Gela.Implicit is
procedure Process_Unit (Unit : Asis.Compilation_Unit);
-- Recognize predefined units and mark implementation defined
-- expressions as implicit, collect some type declarations.
procedure Make_Operations
(Decl : in Asis.Declaration;
Point : in out Visibility.Point);
-- Create implicit operations for type declaration and declare them
-- in declaration region pointed by Point.
procedure Make_Operations
(Tipe : in Classes.Type_Info;
Was : in Classes.Type_Info;
Point : in out Visibility.Point);
-- Create implicit operations when type change it's properties and
-- declare them in declaration region pointed by Point.
procedure Make_Not_Equal_Operator
(Equal : Asis.Declaration;
Point : in out Visibility.Point);
-- Create implicit "/=" operation for given "=" and declare it
-- in declaration region pointed by Point.
end Asis.Gela.Implicit;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
|
--
-- This library is free software; you can redistribute it and/or modify
-- it under the terms of the GNU Library General Public License as
-- published by the Free Software Foundation; either version 3 of the
-- License; or (at your option) any later version.
package body Unbounded_Sequential_Queues is
------------
-- Insert --
------------
procedure Insert (Into : in out Queue; Item : in Element) is
Ptr : Link;
begin
Ptr := new Node'(Data => Item, Next => null);
if Into.Count = 0 then -- initial case
Into.Rear := Ptr;
Into.Front := Into.Rear;
Into.Count := 1;
else -- nodes already in list
Into.Rear.Next := Ptr;
Into.Rear := Ptr;
Into.Count := Into.Count + 1;
end if;
exception
when Storage_Error =>
raise Overflow;
end Insert;
------------
-- Remove --
------------
procedure Remove (From : in out Queue; Item : out Element) is
begin
if From.Count > 0 then -- have data items to Remove
Item := From.Front.Data;
From.Front := From.Front.Next;
From.Count := From.Count - 1;
else -- user didn't check
raise Underflow;
end if;
end Remove;
-----------
-- Empty --
-----------
function Empty (Q : Queue) return Boolean is
begin
return Q.Count = 0;
end Empty;
----------
-- Size --
----------
function Size (Q : Queue) return Natural is
begin
return Q.Count;
end Size;
---------------
-- Iteration --
---------------
procedure Iteration (Over : in Queue) is
Ptr : Link := Over.Front;
Enabled : Boolean := True;
begin
while Ptr /= null and Enabled loop
Process (Ptr.Data, Enabled);
Ptr := Ptr.Next;
end loop;
end Iteration;
end Unbounded_Sequential_Queues;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_BOUNDED_KEYS --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
-- Tree_Type is used to implement ordered containers. This package declares
-- the tree operations that depend on keys.
with Ada.Containers.Red_Black_Trees.Generic_Bounded_Operations;
generic
with package Tree_Operations is new Generic_Bounded_Operations (<>);
use Tree_Operations.Tree_Types, Tree_Operations.Tree_Types.Implementation;
type Key_Type (<>) is limited private;
with function Is_Less_Key_Node
(L : Key_Type;
R : Node_Type) return Boolean;
with function Is_Greater_Key_Node
(L : Key_Type;
R : Node_Type) return Boolean;
package Ada.Containers.Red_Black_Trees.Generic_Bounded_Keys is
pragma Pure;
generic
with function New_Node return Count_Type;
procedure Generic_Insert_Post
(Tree : in out Tree_Type'Class;
Y : Count_Type;
Before : Boolean;
Z : out Count_Type);
-- Completes an insertion after the insertion position has been
-- determined. On output Z contains the index of the newly inserted
-- node, allocated using Allocate. If Tree is busy then
-- Program_Error is raised. If Y is 0, then Tree must be empty.
-- Otherwise Y denotes the insertion position, and Before specifies
-- whether the new node is Y's left (True) or right (False) child.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
procedure Generic_Conditional_Insert
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type;
Inserted : out Boolean);
-- Inserts a new node in Tree, but only if the tree does not already
-- contain Key. Generic_Conditional_Insert first searches for a key
-- equivalent to Key in Tree. If an equivalent key is found, then on
-- output Node designates the node with that key and Inserted is
-- False; there is no allocation and Tree is not modified. Otherwise
-- Node designates a new node allocated using Insert_Post, and
-- Inserted is True.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
procedure Generic_Unconditional_Insert
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type);
-- Inserts a new node in Tree. On output Node designates the new
-- node, which is allocated using Insert_Post. The node is inserted
-- immediately after already-existing equivalent keys.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
with procedure Unconditional_Insert_Sans_Hint
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type);
procedure Generic_Unconditional_Insert_With_Hint
(Tree : in out Tree_Type'Class;
Hint : Count_Type;
Key : Key_Type;
Node : out Count_Type);
-- Inserts a new node in Tree near position Hint, to avoid having to
-- search from the root for the insertion position. If Hint is 0
-- then Generic_Unconditional_Insert_With_Hint attempts to insert
-- the new node after Tree.Last. If Hint is non-zero then if Key is
-- less than Hint, it attempts to insert the new node immediately
-- prior to Hint. Otherwise it attempts to insert the node
-- immediately following Hint. We say "attempts" above to emphasize
-- that insertions always preserve invariants with respect to key
-- order, even when there's a hint. So if Key can't be inserted
-- immediately near Hint, then the new node is inserted in the
-- normal way, by searching for the correct position starting from
-- the root.
generic
with procedure Insert_Post
(T : in out Tree_Type'Class;
Y : Count_Type;
B : Boolean;
Z : out Count_Type);
with procedure Conditional_Insert_Sans_Hint
(Tree : in out Tree_Type'Class;
Key : Key_Type;
Node : out Count_Type;
Inserted : out Boolean);
procedure Generic_Conditional_Insert_With_Hint
(Tree : in out Tree_Type'Class;
Position : Count_Type; -- the hint
Key : Key_Type;
Node : out Count_Type;
Inserted : out Boolean);
-- Inserts a new node in Tree if the tree does not already contain
-- Key, using Position as a hint about where to insert the new node.
-- See Generic_Unconditional_Insert_With_Hint for more details about
-- hint semantics.
function Find
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the smallest node equivalent to Key
function Ceiling
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the smallest node equal to or greater than Key
function Floor
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the largest node less than or equal to Key
function Upper_Bound
(Tree : Tree_Type'Class;
Key : Key_Type) return Count_Type;
-- Searches Tree for the smallest node greater than Key
generic
with procedure Process (Index : Count_Type);
procedure Generic_Iteration
(Tree : Tree_Type'Class;
Key : Key_Type);
-- Calls Process for each node in Tree equivalent to Key, in order
-- from earliest in range to latest.
generic
with procedure Process (Index : Count_Type);
procedure Generic_Reverse_Iteration
(Tree : Tree_Type'Class;
Key : Key_Type);
-- Calls Process for each node in Tree equivalent to Key, but in
-- order from largest in range to earliest.
end Ada.Containers.Red_Black_Trees.Generic_Bounded_Keys;
|
--
-- Copyright 2018 The wookey project team <wookey@ssi.gouv.fr>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- 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 system;
package soc.pwr
with spark_mode => off
is
-------------------------------------------
-- PWR power control register (PWR_CR) --
-- STM32F405xx/07xx and STM32F415xx/17xx --
-------------------------------------------
type t_vos is (VOS_SCALE2, VOS_SCALE1) with size => 1;
for t_vos use
(VOS_SCALE2 => 0,
VOS_SCALE1 => 1);
type t_PWR_CR is record
LPDS : bit;
PDDS : bit;
CWUF : bit;
CSBF : bit;
PVDE : bit;
PLS : bits_3;
DBP : bit;
FPDS : bit;
reserved_10_13 : bits_4;
VOS : t_vos;
reserved_15_31 : bits_17;
end record
with volatile_full_access, size => 32;
for t_PWR_CR use record
LPDS at 0 range 0 .. 0;
PDDS at 0 range 1 .. 1;
CWUF at 0 range 2 .. 2;
CSBF at 0 range 3 .. 3;
PVDE at 0 range 4 .. 4;
PLS at 0 range 5 .. 7;
DBP at 0 range 8 .. 8;
FPDS at 0 range 9 .. 9;
reserved_10_13 at 0 range 10 .. 13;
VOS at 0 range 14 .. 14;
reserved_15_31 at 0 range 15 .. 31;
end record;
--------------------
-- PWR peripheral --
--------------------
type t_PWR_peripheral is record
CR : t_PWR_CR;
end record
with volatile;
for t_PWR_peripheral use record
CR at 16#00# range 0 .. 31;
end record;
PWR : t_PWR_peripheral
with
import,
volatile,
address => system'to_address(16#4000_7000#);
end soc.pwr;
|
------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Forms.Field_Types.IPV4_Address --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 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: Juergen Pfeifer <Juergen.Pfeifer@T-Online.de> 1996
-- Version Control:
-- $Revision: 1.3 $
-- Binding Version 00.93
------------------------------------------------------------------------------
with Interfaces.C;
with Terminal_Interface.Curses.Aux; use Terminal_Interface.Curses.Aux;
package body Terminal_Interface.Curses.Forms.Field_Types.IPV4_Address is
use type Interfaces.C.Int;
procedure Set_Field_Type (Fld : in Field;
Typ : in Internet_V4_Address_Field)
is
C_IPV4_Field_Type : C_Field_Type;
pragma Import (C, C_IPV4_Field_Type, "TYPE_IPV4");
function Set_Fld_Type (F : Field := Fld;
Cft : C_Field_Type := C_IPV4_Field_Type)
return C_Int;
pragma Import (C, Set_Fld_Type, "set_field_type");
Res : Eti_Error;
begin
Res := Set_Fld_Type;
if Res /= E_Ok then
Eti_Exception (Res);
end if;
Wrap_Builtin (Fld, Typ);
end Set_Field_Type;
end Terminal_Interface.Curses.Forms.Field_Types.IPV4_Address;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A U N I T . T I M E _ M E A S U R E --
-- --
-- B o d y --
-- --
-- --
-- Copyright (C) 2006-2014, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT is maintained by AdaCore (http://www.adacore.com) --
-- --
------------------------------------------------------------------------------
package body AUnit.Time_Measure is
-------------------
-- Start_Measure --
-------------------
procedure Start_Measure (T : in out Time) is
begin
T.Start := Ada.Calendar.Clock;
end Start_Measure;
------------------
-- Stop_Measure --
------------------
procedure Stop_Measure (T : in out Time) is
begin
T.Stop := Ada.Calendar.Clock;
end Stop_Measure;
-----------------
-- Get_Measure --
-----------------
function Get_Measure (T : Time) return AUnit_Duration is
use type Ada.Calendar.Time;
begin
return AUnit_Duration (T.Stop - T.Start);
end Get_Measure;
---------------------
-- Gen_Put_Measure --
---------------------
procedure Gen_Put_Measure (Measure : AUnit_Duration) is
H, M, S : Integer := 0;
T : Duration := Duration (Measure);
Force : Boolean;
procedure Put (N : Integer; Length : Integer);
-- Put N using at least Length digits.
procedure Put (N : Integer; Length : Integer) is
begin
for Dig in reverse 1 .. Length - 1 loop
if N < 10**Dig then
Put ("0");
else
exit;
end if;
end loop;
Put (N);
end Put;
begin
-- Calculate the number of hours, minutes and seconds
while T >= 3600.0 loop
H := H + 1;
T := T - 3600.0;
end loop;
while T >= 60.0 loop
M := M + 1;
T := T - 60.0;
end loop;
while T >= 1.0 loop
S := S + 1;
T := T - 1.0;
end loop;
-- Now display the result
Force := False;
if H > 0 then
Put (H);
Put ("h");
Force := True;
end if;
if M > 0 or else Force then
if not Force then
Put (M);
else
-- In case some output is already done, then we force a 2 digits
-- output so that the output is normalized.
Put (M, 2);
end if;
Put ("min. ");
Force := True;
end if;
if not Force then
Put (S);
else
Put (S, 2);
end if;
Put (".");
Put (Integer (T * 1_000_000.0), 6);
Put (" sec.");
end Gen_Put_Measure;
--------------------------------
-- Gen_Put_Measure_In_Seconds --
--------------------------------
procedure Gen_Put_Measure_In_Seconds (Measure : AUnit_Duration) is
S : Integer := 0;
T : Duration := Duration (Measure);
procedure Put (N : Integer; Length : Integer);
-- Put N using at least Length digits.
procedure Put (N : Integer; Length : Integer) is
begin
for Dig in reverse 1 .. Length - 1 loop
if N < 10**Dig then
Put ("0");
else
exit;
end if;
end loop;
Put (N);
end Put;
begin
while T >= 1.0 loop
S := S + 1;
T := T - 1.0;
end loop;
Put (S);
Put (".");
Put (Integer (T * 1_000_000.0), 9);
Put ("s");
end Gen_Put_Measure_In_Seconds;
end AUnit.Time_Measure;
|
-- part of ParserTools, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
with Ada.Containers;
with Ada.Strings.UTF_Encoding;
with Ada.Strings.Unbounded;
with System.Storage_Elements;
package Text is
-- this package defines a reference-counted string pointer type. it is used
-- for all YAML data entities and relieves the user from the need to
-- manually dispose events created by the parser.
--
-- typically, YAML content strings are deallocated in the same order as they
-- are allocated. this knowledge is built into a storage pool for efficient
-- memory usage and to avoid fragmentation.
--
-- to be able to efficiently interface with C, this package allocates its
-- strings so that they can directly be passed on to C without the need to
-- copy any data. Use the subroutines Export and Delete_Exported to get
-- C-compatible string values from a Reference. these subroutines also
-- take care of reference counting for values exposed to C. this means that
-- after exporting a value, you *must* eventually call Delete_Exported in
-- order for the value to be freed.
--
-- HINT: this package makes use of compiler implementation details and may
-- not work with other compilers. however, since there currently are no
-- Ada 2012 compilers but GNAT, this is not considered a problem.
-- the pool allocates the memory it uses on the heap. it is allowed for the
-- pool to vanish while References created on it are still around. the
-- heap memory is reclaimed when the pool itself and all References
-- created by it vanish.
--
-- this type has pointer semantics in order to allow the usage of the same
-- pool at different places without the need of access types. copying a
-- value of this type will make both values use the same memory. use Create
-- to generate a new independent pool.
-- all strings generated by Yaml are encoded in UTF-8, regardless of input
-- encoding.
subtype UTF_8_String is Ada.Strings.UTF_Encoding.UTF_8_String;
type UTF_8_String_Access is access UTF_8_String;
subtype Pool_Offset is System.Storage_Elements.Storage_Offset
range 0 .. System.Storage_Elements.Storage_Offset (Integer'Last);
-- this is a smart pointer. use Value to access its value.
subtype Reference is Ada.Strings.Unbounded.Unbounded_String;
-- shortcut for Object.Value.Data'Length
function Length (Object : Reference) return Natural renames Ada.Strings.Unbounded.Length;
function "&" (Left, Right : Reference) return String;
-- compares the string content of two Content values.
function "=" (Left, Right : Reference) return Boolean renames Ada.Strings.Unbounded."=";
function Hash (Object : Reference) return Ada.Containers.Hash_Type;
-- equivalent to the empty string. default value for References.
Empty : constant Reference;
-- this can be used for constant Reference values that are declared at
-- library level where no Pool is available. References pointing to a
-- Constant_Content_Holder are never freed.
subtype Constant_Instance is Reference;
-- note that there is a limit of 128 characters for Content values created
-- like this.
function Hold (Content : String) return Constant_Instance
renames Ada.Strings.Unbounded.To_Unbounded_String;
-- get a Reference value which is a reference to the string contained in the
-- Holder.
function Held (Holder : Constant_Instance) return Reference is (Holder);
private
-- this forces GNAT to store the First and Last dope values right before
-- the first element of the String. we use that to our advantage.
for UTF_8_String_Access'Size use Standard'Address_Size;
type Chunk_Index_Type is range 1 .. 10;
subtype Refcount_Type is Integer range 0 .. 2 ** 24 - 1;
-- the pool consists of multiple chunks of memory. strings are allocated
-- inside the chunks.
type Pool_Array is array (Pool_Offset range <>) of System.Storage_Elements.Storage_Element;
type Chunk is access Pool_Array;
type Chunk_Array is array (Chunk_Index_Type) of Chunk;
type Usage_Array is array (Chunk_Index_Type) of Natural;
-- the idea is that Cur is the pointer to the active Chunk. all new strings
-- are allocated in that active Chunk until there is no more space. then,
-- we allocate a new Chunk of twice the size of the current one and make
-- that the current Chunk. the old Chunk lives on until all Content strings
-- allocated on it vanish. Usage is the number of strings currently
-- allocated on the Chunk and is used as reference count. the current Chunk
-- has Usage + 1 which prevents its deallocation even if the last Content
-- string on it vanishes. the Content type's finalization takes care of
-- decrementing the Usage value that counts allocated strings, while the
-- String_Pool type's deallocation takes care of removing the +1 for the
-- current Chunk.
--
-- we treat each Chunk basically as a bitvector ring list, and Pos is the
-- current offset in the current Chunk. instead of having a full bitvector
-- for allocating, we use the dope values from the strings that stay in the
-- memory after deallocation. besides the First and Last values, we also
-- store a reference count in the dope. so when searching for a place to
-- allocate a new string, we can skip over regions that have a non-zero
-- reference count in their header, and those with a 0 reference count are
-- available space. compared to a real bitvector, we always have the
-- information of the length of an free region available. we can avoid
-- fragmentation by merging a region that is freed with the surrounding free
-- regions.
type Pool_Data is record
Refcount : Refcount_Type := 1;
Chunks : Chunk_Array;
Usage : Usage_Array := (1 => 1, others => 0);
Cur : Chunk_Index_Type := 1;
Pos : Pool_Offset;
end record;
type Pool_Data_Access is access Pool_Data;
for Pool_Data_Access'Size use Standard'Address_Size;
-- this is the dope vector of each string allocated in a Chunk. it is put
-- immediately before the string's value. note that the First and Last
-- elements are at the exact positions where GNAT searches for the string's
-- boundary dope. this allows us to access those values for maintaining the
-- ring list.
type Header is record
Pool : Pool_Data_Access;
Chunk_Index : Chunk_Index_Type;
Refcount : Refcount_Type := 1;
First, Last : Pool_Offset;
end record;
Chunk_Index_Start : constant := Standard'Address_Size;
Refcount_Start : constant := Standard'Address_Size + 8;
First_Start : constant := Standard'Address_Size + 32;
Last_Start : constant := First_Start + Integer'Size;
Header_End : constant := Last_Start + Integer'Size - 1;
for Header use record
Pool at 0 range 0 .. Chunk_Index_Start - 1;
Chunk_Index at 0 range Chunk_Index_Start .. Refcount_Start - 1;
Refcount at 0 range Refcount_Start .. First_Start - 1;
First at 0 range First_Start .. Last_Start - 1;
Last at 0 range Last_Start .. Header_End;
end record;
for Header'Size use Header_End + 1;
use type System.Storage_Elements.Storage_Offset;
Header_Size : constant Pool_Offset := Header'Size / System.Storage_Unit;
Chunk_Start_Index : constant := Chunk_Index_Start / System.Storage_Unit + 1;
Refcount_Start_Index : constant := Refcount_Start / System.Storage_Unit + 1;
First_Start_Index : constant := First_Start / System.Storage_Unit + 1;
Last_Start_Index : constant := Last_Start / System.Storage_Unit + 1;
End_Index : constant := (Header_End + 1) / System.Storage_Unit;
type Accessor (Data : not null access constant UTF_8_String) is limited
record
-- holds a copy of the smart pointer, so the string cannot be freed
-- while the accessor lives.
Hold : Reference;
end record;
Empty : constant Reference := Ada.Strings.Unbounded.Null_Unbounded_String;
-- it is important that all allocated strings are aligned to the header
-- length. else, it may happen that we generate a region of free memory that
-- is not large enough to hold a header – but we need to write the header
-- there to hold information for the ring list. therefore, whenever we
-- calculate offsets, we use this to round them up to a multiple of
-- Header_Size.
function Round_To_Header_Size (Length : Pool_Offset)
return Pool_Offset is
((Length + Header_Size - 1) / Header_Size * Header_Size);
end Text;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>call_Loop_LB2D_buf_p_1</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</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>in_stream_V_value_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>stream&lt;PackedStencil&lt;int, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>32</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>slice_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>buffer_0_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>168</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</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>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>168</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>buffer[0].value.V</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>row</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>row</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>tmp</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</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>57</item>
<item>59</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>row_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>row</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>60</item>
<item>62</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</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>63</item>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_s</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>187</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>187</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>79</item>
<item>80</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</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>81</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>col</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>col</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</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>71</item>
<item>73</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>col_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>74</item>
<item>75</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</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>76</item>
<item>77</item>
<item>78</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>col_cast</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_value_V_3</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>186</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>186</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>187</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>187</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>93</item>
<item>94</item>
<item>95</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>buffer_0_value_V_ad_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>198</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>198</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>98</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>p_Val2_s</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>198</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>198</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Val2__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>p_Result_s</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>206</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>__Result__</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>101</item>
<item>102</item>
<item>103</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>207</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>207</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>105</item>
<item>106</item>
<item>107</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>208</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>208</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>108</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>buffer_0_value_V_ad</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>209</second>
</item>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator=</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>82</item>
<item>84</item>
<item>85</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>operator=</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>209</second>
</item>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator=</second>
</first>
<second>75</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>86</item>
<item>87</item>
<item>221</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>179</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>88</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</fileDirectory>
<lineNumber>177</lineNumber>
<contextFuncName>call</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>177</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>66</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_28">
<Value>
<Obj>
<type>2</type>
<id>49</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>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>52</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>58</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1078</content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>61</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_32">
<Value>
<Obj>
<type>2</type>
<id>72</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1918</content>
</item>
<item class_id_reference="16" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>83</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>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_34">
<Obj>
<type>3</type>
<id>9</id>
<name>newFuncRoot</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>7</item>
<item>8</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_35">
<Obj>
<type>3</type>
<id>15</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>10</item>
<item>11</item>
<item>13</item>
<item>14</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_36">
<Obj>
<type>3</type>
<id>20</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_37">
<Obj>
<type>3</type>
<id>25</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>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_38">
<Obj>
<type>3</type>
<id>32</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>3</count>
<item_version>0</item_version>
<item>26</item>
<item>30</item>
<item>31</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_39">
<Obj>
<type>3</type>
<id>38</id>
<name>.preheader57</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>5</count>
<item_version>0</item_version>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_40">
<Obj>
<type>3</type>
<id>43</id>
<name>._crit_edge</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>3</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
<item>42</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_41">
<Obj>
<type>3</type>
<id>46</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>45</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_42">
<Obj>
<type>3</type>
<id>48</id>
<name>.preheader.exitStub</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>47</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>60</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_43">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>51</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>54</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>56</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>65</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>66</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>68</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>77</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>78</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>81</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>88</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>94</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>95</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>210</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>211</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>212</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>213</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>214</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>215</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>216</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>218</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>219</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>221</id>
<edge_type>4</edge_type>
<source_obj>34</source_obj>
<sink_obj>40</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_103">
<mId>1</mId>
<mTag>call_Loop_LB2D_buf_p.1</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>7</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>2071917</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_104">
<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>9</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_105">
<mId>3</mId>
<mTag>LB2D_buf</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>1078</mMinTripCount>
<mMaxTripCount>1078</mMaxTripCount>
<mMinLatency>2071916</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_106">
<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>2</count>
<item_version>0</item_version>
<item>15</item>
<item>20</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_107">
<mId>5</mId>
<mTag>LB2D_buf.1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>38</item>
<item>43</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>1918</mMinTripCount>
<mMaxTripCount>1918</mMaxTripCount>
<mMinLatency>1919</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_108">
<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>1</count>
<item_version>0</item_version>
<item>46</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_109">
<mId>7</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>48</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_110">
<states class_id="25" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_111">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_112">
<id>3</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_113">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_114">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_115">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_116">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_117">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_118">
<id>2</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_119">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_120">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_121">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_122">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_123">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_124">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_125">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_126">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_127">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_128">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_129">
<id>3</id>
<operations>
<count>8</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_130">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_131">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_132">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_133">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_134">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_135">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_136">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_137">
<id>34</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_138">
<id>4</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_139">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_140">
<id>34</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_141">
<id>5</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_142">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_143">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_144">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_145">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_146">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_147">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_148">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_149">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_150">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_151">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_152">
<id>6</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_153">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_154">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_155">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>31</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_156">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>33</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>11</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_157">
<inState>6</inState>
<outState>2</outState>
<condition>
<id>44</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_158">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>46</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_159">
<inState>5</inState>
<outState>3</outState>
<condition>
<id>47</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_160">
<inState>3</inState>
<outState>6</outState>
<condition>
<id>45</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_161">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>48</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>7</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>9</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>4</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>4</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="1" version="0" object_id="_162">
<region_name>LB2D_buf.1</region_name>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>38</item>
<item>43</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>15</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>77</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>83</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>34</item>
<item>34</item>
<item>40</item>
</second>
</item>
<item>
<first>88</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>150</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>155</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>buffer_0_value_V_ad_1_gep_fu_77</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>buffer_0_value_V_ad_gep_fu_88</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>buffer_0_value_V_alloca_fu_60</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>col_1_fu_144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>col_cast_fu_150</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>col_phi_fu_113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_Result_s_fu_155</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>row_1_fu_126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>row_phi_fu_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>tmp_1_fu_138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp_fu_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>tmp_s_fu_132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</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>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_37_write_fu_70</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>tmp_value_V_3_read_fu_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="50" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first class_id="52" tracking_level="0" version="0">
<first>buffer_0_value_V</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>34</item>
<item>34</item>
</second>
</item>
<item>
<first>
<first>buffer_0_value_V</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>11</count>
<item_version>0</item_version>
<item>
<first>98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>184</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>11</count>
<item_version>0</item_version>
<item>
<first>buffer_0_value_V_ad_1_reg_189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>col_1_reg_179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>col_cast_reg_184</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>col_reg_109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_Val2_s_reg_200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>row_1_reg_166</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>row_reg_98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>tmp_1_reg_175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp_reg_162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>tmp_s_reg_171</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_value_V_3_reg_194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>col_reg_109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>row_reg_98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="53" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>in_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</second>
</item>
<item>
<first>slice_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="55" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>2</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>1</count>
<item_version>0</item_version>
<item>
<first>7</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
|
with Ada.Execution_Time,
Ada.Integer_Text_IO,
Ada.Real_Time,
Ada.Strings.Fixed,
Ada.Text_IO;
with Utils,
Coordinates_2D;
procedure Main is
use Ada.Execution_Time,
Ada.Real_Time,
Ada.Text_IO;
use Utils;
package My_Coordinates is new Coordinates_2D (Integer);
use My_Coordinates;
File : File_Type;
Start_Time, End_Time : CPU_Time;
Execution_Duration : Time_Span;
Result : Integer := Integer'First;
X_Min, X_Max,
Y_Min, Y_Max : Integer;
begin
Get_File (File);
-- Get all values
declare
procedure Split_Range (Str : String; Lower, Upper : out Integer);
procedure Split_Range (Str : String; Lower, Upper : out Integer) is
use Ada.Integer_Text_IO;
Pattern : constant String := "..";
Separator_Index : constant Natural :=
Ada.Strings.Fixed.Index (Source => Str, Pattern => Pattern);
Left_Str : constant String := Str (Str'First .. Separator_Index - 1);
Right_Str : constant String := Str (Separator_Index + Pattern'Length .. Str'Last);
Last : Positive;
begin
Get (Left_Str, Lower, Last);
Get (Right_Str, Upper, Last);
end Split_Range;
Str : constant String := Get_Line (File);
Pattern : constant String := ",";
Separator_Index : constant Natural :=
Ada.Strings.Fixed.Index (Source => Str (1 .. Str'Last), Pattern => Pattern);
Left_Str : constant String := Str (16 .. Separator_Index - 1);
Right_Str : constant String := Str (Separator_Index + Pattern'Length + 3 .. Str'Last);
begin
Split_Range (Left_Str, X_Min, X_Max);
Split_Range (Right_Str, Y_Min, Y_Max);
end;
-- Do the puzzle
Start_Time := Ada.Execution_Time.Clock;
Solve_Puzzle : declare
subtype X_Velocity_Range is Integer range X_Min .. X_Max;
subtype Y_Velocity_Range is Integer range Y_Min .. Y_Max;
subtype Sign_Values is Integer range -1 .. 1;
-- Returns either a positive or negative +/- 1, indicating the sign of a number passed in argument.
-- If the number passed is 0, it will return 0.
function Sign (Value : Integer) return Sign_Values;
function Sign (Value : Integer) return Sign_Values is
begin
if Value < 0 then
return -1;
elsif Value > 0 then
return 1;
end if;
return 0;
end Sign;
begin
for Y_Velocity in Y_Min .. Integer'Max (0, Integer'Max (abs Y_Min, abs Y_Max)) loop
for X_Velocity in Integer'Min (0, X_Min) .. Integer'Max (0, X_Max) loop
Simulate_Probe_Launch : declare
Highest_Y : Integer := Integer'First;
Current_Point : Coordinate_2D := (Line => 0, Column => 0);
Velocity : Coordinate_2D := (Line => Y_Velocity, Column => X_Velocity);
begin
Simulation : loop
Current_Point := Current_Point + Velocity;
Velocity := Velocity - (Line => 1, Column => Sign (Velocity.Column));
Highest_Y := Integer'Max (Highest_Y, Current_Point.Line);
if Current_Point.Line in Y_Velocity_Range and Current_Point.Column in X_Velocity_Range then
Result := Integer'Max (Result, Highest_Y);
exit Simulation;
elsif Current_Point.Line < Y_Velocity_Range'First
or Current_Point.Column > X_Velocity_Range'Last
then
exit Simulation;
end if;
end loop Simulation;
end Simulate_Probe_Launch;
end loop;
end loop;
end Solve_Puzzle;
End_Time := Ada.Execution_Time.Clock;
Execution_Duration := End_Time - Start_Time;
Put ("Result: ");
Ada.Integer_Text_IO.Put (Item => Result,
Width => 0);
New_Line;
Put_Line ("(Took " & Duration'Image (To_Duration (Execution_Duration) * 1_000_000) & "µs)");
exception
when others =>
Close_If_Open (File);
raise;
end Main;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . F A T _ F L T --
-- --
-- S p e c --
-- --
-- $Revision: 2 $ --
-- --
-- This specification comes from the Generic Primitive Functions standard. --
-- In accordance with the copyright of that document, you can freely copy --
-- and modify this specification, provided that if you do redistribute it, --
-- then any changes that you have made must be clearly indicated. --
-- --
------------------------------------------------------------------------------
-- This package contains an instantiation of the floating-point attribute
-- runtime routines for the type Float.
with System.Fat_Gen;
package System.Fat_Flt is
-- Note the only entity from this package that is acccessed by Rtsfind
-- is the name of the package instantiation. Entities within this package
-- (i.e. the individual floating-point attribute routines) are accessed
-- by name using selected notation.
package Fat_Float is new System.Fat_Gen (Float);
end System.Fat_Flt;
|
-- CD5014O.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT AN ADDRESS CLAUSE CAN BE GIVEN IN THE PRIVATE PART
-- OF A GENERIC PACKAGE SPECIFICATION FOR A VARIABLE OF A PRIVATE
-- TYPE, WHERE THE VARIABLE IS DECLARED IN THE VISIBLE PART OF THE
-- SPECIFICATION.
-- HISTORY:
-- CDJ 07/24/87 CREATED ORIGINAL TEST.
-- BCB 10/01/87 CHANGED TEST TO STANDARD FORMAT.
-- PWB 05/11/89 CHANGED EXTENSION FROM '.DEP' TO '.ADA'.
-- MCH 04/03/90 ADDED INSTANTIATION.
WITH SYSTEM; USE SYSTEM;
WITH SPPRT13; USE SPPRT13;
WITH REPORT; USE REPORT;
PROCEDURE CD5014O IS
BEGIN
TEST ("CD5014O", " AN ADDRESS CLAUSE CAN BE GIVEN " &
"IN THE PRIVATE PART OF A GENERIC PACKAGE " &
"SPECIFICATION FOR A VARIABLE OF A PRIVATE " &
"TYPE, WHERE THE VARIABLE IS DECLARED IN THE " &
"VISIBLE PART OF THE SPECIFICATION");
DECLARE
GENERIC
PACKAGE PKG IS
TYPE PRIVATE_TYPE IS PRIVATE;
PRIVATE
TYPE PRIVATE_TYPE IS RANGE 1 .. 20;
PRIVATE_OBJ1 : PRIVATE_TYPE := 5;
FOR PRIVATE_OBJ1 USE AT VARIABLE_ADDRESS;
END PKG;
PACKAGE BODY PKG IS
BEGIN
IF EQUAL(3,3) THEN
PRIVATE_OBJ1 := 9;
END IF;
IF PRIVATE_OBJ1 /= 9 THEN
FAILED ("INCORRECT VALUE FOR PRIVATE VARIABLE");
END IF;
IF PRIVATE_OBJ1'ADDRESS /= VARIABLE_ADDRESS THEN
FAILED ("INCORRECT ADDRESS FOR PRIVATE VARIABLE");
END IF;
END PKG;
PACKAGE INSTANTIATE IS NEW PKG;
BEGIN
NULL;
END;
RESULT;
END CD5014O;
|
-----------------------------------------------------------------------
-- util-processes-os -- Dummy system specific and low level operations
-- Copyright (C) 2011, 2012 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.
-----------------------------------------------------------------------
private package Util.Processes.Os is
-- The directory separator.
Directory_Separator : constant Character := '/';
type System_Process is new Util.Processes.System_Process with null record;
-- Wait for the process to exit.
overriding
procedure Wait (Sys : in out System_Process;
Proc : in out Process'Class;
Timeout : in Duration);
-- Spawn a new process.
overriding
procedure Spawn (Sys : in out System_Process;
Proc : in out Process'Class;
Mode : in Pipe_Mode := NONE);
-- Append the argument to the process argument list.
overriding
procedure Append_Argument (Sys : in out System_Process;
Arg : in String);
-- Deletes the storage held by the system process.
overriding
procedure Finalize (Sys : in out System_Process);
end Util.Processes.Os;
|
------------------------------------------------------------------------------
-- --
-- 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$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UMLDI_Iterators;
with AMF.Visitors.UMLDI_Visitors;
with League.Strings.Internals;
package body AMF.Internals.UMLDI_UML_Multiplicity_Labels is
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy)
return AMF.UML.Multiplicity_Elements.UML_Multiplicity_Element_Access is
begin
return
AMF.UML.Multiplicity_Elements.UML_Multiplicity_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
(Self.Element)));
end Get_Model_Element;
-----------------------
-- Set_Model_Element --
-----------------------
overriding procedure Set_Model_Element
(Self : not null access UMLDI_UML_Multiplicity_Label_Proxy;
To : AMF.UML.Multiplicity_Elements.UML_Multiplicity_Element_Access) is
begin
raise Program_Error;
-- AMF.Internals.Tables.UML_Attributes.Internal_Set_Model_Element
-- (Self.Element,
-- AMF.Internals.Helpers.To_Element
-- (AMF.Elements.Element_Access (To)));
end Set_Model_Element;
--------------
-- Get_Text --
--------------
overriding function Get_Text
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy)
return League.Strings.Universal_String is
begin
null;
return
League.Strings.Internals.Create
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Text (Self.Element));
end Get_Text;
--------------
-- Set_Text --
--------------
overriding procedure Set_Text
(Self : not null access UMLDI_UML_Multiplicity_Label_Proxy;
To : League.Strings.Universal_String) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Text
(Self.Element,
League.Strings.Internals.Internal (To));
end Set_Text;
-----------------
-- Get_Is_Icon --
-----------------
overriding function Get_Is_Icon
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Icon
(Self.Element);
end Get_Is_Icon;
-----------------
-- Set_Is_Icon --
-----------------
overriding procedure Set_Is_Icon
(Self : not null access UMLDI_UML_Multiplicity_Label_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Icon
(Self.Element, To);
end Set_Is_Icon;
---------------------
-- Get_Local_Style --
---------------------
overriding function Get_Local_Style
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy)
return AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access is
begin
return
AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Style
(Self.Element)));
end Get_Local_Style;
---------------------
-- Set_Local_Style --
---------------------
overriding procedure Set_Local_Style
(Self : not null access UMLDI_UML_Multiplicity_Label_Proxy;
To : AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Local_Style
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Local_Style;
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
raise Program_Error;
return X : AMF.UML.Elements.Collections.Set_Of_UML_Element;
-- return
-- AMF.UML.Elements.Collections.Wrap
-- (AMF.Internals.Element_Collections.Wrap
-- (AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
-- (Self.Element)));
end Get_Model_Element;
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy)
return AMF.CMOF.Elements.CMOF_Element_Access is
begin
return
AMF.CMOF.Elements.CMOF_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
(Self.Element)));
end Get_Model_Element;
---------------------
-- Get_Local_Style --
---------------------
overriding function Get_Local_Style
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy)
return AMF.DI.Styles.DI_Style_Access is
begin
return
AMF.DI.Styles.DI_Style_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Style
(Self.Element)));
end Get_Local_Style;
---------------------
-- Set_Local_Style --
---------------------
overriding procedure Set_Local_Style
(Self : not null access UMLDI_UML_Multiplicity_Label_Proxy;
To : AMF.DI.Styles.DI_Style_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Local_Style
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Local_Style;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class then
AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class
(Visitor).Enter_UML_Multiplicity_Label
(AMF.UMLDI.UML_Multiplicity_Labels.UMLDI_UML_Multiplicity_Label_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UMLDI_UML_Multiplicity_Label_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class then
AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class
(Visitor).Leave_UML_Multiplicity_Label
(AMF.UMLDI.UML_Multiplicity_Labels.UMLDI_UML_Multiplicity_Label_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UMLDI_UML_Multiplicity_Label_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.UMLDI_Iterators.UMLDI_Iterator'Class then
AMF.Visitors.UMLDI_Iterators.UMLDI_Iterator'Class
(Iterator).Visit_UML_Multiplicity_Label
(Visitor,
AMF.UMLDI.UML_Multiplicity_Labels.UMLDI_UML_Multiplicity_Label_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.UMLDI_UML_Multiplicity_Labels;
|
with Interfaces; use Interfaces;
package body Natools.Static_Maps.Web.Error_Pages.Commands is
P : constant array (0 .. 1) of Natural :=
(1, 7);
T1 : constant array (0 .. 1) of Unsigned_8 :=
(0, 1);
T2 : constant array (0 .. 1) of Unsigned_8 :=
(6, 12);
G : constant array (0 .. 16) of Unsigned_8 :=
(2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 5, 0, 0, 0, 0, 1);
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 17;
F2 := (F2 + Natural (T2 (K)) * J) mod 17;
end loop;
return (Natural (G (F1)) + Natural (G (F2))) mod 6;
end Hash;
end Natools.Static_Maps.Web.Error_Pages.Commands;
|
package Natools.Static_Maps.S_Expressions.Templates.Dates.Zones is
pragma Pure;
function Hash (S : String) return Natural;
end Natools.Static_Maps.S_Expressions.Templates.Dates.Zones;
|
-----------------------------------------------------------------------
-- facebook - Use Facebook Graph API
-- Copyright (C) 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 Util.Log.Loggers;
with Util.Http.Rest.Rest_Get_Vector;
with Util.Serialize.Mappers.Record_Mapper;
with Util.Serialize.Mappers.Vector_Mapper;
with ASF.Sessions;
with ASF.Contexts.Faces;
with ASF.Events.Faces.Actions;
package body Facebook is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Facebook");
type Friend_Field_Type is (FIELD_NAME, FIELD_ID);
type Feed_Field_Type is (FIELD_ID, FIELD_NAME, FIELD_FROM, FIELD_MESSAGE,
FIELD_PICTURE, FIELD_LINK, FIELD_DESCRIPTION, FIELD_ICON);
procedure Set_Member (Into : in out Friend_Info;
Field : in Friend_Field_Type;
Value : in Util.Beans.Objects.Object);
procedure Set_Member (Into : in out Feed_Info;
Field : in Feed_Field_Type;
Value : in Util.Beans.Objects.Object);
procedure Set_Member (Into : in out Friend_Info;
Field : in Friend_Field_Type;
Value : in Util.Beans.Objects.Object) is
begin
case Field is
when FIELD_ID =>
Into.Id := Value;
when FIELD_NAME =>
Into.Name := Value;
end case;
end Set_Member;
procedure Set_Member (Into : in out Feed_Info;
Field : in Feed_Field_Type;
Value : in Util.Beans.Objects.Object) is
begin
Log.Info ("Set field {0} to {1}", Feed_Field_Type'Image (Field),
Util.Beans.Objects.To_String (Value));
case Field is
when FIELD_ID =>
Into.Id := Value;
when FIELD_NAME =>
Into.Name := Value;
when FIELD_FROM =>
Into.From := Value;
when FIELD_MESSAGE =>
Into.Message := Value;
when FIELD_LINK =>
Into.Link := Value;
when FIELD_PICTURE =>
Into.Picture := Value;
when FIELD_ICON =>
Into.Icon := Value;
when FIELD_DESCRIPTION =>
Into.Description := Value;
end case;
end Set_Member;
package Friend_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Friend_Info,
Element_Type_Access => Friend_Info_Access,
Fields => Friend_Field_Type,
Set_Member => Set_Member);
package Friend_Vector_Mapper is
new Util.Serialize.Mappers.Vector_Mapper (Vectors => Friend_List.Vectors,
Element_Mapper => Friend_Mapper);
package Feed_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Feed_Info,
Element_Type_Access => Feed_Info_Access,
Fields => Feed_Field_Type,
Set_Member => Set_Member);
package Feed_Vector_Mapper is
new Util.Serialize.Mappers.Vector_Mapper (Vectors => Feed_List.Vectors,
Element_Mapper => Feed_Mapper);
Friend_Map : aliased Friend_Mapper.Mapper;
Friend_Vector_Map : aliased Friend_Vector_Mapper.Mapper;
Feed_Map : aliased Feed_Mapper.Mapper;
Feed_Vector_Map : aliased Feed_Vector_Mapper.Mapper;
procedure Get_Friends is
new Util.Http.Rest.Rest_Get_Vector (Vector_Mapper => Friend_Vector_Mapper);
procedure Get_Feeds is
new Util.Http.Rest.Rest_Get_Vector (Vector_Mapper => Feed_Vector_Mapper);
-- ------------------------------
-- Get the access token from the user session.
-- ------------------------------
function Get_Access_Token return String is
use type ASF.Contexts.Faces.Faces_Context_Access;
Context : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
if Context = null then
return "";
end if;
declare
S : constant ASF.Sessions.Session := Context.Get_Session;
begin
if not S.Is_Valid then
return "";
end if;
declare
Token : constant Util.Beans.Objects.Object := S.Get_Attribute ("access_token");
begin
if Util.Beans.Objects.Is_Null (Token) then
return "";
else
return Util.Beans.Objects.To_String (Token);
end if;
end;
end;
end Get_Access_Token;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : in Friend_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "name" then
return From.Name;
elsif Name = "id" then
return From.Id;
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : in Feed_Info;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "id" then
return From.Id;
elsif Name = "name" then
return From.Name;
elsif Name = "from" then
return From.From;
elsif Name = "message" then
return From.Message;
elsif Name = "picture" then
return From.Picture;
elsif Name = "link" then
return From.Link;
elsif Name = "description" then
return From.Description;
elsif Name = "icon" then
return From.Icon;
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
-- ------------------------------
-- Get the value identified by the name.
-- If the name cannot be found, the method should return the Null object.
-- ------------------------------
overriding
function Get_Value (From : in Friend_List_Bean;
Name : in String) return Util.Beans.Objects.Object is
begin
if Name = "hasAccessToken" then
return Util.Beans.Objects.To_Object (False);
end if;
return Friend_List.List_Bean (From).Get_Value (Name);
end Get_Value;
-- ------------------------------
-- Create a Friend_List bean instance.
-- ------------------------------
function Create_Friends_Bean return Util.Beans.Basic.Readonly_Bean_Access is
List : Friend_List_Bean_Access := new Friend_List_Bean;
Token : constant String := Get_Access_Token;
begin
if Token'Length > 0 then
Log.Info ("Getting the Facebook friends");
Get_Friends ("https://graph.facebook.com/me/friends?access_token="
& Token,
Friend_Vector_Map'Access,
"/data",
List.List'Access);
end if;
return List.all'Access;
end Create_Friends_Bean;
-- ------------------------------
-- Build and return a Facebook feed list.
-- ------------------------------
function Create_Feed_List_Bean return Util.Beans.Basic.Readonly_Bean_Access is
List : Feed_List.List_Bean_Access := new Feed_List.List_Bean;
Token : constant String := Get_Access_Token;
begin
if Token'Length > 0 then
Log.Info ("Getting the Facebook feeds");
Get_Feeds ("https://graph.facebook.com/me/home?access_token="
& Token,
Feed_Vector_Map'Access,
"/data",
List.List'Access);
end if;
return List.all'Access;
end Create_Feed_List_Bean;
-- ------------------------------
-- Get the user information identified by the given name.
-- ------------------------------
overriding
function Get_Value (From : in Facebook_Auth;
Name : in String) return Util.Beans.Objects.Object is
use type ASF.Contexts.Faces.Faces_Context_Access;
F : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
if F /= null and Name = "authenticate_url" then
declare
S : constant ASF.Sessions.Session := F.Get_Session (True);
Id : constant String := S.Get_Id;
State : constant String := From.Get_State (Id);
Params : constant String := From.Get_Auth_Params (State, "read_stream");
begin
Log.Info ("OAuth params: {0}", Params);
return Util.Beans.Objects.To_Object ("https://www.facebook.com/dialog/oauth?"
& Params);
end;
elsif F /= null and Name = "isAuthenticated" then
declare
S : constant ASF.Sessions.Session := F.Get_Session (False);
begin
if S.Is_Valid and
then not Util.Beans.Objects.Is_Null (S.Get_Attribute ("access_token")) then
return Util.Beans.Objects.To_Object (True);
else
return Util.Beans.Objects.To_Object (False);
end if;
end;
end if;
return Util.Beans.Objects.Null_Object;
end Get_Value;
-- ------------------------------
-- Authenticate result from Facebook.
-- ------------------------------
procedure Authenticate (From : in out Facebook_Auth;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String) is
pragma Unreferenced (Outcome);
use type Security.OAuth.Clients.Access_Token_Access;
F : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
Session : ASF.Sessions.Session := F.Get_Session;
State : constant String := F.Get_Parameter (Security.OAuth.State);
Code : constant String := F.Get_Parameter (Security.OAuth.Code);
begin
Log.Info ("Auth code {0} for state {1}", Code, State);
if Session.Is_Valid then
if From.Is_Valid_State (Session.Get_Id, State) then
declare
Acc : constant Security.OAuth.Clients.Access_Token_Access
:= From.Request_Access_Token (Code);
begin
if Acc /= null then
Log.Info ("Access token is {0}", Acc.Get_Name);
Session.Set_Attribute ("access_token",
Util.Beans.Objects.To_Object (Acc.Get_Name));
end if;
end;
end if;
end if;
end Authenticate;
package Authenticate_Binding is
new ASF.Events.Faces.Actions.Action_Method.Bind (Bean => Facebook_Auth,
Method => Authenticate,
Name => "authenticate");
Binding_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (1 => Authenticate_Binding.Proxy'Unchecked_Access);
-- ------------------------------
-- This bean provides some methods that can be used in a Method_Expression
-- ------------------------------
overriding
function Get_Method_Bindings (From : in Facebook_Auth)
return Util.Beans.Methods.Method_Binding_Array_Access is
pragma Unreferenced (From);
begin
return Binding_Array'Access;
end Get_Method_Bindings;
begin
Friend_Map.Add_Default_Mapping;
Friend_Vector_Map.Set_Mapping (Friend_Map'Access);
Feed_Map.Add_Mapping ("id", FIELD_ID);
Feed_Map.Add_Mapping ("name", FIELD_NAME);
Feed_Map.Add_Mapping ("message", FIELD_MESSAGE);
Feed_Map.Add_Mapping ("description", FIELD_DESCRIPTION);
Feed_Map.Add_Mapping ("from/name", FIELD_FROM);
Feed_Map.Add_Mapping ("picture", FIELD_PICTURE);
Feed_Map.Add_Mapping ("link", FIELD_LINK);
Feed_Map.Add_Mapping ("icon", FIELD_ICON);
Feed_Vector_Map.Set_Mapping (Feed_Map'Access);
end Facebook;
|
pragma License (Unrestricted);
-- implementation unit for System.Initialization
private with Ada.Tags;
package System.Storage_Pools.Overlaps is
pragma Preelaborate;
type Overlay_Pool is limited new Root_Storage_Pool with null record
with Disable_Controlled => True;
-- Actually, an allocation address is stored in TLS.
pragma Finalize_Storage_Only (Overlay_Pool);
procedure Set_Address (Storage_Address : Address);
pragma Inline (Set_Address);
overriding procedure Allocate (
Pool : in out Overlay_Pool;
Storage_Address : out Address;
Size_In_Storage_Elements : Storage_Elements.Storage_Count;
Alignment : Storage_Elements.Storage_Count);
pragma Inline (Allocate);
overriding procedure Deallocate (
Pool : in out Overlay_Pool;
Storage_Address : Address;
Size_In_Storage_Elements : Storage_Elements.Storage_Count;
Alignment : Storage_Elements.Storage_Count);
pragma Inline (Deallocate);
overriding function Storage_Size (Pool : Overlay_Pool)
return Storage_Elements.Storage_Count is (0);
Pool : constant not null access Overlay_Pool;
-- Note: If it is declared as a local pool, Any objects allocated from it
-- will be finalized when the local pool is out of scope,
-- because the objects also belongs to the same scope.
-- Therefore it should be declared in library-level.
private
Dispatcher : aliased constant Ada.Tags.Tag := Overlay_Pool'Tag;
Pool : constant not null access Overlay_Pool :=
Overlay_Pool'Deref (Dispatcher'Address)'Unrestricted_Access;
end System.Storage_Pools.Overlaps;
|
package Root is
type Buffer_Type is array (Positive range <>) of Natural;
type Root_Type (First : Natural) is abstract tagged record
Buffer_Root : Buffer_Type (1 .. First);
end record;
end Root;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.