CombinedText
stringlengths 4
3.42M
|
|---|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ W I D E _ F I X E D --
-- --
-- S p e c --
-- --
-- This specification is adapted from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Wide_Wide_Maps;
package Ada.Strings.Wide_Wide_Fixed is
pragma Preelaborate;
------------------------------------------------------------------------
-- Copy Procedure for Wide_Wide_Strings of Possibly Different Lengths --
------------------------------------------------------------------------
procedure Move
(Source : Wide_Wide_String;
Target : out Wide_Wide_String;
Drop : Truncation := Error;
Justify : Alignment := Left;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space);
------------------------
-- Search Subprograms --
------------------------
function Index
(Source : Wide_Wide_String;
Pattern : Wide_Wide_String;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity) return Natural;
function Index
(Source : Wide_Wide_String;
Pattern : Wide_Wide_String;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Index
(Source : Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
function Index
(Source : Wide_Wide_String;
Pattern : Wide_Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural;
pragma Ada_05 (Index);
function Index
(Source : Wide_Wide_String;
Pattern : Wide_Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
pragma Ada_05 (Index);
function Index
(Source : Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index);
function Index_Non_Blank
(Source : Wide_Wide_String;
Going : Direction := Forward) return Natural;
function Index_Non_Blank
(Source : Wide_Wide_String;
From : Positive;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural;
function Count
(Source : Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Count
(Source : Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set) return Natural;
procedure Find_Token
(Source : Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural);
----------------------------------------------
-- Wide_Wide_String Translation Subprograms --
----------------------------------------------
function Translate
(Source : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping)
return Wide_Wide_String;
procedure Translate
(Source : in out Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping);
function Translate
(Source : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Wide_Wide_String;
procedure Translate
(Source : in out Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function);
-------------------------------------------------
-- Wide_Wide_String Transformation Subprograms --
-------------------------------------------------
function Replace_Slice
(Source : Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String) return Wide_Wide_String;
procedure Replace_Slice
(Source : in out Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String;
Drop : Truncation := Error;
Justify : Alignment := Left;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space);
function Insert
(Source : Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String) return Wide_Wide_String;
procedure Insert
(Source : in out Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Error);
function Overwrite
(Source : Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String) return Wide_Wide_String;
procedure Overwrite
(Source : in out Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String;
Drop : Truncation := Right);
function Delete
(Source : Wide_Wide_String;
From : Positive;
Through : Natural) return Wide_Wide_String;
procedure Delete
(Source : in out Wide_Wide_String;
From : Positive;
Through : Natural;
Justify : Alignment := Left;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space);
-------------------------------------------
-- Wide_Wide_String Selector Subprograms --
-------------------------------------------
function Trim
(Source : Wide_Wide_String;
Side : Trim_End) return Wide_Wide_String;
procedure Trim
(Source : in out Wide_Wide_String;
Side : Trim_End;
Justify : Alignment := Left;
Pad : Wide_Wide_Character := Wide_Wide_Space);
function Trim
(Source : Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set)
return Wide_Wide_String;
procedure Trim
(Source : in out Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set;
Justify : Alignment := Ada.Strings.Left;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space);
function Head
(Source : Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space)
return Wide_Wide_String;
procedure Head
(Source : in out Wide_Wide_String;
Count : Natural;
Justify : Alignment := Left;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space);
function Tail
(Source : Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space)
return Wide_Wide_String;
procedure Tail
(Source : in out Wide_Wide_String;
Count : Natural;
Justify : Alignment := Left;
Pad : Wide_Wide_Character := Ada.Strings.Wide_Wide_Space);
--------------------------------------------
-- Wide_Wide_String Constructor Functions --
--------------------------------------------
function "*"
(Left : Natural;
Right : Wide_Wide_Character) return Wide_Wide_String;
function "*"
(Left : Natural;
Right : Wide_Wide_String) return Wide_Wide_String;
end Ada.Strings.Wide_Wide_Fixed;
|
----------------------------csc410/prog5/as5.adb----------------------------
-- Author: Matthew Bennett
-- Class: CSC410 Burgess
-- Date: 11-01-04 Modified: 11-01-04
-- Due: 11-7-04
-- Desc: Assignment 5: LAMPORT'S ALGORITHM FOR VIRTUAL TOPOLOGY NETWORKS
--
-- a nonproduction implementation of
-- LAMPORT's "bakery" algorithm which utilizes clocks (a 'ticketing' system
-- like in the bakery or at the dept of motor vehicles) to determine which
-- process may go into the critical section next.
--
-- LAMPORT implemented as described in
-- "Algorithms FOR Mutual Exclusion", M. Raynal
-- MIT PRESS Cambridge, 1986 ISBN: 0-262-18119-3
-- with additional revisions due to message passing across a virtual topology
----------------------------------------------------------------------------
-- Refactorings 10-05-04: (deNOTed @FIX@)
-- (4) linked list of processes instread of array
----------------------------------------------------------------
-- dependencies
WITH ADA.TEXT_IO; USE ADA.TEXT_IO;
WITH ADA.INTEGER_TEXT_IO; USE ADA.INTEGER_TEXT_IO;
WITH ADA.NUMERICS.FLOAT_RANDOM; USE ADA.NUMERICS.FLOAT_RANDOM;
WITH ADA.CALENDAR; -- (provides cast: natural -> time FOR input into delay)
WITH ADA.STRINGS; USE ADA.STRINGS;
PROCEDURE Main IS
G : Generator;
MAX_NEIGHBORS : Constant := 25;
TYPE RX_TASK;
TYPE RX_Ptr IS ACCESS RX_TASK;
TYPE Myarray IS ARRAY (0..MAX_NEIGHBORS) of Integer;
--this is needed bc anonymous types are not allowed in declarations
TYPE Node;
TYPE Node_Ptr IS ACCESS Node;
TYPE Node IS RECORD
m_Value : Integer;
Next : Node_Ptr := NULL;
Prev : Node_Ptr := NULL;
END RECORD;
TASKarray : ARRAY (0..MAX_NEIGHBORS) of RX_Ptr;
--keep up with tasks thrown off
PROCEDURE Enqueue (Head : IN OUT Node_Ptr;
Value : IN Integer) IS
Item : Node_Ptr;
BEGIN
Item := new Node;
Item.m_Value := Value;
IF (Head = NULL) THEN Head := Item;
ELSE -- Insert at the beginning
Item.Next := Head;
Head.Prev := Item;
Head := Item;
END IF;
END Enqueue;
PROCEDURE Dequeue(Head : IN out Node_Ptr; Value : out Integer) IS Curr : Node_Ptr;
BEGIN
Curr := Head;
IF (Head = NULL) THEN -- We have an empty queue
put ("Error : Empty Queue Encountered");
ELSE
WHILE (Curr.Next /= NULL) --iterate to end of list
LOOP
Curr := Curr.Next;
END LOOP;
IF (Curr.Prev = NULL) THEN Head := NULL;
ELSE Curr.Prev.Next := NULL; END IF;
Value := Curr.m_Value;
END IF;
END Dequeue;
FUNCTION IsEmpty (Head : Node_Ptr) RETURN Boolean IS
BEGIN
IF (Head = NULL) THEN RETURN TRUE;
ELSE RETURN FALSE; END IF;
END IsEmpty;
-- BEGIN Receive TASK Declaration --
TASK TYPE RX_TASK IS
ENTRY Start( myid : Integer; hold : Integer; Neighbor : Myarray);
ENTRY Send (mesgTYPE : Character; FromId : Integer; ToId : Integer);
END RX_TASK;
-- BEGIN Receive TASK Definition --
TASK BODY RX_TASK IS
Neighborarray : ARRAY (0..MAX_NEIGHBORS) of Integer;
HOLDER : Integer;
USING : Boolean := FALSE;
REQUEST_Q : Node_Ptr := NULL;
ASKED : Boolean := FALSE;
SELF : Integer;
TYPE Message;
TYPE Message_Ptr IS ACCESS Message;
TYPE Message IS RECORD
m_mesgTYPE : Character;
m_fromId : Integer;
m_toId : Integer;
Next,Prev : Message_Ptr := NULL;
END RECORD;
MESG_Q : Message_Ptr := NULL;
-- FUNCTIONs FOR Enqueuing AND Dequeuing a Message Queue --------------
PROCEDURE Message_Enqueue(
Head : IN OUT Message_Ptr;
mesgTYPE : Character;
fromId : Integer;
toId : Integer) IS
Item : Message_Ptr;
BEGIN
Item := new Message;
Item.m_mesgTYPE := mesgTYPE;
Item.m_fromId := fromId;
Item.m_toId := toId;
IF (Head = NULL) THEN -- We have an empty queue
Head := Item;
ELSE -- Insert at the beginning
Item.Next := Head;
Head.Prev := Item;
Head := Item;
END IF;
END Message_Enqueue;
PROCEDURE Message_Dequeue(
Head : IN out Message_Ptr;
tempMesg : out Message)
IS Curr : Message_Ptr;
BEGIN
Curr := Head;
IF (Head = NULL) THEN -- We have an empty queue
put ("Error : Empty Message Queue Encountered");
ELSE
WHILE (Curr.Next /= NULL) LOOP Curr := Curr.Next; END LOOP;
-- Curr should now point to the last element IN the list --
IF (Curr.Prev = NULL)
THEN Head := NULL;
ELSE Curr.Prev.Next := NULL;
END IF;
tempMesg.m_mesgTYPE := Curr.m_mesgTYPE;
tempMesg.m_fromId := Curr.m_fromId;
tempMesg.m_toId := Curr.m_toId;
END IF;
END Message_Dequeue;
FUNCTION Message_IsEmpty (Head : Message_Ptr) RETURN Boolean IS
BEGIN
IF (Head = NULL) THEN RETURN TRUE;
ELSE RETURN FALSE;
END IF;
END Message_IsEmpty;
-- FUNCTIONs FOR ASSIGN_PRIVILEGE AND MAKE REQUEST ---------
PROCEDURE ASSIGN_PRIVILEGE IS
BEGIN
IF (HOLDER = SELF) AND (NOT USING) AND (NOT IsEmpty(REQUEST_Q)) THEN
Dequeue(REQUEST_Q, HOLDER);
ASKED := FALSE;
IF HOLDER = SELF THEN
USING := TRUE;
-- Critical Section
Put (SELF, (1+(4*SELF))); Put (" IN CS"); New_Line;
delay (Standard.Duration(Random(G) * 4.0));
Put (SELF, (1+(4*SELF))); Put (" out CS"); New_Line;
ELSE
TASKarray(HOLDER).Send('P', SELF, HOLDER);
END IF;
END IF;
END ASSIGN_PRIVILEGE;
PROCEDURE MAKE_REQUEST IS
BEGIN
IF (HOLDER /= SELF) AND (NOT IsEmpty(REQUEST_Q)) AND (NOT ASKED) THEN
TASKarray(HOLDER).Send('R', SELF, HOLDER);
ASKED := TRUE;
END IF;
END MAKE_REQUEST;
TASK TYPE AL_TASK IS END AL_TASK;
TASK BODY AL_TASK IS
currMessage : Message;
BEGIN
LOOP
-- Only attempt to enter the critical section 35% of time
IF ((Random(g) * 10.0) > 7.0) THEN
Delay (Standard.Duration(Random(G) * 3.0));
-- Node wishes to enter the critical Section --
Enqueue(REQUEST_Q, SELF);
ASSIGN_PRIVILEGE;
MAKE_REQUEST;
-- Node exits the critical section --
USING := FALSE;
ASSIGN_PRIVILEGE;
MAKE_REQUEST;
END IF;
-- Process any messages IN the message queue --
IF (NOT Message_IsEmpty(MESG_Q)) THEN
Message_Dequeue(MESG_Q, currMessage);
case currMessage.m_mesgTYPE IS
WHEN 'P' =>
BEGIN
HOLDER := SELF;
ASSIGN_PRIVILEGE;
MAKE_REQUEST;
END;
WHEN 'R' =>
BEGIN
Enqueue(REQUEST_Q, currMessage.m_FromId);
ASSIGN_PRIVILEGE;
MAKE_REQUEST;
END;
WHEN Others => NULL; --make ada happy
END Case;
ELSE -- We delay a bit longer, as to let others through
Delay (Standard.Duration(Random(G) * 6.0));
END IF;
END LOOP;
END AL_TASK;
TYPE AL_Ptr IS ACCESS AL_TASK;
aPtr : AL_Ptr;
--------------------------------------------------------------
-- BEGIN THE RECEIEVE TASK DEFINITION --
BEGIN
-- ACCEPT creation messages --
ACCEPT Start(
myid : Integer;
hold : Integer;
Neighbor : Myarray)
DO
FOR I IN Neighbor'First..Neighbor'Last
LOOP
Neighborarray(I) := Neighbor(I);
END LOOP;
HOLDER := hold;
SELF := myid;
END Start;
aPtr := new AL_TASK; -- Start Algorithm LOOP
-- Start Message Receiving LOOP --
LOOP
ACCEPT Send (mesgTYPE : Character; FromId : Integer; ToId : Integer)
DO
Message_Enqueue (MESG_Q,mesgTYPE, fromId, ToId);
put (SELF, (1+(4*SELF)));
IF (MesgTYPE = 'P') THEN put (" Priv ");
ELSE put (" Request "); END IF;
Put (FromId, 0);
Put (","); Put (ToId,0); New_Line;
END Send;
END LOOP; -- RX LOOP
END RX_TASK;
PROCEDURE Driver IS
infile : FILE_TYPE; --ada.standard.textIO type for reading ascii and iso-8XXX
taskId : Integer;
holder : Integer;
neighArray : myArray;
neighCount : Integer := 0;
BEGIN
Open (inFile, IN_FILE, "input.txt");
--open as read only ascii and use reference infile
--file format is: nodeID neighbor neighbor neighbor ...neighbor[MAX_NEIGHBORS]
WHILE NOT END_OF_FILE(infile)
LOOP
Get(infile, TASKId);
Get(infile, Holder);
WHILE NOT END_OF_LINE(infile) --there are neighbors coming on the line
LOOP
Get( infile, neighArray(neighCount) );
neighCount := neighCount + 1;
END LOOP;
TASKarray(TASKId) := new RX_TASK;
TASKarray(TASKId).Start(taskId, holder, neighArray);
END LOOP;
END Driver;
BEGIN Driver; END Main;
|
------------------------------------------------------------------------------
-- --
-- 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 _ I O --
-- --
-- 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.Modular_Aux;
with System.Unsigned_Types; use System.Unsigned_Types;
with System.WCh_Con; use System.WCh_Con;
with System.WCh_WtS; use System.WCh_WtS;
package body Ada.Wide_Wide_Text_IO.Modular_IO is
subtype TFT is Ada.Wide_Wide_Text_IO.File_Type;
-- File type required for calls to routines in Aux
package Aux renames Ada.Wide_Wide_Text_IO.Modular_Aux;
---------
-- Get --
---------
procedure Get
(File : File_Type;
Item : out Num;
Width : Field := 0)
is
begin
if Num'Size > Unsigned'Size then
Aux.Get_LLU (TFT (File), Long_Long_Unsigned (Item), Width);
else
Aux.Get_Uns (TFT (File), Unsigned (Item), Width);
end if;
exception
when Constraint_Error => raise Data_Error;
end Get;
procedure Get
(Item : out Num;
Width : Field := 0)
is
begin
Get (Current_Input, Item, Width);
end Get;
procedure Get
(From : Wide_Wide_String;
Item : out Num;
Last : out Positive)
is
S : constant String := Wide_Wide_String_To_String (From, WCEM_Upper);
-- String on which we do the actual conversion. Note that the method
-- used for wide character encoding is irrelevant, since if there is
-- a character outside the Standard.Character range then the call to
-- Aux.Gets will raise Data_Error in any case.
begin
if Num'Size > Unsigned'Size then
Aux.Gets_LLU (S, Long_Long_Unsigned (Item), Last);
else
Aux.Gets_Uns (S, Unsigned (Item), Last);
end if;
exception
when Constraint_Error => raise Data_Error;
end Get;
---------
-- Put --
---------
procedure Put
(File : File_Type;
Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
begin
if Num'Size > Unsigned'Size then
Aux.Put_LLU (TFT (File), Long_Long_Unsigned (Item), Width, Base);
else
Aux.Put_Uns (TFT (File), Unsigned (Item), Width, Base);
end if;
end Put;
procedure Put
(Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
begin
Put (Current_Output, Item, Width, Base);
end Put;
procedure Put
(To : out Wide_Wide_String;
Item : Num;
Base : Number_Base := Default_Base)
is
S : String (To'First .. To'Last);
begin
if Num'Size > Unsigned'Size then
Aux.Puts_LLU (S, Long_Long_Unsigned (Item), Base);
else
Aux.Puts_Uns (S, Unsigned (Item), Base);
end if;
for J in S'Range loop
To (J) := Wide_Wide_Character'Val (Character'Pos (S (J)));
end loop;
end Put;
end Ada.Wide_Wide_Text_IO.Modular_IO;
|
-----------------------------------------------------------------------------
-- Concrete implementation class for the MicroChip 24XX01/24LC01B EEPROM
--
-- Copyright 2022 (C) Holger Rodriguez
--
-- SPDX-License-Identifier: BSD-3-Clause
--
with HAL.I2C;
package EEPROM_I2C.MC24XX16 is
-----------------------------------------------------------------------------
-- This is the default I2C address of the EEPROM.
I2C_DEFAULT_ADDRESS : constant HAL.I2C.I2C_Address := 2#1010_0000#;
-----------------------------------------------------------------------------
-- This is the EEPROM definition.
-- We keep it as closed as possible to ensure, that changes have minimal
-- ripple effect throughout.
type EEPROM_Memory_MC24XX16 (
C_Delay_Callback : Proc_Delay_Callback_MS;
-- the address of the EEPROM on the bus
I2C_Addr : HAL.I2C.I2C_Address;
-- the port where the EEPROM is connected to
I2C_Port : not null HAL.I2C.Any_I2C_Port
)
is new EEPROM_Memory (
C_Type_of_Chip => EEC_MC24XX16,
C_Memory_Address_Size => HAL.I2C.Memory_Size_8b,
C_Size_In_Bytes => 2_048,
C_Size_In_Bits => 16_384,
C_Number_Of_Blocks => 8,
C_Bytes_Per_Block => 256,
C_Number_Of_Pages => 128,
C_Bytes_Per_Page => 16,
C_Max_Byte_Address => 2_047,
C_Write_Delay_MS => 5,
C_Delay_Callback => C_Delay_Callback,
I2C_Addr => I2C_Addr,
I2C_Port => I2C_Port
) with null record;
end EEPROM_I2C.MC24XX16;
|
with Ada.Text_IO; use Ada.Text_IO;
with OLED_SH1106; use OLED_SH1106;
with Interfaces.C; use Interfaces.C;
with Bitmap_Graphics; use Bitmap_Graphics;
procedure AdaOLED is
Center : Point := (64, 32);
P : Point := (10, 10);
Q : Point := (100, 40);
begin
Put_Line ("OLED Display Driver Test");
if Start_Driver then
Init_Display; -- Display initialisation
Clear;
Put(P, "This is a test", 20);
Show;
delay 1.0;
Clear;
Put(P, "This is a TEST", 20, Black, White);
Show;
delay 2.0;
for Size in 1..6 loop
Clear;
Dot(Center, Size*2);
Show;
delay 0.1;
end loop;
delay 1.0;
for X in 0..20 loop
Clear;
Q.X := 20+4*X;
Q.Y := 10+X;
Line(P, Q);
Show;
delay 0.1;
end loop;
delay 1.0;
for X in 0..20 loop
for Y in 0..5 loop
delay 0.05;
Clear;
Q.X := 20+4*X;
Q.Y := 10+X;
Rectangle(P, Q, 2);
Show;
end loop;
end loop;
for X in 0..40 loop
delay 0.1;
Clear;
Q.X := P.X + 2* X;
Q.Y := 60;
Rectangle(P, (P.X+80, Q.Y) );
Fill_Rectangle(P, Q);
Show;
end loop;
delay 2.0;
for R in 0..20 loop
delay 0.4;
Clear;
Circle(Center, R, 3);
Show;
end loop;
for R in 0..20 loop
delay 0.4;
Clear;
Fill_Circle(Center, R);
Show;
end loop;
delay 1.0;
Clear;
Put(Center, 'E', 8);
Show;
delay 1.0;
Clear;
Put(Center, 'F', 12);
Show;
delay 1.0;
Clear;
Put(Center, 'G', 16);
Show;
delay 1.0;
Clear;
Put(Center, 'H', 20, Black, White);
Show;
delay 1.0;
Clear;
Put(Center, 'K', 24, Black, White);
Show;
delay 1.0;
Clear;
Put(Center, 127, 16, Black, White);
Show;
delay 1.0;
Clear;
Put(Center, 1234, 20);
Show;
delay 0.8;
Clear;
Bitmap(Center, Signal);
Show;
delay 0.8;
Clear;
Bitmap(Center, Message);
Show;
delay 10.0;
else
Put_Line ("Driver initialisation failed!");
end if;
Stop_Driver;
end AdaOLED;
|
--
-- Copyright 2021 (C) Holger Rodriguez
--
-- SPDX-License-Identifier: BSD-3-Clause
--
with Interfaces;
private with Edc_Client.Matrix.Common;
with Edc_Client.Matrix.Types; use Edc_Client.Matrix.Types;
package body Edc_Client.Matrix.Double_Word is
--------------------------------------------------------------------------
-- see .ads
procedure Show_LSW_LSB (Value : HAL.UInt8) is
begin
Edc_Client.Matrix.Common.Show_Byte (Value => Value,
Side => '1',
Block => '0');
end Show_LSW_LSB;
--------------------------------------------------------------------------
-- see .ads
procedure Show_LSW_MSB (Value : HAL.UInt8) is
begin
Edc_Client.Matrix.Common.Show_Byte (Value => Value,
Side => '1',
Block => '1');
end Show_LSW_MSB;
--------------------------------------------------------------------------
-- see .ads
procedure Show_MSW_LSB (Value : HAL.UInt8) is
begin
Edc_Client.Matrix.Common.Show_Byte (Value => Value,
Side => '1',
Block => '2');
end Show_MSW_LSB;
--------------------------------------------------------------------------
-- see .ads
procedure Show_MSW_MSB (Value : HAL.UInt8) is
begin
Edc_Client.Matrix.Common.Show_Byte (Value => Value,
Side => '1',
Block => '3');
end Show_MSW_MSB;
--------------------------------------------------------------------------
-- see .ads
procedure Show_LSW (Value : HAL.UInt16) is
begin
Edc_Client.Matrix.Common.Show_Word (Value => Value,
Side => '1',
Block => '0');
end Show_LSW;
--------------------------------------------------------------------------
-- see .ads
procedure Show_MSW (Value : HAL.UInt16) is
begin
Edc_Client.Matrix.Common.Show_Word (Value => Value,
Side => '1',
Block => '1');
end Show_MSW;
--------------------------------------------------------------------------
-- see .ads
procedure Show_Double_Word (Value : HAL.UInt32) is
use HAL;
use Interfaces;
Command : Double_Word_String := "M1D000000000";
MSW : constant Interfaces.Unsigned_16 :=
Interfaces.Unsigned_16 (Interfaces.Shift_Right (
Interfaces.Unsigned_32 (Value), 16));
LSW : constant Interfaces.Unsigned_16
:= Interfaces.Unsigned_16 (Value and 16#FFFF#);
MSB : Interfaces.Unsigned_8;
LSB : Interfaces.Unsigned_8;
MSN : Interfaces.Unsigned_8;
LSN : Interfaces.Unsigned_8;
begin
--
MSB :=
Interfaces.Unsigned_8 (Interfaces.Shift_Right (MSW, 8));
MSN := Interfaces.Shift_Right (MSB, 4);
Command (5) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (MSN));
LSN := MSB and 16#F#;
Command (6) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (LSN));
LSB :=
Interfaces.Unsigned_8 (MSW and 16#FF#);
MSN := Interfaces.Shift_Right (LSB, 4);
Command (7) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (MSN));
LSN := LSB and 16#F#;
Command (8) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (LSN));
--
MSB :=
Interfaces.Unsigned_8 (Interfaces.Shift_Right (LSW, 8));
MSN := Interfaces.Shift_Right (MSB, 4);
Command (9) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (MSN));
LSN := MSB and 16#F#;
Command (10) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (LSN));
LSB :=
Interfaces.Unsigned_8 (LSW and 16#FF#);
MSN := Interfaces.Shift_Right (LSB, 4);
Command (11) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (MSN));
LSN := LSB and 16#F#;
Command (12) := Edc_Client.Matrix.Common.Nibble_To_Char (UInt8 (LSN));
--
Transmitter (Command);
end Show_Double_Word;
end Edc_Client.Matrix.Double_Word;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web 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$
------------------------------------------------------------------------------
-- SOAP message decoder process events from SAX parser.
------------------------------------------------------------------------------
with League.Strings;
with XML.SAX.Attributes;
with XML.SAX.Content_Handlers;
with XML.SAX.Error_Handlers;
with XML.SAX.Parse_Exceptions;
with XML.SAX.Lexical_Handlers;
private with Web_Services.SOAP.Payloads.Decoders;
private with Web_Services.SOAP.Headers.Decoders;
with Web_Services.SOAP.Messages;
package Web_Services.SOAP.Message_Decoders is
type SOAP_Message_Decoder is
limited new XML.SAX.Content_Handlers.SAX_Content_Handler
and XML.SAX.Error_Handlers.SAX_Error_Handler
and XML.SAX.Lexical_Handlers.SAX_Lexical_Handler with private;
function Success (Self : SOAP_Message_Decoder'Class) return Boolean;
function Message
(Self : SOAP_Message_Decoder'Class)
return Web_Services.SOAP.Messages.SOAP_Message_Access;
private
type States is
(Initial, -- Initial state.
SOAP_Envelope, -- SOAP Envelope element has been processed.
SOAP_Header, -- SOAP Header element has been processed.
Header_Element, -- SOAP Header child element has been processed.
Header_Ignore, -- Ignore child and grandchildren of SOAP Header.
SOAP_Body, -- SOAP Body element has beed processed.
Body_Element, -- SOAP Body child element has been processed.
Body_Ignore); -- Ignore child and grandchildren of SOAP Header.
type Modes is
(Strict, -- Strict mode: all 'SHOULD' assertions are
-- checked.
Conformant); -- Relaxed mode to pass SOAP conformance testsuite;
-- some 'SHOULD' assertions aren't checked.
type SOAP_Message_Decoder is
limited new XML.SAX.Content_Handlers.SAX_Content_Handler
and XML.SAX.Error_Handlers.SAX_Error_Handler
and XML.SAX.Lexical_Handlers.SAX_Lexical_Handler with
record
Mode : Modes := Conformant;
State : States := Initial;
Depth : Natural := 0;
Payload_Decoder :
Web_Services.SOAP.Payloads.Decoders.SOAP_Payload_Decoder_Access;
Header_Decoder :
Web_Services.SOAP.Headers.Decoders.SOAP_Header_Decoder_Access;
Message : Web_Services.SOAP.Messages.SOAP_Message_Access;
Success : Boolean := True;
end record;
overriding procedure Characters
(Self : in out SOAP_Message_Decoder;
Text : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure End_Element
(Self : in out SOAP_Message_Decoder;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Error
(Self : in out SOAP_Message_Decoder;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception;
Success : in out Boolean);
-- Stops processing of the message.
overriding function Error_String
(Self : SOAP_Message_Decoder) return League.Strings.Universal_String;
-- Returns error information as string.
overriding procedure Fatal_Error
(Self : in out SOAP_Message_Decoder;
Occurrence : XML.SAX.Parse_Exceptions.SAX_Parse_Exception);
-- Stops processing of the message.
overriding procedure Processing_Instruction
(Self : in out SOAP_Message_Decoder;
Target : League.Strings.Universal_String;
Data : League.Strings.Universal_String;
Success : in out Boolean);
-- Handles processing instructions in XML stream. Processing instructions
-- are prohibited in SOAP messages, this subprogram always sets Success to
-- False.
overriding procedure Start_Document
(Self : in out SOAP_Message_Decoder;
Success : in out Boolean);
-- Handles start of processing of document. Used for initialization.
overriding procedure Start_DTD
(Self : in out SOAP_Message_Decoder;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure Start_Element
(Self : in out SOAP_Message_Decoder;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Attributes : XML.SAX.Attributes.SAX_Attributes;
Success : in out Boolean);
end Web_Services.SOAP.Message_Decoders;
|
-- POK header
--
-- The following file is a part of the POK project. Any modification should
-- be made according to the POK licence. You CANNOT use this file or a part
-- of a file for your own project.
--
-- For more information on the POK licence, please see our LICENCE FILE
--
-- Please follow the coding guidelines described in doc/CODING_GUIDELINES
--
-- Copyright (c) 2007-2020 POK team
-- ---------------------------------------------------------------------------
-- --
-- SEMAPHORE constant and type definitions and management services --
-- --
-- ---------------------------------------------------------------------------
with APEX.Processes;
package APEX.Semaphores is
Max_Number_Of_Semaphores : constant := System_Limit_Number_Of_Semaphores;
Max_Semaphore_Value : constant := 32_767;
subtype Semaphore_Name_Type is Name_Type;
type Semaphore_Id_Type is private;
Null_Semaphore_Id : constant Semaphore_Id_Type;
type Semaphore_Value_Type is new APEX_Integer range
0 .. Max_Semaphore_Value;
type Semaphore_Status_Type is record
Current_Value : Semaphore_Value_Type;
Maximum_Value : Semaphore_Value_Type;
Waiting_Processes : APEX.Processes.Waiting_Range_Type;
end record;
procedure Create_Semaphore
(Semaphore_Name : in Semaphore_Name_Type;
Current_Value : in Semaphore_Value_Type;
Maximum_Value : in Semaphore_Value_Type;
Queuing_Discipline : in Queuing_Discipline_Type;
Semaphore_Id : out Semaphore_Id_Type;
Return_Code : out Return_Code_Type);
procedure Wait_Semaphore
(Semaphore_Id : in Semaphore_Id_Type;
Time_Out : in System_Time_Type;
Return_Code : out Return_Code_Type);
procedure Signal_Semaphore
(Semaphore_Id : in Semaphore_Id_Type;
Return_Code : out Return_Code_Type);
procedure Get_Semaphore_Id
(Semaphore_Name : in Semaphore_Name_Type;
Semaphore_Id : out Semaphore_Id_Type;
Return_Code : out Return_Code_Type);
procedure Get_Semaphore_Status
(Semaphore_Id : in Semaphore_Id_Type;
Semaphore_Status : out Semaphore_Status_Type;
Return_Code : out Return_Code_Type);
private
type Semaphore_Id_Type is new APEX_Integer;
Null_Semaphore_Id : constant Semaphore_Id_Type := 0;
pragma Convention (C, Semaphore_Status_Type);
-- POK BINDINGS
pragma Import (C, Create_Semaphore, "CREATE_SEMAPHORE");
pragma Import (C, Wait_Semaphore, "WAIT_SEMAPHORE");
pragma Import (C, Signal_Semaphore, "SIGNAL_SEMAPHORE");
pragma Import (C, Get_Semaphore_Id, "GET_SEMAPHORE_ID");
pragma Import (C, Get_Semaphore_Status, "GET_SEMAPHORE_STATUS");
-- END OF POK BINDINGS
end APEX.Semaphores;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Discrete_Ranges;
with Program.Elements.Component_Definitions;
with Program.Elements.Constrained_Array_Types;
with Program.Element_Visitors;
package Program.Nodes.Constrained_Array_Types is
pragma Preelaborate;
type Constrained_Array_Type is
new Program.Nodes.Node
and Program.Elements.Constrained_Array_Types.Constrained_Array_Type
and Program.Elements.Constrained_Array_Types
.Constrained_Array_Type_Text
with private;
function Create
(Array_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Index_Subtypes : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Of_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Component_Definition : not null Program.Elements.Component_Definitions
.Component_Definition_Access)
return Constrained_Array_Type;
type Implicit_Constrained_Array_Type is
new Program.Nodes.Node
and Program.Elements.Constrained_Array_Types.Constrained_Array_Type
with private;
function Create
(Index_Subtypes : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access;
Component_Definition : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Constrained_Array_Type
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Constrained_Array_Type is
abstract new Program.Nodes.Node
and Program.Elements.Constrained_Array_Types.Constrained_Array_Type
with record
Index_Subtypes : not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access;
Component_Definition : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
end record;
procedure Initialize
(Self : aliased in out Base_Constrained_Array_Type'Class);
overriding procedure Visit
(Self : not null access Base_Constrained_Array_Type;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Index_Subtypes
(Self : Base_Constrained_Array_Type)
return not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access;
overriding function Component_Definition
(Self : Base_Constrained_Array_Type)
return not null Program.Elements.Component_Definitions
.Component_Definition_Access;
overriding function Is_Constrained_Array_Type_Element
(Self : Base_Constrained_Array_Type)
return Boolean;
overriding function Is_Type_Definition_Element
(Self : Base_Constrained_Array_Type)
return Boolean;
overriding function Is_Definition_Element
(Self : Base_Constrained_Array_Type)
return Boolean;
type Constrained_Array_Type is
new Base_Constrained_Array_Type
and Program.Elements.Constrained_Array_Types.Constrained_Array_Type_Text
with record
Array_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Of_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Constrained_Array_Type_Text
(Self : aliased in out Constrained_Array_Type)
return Program.Elements.Constrained_Array_Types
.Constrained_Array_Type_Text_Access;
overriding function Array_Token
(Self : Constrained_Array_Type)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Left_Bracket_Token
(Self : Constrained_Array_Type)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Right_Bracket_Token
(Self : Constrained_Array_Type)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Of_Token
(Self : Constrained_Array_Type)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Constrained_Array_Type is
new Base_Constrained_Array_Type
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Constrained_Array_Type_Text
(Self : aliased in out Implicit_Constrained_Array_Type)
return Program.Elements.Constrained_Array_Types
.Constrained_Array_Type_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Constrained_Array_Type)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Constrained_Array_Type)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Constrained_Array_Type)
return Boolean;
end Program.Nodes.Constrained_Array_Types;
|
with Memory.RAM; use Memory.RAM;
package body Test.RAM is
procedure Run_Tests is
mem : RAM_Pointer := Create_RAM(latency => 100,
burst => 1,
word_size => 4,
word_count => 8);
other : Memory_Pointer := null;
begin
Check(Get_Time(mem.all) = 0);
Check(Get_Writes(mem.all) = 0);
Check(Get_Cost(mem.all) = 0);
Read(mem.all, 0, 4);
Check(Get_Time(mem.all) = 100);
Check(Get_Writes(mem.all) = 0);
Read(mem.all, 2, 4);
Check(Get_Time(mem.all) = 201);
Check(Get_Writes(mem.all) = 0);
Read(mem.all, 2, 2);
Check(Get_Time(mem.all) = 301);
Check(Get_Writes(mem.all) = 0);
Read(mem.all, 2, 3);
Check(Get_Time(mem.all) = 402);
Check(Get_Writes(mem.all) = 0);
Write(mem.all, 1, 8);
Check(Get_Time(mem.all) = 504);
Check(Get_Writes(mem.all) = 1);
Reset(mem.all, 0);
Check(Get_Time(mem.all) = 0);
Check(To_String(mem.all) =
"(ram (latency 100)(burst 1)(word_size 4)(word_count 8))");
other := Clone(mem.all);
Check(To_String(other.all) = To_String(mem.all));
Destroy(Memory_Pointer(mem));
Destroy(Memory_Pointer(other));
end Run_Tests;
end Test.RAM;
|
-- Copyright 2017-2021 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local url = require("url")
name = "Ask"
type = "scrape"
function start()
setratelimit(1)
end
function vertical(ctx, domain)
for i=1,10 do
local ok = scrape(ctx, {['url']=buildurl(domain, i)})
if not ok then
break
end
end
end
function buildurl(domain, pagenum)
local params = {
q="site:" .. domain .. " -www." .. domain,
o="0",
l="dir",
qo="pagination",
page=pagenum,
}
return "https://www.ask.com/web?" .. url.build_query_string(params)
end
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
package body AMF.Internals.Tables.OCL_Metamodel is
----------------
-- MM_OCL_OCL --
----------------
function MM_OCL_OCL return AMF.Internals.CMOF_Element is
begin
return Base + 133;
end MM_OCL_OCL;
----------------------------
-- MC_OCL_Collection_Kind --
----------------------------
function MC_OCL_Collection_Kind return AMF.Internals.CMOF_Element is
begin
return Base + 135;
end MC_OCL_Collection_Kind;
---------------------
-- MC_OCL_Any_Type --
---------------------
function MC_OCL_Any_Type return AMF.Internals.CMOF_Element is
begin
return Base + 1;
end MC_OCL_Any_Type;
---------------------------------------
-- MC_OCL_Association_Class_Call_Exp --
---------------------------------------
function MC_OCL_Association_Class_Call_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 2;
end MC_OCL_Association_Class_Call_Exp;
---------------------
-- MC_OCL_Bag_Type --
---------------------
function MC_OCL_Bag_Type return AMF.Internals.CMOF_Element is
begin
return Base + 3;
end MC_OCL_Bag_Type;
--------------------------------
-- MC_OCL_Boolean_Literal_Exp --
--------------------------------
function MC_OCL_Boolean_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 4;
end MC_OCL_Boolean_Literal_Exp;
---------------------
-- MC_OCL_Call_Exp --
---------------------
function MC_OCL_Call_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 5;
end MC_OCL_Call_Exp;
----------------------------
-- MC_OCL_Collection_Item --
----------------------------
function MC_OCL_Collection_Item return AMF.Internals.CMOF_Element is
begin
return Base + 6;
end MC_OCL_Collection_Item;
-----------------------------------
-- MC_OCL_Collection_Literal_Exp --
-----------------------------------
function MC_OCL_Collection_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 7;
end MC_OCL_Collection_Literal_Exp;
------------------------------------
-- MC_OCL_Collection_Literal_Part --
------------------------------------
function MC_OCL_Collection_Literal_Part return AMF.Internals.CMOF_Element is
begin
return Base + 8;
end MC_OCL_Collection_Literal_Part;
-----------------------------
-- MC_OCL_Collection_Range --
-----------------------------
function MC_OCL_Collection_Range return AMF.Internals.CMOF_Element is
begin
return Base + 9;
end MC_OCL_Collection_Range;
----------------------------
-- MC_OCL_Collection_Type --
----------------------------
function MC_OCL_Collection_Type return AMF.Internals.CMOF_Element is
begin
return Base + 10;
end MC_OCL_Collection_Type;
-----------------------------
-- MC_OCL_Enum_Literal_Exp --
-----------------------------
function MC_OCL_Enum_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 11;
end MC_OCL_Enum_Literal_Exp;
------------------------------
-- MC_OCL_Expression_In_Ocl --
------------------------------
function MC_OCL_Expression_In_Ocl return AMF.Internals.CMOF_Element is
begin
return Base + 12;
end MC_OCL_Expression_In_Ocl;
-----------------------------
-- MC_OCL_Feature_Call_Exp --
-----------------------------
function MC_OCL_Feature_Call_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 13;
end MC_OCL_Feature_Call_Exp;
-------------------
-- MC_OCL_If_Exp --
-------------------
function MC_OCL_If_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 14;
end MC_OCL_If_Exp;
--------------------------------
-- MC_OCL_Integer_Literal_Exp --
--------------------------------
function MC_OCL_Integer_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 15;
end MC_OCL_Integer_Literal_Exp;
--------------------------------
-- MC_OCL_Invalid_Literal_Exp --
--------------------------------
function MC_OCL_Invalid_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 16;
end MC_OCL_Invalid_Literal_Exp;
-------------------------
-- MC_OCL_Invalid_Type --
-------------------------
function MC_OCL_Invalid_Type return AMF.Internals.CMOF_Element is
begin
return Base + 17;
end MC_OCL_Invalid_Type;
------------------------
-- MC_OCL_Iterate_Exp --
------------------------
function MC_OCL_Iterate_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 18;
end MC_OCL_Iterate_Exp;
-------------------------
-- MC_OCL_Iterator_Exp --
-------------------------
function MC_OCL_Iterator_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 19;
end MC_OCL_Iterator_Exp;
--------------------
-- MC_OCL_Let_Exp --
--------------------
function MC_OCL_Let_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 20;
end MC_OCL_Let_Exp;
------------------------
-- MC_OCL_Literal_Exp --
------------------------
function MC_OCL_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 21;
end MC_OCL_Literal_Exp;
---------------------
-- MC_OCL_Loop_Exp --
---------------------
function MC_OCL_Loop_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 22;
end MC_OCL_Loop_Exp;
------------------------
-- MC_OCL_Message_Exp --
------------------------
function MC_OCL_Message_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 23;
end MC_OCL_Message_Exp;
-------------------------
-- MC_OCL_Message_Type --
-------------------------
function MC_OCL_Message_Type return AMF.Internals.CMOF_Element is
begin
return Base + 24;
end MC_OCL_Message_Type;
--------------------------------
-- MC_OCL_Navigation_Call_Exp --
--------------------------------
function MC_OCL_Navigation_Call_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 25;
end MC_OCL_Navigation_Call_Exp;
-----------------------------
-- MC_OCL_Null_Literal_Exp --
-----------------------------
function MC_OCL_Null_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 26;
end MC_OCL_Null_Literal_Exp;
--------------------------------
-- MC_OCL_Numeric_Literal_Exp --
--------------------------------
function MC_OCL_Numeric_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 27;
end MC_OCL_Numeric_Literal_Exp;
---------------------------
-- MC_OCL_Ocl_Expression --
---------------------------
function MC_OCL_Ocl_Expression return AMF.Internals.CMOF_Element is
begin
return Base + 28;
end MC_OCL_Ocl_Expression;
-------------------------------
-- MC_OCL_Operation_Call_Exp --
-------------------------------
function MC_OCL_Operation_Call_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 29;
end MC_OCL_Operation_Call_Exp;
-----------------------------
-- MC_OCL_Ordered_Set_Type --
-----------------------------
function MC_OCL_Ordered_Set_Type return AMF.Internals.CMOF_Element is
begin
return Base + 30;
end MC_OCL_Ordered_Set_Type;
----------------------------------
-- MC_OCL_Primitive_Literal_Exp --
----------------------------------
function MC_OCL_Primitive_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 31;
end MC_OCL_Primitive_Literal_Exp;
------------------------------
-- MC_OCL_Property_Call_Exp --
------------------------------
function MC_OCL_Property_Call_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 32;
end MC_OCL_Property_Call_Exp;
-----------------------------
-- MC_OCL_Real_Literal_Exp --
-----------------------------
function MC_OCL_Real_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 33;
end MC_OCL_Real_Literal_Exp;
--------------------------
-- MC_OCL_Sequence_Type --
--------------------------
function MC_OCL_Sequence_Type return AMF.Internals.CMOF_Element is
begin
return Base + 34;
end MC_OCL_Sequence_Type;
---------------------
-- MC_OCL_Set_Type --
---------------------
function MC_OCL_Set_Type return AMF.Internals.CMOF_Element is
begin
return Base + 35;
end MC_OCL_Set_Type;
----------------------
-- MC_OCL_State_Exp --
----------------------
function MC_OCL_State_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 36;
end MC_OCL_State_Exp;
-------------------------------
-- MC_OCL_String_Literal_Exp --
-------------------------------
function MC_OCL_String_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 37;
end MC_OCL_String_Literal_Exp;
------------------------------------
-- MC_OCL_Template_Parameter_Type --
------------------------------------
function MC_OCL_Template_Parameter_Type return AMF.Internals.CMOF_Element is
begin
return Base + 38;
end MC_OCL_Template_Parameter_Type;
------------------------------
-- MC_OCL_Tuple_Literal_Exp --
------------------------------
function MC_OCL_Tuple_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 39;
end MC_OCL_Tuple_Literal_Exp;
-------------------------------
-- MC_OCL_Tuple_Literal_Part --
-------------------------------
function MC_OCL_Tuple_Literal_Part return AMF.Internals.CMOF_Element is
begin
return Base + 40;
end MC_OCL_Tuple_Literal_Part;
-----------------------
-- MC_OCL_Tuple_Type --
-----------------------
function MC_OCL_Tuple_Type return AMF.Internals.CMOF_Element is
begin
return Base + 41;
end MC_OCL_Tuple_Type;
---------------------
-- MC_OCL_Type_Exp --
---------------------
function MC_OCL_Type_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 42;
end MC_OCL_Type_Exp;
------------------------------------------
-- MC_OCL_Unlimited_Natural_Literal_Exp --
------------------------------------------
function MC_OCL_Unlimited_Natural_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 43;
end MC_OCL_Unlimited_Natural_Literal_Exp;
----------------------------------
-- MC_OCL_Unspecified_Value_Exp --
----------------------------------
function MC_OCL_Unspecified_Value_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 44;
end MC_OCL_Unspecified_Value_Exp;
---------------------
-- MC_OCL_Variable --
---------------------
function MC_OCL_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 45;
end MC_OCL_Variable;
-------------------------
-- MC_OCL_Variable_Exp --
-------------------------
function MC_OCL_Variable_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 46;
end MC_OCL_Variable_Exp;
----------------------
-- MC_OCL_Void_Type --
----------------------
function MC_OCL_Void_Type return AMF.Internals.CMOF_Element is
begin
return Base + 47;
end MC_OCL_Void_Type;
----------------------------------------------------------------------------------
-- MP_OCL_Association_Class_Call_Exp_Referred_Association_Class_A_Referring_Exp --
----------------------------------------------------------------------------------
function MP_OCL_Association_Class_Call_Exp_Referred_Association_Class_A_Referring_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 55;
end MP_OCL_Association_Class_Call_Exp_Referred_Association_Class_A_Referring_Exp;
-----------------------------------------------
-- MP_OCL_Boolean_Literal_Exp_Boolean_Symbol --
-----------------------------------------------
function MP_OCL_Boolean_Literal_Exp_Boolean_Symbol return AMF.Internals.CMOF_Element is
begin
return Base + 56;
end MP_OCL_Boolean_Literal_Exp_Boolean_Symbol;
----------------------------------------------
-- MP_OCL_Call_Exp_Source_A_Applied_Element --
----------------------------------------------
function MP_OCL_Call_Exp_Source_A_Applied_Element return AMF.Internals.CMOF_Element is
begin
return Base + 57;
end MP_OCL_Call_Exp_Source_A_Applied_Element;
-----------------------------------------
-- MP_OCL_Collection_Item_Item_A_Item1 --
-----------------------------------------
function MP_OCL_Collection_Item_Item_A_Item1 return AMF.Internals.CMOF_Element is
begin
return Base + 58;
end MP_OCL_Collection_Item_Item_A_Item1;
----------------------------------------
-- MP_OCL_Collection_Literal_Exp_Kind --
----------------------------------------
function MP_OCL_Collection_Literal_Exp_Kind return AMF.Internals.CMOF_Element is
begin
return Base + 59;
end MP_OCL_Collection_Literal_Exp_Kind;
-----------------------------------------------
-- MP_OCL_Collection_Literal_Exp_Part_A_Exp1 --
-----------------------------------------------
function MP_OCL_Collection_Literal_Exp_Part_A_Exp1 return AMF.Internals.CMOF_Element is
begin
return Base + 48;
end MP_OCL_Collection_Literal_Exp_Part_A_Exp1;
-------------------------------------------------
-- MP_OCL_Collection_Range_First_A_First_Owner --
-------------------------------------------------
function MP_OCL_Collection_Range_First_A_First_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 60;
end MP_OCL_Collection_Range_First_A_First_Owner;
-----------------------------------------------
-- MP_OCL_Collection_Range_Last_A_Last_Owner --
-----------------------------------------------
function MP_OCL_Collection_Range_Last_A_Last_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 61;
end MP_OCL_Collection_Range_Last_A_Last_Owner;
-------------------------------------------------
-- MP_OCL_Collection_Type_Element_Type_A_Type1 --
-------------------------------------------------
function MP_OCL_Collection_Type_Element_Type_A_Type1 return AMF.Internals.CMOF_Element is
begin
return Base + 62;
end MP_OCL_Collection_Type_Element_Type_A_Type1;
-----------------------------------------------------------------
-- MP_OCL_Enum_Literal_Exp_Referred_Enum_Literal_A_Literal_Exp --
-----------------------------------------------------------------
function MP_OCL_Enum_Literal_Exp_Referred_Enum_Literal_A_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 63;
end MP_OCL_Enum_Literal_Exp_Referred_Enum_Literal_A_Literal_Exp;
---------------------------------------------------------------
-- MP_OCL_Expression_In_Ocl_Body_Expression_A_Top_Expression --
---------------------------------------------------------------
function MP_OCL_Expression_In_Ocl_Body_Expression_A_Top_Expression return AMF.Internals.CMOF_Element is
begin
return Base + 64;
end MP_OCL_Expression_In_Ocl_Body_Expression_A_Top_Expression;
------------------------------------------------------------
-- MP_OCL_Expression_In_Ocl_Context_Variable_A_Self_Owner --
------------------------------------------------------------
function MP_OCL_Expression_In_Ocl_Context_Variable_A_Self_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 65;
end MP_OCL_Expression_In_Ocl_Context_Variable_A_Self_Owner;
-----------------------------------------------------------------
-- MP_OCL_Expression_In_Ocl_Generated_Type_A_Owning_Classifier --
-----------------------------------------------------------------
function MP_OCL_Expression_In_Ocl_Generated_Type_A_Owning_Classifier return AMF.Internals.CMOF_Element is
begin
return Base + 66;
end MP_OCL_Expression_In_Ocl_Generated_Type_A_Owning_Classifier;
-------------------------------------------------------------
-- MP_OCL_Expression_In_Ocl_Parameter_Variable_A_Var_Owner --
-------------------------------------------------------------
function MP_OCL_Expression_In_Ocl_Parameter_Variable_A_Var_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 49;
end MP_OCL_Expression_In_Ocl_Parameter_Variable_A_Var_Owner;
-------------------------------------------------------------
-- MP_OCL_Expression_In_Ocl_Result_Variable_A_Result_Owner --
-------------------------------------------------------------
function MP_OCL_Expression_In_Ocl_Result_Variable_A_Result_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 67;
end MP_OCL_Expression_In_Ocl_Result_Variable_A_Result_Owner;
----------------------------------------
-- MP_OCL_If_Exp_Condition_A_If_Owner --
----------------------------------------
function MP_OCL_If_Exp_Condition_A_If_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 68;
end MP_OCL_If_Exp_Condition_A_If_Owner;
------------------------------------------------
-- MP_OCL_If_Exp_Else_Expression_A_Else_Owner --
------------------------------------------------
function MP_OCL_If_Exp_Else_Expression_A_Else_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 69;
end MP_OCL_If_Exp_Else_Expression_A_Else_Owner;
------------------------------------------------
-- MP_OCL_If_Exp_Then_Expression_A_Then_Owner --
------------------------------------------------
function MP_OCL_If_Exp_Then_Expression_A_Then_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 70;
end MP_OCL_If_Exp_Then_Expression_A_Then_Owner;
-----------------------------------------------
-- MP_OCL_Integer_Literal_Exp_Integer_Symbol --
-----------------------------------------------
function MP_OCL_Integer_Literal_Exp_Integer_Symbol return AMF.Internals.CMOF_Element is
begin
return Base + 71;
end MP_OCL_Integer_Literal_Exp_Integer_Symbol;
------------------------------------------
-- MP_OCL_Iterate_Exp_Result_A_Base_Exp --
------------------------------------------
function MP_OCL_Iterate_Exp_Result_A_Base_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 72;
end MP_OCL_Iterate_Exp_Result_A_Base_Exp;
------------------------------
-- MP_OCL_Let_Exp_In_A_Exp4 --
------------------------------
function MP_OCL_Let_Exp_In_A_Exp4 return AMF.Internals.CMOF_Element is
begin
return Base + 73;
end MP_OCL_Let_Exp_In_A_Exp4;
------------------------------------
-- MP_OCL_Let_Exp_Variable_A_Exp5 --
------------------------------------
function MP_OCL_Let_Exp_Variable_A_Exp5 return AMF.Internals.CMOF_Element is
begin
return Base + 74;
end MP_OCL_Let_Exp_Variable_A_Exp5;
--------------------------------------------
-- MP_OCL_Loop_Exp_Body_A_Loop_Body_Owner --
--------------------------------------------
function MP_OCL_Loop_Exp_Body_A_Loop_Body_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 75;
end MP_OCL_Loop_Exp_Body_A_Loop_Body_Owner;
-----------------------------------------
-- MP_OCL_Loop_Exp_Iterator_A_Loop_Exp --
-----------------------------------------
function MP_OCL_Loop_Exp_Iterator_A_Loop_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 50;
end MP_OCL_Loop_Exp_Iterator_A_Loop_Exp;
----------------------------------------
-- MP_OCL_Message_Exp_Argument_A_Exp2 --
----------------------------------------
function MP_OCL_Message_Exp_Argument_A_Exp2 return AMF.Internals.CMOF_Element is
begin
return Base + 51;
end MP_OCL_Message_Exp_Argument_A_Exp2;
------------------------------------------------
-- MP_OCL_Message_Exp_Called_Operation_A_Exp6 --
------------------------------------------------
function MP_OCL_Message_Exp_Called_Operation_A_Exp6 return AMF.Internals.CMOF_Element is
begin
return Base + 76;
end MP_OCL_Message_Exp_Called_Operation_A_Exp6;
-------------------------------------------
-- MP_OCL_Message_Exp_Sent_Signal_A_Exp7 --
-------------------------------------------
function MP_OCL_Message_Exp_Sent_Signal_A_Exp7 return AMF.Internals.CMOF_Element is
begin
return Base + 77;
end MP_OCL_Message_Exp_Sent_Signal_A_Exp7;
--------------------------------------
-- MP_OCL_Message_Exp_Target_A_Exp8 --
--------------------------------------
function MP_OCL_Message_Exp_Target_A_Exp8 return AMF.Internals.CMOF_Element is
begin
return Base + 78;
end MP_OCL_Message_Exp_Target_A_Exp8;
----------------------------------------------------
-- MP_OCL_Message_Type_Referred_Operation_A_Type2 --
----------------------------------------------------
function MP_OCL_Message_Type_Referred_Operation_A_Type2 return AMF.Internals.CMOF_Element is
begin
return Base + 79;
end MP_OCL_Message_Type_Referred_Operation_A_Type2;
-------------------------------------------------
-- MP_OCL_Message_Type_Referred_Signal_A_Type3 --
-------------------------------------------------
function MP_OCL_Message_Type_Referred_Signal_A_Type3 return AMF.Internals.CMOF_Element is
begin
return Base + 80;
end MP_OCL_Message_Type_Referred_Signal_A_Type3;
---------------------------------------------------------
-- MP_OCL_Navigation_Call_Exp_Navigation_Source_A_Exp9 --
---------------------------------------------------------
function MP_OCL_Navigation_Call_Exp_Navigation_Source_A_Exp9 return AMF.Internals.CMOF_Element is
begin
return Base + 81;
end MP_OCL_Navigation_Call_Exp_Navigation_Source_A_Exp9;
-------------------------------------------------------
-- MP_OCL_Navigation_Call_Exp_Qualifier_A_Parent_Nav --
-------------------------------------------------------
function MP_OCL_Navigation_Call_Exp_Qualifier_A_Parent_Nav return AMF.Internals.CMOF_Element is
begin
return Base + 52;
end MP_OCL_Navigation_Call_Exp_Qualifier_A_Parent_Nav;
------------------------------------------------------
-- MP_OCL_Operation_Call_Exp_Argument_A_Parent_Call --
------------------------------------------------------
function MP_OCL_Operation_Call_Exp_Argument_A_Parent_Call return AMF.Internals.CMOF_Element is
begin
return Base + 53;
end MP_OCL_Operation_Call_Exp_Argument_A_Parent_Call;
-----------------------------------------------------------------
-- MP_OCL_Operation_Call_Exp_Referred_Operation_A_Refering_Exp --
-----------------------------------------------------------------
function MP_OCL_Operation_Call_Exp_Referred_Operation_A_Refering_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 82;
end MP_OCL_Operation_Call_Exp_Referred_Operation_A_Refering_Exp;
---------------------------------------------------------------
-- MP_OCL_Property_Call_Exp_Referred_Property_A_Refering_Exp --
---------------------------------------------------------------
function MP_OCL_Property_Call_Exp_Referred_Property_A_Refering_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 83;
end MP_OCL_Property_Call_Exp_Referred_Property_A_Refering_Exp;
-----------------------------------------
-- MP_OCL_Real_Literal_Exp_Real_Symbol --
-----------------------------------------
function MP_OCL_Real_Literal_Exp_Real_Symbol return AMF.Internals.CMOF_Element is
begin
return Base + 84;
end MP_OCL_Real_Literal_Exp_Real_Symbol;
--------------------------------------------
-- MP_OCL_State_Exp_Referred_State_A_Exp9 --
--------------------------------------------
function MP_OCL_State_Exp_Referred_State_A_Exp9 return AMF.Internals.CMOF_Element is
begin
return Base + 85;
end MP_OCL_State_Exp_Referred_State_A_Exp9;
---------------------------------------------
-- MP_OCL_String_Literal_Exp_String_Symbol --
---------------------------------------------
function MP_OCL_String_Literal_Exp_String_Symbol return AMF.Internals.CMOF_Element is
begin
return Base + 86;
end MP_OCL_String_Literal_Exp_String_Symbol;
--------------------------------------------------
-- MP_OCL_Template_Parameter_Type_Specification --
--------------------------------------------------
function MP_OCL_Template_Parameter_Type_Specification return AMF.Internals.CMOF_Element is
begin
return Base + 87;
end MP_OCL_Template_Parameter_Type_Specification;
------------------------------------------
-- MP_OCL_Tuple_Literal_Exp_Part_A_Exp3 --
------------------------------------------
function MP_OCL_Tuple_Literal_Exp_Part_A_Exp3 return AMF.Internals.CMOF_Element is
begin
return Base + 54;
end MP_OCL_Tuple_Literal_Exp_Part_A_Exp3;
-------------------------------------------------
-- MP_OCL_Tuple_Literal_Part_Attribute_A_Part2 --
-------------------------------------------------
function MP_OCL_Tuple_Literal_Part_Attribute_A_Part2 return AMF.Internals.CMOF_Element is
begin
return Base + 88;
end MP_OCL_Tuple_Literal_Part_Attribute_A_Part2;
-------------------------------------------
-- MP_OCL_Type_Exp_Referred_Type_A_Exp11 --
-------------------------------------------
function MP_OCL_Type_Exp_Referred_Type_A_Exp11 return AMF.Internals.CMOF_Element is
begin
return Base + 89;
end MP_OCL_Type_Exp_Referred_Type_A_Exp11;
-------------------------------------------------------------------
-- MP_OCL_Unlimited_Natural_Literal_Exp_Unlimited_Natural_Symbol --
-------------------------------------------------------------------
function MP_OCL_Unlimited_Natural_Literal_Exp_Unlimited_Natural_Symbol return AMF.Internals.CMOF_Element is
begin
return Base + 90;
end MP_OCL_Unlimited_Natural_Literal_Exp_Unlimited_Natural_Symbol;
-----------------------------------------------------------
-- MP_OCL_Variable_Init_Expression_A_Initialized_Element --
-----------------------------------------------------------
function MP_OCL_Variable_Init_Expression_A_Initialized_Element return AMF.Internals.CMOF_Element is
begin
return Base + 91;
end MP_OCL_Variable_Init_Expression_A_Initialized_Element;
------------------------------------------------------
-- MP_OCL_Variable_Represented_Parameter_A_Variable --
------------------------------------------------------
function MP_OCL_Variable_Represented_Parameter_A_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 92;
end MP_OCL_Variable_Represented_Parameter_A_Variable;
----------------------------------------------------------
-- MP_OCL_Variable_Exp_Referred_Variable_A_Refering_Exp --
----------------------------------------------------------
function MP_OCL_Variable_Exp_Referred_Variable_A_Refering_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 93;
end MP_OCL_Variable_Exp_Referred_Variable_A_Refering_Exp;
-------------------------------------------------
-- MP_OCL_A_First_Owner_Collection_Range_First --
-------------------------------------------------
function MP_OCL_A_First_Owner_Collection_Range_First return AMF.Internals.CMOF_Element is
begin
return Base + 159;
end MP_OCL_A_First_Owner_Collection_Range_First;
--------------------------------------------
-- MP_OCL_A_Exp9_State_Exp_Referred_State --
--------------------------------------------
function MP_OCL_A_Exp9_State_Exp_Referred_State return AMF.Internals.CMOF_Element is
begin
return Base + 175;
end MP_OCL_A_Exp9_State_Exp_Referred_State;
-----------------------------------------------
-- MP_OCL_A_Last_Owner_Collection_Range_Last --
-----------------------------------------------
function MP_OCL_A_Last_Owner_Collection_Range_Last return AMF.Internals.CMOF_Element is
begin
return Base + 160;
end MP_OCL_A_Last_Owner_Collection_Range_Last;
---------------------------------------------------------------
-- MP_OCL_A_Refering_Exp_Property_Call_Exp_Referred_Property --
---------------------------------------------------------------
function MP_OCL_A_Refering_Exp_Property_Call_Exp_Referred_Property return AMF.Internals.CMOF_Element is
begin
return Base + 149;
end MP_OCL_A_Refering_Exp_Property_Call_Exp_Referred_Property;
-------------------------------------------------
-- MP_OCL_A_Type1_Collection_Type_Element_Type --
-------------------------------------------------
function MP_OCL_A_Type1_Collection_Type_Element_Type return AMF.Internals.CMOF_Element is
begin
return Base + 176;
end MP_OCL_A_Type1_Collection_Type_Element_Type;
------------------------------------------
-- MP_OCL_A_Exp3_Tuple_Literal_Exp_Part --
------------------------------------------
function MP_OCL_A_Exp3_Tuple_Literal_Exp_Part return AMF.Internals.CMOF_Element is
begin
return Base + 161;
end MP_OCL_A_Exp3_Tuple_Literal_Exp_Part;
----------------------------------------------------------
-- MP_OCL_A_Refering_Exp_Variable_Exp_Referred_Variable --
----------------------------------------------------------
function MP_OCL_A_Refering_Exp_Variable_Exp_Referred_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 150;
end MP_OCL_A_Refering_Exp_Variable_Exp_Referred_Variable;
-------------------------------------------
-- MP_OCL_A_Exp11_Type_Exp_Referred_Type --
-------------------------------------------
function MP_OCL_A_Exp11_Type_Exp_Referred_Type return AMF.Internals.CMOF_Element is
begin
return Base + 151;
end MP_OCL_A_Exp11_Type_Exp_Referred_Type;
----------------------------------------------
-- MP_OCL_A_Applied_Element_Call_Exp_Source --
----------------------------------------------
function MP_OCL_A_Applied_Element_Call_Exp_Source return AMF.Internals.CMOF_Element is
begin
return Base + 134;
end MP_OCL_A_Applied_Element_Call_Exp_Source;
---------------------------------------------------------------
-- MP_OCL_A_Top_Expression_Expression_In_Ocl_Body_Expression --
---------------------------------------------------------------
function MP_OCL_A_Top_Expression_Expression_In_Ocl_Body_Expression return AMF.Internals.CMOF_Element is
begin
return Base + 162;
end MP_OCL_A_Top_Expression_Expression_In_Ocl_Body_Expression;
--------------------------------------------
-- MP_OCL_A_Loop_Body_Owner_Loop_Exp_Body --
--------------------------------------------
function MP_OCL_A_Loop_Body_Owner_Loop_Exp_Body return AMF.Internals.CMOF_Element is
begin
return Base + 152;
end MP_OCL_A_Loop_Body_Owner_Loop_Exp_Body;
------------------------------------------------------------
-- MP_OCL_A_Self_Owner_Expression_In_Ocl_Context_Variable --
------------------------------------------------------------
function MP_OCL_A_Self_Owner_Expression_In_Ocl_Context_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 163;
end MP_OCL_A_Self_Owner_Expression_In_Ocl_Context_Variable;
-----------------------------------------
-- MP_OCL_A_Loop_Exp_Loop_Exp_Iterator --
-----------------------------------------
function MP_OCL_A_Loop_Exp_Loop_Exp_Iterator return AMF.Internals.CMOF_Element is
begin
return Base + 153;
end MP_OCL_A_Loop_Exp_Loop_Exp_Iterator;
-------------------------------------------------
-- MP_OCL_A_Type3_Message_Type_Referred_Signal --
-------------------------------------------------
function MP_OCL_A_Type3_Message_Type_Referred_Signal return AMF.Internals.CMOF_Element is
begin
return Base + 177;
end MP_OCL_A_Type3_Message_Type_Referred_Signal;
-------------------------------------------------------------
-- MP_OCL_A_Result_Owner_Expression_In_Ocl_Result_Variable --
-------------------------------------------------------------
function MP_OCL_A_Result_Owner_Expression_In_Ocl_Result_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 164;
end MP_OCL_A_Result_Owner_Expression_In_Ocl_Result_Variable;
----------------------------------------------------
-- MP_OCL_A_Type2_Message_Type_Referred_Operation --
----------------------------------------------------
function MP_OCL_A_Type2_Message_Type_Referred_Operation return AMF.Internals.CMOF_Element is
begin
return Base + 178;
end MP_OCL_A_Type2_Message_Type_Referred_Operation;
-------------------------------------------------------------
-- MP_OCL_A_Var_Owner_Expression_In_Ocl_Parameter_Variable --
-------------------------------------------------------------
function MP_OCL_A_Var_Owner_Expression_In_Ocl_Parameter_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 165;
end MP_OCL_A_Var_Owner_Expression_In_Ocl_Parameter_Variable;
-----------------------------------------------------------------
-- MP_OCL_A_Owning_Classifier_Expression_In_Ocl_Generated_Type --
-----------------------------------------------------------------
function MP_OCL_A_Owning_Classifier_Expression_In_Ocl_Generated_Type return AMF.Internals.CMOF_Element is
begin
return Base + 166;
end MP_OCL_A_Owning_Classifier_Expression_In_Ocl_Generated_Type;
-----------------------------------------------------------------
-- MP_OCL_A_Literal_Exp_Enum_Literal_Exp_Referred_Enum_Literal --
-----------------------------------------------------------------
function MP_OCL_A_Literal_Exp_Enum_Literal_Exp_Referred_Enum_Literal return AMF.Internals.CMOF_Element is
begin
return Base + 141;
end MP_OCL_A_Literal_Exp_Enum_Literal_Exp_Referred_Enum_Literal;
-------------------------------------------------
-- MP_OCL_A_Part2_Tuple_Literal_Part_Attribute --
-------------------------------------------------
function MP_OCL_A_Part2_Tuple_Literal_Part_Attribute return AMF.Internals.CMOF_Element is
begin
return Base + 167;
end MP_OCL_A_Part2_Tuple_Literal_Part_Attribute;
-------------------------------------------------------
-- MP_OCL_A_Parent_Nav_Navigation_Call_Exp_Qualifier --
-------------------------------------------------------
function MP_OCL_A_Parent_Nav_Navigation_Call_Exp_Qualifier return AMF.Internals.CMOF_Element is
begin
return Base + 168;
end MP_OCL_A_Parent_Nav_Navigation_Call_Exp_Qualifier;
------------------------------------------------------
-- MP_OCL_A_Parent_Call_Operation_Call_Exp_Argument --
------------------------------------------------------
function MP_OCL_A_Parent_Call_Operation_Call_Exp_Argument return AMF.Internals.CMOF_Element is
begin
return Base + 154;
end MP_OCL_A_Parent_Call_Operation_Call_Exp_Argument;
---------------------------------------------------------
-- MP_OCL_A_Exp9_Navigation_Call_Exp_Navigation_Source --
---------------------------------------------------------
function MP_OCL_A_Exp9_Navigation_Call_Exp_Navigation_Source return AMF.Internals.CMOF_Element is
begin
return Base + 169;
end MP_OCL_A_Exp9_Navigation_Call_Exp_Navigation_Source;
-----------------------------------------------------------------
-- MP_OCL_A_Refering_Exp_Operation_Call_Exp_Referred_Operation --
-----------------------------------------------------------------
function MP_OCL_A_Refering_Exp_Operation_Call_Exp_Referred_Operation return AMF.Internals.CMOF_Element is
begin
return Base + 155;
end MP_OCL_A_Refering_Exp_Operation_Call_Exp_Referred_Operation;
----------------------------------------
-- MP_OCL_A_If_Owner_If_Exp_Condition --
----------------------------------------
function MP_OCL_A_If_Owner_If_Exp_Condition return AMF.Internals.CMOF_Element is
begin
return Base + 142;
end MP_OCL_A_If_Owner_If_Exp_Condition;
------------------------------------------------
-- MP_OCL_A_Then_Owner_If_Exp_Then_Expression --
------------------------------------------------
function MP_OCL_A_Then_Owner_If_Exp_Then_Expression return AMF.Internals.CMOF_Element is
begin
return Base + 143;
end MP_OCL_A_Then_Owner_If_Exp_Then_Expression;
----------------------------------------------------------------------------------
-- MP_OCL_A_Referring_Exp_Association_Class_Call_Exp_Referred_Association_Class --
----------------------------------------------------------------------------------
function MP_OCL_A_Referring_Exp_Association_Class_Call_Exp_Referred_Association_Class return AMF.Internals.CMOF_Element is
begin
return Base + 170;
end MP_OCL_A_Referring_Exp_Association_Class_Call_Exp_Referred_Association_Class;
------------------------------------------------
-- MP_OCL_A_Else_Owner_If_Exp_Else_Expression --
------------------------------------------------
function MP_OCL_A_Else_Owner_If_Exp_Else_Expression return AMF.Internals.CMOF_Element is
begin
return Base + 144;
end MP_OCL_A_Else_Owner_If_Exp_Else_Expression;
------------------------------------------
-- MP_OCL_A_Base_Exp_Iterate_Exp_Result --
------------------------------------------
function MP_OCL_A_Base_Exp_Iterate_Exp_Result return AMF.Internals.CMOF_Element is
begin
return Base + 156;
end MP_OCL_A_Base_Exp_Iterate_Exp_Result;
------------------------------
-- MP_OCL_A_Exp4_Let_Exp_In --
------------------------------
function MP_OCL_A_Exp4_Let_Exp_In return AMF.Internals.CMOF_Element is
begin
return Base + 145;
end MP_OCL_A_Exp4_Let_Exp_In;
--------------------------------------
-- MP_OCL_A_Exp8_Message_Exp_Target --
--------------------------------------
function MP_OCL_A_Exp8_Message_Exp_Target return AMF.Internals.CMOF_Element is
begin
return Base + 171;
end MP_OCL_A_Exp8_Message_Exp_Target;
-----------------------------------------------
-- MP_OCL_A_Exp1_Collection_Literal_Exp_Part --
-----------------------------------------------
function MP_OCL_A_Exp1_Collection_Literal_Exp_Part return AMF.Internals.CMOF_Element is
begin
return Base + 157;
end MP_OCL_A_Exp1_Collection_Literal_Exp_Part;
----------------------------------------
-- MP_OCL_A_Exp2_Message_Exp_Argument --
----------------------------------------
function MP_OCL_A_Exp2_Message_Exp_Argument return AMF.Internals.CMOF_Element is
begin
return Base + 172;
end MP_OCL_A_Exp2_Message_Exp_Argument;
------------------------------------
-- MP_OCL_A_Exp5_Let_Exp_Variable --
------------------------------------
function MP_OCL_A_Exp5_Let_Exp_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 146;
end MP_OCL_A_Exp5_Let_Exp_Variable;
------------------------------------------------
-- MP_OCL_A_Exp6_Message_Exp_Called_Operation --
------------------------------------------------
function MP_OCL_A_Exp6_Message_Exp_Called_Operation return AMF.Internals.CMOF_Element is
begin
return Base + 173;
end MP_OCL_A_Exp6_Message_Exp_Called_Operation;
-----------------------------------------
-- MP_OCL_A_Item1_Collection_Item_Item --
-----------------------------------------
function MP_OCL_A_Item1_Collection_Item_Item return AMF.Internals.CMOF_Element is
begin
return Base + 158;
end MP_OCL_A_Item1_Collection_Item_Item;
-----------------------------------------------------------
-- MP_OCL_A_Initialized_Element_Variable_Init_Expression --
-----------------------------------------------------------
function MP_OCL_A_Initialized_Element_Variable_Init_Expression return AMF.Internals.CMOF_Element is
begin
return Base + 147;
end MP_OCL_A_Initialized_Element_Variable_Init_Expression;
-------------------------------------------
-- MP_OCL_A_Exp7_Message_Exp_Sent_Signal --
-------------------------------------------
function MP_OCL_A_Exp7_Message_Exp_Sent_Signal return AMF.Internals.CMOF_Element is
begin
return Base + 174;
end MP_OCL_A_Exp7_Message_Exp_Sent_Signal;
------------------------------------------------------
-- MP_OCL_A_Variable_Variable_Represented_Parameter --
------------------------------------------------------
function MP_OCL_A_Variable_Variable_Represented_Parameter return AMF.Internals.CMOF_Element is
begin
return Base + 148;
end MP_OCL_A_Variable_Variable_Represented_Parameter;
-----------------------------------------------
-- MA_OCL_Collection_Range_First_First_Owner --
-----------------------------------------------
function MA_OCL_Collection_Range_First_First_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 94;
end MA_OCL_Collection_Range_First_First_Owner;
------------------------------------------
-- MA_OCL_State_Exp_Referred_State_Exp9 --
------------------------------------------
function MA_OCL_State_Exp_Referred_State_Exp9 return AMF.Internals.CMOF_Element is
begin
return Base + 95;
end MA_OCL_State_Exp_Referred_State_Exp9;
---------------------------------------------
-- MA_OCL_Collection_Range_Last_Last_Owner --
---------------------------------------------
function MA_OCL_Collection_Range_Last_Last_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 96;
end MA_OCL_Collection_Range_Last_Last_Owner;
-------------------------------------------------------------
-- MA_OCL_Property_Call_Exp_Referred_Property_Refering_Exp --
-------------------------------------------------------------
function MA_OCL_Property_Call_Exp_Referred_Property_Refering_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 97;
end MA_OCL_Property_Call_Exp_Referred_Property_Refering_Exp;
-----------------------------------------------
-- MA_OCL_Collection_Type_Element_Type_Type1 --
-----------------------------------------------
function MA_OCL_Collection_Type_Element_Type_Type1 return AMF.Internals.CMOF_Element is
begin
return Base + 98;
end MA_OCL_Collection_Type_Element_Type_Type1;
----------------------------------------
-- MA_OCL_Tuple_Literal_Exp_Part_Exp3 --
----------------------------------------
function MA_OCL_Tuple_Literal_Exp_Part_Exp3 return AMF.Internals.CMOF_Element is
begin
return Base + 99;
end MA_OCL_Tuple_Literal_Exp_Part_Exp3;
--------------------------------------------------------
-- MA_OCL_Variable_Exp_Referred_Variable_Refering_Exp --
--------------------------------------------------------
function MA_OCL_Variable_Exp_Referred_Variable_Refering_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 100;
end MA_OCL_Variable_Exp_Referred_Variable_Refering_Exp;
-----------------------------------------
-- MA_OCL_Type_Exp_Referred_Type_Exp11 --
-----------------------------------------
function MA_OCL_Type_Exp_Referred_Type_Exp11 return AMF.Internals.CMOF_Element is
begin
return Base + 101;
end MA_OCL_Type_Exp_Referred_Type_Exp11;
--------------------------------------------
-- MA_OCL_Call_Exp_Source_Applied_Element --
--------------------------------------------
function MA_OCL_Call_Exp_Source_Applied_Element return AMF.Internals.CMOF_Element is
begin
return Base + 102;
end MA_OCL_Call_Exp_Source_Applied_Element;
-------------------------------------------------------------
-- MA_OCL_Expression_In_Ocl_Body_Expression_Top_Expression --
-------------------------------------------------------------
function MA_OCL_Expression_In_Ocl_Body_Expression_Top_Expression return AMF.Internals.CMOF_Element is
begin
return Base + 103;
end MA_OCL_Expression_In_Ocl_Body_Expression_Top_Expression;
------------------------------------------
-- MA_OCL_Loop_Exp_Body_Loop_Body_Owner --
------------------------------------------
function MA_OCL_Loop_Exp_Body_Loop_Body_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 104;
end MA_OCL_Loop_Exp_Body_Loop_Body_Owner;
----------------------------------------------------------
-- MA_OCL_Expression_In_Ocl_Context_Variable_Self_Owner --
----------------------------------------------------------
function MA_OCL_Expression_In_Ocl_Context_Variable_Self_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 105;
end MA_OCL_Expression_In_Ocl_Context_Variable_Self_Owner;
---------------------------------------
-- MA_OCL_Loop_Exp_Iterator_Loop_Exp --
---------------------------------------
function MA_OCL_Loop_Exp_Iterator_Loop_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 106;
end MA_OCL_Loop_Exp_Iterator_Loop_Exp;
-----------------------------------------------
-- MA_OCL_Message_Type_Referred_Signal_Type3 --
-----------------------------------------------
function MA_OCL_Message_Type_Referred_Signal_Type3 return AMF.Internals.CMOF_Element is
begin
return Base + 107;
end MA_OCL_Message_Type_Referred_Signal_Type3;
-----------------------------------------------------------
-- MA_OCL_Expression_In_Ocl_Result_Variable_Result_Owner --
-----------------------------------------------------------
function MA_OCL_Expression_In_Ocl_Result_Variable_Result_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 108;
end MA_OCL_Expression_In_Ocl_Result_Variable_Result_Owner;
--------------------------------------------------
-- MA_OCL_Message_Type_Referred_Operation_Type2 --
--------------------------------------------------
function MA_OCL_Message_Type_Referred_Operation_Type2 return AMF.Internals.CMOF_Element is
begin
return Base + 109;
end MA_OCL_Message_Type_Referred_Operation_Type2;
-----------------------------------------------------------
-- MA_OCL_Expression_In_Ocl_Parameter_Variable_Var_Owner --
-----------------------------------------------------------
function MA_OCL_Expression_In_Ocl_Parameter_Variable_Var_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 110;
end MA_OCL_Expression_In_Ocl_Parameter_Variable_Var_Owner;
---------------------------------------------------------------
-- MA_OCL_Expression_In_Ocl_Generated_Type_Owning_Classifier --
---------------------------------------------------------------
function MA_OCL_Expression_In_Ocl_Generated_Type_Owning_Classifier return AMF.Internals.CMOF_Element is
begin
return Base + 111;
end MA_OCL_Expression_In_Ocl_Generated_Type_Owning_Classifier;
---------------------------------------------------------------
-- MA_OCL_Enum_Literal_Exp_Referred_Enum_Literal_Literal_Exp --
---------------------------------------------------------------
function MA_OCL_Enum_Literal_Exp_Referred_Enum_Literal_Literal_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 112;
end MA_OCL_Enum_Literal_Exp_Referred_Enum_Literal_Literal_Exp;
-----------------------------------------------
-- MA_OCL_Tuple_Literal_Part_Attribute_Part2 --
-----------------------------------------------
function MA_OCL_Tuple_Literal_Part_Attribute_Part2 return AMF.Internals.CMOF_Element is
begin
return Base + 113;
end MA_OCL_Tuple_Literal_Part_Attribute_Part2;
-----------------------------------------------------
-- MA_OCL_Navigation_Call_Exp_Qualifier_Parent_Nav --
-----------------------------------------------------
function MA_OCL_Navigation_Call_Exp_Qualifier_Parent_Nav return AMF.Internals.CMOF_Element is
begin
return Base + 114;
end MA_OCL_Navigation_Call_Exp_Qualifier_Parent_Nav;
----------------------------------------------------
-- MA_OCL_Operation_Call_Exp_Argument_Parent_Call --
----------------------------------------------------
function MA_OCL_Operation_Call_Exp_Argument_Parent_Call return AMF.Internals.CMOF_Element is
begin
return Base + 115;
end MA_OCL_Operation_Call_Exp_Argument_Parent_Call;
-------------------------------------------------------
-- MA_OCL_Navigation_Call_Exp_Navigation_Source_Exp9 --
-------------------------------------------------------
function MA_OCL_Navigation_Call_Exp_Navigation_Source_Exp9 return AMF.Internals.CMOF_Element is
begin
return Base + 116;
end MA_OCL_Navigation_Call_Exp_Navigation_Source_Exp9;
---------------------------------------------------------------
-- MA_OCL_Operation_Call_Exp_Referred_Operation_Refering_Exp --
---------------------------------------------------------------
function MA_OCL_Operation_Call_Exp_Referred_Operation_Refering_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 117;
end MA_OCL_Operation_Call_Exp_Referred_Operation_Refering_Exp;
--------------------------------------
-- MA_OCL_If_Exp_Condition_If_Owner --
--------------------------------------
function MA_OCL_If_Exp_Condition_If_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 118;
end MA_OCL_If_Exp_Condition_If_Owner;
----------------------------------------------
-- MA_OCL_If_Exp_Then_Expression_Then_Owner --
----------------------------------------------
function MA_OCL_If_Exp_Then_Expression_Then_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 119;
end MA_OCL_If_Exp_Then_Expression_Then_Owner;
--------------------------------------------------------------------------------
-- MA_OCL_Association_Class_Call_Exp_Referred_Association_Class_Referring_Exp --
--------------------------------------------------------------------------------
function MA_OCL_Association_Class_Call_Exp_Referred_Association_Class_Referring_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 120;
end MA_OCL_Association_Class_Call_Exp_Referred_Association_Class_Referring_Exp;
----------------------------------------------
-- MA_OCL_If_Exp_Else_Expression_Else_Owner --
----------------------------------------------
function MA_OCL_If_Exp_Else_Expression_Else_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 121;
end MA_OCL_If_Exp_Else_Expression_Else_Owner;
----------------------------------------
-- MA_OCL_Iterate_Exp_Result_Base_Exp --
----------------------------------------
function MA_OCL_Iterate_Exp_Result_Base_Exp return AMF.Internals.CMOF_Element is
begin
return Base + 122;
end MA_OCL_Iterate_Exp_Result_Base_Exp;
----------------------------
-- MA_OCL_Let_Exp_In_Exp4 --
----------------------------
function MA_OCL_Let_Exp_In_Exp4 return AMF.Internals.CMOF_Element is
begin
return Base + 123;
end MA_OCL_Let_Exp_In_Exp4;
------------------------------------
-- MA_OCL_Message_Exp_Target_Exp8 --
------------------------------------
function MA_OCL_Message_Exp_Target_Exp8 return AMF.Internals.CMOF_Element is
begin
return Base + 124;
end MA_OCL_Message_Exp_Target_Exp8;
---------------------------------------------
-- MA_OCL_Collection_Literal_Exp_Part_Exp1 --
---------------------------------------------
function MA_OCL_Collection_Literal_Exp_Part_Exp1 return AMF.Internals.CMOF_Element is
begin
return Base + 125;
end MA_OCL_Collection_Literal_Exp_Part_Exp1;
--------------------------------------
-- MA_OCL_Message_Exp_Argument_Exp2 --
--------------------------------------
function MA_OCL_Message_Exp_Argument_Exp2 return AMF.Internals.CMOF_Element is
begin
return Base + 126;
end MA_OCL_Message_Exp_Argument_Exp2;
----------------------------------
-- MA_OCL_Let_Exp_Variable_Exp5 --
----------------------------------
function MA_OCL_Let_Exp_Variable_Exp5 return AMF.Internals.CMOF_Element is
begin
return Base + 127;
end MA_OCL_Let_Exp_Variable_Exp5;
----------------------------------------------
-- MA_OCL_Message_Exp_Called_Operation_Exp6 --
----------------------------------------------
function MA_OCL_Message_Exp_Called_Operation_Exp6 return AMF.Internals.CMOF_Element is
begin
return Base + 128;
end MA_OCL_Message_Exp_Called_Operation_Exp6;
---------------------------------------
-- MA_OCL_Collection_Item_Item_Item1 --
---------------------------------------
function MA_OCL_Collection_Item_Item_Item1 return AMF.Internals.CMOF_Element is
begin
return Base + 129;
end MA_OCL_Collection_Item_Item_Item1;
---------------------------------------------------------
-- MA_OCL_Variable_Init_Expression_Initialized_Element --
---------------------------------------------------------
function MA_OCL_Variable_Init_Expression_Initialized_Element return AMF.Internals.CMOF_Element is
begin
return Base + 130;
end MA_OCL_Variable_Init_Expression_Initialized_Element;
-----------------------------------------
-- MA_OCL_Message_Exp_Sent_Signal_Exp7 --
-----------------------------------------
function MA_OCL_Message_Exp_Sent_Signal_Exp7 return AMF.Internals.CMOF_Element is
begin
return Base + 131;
end MA_OCL_Message_Exp_Sent_Signal_Exp7;
----------------------------------------------------
-- MA_OCL_Variable_Represented_Parameter_Variable --
----------------------------------------------------
function MA_OCL_Variable_Represented_Parameter_Variable return AMF.Internals.CMOF_Element is
begin
return Base + 132;
end MA_OCL_Variable_Represented_Parameter_Variable;
------------
-- MB_OCL --
------------
function MB_OCL return AMF.Internals.AMF_Element is
begin
return Base;
end MB_OCL;
------------
-- MB_OCL --
------------
function ML_OCL return AMF.Internals.AMF_Element is
begin
return Base + 178;
end ML_OCL;
end AMF.Internals.Tables.OCL_Metamodel;
|
-------------------------------------------------------------------------------
-- Copyright 2021, The Trendy Terminal Developers (see AUTHORS file)
-- 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;
with Ada.Unchecked_Conversion;
with Interfaces.C.Strings;
with System;
with Trendy_Terminal.Linux;
with Trendy_Terminal.Maps;
package body Trendy_Terminal.Platform is
use type Linux.BOOL;
---------------------------------------------------------------------------
--
---------------------------------------------------------------------------
type IOStream is record
File : Linux.FILE_Ptr;
File_Descriptor : Linux.FD;
Settings : aliased Linux.Termios;
end record;
---------------------------------------------------------------------------
-- Original settings
---------------------------------------------------------------------------
Original_Input_Setting, Original_Output_Setting, Original_Error_Setting :
Linux.Termios;
---------------------------------------------------------------------------
-- The triad of I/O streams.
---------------------------------------------------------------------------
Std_Input, Std_Output, Std_Error : IOStream;
function Load_Terminal (File_Descriptor : Linux.FD; Terminal : not null access
Linux.Termios) return Boolean is
begin
if Linux.isatty (File_Descriptor) = 0 then
return False;
end if;
if Linux.tcgetattr (File_Descriptor, Terminal.all'Address) /= 0 then
return False;
end if;
return True;
end Load_Terminal;
function Make_Handle (File_Descriptor : Linux.FILE_Ptr; Handle : out IOStream) return Boolean is
begin
Handle.File := File_Descriptor;
Handle.File_Descriptor := Linux.fileno (Handle.File);
return Load_Terminal (Handle.File_Descriptor, Handle.Settings'Unchecked_Access);
end Make_Handle;
procedure Require_Settings_Change (Stream : IOStream) with
Pre => Linux.isatty (Stream.File_Descriptor) /= 0
is
begin
if Linux.tcsetattr (Stream.File_Descriptor, Linux.TCSANOW, Stream.Settings'Address) /= 0 then
Ada.Text_IO.Put_Line ("Unable to change settings.");
end if;
end Require_Settings_Change;
function Init return Boolean is
-- Initializes and captures the original settings for the terminal so they can
-- be restored when the system is shutdown.
begin
if not Make_Handle (Linux.stdin, Std_Input) or else not Make_Handle (Linux.stdout, Std_Output)
or else not Make_Handle (Linux.stderr, Std_Error) then
Ada.Text_IO.Put_Line ("Unable to get standard stream handles.");
end if;
-- Save the startup settings.
Original_Input_Setting := Std_Input.Settings;
Original_Output_Setting := Std_Output.Settings;
Original_Error_Setting := Std_Error.Settings;
return True;
end Init;
procedure Shutdown is
begin
Std_Input.Settings := Original_Input_Setting;
Std_Output.Settings := Original_Output_Setting;
Std_Error.Settings := Original_Error_Setting;
Require_Settings_Change (Std_Input);
Require_Settings_Change (Std_Output);
Require_Settings_Change (Std_Error);
end Shutdown;
procedure Set (Setting : Platform.Input_Setting; Enabled : Boolean) is
begin
case Setting is
when Platform.Echo =>
Std_Input.Settings.c_lflag (Linux.ECHO) := Enabled;
when Platform.Line_Input =>
Std_Input.Settings.c_lflag (Linux.ICANON) := Enabled;
when Platform.Signals_As_Input =>
Std_Input.Settings.c_lflag (Linux.ISIG) := not Enabled;
end case;
Require_Settings_Change (Std_Input);
end Set;
procedure Set (Setting : Output_Setting; Enabled : Boolean) is
begin
pragma Unreferenced (Enabled);
case Setting is
when Escape_Sequences =>
null;
-- nothing to do here
end case;
end Set;
procedure Put (C : Character) renames Ada.Text_IO.Put;
procedure Put (S : String) renames Ada.Text_IO.Put;
type VOIDP is new Interfaces.C.Strings.chars_ptr;
function Read (File_Descriptor : Linux.FD; Buffer : VOIDP; Buffer_Size : Natural) return Integer
with Import => True,
Convention => C;
-- Gets an entire input line from one keypress. E.g. all the characters
-- received for a controlling keypress, such as an arrow key.
function Get_Input return String is
Buffer_Size : constant := 512;
Buffer : aliased Interfaces.C.char_array := (1 .. Interfaces.C.size_t(Buffer_Size) => Interfaces.C.nul);
Chars_Read : Integer;
use all type Interfaces.C.size_t;
begin
Chars_Read := Read (Linux.fileno (Std_Input.File),
VOIDP (Interfaces.C.Strings.To_Chars_Ptr (Buffer'Unchecked_Access)),
Buffer_Size);
if Chars_Read > 0 then
return Interfaces.C.To_Ada(Buffer(1 .. Interfaces.C.size_t(Chars_Read) + 1));
else
return "";
end if;
end Get_Input;
function End_Of_Line return String is
begin
return (1 => Maps.Characters.LF);
end End_Of_Line;
procedure Print_Configuration is
function To_Integer is new Ada.Unchecked_Conversion (Linux.Local_Flags, Integer);
begin
Ada.Text_IO.Put_Line ("Input Mode: " & To_Integer (Std_Input.Settings.c_lflag)'Image);
Ada.Text_IO.Put_Line ("Output Mode: " & To_Integer (Std_Output.Settings.c_lflag)'Image);
Ada.Text_IO.Put_Line ("Error Mode: " & To_Integer (Std_Error.Settings.c_lflag)'Image);
end Print_Configuration;
end Trendy_Terminal.Platform;
|
pragma License (Unrestricted);
-- implementation unit specialized for Linux
function System.System_Allocators.Allocated_Size (
Storage_Address : Address)
return Storage_Elements.Storage_Count;
pragma Preelaborate (System.System_Allocators.Allocated_Size);
pragma Inline (System.System_Allocators.Allocated_Size);
|
--
-- 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.interrupts;
package ewok.posthook
with spark_mode => off
is
type t_args is new unsigned_32_array (1 .. 2);
type t_args_access is access all t_args;
-- Execute posthook for a given interrupt
procedure exec
(intr : in soc.interrupts.t_interrupt;
status : out unsigned_32;
data : out unsigned_32);
end ewok.posthook;
|
------------------------------------------------------------------------------
-- G P S --
-- --
-- Copyright (C) 2001-2016, AdaCore --
-- --
-- This 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. This software is distributed in the hope that it will be useful, --
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN- --
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public --
-- License for more details. You should have received a copy of the GNU --
-- General Public License distributed with this software; see file --
-- COPYING3. If not, go to http://www.gnu.org/licenses for a complete copy --
-- of the license. --
------------------------------------------------------------------------------
generic
type Generic_Type is private;
package Generic_Stack is
type Simple_Stack is private;
type Generic_Type_Access is access all Generic_Type;
Stack_Empty : exception;
-- Raised by the functions below when stack is empty.
procedure Push (Stack : in out Simple_Stack; Value : Generic_Type);
-- Push Value on top of Stack.
procedure Pop (Stack : in out Simple_Stack; Value : out Generic_Type);
-- Remove the value on top of Stack and return it in Value.
-- Raise Stack_Empty if Stack is empty.
procedure Pop (Stack : in out Simple_Stack);
-- Remove the value on top of Stack.
-- Raise Stack_Empty if Stack is empty.
function Top (Stack : Simple_Stack) return Generic_Type_Access;
-- Return a pointer to the top of the stack.
-- Note that modifying the contents of the returned pointer will
-- modify the contents of the stack.
-- Raise Stack_Empty if Stack is empty.
function Next (Stack : Simple_Stack) return Generic_Type_Access;
-- Return a pointer to the next item of the stack, or null if none.
procedure Traverse_Stack
(Stack : Simple_Stack;
Callback : access function (Obj : Generic_Type) return Boolean);
-- Traverse Stack and call Callback on each element of the stack.
-- Stop when Stack is traversed or when Callback returns False.
procedure Clear (Stack : in out Simple_Stack);
-- Clear the contents of stack. This automatically frees memory for Stack
-- as well.
function Is_Empty (Stack : Simple_Stack) return Boolean;
-- Returns True if the stack is empty.
private
type Type_Array is array (Positive range <>) of aliased Generic_Type;
type Type_Array_Access is access all Type_Array;
type Simple_Stack is record
Values : Type_Array_Access; -- Index starts at 1
Last : Natural := 0; -- Last significant element in Values
end record;
pragma Inline (Push);
pragma Inline (Pop);
pragma Inline (Top);
pragma Inline (Next);
end Generic_Stack;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.String_Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.Collections;
with AMF.UML.General_Orderings.Collections;
with AMF.UML.Interaction_Constraints;
with AMF.UML.Interaction_Fragments.Collections;
with AMF.UML.Interaction_Operands;
with AMF.UML.Interactions;
with AMF.UML.Lifelines.Collections;
with AMF.UML.Named_Elements.Collections;
with AMF.UML.Namespaces;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.String_Expressions;
with AMF.Visitors;
package AMF.Internals.UML_Interaction_Operands is
type UML_Interaction_Operand_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Interaction_Operands.UML_Interaction_Operand with null record;
overriding function Get_Fragment
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Interaction_Fragments.Collections.Ordered_Set_Of_UML_Interaction_Fragment;
-- Getter of InteractionOperand::fragment.
--
-- The fragments of the operand.
overriding function Get_Guard
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Interaction_Constraints.UML_Interaction_Constraint_Access;
-- Getter of InteractionOperand::guard.
--
-- Constraint of the operand.
overriding procedure Set_Guard
(Self : not null access UML_Interaction_Operand_Proxy;
To : AMF.UML.Interaction_Constraints.UML_Interaction_Constraint_Access);
-- Setter of InteractionOperand::guard.
--
-- Constraint of the operand.
overriding function Get_Covered
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Lifelines.Collections.Set_Of_UML_Lifeline;
-- Getter of InteractionFragment::covered.
--
-- References the Lifelines that the InteractionFragment involves.
overriding function Get_Enclosing_Interaction
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Interactions.UML_Interaction_Access;
-- Getter of InteractionFragment::enclosingInteraction.
--
-- The Interaction enclosing this InteractionFragment.
overriding procedure Set_Enclosing_Interaction
(Self : not null access UML_Interaction_Operand_Proxy;
To : AMF.UML.Interactions.UML_Interaction_Access);
-- Setter of InteractionFragment::enclosingInteraction.
--
-- The Interaction enclosing this InteractionFragment.
overriding function Get_Enclosing_Operand
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access;
-- Getter of InteractionFragment::enclosingOperand.
--
-- The operand enclosing this InteractionFragment (they may nest
-- recursively)
overriding procedure Set_Enclosing_Operand
(Self : not null access UML_Interaction_Operand_Proxy;
To : AMF.UML.Interaction_Operands.UML_Interaction_Operand_Access);
-- Setter of InteractionFragment::enclosingOperand.
--
-- The operand enclosing this InteractionFragment (they may nest
-- recursively)
overriding function Get_General_Ordering
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.General_Orderings.Collections.Set_Of_UML_General_Ordering;
-- Getter of InteractionFragment::generalOrdering.
--
-- The general ordering relationships contained in this fragment.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Interaction_Operand_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Get_Element_Import
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import;
-- Getter of Namespace::elementImport.
--
-- References the ElementImports owned by the Namespace.
overriding function Get_Imported_Member
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Getter of Namespace::importedMember.
--
-- References the PackageableElements that are members of this Namespace
-- as a result of either PackageImports or ElementImports.
overriding function Get_Member
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::member.
--
-- A collection of NamedElements identifiable within the Namespace, either
-- by being owned or by being introduced by importing or inheritance.
overriding function Get_Owned_Member
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Getter of Namespace::ownedMember.
--
-- A collection of NamedElements owned by the Namespace.
overriding function Get_Owned_Rule
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Namespace::ownedRule.
--
-- Specifies a set of Constraints owned by this Namespace.
overriding function Get_Package_Import
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import;
-- Getter of Namespace::packageImport.
--
-- References the PackageImports owned by the Namespace.
overriding function All_Owning_Packages
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Interaction_Operand_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding function Exclude_Collisions
(Self : not null access constant UML_Interaction_Operand_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::excludeCollisions.
--
-- The query excludeCollisions() excludes from a set of
-- PackageableElements any that would not be distinguishable from each
-- other in this namespace.
overriding function Get_Names_Of_Member
(Self : not null access constant UML_Interaction_Operand_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String;
-- Operation Namespace::getNamesOfMember.
--
-- The query getNamesOfMember() takes importing into account. It gives
-- back the set of names that an element would have in an importing
-- namespace, either because it is owned, or if not owned then imported
-- individually, or if not individually then from a package.
-- The query getNamesOfMember() gives a set of all of the names that a
-- member would have in a Namespace. In general a member can have multiple
-- names in a Namespace if it is imported more than once with different
-- aliases. The query takes account of importing. It gives back the set of
-- names that an element would have in an importing namespace, either
-- because it is owned, or if not owned then imported individually, or if
-- not individually then from a package.
overriding function Import_Members
(Self : not null access constant UML_Interaction_Operand_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importMembers.
--
-- The query importMembers() defines which of a set of PackageableElements
-- are actually imported into the namespace. This excludes hidden ones,
-- i.e., those which have names that conflict with names of owned members,
-- and also excludes elements which would have the same name when imported.
overriding function Imported_Member
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element;
-- Operation Namespace::importedMember.
--
-- The importedMember property is derived from the ElementImports and the
-- PackageImports. References the PackageableElements that are members of
-- this Namespace as a result of either PackageImports or ElementImports.
overriding function Members_Are_Distinguishable
(Self : not null access constant UML_Interaction_Operand_Proxy)
return Boolean;
-- Operation Namespace::membersAreDistinguishable.
--
-- The Boolean query membersAreDistinguishable() determines whether all of
-- the namespace's members are distinguishable within it.
overriding function Owned_Member
(Self : not null access constant UML_Interaction_Operand_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element;
-- Operation Namespace::ownedMember.
--
-- Missing derivation for Namespace::/ownedMember : NamedElement
overriding procedure Enter_Element
(Self : not null access constant UML_Interaction_Operand_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Interaction_Operand_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Interaction_Operand_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Interaction_Operands;
|
package GL.Materials is
-- Material. Doc from the VRML 1.0 spec (refers to OpenGL):
-- * The ambient color reflects ambient light evenly from all parts of
-- an object regardless of viewing and lighting angles.
--
-- * The diffuse color reflects all VRML light sources depending on the
-- angle of the surface with respect to the light source.
-- The more directly the surface faces the light, the more
-- diffuse light reflects.
--
-- * The specular color and shininess determine the specular highlights,
-- e.g., the shiny spots on an apple. When the angle from the light
-- to the surface is close to the angle from the surface to the viewer,
-- the specular color is added to the diffuse and ambient color
-- calculations.
-- Lower shininess values produce soft glows, while higher values
-- result in sharper, smaller highlights.
--
-- * Emissive color models "glowing" objects. This can be useful for
-- displaying radiosity - based models (where the light energy of the
-- room is computed explicitly), or for displaying scientific data.
type Material_type is record
ambient,
diffuse,
specular,
emission : GL.Material_Float_vector;
shininess : GL.C_Float; -- 0.0 .. 128.0
end record;
function is_Transparent (Self : Material_type) return Boolean;
neutral_material :
constant Material_type := (ambient => (0.2, 0.2, 0.2, 1.0),
diffuse => (0.8, 0.8, 0.8, 1.0),
specular => (0.0, 0.0, 0.0, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 0.0);
-- ^ the values are GL defaults.
-- A few colour - dominant materials:
Red : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (1.0, 0.0, 0.0, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Orange : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.992157, 0.513726, 0.0, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Yellow : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (1.0, 0.964706, 0.0, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Green : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.0, 1.0, 0.0, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Indigo : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.0980392, 0.0, 0.458824, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Blue : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.0, 0.0, 1.0, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Violet : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.635294, 0.0, 1.0, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
White : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.992157, 0.992157, 0.992157, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Black : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.0, 0.0, 0.0, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Medium_Gray : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.454902, 0.454902, 0.454902, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
Light_Gray : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.682353, 0.682353, 0.682353, 1.0),
specular => (0.0225, 0.0225, 0.0225, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 12.8
);
-- A few "material" materials:
Glass : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.588235, 0.670588, 0.729412, 1.0),
specular => (0.9, 0.9, 0.9, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 96.0
);
Brass : constant Material_type := (
ambient => (0.329412, 0.223529, 0.027451, 1.0),
diffuse => (0.780392, 0.568627, 0.113725, 1.0),
specular => (0.992157, 0.941176, 0.807843, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 27.8974);
Bronze : constant Material_type := (
ambient => (0.2125, 0.1275, 0.054, 1.0),
diffuse => (0.714, 0.4284, 0.18144, 1.0),
specular => (0.393548, 0.271906, 0.166721, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 25.6);
Polished_Bronze : constant Material_type := (
ambient => (0.25, 0.148, 0.06475, 1.0),
diffuse => (0.4, 0.2368, 0.1036, 1.0),
specular => (0.774597, 0.458561, 0.200621, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 76.8);
Chrome : constant Material_type := (
ambient => (0.25, 0.25, 0.25, 1.0),
diffuse => (0.4, 0.4, 0.4, 1.0),
specular => (0.774597, 0.774597, 0.774597, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 76.8);
Copper : constant Material_type := (
ambient => (0.19125, 0.0735, 0.0225, 1.0),
diffuse => (0.7038, 0.27048, 0.0828, 1.0),
specular => (0.256777, 0.137622, 0.086014, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 12.8);
Polished_Copper : constant Material_type := (
ambient => (0.2295, 0.08825, 0.0275, 1.0),
diffuse => (0.5508, 0.2118, 0.066, 1.0),
specular => (0.580594, 0.223257, 0.0695701, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 51.2);
Gold : constant Material_type := (
ambient => (0.24725, 0.1995, 0.0745, 1.0),
diffuse => (0.75164, 0.60648, 0.22648, 1.0),
specular => (0.628281, 0.555802, 0.366065, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 51.2);
Polished_Gold : constant Material_type := (
ambient => (0.24725, 0.2245, 0.0645, 1.0),
diffuse => (0.34615, 0.3143, 0.0903, 1.0),
specular => (0.797357, 0.723991, 0.208006, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 83.2);
Pewter : constant Material_type := (
ambient => (0.105882, 0.058824, 0.113725, 1.0),
diffuse => (0.427451, 0.470588, 0.541176, 1.0),
specular => (0.333333, 0.333333, 0.521569, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 9.84615);
Silver : constant Material_type := (
ambient => (0.19225, 0.19225, 0.19225, 1.0),
diffuse => (0.50754, 0.50754, 0.50754, 1.0),
specular => (0.508273, 0.508273, 0.508273, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 51.2);
Polished_Silver : constant Material_type := (
ambient => (0.23125, 0.23125, 0.23125, 1.0),
diffuse => (0.2775, 0.2775, 0.2775, 1.0),
specular => (0.773911, 0.773911, 0.773911, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 89.6);
Emerald : constant Material_type := (
ambient => (0.0215, 0.1745, 0.0215, 0.55),
diffuse => (0.07568, 0.61424, 0.07568, 0.55),
specular => (0.633, 0.727811, 0.633, 0.55),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 76.8);
Jade : constant Material_type := (
ambient => (0.135, 0.2225, 0.1575, 0.95),
diffuse => (0.54, 0.89, 0.63, 0.95),
specular => (0.316228, 0.316228, 0.316228, 0.95),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 12.8);
Obsidian : constant Material_type := (
ambient => (0.05375, 0.05, 0.06625, 0.82),
diffuse => (0.18275, 0.17, 0.22525, 0.82),
specular => (0.332741, 0.328634, 0.346435, 0.82),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 38.4);
Pearl : constant Material_type := (
ambient => (0.25, 0.20725, 0.20725, 0.922),
diffuse => (1.0, 0.829, 0.829, 0.922),
specular => (0.296648, 0.296648, 0.296648, 0.922),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 11.264);
Ruby : constant Material_type := (
ambient => (0.1745, 0.01175, 0.01175, 0.55),
diffuse => (0.61424, 0.04136, 0.04136, 0.55),
specular => (0.727811, 0.626959, 0.626959, 0.55),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 76.8);
Turquoise : constant Material_type := (
ambient => (0.1, 0.18725, 0.1745, 0.8),
diffuse => (0.396, 0.74151, 0.69102, 0.8),
specular => (0.297254, 0.30829, 0.306678, 0.8),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 12.8);
Black_Plastic : constant Material_type := (
ambient => (0.0, 0.0, 0.0, 1.0),
diffuse => (0.01, 0.01, 0.01, 1.0),
specular => (0.50, 0.50, 0.50, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 32.0);
Black_Rubber : constant Material_type := (
ambient => (0.02, 0.02, 0.02, 1.0),
diffuse => (0.01, 0.01, 0.01, 1.0),
specular => (0.4, 0.4, 0.4, 1.0),
emission => (0.0, 0.0, 0.0, 0.0),
shininess => 10.0);
VRML_Defaults : constant Material_type := (
ambient => (0.2, 0.2, 0.2, 1.0),
diffuse => (0.8, 0.8, 0.8, 1.0),
specular => (0.0, 0.0, 0.0, 1.0),
emission => (0.0, 0.0, 0.0, 1.0),
shininess => 25.6);
end GL.Materials;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018-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 NRF_SVD.SPI; use NRF_SVD.SPI;
package body nRF.SPI_Master is
procedure Transfer (This : in out SPI_Master;
Data_Out : UInt8;
Data_In : out UInt8)
with Inline_Always;
-- Send and receive one byte of data
--------------
-- Transfer --
--------------
procedure Transfer (This : in out SPI_Master;
Data_Out : UInt8;
Data_In : out UInt8)
is
begin
-- Set output byte
This.Periph.TXD.TXD := Data_Out;
-- Wait for the RX ready event
while This.Periph.EVENTS_READY = 0 loop
null;
end loop;
-- Get input data
Data_In := This.Periph.RXD.RXD;
-- Clear event
This.Periph.EVENTS_READY := 0;
end Transfer;
------------
-- Enable --
------------
procedure Enable (This : in out SPI_Master) is
begin
This.Periph.ENABLE.ENABLE := Enabled;
end Enable;
-------------
-- Disable --
-------------
procedure Disable (This : in out SPI_Master) is
begin
This.Periph.ENABLE.ENABLE := Disabled;
end Disable;
-------------
-- Enabled --
-------------
function Enabled (This : SPI_Master) return Boolean
is (This.Periph.ENABLE.ENABLE = Enabled);
---------------
-- Configure --
---------------
procedure Configure
(This : in out SPI_Master;
SCK, MOSI, MISO : GPIO_Pin_Index;
Speed : Clock_Speed;
Bit_Order : Data_Bit_Order;
Polarity : Clock_Polarity;
Phase : Clock_Phase)
is
begin
This.Periph.PSELSCK := UInt32 (SCK);
This.Periph.PSELMOSI := UInt32 (MOSI);
This.Periph.PSELMISO := UInt32 (MISO);
This.Periph.FREQUENCY := (case Speed is
when SPI_125kbps => 16#0200_0000#,
when SPI_250kbps => 16#0400_0000#,
when SPI_500kbps => 16#0800_0000#,
when SPI_1Mbps => 16#1000_0000#,
when SPI_2Mbps => 16#2000_0000#,
when SPI_4Mbps => 16#4000_0000#,
when SPI_8Mbps => 16#8000_0000#);
This.Periph.CONFIG.ORDER := (case Bit_Order is
when Most_Significant_First => Msbfirst,
when Least_Significant_First => Lsbfirst);
This.Periph.CONFIG.CPHA := (case Phase is
when Sample_Leading_Edge => Leading,
when Sample_Trailing_Edge => Trailing);
This.Periph.CONFIG.CPOL := (case Polarity is
when Active_High => Activehigh,
when Active_Low => Activelow);
end Configure;
----------------
-- Disconnect --
----------------
procedure Disconnect (This : in out SPI_Master) is
begin
This.Periph.PSELSCK := UInt32'Last;
This.Periph.PSELMOSI := UInt32'Last;
This.Periph.PSELMISO := UInt32'Last;
end Disconnect;
---------------
-- Data_Size --
---------------
overriding function Data_Size
(This : SPI_Master)
return SPI_Data_Size
is (HAL.SPI.Data_Size_8b);
--------------
-- Transmit --
--------------
overriding
procedure Transmit
(This : in out SPI_Master;
Data : SPI_Data_8b;
Status : out SPI_Status;
Timeout : Natural := 1000)
is
pragma Unreferenced (Timeout);
Unused : UInt8;
begin
-- Clear any previous event
This.Periph.EVENTS_READY := 0;
for Elt of Data loop
Transfer (This, Data_Out => Elt, Data_In => Unused);
end loop;
Status := HAL.SPI.Ok;
end Transmit;
--------------
-- Transmit --
--------------
overriding
procedure Transmit
(This : in out SPI_Master;
Data : SPI_Data_16b;
Status : out SPI_Status;
Timeout : Natural := 1000)
is
pragma Unreferenced (Timeout);
Unused : UInt8;
begin
-- Clear any previous event
This.Periph.EVENTS_READY := 0;
if This.Periph.CONFIG.ORDER = Msbfirst then
for Elt of Data loop
Transfer (This,
Data_Out => UInt8 (Shift_Left (Elt, 8)),
Data_In => Unused);
Transfer (This,
Data_Out => UInt8 (Elt and 16#FF#),
Data_In => Unused);
end loop;
else
for Elt of Data loop
Transfer (This,
Data_Out => UInt8 (Elt and 16#FF#),
Data_In => Unused);
Transfer (This,
Data_Out => UInt8 (Shift_Left (Elt, 8)),
Data_In => Unused);
end loop;
end if;
Status := HAL.SPI.Ok;
end Transmit;
-------------
-- Receive --
-------------
overriding
procedure Receive
(This : in out SPI_Master;
Data : out SPI_Data_8b;
Status : out SPI_Status;
Timeout : Natural := 1000)
is
pragma Unreferenced (Timeout);
begin
-- Clear any previous event
This.Periph.EVENTS_READY := 0;
for Elt of Data loop
Transfer (This, Data_Out => 0, Data_In => Elt);
end loop;
Status := HAL.SPI.Ok;
end Receive;
-------------
-- Receive --
-------------
overriding
procedure Receive
(This : in out SPI_Master;
Data : out SPI_Data_16b;
Status : out SPI_Status;
Timeout : Natural := 1000)
is
pragma Unreferenced (Timeout);
Byte : UInt8;
begin
-- Clear any previous event
This.Periph.EVENTS_READY := 0;
if This.Periph.CONFIG.ORDER = Msbfirst then
for Elt of Data loop
Transfer (This, Data_Out => 0, Data_In => Byte);
Elt := Shift_Left (UInt16 (Byte), 8);
Transfer (This, Data_Out => 0, Data_In => Byte);
Elt := Elt or UInt16 (Byte);
end loop;
else
for Elt of Data loop
Transfer (This, Data_Out => 0, Data_In => Byte);
Elt := Elt or UInt16 (Byte);
Transfer (This, Data_Out => 0, Data_In => Byte);
Elt := Shift_Left (UInt16 (Byte), 8);
end loop;
end if;
Status := HAL.SPI.Ok;
end Receive;
end nRF.SPI_Master;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.float_Text_IO; use Ada.float_Text_IO;
with Ada.integer_Text_IO; use Ada.integer_Text_IO;
with lca;
package body google_creuse is
procedure initialiser(V : out matricep) is
begin
for i in 1..Capacite loop
Lca_integer_float.Initialiser(V(i));
end loop;
end initialiser;
procedure V_hyperliens(V : out Vecteur_integer ; fichier : in string) is
f : file_type;
C : integer;
n : integer;
len : integer;
Nb_Noeud : integer;
l: integer := 1;
begin
V := (1..Capacite => 0);
len := 1;
open(f,in_File,fichier);
get(f, Nb_Noeud);
get(f,C);
n := C;
get(f,C);
while not End_of_File(f) loop
get(f,C);
if n = C then
get(f,C);
len := len + 1;
V(l) := len;
else
len :=1;
n := C;
get(f,C);
l := l + 1;
end if;
end loop;
V(l) := len;
close(f);
end V_hyperliens;
procedure lire(M : out matricep ; fichier : in string ) is
f : file_type;
C : integer;
Vect : Vecteur_integer;
l : integer := 1 ;
n :integer;
Nb_Noeud : integer ;
sda : Lca_integer_float.T_LCA;
begin
V_hyperliens(Vect ,fichier);
open(f,in_File,fichier);
get(f, Nb_Noeud);
get(f,C);
n := C;
get(f,C);
Lca_integer_float.Enregistrer(M(n+1) ,C+1,1.0/float(Vect(l)));
while not End_of_File(f) loop
get(f,C);
if n = C then
get(f,C);
Lca_integer_float.Enregistrer(M(n+1) ,C+1 ,1.0/float(Vect(l)));
else
l := l +1;
n := C;
get(f,C);
Lca_integer_float.Enregistrer(M(n+1) ,C+1,1.0/float(Vect(l)));
end if;
end loop;
Lca_integer_float.Enregistrer(M(n+1) ,C+1 ,1.0/float(Vect(l)));
close(f);
end lire;
procedure calculS(M : in out matricep) is
begin
for i in 1..Capacite loop
if Est_Vide(M(i)) then
for j in 1..Capacite loop
Lca_integer_float.Enregistrer(M(i) ,j ,1.0/float(Capacite));
end loop;
end if;
end loop;
end calculS;
procedure Produit(M : in matricep ;V : in out Vecteur_float ;alpha : float) is
poids : Vecteur_float;
beta : float := (1.0 - alpha)/float(Capacite);
begin
for i in 1..Capacite loop
poids(i):= 0.0;
for k in 1..Capacite loop
if Cle_Presente(M(k),i) then
poids(i) := poids(i) + (alpha*La_Donnee(M(k),i) + beta)*V(k);
else
poids(i) := poids(i) + beta*V(k);
end if;
end loop;
end loop;
V := poids ;
end Produit;
procedure Ecrire(vect : in Vecteur_float; fichier : in String; alpha : in float;Nb_iteration : in integer) is
f : FILE_TYPE;
begin
Create(f, Out_File, fichier);
Put(f,Capacite,1);
Put(f," ");
Put(f,alpha, Fore=>1, Aft=>10);
Put(f," ");
Put(f,nb_iteration,1);
new_line(f,1);
for i in 1..Capacite loop
Put(f,vect(i), Fore=>1, Aft=>10);
new_line(f,1);
end loop;
close(f);
end Ecrire;
procedure Ecrire(vect : in Vecteur_integer; fichier : in String) is
f : FILE_TYPE;
begin
Create(f, Out_File, fichier);
for i in 1..Capacite loop
Put(f,vect(i),1);
new_line(f,1);
end loop;
close(f);
end Ecrire;
procedure Trier(V : in out Vecteur_float ;V_indice : out Vecteur_integer) is
indice_max : integer ;
tmp1 : float;
tmp2 : integer;
begin
for i in 1..Capacite loop
V_indice(i) := i-1;
end loop;
for i in 1..(Capacite-1) loop
indice_max := i;
for j in i+1..Capacite loop
if V(j) > V(indice_max) then
indice_max := j;
end if;
end loop;
tmp1 := V(i) ;
tmp2 := V_indice(i) ;
V(i) := V(indice_max);
V_indice(i) := V_indice(indice_max);
V(indice_max) := tmp1;
V_indice(indice_max) := tmp2;
end loop;
end Trier;
end google_creuse;
|
-------------------------------------------------------------------------------
-- 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.
-------------------------------------------------------------------------------
with LSE.Model.IO.Turtle_Utils;
use LSE.Model.IO.Turtle_Utils;
-- @summary
-- Interpreter to draw the L-System
--
-- @description
-- This package provides methods for drawing a L-System using a LOGO Turtle.
--
package LSE.Model.Interpreter is
-- Interpreter
type Instance is interface;
-- Drawing a L-System on a medium
-- @param T The LOGO Turtle used for drawing on a specific medium
procedure Interpret (This : in out Instance;
T : in out Holder) is abstract;
end LSE.Model.Interpreter;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 1 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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.Storage_Elements;
with System.Unsigned_Types;
with Unchecked_Conversion;
package body System.Pack_21 is
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_21;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
function To_Ref is new
Unchecked_Conversion (System.Address, Cluster_Ref);
------------
-- Get_21 --
------------
function Get_21 (Arr : System.Address; N : Natural) return Bits_21 is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end Get_21;
------------
-- Set_21 --
------------
procedure Set_21 (Arr : System.Address; N : Natural; E : Bits_21) is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end Set_21;
end System.Pack_21;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
with Program.Elements.Type_Conversions;
with Program.Element_Visitors;
package Program.Nodes.Type_Conversions is
pragma Preelaborate;
type Type_Conversion is
new Program.Nodes.Node
and Program.Elements.Type_Conversions.Type_Conversion
and Program.Elements.Type_Conversions.Type_Conversion_Text
with private;
function Create
(Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Operand : not null Program.Elements.Expressions
.Expression_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Type_Conversion;
type Implicit_Type_Conversion is
new Program.Nodes.Node
and Program.Elements.Type_Conversions.Type_Conversion
with private;
function Create
(Subtype_Mark : not null Program.Elements.Expressions
.Expression_Access;
Operand : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Type_Conversion
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Type_Conversion is
abstract new Program.Nodes.Node
and Program.Elements.Type_Conversions.Type_Conversion
with record
Subtype_Mark : not null Program.Elements.Expressions.Expression_Access;
Operand : not null Program.Elements.Expressions.Expression_Access;
end record;
procedure Initialize (Self : in out Base_Type_Conversion'Class);
overriding procedure Visit
(Self : not null access Base_Type_Conversion;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Subtype_Mark
(Self : Base_Type_Conversion)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Operand
(Self : Base_Type_Conversion)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Is_Type_Conversion
(Self : Base_Type_Conversion)
return Boolean;
overriding function Is_Expression
(Self : Base_Type_Conversion)
return Boolean;
type Type_Conversion is
new Base_Type_Conversion
and Program.Elements.Type_Conversions.Type_Conversion_Text
with record
Left_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Right_Bracket_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Type_Conversion_Text
(Self : in out Type_Conversion)
return Program.Elements.Type_Conversions.Type_Conversion_Text_Access;
overriding function Left_Bracket_Token
(Self : Type_Conversion)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Right_Bracket_Token
(Self : Type_Conversion)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Type_Conversion is
new Base_Type_Conversion
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Type_Conversion_Text
(Self : in out Implicit_Type_Conversion)
return Program.Elements.Type_Conversions.Type_Conversion_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Type_Conversion)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Type_Conversion)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Type_Conversion)
return Boolean;
end Program.Nodes.Type_Conversions;
|
-----------------------------------------------------------------------
-- util-systems-os-tests -- Unit tests for OS specific operations
-- Copyright (C) 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.Tests;
package Util.Systems.OS.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with null record;
-- Test the Sys_Stat operation.
procedure Test_Stat (T : in out Test);
-- Test the Sys_Stat operation on a directory.
procedure Test_Stat_Directory (T : in out Test);
end Util.Systems.OS.Tests;
|
procedure usb.tests.main is
begin
null;
end usb.tests.main;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- C H E C K S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Package containing routines used to deal with runtime checks. These
-- routines are used both by the semantics and by the expander. In some
-- cases, checks are enabled simply by setting flags for gigi, and in
-- other cases the code for the check is expanded.
-- The approach used for range and length checks, in regards to suppressed
-- checks, is to attempt to detect at compilation time that a constraint
-- error will occur. If this is detected a warning or error is issued and the
-- offending expression or statement replaced with a constraint error node.
-- This always occurs whether checks are suppressed or not. Dynamic range
-- checks are, of course, not inserted if checks are suppressed.
with Types; use Types;
with Uintp; use Uintp;
package Checks is
procedure Initialize;
-- Called for each new main source program, to initialize internal
-- variables used in the package body of the Checks unit.
function Access_Checks_Suppressed (E : Entity_Id) return Boolean;
function Accessibility_Checks_Suppressed (E : Entity_Id) return Boolean;
function Discriminant_Checks_Suppressed (E : Entity_Id) return Boolean;
function Division_Checks_Suppressed (E : Entity_Id) return Boolean;
function Elaboration_Checks_Suppressed (E : Entity_Id) return Boolean;
function Index_Checks_Suppressed (E : Entity_Id) return Boolean;
function Length_Checks_Suppressed (E : Entity_Id) return Boolean;
function Overflow_Checks_Suppressed (E : Entity_Id) return Boolean;
function Range_Checks_Suppressed (E : Entity_Id) return Boolean;
function Storage_Checks_Suppressed (E : Entity_Id) return Boolean;
function Tag_Checks_Suppressed (E : Entity_Id) return Boolean;
-- These functions check to see if the named check is suppressed,
-- either by an active scope suppress setting, or because the check
-- has been specifically suppressed for the given entity. If no entity
-- is relevant for the current check, then Empty is used as an argument.
-- Note: the reason we insist on specifying Empty is to force the
-- caller to think about whether there is any relevant entity that
-- should be checked.
-- General note on following checks. These checks are always active if
-- Expander_Active and not Inside_A_Generic. They are inactive and have
-- no effect Inside_A_Generic. In the case where not Expander_Active
-- and not Inside_A_Generic, most of them are inactive, but some of them
-- operate anyway since they may generate useful compile time warnings.
procedure Apply_Access_Check (N : Node_Id);
-- Determines whether an expression node requires a runtime access
-- check and if so inserts the appropriate run-time check.
procedure Apply_Accessibility_Check (N : Node_Id; Typ : Entity_Id);
-- Given a name N denoting an access parameter, emits a run-time
-- accessibility check (if necessary), checking that the level of
-- the object denoted by the access parameter is not deeper than the
-- level of the type Typ. Program_Error is raised if the check fails.
procedure Apply_Alignment_Check (E : Entity_Id; N : Node_Id);
-- E is the entity for an object. If there is an address clause for
-- this entity, and checks are enabled, then this procedure generates
-- a check that the specified address has an alignment consistent with
-- the alignment of the object, raising PE if this is not the case. The
-- resulting check (if one is generated) is inserted before node N.
procedure Apply_Array_Size_Check (N : Node_Id; Typ : Entity_Id);
-- N is the node for an object declaration that declares an object of
-- array type Typ. This routine generates, if necessary, a check that
-- the size of the array is not too large, raising Storage_Error if so.
procedure Apply_Arithmetic_Overflow_Check (N : Node_Id);
-- Given a binary arithmetic operator (+ - *) expand a software integer
-- overflow check using range checks on a larger checking type or a call
-- to an appropriate runtime routine. This is used for all three operators
-- for the signed integer case, and for +/- in the fixed-point case. The
-- check is expanded only if Software_Overflow_Checking is enabled and
-- Do_Overflow_Check is set on node N. Note that divide is handled
-- separately using Apply_Arithmetic_Divide_Overflow_Check.
procedure Apply_Constraint_Check
(N : Node_Id;
Typ : Entity_Id;
No_Sliding : Boolean := False);
-- Top-level procedure, calls all the others depending on the class of Typ.
-- Checks that expression N verifies the constraint of type Typ. No_Sliding
-- is only relevant for constrained array types, id set to true, it
-- checks that indexes are in range.
procedure Apply_Discriminant_Check
(N : Node_Id;
Typ : Entity_Id;
Lhs : Node_Id := Empty);
-- Given an expression N of a discriminated type, or of an access type
-- whose designated type is a discriminanted type, generates a check to
-- ensure that the expression can be converted to the subtype given as
-- the second parameter. Lhs is empty except in the case of assignments,
-- where the target object may be needed to determine the subtype to
-- check against (such as the cases of unconstrained formal parameters
-- and unconstrained aliased objects). For the case of unconstrained
-- formals, the check is peformed only if the corresponding actual is
-- constrained, i.e., whether Lhs'Constrained is True.
function Build_Discriminant_Checks
(N : Node_Id;
T_Typ : Entity_Id)
return Node_Id;
-- Subsidiary routine for Apply_Discriminant_Check. Builds the expression
-- that compares discriminants of the expression with discriminants of the
-- type. Also used directly for membership tests (see Exp_Ch4.Expand_N_In).
procedure Apply_Divide_Check (N : Node_Id);
-- The node kind is N_Op_Divide, N_Op_Mod, or N_Op_Rem. An appropriate
-- check is generated to ensure that the right operand is non-zero. In
-- the divide case, we also check that we do not have the annoying case
-- of the largest negative number divided by minus one.
procedure Apply_Type_Conversion_Checks (N : Node_Id);
-- N is an N_Type_Conversion node. A type conversion actually involves
-- two sorts of checks. The first check is the checks that ensures that
-- the operand in the type conversion fits onto the base type of the
-- subtype it is being converted to (see RM 4.6 (28)-(50)). The second
-- check is there to ensure that once the operand has been converted to
-- a value of the target type, this converted value meets the
-- constraints imposed by the target subtype (see RM 4.6 (51)).
procedure Apply_Universal_Integer_Attribute_Checks (N : Node_Id);
-- The argument N is an attribute reference node intended for processing
-- by gigi. The attribute is one that returns a universal integer, but
-- the attribute reference node is currently typed with the expected
-- result type. This routine deals with range and overflow checks needed
-- to make sure that the universal result is in range.
procedure Determine_Range
(N : Node_Id;
OK : out Boolean;
Lo : out Uint;
Hi : out Uint);
-- N is a node for a subexpression. If N is of a discrete type with no
-- error indications, and no other peculiarities (e.g. missing type
-- fields), then OK is True on return, and Lo and Hi are set to a
-- conservative estimate of the possible range of values of N. Thus if OK
-- is True on return, the value of the subexpression N is known to like in
-- the range Lo .. Hi (inclusive). If the expression is not of a discrete
-- type, or some kind of error condition is detected, then OK is False on
-- exit, and Lo/Hi are set to No_Uint. Thus the significance of OK being
-- False on return is that no useful information is available on the range
-- of the expression.
procedure Install_Null_Excluding_Check (N : Node_Id);
-- Determines whether an access node requires a runtime access check and
-- if so inserts the appropriate run-time check.
-------------------------------------------------------
-- Control and Optimization of Range/Overflow Checks --
-------------------------------------------------------
-- Range checks are controlled by the Do_Range_Check flag. The front end
-- is responsible for setting this flag in relevant nodes. Originally
-- the back end generated all corresponding range checks. But later on
-- we decided to generate all range checks in the front end. We are now
-- in the transitional phase where some of these checks are still done
-- by the back end, but many are done by the front end.
-- Overflow checks are similarly controlled by the Do_Overflow_Check flag.
-- The difference here is that if Backend_Overflow_Checks is is
-- (Backend_Overflow_Checks_On_Target set False), then the actual overflow
-- checks are generated by the front end, but if back end overflow checks
-- are active (Backend_Overflow_Checks_On_Target set True), then the back
-- end does generate the checks.
-- The following two routines are used to set these flags, they allow
-- for the possibility of eliminating checks. Checks can be eliminated
-- if an identical check has already been performed.
procedure Enable_Overflow_Check (N : Node_Id);
-- First this routine determines if an overflow check is needed by doing
-- an appropriate range check. If a check is not needed, then the call
-- has no effect. If a check is needed then this routine sets the flag
-- Set Do_Overflow_Check in node N to True, unless it can be determined
-- that the check is not needed. The only condition under which this is
-- the case is if there was an identical check earlier on.
procedure Enable_Range_Check (N : Node_Id);
-- Set Do_Range_Check flag in node N True, unless it can be determined
-- that the check is not needed. The only condition under which this is
-- the case is if there was an identical check earlier on. This routine
-- is not responsible for doing range analysis to determine whether or
-- not such a check is needed -- the caller is expected to do this. The
-- one other case in which the request to set the flag is ignored is
-- when Kill_Range_Check is set in an N_Unchecked_Conversion node.
-- The following routines are used to keep track of processing sequences
-- of statements (e.g. the THEN statements of an IF statement). A check
-- that appears within such a sequence can eliminate an identical check
-- within this sequence of statements. However, after the end of the
-- sequence of statements, such a check is no longer of interest, since
-- it may not have been executed.
procedure Conditional_Statements_Begin;
-- This call marks the start of processing of a sequence of statements.
-- Every call to this procedure must be followed by a matching call to
-- Conditional_Statements_End.
procedure Conditional_Statements_End;
-- This call removes from consideration all saved checks since the
-- corresponding call to Conditional_Statements_Begin. These two
-- procedures operate in a stack like manner.
-- The mechanism for optimizing checks works by remembering checks
-- that have already been made, but certain conditions, for example
-- an assignment to a variable involved in a check, may mean that the
-- remembered check is no longer valid, in the sense that if the same
-- expression appears again, another check is required because the
-- value may have changed.
-- The following routines are used to note conditions which may render
-- some or all of the stored and remembered checks to be invalidated.
procedure Kill_Checks (V : Entity_Id);
-- This procedure records an assignment or other condition that causes
-- the value of the variable to be changed, invalidating any stored
-- checks that reference the value. Note that all such checks must
-- be discarded, even if they are not in the current statement range.
procedure Kill_All_Checks;
-- This procedure kills all remembered checks
-----------------------------
-- Length and Range Checks --
-----------------------------
-- In the following procedures, there are three arguments which have
-- a common meaning as follows:
-- Expr The expression to be checked. If a check is required,
-- the appropriate flag will be placed on this node. Whether
-- this node is further examined depends on the setting of
-- the parameter Source_Typ, as described below.
-- Target_Typ The target type on which the check is to be based. For
-- example, if we have a scalar range check, then the check
-- is that we are in range of this type.
-- Source_Typ Normally Empty, but can be set to a type, in which case
-- this type is used for the check, see below.
-- The checks operate in one of two modes:
-- If Source_Typ is Empty, then the node Expr is examined, at the very
-- least to get the source subtype. In addition for some of the checks,
-- the actual form of the node may be examined. For example, a node of
-- type Integer whose actual form is an Integer conversion from a type
-- with range 0 .. 3 can be determined to have a value in range 0 .. 3.
-- If Source_Typ is given, then nothing can be assumed about the Expr,
-- and indeed its contents are not examined. In this case the check is
-- based on the assumption that Expr can be an arbitrary value of the
-- given Source_Typ.
-- Currently, the only case in which a Source_Typ is explicitly supplied
-- is for the case of Out and In_Out parameters, where, for the conversion
-- on return (the Out direction), the types must be reversed. This is
-- handled by the caller.
procedure Apply_Length_Check
(Ck_Node : Node_Id;
Target_Typ : Entity_Id;
Source_Typ : Entity_Id := Empty);
-- This procedure builds a sequence of declarations to do a length check
-- that checks if the lengths of the two arrays Target_Typ and source type
-- are the same. The resulting actions are inserted at Node using a call
-- to Insert_Actions.
--
-- For access types, the Directly_Designated_Type is retrieved and
-- processing continues as enumerated above, with a guard against null
-- values.
--
-- Note: calls to Apply_Length_Check currently never supply an explicit
-- Source_Typ parameter, but Apply_Length_Check takes this parameter and
-- processes it as described above for consistency with the other routines
-- in this section.
procedure Apply_Range_Check
(Ck_Node : Node_Id;
Target_Typ : Entity_Id;
Source_Typ : Entity_Id := Empty);
-- For an Node of kind N_Range, constructs a range check action that tests
-- first that the range is not null and then that the range is contained in
-- the Target_Typ range.
--
-- For scalar types, constructs a range check action that first tests that
-- the expression is contained in the Target_Typ range. The difference
-- between this and Apply_Scalar_Range_Check is that the latter generates
-- the actual checking code in gigi against the Etype of the expression.
--
-- For constrained array types, construct series of range check actions
-- to check that each Expr range is properly contained in the range of
-- Target_Typ.
--
-- For a type conversion to an unconstrained array type, constructs a range
-- check action to check that the bounds of the source type are within the
-- constraints imposed by the Target_Typ.
--
-- For access types, the Directly_Designated_Type is retrieved and
-- processing continues as enumerated above, with a guard against null
-- values.
--
-- The source type is used by type conversions to unconstrained array
-- types to retrieve the corresponding bounds.
procedure Apply_Static_Length_Check
(Expr : Node_Id;
Target_Typ : Entity_Id;
Source_Typ : Entity_Id := Empty);
-- Tries to determine statically whether the two array types source type
-- and Target_Typ have the same length. If it can be determined at compile
-- time that they do not, then an N_Raise_Constraint_Error node replaces
-- Expr, and a warning message is issued.
procedure Apply_Scalar_Range_Check
(Expr : Node_Id;
Target_Typ : Entity_Id;
Source_Typ : Entity_Id := Empty;
Fixed_Int : Boolean := False);
-- For scalar types, determines whether an expression node should be
-- flagged as needing a runtime range check. If the node requires such a
-- check, the Do_Range_Check flag is turned on. The Fixed_Int flag if set
-- causes any fixed-point values to be treated as though they were discrete
-- values (i.e. the underlying integer value is used).
type Check_Result is private;
-- Type used to return result of Range_Check call, for later use in
-- call to Insert_Range_Checks procedure.
procedure Append_Range_Checks
(Checks : Check_Result;
Stmts : List_Id;
Suppress_Typ : Entity_Id;
Static_Sloc : Source_Ptr;
Flag_Node : Node_Id);
-- Called to append range checks as returned by a call to Range_Check.
-- Stmts is a list to which either the dynamic check is appended or the
-- raise Constraint_Error statement is appended (for static checks).
-- Static_Sloc is the Sloc at which the raise CE node points, Flag_Node is
-- used as the node at which to set the Has_Dynamic_Check flag. Checks_On
-- is a boolean value that says if range and index checking is on or not.
procedure Insert_Range_Checks
(Checks : Check_Result;
Node : Node_Id;
Suppress_Typ : Entity_Id;
Static_Sloc : Source_Ptr := No_Location;
Flag_Node : Node_Id := Empty;
Do_Before : Boolean := False);
-- Called to insert range checks as returned by a call to Range_Check.
-- Node is the node after which either the dynamic check is inserted or
-- the raise Constraint_Error statement is inserted (for static checks).
-- Suppress_Typ is the type to check to determine if checks are suppressed.
-- Static_Sloc, if passed, is the Sloc at which the raise CE node points,
-- otherwise Sloc (Node) is used. The Has_Dynamic_Check flag is normally
-- set at Node. If Flag_Node is present, then this is used instead as the
-- node at which to set the Has_Dynamic_Check flag. Normally the check is
-- inserted after, if Do_Before is True, the check is inserted before
-- Node.
function Range_Check
(Ck_Node : Node_Id;
Target_Typ : Entity_Id;
Source_Typ : Entity_Id := Empty;
Warn_Node : Node_Id := Empty)
return Check_Result;
-- Like Apply_Range_Check, except it does not modify anything. Instead
-- it returns an encapsulated result of the check operations for later
-- use in a call to Insert_Range_Checks. If Warn_Node is non-empty, its
-- Sloc is used, in the static case, for the generated warning or error.
-- Additionally, it is used rather than Expr (or Low/High_Bound of Expr)
-- in constructing the check.
-----------------------
-- Expander Routines --
-----------------------
-- Some of the earlier processing for checks results in temporarily setting
-- the Do_Range_Check flag rather than actually generating checks. Now we
-- are moving the generation of such checks into the front end for reasons
-- of efficiency and simplicity (there were difficutlies in handling this
-- in the back end when side effects were present in the expressions being
-- checked).
-- Probably we could eliminate the Do_Range_Check flag entirely and
-- generate the checks earlier, but this is a delicate area and it
-- seemed safer to implement the following routines, which are called
-- late on in the expansion process. They check the Do_Range_Check flag
-- and if it is set, generate the actual checks and reset the flag.
procedure Generate_Range_Check
(N : Node_Id;
Target_Type : Entity_Id;
Reason : RT_Exception_Code);
-- This procedure is called to actually generate and insert a range check.
-- A check is generated to ensure that the value of N lies within the range
-- of the target type. Note that the base type of N may be different from
-- the base type of the target type. This happens in the conversion case.
-- The Reason parameter is the exception code to be used for the exception
-- if raised.
--
-- Note on the relation of this routine to the Do_Range_Check flag. Mostly
-- for historical reasons, we often set the Do_Range_Check flag and then
-- later we call Generate_Range_Check if this flag is set. Most probably we
-- could eliminate this intermediate setting of the flag (historically the
-- back end dealt with range checks, using this flag to indicate if a check
-- was required, then we moved checks into the front end).
procedure Generate_Index_Checks (N : Node_Id);
-- This procedure is called to generate index checks on the subscripts for
-- the indexed component node N. Each subscript expression is examined, and
-- if the Do_Range_Check flag is set, an appropriate index check is
-- generated and the flag is reset.
-- Similarly, we set the flag Do_Discriminant_Check in the semantic
-- analysis to indicate that a discriminant check is required for selected
-- component of a discriminated type. The following routine is called from
-- the expander to actually generate the call.
procedure Generate_Discriminant_Check (N : Node_Id);
-- N is a selected component for which a discriminant check is required to
-- make sure that the discriminants have appropriate values for the
-- selection. This is done by calling the appropriate discriminant checking
-- routine for the selector.
-----------------------
-- Validity Checking --
-----------------------
-- In (RM 13.9.1(9-11)) we have the following rules on invalid values
-- If the representation of a scalar object does not represent value of
-- the object's subtype (perhaps because the object was not initialized),
-- the object is said to have an invalid representation. It is a bounded
-- error to evaluate the value of such an object. If the error is
-- detected, either Constraint_Error or Program_Error is raised.
-- Otherwise, execution continues using the invalid representation. The
-- rules of the language outside this subclause assume that all objects
-- have valid representations. The semantics of operations on invalid
-- representations are as follows:
--
-- 10 If the representation of the object represents a value of the
-- object's type, the value of the type is used.
--
-- 11 If the representation of the object does not represent a value
-- of the object's type, the semantics of operations on such
-- representations is implementation-defined, but does not by
-- itself lead to erroneous or unpredictable execution, or to
-- other objects becoming abnormal.
-- We quote the rules in full here since they are quite delicate. Most
-- of the time, we can just compute away with wrong values, and get a
-- possibly wrong result, which is well within the range of allowed
-- implementation defined behavior. The two tricky cases are subscripted
-- array assignments, where we don't want to do wild stores, and case
-- statements where we don't want to do wild jumps.
-- In GNAT, we control validity checking with a switch -gnatV that can take
-- three parameters, n/d/f for None/Default/Full. These modes have the
-- following meanings:
-- None (no validity checking)
-- In this mode, there is no specific checking for invalid values
-- and the code generator assumes that all stored values are always
-- within the bounds of the object subtype. The consequences are as
-- follows:
-- For case statements, an out of range invalid value will cause
-- Constraint_Error to be raised, or an arbitrary one of the case
-- alternatives will be executed. Wild jumps cannot result even
-- in this mode, since we always do a range check
-- For subscripted array assignments, wild stores will result in
-- the expected manner when addresses are calculated using values
-- of subscripts that are out of range.
-- It could perhaps be argued that this mode is still conformant with
-- the letter of the RM, since implementation defined is a rather
-- broad category, but certainly it is not in the spirit of the
-- RM requirement, since wild stores certainly seem to be a case of
-- erroneous behavior.
-- Default (default standard RM-compatible validity checking)
-- In this mode, which is the default, minimal validity checking is
-- performed to ensure no erroneous behavior as follows:
-- For case statements, an out of range invalid value will cause
-- Constraint_Error to be raised.
-- For subscripted array assignments, invalid out of range
-- subscript values will cause Constraint_Error to be raised.
-- Full (Full validity checking)
-- In this mode, the protections guaranteed by the standard mode are
-- in place, and the following additional checks are made:
-- For every assignment, the right side is checked for validity
-- For every call, IN and IN OUT parameters are checked for validity
-- For every subscripted array reference, both for stores and loads,
-- all subscripts are checked for validity.
-- These checks are not required by the RM, but will in practice
-- improve the detection of uninitialized variables, particularly
-- if used in conjunction with pragma Normalize_Scalars.
-- In the above description, we talk about performing validity checks,
-- but we don't actually generate a check in a case where the compiler
-- can be sure that the value is valid. Note that this assurance must
-- be achieved without assuming that any uninitialized value lies within
-- the range of its type. The following are cases in which values are
-- known to be valid. The flag Is_Known_Valid is used to keep track of
-- some of these cases.
-- If all possible stored values are valid, then any uninitialized
-- value must be valid.
-- Literals, including enumeration literals, are clearly always valid
-- Constants are always assumed valid, with a validity check being
-- performed on the initializing value where necessary to ensure that
-- this is the case.
-- For variables, the status is set to known valid if there is an
-- initializing expression. Again a check is made on the initializing
-- value if necessary to ensure that this assumption is valid. The
-- status can change as a result of local assignments to a variable.
-- If a known valid value is unconditionally assigned, then we mark
-- the left side as known valid. If a value is assigned that is not
-- known to be valid, then we mark the left side as invalid. This
-- kind of processing does NOT apply to non-local variables since we
-- are not following the flow graph (more properly the flow of actual
-- processing only corresponds to the flow graph for local assignments).
-- For non-local variables, we preserve the current setting, i.e. a
-- validity check is performed when assigning to a knonwn valid global.
-- Note: no validity checking is required if range checks are suppressed
-- regardless of the setting of the validity checking mode.
-- The following procedures are used in handling validity checking
procedure Apply_Subscript_Validity_Checks (Expr : Node_Id);
-- Expr is the node for an indexed component. If validity checking and
-- range checking are enabled, all subscripts for this indexed component
-- are checked for validity.
procedure Check_Valid_Lvalue_Subscripts (Expr : Node_Id);
-- Expr is a lvalue, i.e. an expression representing the target of an
-- assignment. This procedure checks for this expression involving an
-- assignment to an array value. We have to be sure that all the subscripts
-- in such a case are valid, since according to the rules in (RM
-- 13.9.1(9-11)) such assignments are not permitted to result in erroneous
-- behavior in the case of invalid subscript values.
procedure Ensure_Valid (Expr : Node_Id; Holes_OK : Boolean := False);
-- Ensure that Expr represents a valid value of its type. If this type
-- is not a scalar type, then the call has no effect, since validity
-- is only an issue for scalar types. The effect of this call is to
-- check if the value is known valid, if so, nothing needs to be done.
-- If this is not known, then either Expr is set to be range checked,
-- or specific checking code is inserted so that an exception is raised
-- if the value is not valid.
--
-- The optional argument Holes_OK indicates whether it is necessary to
-- worry about enumeration types with non-standard representations leading
-- to "holes" in the range of possible representations. If Holes_OK is
-- True, then such values are assumed valid (this is used when the caller
-- will make a separate check for this case anyway). If Holes_OK is False,
-- then this case is checked, and code is inserted to ensure that Expr is
-- valid, raising Constraint_Error if the value is not valid.
function Expr_Known_Valid (Expr : Node_Id) return Boolean;
-- This function tests it the value of Expr is known to be valid in the
-- sense of RM 13.9.1(9-11). In the case of GNAT, it is only discrete types
-- which are a concern, since for non-discrete types we simply continue
-- computation with invalid values, which does not lead to erroneous
-- behavior. Thus Expr_Known_Valid always returns True if the type of Expr
-- is non-discrete. For discrete types the value returned is True only if
-- it can be determined that the value is Valid. Otherwise False is
-- returned.
procedure Insert_Valid_Check (Expr : Node_Id);
-- Inserts code that will check for the value of Expr being valid, in
-- the sense of the 'Valid attribute returning True. Constraint_Error
-- will be raised if the value is not valid.
procedure Null_Exclusion_Static_Checks (N : Node_Id);
-- Ada 2005 (AI-231): Check bad usages of the null-exclusion issue
procedure Remove_Checks (Expr : Node_Id);
-- Remove all checks from Expr except those that are only executed
-- conditionally (on the right side of And Then/Or Else. This call
-- removes only embedded checks (Do_Range_Check, Do_Overflow_Check).
private
type Check_Result is array (Positive range 1 .. 2) of Node_Id;
-- There are two cases for the result returned by Range_Check:
--
-- For the static case the result is one or two nodes that should cause
-- a Constraint_Error. Typically these will include Expr itself or the
-- direct descendents of Expr, such as Low/High_Bound (Expr)). It is the
-- responsibility of the caller to rewrite and substitute the nodes with
-- N_Raise_Constraint_Error nodes.
--
-- For the non-static case a single N_Raise_Constraint_Error node with a
-- non-empty Condition field is returned.
--
-- Unused entries in Check_Result, if any, are simply set to Empty For
-- external clients, the required processing on this result is achieved
-- using the Insert_Range_Checks routine.
pragma Inline (Apply_Length_Check);
pragma Inline (Apply_Range_Check);
pragma Inline (Apply_Static_Length_Check);
end Checks;
|
-- UnZip.Decompress
-------------------
-- Private, internal to the UnZip package.
--
-- Created 9 - Mar - 2007
--
-- This package includes the decompression algorithms for methods
-- store, reduce, shrink (LZW), implode and inflate.
-- It contains the packages UnZ_IO, UnZ_Glob, UnZ_Infl, UnZ_Olds, UnZ_Misc
-- of previous versions of Zip - Ada.
-- They become local packages inside the Decompress_Data procedure - >
-- previously global variables are now local, one copy per concurrent call.
with Zip.Headers;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Zip_Streams;
private package UnZip.Decompress is
procedure Decompress_data (
zip_file : Zip_Streams.Zipstream_Class;
-- zip_file must be open and its index is meant
-- to point to the beginning of compressed data
format : PKZip_method;
mode : Write_mode;
output_file_name : String; -- relevant only if mode = write_to_file
output_memory_access : out p_Stream_Element_Array; -- = write_to_memory
feedback : Zip.Feedback_proc;
explode_literal_tree : Boolean; -- relevant for the "explode" format
explode_slide_8KB : Boolean; -- relevant for the "explode" format
end_data_descriptor : Boolean;
encrypted : Boolean;
password : in out Unbounded_String;
get_new_password : Get_password_proc; -- if null, initial pwd must fit
hint : in out Zip.Headers.Data_descriptor
-- values are known, or smart fakes and corrected if a closing
-- Data_descriptor is appended to the compressed data (1 - pass written
-- zip files, like JAR, OpenDocument, etc.)
);
private
-- Primitive tracing using Ada.Text_IO
--
type Trace_type is (none, some_t, full);
trace : constant Trace_type := none; -- <== Choice
no_trace : constant Boolean := trace = none;
some_trace : constant Boolean := trace >= some_t;
full_trace : constant Boolean := trace = full;
end UnZip.Decompress;
|
-- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
private with Yaml.Events.Store;
private with Yaml.Events.Queue;
package Yaml.Transformator.Annotation.Vars is
type Instance is limited new Transformator.Instance with private;
overriding procedure Put (Object : in out Instance; E : Event);
overriding function Has_Next (Object : Instance) return Boolean;
overriding function Next (Object : in out Instance) return Event;
function New_Vars (Pool : Text.Pool.Reference;
Node_Context : Node_Context_Type;
Processor_Context : Events.Context.Reference;
Swallows_Previous : out Boolean)
return not null Pointer;
private
type State_Type is not null access procedure (Object : in out Instance;
E : Event);
procedure Initial (Object : in out Instance; E : Event);
procedure After_Annotation_Start (Object : in out Instance; E : Event);
procedure After_Annotation_End (Object : in out Instance; E : Event);
procedure At_Mapping_Level (Object : in out Instance; E : Event);
procedure Inside_Value (Object : in out Instance; E : Event);
procedure After_Mapping_End (Object : in out Instance; E : Event);
type Instance is limited new Transformator.Instance with record
Context : Events.Context.Reference;
Depth : Natural := 0;
State : State_Type := Initial'Access;
Cur_Queue : Events.Queue.Instance;
Cur_Name : Text.Reference;
end record;
end Yaml.Transformator.Annotation.Vars;
|
<?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></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>window_fn_top</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>outdata_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>outdata.V</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>32</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>indata_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>indata.V</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>32</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>17</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></name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second class_id="11" tracking_level="0" version="0">
<count>2</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>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</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>30</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</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>36</item>
<item>38</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>41</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</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>42</item>
<item>43</item>
<item>44</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>tmp_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</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>45</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>coeff_tab1_addr</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>48</item>
<item>49</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>coeff_tab1_load</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>OP1_V_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>indata_V_addr</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>52</item>
<item>53</item>
<item>54</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>indata_V_load</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>OP2_V_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>p_Val2_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>57</item>
<item>58</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>outdata_V_addr</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
<item>61</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name></name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>62</item>
<item>63</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name></name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</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>64</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name></name>
<fileName>window_fn_top.cpp</fileName>
<fileDirectory>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>window_fn_top</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab2</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_20">
<Value>
<Obj>
<type>2</type>
<id>31</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_21">
<Value>
<Obj>
<type>2</type>
<id>37</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_22">
<Value>
<Obj>
<type>2</type>
<id>40</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_23">
<Value>
<Obj>
<type>2</type>
<id>47</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>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_24">
<Obj>
<type>3</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>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_25">
<Obj>
<type>3</type>
<id>14</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>9</item>
<item>10</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_26">
<Obj>
<type>3</type>
<id>27</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>11</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_27">
<Obj>
<type>3</type>
<id>29</id>
<name>apply.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>28</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>35</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_28">
<id>30</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>33</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>35</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>39</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>41</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>43</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>44</id>
<edge_type>2</edge_type>
<source_obj>29</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>64</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>84</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>85</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>86</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>87</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>14</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_63">
<mId>1</mId>
<mTag>window_fn_top</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</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>193</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_64">
<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"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_65">
<mId>3</mId>
<mTag>winfn_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>27</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>32</mMinTripCount>
<mMaxTripCount>32</mMaxTripCount>
<mMinLatency>192</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_66">
<mId>4</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>29</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="_67">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_68">
<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="_69">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_70">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_71">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_72">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_73">
<id>2</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_74">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_75">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_76">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_77">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_78">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_79">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_80">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_81">
<id>18</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_82">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_83">
<id>21</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_84">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_85">
<id>3</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_86">
<id>18</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_87">
<id>21</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_88">
<id>4</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_89">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_90">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_91">
<id>23</id>
<stage>3</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_92">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_93">
<id>23</id>
<stage>2</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_94">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_95">
<id>23</id>
<stage>1</stage>
<latency>3</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_96">
<id>7</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_97">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_98">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_99">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_100">
<id>26</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="_101">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>12</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="_102">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>13</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="_103">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>15</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="_104">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>16</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="_105">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>17</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="_106">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>18</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="_107">
<inState>7</inState>
<outState>2</outState>
<condition>
<id>20</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_108">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>0</count>
<item_version>0</item_version>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>0</count>
<item_version>0</item_version>
</dp_multiplexer_resource>
<dp_register_resource>
<count>0</count>
<item_version>0</item_version>
</dp_register_resource>
<dp_component_map class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>0</count>
<item_version>0</item_version>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="39" tracking_level="0" version="0">
<count>17</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>7</first>
<second class_id="41" tracking_level="0" version="0">
<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>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>3</first>
<second>2</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="42" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<first>8</first>
<second class_id="44" 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>27</first>
<second>
<first>1</first>
<second>6</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="45" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="46" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>35</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>18</item>
</second>
</item>
<item>
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>47</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>59</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>75</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>81</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>93</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>99</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
<item>23</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="49" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first>OP1_V_i_fu_93</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>OP2_V_i_fu_96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>coeff_tab1_addr_gep_fu_28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>exitcond_i_fu_75</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>i_fu_81</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_i_phi_fu_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indata_V_addr_gep_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>outdata_V_addr_gep_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp_i_fu_87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_fu_99</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
<item>23</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="51" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first class_id="53" tracking_level="0" version="0">
<first>coeff_tab1</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>18</item>
</second>
</item>
<item>
<first>
<first>indata_V</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
</second>
</item>
<item>
<first>
<first>outdata_V</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>10</count>
<item_version>0</item_version>
<item>
<first>OP1_V_i_reg_138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>OP2_V_i_reg_143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>coeff_tab1_addr_reg_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>coeff_tab1_load_reg_128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>i_i_reg_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>i_reg_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>indata_V_addr_reg_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>indata_V_load_reg_133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_Val2_i_reg_148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>tmp_i_reg_113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>i_i_reg_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="54" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>indata_V(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
</second>
</item>
</second>
</item>
<item>
<first>outdata_V(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>25</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="56" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="57" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
------------------------------------------------------------------------------
-- AGAR CORE LIBRARY --
-- A G A R . E V E N T --
-- S p e c --
------------------------------------------------------------------------------
with System;
with Interfaces.C;
with Interfaces.C.Strings;
--
-- Argument passing and retrieval for event handler routines (and virtual
-- functions of Agar objects in general). Arguments are of type Agar.Variable,
-- which includes discrete and pointer types. Arguments can be tagged and
-- accessed by index or name.
--
-- NOTE: Agar enforces run-time type safety only when it is compiled with
-- the configure option --enable-type-safety.
--
package Agar.Event is
package C renames Interfaces.C;
package CS renames Interfaces.C.Strings;
ARGS_MAX : constant Natural := $AG_EVENT_ARGS_MAX;
NAME_MAX : constant Natural := $AG_EVENT_NAME_MAX;
type Event is array (1 .. $SIZEOF_AG_EVENT) of
aliased Interfaces.Unsigned_8 with Convention => C;
for Event'Size use $SIZEOF_AG_EVENT * System.Storage_Unit;
type Event_Access is access all Event with Convention => C;
subtype Event_not_null_Access is not null Event_Access;
--
-- Initialize an existing Event.
--
procedure Init (Event : in Event_not_null_Access)
with Import, Convention => C, Link_Name => "AG_EventInit";
--
-- Push a tagged Event argument.
--
procedure Push_Address
(Event : in Event_not_null_Access;
Name : in String;
Value : in System.Address);
procedure Push_String
(Event : in Event_not_null_Access;
Name : in String;
Value : in String);
procedure Push_Integer
(Event : in Event_not_null_Access;
Name : in String;
Value : in Integer);
procedure Push_Natural
(Event : in Event_not_null_Access;
Name : in String;
Value : in Natural);
procedure Push_Long_Integer
(Event : in Event_not_null_Access;
Name : in String;
Value : in Long_Integer);
#if HAVE_FLOAT
procedure Push_Float
(Event : in Event_not_null_Access;
Name : in String;
Value : in Float);
procedure Push_Long_Float
(Event : in Event_not_null_Access;
Name : in String;
Value : in Long_Float);
#end if;
--
-- Push an untagged Event argument.
--
procedure Push_Address
(Event : in Event_not_null_Access;
Value : in System.Address);
procedure Push_String
(Event : in Event_not_null_Access;
Value : in String);
procedure Push_Integer
(Event : in Event_not_null_Access;
Value : in Integer);
procedure Push_Natural
(Event : in Event_not_null_Access;
Value : in Natural);
procedure Push_Long_Integer
(Event : in Event_not_null_Access;
Value : in Long_Integer);
#if HAVE_FLOAT
procedure Push_Float
(Event : in Event_not_null_Access;
Value : in Float);
procedure Push_Long_Float
(Event : in Event_not_null_Access;
Value : in Long_Float);
#end if;
--
-- Pop the last argument off an Event argument stack
--
function Pop_Address
(Event : in Event_not_null_Access) return System.Address;
--
-- Extract an argument by index.
--
function Get_Address
(Event : in Event_not_null_Access;
Index : in Natural) return System.Address;
function Get_String
(Event : in Event_not_null_Access;
Index : in Natural) return String;
function Get_Integer
(Event : in Event_not_null_Access;
Index : in Natural) return Integer;
function Get_Natural
(Event : in Event_not_null_Access;
Index : in Natural) return Natural;
function Get_Long_Integer
(Event : in Event_not_null_Access;
Index : in Natural) return Long_Integer;
#if HAVE_FLOAT
function Get_Float
(Event : in Event_not_null_Access;
Index : in Natural) return Float;
function Get_Long_Float
(Event : in Event_not_null_Access;
Index : in Natural) return Long_Float;
#end if;
--
-- Extract an argument by tag.
--
function Get_Address
(Event : in Event_not_null_Access;
Name : in String) return System.Address;
function Get_String
(Event : in Event_not_null_Access;
Name : in String) return String;
function Get_Integer
(Event : in Event_not_null_Access;
Name : in String) return Integer;
function Get_Natural
(Event : in Event_not_null_Access;
Name : in String) return Natural;
function Get_Long_Integer
(Event : in Event_not_null_Access;
Name : in String) return Long_Integer;
#if HAVE_FLOAT
function Get_Float
(Event : in Event_not_null_Access;
Name : in String) return Float;
function Get_Long_Float
(Event : in Event_not_null_Access;
Name : in String) return Long_Float;
#end if;
generic
type Element_Type is private;
type Element_Access_Type is access Element_Type;
procedure Push_Access
(Event : in Event_not_null_Access;
Name : in String;
Value : in Element_Access_Type);
private
--
-- Push argument
--
procedure ag_event_push_pointer
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr;
Value : in System.Address)
with Import, Convention => C;
procedure ag_event_push_string
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr;
Value : in CS.chars_ptr)
with Import, Convention => C;
procedure ag_event_push_int
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr;
Value : in C.int)
with Import, Convention => C;
procedure ag_event_push_uint
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr;
Value : in C.unsigned)
with Import, Convention => C;
procedure ag_event_push_long
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr;
Value : in C.long)
with Import, Convention => C;
#if HAVE_FLOAT
procedure ag_event_push_float
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr;
Value : in C.C_float)
with Import, Convention => C;
procedure ag_event_push_double
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr;
Value : in C.double)
with Import, Convention => C;
#end if;
function ag_event_pop_pointer
(Event : in Event_not_null_Access) return System.Address
with Import, Convention => C;
--
-- Extract argument by index
--
function ag_event_get_ptr
(Event : in Event_not_null_Access;
Index : in C.unsigned) return System.Address
with Import, Convention => C;
function ag_event_get_const_ptr
(Event : in Event_not_null_Access;
Index : in C.unsigned) return System.Address
with Import, Convention => C;
function ag_event_get_string
(Event : in Event_not_null_Access;
Index : in C.unsigned) return CS.chars_ptr
with Import, Convention => C;
function ag_event_get_int
(Event : in Event_not_null_Access;
Index : in C.unsigned) return C.int
with Import, Convention => C;
function ag_event_get_uint
(Event : in Event_not_null_Access;
Index : in C.unsigned) return C.unsigned
with Import, Convention => C;
function ag_event_get_long
(Event : in Event_not_null_Access;
Index : in C.unsigned) return C.long
with Import, Convention => C;
#if HAVE_FLOAT
function ag_event_get_float
(Event : in Event_not_null_Access;
Index : in C.unsigned) return C.C_float
with Import, Convention => C;
function ag_event_get_double
(Event : in Event_not_null_Access;
Index : in C.unsigned) return C.double
with Import, Convention => C;
#end if;
--
-- Extract argument by name
--
function ag_event_get_ptr_named
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr) return System.Address
with Import, Convention => C;
function ag_event_get_string_named
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr) return CS.chars_ptr
with Import, Convention => C;
function ag_event_get_int_named
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr) return C.int
with Import, Convention => C;
function ag_event_get_uint_named
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr) return C.unsigned
with Import, Convention => C;
function ag_event_get_long_named
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr) return C.long
with Import, Convention => C;
#if HAVE_FLOAT
function ag_event_get_float_named
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr) return C.C_float
with Import, Convention => C;
function ag_event_get_double_named
(Event : in Event_not_null_Access;
Name : in CS.chars_ptr) return C.double
with Import, Convention => C;
#end if;
end Agar.Event;
|
------------------------------------------------------------------------------
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with System; use System;
with STM32_SVD; use STM32_SVD;
with STM32.Device; use STM32.Device;
package body STM32.PWM with SPARK_Mode => Off is
subtype Hertz is Word;
procedure Compute_Prescalar_and_Period
(This : access Timer;
Requested_Frequency : Hertz;
Prescalar : out Word;
Period : out Word)
with Pre => Requested_Frequency > 0;
-- Computes the minimum prescaler and thus the maximum resolution for the
-- given timer, based on the system clocks and the requested frequency
function Has_APB2_Frequency (This : Timer) return Boolean;
-- timers 1, 8, 9, 10, 11
function Has_APB1_Frequency (This : Timer) return Boolean;
-- timers 3, 4, 6, 7, 12, 13, 14
procedure Configure_PWM_GPIO
(Output : GPIO_Point;
PWM_AF : GPIO_Alternate_Function);
--------------------
-- Set_Duty_Cycle --
--------------------
procedure Set_Duty_Cycle
(This : in out PWM_Modulator;
Channel : Timer_Channel;
Value : Percentage)
is
Pulse : Short;
begin
This.Outputs (Channel).Duty_Cycle := Value;
if Value = 0 then
Set_Compare_Value (This.Output_Timer.all, Channel, Short'(0));
else
Pulse := Short ((This.Timer_Period + 1) * Word (Value) / 100) - 1;
-- for a Value of 0, the computation of Pulse wraps around to
-- 65535, so we only compute it when not zero
Set_Compare_Value (This.Output_Timer.all, Channel, Pulse);
end if;
end Set_Duty_Cycle;
-------------------
-- Set_Duty_Time --
-------------------
procedure Set_Duty_Time
(This : in out PWM_Modulator;
Channel : Timer_Channel;
Value : Microseconds)
is
Pulse : Short;
Period : constant Word := This.Timer_Period + 1;
uS_Per_Period : constant Word := 1_000_000 / This.Frequency;
begin
if Value > uS_Per_Period then
raise Invalid_Request with "duty time too high";
end if;
Pulse := Short ((Period * Value) / uS_Per_Period) - 1;
Set_Compare_Value (This.Output_Timer.all, Channel, Pulse);
end Set_Duty_Time;
------------------------
-- Current_Duty_Cycle --
------------------------
function Current_Duty_Cycle
(This : PWM_Modulator;
Channel : Timer_Channel)
return Percentage
is
begin
return This.Outputs (Channel).Duty_Cycle;
end Current_Duty_Cycle;
------------------------------
-- Initialise_PWM_Modulator --
------------------------------
procedure Initialise_PWM_Modulator
(This : in out PWM_Modulator;
Requested_Frequency : Float;
PWM_Timer : not null access Timer;
PWM_AF : GPIO_Alternate_Function)
is
Prescalar : Word;
begin
This.Output_Timer := PWM_Timer;
This.AF := PWM_AF;
Enable_Clock (PWM_Timer.all);
Compute_Prescalar_and_Period
(PWM_Timer,
Requested_Frequency => Word (Requested_Frequency),
Prescalar => Prescalar,
Period => This.Timer_Period);
This.Timer_Period := This.Timer_Period - 1;
This.Frequency := Word (Requested_Frequency);
Configure
(PWM_Timer.all,
Prescaler => Short (Prescalar),
Period => This.Timer_Period,
Clock_Divisor => Div1,
Counter_Mode => Up);
Set_Autoreload_Preload (PWM_Timer.all, True);
if Advanced_Timer (This.Output_Timer.all) then
Enable_Main_Output (This.Output_Timer.all);
end if;
Enable (PWM_Timer.all);
for Channel in Timer_Channel loop
This.Outputs (Channel).Attached := False;
end loop;
end Initialise_PWM_Modulator;
------------------------
-- Attach_PWM_Channel --
------------------------
procedure Attach_PWM_Channel
(This : in out PWM_Modulator;
Channel : Timer_Channel;
Point : GPIO_Point)
is
begin
This.Outputs (Channel).Attached := True;
Enable_Clock (Point);
Configure_PWM_GPIO (Point, This.AF);
Configure_Channel_Output
(This.Output_Timer.all,
Channel => Channel,
Mode => PWM1,
State => Disable,
Pulse => 0,
Polarity => High);
Set_Compare_Value (This.Output_Timer.all, Channel, Short (0));
Disable_Channel (This.Output_Timer.all, Channel);
end Attach_PWM_Channel;
------------------------
-- Enable_PWM_Channel --
------------------------
procedure Enable_PWM_Channel
(This : in out PWM_Modulator;
Channel : Timer_Channel)
is
begin
Enable_Channel (This.Output_Timer.all, Channel);
end Enable_PWM_Channel;
-------------
-- Enabled --
-------------
function Enabled
(This : PWM_Modulator;
Channel : Timer_Channel)
return Boolean
is
begin
return Channel_Enabled (This.Output_Timer.all, Channel);
end Enabled;
-------------------------
-- Disable_PWM_Channel --
-------------------------
procedure Disable_PWM_Channel
(This : in out PWM_Modulator;
Channel : Timer_Channel)
is
begin
Disable_Channel (This.Output_Timer.all, Channel);
end Disable_PWM_Channel;
--------------
-- Attached --
--------------
function Attached
(This : PWM_Modulator;
Channel : Timer_Channel)
return Boolean
is
(This.Outputs (Channel).Attached);
------------------------
-- Configure_PWM_GPIO --
------------------------
procedure Configure_PWM_GPIO
(Output : GPIO_Point;
PWM_AF : GPIO_Alternate_Function)
is
Configuration : GPIO_Port_Configuration;
begin
Configuration.Mode := Mode_AF;
Configuration.Output_Type := Push_Pull;
Configuration.Speed := Speed_100MHz;
Configuration.Resistors := Floating;
Output.Configure_IO (Configuration);
Output.Configure_Alternate_Function (PWM_AF);
Output.Lock;
end Configure_PWM_GPIO;
----------------------------------
-- Compute_Prescalar_and_Period --
----------------------------------
procedure Compute_Prescalar_and_Period
(This : access Timer;
Requested_Frequency : Hertz;
Prescalar : out Word;
Period : out Word)
is
Max_Prescalar : constant := 16#FFFF#;
Max_Period : Word;
Hardware_Frequency : Word;
Clocks : constant RCC_System_Clocks :=
System_Clock_Frequencies;
begin
if Has_APB1_Frequency (This.all) then
Hardware_Frequency := Clocks.TIMCLK1;
elsif Has_APB2_Frequency (This.all) then
Hardware_Frequency := Clocks.TIMCLK2;
else
raise Unknown_Timer;
end if;
if Has_32bit_Counter (This.all) then
Max_Period := 16#FFFF_FFFF#;
else
Max_Period := 16#FFFF#;
end if;
if Requested_Frequency > Hardware_Frequency then
raise Invalid_Request with "Freq too high";
end if;
Prescalar := 0;
loop
Period := Hardware_Frequency / (Prescalar + 1);
Period := Period / Requested_Frequency;
exit when not
((Period > Max_Period) and
(Prescalar <= Max_Prescalar));
Prescalar := Prescalar + 1;
end loop;
if Prescalar > Max_Prescalar then
raise Invalid_Request with "Freq too low";
end if;
end Compute_Prescalar_and_Period;
------------------------
-- Has_APB2_Frequency --
------------------------
function Has_APB2_Frequency (This : Timer) return Boolean is
(This'Address = STM32_SVD.TIM1_Base or
This'Address = STM32_SVD.TIM8_Base or
This'Address = STM32_SVD.TIM9_Base or
This'Address = STM32_SVD.TIM10_Base or
This'Address = STM32_SVD.TIM11_Base);
------------------------
-- Has_APB1_Frequency --
------------------------
function Has_APB1_Frequency (This : Timer) return Boolean is
(This'Address = STM32_SVD.TIM3_Base or
This'Address = STM32_SVD.TIM4_Base or
This'Address = STM32_SVD.TIM6_Base or
This'Address = STM32_SVD.TIM7_Base or
This'Address = STM32_SVD.TIM12_Base or
This'Address = STM32_SVD.TIM13_Base or
This'Address = STM32_SVD.TIM14_Base);
end STM32.PWM;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- A D A . E X C E P T I O N S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 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. --
-- --
------------------------------------------------------------------------------
package body Ada.Exceptions is
procedure Last_Chance_Handler (Msg : System.Address; Line : Integer);
pragma Import (C, Last_Chance_Handler, "__gnat_last_chance_handler");
pragma No_Return (Last_Chance_Handler);
---------------------
-- Raise_Exception --
---------------------
procedure Raise_Exception (E : Exception_Id; Message : String := "") is
begin
Last_Chance_Handler (Message'Address, 0);
end Raise_Exception;
end Ada.Exceptions;
|
--
-- Copyright (C) 2013 Reto Buerki <reet@codelabs.ch>
-- Copyright (C) 2013 Adrian-Ken Rueegsegger <ken@codelabs.ch>
-- 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 University 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 REGENTS 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 REGENTS 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 Tkmrpc.Request;
with Tkmrpc.Response;
package Test_Utils
is
use Tkmrpc;
Test_Operation : constant := 999999;
-- Fake operation code used in tests.
Test_Request : constant Request.Data_Type
:= (Header =>
(Operation => Test_Operation,
Request_Id => 234234234),
Padded_Data => (others => Character'Pos ('a')));
-- Request data used in tests.
Test_Response : constant Response.Data_Type
:= (Header =>
(Operation => Test_Operation,
Request_Id => 234234234,
Result => 7662524),
Padded_Data => (others => Character'Pos ('c')));
-- Response data used in tests.
end Test_Utils;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2021, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with Interfaces;
package body LPS25H.I2C is
use HAL;
-- Utility specs --
generic
Register : HAL.UInt8;
type Register_Type is private;
procedure Write_Register (This : LPS25H_Barometric_Sensor_I2C;
Value : Register_Type;
Status : out Boolean);
procedure Write
(This : LPS25H_Barometric_Sensor_I2C;
Index : HAL.UInt8;
Data : HAL.UInt8;
Status : out Boolean);
procedure Read
(This : LPS25H_Barometric_Sensor_I2C;
Index : HAL.UInt8;
Data : out HAL.UInt8_Array;
Status : out Boolean);
procedure Read
(This : LPS25H_Barometric_Sensor_I2C;
Index : HAL.UInt8;
Data : out HAL.UInt8;
Status : out Boolean);
--------------
-- Get_Data --
--------------
overriding
procedure Get_Data
(This : in out LPS25H_Barometric_Sensor_I2C;
Press : out Pressure;
Temp : out Temperature;
Asl : out Altitude;
Status : out Boolean)
is
Buf : HAL.UInt8_Array (0 .. 2) := (others => 0);
begin
-- Pressure
declare
type Integer_24 is range -(2 ** 23) .. 2 ** 23 - 1
with Size => 24;
subtype Buffer_3 is HAL.UInt8_Array (Buf'Range);
function Convert is new Ada.Unchecked_Conversion
(Buffer_3, Integer_24);
begin
This.Read (PRESS_OUT_XL or 2#1000_0000#,
Buf,
Status);
if not Status then
return;
end if;
Press := Float (Convert (Buf)) / 4096.0;
end;
-- Temperature
declare
subtype Buffer_2 is HAL.UInt8_Array (0 .. 1);
function Convert is new Ada.Unchecked_Conversion
(Buffer_2, Interfaces.Integer_16);
begin
This.Read (TEMP_OUT_L or 2#1000_0000#,
Buf (0 .. 1),
Status);
if not Status then
return;
end if;
Temp := 42.5 + Float (Convert (Buf (0 .. 1))) / 480.0;
end;
-- See Wikipedia, "Barometric formula": The pressure drops
-- approximately by 11.3 pascals per meter in first 1000 meters
-- above sea level.
-- See Wikipedia, "Atmospheric pressure": the standard atmosphere is
-- 1013.25 mbar.
-- 1 Pascal = 0.01 mbar
Asl := (1013.25 - Press) * (100.0 / 11.3);
end Get_Data;
----------------
-- Initialize --
----------------
overriding
procedure Initialize (This : in out LPS25H_Barometric_Sensor_I2C)
is
Data : UInt8;
Status : Boolean;
begin
This.Timing.Delay_Milliseconds (5); -- ?
This.I2C_Address := 2 * (16#5C# + (if This.Slave_Address_Odd
then 1
else 0));
This.Read (WHO_AM_I, Data, Status);
if not Status then
return;
end if;
if Data /= WAI_ID then
return;
end if;
declare
procedure Write_Ctrl_Reg1 is new Write_Register
(CTRL_REG1, Ctrl_Reg1_Register);
begin
Write_Ctrl_Reg1 (This,
(PD => 1, ODR => Hz_25, BDU => 1, others => <>),
Status);
if not Status then
return;
end if;
end;
This.Initialized := True;
end Initialize;
-- Utilities --
--------------------
-- Write_Register --
--------------------
procedure Write_Register (This : LPS25H_Barometric_Sensor_I2C;
Value : Register_Type;
Status : out Boolean) is
pragma Assert (Register_Type'Size = 8);
function Convert is new Ada.Unchecked_Conversion
(Register_Type, HAL.UInt8);
begin
Write (This,
Index => Register,
Data => Convert (Value),
Status => Status);
end Write_Register;
-----------
-- Write --
-----------
procedure Write
(This : LPS25H_Barometric_Sensor_I2C;
Index : HAL.UInt8;
Data : HAL.UInt8;
Status : out Boolean)
is
Outcome : HAL.I2C.I2C_Status;
use all type HAL.I2C.I2C_Status;
Buf : constant HAL.UInt8_Array := (1 => Index) & Data;
begin
This.Port.Mem_Write (Addr => This.I2C_Address,
Mem_Addr => HAL.UInt16 (Index),
Mem_Addr_Size => HAL.I2C.Memory_Size_8b,
Data => Buf,
Status => Outcome);
Status := Outcome = Ok;
end Write;
----------
-- Read --
----------
procedure Read
(This : LPS25H_Barometric_Sensor_I2C;
Index : HAL.UInt8;
Data : out HAL.UInt8_Array;
Status : out Boolean)
is
Outcome : HAL.I2C.I2C_Status;
use all type HAL.I2C.I2C_Status;
begin
This.Port.Mem_Read (Addr => This.I2C_Address,
Mem_Addr => UInt16 (Index),
Mem_Addr_Size => HAL.I2C.Memory_Size_8b,
Data => Data,
Status => Outcome);
Status := Outcome = Ok;
end Read;
----------
-- Read --
----------
procedure Read
(This : LPS25H_Barometric_Sensor_I2C;
Index : HAL.UInt8;
Data : out HAL.UInt8;
Status : out Boolean)
is
Outcome : HAL.I2C.I2C_Status;
use all type HAL.I2C.I2C_Status;
Buf : UInt8_Array (1 .. 1);
begin
This.Port.Mem_Read (Addr => This.I2C_Address,
Mem_Addr => UInt16 (Index),
Mem_Addr_Size => HAL.I2C.Memory_Size_8b,
Data => Buf,
Status => Outcome);
Status := Outcome = Ok;
if Status then
Data := Buf (1);
end if;
end Read;
end LPS25H.I2C;
|
-- Copyright 2008-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/>.
package body Pck is
procedure Do_Nothing (A : System.Address) is
begin
null;
end Do_Nothing;
end Pck;
|
with Ada.Command_Line, Ada.Sequential_IO, Ada.Directories;
procedure Truncate_File is
type Byte is mod 256;
for Byte'Size use 8;
package Byte_IO is new Ada.Sequential_IO(Byte);
function Arg(N: Positive) return String renames Ada.Command_Line.Argument;
function Args return Natural renames Ada.Command_Line.Argument_Count;
begin
-- give help output if neccessary
if Args < 2 or else Args > 3 then
raise Program_Error
with "usage: truncate_file <filename> <length> [<temp_file>]";
end if;
-- now do the real work
declare
File_Name: String := Arg(1);
Temp_Name: String := (if Args = 2 then Arg(1) & ".tmp" else Arg(3));
-- an Ada 2012 conditional expression
File, Temp: Byte_IO.File_Type;
Count: Natural := Natural'Value(Arg(2));
Value: Byte;
begin
-- open files
Byte_IO.Open (File => File, Mode => Byte_IO.In_File, Name => File_Name);
Byte_IO.Create(File => Temp, Mode => Byte_IO.Out_File, Name => Temp_Name);
-- copy the required bytes (but at most as much as File has) from File to Temp
while (not Byte_IO.End_Of_File(File)) and Count > 0 loop
Byte_IO.Read (File, Value);
Byte_IO.Write(Temp, Value);
Count := Count - 1;
end loop;
-- close files
Byte_IO.Close(Temp);
Byte_IO.Close(File);
if Count = 0 then -- File was at least Count bytes long
-- remove File and rename Temp to File
Ada.Directories.Delete_File(Name => File_Name);
Ada.Directories.Rename(Old_Name => Temp_Name, New_Name => File_Name);
else -- File was too short
-- remove Temp and leave File as it is, output error
Ada.Directories.Delete_File(Name => Temp_Name);
raise Program_Error
with "Size of """ & File_Name & """ less than " & Arg(2);
end if;
end;
end Truncate_File;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.WIDE_WIDE_TEXT_IO.WIDE_WIDE_UNBOUNDED_IO --
-- --
-- S p e c --
-- --
-- This specification is derived 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. --
-- --
------------------------------------------------------------------------------
-- Note: historically GNAT provided these subprograms as a child of the
-- package Ada.Strings.Wide_Wide_Unbounded. So we implement this new Ada 2005
-- package by renaming the subprograms in that child. This is a more
-- straightforward implementation anyway, since we need access to the
-- internal representation of Unbounded_Wide_Wide_String.
with Ada.Strings.Wide_Wide_Unbounded;
with Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO;
package Ada.Wide_Wide_Text_IO.Wide_Wide_Unbounded_IO is
procedure Put
(File : File_Type;
Item : Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String)
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Put;
procedure Put
(Item : Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String)
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Put;
procedure Put_Line
(File : Wide_Wide_Text_IO.File_Type;
Item : Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String)
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Put_Line;
procedure Put_Line
(Item : Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String)
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Put_Line;
function Get_Line
(File : File_Type)
return Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Get_Line;
function Get_Line
return Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Get_Line;
procedure Get_Line
(File : File_Type;
Item : out Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String)
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Get_Line;
procedure Get_Line
(Item : out Strings.Wide_Wide_Unbounded.Unbounded_Wide_Wide_String)
renames Ada.Strings.Wide_Wide_Unbounded.Wide_Wide_Text_IO.Get_Line;
end Ada.Wide_Wide_Text_IO.Wide_Wide_Unbounded_IO;
|
-- Spécification du module Conversion_Type qui permet de convertir des chaines de caractère en Integer ou réel
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
generic
type T_Element is digits <>;
package Conversion_Type is
Bad_Type_Conversion_Error : exception;
-- Nom : To_Integer
-- Semantique : Convertir une chaine en integer
-- Paramètre(s) :
-- Chaine : in Unbounded_String; -- chaine à convertir
-- Type de retour : Integer
-- Pre : True
-- Post : To_Integer'Result - To_Integer'Result = 0
-- Tests :
-- Entrée : "2.1" Sortie : Bad_Type_Conversion_error
-- Entrée : '2' Sortie : 2
-- Exceptions : Bad_Type_Conversion_error si l'utilisateur ne rentre pas un integer
function To_Integer( chaine : in Unbounded_String) return Integer;
-- Nom : To_reel
-- Semantique : Convertir une chaine en réel
-- Paramètre(s) :
-- chaine : in Unbounded_String; -- chaine à convertir
-- Type de retour : T_Element;
-- Pre : True
-- Post : To_reel'Result-To_reel'Result = T_Element(0)
-- Tests :
-- Entrée : "2.1" Sortie : 2.1
-- Entrée : "0.333" Sortie : 0.333
-- Exceptions : Bad_Type_Conversion_error si l'utilisateur ne rentre pas un réel
function To_reel( chaine : in Unbounded_String) return T_Element;
-- Nom : Integer_or_reel
-- Semantique : Selon la chaine rentrée, renvoit la conversion en réel ou entier
-- de même qu'un indicateur précisant le type rentré
-- Paramètre(s) :
-- chaine : in Unbounded_String; -- chaine de taille quelconque à convertir
-- reel : out T_Element; -- réel éventuelllement converti
-- entier : out Integer; -- entier éventuellement converti
-- indicateur : out Character; -- si l'indicateur est 'i' c'est un integer si c'est 'f' c'est un float qui commence par 0,... et si c'est 'o'
-- c'est autre chose
-- Pre : True
-- Post : indicateur = 'f' or indicateur = 'i' or indicateur = 'o'
-- Tests :
-- Entrée : "2.1" ; Sortie : 'o'
-- Entrée : "0.333" ; Sortie : 'f'
-- Entrée : "120"; Sortie : 'i'
-- Exceptions : Aucune
Procedure Integer_or_reel ( chaine : in Unbounded_String; reel : out T_Element;
entier : out Integer; indicateur : out Character);
end Conversion_Type;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M L I B . T G T . S P E C I F I C --
-- (Default empty version) --
-- --
-- B o d y --
-- --
-- Copyright (C) 2007, 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. 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. --
-- --
------------------------------------------------------------------------------
-- Default version
package body MLib.Tgt.Specific is
-- By default, libraries are not supported at all
function Support_For_Libraries return Library_Support;
-- Function indicating if libraries are supported
---------------------------
-- Support_For_Libraries --
---------------------------
function Support_For_Libraries return Library_Support is
begin
return None;
end Support_For_Libraries;
begin
Support_For_Libraries_Ptr := Support_For_Libraries'Access;
end MLib.Tgt.Specific;
|
<?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>sep_convolution_filter</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_img_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>in_img.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_img_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_img.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</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>89</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>109</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</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>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>109</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>120</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>indvar_flatten</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>19</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>122</item>
<item>123</item>
<item>124</item>
<item>125</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>row</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>110</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>110</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>19</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>10</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>132</item>
<item>133</item>
<item>134</item>
<item>135</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>exitcond_flatten</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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>136</item>
<item>138</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>indvar_flatten_next</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>19</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>139</item>
<item>141</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>142</item>
<item>143</item>
<item>144</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>exitcond</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>110</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>110</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>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>col_mid2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>110</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>110</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>303</item>
<item>304</item>
<item>305</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>row_s</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>109</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>109</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>306</item>
<item>308</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_mid1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>153</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>153</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>309</item>
<item>311</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp6</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>153</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>153</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>312</item>
<item>313</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_mid2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>153</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>153</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>314</item>
<item>315</item>
<item>316</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_2_mid1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>161</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>317</item>
<item>318</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>tmp_s</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>161</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>319</item>
<item>320</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp_2_mid2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>161</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>321</item>
<item>322</item>
<item>323</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>row_mid2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>110</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>110</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>324</item>
<item>325</item>
<item>326</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>tmp_4</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>142</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>327</item>
<item>329</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>142</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>330</item>
<item>331</item>
<item>332</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp_5</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>146</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>146</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>145</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>line_buffer_V_0_addr</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>146</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>146</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>146</item>
<item>148</item>
<item>149</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>line_buffer_V_0_load</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>146</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>146</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>150</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>146</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>146</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>line_buffer_V_1_addr</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>146</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>146</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
<item>155</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>line_buffer_V_1_load</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>148</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>156</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>148</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>157</item>
<item>158</item>
<item>417</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>146</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>146</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>159</item>
<item>160</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>50</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>161</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>or_cond</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>153</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>153</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>162</item>
<item>163</item>
</oprand_edges>
<opcode>and</opcode>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>153</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>153</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>164</item>
<item>165</item>
<item>166</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>in_temp_V</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>155</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>in_temp.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>168</item>
<item>169</item>
</oprand_edges>
<opcode>read</opcode>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>156</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>156</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>170</item>
<item>171</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_8</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>157</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>157</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>172</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>line_buffer_V_1_addr_1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>157</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>157</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
<item>175</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>157</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>157</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>176</item>
<item>177</item>
<item>418</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>158</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>158</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>178</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>tmp_9</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>161</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>179</item>
<item>180</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>or_cond1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>161</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>181</item>
<item>182</item>
</oprand_edges>
<opcode>and</opcode>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>161</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>161</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>183</item>
<item>184</item>
<item>185</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>window_V_0_load</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>186</item>
<item>421</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>p_shl1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>188</item>
<item>189</item>
<item>191</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>p_shl1_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>192</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>p_shl2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>194</item>
<item>195</item>
<item>197</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>p_shl2_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>198</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>r_V</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>199</item>
<item>200</item>
</oprand_edges>
<opcode>sub</opcode>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>r_V_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>201</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>window_V_1_load</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>422</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>rhs_V_s</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>203</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>r_V_s</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>204</item>
<item>206</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>window_V_2_load</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>207</item>
<item>423</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>rhs_V_1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>208</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>r_V_2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>209</item>
<item>211</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>tmp_13_2_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>212</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>tmp1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>213</item>
<item>214</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>tmp1_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>215</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>temp_v_V_2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>36</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>216</item>
<item>217</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>convolution_buffer_V_1_load</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>17</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>218</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>tmp</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>22</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
<item>222</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>p_shl3_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>42</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>223</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>tmp_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>20</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>225</item>
<item>226</item>
<item>227</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>p_shl4_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>42</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>228</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>r_V_4</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>42</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>sub</opcode>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>convolution_buffer_V_2_load</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>17</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>231</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>41</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>41</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>232</item>
<item>233</item>
<item>420</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>lhs_V_3_1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>234</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>r_V_4_1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>235</item>
<item>237</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>lhs_V_cast_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>238</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>r_V_1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>23</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>239</item>
<item>241</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>r_V_1_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>242</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>tmp2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>243</item>
<item>244</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>temp_h_V</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>245</item>
<item>246</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>46</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>46</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>247</item>
<item>248</item>
<item>419</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>sext_cast</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>48</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>249</item>
</oprand_edges>
<opcode>sext</opcode>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>mul</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>48</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>250</item>
<item>252</item>
</oprand_edges>
<opcode>mul</opcode>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>neg_mul</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>48</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>254</item>
<item>255</item>
</oprand_edges>
<opcode>sub</opcode>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>tmp_2</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>257</item>
<item>258</item>
<item>260</item>
</oprand_edges>
<opcode>bitselect</opcode>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>tmp_3</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>262</item>
<item>263</item>
<item>265</item>
<item>267</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>tmp_6</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>268</item>
<item>269</item>
<item>270</item>
<item>271</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>p_v_v</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>272</item>
<item>273</item>
<item>274</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>neg_ti</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>276</item>
<item>277</item>
</oprand_edges>
<opcode>sub</opcode>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name>tmp_10</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>278</item>
</oprand_edges>
<opcode>trunc</opcode>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name>tmp_11</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</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>280</item>
<item>281</item>
<item>282</item>
<item>284</item>
</oprand_edges>
<opcode>partselect</opcode>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name>tmp_12</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>285</item>
<item>286</item>
<item>287</item>
</oprand_edges>
<opcode>select</opcode>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>tmp_13</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>48</lineNumber>
<contextFuncName>pixel_weighted_average_separable</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>pixel_weighted_average_separable</second>
</first>
<second>48</second>
</item>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>288</item>
<item>290</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>182</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</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>292</item>
<item>293</item>
<item>294</item>
</oprand_edges>
<opcode>write</opcode>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>183</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>183</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>295</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>col_1</name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>110</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>110</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>296</item>
<item>298</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>116</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>299</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name></name>
<fileName>Sep_Convolution_Filter/sep_convolution_filter.cpp</fileName>
<fileDirectory>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</fileDirectory>
<lineNumber>191</lineNumber>
<contextFuncName>sep_convolution_filter</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Dropbox/Filtri_VivadoHLS</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>Sep_Convolution_Filter/sep_convolution_filter.cpp</first>
<second>sep_convolution_filter</second>
</first>
<second>191</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_92">
<Value>
<Obj>
<type>2</type>
<id>121</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>19</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_93">
<Value>
<Obj>
<type>2</type>
<id>126</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>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_94">
<Value>
<Obj>
<type>2</type>
<id>131</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_95">
<Value>
<Obj>
<type>2</type>
<id>137</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>19</bitwidth>
</Value>
<const_type>0</const_type>
<content>308321</content>
</item>
<item class_id_reference="16" object_id="_96">
<Value>
<Obj>
<type>2</type>
<id>140</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>19</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_97">
<Value>
<Obj>
<type>2</type>
<id>147</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_98">
<Value>
<Obj>
<type>2</type>
<id>190</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_99">
<Value>
<Obj>
<type>2</type>
<id>196</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_100">
<Value>
<Obj>
<type>2</type>
<id>205</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>67</content>
</item>
<item class_id_reference="16" object_id="_101">
<Value>
<Obj>
<type>2</type>
<id>210</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>65422</content>
</item>
<item class_id_reference="16" object_id="_102">
<Value>
<Obj>
<type>2</type>
<id>236</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<const_type>0</const_type>
<content>71</content>
</item>
<item class_id_reference="16" object_id="_103">
<Value>
<Obj>
<type>2</type>
<id>240</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>23</bitwidth>
</Value>
<const_type>0</const_type>
<content>8388586</content>
</item>
<item class_id_reference="16" object_id="_104">
<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>48</bitwidth>
</Value>
<const_type>0</const_type>
<content>16909321</content>
</item>
<item class_id_reference="16" object_id="_105">
<Value>
<Obj>
<type>2</type>
<id>253</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>48</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_106">
<Value>
<Obj>
<type>2</type>
<id>259</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>23</content>
</item>
<item class_id_reference="16" object_id="_107">
<Value>
<Obj>
<type>2</type>
<id>264</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>31</content>
</item>
<item class_id_reference="16" object_id="_108">
<Value>
<Obj>
<type>2</type>
<id>266</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>47</content>
</item>
<item class_id_reference="16" object_id="_109">
<Value>
<Obj>
<type>2</type>
<id>275</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>17</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_110">
<Value>
<Obj>
<type>2</type>
<id>283</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>38</content>
</item>
<item class_id_reference="16" object_id="_111">
<Value>
<Obj>
<type>2</type>
<id>289</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>63</content>
</item>
<item class_id_reference="16" object_id="_112">
<Value>
<Obj>
<type>2</type>
<id>297</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_113">
<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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>641</content>
</item>
<item class_id_reference="16" object_id="_114">
<Value>
<Obj>
<type>2</type>
<id>307</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>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_115">
<Value>
<Obj>
<type>2</type>
<id>310</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>9</bitwidth>
</Value>
<const_type>0</const_type>
<content>480</content>
</item>
<item class_id_reference="16" object_id="_116">
<Value>
<Obj>
<type>2</type>
<id>328</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>640</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="_117">
<Obj>
<type>3</type>
<id>16</id>
<name>.preheader68.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_118">
<Obj>
<type>3</type>
<id>23</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>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_119">
<Obj>
<type>3</type>
<id>41</id>
<name>.reset</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>12</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>39</item>
<item>40</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_120">
<Obj>
<type>3</type>
<id>51</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>9</count>
<item_version>0</item_version>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_121">
<Obj>
<type>3</type>
<id>54</id>
<name>.loopexit</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>52</item>
<item>53</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_122">
<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>6</count>
<item_version>0</item_version>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_123">
<Obj>
<type>3</type>
<id>65</id>
<name>.loopexit._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>62</item>
<item>63</item>
<item>64</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_124">
<Obj>
<type>3</type>
<id>113</id>
<name>.preheader79.0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>47</count>
<item_version>0</item_version>
<item>66</item>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</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>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</item>
<item>106</item>
<item>107</item>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_125">
<Obj>
<type>3</type>
<id>117</id>
<name>._crit_edge74</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="_126">
<Obj>
<type>3</type>
<id>119</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>118</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>189</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_127">
<id>120</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>121</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>123</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>125</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>128</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>130</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>133</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>135</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>143</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>144</id>
<edge_type>2</edge_type>
<source_obj>119</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>161</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>166</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>178</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>184</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>185</id>
<edge_type>2</edge_type>
<source_obj>113</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>190</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>196</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>205</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>210</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>190</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>196</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>236</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_226">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_227">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_228">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_229">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_230">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_231">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_232">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_233">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_234">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_235">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_236">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>251</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_237">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>253</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_238">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_239">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_240">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>259</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_241">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_242">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>264</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_243">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>266</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_244">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_245">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>264</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_246">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>266</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_247">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_248">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_249">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_250">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>275</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_251">
<id>277</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_252">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_253">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_254">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>264</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_255">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>283</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_256">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_257">
<id>286</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_258">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_259">
<id>288</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_260">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>289</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_261">
<id>293</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_262">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_263">
<id>295</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_264">
<id>296</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_265">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>297</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_266">
<id>299</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_267">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_268">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>301</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_269">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_270">
<id>304</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_271">
<id>305</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_272">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_273">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>307</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_274">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_275">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>310</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_276">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_277">
<id>313</id>
<edge_type>1</edge_type>
<source_obj>310</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_278">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_279">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_280">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_281">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_282">
<id>318</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_283">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_284">
<id>320</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_285">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_286">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_287">
<id>323</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_288">
<id>324</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_289">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_290">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_291">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_292">
<id>329</id>
<edge_type>1</edge_type>
<source_obj>328</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_293">
<id>330</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_294">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_295">
<id>332</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_296">
<id>404</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_297">
<id>405</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_298">
<id>406</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_299">
<id>407</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_300">
<id>408</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_301">
<id>409</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_302">
<id>410</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_303">
<id>411</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_304">
<id>412</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_305">
<id>413</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_306">
<id>414</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_307">
<id>415</id>
<edge_type>2</edge_type>
<source_obj>113</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_308">
<id>416</id>
<edge_type>2</edge_type>
<source_obj>117</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_309">
<id>417</id>
<edge_type>4</edge_type>
<source_obj>44</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_310">
<id>418</id>
<edge_type>4</edge_type>
<source_obj>47</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_311">
<id>419</id>
<edge_type>4</edge_type>
<source_obj>89</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_312">
<id>420</id>
<edge_type>4</edge_type>
<source_obj>83</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_313">
<id>421</id>
<edge_type>4</edge_type>
<source_obj>45</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_314">
<id>422</id>
<edge_type>4</edge_type>
<source_obj>49</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_315">
<id>423</id>
<edge_type>4</edge_type>
<source_obj>56</source_obj>
<sink_obj>76</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_316">
<mId>1</mId>
<mTag>sep_convolution_filter</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</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>308324</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_317">
<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>16</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="_318">
<mId>3</mId>
<mTag>Loop_row_Loop_col</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>8</count>
<item_version>0</item_version>
<item>23</item>
<item>41</item>
<item>51</item>
<item>54</item>
<item>61</item>
<item>65</item>
<item>113</item>
<item>117</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>308321</mMinTripCount>
<mMaxTripCount>308321</mMaxTripCount>
<mMinLatency>308322</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_319">
<mId>4</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>119</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="_320">
<states class_id="25" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_321">
<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="_322">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_323">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_324">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_325">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_326">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_327">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_328">
<id>2</id>
<operations>
<count>30</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_329">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_330">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_331">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_332">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_333">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_334">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_335">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_336">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_337">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_338">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_339">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_340">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_341">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_342">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_343">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_344">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_345">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_346">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_347">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_348">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_349">
<id>44</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_350">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_351">
<id>47</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_352">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_353">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_354">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_355">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_356">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_357">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_358">
<id>115</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_359">
<id>3</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_360">
<id>44</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_361">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_362">
<id>47</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_363">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_364">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_365">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_366">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_367">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_368">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_369">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_370">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_371">
<id>4</id>
<operations>
<count>54</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_372">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_373">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_374">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_375">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_376">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_377">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_378">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_379">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_380">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_381">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_382">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_383">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_384">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_385">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_386">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_387">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_388">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_389">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_390">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_391">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_392">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_393">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_394">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_395">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_396">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_397">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_398">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_399">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_400">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_401">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_402">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_403">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_404">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_405">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_406">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_407">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_408">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_409">
<id>98</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_410">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_411">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_412">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_413">
<id>102</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_414">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_415">
<id>104</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_416">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_417">
<id>106</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_418">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_419">
<id>108</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_420">
<id>109</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_421">
<id>110</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_422">
<id>111</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_423">
<id>112</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_424">
<id>114</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_425">
<id>116</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_426">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_427">
<id>118</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_428">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>69</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="_429">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>85</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="_430">
<inState>4</inState>
<outState>2</outState>
<condition>
<id>86</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="_431">
<inState>2</inState>
<outState>5</outState>
<condition>
<id>84</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>20</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_432">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>87</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>20</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>89</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>15</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</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>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</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>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>53</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>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>16</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>2</first>
<second>2</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="_433">
<region_name>Loop_row_Loop_col</region_name>
<basic_blocks>
<count>8</count>
<item_version>0</item_version>
<item>23</item>
<item>41</item>
<item>51</item>
<item>54</item>
<item>61</item>
<item>65</item>
<item>113</item>
<item>117</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>71</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>138</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>44</item>
<item>44</item>
<item>48</item>
</second>
</item>
<item>
<first>143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>150</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>47</item>
<item>47</item>
<item>59</item>
</second>
</item>
<item>
<first>159</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>229</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>247</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>267</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>313</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>325</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>344</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>356</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>374</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>397</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>409</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>413</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>431</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>435</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>441</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>445</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>456</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>475</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>485</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>495</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>509</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>531</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>538</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>92</item>
<item>97</item>
</second>
</item>
<item>
<first>547</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>94</item>
<item>95</item>
<item>96</item>
</second>
</item>
<item>
<first>556</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
<item>82</item>
</second>
</item>
<item>
<first>566</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>80</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>57</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>col_1_fu_313</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>col_mid2_fu_221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>col_phi_fu_196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>exitcond_fu_215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>grp_fu_538</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>92</item>
<item>97</item>
</second>
</item>
<item>
<first>grp_fu_547</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>94</item>
<item>95</item>
<item>96</item>
</second>
</item>
<item>
<first>grp_fu_556</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
<item>82</item>
</second>
</item>
<item>
<first>grp_fu_566</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>80</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>lhs_V_3_1_fu_441</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>lhs_V_cast_cast_fu_445</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>line_buffer_V_0_addr_gep_fu_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>line_buffer_V_1_addr_1_gep_fu_159</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>line_buffer_V_1_addr_gep_fu_143</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>mul_fu_456</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>100</item>
</second>
</item>
<item>
<first>neg_mul_fu_462</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>101</item>
</second>
</item>
<item>
<first>neg_ti_fu_503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</second>
</item>
<item>
<first>or_cond1_fu_307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>or_cond_fu_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_shl1_cast_fu_352</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>p_shl1_fu_344</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</second>
</item>
<item>
<first>p_shl2_cast_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>p_shl2_fu_356</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>p_shl3_cast_fu_409</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>p_shl4_cast_fu_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>p_v_v_fu_495</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>r_V_4_fu_425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>r_V_cast_fu_374</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>r_V_fu_368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>rhs_V_1_fu_390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>rhs_V_s_fu_382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>74</item>
</second>
</item>
<item>
<first>row_mid2_fu_275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>row_phi_fu_185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>row_s_fu_229</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>sext_cast_fu_453</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>tmp1_cast_fu_394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>tmp6_fu_241</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_10_fu_509</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</second>
</item>
<item>
<first>tmp_11_fu_513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>108</item>
</second>
</item>
<item>
<first>tmp_12_fu_523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</second>
</item>
<item>
<first>tmp_13_fu_531</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</second>
</item>
<item>
<first>tmp_1_fu_413</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>tmp_2_fu_468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</second>
</item>
<item>
<first>tmp_2_mid1_fu_255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_2_mid2_fu_267</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_3_fu_475</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</second>
</item>
<item>
<first>tmp_4_fu_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>tmp_5_fu_289</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp_6_fu_485</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</second>
</item>
<item>
<first>tmp_8_fu_336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_9_fu_301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>tmp_fu_401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>tmp_mid1_fu_235</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>tmp_mid2_fu_247</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_s_fu_261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</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>12</count>
<item_version>0</item_version>
<item>
<first>convolution_buffer_V_1_load_load_fu_397</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>convolution_buffer_V_2_load_load_fu_431</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>in_temp_V_read_fu_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>stg_103_write_fu_124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>stg_43_store_fu_319</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>stg_46_store_fu_325</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>stg_48_store_fu_331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>stg_82_store_fu_435</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>90</item>
</second>
</item>
<item>
<first>stg_90_store_fu_448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>98</item>
</second>
</item>
<item>
<first>window_V_0_load_load_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>window_V_1_load_load_fu_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>window_V_2_load_load_fu_386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</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>4</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>line_buffer_V_0</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>44</item>
<item>44</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_0</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_1</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>47</item>
<item>47</item>
</second>
</item>
<item>
<first>
<first>line_buffer_V_1</first>
<second>1</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>14</count>
<item_version>0</item_version>
<item>
<first>170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>181</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>575</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>579</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>584</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>589</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>594</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>598</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>604</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>609</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>613</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>619</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>623</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>14</count>
<item_version>0</item_version>
<item>
<first>col_1_reg_623</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</second>
</item>
<item>
<first>col_mid2_reg_584</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>col_reg_192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_575</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>in_temp_V_reg_613</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_579</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>line_buffer_V_0_addr_reg_598</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>line_buffer_V_1_addr_reg_604</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>or_cond1_reg_619</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>or_cond_reg_609</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>row_mid2_reg_589</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>row_reg_181</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_4_reg_594</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>181</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>col_reg_192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_170</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>row_reg_181</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</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_img_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>55</item>
</second>
</item>
</second>
</item>
<item>
<first>out_img_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>111</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="55" 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>
|
-- License: ISC
with Ada.Text_IO;
package body JSA.Generic_Optional_Value is
function "+" (Item : in Element) return Instance is
begin
return (Set => True,
Value => Item);
end "+";
function "+" (Item : in Instance) return Element is
begin
return Item.Value;
end "+";
function "=" (Left : in Element;
Right : in Instance) return Boolean is
begin
return Right.Set and then Left = Right.Value;
end "=";
function "=" (Left : in Instance;
Right : in Element) return Boolean is
begin
return Left.Set and then Left.Value = Right;
end "=";
function Image (Item : in Instance) return String is
begin
case Item.Set is
when True =>
return Image (Item.Value);
when False =>
return "";
end case;
end Image;
function Value (Item : in String) return Instance is
begin
if Item = "" then
return (Set => False);
else
return (Set => True,
Value => Value (Item));
end if;
exception
when others =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Current_Error,
Item => "JSA.Generic_Optional_Value.Value (""" & Item & """);");
raise;
end Value;
protected body Buffer is separate;
end JSA.Generic_Optional_Value;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2012 Felix Krause <contact@flyx.org>
--
-- 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 GL.Runtime_Loading;
with GL.Blending;
with GL.Buffers;
with GL.Context;
with GL.Debug;
with GL.Debug_Types;
with GL.Enums.Getter;
with GL.Enums.Internalformat;
with GL.Enums.Textures;
with GL.Errors;
with GL.Fences;
with GL.Low_Level.Enums;
with GL.Objects.Buffers;
with GL.Objects.Framebuffers;
with GL.Objects.Queries;
with GL.Objects.Shaders;
with GL.Objects.Textures;
with GL.Pixels.Queries;
with GL.Rasterization;
with GL.Toggles;
with GL.Types.Colors;
with GL.Types.Compute;
with GL.Types.Debug;
with GL.Types.Pointers;
with GL.Viewports;
with Interfaces.C.Strings;
with System;
private package GL.API is
pragma Preelaborate;
use GL.Types;
function GL_Subprogram_Reference (Function_Name : String) return System.Address;
-- Implementation is platform-specific. Therefore, gl-api.adb is in the
-- platform-specific source folders.
package Loader is new Runtime_Loading (GL_Subprogram_Reference);
-- Everything newer than OpenGL 1.1 will not be statically bound,
-- but loaded with GL.Low_Level.Loader at runtime.
--
-- Also, all functions that have been deprecated with OpenGL 3.0
-- will not be statically bound, as they may be omitted by implementors
-- when they choose to only implement the OpenGL Core Profile.
subtype Zero is Int range 0 .. 0;
package Get_Error is new Loader.Function_Without_Params
("glGetError", Errors.Error_Code);
package Flush is new Loader.Procedure_Without_Params ("glFlush");
package Get_Graphics_Reset_Status is new Loader.Function_Without_Params
("glGetGraphicsResetStatus", Context.Reset_Status);
-----------------------------------------------------------------------------
-- Parameter getters --
-----------------------------------------------------------------------------
package Get_Boolean is new Loader.Getter_With_2_Params
("glGetBooleanv", Enums.Getter.Parameter, Low_Level.Bool);
package Get_Double_Vec2_I is new Loader.Getter_With_3_Params
("glGetDoublei_v", Enums.Getter.Parameter, UInt, Doubles.Vector2);
package Get_Single is new Loader.Getter_With_2_Params
("glGetFloatv", Enums.Getter.Parameter, Single);
package Get_Single_Vec2 is new Loader.Getter_With_2_Params
("glGetFloatv", Enums.Getter.Parameter, Singles.Vector2);
package Get_Single_Vec4_I is new Loader.Getter_With_3_Params
("glGetFloati_v", Enums.Getter.Parameter, UInt, Singles.Vector4);
package Get_Color is new Loader.Getter_With_2_Params
("glGetFloatv", Enums.Getter.Parameter, Colors.Color);
package Get_Enabled_Color is new Loader.Getter_With_3_Params
("glGetBooleani_v", Enums.Getter.Parameter, Buffers.Draw_Buffer_Index,
Colors.Enabled_Color);
package Get_Long is new Loader.Getter_With_2_Params
("glGetInteger64v", Enums.Getter.Parameter, Long);
package Get_Integer is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Int);
package Get_Unsigned_Integer is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, UInt);
package Get_Size is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Size);
package Get_Size_I is new Loader.Getter_With_3_Params
("glGetIntegeri_v", Enums.Getter.Parameter, UInt, Size);
package Get_Int_Vec4_I is new Loader.Getter_With_3_Params
("glGetIntegeri_v", Enums.Getter.Parameter, UInt, Ints.Vector4);
package Get_Blend_Factor is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Blending.Blend_Factor);
package Get_Alignment is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Pixels.Alignment);
package Get_Blend_Equation is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Blending.Equation);
package Get_Clip_Origin is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Viewports.Viewport_Origin);
package Get_Clip_Depth_Mode is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Viewports.Depth_Mode);
package Get_Compare_Function is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Compare_Function);
package Get_Orientation is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Rasterization.Orientation);
package Get_Face_Selector is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Rasterization.Face_Selector);
package Get_Polygon_Mode is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Rasterization.Polygon_Mode_Type);
package Get_Logic_Op is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Blending.Logic_Op);
package Get_Stencil_Action is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Buffers.Stencil_Action);
package Get_String is new Loader.Function_With_1_Param
("glGetString", Enums.Getter.String_Parameter, C.Strings.chars_ptr);
package Get_String_I is new Loader.Function_With_2_Params
("glGetStringi", Enums.Getter.String_Parameter, UInt, C.Strings.chars_ptr);
package Get_Context_Flags is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Low_Level.Bitfield);
package Get_Context_Reset_Notification is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Context.Context_Reset_Notification);
package Get_Context_Release_Behavior is new Loader.Getter_With_2_Params
("glGetIntegerv", Enums.Getter.Parameter, Context.Context_Release_Behavior);
-----------------------------------------------------------------------------
-- Toggles --
-----------------------------------------------------------------------------
package Enable is new Loader.Procedure_With_1_Param
("glEnable", Toggles.Toggle);
package Disable is new Loader.Procedure_With_1_Param
("glDisable", Toggles.Toggle);
package Is_Enabled is new Loader.Function_With_1_Param
("glIsEnabled", Toggles.Toggle, Low_Level.Bool);
package Enable_I is new Loader.Procedure_With_2_Params
("glEnablei", Toggles.Toggle_Indexed, UInt);
package Disable_I is new Loader.Procedure_With_2_Params
("glDisablei", Toggles.Toggle_Indexed, UInt);
package Is_Enabled_I is new Loader.Function_With_2_Params
("glIsEnabledi", Toggles.Toggle_Indexed, UInt, Low_Level.Bool);
-----------------------------------------------------------------------------
-- Clipping --
-----------------------------------------------------------------------------
package Clip_Control is new Loader.Procedure_With_2_Params
("glClipControl", Viewports.Viewport_Origin, Viewports.Depth_Mode);
-----------------------------------------------------------------------------
-- Culling --
-----------------------------------------------------------------------------
package Cull_Face is new Loader.Procedure_With_1_Param
("glCullFace", Rasterization.Face_Selector);
package Front_Face is new Loader.Procedure_With_1_Param
("glFrontFace", Rasterization.Orientation);
-----------------------------------------------------------------------------
-- Pixel stuff --
-----------------------------------------------------------------------------
package Pixel_Store_Size is new Loader.Procedure_With_2_Params
("glPixelStorei", Enums.Pixel_Store_Param, Size);
package Pixel_Store_Alignment is new Loader.Procedure_With_2_Params
("glPixelStorei", Enums.Pixel_Store_Param, Pixels.Alignment);
-----------------------------------------------------------------------------
-- Drawing --
-----------------------------------------------------------------------------
package Draw_Arrays_Instanced_Base_Instance is new Loader.Procedure_With_5_Params
("glDrawArraysInstancedBaseInstance", Connection_Mode, Int, Size, Size, UInt);
package Multi_Draw_Arrays_Indirect is new Loader.Procedure_With_4_Params
("glMultiDrawArraysIndirect", Connection_Mode, Int, Size, Size);
package Multi_Draw_Arrays_Indirect_Count is new Loader.Procedure_With_5_Params
("glMultiDrawArraysIndirectCount", Connection_Mode, Int, Low_Level.IntPtr, Size, Size);
package Draw_Elements_Instanced_Base_Vertex_Base_Instance
is new Loader.Procedure_With_7_Params
("glDrawElementsInstancedBaseVertexBaseInstance", Connection_Mode, Size,
Index_Type, Low_Level.IntPtr, Size, Int, UInt);
package Multi_Draw_Elements_Indirect is new Loader.Procedure_With_5_Params
("glMultiDrawElementsIndirect", Connection_Mode, Index_Type,
Int, Size, Size);
package Multi_Draw_Elements_Indirect_Count is new Loader.Procedure_With_6_Params
("glMultiDrawElementsIndirectCount", Connection_Mode, Index_Type,
Int, Low_Level.IntPtr, Size, Size);
-----------------------------------------------------------------------------
-- Blending --
-----------------------------------------------------------------------------
package Blend_Func_Separate is new Loader.Procedure_With_4_Params
("glBlendFuncSeparate", Blending.Blend_Factor, Blending.Blend_Factor,
Blending.Blend_Factor, Blending.Blend_Factor);
package Blend_Func_Separate_I is new Loader.Procedure_With_5_Params
("glBlendFuncSeparatei", Buffers.Draw_Buffer_Index, Blending.Blend_Factor,
Blending.Blend_Factor, Blending.Blend_Factor, Blending.Blend_Factor);
package Blend_Color is new Loader.Procedure_With_4_Params
("glBlendColor", Colors.Component, Colors.Component, Colors.Component,
Colors.Component);
package Blend_Equation_Separate is new Loader.Procedure_With_2_Params
("glBlendEquationSeparate", Blending.Equation, Blending.Equation);
package Blend_Equation_Separate_I is new Loader.Procedure_With_3_Params
("glBlendEquationSeparatei", Buffers.Draw_Buffer_Index, Blending.Equation,
Blending.Equation);
-----------------------------------------------------------------------------
-- Rasterization --
-----------------------------------------------------------------------------
package Polygon_Mode is new Loader.Procedure_With_2_Params
("glPolygonMode", Rasterization.Face_Selector, Rasterization.Polygon_Mode_Type);
package Polygon_Offset_Clamp is new Loader.Procedure_With_3_Params
("glPolygonOffsetClamp", Single, Single, Single);
-----------------------------------------------------------------------------
-- Multisample shading --
-----------------------------------------------------------------------------
package Min_Sample_Shading is new Loader.Procedure_With_1_Param
("glMinSampleShading", Single);
-- TODO glSampleMaski (replaces glSampleCoverage), glGetMultisample
-----------------------------------------------------------------------------
-- Buffers --
-----------------------------------------------------------------------------
package Color_Mask is new Loader.Procedure_With_4_Params
("glColorMask", Low_Level.Bool, Low_Level.Bool, Low_Level.Bool, Low_Level.Bool);
package Color_Mask_Indexed is new Loader.Procedure_With_5_Params
("glColorMaski", Buffers.Draw_Buffer_Index,
Low_Level.Bool, Low_Level.Bool, Low_Level.Bool, Low_Level.Bool);
-----------------------------------------------------------------------------
-- Depth and stencil buffers --
-----------------------------------------------------------------------------
package Depth_Mask is new Loader.Procedure_With_1_Param
("glDepthMask", Low_Level.Bool);
package Depth_Func is new Loader.Procedure_With_1_Param
("glDepthFunc", Compare_Function);
package Stencil_Func_Separate is new Loader.Procedure_With_4_Params
("glStencilFuncSeparate", Rasterization.Face_Selector,
Compare_Function, Int, UInt);
package Stencil_Op_Separate is new Loader.Procedure_With_4_Params
("glStencilOpSeparate", Rasterization.Face_Selector, Buffers.Stencil_Action,
Buffers.Stencil_Action, Buffers.Stencil_Action);
package Stencil_Mask_Separate is new Loader.Procedure_With_2_Params
("glStencilMaskSeparate", Rasterization.Face_Selector, UInt);
-----------------------------------------------------------------------------
-- Textures --
-----------------------------------------------------------------------------
package Texture_Parameter_Int is new Loader.Procedure_With_3_Params
("glTextureParameteri", UInt, Enums.Textures.Parameter, Int);
package Get_Texture_Parameter_Int is new Loader.Getter_With_3_Params
("glGetTextureParameteriv", UInt, Enums.Textures.Parameter, Int);
package Get_Texture_Level_Parameter is new Loader.Getter_With_4_Params
("glGetTextureLevelParameteriv", UInt, Objects.Textures.Mipmap_Level,
Enums.Textures.Level_Parameter, Size);
package Get_Texture_Level_Parameter_Format_I is new Loader.Getter_With_4_Params
("glGetTextureLevelParameteriv", UInt, Objects.Textures.Mipmap_Level,
Enums.Textures.Level_Parameter, Pixels.Internal_Format);
package Get_Texture_Level_Parameter_Format_C is new Loader.Getter_With_4_Params
("glGetTextureLevelParameteriv", UInt, Objects.Textures.Mipmap_Level,
Enums.Textures.Level_Parameter, Pixels.Compressed_Format);
package Delete_Textures is new Loader.Procedure_With_2_Params
("glDeleteTextures", Size, Low_Level.UInt_Array);
package Texture_Buffer is new Loader.Procedure_With_3_Params
("glTextureBuffer", UInt, Pixels.Internal_Format_Buffer_Texture, UInt);
package Texture_Buffer_Range is new Loader.Procedure_With_5_Params
("glTextureBufferRange", UInt, Pixels.Internal_Format_Buffer_Texture, UInt,
Low_Level.IntPtr, Size);
package Texture_Storage_1D is new Loader.Procedure_With_4_Params
("glTextureStorage1D", UInt, Size, Pixels.Internal_Format, Size);
package Texture_Storage_2D_I is new Loader.Procedure_With_5_Params
("glTextureStorage2D", UInt, Size, Pixels.Internal_Format, Size, Size);
package Texture_Storage_3D_I is new Loader.Procedure_With_6_Params
("glTextureStorage3D", UInt, Size, Pixels.Internal_Format, Size, Size, Size);
package Texture_Storage_2D_C is new Loader.Procedure_With_5_Params
("glTextureStorage2D", UInt, Size, Pixels.Compressed_Format, Size, Size);
package Texture_Storage_3D_C is new Loader.Procedure_With_6_Params
("glTextureStorage3D", UInt, Size, Pixels.Compressed_Format, Size, Size, Size);
package Texture_Storage_2D_Multisample_I is new Loader.Procedure_With_6_Params
("glTextureStorage2DMultisample", UInt, Size, Pixels.Internal_Format,
Size, Size, Low_Level.Bool);
package Texture_Storage_3D_Multisample_I is new Loader.Procedure_With_7_Params
("glTextureStorage3DMultisample", UInt, Size, Pixels.Internal_Format,
Size, Size, Size, Low_Level.Bool);
package Texture_Storage_2D_Multisample_C is new Loader.Procedure_With_6_Params
("glTextureStorage2DMultisample", UInt, Size, Pixels.Compressed_Format,
Size, Size, Low_Level.Bool);
package Texture_Storage_3D_Multisample_C is new Loader.Procedure_With_7_Params
("glTextureStorage3DMultisample", UInt, Size, Pixels.Compressed_Format,
Size, Size, Size, Low_Level.Bool);
package Texture_Sub_Image_1D is new Loader.Procedure_With_7_Params
("glTextureSubImage1D", UInt, Objects.Textures.Mipmap_Level,
Int, Size, Pixels.Format, Pixels.Data_Type,
System.Address);
package Texture_Sub_Image_2D is new Loader.Procedure_With_9_Params
("glTextureSubImage2D", UInt, Objects.Textures.Mipmap_Level,
Int, Int, Size, Size, Pixels.Format, Pixels.Data_Type,
System.Address);
package Texture_Sub_Image_3D is new Loader.Procedure_With_11_Params
("glTextureSubImage3D", UInt, Objects.Textures.Mipmap_Level,
Int, Int, Int, Size, Size, Size, Pixels.Format, Pixels.Data_Type,
System.Address);
package Compressed_Texture_Sub_Image_2D is new Loader.Procedure_With_9_Params
("glCompressedTextureSubImage2D", UInt, Objects.Textures.Mipmap_Level,
Int, Int, Size, Size, Pixels.Compressed_Format, Size,
System.Address);
package Compressed_Texture_Sub_Image_3D is new Loader.Procedure_With_11_Params
("glCompressedTextureSubImage3D", UInt, Objects.Textures.Mipmap_Level,
Int, Int, Int, Size, Size, Size, Pixels.Compressed_Format, Size,
System.Address);
package Copy_Image_Sub_Data is new Loader.Procedure_With_15_Params
("glCopyImageSubData", UInt, Low_Level.Enums.Texture_Kind,
Objects.Textures.Mipmap_Level, Int, Int, Int,
UInt, Low_Level.Enums.Texture_Kind,
Objects.Textures.Mipmap_Level, Int, Int, Int,
Size, Size, Size);
package Clear_Tex_Image is new Loader.Procedure_With_5_Params
("glClearTexImage", UInt, Objects.Textures.Mipmap_Level,
Pixels.Format, Pixels.Data_Type, System.Address);
package Clear_Tex_Sub_Image is new Loader.Procedure_With_11_Params
("glClearTexSubImage", UInt, Objects.Textures.Mipmap_Level,
Int, Int, Int, Size, Size, Size, Pixels.Format, Pixels.Data_Type,
System.Address);
package Generate_Texture_Mipmap is new Loader.Procedure_With_1_Param
("glGenerateTextureMipmap", UInt);
-- glGetTextureSubImage uses an access value of Interfaces.C.Pointers.Element_Array,
-- therefore declared in GL.Objects.Textures
package Get_Compressed_Texture_Sub_Image is new Loader.Procedure_With_10_Params
("glGetCompressedTextureSubImage", UInt, Objects.Textures.Mipmap_Level,
Int, Int, Int, Size, Size, Size, Size, Types.Pointers.UByte_Array_Access);
package Invalidate_Tex_Image is new Loader.Procedure_With_2_Params
("glInvalidateTexImage", UInt, Objects.Textures.Mipmap_Level);
package Invalidate_Tex_Sub_Image is new Loader.Procedure_With_8_Params
("glInvalidateTexSubImage", UInt, Objects.Textures.Mipmap_Level,
Int, Int, Int, Size, Size, Size);
package Create_Textures is new Loader.Getter_With_3_Params
("glCreateTextures", Low_Level.Enums.Texture_Kind, Size, UInt);
package Gen_Textures is new Loader.Getter_With_2_Params
("glGenTextures", Size, UInt);
-- Only to be used by Texture_View
package Texture_View_I is new Loader.Procedure_With_8_Params
("glTextureView", UInt, Low_Level.Enums.Texture_Kind, UInt,
Pixels.Internal_Format, UInt, UInt, UInt, UInt);
package Texture_View_C is new Loader.Procedure_With_8_Params
("glTextureView", UInt, Low_Level.Enums.Texture_Kind, UInt,
Pixels.Compressed_Format, UInt, UInt, UInt, UInt);
package Bind_Textures is new Loader.Procedure_With_3_Params
("glBindTextures", Objects.Textures.Texture_Unit, Size, Low_Level.UInt_Array);
package Get_Internal_Format_A is new Loader.Getter_With_5_Params
("glGetInternalformativ", Low_Level.Enums.Texture_Kind, Pixels.Internal_Format,
Enums.Internalformat.Parameter, Size, Size_Array);
package Get_Internal_Format is new Loader.Getter_With_5_Params
("glGetInternalformativ", Low_Level.Enums.Texture_Kind, Pixels.Internal_Format,
Enums.Internalformat.Parameter, Size, Size);
package Get_Internal_Format_Long is new Loader.Getter_With_5_Params
("glGetInternalformati64v", Low_Level.Enums.Texture_Kind, Pixels.Internal_Format,
Enums.Internalformat.Parameter, Size, Long_Size);
package Get_Internal_Format_C is new Loader.Getter_With_5_Params
("glGetInternalformativ", Low_Level.Enums.Texture_Kind, Pixels.Compressed_Format,
Enums.Internalformat.Parameter, Size, Size);
package Get_Internal_Format_Support is new Loader.Getter_With_5_Params
("glGetInternalformativ", Low_Level.Enums.Texture_Kind, Pixels.Internal_Format,
Enums.Internalformat.Parameter, Size, Pixels.Queries.Support);
-----------------------------------------------------------------------------
-- Images --
-----------------------------------------------------------------------------
package Bind_Image_Textures is new Loader.Procedure_With_3_Params
("glBindImageTextures", Objects.Textures.Image_Unit, Size, Low_Level.UInt_Array);
-----------------------------------------------------------------------------
-- Buffer objects --
-----------------------------------------------------------------------------
package Create_Buffers is new Loader.Getter_With_2_Params
("glCreateBuffers", Size, UInt);
package Delete_Buffers is new Loader.Array_Proc_With_2_Params
("glDeleteBuffers", Size, UInt, Low_Level.UInt_Array);
package Bind_Buffer is new Loader.Procedure_With_2_Params
("glBindBuffer", Enums.Buffer_Kind, UInt);
package Bind_Buffer_Base is new Loader.Procedure_With_3_Params
("glBindBufferBase", Enums.Buffer_Kind, UInt, UInt);
package Bind_Buffer_Range is new Loader.Procedure_With_5_Params
("glBindBufferRange", Enums.Buffer_Kind, UInt, UInt,
Low_Level.IntPtr, Low_Level.SizeIPtr);
package Named_Buffer_Sub_Data is new Loader.Procedure_With_4_Params
("glNamedBufferSubData", UInt, Low_Level.IntPtr, Low_Level.SizeIPtr,
System.Address);
package Named_Buffer_Storage is new Loader.Procedure_With_4_Params
("glNamedBufferStorage", UInt, Low_Level.SizeIPtr,
System.Address, Low_Level.Bitfield);
-- glMapNamedBufferRange returns an instance of generic Interfaces.C.Pointers.Pointer,
-- therefore declared in GL.Objects.Buffers
package Unmap_Named_Buffer is new Loader.Procedure_With_1_Param
("glUnmapNamedBuffer", UInt);
package Invalidate_Buffer_Data is new Loader.Procedure_With_1_Param
("glInvalidateBufferData", UInt);
package Invalidate_Buffer_Sub_Data is new Loader.Procedure_With_3_Params
("glInvalidateBufferSubData", UInt, Low_Level.IntPtr, Low_Level.SizeIPtr);
package Flush_Mapped_Named_Buffer_Range is new Loader.Procedure_With_3_Params
("glFlushMappedNamedBufferRange", UInt, Low_Level.IntPtr, Low_Level.SizeIPtr);
package Clear_Named_Buffer_Sub_Data is new Loader.Procedure_With_7_Params
("glClearNamedBufferSubData", UInt, Pixels.Internal_Format_Buffer_Texture,
Low_Level.IntPtr, Low_Level.SizeIPtr, Pixels.Format, Pixels.Data_Type,
System.Address);
package Copy_Named_Buffer_Sub_Data is new Loader.Procedure_With_5_Params
("glCopyNamedBufferSubData", UInt, UInt, Low_Level.IntPtr, Low_Level.IntPtr,
Low_Level.SizeIPtr);
-----------------------------------------------------------------------------
-- Vertex Array Objects --
-----------------------------------------------------------------------------
package Create_Vertex_Arrays is new Loader.Getter_With_2_Params
("glCreateVertexArrays", Size, UInt);
package Delete_Vertex_Arrays is new Loader.Array_Proc_With_2_Params
("glDeleteVertexArrays", Size, UInt, Low_Level.UInt_Array);
package Bind_Vertex_Array is new Loader.Procedure_With_1_Param
("glBindVertexArray", UInt);
-----------------------------------------------------------------------------
-- Framebuffer objects and handling --
-----------------------------------------------------------------------------
package Logic_Op is new Loader.Procedure_With_1_Param
("glLogicOp", Blending.Logic_Op);
package Create_Framebuffers is new Loader.Getter_With_2_Params
("glCreateFramebuffers", Size, UInt);
package Delete_Framebuffers is new Loader.Array_Proc_With_2_Params
("glDeleteFramebuffers", Size, UInt, Low_Level.UInt_Array);
package Bind_Framebuffer is new Loader.Procedure_With_2_Params
("glBindFramebuffer", Enums.Framebuffer_Kind, UInt);
package Named_Framebuffer_Draw_Buffers is new Loader.Procedure_With_3_Params
("glNamedFramebufferDrawBuffers", UInt, Size, Buffers.Color_Buffer_List);
package Named_Framebuffer_Read_Buffer is new Loader.Procedure_With_2_Params
("glNamedFramebufferReadBuffer", UInt, Buffers.Color_Buffer_Selector);
package Check_Named_Framebuffer_Status is new Loader.Function_With_2_Params
("glCheckNamedFramebufferStatus", UInt, Enums.Framebuffer_Kind,
Objects.Framebuffers.Framebuffer_Status);
package Named_Framebuffer_Texture is new Loader.Procedure_With_4_Params
("glNamedFramebufferTexture", UInt, Objects.Framebuffers.Attachment_Point,
UInt, Objects.Textures.Mipmap_Level);
package Named_Framebuffer_Texture_Layer is new Loader.Procedure_With_5_Params
("glNamedFramebufferTextureLayer", UInt, Objects.Framebuffers.Attachment_Point,
UInt, Objects.Textures.Mipmap_Level, Int);
package Blit_Named_Framebuffer is new Loader.Procedure_With_12_Params
("glBlitNamedFramebuffer", UInt, UInt, Int, Int, Int, Int, Int, Int, Int, Int,
Low_Level.Bitfield, Objects.Textures.Magnifying_Function);
package Invalidate_Named_Framebuffer_Data is new Loader.Array_Proc_With_3_Params
("glInvalidateNamedFramebufferData", UInt, Size,
Objects.Framebuffers.Attachment_Point,
Objects.Framebuffers.Attachment_List);
package Invalidate_Named_Framebuffer_Data_Default is new Loader.Array_Proc_With_3_Params
("glInvalidateNamedFramebufferData", UInt, Size,
Objects.Framebuffers.Default_Attachment_Point,
Objects.Framebuffers.Default_Attachment_List);
package Invalidate_Named_Framebuffer_Sub_Data is new Loader.Procedure_With_7_Params
("glInvalidateNamedFramebufferSubData", UInt, Size,
Objects.Framebuffers.Attachment_List, Int, Int, Size, Size);
package Invalidate_Named_Framebuffer_Sub_Data_Default is new Loader.Procedure_With_7_Params
("glInvalidateNamedFramebufferSubData", UInt, Size,
Objects.Framebuffers.Default_Attachment_List, Int, Int, Size, Size);
package Named_Framebuffer_Parameter_Size is new Loader.Procedure_With_3_Params
("glNamedFramebufferParameteri", UInt, Enums.Framebuffer_Param, Size);
package Named_Framebuffer_Parameter_Bool is new Loader.Procedure_With_3_Params
("glNamedFramebufferParameteri", UInt, Enums.Framebuffer_Param, Low_Level.Bool);
package Get_Named_Framebuffer_Parameter_Size is new Loader.Getter_With_3_Params
("glGetNamedFramebufferParameteriv", UInt, Enums.Framebuffer_Param, Size);
package Get_Named_Framebuffer_Parameter_Bool is new Loader.Getter_With_3_Params
("glGetNamedFramebufferParameteriv", UInt, Enums.Framebuffer_Param, Low_Level.Bool);
package Clear_Named_Framebuffer_Color_Real is new Loader.Procedure_With_4_Params
("glClearNamedFramebufferfv", UInt, Enums.Only_Color_Buffer,
Buffers.Draw_Buffer_Index, Colors.Color);
package Clear_Named_Framebuffer_Color_Signed_Int is new Loader.Procedure_With_4_Params
("glClearNamedFramebufferiv", UInt, Enums.Only_Color_Buffer,
Buffers.Draw_Buffer_Index, Colors.Color);
package Clear_Named_Framebuffer_Color_Unsigned_Int is new Loader.Procedure_With_4_Params
("glClearNamedFramebufferuiv", UInt, Enums.Only_Color_Buffer,
Buffers.Draw_Buffer_Index, Colors.Color);
package Clear_Named_Framebuffer_Depth is new Loader.Getter_With_4_Params
("glClearNamedFramebufferfv", UInt, Enums.Only_Depth_Buffer,
Zero, Buffers.Depth);
package Clear_Named_Framebuffer_Stencil is new Loader.Getter_With_4_Params
("glClearNamedFramebufferiv", UInt, Enums.Only_Stencil_Buffer,
Zero, Buffers.Stencil_Index);
package Clear_Named_Framebuffer_Depth_Stencil is new Loader.Procedure_With_5_Params
("glClearNamedFramebufferfi", UInt, Enums.Only_Depth_Stencil_Buffer,
Zero, Buffers.Depth, Buffers.Stencil_Index);
-----------------------------------------------------------------------------
-- Shaders --
-----------------------------------------------------------------------------
package Get_Shader_Param is new Loader.Getter_With_3_Params
("glGetShaderiv", UInt, Enums.Shader_Param, Int);
package Create_Shader is new Loader.Function_With_1_Param
("glCreateShader", Objects.Shaders.Shader_Type, UInt);
package Delete_Shader is new Loader.Procedure_With_1_Param
("glDeleteShader", UInt);
package Shader_Source is new Loader.Procedure_With_4_Params
("glShaderSource", UInt, Size, Low_Level.CharPtr_Array,
Low_Level.Int_Array);
package Get_Shader_Source is new Loader.String_Getter_With_4_Params
("glGetShaderSource", Size, UInt);
package Compile_Shader is new Loader.Procedure_With_1_Param
("glCompileShader", UInt);
package Get_Shader_Info_Log is new Loader.String_Getter_With_4_Params
("glGetShaderInfoLog", Size, UInt);
package Create_Program is new Loader.Function_Without_Params
("glCreateProgram", UInt);
package Delete_Program is new Loader.Procedure_With_1_Param
("glDeleteProgram", UInt);
package Get_Program_Param is new Loader.Getter_With_3_Params
("glGetProgramiv", UInt, Enums.Program_Param, Int);
package Get_Program_Param_Compute is new Loader.Getter_With_3_Params
("glGetProgramiv", UInt, Enums.Program_Param, Compute.Dimension_Size_Array);
package Program_Parameter_Bool is new Loader.Procedure_With_3_Params
("glProgramParameteri", UInt, Enums.Program_Set_Param, Low_Level.Bool);
package Attach_Shader is new Loader.Procedure_With_2_Params
("glAttachShader", UInt, UInt);
package Detach_Shader is new Loader.Procedure_With_2_Params
("glDetachShader", UInt, UInt);
package Link_Program is new Loader.Procedure_With_1_Param
("glLinkProgram", UInt);
package Get_Program_Info_Log is new Loader.String_Getter_With_4_Params
("glGetProgramInfoLog", Size, UInt);
package Use_Program is new Loader.Procedure_With_1_Param
("glUseProgram", UInt);
package Validate_Program is new Loader.Procedure_With_1_Param
("glValidateProgram", UInt);
package Get_Uniform_Location is new Loader.Function_With_2_Params
("glGetUniformLocation", UInt, C.char_array, Int);
-----------------------------------------------------------------------------
-- Compute --
-----------------------------------------------------------------------------
package Dispatch_Compute is new Loader.Procedure_With_3_Params
("glDispatchCompute", UInt, UInt, UInt);
package Dispatch_Compute_Indirect is new Loader.Procedure_With_1_Param
("glDispatchComputeIndirect", Low_Level.IntPtr);
-----------------------------------------------------------------------------
-- Program interfaces and resources --
-----------------------------------------------------------------------------
package Get_Program_Resource_Index is new Loader.Function_With_3_Params
("glGetProgramResourceIndex", UInt, Enums.Program_Interface,
C.char_array, UInt);
package Get_Program_Resource is new Loader.Array_Getter_With_8_Params
("glGetProgramResourceiv", UInt, Enums.Program_Interface,
UInt, Size, Enums.Program_Resource_Array, Int, Int_Array);
-----------------------------------------------------------------------------
-- Pipelines --
-----------------------------------------------------------------------------
package Use_Program_Stages is new Loader.Procedure_With_3_Params
("glUseProgramStages", UInt, Low_Level.Bitfield, UInt);
package Create_Program_Pipelines is new Loader.Getter_With_2_Params
("glCreateProgramPipelines", Size, UInt);
package Delete_Program_Pipelines is new Loader.Array_Proc_With_2_Params
("glDeleteProgramPipelines", Size, UInt, Low_Level.UInt_Array);
package Bind_Program_Pipeline is new Loader.Procedure_With_1_Param
("glBindProgramPipeline", UInt);
package Get_Program_Pipeline_Param is new Loader.Getter_With_3_Params
("glGetProgramPipelineiv", UInt, Enums.Program_Pipeline_Param, Int);
package Get_Program_Pipeline_Info_Log is new Loader.String_Getter_With_4_Params
("glGetProgramPipelineInfoLog", Size, UInt);
package Validate_Program_Pipeline is new Loader.Procedure_With_1_Param
("glValidateProgramPipeline", UInt);
package Create_Shader_Program is new Loader.Function_With_3_Params
("glCreateShaderProgramv", Objects.Shaders.Shader_Type, Size,
Low_Level.CharPtr_Array, UInt);
-----------------------------------------------------------------------------
-- Queries --
-----------------------------------------------------------------------------
package Create_Queries is new Loader.Getter_With_3_Params
("glCreateQueries", Objects.Queries.Query_Type, Size, UInt);
package Delete_Queries is new Loader.Array_Proc_With_2_Params
("glDeleteQueries", Size, UInt, Low_Level.UInt_Array);
package Begin_Query_Indexed is new Loader.Procedure_With_3_Params
("glBeginQueryIndexed", Objects.Queries.Async_Query_Type, UInt, UInt);
package End_Query_Indexed is new Loader.Procedure_With_2_Params
("glEndQueryIndexed", Objects.Queries.Async_Query_Type, UInt);
package Query_Counter is new Loader.Procedure_With_2_Params
("glQueryCounter", UInt, Objects.Queries.Timestamp_Query_Type);
package Get_Query_Object_UInt is new Loader.Getter_With_3_Params
("glGetQueryObjectuiv", UInt, Objects.Queries.Query_Param, UInt);
package Get_Query_Object_UInt64 is new Loader.Getter_With_3_Params
("glGetQueryObjectui64v", UInt, Objects.Queries.Query_Param, UInt64);
-----------------------------------------------------------------------------
-- Samplers --
-----------------------------------------------------------------------------
package Create_Samplers is new Loader.Getter_With_2_Params
("glCreateSamplers", Size, UInt);
package Delete_Samplers is new Loader.Array_Proc_With_2_Params
("glDeleteSamplers", Size, UInt, Low_Level.UInt_Array);
package Bind_Sampler is new Loader.Procedure_With_2_Params
("glBindSampler", UInt, UInt);
package Bind_Samplers is new Loader.Array_Proc_With_3_Params
("glBindSamplers", UInt, Size, UInt, Low_Level.UInt_Array);
package Sampler_Parameter_Bool is new Loader.Procedure_With_3_Params
("glSamplerParameteri", UInt, Enums.Textures.Parameter, Low_Level.Bool);
package Sampler_Parameter_Float is new Loader.Procedure_With_3_Params
("glSamplerParameterf", UInt, Enums.Textures.Parameter, Single);
package Sampler_Parameter_Floats is new Loader.Procedure_With_3_Params
("glSamplerParameterfv", UInt, Enums.Textures.Parameter, Low_Level.Single_Array);
package Sampler_Parameter_Minifying_Function is new Loader.Procedure_With_3_Params
("glSamplerParameteri", UInt, Enums.Textures.Parameter, Objects.Textures.Minifying_Function);
package Sampler_Parameter_Magnifying_Function is new Loader.Procedure_With_3_Params
("glSamplerParameteri", UInt, Enums.Textures.Parameter, Objects.Textures.Magnifying_Function);
package Sampler_Parameter_Wrapping_Mode is new Loader.Procedure_With_3_Params
("glSamplerParameteri", UInt, Enums.Textures.Parameter, Objects.Textures.Wrapping_Mode);
package Sampler_Parameter_Compare_Kind is new Loader.Procedure_With_3_Params
("glSamplerParameteri", UInt, Enums.Textures.Parameter, Enums.Textures.Compare_Kind);
package Sampler_Parameter_Compare_Function is new Loader.Procedure_With_3_Params
("glSamplerParameteri", UInt, Enums.Textures.Parameter, Compare_Function);
package Get_Sampler_Parameter_Bool is new Loader.Getter_With_3_Params
("glGetSamplerParameteriv", UInt, Enums.Textures.Parameter, Low_Level.Bool);
package Get_Sampler_Parameter_Floats is new Loader.Getter_With_3_Params
("glGetSamplerParameterfv", UInt, Enums.Textures.Parameter, Low_Level.Single_Array);
package Get_Sampler_Parameter_Minifying_Function is new Loader.Getter_With_3_Params
("glGetSamplerParameteriv", UInt, Enums.Textures.Parameter,
Objects.Textures.Minifying_Function);
package Get_Sampler_Parameter_Magnifying_Function is new Loader.Getter_With_3_Params
("glGetSamplerParameteriv", UInt, Enums.Textures.Parameter,
Objects.Textures.Magnifying_Function);
package Get_Sampler_Parameter_Wrapping_Mode is new Loader.Getter_With_3_Params
("glGetSamplerParameteriv", UInt, Enums.Textures.Parameter, Objects.Textures.Wrapping_Mode);
package Get_Sampler_Parameter_Compare_Kind is new Loader.Getter_With_3_Params
("glGetSamplerParameteriv", UInt, Enums.Textures.Parameter, Enums.Textures.Compare_Kind);
package Get_Sampler_Parameter_Compare_Function is new Loader.Getter_With_3_Params
("glGetSamplerParameteriv", UInt, Enums.Textures.Parameter, Compare_Function);
-----------------------------------------------------------------------------
-- Barriers --
-----------------------------------------------------------------------------
package Texture_Barrier is new Loader.Procedure_Without_Params
("glTextureBarrier");
package Memory_Barrier is new Loader.Procedure_With_1_Param
("glMemoryBarrier", Low_Level.Bitfield);
package Memory_Barrier_By_Region is new Loader.Procedure_With_1_Param
("glMemoryBarrierByRegion", Low_Level.Bitfield);
-----------------------------------------------------------------------------
-- Debug --
-----------------------------------------------------------------------------
package Debug_Message_Control is new Loader.Procedure_With_6_Params
("glDebugMessageControl", Debug.Source, Debug.Message_Type,
Debug.Severity, Size, UInt_Array, Low_Level.Bool);
package Debug_Message_Control_Any_Level is new Loader.Procedure_With_6_Params
("glDebugMessageControl", Debug.Source, Debug.Message_Type,
Low_Level.Enum, Size, UInt_Array, Low_Level.Bool);
package Debug_Message_Control_Level is new Loader.Procedure_With_6_Params
("glDebugMessageControl", Low_Level.Enum, Low_Level.Enum,
Debug.Severity, Size, UInt_Array, Low_Level.Bool);
package Debug_Message_Insert is new Loader.Procedure_With_6_Params
("glDebugMessageInsert", Debug.Source, Debug.Message_Type,
UInt, Debug.Severity, Size, C.char_array);
package Debug_Message_Callback is new Loader.Procedure_With_2_Params
("glDebugMessageCallback", System.Address, System.Address);
package Get_Debug_Message_Log is new Loader.Function_With_8_Params
("glGetDebugMessageLog", UInt, Size, Debug_Types.Source_Array_Access,
Debug_Types.Type_Array_Access, Debug_Types.UInt_Array_Access,
Debug_Types.Severity_Array_Access, Debug_Types.Size_Array_Access,
Debug_Types.String_Access, UInt);
package Push_Debug_Group is new Loader.Procedure_With_4_Params
("glPushDebugGroup", Debug.Source, UInt, Size, C.char_array);
package Pop_Debug_Group is new Loader.Procedure_Without_Params
("glPopDebugGroup");
package Object_Label is new Loader.Procedure_With_4_Params
("glObjectLabel", Types.Debug.Identifier, UInt, Size, C.char_array);
package Get_Object_Label is new Loader.String_Getter_With_5_Params
("glGetObjectLabel", Size, Types.Debug.Identifier, UInt);
package Get_Object_Label_Length is new Loader.Procedure_With_5_Params
("glGetObjectLabel", Types.Debug.Identifier, UInt, Size,
Low_Level.Size_Access, C.Strings.chars_ptr);
package Object_Pointer_Label is new Loader.Procedure_With_3_Params
("glObjectPtrLabel", System.Address, Size, C.char_array);
-- TODO Use for Sync objects
package Get_Object_Pointer_Label is new Loader.String_Getter_With_4_Params
("glGetObjectPtrLabel", Size, System.Address);
-- TODO Use for Sync objects
-----------------------------------------------------------------------------
-- Syncing --
-----------------------------------------------------------------------------
package Fence_Sync is new Loader.Function_With_2_Params
("glFenceSync", Low_Level.Enum, Low_Level.Bitfield, Low_Level.Sync);
package Delete_Sync is new Loader.Procedure_With_1_Param
("glDeleteSync", Low_Level.Sync);
package Get_Sync is new Loader.Array_Getter_With_5_Params
("glGetSynciv", Low_Level.Sync, Low_Level.Enum, Int, Int_Array);
package Client_Wait_Sync is new Loader.Function_With_3_Params
("glClientWaitSync", Low_Level.Sync, Low_Level.Bitfield, UInt64,
Fences.Wait_Status);
package Wait_Sync is new Loader.Procedure_With_3_Params
("glWaitSync", Low_Level.Sync, Low_Level.Bitfield, UInt64);
-----------------------------------------------------------------------------
-- Transformation to window coordinates --
-----------------------------------------------------------------------------
package Depth_Range_Array is new Loader.Procedure_With_3_Params
("glDepthRangeArrayv", UInt, Size, Viewports.Depth_Range_List);
package Viewport_Array is new Loader.Procedure_With_3_Params
("glViewportArrayv", UInt, Size, Viewports.Viewport_List);
package Scissor_Array is new Loader.Procedure_With_3_Params
("glScissorArrayv", UInt, Size, Viewports.Scissor_Rectangle_List);
end GL.API;
|
package ADMBase.Evolve is
procedure evolve_data;
end ADMBase.Evolve;
|
-- { dg-do run }
-- { dg-options "-gnatws" }
procedure alignment1 is
type My_Integer is record
Element : Integer;
end record;
F : My_Integer;
begin
if F'Alignment /= F.Element'Alignment then
raise Program_Error;
end if;
end;
|
-----------------------------------------------------------------------
-- awa-permissions -- Permissions module
-- Copyright (C) 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Security.Permissions;
with Security.Policies;
with Util.Serialize.Mappers;
private with Util.Beans.Objects;
with ADO;
with ADO.Objects;
private with ADO.Sessions;
-- == AWA Permissions ==
-- The *AWA.Permissions* framework defines and controls the permissions used by an application
-- to verify and grant access to the data and application service. The framework provides a
-- set of services and API that helps an application in enforcing its specific permissions.
-- Permissions are verified by a permission controller which uses the service context to
-- have information about the user and other context. The framework allows to use different
-- kinds of permission controllers. The `Entity_Controller` is the default permission
-- controller which uses the database and an XML configuration to verify a permission.
--
-- === Declaration ===
-- To be used in the application, the first step is to declare the permission.
-- This is a static definition of the permission that will be used to ask to verify the
-- permission. The permission is given a unique name that will be used in configuration files:
--
-- with Security.Permissions;
-- ...
-- package ACL_Create_Post is new Security.Permissions.Definition ("blog-create-post");
--
-- === Checking for a permission ===
-- A permission can be checked in Ada as well as in the presentation pages.
-- This is done by using the `Check` procedure and the permission definition. This operation
-- acts as a barrier: it does not return anything but returns normally if the permission is
-- granted. If the permission is denied, it raises the `NO_PERMISSION` exception.
--
-- Several `Check` operation exists. Some require no argument and some others need a context
-- such as some entity identifier to perform the check.
--
-- with AWA.Permissions;
-- ...
-- AWA.Permissions.Check (Permission => ACL_Create_Post.Permission,
-- Entity => Blog_Id);
--
-- === Configuring a permission ===
-- The *AWA.Permissions* framework supports a simple permission model
-- The application configuration file must provide some information to help in checking the
-- permission. The permission name is referenced by the `name` XML entity. The `entity-type`
-- refers to the database entity (ie, the table) that the permission concerns.
-- The `sql` XML entity represents the SQL statement that must be used to verify the permission.
--
-- <entity-permission>
-- <name>blog-create-post</name>
-- <entity-type>blog</entity-type>
-- <description>Permission to create a new post.</description>
-- <sql>
-- SELECT acl.id FROM acl
-- WHERE acl.entity_type = :entity_type
-- AND acl.user_id = :user_id
-- AND acl.entity_id = :entity_id
-- </sql>
-- </entity-permission>
--
-- === Adding a permission ===
-- Adding a permission means to create an `ACL` database record that links a given database
-- entity to the user. This is done easily with the `Add_Permission` procedure:
--
-- with AWA.Permissions.Services;
-- ...
-- AWA.Permissions.Services.Add_Permission (Session => DB,
-- User => User,
-- Entity => Blog);
--
-- === Data Model ===
-- [images/awa_permissions_model.png]
--
-- === Queries ===
-- @include permissions.xml
--
package AWA.Permissions is
NAME : constant String := "Entity-Policy";
-- Exception raised by the <b>Check</b> procedure if the user does not have
-- the permission.
NO_PERMISSION : exception;
-- Maximum number of entity types that can be defined in the XML entity-permission.
-- Most permission need only one entity type. Keep that number small.
MAX_ENTITY_TYPES : constant Positive := 5;
type Entity_Type_Array is array (1 .. MAX_ENTITY_TYPES) of ADO.Entity_Type;
type Permission_Type is (READ, WRITE);
type Entity_Permission is new Security.Permissions.Permission with private;
-- Verify that the permission represented by <b>Permission</b> is granted.
--
procedure Check (Permission : in Security.Permissions.Permission_Index);
-- Verify that the permission represented by <b>Permission</b> is granted to access the
-- database entity represented by <b>Entity</b>.
procedure Check (Permission : in Security.Permissions.Permission_Index;
Entity : in ADO.Identifier);
-- Verify that the permission represented by <b>Permission</b> is granted to access the
-- database entity represented by <b>Entity</b>.
procedure Check (Permission : in Security.Permissions.Permission_Index;
Entity : in ADO.Objects.Object_Ref'Class);
private
type Entity_Permission is new Security.Permissions.Permission with record
Entity : ADO.Identifier;
end record;
type Entity_Policy;
type Entity_Policy_Access is access all Entity_Policy'Class;
type Controller_Config is record
Name : Util.Beans.Objects.Object;
SQL : Util.Beans.Objects.Object;
Grant : Util.Beans.Objects.Object;
Entity : ADO.Entity_Type := 0;
Entities : Entity_Type_Array := (others => ADO.NO_ENTITY_TYPE);
Count : Natural := 0;
Manager : Entity_Policy_Access;
Session : ADO.Sessions.Session;
end record;
type Entity_Policy is new Security.Policies.Policy with record
Config : aliased Controller_Config;
end record;
-- Get the policy name.
overriding
function Get_Name (From : in Entity_Policy) return String;
-- Setup the XML parser to read the <b>policy</b> description.
overriding
procedure Prepare_Config (Policy : in out Entity_Policy;
Mapper : in out Util.Serialize.Mappers.Processing);
end AWA.Permissions;
|
with Interfaces;
-- Virtual Audio Processing Unit
package VirtAPU is
type Channel_ID is new Positive;
subtype Sample is Float;
type Instance
(Number_Of_Channels : Channel_ID;
Sample_Rate : Positive)
is tagged limited
private;
procedure Tick (This : in out Instance);
-- This procedure has to be called at a fixed frequency
type Mode_Kind is (Pulse, Triangle, Noise_1, Noise_2);
-- Mode of the channel oscillator
type Tick_Count is new Interfaces.Unsigned_32;
type Volume is range 0 .. 100;
type Frequency is delta 0.0001 range 00.0 .. 45_000.0
with Size => 32;
type Sweep_Kind is (None, Up, Down);
type Pulse_Width is range 10 .. 90;
procedure Set_Mode (This : in out Instance;
Chan_Id : Channel_ID;
Mode : Mode_Kind)
with Pre => Chan_Id <= This.Number_Of_Channels;
-- Change the mode of the channel oscillator
procedure Note_On (This : in out Instance;
Chan_Id : Channel_ID;
Freq : Frequency)
with Pre => Chan_Id <= This.Number_Of_Channels;
-- Start playing a note on the given channel
procedure Note_Off (This : in out Instance;
Chan_Id : Channel_ID)
with Pre => Chan_Id <= This.Number_Of_Channels;
-- Stop playing a note on the given channel. If the decay is set to zero,
-- the channel is muted after this call. If the decay is above zero, the
-- volume will start to lower after this call.
procedure Set_Width (This : in out Instance;
Chan_Id : Channel_ID;
Width : Pulse_Width)
with Pre => Chan_Id <= This.Number_Of_Channels;
-- Set pulse width for the given channel
procedure Set_Sweep (This : in out Instance;
Chan_Id : Channel_ID;
Kind : Sweep_Kind;
Sweep_Len : Positive;
Sweep_Ticks : Tick_Count)
with Pre => Chan_Id <= This.Number_Of_Channels;
-- Set sweep parameters for the channel. Sweep will modulate the frequency
-- of the oscillator. Sweep divides or multiplies the oscillator frequency
-- every Sweep_Ticks.
procedure Set_Volume (This : in out Instance;
Chan_Id : Channel_ID;
Vol : Volume)
with Pre => Chan_Id <= This.Number_Of_Channels;
-- Set the Volume for the given channel. When Note_On is called, the output
-- level is set to this value.
No_Decay : constant Tick_Count := 0;
procedure Set_Decay (This : in out Instance;
Chan_Id : Channel_ID;
Ticks : Tick_Count)
with Pre => Chan_Id <= This.Number_Of_Channels;
-- Set the number of ticks it will take for the channel envelope to go from
-- the set volume to 0.
-- Audio Output --
function Next_Sample (This : in out Instance) return Sample;
-- Return the next sample from all the channels mixed
generic
type Int_T is range <>;
type Buffer_T is array (Natural range <>) of Int_T;
procedure Next_Samples_Int (This : in out Instance;
Buffer : out Buffer_T);
-- Return a buffer of samples from all the channels mixed and converted
-- into a signed integer type.
generic
type UInt_T is mod <>;
type Buffer_T is array (Natural range <>) of UInt_T;
procedure Next_Samples_UInt (This : in out Instance;
Buffer : out Buffer_T);
-- Return a buffer of samples from all the channels mixed and converted
-- into a unsigned integer type.
-- Sequencer --
type Note_Duration is (Large, Long, Double, Whole, Half, Quarter, N_8th,
N_16th, N_32nd, N_64th, N_128th, N_256th);
type Command_Kind is (Wait_Ticks, Wait_Note, Note_On, Note_Off, Set_Volume,
Set_Decay, Set_Sweep, Set_Width, Set_Mode);
-- The command kinds correspond to the procedures above. With the addition
-- of Wait_Ticks and Wait_Note to control timing.
type Command (Kind : Command_Kind := Note_Off) is record
case Kind is
when Note_Off => null;
when Note_On =>
Freq : Frequency;
when Wait_Ticks =>
Ticks : Tick_Count;
when Wait_Note =>
Note : Note_Duration;
when Set_Volume =>
Vol : Volume;
when Set_Decay =>
Decay_Ticks : Tick_Count;
when Set_Sweep =>
Sweep : Sweep_Kind;
Sweep_Len : Positive;
Sweep_Ticks : Tick_Count;
when Set_Width =>
Width : Pulse_Width;
when Set_Mode =>
Mode : Mode_Kind;
end case;
end record;
-- The Command record specifies the command kind and the associated
-- parameters.
type Command_Array is array (Natural range <>) of Command;
type Sequence is not null access constant Command_Array;
Empty : aliased constant Command_Array := (1 .. 0 => <>);
Empty_Seq : Sequence := Empty'Access;
procedure Set_Rhythm (This : in out Instance;
BPM : Positive;
Ticks_Per_Second : Positive);
-- Set the rhythm for all channels. Ticks_Per_Second declares the frequency
-- at which the Tick procedure will be called.
procedure Set_Rhythm (This : in out Instance;
Chan_Id : Channel_ID;
BPM : Positive;
Ticks_Per_Second : Positive);
-- Set the rhythm for one channel. Ticks_Per_Second declares the frequency
-- at which the Tick procedure will be called.
procedure Run (This : in out Instance;
Chan_Id : Channel_ID;
Seq : Sequence;
Looping : Boolean := False);
-- Start running a sequence on the given channel. If Looping is True the
-- sequence will repeat until it is replaced by another sequence.
-- Declaration of note duration commands for convenience
C_Large : constant Command := (Wait_Note, Large);
C_Long : constant Command := (Wait_Note, Long);
C_Double : constant Command := (Wait_Note, Double);
C_Whole : constant Command := (Wait_Note, Whole);
C_Half : constant Command := (Wait_Note, Half);
C_Quarter : constant Command := (Wait_Note, Quarter);
C_8th : constant Command := (Wait_Note, N_8th);
C_16th : constant Command := (Wait_Note, N_16th);
C_32nd : constant Command := (Wait_Note, N_32nd);
C_64th : constant Command := (Wait_Note, N_64th);
C_128th : constant Command := (Wait_Note, N_128th);
C_256th : constant Command := (Wait_Note, N_256th);
Off : constant Command := (Kind => Note_Off);
-- Declaration of note frequency commands for convenience
pragma Warnings (Off, "*not a multiple of Small*");
C0 : constant Command := (Note_On, 16.35);
Cs0 : constant Command := (Note_On, 17.32);
D0 : constant Command := (Note_On, 18.35);
Ds0 : constant Command := (Note_On, 19.45);
E0 : constant Command := (Note_On, 20.60);
F0 : constant Command := (Note_On, 21.83);
Fs0 : constant Command := (Note_On, 23.12);
G0 : constant Command := (Note_On, 24.50);
Gs0 : constant Command := (Note_On, 25.96);
A0 : constant Command := (Note_On, 27.50);
As0 : constant Command := (Note_On, 29.14);
B0 : constant Command := (Note_On, 30.87);
C1 : constant Command := (Note_On, 32.70);
Cs1 : constant Command := (Note_On, 34.65);
D1 : constant Command := (Note_On, 36.71);
Ds1 : constant Command := (Note_On, 38.89);
E1 : constant Command := (Note_On, 41.20);
F1 : constant Command := (Note_On, 43.65);
Fs1 : constant Command := (Note_On, 46.25);
G1 : constant Command := (Note_On, 49.00);
Gs1 : constant Command := (Note_On, 51.91);
A1 : constant Command := (Note_On, 55.00);
As1 : constant Command := (Note_On, 58.27);
B1 : constant Command := (Note_On, 61.74);
C2 : constant Command := (Note_On, 65.41);
Cs2 : constant Command := (Note_On, 69.30);
D2 : constant Command := (Note_On, 73.42);
Ds2 : constant Command := (Note_On, 77.78);
E2 : constant Command := (Note_On, 82.41);
F2 : constant Command := (Note_On, 87.31);
Fs2 : constant Command := (Note_On, 92.50);
G2 : constant Command := (Note_On, 98.00);
Gs2 : constant Command := (Note_On, 103.83);
A2 : constant Command := (Note_On, 110.00);
As2 : constant Command := (Note_On, 116.54);
B2 : constant Command := (Note_On, 123.47);
C3 : constant Command := (Note_On, 130.81);
Cs3 : constant Command := (Note_On, 138.59);
D3 : constant Command := (Note_On, 146.83);
Ds3 : constant Command := (Note_On, 155.56);
E3 : constant Command := (Note_On, 164.81);
F3 : constant Command := (Note_On, 174.61);
Fs3 : constant Command := (Note_On, 185.00);
G3 : constant Command := (Note_On, 196.00);
Gs3 : constant Command := (Note_On, 207.65);
A3 : constant Command := (Note_On, 220.00);
As3 : constant Command := (Note_On, 233.08);
B3 : constant Command := (Note_On, 246.94);
C4 : constant Command := (Note_On, 261.63);
Cs4 : constant Command := (Note_On, 277.18);
D4 : constant Command := (Note_On, 293.66);
Ds4 : constant Command := (Note_On, 311.13);
E4 : constant Command := (Note_On, 329.63);
F4 : constant Command := (Note_On, 349.23);
Fs4 : constant Command := (Note_On, 369.99);
G4 : constant Command := (Note_On, 392.00);
Gs4 : constant Command := (Note_On, 415.30);
A4 : constant Command := (Note_On, 440.00);
As4 : constant Command := (Note_On, 466.16);
B4 : constant Command := (Note_On, 493.88);
C5 : constant Command := (Note_On, 523.25);
Cs5 : constant Command := (Note_On, 554.37);
D5 : constant Command := (Note_On, 587.33);
Ds5 : constant Command := (Note_On, 622.25);
E5 : constant Command := (Note_On, 659.25);
F5 : constant Command := (Note_On, 698.46);
Fs5 : constant Command := (Note_On, 739.99);
G5 : constant Command := (Note_On, 783.99);
Gs5 : constant Command := (Note_On, 830.61);
A5 : constant Command := (Note_On, 880.00);
As5 : constant Command := (Note_On, 932.33);
B5 : constant Command := (Note_On, 987.77);
C6 : constant Command := (Note_On, 1046.50);
Cs6 : constant Command := (Note_On, 1108.73);
D6 : constant Command := (Note_On, 1174.66);
Ds6 : constant Command := (Note_On, 1244.51);
E6 : constant Command := (Note_On, 1318.51);
F6 : constant Command := (Note_On, 1396.91);
Fs6 : constant Command := (Note_On, 1479.98);
G6 : constant Command := (Note_On, 1567.98);
Gs6 : constant Command := (Note_On, 1661.22);
A6 : constant Command := (Note_On, 1760.00);
As6 : constant Command := (Note_On, 1864.66);
B6 : constant Command := (Note_On, 1975.53);
C7 : constant Command := (Note_On, 2093.00);
Cs7 : constant Command := (Note_On, 2217.46);
D7 : constant Command := (Note_On, 2349.32);
Ds7 : constant Command := (Note_On, 2489.02);
E7 : constant Command := (Note_On, 2637.02);
F7 : constant Command := (Note_On, 2793.83);
Fs7 : constant Command := (Note_On, 2959.96);
G7 : constant Command := (Note_On, 3135.96);
Gs7 : constant Command := (Note_On, 3322.44);
A7 : constant Command := (Note_On, 3520.00);
As7 : constant Command := (Note_On, 3729.31);
B7 : constant Command := (Note_On, 3951.07);
C8 : constant Command := (Note_On, 4186.01);
Cs8 : constant Command := (Note_On, 4434.92);
D8 : constant Command := (Note_On, 4698.63);
Ds8 : constant Command := (Note_On, 4978.03);
E8 : constant Command := (Note_On, 5274.04);
F8 : constant Command := (Note_On, 5587.65);
Fs8 : constant Command := (Note_On, 5919.91);
G8 : constant Command := (Note_On, 6271.93);
Gs8 : constant Command := (Note_On, 6644.88);
A8 : constant Command := (Note_On, 7040.00);
As8 : constant Command := (Note_On, 7458.62);
B8 : constant Command := (Note_On, 7902.13);
pragma Warnings (On, "*not a multiple of Small*");
private
type Enveloppe_State is (Mute, Note_On, Decay);
Ring_Buffer_Size : constant := 16;
type Ring_Buffer_T is array (0 .. Ring_Buffer_Size - 1) of Sample;
type BLIT_State is (Up, Down);
type Channel is
record
Sweep : Sweep_Kind := None with Volatile;
Sweep_Len : Positive := 1 with Volatile;
Sweep_Ticks : Tick_Count := 0 with Volatile;
Sweep_Remaining : Natural with Volatile;
Sweep_Remaining_Ticks : Tick_Count with Volatile;
Vol : Sample := 1.0 with Volatile;
Env_State : Enveloppe_State := Mute with Volatile;
Decay_Ticks : Tick_Count := No_Decay with Volatile;
Decay_Remaining : Tick_Count := 0 with Volatile;
Freq : Frequency := 440.0 with Volatile;
Mode : Mode_Kind := Pulse with Volatile;
Level : Sample := 0.0 with Volatile;
-- BLIT --
Ring_Buffer : Ring_Buffer_T;
Next_Impulse_Time : Natural := 0;
Next_Impulse_Phase : Float := 0.0;
Trig_Rate : Sample := 0.0;
Remaining_BLIT_Samples : Natural := 0;
Last_Sum : Sample := 0.0;
CSample_Nb : Natural := 0;
State : BLIT_State := Down;
Width : Float := 0.1;
LFSR : Interfaces.Unsigned_16 := 16#7FFF#;
-- Sequencer --
BPM : Positive;
Ticks_Per_Second : Positive;
Seq : Sequence := Empty_Seq;
Seq_Loop : Boolean := False;
Seq_Index : Natural := 0;
Seq_Remaining_Ticks : Tick_Count := 0;
end record;
type Channel_Array is array (Channel_ID range <>) of Channel;
type Instance
(Number_Of_Channels : Channel_ID;
Sample_Rate : Positive)
is tagged limited
record
Channels : Channel_Array (1 .. Number_Of_Channels);
Vol : Volume;
Decay_Vol : Volume;
Decay_Ticks : Tick_Count;
Seq : Sequence := Empty_Seq;
Seq_Index : Natural := Empty_Seq'First;
end record;
end VirtAPU;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- A D A . I O _ E X C E P T I O N S --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
package Ada.IO_Exceptions is
pragma Pure (IO_Exceptions);
Status_Error : exception;
Mode_Error : exception;
Name_Error : exception;
Use_Error : exception;
Device_Error : exception;
End_Error : exception;
Data_Error : exception;
Layout_Error : exception;
end Ada.IO_Exceptions;
|
--------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
-- SDL.Power
--
-- Battery access on the target platform.
--------------------------------------------------------------------------------------------------------------------
package SDL.Power is
pragma Preelaborate;
type State is
(Unknown, -- Cannot determine power status.
Battery, -- Not plugged in, running on the battery.
No_Battery, -- Plugged in, no battery available.
Charging, -- Plugged in, charging battery.
Charged -- Plugged in, battery charged.
) with
Convention => C;
type Seconds is range 0 .. Integer'Last;
type Percentage is range 0 .. 100;
type Battery_Info is
record
Power_State : State;
Time_Valid : Boolean;
Time : Seconds;
Percentage_Valid : Boolean;
Percent : Percentage;
end record;
procedure Info (Data : in out Battery_Info);
end SDL.Power;
|
-- C91004B.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 TASK (TYPE) IDENTIFIER, WHEN USED WITHIN ITS OWN
-- BODY, REFERS TO THE EXECUTING TASK.
-- TEST USING IDENTIFIER IN ABORT STATEMENT, AS AN EXPRESSION IN
-- A MEMBERSHIP TEST, AND THE PREFIX OF 'CALLABLE AND
-- 'TERMINATED.
-- HISTORY:
-- WEI 3/ 4/82 CREATED ORIGINAL TEST.
-- RJW 11/13/87 RENAMED TEST FROM C910BDA.ADA. ADDED CHECKS FOR
-- MEMBERSHIP TEST, AND 'CALLABLE AND 'TERMINATED
-- ATTRIBUTES.
WITH REPORT; USE REPORT;
PROCEDURE C91004B IS
TYPE I0 IS RANGE 0..1;
SUBTYPE ARG IS NATURAL RANGE 0..9;
SPYNUMB : NATURAL := 0;
TASK TYPE TT1 IS
ENTRY E1 (P1 : IN I0; P2 : ARG);
ENTRY BYE;
END TT1;
SUBTYPE SUB_TT1 IS TT1;
OBJ_TT1 : ARRAY (NATURAL RANGE 1..2) OF TT1;
PROCEDURE PSPY_NUMB (DIGT: IN ARG) IS
BEGIN
SPYNUMB := 10*SPYNUMB+DIGT;
END PSPY_NUMB;
TASK BODY TT1 IS
BEGIN
IF TT1 NOT IN SUB_TT1 THEN
FAILED ("INCORRECT RESULTS FOR MEMBERSHIP TEST");
END IF;
IF NOT TT1'CALLABLE THEN
FAILED ("INCORRECT RESULTS FOR 'CALLABLE");
END IF;
IF TT1'TERMINATED THEN
FAILED ("INCORRECT RESULTS FOR 'TERMINATED");
END IF;
ACCEPT E1 (P1 : IN I0; P2 : ARG) DO
IF P1 = 1 THEN
ABORT TT1;
ACCEPT BYE; -- WILL DEADLOCK IF NOT ABORTED.
END IF;
PSPY_NUMB (ARG (P2));
END E1;
END TT1;
BEGIN
TEST ("C91004B", "TASK IDENTIFIER IN OWN BODY");
BEGIN
OBJ_TT1 (1).E1 (1,1);
FAILED ("NO TASKING_ERROR RAISED");
-- ABORT DURING RENDEVOUS RAISES TASKING ERROR
EXCEPTION
WHEN TASKING_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("OTHER EXCEPTION RAISED");
END;
OBJ_TT1 (2).E1 (0,2);
IF SPYNUMB /= 2 THEN
FAILED ("WRONG TASK OBJECT REFERENCED");
COMMENT ("ACTUAL ORDER WAS:" & INTEGER'IMAGE(SPYNUMB));
END IF;
RESULT;
END C91004B;
|
package body Opt59_Pkg is
function Get_BV1 return Boolean_Vector is
begin
return (others => True);
end;
function Get_BV2 return Boolean_Vector is
begin
return (others => False);
end;
procedure Test (B : Boolean) is
begin
if not B then
raise Program_Error;
end if;
end;
end Opt59_Pkg;
|
-- C46011A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT INTEGER CONVERSIONS ARE PERFORMED CORRECTLY WHEN THE
-- TARGET AND OPERAND TYPES ARE BOTH INTEGER TYPES.
-- R.WILLIAMS 9/8/86
WITH REPORT; USE REPORT;
PROCEDURE C46011A IS
TYPE INT1 IS RANGE -100 .. 100;
I1 : INT1 := INT1'VAL (IDENT_INT (10));
F1 : INT1 := INT1'VAL (IDENT_INT (-100));
L1 : INT1 := INT1'VAL (IDENT_INT (100));
TYPE INT2 IS RANGE -100 .. 100;
I2 : INT2 := INT2'VAL (IDENT_INT (10));
F2 : INT2 := INT2'VAL (IDENT_INT (-100));
L2 : INT2 := INT2'VAL (IDENT_INT (100));
TYPE NEWINTEGER IS NEW INTEGER;
N1 : NEWINTEGER :=
NEWINTEGER'VAL (IDENT_INT (10));
T1 : INTEGER := IDENT_INT (10);
U1 : CONSTANT := INTEGER'POS (10);
BEGIN
TEST ( "C46011A", "CHECK THAT INTEGER CONVERSIONS ARE " &
"PERFORMED CORRECTLY WHEN THE TARGET AND " &
"OPERAND TYPES ARE BOTH INTEGER TYPES" );
IF INT1 (U1) /= U1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT1 (U1)'" );
END IF;
IF INT1 (I1) /= I1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT1 (I1)'" );
END IF;
IF INT1 (N1) /= I1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT1 (N1)'" );
END IF;
IF INT1 (10) /= I1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT1 (10)'" );
END IF;
IF INT1 (T1) /= I1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT1 (T1)'" );
END IF;
IF INT1 (F2) /= F1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT1 (F2)'" );
END IF;
IF INT1 (L2) /= L1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT1 (L2)'" );
END IF;
IF INT2 (I1) /= I2 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT2 (I1)'" );
END IF;
IF INT2 (T1) /= 10 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT2 (T1)'" );
END IF;
IF INT2 (F1) /= -100 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT2 (F1)'" );
END IF;
IF INT2 (L1) /= 100 THEN
FAILED ( "INCORRECT CONVERSION OF 'INT2 (L1)'" );
END IF;
IF NEWINTEGER (I1) /= N1 THEN
FAILED ( "INCORRECT CONVERSION OF 'NEWINTEGER (I1)'" );
END IF;
IF NEWINTEGER (N1) /= N1 THEN
FAILED ( "INCORRECT CONVERSION OF 'NEWINTEGER (N1)'" );
END IF;
IF NEWINTEGER (T1) /= N1 THEN
FAILED ( "INCORRECT CONVERSION OF 'NEWINTEGER (T1)'" );
END IF;
IF NEWINTEGER (INTEGER (N1)) /= N1 THEN
FAILED ( "INCORRECT CONVERSION OF " &
"'NEWINTEGER (INTEGER (N1))'" );
END IF;
IF NEWINTEGER (INTEGER (N1 + 1)) /= 11 THEN
FAILED ( "INCORRECT CONVERSION OF " &
"'NEWINTEGER (INTEGER (N1 + 1))'" );
END IF;
IF INTEGER (10) /= T1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INTEGER (10)'" );
END IF;
IF INTEGER (N1) /= 10 THEN
FAILED ( "INCORRECT CONVERSION OF 'INTEGER (N1)'" );
END IF;
IF INTEGER (I1) /= T1 THEN
FAILED ( "INCORRECT CONVERSION OF 'INTEGER (I1)'" );
END IF;
IF INTEGER (INT1 (NEWINTEGER (INT1 (I1)))) /= T1 THEN
FAILED ( "INCORRECT CONVERSION OF " &
"'INTEGER (INT1 (NEWINTEGER (INT1 (I1)))'" );
END IF;
IF INTEGER (I1 + 1) /= 11 THEN
FAILED ( "INCORRECT CONVERSION OF 'INTEGER (I1 + 1)'" );
END IF;
RESULT;
END C46011A;
|
-----------------------------------------------------------------------
-- util-system-os -- Windows system operations
-- Copyright (C) 2011, 2012, 2015, 2018, 2019 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Characters.Conversions;
package body Util.Systems.Os is
use type Interfaces.Unsigned_32;
use type Interfaces.Unsigned_64;
use type Interfaces.C.size_t;
function To_WSTR (Value : in String) return Wchar_Ptr is
Result : constant Wchar_Ptr := new Interfaces.C.wchar_array (0 .. Value'Length + 1);
Pos : Interfaces.C.size_t := 0;
begin
for C of Value loop
Result (Pos)
:= Interfaces.C.To_C (Ada.Characters.Conversions.To_Wide_Character (C));
Pos := Pos + 1;
end loop;
Result (Pos) := Interfaces.C.wide_nul;
return Result;
end To_WSTR;
function Sys_SetFilePointerEx (Fs : in File_Type;
Offset : in Util.Systems.Types.off_t;
Result : access Util.Systems.Types.off_t;
Mode : in Util.Systems.Types.Seek_Mode) return BOOL
with Import => True, Convention => Stdcall, Link_Name => "SetFilePointerEx";
function Sys_Lseek (Fs : in File_Type;
Offset : in Util.Systems.Types.off_t;
Mode : in Util.Systems.Types.Seek_Mode)
return Util.Systems.Types.off_t is
Result : aliased Util.Systems.Types.off_t;
begin
if Sys_SetFilePointerEx (Fs, Offset, Result'Access, Mode) /= 0 then
return Result;
else
return -1;
end if;
end Sys_Lseek;
function Sys_GetFileSizeEx (Fs : in File_Type;
Result : access Util.Systems.Types.off_t) return BOOL
with Import => True, Convention => Stdcall, Link_Name => "GetFileSizeEx";
function Sys_GetFileTime (Fs : in File_Type;
Create : access FileTime;
AccessTime : access FileTime;
ModifyTime : access FileTime) return BOOL
with Import => True, Convention => Stdcall, Link_Name => "GetFileTime";
TICKS_PER_SECOND : constant := 10000000;
EPOCH_DIFFERENCE : constant := 11644473600;
function To_Time (Time : in FileTime) return Types.Time_Type is
Value : Interfaces.Unsigned_64;
begin
Value := Interfaces.Shift_Left (Interfaces.Unsigned_64 (Time.dwHighDateTime), 32);
Value := Value + Interfaces.Unsigned_64 (Time.dwLowDateTime);
Value := Value / TICKS_PER_SECOND;
Value := Value - EPOCH_DIFFERENCE;
return Types.Time_Type (Value);
end To_Time;
function Sys_Fstat (Fs : in File_Type;
Stat : access Util.Systems.Types.Stat_Type) return Integer is
Size : aliased Util.Systems.Types.off_t;
Creation_Time : aliased FileTime;
Access_Time : aliased FileTime;
Write_Time : aliased FileTime;
begin
Stat.st_dev := 0;
Stat.st_ino := 0;
Stat.st_mode := 0;
Stat.st_nlink := 0;
Stat.st_uid := 0;
Stat.st_gid := 0;
Stat.st_rdev := 0;
Stat.st_atime := 0;
Stat.st_mtime := 0;
Stat.st_ctime := 0;
if Sys_GetFileSizeEx (Fs, Size'Access) = 0 then
return -1;
end if;
if Sys_GetFileTime (Fs, Creation_Time'Access, Access_Time'Access, Write_Time'Access) = 0 then
return -1;
end if;
Stat.st_size := Size;
Stat.st_ctime := To_Time (Creation_Time);
Stat.st_mtime := To_Time (Write_Time);
Stat.st_atime := To_Time (Access_Time);
return 0;
end Sys_Fstat;
-- Open a file
function Sys_Open (Path : in Ptr;
Flags : in Interfaces.C.int;
Mode : in Util.Systems.Types.mode_t) return File_Type is
pragma Unreferenced (Mode);
function Has_Flag (M : in Interfaces.C.int;
F : in Interfaces.C.int) return Boolean
is ((Interfaces.Unsigned_32 (M) and Interfaces.Unsigned_32 (F)) /= 0);
Sec : aliased Security_Attributes;
Result : File_Type;
Desired_Access : DWORD;
Share_Mode : DWORD := FILE_SHARE_READ + FILE_SHARE_WRITE;
Creation : DWORD;
WPath : Wchar_Ptr;
begin
WPath := To_WSTR (Interfaces.C.Strings.Value (Path));
Sec.Length := Security_Attributes'Size / 8;
Sec.Security_Descriptor := System.Null_Address;
Sec.Inherit := (if Has_Flag (Flags, Util.Systems.Constants.O_CLOEXEC) then 0 else 1);
if Has_Flag (Flags, O_WRONLY) then
Desired_Access := GENERIC_WRITE;
elsif Has_Flag (Flags, O_RDWR) then
Desired_Access := GENERIC_READ + GENERIC_WRITE;
else
Desired_Access := GENERIC_READ;
end if;
if Has_Flag (Flags, O_CREAT) then
if Has_Flag (Flags, O_EXCL) then
Creation := CREATE_NEW;
else
Creation := CREATE_ALWAYS;
end if;
else
Creation := OPEN_EXISTING;
end if;
if Has_Flag (Flags, O_APPEND) then
Desired_Access := FILE_APPEND_DATA;
end if;
if Has_Flag (Flags, O_EXCL) then
Share_Mode := 0;
end if;
Result := Create_File (WPath.all'Address,
Desired_Access,
Share_Mode,
Sec'Unchecked_Access,
Creation,
FILE_ATTRIBUTE_NORMAL,
NO_FILE);
Free (WPath);
return (if Result = INVALID_HANDLE_VALUE then NO_FILE else Result);
end Sys_Open;
function Sys_SetEndOfFile (Fs : in File_Type) return BOOL
with Import => True, Convention => Stdcall, Link_Name => "SetEndOfFile";
function Sys_Ftruncate (Fs : in File_Type;
Length : in Util.Systems.Types.off_t) return Integer is
begin
if Sys_Lseek (Fs, Length, Util.Systems.Types.SEEK_SET) < 0 then
return -1;
end if;
if Sys_SetEndOfFile (Fs) = 0 then
return -1;
end if;
return 0;
end Sys_Ftruncate;
function Sys_Fchmod (Fd : in File_Type;
Mode : in Util.Systems.Types.mode_t) return Integer is
pragma Unreferenced (Fd, Mode);
begin
return 0;
end Sys_Fchmod;
-- Close a file
function Sys_Close (Fd : in File_Type) return Integer is
begin
if Close_Handle (Fd) = 0 then
return -1;
else
return 0;
end if;
end Sys_Close;
end Util.Systems.Os;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . N U M E R I C S . A U X _ F L O A T --
-- --
-- S p e c --
-- (C Math Library Version, Float) --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This package provides the basic computational interface for the generic
-- elementary functions. The C library version interfaces with the routines
-- in the C mathematical library, and is thus quite portable.
with Ada.Numerics.Aux_Linker_Options;
pragma Warnings (Off, Ada.Numerics.Aux_Linker_Options);
package Ada.Numerics.Aux_Float is
pragma Pure;
subtype T is Float;
-- We import these functions directly from C. Note that we label them
-- all as pure functions, because indeed all of them are in fact pure.
function Sin (X : T) return T with
Import, Convention => Intrinsic, External_Name => "sinf";
function Cos (X : T) return T with
Import, Convention => Intrinsic, External_Name => "cosf";
function Tan (X : T) return T with
Import, Convention => Intrinsic, External_Name => "tanf";
function Exp (X : T) return T with
Import, Convention => Intrinsic, External_Name => "expf";
function Sqrt (X : T) return T with
Import, Convention => Intrinsic, External_Name => "sqrtf";
function Log (X : T) return T with
Import, Convention => Intrinsic, External_Name => "logf";
function Acos (X : T) return T with
Import, Convention => Intrinsic, External_Name => "acosf";
function Asin (X : T) return T with
Import, Convention => Intrinsic, External_Name => "asinf";
function Atan (X : T) return T with
Import, Convention => Intrinsic, External_Name => "atanf";
function Sinh (X : T) return T with
Import, Convention => Intrinsic, External_Name => "sinhf";
function Cosh (X : T) return T with
Import, Convention => Intrinsic, External_Name => "coshf";
function Tanh (X : T) return T with
Import, Convention => Intrinsic, External_Name => "tanhf";
function Pow (X, Y : T) return T with
Import, Convention => Intrinsic, External_Name => "powf";
end Ada.Numerics.Aux_Float;
|
-----------------------------------------------------------------------
-- awa-images-modules-tests -- Unit tests for image service
-- Copyright (C) 2012, 2013, 2018, 2020 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Tests;
with AWA.Tests;
with ADO;
package AWA.Images.Modules.Tests is
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new AWA.Tests.Test with record
Id : ADO.Identifier;
Manager : AWA.Images.Modules.Image_Module_Access;
end record;
-- Test creation of a storage object
procedure Test_Create_Image (T : in out Test);
-- Test the Get_Sizes operation.
procedure Test_Get_Sizes (T : in out Test);
-- Test the Scale operation.
procedure Test_Scale (T : in out Test);
-- Test the creation of an image through the storage service.
procedure Test_Store_Image (T : in out Test);
end AWA.Images.Modules.Tests;
|
type ${self.name} is tagged
record
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Type_Definitions;
with Program.Lexical_Elements;
with Program.Elements.Discrete_Ranges;
with Program.Elements.Component_Definitions;
package Program.Elements.Constrained_Array_Types is
pragma Pure (Program.Elements.Constrained_Array_Types);
type Constrained_Array_Type is
limited interface and Program.Elements.Type_Definitions.Type_Definition;
type Constrained_Array_Type_Access is
access all Constrained_Array_Type'Class with Storage_Size => 0;
not overriding function Index_Subtypes
(Self : Constrained_Array_Type)
return not null Program.Elements.Discrete_Ranges
.Discrete_Range_Vector_Access is abstract;
not overriding function Component_Definition
(Self : Constrained_Array_Type)
return not null Program.Elements.Component_Definitions
.Component_Definition_Access is abstract;
type Constrained_Array_Type_Text is limited interface;
type Constrained_Array_Type_Text_Access is
access all Constrained_Array_Type_Text'Class with Storage_Size => 0;
not overriding function To_Constrained_Array_Type_Text
(Self : in out Constrained_Array_Type)
return Constrained_Array_Type_Text_Access is abstract;
not overriding function Array_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Left_Bracket_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Right_Bracket_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Of_Token
(Self : Constrained_Array_Type_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Constrained_Array_Types;
|
with Ada.Text_IO; use Ada.Text_IO;
with My_Class;
procedure Test is
T : My_Class.Object;
begin
T.Write;
end Test;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . A R I T H _ 3 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2020-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This unit provides software routines for doing arithmetic on 32-bit
-- signed integer values in cases where either overflow checking is
-- required, or intermediate results are longer than 32 bits.
with Interfaces;
package System.Arith_32 is
pragma Pure;
subtype Int32 is Interfaces.Integer_32;
procedure Scaled_Divide32
(X, Y, Z : Int32;
Q, R : out Int32;
Round : Boolean);
-- Performs the division of (X * Y) / Z, storing the quotient in Q
-- and the remainder in R. Constraint_Error is raised if Z is zero,
-- or if the quotient does not fit in 32 bits. Round indicates if
-- the result should be rounded. If Round is False, then Q, R are
-- the normal quotient and remainder from a truncating division.
-- If Round is True, then Q is the rounded quotient. The remainder
-- R is not affected by the setting of the Round flag.
end System.Arith_32;
|
M:Interrupts
S:LInterrupts.aligned_alloc$size$1$13({2}SI:U),B,1,-4
S:LInterrupts.aligned_alloc$alignment$1$13({2}SI:U),B,1,1
T:FInterrupts$SI_UU32[({0}S:S$u32$0$0({4}SL:U),Z,0,0)({0}S:S$s32$0$0({4}SL:S),Z,0,0)({0}S:S$uu16$0$0({4}DA2d,STSI_UU16:S),Z,0,0)({0}S:S$u16$0$0({4}DA2d,SI:U),Z,0,0)({0}S:S$s16$0$0({4}DA2d,SI:S),Z,0,0)({0}S:S$u8$0$0({4}DA4d,SC:U),Z,0,0)({0}S:S$s8$0$0({4}DA4d,SC:S),Z,0,0)]
T:FInterrupts$SI_UU16[({0}S:S$u16$0$0({2}SI:U),Z,0,0)({0}S:S$s16$0$0({2}SI:S),Z,0,0)({0}S:S$u8$0$0({2}DA2d,SC:U),Z,0,0)({0}S:S$s8$0$0({2}DA2d,SC:S),Z,0,0)]
T:FInterrupts$u2f_hid_nonce[({0}S:S$nonce$0$0({8}DA8d,SC:U),Z,0,0)]
T:FInterrupts$config_msg[({0}S:S$cmd$0$0({1}SC:U),Z,0,0)({1}S:S$buf$0$0({63}DA63d,SC:U),Z,0,0)]
T:FInterrupts$SI_GEN_PTR[({0}S:S$u8$0$0({3}DA3d,SC:U),Z,0,0)({0}S:S$gptr$0$0({3}ST__00000000:S),Z,0,0)]
T:FInterrupts$__00000000[({0}S:S$memtype$0$0({1}SC:U),Z,0,0)({1}S:S$address$0$0({2}STSI_UU16:S),Z,0,0)]
T:FInterrupts$__00000010[({0}S:S$bits$0$0({1}ST__00000011:S),Z,0,0)({0}S:S$c$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$__00000001[({0}S:S$bmRequestType$0$0({1}ST__00000002:S),Z,0,0)({1}S:S$bRequest$0$0({1}SC:U),Z,0,0)({2}S:S$wValue$0$0({2}SI:U),Z,0,0)({4}S:S$wIndex$0$0({2}SI:U),Z,0,0)({6}S:S$wLength$0$0({2}SI:U),Z,0,0)]
T:FInterrupts$__00000011[({0}S:S$callback$0$0({1}SB0$1:U),Z,0,0)({0}S:S$outPacketPending$0$0({1}SB1$1:U),Z,0,0)({0}S:S$inPacketPending$0$0({1}SB2$1:U),Z,0,0)({0}S:S$waitForRead$0$0({1}SB3$1:U),Z,0,0)]
T:FInterrupts$__00000002[({0}S:S$Recipient$0$0({1}SB0$5:U),Z,0,0)({0}S:S$Type$0$0({1}SB5$2:U),Z,0,0)({0}S:S$Direction$0$0({1}SB7$1:U),Z,0,0)]
T:FInterrupts$__00000012[({0}S:S$configurationValue$0$0({1}SC:U),Z,0,0)({1}S:S$numberOfStrings$0$0({1}SC:U),Z,0,0)({2}S:S$state$0$0({1}SC:U),Z,0,0)({3}S:S$savedState$0$0({1}SC:U),Z,0,0)({4}S:S$setup$0$0({8}ST__00000001:S),Z,0,0)({12}S:S$ep0String$0$0({1}ST__00000013:S),Z,0,0)({13}S:S$ep0$0$0({7}ST__00000009:S),Z,0,0)({20}S:S$ep1in$0$0({7}ST__00000009:S),Z,0,0)({27}S:S$ep1out$0$0({7}ST__00000009:S),Z,0,0)({34}S:S$deviceDescriptor$0$0({3}DG,ST__00000004:S),Z,0,0)({37}S:S$configDescriptor$0$0({3}DG,ST__00000005:S),Z,0,0)({40}S:S$stringDescriptors$0$0({3}DG,DG,DG,SC:U),Z,0,0)]
T:FInterrupts$__00000003[({0}S:S$setup$0$0({8}ST__00000001:S),Z,0,0)({0}S:S$c$0$0({8}DA8d,SC:U),Z,0,0)({0}S:S$i$0$0({8}DA4d,SI:U),Z,0,0)]
T:FInterrupts$__00000013[({0}S:S$encoding$0$0({1}ST__00000014:S),Z,0,0)({0}S:S$c$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$__00000004[({0}S:S$bLength$0$0({1}SC:U),Z,0,0)({1}S:S$bDescriptorType$0$0({1}SC:U),Z,0,0)({2}S:S$bcdUSB$0$0({2}SI:U),Z,0,0)({4}S:S$bDeviceClass$0$0({1}SC:U),Z,0,0)({5}S:S$bDeviceSubClass$0$0({1}SC:U),Z,0,0)({6}S:S$bDeviceProtocol$0$0({1}SC:U),Z,0,0)({7}S:S$bMaxPacketSize0$0$0({1}SC:U),Z,0,0)({8}S:S$idVendor$0$0({2}SI:U),Z,0,0)({10}S:S$idProduct$0$0({2}SI:U),Z,0,0)({12}S:S$bcdDevice$0$0({2}SI:U),Z,0,0)({14}S:S$iManufacturer$0$0({1}SC:U),Z,0,0)({15}S:S$iProduct$0$0({1}SC:U),Z,0,0)({16}S:S$iSerialNumber$0$0({1}SC:U),Z,0,0)({17}S:S$bNumConfigurations$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$__00000014[({0}S:S$type$0$0({1}SB0$7:U),Z,0,0)({0}S:S$init$0$0({1}SB7$1:U),Z,0,0)]
T:FInterrupts$__00000005[({0}S:S$bLength$0$0({1}SC:U),Z,0,0)({1}S:S$bDescriptorType$0$0({1}SC:U),Z,0,0)({2}S:S$wTotalLength$0$0({2}SI:U),Z,0,0)({4}S:S$bNumInterfaces$0$0({1}SC:U),Z,0,0)({5}S:S$bConfigurationValue$0$0({1}SC:U),Z,0,0)({6}S:S$iConfiguration$0$0({1}SC:U),Z,0,0)({7}S:S$bmAttributes$0$0({1}SC:U),Z,0,0)({8}S:S$bMaxPower$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$__00000015[({0}S:S$init$0$0({60}ST__00000016:S),Z,0,0)({0}S:S$cont$0$0({60}ST__00000017:S),Z,0,0)]
T:FInterrupts$__00000006[({0}S:S$bLength$0$0({1}SC:U),Z,0,0)({1}S:S$bDescriptorType$0$0({1}SC:U),Z,0,0)({2}S:S$bInterfaceNumber$0$0({1}SC:U),Z,0,0)({3}S:S$bAlternateSetting$0$0({1}SC:U),Z,0,0)({4}S:S$bNumEndpoints$0$0({1}SC:U),Z,0,0)({5}S:S$bInterfaceClass$0$0({1}SC:U),Z,0,0)({6}S:S$bInterfaceSubClass$0$0({1}SC:U),Z,0,0)({7}S:S$bInterfaceProtocol$0$0({1}SC:U),Z,0,0)({8}S:S$iInterface$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$__00000016[({0}S:S$cmd$0$0({1}SC:U),Z,0,0)({1}S:S$bcnth$0$0({1}SC:U),Z,0,0)({2}S:S$bcntl$0$0({1}SC:U),Z,0,0)({3}S:S$payload$0$0({57}DA57d,SC:U),Z,0,0)]
T:FInterrupts$__00000007[({0}S:S$bLength$0$0({1}SC:U),Z,0,0)({1}S:S$bDescriptorType$0$0({1}SC:U),Z,0,0)({2}S:S$bEndpointAddress$0$0({1}SC:U),Z,0,0)({3}S:S$bmAttributes$0$0({1}SC:U),Z,0,0)({4}S:S$wMaxPacketSize$0$0({2}SI:U),Z,0,0)({6}S:S$bInterval$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$__00000017[({0}S:S$seq$0$0({1}SC:U),Z,0,0)({1}S:S$payload$0$0({59}DA59d,SC:U),Z,0,0)]
T:FInterrupts$__00000008[({0}S:S$deviceDescriptor$0$0({3}DG,ST__00000004:S),Z,0,0)({3}S:S$configDescriptor$0$0({3}DG,SC:U),Z,0,0)({6}S:S$stringDescriptors$0$0({3}DG,DG,DG,SC:U),Z,0,0)({9}S:S$numberOfStrings$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$u2f_hid_msg[({0}S:S$cid$0$0({4}SL:U),Z,0,0)({4}S:S$pkt$0$0({60}ST__00000015:S),Z,0,0)]
T:FInterrupts$__00000009[({0}S:S$buf$0$0({3}DG,SC:U),Z,0,0)({3}S:S$remaining$0$0({2}SI:U),Z,0,0)({5}S:S$state$0$0({1}SC:U),Z,0,0)({6}S:S$misc$0$0({1}ST__00000010:S),Z,0,0)]
T:FInterrupts$APP_DATA[({0}S:S$tmp$0$0({70}DA70d,SC:U),Z,0,0)]
T:FInterrupts$u2f_hid_init_response[({0}S:S$cid$0$0({4}SL:U),Z,0,0)({4}S:S$version_id$0$0({1}SC:U),Z,0,0)({5}S:S$version_major$0$0({1}SC:U),Z,0,0)({6}S:S$version_minor$0$0({1}SC:U),Z,0,0)({7}S:S$version_build$0$0({1}SC:U),Z,0,0)({8}S:S$cflags$0$0({1}SC:U),Z,0,0)]
T:FInterrupts$smb_interrupt_interface[({0}S:S$addr$0$0({1}SC:U),Z,0,0)({1}S:S$crc$0$0({2}SI:U),Z,0,0)({3}S:S$crc_offset$0$0({1}SC:U),Z,0,0)({4}S:S$write_buf$0$0({3}DG,SC:U),Z,0,0)({7}S:S$write_len$0$0({1}SC:U),Z,0,0)({8}S:S$write_offset$0$0({1}SC:U),Z,0,0)({9}S:S$read_len$0$0({1}SC:U),Z,0,0)({10}S:S$read_offset$0$0({1}SC:U),Z,0,0)({11}S:S$read_buf$0$0({3}DG,SC:U),Z,0,0)({14}S:S$write_ext_buf$0$0({3}DG,SC:U),Z,0,0)({17}S:S$write_ext_len$0$0({1}SC:U),Z,0,0)({18}S:S$write_ext_offset$0$0({1}SC:U),Z,0,0)({19}S:S$preflags$0$0({1}SC:U),Z,0,0)]
S:G$appdata$0$0({70}STAPP_DATA:S),E,0,0
S:G$_MS_$0$0({4}SL:U),E,0,0
S:G$SMB_addr$0$0({1}SC:U),E,0,0
S:G$SMB_write_len$0$0({1}SC:U),E,0,0
S:G$SMB_write_offset$0$0({1}SC:U),E,0,0
S:G$SMB_read_len$0$0({1}SC:U),E,0,0
S:G$SMB_read_offset$0$0({1}SC:U),E,0,0
S:G$SMB_write_ext_len$0$0({1}SC:U),E,0,0
S:G$SMB_write_ext_offset$0$0({1}SC:U),E,0,0
S:G$SMB_crc_offset$0$0({1}SC:U),E,0,0
S:G$SMB_FLAGS$0$0({1}SC:U),E,0,0
S:G$hidmsgbuf$0$0({64}DA64d,SC:U),F,0,0
S:G$myUsbDevice$0$0({43}ST__00000012:S),F,0,0
S:G$SMB_write_buf$0$0({3}DG,SC:U),F,0,0
S:G$SMB_read_buf$0$0({3}DG,SC:U),F,0,0
S:G$SMB_write_ext_buf$0$0({3}DG,SC:U),F,0,0
S:G$SMB_preflags$0$0({1}SC:U),F,0,0
S:G$SMB_crc$0$0({2}SI:U),F,0,0
S:G$ACC$0$0({1}SC:U),I,0,0
S:G$ADC0AC$0$0({1}SC:U),I,0,0
S:G$ADC0CF$0$0({1}SC:U),I,0,0
S:G$ADC0CN0$0$0({1}SC:U),I,0,0
S:G$ADC0CN1$0$0({1}SC:U),I,0,0
S:G$ADC0GTH$0$0({1}SC:U),I,0,0
S:G$ADC0GTL$0$0({1}SC:U),I,0,0
S:G$ADC0H$0$0({1}SC:U),I,0,0
S:G$ADC0L$0$0({1}SC:U),I,0,0
S:G$ADC0LTH$0$0({1}SC:U),I,0,0
S:G$ADC0LTL$0$0({1}SC:U),I,0,0
S:G$ADC0MX$0$0({1}SC:U),I,0,0
S:G$ADC0PWR$0$0({1}SC:U),I,0,0
S:G$ADC0TK$0$0({1}SC:U),I,0,0
S:G$B$0$0({1}SC:U),I,0,0
S:G$CKCON0$0$0({1}SC:U),I,0,0
S:G$CKCON1$0$0({1}SC:U),I,0,0
S:G$CLKSEL$0$0({1}SC:U),I,0,0
S:G$CMP0CN0$0$0({1}SC:U),I,0,0
S:G$CMP0CN1$0$0({1}SC:U),I,0,0
S:G$CMP0MD$0$0({1}SC:U),I,0,0
S:G$CMP0MX$0$0({1}SC:U),I,0,0
S:G$CMP1CN0$0$0({1}SC:U),I,0,0
S:G$CMP1CN1$0$0({1}SC:U),I,0,0
S:G$CMP1MD$0$0({1}SC:U),I,0,0
S:G$CMP1MX$0$0({1}SC:U),I,0,0
S:G$CRC0CN0$0$0({1}SC:U),I,0,0
S:G$CRC0CN1$0$0({1}SC:U),I,0,0
S:G$CRC0CNT$0$0({1}SC:U),I,0,0
S:G$CRC0DAT$0$0({1}SC:U),I,0,0
S:G$CRC0FLIP$0$0({1}SC:U),I,0,0
S:G$CRC0IN$0$0({1}SC:U),I,0,0
S:G$CRC0ST$0$0({1}SC:U),I,0,0
S:G$DERIVID$0$0({1}SC:U),I,0,0
S:G$DEVICEID$0$0({1}SC:U),I,0,0
S:G$DPH$0$0({1}SC:U),I,0,0
S:G$DPL$0$0({1}SC:U),I,0,0
S:G$EIE1$0$0({1}SC:U),I,0,0
S:G$EIE2$0$0({1}SC:U),I,0,0
S:G$EIP1$0$0({1}SC:U),I,0,0
S:G$EIP1H$0$0({1}SC:U),I,0,0
S:G$EIP2$0$0({1}SC:U),I,0,0
S:G$EIP2H$0$0({1}SC:U),I,0,0
S:G$EMI0CN$0$0({1}SC:U),I,0,0
S:G$FLKEY$0$0({1}SC:U),I,0,0
S:G$HFO0CAL$0$0({1}SC:U),I,0,0
S:G$HFO1CAL$0$0({1}SC:U),I,0,0
S:G$HFOCN$0$0({1}SC:U),I,0,0
S:G$I2C0CN0$0$0({1}SC:U),I,0,0
S:G$I2C0DIN$0$0({1}SC:U),I,0,0
S:G$I2C0DOUT$0$0({1}SC:U),I,0,0
S:G$I2C0FCN0$0$0({1}SC:U),I,0,0
S:G$I2C0FCN1$0$0({1}SC:U),I,0,0
S:G$I2C0FCT$0$0({1}SC:U),I,0,0
S:G$I2C0SLAD$0$0({1}SC:U),I,0,0
S:G$I2C0STAT$0$0({1}SC:U),I,0,0
S:G$IE$0$0({1}SC:U),I,0,0
S:G$IP$0$0({1}SC:U),I,0,0
S:G$IPH$0$0({1}SC:U),I,0,0
S:G$IT01CF$0$0({1}SC:U),I,0,0
S:G$LFO0CN$0$0({1}SC:U),I,0,0
S:G$P0$0$0({1}SC:U),I,0,0
S:G$P0MASK$0$0({1}SC:U),I,0,0
S:G$P0MAT$0$0({1}SC:U),I,0,0
S:G$P0MDIN$0$0({1}SC:U),I,0,0
S:G$P0MDOUT$0$0({1}SC:U),I,0,0
S:G$P0SKIP$0$0({1}SC:U),I,0,0
S:G$P1$0$0({1}SC:U),I,0,0
S:G$P1MASK$0$0({1}SC:U),I,0,0
S:G$P1MAT$0$0({1}SC:U),I,0,0
S:G$P1MDIN$0$0({1}SC:U),I,0,0
S:G$P1MDOUT$0$0({1}SC:U),I,0,0
S:G$P1SKIP$0$0({1}SC:U),I,0,0
S:G$P2$0$0({1}SC:U),I,0,0
S:G$P2MASK$0$0({1}SC:U),I,0,0
S:G$P2MAT$0$0({1}SC:U),I,0,0
S:G$P2MDIN$0$0({1}SC:U),I,0,0
S:G$P2MDOUT$0$0({1}SC:U),I,0,0
S:G$P2SKIP$0$0({1}SC:U),I,0,0
S:G$P3$0$0({1}SC:U),I,0,0
S:G$P3MDIN$0$0({1}SC:U),I,0,0
S:G$P3MDOUT$0$0({1}SC:U),I,0,0
S:G$PCA0CENT$0$0({1}SC:U),I,0,0
S:G$PCA0CLR$0$0({1}SC:U),I,0,0
S:G$PCA0CN0$0$0({1}SC:U),I,0,0
S:G$PCA0CPH0$0$0({1}SC:U),I,0,0
S:G$PCA0CPH1$0$0({1}SC:U),I,0,0
S:G$PCA0CPH2$0$0({1}SC:U),I,0,0
S:G$PCA0CPL0$0$0({1}SC:U),I,0,0
S:G$PCA0CPL1$0$0({1}SC:U),I,0,0
S:G$PCA0CPL2$0$0({1}SC:U),I,0,0
S:G$PCA0CPM0$0$0({1}SC:U),I,0,0
S:G$PCA0CPM1$0$0({1}SC:U),I,0,0
S:G$PCA0CPM2$0$0({1}SC:U),I,0,0
S:G$PCA0H$0$0({1}SC:U),I,0,0
S:G$PCA0L$0$0({1}SC:U),I,0,0
S:G$PCA0MD$0$0({1}SC:U),I,0,0
S:G$PCA0POL$0$0({1}SC:U),I,0,0
S:G$PCA0PWM$0$0({1}SC:U),I,0,0
S:G$PCON0$0$0({1}SC:U),I,0,0
S:G$PCON1$0$0({1}SC:U),I,0,0
S:G$PFE0CN$0$0({1}SC:U),I,0,0
S:G$PRTDRV$0$0({1}SC:U),I,0,0
S:G$PSCTL$0$0({1}SC:U),I,0,0
S:G$PSW$0$0({1}SC:U),I,0,0
S:G$REF0CN$0$0({1}SC:U),I,0,0
S:G$REG0CN$0$0({1}SC:U),I,0,0
S:G$REG1CN$0$0({1}SC:U),I,0,0
S:G$REVID$0$0({1}SC:U),I,0,0
S:G$RSTSRC$0$0({1}SC:U),I,0,0
S:G$SBCON1$0$0({1}SC:U),I,0,0
S:G$SBRLH1$0$0({1}SC:U),I,0,0
S:G$SBRLL1$0$0({1}SC:U),I,0,0
S:G$SBUF0$0$0({1}SC:U),I,0,0
S:G$SBUF1$0$0({1}SC:U),I,0,0
S:G$SCON0$0$0({1}SC:U),I,0,0
S:G$SCON1$0$0({1}SC:U),I,0,0
S:G$SFRPAGE$0$0({1}SC:U),I,0,0
S:G$SFRPGCN$0$0({1}SC:U),I,0,0
S:G$SFRSTACK$0$0({1}SC:U),I,0,0
S:G$SMB0ADM$0$0({1}SC:U),I,0,0
S:G$SMB0ADR$0$0({1}SC:U),I,0,0
S:G$SMB0CF$0$0({1}SC:U),I,0,0
S:G$SMB0CN0$0$0({1}SC:U),I,0,0
S:G$SMB0DAT$0$0({1}SC:U),I,0,0
S:G$SMB0FCN0$0$0({1}SC:U),I,0,0
S:G$SMB0FCN1$0$0({1}SC:U),I,0,0
S:G$SMB0FCT$0$0({1}SC:U),I,0,0
S:G$SMB0RXLN$0$0({1}SC:U),I,0,0
S:G$SMB0TC$0$0({1}SC:U),I,0,0
S:G$SMOD1$0$0({1}SC:U),I,0,0
S:G$SP$0$0({1}SC:U),I,0,0
S:G$SPI0CFG$0$0({1}SC:U),I,0,0
S:G$SPI0CKR$0$0({1}SC:U),I,0,0
S:G$SPI0CN0$0$0({1}SC:U),I,0,0
S:G$SPI0DAT$0$0({1}SC:U),I,0,0
S:G$SPI0FCN0$0$0({1}SC:U),I,0,0
S:G$SPI0FCN1$0$0({1}SC:U),I,0,0
S:G$SPI0FCT$0$0({1}SC:U),I,0,0
S:G$TCON$0$0({1}SC:U),I,0,0
S:G$TH0$0$0({1}SC:U),I,0,0
S:G$TH1$0$0({1}SC:U),I,0,0
S:G$TL0$0$0({1}SC:U),I,0,0
S:G$TL1$0$0({1}SC:U),I,0,0
S:G$TMOD$0$0({1}SC:U),I,0,0
S:G$TMR2CN0$0$0({1}SC:U),I,0,0
S:G$TMR2CN1$0$0({1}SC:U),I,0,0
S:G$TMR2H$0$0({1}SC:U),I,0,0
S:G$TMR2L$0$0({1}SC:U),I,0,0
S:G$TMR2RLH$0$0({1}SC:U),I,0,0
S:G$TMR2RLL$0$0({1}SC:U),I,0,0
S:G$TMR3CN0$0$0({1}SC:U),I,0,0
S:G$TMR3CN1$0$0({1}SC:U),I,0,0
S:G$TMR3H$0$0({1}SC:U),I,0,0
S:G$TMR3L$0$0({1}SC:U),I,0,0
S:G$TMR3RLH$0$0({1}SC:U),I,0,0
S:G$TMR3RLL$0$0({1}SC:U),I,0,0
S:G$TMR4CN0$0$0({1}SC:U),I,0,0
S:G$TMR4CN1$0$0({1}SC:U),I,0,0
S:G$TMR4H$0$0({1}SC:U),I,0,0
S:G$TMR4L$0$0({1}SC:U),I,0,0
S:G$TMR4RLH$0$0({1}SC:U),I,0,0
S:G$TMR4RLL$0$0({1}SC:U),I,0,0
S:G$UART1FCN0$0$0({1}SC:U),I,0,0
S:G$UART1FCN1$0$0({1}SC:U),I,0,0
S:G$UART1FCT$0$0({1}SC:U),I,0,0
S:G$UART1LIN$0$0({1}SC:U),I,0,0
S:G$USB0ADR$0$0({1}SC:U),I,0,0
S:G$USB0AEC$0$0({1}SC:U),I,0,0
S:G$USB0CDCF$0$0({1}SC:U),I,0,0
S:G$USB0CDCN$0$0({1}SC:U),I,0,0
S:G$USB0CDSTA$0$0({1}SC:U),I,0,0
S:G$USB0CF$0$0({1}SC:U),I,0,0
S:G$USB0DAT$0$0({1}SC:U),I,0,0
S:G$USB0XCN$0$0({1}SC:U),I,0,0
S:G$VDM0CN$0$0({1}SC:U),I,0,0
S:G$WDTCN$0$0({1}SC:U),I,0,0
S:G$XBR0$0$0({1}SC:U),I,0,0
S:G$XBR1$0$0({1}SC:U),I,0,0
S:G$XBR2$0$0({1}SC:U),I,0,0
S:G$ADC0GT$0$0({2}SI:U),I,0,0
S:G$ADC0$0$0({2}SI:U),I,0,0
S:G$ADC0LT$0$0({2}SI:U),I,0,0
S:G$DP$0$0({2}SI:U),I,0,0
S:G$PCA0CP0$0$0({2}SI:U),I,0,0
S:G$PCA0CP1$0$0({2}SI:U),I,0,0
S:G$PCA0CP2$0$0({2}SI:U),I,0,0
S:G$PCA0$0$0({2}SI:U),I,0,0
S:G$SBRL1$0$0({2}SI:U),I,0,0
S:G$TMR2$0$0({2}SI:U),I,0,0
S:G$TMR2RL$0$0({2}SI:U),I,0,0
S:G$TMR3$0$0({2}SI:U),I,0,0
S:G$TMR3RL$0$0({2}SI:U),I,0,0
S:G$TMR4$0$0({2}SI:U),I,0,0
S:G$TMR4RL$0$0({2}SI:U),I,0,0
S:G$_XPAGE$0$0({1}SC:U),I,0,0
S:G$ACC_ACC0$0$0({1}SX:U),J,0,0
S:G$ACC_ACC1$0$0({1}SX:U),J,0,0
S:G$ACC_ACC2$0$0({1}SX:U),J,0,0
S:G$ACC_ACC3$0$0({1}SX:U),J,0,0
S:G$ACC_ACC4$0$0({1}SX:U),J,0,0
S:G$ACC_ACC5$0$0({1}SX:U),J,0,0
S:G$ACC_ACC6$0$0({1}SX:U),J,0,0
S:G$ACC_ACC7$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADCM0$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADCM1$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADCM2$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADWINT$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADBUSY$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADINT$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADBMEN$0$0({1}SX:U),J,0,0
S:G$ADC0CN0_ADEN$0$0({1}SX:U),J,0,0
S:G$B_B0$0$0({1}SX:U),J,0,0
S:G$B_B1$0$0({1}SX:U),J,0,0
S:G$B_B2$0$0({1}SX:U),J,0,0
S:G$B_B3$0$0({1}SX:U),J,0,0
S:G$B_B4$0$0({1}SX:U),J,0,0
S:G$B_B5$0$0({1}SX:U),J,0,0
S:G$B_B6$0$0({1}SX:U),J,0,0
S:G$B_B7$0$0({1}SX:U),J,0,0
S:G$IE_EX0$0$0({1}SX:U),J,0,0
S:G$IE_ET0$0$0({1}SX:U),J,0,0
S:G$IE_EX1$0$0({1}SX:U),J,0,0
S:G$IE_ET1$0$0({1}SX:U),J,0,0
S:G$IE_ES0$0$0({1}SX:U),J,0,0
S:G$IE_ET2$0$0({1}SX:U),J,0,0
S:G$IE_ESPI0$0$0({1}SX:U),J,0,0
S:G$IE_EA$0$0({1}SX:U),J,0,0
S:G$IP_PX0$0$0({1}SX:U),J,0,0
S:G$IP_PT0$0$0({1}SX:U),J,0,0
S:G$IP_PX1$0$0({1}SX:U),J,0,0
S:G$IP_PT1$0$0({1}SX:U),J,0,0
S:G$IP_PS0$0$0({1}SX:U),J,0,0
S:G$IP_PT2$0$0({1}SX:U),J,0,0
S:G$IP_PSPI0$0$0({1}SX:U),J,0,0
S:G$P0_B0$0$0({1}SX:U),J,0,0
S:G$P0_B1$0$0({1}SX:U),J,0,0
S:G$P0_B2$0$0({1}SX:U),J,0,0
S:G$P0_B3$0$0({1}SX:U),J,0,0
S:G$P0_B4$0$0({1}SX:U),J,0,0
S:G$P0_B5$0$0({1}SX:U),J,0,0
S:G$P0_B6$0$0({1}SX:U),J,0,0
S:G$P0_B7$0$0({1}SX:U),J,0,0
S:G$P1_B0$0$0({1}SX:U),J,0,0
S:G$P1_B1$0$0({1}SX:U),J,0,0
S:G$P1_B2$0$0({1}SX:U),J,0,0
S:G$P1_B3$0$0({1}SX:U),J,0,0
S:G$P1_B4$0$0({1}SX:U),J,0,0
S:G$P1_B5$0$0({1}SX:U),J,0,0
S:G$P1_B6$0$0({1}SX:U),J,0,0
S:G$P1_B7$0$0({1}SX:U),J,0,0
S:G$P2_B0$0$0({1}SX:U),J,0,0
S:G$P2_B1$0$0({1}SX:U),J,0,0
S:G$P2_B2$0$0({1}SX:U),J,0,0
S:G$P2_B3$0$0({1}SX:U),J,0,0
S:G$P3_B0$0$0({1}SX:U),J,0,0
S:G$P3_B1$0$0({1}SX:U),J,0,0
S:G$PCA0CN0_CCF0$0$0({1}SX:U),J,0,0
S:G$PCA0CN0_CCF1$0$0({1}SX:U),J,0,0
S:G$PCA0CN0_CCF2$0$0({1}SX:U),J,0,0
S:G$PCA0CN0_CR$0$0({1}SX:U),J,0,0
S:G$PCA0CN0_CF$0$0({1}SX:U),J,0,0
S:G$PSW_PARITY$0$0({1}SX:U),J,0,0
S:G$PSW_F1$0$0({1}SX:U),J,0,0
S:G$PSW_OV$0$0({1}SX:U),J,0,0
S:G$PSW_RS0$0$0({1}SX:U),J,0,0
S:G$PSW_RS1$0$0({1}SX:U),J,0,0
S:G$PSW_F0$0$0({1}SX:U),J,0,0
S:G$PSW_AC$0$0({1}SX:U),J,0,0
S:G$PSW_CY$0$0({1}SX:U),J,0,0
S:G$SCON0_RI$0$0({1}SX:U),J,0,0
S:G$SCON0_TI$0$0({1}SX:U),J,0,0
S:G$SCON0_RB8$0$0({1}SX:U),J,0,0
S:G$SCON0_TB8$0$0({1}SX:U),J,0,0
S:G$SCON0_REN$0$0({1}SX:U),J,0,0
S:G$SCON0_MCE$0$0({1}SX:U),J,0,0
S:G$SCON0_SMODE$0$0({1}SX:U),J,0,0
S:G$SCON1_RI$0$0({1}SX:U),J,0,0
S:G$SCON1_TI$0$0({1}SX:U),J,0,0
S:G$SCON1_RBX$0$0({1}SX:U),J,0,0
S:G$SCON1_TBX$0$0({1}SX:U),J,0,0
S:G$SCON1_REN$0$0({1}SX:U),J,0,0
S:G$SCON1_PERR$0$0({1}SX:U),J,0,0
S:G$SCON1_OVR$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_SI$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_ACK$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_ARBLOST$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_ACKRQ$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_STO$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_STA$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_TXMODE$0$0({1}SX:U),J,0,0
S:G$SMB0CN0_MASTER$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_SPIEN$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_TXNF$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_NSSMD0$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_NSSMD1$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_RXOVRN$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_MODF$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_WCOL$0$0({1}SX:U),J,0,0
S:G$SPI0CN0_SPIF$0$0({1}SX:U),J,0,0
S:G$TCON_IT0$0$0({1}SX:U),J,0,0
S:G$TCON_IE0$0$0({1}SX:U),J,0,0
S:G$TCON_IT1$0$0({1}SX:U),J,0,0
S:G$TCON_IE1$0$0({1}SX:U),J,0,0
S:G$TCON_TR0$0$0({1}SX:U),J,0,0
S:G$TCON_TF0$0$0({1}SX:U),J,0,0
S:G$TCON_TR1$0$0({1}SX:U),J,0,0
S:G$TCON_TF1$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_T2XCLK0$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_T2XCLK1$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_TR2$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_T2SPLIT$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_TF2CEN$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_TF2LEN$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_TF2L$0$0({1}SX:U),J,0,0
S:G$TMR2CN0_TF2H$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_T4XCLK0$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_T4XCLK1$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_TR4$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_T4SPLIT$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_TF4CEN$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_TF4LEN$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_TF4L$0$0({1}SX:U),J,0,0
S:G$TMR4CN0_TF4H$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_RIE$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_RXTO0$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_RXTO1$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_RFRQ$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_TIE$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_TXHOLD$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_TXNF$0$0({1}SX:U),J,0,0
S:G$UART1FCN1_TFRQ$0$0({1}SX:U),J,0,0
S:G$U2F_BUTTON$0$0({1}SX:U),J,0,0
S:G$U2F_BUTTON_VAL$0$0({1}SX:U),J,0,0
S:G$U2F_RED$0$0({1}SX:U),J,0,0
S:G$U2F_GREEN$0$0({1}SX:U),J,0,0
S:G$U2F_BLUE$0$0({1}SX:U),J,0,0
S:G$atof$0$0({2}DF,SF:S),C,0,0
S:G$atoi$0$0({2}DF,SI:S),C,0,0
S:G$atol$0$0({2}DF,SL:S),C,0,0
S:G$_uitoa$0$0({2}DF,SV:S),C,0,0
S:G$_itoa$0$0({2}DF,SV:S),C,0,0
S:G$_ultoa$0$0({2}DF,SV:S),C,0,0
S:G$_ltoa$0$0({2}DF,SV:S),C,0,0
S:G$rand$0$0({2}DF,SI:S),C,0,0
S:G$srand$0$0({2}DF,SV:S),C,0,0
S:G$calloc$0$0({2}DF,DX,SV:S),C,0,0
S:G$malloc$0$0({2}DF,DX,SV:S),C,0,0
S:G$realloc$0$0({2}DF,DX,SV:S),C,0,0
S:G$aligned_alloc$0$0({2}DF,DG,SV:S),C,0,2
S:G$free$0$0({2}DF,SV:S),C,0,0
S:G$abs$0$0({2}DF,SI:S),C,0,0
S:G$labs$0$0({2}DF,SL:S),C,0,0
S:G$mblen$0$0({2}DF,SI:S),C,0,0
S:G$mbtowc$0$0({2}DF,SI:S),C,0,0
S:G$wctomb$0$0({2}DF,SI:S),C,0,0
S:G$memcpy$0$0({2}DF,DG,SV:S),C,0,0
S:G$memmove$0$0({2}DF,DG,SV:S),C,0,0
S:G$strcpy$0$0({2}DF,DG,SC:U),C,0,0
S:G$strncpy$0$0({2}DF,DG,SC:U),C,0,0
S:G$strcat$0$0({2}DF,DG,SC:U),C,0,0
S:G$strncat$0$0({2}DF,DG,SC:U),C,0,0
S:G$memcmp$0$0({2}DF,SI:S),C,0,0
S:G$strcmp$0$0({2}DF,SI:S),C,0,0
S:G$strncmp$0$0({2}DF,SI:S),C,0,0
S:G$strxfrm$0$0({2}DF,SI:U),C,0,0
S:G$memchr$0$0({2}DF,DG,SV:S),C,0,0
S:G$strchr$0$0({2}DF,DG,SC:U),C,0,0
S:G$strcspn$0$0({2}DF,SI:U),C,0,0
S:G$strpbrk$0$0({2}DF,DG,SC:U),C,0,0
S:G$strrchr$0$0({2}DF,DG,SC:U),C,0,0
S:G$strspn$0$0({2}DF,SI:U),C,0,0
S:G$strstr$0$0({2}DF,DG,SC:U),C,0,0
S:G$strtok$0$0({2}DF,DG,SC:U),C,0,0
S:G$memset$0$0({2}DF,DG,SV:S),C,0,0
S:G$strlen$0$0({2}DF,SI:U),C,0,0
S:G$USBD_SetUsbState$0$0({2}DF,SV:S),C,0,0
S:G$USBDCH9_SetupCmd$0$0({2}DF,SC:U),C,0,0
S:G$USBD_AbortAllTransfers$0$0({2}DF,SV:S),C,0,0
S:G$USBD_AbortTransfer$0$0({2}DF,SC:S),C,0,0
S:G$USBD_Connect$0$0({2}DF,SV:S),C,0,0
S:G$USBD_Disconnect$0$0({2}DF,SV:S),C,0,0
S:G$USBD_EpIsBusy$0$0({2}DF,SB0$1:U),C,0,0
S:G$USBD_GetUsbState$0$0({2}DF,SC:U),C,0,0
S:G$USBD_Init$0$0({2}DF,SC:S),C,0,0
S:G$USBD_Read$0$0({2}DF,SC:S),C,0,0
S:G$USBD_RemoteWakeup$0$0({2}DF,SC:S),C,0,0
S:G$USBD_StallEp$0$0({2}DF,SC:S),C,0,0
S:G$USBD_Stop$0$0({2}DF,SV:S),C,0,0
S:G$USBD_Suspend$0$0({2}DF,SV:S),C,0,0
S:G$USBD_UnStallEp$0$0({2}DF,SC:S),C,0,0
S:G$USBD_Write$0$0({2}DF,SC:S),C,0,0
S:G$USBD_EnterHandler$0$0({2}DF,SV:S),C,0,0
S:G$USBD_ExitHandler$0$0({2}DF,SV:S),C,0,0
S:G$USBD_ResetCb$0$0({2}DF,SV:S),C,0,0
S:G$USBD_SofCb$0$0({2}DF,SV:S),C,0,0
S:G$USBD_DeviceStateChangeCb$0$0({2}DF,SV:S),C,0,0
S:G$USBD_IsSelfPoweredCb$0$0({2}DF,SB0$1:U),C,0,0
S:G$USBD_SetupCmdCb$0$0({2}DF,SC:U),C,0,0
S:G$USBD_SetInterfaceCb$0$0({2}DF,SC:U),C,0,0
S:G$USBD_RemoteWakeupCb$0$0({2}DF,SB0$1:U),C,0,0
S:G$USBD_RemoteWakeupDelay$0$0({2}DF,SV:S),C,0,0
S:G$USBD_Run$0$0({2}DF,SV:S),C,0,0
S:G$USBD_XferCompleteCb$0$0({2}DF,SI:U),C,0,0
S:G$USB_ReadFIFO$0$0({2}DF,SV:S),C,0,0
S:G$USB_WriteFIFO$0$0({2}DF,SV:S),C,0,0
S:G$USB_GetIntsEnabled$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_IsRegulatorEnabled$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_IsPrefetchEnabled$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_SuspendOscillator$0$0({2}DF,SV:S),C,0,0
S:G$USB_SetIndex$0$0({2}DF,SV:S),C,0,0
S:G$USB_GetCommonInts$0$0({2}DF,SC:U),C,0,0
S:G$USB_GetInInts$0$0({2}DF,SC:U),C,0,0
S:G$USB_GetOutInts$0$0({2}DF,SC:U),C,0,0
S:G$USB_GetIndex$0$0({2}DF,SC:U),C,0,0
S:G$USB_IsSuspended$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_GetSetupEnd$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_Ep0SentStall$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_Ep0InPacketReady$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_Ep0OutPacketReady$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_Ep0GetCount$0$0({2}DF,SC:U),C,0,0
S:G$USB_EpnInGetSentStall$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_EpnGetInPacketReady$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_EpnOutGetSentStall$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_EpnGetOutPacketReady$0$0({2}DF,SB0$1:U),C,0,0
S:G$USB_EpOutGetCount$0$0({2}DF,SI:U),C,0,0
S:G$USB_GetSofNumber$0$0({2}DF,SI:U),C,0,0
S:G$USB_AbortInEp$0$0({2}DF,SV:S),C,0,0
S:G$USB_AbortOutEp$0$0({2}DF,SV:S),C,0,0
S:G$USB_ActivateEp$0$0({2}DF,SV:S),C,0,0
S:G$u2f_hid_init$0$0({2}DF,SV:S),C,0,0
S:G$u2f_hid_set_len$0$0({2}DF,SV:S),C,0,0
S:G$u2f_hid_writeback$0$0({2}DF,SV:S),C,0,0
S:G$u2f_hid_flush$0$0({2}DF,SV:S),C,0,0
S:G$u2f_hid_request$0$0({2}DF,SV:S),C,0,0
S:G$u2f_hid_check_timeouts$0$0({2}DF,SV:S),C,0,0
S:G$u2f_print_hid_check_timeouts$0$0({2}DF,SV:S),C,0,0
S:G$set_app_u2f_hid_msg$0$0({2}DF,SV:S),C,0,0
S:G$set_app_error$0$0({2}DF,SV:S),C,0,0
S:G$get_app_error$0$0({2}DF,SC:U),C,0,0
S:G$get_app_state$0$0({2}DF,SC:U),C,0,0
S:G$set_app_state$0$0({2}DF,SV:S),C,0,0
S:G$rgb$0$0({2}DF,SV:S),C,0,0
S:G$app_wink$0$0({2}DF,SV:S),C,0,0
S:G$u2f_init$0$0({2}DF,SV:S),C,0,0
S:G$u2f_wipe_keys$0$0({2}DF,SC:S),C,0,0
S:G$smb_init$0$0({2}DF,SV:S),C,0,0
S:G$smb_read$0$0({2}DF,SC:U),C,0,0
S:G$smb_write$0$0({2}DF,SV:S),C,0,0
S:G$smb_set_ext_write$0$0({2}DF,SV:S),C,0,0
S:G$reverse_bits$0$0({2}DF,SI:U),C,0,0
S:G$feed_crc$0$0({2}DF,SI:U),C,0,0
S:G$u2f_delay$0$0({2}DF,SV:S),C,0,0
S:G$usb_write$0$0({2}DF,SV:S),C,0,0
S:G$putf$0$0({2}DF,SV:S),C,0,0
S:G$dump_hex$0$0({2}DF,SV:S),C,0,0
S:G$u2f_prints$0$0({2}DF,SV:S),C,0,0
S:G$__int2strn$0$0({2}DF,DG,SC:U),C,0,0
S:G$u2f_putd$0$0({2}DF,SV:S),C,0,0
S:G$u2f_putx$0$0({2}DF,SV:S),C,0,0
S:G$u2f_printd$0$0({2}DF,SV:S),C,0,0
S:G$u2f_printx$0$0({2}DF,SV:S),C,0,0
S:G$u2f_printb$0$0({2}DF,SV:S),C,0,0
S:G$u2f_printlx$0$0({2}DF,SV:S),C,0,0
S:G$ReportDescriptor0$0$0({34}DA34d,SC:U),D,0,0
S:G$deviceDesc$0$0({0}DA0d,SC:U),D,0,0
S:G$configDesc$0$0({0}DA0d,SC:U),D,0,0
S:G$initstruct$0$0({10}ST__00000008:S),D,0,0
S:G$WMASK$0$0({0}DA0d,SC:U),D,0,0
S:G$RMASK$0$0({0}DA0d,SC:U),D,0,0
S:FInterrupts$__xinit_SMB_write_buf$0$0({3}DG,SC:U),C,0,0
S:FInterrupts$__xinit_SMB_read_buf$0$0({3}DG,SC:U),C,0,0
S:FInterrupts$__xinit_SMB_write_ext_buf$0$0({3}DG,SC:U),C,0,0
S:FInterrupts$__xinit_SMB_preflags$0$0({1}SC:U),C,0,0
S:FInterrupts$__xinit_SMB_crc$0$0({2}SI:U),C,0,0
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E I N F O --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Types; use Types;
with Uintp; use Uintp;
with Urealp; use Urealp;
package Einfo is
-- This package defines the annotations to the abstract syntax tree that
-- are needed to support semantic processing of an Ada compilation.
-- These annotations are for the most part attributes of declared entities,
-- and they correspond to conventional symbol table information. Other
-- attributes include sets of meanings for overloaded names, possible
-- types for overloaded expressions, flags to indicate deferred constants,
-- incomplete types, etc. These attributes are stored in available fields
-- in tree nodes (i.e. fields not used by the parser, as defined by the
-- Sinfo package specification), and accessed by means of a set of
-- subprograms which define an abstract interface.
-- There are two kinds of semantic information
-- First, the tree nodes with the following Nkind values:
-- N_Defining_Identifier
-- N_Defining_Character_Literal
-- N_Defining_Operator_Symbol
-- are called Entities, and constitute the information that would often
-- be stored separately in a symbol table. These nodes are all extended
-- to provide extra space, and contain fields which depend on the entity
-- kind, as defined by the contents of the Ekind field. The use of the
-- Ekind field, and the associated fields in the entity, are defined
-- in this package, as are the access functions to these fields.
-- Second, in some cases semantic information is stored directly in other
-- kinds of nodes, e.g. the Etype field, used to indicate the type of an
-- expression. The access functions to these fields are defined in the
-- Sinfo package, but their full documentation is to be found in
-- the Einfo package specification.
-- Declaration processing places information in the nodes of their defining
-- identifiers. Name resolution places in all other occurrences of an
-- identifier a pointer to the corresponding defining occurrence.
--------------------------------
-- The XEINFO Utility Program --
--------------------------------
-- XEINFO is a utility program which automatically produces a C header file,
-- a-xeinfo.h from the spec and body of package Einfo. It reads the input
-- files einfo.ads and einfo.adb and produces the output file a-xeinfo.h.
-- In order for this utility program to operate correctly, the form of the
-- einfo.ads and einfo.adb files must meet certain requirements and be laid
-- out in a specific manner.
-- The general form of einfo.ads is as follows:
-- type declaration for type Entity_Kind
-- subtype declarations declaring subranges of Entity_Kind
-- subtype declarations declaring synonyms for some standard types
-- function specs for attributes
-- procedure specs
-- pragma Inline declarations
-- This order must be observed. There are no restrictions on the procedures,
-- since the C header file only includes functions (Gigi is not allowed to
-- modify the generated tree). However, functions are required to have headers
-- that fit on a single line.
-- XEINFO reads and processes the function specs and the pragma Inlines. For
-- functions that are declared as inlined, XEINFO reads the corresponding body
-- from xeinfo.adb, and processes it into C code. This results in some strict
-- restrictions on which functions can be inlined:
-- The function spec must be on a single line
-- There can only be a single statement, contained on a single line,
-- not counting any pragma Assert statements.
-- This single statement must either by a function call with simple,
-- single token arguments, or it must be a membership test of the form
-- a in b, where a and b are single tokens.
-- For functions that are not inlined, there is no restriction on the body,
-- and XEINFO generates a direct reference in the C header file which allows
-- the C code in Gigi to directly call the corresponding Ada body.
----------------------------------
-- Handling of Type'Size Values --
----------------------------------
-- The Ada 95 RM contains some rather peculiar (to us!) rules on the value
-- of type'Size (see RM 13.3(55)). We have found that attempting to use
-- these RM Size values generally, and in particular for determining the
-- default size of objects, creates chaos, and major incompatibilies in
-- existing code.
-- We proceed as follows, for discrete and fixed-point subtypes, we have
-- two separate sizes for each subtype:
-- The Object_Size, which is used for determining the default size of
-- objects and components. This size value can be referred to using the
-- Object_Size attribute. The phrase "is used" here means that it is
-- the basis of the determination of the size. The backend is free to
-- pad this up if necessary for efficiency, e.g. an 8-bit stand-alone
-- character might be stored in 32 bits on a machine with no efficient
-- byte access instructions such as the Alpha.
-- The default rules for the value of Object_Size for fixed-point and
-- discrete types are as follows:
-- The Object_Size for base subtypes reflect the natural hardware
-- size in bits (see Ttypes and Cstand for integer types). For
-- enumeration and fixed-point base subtypes have 8. 16. 32 or 64
-- bits for this size, depending on the range of values to be stored.
-- The Object_Size of a subtype is the same as the Object_Size of
-- the subtype from which it is obtained.
-- The Object_Size of a derived base type is copied from the parent
-- base type, and the Object_Size of a derived first subtype is copied
-- from the parent first subtype.
-- The Value_Size which is the number of bits required to store a value
-- of the type. This size can be referred to using the Value_Size
-- attribute. This value is used to determine how tightly to pack
-- records or arrays with components of this type, and also affects
-- the semantics of unchecked conversion (unchecked conversions where
-- the Value_Size values differ generate a warning, and are potentially
-- target dependent).
-- The default rule for the value of Value_Size are as follows:
-- The Value_Size for a base subtype is the minimum number of bits
-- required to store all values of the type (including the sign bit
-- only if negative values are possible).
-- If a subtype statically matches the first subtype, then it has
-- by default the same Value_Size as the first subtype. This is a
-- consequence of RM 13.1(14) ("if two subtypes statically match,
-- then their subtype-specific aspects are the same".)
-- All other subtypes have a Value_Size corresponding to the minimum
-- number of bits required to store all values of the subtype. For
-- dynamic bounds, it is assumed that the value can range down or up
-- to the corresponding bound of the ancestor
-- The RM defined attribute Size corresponds to the Value_Size attribute.
-- The Size attribute may be defined for a first-named subtype. This sets
-- the Value_Size of the first-named subtype to the given value, and the
-- Object_Size of this first-named subtype to the given value padded up
-- to an appropriate boundary. It is a consequence of the default rules
-- above that this Object_Size will apply to all further subtypes. On the
-- otyher hand, Value_Size is affected only for the first subtype, any
-- dynamic subtypes obtained from it directly, and any statically matching
-- subtypes. The Value_Size of any other static subtypes is not affected.
-- Value_Size and Object_Size may be explicitly set for any subtype using
-- an attribute definition clause. Note that the use of these attributes
-- can cause the RM 13.1(14) rule to be violated. If two access types
-- reference aliased objects whose subtypes have differing Object_Size
-- values as a result of explicit attribute definition clauses, then it
-- is erroneous to convert from one access subtype to the other.
-- At the implementation level, Esize stores the Object_Size and the
-- RM_Size field stores the Value_Size (and hence the value of the
-- Size attribute, which, as noted above, is equivalent to Value_Size).
-- To get a feel for the difference, consider the following examples (note
-- that in each case the base is short_short_integer with a size of 8):
-- Object_Size Value_Size
-- type x1 is range 0..5; 8 3
-- type x2 is range 0..5;
-- for x2'size use 12; 12 12
-- subtype x3 is x2 range 0 .. 3; 12 2
-- subtype x4 is x2'base range 0 .. 10; 8 4
-- subtype x5 is x2 range 0 .. dynamic; 12 (7)
-- subtype x6 is x2'base range 0 .. dynamic; 8 (7)
-- Note: the entries marked (7) are not actually specified by the Ada 95 RM,
-- but it seems in the spirit of the RM rules to allocate the minimum number
-- of bits known to be large enough to hold the given range of values.
-- So far, so good, but GNAT has to obey the RM rules, so the question is
-- under what conditions must the RM Size be used. The following is a list
-- of the occasions on which the RM Size must be used:
-- Component size for packed arrays or records
-- Value of the attribute Size for a type
-- Warning about sizes not matching for unchecked conversion
-- The RM_Size field keeps track of the RM Size as needed in these
-- three situations.
-- For types other than discrete and fixed-point types, the Object_Size
-- and Value_Size are the same (and equivalent to the RM attribute Size).
-- Only Size may be specified for such types.
-----------------------
-- Entity Attributes --
-----------------------
-- This section contains a complete list of the attributes that are defined
-- on entities. Some attributes apply to all entities, others only to certain
-- kinds of entities. In the latter case the attribute should only be set or
-- accessed if the Ekind field indicates an appropriate entity.
-- There are two kinds of attributes that apply to entities, stored and
-- synthesized. Stored attributes correspond to a field or flag in the entity
-- itself. Such attributes are identified in the table below by giving the
-- field or flag in the attribute that is used to hold the attribute value.
-- Synthesized attributes are not stored directly, but are rather computed as
-- needed from other attributes, or from information in the tree. These are
-- marked "synthesized" in the table below. The stored attributes have both
-- access functions and set procedures to set the corresponding values, while
-- synthesized attributes have only access functions.
-- Note: in the case of Node, Uint, or Elist fields, there are cases where
-- the same physical field is used for different purposes in different
-- entities, so these access functions should only be referenced for the
-- class of entities in which they are defined as being present. Flags are
-- not overlapped in this way, but nevertheless as a matter of style and
-- abstraction (which may or may not be checked by assertions in the body),
-- this restriction should be observed for flag fields as well.
-- Note: certain of the attributes on types apply only to base types, and
-- are so noted by the notation [base type only]. These are cases where the
-- attribute of any subtype is the same as the attribute of the base type.
-- The attribute can be referenced on a subtype (and automatically retrieves
-- the value from the base type), and if an attempt is made to set them on
-- other than a subtype, they will instead be set on the corresponding base
-- type.
-- Other attributes are noted as applying the implementation base type only.
-- These are representation attributes which must always apply to a full
-- non-private type, and where the attributes are always on the full type.
-- The attribute can be referenced on a subtype (and automatically retries
-- the value from the implementation base type), and if an attempt is made
-- to set them on other than a subtype, they will instead be set on the
-- corresponding implementation base type.
-- Accept_Address (Elist21)
-- Present in entries. If an accept has a statement sequence, then an
-- address variable is created, which is used to hold the address of the
-- parameters, as passed by the runtime. Accept_Address holds an element
-- list which represents a stack of entities for these address variables.
-- The current entry is the top of the stack, which is the last element
-- on the list. A stack is required to handle the case of nested select
-- statements referencing the same entry.
-- Actual_Subtype (Node17)
-- Present in variables, constants, and formal parameters. This is the
-- subtype imposed by the value of the object, as opposed to its nominal
-- subtype, which is imposed by the declaration. The actual subtype
-- differs from the nominal one when the latter is indefinite (as in the
-- case of an unconstrained formal parameter, or a variable declared
-- with an unconstrained type and an initial value). The nominal subtype
-- is the Etype entry for the entity. The Actual_Subtype field is set
-- only if the actual subtype differs from the nominal subtype. If the
-- actual and nominal subtypes are the same, then the Actual_Subtype
-- field is Empty, and Etype indicates both types.
--
-- For objects, the Actual_Subtype is set only if this is a discriminated
-- type. For arrays, the bounds of the expression are obtained and the
-- Etype of the object is directly the constrained subtype. This is
-- rather irregular, and the semantic checks that depend on the nominal
-- subtype being unconstrained use flag Is_Constr_Subt_For_U_Nominal(qv).
-- Access_Disp_Table (Node16) [base type only]
-- Present in record type entities. For a tagged type, points to the
-- dispatch table associated with the tagged type. For a non-tagged
-- record, contains Empty.
-- Address_Clause (synthesized)
-- Applies to entries, objects and subprograms. Set if an address clause
-- is present which references the object or subprogram and points to
-- the N_Attribute_Definition_Clause node. Empty if no Address clause.
-- The expression in the address clause is always a constant that is
-- defined before the entity to which the address clause applies.
-- Note: Gigi references this field in E_Task_Type entities???
-- Address_Taken (Flag104)
-- Present in all entities. Set if the Address or Unrestricted_Access
-- attribute is applied directly to the entity, i.e. the entity is the
-- entity of the prefix of the attribute reference. Used by Gigi to
-- make sure that the address can be meaningfully taken.
-- Alias (Node18)
-- Present in overloaded entities (literals, subprograms, entries).
-- Points to parent subprogram of a derived subprogram. Also used for
-- a subprogram renaming, where it points to the renamed subprogram.
-- Always empty for entries.
-- Alignment (Uint14)
-- Present in all entities for types and objects. This indicates the
-- desired alignment for a type, or the actual alignment for an object.
-- A value of zero (Uint_0) indicates that the alignment is not yet set.
-- The alignment can be set by an explicit alignment clause, or set by
-- the front-end in package Layout, or set by the back-end.
-- Alignment_Clause (synthesized)
-- Appllies to all entities for types and objects. If an alignment
-- attribute definition clause is present for the entity, then this
-- function returns the N_Attribute_Definition clause that specifies the
-- alignment. If no alignment clause applies to the type, then the call
-- to this function returns Empty. Note that the call can return a
-- non-Empty value even if Has_Alignment_Clause is not set (happens with
-- subtype and derived type declarations). Note also that a record
-- definition clause with an (obsolescent) mod clause is converted
-- into an attribute definition clause for this purpose.
-- Ancestor_Subtype (synthesized)
-- Applies to all type and subtype entities. If the argument is a
-- subtype then it returns the subtype or type from which the subtype
-- was obtained, otherwise it returns Empty.
-- Associated_Formal_Package (Node12)
-- Present in packages that are the actuals of formal_packages. Points
-- to the entity in the declaration for the formal package.
-- Associated_Node_For_Itype (Node8)
-- Present in all type and subtype entities. Set non-Empty only for
-- Itypes. Set to point to the associated node for the Itype, i.e.
-- the node whose elaboration generated the Itype. This is used for
-- copying trees, to determine whether or not to copy an Itype.
-- Associated_Storage_Pool (Node22)
-- Present in simple and general access type entities. References the
-- storage pool to be used for the corresponding collection. A value of
-- Empty means that the default pool is to be used.
-- Associated_Final_Chain (Node23)
-- Present in simple and general access type entities. References the
-- List_Controller object that holds the finalization chain on which
-- are attached dynamically allocated objects referenced by the access
-- type. Empty when the access type cannot reference a controlled object.
-- Barrier_Function (Node12)
-- Present in protected entries and entry families. This is the
-- subprogram declaration for the body of the function that returns
-- the value of the entry barrier.
-- Base_Type (synthesized)
-- Applies to all type entities. Returns the base type of a type or
-- subtype. The base type of a type is the type itself. The base type
-- of a subtype is the type that it constrains (which is always a type
-- entity, not some other subtype). Note that in the case of a subtype
-- of a private type, it is possible for the base type attribute to
-- return a private type, even if the subtype to which it applies is
-- non-private. See also Implementation_Base_Type. Note: it is allowed
-- to apply Base_Type to other than a type, in which case it simply
-- returns the entity unchanged.
-- Block_Node (Node11)
-- Present in block entities. Points to the identifier in the
-- Block_Statement itself. Used when retrieving the block construct
-- for finalization purposes, The block entity has an implicit label
-- declaration in the enclosing declarative part, and has otherwise
-- no direct connection in the tree with the block statement. The
-- link is to the identifier (which is an occurrence of the entity)
-- and not to the block_statement itself, because the statement may
-- be rewritten, e.g. in the process of removing dead code.
-- Body_Entity (Node19)
-- Present in package and generic package entities, points to the
-- corresponding package body entity if one is present.
-- C_Pass_By_Copy (Flag125) [implementation base type only]
-- Present in record types. Set if a pragma Convention for the record
-- type specifies convention C_Pass_By_Copy. This convention name is
-- treated as identical in all respects to convention C, except that
-- if it is specified for a record type, then the C_Pass_By_Copy flag
-- is set, and if a foreign convention subprogram has a formal of the
-- corresponding type, then the parameter passing mechanism will be
-- set to By_Copy (unless specifically overridden by an Import or
-- Export pragma).
-- Chars (Name1)
-- Present in all entities. This field contains an entry into the names
-- table that has the character string of the identifier, character
-- literal or operator symbol. See Namet for further details. Note that
-- throughout the processing of the front end, this name is the simple
-- unqualified name. However, just before gigi is called, a call is made
-- to Qualify_All_Entity_Names. This causes entity names to be qualified
-- using the encoding described in exp_dbug.ads, and from that point on
-- (including post gigi steps such as cross-reference generation), the
-- entities will contain the encoded qualified names.
-- Class_Wide_Type (Node9)
-- Present in all type entities. For a tagged type or subtype, returns
-- the corresponding implicitly declared class-wide type. Set to Empty
-- for non-tagged types.
-- Cloned_Subtype (Node16)
-- Present in E_Record_Subtype and E_Class_Wide_Subtype entities.
-- Each such entity can either have a Discriminant_Constraint, in
-- which case it represents a distinct type from the base type (and
-- will have a list of components and discrimants in the list headed by
-- First_Entity) or else no such constraint, in which case it will be a
-- copy of the base type.
--
-- o Each element of the list in First_Entity is copied from the base
-- type; in that case, this field is Empty.
--
-- o The list in First_Entity is shared with the base type; in that
-- case, this field points to that entity.
--
-- A record or classwide subtype may also be a copy of some other
-- subtype and share the entities in the First_Entity with that subtype.
-- In that case, this field points to that subtype.
--
-- For E_Class_Wide_Subtype, the presence of Equivalent_Type overrides
-- this field. Note that this field ONLY appears in subtype entries, not
-- in type entries, it is not present, and it is an error to reference
-- Cloned_Subtype in an E_Record_Type or E_Class_Wide_Type entity.
-- Comes_From_Source
-- This flag appears on all nodes, including entities, and indicates
-- that the node was created by the scanner or parser from the original
-- source. Thus for entities, it indicates that the entity is defined
-- in the original source program.
-- Component_Alignment (special field) [base type only]
-- Present in array and record entities. Contains a value of type
-- Component_Alignment_Kind indicating the alignment of components.
-- Set to Calign_Default normally, but can be overridden by use of
-- the Component_Alignment pragma. Note: this field is currently
-- stored in a non-standard way, see body for details.
-- Component_Bit_Offset (Uint11)
-- Present in record components (E_Component, E_Discriminant) if a
-- component clause applies to the component. First bit position of
-- given component, computed from the first bit and position values
-- given in the component clause. A value of No_Uint means that the
-- value is not yet known. The value can be set by the appearence of
-- an explicit component clause in a record representation clause,
-- or it can be set by the front-end in package Layout, or it can be
-- set by the backend. By the time backend processing is completed,
-- this field is always set. A negative value is used to represent
-- a value which is not known at compile time, and must be computed
-- at run-time (this happens if fields of a record have variable
-- lengths). See package Layout for details of these values.
--
-- Note: this field is obsolescent, to be eventually replaced entirely
-- by Normalized_First_Bit and Normalized_Position, but for the moment,
-- gigi is still using (and back annotating) this field, and gigi does
-- not know about the new fields. For the front end layout case, the
-- Component_Bit_Offset field is only set if it is static, and otherwise
-- the new Normalized_First_Bit and Normalized_Position fields are used.
-- Component_Clause (Node13)
-- Present in record components and discriminants. If a record
-- representation clause is present for the corresponding record
-- type a that specifies a position for the component, then the
-- Component_Clause field of the E_Component entity points to the
-- N_Component_Claue node. Set to Empty if no record representation
-- clause was present, or if there was no specification for this
-- component.
-- Component_Size (Uint22) [implementation base type only]
-- Present in array types. It contains the component size value for
-- the array. A value of zero means that the value is not yet set.
-- The value can be set by the use of a component size clause, or
-- by the front end in package Layout, or by the backend. A negative
-- value is used to represent a value which is not known at compile
-- time, and must be computed at run-time (this happens if the type
-- of the component has a variable length size). See package Layout
-- for details of these values.
-- Component_Type (Node20) [implementation base type only]
-- Present in array types and subtypes, and also in the special
-- enumeration table type created for enumeration type. References
-- the entity for the component type.
-- Constant_Value (synthesized)
-- Applies to constants, named integers, and named reals. Obtains
-- the initialization expression for the entity. Will return Empty for
-- for a deferred constant whose full view is not available or in some
-- other cases of internal entities, which cannot be treated as
-- constants from the point of view of constant folding.
-- Corresponding_Concurrent_Type (Node18)
-- Present in record types that are constructed by the expander to
-- represent task and protected types (Is_Concurrent_Record_Type flag
-- set True). Points to the entity for the corresponding task type or
-- protected type.
-- Corresponding_Discriminant (Node19)
-- Present in discriminants of a derived type, when the discriminant is
-- used to constrain a discriminant of the parent type. Points to the
-- corresponding discriminant in the parent type. Otherwise it is Empty.
-- Corresponding_Equality (Node13)
-- Present in function entities for implicit inequality operators.
-- Denotes the explicit or derived equality operation that creates
-- the implicit inequality. Note that this field is not present in
-- other function entities, only in implicit inequality routines,
-- where Comes_From_Source is always False.
-- Corresponding_Record_Type (Node18)
-- Present in protected and task types and subtypes. References the
-- entity for the corresponding record type constructed by the expander
-- (see Exp_Ch9). This type is used to represent values of the task type.
-- Corresponding_Remote_Type (Node22)
-- Present in record types that describe the fat pointer structure for
-- Remote_Access_To_Subrogram types. References the original access type.
-- CR_Discriminant (Node23)
-- Present in discriminants of concurrent types. Denotes the homologous
-- discriminant of the corresponding record type. The CR_Discriminant is
-- created at the same time as the discriminal, and used to replace
-- occurrences of the discriminant within the type declaration.
-- Debug_Info_Off (Flag166)
-- Present in all entities. Set if a pragma Suppress_Debug_Info applies
-- to the entity, or if internal processing in the compiler determines
-- that suppression of debug information is desirable.
-- Debug_Renaming_Link (Node13)
-- Used to link the enumeration literal of a debug renaming declaration
-- to the renamed entity. See Exp_Dbug.Debug_Renaming_Declaration for
-- details of the use of this field.
-- Declaration_Node (synthesized)
-- Applies to all entities. Returns the tree node for the declaration
-- that declared the entity. Normally this is just the Parent of the
-- entity. One exception arises with child units, where the parent of
-- the entity is a selected component or a defining program unit name.
-- Another exception is that if the entity is an incomplete type that
-- has been completed, then we obtain the declaration node denoted by
-- the full type, i.e. the full type declaration node.
-- Default_Expr_Function (Node21)
-- Present in parameters. It holds the entity of the parameterless
-- function that is built to evaluate the default expression if it is
-- more complex than a simple identifier or literal. For the latter
-- simple cases or if there is no default value, this field is Empty.
-- Default_Expressions_Processed (Flag108)
-- A flag in subprograms (functions, operators, procedures) and in
-- entries and entry families used to indicate that default expressions
-- have been processed and to avoid multiple calls to process the
-- default expressions (see Freeze.Process_Default_Expressions), which
-- would not only waste time, but also generate false error messages.
-- Default_Value (Node20)
-- Present in formal parameters. Points to the node representing the
-- expression for the default value for the parameter. Empty if the
-- parameter has no default value (which is always the case for OUT
-- and IN OUT parameters in the absence of errors).
-- Delay_Cleanups (Flag114)
-- Present in entities that have finalization lists (subprograms
-- blocks, and tasks). Set if there are pending generic body
-- instantiations for the corresponding entity. If this flag is
-- set, then generation of cleanup actions for the corresponding
-- entity must be delayed, since the insertion of the generic body
-- may affect cleanup generation (see Inline for further details).
-- Delay_Subprogram_Descriptors (Flag50)
-- Present in entities for which exception subprogram descriptors
-- are generated (subprograms, package declarations and package
-- bodies). Present if there are pending generic body instantiations
-- for the corresponding entity. If this flag is set, then generation
-- of the subprogram descriptor for the corresponding enities must
-- be delayed, since the insertion of the generic body may add entries
-- to the list of handlers.
--
-- Note: for subprograms, Delay_Subprogram_Descriptors is set if and
-- only if Delay_Cleanups is set. But Delay_Cleanups can be set for a
-- a block (in which case Delay_Subprogram_Descriptors is set for the
-- containing subprogram). In addition Delay_Subprogram_Descriptors is
-- set for a library level package declaration or body which contains
-- delayed instantiations (in this case the descriptor refers to the
-- enclosing elaboration procedure).
-- Delta_Value (Ureal18)
-- Present in fixed and decimal types. Points to a universal real
-- that holds value of delta for the type, as given in the declaration
-- or as inherited by a subtype or derived type.
-- Dependent_Instances (Elist8)
-- Present in packages that are instances. Holds list of instances
-- of inner generics. Used to place freeze nodes for those instances
-- after that of the current one, i.e. after the corresponding generic
-- bodies.
-- Depends_On_Private (Flag14)
-- Present in all type entities. Set if the type is private or if it
-- depends on a private type.
-- Designated_Type (synthesized)
-- Applies to access types. Returns the designated type. Differs
-- from Directly_Designated_Type in that if the access type refers
-- to an incomplete type, and the full type is available, then this
-- full type is returned instead of the incomplete type.
-- Digits_Value (Uint17)
-- Present in floating point types and subtypes and decimal types and
-- subtypes. Contains the Digits value specified in the declaration.
-- Directly_Designated_Type (Node20)
-- Present in access types. This field points to the type that is
-- directly designated by the access type. In the case of an access
-- type to an incomplete type, this field references the incomplete
-- type. Note that in the semantic processing, what is useful in
-- nearly all cases is the full type designated by the access type.
-- The function Designated_Type obtains this full type in the case of
-- access to an incomplete type.
-- Discard_Names (Flag88)
-- Present in types and exception entities. Set if pragma Discard_Names
-- applies to the entity. It is also set for declarative regions and
-- package specs for which a Discard_Names pragma with zero arguments
-- has been encountered. The purpose of setting this flag is to be able
-- to set the Discard_Names attribute on enumeration types declared
-- after the pragma within the same declarative region.
-- Discriminal (Node17)
-- Present in discriminants (Discriminant formal: GNAT's first
-- coinage). The entity used as a formal parameter that corresponds
-- to a discriminant. See section "Use of Discriminants" for details.
-- Discriminal_Link (Node10)
-- Present in discriminals (which have an Ekind of E_In_Parameter,
-- or E_Constant), points back to corresponding discriminant.
-- Discriminant_Checking_Func (Node20)
-- Present in components. Points to the defining identifier of the
-- function built by the expander returns a Boolean indicating whether
-- the given record component exists for the current discriminant
-- values.
-- Discriminant_Constraint (Elist21)
-- Present in entities whose Has_Discriminants flag is set (concurrent
-- types, subtypes, record types and subtypes, private types and
-- subtypes, limited private types and subtypes and incomplete types).
-- It is an error to reference the Discriminant_Constraint field if
-- Has_Disciminants is False.
--
-- If the Is_Constrained flag is set, Discriminant_Constraint points
-- to an element list containing the discriminant constraints in the
-- same order in which the discriminants are declared.
--
-- If the Is_Constrained flag is not set but the discriminants of the
-- unconstrained type have default initial values then this field
-- points to an element list giving these default initial values in
-- the same order in which the discriminants are declared. Note that
-- in this case the entity cannot be a tagged record type, because
-- discriminants in this case cannot have defaults.
--
-- If the entity is a tagged record implicit type, then this field is
-- inherited from the first subtype (so that the itype is subtype
-- conformant with its first subtype, which is needed when the first
-- subtype overrides primitive operations inherited by the implicit
-- base type).
--
-- In all other cases Discriminant_Constraint contains the empty
-- Elist (ie it is initialized with a call to New_Elmt_List).
-- Discriminant_Default_Value (Node20)
-- Present in discriminants. Points to the node representing the
-- expression for the default value of the discriminant. Set to
-- Empty if the discriminant has no default value.
-- Discriminant_Number (Uint15)
-- Present in discriminants. Gives the ranking of a discriminant in
-- the list of discriminants of the type, i.e. a sequential integer
-- index starting at 1 and ranging up to Number_Discriminants.
-- DTC_Entity (Node16)
-- Present in function and procedure entities. Set to Empty unless
-- the subprogram is dispatching in which case it references the
-- Dispatch Table pointer Component. That is to say the component _tag
-- for regular Ada tagged types, for CPP_Class types and their
-- descendants this field points to the component entity in the record
-- that is the Vtable pointer for the Vtable containing the entry that
-- references the subprogram.
-- DT_Entry_Count (Uint15)
-- Present in E_Component entities. Only used for component marked
-- Is_Tag. Store the number of entries in the Vtable (or Dispatch Table)
-- DT_Position (Uint15)
-- Present in function and procedure entities which are dispatching
-- (should not be referenced without first checking that flag
-- Is_Dispatching_Operation is True). Contains the offset into
-- the Vtable for the entry that references the subprogram.
-- Ekind (Ekind)
-- Present in all entities. Contains a value of the enumeration type
-- Entity_Kind declared in a subsequent section in this spec.
-- Elaborate_All_Desirable (Flag146)
-- Present in package and subprogram entities, and in generic package
-- and subprogram entities. Set if internal analysis of a client that
-- with's this unit determines that Elaborate_All is desirable, i.e.
-- that there is a possibility that Program_Error may be raised if
-- Elaborate_All conditions cannot be met.
-- Elaboration_Entity (Node13)
-- Present in generic and non-generic package and subprogram
-- entities. This is a boolean entity associated with the unit that
-- is initiallly set to False, and is set True when the unit is
-- elaborated. This is used for two purposes. First, it is used to
-- implement required access before elaboration checks (the flag
-- must be true to call a subprogram at elaboration time). Second,
-- it is used to guard against repeated execution of the generated
-- elaboration code.
--
-- Note that we always allocate this flag, and set this field, but
-- we do not always actually use it. It is only used if it is needed
-- for access-before-elaboration use (see Elaboration_Entity_Required
-- flag) or if either the spec or the body has elaboration code. If
-- neither of these two conditions holds, then the entity is still
-- allocated (since we don't know early enough whether or not there
-- is elaboration code), but is simply not used for any purpose.
-- Elaboration_Entity_Required (Flag174)
-- Present in generics and non-generic package and subprogram
-- entities. Set only if Elaboration_Entity is non-Empty to indicate
-- that the boolean is required to be set even if there is no other
-- elaboration code. This occurs when the Elaboration_Entity flag
-- is used for required access-before-elaboration checking. If the
-- flag is only for preventing multiple execution of the elaboration
-- code, then if there is no other elaboration code, obviously there
-- is no need to set the flag.
-- Enclosing_Dynamic_Scope (synthesized)
-- Appliesa to all entities. Returns the closest dynamic scope in which
-- the entity is declared or Standard_Standard for library-level entities
-- Enclosing_Scope (Node18)
-- Present in labels. Denotes the innermost enclosing construct that
-- contains the label. Identical to the scope of the label, except for
-- labels declared in the body of an accept statement, in which case the
-- entry_name is the Enclosing_Scope. Used to validate goto's within
-- accept statements.
-- Entry_Accepted (Flag152)
-- Present in E_Entry and E_Entry_Family entities. Set if there is
-- at least one accept for this entry in the task body. Used to
-- generate warnings for missing accepts.
-- Entry_Bodies_Array (Node15)
-- Present in protected types for which Has_Entries is true.
-- This is the defining identifier for the array of entry body
-- action procedures and barrier functions used by the runtime to
-- execute the user code associated with each entry.
-- Entry_Cancel_Parameter (Node23)
-- Present in blocks. This only applies to a block statement for
-- which the Is_Asynchronous_Call_Block flag is set. It
-- contains the defining identifier of an object that must be
-- passed to the Cancel_Task_Entry_Call or Cancel_Protected_Entry_Call
-- call in the cleanup handler added to the block by
-- Exp_Ch7.Expand_Cleanup_Actions. This parameter is a Boolean
-- object for task entry calls and a Communications_Block object
-- in the case of protected entry calls. In both cases the objects
-- are declared in outer scopes to this block.
-- Entry_Component (Node11)
-- Present in formal parameters (in, in out and out parameters). Used
-- only for formals of entries. References the corresponding component
-- of the entry parameter record for the entry.
-- Entry_Formal (Node16)
-- Present in components of the record built to correspond to entry
-- parameters. This field points from the component to the formal. It
-- is the back pointer corresponding to Entry_Component.
-- Entry_Index_Constant (Node18)
-- Present in an entry index parameter. This is an identifier that
-- eventually becomes the name of a constant representing the index
-- of the entry family member whose entry body is being executed. Used
-- to expand references to the entry index specification identifier.
-- Entry_Index_Type (synthesized)
-- Applies to an entry family. Denotes Etype of the subtype indication
-- in the entry declaration. Used to resolve the index expression in an
-- accept statement for a member of the family, and in the prefix of
-- 'COUNT when it applies to a family member.
-- Entry_Parameters_Type (Node15)
-- Present in entries. Points to the access-to-record type that is
-- constructed by the expander to hold a reference to the parameter
-- values. This reference is manipulated (as an address) by the
-- tasking runtime. The designated record represents a packaging
-- up of the entry parameters (see Exp_Ch9.Expand_N_Entry_Declaration
-- for further details). Entry_Parameters_Type is Empty if the entry
-- has no parameters.
-- Enumeration_Pos (Uint11)
-- Present in enumeration literals. Contains the position number
-- corresponding to the value of the enumeration literal.
-- Enumeration_Rep (Uint12)
-- Present in enumeration literals. Contains the representation that
-- corresponds to the value of the enumeration literal. Note that
-- this is normally the same as Enumeration_Pos except in the presence
-- of representation clauses, where Pos will still represent the
-- position of the literal within the type and Rep will have be the
-- value given in the representation clause.
-- Enumeration_Rep_Expr (Node22)
-- Present in enumeration literals. Points to the expression in an
-- associated enumeration rep clause that provides the representation
-- value for this literal. Empty if no enumeration rep clause for this
-- literal (or if rep clause does not have an entry for this literal,
-- an error situation). This is also used to catch duplicate entries
-- for the same literal.
-- Enum_Pos_To_Rep (Node23)
-- Present in enumeration types (but not enumeration subtypes). Set to
-- Empty unless the enumeration type has a non-standard representation
-- (i.e. at least one literal has a representation value different from
-- its pos value). In this case, Enum_Pos_To_Rep is the entity for an
-- array constructed when the type is frozen that maps Pos values to
-- corresponding Rep values. The index type of this array is Natural,
-- and the component type is a suitable integer type that holds the
-- full range of representation values.
-- Equivalent_Type (Node18)
-- Present in class wide types and subtypes, access to protected
-- subprogram types, and in exception_types. For a classwide type, it
-- is always Empty. For a class wide subtype, it points to an entity
-- created by the expander which gives Gigi an easily understandable
-- equivalent of the class subtype with a known size (given by an
-- initial value). See Exp_Util.Expand_Class_Wide_Subtype for further
-- details. For E_exception_type, this points to the record containing
-- the data necessary to represent exceptions (for further details, see
-- System.Standard_Library. For access_to_protected subprograms, it
-- denotes a record that holds pointers to the operation and to the
-- protected object. For remote Access_To_Subprogram types, it denotes
-- the record that is the fat pointer representation of an RAST.
-- Esize (Uint12)
-- Present in all types and subtypes, an also for components, constants,
-- and variables. Contains the Object_Size of the type or of the object.
-- A value of zero indicates that the value is not yet known.
--
-- For the case of components where a component clause is present, the
-- value is the value from the component clause, which must be non-
-- negative (but may be zero, which is acceptable for the case of
-- a type with only one possible value). It is also possible for Esize
-- of a component to be set without a component clause present, which
-- means that the component size is specified, but not the position.
-- See also RM_Size and the section on "Handling of Type'Size Values".
-- During gigi processing, the value is back annotated for all zero
-- values, so that after the call to gigi, the value is properly set.
-- Etype (Node5)
-- Present in all entities. Represents the type of the entity, which
-- is itself another entity. For a type entity, points to the parent
-- type for a derived type, or if the type is not derived, points to
-- itself. For a subtype entity, Etype points to the base type.
-- Exception_Code (Uint22)
-- Present in exception entitites. Set to zero unless either an
-- Import_Exception or Export_Exception pragma applies to the
-- pragma and specifies a Code value. See description of these
-- pragmas for details. Note that this field is relevant only if
-- Is_VMS_Exception is set.
-- Extra_Formal (Node15)
-- Present in formal parameters in the non-generic case. Certain
-- parameters require extra implicit information to be passed
-- (e.g. the flag indicating if an unconstrained variant record
-- argument is constrained, and the accessibility level for
-- access parameters. See description of Extra_Constrained,
-- Extra_Accessibility fields for further details. Extra formal
-- parameters are constructed to represent these values, and
-- chained to the end of the list of formals using the
-- Extra_Formal field (i.e. the Extra_Formal field of the last
-- "real" formal points to the first extra formal, and the
-- Extra_Formal field of each extra formal points to the next
-- one, with Empty indicating the end of the list of extra
-- formals.
-- Extra_Accessibility (Node13)
-- Present in formal parameters in the non-generic case if
-- expansion is active. Normally Empty, but if a parameter is
-- one for which a dynamic accessibility check is required, then
-- an extra formal of type Natural is created (see description
-- of field Extra_Formal), and the Extra_Accessibility field of
-- the formal parameter points to the entity for this extra
-- formal. Also present in variables when compiling receiving
-- stubs. In this case, a non Empty value means that this
-- variable's accessibility depth has been transmitted by the
-- caller and must be retrieved through the entity designed by
-- this field instead of being computed.
-- Extra_Constrained (Node23)
-- Present in formal parameters in the non-generic case if
-- expansion is active. Normally Empty, but if a parameter is
-- one for which a dynamic indication of its constrained status
-- is required, then an extra formal of type Boolean is created
-- (see description of field Extra_Formal), and the
-- Extra_Constrained field of the formal parameter points to the
-- entity for this extra formal. Also present in variables when
-- compiling receiving stubs. In this case, a non empty value
-- means that this variable's constrained status has been
-- transmitted by the caller and must be retrieved through the
-- entity designed by this field instead of being computed.
-- Finalization_Chain_Entity (Node19)
-- Present in scopes which can have finalizable entities (blocks,
-- functions, procedures, tasks, entries). When this field is empty it
-- means that there are no finalization actions to perform on exit of the
-- scope. When this field contains 'Error', it means that no
-- finalization actions should happen at this level and the
-- finalization chain of a parent scope shall be used (??? this is
-- an improper use of 'Error' and should be changed). otherwise it
-- contains an entity of type Finalizable_Ptr that is the head of the
-- list of objects to finalize on exit. See "Finalization Management"
-- section in exp_ch7.adb for more details.
-- Finalize_Storage_Only (Flag158) [base type only]
-- Present in all types. Set on direct controlled types to which a
-- valid Finalize_Storage_Only pragma applies. This flag is also set on
-- composite types when they have at least one controlled component and
-- all their controlled components are Finalize_Storage_Only. It is also
-- inherited by type derivation except for direct controlled types where
-- the Finalize_Storage_Only pragma is required at each level of
-- derivation.
-- First_Component (synthesized)
-- Applies to record types. Returns the first component by following
-- the chain of declared entities for the record until a component
-- is found (one with an Ekind of E_Component). The discriminants are
-- skipped. If the record is null, then Empty is returned.
-- First_Discriminant (synthesized)
-- Applies to types with discriminants. The discriminants are the
-- first entities declared in the type, so normally this is equivalent
-- to First_Entity. The exception arises for tagged types, where the
-- tag itself is prepended to the front of the entity chain, so the
-- First_Discriminant function steps past the tag if it is present.
-- First_Girder_Discriminant (synthesized)
-- Applies to types with discriminants. For tagged types, and untagged
-- types which are root types or derived types but which do not rename
-- discriminants in their root type, this is the same as
-- First_Discriminant.
--
-- For derived non-tagged types that rename discriminants in the root
-- type this is the first of the discriminants that occurr in the
-- root type. To be precise, in this case girder discriminants are
-- entities attached to the entity chain of the derived type which
-- are a copy of the discriminants of the root type. Furthermore their
-- Is_Completely_Hidden flag is set.
--
-- For derived untagged types, girder discriminants are the real
-- discriminants from Gigi's standpoint, ie those that will be stored in
-- actual objects of the type.
-- First_Entity (Node17)
-- Present in all entities which act as scopes to which a list of
-- associated entities is attached (blocks, class subtypes and types,
-- entries, functions, loops, packages, procedures, protected objects,
-- record types and subtypes, private types, task types and subtypes).
-- Points to a list of associated entities using the Next_Entity field
-- as a chain pointer with Empty marking the end of the list.
-- First_Formal (synthesized)
-- Applies to subprograms and subprogram types, and also in entries
-- and entry families. Returns first formal of the subprogram or entry.
-- The formals are the first entities declared in a subprogram or in
-- a subprogram type (the designated type of an Access_To_Subprogram
-- definition) or in an entry.
-- First_Index (Node17)
-- Present in array types and subtypes and in string types and subtypes.
-- By introducing implicit subtypes for the index constraints, we have
-- the same structure for constrained and unconstrained arrays, subtype
-- marks and discrete ranges are both represented by a subtype. This
-- function returns the tree node corresponding to an occurrence of the
-- first index (NOT the entity for the type). Subsequent indexes are
-- obtained using Next_Index. Note that this field is present for the
-- case of string literal subtypes, but is always Empty.
-- First_Literal (Node17)
-- Present in all enumeration types, including character and boolean
-- types. This field points to the first enumeration literal entity
-- for the type (i.e. it is set to First (Literals (N)) where N is
-- the enumeration type definition node. A special case occurs with
-- standard character and wide character types, where this field is
-- Empty, since there are no enumeration literal lists in these cases.
-- First_Optional_Parameter (Node14)
-- Present in (non-generic) function and procedure entities. Set to a
-- non-null value only if a pragma Import_Function, Import_Procedure
-- or Import_Valued_Procedure specifies a First_Optional_Parameter
-- argument, in which case this field points to the parameter entity
-- corresponding to the specified parameter.
-- First_Private_Entity (Node16)
-- Present in all entities containing private parts (packages,
-- protected types and subtypes, task types and subtypes). The
-- entities on the entity chain are in order of declaration, so the
-- entries for private entities are at the end of the chain. This
-- field points to the first entity for the private part. It is
-- Empty if there are no entities declared in the private part or
-- if there is no private part.
-- First_Rep_Item (Node6)
-- Present in all entities. If non-empty, points to a linked list of
-- representation pragmas nodes and representation clause nodes that
-- apply to the entity, linked using Next_Rep_Item, with Empty marking
-- the end of the list. In the case of derived types and subtypes, the
-- new entity inherits the chain at the point of declaration. This
-- means that it is possible to have multiple instances of the same
-- kind of rep item on the chain, in which case it is the first one
-- that applies to the entity.
--
-- For most representation items, the representation information is
-- reflected in other fields and flags in the entity. For example if
-- a record representation clause is present, the component entities
-- reflect the specified information. However, there are some items
-- that are only reflected in the chain. These include:
--
-- Alignment attribute definition clause
-- Machine_Attribute pragma
-- Link_Alias pragma
-- Link-Section pragma
-- Weak_External pragma
--
-- If any of these items are present, then the flag Has_Gigi_Rep_Item
-- is set, indicating that Gigi should search the chain.
--
-- Other representation items are included in the chain so that error
-- messages can easily locate the relevant nodes for posting errors.
-- Note in particular that size clauses are present only for this
-- purpose, and should only be accessed if Has_Size_Clause is set.
-- First_Subtype (synthesized)
-- Applies to all types and subtypes. For types, yields the first
-- subtype of the type. For subtypes, yields the first subtype of
-- the base type of the subtype.
-- Freeze_Node (Node7)
-- Present in all entities. If there is an associated freeze node for
-- the entity, this field references this freeze node. If no freeze
-- node is associated with the entity, then this field is Empty. See
-- package Freeze for further details.
-- From_With_Type (Flag159)
-- Present in package and type entities. Indicates that the entity
-- appears in a With_Type clause in the context of some other unit,
-- either as the prefix (which must be a package), or as a type name.
-- The package can only be used to retrieve such a type, and the type
-- can be used only in component declarations and access definitions.
-- The With_Type clause is used to construct mutually recursive
-- types, i.e. record types (Java classes) that hold pointers to each
-- other. If such a type is an access type, it has no explicit freeze
-- node, so that the back-end does not attempt to elaborate it.
-- Full_View (Node11)
-- Present in all type and subtype entities and in deferred constants.
-- References the entity for the corresponding full type declaration.
-- For all types other than private and incomplete types, this field
-- always contains Empty. See also Underlying_Type.
-- Function_Returns_With_DSP (Flag169)
-- Present in all subprogram entities, and type entities for access
-- to subprogram values. Set True if the function (or referenced
-- function in the case of an access value) returns with using the
-- DSP (depressed stack pointer) approach. This can only be set
-- True if Targparm.Functions_Return_By_DSP_On_Target is True and
-- the function returns a value of a type whose size is not known
-- at compile time.
-- Generic_Renamings (Elist23)
-- Present in package and subprogram instances. Holds mapping that
-- associates generic parameters with the corresponding instances, in
-- those cases where the instance is an entity.
-- Girder_Constraint (Elist23)
-- Present in entities that can have discriminants (concurrent types
-- subtypes, record types and subtypes, private types and subtypes,
-- limited private types and subtypes and incomplete types). Points
-- to an element list containing the expressions for each of the
-- girder discriminants for the record (sub)type.
-- Handler_Records (List10)
-- Present in subprogram and package entities. Points to a list of
-- identifiers referencing the handler record entities for the
-- corresponding unit.
-- Has_Aliased_Components (Flag135) [implementation base type only]
-- Present in array type entities. Indicates that the component type
-- of the array is aliased.
-- Has_Alignment_Clause (Flag46)
-- Present in all type entities and objects. Indicates if an alignment
-- clause has been given for the entity. If set, then Alignment_Clause
-- returns the N_Attribute_Definition node for the alignment attribute
-- definition clause. Note that it is possible for this flag to be False
-- even when Alignment_Clause returns non_Empty (this happens in the case
-- of derived type declarations).
-- Has_All_Calls_Remote (Flag79)
-- Present in all library unit entities. Set true if the library unit
-- has an All_Calls_Remote pragma. Note that such entities must also
-- be RCI entities, so the flag Is_Remote_Call_Interface will always
-- be set if this flag is set.
-- Has_Atomic_Components (Flag86) [implementation base type only]
-- Present in all types and objects. Set only for an array type or
-- an array object if a valid pragma Atomic_Components applies to the
-- type or object. Note that in the case of an object, this flag is
-- only set on the object if there was an explicit pragma for the
-- object. In other words, the proper test for whether an object has
-- atomic components is to see if either the object or its base type
-- has this flag set. Note that in the case of a type, the pragma will
-- be chained to the rep item chain of the first subtype in the usual
-- manner.
-- Has_Attach_Handler (synthesized)
-- Applies to record types that are constructed by the expander to
-- represent protected types. Returns True if there is at least one
-- Attach_Handler pragma in the corresponding specification.
-- Has_Biased_Representation (Flag139)
-- Present in discrete types (where it applies to the type'size value),
-- and to objects (both stand-alone and components), where it applies to
-- the size of the object from a size or record component clause. In
-- all cases it indicates that the size in question is smaller than
-- would normally be required, but that the size requirement can be
-- satisfied by using a biased representation, in which stored values
-- have the low bound (Expr_Value (Type_Low_Bound (T)) subtracted to
-- reduce the required size. For example, a type with a range of 1..2
-- takes one bit, using 0 to represent 1 and 1 to represent 2.
--
-- Note that in the object and component cases, the flag is only set
-- if the type is unbiased, but the object specifies a smaller size
-- than the size of the type, forcing biased representation for the
-- object, but the subtype is still an unbiased type.
-- Has_Completion (Flag26)
-- Present in all entities that require a completion (functions,
-- procedures, private types, limited private types, incomplete types,
-- and packages that require a body). Set if the completion has been
-- encountered and analyzed.
-- Has_Completion_In_Body (Flag71)
-- Present in "Taft amendment types" that is to say incomplete types
-- whose full declaration appears in the package body.
-- Has_Complex_Representation (Flag140) [implementation base type only]
-- Present in all type entities. Set only for a record base type to
-- which a valid pragma Complex_Representation applies.
-- Has_Component_Size_Clause (Flag68) [implementation base type only]
-- Present in all type entities. Set if a component size clause is
-- present for the given type. Note that this flag can be False even
-- if Component_Size is non-zero (happens in the case of derived types).
-- Has_Controlling_Result (Flag98)
-- Present in E_Function entities. True if The function is a primitive
-- function of a tagged type which can dispatch on result
-- Has_Controlled_Component (Flag43) [base type only]
-- Present in composite type entities. Indicates that the type has a
-- component that either is a controlled type, or itself contains a
-- controlled component (i.e. either Has_Controlled_Component or
-- Is_Controlled is set for at least one component).
-- Has_Convention_Pragma (Flag119)
-- Present in an entity for which a Convention, Import, or Export
-- pragma has been given. Used to prevent more than one such pragma
-- appearing for a given entity (RM B.1(45)).
-- Has_Delayed_Freeze (Flag18)
-- Present in all entities. Set to indicate that an explicit freeze
-- node must be generated for the entity at its freezing point. See
-- separate section ("Delayed Freezing and Elaboration") for details.
-- Has_Discriminants (Flag5)
-- Present in all types and subtypes. For types that are allowed to have
-- discriminants (record types and subtypes, task types and subtypes,
-- protected types and subtypes, private types, limited private types,
-- and incomplete types), indicates if the corresponding type or subtype
-- has a known discriminant part. Always false for all other types.
-- Has_Entries (synthesized)
-- Applies to concurrent types. True if any entries are declared
-- within the task or protected definition for the type.
-- Has_Enumeration_Rep_Clause (Flag66)
-- Present in enumeration types. Set if an enumeration representation
-- clause has been given for this enumeration type. Used to prevent more
-- than one enumeration representation clause for a given type. Note
-- that this does not imply a representation with holes, since the rep
-- clause may merely confirm the default 0..N representation.
-- Has_External_Tag_Rep_Clause (Flag110)
-- Present in tagged types. Set if an external_tag rep. clause has been
-- given for this type. Use to avoid the generation of the default
-- external_tag.
-- Has_Exit (Flag47)
-- Present in loop entities. Set if the loop contains an exit statement.
-- Has_Foreign_Convention (synthesized)
-- Applies to all entities. Determines if the Convention for the
-- entity is a foreign convention (i.e. is other than Convention_Ada,
-- Convention_Intrinsic, Convention_Entry or Convention_Protected).
-- Has_Forward_Instantiation (Flag175)
-- Present in package entities. Set true for packages that contain
-- instantiations of local generic entities, before the corresponding
-- generic body has been seen. If a package has a forward instantiation,
-- we cannot inline subprograms appearing in the same package because
-- the placement requirements of the instance will conflict with the
-- linear elaboration of front-end inlining.
-- Has_Fully_Qualified_Name (Flag173)
-- Present in all entities. Set True if the name in the Chars field
-- has been replaced by the fully qualified name, as used for debug
-- output. See Exp_Dbug for a full description of the use of this
-- flag and also the related flag Has_Qualified_Name.
-- Has_Gigi_Rep_Item (Flag82)
-- This flag is set if the rep item chain (referenced by First_Rep_Item
-- and linked through the Next_Rep_Item chain contains a representation
-- item that needs to be specially processed by Gigi, i.e. one of the
-- following items:
--
-- Machine_Attribute pragma
-- Linker_Alias pragma
-- Linker_Section pragma
-- Weak_External pragma
--
-- If this flag is set, then Gigi should scan the rep item chain to
-- process any of these items that appear. At least one such item will
-- be present.
-- Has_Homonym (Flag56)
-- Present in all entities. Set if an entity has a homonym in the same
-- scope. Used by Gigi to generate unique names for such entities.
-- Has_Interrupt_Handler (synthesized)
-- Applies to all protected types entities. Set if the protected type
-- definition contains at least one procedure to which a pragma
-- Interrupt_Handler applies.
-- Has_Machine_Radix_Clause (Flag83)
-- Present in decimal types and subtypes, set if a Machine_Radix
-- representation clause is present. This flag is used to detect
-- the error of multiple machine radix clauses for a single type.
-- Has_Master_Entity (Flag21)
-- Present in entities that can appear in the scope stack (see spec
-- of Sem). It is set if a task master entity (_master) has been
-- declared and initialized in the corresponding scope.
-- Has_Missing_Return (Flag142)
-- Present in functions and generic functions. Set if there is one or
-- more missing return statements in the function. This is used to
-- control wrapping of the body in Exp_Ch6 to ensure that the program
-- error exeption is correctly raised in this case at runtime.
-- Has_Nested_Block_With_Handler (Flag101)
-- Present in scope entities. Set if there is a nested block within the
-- scope that has an exception handler and the two scopes are in the
-- same procedure. This is used by the backend for controlling certain
-- optimizations to ensure that they are consistent with exceptions.
-- See documentation in Gigi for further details.
-- Has_Non_Standard_Rep (Flag75) [implementation base type only]
-- Present in all type entities. Set when some representation clause
-- or pragma causes the representation of the item to be significantly
-- modified. In this category are changes of small or radix for a
-- fixed-point type, change of component size for an array, and record
-- or enumeration representation clauses, as well as packed pragmas.
-- All other representation clauses (e.g. Size and Alignment clauses)
-- are not considered to be significant since they do not affect
-- stored bit patterns.
-- Has_Object_Size_Clause (Flag172)
-- Present in entities for types and subtypes. Set if an Object_Size
-- clause has been processed for the type Used to prevent multiple
-- Object_Size clauses for a given entity.
-- Has_Per_Object_Constraint (Flag154)
-- Present in E_Component entities, true if the subtype of the
-- component has a per object constraint, i.e. an actual discriminant
-- value of the form T'Access, where T is the enclosing type.
-- Has_Pragma_Controlled (Flag27) [implementation base type only]
-- Present in access type entities. It is set if a pragma Controlled
-- applies to the access type.
-- Has_Pragma_Elaborate_Body (Flag150)
-- Present in all entities. Set in compilation unit entities if a
-- pragma Elaborate_Body applies to the compilation unit.
-- Has_Pragma_Inline (Flag157)
-- Present in all entities. Set for functions and procedures for which
-- a pragma Inline or Inline_Always applies to the subprogram. Note
-- subprogram. Note that this flag can be set even if Is_Inlined is
-- not set. This happens for pragma Inline (if Inline_Active is False)
-- In other words, the flag Has_Pragma_Inline represents the formal
-- semantic status, and is used for checking semantic correctness.
-- The flag Is_Inlined indicates whether inlining is actually active
-- for the entity.
-- Has_Pragma_Pack (Flag121) [implementation base type only]
-- Present in all entities. It indicates that a valid pragma Pack was
-- was given for the type. Note that this flag is not inherited by a
-- derived type. See also the Is_Packed flag.
-- Has_Pragma_Pure_Function (Flag179)
-- Present in subprogram entities. It indicates that a valid pragma
-- Pure_Function was given for the entity. In some cases, we need to
-- know that Is_Pure was explicitly set using this pragma.
-- Has_Primitive_Operations (Flag120) [base type only]
-- Present in all type entities. Set if at least one primitive operation
-- is defined on the type. This flag is not yet properly set ???
-- Has_Private_Ancestor (synthesized)
-- Applies to all type and subtype entities. Returns True if at least
-- one ancestor is private, and otherwise False if there are no private
-- ancestors.
-- Has_Private_Declaration (Flag155)
-- Present in all entities. Returns True if it is the defining entity
-- of a private type declaration or its corresponding full declaration.
-- This flag is thus preserved when the full and the partial views are
-- exchanged, to indicate if a full type declaration is a completion.
-- Used for semantic checks in E.4 (18), and elsewhere.
-- Has_Qualified_Name (Flag161)
-- Present in all entities. Set True if the name in the Chars field
-- has been replaced by its qualified name, as used for debug output.
-- See Exp_Dbug for a full description of qualification requirements.
-- For some entities, the name is the fully qualified name, but there
-- are exceptions. In particular, for local variables in procedures,
-- we do not include the procedure itself or higher scopes. See also
-- the flag Has_Fully_Qualified_Name, which is set if the name does
-- indeed include the fully qualified name.
-- Has_Record_Rep_Clause (Flag65)
-- Present in record types. Set if a record representation clause has
-- been given for this record type. Used to prevent more than one such
-- clause for a given record type. Note that this is initially cleared
-- for a derived type, even though the representation is inherited. See
-- also the flag Has_Specified_Layout.
-- Has_Recursive_Call (Flag143)
-- Present in procedures. Set if a direct parameterless recursive call
-- is detected while analyzing the body. Used to activate some error
-- checks for infinite recursion.
-- Has_Size_Clause (Flag29)
-- Present in entities for types and objects. Set if a size clause is
-- present for the entity. Used to prevent multiple Size clauses for a
-- given entity. Note that it is always initially cleared for a derived
-- type, even though the Size for such a type is inherited from a Size
-- clause given for the parent type.
-- Has_Small_Clause (Flag67)
-- Present in ordinary fixed point types (but not subtypes). Indicates
-- that a small clause has been given for the entity. Used to prevent
-- multiple Small clauses for a given entity. Note that it is always
-- initially cleared for a derived type, even though the Small for such
-- a type is inherited from a Small clause given for the parent type.
-- Has_Specified_Layout (Flag100)
-- Present in all type entities. Set for a record type or subtype if
-- the record layout has been specified by a record representation
-- clause. Note that this differs from the flag Has_Record_Rep_Clause
-- in that it is inherited by a derived type. Has_Record_Rep_Clause is
-- used to indicate that the type is mentioned explicitly in a record
-- representation clause, and thus is not inherited by a derived type.
-- This flag is always False for non-record types.
-- Has_Storage_Size_Clause (Flag23) [implementation base type only]
-- Present in task types and access types. It is set if a Storage_Size
-- clause is present for the type. Used to prevent multiple clauses for
-- one type. Note that this flag is initially cleared for a derived type
-- even though the Storage_Size for such a type is inherited from a
-- Storage_Size clause given for the parent type. Note that in the case
-- of access types, this flag is present only in the root type, since a
-- storage size clause cannot be given to a derived type.
-- Has_Subprogram_Descriptor (Flag93)
-- This flag is set on entities for which zero-cost exception subprogram
-- descriptors can be generated (subprograms and library level package
-- declarations and bodies). It indicates that a subprogram descriptor
-- has been generated, and is used to suppress generation of multiple
-- descriptors (e.g. when instantiating generic bodies).
-- Has_Task (Flag30) [base type only]
-- Present in all type entities. Set on task types themselves, and also
-- (recursively) on any composite type which has a component for which
-- Has_Task is set. The meaning is that an allocator of such an object
-- must create the required tasks. Note that the flag is not set on
-- access types, even if they designate an object that Has_Task.
-- Has_Unchecked_Union (Flag123) [base type only]
-- Present in all type entities. Set on unchecked unions themselves
-- and (recursively) on any composite type which has a component for
-- which Has_Unchecked_Union is set. The meaning is that a comparison
-- operation for the type is not permitted. Note that the flag is not
-- set on access types, even if they designate an object that has
-- the flag Has_Unchecked_Union set.
-- Has_Unknown_Discriminants (Flag72)
-- Present in all type entities. Types can have unknown discriminants
-- either from their declaration or through type derivation. The use
-- of this flag exactly meets the spec in RM 3.7(26). Note that all
-- class-wide types are considered to have unknown discriminants.
-- Has_Volatile_Components (Flag87) [implementation base type only]
-- Present in all types and objects. Set only for an array type or
-- array object if a valid pragma Volatile_Components or a valid
-- pragma Atomic_Components applies to the type or object. Note that
-- in the case of an object, this flag is only set on the object if
-- there was an explicit pragma for the object. In other words, the
-- proper test for whether an object has volatile components is to
-- see if either the object or its base type has this flag set. Note
-- that in the case of a type the pragma will be chained to the rep
-- item chain of the first subtype in the usual manner.
-- Hiding_Loop_Variable (Node8)
-- Present in variables. Set only if a variable of a discrete type is
-- hidden by a loop variable in the same local scope, in which case
-- the Hiding_Loop_Variable field of the hidden variable points to
-- the E_Loop_Variable entity doing the hiding. Used in processing
-- warning messages if the hidden variable turns out to be unused
-- or is referenced without being set.
-- Homonym (Node4)
-- Present in all entities. Link for list of entities that have the
-- same source name and that are declared in the same or enclosing
-- scopes. Homonyms in the same scope are overloaded. Used for name
-- resolution and for the generation of debugging information.
-- Implementation_Base_Type (synthesized)
-- Applies to all types. Similar to Base_Type, but never returns a
-- private type when applied to a non-private type. Instead in this
-- case, it always returns the Representation_Type of the base type
-- in this case, so that we still have a concrete type. Note: it is
-- allowed to apply Implementation_Base_Type to other than a type,
-- in which case it simply returns the entity unchanged.
-- In_Package_Body (Flag48)
-- Set on the entity that denotes the package (the defining occurrence
-- of the package declaration) while analyzing and expanding the package
-- body. Reset on completion of analysis/expansion.
-- In_Private_Part (Flag45)
-- Present in package entities. Flag is set to indicate that the
-- private part is being analyzed. The flag is reset at the end of the
-- package declaration.
-- Inner_Instances (Elist23)
-- Present in generic units. Contains element list of units that are
-- instantiated within the given generic. Used to diagnose circular
-- instantiations.
-- Interface_Name (Node21)
-- Present in exceptions, functions, procedures, variables, constants,
-- and packages. Set to Empty unless an export, import, or interface
-- name pragma has explicitly specified an external name, in which
-- case it references an N_String_Literal node for the specified
-- exteral name. In the case of exceptions, the field is set by
-- Import_Exception/Export_Exception (which can be used in OpenVMS
-- versions only). Note that if this field is Empty, and Is_Imported
-- or Is_Exported is set, then the default interface name is the name
-- of the entity, cased in a manner that is appropriate to the system
-- in use. Note that Interface_Name is ignored if an address clause
-- is present (since it is meaningless in this case).
--
-- An additional special case usage of this field is in JGNAT for
-- E_Component and E_Discriminant. JGNAT allows these entities to
-- be imported by specifying pragma Import within a component's
-- containing record definition. This supports interfacing to
-- object fields defined within Java classes, and such pragmas
-- are generated by the jvm2ada binding generator tool whenever
-- it processes classes with public object fields. A pragma Import
-- for a component can define the External_Name of the imported
-- Java field (which is generally needed, because Java names are
-- case sensitive).
--
-- In_Use (Flag8)
-- Present in packages and types. Set when analyzing a use clause for
-- the corresponding entity. Reset at end of corresponding declarative
-- part. The flag on a type is also used to determine the visibility of
-- the primitive operators of the type.
-- Is_Abstract (Flag19)
-- Present in all types, and also for functions and procedures. Set
-- for abstract types and abstract subprograms.
-- Is_Access_Constant (Flag69)
-- Present in access types and subtypes. Indicates that the keyword
-- constant was present in the access type definition.
-- Is_Access_Type (synthesized)
-- Applies to all entities, true for access types and subtypes
-- Is_Aliased (Flag15)
-- Present in objects whose declarations carry the keyword aliased,
-- and on record components that have the keyword.
-- Is_Always_Inlined (synthesized)
-- Present in subprograms. True if there is a pragma Inline_Always for
-- the subprogram.
-- Is_AST_Entry (Flag132)
-- Present in entry entities. Set if a valid pragma AST_Entry applies
-- to the entry. This flag can only be set in OpenVMS versions of GNAT.
-- Note: we also allow the flag to appear in entry families, but given
-- the current implementation of the pragma AST_Entry, this flag will
-- always be False in entry families.
-- Is_Atomic (Flag85)
-- Present in all type entities, and also in constants, components and
-- variables. Set if a pragma Atomic or Shared applies to the entity.
-- In the case of private and incomplete types, this flag is set in
-- both the partial view and the full view.
-- Is_Array_Type (synthesized)
-- Applies to all entities, true for array types and subtypes
-- Is_Asynchronous (Flag81)
-- Present in all type entities and in procedure entities. Set
-- if a pragma Asynchronous applies to the entity.
-- Is_Bit_Packed_Array (Flag122)
-- Present in all entities. This flag is set for a packed array
-- type that is bit packed (i.e. the component size is known by the
-- front end and is in the range 1-7, 9-15, or 17-31). Is_Packed is
-- always set if Is_Bit_Packed_Array is set, but it is possible for
-- Is_Packed to be set without Is_Bit_Packed_Array or the case of an
-- array having one or more index types that are enumeration types
-- with non-standard enumeration representations.
-- Is_Boolean_Type (synthesized)
-- Applies to all entities, true for boolean types and subtypes,
-- i.e. Standard.Boolean and all types ultimately derived from it.
-- Is_By_Copy_Type (synthesized)
-- Applies to all type entities. Returns true if the entity is
-- a by copy type (RM 6.2(3)).
-- Is_By_Reference_Type (synthesized)
-- Applies to all type entities. True if the type is required to
-- be passed by reference, as defined in (RM 6.2(4-9)).
-- Is_Called (Flag102)
-- Present in subprograms. Returns true if the subprogram is called
-- in the unit being compiled or in a unit in the context. Used for
-- inlining.
-- Is_Character_Type (Flag63)
-- Present in all entities, true for character types and subtypes,
-- i.e. enumeration types that have at least one character literal.
-- Is_Child_Unit (Flag73)
-- Present in all entities. Set only for defining entities of program
-- units that are child units (but False for subunits).
-- Is_Class_Wide_Type (synthesized)
-- Applies to all entities, true for class wide types and subtypes
-- Is_Compilation_Unit (Flag149)
-- Present in all entities. Set if the entity is a package or subprogram
-- entity for a compilation unit other than a subunit (since we treat
-- subunits as part of the same compilation operation as the ultimate
-- parent, we do not consider them to be separate units for this flag).
-- Is_Completely_Hidden (Flag103)
-- A flag set on an E_Discriminant entity. This flag can be set only
-- for girder discriminants of untagged types. When set, the entity
-- is a girder discriminant of a derived untagged type which is not
-- directly visible in the derived type because the derived type or
-- one of its ancestors have renamed the discriminants in the root
-- type. Note that there are girder discriminants which are not
-- Completely_Hidden (eg the discriminants of a root type).
-- Is_Composite_Type (synthesized)
-- Applies to all entities, true for all composite types and
-- subtypes. Either Is_Composite_Type or Is_Elementary_Type (but
-- not both) is true of any type.
-- Is_Concurrent_Record_Type (Flag20)
-- Present in record types and subtypes. Set if the type was created
-- by the expander to represent a task or protected type. For every
-- concurrent type, such as record type is constructed, and task and
-- protected objects are instances of this record type at runtime
-- (Gigi will replace declarations of the concurrent type using the
-- declarations of the corresponding record type). See package Exp_Ch9
-- for further details.
-- Is_Concurrent_Type (synthesized)
-- Applies to all entities, true for task types and subtypes and
-- for protected types and subtypes.
-- Is_Constrained (Flag12)
-- Present in types or subtypes which may have index, discriminant
-- or range constraint (i.e. array types and subtypes, record types
-- and subtypes, string types and subtypes, and all numeric types).
-- Set if the type or subtype is constrained.
-- Is_Constr_Subt_For_U_Nominal (Flag80)
-- Present in all types and subtypes. Set true only for the constructed
-- subtype of an object whose nominal subtype is unconstrained. Note
-- that the constructed subtype itself will be constrained.
-- Is_Constr_Subt_For_UN_Aliased (Flag141)
-- This flag can only be set if Is_Constr_Subt_For_U_Nominal is set. It
-- indicates that in addition the object concerned is aliased. This flag
-- is used by Gigi to determine whether a template must be constructed.
-- Is_Constructor (Flag76)
-- Present in function and procedure entities. Set if a pragma
-- CPP_Constructor applies to the subprogram.
-- Is_Controlled (Flag42) [base type only]
-- Present in all type entities. Indicates that the type is controlled,
-- i.e. is either a descendant of Ada.Finalization.Controlled or of
-- Ada.Finalization.Limited_Controlled.
-- Is_Controlling_Formal (Flag97)
-- Present in all Formal_Kind entity. Marks the controlling parameters
-- of dispatching operations.
-- Is_CPP_Class (Flag74)
-- Present in all type entities, set only for tagged and untagged
-- record types to which the pragma CPP_Class has been applied.
-- Is_Decimal_Fixed_Point_Type (synthesized)
-- Applies to all type entities, true for decimal fixed point
-- types and subtypes.
-- Is_Derived_Type (synthesized)
-- Applies to all type entities. Determine if given entity is a
-- derived type
-- Is_Destructor (Flag77)
-- Present in function and procedure entities. Set if a pragma
-- CPP_Destructor applies to the subprogram.
-- Is_Discrete_Type (synthesized)
-- Applies to all entities, true for all discrete types and subtypes
-- Is_Discrete__Or_Fixed_Point_Type (synthesized)
-- Applies to all entities, true for all discrete types and subtypes
-- and all fixed-point types and subtypes.
-- Is_Discrim_SO_Function (Flag176)
-- Present in all entities, set only in E_Function entities that Layout
-- creates to compute discriminant-dependent dynamic size/offset values.
-- Is_Dispatching_Operation (Flag6)
-- Present in all entities. Set true for procedures, functions,
-- generic procedures and generic functions if the corresponding
-- operation is dispatching.
-- Is_Dynamic_Scope (synthesized)
-- Applies to all Entities. Returns True if the entity is a dynamic
-- scope (i.e. a block, a subprogram a task_type or an entry).
-- Is_Elementary_Type (synthesized)
-- Applies to all entities, true for all elementary types and
-- subtypes. Either Is_Composite_Type or Is_Elementary_Type (but
-- not both) is true of any type.
-- Is_Eliminated (Flag124)
-- Present in type entities, subprogram entities, and object entities.
-- Indicates that the corresponding entity has been eliminated by use
-- of pragma Eliminate.
-- Is_Enumeration_Type (synthesized)
-- Present in all entities, true for enumeration types and subtypes
-- Is_Entry (synthesized)
-- Applies to all entities, True only for entry and entry family
-- entities and False for all other entity kinds.
-- Is_Entry_Formal (Flag52)
-- Present in all entities. Set only for entry formals (which can
-- only be in, in-out or out parameters). This flag is used to speed
-- up the test for the need to replace references in Exp_Ch2.
-- Is_Exported (Flag99)
-- Present in all entities. Set if the entity is exported. For now we
-- only allow the export of constants, exceptions, functions, procedures
-- and variables, but that may well change later on. Exceptions can only
-- be exported in the OpenVMS and Java VM implementations of GNAT.
-- Is_First_Subtype (Flag70)
-- Present in all entities. True for first subtypes (RM 3.2.1(6)),
-- i.e. the entity in the type declaration that introduced the type.
-- This may be the base type itself (e.g. for record declarations and
-- enumeration type declarations), or it may be the first subtype of
-- an anonymous base type (e.g. for integer type declarations or
-- constrained array declarations).
-- Is_Fixed_Point_Type (synthesized)
-- Applies to all entities, true for decimal and ordinary fixed
-- point types and subtypes
-- Is_Floating_Point_Type (synthesized)
-- Applies to all entities, true for float types and subtypes
-- Is_Formal (synthesized)
-- Applies to all entities, true for IN, IN OUT and OUT parameters
-- Is_Formal_Subprogram (Flag111)
-- Defined on all entities, true for generic formal subprograms.
-- Is_For_Access_Subtype (Flag118)
-- Present in E_Private_Subtype and E_Record_Subtype entities.
-- Means the sole purpose of the type is to be designated by an
-- Access_Subtype and hence should not be expanded into components
-- because the type may not have been found or frozen yet.
-- Is_Frozen (Flag4)
-- Present in all type entities. Set if the type has been frozen.
-- Is_Generic_Actual_Type (Flag94)
-- Present in the subtype declaration that renames the generic formal
-- as a subtype of the actual. Guarantees that the subtype is not static
-- within the instance.
-- Is_Generic_Instance (Flag130)
-- Present in all entities. Set to indicate that the entity is an
-- instance of a generic unit.
-- Is_Generic_Type (Flag13)
-- Present in types which are generic formal types. Such types have an
-- Ekind that corresponds to their classification, so the Ekind cannot
-- be used to identify generic types.
-- Is_Generic_Unit (synthesized)
-- Applies to all entities. Yields True for a generic unit (generic
-- package, generic function, generic procedure), and False for all
-- other entities.
-- Is_Hidden (Flag57)
-- Present in all entities. Set true for all entities declared in the
-- private part or body of a package. Also marks generic formals of a
-- formal package declared without a box. For library level entities,
-- this flag is set if the entity is not publicly visible.
-- Is_Hidden_Open_Scope (Flag171)
-- Present in all entities. Set true for a scope that contains the
-- instantiation of a child unit, and whose entities are not visible
-- during analysis of the instance.
-- Is_Immediately_Visible (Flag7)
-- Present in all entities. Set if entity is immediately visible, i.e.
-- is defined in some currently open scope (RM 8.3(4)).
-- Is_Imported (Flag24)
-- Present in all entities. Set if the entity is imported. For now we
-- only allow the import of exceptions, functions, procedures, packages.
-- and variables. Exceptions can only be imported in the OpenVMS and
-- Java VM implementations of GNAT. Packages and types can only be
-- imported in the Java VM implementation.
-- Is_Incomplete_Or_Private_Type (synthesized)
-- Applies to all entities, true for private and incomplete types
-- Is_Indefinite_Subtype (synthesized)
-- Applies to all entities for types and subtypes. Determines if given
-- entity is an unconstrained array type or subtype, a discriminated
-- record type or subtype with no initial discriminant values or a
-- class wide type or subtype.
-- Is_Inlined (Flag11)
-- Present in all entities. Set for functions and procedures which are
-- to be inlined. For subprograms created during expansion, this flag
-- may be set directly by the expander to request inlining. Also set
-- for packages that contain inlined subprograms, whose bodies must be
-- be compiled. Is_Inlined is also set on generic subprograms and is
-- inherited by their instances. It is also set on the body entities
-- of inlined subprograms. See also Has_Pragma_Inline.
-- Is_Instantiated (Flag126)
-- Present in generic packages and generic subprograms. Set if the unit
-- is instantiated from somewhere in the extended main source unit. This
-- flag is used to control warnings about the unit being uninstantiated.
-- Also set in a package that is used as an actual for a generic package
-- formal in an instantiation. Also set on a parent instance, in the
-- instantiation of a child, which is implicitly declared in the parent.
-- Is_Integer_Type (synthesized)
-- Applies to all entities, true for integer types and subtypes
-- Is_Internal (Flag17)
-- Present in all entities. Set to indicate an entity created during
-- semantic processing (e.g. an implicit type). Need more documentation
-- on this one! ???
-- Is_Interrupt_Handler (Flag89)
-- Present in protected procedures. Set if a pragma Interrupt_Handler
-- applies to the procedure (which must be parameterless).
-- Is_Intrinsic_Subprogram (Flag64)
-- Present in functions and procedures. It is set if a valid pragma
-- Interface or Import is present for this subprogram specifying pragma
-- Intrinsic. Valid means that the name and profile of the subprogram
-- match the requirements of one of the recognized intrinsic subprograms
-- (see package Sem_Intr for details). Note: the value of Convention for
-- such an entity will be set to Convention_Intrinsic, but it is the
-- setting of Is_Intrinsic_Subprogram, NOT simply having convention set
-- to intrinsic, which causes intrinsic code to be generated.
-- Is_Itype (Flag91)
-- Present in all entities, set for Itypes. If it is set, then the
-- declaration for the type does not appear explicitly in the tree.
-- Instead gigi will elaborate the type when it is first used.
-- Has_Delayed_Freeze can be set for Itypes, and the meaning is that
-- the first use (the one which causes the type to be defined) will
-- be the freeze node. Note that an important restriction on Itypes
-- is that the first use of such a type (the one that causes it to be
-- defined) must be in the same scope as the type.
-- Is_Known_Valid (Flag170)
-- Present in all entities. Relevant for types (and subtype) and
-- for objects (and enumeration literals) of a discrete type.
--
-- The purpose of this flag is to implement the requirement stated
-- in (RM 13.9.1(9-11)) which require that the use of possibly invalid
-- values may not cause programs to become erroneous. See the function
-- Exp_Util.Expr_Known_Valid for further details. Note that the setting
-- is conservative, in the sense that if the flag is set, it must be
-- right. If the flag is not set, nothing is known about the validity.
--
-- For enumeration literals, the flag is always set, since clearly
-- an enumeration literal represents a valid value. Range checks
-- where necessary will ensure that this valid value is appropriate.
--
-- For objects, the flag indicates the state of knowledge about the
-- current value of the object. This may be modified during expansion,
-- and thus the final value is not relevant to gigi.
--
-- For types and subtypes, the flag is set if all possible bit patterns
-- of length Object_Size (i.e. Esize of the type) represent valid values
-- of the type. In general for such tytpes, all values are valid, the
-- only exception being the case where an object of the type has an
-- explicit size that is greater than Object_Size.
--
-- For non-discrete objects, the setting of the Is_Known_Valid flag is
-- not defined, and is not relevant, since the considerations of the
-- requirement in (RM 13.9.1(9-11)) do not apply.
-- Is_Limited_Composite (Flag106)
-- Present in all entities. True for composite types that have a
-- limited component. Used to enforce the rule that operations on
-- the composite type that depend on the full view of the component
-- do not become visible until the immediate scope of the composite
-- type itself (RM 7.3.1 (5)).
-- Is_Limited_Record (Flag25)
-- Present in all entities. Set to true for record (sub)types if the
-- record is declared to be limited. Note that this flag is not set
-- simply because some components of the record are limited.
-- Is_Limited_Type (synthesized)
-- Applies to all entities. True if entity is a limited type (limited
-- private type, task type, protected type, composite containing a
-- limited component, or a subtype of any of these types).
-- Is_Machine_Code_Subprogram (Flag137)
-- Present in subprogram entities. Set to indicate that the subprogram
-- is a machine code subprogram (i.e. its body includes at least one
-- code statement). Also indicates that all necessary semantic checks
-- as required by RM 13.8 have been performed.
-- Is_Non_Static_Subtype (Flag109)
-- This flag is present in all type and subtype entities. It is set in
-- some (but not all) cases in which a subtype is known to be non-static.
-- Before this flag was added, the computation of whether a subtype was
-- static was entirely synthesized, by looking at the bounds, and the
-- immediate subtype parent. However, this method does not work for some
-- Itypes that have no parent set (and the only way to find the immediate
-- subtype parent is to go through the tree). For now, this flay is set
-- conservatively, i.e. if it is set then for sure the subtype is non-
-- static, but if it is not set, then the type may or may not be static.
-- Thus the test for a static subtype is that this flag is clear AND
-- that the bounds are static AND that the parent subtype (if available
-- to be tested) is static. Eventually we should make sure this flag
-- is always set right, at which point, these comments can be removed,
-- and the tests for static subtypes greatly simplified.
-- Is_Null_Init_Proc (Flag178)
-- Present in procedure entities. Set for generated init_proc procedures
-- (used to initialize composite types), if the code for the procedure
-- is null (i.e. is a return and nothing else). Such null initialization
-- procedures are generated in case some client is compiled using the
-- Initialize_Scalars pragma, generating a call to this null procedure,
-- but there is no need to call such procedures within a compilation
-- unit, and this flag is used to suppress such calls.
-- Is_Numeric_Type (synthesized)
-- Applies to all entities, true for all numeric types and subtypes
-- (integer, fixed, float).
-- Is_Object (synthesized)
-- Applies to all entities, true for entities representing objects,
-- including generic formal parameters.
-- Is_Optional_Parameter (Flag134)
-- Present in parameter entities. Set if the parameter is specified as
-- optional by use of a First_Optional_Parameter argument to one of the
-- extended Import pragmas. Can only be set for OpenVMS versions of GNAT.
-- Is_Ordinary_Fixed_Point_Type (synthesized)
-- Applies to all entities, true for ordinary fixed point types
-- and subtypes
-- Is_Package (synthesized)
-- Applies to all entities. True for packages and generic packages.
-- False for all other entities.
-- Is_Package_Body_Entity (Flag160)
-- Present in all entities. Set for entities defined at the top level
-- of a package body. Used to control externally generated names.
-- Is_Packed (Flag51) [implementation base type only]
-- Present in all type entities. This flag is set only for record and
-- array types which have a packed representation. There are three
-- cases which cause packing:
--
-- 1. Explicit use of pragma Pack for an array of package components
-- 2. Explicit use of pragma Pack to pack a record
-- 4. Setting Component_Size of an array to a bit-packable value
-- 3. Indexing an array with a non-standard enumeration type.
--
-- For records, Is_Packed is always set if Has_Pack_Pragma is set,
-- and can also be set on its own in a derived type which inherited
-- its packed status.
--
-- For arrays, Is_Packed is set if an array is bit packed (i.e. the
-- component size is known at compile time and is 1-7, 9-15 or 17-31),
-- or if the array has one or more index types that are enumeration
-- types with non-standard representations (in GNAT, we store such
-- arrays compactly, using the Pos of the enumeration type value).
--
-- As for the case of records, Is_Packed can be set on its own for a
-- derived type, with the same dual before/after freeze meaning.
-- Is_Packed can also be set as the result of an explicit component
-- size clause that specifies an appropriate component size.
--
-- In the bit packed array case, Is_Bit_Packed_Array will be set in
-- the bit packed case once the array type is frozen.
--
-- Before an array type is frozen, Is_Packed will always be set if
-- Has_Pack_Pragma is set. Before the freeze point, it is not possible
-- to know the component size, since the component type is not frozen
-- until the array type is frozen. Thus Is_Packed for an array type
-- before it is frozen means that packed is required. Then if it turns
-- out that the component size is not suitable for bit packing, the
-- Is_Packed flag gets turned off.
-- Is_Packed_Array_Type (Flag138)
-- Present in all entities. This flag is set on the entity for the type
-- used to implement a packed array (either a modular type, or a subtype
-- of Packed_Bytes{1,2,4} as appropriate). The flag is set if and only
-- if the type appears in the Packed_Array_Type field of some other type
-- entity. It is used by Gigi to activate the special processing for such
-- types (unchecked conversions that would not otherwise be allowed are
-- allowed for such types).
-- Is_Potentially_Use_Visible (Flag9)
-- Present in all entities. Set if entity is potentially use visible,
-- i.e. it is defined in a package that appears in a currently active
-- use clause (RM 8.4(8)). Note that potentially use visible entities
-- are not necessarily use visible (RM 8.4(9-11)).
-- Is_Preelaborated (Flag59)
-- Present in all entities, set in E_Package and E_Generic_Package
-- entities to which a pragma Preelaborate is applied, and also in
-- all entities within such packages. Note that the fact that this
-- flag is set does not necesarily mean that no elaboration code is
-- generated for the package.
-- Is_Private_Composite (Flag107)
-- Present in composite types that have a private component. Used to
-- enforce the rule that operations on the composite type that depend
-- on the fulll view of the component, do not become visible until the
-- immediate scope of the composite type itself (7.3.1 (5)). Both this
-- flag and Is_Limited_Composite are needed.
-- Is_Private_Descendant (Flag53)
-- Present in entities that can represent library units (packages,
-- functions, procedures). Set if the library unit is itself a private
-- child unit, or if it is the descendent of a private child unit.
-- Is_Private_Type (synthesized)
-- Applies to all entities, true for private types and subtypes,
-- as well as for record with private types as subtypes
-- Is_Protected_Type (synthesized)
-- Applies to all entities, true for protected types and subtypes
-- Is_Psected (Flag153)
-- Present in entities for objects, true if a valid Psect_Object
-- pragma applies to the object. Used to detect duplicate pragmas.
-- Is_Public (Flag10)
-- Present in all entities. Set to indicate that an entity defined in
-- one compilation unit can be referenced from other compilation units.
-- If this reference causes a reference in the generated variable, for
-- example in the case of a variable name, then Gigi will generate an
-- appropriate external name for use by the linker.
-- Is_Protected_Private (synthesized)
-- Applies to a record component. Returns true if this component
-- is used to represent a private declaration of a protected type.
-- Is_Protected_Record_Type (synthesized)
-- Applies to all entities, true if Is_Concurrent_Record_Type
-- Corresponding_Concurrent_Type is a protected type.
-- Is_Pure (Flag44)
-- Present in all entities. Set in all entities of a unit to which a
-- pragma Pure is applied, and also set for the entity of the unit
-- itself. In addition, this flag may be set for any other functions
-- or procedures that are known to be side effect free, so in the case
-- of subprograms, the Is_Pure flag may be used by the optimizer to
-- imply that it can assume freedom from side effects (other than those
-- resulting from assignment to out parameters, or to objects designated
-- by access parameters).
-- Is_Real_Type (synthesized)
-- Applies to all entities, true for real types and subtypes
-- Is_Record_Type (synthesized)
-- Applies to all entities, true for record types and subtypes,
-- includes class-wide types and subtypes (which are also records)
-- Is_Remote_Call_Interface (Flag62)
-- Present in all entities, set in E_Package and E_Generic_Package
-- entities to which a pragma Remote_Call_Interace is applied, and
-- also in all entities within such packages.
-- Is_Remote_Types (Flag61)
-- Present in all entities, set in E_Package and E_Generic_Package
-- entities to which a pragma Remote_Types is applied, and also in
-- all entities within such packages.
-- Is_Renaming_Of_Object (Flag112)
-- Present in all entities, set only for a variable or constant for
-- which the Renamed_Object field is non-empty and for which the
-- renaming is handled by the front end, by macro substitution of
-- a copy of the (evaluated) name tree whereever the variable is used.
-- Is_Return_By_Reference_Type (synthesized)
-- Applies to all type entities. True if the type is required to
-- be returned by reference, as defined in 6.5(11-16).
-- Is_Scalar_Type (synthesized)
-- Applies to all entities, true for scalar types and subtypes
-- Is_Shared_Passive (Flag60)
-- Present in all entities, set in E_Package and E_Generic_Package
-- entities to which a pragma Shared_Passive is applied, and also in
-- all entities within such packages.
-- Is_Statically_Allocated (Flag28)
-- Present in all entities. This can only be set True for exception,
-- variable, constant, and type/subtype entities. If the flag is set,
-- then the variable or constant must be allocated statically rather
-- than on the local stack frame. For exceptions, the meaning is that
-- the exception data should be allocated statically (and indeed this
-- flag is always set for exceptions, since exceptions do not have
-- local scope). For a type, the meaning is that the type must be
-- elaborated at the global level rather than locally. No type marked
-- with this flag may depend on a local variable, or on any other type
-- which does not also have this flag set to True. For a variable or
-- or constant, if the flag is set, then the type of the object must
-- either be declared at the library level, or it must also have the
-- flag set (since to allocate the oject statically, its type must
-- also be elaborated globally).
-- Is_Subprogram (synthesized)
-- Applies to all entities, true for bodies of functions, procedures
-- and operators.
-- Is_String_Type (synthesized)
-- Applies to all type entities. Determines if the given type is a
-- string type, i.e. it is directly a string type or string subtype,
-- or a string slice type, or an array type with one dimension and a
-- component type that is a character type.
-- Is_Tag (Flag78)
-- Present in E_Component. For regular tagged type this flag is set on
-- the tag component (whose name is Name_uTag) and for CPP_Class tagged
-- types, this flag marks the pointer to the main vtable (i.e. the one
-- to be extended by derivation)
-- Is_Tagged_Type (Flag55)
-- Present in all entities, true for an entity for a tagged type.
-- Is_Task_Record_Type (synthesized)
-- Applies to all entities, true if Is_Concurrent_Record_Type
-- Corresponding_Concurrent_Type is a task type.
-- Is_Task_Type (synthesized)
-- Applies to all entities, true for task types and subtypes
-- Is_True_Constant (Flag163)
-- This flag is set in constants and variables which have an initial
-- value specified but which are never assigned, partially or in the
-- whole. For variables, it means that the variable was initialized
-- but never modified, and hence can be treated as a constant by the
-- code generator. For a constant, it means that the constant was not
-- modified by generated code (e.g. to set a discriminant in an init
-- proc). Assignments by user or generated code will reset this flag.
-- Is_Type (synthesized)
-- Applies to all entities, true for a type entity
-- Is_Unchecked_Union (Flag117)
-- Present in all entities. Set only in record types to which the
-- pragma Unchecked_Union has been validly applied.
-- Is_Unsigned_Type (Flag144)
-- Present in all types, but can be set only for discrete and fixed-point
-- type and subtype entities. This flag is only valid if the entity is
-- frozen. If set it indicates that the representation is known to be
-- unsigned (i.e. that no negative values appear in the range). This is
-- normally just a reflection of the lower bound of the subtype or base
-- type, but there is one case in which the setting is non-obvious,
-- namely the case of an unsigned subtype of a signed type from which
-- a further subtype is obtained using variable bounds. This further
-- subtype is still unsigned, but this cannot be determined by looking
-- at its bounds or the bounds of the corresponding base type.
-- Is_Valued_Procedure (Flag127)
-- Present in procedure entities. Set if an Import_Valued_Procedure
-- or Export_Valued_Procedure pragma applies to the procedure entity.
-- Is_Visible_Child_Unit (Flag116)
-- Present in compilation units that are child units. Once compiled,
-- child units remain chained to the entities in the parent unit, and
-- a separate flag must be used to indicate whether the names are
-- visible by selected notation, or not.
-- Is_VMS_Exception (Flag133)
-- Present in all entities. Set only for exception entities where the
-- exception was specified in an Import_Exception or Export_Exception
-- pragma with the VMS option for Form. See description of these pragmas
-- for details. This flag can only be set in OpenVMS versions of GNAT.
-- Is_Volatile (Flag16)
-- Present in all type entities, and also in constants, components and
-- variables. Set if a pragma Volatile applies to the entity. Also set
-- if pragma Shared or pragma Atomic applies to entity. In the case of
-- private or incomplete types, this flag is set in both the private
-- and full view.
-- Is_Wrapper_Package (synthesized)
-- Present in package entities. Indicates that the package has been
-- created as a wrapper for a subprogram instantiation.
-- Last_Entity (Node20)
-- Present in all entities which act as scopes to which a list of
-- associated entities is attached (blocks, class subtypes and types,
-- entries, functions, loops, packages, procedures, protected objects,
-- record types and subtypes, private types, task types and subtypes).
-- Points to a the last entry in the list of associated entities chained
-- through the Next_Entity field. Empty if no entities are chained.
-- Lit_Indexes (Node15)
-- Present in enumeration types and subtypes. Non-empty only for the
-- case of an enumeration root type, where it contains the entity for
-- the generated indexes entity. See unit Exp_Imgv for full details of
-- the nature and use of this entity for implkementing the Image and
-- Value attributes for the enumeration type in question.
--
-- Lit_Strings (Node16)
-- Present in enumeration types and subtypes. Non-empty only for the
-- case of an enumeration root type, where it contains the entity for
-- the literals string entity. See unit Exp_Imgv for full details of
-- the nature and use of this entity for implementing the Image and
-- Value attributes for the enumeration type in question.
-- Machine_Radix_10 (Flag84)
-- Present in decimal types and subtypes, set if the Machine_Radix
-- is 10, as the result of the specification of a machine radix
-- representation clause. Note that it is possible for this flag
-- to be set without having Has_Machine_Radix_Clause True. This
-- happens when a type is derived from a type with a clause present.
-- Master_Id (Node17)
-- Present in access types and subtypes. Empty unless Has_Task is
-- set for the designated type, in which case it points to the entity
-- for the Master_Id for the access type master.
-- Materialize_Entity (Flag168)
-- Present in all entities. Set only for constant or renamed entities
-- which should be materialized for debugging purposes. In the case of
-- a constant, a memory location should be allocated containing the
-- value. In the case of a renaming, a memory location containing the
-- renamed address should be allocated.
-- Mechanism (Uint8) (returned as Mechanism_Type)
-- Present in functions and non-generic formal parameters. Indicates
-- the mechanism to be used for the function return or for the formal
-- parameter. See separate section on passing mechanisms.
-- Modulus (Uint17) [base type only]
-- Present in modular types. Contains the modulus. For the binary
-- case, this will be a power of 2, but if Non_Binary_Modulus is
-- set, then it will not be a power of 2.
-- Needs_Debug_Info (Flag147)
-- Present in all entities. Set if the entity requires debugging
-- information to be generated. This is true of all entities that
-- have Comes_From_Source set, and also transitively for entities
-- associated with such components (e.g. their types). It is true
-- for all entities in Debug_Generated_Code mode (-gnatD switch).
-- Needs_No_Actuals (Flag22)
-- Present in callable entities (subprograms, entries, access to
-- subprograms) which can be called without actuals because all of
-- their formals (if any) have default values. This flag simplifies the
-- resolution of the syntactic ambiguity involving a call to these
-- entities when the return type is an array type, and a call can be
-- interpreted as an indexing of the result of the call. It is also
-- used to resolve various cases of entry calls.
-- Not_Source_Assigned (Flag115)
-- Present in all entities, but relevant only for variables and
-- parameters. This flag is set if the object is never assigned a
-- value in user code and was not fully initialized at declaration
-- time. Note however, that an access variable is not considered
-- fully initialized in this sense.
--
-- This flag is only for the purposes of issuing warnings, it must not
-- be used by the code generator to indicate that the variable is in
-- fact a constant, since some assignments in generated code do not
-- count (for example, the call to an init_proc to assign some but
-- not all of the fields in a patially initialized record). The code
-- generator should instead use the flag Is_True_Constant.
--
-- In variables and out parameters, if this flag is set after full
-- processing of the corresponding declarative unit, it indicates that
-- the variable or parameter was never set, and a warning message can
-- be issued.
--
-- Note: this flag is initially set, and then cleared on encountering
-- any construct that might conceivably legitimately set the value.
-- Thus during the analysis of a declarative region and its associated
-- statement sequence, the meaning of the flag is "not assigned yet",
-- and once this analysis is complete the flag means "never assigned".
-- Note: for variables appearing in package declarations, this flag
-- is never set. That is because there is no way to tell if some
-- client modifies the variable (or in the case of variables in the
-- private part, if some child unit modifies the variables).
-- Note: in the case of renamed objects, the flag must be set in the
-- ultimate renamed object. Clients noting a possible modification
-- should use the Note_Possible_Modification procedure in Sem_Util
-- rather than Set_Not_Source_Assigned precisely to deal properly with
-- the renaming possibility.
-- Next_Component (synthesized)
-- Applies to record components. Returns the next component by
-- following the chain of declared entities until one is found which
-- corresponds to a component (Ekind is E_Component). Any internal types
-- generated from the subtype indications of the record components are
-- skipped. Returns Empty if no more components.
-- Next_Discriminant (synthesized)
-- Applies to discriminants returned by First/Next_Discriminant.
-- Returns the next language-defined (ie: perhaps non-girder)
-- discriminant by following the chain of declared entities as long as
-- the kind of the entity corresponds to a discriminant. Note that the
-- discriminants might be the only components of the record.
-- Returns Empty if there are no more.
-- Next_Entity (Node2)
-- Present in all entities. The entities of a scope are chained, with
-- the head of the list being in the First_Entity field of the scope
-- entity. All entities use the Next_Entity field as a forward pointer
-- for this list, with Empty indicating the end of the list. Since this
-- field is in the base part of the entity, the access routines for this
-- field are in Sinfo.
-- Next_Formal (synthesized)
-- Applies to the entity for a formal parameter. Returns the next
-- formal parameter of the subprogram or subprogram type. Returns
-- Empty if there are no more formals.
-- Next_Formal_With_Extras (synthesized)
-- Applies to the entity for a formal parameter. Returns the next
-- formal parameter of the subprogram or subprogram type. Returns
-- Empty if there are no more formals. The list returned includes
-- all the extra formals (see description of Extra_Formal field)
-- Next_Girder_Discriminant (synthesized)
-- Applies to discriminants. Set only for a discriminant returned by
-- a call to First/Next_Girder_Discriminant. Returns next girder
-- discriminant, if there are more (see complete description in
-- First_Girder_Discriminant), or Empty if there are no more.
-- Next_Index (synthesized)
-- Applies to array types and subtypes and to string types and
-- subtypes. Yields the next index. The first index is obtained by
-- using the First_Index attribute, and then subsequent indexes are
-- obtained by applying Next_Index to the previous index. Empty is
-- returned to indicate that there are no more indexes. Note that
-- unlike most attributes in this package, Next_Index applies to
-- nodes for the indexes, not to entities.
-- Next_Inlined_Subprogram (Node12)
-- Present in subprograms. Used to chain inlined subprograms used in
-- the current compilation, in the order in which they must be compiled
-- by Gigi to insure that all inlinings are performed.
-- Next_Literal (synthesized)
-- Applies to enumeration literals, returns the next literal, or
-- Empty if applied to the last literal. This is actually a synonym
-- for Next, but its use is preferred in this context.
-- Non_Binary_Modulus (Flag58) [base type only]
-- Present in modular integer types. Set if the modulus for the type
-- is other than a power of 2.
-- Nonzero_Is_True (Flag162) [base type only]
-- Present in enumeration types. True if any non-zero value is to be
-- interpreted as true. Currently this is set true for derived Boolean
-- types which have a convention of C, C++ or Fortran.
-- No_Pool_Assigned (Flag131) [root type only]
-- Present in access types. Set if a storage size clause applies to
-- the variable with a compile time known value of zero. This flag is
-- used to generate warnings if any attempt is made to allocate an
-- instance of such an access type.
-- No_Return (Flag113)
-- Present in procedure and generic procedure entries. Indicates that
-- a pragma No_Return applies to the procedure.
-- Normalized_First_Bit (Uint8)
-- Present in components and discriminants. Indicates the normalized
-- value of First_Bit for the component, i.e. the offset within the
-- lowest addressed storage unit containing part or all of the field.
-- Normalized_Position (Uint9)
-- Present in components and discriminants. Indicates the normalized
-- value of Position for the component, i.e. the offset in storage
-- units from the start of the record to the lowest addressed storage
-- unit containing part or all of the field.
-- Normalized_Position_Max (Uint10)
-- Present in components and discriminants. For almost all cases, this
-- is the same as Normalized_Position. The one exception is for the case
-- of a discriminated record containing one or more arrays whose length
-- depends on discriminants. In this case, the Normalized_Position_Max
-- field represents the maximum possible value of Normalized_Position
-- assuming min/max values for discriminant subscripts in all fields.
-- This is used by Layout in front end layout mode to properly computed
-- the maximum size such records (needed for allocation purposes when
-- there are default discriminants, and also for the 'Size value).
-- Number_Dimensions (synthesized)
-- Applies to array types and subtypes. Returns the number of dimensions
-- of the array type or subtype as a value of type Pos.
-- Number_Discriminants (synthesized)
-- Applies to all types with discriminants. Yields the number of
-- discriminants as a value of type Pos.
-- Number_Entries (synthesized)
-- Applies to concurrent types. Returns the number of entries that are
-- declared within the task or protected definition for the type.
-- Number_Formals (synthesized)
-- Applies to subprograms and subprogram types. Yields the number of
-- formals as a value of type Pos.
-- Object_Ref (Node17)
-- Present in protected bodies. This is an implicit prival for the
-- Protection object associated with a protected object. See Prival
-- for further details on the use of privals.
-- Original_Record_Component (Node22)
-- Present in components, including discriminants. The usage depends
-- on whether the record is a base type and whether it is tagged.
--
-- In base tagged types:
-- When the component is inherited in a record extension, it points
-- to the original component (the entity of the ancestor component
-- which is not itself inherited) otherwise it points to itself.
-- Gigi uses this attribute to implement the automatic dereference in
-- the extension and to apply the transformation:
--
-- Rec_Ext.Comp -> Rec_Ext.Parent. ... .Parent.Comp
--
-- In base non-tagged types:
-- Always points to itself except for non-girder discriminants, where
-- it points to the girder discriminant it renames.
--
-- In subtypes (tagged and untagged):
-- Points to the component in the base type.
-- Packed_Array_Type (Node23)
-- Present in array types and subtypes, including the string literal
-- subtype case, if the corresponding type is packed (either bit packed
-- or packed to eliminate holes in non-contiguous enumeration type
-- index types). References the type used to represent the packed array,
-- which is either a modular type for short static arrays, or an
-- array of System.Unsigned. Note that in some situations (internal
-- types, and references to fields of variant records), it is not
-- always possible to construct this type in advance of its use. If
-- Packed_Array_Type is empty, then the necessary type is declared
-- on the fly for each reference to the array.
-- Parameter_Mode (synthesized)
-- Applies to formal parameter entities. This is a synonym for Ekind,
-- used when obtaining the formal kind of a formal parameter (the result
-- is one of E_[In/Out/In_Out]_Parameter)
-- Parent_Subtype (Node19)
-- Present in E_Record_Type. Points to the subtype to use for a
-- field that references the parent record. This is used by Gigi to
-- construct such a field.
-- Primitive_Operations (Elist15)
-- Present in tagged record types and subtypes and in tagged private
-- types. Points to an element list of entities for primitive operations
-- for the tagged type. Not present (and not set) in untagged types (it
-- is an error to reference the primitive operations field of a type
-- that is not tagged).
-- Private_Dependents (Elist18)
-- Present in private (sub)types. Records the subtypes of the
-- private type, derivations from it, and records and arrays
-- with components dependent on the type.
--
-- The subtypes are traversed when installing and deinstalling
-- (the full view of) a private type in order to ensure correct
-- view of the subtypes.
--
-- Used in similar fashion for incomplete types: holds list of subtypes
-- of these incomplete types that have discriminant constraints. The
-- full views of these subtypes are constructed when the full view of
-- the incomplete type is processed.
-- In addition, if the incomplete type is the designated type in an
-- access definition for an access parameter, the operation may be
-- a dispatching primitive operation, which is only known when the full
-- declaration of the type is seen. Subprograms that have such an
-- access parameter are also placed in the list of private_dependents.
-- Prival (Node17)
-- Present in components. Used for representing private declarations
-- of protected objects (private formal: by analogy to Discriminal_Link).
-- Empty unless the synthesized Is_Protected_Private attribute is
-- true. The entity used as a formal parameter that corresponds to
-- the to the private declaration in protected operations. See
-- "Private data in protected objects" for details.
-- Privals_Chain (Elist23)
-- Present in protected operations (subprograms and entries). Links
-- all occurrences of the Privals in the body of the operation, in
-- order to patch their types at the end of their expansion. See
-- "Private data in protected objects" for details.
-- Private_View (Node22)
-- For each private type, three entities are allocated, the private view,
-- the full view, and the shadow entity. The shadow entity contains a
-- copy of the private view and is used for restoring the proper private
-- view after a region in which the full view is visible (and is copied
-- into the entity normally used for the private view during this period
-- of visibility). The Private_View field is self-referential when the
-- private view lives in its normal entity, but in the copy that is made
-- in the shadow entity, it points to the proper location in which to
-- restore the private view saved in the shadow.
-- Protected_Formal (Node22)
-- Present in formal parameters (in, in out and out parameters). Used
-- only for formals of protected operations. References corresponding
-- formal parameter in the unprotected version of the operation that
-- is created during expansion.
-- Protected_Body_Subprogram (Node11)
-- Present in protected operations. References the entity for the
-- subprogram which implements the body of the operation.
-- Protected_Operation (Node23)
-- Present in components. Used for representing private declarations
-- of protected objects. Empty unless the synthesized attribute
-- Is_Protected_Private is True. This is the entity corresponding
-- to the body of the protected operation currently being analyzed,
-- and which will eventually use the current Prival associated with
-- this component to refer to the renaming of a private object
-- component. As soon as the expander generates this renaming, this
-- attribute is changed to refer to the next protected subprogram.
-- See "Private data in protected objects" for details.
-- Reachable (Flag49)
-- Present in labels. The flag is set over the range of statements in
-- which a goto to that label is legal.
-- Referenced (Flag156)
-- Present in all entities, set if the entity is referenced.
-- Referenced_Object (Node10)
-- Present in all type entities. Set non-Empty only for type entities
-- constructed for unconstrained objects, or objects that depend on
-- discriminants. Points to the expression from which the actual
-- subtype of the object can be evaluated.
-- Register_Exception_Call (Node20)
-- Present in exception entities. When an exception is declared,
-- a call is expanded to Register_Exception. This field points to
-- the expanded N_Procedure_Call_Statement node for this call. It
-- is used for Import/Export_Exception processing to modify the
-- register call to make appropriate entries in the special tables
-- used for handling these pragmas at runtime.
-- Related_Array_Object (Node19)
-- Present in array types and subtypes. Used only for the base type
-- and subtype created for an anonymous array object. Set to point
-- to the entity of the corresponding array object. Currently used
-- only for type-related error messages.
-- Related_Instance (Node15)
-- Present in the wrapper packages created for subprogram instances.
-- The internal subprogram that implements the instance is inside the
-- wrapper package, but for debugging purposes its external symbol
-- must correspond to the name and scope of the related instance.
-- Renamed_Entity (Node18)
-- Present in exceptions, packages and generic units that are defined
-- by a renaming declaration. Denotes the renamed entity, or transit-
-- itively the ultimate renamed entity if there is a chain of renaming
-- declarations.
-- Renamed_Object (Node18)
-- Present in all objects (constants, variables, components, formal
-- parameters, generic formal parameters, and loop parameters. Set
-- non-Empty if the object was declared by a renaming declaration, in
-- which case it references the tree node for the name of the renamed
-- object. This is only possible for the variable and constant cases.
-- For formal parameters, this field is used in the course of inline
-- expansion, to map the formals of a subprogram into the corresponding
-- actuals. The field is Empty otherwise.
-- Renaming_Map (Uint9)
-- Present in generic subprograms, generic packages, and their
-- instances. Also present in the instances of the corresponding
-- bodies. Denotes the renaming map (generic entities => instance
-- entities) used to construct the instance by givin an index into
-- the tables used to represent these maps. See Sem_Ch12 for further
-- details. The maps for package instances are also used when the
-- instance is the actual corresponding to a formal package.
-- Return_Present (Flag54)
-- Present in function and generic function entities. Set if the
-- function contains a return statement (used for error checking).
-- This flag can also be set in procedure and generic procedure
-- entities (for convenience in setting it), but is only tested
-- for the function case.
-- Returns_By_Ref (Flag90)
-- Present in function entities, to indicate that the function
-- returns the result by reference, either because its return typ is a
-- by-reference-type or because it uses explicitly the secondary stack.
-- Reverse_Bit_Order (Flag164)
-- Present in all record type entities. Set if a valid pragma an
-- attribute represention clause for Bit_Order has reversed the order
-- of bits from the default value. When this flag is set, a component
-- clause must specify a set of bits entirely contained in a single
-- storage unit.
-- RM_Size (Uint13)
-- Present in all type and subtype entities. Contains the value of
-- type'Size as defined in the RM. See also the Esize field and
-- and the description on "Handling of Type'Size Values". A value
-- of zero for in this field for a non-discrete type means that
-- the front end has not yet determined the size value. For the
-- case of a discrete type, this field is always set by the front
-- end and zero is a legitimate value for a type with one value.
-- Root_Type (synthesized)
-- Applies to all type entities. For class-wide types, return the root
-- type of the class covered by the CW type, otherwise returns the
-- ultimate derivation ancestor of the given type. This function
-- preserves the view, i.e. the Root_Type of a partial view is the
-- partial view of the ulimate ancestor, the Root_Type of a full view
-- is the full view of the ultimate ancestor. Note that this function
-- does not correspond exactly to the use of root type in the RM, since
-- in the RM root type applies to a class of types, not to a type.
-- Scalar_Range (Node20)
-- Present in all scalar types (including modular types, where the
-- bounds are 0 .. modulus - 1). References a node in the tree that
-- contains the bounds for the range. Note that this information
-- could be obtained by rummaging around the tree, but it is more
-- convenient to have it immediately at hand in the entity. The
-- contents of Scalar_Range can either be an N_Subtype_Indication
-- node (with a constraint), or a Range node, but not a simple
-- subtype reference (a subtype is converted into a range).
-- Scale_Value (Uint15)
-- Present in decimal fixed-point types and subtypes. Contains the scale
-- for the type (i.e. the value of type'Scale = the number of decimal
-- digits after the decimal point).
-- Scope (Node3)
-- Present in all entities. Points to the entity for the scope (block,
-- loop, subprogram, package etc.) in which the entity is declared.
-- Since this field is in the base part of the entity node, the access
-- routines for this field are in Sinfo.
-- Scope_Depth (synth)
-- Applies to program units, blocks, concurrent types and entries,
-- and also to record types, i.e. to any entity that can appear on
-- the scope stack. Yields the scope depth value, which for those
-- entities other than records is simply the scope depth value,
-- for record entities, it is the Scope_Depth of the record scope.
-- Scope_Depth_Value (Uint22)
-- Present in program units, blocks, concurrent types and entries.
-- Indicates the number of scopes that statically enclose the
-- declaration of the unit or type. Library units have a depth of zero.
-- Note that record types can act as scopes but do NOT have this field
-- set (see Scope_Depth above)
-- Scope_Depth_Set (synthesized)
-- Applies to a special predicate function that returns a Boolean value
-- indicating whether or not the Scope_Depth field has been set. It
-- is needed, since returns an invalid value in this case!
-- Sec_Stack_Needed_For_Return (Flag167)
-- Present in scope entities (blocks,functions, procedures, tasks,
-- entries). Set to True when secondary stack is used to hold
-- the returned value of a function and thus should not be
-- released on scope exit.
-- Shadow_Entities (List14)
-- Present in package and generic package entities. Points to a list
-- of entities that correspond to private types. For each private type
-- a shadow entity is created that holds a copy of the private view.
-- In regions of the program where the full views of these private
-- entities are visible, the full view is copied into the entity that
-- is normally used to hold the private view, but the shadow entity
-- copy is unchanged. The shadow entities are then used to restore the
-- original private views at the end of the region. This list is a
-- standard format list (i.e. First (Shadow_Entities) is the first
-- entry and subsequent entries are obtained using Next.
-- Shared_Var_Assign_Proc (Node22)
-- Present in variables. Set non-Empty only if Is_Shared_Passive is
-- set, in which case this is the entity for the shared memory assign
-- routine. See Exp_Smem for full details.
-- Shared_Var_Read_Proc (Node15)
-- Present in variables. Set non-Empty only if Is_Shared_Passive is
-- set, in which case this is the entity for the shared memory read
-- routine. See Exp_Smem for full details.
-- Size_Check_Code (Node9)
-- Present in constants and variables. Normally Empty. Set if code is
-- generated to check the size of the variable. This field is used to
-- suppress this code if a subsequent address clause is encountered.
-- Size_Clause (synthesized)
-- Applies to all entities. If a size clause is present in the rep
-- item chain for an entity then the attribute definition clause node
-- for the size clause is returned. Otherwise Size_Clause returns Empty
-- if no item is present. Usually this is only meaningful if the flag
-- Has_Size_Clause is set. This is because when the representation item
-- chain is copied for a derived type, it can inherit a size clause that
-- is not applicable to the entity.
-- Size_Depends_On_Discriminant (Flag177)
-- Present in all entities for types and subtypes. Indicates that the
-- size of the type depends on the value of one or more discriminants.
-- Currently, this flag is only set in front end layout mode for arrays
-- which have one or more bounds depending on a discriminant value.
-- Size_Known_At_Compile_Time (Flag92)
-- Present in all entities for types and subtypes. Indicates that the
-- size of objects of the type is known at compile time. This flag is
-- used to optimize some generated code sequences, and also to enable
-- some error checks (e.g. disallowing component clauses on variable
-- length objects. It is set conservatively (i.e. if it is True, the
-- size is certainly known at compile time, if it is False, then the
-- size may or may not be known at compile time, but the code will
-- assume that it is not known).
-- Small_Value (Ureal21)
-- Present in fixed point types. Points to the universal real for the
-- Small of the type, either as given in a representation clause, or
-- as computed (as a power of two) by the compiler.
-- Spec_Entity (Node19)
-- Present in package body entities. Points to corresponding package
-- spec entity. Also present in subprogram body parameters in the
-- case where there is a separate spec, where this field references
-- the corresponding parameter entities in the spec.
-- Storage_Size_Variable (Node15) [implementation base type only]
-- Present in access types and task type entities. This flag is set
-- if a valid and effective pragma Storage_Size applies to the base
-- type. Points to the entity for a variable that is created to
-- hold the value given in a Storage_Size pragma for an access
-- collection or a task type. Note that in the access type case,
-- this field is present only in the root type (since derived types
-- share the same storage pool).
-- Strict_Alignment (Flag145) [implementation base type only]
-- Present in all type entities. Indicates that some containing part
-- is either aliased or tagged. This prohibits packing the object
-- tighter than its natural size and alignment.
-- String_Literal_Length (Uint16)
-- Present in string literal subtypes (which are created to correspond
-- to string literals in the program). Contains the length of the string
-- literal.
-- String_Literal_Low_Bound (Node15)
-- Present in string literal subtypes (which are created to correspond
-- to string literals in the program). Contains an expression whose
-- value represents the low bound of the literal. This is a copy of
-- the low bound of the applicable index constraint if there is one,
-- or a copy of the low bound of the index base type if not.
-- Suppress_Access_Checks (Flag31)
-- Present in all entities. Set if access checks associated with this
-- entity are to be suppressed (see separate section on "Handling of
-- Check Suppression")
-- Suppress_Accessibility_Checks (Flag32)
-- Present in all entities. Set if accessibility checks associated with
-- this entity are to be suppressed (see separate section on "Handling
-- of Check Suppression")
-- Suppress_Discriminant_Checks (Flag33)
-- Present in all entities. Set if discriminant checks associated with
-- this entity are to be suppressed (see separate section on "Handling
-- of Check Suppression")
-- Suppress_Division_Checks (Flag34)
-- Present in all entities. Set if division checks associated with
-- this entity are to be suppressed (see separate section on "Handling
-- of Check Suppression")
-- Suppress_Elaboration_Checks (Flag35)
-- Present in all entities. Set if elaboration checks associated with
-- this entity are to be suppressed (see separate section on "Handling
-- of Check Suppression")
-- Suppress_Elaboration_Warnings (Flag148)
-- Present in all entities. Set if a pragma Suppress Elaboration_Checks
-- is applied specifically to the entity. If set on a subprogram, all
-- elaboration warnings for calls to the subprogram are suppressed. If
-- set on a package, then all elaboration warnings for calls to any
-- subprograms in the package are suppressed.
-- Suppress_Index_Checks (Flag36)
-- Present in all entities. Set if index checks associated with this
-- entity are to be suppressed (see separate section on "Handling of
-- Check Suppression")
-- Suppress_Init_Proc (Flag105) [base type only]
-- Present in all type entities. Set to suppress the generation of
-- initialization procedures where they are known to be not needed.
-- For example, the enumeration image table entity uses this flag.
-- Suppress_Length_Checks (Flag37)
-- Present in all entities. Set if length checks associated with this
-- entity are to be suppressed (see separate section on "Handling of
-- Check Suppression")
-- Suppress_Overflow_Checks (Flag38)
-- Present in all entities. Set if overflow checks associated with
-- this entity are to be suppressed (see separate section on "Handling
-- of Check Suppression")
-- Suppress_Range_Checks (Flag39)
-- Present in all entities. Set if range checks associated with this
-- entity are to be suppressed (see separate section on "Handling of
-- Check Suppression")
-- Suppress_Storage_Checks (Flag40)
-- Present in all entities. Set if storage checks associated with
-- this entity are to be suppressed (see separate section on "Handling
-- of Check Suppression")
-- Suppress_Style_Checks (Flag165)
-- Present in all entities. Suppresses any style checks specifically
-- associated with the given entity if set.
-- Suppress_Tag_Checks (Flag41)
-- Present in all entities. Set if tag checks associated with this
-- entity are to be suppressed (see separate section on "Handling of
-- Check Suppression")
-- Tag_Component (synthesized)
-- Applies to tagged record types, returns the entity for the _Tag
-- field in this record, which must be present.
-- Type_High_Bound (synthesized)
-- Applies to scalar types. Returns the tree node (Node_Id) that
-- contains the high bound of a scalar type. The returned value is a
-- literal for a base type, but may be an expression in the case of a
-- scalar type with dynamic bounds. Note that in the case of a fixed
-- point type, the high bound is in units of small, and is an integer.
-- Type_Low_Bound (synthesized)
-- Applies to scalar types. Returns the tree node (Node_Id) that
-- contains the low bound of a scalar type. The returned value is a
-- literal for a base type, but may be an expression in the case of a
-- scalar type with dynamic bounds. Note that in the case of a fixed
-- point type, the low bound is in units of small, and is an integer.
-- Underlying_Full_View (Node19)
-- Present in private subtypes that are the completion of other private
-- types, or in private types that are derived from private subtypes.
-- If the full view of a private type T is derived from another
-- private type with discriminants Td, the full view of T is also
-- private, and there is no way to attach to it a further full view that
-- would convey the structure of T to the back end. The Underlying_Full_
-- View is an attribute of the full view that is a subtype of Td with
-- the same constraint as the declaration for T. The declaration for this
-- subtype is built at the point of the declaration of T, either as a
-- completion, or as a subtype declaration where the base type is private
-- and has a private completion. If Td is already constrained, then its
-- full view can serve directly as the full view of T.
-- Underlying_Type (synthesized)
-- Applies to all entities. This is the identity function except in
-- the case where it is applied to an incomplete or private type,
-- in which case it is the underlying type of the type declared by
-- the completion, or Empty if the completion has not yet been
-- encountered and analyzed.
--
-- Note: the reason this attribute applies to all entities, and not
-- just types, is to legitimize code where Underlying_Type is applied
-- to an entity which may or may not be a type, with the intent that
-- if it is a type, its underlying type is taken.
-- Unset_Reference (Node16)
-- Present in variables and out parameters. This is normally Empty.
-- It is set to point to an identifier that represents a reference
-- to the entity before any value has been set. Only the first such
-- reference is identified. This field is used to generate a warning
-- message if necessary (see Sem_Warn.Check_Unset_Reference).
-- Uses_Sec_Stack (Flag95)
-- Present in scope entities (blocks,functions, procedures, tasks,
-- entries). Set to True when secondary stack is used in this scope and
-- must be released on exit unless Sec_Stack_Needed_For_Return is set.
-- Vax_Float (Flag151) [base type only]
-- Present in all type entities. Set only on the base type of float
-- types with Vax format. The particular format is determined by the
-- Digits_Value value which is 6,9,15 for F_Float, D_Float, G_Float.
-- Warnings_Off (Flag96)
-- Present in all entities. Set if a pragma Warnings (Off, entity-name)
-- is used to suppress warnings for a given entity. It is also used by
-- the compiler in some situations to kill spurious warnings.
------------------
-- Access Kinds --
------------------
-- The following three entity kinds are introduced by the corresponding
-- type definitions:
-- E_Access_Type, E_General_Access_Type, E_Anonymous_Access_Type.
-- In addition, we define the kind E_Allocator_Type to label
-- allocators. This is because special resolution rules apply to this
-- construct. Eventually the constructs are labeled with the access
-- type imposed by the context. Gigi should never see the type
-- E_Allocator.
-- Similarly, the type E_Access_Attribute_Type is used as the initial
-- kind associated with an access attribute. After resolution a specific
-- access type will be established as determined by the context.
-- Finally, the type Any_Access is used to label -null- during type
-- resolution. Any_Access is also replaced by the context type after
-- resolution.
--------------------------------
-- Classification of Entities --
--------------------------------
-- The classification of program entities which follows is a refinement of
-- the list given in RM 3.1(1). E.g., separate entities denote subtypes of
-- different type classes. Ada 95 entities include class wide types,
-- protected types, subprogram types, generalized access types, generic
-- formal derived types and generic formal packages.
-- The order chosen for these kinds allows us to classify related entities
-- so that they are contiguous. As a result, they do not appear in the
-- exact same order as their order of first appearance in the LRM (For
-- example, private types are listed before packages). The contiguity
-- allows us to define useful subtypes (see below) such as type entities,
-- overloaded entities, etc.
-- Each entity (explicitly or implicitly declared) has a kind, which is
-- a value of the following type:
type Entity_Kind is (
E_Void,
-- The initial Ekind value for a newly created entity. Also used as
-- the Ekind for Standard_Void_Type, a type entity in Standard used
-- as a dummy type for the return type of a procedure (the reason we
-- create this type is to share the circuits for performing overload
-- resolution on calls).
-------------
-- Objects --
-------------
E_Variable,
-- Variables created by an object declaration with no constant keyword
E_Component,
-- Components of a record declaration, private declarations of
-- protected objects.
E_Constant,
-- Constants created by an object declaration with a constant keyword
E_Discriminant,
-- A discriminant, created by the use of a discriminant in a type
-- declaration.
E_Loop_Parameter,
-- A loop parameter created by a for loop
------------------------
-- Parameter Entities --
------------------------
-- Parameters are also objects
E_In_Parameter,
-- An in parameter of a subprogram or entry
E_Out_Parameter,
-- An out parameter of a subprogram or entry
E_In_Out_Parameter,
-- An in-out parameter of a subprogram or entry
--------------------------------
-- Generic Parameter Entities --
--------------------------------
-- Generic parameters are also objects
E_Generic_In_Out_Parameter,
-- A generic in out parameter, created by the use of a generic in out
-- parameter in a generic declaration.
E_Generic_In_Parameter,
-- A generic in parameter, created by the use of a generic in
-- parameter in a generic declaration.
-------------------
-- Named Numbers --
-------------------
E_Named_Integer,
-- Named numbers created by a number declaration with an integer value
E_Named_Real,
-- Named numbers created by a number declaration with a real value
-----------------------
-- Enumeration Types --
-----------------------
E_Enumeration_Type,
-- Enumeration types, created by an enumeration type declaration
E_Enumeration_Subtype,
-- Enumeration subtypes, created by an explicit or implicit subtype
-- declaration applied to an enumeration type or subtype.
-------------------
-- Numeric Types --
-------------------
E_Signed_Integer_Type,
-- Signed integer type, used for the anonymous base type of the
-- integer subtype created by an integer type declaration.
E_Signed_Integer_Subtype,
-- Signed integer subtype, created by either an integer subtype or
-- integer type declaration (in the latter case an integer type is
-- created for the base type, and this is the first named subtype).
E_Modular_Integer_Type,
-- Modular integer type, used for the anonymous base type of the
-- integer subtype created by a modular integer type declaration.
E_Modular_Integer_Subtype,
-- Modular integer subtype, created by either an modular subtype
-- or modular type declaration (in the latter case a modular type
-- is created for the base type, and this is the first named subtype).
E_Ordinary_Fixed_Point_Type,
-- Ordinary fixed type, used for the anonymous base type of the
-- fixed subtype created by an ordinary fixed point type declaration.
E_Ordinary_Fixed_Point_Subtype,
-- Ordinary fixed point subtype, created by either an ordinary fixed
-- point subtype or ordinary fixed point type declaration (in the
-- latter case a fixed point type is created for the base type, and
-- this is the first named subtype).
E_Decimal_Fixed_Point_Type,
-- Decimal fixed type, used for the anonymous base type of the decimal
-- fixed subtype created by an ordinary fixed point type declaration.
E_Decimal_Fixed_Point_Subtype,
-- Decimal fixed point subtype, created by either a decimal fixed point
-- subtype or decimal fixed point type declaration (in the latter case
-- a fixed point type is created for the base type, and this is the
-- first named subtype).
E_Floating_Point_Type,
-- Floating point type, used for the anonymous base type of the
-- floating point subtype created by a floating point type declaration.
E_Floating_Point_Subtype,
-- Floating point subtype, created by either a floating point subtype
-- or floating point type declaration (in the latter case a floating
-- point type is created for the base type, and this is the first
-- named subtype).
------------------
-- Access Types --
------------------
E_Access_Type,
-- An access type created by an access type declaration with no all
-- keyword present. Note that the predefined type Any_Access, which
-- has E_Access_Type Ekind, is used to label NULL in the upwards pass
-- of type analysis, to be replaced by the true access type in the
-- downwards resolution pass.
E_Access_Subtype,
-- An access subtype created by a subtype declaration for any access
-- type (whether or not it is a general access type).
E_Access_Attribute_Type,
-- An access type created for an access attribute (such as 'Access,
-- 'Unrestricted_Access and Unchecked_Access)
E_Allocator_Type,
-- A special internal type used to label allocators and attribute
-- references using 'Access. This is needed because special resolution
-- rules apply to these constructs. On the resolution pass, this type
-- is always replaced by the actual access type, so Gigi should never
-- see types with this Ekind.
E_General_Access_Type,
-- An access type created by an access type declaration with the all
-- keyword present.
E_Access_Subprogram_Type,
-- An access to subprogram type, created by an access to subprogram
-- declaration.
E_Access_Protected_Subprogram_Type,
-- An access to a protected subprogram, created by the corresponding
-- declaration. Values of such a type denote both a protected object
-- and a protected operation within, and have different compile-time
-- and run-time properties than other access to subprograms.
E_Anonymous_Access_Type,
-- An anonymous access type created by an access parameter or access
-- discriminant.
---------------------
-- Composite Types --
---------------------
E_Array_Type,
-- An array type created by an array type declaration. Includes all
-- cases of arrays, except for string types.
E_Array_Subtype,
-- An array subtype, created by an explicit array subtype declaration,
-- or the use of an anonymous array subtype.
E_String_Type,
-- A string type, i.e. an array type whose component type is a character
-- type, and for which string literals can thus be written.
E_String_Subtype,
-- A string subtype, created by an explicit subtype declaration for a
-- string type, or the use of an anonymous subtype of a string type,
E_String_Literal_Subtype,
-- A special string subtype, used only to describe the type of a string
-- literal (will always be one dimensional, with literal bounds).
E_Class_Wide_Type,
-- A class wide type, created by any tagged type declaration (i.e. if
-- a tagged type is declared, the corresponding class type is always
-- created, using this Ekind value).
E_Class_Wide_Subtype,
-- A subtype of a class wide type, created by a subtype declaration
-- used to declare a subtype of a class type.
E_Record_Type,
-- A record type, created by a record type declaration
E_Record_Subtype,
-- A record subtype, created by a record subtype declaration.
E_Record_Type_With_Private,
-- Used for types defined by a private extension declaration. Includes
-- the fields for both private types and for record types (with the
-- sole exception of Corresponding_Concurrent_Type which is obviously
-- not needed). This entity is considered to be both a record type and
-- a private type.
E_Record_Subtype_With_Private,
-- A subtype of a type defined by a private extension declaration.
E_Private_Type,
-- A private type, created by a private type declaration that does
-- not have the keyword limited.
E_Private_Subtype,
-- A subtype of a private type, created by a subtype declaration used
-- to declare a subtype of a private type.
E_Limited_Private_Type,
-- A limited private type, created by a private type declaration that
-- has the keyword limited.
E_Limited_Private_Subtype,
-- A subtype of a limited private type, created by a subtype declaration
-- used to declare a subtype of a limited private type.
E_Incomplete_Type,
-- An incomplete type, created by an incomplete type declaration
E_Task_Type,
-- A task type, created by a task type declaration. An entity with this
-- Ekind is also created to describe the anonymous type of a task that
-- is created by a single task declaration.
E_Task_Subtype,
-- A subtype of a task type, created by a subtype declaration used to
-- declare a subtype of a task type.
E_Protected_Type,
-- A protected type, created by a protected type declaration. An entity
-- with this Ekind is also created to describe the anonymous type of
-- a protected object created by a single protected declaration.
E_Protected_Subtype,
-- A subtype of a protected type, created by a subtype declaration used
-- to declare a subtype of a protected type.
-----------------
-- Other Types --
-----------------
E_Exception_Type,
-- The type of an exception created by an exception declaration
E_Subprogram_Type,
-- This is the designated type of an Access_To_Subprogram. Has type
-- and signature like a subprogram entity, so can appear in calls,
-- which are resolved like regular calls, except that such an entity
-- is not overloadable.
---------------------------
-- Overloadable Entities --
---------------------------
E_Enumeration_Literal,
-- An enumeration literal, created by the use of the literal in an
-- enumeration type definition.
E_Function,
-- A function, created by a function declaration or a function body
-- that acts as its own declaration.
E_Operator,
-- A predefined operator, appearing in Standard, or an implicitly
-- defined concatenation operator created whenever an array is
-- declared. We do not make normal derived operators explicit in
-- the tree, but the concatenation operators are made explicit.
E_Procedure,
-- A procedure, created by a procedure declaration or a procedure
-- body that acts as its own declaration.
E_Entry,
-- An entry, created by an entry declaration in a task or protected
-- object.
--------------------
-- Other Entities --
--------------------
E_Entry_Family,
-- An entry family, created by an entry family declaration in a
-- task or protected type definition.
E_Block,
-- A block identifier, created by an explicit or implicit label on
-- a block or declare statement.
E_Entry_Index_Parameter,
-- An entry index parameter created by an entry index specification
-- for the body of a protected entry family.
E_Exception,
-- An exception created by an exception declaration. The exception
-- itself uses E_Exception for the Ekind, the implicit type that is
-- created to represent its type uses the Ekind E_Exception_Type.
E_Generic_Function,
-- A generic function. This is the entity for a generic function
-- created by a generic subprogram declaration.
E_Generic_Package,
-- A generic package, this is the entity for a generic package created
-- by a generic package declaration.
E_Generic_Procedure,
-- A generic function. This is the entity for a generic procedure
-- created by a generic subprogram declaration.
E_Label,
-- The defining entity for a label. Note that this is created by the
-- implicit label declaration, not the occurrence of the label itself,
-- which is simply a direct name referring to the label.
E_Loop,
-- A loop identifier, created by an explicit or implicit label on a
-- loop statement.
E_Package,
-- A package, created by a package declaration
E_Package_Body,
-- A package body. This entity serves only limited functions, since
-- most semantic analysis uses the package entity (E_Package). However
-- there are some attributes that are significant for the body entity.
-- For example, collection of exception handlers.
E_Protected_Object,
-- A protected object, created by an object declaration that declares
-- an object of a protected type.
E_Protected_Body,
-- A protected body. This entity serves almost no function, since all
-- semantic analysis uses the protected entity (E_Protected_Type)
E_Task_Body,
-- A task body. This entity serves almost no function, since all
-- semantic analysis uses the protected entity (E_Task_Type).
E_Subprogram_Body
-- A subprogram body. Used when a subprogram has a separate declaration
-- to represent the entity for the body. This entity serves almost no
-- function, since all semantic analysis uses the subprogram entity
-- for the declaration (E_Function or E_Procedure).
);
for Entity_Kind'Size use 8;
-- The data structures in Atree assume this!
--------------------------
-- Subtype Declarations --
--------------------------
-- The above entities are arranged so that they can be conveniently
-- grouped into subtype ranges. Note that for each of the xxx_KInd
-- ranges defined below, there is a corresponding Is_xxx.. predicate
-- which is to be used in preference to direct range tests using the
-- subtype name. However, the subtype names are available for direct
-- use, e.g. as choices in case statements.
subtype Access_Kind is Entity_Kind range
E_Access_Type ..
-- E_Access_Subtype
-- E_Access_Attribute_Type
-- E_Allocator_Type
-- E_General_Access_Type
-- E_Access_Subprogram_Type
-- E_Access_Protected_Subprogram_Type
E_Anonymous_Access_Type;
subtype Array_Kind is Entity_Kind range
E_Array_Type ..
-- E_Array_Subtype
-- E_String_Type
-- E_String_Subtype
E_String_Literal_Subtype;
subtype Class_Wide_Kind is Entity_Kind range
E_Class_Wide_Type ..
E_Class_Wide_Subtype;
subtype Composite_Kind is Entity_Kind range
E_Array_Type ..
-- E_Array_Subtype
-- E_String_Type
-- E_String_Subtype
-- E_String_Literal_Subtype
-- E_Class_Wide_Type
-- E_Class_Wide_Subtype
-- E_Record_Type
-- E_Record_Subtype
-- E_Record_Type_With_Private
-- E_Record_Subtype_With_Private
-- E_Private_Type
-- E_Private_Subtype
-- E_Limited_Private_Type
-- E_Limited_Private_Subtype
-- E_Incomplete_Type
-- E_Task_Type
-- E_Task_Subtype,
-- E_Protected_Type,
E_Protected_Subtype;
subtype Concurrent_Kind is Entity_Kind range
E_Task_Type ..
-- E_Task_Subtype,
-- E_Protected_Type,
E_Protected_Subtype;
subtype Concurrent_Body_Kind is Entity_Kind range
E_Protected_Body ..
E_Task_Body;
subtype Decimal_Fixed_Point_Kind is Entity_Kind range
E_Decimal_Fixed_Point_Type ..
E_Decimal_Fixed_Point_Subtype;
subtype Digits_Kind is Entity_Kind range
E_Decimal_Fixed_Point_Type ..
-- E_Decimal_Fixed_Point_Subtype
-- E_Floating_Point_Type
E_Floating_Point_Subtype;
subtype Discrete_Kind is Entity_Kind range
E_Enumeration_Type ..
-- E_Enumeration_Subtype
-- E_Signed_Integer_Type
-- E_Signed_Integer_Subtype
-- E_Modular_Integer_Type
E_Modular_Integer_Subtype;
subtype Discrete_Or_Fixed_Point_Kind is Entity_Kind range
E_Enumeration_Type ..
-- E_Enumeration_Subtype
-- E_Signed_Integer_Type
-- E_Signed_Integer_Subtype
-- E_Modular_Integer_Type
-- E_Modular_Integer_Subtype
-- E_Ordinary_Fixed_Point_Type
-- E_Ordinary_Fixed_Point_Subtype
-- E_Decimal_Fixed_Point_Type
E_Decimal_Fixed_Point_Subtype;
subtype Elementary_Kind is Entity_Kind range
E_Enumeration_Type ..
-- E_Enumeration_Subtype
-- E_Signed_Integer_Type
-- E_Signed_Integer_Subtype
-- E_Modular_Integer_Type
-- E_Modular_Integer_Subtype
-- E_Ordinary_Fixed_Point_Type
-- E_Ordinary_Fixed_Point_Subtype
-- E_Decimal_Fixed_Point_Type
-- E_Decimal_Fixed_Point_Subtype
-- E_Floating_Point_Type
-- E_Floating_Point_Subtype
-- E_Access_Type
-- E_Access_Subtype
-- E_Access_Attribute_Type
-- E_Allocator_Type
-- E_General_Access_Type
-- E_Access_Subprogram_Type
-- E_Access_Protected_Subprogram_Type
E_Anonymous_Access_Type;
subtype Enumeration_Kind is Entity_Kind range
E_Enumeration_Type ..
E_Enumeration_Subtype;
subtype Entry_Kind is Entity_Kind range
E_Entry ..
E_Entry_Family;
subtype Fixed_Point_Kind is Entity_Kind range
E_Ordinary_Fixed_Point_Type ..
-- E_Ordinary_Fixed_Point_Subtype
-- E_Decimal_Fixed_Point_Type
E_Decimal_Fixed_Point_Subtype;
subtype Float_Kind is Entity_Kind range
E_Floating_Point_Type ..
E_Floating_Point_Subtype;
subtype Formal_Kind is Entity_Kind range
E_In_Parameter ..
-- E_Out_Parameter
E_In_Out_Parameter;
subtype Generic_Unit_Kind is Entity_Kind range
E_Generic_Function ..
-- E_Generic_Package,
E_Generic_Procedure;
subtype Incomplete_Or_Private_Kind is Entity_Kind range
E_Record_Type_With_Private ..
-- E_Record_Subtype_With_Private
-- E_Private_Type
-- E_Private_Subtype
-- E_Limited_Private_Type
-- E_Limited_Private_Subtype
E_Incomplete_Type;
subtype Integer_Kind is Entity_Kind range
E_Signed_Integer_Type ..
-- E_Signed_Integer_Subtype
-- E_Modular_Integer_Type
E_Modular_Integer_Subtype;
subtype Modular_Integer_Kind is Entity_Kind range
E_Modular_Integer_Type ..
E_Modular_Integer_Subtype;
subtype Named_Kind is Entity_Kind range
E_Named_Integer ..
E_Named_Real;
subtype Numeric_Kind is Entity_Kind range
E_Signed_Integer_Type ..
-- E_Signed_Integer_Subtype
-- E_Modular_Integer_Type
-- E_Modular_Integer_Subtype
-- E_Ordinary_Fixed_Point_Type
-- E_Ordinary_Fixed_Point_Subtype
-- E_Decimal_Fixed_Point_Type
-- E_Decimal_Fixed_Point_Subtype
-- E_Floating_Point_Type
E_Floating_Point_Subtype;
subtype Object_Kind is Entity_Kind range
E_Variable ..
-- E_Component
-- E_Constant
-- E_Discriminant
-- E_Loop_Parameter
-- E_In_Parameter
-- E_Out_Parameter
-- E_In_Out_Parameter
-- E_Generic_In_Out_Parameter
E_Generic_In_Parameter;
subtype Ordinary_Fixed_Point_Kind is Entity_Kind range
E_Ordinary_Fixed_Point_Type ..
E_Ordinary_Fixed_Point_Subtype;
subtype Overloadable_Kind is Entity_Kind range
E_Enumeration_Literal ..
-- E_Function
-- E_Operator
-- E_Procedure
E_Entry;
subtype Private_Kind is Entity_Kind range
E_Record_Type_With_Private ..
-- E_Record_Subtype_With_Private
-- E_Private_Type
-- E_Private_Subtype
-- E_Limited_Private_Type
E_Limited_Private_Subtype;
subtype Protected_Kind is Entity_Kind range
E_Protected_Type ..
E_Protected_Subtype;
subtype Real_Kind is Entity_Kind range
E_Ordinary_Fixed_Point_Type ..
-- E_Ordinary_Fixed_Point_Subtype
-- E_Decimal_Fixed_Point_Type
-- E_Decimal_Fixed_Point_Subtype
-- E_Floating_Point_Type
E_Floating_Point_Subtype;
subtype Record_Kind is Entity_Kind range
E_Class_Wide_Type ..
-- E_Class_Wide_Subtype
-- E_Record_Type
-- E_Record_Subtype
-- E_Record_Type_With_Private
E_Record_Subtype_With_Private;
subtype Scalar_Kind is Entity_Kind range
E_Enumeration_Type ..
-- E_Enumeration_Subtype
-- E_Signed_Integer_Type
-- E_Signed_Integer_Subtype
-- E_Modular_Integer_Type
-- E_Modular_Integer_Subtype
-- E_Ordinary_Fixed_Point_Type
-- E_Ordinary_Fixed_Point_Subtype
-- E_Decimal_Fixed_Point_Type
-- E_Decimal_Fixed_Point_Subtype
-- E_Floating_Point_Type
E_Floating_Point_Subtype;
subtype String_Kind is Entity_Kind range
E_String_Type ..
-- E_String_Subtype
E_String_Literal_Subtype;
subtype Subprogram_Kind is Entity_Kind range
E_Function ..
-- E_Operator
E_Procedure;
subtype Signed_Integer_Kind is Entity_Kind range
E_Signed_Integer_Type ..
E_Signed_Integer_Subtype;
subtype Task_Kind is Entity_Kind range
E_Task_Type ..
E_Task_Subtype;
subtype Type_Kind is Entity_Kind range
E_Enumeration_Type ..
-- E_Enumeration_Subtype
-- E_Signed_Integer_Type
-- E_Signed_Integer_Subtype
-- E_Modular_Integer_Type
-- E_Modular_Integer_Subtype
-- E_Ordinary_Fixed_Point_Type
-- E_Ordinary_Fixed_Point_Subtype
-- E_Decimal_Fixed_Point_Type
-- E_Decimal_Fixed_Point_Subtype
-- E_Floating_Point_Type
-- E_Floating_Point_Subtype
-- E_Access_Type
-- E_Access_Subtype
-- E_Access_Attribute_Type
-- E_Allocator_Type,
-- E_General_Access_Type
-- E_Access_Subprogram_Type,
-- E_Access_Protected_Subprogram_Type
-- E_Anonymous_Access_Type
-- E_Array_Type
-- E_Array_Subtype
-- E_String_Type
-- E_String_Subtype
-- E_String_Literal_Subtype
-- E_Class_Wide_Subtype
-- E_Class_Wide_Type
-- E_Record_Type
-- E_Record_Subtype
-- E_Record_Type_With_Private
-- E_Record_Subtype_With_Private
-- E_Private_Type
-- E_Private_Subtype
-- E_Limited_Private_Type
-- E_Limited_Private_Subtype
-- E_Incomplete_Type
-- E_Task_Type
-- E_Task_Subtype
-- E_Protected_Type
-- E_Protected_Subtype
-- E_Exception_Type
E_Subprogram_Type;
--------------------------------------------------------
-- Description of Defined Attributes for Entity_Kinds --
--------------------------------------------------------
-- For each enumeration value defined in Entity_Kind we list all the
-- attributes defined in Einfo which can legally be applied to an entity
-- of that kind. The implementation of the attribute functions (and for
-- non-synthesized attributes, or the corresponding set procedures) are
-- in the Einfo body.
-- The following attributes apply to all entities
-- Ekind (Ekind)
-- Chars (Name1)
-- Next_Entity (Node2)
-- Scope (Node3)
-- Homonym (Node4)
-- Etype (Node5)
-- First_Rep_Item (Node6)
-- Freeze_Node (Node7)
-- Address_Taken (Flag104)
-- Debug_Info_Off (Flag166)
-- Has_Convention_Pragma (Flag119)
-- Has_Delayed_Freeze (Flag18)
-- Has_Fully_Qualified_Name (Flag173)
-- Has_Gigi_Rep_Item (Flag82)
-- Has_Homonym (Flag56)
-- Has_Pragma_Elaborate_Body (Flag150)
-- Has_Pragma_Inline (Flag157)
-- Has_Private_Declaration (Flag155)
-- Has_Qualified_Name (Flag161)
-- Has_Unknown_Discriminants (Flag72)
-- Is_Bit_Packed_Array (Flag122)
-- Is_Child_Unit (Flag73)
-- Is_Compilation_Unit (Flag149)
-- Is_Completely_Hidden (Flag103)
-- Is_Discrim_SO_Function (Flag176)
-- Is_Dispatching_Operation (Flag6)
-- Is_Exported (Flag99)
-- Is_First_Subtype (Flag70)
-- Is_Formal_Subprogram (Flag111)
-- Is_Generic_Instance (Flag130)
-- Is_Hidden (Flag57)
-- Is_Hidden_Open_Scope (Flag171)
-- Is_Immediately_Visible (Flag7)
-- Is_Imported (Flag24)
-- Is_Inlined (Flag11)
-- Is_Internal (Flag17)
-- Is_Itype (Flag91)
-- Is_Known_Valid (Flag170)
-- Is_Limited_Composite (Flag106)
-- Is_Limited_Record (Flag25)
-- Is_Package_Body_Entity (Flag160)
-- Is_Packed_Array_Type (Flag138)
-- Is_Potentially_Use_Visible (Flag9)
-- Is_Preelaborated (Flag59)
-- Is_Public (Flag10)
-- Is_Pure (Flag44)
-- Is_Remote_Call_Interface (Flag62)
-- Is_Remote_Types (Flag61)
-- Is_Shared_Passive (Flag60)
-- Is_Statically_Allocated (Flag28)
-- Is_Unchecked_Union (Flag117)
-- Is_VMS_Exception (Flag133)
-- Materialize_Entity (Flag168)
-- Needs_Debug_Info (Flag147)
-- Referenced (Flag156)
-- Suppress_Access_Checks (Flag31)
-- Suppress_Accessibility_Checks (Flag32)
-- Suppress_Discriminant_Checks (Flag33)
-- Suppress_Division_Checks (Flag34)
-- Suppress_Elaboration_Checks (Flag35)
-- Suppress_Elaboration_Warnings (Flag148)
-- Suppress_Index_Checks (Flag36)
-- Suppress_Length_Checks (Flag37)
-- Suppress_Overflow_Checks (Flag38)
-- Suppress_Range_Checks (Flag39)
-- Suppress_Storage_Checks (Flag40)
-- Suppress_Style_Checks (Flag165)
-- Suppress_Tag_Checks (Flag41)
-- Declaration_Node (synth)
-- Enclosing_Dynamic_Scope (synth)
-- Has_Foreign_Convention (synth)
-- Is_Dynamic_Scope (synth)
-- Is_Generic_Unit (synth)
-- Is_Limited_Type (synth)
-- Underlying_Type (synth)
-- all classification attributes (synth)
-- The following list of access functions applies to all entities for
-- types and subtypes. References to this list appear subsequently as
-- as "(plus type attributes)" for each appropriate Entity_Kind.
-- Associated_Node_For_Itype (Node8)
-- Class_Wide_Type (Node9)
-- Referenced_Object (Node10)
-- Full_View (Node11)
-- Esize (Uint12)
-- RM_Size (Uint13)
-- Alignment (Uint14)
-- Depends_On_Private (Flag14)
-- Discard_Names (Flag88)
-- Finalize_Storage_Only (Flag158) (base type only)
-- From_With_Type (Flag159)
-- Has_Aliased_Components (Flag135)
-- Has_Alignment_Clause (Flag46)
-- Has_Atomic_Components (Flag86) (base type only)
-- Has_Complex_Representation (Flag140) (base type only)
-- Has_Discriminants (Flag5)
-- Has_Non_Standard_Rep (Flag75)
-- Has_Object_Size_Clause (Flag172)
-- Has_Primitive_Operations (Flag120) (base type only)
-- Has_Size_Clause (Flag29)
-- Has_Specified_Layout (Flag100) (base type only)
-- Has_Task (Flag30) (base type only)
-- Has_Unchecked_Union (Flag123) (base type only)
-- Has_Volatile_Components (Flag87) (base type only)
-- In_Use (Flag8)
-- Is_Abstract (Flag19)
-- Is_Asynchronous (Flag81)
-- Is_Atomic (Flag85)
-- Is_Constr_Subt_For_U_Nominal (Flag80)
-- Is_Constr_Subt_For_UN_Aliased (Flag141)
-- Is_Controlled (Flag42) (base type only)
-- Is_Eliminated (Flag124)
-- Is_Frozen (Flag4)
-- Is_Generic_Actual_Type (Flag94)
-- Is_Generic_Type (Flag13)
-- Is_Non_Static_Subtype (Flag109)
-- Is_Packed (Flag51) (base type only)
-- Is_Private_Composite (Flag107)
-- Is_Renaming_Of_Object (Flag112)
-- Is_Tagged_Type (Flag55)
-- Is_Unsigned_Type (Flag144)
-- Is_Volatile (Flag16)
-- Size_Depends_On_Discriminant (Flag177)
-- Size_Known_At_Compile_Time (Flag92)
-- Strict_Alignment (Flag145)
-- Suppress_Init_Proc (Flag105) (base type only)
-- Alignment_Clause (synth)
-- Ancestor_Subtype (synth)
-- Base_Type (synth)
-- First_Subtype (synth)
-- Has_Private_Ancestor (synth)
-- Implementation_Base_Type (synth)
-- Is_By_Copy_Type (synth)
-- Is_By_Reference_Type (synth)
-- Is_Return_By_Reference_Type (synth)
-- Root_Type (synth)
-- Size_Clause (synth)
------------------------------------------
-- Applicable attributes by entity kind --
------------------------------------------
-- E_Access_Protected_Subprogram_Type
-- Equivalent_Type (Node18)
-- Directly_Designated_Type (Node20)
-- Needs_No_Actuals (Flag22)
-- (plus type attributes)
-- E_Access_Subprogram_Type
-- Equivalent_Type (Node18) (remote types only)
-- Directly_Designated_Type (Node20)
-- Needs_No_Actuals (Flag22)
-- (plus type attributes)
-- E_Access_Type
-- E_Access_Subtype
-- Storage_Size_Variable (Node15) (root type only)
-- Master_Id (Node17)
-- Directly_Designated_Type (Node20)
-- Associated_Storage_Pool (Node22)
-- Associated_Final_Chain (Node23)
-- Has_Pragma_Controlled (Flag27) (base type only)
-- Has_Storage_Size_Clause (Flag23) (root type only)
-- Is_Access_Constant (Flag69)
-- No_Pool_Assigned (Flag131) (root type only)
-- (plus type attributes)
-- E_Access_Attribute_Type
-- Directly_Designated_Type (Node20)
-- (plus type attributes)
-- E_Allocator_Type
-- Directly_Designated_Type (Node20)
-- (plus type attributes)
-- E_Anonymous_Access_Type
-- Storage_Size_Variable (Node15) ??? is this needed ???
-- Directly_Designated_Type (Node20)
-- (plus type attributes)
-- E_Array_Type
-- E_Array_Subtype
-- First_Index (Node17)
-- Related_Array_Object (Node19)
-- Component_Type (Node20) (base type only)
-- Component_Size (Uint22) (base type only)
-- Packed_Array_Type (Node23)
-- Component_Alignment (special) (base type only)
-- Has_Component_Size_Clause (Flag68) (base type only)
-- Has_Controlled_Component (Flag43) (base type only)
-- Has_Pragma_Pack (Flag121) (base type only)
-- Is_Aliased (Flag15)
-- Is_Constrained (Flag12)
-- Next_Index (synth)
-- Number_Dimensions (synth)
-- (plus type attributes)
-- E_Block
-- Block_Node (Node11)
-- First_Entity (Node17)
-- Last_Entity (Node20)
-- Delay_Cleanups (Flag114)
-- Discard_Names (Flag88)
-- Finalization_Chain_Entity (Node19)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Entry_Cancel_Parameter (Node23)
-- Has_Master_Entity (Flag21)
-- Has_Nested_Block_With_Handler (Flag101)
-- Sec_Stack_Needed_For_Return (Flag167)
-- Uses_Sec_Stack (Flag95)
-- E_Class_Wide_Type
-- E_Class_Wide_Subtype
-- Cloned_Subtype (Node16) (subtype case only)
-- First_Entity (Node17)
-- Equivalent_Type (Node18) (always Empty in type case)
-- Last_Entity (Node20)
-- Has_Controlled_Component (Flag43) (base type only)
-- First_Component (synth)
-- (plus type attributes)
-- E_Component
-- Normalized_First_Bit (Uint8)
-- Normalized_Position (Uint9)
-- Normalized_Position_Max (Uint10)
-- Component_Bit_Offset (Uint11)
-- Esize (Uint12)
-- Component_Clause (Node13)
-- DT_Entry_Count (Uint15)
-- Entry_Formal (Node16)
-- Prival (Node17)
-- Renamed_Object (Node18) (always Empty)
-- Discriminant_Checking_Func (Node20)
-- Interface_Name (Node21) (JGNAT usage only)
-- Original_Record_Component (Node22)
-- Protected_Operation (Node23)
-- Has_Biased_Representation (Flag139)
-- Has_Per_Object_Constraint (Flag154)
-- Is_Atomic (Flag85)
-- Is_Tag (Flag78)
-- Is_Volatile (Flag16)
-- Next_Component (synth)
-- Is_Protected_Private (synth)
-- E_Constant
-- E_Loop_Parameter
-- Size_Check_Code (Node9)
-- Discriminal_Link (Node10) (discriminals only)
-- Full_View (Node11)
-- Esize (Uint12)
-- Alignment (Uint14)
-- Actual_Subtype (Node17)
-- Renamed_Object (Node18)
-- Interface_Name (Node21)
-- Has_Alignment_Clause (Flag46)
-- Has_Atomic_Components (Flag86)
-- Has_Biased_Representation (Flag139)
-- Has_Size_Clause (Flag29)
-- Has_Volatile_Components (Flag87)
-- Is_Atomic (Flag85)
-- Is_Eliminated (Flag124)
-- Is_Psected (Flag153)
-- Is_True_Constant (Flag163)
-- Is_Volatile (Flag16)
-- Not_Source_Assigned (Flag115)
-- Address_Clause (synth)
-- Alignment_Clause (synth)
-- Constant_Value (synth)
-- Size_Clause (synth)
-- E_Decimal_Fixed_Point_Type
-- E_Decimal_Fixed_Subtype
-- Scale_Value (Uint15)
-- Digits_Value (Uint17)
-- Scalar_Range (Node20)
-- Delta_Value (Ureal18)
-- Small_Value (Ureal21)
-- Has_Machine_Radix_Clause (Flag83)
-- Machine_Radix_10 (Flag84)
-- Type_Low_Bound (synth)
-- Type_High_Bound (synth)
-- (plus type attributes)
-- E_Discriminant
-- Normalized_First_Bit (Uint8)
-- Normalized_Position (Uint9)
-- Normalized_Position_Max (Uint10)
-- Component_Bit_Offset (Uint11)
-- Esize (Uint12)
-- Component_Clause (Node13)
-- Discriminant_Number (Uint15)
-- Discriminal (Node17)
-- Renamed_Object (Node18) (always Empty)
-- Corresponding_Discriminant (Node19)
-- Discriminant_Default_Value (Node20)
-- Interface_Name (Node21) (JGNAT usage only)
-- Original_Record_Component (Node22)
-- CR_Discriminant (Node23)
-- Next_Discriminant (synth)
-- Next_Girder_Discriminant (synth)
-- E_Entry
-- E_Entry_Family
-- Protected_Body_Subprogram (Node11)
-- Barrier_Function (Node12)
-- Entry_Parameters_Type (Node15)
-- First_Entity (Node17)
-- Alias (Node18) (Entry only. Always empty)
-- Finalization_Chain_Entity (Node19)
-- Last_Entity (Node20)
-- Accept_Address (Elist21)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Privals_Chain (Elist23) (for a protected entry)
-- Default_Expressions_Processed (Flag108)
-- Entry_Accepted (Flag152)
-- Is_AST_Entry (Flag132) (for entry only)
-- Needs_No_Actuals (Flag22)
-- Sec_Stack_Needed_For_Return (Flag167)
-- Uses_Sec_Stack (Flag95)
-- Address_Clause (synth)
-- First_Formal (synth)
-- Entry_Index_Type (synth)
-- Number_Formals (synth)
-- E_Entry_Index_Parameter
-- Entry_Index_Constant (Node18)
-- E_Enumeration_Literal
-- Enumeration_Pos (Uint11)
-- Enumeration_Rep (Uint12)
-- Debug_Renaming_Link (Node13)
-- Alias (Node18)
-- Enumeration_Rep_Expr (Node22)
-- Next_Literal (synth)
-- E_Enumeration_Type
-- E_Enumeration_Subtype
-- Lit_Indexes (Node15) (root type only)
-- Lit_Strings (Node16) (root type only)
-- First_Literal (Node17)
-- Scalar_Range (Node20)
-- Enum_Pos_To_Rep (Node23) (type only, not subtype)
-- Has_Biased_Representation (Flag139)
-- Has_Enumeration_Rep_Clause (Flag66)
-- Nonzero_Is_True (Flag162) (base type only)
-- Type_Low_Bound (synth)
-- Type_High_Bound (synth)
-- (plus type attributes)
-- E_Exception
-- Renamed_Entity (Node18)
-- Register_Exception_Call (Node20)
-- Interface_Name (Node21)
-- Exception_Code (Uint22)
-- Discard_Names (Flag88)
-- Is_VMS_Exception (Flag133)
-- E_Exception_Type
-- Equivalent_Type (Node18)
-- (plus type attributes)
-- E_Floating_Point_Type
-- E_Floating_Point_Subtype
-- Digits_Value (Uint17)
-- Type_Low_Bound (synth)
-- Scalar_Range (Node20)
-- Type_High_Bound (synth)
-- (plus type attributes)
-- E_Function
-- E_Generic_Function
-- Mechanism (Uint8) (returns Mechanism_Type)
-- Renaming_Map (Uint9)
-- Handler_Records (List10) (non-generic case only)
-- Protected_Body_Subprogram (Node11)
-- Next_Inlined_Subprogram (Node12)
-- Corresponding_Equality (Node13) (implicit /= only)
-- Elaboration_Entity (Node13) (all other cases)
-- First_Optional_Parameter (Node14) (non-generic case only)
-- DT_Position (Uint15)
-- DTC_Entity (Node16)
-- First_Entity (Node17)
-- Alias (Node18) (non-generic case only)
-- Renamed_Entity (Node18) (generic case only)
-- Finalization_Chain_Entity (Node19)
-- Last_Entity (Node20)
-- Interface_Name (Node21)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Generic_Renamings (Elist23) (for an instance)
-- Inner_Instances (Elist23) (for a generic function)
-- Privals_Chain (Elist23) (for a protected function)
-- Elaboration_Entity_Required (Flag174)
-- Function_Returns_With_DSP (Flag169)
-- Default_Expressions_Processed (Flag108)
-- Delay_Cleanups (Flag114)
-- Delay_Subprogram_Descriptors (Flag50)
-- Discard_Names (Flag88)
-- Elaborate_All_Desirable (Flag146)
-- Has_Completion (Flag26)
-- Has_Controlling_Result (Flag98)
-- Has_Master_Entity (Flag21)
-- Has_Missing_Return (Flag142)
-- Has_Nested_Block_With_Handler (Flag101)
-- Has_Pragma_Pure_Function (Flag179) (non-generic case only)
-- Has_Recursive_Call (Flag143)
-- Has_Subprogram_Descriptor (Flag93)
-- Is_Abstract (Flag19)
-- Is_Called (Flag102) (non-generic case only)
-- Is_Constructor (Flag76)
-- Is_Destructor (Flag77)
-- Is_Discrim_SO_Function (Flag176)
-- Is_Eliminated (Flag124)
-- Is_Instantiated (Flag126) (generic case only)
-- Is_Intrinsic_Subprogram (Flag64)
-- Is_Machine_Code_Subprogram (Flag137) (non-generic case only)
-- Is_Private_Descendant (Flag53)
-- Is_Pure (Flag44)
-- Is_Visible_Child_Unit (Flag116)
-- Needs_No_Actuals (Flag22)
-- Return_Present (Flag54)
-- Returns_By_Ref (Flag90)
-- Sec_Stack_Needed_For_Return (Flag167)
-- Uses_Sec_Stack (Flag95)
-- Address_Clause (synth)
-- First_Formal (synth)
-- Number_Formals (synth)
-- E_General_Access_Type
-- Storage_Size_Variable (Node15) (base type only)
-- Master_Id (Node17)
-- Directly_Designated_Type (Node20)
-- Associated_Storage_Pool (Node22)
-- Associated_Final_Chain (Node23)
-- (plus type attributes)
-- E_Generic_In_Parameter
-- E_Generic_In_Out_Parameter
-- Entry_Component (Node11)
-- Actual_Subtype (Node17)
-- Renamed_Object (Node18) (always Empty)
-- Default_Value (Node20)
-- Protected_Formal (Node22)
-- Is_Controlling_Formal (Flag97)
-- Is_Entry_Formal (Flag52)
-- Parameter_Mode (synth)
-- E_Incomplete_Type
-- Private_Dependents (Elist18)
-- Discriminant_Constraint (Elist21)
-- Girder_Constraint (Elist23)
-- First_Discriminant (synth)
-- First_Girder_Discriminant (synth)
-- (plus type attributes)
-- E_In_Parameter
-- E_In_Out_Parameter
-- E_Out_Parameter
-- Mechanism (Uint8) (returns Mechanism_Type)
-- Discriminal_Link (Node10) (discriminals only)
-- Entry_Component (Node11)
-- Esize (Uint12)
-- Extra_Accessibility (Node13)
-- Alignment (Uint14)
-- Extra_Formal (Node15)
-- Unset_Reference (Node16)
-- Actual_Subtype (Node17)
-- Renamed_Object (Node18)
-- Spec_Entity (Node19)
-- Default_Value (Node20)
-- Default_Expr_Function (Node21)
-- Protected_Formal (Node22)
-- Extra_Constrained (Node23)
-- Is_Controlling_Formal (Flag97)
-- Is_Entry_Formal (Flag52)
-- Is_Optional_Parameter (Flag134)
-- Not_Source_Assigned (Flag115)
-- Parameter_Mode (synth)
-- E_Label
-- Enclosing_Scope (Node18)
-- Reachable (Flag49)
-- E_Limited_Private_Type
-- E_Limited_Private_Subtype
-- First_Entity (Node17)
-- Private_Dependents (Elist18)
-- Underlying_Full_View (Node19)
-- Last_Entity (Node20)
-- Discriminant_Constraint (Elist21)
-- Private_View (Node22)
-- Girder_Constraint (Elist23)
-- Has_Completion (Flag26)
-- Has_Completion_In_Body (Flag71)
-- First_Discriminant (synth)
-- First_Girder_Discriminant (synth)
-- (plus type attributes)
-- E_Loop
-- Has_Exit (Flag47)
-- Has_Master_Entity (Flag21)
-- Has_Nested_Block_With_Handler (Flag101)
-- E_Modular_Integer_Type
-- E_Modular_Integer_Subtype
-- Modulus (Uint17) (base type only)
-- Scalar_Range (Node20)
-- Non_Binary_Modulus (Flag58) (base type only)
-- Has_Biased_Representation (Flag139)
-- Type_Low_Bound (synth)
-- Type_High_Bound (synth)
-- (plus type attributes)
-- E_Named_Integer
-- Constant_Value (synth)
-- E_Named_Real
-- Constant_Value (synth)
-- E_Operator
-- First_Entity (Node17)
-- Alias (Node18)
-- Last_Entity (Node20)
-- Is_Machine_Code_Subprogram (Flag137)
-- Is_Pure (Flag44)
-- Is_Intrinsic_Subprogram (Flag64)
-- Default_Expressions_Processed (Flag108)
-- Has_Pragma_Pure_Function (Flag179)
-- E_Ordinary_Fixed_Point_Type
-- E_Ordinary_Fixed_Point_Subtype
-- Delta_Value (Ureal18)
-- Scalar_Range (Node20)
-- Small_Value (Ureal21)
-- Has_Small_Clause (Flag67)
-- Type_Low_Bound (synth)
-- Type_High_Bound (synth)
-- (plus type attributes)
-- E_Package
-- E_Generic_Package
-- Dependent_Instances (Elist8) (for an instance)
-- Renaming_Map (Uint9)
-- Handler_Records (List10) (non-generic case only)
-- Associated_Formal_Package (Node12)
-- Elaboration_Entity (Node13)
-- Shadow_Entities (List14)
-- Related_Instance (Node15) (non-generic case only)
-- First_Private_Entity (Node16)
-- First_Entity (Node17)
-- Renamed_Entity (Node18)
-- Body_Entity (Node19)
-- Last_Entity (Node20)
-- Interface_Name (Node21)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Generic_Renamings (Elist23) (for an instance)
-- Inner_Instances (Elist23) (generic case only)
-- Delay_Subprogram_Descriptors (Flag50)
-- Discard_Names (Flag88)
-- Elaborate_All_Desirable (Flag146)
-- Elaboration_Entity_Required (Flag174)
-- From_With_Type (Flag159)
-- Has_All_Calls_Remote (Flag79)
-- Has_Completion (Flag26)
-- Has_Forward_Instantiation (Flag175)
-- Has_Master_Entity (Flag21)
-- Has_Subprogram_Descriptor (Flag93)
-- In_Package_Body (Flag48)
-- In_Private_Part (Flag45)
-- In_Use (Flag8)
-- Is_Instantiated (Flag126)
-- Is_Private_Descendant (Flag53)
-- Is_Visible_Child_Unit (Flag116)
-- Is_Wrapper_Package (synth) (non-generic case only)
-- E_Package_Body
-- Handler_Records (List10) (non-generic case only)
-- First_Entity (Node17)
-- Spec_Entity (Node19)
-- Last_Entity (Node20)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Delay_Subprogram_Descriptors (Flag50)
-- Has_Subprogram_Descriptor (Flag93)
-- E_Private_Type
-- E_Private_Subtype
-- Primitive_Operations (Elist15)
-- First_Entity (Node17)
-- Private_Dependents (Elist18)
-- Underlying_Full_View (Node19)
-- Last_Entity (Node20)
-- Discriminant_Constraint (Elist21)
-- Private_View (Node22)
-- Girder_Constraint (Elist23)
-- Has_Completion (Flag26)
-- Has_Completion_In_Body (Flag71)
-- Is_Controlled (Flag42) (base type only)
-- Is_For_Access_Subtype (Flag118) (subtype only)
-- First_Discriminant (synth)
-- First_Girder_Discriminant (synth)
-- (plus type attributes)
-- E_Procedure
-- E_Generic_Procedure
-- Renaming_Map (Uint9)
-- Handler_Records (List10) (non-generic case only)
-- Protected_Body_Subprogram (Node11)
-- Next_Inlined_Subprogram (Node12)
-- Elaboration_Entity (Node13)
-- First_Optional_Parameter (Node14) (non-generic case only)
-- DT_Position (Uint15)
-- DTC_Entity (Node16)
-- First_Entity (Node17)
-- Alias (Node18) (non-generic case only)
-- Renamed_Entity (Node18) (generic case only)
-- Finalization_Chain_Entity (Node19)
-- Last_Entity (Node20)
-- Interface_Name (Node21)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Generic_Renamings (Elist23) (for an instance)
-- Inner_Instances (Elist23) (for a generic procedure)
-- Privals_Chain (Elist23) (for a protected procedure)
-- Elaboration_Entity_Required (Flag174)
-- Function_Returns_With_DSP (Flag169) (always False for procedure)
-- Default_Expressions_Processed (Flag108)
-- Delay_Cleanups (Flag114)
-- Delay_Subprogram_Descriptors (Flag50)
-- Discard_Names (Flag88)
-- Elaborate_All_Desirable (Flag146)
-- Has_Completion (Flag26)
-- Has_Master_Entity (Flag21)
-- Has_Nested_Block_With_Handler (Flag101)
-- Has_Pragma_Pure_Function (Flag179) (non-generic case only)
-- Has_Subprogram_Descriptor (Flag93)
-- Is_Visible_Child_Unit (Flag116)
-- Is_Abstract (Flag19)
-- Is_Asynchronous (Flag81)
-- Is_Called (Flag102) (non-generic subprogram)
-- Is_Constructor (Flag76)
-- Is_Destructor (Flag77)
-- Is_Eliminated (Flag124)
-- Is_Instantiated (Flag126) (generic case only)
-- Is_Interrupt_Handler (Flag89)
-- Is_Intrinsic_Subprogram (Flag64)
-- Is_Machine_Code_Subprogram (Flag137) (non-generic case only)
-- Is_Null_Init_Proc (Flag178)
-- Is_Private_Descendant (Flag53)
-- Is_Pure (Flag44)
-- Is_Valued_Procedure (Flag127)
-- Is_Visible_Child_Unit (Flag116)
-- Needs_No_Actuals (Flag22)
-- No_Return (Flag113)
-- Sec_Stack_Needed_For_Return (Flag167)
-- Address_Clause (synth)
-- First_Formal (synth)
-- Number_Formals (synth)
-- E_Protected_Body
-- Object_Ref (Node17)
-- (any others??? First/Last Entity, Scope_Depth???)
-- E_Protected_Object
-- E_Protected_Type
-- E_Protected_Subtype
-- Entry_Bodies_Array (Node15)
-- First_Private_Entity (Node16)
-- First_Entity (Node17)
-- Corresponding_Record_Type (Node18)
-- Finalization_Chain_Entity (Node19)
-- Last_Entity (Node20)
-- Discriminant_Constraint (Elist21)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Girder_Constraint (Elist23)
-- Has_Controlled_Component (Flag43) (base type only)
-- Has_Interrupt_Handler (synth)
-- Sec_Stack_Needed_For_Return (Flag167) ???
-- Uses_Sec_Stack (Flag95) ???
-- Has_Entries (synth)
-- Number_Entries (synth)
-- E_Record_Type
-- E_Record_Subtype
-- Primitive_Operations (Elist15)
-- Access_Disp_Table (Node16) (base type only)
-- Cloned_Subtype (Node16) (subtype case only)
-- First_Entity (Node17)
-- Corresponding_Concurrent_Type (Node18)
-- Parent_Subtype (Node19)
-- Last_Entity (Node20)
-- Discriminant_Constraint (Elist21)
-- Corresponding_Remote_Type (Node22) (base type only)
-- Girder_Constraint (Elist23)
-- Component_Alignment (special) (base type only)
-- C_Pass_By_Copy (Flag125) (base type only)
-- Has_Controlled_Component (Flag43) (base type only)
-- Has_External_Tag_Rep_Clause (Flag110)
-- Has_Record_Rep_Clause (Flag65)
-- Is_Concurrent_Record_Type (Flag20)
-- Is_Constrained (Flag12)
-- Is_Controlled (Flag42) (base type only)
-- Reverse_Bit_Order (Flag164) (base type only)
-- First_Component (synth)
-- First_Discriminant (synth)
-- First_Girder_Discriminant (synth)
-- Tag_Component (synth)
-- (plus type attributes)
-- E_Record_Type_With_Private
-- E_Record_Subtype_With_Private
-- Primitive_Operations (Elist15)
-- Access_Disp_Table (Node16) (base type only)
-- First_Entity (Node17)
-- Private_Dependents (Elist18)
-- Underlying_Full_View (Node19)
-- Last_Entity (Node20)
-- Discriminant_Constraint (Elist21)
-- Private_View (Node22)
-- Girder_Constraint (Elist23)
-- Has_Completion (Flag26)
-- Has_Completion_In_Body (Flag71)
-- Has_Controlled_Component (Flag43) (base type only)
-- Has_Record_Rep_Clause (Flag65)
-- Has_External_Tag_Rep_Clause (Flag110)
-- Is_Concurrent_Record_Type (Flag20)
-- Is_Constrained (Flag12)
-- Is_Controlled (Flag42) (base type only)
-- Reverse_Bit_Order (Flag164) (base type only)
-- First_Component (synth)
-- First_Discriminant (synth)
-- First_Girder_Discriminant (synth)
-- Tag_Component (synth)
-- (plus type attributes)
-- E_Signed_Integer_Type
-- E_Signed_Integer_Subtype
-- Scalar_Range (Node20)
-- Has_Biased_Representation (Flag139)
-- Type_Low_Bound (synth)
-- Type_High_Bound (synth)
-- (plus type attributes)
-- E_String_Type
-- E_String_Subtype
-- First_Index (Node17)
-- Component_Type (Node20) (base type only)
-- Is_Constrained (Flag12)
-- Next_Index (synth)
-- Number_Dimensions (synth)
-- (plus type attributes)
-- E_String_Literal_Subtype
-- String_Literal_Low_Bound (Node15)
-- String_Literal_Length (Uint16)
-- First_Index (Node17) (always Empty)
-- Component_Type (Node20) (base type only)
-- Packed_Array_Type (Node23)
-- (plus type attributes)
-- E_Subprogram_Body
-- First_Entity (Node17)
-- Last_Entity (Node20)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- E_Subprogram_Type
-- Directly_Designated_Type (Node20)
-- First_Formal (synth)
-- Number_Formals (synth)
-- Function_Returns_With_DSP (Flag169)
-- (plus type attributes)
-- E_Task_Body
-- (any others??? First/Last Entity, Scope_Depth???)
-- E_Task_Type
-- E_Task_Subtype
-- Storage_Size_Variable (Node15) (base type only)
-- First_Private_Entity (Node16)
-- First_Entity (Node17)
-- Corresponding_Record_Type (Node18)
-- Finalization_Chain_Entity (Node19)
-- Last_Entity (Node20)
-- Discriminant_Constraint (Elist21)
-- Scope_Depth_Value (Uint22)
-- Scope_Depth (synth)
-- Girder_Constraint (Elist23)
-- Delay_Cleanups (Flag114)
-- Has_Master_Entity (Flag21)
-- Has_Storage_Size_Clause (Flag23) (base type only)
-- Uses_Sec_Stack (Flag95) ???
-- Sec_Stack_Needed_For_Return (Flag167) ???
-- Has_Entries (synth)
-- Number_Entries (synth)
-- (plus type attributes)
-- E_Variable
-- Hiding_Loop_Variable (Node8)
-- Size_Check_Code (Node9)
-- Esize (Uint12)
-- Extra_Accessibility (Node13)
-- Alignment (Uint14)
-- Shared_Var_Read_Proc (Node15)
-- Unset_Reference (Node16)
-- Actual_Subtype (Node17)
-- Renamed_Object (Node18)
-- Interface_Name (Node21)
-- Shared_Var_Assign_Proc (Node22)
-- Extra_Constrained (Node23)
-- Has_Alignment_Clause (Flag46)
-- Has_Atomic_Components (Flag86)
-- Has_Biased_Representation (Flag139)
-- Has_Size_Clause (Flag29)
-- Has_Volatile_Components (Flag87)
-- Is_Atomic (Flag85)
-- Is_Eliminated (Flag124)
-- Is_Psected (Flag153)
-- Is_Shared_Passive (Flag60)
-- Is_True_Constant (Flag163)
-- Is_Volatile (Flag16)
-- Not_Source_Assigned (Flag115)
-- Address_Clause (synth)
-- Alignment_Clause (synth)
-- Size_Clause (synth)
-- E_Void
-- Since E_Void is the initial Ekind value of an entity when it is first
-- created, one might expect that no attributes would be defined on such
-- an entity until its Ekind field is set. However, in practice, there
-- are many instances in which fields of an E_Void entity are set in the
-- code prior to setting the Ekind field. This is not well documented or
-- well controlled, and needs cleaning up later. Meanwhile, the access
-- procedures in the body of Einfo permit many, but not all, attributes
-- to be applied to an E_Void entity, precisely so that this kind of
-- pre-setting of attributes works. This is really a hole in the dynamic
-- type checking, since there is no assurance that the eventual Ekind
-- value will be appropriate for the attributes set, and the consequence
-- is that the dynamic type checking in the Einfo body is unnecessarily
-- weak. To be looked at systematically some time ???
---------------------------------
-- Component_Alignment Control --
---------------------------------
-- There are four types of alignment possible for array and record
-- types, and a field in the type entities contains a value of the
-- following type indicating which alignment choice applies. For full
-- details of the meaning of these aligment types, see description
-- of the Component_Alignment pragma
type Component_Alignment_Kind is (
Calign_Default, -- default alignment
Calign_Component_Size, -- natural alignment for component size
Calign_Component_Size_4, -- natural for size <= 4, 4 for size >= 4
Calign_Storage_Unit); -- all components byte aligned
---------------
-- Iterators --
---------------
-- In addition to attributes that are stored as plain data, other
-- attributes are procedural, and require some small amount of
-- computation. Of course, from the point of view of a user of this
-- package, the distinction is not visible (even the field information
-- provided below should be disregarded, as it is subject to change
-- without notice!). A number of attributes appear as lists: lists of
-- formals, lists of actuals, of discriminants, etc. For these, pairs
-- of functions are defined, which take the form:
-- function First_Thing (E : Enclosing_Construct) return Thing;
-- function Next_Thing (T : Thing) return Thing;
-- The end of iteration is always signaled by a value of Empty, so that
-- loops over these chains invariably have the form:
-- This : Thing;
-- ...
-- This := First_Thing (E);
-- while Present (This) loop
-- Do_Something_With (This);
-- ...
-- This := Next_Thing (This);
-- end loop;
-----------------------------------
-- Handling of Check Suppression --
-----------------------------------
-- There are three ways that checks can be suppressed:
-- 1. At the command line level. Package Opt contains global Boolean
-- flags with names Suppress_Options.xxx_Checks, where xxx is the
-- name of one of the checks that can be suppressed (excluding
-- All_Checks, which is simply reflected by setting all the
-- individual flags)
-- 2. At the scope level. The body of Sem contains flags with names
-- Suppress.xxx_Checks which are set to indicate that the given
-- check is suppressed for the current scope. These flags are
-- saved in the scope stack on entry to a scope and restored on
-- exit from the scope.
-- 3. At the entity level. Each entity contains a set of flags named
-- Suppress_xxx_Checks which suppress the given check for that
-- particularly entity (of course not all flags are meaningful for
-- all entities).
-------------------------------
-- Handling of Discriminants --
-------------------------------
-- During semantic processing, discriminants are separate entities which
-- reflect the semantic properties and allowed usage of discriminants in
-- the language.
-- In the case of discriminants used as bounds, the references are handled
-- directly, since special processing is needed in any case. However, there
-- are two circumstances in which discriminants are referenced in a quite
-- general manner, like any other variables:
-- In initialization expressions for records. Note that the expressions
-- used in Priority, Storage_Size, and Task_Info pragmas are effectively
-- in this category, since these pragmas are converted to initialized
-- record fields in the Corresponding_Record_Type.
-- In task and protected bodies, where the discriminant values may be
-- referenced freely within these bodies. Discriminants can also appear
-- in bounds of entry families and in defaults of operations.
-- In both these cases, the discriminants must be treated essentially as
-- objects. The following approach is used to simplify and minimize the
-- special processing that is required.
-- When a record type with discriminants is processed, the semantic
-- processing creates the entities for the discriminants. It also creates
-- an additional set of entities, called discriminals, one for each of
-- the discriminants, and the Discriminal field of the discriminant entity
-- points to this additional entity, which is initially created as an
-- uninitialized (E_Void) entity.
-- During expansion of expressions, any discriminant reference is replaced
-- by a reference to the corresponding discriminal. When the initialization
-- procedure for the record is created (there will always be one, since
-- discriminants are present, see Exp_Ch3 for further details), the
-- discriminals are used as the entities for the formal parameters of
-- this initialization procedure. The references to these discriminants
-- have already been replaced by references to these discriminals, which
-- are now the formal parameters corresponding to the required objects.
-- In the case of a task or protected body, the semantics similarly
-- creates a set of discriminals for the discriminants of the task or
-- protected type. When the procedure is created for the task body,
-- the parameter passed in is a reference to the task value type, which
-- contains the required discriminant values. The expander creates a
-- set of declarations of the form:
-- discriminal : constant dtype renames _Task.discriminant;
-- where discriminal is the discriminal entity referenced by the task
-- discriminant, and _Task is the task value passed in as the parameter.
-- Again, any references to discriminants in the task body have been
-- replaced by the discriminal reference, which is now an object that
-- contains the required value.
-- This approach for tasks means that two sets of discriminals are needed
-- for a task type, one for the initialization procedure, and one for the
-- task body. This works out nicely, since the semantics allocates one set
-- for the task itself, and one set for the corresponding record.
-- The one bit of trickiness arises in making sure that the right set of
-- discriminals is used at the right time. First the task definition is
-- processed. Any references to discriminants here are replaced by the
-- the corresponding *task* discriminals (the record type doesn't even
-- exist yet, since it is constructed as part of the expansion of the
-- task declaration, which happens after the semantic processing of the
-- task definition). The discriminants to be used for the corresponding
-- record are created at the same time as the other discriminals, and
-- held in the CR_Discriminant field of the discriminant. A use of the
-- discriminant in a bound for an entry family is replaced with the CR_
-- discriminant because it controls the bound of the entry queue array
-- which is a component of the corresponding record.
-- Just before the record initialization routine is constructed, the
-- expander exchanges the task and record discriminals. This has two
-- effects. First the generation of the record initialization routine
-- uses the discriminals that are now on the record, which is the set
-- that used to be on the task, which is what we want.
-- Second, a new set of (so far unused) discriminals is now on the task
-- discriminants, and it is this set that will be used for expanding the
-- task body, and also for the discriminal declarations at the start of
-- the task body.
---------------------------------------
-- Private data in protected objects --
---------------------------------------
-- Private object declarations in protected types pose problems
-- similar to those of discriminants. They are expanded to components
-- of a record which is passed as the parameter "_object" to expanded
-- forms of all protected operations. As with discriminants, timing
-- of this expansion is a problem. The sequence of statements for a
-- protected operation is expanded before the operation itself, so the
-- formal parameter for the record object containing the private data
-- does not exist when the references to that data are expanded.
-- For this reason, private data is handled in the same way as
-- discriminants, expanding references to private data in protected
-- operations (which appear as components) to placeholders which will
-- eventually become renamings of the private selected components
-- of the "_object" formal parameter. These placeholders are called
-- "privals", by analogy to the "discriminals" used to implement
-- discriminants. They are attached to the component declaration nodes
-- representing the private object declarations of the protected type.
-- As with discriminals, each protected subprogram needs a unique set
-- of privals, since they must refer to renamings of components of a
-- formal parameter of that operation. Entry bodies need another set,
-- which they all share and which is associated with renamings in the
-- Service_Entries procedure for the protected type (this is not yet
-- implemented???). This means that we must associate a new set of
-- privals (and discriminals) with the private declarations after
-- the body of a protected subprogram is processed.
-- The last complication is the presence of discriminants and discriminated
-- components. In the corresponding record, the components are constrained
-- by the discriminants of the record, but within each protected operation
-- they are constrained by the discriminants of the actual. The actual
-- subtypes of those components are constructed as for other unconstrained
-- formals, but the privals are created before the formal object is added
-- to the parameter list of the protected operation, so they carry the
-- nominal subtype of the original component. After the protected operation
-- is actually created (in the expansion of the protected body) we must
-- patch the types of each prival occurrence with the proper actual subtype
-- which is by now set. The Privals_Chain is used for this patching.
-------------------
-- Type Synonyms --
-------------------
-- The following type synonyms are used to tidy up the function and
-- procedure declarations that follow, and also to make it possible
-- to meet the requirement for the XEINFO utility that all function
-- specs must fit on a single source line.
subtype B is Boolean;
subtype C is Component_Alignment_Kind;
subtype E is Entity_Id;
subtype M is Mechanism_Type;
subtype N is Node_Id;
subtype U is Uint;
subtype R is Ureal;
subtype L is Elist_Id;
subtype S is List_Id;
---------------------------------
-- Attribute Access Functions --
---------------------------------
-- All attributes are manipulated through a procedural interface. This
-- section contains the functions used to obtain attribute values which
-- correspond to values in fields or flags in the entity itself.
function Accept_Address (Id : E) return L;
function Access_Disp_Table (Id : E) return E;
function Actual_Subtype (Id : E) return E;
function Address_Taken (Id : E) return B;
function Alias (Id : E) return E;
function Alignment (Id : E) return U;
function Associated_Final_Chain (Id : E) return E;
function Associated_Formal_Package (Id : E) return E;
function Associated_Node_For_Itype (Id : E) return N;
function Associated_Storage_Pool (Id : E) return E;
function Barrier_Function (Id : E) return N;
function Block_Node (Id : E) return N;
function Body_Entity (Id : E) return E;
function CR_Discriminant (Id : E) return E;
function C_Pass_By_Copy (Id : E) return B;
function Class_Wide_Type (Id : E) return E;
function Cloned_Subtype (Id : E) return E;
function Component_Alignment (Id : E) return C;
function Component_Clause (Id : E) return N;
function Component_Bit_Offset (Id : E) return U;
function Component_Size (Id : E) return U;
function Component_Type (Id : E) return E;
function Corresponding_Concurrent_Type (Id : E) return E;
function Corresponding_Discriminant (Id : E) return E;
function Corresponding_Equality (Id : E) return E;
function Corresponding_Record_Type (Id : E) return E;
function Corresponding_Remote_Type (Id : E) return E;
function Debug_Info_Off (Id : E) return B;
function Debug_Renaming_Link (Id : E) return E;
function DTC_Entity (Id : E) return E;
function DT_Entry_Count (Id : E) return U;
function DT_Position (Id : E) return U;
function Default_Expr_Function (Id : E) return E;
function Default_Expressions_Processed (Id : E) return B;
function Default_Value (Id : E) return N;
function Delay_Cleanups (Id : E) return B;
function Delay_Subprogram_Descriptors (Id : E) return B;
function Delta_Value (Id : E) return R;
function Dependent_Instances (Id : E) return L;
function Depends_On_Private (Id : E) return B;
function Digits_Value (Id : E) return U;
function Directly_Designated_Type (Id : E) return E;
function Discard_Names (Id : E) return B;
function Discriminal (Id : E) return E;
function Discriminal_Link (Id : E) return E;
function Discriminant_Checking_Func (Id : E) return E;
function Discriminant_Constraint (Id : E) return L;
function Discriminant_Default_Value (Id : E) return N;
function Discriminant_Number (Id : E) return U;
function Elaborate_All_Desirable (Id : E) return B;
function Elaboration_Entity (Id : E) return E;
function Elaboration_Entity_Required (Id : E) return B;
function Enclosing_Scope (Id : E) return E;
function Entry_Accepted (Id : E) return B;
function Entry_Bodies_Array (Id : E) return E;
function Entry_Cancel_Parameter (Id : E) return E;
function Entry_Component (Id : E) return E;
function Entry_Formal (Id : E) return E;
function Entry_Index_Constant (Id : E) return E;
function Entry_Index_Type (Id : E) return E;
function Entry_Parameters_Type (Id : E) return E;
function Enum_Pos_To_Rep (Id : E) return E;
function Enumeration_Pos (Id : E) return U;
function Enumeration_Rep (Id : E) return U;
function Enumeration_Rep_Expr (Id : E) return N;
function Equivalent_Type (Id : E) return E;
function Esize (Id : E) return U;
function Exception_Code (Id : E) return U;
function Extra_Accessibility (Id : E) return E;
function Extra_Constrained (Id : E) return E;
function Extra_Formal (Id : E) return E;
function Finalization_Chain_Entity (Id : E) return E;
function Finalize_Storage_Only (Id : E) return B;
function First_Entity (Id : E) return E;
function First_Index (Id : E) return N;
function First_Literal (Id : E) return E;
function First_Optional_Parameter (Id : E) return E;
function First_Private_Entity (Id : E) return E;
function First_Rep_Item (Id : E) return N;
function Freeze_Node (Id : E) return N;
function From_With_Type (Id : E) return B;
function Full_View (Id : E) return E;
function Function_Returns_With_DSP (Id : E) return B;
function Generic_Renamings (Id : E) return L;
function Girder_Constraint (Id : E) return L;
function Handler_Records (Id : E) return S;
function Has_Aliased_Components (Id : E) return B;
function Has_Alignment_Clause (Id : E) return B;
function Has_All_Calls_Remote (Id : E) return B;
function Has_Atomic_Components (Id : E) return B;
function Has_Biased_Representation (Id : E) return B;
function Has_Completion (Id : E) return B;
function Has_Completion_In_Body (Id : E) return B;
function Has_Complex_Representation (Id : E) return B;
function Has_Component_Size_Clause (Id : E) return B;
function Has_Controlled_Component (Id : E) return B;
function Has_Controlling_Result (Id : E) return B;
function Has_Convention_Pragma (Id : E) return B;
function Has_Delayed_Freeze (Id : E) return B;
function Has_Discriminants (Id : E) return B;
function Has_Enumeration_Rep_Clause (Id : E) return B;
function Has_Exit (Id : E) return B;
function Has_External_Tag_Rep_Clause (Id : E) return B;
function Has_Fully_Qualified_Name (Id : E) return B;
function Has_Gigi_Rep_Item (Id : E) return B;
function Has_Homonym (Id : E) return B;
function Has_Interrupt_Handler (Id : E) return B;
function Has_Machine_Radix_Clause (Id : E) return B;
function Has_Master_Entity (Id : E) return B;
function Has_Missing_Return (Id : E) return B;
function Has_Nested_Block_With_Handler (Id : E) return B;
function Has_Forward_Instantiation (Id : E) return B;
function Has_Non_Standard_Rep (Id : E) return B;
function Has_Object_Size_Clause (Id : E) return B;
function Has_Per_Object_Constraint (Id : E) return B;
function Has_Pragma_Controlled (Id : E) return B;
function Has_Pragma_Elaborate_Body (Id : E) return B;
function Has_Pragma_Inline (Id : E) return B;
function Has_Pragma_Pack (Id : E) return B;
function Has_Pragma_Pure_Function (Id : E) return B;
function Has_Primitive_Operations (Id : E) return B;
function Has_Qualified_Name (Id : E) return B;
function Has_Record_Rep_Clause (Id : E) return B;
function Has_Recursive_Call (Id : E) return B;
function Has_Size_Clause (Id : E) return B;
function Has_Small_Clause (Id : E) return B;
function Has_Specified_Layout (Id : E) return B;
function Has_Storage_Size_Clause (Id : E) return B;
function Has_Subprogram_Descriptor (Id : E) return B;
function Has_Task (Id : E) return B;
function Has_Unchecked_Union (Id : E) return B;
function Has_Unknown_Discriminants (Id : E) return B;
function Has_Volatile_Components (Id : E) return B;
function Homonym (Id : E) return E;
function Hiding_Loop_Variable (Id : E) return E;
function In_Package_Body (Id : E) return B;
function In_Private_Part (Id : E) return B;
function In_Use (Id : E) return B;
function Inner_Instances (Id : E) return L;
function Interface_Name (Id : E) return N;
function Is_AST_Entry (Id : E) return B;
function Is_Abstract (Id : E) return B;
function Is_Access_Constant (Id : E) return B;
function Is_Aliased (Id : E) return B;
function Is_Asynchronous (Id : E) return B;
function Is_Atomic (Id : E) return B;
function Is_Bit_Packed_Array (Id : E) return B;
function Is_CPP_Class (Id : E) return B;
function Is_Called (Id : E) return B;
function Is_Character_Type (Id : E) return B;
function Is_Child_Unit (Id : E) return B;
function Is_Compilation_Unit (Id : E) return B;
function Is_Completely_Hidden (Id : E) return B;
function Is_Constr_Subt_For_UN_Aliased (Id : E) return B;
function Is_Constr_Subt_For_U_Nominal (Id : E) return B;
function Is_Constrained (Id : E) return B;
function Is_Constructor (Id : E) return B;
function Is_Controlled (Id : E) return B;
function Is_Controlling_Formal (Id : E) return B;
function Is_Destructor (Id : E) return B;
function Is_Discrim_SO_Function (Id : E) return B;
function Is_Dispatching_Operation (Id : E) return B;
function Is_Eliminated (Id : E) return B;
function Is_Entry_Formal (Id : E) return B;
function Is_Exported (Id : E) return B;
function Is_First_Subtype (Id : E) return B;
function Is_For_Access_Subtype (Id : E) return B;
function Is_Frozen (Id : E) return B;
function Is_Generic_Instance (Id : E) return B;
function Is_Hidden (Id : E) return B;
function Is_Hidden_Open_Scope (Id : E) return B;
function Is_Immediately_Visible (Id : E) return B;
function Is_Imported (Id : E) return B;
function Is_Inlined (Id : E) return B;
function Is_Instantiated (Id : E) return B;
function Is_Internal (Id : E) return B;
function Is_Interrupt_Handler (Id : E) return B;
function Is_Intrinsic_Subprogram (Id : E) return B;
function Is_Itype (Id : E) return B;
function Is_Known_Valid (Id : E) return B;
function Is_Limited_Composite (Id : E) return B;
function Is_Machine_Code_Subprogram (Id : E) return B;
function Is_Non_Static_Subtype (Id : E) return B;
function Is_Null_Init_Proc (Id : E) return B;
function Is_Optional_Parameter (Id : E) return B;
function Is_Package_Body_Entity (Id : E) return B;
function Is_Packed (Id : E) return B;
function Is_Packed_Array_Type (Id : E) return B;
function Is_Potentially_Use_Visible (Id : E) return B;
function Is_Preelaborated (Id : E) return B;
function Is_Private_Composite (Id : E) return B;
function Is_Private_Descendant (Id : E) return B;
function Is_Psected (Id : E) return B;
function Is_Public (Id : E) return B;
function Is_Pure (Id : E) return B;
function Is_Remote_Call_Interface (Id : E) return B;
function Is_Remote_Types (Id : E) return B;
function Is_Renaming_Of_Object (Id : E) return B;
function Is_Shared_Passive (Id : E) return B;
function Is_Statically_Allocated (Id : E) return B;
function Is_Tag (Id : E) return B;
function Is_Tagged_Type (Id : E) return B;
function Is_True_Constant (Id : E) return B;
function Is_Unchecked_Union (Id : E) return B;
function Is_Unsigned_Type (Id : E) return B;
function Is_VMS_Exception (Id : E) return B;
function Is_Valued_Procedure (Id : E) return B;
function Is_Visible_Child_Unit (Id : E) return B;
function Is_Volatile (Id : E) return B;
function Is_Wrapper_Package (Id : E) return B;
function Last_Entity (Id : E) return E;
function Lit_Indexes (Id : E) return E;
function Lit_Strings (Id : E) return E;
function Machine_Radix_10 (Id : E) return B;
function Master_Id (Id : E) return E;
function Materialize_Entity (Id : E) return B;
function Mechanism (Id : E) return M;
function Modulus (Id : E) return U;
function Needs_Debug_Info (Id : E) return B;
function Needs_No_Actuals (Id : E) return B;
function Next_Inlined_Subprogram (Id : E) return E;
function No_Pool_Assigned (Id : E) return B;
function No_Return (Id : E) return B;
function Non_Binary_Modulus (Id : E) return B;
function Nonzero_Is_True (Id : E) return B;
function Normalized_First_Bit (Id : E) return U;
function Normalized_Position (Id : E) return U;
function Normalized_Position_Max (Id : E) return U;
function Not_Source_Assigned (Id : E) return B;
function Object_Ref (Id : E) return E;
function Original_Record_Component (Id : E) return E;
function Packed_Array_Type (Id : E) return E;
function Parent_Subtype (Id : E) return E;
function Primitive_Operations (Id : E) return L;
function Prival (Id : E) return E;
function Privals_Chain (Id : E) return L;
function Private_Dependents (Id : E) return L;
function Private_View (Id : E) return N;
function Protected_Body_Subprogram (Id : E) return E;
function Protected_Formal (Id : E) return E;
function Protected_Operation (Id : E) return E;
function RM_Size (Id : E) return U;
function Reachable (Id : E) return B;
function Referenced (Id : E) return B;
function Referenced_Object (Id : E) return N;
function Register_Exception_Call (Id : E) return N;
function Related_Array_Object (Id : E) return E;
function Related_Instance (Id : E) return E;
function Renamed_Entity (Id : E) return N;
function Renamed_Object (Id : E) return N;
function Renaming_Map (Id : E) return U;
function Return_Present (Id : E) return B;
function Returns_By_Ref (Id : E) return B;
function Reverse_Bit_Order (Id : E) return B;
function Scalar_Range (Id : E) return N;
function Scale_Value (Id : E) return U;
function Scope_Depth_Value (Id : E) return U;
function Sec_Stack_Needed_For_Return (Id : E) return B;
function Shadow_Entities (Id : E) return S;
function Shared_Var_Assign_Proc (Id : E) return E;
function Shared_Var_Read_Proc (Id : E) return E;
function Size_Check_Code (Id : E) return N;
function Size_Known_At_Compile_Time (Id : E) return B;
function Size_Depends_On_Discriminant (Id : E) return B;
function Small_Value (Id : E) return R;
function Spec_Entity (Id : E) return E;
function Storage_Size_Variable (Id : E) return E;
function Strict_Alignment (Id : E) return B;
function String_Literal_Length (Id : E) return U;
function String_Literal_Low_Bound (Id : E) return N;
function Suppress_Access_Checks (Id : E) return B;
function Suppress_Accessibility_Checks (Id : E) return B;
function Suppress_Discriminant_Checks (Id : E) return B;
function Suppress_Division_Checks (Id : E) return B;
function Suppress_Elaboration_Checks (Id : E) return B;
function Suppress_Elaboration_Warnings (Id : E) return B;
function Suppress_Index_Checks (Id : E) return B;
function Suppress_Init_Proc (Id : E) return B;
function Suppress_Length_Checks (Id : E) return B;
function Suppress_Overflow_Checks (Id : E) return B;
function Suppress_Range_Checks (Id : E) return B;
function Suppress_Storage_Checks (Id : E) return B;
function Suppress_Style_Checks (Id : E) return B;
function Suppress_Tag_Checks (Id : E) return B;
function Underlying_Full_View (Id : E) return E;
function Unset_Reference (Id : E) return N;
function Uses_Sec_Stack (Id : E) return B;
function Vax_Float (Id : E) return B;
function Warnings_Off (Id : E) return B;
-------------------------------
-- Classification Attributes --
-------------------------------
-- These functions provide a convenient functional notation for testing
-- whether an Ekind value belongs to a specified kind, for example the
-- function Is_Elementary_Type tests if its argument is in Elementary_Kind.
-- In some cases, the test is of an entity attribute (e.g. in the case of
-- Is_Generic_Type where the Ekind does not provide the needed information)
function Is_Access_Type (Id : E) return B;
function Is_Array_Type (Id : E) return B;
function Is_Class_Wide_Type (Id : E) return B;
function Is_Composite_Type (Id : E) return B;
function Is_Concurrent_Body (Id : E) return B;
function Is_Concurrent_Record_Type (Id : E) return B;
function Is_Concurrent_Type (Id : E) return B;
function Is_Decimal_Fixed_Point_Type (Id : E) return B;
function Is_Digits_Type (Id : E) return B;
function Is_Discrete_Or_Fixed_Point_Type (Id : E) return B;
function Is_Discrete_Type (Id : E) return B;
function Is_Elementary_Type (Id : E) return B;
function Is_Entry (Id : E) return B;
function Is_Enumeration_Type (Id : E) return B;
function Is_Fixed_Point_Type (Id : E) return B;
function Is_Floating_Point_Type (Id : E) return B;
function Is_Formal (Id : E) return B;
function Is_Formal_Subprogram (Id : E) return B;
function Is_Generic_Actual_Type (Id : E) return B;
function Is_Generic_Type (Id : E) return B;
function Is_Generic_Unit (Id : E) return B;
function Is_Incomplete_Or_Private_Type (Id : E) return B;
function Is_Integer_Type (Id : E) return B;
function Is_Limited_Record (Id : E) return B;
function Is_Modular_Integer_Type (Id : E) return B;
function Is_Named_Number (Id : E) return B;
function Is_Numeric_Type (Id : E) return B;
function Is_Object (Id : E) return B;
function Is_Ordinary_Fixed_Point_Type (Id : E) return B;
function Is_Overloadable (Id : E) return B;
function Is_Private_Type (Id : E) return B;
function Is_Protected_Type (Id : E) return B;
function Is_Real_Type (Id : E) return B;
function Is_Record_Type (Id : E) return B;
function Is_Scalar_Type (Id : E) return B;
function Is_Signed_Integer_Type (Id : E) return B;
function Is_Subprogram (Id : E) return B;
function Is_Task_Type (Id : E) return B;
function Is_Type (Id : E) return B;
-------------------------------------
-- Synthesized Attribute Functions --
-------------------------------------
-- The functions in this section synthesize attributes from the tree,
-- so they do not correspond to defined fields in the entity itself.
function Address_Clause (Id : E) return N;
function Alignment_Clause (Id : E) return N;
function Ancestor_Subtype (Id : E) return E;
function Base_Type (Id : E) return E;
function Constant_Value (Id : E) return N;
function Declaration_Node (Id : E) return N;
function Designated_Type (Id : E) return E;
function Enclosing_Dynamic_Scope (Id : E) return E;
function First_Component (Id : E) return E;
function First_Discriminant (Id : E) return E;
function First_Formal (Id : E) return E;
function First_Girder_Discriminant (Id : E) return E;
function First_Subtype (Id : E) return E;
function Has_Attach_Handler (Id : E) return B;
function Has_Entries (Id : E) return B;
function Has_Foreign_Convention (Id : E) return B;
function Has_Private_Ancestor (Id : E) return B;
function Has_Private_Declaration (Id : E) return B;
function Implementation_Base_Type (Id : E) return E;
function Is_Always_Inlined (Id : E) return B;
function Is_Boolean_Type (Id : E) return B;
function Is_By_Copy_Type (Id : E) return B;
function Is_By_Reference_Type (Id : E) return B;
function Is_Derived_Type (Id : E) return B;
function Is_Dynamic_Scope (Id : E) return B;
function Is_Indefinite_Subtype (Id : E) return B;
function Is_Limited_Type (Id : E) return B;
function Is_Package (Id : E) return B;
function Is_Protected_Private (Id : E) return B;
function Is_Protected_Record_Type (Id : E) return B;
function Is_Return_By_Reference_Type (Id : E) return B;
function Is_String_Type (Id : E) return B;
function Is_Task_Record_Type (Id : E) return B;
function Next_Component (Id : E) return E;
function Next_Discriminant (Id : E) return E;
function Next_Formal (Id : E) return E;
function Next_Formal_With_Extras (Id : E) return E;
function Next_Girder_Discriminant (Id : E) return E;
function Next_Literal (Id : E) return E;
function Number_Dimensions (Id : E) return Pos;
function Number_Discriminants (Id : E) return Pos;
function Number_Entries (Id : E) return Nat;
function Number_Formals (Id : E) return Pos;
function Parameter_Mode (Id : E) return Formal_Kind;
function Root_Type (Id : E) return E;
function Scope_Depth_Set (Id : E) return B;
function Size_Clause (Id : E) return N;
function Tag_Component (Id : E) return E;
function Type_High_Bound (Id : E) return N;
function Type_Low_Bound (Id : E) return N;
function Underlying_Type (Id : E) return E;
----------------------------------------------
-- Type Representation Attribute Predicates --
----------------------------------------------
-- These predicates test the setting of the indicated attribute. If
-- the value has been set, then Known is True, and Unknown is False.
-- If no value is set, then Known is False and Unknown is True. The
-- Known_Static predicate is true only if the value is set (Known)
-- and is set to a compile time known value. Note that in the case
-- of Alignment and Normalized_First_Bit, dynamic values are not
-- possible, so we do not need a separate Known_Static calls in
-- these cases. The not set (unknown values are as follows:
-- Alignment Uint_0
-- Component_Size Uint_0
-- Component_Bit_Offset No_Uint
-- Digits_Value Uint_0
-- Esize Uint_0
-- Normalized_First_Bit No_Uint
-- Normalized_Position No_Uint
-- Normalized_Position_Max No_Uint
-- RM_Size Uint_0
-- It would be cleaner to use No_Uint in all these cases, but historically
-- we chose to use Uint_0 at first, and the change over will take time ???
-- This is particularly true for the RM_Size field, where a value of zero
-- is legitimate. We deal with this by a nasty kludge that knows that the
-- value is always known static for discrete types (and no other types can
-- have an RM_Size value of zero).
function Known_Alignment (E : Entity_Id) return B;
function Known_Component_Bit_Offset (E : Entity_Id) return B;
function Known_Component_Size (E : Entity_Id) return B;
function Known_Esize (E : Entity_Id) return B;
function Known_Normalized_First_Bit (E : Entity_Id) return B;
function Known_Normalized_Position (E : Entity_Id) return B;
function Known_Normalized_Position_Max (E : Entity_Id) return B;
function Known_RM_Size (E : Entity_Id) return B;
function Known_Static_Component_Bit_Offset (E : Entity_Id) return B;
function Known_Static_Component_Size (E : Entity_Id) return B;
function Known_Static_Esize (E : Entity_Id) return B;
function Known_Static_Normalized_Position (E : Entity_Id) return B;
function Known_Static_Normalized_Position_Max (E : Entity_Id) return B;
function Known_Static_RM_Size (E : Entity_Id) return B;
function Unknown_Alignment (E : Entity_Id) return B;
function Unknown_Component_Bit_Offset (E : Entity_Id) return B;
function Unknown_Component_Size (E : Entity_Id) return B;
function Unknown_Esize (E : Entity_Id) return B;
function Unknown_Normalized_First_Bit (E : Entity_Id) return B;
function Unknown_Normalized_Position (E : Entity_Id) return B;
function Unknown_Normalized_Position_Max (E : Entity_Id) return B;
function Unknown_RM_Size (E : Entity_Id) return B;
------------------------------
-- Attribute Set Procedures --
------------------------------
procedure Set_Accept_Address (Id : E; V : L);
procedure Set_Access_Disp_Table (Id : E; V : E);
procedure Set_Actual_Subtype (Id : E; V : E);
procedure Set_Address_Taken (Id : E; V : B := True);
procedure Set_Alias (Id : E; V : E);
procedure Set_Alignment (Id : E; V : U);
procedure Set_Associated_Final_Chain (Id : E; V : E);
procedure Set_Associated_Formal_Package (Id : E; V : E);
procedure Set_Associated_Node_For_Itype (Id : E; V : N);
procedure Set_Associated_Storage_Pool (Id : E; V : E);
procedure Set_Barrier_Function (Id : E; V : N);
procedure Set_Block_Node (Id : E; V : N);
procedure Set_Body_Entity (Id : E; V : E);
procedure Set_CR_Discriminant (Id : E; V : E);
procedure Set_C_Pass_By_Copy (Id : E; V : B := True);
procedure Set_Class_Wide_Type (Id : E; V : E);
procedure Set_Cloned_Subtype (Id : E; V : E);
procedure Set_Component_Alignment (Id : E; V : C);
procedure Set_Component_Bit_Offset (Id : E; V : U);
procedure Set_Component_Clause (Id : E; V : N);
procedure Set_Component_Size (Id : E; V : U);
procedure Set_Component_Type (Id : E; V : E);
procedure Set_Corresponding_Concurrent_Type (Id : E; V : E);
procedure Set_Corresponding_Discriminant (Id : E; V : E);
procedure Set_Corresponding_Equality (Id : E; V : E);
procedure Set_Corresponding_Record_Type (Id : E; V : E);
procedure Set_Corresponding_Remote_Type (Id : E; V : E);
procedure Set_Debug_Info_Off (Id : E; V : B := True);
procedure Set_Debug_Renaming_Link (Id : E; V : E);
procedure Set_DTC_Entity (Id : E; V : E);
procedure Set_DT_Entry_Count (Id : E; V : U);
procedure Set_DT_Position (Id : E; V : U);
procedure Set_Default_Expr_Function (Id : E; V : E);
procedure Set_Default_Expressions_Processed (Id : E; V : B := True);
procedure Set_Default_Value (Id : E; V : N);
procedure Set_Delay_Cleanups (Id : E; V : B := True);
procedure Set_Delay_Subprogram_Descriptors (Id : E; V : B := True);
procedure Set_Delta_Value (Id : E; V : R);
procedure Set_Dependent_Instances (Id : E; V : L);
procedure Set_Depends_On_Private (Id : E; V : B := True);
procedure Set_Digits_Value (Id : E; V : U);
procedure Set_Directly_Designated_Type (Id : E; V : E);
procedure Set_Discard_Names (Id : E; V : B := True);
procedure Set_Discriminal (Id : E; V : E);
procedure Set_Discriminal_Link (Id : E; V : E);
procedure Set_Discriminant_Checking_Func (Id : E; V : E);
procedure Set_Discriminant_Constraint (Id : E; V : L);
procedure Set_Discriminant_Default_Value (Id : E; V : N);
procedure Set_Discriminant_Number (Id : E; V : U);
procedure Set_Elaborate_All_Desirable (Id : E; V : B := True);
procedure Set_Elaboration_Entity (Id : E; V : E);
procedure Set_Elaboration_Entity_Required (Id : E; V : B := True);
procedure Set_Enclosing_Scope (Id : E; V : E);
procedure Set_Entry_Accepted (Id : E; V : B := True);
procedure Set_Entry_Bodies_Array (Id : E; V : E);
procedure Set_Entry_Cancel_Parameter (Id : E; V : E);
procedure Set_Entry_Component (Id : E; V : E);
procedure Set_Entry_Formal (Id : E; V : E);
procedure Set_Entry_Index_Constant (Id : E; V : E);
procedure Set_Entry_Parameters_Type (Id : E; V : E);
procedure Set_Enum_Pos_To_Rep (Id : E; V : E);
procedure Set_Enumeration_Pos (Id : E; V : U);
procedure Set_Enumeration_Rep (Id : E; V : U);
procedure Set_Enumeration_Rep_Expr (Id : E; V : N);
procedure Set_Equivalent_Type (Id : E; V : E);
procedure Set_Esize (Id : E; V : U);
procedure Set_Exception_Code (Id : E; V : U);
procedure Set_Extra_Accessibility (Id : E; V : E);
procedure Set_Extra_Constrained (Id : E; V : E);
procedure Set_Extra_Formal (Id : E; V : E);
procedure Set_Finalization_Chain_Entity (Id : E; V : E);
procedure Set_Finalize_Storage_Only (Id : E; V : B := True);
procedure Set_First_Entity (Id : E; V : E);
procedure Set_First_Index (Id : E; V : N);
procedure Set_First_Literal (Id : E; V : E);
procedure Set_First_Optional_Parameter (Id : E; V : E);
procedure Set_First_Private_Entity (Id : E; V : E);
procedure Set_First_Rep_Item (Id : E; V : N);
procedure Set_Freeze_Node (Id : E; V : N);
procedure Set_From_With_Type (Id : E; V : B := True);
procedure Set_Full_View (Id : E; V : E);
procedure Set_Function_Returns_With_DSP (Id : E; V : B := True);
procedure Set_Generic_Renamings (Id : E; V : L);
procedure Set_Girder_Constraint (Id : E; V : L);
procedure Set_Handler_Records (Id : E; V : S);
procedure Set_Has_Aliased_Components (Id : E; V : B := True);
procedure Set_Has_Alignment_Clause (Id : E; V : B := True);
procedure Set_Has_All_Calls_Remote (Id : E; V : B := True);
procedure Set_Has_Atomic_Components (Id : E; V : B := True);
procedure Set_Has_Biased_Representation (Id : E; V : B := True);
procedure Set_Has_Completion (Id : E; V : B := True);
procedure Set_Has_Completion_In_Body (Id : E; V : B := True);
procedure Set_Has_Complex_Representation (Id : E; V : B := True);
procedure Set_Has_Component_Size_Clause (Id : E; V : B := True);
procedure Set_Has_Controlled_Component (Id : E; V : B := True);
procedure Set_Has_Controlling_Result (Id : E; V : B := True);
procedure Set_Has_Convention_Pragma (Id : E; V : B := True);
procedure Set_Has_Delayed_Freeze (Id : E; V : B := True);
procedure Set_Has_Discriminants (Id : E; V : B := True);
procedure Set_Has_Enumeration_Rep_Clause (Id : E; V : B := True);
procedure Set_Has_Exit (Id : E; V : B := True);
procedure Set_Has_External_Tag_Rep_Clause (Id : E; V : B := True);
procedure Set_Has_Fully_Qualified_Name (Id : E; V : B := True);
procedure Set_Has_Gigi_Rep_Item (Id : E; V : B := True);
procedure Set_Has_Homonym (Id : E; V : B := True);
procedure Set_Has_Machine_Radix_Clause (Id : E; V : B := True);
procedure Set_Has_Master_Entity (Id : E; V : B := True);
procedure Set_Has_Missing_Return (Id : E; V : B := True);
procedure Set_Has_Nested_Block_With_Handler (Id : E; V : B := True);
procedure Set_Has_Forward_Instantiation (Id : E; V : B := True);
procedure Set_Has_Non_Standard_Rep (Id : E; V : B := True);
procedure Set_Has_Object_Size_Clause (Id : E; V : B := True);
procedure Set_Has_Per_Object_Constraint (Id : E; V : B := True);
procedure Set_Has_Pragma_Controlled (Id : E; V : B := True);
procedure Set_Has_Pragma_Elaborate_Body (Id : E; V : B := True);
procedure Set_Has_Pragma_Inline (Id : E; V : B := True);
procedure Set_Has_Pragma_Pack (Id : E; V : B := True);
procedure Set_Has_Pragma_Pure_Function (Id : E; V : B := True);
procedure Set_Has_Primitive_Operations (Id : E; V : B := True);
procedure Set_Has_Private_Declaration (Id : E; V : B := True);
procedure Set_Has_Qualified_Name (Id : E; V : B := True);
procedure Set_Has_Record_Rep_Clause (Id : E; V : B := True);
procedure Set_Has_Recursive_Call (Id : E; V : B := True);
procedure Set_Has_Size_Clause (Id : E; V : B := True);
procedure Set_Has_Small_Clause (Id : E; V : B := True);
procedure Set_Has_Specified_Layout (Id : E; V : B := True);
procedure Set_Has_Storage_Size_Clause (Id : E; V : B := True);
procedure Set_Has_Subprogram_Descriptor (Id : E; V : B := True);
procedure Set_Has_Task (Id : E; V : B := True);
procedure Set_Has_Unchecked_Union (Id : E; V : B := True);
procedure Set_Has_Unknown_Discriminants (Id : E; V : B := True);
procedure Set_Has_Volatile_Components (Id : E; V : B := True);
procedure Set_Hiding_Loop_Variable (Id : E; V : E);
procedure Set_Homonym (Id : E; V : E);
procedure Set_In_Package_Body (Id : E; V : B := True);
procedure Set_In_Private_Part (Id : E; V : B := True);
procedure Set_In_Use (Id : E; V : B := True);
procedure Set_Inner_Instances (Id : E; V : L);
procedure Set_Interface_Name (Id : E; V : N);
procedure Set_Is_AST_Entry (Id : E; V : B := True);
procedure Set_Is_Abstract (Id : E; V : B := True);
procedure Set_Is_Access_Constant (Id : E; V : B := True);
procedure Set_Is_Aliased (Id : E; V : B := True);
procedure Set_Is_Asynchronous (Id : E; V : B := True);
procedure Set_Is_Atomic (Id : E; V : B := True);
procedure Set_Is_Bit_Packed_Array (Id : E; V : B := True);
procedure Set_Is_CPP_Class (Id : E; V : B := True);
procedure Set_Is_Called (Id : E; V : B := True);
procedure Set_Is_Character_Type (Id : E; V : B := True);
procedure Set_Is_Child_Unit (Id : E; V : B := True);
procedure Set_Is_Compilation_Unit (Id : E; V : B := True);
procedure Set_Is_Completely_Hidden (Id : E; V : B := True);
procedure Set_Is_Concurrent_Record_Type (Id : E; V : B := True);
procedure Set_Is_Constr_Subt_For_UN_Aliased (Id : E; V : B := True);
procedure Set_Is_Constr_Subt_For_U_Nominal (Id : E; V : B := True);
procedure Set_Is_Constrained (Id : E; V : B := True);
procedure Set_Is_Constructor (Id : E; V : B := True);
procedure Set_Is_Controlled (Id : E; V : B := True);
procedure Set_Is_Controlling_Formal (Id : E; V : B := True);
procedure Set_Is_Destructor (Id : E; V : B := True);
procedure Set_Is_Discrim_SO_Function (Id : E; V : B := True);
procedure Set_Is_Dispatching_Operation (Id : E; V : B := True);
procedure Set_Is_Eliminated (Id : E; V : B := True);
procedure Set_Is_Entry_Formal (Id : E; V : B := True);
procedure Set_Is_Exported (Id : E; V : B := True);
procedure Set_Is_First_Subtype (Id : E; V : B := True);
procedure Set_Is_For_Access_Subtype (Id : E; V : B := True);
procedure Set_Is_Formal_Subprogram (Id : E; V : B := True);
procedure Set_Is_Frozen (Id : E; V : B := True);
procedure Set_Is_Generic_Actual_Type (Id : E; V : B := True);
procedure Set_Is_Generic_Instance (Id : E; V : B := True);
procedure Set_Is_Generic_Type (Id : E; V : B := True);
procedure Set_Is_Hidden (Id : E; V : B := True);
procedure Set_Is_Hidden_Open_Scope (Id : E; V : B := True);
procedure Set_Is_Immediately_Visible (Id : E; V : B := True);
procedure Set_Is_Imported (Id : E; V : B := True);
procedure Set_Is_Inlined (Id : E; V : B := True);
procedure Set_Is_Instantiated (Id : E; V : B := True);
procedure Set_Is_Internal (Id : E; V : B := True);
procedure Set_Is_Interrupt_Handler (Id : E; V : B := True);
procedure Set_Is_Intrinsic_Subprogram (Id : E; V : B := True);
procedure Set_Is_Itype (Id : E; V : B := True);
procedure Set_Is_Known_Valid (Id : E; V : B := True);
procedure Set_Is_Limited_Composite (Id : E; V : B := True);
procedure Set_Is_Limited_Record (Id : E; V : B := True);
procedure Set_Is_Machine_Code_Subprogram (Id : E; V : B := True);
procedure Set_Is_Non_Static_Subtype (Id : E; V : B := True);
procedure Set_Is_Null_Init_Proc (Id : E; V : B := True);
procedure Set_Is_Optional_Parameter (Id : E; V : B := True);
procedure Set_Is_Package_Body_Entity (Id : E; V : B := True);
procedure Set_Is_Packed (Id : E; V : B := True);
procedure Set_Is_Packed_Array_Type (Id : E; V : B := True);
procedure Set_Is_Potentially_Use_Visible (Id : E; V : B := True);
procedure Set_Is_Preelaborated (Id : E; V : B := True);
procedure Set_Is_Private_Composite (Id : E; V : B := True);
procedure Set_Is_Private_Descendant (Id : E; V : B := True);
procedure Set_Is_Psected (Id : E; V : B := True);
procedure Set_Is_Public (Id : E; V : B := True);
procedure Set_Is_Pure (Id : E; V : B := True);
procedure Set_Is_Remote_Call_Interface (Id : E; V : B := True);
procedure Set_Is_Remote_Types (Id : E; V : B := True);
procedure Set_Is_Renaming_Of_Object (Id : E; V : B := True);
procedure Set_Is_Shared_Passive (Id : E; V : B := True);
procedure Set_Is_Statically_Allocated (Id : E; V : B := True);
procedure Set_Is_Tag (Id : E; V : B := True);
procedure Set_Is_Tagged_Type (Id : E; V : B := True);
procedure Set_Is_True_Constant (Id : E; V : B := True);
procedure Set_Is_Unchecked_Union (Id : E; V : B := True);
procedure Set_Is_Unsigned_Type (Id : E; V : B := True);
procedure Set_Is_VMS_Exception (Id : E; V : B := True);
procedure Set_Is_Valued_Procedure (Id : E; V : B := True);
procedure Set_Is_Visible_Child_Unit (Id : E; V : B := True);
procedure Set_Is_Volatile (Id : E; V : B := True);
procedure Set_Last_Entity (Id : E; V : E);
procedure Set_Lit_Indexes (Id : E; V : E);
procedure Set_Lit_Strings (Id : E; V : E);
procedure Set_Machine_Radix_10 (Id : E; V : B := True);
procedure Set_Master_Id (Id : E; V : E);
procedure Set_Materialize_Entity (Id : E; V : B := True);
procedure Set_Mechanism (Id : E; V : M);
procedure Set_Modulus (Id : E; V : U);
procedure Set_Needs_Debug_Info (Id : E; V : B := True);
procedure Set_Needs_No_Actuals (Id : E; V : B := True);
procedure Set_Next_Inlined_Subprogram (Id : E; V : E);
procedure Set_No_Pool_Assigned (Id : E; V : B := True);
procedure Set_No_Return (Id : E; V : B := True);
procedure Set_Non_Binary_Modulus (Id : E; V : B := True);
procedure Set_Nonzero_Is_True (Id : E; V : B := True);
procedure Set_Normalized_First_Bit (Id : E; V : U);
procedure Set_Normalized_Position (Id : E; V : U);
procedure Set_Normalized_Position_Max (Id : E; V : U);
procedure Set_Not_Source_Assigned (Id : E; V : B := True);
procedure Set_Object_Ref (Id : E; V : E);
procedure Set_Original_Record_Component (Id : E; V : E);
procedure Set_Packed_Array_Type (Id : E; V : E);
procedure Set_Parent_Subtype (Id : E; V : E);
procedure Set_Primitive_Operations (Id : E; V : L);
procedure Set_Prival (Id : E; V : E);
procedure Set_Privals_Chain (Id : E; V : L);
procedure Set_Private_Dependents (Id : E; V : L);
procedure Set_Private_View (Id : E; V : N);
procedure Set_Protected_Body_Subprogram (Id : E; V : E);
procedure Set_Protected_Formal (Id : E; V : E);
procedure Set_Protected_Operation (Id : E; V : N);
procedure Set_RM_Size (Id : E; V : U);
procedure Set_Reachable (Id : E; V : B := True);
procedure Set_Referenced (Id : E; V : B := True);
procedure Set_Referenced_Object (Id : E; V : N);
procedure Set_Register_Exception_Call (Id : E; V : N);
procedure Set_Related_Array_Object (Id : E; V : E);
procedure Set_Related_Instance (Id : E; V : E);
procedure Set_Renamed_Entity (Id : E; V : N);
procedure Set_Renamed_Object (Id : E; V : N);
procedure Set_Renaming_Map (Id : E; V : U);
procedure Set_Return_Present (Id : E; V : B := True);
procedure Set_Returns_By_Ref (Id : E; V : B := True);
procedure Set_Reverse_Bit_Order (Id : E; V : B := True);
procedure Set_Scalar_Range (Id : E; V : N);
procedure Set_Scale_Value (Id : E; V : U);
procedure Set_Scope_Depth_Value (Id : E; V : U);
procedure Set_Sec_Stack_Needed_For_Return (Id : E; V : B := True);
procedure Set_Shadow_Entities (Id : E; V : S);
procedure Set_Shared_Var_Assign_Proc (Id : E; V : E);
procedure Set_Shared_Var_Read_Proc (Id : E; V : E);
procedure Set_Size_Check_Code (Id : E; V : N);
procedure Set_Size_Depends_On_Discriminant (Id : E; V : B := True);
procedure Set_Size_Known_At_Compile_Time (Id : E; V : B := True);
procedure Set_Small_Value (Id : E; V : R);
procedure Set_Spec_Entity (Id : E; V : E);
procedure Set_Storage_Size_Variable (Id : E; V : E);
procedure Set_Strict_Alignment (Id : E; V : B := True);
procedure Set_String_Literal_Length (Id : E; V : U);
procedure Set_String_Literal_Low_Bound (Id : E; V : N);
procedure Set_Suppress_Access_Checks (Id : E; V : B := True);
procedure Set_Suppress_Accessibility_Checks (Id : E; V : B := True);
procedure Set_Suppress_Discriminant_Checks (Id : E; V : B := True);
procedure Set_Suppress_Division_Checks (Id : E; V : B := True);
procedure Set_Suppress_Elaboration_Checks (Id : E; V : B := True);
procedure Set_Suppress_Elaboration_Warnings (Id : E; V : B := True);
procedure Set_Suppress_Index_Checks (Id : E; V : B := True);
procedure Set_Suppress_Init_Proc (Id : E; V : B := True);
procedure Set_Suppress_Length_Checks (Id : E; V : B := True);
procedure Set_Suppress_Overflow_Checks (Id : E; V : B := True);
procedure Set_Suppress_Range_Checks (Id : E; V : B := True);
procedure Set_Suppress_Storage_Checks (Id : E; V : B := True);
procedure Set_Suppress_Style_Checks (Id : E; V : B := True);
procedure Set_Suppress_Tag_Checks (Id : E; V : B := True);
procedure Set_Underlying_Full_View (Id : E; V : E);
procedure Set_Unset_Reference (Id : E; V : N);
procedure Set_Uses_Sec_Stack (Id : E; V : B := True);
procedure Set_Vax_Float (Id : E; V : B := True);
procedure Set_Warnings_Off (Id : E; V : B := True);
-----------------------------------
-- Field Initialization Routines --
-----------------------------------
-- These routines are overloadings of some of the above Set procedures
-- where the argument is normally a Uint. The overloadings take an Int
-- parameter instead, and appropriately convert it. There are also
-- versions that implicitly initialize to the appropriate "not set"
-- value. The not set (unknown) values are as follows:
-- Alignment Uint_0
-- Component_Size Uint_0
-- Component_Bit_Offset No_Uint
-- Digits_Value Uint_0
-- Esize Uint_0
-- Normalized_First_Bit No_Uint
-- Normalized_Position No_Uint
-- Normalized_Position_Max No_Uint
-- RM_Size Uint_0
-- It would be cleaner to use No_Uint in all these cases, but historically
-- we chose to use Uint_0 at first, and the change over will take time ???
-- This is particularly true for the RM_Size field, where a value of zero
-- is legitimate and causes some kludges around the code.
procedure Init_Alignment (Id : E; V : Int);
procedure Init_Component_Size (Id : E; V : Int);
procedure Init_Component_Bit_Offset (Id : E; V : Int);
procedure Init_Digits_Value (Id : E; V : Int);
procedure Init_Esize (Id : E; V : Int);
procedure Init_Normalized_First_Bit (Id : E; V : Int);
procedure Init_Normalized_Position (Id : E; V : Int);
procedure Init_Normalized_Position_Max (Id : E; V : Int);
procedure Init_RM_Size (Id : E; V : Int);
procedure Init_Alignment (Id : E);
procedure Init_Component_Size (Id : E);
procedure Init_Component_Bit_Offset (Id : E);
procedure Init_Digits_Value (Id : E);
procedure Init_Esize (Id : E);
procedure Init_Normalized_First_Bit (Id : E);
procedure Init_Normalized_Position (Id : E);
procedure Init_Normalized_Position_Max (Id : E);
procedure Init_RM_Size (Id : E);
procedure Init_Size_Align (Id : E);
-- This procedure initializes both size fields and the alignment
-- field to all be Unknown.
procedure Init_Size (Id : E; V : Int);
-- Initialize both the Esize and RM_Size fields of E to V
procedure Init_Component_Location (Id : E);
-- Initializes all fields describing the location of a component
-- (Normalized_Position, Component_Bit_Offset, Normalized_First_Bit,
-- Normalized_Position_Max, Esize) to all be Unknown.
---------------
-- Iterators --
---------------
-- The call to Next_xxx (obj) is equivalent to obj := Next_xxx (obj)
-- We define the set of Proc_Next_xxx routines simply for the purposes
-- of inlining them without necessarily inlining the function.
procedure Proc_Next_Component (N : in out Node_Id);
procedure Proc_Next_Discriminant (N : in out Node_Id);
procedure Proc_Next_Formal (N : in out Node_Id);
procedure Proc_Next_Formal_With_Extras (N : in out Node_Id);
procedure Proc_Next_Girder_Discriminant (N : in out Node_Id);
procedure Proc_Next_Index (N : in out Node_Id);
procedure Proc_Next_Inlined_Subprogram (N : in out Node_Id);
procedure Proc_Next_Literal (N : in out Node_Id);
pragma Inline (Proc_Next_Component);
pragma Inline (Proc_Next_Discriminant);
pragma Inline (Proc_Next_Formal);
pragma Inline (Proc_Next_Formal_With_Extras);
pragma Inline (Proc_Next_Girder_Discriminant);
pragma Inline (Proc_Next_Index);
pragma Inline (Proc_Next_Inlined_Subprogram);
pragma Inline (Proc_Next_Literal);
procedure Next_Component (N : in out Node_Id)
renames Proc_Next_Component;
procedure Next_Discriminant (N : in out Node_Id)
renames Proc_Next_Discriminant;
procedure Next_Formal (N : in out Node_Id)
renames Proc_Next_Formal;
procedure Next_Formal_With_Extras (N : in out Node_Id)
renames Proc_Next_Formal_With_Extras;
procedure Next_Girder_Discriminant (N : in out Node_Id)
renames Proc_Next_Girder_Discriminant;
procedure Next_Index (N : in out Node_Id)
renames Proc_Next_Index;
procedure Next_Inlined_Subprogram (N : in out Node_Id)
renames Proc_Next_Inlined_Subprogram;
procedure Next_Literal (N : in out Node_Id)
renames Proc_Next_Literal;
-------------------------------
-- Miscellaneous Subprograms --
-------------------------------
procedure Append_Entity (Id : Entity_Id; V : Entity_Id);
-- Add an entity to the list of entities declared in the scope V
function Is_Entity_Name (N : Node_Id) return Boolean;
-- Test if the node N is the name of an entity (i.e. is an identifier,
-- expanded name, or an attribute reference that returns an entity).
function Next_Index (Id : Node_Id) return Node_Id;
-- Given an index from a previous call to First_Index or Next_Index,
-- returns a node representing the occurrence of the next index subtype,
-- or Empty if there are no more index subtypes.
function Scope_Depth (Id : Entity_Id) return Uint;
-- Returns the scope depth value of the Id, unless the Id is a record
-- type, in which case it returns the scope depth of the record scope.
function Subtype_Kind (K : Entity_Kind) return Entity_Kind;
-- Given an entity_kind K this function returns the entity_kind
-- corresponding to subtype kind of the type represented by K. For
-- example if K is E_Signed_Integer_Type then E_Signed_Integer_Subtype
-- is returned. If K is already a subtype kind it itself is returned. An
-- internal error is generated if no such correspondence exists for K.
----------------------------------
-- Debugging Output Subprograms --
----------------------------------
procedure Write_Entity_Flags (Id : Entity_Id; Prefix : String);
-- Writes a series of entries giving a line for each flag that is
-- set to True. Each line is prefixed by the given string
procedure Write_Entity_Info (Id : Entity_Id; Prefix : String);
-- A debugging procedure to write out information about an entity
procedure Write_Field6_Name (Id : Entity_Id);
procedure Write_Field7_Name (Id : Entity_Id);
procedure Write_Field8_Name (Id : Entity_Id);
procedure Write_Field9_Name (Id : Entity_Id);
procedure Write_Field10_Name (Id : Entity_Id);
procedure Write_Field11_Name (Id : Entity_Id);
procedure Write_Field12_Name (Id : Entity_Id);
procedure Write_Field13_Name (Id : Entity_Id);
procedure Write_Field14_Name (Id : Entity_Id);
procedure Write_Field15_Name (Id : Entity_Id);
procedure Write_Field16_Name (Id : Entity_Id);
procedure Write_Field17_Name (Id : Entity_Id);
procedure Write_Field18_Name (Id : Entity_Id);
procedure Write_Field19_Name (Id : Entity_Id);
procedure Write_Field20_Name (Id : Entity_Id);
procedure Write_Field21_Name (Id : Entity_Id);
procedure Write_Field22_Name (Id : Entity_Id);
procedure Write_Field23_Name (Id : Entity_Id);
-- These routines are used to output a nice symbolic name for the given
-- field, depending on the Ekind. No blanks or end of lines are output,
-- just the characters of the field name.
--------------------
-- Inline Pragmas --
--------------------
-- Note that these inline pragmas are referenced by the XEINFO utility
-- program in preparing the corresponding C header, and only those
-- subprograms meeting the requirements documented in the section on
-- XEINFO may be referenced in this section.
pragma Inline (Accept_Address);
pragma Inline (Access_Disp_Table);
pragma Inline (Actual_Subtype);
pragma Inline (Address_Taken);
pragma Inline (Alias);
pragma Inline (Alignment);
pragma Inline (Associated_Final_Chain);
pragma Inline (Associated_Formal_Package);
pragma Inline (Associated_Node_For_Itype);
pragma Inline (Associated_Storage_Pool);
pragma Inline (Barrier_Function);
pragma Inline (Block_Node);
pragma Inline (Body_Entity);
pragma Inline (CR_Discriminant);
pragma Inline (C_Pass_By_Copy);
pragma Inline (Class_Wide_Type);
pragma Inline (Cloned_Subtype);
pragma Inline (Component_Bit_Offset);
pragma Inline (Component_Clause);
pragma Inline (Component_Size);
pragma Inline (Component_Type);
pragma Inline (Corresponding_Concurrent_Type);
pragma Inline (Corresponding_Discriminant);
pragma Inline (Corresponding_Equality);
pragma Inline (Corresponding_Record_Type);
pragma Inline (Corresponding_Remote_Type);
pragma Inline (Debug_Info_Off);
pragma Inline (Debug_Renaming_Link);
pragma Inline (DTC_Entity);
pragma Inline (DT_Entry_Count);
pragma Inline (DT_Position);
pragma Inline (Default_Expr_Function);
pragma Inline (Default_Expressions_Processed);
pragma Inline (Default_Value);
pragma Inline (Delay_Cleanups);
pragma Inline (Delay_Subprogram_Descriptors);
pragma Inline (Delta_Value);
pragma Inline (Dependent_Instances);
pragma Inline (Depends_On_Private);
pragma Inline (Digits_Value);
pragma Inline (Directly_Designated_Type);
pragma Inline (Discard_Names);
pragma Inline (Discriminal);
pragma Inline (Discriminal_Link);
pragma Inline (Discriminant_Checking_Func);
pragma Inline (Discriminant_Constraint);
pragma Inline (Discriminant_Default_Value);
pragma Inline (Discriminant_Number);
pragma Inline (Elaborate_All_Desirable);
pragma Inline (Elaboration_Entity);
pragma Inline (Elaboration_Entity_Required);
pragma Inline (Enclosing_Scope);
pragma Inline (Entry_Accepted);
pragma Inline (Entry_Bodies_Array);
pragma Inline (Entry_Cancel_Parameter);
pragma Inline (Entry_Component);
pragma Inline (Entry_Formal);
pragma Inline (Entry_Index_Constant);
pragma Inline (Entry_Index_Type);
pragma Inline (Entry_Parameters_Type);
pragma Inline (Enum_Pos_To_Rep);
pragma Inline (Enumeration_Pos);
pragma Inline (Enumeration_Rep);
pragma Inline (Enumeration_Rep_Expr);
pragma Inline (Equivalent_Type);
pragma Inline (Esize);
pragma Inline (Exception_Code);
pragma Inline (Extra_Accessibility);
pragma Inline (Extra_Constrained);
pragma Inline (Extra_Formal);
pragma Inline (Finalization_Chain_Entity);
pragma Inline (First_Entity);
pragma Inline (First_Index);
pragma Inline (First_Literal);
pragma Inline (First_Optional_Parameter);
pragma Inline (First_Private_Entity);
pragma Inline (First_Rep_Item);
pragma Inline (Freeze_Node);
pragma Inline (From_With_Type);
pragma Inline (Full_View);
pragma Inline (Function_Returns_With_DSP);
pragma Inline (Generic_Renamings);
pragma Inline (Girder_Constraint);
pragma Inline (Handler_Records);
pragma Inline (Has_Aliased_Components);
pragma Inline (Has_Alignment_Clause);
pragma Inline (Has_All_Calls_Remote);
pragma Inline (Has_Atomic_Components);
pragma Inline (Has_Biased_Representation);
pragma Inline (Has_Completion);
pragma Inline (Has_Completion_In_Body);
pragma Inline (Has_Complex_Representation);
pragma Inline (Has_Component_Size_Clause);
pragma Inline (Has_Controlled_Component);
pragma Inline (Has_Controlling_Result);
pragma Inline (Has_Convention_Pragma);
pragma Inline (Has_Delayed_Freeze);
pragma Inline (Has_Discriminants);
pragma Inline (Has_Enumeration_Rep_Clause);
pragma Inline (Has_Exit);
pragma Inline (Has_External_Tag_Rep_Clause);
pragma Inline (Has_Fully_Qualified_Name);
pragma Inline (Has_Gigi_Rep_Item);
pragma Inline (Has_Homonym);
pragma Inline (Has_Machine_Radix_Clause);
pragma Inline (Has_Master_Entity);
pragma Inline (Has_Missing_Return);
pragma Inline (Has_Nested_Block_With_Handler);
pragma Inline (Has_Forward_Instantiation);
pragma Inline (Has_Non_Standard_Rep);
pragma Inline (Has_Object_Size_Clause);
pragma Inline (Has_Per_Object_Constraint);
pragma Inline (Has_Pragma_Controlled);
pragma Inline (Has_Pragma_Elaborate_Body);
pragma Inline (Has_Pragma_Inline);
pragma Inline (Has_Pragma_Pack);
pragma Inline (Has_Pragma_Pure_Function);
pragma Inline (Has_Primitive_Operations);
pragma Inline (Has_Private_Declaration);
pragma Inline (Has_Qualified_Name);
pragma Inline (Has_Record_Rep_Clause);
pragma Inline (Has_Recursive_Call);
pragma Inline (Has_Size_Clause);
pragma Inline (Has_Small_Clause);
pragma Inline (Has_Specified_Layout);
pragma Inline (Has_Storage_Size_Clause);
pragma Inline (Has_Subprogram_Descriptor);
pragma Inline (Has_Task);
pragma Inline (Has_Unchecked_Union);
pragma Inline (Has_Unknown_Discriminants);
pragma Inline (Has_Volatile_Components);
pragma Inline (Hiding_Loop_Variable);
pragma Inline (Homonym);
pragma Inline (In_Package_Body);
pragma Inline (In_Private_Part);
pragma Inline (In_Use);
pragma Inline (Inner_Instances);
pragma Inline (Interface_Name);
pragma Inline (Is_AST_Entry);
pragma Inline (Is_Abstract);
pragma Inline (Is_Access_Constant);
pragma Inline (Is_Access_Type);
pragma Inline (Is_Aliased);
pragma Inline (Is_Array_Type);
pragma Inline (Is_Asynchronous);
pragma Inline (Is_Atomic);
pragma Inline (Is_Bit_Packed_Array);
pragma Inline (Is_CPP_Class);
pragma Inline (Is_Called);
pragma Inline (Is_Character_Type);
pragma Inline (Is_Child_Unit);
pragma Inline (Is_Class_Wide_Type);
pragma Inline (Is_Compilation_Unit);
pragma Inline (Is_Completely_Hidden);
pragma Inline (Is_Composite_Type);
pragma Inline (Is_Concurrent_Body);
pragma Inline (Is_Concurrent_Record_Type);
pragma Inline (Is_Concurrent_Type);
pragma Inline (Is_Constr_Subt_For_UN_Aliased);
pragma Inline (Is_Constr_Subt_For_U_Nominal);
pragma Inline (Is_Constrained);
pragma Inline (Is_Constructor);
pragma Inline (Is_Controlled);
pragma Inline (Is_Controlling_Formal);
pragma Inline (Is_Decimal_Fixed_Point_Type);
pragma Inline (Is_Destructor);
pragma Inline (Is_Discrim_SO_Function);
pragma Inline (Is_Digits_Type);
pragma Inline (Is_Discrete_Or_Fixed_Point_Type);
pragma Inline (Is_Discrete_Type);
pragma Inline (Is_Dispatching_Operation);
pragma Inline (Is_Elementary_Type);
pragma Inline (Is_Eliminated);
pragma Inline (Is_Entry);
pragma Inline (Is_Entry_Formal);
pragma Inline (Is_Enumeration_Type);
pragma Inline (Is_Exported);
pragma Inline (Is_First_Subtype);
pragma Inline (Is_Fixed_Point_Type);
pragma Inline (Is_Floating_Point_Type);
pragma Inline (Is_For_Access_Subtype);
pragma Inline (Is_Formal);
pragma Inline (Is_Formal_Subprogram);
pragma Inline (Is_Frozen);
pragma Inline (Is_Generic_Actual_Type);
pragma Inline (Is_Generic_Instance);
pragma Inline (Is_Generic_Type);
pragma Inline (Is_Generic_Unit);
pragma Inline (Is_Hidden);
pragma Inline (Is_Hidden_Open_Scope);
pragma Inline (Is_Immediately_Visible);
pragma Inline (Is_Imported);
pragma Inline (Is_Incomplete_Or_Private_Type);
pragma Inline (Is_Inlined);
pragma Inline (Is_Instantiated);
pragma Inline (Is_Integer_Type);
pragma Inline (Is_Internal);
pragma Inline (Is_Interrupt_Handler);
pragma Inline (Is_Intrinsic_Subprogram);
pragma Inline (Is_Itype);
pragma Inline (Is_Known_Valid);
pragma Inline (Is_Limited_Composite);
pragma Inline (Is_Limited_Record);
pragma Inline (Is_Machine_Code_Subprogram);
pragma Inline (Is_Modular_Integer_Type);
pragma Inline (Is_Named_Number);
pragma Inline (Is_Non_Static_Subtype);
pragma Inline (Is_Null_Init_Proc);
pragma Inline (Is_Numeric_Type);
pragma Inline (Is_Object);
pragma Inline (Is_Optional_Parameter);
pragma Inline (Is_Package_Body_Entity);
pragma Inline (Is_Ordinary_Fixed_Point_Type);
pragma Inline (Is_Overloadable);
pragma Inline (Is_Packed);
pragma Inline (Is_Packed_Array_Type);
pragma Inline (Is_Potentially_Use_Visible);
pragma Inline (Is_Preelaborated);
pragma Inline (Is_Private_Composite);
pragma Inline (Is_Private_Descendant);
pragma Inline (Is_Private_Type);
pragma Inline (Is_Protected_Type);
pragma Inline (Is_Psected);
pragma Inline (Is_Public);
pragma Inline (Is_Pure);
pragma Inline (Is_Real_Type);
pragma Inline (Is_Record_Type);
pragma Inline (Is_Remote_Call_Interface);
pragma Inline (Is_Remote_Types);
pragma Inline (Is_Renaming_Of_Object);
pragma Inline (Is_Scalar_Type);
pragma Inline (Is_Shared_Passive);
pragma Inline (Is_Signed_Integer_Type);
pragma Inline (Is_Statically_Allocated);
pragma Inline (Is_Subprogram);
pragma Inline (Is_Tag);
pragma Inline (Is_Tagged_Type);
pragma Inline (Is_True_Constant);
pragma Inline (Is_Task_Type);
pragma Inline (Is_Type);
pragma Inline (Is_Unchecked_Union);
pragma Inline (Is_Unsigned_Type);
pragma Inline (Is_VMS_Exception);
pragma Inline (Is_Valued_Procedure);
pragma Inline (Is_Visible_Child_Unit);
pragma Inline (Is_Volatile);
pragma Inline (Last_Entity);
pragma Inline (Lit_Indexes);
pragma Inline (Lit_Strings);
pragma Inline (Machine_Radix_10);
pragma Inline (Master_Id);
pragma Inline (Materialize_Entity);
pragma Inline (Mechanism);
pragma Inline (Modulus);
pragma Inline (Needs_Debug_Info);
pragma Inline (Needs_No_Actuals);
pragma Inline (Next_Index);
pragma Inline (Next_Inlined_Subprogram);
pragma Inline (Next_Literal);
pragma Inline (No_Pool_Assigned);
pragma Inline (No_Return);
pragma Inline (Non_Binary_Modulus);
pragma Inline (Nonzero_Is_True);
pragma Inline (Normalized_First_Bit);
pragma Inline (Normalized_Position);
pragma Inline (Normalized_Position_Max);
pragma Inline (Not_Source_Assigned);
pragma Inline (Object_Ref);
pragma Inline (Original_Record_Component);
pragma Inline (Packed_Array_Type);
pragma Inline (Parameter_Mode);
pragma Inline (Parent_Subtype);
pragma Inline (Primitive_Operations);
pragma Inline (Prival);
pragma Inline (Privals_Chain);
pragma Inline (Private_Dependents);
pragma Inline (Private_View);
pragma Inline (Protected_Body_Subprogram);
pragma Inline (Protected_Formal);
pragma Inline (Protected_Operation);
pragma Inline (RM_Size);
pragma Inline (Reachable);
pragma Inline (Referenced);
pragma Inline (Referenced_Object);
pragma Inline (Register_Exception_Call);
pragma Inline (Related_Array_Object);
pragma Inline (Related_Instance);
pragma Inline (Renamed_Entity);
pragma Inline (Renamed_Object);
pragma Inline (Renaming_Map);
pragma Inline (Return_Present);
pragma Inline (Returns_By_Ref);
pragma Inline (Reverse_Bit_Order);
pragma Inline (Scalar_Range);
pragma Inline (Scale_Value);
pragma Inline (Scope_Depth_Value);
pragma Inline (Sec_Stack_Needed_For_Return);
pragma Inline (Shadow_Entities);
pragma Inline (Shared_Var_Assign_Proc);
pragma Inline (Shared_Var_Read_Proc);
pragma Inline (Size_Check_Code);
pragma Inline (Size_Depends_On_Discriminant);
pragma Inline (Size_Known_At_Compile_Time);
pragma Inline (Small_Value);
pragma Inline (Spec_Entity);
pragma Inline (Storage_Size_Variable);
pragma Inline (Strict_Alignment);
pragma Inline (String_Literal_Length);
pragma Inline (String_Literal_Low_Bound);
pragma Inline (Suppress_Access_Checks);
pragma Inline (Suppress_Accessibility_Checks);
pragma Inline (Suppress_Discriminant_Checks);
pragma Inline (Suppress_Division_Checks);
pragma Inline (Suppress_Elaboration_Checks);
pragma Inline (Suppress_Elaboration_Warnings);
pragma Inline (Suppress_Index_Checks);
pragma Inline (Suppress_Init_Proc);
pragma Inline (Suppress_Length_Checks);
pragma Inline (Suppress_Overflow_Checks);
pragma Inline (Suppress_Range_Checks);
pragma Inline (Suppress_Storage_Checks);
pragma Inline (Suppress_Style_Checks);
pragma Inline (Suppress_Tag_Checks);
pragma Inline (Underlying_Full_View);
pragma Inline (Unset_Reference);
pragma Inline (Uses_Sec_Stack);
pragma Inline (Vax_Float);
pragma Inline (Warnings_Off);
pragma Inline (Init_Alignment);
pragma Inline (Init_Component_Bit_Offset);
pragma Inline (Init_Component_Size);
pragma Inline (Init_Digits_Value);
pragma Inline (Init_Esize);
pragma Inline (Init_RM_Size);
pragma Inline (Known_Alignment);
pragma Inline (Known_Component_Bit_Offset);
pragma Inline (Known_Component_Size);
pragma Inline (Known_Esize);
pragma Inline (Known_Static_Component_Size);
pragma Inline (Known_Static_Esize);
pragma Inline (Unknown_Alignment);
pragma Inline (Unknown_Component_Bit_Offset);
pragma Inline (Unknown_Component_Size);
pragma Inline (Unknown_Esize);
pragma Inline (Set_Accept_Address);
pragma Inline (Set_Access_Disp_Table);
pragma Inline (Set_Actual_Subtype);
pragma Inline (Set_Address_Taken);
pragma Inline (Set_Alias);
pragma Inline (Set_Alignment);
pragma Inline (Set_Associated_Final_Chain);
pragma Inline (Set_Associated_Formal_Package);
pragma Inline (Set_Associated_Node_For_Itype);
pragma Inline (Set_Associated_Storage_Pool);
pragma Inline (Set_Barrier_Function);
pragma Inline (Set_Block_Node);
pragma Inline (Set_Body_Entity);
pragma Inline (Set_CR_Discriminant);
pragma Inline (Set_C_Pass_By_Copy);
pragma Inline (Set_Class_Wide_Type);
pragma Inline (Set_Cloned_Subtype);
pragma Inline (Set_Component_Bit_Offset);
pragma Inline (Set_Component_Clause);
pragma Inline (Set_Component_Size);
pragma Inline (Set_Component_Type);
pragma Inline (Set_Corresponding_Concurrent_Type);
pragma Inline (Set_Corresponding_Discriminant);
pragma Inline (Set_Corresponding_Equality);
pragma Inline (Set_Corresponding_Record_Type);
pragma Inline (Set_Corresponding_Remote_Type);
pragma Inline (Set_Debug_Info_Off);
pragma Inline (Set_Debug_Renaming_Link);
pragma Inline (Set_DTC_Entity);
pragma Inline (Set_DT_Position);
pragma Inline (Set_Default_Expr_Function);
pragma Inline (Set_Default_Expressions_Processed);
pragma Inline (Set_Default_Value);
pragma Inline (Set_Delay_Cleanups);
pragma Inline (Set_Delay_Subprogram_Descriptors);
pragma Inline (Set_Delta_Value);
pragma Inline (Set_Dependent_Instances);
pragma Inline (Set_Depends_On_Private);
pragma Inline (Set_Digits_Value);
pragma Inline (Set_Directly_Designated_Type);
pragma Inline (Set_Discard_Names);
pragma Inline (Set_Discriminal);
pragma Inline (Set_Discriminal_Link);
pragma Inline (Set_Discriminant_Checking_Func);
pragma Inline (Set_Discriminant_Constraint);
pragma Inline (Set_Discriminant_Default_Value);
pragma Inline (Set_Discriminant_Number);
pragma Inline (Set_Elaborate_All_Desirable);
pragma Inline (Set_Elaboration_Entity);
pragma Inline (Set_Elaboration_Entity_Required);
pragma Inline (Set_Enclosing_Scope);
pragma Inline (Set_Entry_Accepted);
pragma Inline (Set_Entry_Bodies_Array);
pragma Inline (Set_Entry_Cancel_Parameter);
pragma Inline (Set_Entry_Component);
pragma Inline (Set_Entry_Formal);
pragma Inline (Set_Entry_Parameters_Type);
pragma Inline (Set_Enum_Pos_To_Rep);
pragma Inline (Set_Enumeration_Pos);
pragma Inline (Set_Enumeration_Rep);
pragma Inline (Set_Enumeration_Rep_Expr);
pragma Inline (Set_Equivalent_Type);
pragma Inline (Set_Esize);
pragma Inline (Set_Exception_Code);
pragma Inline (Set_Extra_Accessibility);
pragma Inline (Set_Extra_Constrained);
pragma Inline (Set_Extra_Formal);
pragma Inline (Set_Finalization_Chain_Entity);
pragma Inline (Set_First_Entity);
pragma Inline (Set_First_Index);
pragma Inline (Set_First_Literal);
pragma Inline (Set_First_Optional_Parameter);
pragma Inline (Set_First_Private_Entity);
pragma Inline (Set_First_Rep_Item);
pragma Inline (Set_Freeze_Node);
pragma Inline (Set_From_With_Type);
pragma Inline (Set_Full_View);
pragma Inline (Set_Function_Returns_With_DSP);
pragma Inline (Set_Generic_Renamings);
pragma Inline (Set_Girder_Constraint);
pragma Inline (Set_Handler_Records);
pragma Inline (Set_Has_Aliased_Components);
pragma Inline (Set_Has_Alignment_Clause);
pragma Inline (Set_Has_All_Calls_Remote);
pragma Inline (Set_Has_Atomic_Components);
pragma Inline (Set_Has_Biased_Representation);
pragma Inline (Set_Has_Completion);
pragma Inline (Set_Has_Completion_In_Body);
pragma Inline (Set_Has_Complex_Representation);
pragma Inline (Set_Has_Component_Size_Clause);
pragma Inline (Set_Has_Controlled_Component);
pragma Inline (Set_Has_Controlling_Result);
pragma Inline (Set_Has_Convention_Pragma);
pragma Inline (Set_Has_Delayed_Freeze);
pragma Inline (Set_Has_Discriminants);
pragma Inline (Set_Has_Enumeration_Rep_Clause);
pragma Inline (Set_Has_Exit);
pragma Inline (Set_Has_External_Tag_Rep_Clause);
pragma Inline (Set_Has_Fully_Qualified_Name);
pragma Inline (Set_Has_Gigi_Rep_Item);
pragma Inline (Set_Has_Homonym);
pragma Inline (Set_Has_Machine_Radix_Clause);
pragma Inline (Set_Has_Master_Entity);
pragma Inline (Set_Has_Missing_Return);
pragma Inline (Set_Has_Nested_Block_With_Handler);
pragma Inline (Set_Has_Forward_Instantiation);
pragma Inline (Set_Has_Non_Standard_Rep);
pragma Inline (Set_Has_Object_Size_Clause);
pragma Inline (Set_Has_Per_Object_Constraint);
pragma Inline (Set_Has_Pragma_Controlled);
pragma Inline (Set_Has_Pragma_Elaborate_Body);
pragma Inline (Set_Has_Pragma_Inline);
pragma Inline (Set_Has_Pragma_Pack);
pragma Inline (Set_Has_Pragma_Pure_Function);
pragma Inline (Set_Has_Primitive_Operations);
pragma Inline (Set_Has_Private_Declaration);
pragma Inline (Set_Has_Qualified_Name);
pragma Inline (Set_Has_Record_Rep_Clause);
pragma Inline (Set_Has_Recursive_Call);
pragma Inline (Set_Has_Size_Clause);
pragma Inline (Set_Has_Small_Clause);
pragma Inline (Set_Has_Specified_Layout);
pragma Inline (Set_Has_Storage_Size_Clause);
pragma Inline (Set_Has_Subprogram_Descriptor);
pragma Inline (Set_Has_Task);
pragma Inline (Set_Has_Unchecked_Union);
pragma Inline (Set_Has_Unknown_Discriminants);
pragma Inline (Set_Has_Volatile_Components);
pragma Inline (Set_Hiding_Loop_Variable);
pragma Inline (Set_Homonym);
pragma Inline (Set_In_Package_Body);
pragma Inline (Set_In_Private_Part);
pragma Inline (Set_In_Use);
pragma Inline (Set_Inner_Instances);
pragma Inline (Set_Interface_Name);
pragma Inline (Set_Is_AST_Entry);
pragma Inline (Set_Is_Abstract);
pragma Inline (Set_Is_Access_Constant);
pragma Inline (Set_Is_Aliased);
pragma Inline (Set_Is_Asynchronous);
pragma Inline (Set_Is_Atomic);
pragma Inline (Set_Is_Bit_Packed_Array);
pragma Inline (Set_Is_CPP_Class);
pragma Inline (Set_Is_Called);
pragma Inline (Set_Is_Character_Type);
pragma Inline (Set_Is_Child_Unit);
pragma Inline (Set_Is_Compilation_Unit);
pragma Inline (Set_Is_Completely_Hidden);
pragma Inline (Set_Is_Concurrent_Record_Type);
pragma Inline (Set_Is_Constr_Subt_For_U_Nominal);
pragma Inline (Set_Is_Constr_Subt_For_UN_Aliased);
pragma Inline (Set_Is_Constrained);
pragma Inline (Set_Is_Constructor);
pragma Inline (Set_Is_Controlled);
pragma Inline (Set_Is_Controlling_Formal);
pragma Inline (Set_Is_Destructor);
pragma Inline (Set_Is_Discrim_SO_Function);
pragma Inline (Set_Is_Dispatching_Operation);
pragma Inline (Set_Is_Eliminated);
pragma Inline (Set_Is_Entry_Formal);
pragma Inline (Set_Is_Exported);
pragma Inline (Set_Is_First_Subtype);
pragma Inline (Set_Is_For_Access_Subtype);
pragma Inline (Set_Is_Formal_Subprogram);
pragma Inline (Set_Is_Frozen);
pragma Inline (Set_Is_Generic_Actual_Type);
pragma Inline (Set_Is_Generic_Instance);
pragma Inline (Set_Is_Generic_Type);
pragma Inline (Set_Is_Hidden);
pragma Inline (Set_Is_Hidden_Open_Scope);
pragma Inline (Set_Is_Immediately_Visible);
pragma Inline (Set_Is_Imported);
pragma Inline (Set_Is_Inlined);
pragma Inline (Set_Is_Instantiated);
pragma Inline (Set_Is_Internal);
pragma Inline (Set_Is_Interrupt_Handler);
pragma Inline (Set_Is_Intrinsic_Subprogram);
pragma Inline (Set_Is_Itype);
pragma Inline (Set_Is_Known_Valid);
pragma Inline (Set_Is_Limited_Composite);
pragma Inline (Set_Is_Limited_Record);
pragma Inline (Set_Is_Machine_Code_Subprogram);
pragma Inline (Set_Is_Non_Static_Subtype);
pragma Inline (Set_Is_Null_Init_Proc);
pragma Inline (Set_Is_Optional_Parameter);
pragma Inline (Set_Is_Package_Body_Entity);
pragma Inline (Set_Is_Packed);
pragma Inline (Set_Is_Packed_Array_Type);
pragma Inline (Set_Is_Potentially_Use_Visible);
pragma Inline (Set_Is_Preelaborated);
pragma Inline (Set_Is_Private_Composite);
pragma Inline (Set_Is_Private_Descendant);
pragma Inline (Set_Is_Psected);
pragma Inline (Set_Is_Public);
pragma Inline (Set_Is_Pure);
pragma Inline (Set_Is_Remote_Call_Interface);
pragma Inline (Set_Is_Remote_Types);
pragma Inline (Set_Is_Renaming_Of_Object);
pragma Inline (Set_Is_Shared_Passive);
pragma Inline (Set_Is_Statically_Allocated);
pragma Inline (Set_Is_Tag);
pragma Inline (Set_Is_Tagged_Type);
pragma Inline (Set_Is_True_Constant);
pragma Inline (Set_Is_Unchecked_Union);
pragma Inline (Set_Is_Unsigned_Type);
pragma Inline (Set_Is_VMS_Exception);
pragma Inline (Set_Is_Valued_Procedure);
pragma Inline (Set_Is_Visible_Child_Unit);
pragma Inline (Set_Is_Volatile);
pragma Inline (Set_Last_Entity);
pragma Inline (Set_Lit_Indexes);
pragma Inline (Set_Lit_Strings);
pragma Inline (Set_Machine_Radix_10);
pragma Inline (Set_Master_Id);
pragma Inline (Set_Materialize_Entity);
pragma Inline (Set_Mechanism);
pragma Inline (Set_Modulus);
pragma Inline (Set_Needs_Debug_Info);
pragma Inline (Set_Needs_No_Actuals);
pragma Inline (Set_Next_Inlined_Subprogram);
pragma Inline (Set_No_Pool_Assigned);
pragma Inline (Set_No_Return);
pragma Inline (Set_Non_Binary_Modulus);
pragma Inline (Set_Nonzero_Is_True);
pragma Inline (Set_Normalized_First_Bit);
pragma Inline (Set_Normalized_Position);
pragma Inline (Set_Normalized_Position_Max);
pragma Inline (Set_Not_Source_Assigned);
pragma Inline (Set_Object_Ref);
pragma Inline (Set_Original_Record_Component);
pragma Inline (Set_Packed_Array_Type);
pragma Inline (Set_Parent_Subtype);
pragma Inline (Set_Primitive_Operations);
pragma Inline (Set_Prival);
pragma Inline (Set_Privals_Chain);
pragma Inline (Set_Private_Dependents);
pragma Inline (Set_Private_View);
pragma Inline (Set_Protected_Body_Subprogram);
pragma Inline (Set_Protected_Formal);
pragma Inline (Set_Protected_Operation);
pragma Inline (Set_RM_Size);
pragma Inline (Set_Reachable);
pragma Inline (Set_Referenced);
pragma Inline (Set_Referenced_Object);
pragma Inline (Set_Register_Exception_Call);
pragma Inline (Set_Related_Array_Object);
pragma Inline (Set_Related_Instance);
pragma Inline (Set_Renamed_Entity);
pragma Inline (Set_Renamed_Object);
pragma Inline (Set_Renaming_Map);
pragma Inline (Set_Return_Present);
pragma Inline (Set_Returns_By_Ref);
pragma Inline (Set_Reverse_Bit_Order);
pragma Inline (Set_Scalar_Range);
pragma Inline (Set_Scale_Value);
pragma Inline (Set_Scope_Depth_Value);
pragma Inline (Set_Sec_Stack_Needed_For_Return);
pragma Inline (Set_Shadow_Entities);
pragma Inline (Set_Shared_Var_Assign_Proc);
pragma Inline (Set_Shared_Var_Read_Proc);
pragma Inline (Set_Size_Check_Code);
pragma Inline (Set_Size_Depends_On_Discriminant);
pragma Inline (Set_Size_Known_At_Compile_Time);
pragma Inline (Set_Small_Value);
pragma Inline (Set_Spec_Entity);
pragma Inline (Set_Storage_Size_Variable);
pragma Inline (Set_Strict_Alignment);
pragma Inline (Set_String_Literal_Length);
pragma Inline (Set_String_Literal_Low_Bound);
pragma Inline (Set_Suppress_Access_Checks);
pragma Inline (Set_Suppress_Accessibility_Checks);
pragma Inline (Set_Suppress_Discriminant_Checks);
pragma Inline (Set_Suppress_Division_Checks);
pragma Inline (Set_Suppress_Elaboration_Checks);
pragma Inline (Set_Suppress_Elaboration_Warnings);
pragma Inline (Set_Suppress_Index_Checks);
pragma Inline (Set_Suppress_Init_Proc);
pragma Inline (Set_Suppress_Length_Checks);
pragma Inline (Set_Suppress_Overflow_Checks);
pragma Inline (Set_Suppress_Range_Checks);
pragma Inline (Set_Suppress_Storage_Checks);
pragma Inline (Set_Suppress_Style_Checks);
pragma Inline (Set_Suppress_Tag_Checks);
pragma Inline (Set_Underlying_Full_View);
pragma Inline (Set_Unset_Reference);
pragma Inline (Set_Uses_Sec_Stack);
pragma Inline (Set_Vax_Float);
pragma Inline (Set_Warnings_Off);
-- END XEINFO INLINES
-- The following Inline pragmas are *not* read by xeinfo when building
-- the C version of this interface automatically (so the C version will
-- end up making out of line calls). The pragma scan in xeinfo will be
-- terminated on encountering the END XEINFO INLINES line. We inline
-- things here which are small, but not of the canonical attribute
-- access/set format that can be handled by xeinfo.
pragma Inline (Is_Package);
pragma Inline (Is_Wrapper_Package);
pragma Inline (Known_RM_Size);
pragma Inline (Known_Static_Component_Bit_Offset);
pragma Inline (Known_Static_RM_Size);
pragma Inline (Scope_Depth);
pragma Inline (Scope_Depth_Set);
pragma Inline (Unknown_RM_Size);
end Einfo;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ W I D E _ T E X T _ I O . F L O A T _ I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, 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 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. --
-- --
------------------------------------------------------------------------------
-- In Ada 95, the package Ada.Wide_Wide_Text_IO.Float_IO is a subpackage
-- of Wide_Wide_Text_IO. In GNAT we make it a child package to avoid loading
-- the necessary code if Float_IO is not instantiated. See the routine
-- Rtsfind.Text_IO_Kludge for a description of how we patch up the
-- difference in semantics so that it is invisible to the Ada programmer.
private generic
type Num is digits <>;
package Ada.Wide_Wide_Text_IO.Float_IO is
Default_Fore : Field := 2;
Default_Aft : Field := Num'Digits - 1;
Default_Exp : Field := 3;
procedure Get
(File : File_Type;
Item : out Num;
Width : Field := 0);
procedure Get
(Item : out Num;
Width : Field := 0);
procedure Put
(File : File_Type;
Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
procedure Put
(Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
procedure Get
(From : Wide_Wide_String;
Item : out Num;
Last : out Positive);
procedure Put
(To : out Wide_Wide_String;
Item : Num;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp);
end Ada.Wide_Wide_Text_IO.Float_IO;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S T O R A G E _ P O O L S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2006, 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 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 Ada.Finalization;
with System.Storage_Elements;
package System.Storage_Pools is
pragma Preelaborate;
type Root_Storage_Pool is abstract
new Ada.Finalization.Limited_Controlled with private;
procedure Allocate
(Pool : in out Root_Storage_Pool;
Storage_Address : out Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count)
is abstract;
procedure Deallocate
(Pool : in out Root_Storage_Pool;
Storage_Address : Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count)
is abstract;
function Storage_Size
(Pool : Root_Storage_Pool)
return System.Storage_Elements.Storage_Count
is abstract;
private
-- The following two procedures support the use of class-wide pool
-- objects in storage pools. When a local type is given a class-wide
-- storage pool, allocation and deallocation for the type must dispatch
-- to the operation of the specific pool, which is achieved by a call
-- to these procedures. (When the pool type is specific, the back-end
-- generates a call to the statically identified operation of the type).
procedure Allocate_Any
(Pool : in out Root_Storage_Pool'Class;
Storage_Address : out Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count);
procedure Deallocate_Any
(Pool : in out Root_Storage_Pool'Class;
Storage_Address : Address;
Size_In_Storage_Elements : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count);
type Root_Storage_Pool is abstract
new Ada.Finalization.Limited_Controlled with null record;
end System.Storage_Pools;
|
package Static_Initializer5_Pkg is
type Arr is array (Positive range <>) of Character;
type Buffer_Type (Length : Positive) is record
Content : Arr (1 .. Length);
end record;
type Buffer_Access is access Buffer_Type;
type Rec is tagged record
Buffer : Buffer_Access;
end record;
Null_Rec : constant Rec := (Buffer => null);
end Static_Initializer5_Pkg;
|
with Ada.Strings.Unbounded;
with Ada.Containers.Vectors;
package Test_Solution is
type Solution is access procedure;
package SU renames Ada.Strings.Unbounded;
package P is new Ada.Containers.Vectors( Index_Type => Natural,
Element_Type => Solution);
Assertion_Error : Exception;
procedure Assert( Test : Boolean );
type Solution_Case is record
Name : SU.Unbounded_String;
Tests : P.Vector;
end record;
procedure Set_Name( C : in out Solution_Case; Name : String );
function Get_Name( C : in Solution_Case ) return String;
procedure Add_Test( C : in out Solution_Case; Func : Solution );
end Test_Solution;
|
-- SPDX-FileCopyrightText: 2019 Max Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
package body Program.Nodes.Exit_Statements is
function Create
(Exit_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Exit_Loop_Name : Program.Elements.Expressions.Expression_Access;
When_Token : Program.Lexical_Elements.Lexical_Element_Access;
Condition : Program.Elements.Expressions.Expression_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Exit_Statement is
begin
return Result : Exit_Statement :=
(Exit_Token => Exit_Token, Exit_Loop_Name => Exit_Loop_Name,
When_Token => When_Token, Condition => Condition,
Semicolon_Token => Semicolon_Token, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Exit_Loop_Name : Program.Elements.Expressions.Expression_Access;
Condition : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Exit_Statement is
begin
return Result : Implicit_Exit_Statement :=
(Exit_Loop_Name => Exit_Loop_Name, Condition => Condition,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Exit_Loop_Name
(Self : Base_Exit_Statement)
return Program.Elements.Expressions.Expression_Access is
begin
return Self.Exit_Loop_Name;
end Exit_Loop_Name;
overriding function Condition
(Self : Base_Exit_Statement)
return Program.Elements.Expressions.Expression_Access is
begin
return Self.Condition;
end Condition;
overriding function Exit_Token
(Self : Exit_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Exit_Token;
end Exit_Token;
overriding function When_Token
(Self : Exit_Statement)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.When_Token;
end When_Token;
overriding function Semicolon_Token
(Self : Exit_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Exit_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Exit_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Exit_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : in out Base_Exit_Statement'Class) is
begin
if Self.Exit_Loop_Name.Assigned then
Set_Enclosing_Element (Self.Exit_Loop_Name, Self'Unchecked_Access);
end if;
if Self.Condition.Assigned then
Set_Enclosing_Element (Self.Condition, Self'Unchecked_Access);
end if;
null;
end Initialize;
overriding function Is_Exit_Statement
(Self : Base_Exit_Statement)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Exit_Statement;
overriding function Is_Statement
(Self : Base_Exit_Statement)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Statement;
overriding procedure Visit
(Self : not null access Base_Exit_Statement;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Exit_Statement (Self);
end Visit;
overriding function To_Exit_Statement_Text
(Self : in out Exit_Statement)
return Program.Elements.Exit_Statements.Exit_Statement_Text_Access is
begin
return Self'Unchecked_Access;
end To_Exit_Statement_Text;
overriding function To_Exit_Statement_Text
(Self : in out Implicit_Exit_Statement)
return Program.Elements.Exit_Statements.Exit_Statement_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Exit_Statement_Text;
end Program.Nodes.Exit_Statements;
|
pragma Ada_2012;
package body Latex_Writer.Picture is
--------------------
-- Within_Picture --
--------------------
procedure Within_Picture
(Output : File_Access;
Width : Picture_Length;
Heigth : Picture_Length;
Callback : access procedure (Output : File_Access))
is
begin
Put (Output.all, "\begin{picture}" & Picture.Pos (Width, Heigth));
New_Line (Output.all);
Callback (Output);
New_Line (Output.all);
Put_Line (Output.all, "\end{picture}");
end Within_Picture;
end Latex_Writer.Picture;
|
-------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- Copyright (C) 2018 Componolit GmbH
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with AUnit.Assertions; use AUnit.Assertions;
with Util; use Util;
with LSC.AES.CBC;
with LSC.Types;
use LSC;
pragma Style_Checks ("-s");
pragma Warnings (Off, "formal parameter ""T"" is not referenced");
package body LSC_Test_AES_CBC is
-- All test vectors are from
-- Morris Dworkin: NIST Special Publication 800-38A, Recommendation for
-- Block Cipher Modes of Operation, Methods and Techniques, F.2 CBC
-- Example vectors
---------------------------------------------------------------------------
-- NIST SP 800-38A, F.2.2 - CBC-AES128.Decrypt
procedure Test_AES128_CBC_Decrypt (T : in out Test_Cases.Test_Case'Class)
is
use type LSC.Types.Bytes;
Plaintext : LSC.Types.Bytes (1 .. 64);
begin
AES.CBC.Decrypt (Ciphertext => S2B ("7649abac8119b246cee98e9b12e9197d" &
"5086cb9b507219ee95db113a917678b2" &
"73bed6b8e3c1743b7116e69e22229516" &
"3ff1caa1681fac09120eca307586e1a7"),
Key => AES.Dec_Key (K => S2B ("2b7e151628aed2a6abf7158809cf4f3c"),
Keylen => AES.L128),
IV => S2B ("000102030405060708090a0b0c0d0e0f"),
Plaintext => Plaintext);
Assert (Plaintext = S2B ("6bc1bee22e409f96e93d7e117393172a" &
"ae2d8a571e03ac9c9eb76fac45af8e51" &
"30c81c46a35ce411e5fbc1191a0a52ef" &
"f69f2445df4f9b17ad2b417be66c3710"),
"Invalid plaintext: " & B2S (Plaintext));
end Test_AES128_CBC_Decrypt;
---------------------------------------------------------------------------
-- NIST SP 800-38A, F.2.1 - CBC-AES128.Encrypt
procedure Test_AES128_CBC_Encrypt (T : in out Test_Cases.Test_Case'Class)
is
use type LSC.Types.Bytes;
Ciphertext : LSC.Types.Bytes (1 .. 64);
begin
AES.CBC.Encrypt (Plaintext => S2B ("6bc1bee22e409f96e93d7e117393172a" &
"ae2d8a571e03ac9c9eb76fac45af8e51" &
"30c81c46a35ce411e5fbc1191a0a52ef" &
"f69f2445df4f9b17ad2b417be66c3710"),
IV => S2B ("000102030405060708090a0b0c0d0e0f"),
Key => AES.Enc_Key (K => S2B ("2b7e151628aed2a6abf7158809cf4f3c"),
Keylen => AES.L128),
Ciphertext => Ciphertext);
Assert (Ciphertext = S2B ("7649abac8119b246cee98e9b12e9197d" &
"5086cb9b507219ee95db113a917678b2" &
"73bed6b8e3c1743b7116e69e22229516" &
"3ff1caa1681fac09120eca307586e1a7"),
"Invalid ciphertext: " & B2S (Ciphertext));
end Test_AES128_CBC_Encrypt;
---------------------------------------------------------------------------
-- NIST SP 800-38A, F.2.4 - CBC-AES192.Decrypt
procedure Test_AES192_CBC_Decrypt (T : in out Test_Cases.Test_Case'Class)
is
use type LSC.Types.Bytes;
Plaintext : LSC.Types.Bytes (1 .. 64);
begin
AES.CBC.Decrypt (Ciphertext => S2B ("4f021db243bc633d7178183a9fa071e8" &
"b4d9ada9ad7dedf4e5e738763f69145a" &
"571b242012fb7ae07fa9baac3df102e0" &
"08b0e27988598881d920a9e64f5615cd"),
IV => S2B ("000102030405060708090a0b0c0d0e0f"),
Key => AES.Dec_Key (K => S2B ("8e73b0f7da0e6452c810f32b809079e562f8ead2522c6b7b"),
Keylen => AES.L192),
Plaintext => Plaintext);
Assert (Plaintext = S2B ("6bc1bee22e409f96e93d7e117393172a" &
"ae2d8a571e03ac9c9eb76fac45af8e51" &
"30c81c46a35ce411e5fbc1191a0a52ef" &
"f69f2445df4f9b17ad2b417be66c3710"),
"Invalid plaintext: " & B2S (Plaintext));
end Test_AES192_CBC_Decrypt;
---------------------------------------------------------------------------
-- NIST SP 800-38A, F.2.3 - CBC-AES192.Encrypt
procedure Test_AES192_CBC_Encrypt (T : in out Test_Cases.Test_Case'Class)
is
use type LSC.Types.Bytes;
Ciphertext : LSC.Types.Bytes (1 .. 64);
begin
AES.CBC.Encrypt (Plaintext => S2B ("6bc1bee22e409f96e93d7e117393172a" &
"ae2d8a571e03ac9c9eb76fac45af8e51" &
"30c81c46a35ce411e5fbc1191a0a52ef" &
"f69f2445df4f9b17ad2b417be66c3710"),
IV => S2B ("000102030405060708090a0b0c0d0e0f"),
Key => AES.Enc_Key (K => S2B ("8e73b0f7da0e6452c810f32b809079e562f8ead2522c6b7b"),
Keylen => AES.L192),
Ciphertext => Ciphertext);
Assert (Ciphertext = S2B ("4f021db243bc633d7178183a9fa071e8" &
"b4d9ada9ad7dedf4e5e738763f69145a" &
"571b242012fb7ae07fa9baac3df102e0" &
"08b0e27988598881d920a9e64f5615cd"),
"Invalid ciphertext: " & B2S (Ciphertext));
end Test_AES192_CBC_Encrypt;
---------------------------------------------------------------------------
-- NIST SP 800-38A, F.2.6 - CBC-AES256.Decrypt
procedure Test_AES256_CBC_Decrypt (T : in out Test_Cases.Test_Case'Class)
is
use type LSC.Types.Bytes;
Plaintext : LSC.Types.Bytes (1 .. 64);
begin
AES.CBC.Decrypt (Ciphertext => S2B ("f58c4c04d6e5f1ba779eabfb5f7bfbd6" &
"9cfc4e967edb808d679f777bc6702c7d" &
"39f23369a9d9bacfa530e26304231461" &
"b2eb05e2c39be9fcda6c19078c6a9d1b"),
IV => S2B ("000102030405060708090a0b0c0d0e0f"),
Key => AES.Dec_Key (K => S2B ("603deb1015ca71be2b73aef0857d7781" &
"1f352c073b6108d72d9810a30914dff4"),
Keylen => AES.L256),
Plaintext => Plaintext);
Assert (Plaintext = S2B ("6bc1bee22e409f96e93d7e117393172a" &
"ae2d8a571e03ac9c9eb76fac45af8e51" &
"30c81c46a35ce411e5fbc1191a0a52ef" &
"f69f2445df4f9b17ad2b417be66c3710"),
"Invalid plaintext: " & B2S (Plaintext));
end Test_AES256_CBC_Decrypt;
---------------------------------------------------------------------------
-- NIST SP 800-38A, F.2.5 - CBC-AES256.Encrypt
procedure Test_AES256_CBC_Encrypt (T : in out Test_Cases.Test_Case'Class)
is
use type LSC.Types.Bytes;
Ciphertext : LSC.Types.Bytes (1 .. 64);
begin
AES.CBC.Encrypt (Plaintext => S2B ("6bc1bee22e409f96e93d7e117393172a" &
"ae2d8a571e03ac9c9eb76fac45af8e51" &
"30c81c46a35ce411e5fbc1191a0a52ef" &
"f69f2445df4f9b17ad2b417be66c3710"),
Key => AES.Enc_Key (K => S2B ("603deb1015ca71be2b73aef0857d7781" &
"1f352c073b6108d72d9810a30914dff4"),
Keylen => AES.L256),
IV => S2B ("000102030405060708090a0b0c0d0e0f"),
Ciphertext => Ciphertext);
Assert (Ciphertext = S2B ("f58c4c04d6e5f1ba779eabfb5f7bfbd6" &
"9cfc4e967edb808d679f777bc6702c7d" &
"39f23369a9d9bacfa530e26304231461" &
"b2eb05e2c39be9fcda6c19078c6a9d1b"),
"Invalid ciphertext: " & B2S (Ciphertext));
end Test_AES256_CBC_Encrypt;
---------------------------------------------------------------------------
procedure Register_Tests (T : in out Test_Case) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Test_AES128_CBC_Decrypt'Access, "AES-128-CBC decryption");
Register_Routine (T, Test_AES128_CBC_Encrypt'Access, "AES-128-CBC encryption");
Register_Routine (T, Test_AES192_CBC_Decrypt'Access, "AES-192-CBC decryption");
Register_Routine (T, Test_AES192_CBC_Encrypt'Access, "AES-192-CBC encryption");
Register_Routine (T, Test_AES256_CBC_Decrypt'Access, "AES-256-CBC decryption");
Register_Routine (T, Test_AES256_CBC_Encrypt'Access, "AES-256-CBC encryption");
end Register_Tests;
---------------------------------------------------------------------------
function Name (T : Test_Case) return Test_String is
begin
return Format ("AES-CBC");
end Name;
end LSC_Test_AES_CBC;
|
-- C74302B.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 WHEN THE FULL DECLARATION OF A DEFERRED CONSTANT IS
-- GIVEN AS A MULTIPLE DECLARATION, THE INITIALIZATION EXPRESSION
-- IS EVALUATED ONCE FOR EACH DEFERRED CONSTANT. (USE ENUMERATION,
-- INTEGER, FIXED POINT, FLOATING POINT, ARRAY, RECORD (INCLUDING
-- USE OF DEFAULT EXPRESSIONS FOR COMPONENTS), ACCESS, AND PRIVATE
-- TYPES AS FULL DECLARATION OF PRIVATE TYPE)
-- HISTORY:
-- BCB 07/25/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE C74302B IS
TYPE ARR_RAN IS RANGE 1..2;
BUMP : INTEGER := IDENT_INT(0);
GENERIC
TYPE DT IS (<>);
FUNCTION F1 RETURN DT;
GENERIC
TYPE FE IS DELTA <>;
FUNCTION F2 RETURN FE;
GENERIC
TYPE FLE IS DIGITS <>;
FUNCTION F3 RETURN FLE;
GENERIC
TYPE CA IS ARRAY(ARR_RAN) OF INTEGER;
FUNCTION F4 RETURN CA;
GENERIC
TYPE GP IS LIMITED PRIVATE;
FUNCTION F5 (V : GP) RETURN GP;
GENERIC
TYPE GP1 IS LIMITED PRIVATE;
FUNCTION F6 (V1 : GP1) RETURN GP1;
GENERIC
TYPE AC IS ACCESS INTEGER;
FUNCTION F7 RETURN AC;
GENERIC
TYPE PP IS PRIVATE;
FUNCTION F8 (P1 : PP) RETURN PP;
FUNCTION F1 RETURN DT IS
BEGIN
BUMP := BUMP + 1;
RETURN DT'VAL(BUMP);
END F1;
FUNCTION F2 RETURN FE IS
BEGIN
BUMP := BUMP + 1;
RETURN FE(BUMP);
END F2;
FUNCTION F3 RETURN FLE IS
BEGIN
BUMP := BUMP + 1;
RETURN FLE(BUMP);
END F3;
FUNCTION F4 RETURN CA IS
BEGIN
BUMP := BUMP + 1;
RETURN ((BUMP,BUMP-1));
END F4;
FUNCTION F5 (V : GP) RETURN GP IS
BEGIN
BUMP := BUMP + 1;
RETURN V;
END F5;
FUNCTION F6 (V1 : GP1) RETURN GP1 IS
BEGIN
BUMP := BUMP + 1;
RETURN V1;
END F6;
FUNCTION F7 RETURN AC IS
VAR : AC;
BEGIN
BUMP := BUMP + 1;
VAR := NEW INTEGER'(BUMP);
RETURN VAR;
END F7;
FUNCTION F8 (P1 : PP) RETURN PP IS
BEGIN
BUMP := BUMP + 1;
RETURN P1;
END F8;
PACKAGE PACK IS
TYPE SP IS PRIVATE;
CONS : CONSTANT SP;
PRIVATE
TYPE SP IS RANGE 1 .. 100;
CONS : CONSTANT SP := 50;
END PACK;
USE PACK;
PACKAGE P IS
TYPE INT IS PRIVATE;
TYPE ENUM IS PRIVATE;
TYPE FIX IS PRIVATE;
TYPE FLT IS PRIVATE;
TYPE CON_ARR IS PRIVATE;
TYPE REC IS PRIVATE;
TYPE REC1 IS PRIVATE;
TYPE ACC IS PRIVATE;
TYPE PRIV IS PRIVATE;
GENERIC
TYPE LP IS PRIVATE;
FUNCTION GEN_EQUAL (Z1, Z2 : LP) RETURN BOOLEAN;
I1, I2, I3, I4 : CONSTANT INT;
E1, E2, E3, E4 : CONSTANT ENUM;
FI1, FI2, FI3, FI4 : CONSTANT FIX;
FL1, FL2, FL3, FL4 : CONSTANT FLT;
CA1, CA2, CA3, CA4 : CONSTANT CON_ARR;
R1, R2, R3, R4 : CONSTANT REC;
R1A, R2A, R3A, R4A : CONSTANT REC1;
A1, A2, A3, A4 : CONSTANT ACC;
PR1, PR2, PR3, PR4 : CONSTANT PRIV;
PRIVATE
TYPE INT IS RANGE 1 .. 100;
TYPE ENUM IS (ONE,TWO,THREE,FOUR,FIVE,SIX,SEVEN,EIGHT,NINE);
TYPE FIX IS DELTA 2.0**(-1) RANGE -100.0 .. 100.0;
TYPE FLT IS DIGITS 5 RANGE -100.0 .. 100.0;
TYPE CON_ARR IS ARRAY(ARR_RAN) OF INTEGER;
TYPE REC IS RECORD
COMP1 : INTEGER;
COMP2 : INTEGER;
COMP3 : BOOLEAN;
END RECORD;
TYPE REC1 IS RECORD
COMP1 : INTEGER := 10;
COMP2 : INTEGER := 20;
COMP3 : BOOLEAN := FALSE;
END RECORD;
TYPE ACC IS ACCESS INTEGER;
TYPE PRIV IS NEW SP;
FUNCTION DDT IS NEW F1 (INT);
FUNCTION EDT IS NEW F1 (ENUM);
FUNCTION FDT IS NEW F2 (FIX);
FUNCTION FLDT IS NEW F3 (FLT);
FUNCTION CADT IS NEW F4 (CON_ARR);
FUNCTION RDT IS NEW F5 (REC);
FUNCTION R1DT IS NEW F6 (REC1);
FUNCTION ADT IS NEW F7 (ACC);
FUNCTION PDT IS NEW F8 (PRIV);
REC_OBJ : REC := (1,2,TRUE);
REC1_OBJ : REC1 := (3,4,FALSE);
I1, I2, I3, I4 : CONSTANT INT := DDT;
E1, E2, E3, E4 : CONSTANT ENUM := EDT;
FI1, FI2, FI3, FI4 : CONSTANT FIX := FDT;
FL1, FL2, FL3, FL4 : CONSTANT FLT := FLDT;
CA1, CA2, CA3, CA4 : CONSTANT CON_ARR := CADT;
R1, R2, R3, R4 : CONSTANT REC := RDT(REC_OBJ);
R1A, R2A, R3A, R4A : CONSTANT REC1 := R1DT(REC1_OBJ);
A1, A2, A3, A4 : CONSTANT ACC := ADT;
PR1, PR2, PR3, PR4 : CONSTANT PRIV := PDT(PRIV(CONS));
END P;
PACKAGE BODY P IS
AVAR1 : ACC := NEW INTEGER'(29);
AVAR2 : ACC := NEW INTEGER'(30);
AVAR3 : ACC := NEW INTEGER'(31);
AVAR4 : ACC := NEW INTEGER'(32);
FUNCTION GEN_EQUAL (Z1, Z2 : LP) RETURN BOOLEAN IS
BEGIN
RETURN Z1 = Z2;
END GEN_EQUAL;
FUNCTION INT_EQUAL IS NEW GEN_EQUAL (INT);
FUNCTION ENUM_EQUAL IS NEW GEN_EQUAL (ENUM);
FUNCTION FIX_EQUAL IS NEW GEN_EQUAL (FIX);
FUNCTION FLT_EQUAL IS NEW GEN_EQUAL (FLT);
FUNCTION ARR_EQUAL IS NEW GEN_EQUAL (CON_ARR);
FUNCTION REC_EQUAL IS NEW GEN_EQUAL (REC);
FUNCTION REC1_EQUAL IS NEW GEN_EQUAL (REC1);
FUNCTION ACC_EQUAL IS NEW GEN_EQUAL (INTEGER);
FUNCTION PRIV_EQUAL IS NEW GEN_EQUAL (PRIV);
BEGIN
TEST ("C74302B", "CHECK THAT WHEN THE FULL DECLARATION OF " &
"A DEFERRED CONSTANT IS GIVEN AS A " &
"MULTIPLE DECLARATION, THE INITIALIZATION " &
"EXPRESSION IS EVALUATED ONCE FOR EACH " &
"DEFERRED CONSTANT");
IF NOT EQUAL(BUMP,36) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED CONSTANTS IN A MULIPLE DECLARATION");
END IF;
IF NOT INT_EQUAL(I1,1) OR NOT INT_EQUAL(I2,2) OR
NOT INT_EQUAL(I3,3) OR NOT INT_EQUAL(I4,4) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED INTEGER CONSTANTS");
END IF;
IF NOT ENUM_EQUAL(E1,SIX) OR NOT ENUM_EQUAL(E2,SEVEN) OR
NOT ENUM_EQUAL(E3,EIGHT) OR NOT ENUM_EQUAL(E4,NINE) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED ENUMERATION CONSTANTS");
END IF;
IF NOT FIX_EQUAL(FI1,9.0) OR NOT FIX_EQUAL(FI2,10.0) OR
NOT FIX_EQUAL(FI3,11.0) OR NOT FIX_EQUAL(FI4,12.0) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED FIXED POINT CONSTANTS");
END IF;
IF NOT FLT_EQUAL(FL1,13.0) OR NOT FLT_EQUAL(FL2,14.0) OR
NOT FLT_EQUAL(FL3,15.0) OR NOT FLT_EQUAL(FL4,16.0) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED FLOATING POINT CONSTANTS");
END IF;
IF NOT ARR_EQUAL(CA1,(17,16)) OR NOT ARR_EQUAL(CA2,(18,17))
OR NOT ARR_EQUAL(CA3,(19,18)) OR NOT ARR_EQUAL(CA4,(20,19))
THEN FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED ARRAY CONSTANTS");
END IF;
IF NOT REC_EQUAL(R1,REC_OBJ) OR NOT REC_EQUAL(R2,REC_OBJ)
OR NOT REC_EQUAL(R3,REC_OBJ) OR NOT REC_EQUAL(R4,REC_OBJ)
THEN FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED RECORD CONSTANTS");
END IF;
IF NOT REC1_EQUAL(R1A,REC1_OBJ) OR NOT REC1_EQUAL(R2A,
REC1_OBJ) OR NOT REC1_EQUAL(R3A,REC1_OBJ) OR NOT
REC1_EQUAL(R4A,REC1_OBJ) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED RECORD CONSTANTS WITH DEFAULT " &
"EXPRESSIONS");
END IF;
IF NOT ACC_EQUAL(A1.ALL,AVAR1.ALL) OR NOT ACC_EQUAL(A2.ALL,
AVAR2.ALL) OR NOT ACC_EQUAL(A3.ALL,AVAR3.ALL) OR NOT
ACC_EQUAL(A4.ALL,AVAR4.ALL) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED ACCESS CONSTANTS");
END IF;
IF NOT PRIV_EQUAL(PR1,PRIV(CONS)) OR NOT PRIV_EQUAL(PR2,
PRIV(CONS)) OR NOT PRIV_EQUAL(PR3,PRIV(CONS)) OR NOT
PRIV_EQUAL(PR4,PRIV(CONS)) THEN
FAILED ("IMPROPER RESULTS FROM INITIALIZATION OF " &
"DEFERRED PRIVATE CONSTANTS");
END IF;
RESULT;
END P;
USE P;
BEGIN
NULL;
END C74302B;
|
-- Copyright 2017-2021 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "Spyse"
type = "api"
function start()
setratelimit(1)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
for i = 0,10000,100 do
local u = subsurl(domain, i)
local resp = getpage(ctx, u, c.key, cfg.ttl)
if (resp == "") then
break
end
local d = json.decode(resp)
if (d == nil or #(d['data'].items) == 0) then
return false
end
for i, item in pairs(d['data'].items) do
sendnames(ctx, item.name)
end
end
end
function subsurl(domain, offset)
return "https://api.spyse.com/v3/data/domain/subdomain?domain=" .. domain .. "&limit=100&offset=" .. tostring(offset)
end
function horizontal(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
-- Spyse API domain/related/domain often returns false positives (domains not owned by the provided domain)
--horizonnames(ctx, domain, c.key, cfg.ttl)
horizoncerts(ctx, domain, c.key, cfg.ttl)
end
function horizonnames(ctx, domain, key, ttl)
for i = 0,10000,100 do
u = namesurl(domain, i)
resp = getpage(ctx, u, key, ttl)
if (resp == "") then
break
end
local d = json.decode(resp)
if (d == nil or #(d['data'].items) == 0) then
break
end
for i, item in pairs(d['data'].items) do
if (item.domain.name ~= "") then
local names = find(item.domain.name, subdomainre)
if (names ~= nil and #names > 0 and names[1] ~= "") then
associated(ctx, domain, names[1])
end
end
end
end
end
function namesurl(domain, offset)
return "https://api.spyse.com/v3/data/domain/related/domain?domain=" .. domain .. "&limit=100&offset=" .. tostring(offset)
end
function horizoncerts(ctx, domain, key, ttl)
local u = "https://api.spyse.com/v3/data/domain/org?domain=" .. domain
local resp = getpage(ctx, u, key, ttl)
if (resp == "") then
return
end
local d = json.decode(resp)
if (d == nil or d['data'].id == nil) then
return
end
local orgid = d['data'].id
for i = 0,10000,100 do
u = certsurl(orgid, i)
resp = getpage(ctx, u, key, ttl)
if (resp == "") then
break
end
local d = json.decode(resp)
if (d == nil or #(d['data'].items) == 0) then
break
end
for i, item in pairs(d['data'].items) do
local san = item.parsed.extensions.subject_alt_name
if (san ~= nil and #(san.dns_names) > 0) then
for j, name in pairs(san.dns_names) do
local names = find(name, subdomainre)
if (names ~= nil and #names > 0 and names[1] ~= "") then
associated(ctx, domain, names[1])
end
end
end
end
end
end
function certsurl(id, offset)
return "https://api.spyse.com/v3/data/org/cert/subject?id=" .. id .. "&limit=100&offset=" .. tostring(offset)
end
function asn(ctx, addr, asn)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
local prefix
if (asn == 0) then
if (addr == "") then
return
end
asn, prefix = getasn(ctx, addr, c.key, cfg.ttl)
if (asn == 0) then
return
end
end
local a = asinfo(ctx, asn, c.key, cfg.ttl)
if (a == nil or #(a.netblocks) == 0) then
return
end
if (prefix == "") then
prefix = a.netblocks[1]
parts = split(prefix, "/")
addr = parts[1]
end
newasn(ctx, {
['addr']=addr,
['asn']=asn,
['prefix']=prefix,
['desc']=a.desc,
['netblocks']=a.netblocks,
})
end
function getasn(ctx, ip, key, ttl)
local u = "https://api.spyse.com/v3/data/ip?ip=" .. tostring(ip)
local resp = getpage(ctx, u, key, ttl)
if (resp == "") then
return 0, ""
end
local d = json.decode(resp)
if (d == nil or #(d['data'].items) == 0) then
return 0, ""
end
local cidr
local asn = 0
for i, item in pairs(d['data'].items) do
local num = item.isp_info.as_num
if (asn == 0 or asn < num) then
asn = num
cidr = item.cidr
end
end
return asn, cidr
end
function asinfo(ctx, asn, key, ttl)
local u = "https://api.spyse.com/v3/data/as?asn=" .. tostring(asn)
local resp = getpage(ctx, u, key, ttl)
if (resp == "") then
return nil
end
local d = json.decode(resp)
if (d == nil or #(d['data'].items) == 0) then
return nil
end
local cidrs = {}
for i, p in pairs(d.items[1].ipv4_cidr_array) do
table.insert(cidrs, p.ip .. "/" .. tostring(p.cidr))
end
for i, p in pairs(d.items[1].ipv6_cidr_array) do
table.insert(cidrs, p.ip .. "/" .. tostring(p.cidr))
end
return {
desc=d.items[1].as_org,
netblocks=cidrs,
}
end
function getpage(ctx, url, key, ttl)
local resp, err = request(ctx, {
['url']=url,
headers={
['Authorization']="Bearer " .. key,
['Content-Type']="application/json",
},
})
if (err ~= nil and err ~= "") then
return ""
end
return resp
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if (names == nil) then
return
end
local found = {}
for i, v in pairs(names) do
if (found[v] == nil) then
newname(ctx, v)
found[v] = true
end
end
end
function split(str, delim)
local result = {}
local pattern = "[^%" .. delim .. "]+"
local matches = find(str, pattern)
if (matches == nil or #matches == 0) then
return result
end
for i, match in pairs(matches) do
table.insert(result, match)
end
return result
end
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, 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$
------------------------------------------------------------------------------
package body AMF.Reflective_Collections is
---------
-- Add --
---------
procedure Add
(Self : Reflective_Collection'Class;
Item : League.Holders.Holder) is
begin
null;
end Add;
------------
-- Adjust --
------------
overriding procedure Adjust (Self : in out Reflective_Collection) is
begin
Self.Collection.Reference;
end Adjust;
-----------
-- Clear --
-----------
procedure Clear (Self : in out Reflective_Collection'Class) is
begin
Self.Collection.Clear;
end Clear;
-------------
-- Element --
-------------
function Element
(Self : Reflective_Collection'Class;
Index : Positive) return League.Holders.Holder is
begin
return Self.Collection.Element (Index);
end Element;
--------------
-- Finalize --
--------------
overriding procedure Finalize (Self : in out Reflective_Collection) is
use type AMF.Internals.Collections.Shared_Collection_Access;
begin
if Self.Collection /= null then
Self.Collection.Unreference;
Self.Collection := null;
end if;
end Finalize;
------------
-- Length --
------------
function Length (Self : Reflective_Collection'Class) return Natural is
begin
return Self.Collection.Length;
end Length;
end AMF.Reflective_Collections;
|
with Number.Api;
package Benchmark_S_Number is
procedure Create (N : Integer; File_Name : String);
procedure Write (N : Integer; File_Name : String);
procedure Read (N : Integer; File_Name : String);
procedure Reset (N : Integer; File_Name : String);
end Benchmark_S_Number;
|
with
Ada.Containers.Vectors,
Ada.Streams;
package AdaM.Declaration.of_type
is
type Item is new Declaration.item with private;
-- View
--
type View is access all Item'Class;
procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : in View);
procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : out View);
for View'write use View_write;
for View'read use View_read;
-- Vector
--
package Vectors is new ada.Containers.Vectors (Positive, View);
subtype Vector is Vectors.Vector;
-- Forge
--
function new_Declaration return Declaration.of_type.view;
procedure free (Self : in out Declaration.of_type.view);
overriding
procedure destruct (Self : in out Declaration.of_type.item);
-- Attributes
--
overriding
function Id (Self : access Item) return AdaM.Id;
private
type Item is new Declaration.item with
record
null;
end record;
end AdaM.Declaration.of_type;
|
-- { dg-do run }
-- { dg-options "-O2" }
with Concat1_Pkg; use Concat1_Pkg;
procedure Concat1 is
Ident_1 : Integer := Ident (1);
Ident_2 : Integer := Ident (2);
Ident_5 : Integer := Ident (5);
type Arr is array (Integer range <>) of Integer;
A : Arr (1..10);
begin
A := (1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
A := 0 & A(Ident_1..Ident_2) & A(Ident_1..Ident_2) & A(Ident_1..Ident_5);
if A /= (0, 1, 2, 1, 2, 1, 2, 3, 4, 5) then
raise Program_Error;
end if;
end;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . G E N E R I C _ A R R A Y _ S O R T --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Containers.Generic_Constrained_Array_Sort;
procedure Ada.Containers.Generic_Array_Sort
(Container : in out Array_Type)
is
subtype Index_Subtype is
Index_Type range Container'First .. Container'Last;
subtype Array_Subtype is
Array_Type (Index_Subtype);
procedure Sort is
new Generic_Constrained_Array_Sort
(Index_Type => Index_Subtype,
Element_Type => Element_Type,
Array_Type => Array_Subtype,
"<" => "<");
begin
Sort (Container);
end Ada.Containers.Generic_Array_Sort;
|
-- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
package body Bases.Test_Data is
procedure Set_Up(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Tear_Down;
end Bases.Test_Data;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Element_Vectors;
with Program.Elements.Defining_Names;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Expressions;
with Program.Elements.Generic_Package_Declarations;
with Program.Element_Visitors;
package Program.Nodes.Generic_Package_Declarations is
pragma Preelaborate;
type Generic_Package_Declaration is
new Program.Nodes.Node
and Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration
and Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration_Text
with private;
function Create
(Generic_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Formal_Parameters : Program.Element_Vectors.Element_Vector_Access;
Package_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Visible_Declarations : Program.Element_Vectors.Element_Vector_Access;
Private_Token : Program.Lexical_Elements.Lexical_Element_Access;
Private_Declarations : Program.Element_Vectors.Element_Vector_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Generic_Package_Declaration;
type Implicit_Generic_Package_Declaration is
new Program.Nodes.Node
and Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration
with private;
function Create
(Formal_Parameters : Program.Element_Vectors.Element_Vector_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Visible_Declarations : Program.Element_Vectors.Element_Vector_Access;
Private_Declarations : Program.Element_Vectors.Element_Vector_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Generic_Package_Declaration
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Generic_Package_Declaration is
abstract new Program.Nodes.Node
and Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration
with record
Formal_Parameters : Program.Element_Vectors.Element_Vector_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Visible_Declarations : Program.Element_Vectors.Element_Vector_Access;
Private_Declarations : Program.Element_Vectors.Element_Vector_Access;
End_Name : Program.Elements.Expressions.Expression_Access;
end record;
procedure Initialize
(Self : aliased in out Base_Generic_Package_Declaration'Class);
overriding procedure Visit
(Self : not null access Base_Generic_Package_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Formal_Parameters
(Self : Base_Generic_Package_Declaration)
return Program.Element_Vectors.Element_Vector_Access;
overriding function Name
(Self : Base_Generic_Package_Declaration)
return not null Program.Elements.Defining_Names.Defining_Name_Access;
overriding function Aspects
(Self : Base_Generic_Package_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
overriding function Visible_Declarations
(Self : Base_Generic_Package_Declaration)
return Program.Element_Vectors.Element_Vector_Access;
overriding function Private_Declarations
(Self : Base_Generic_Package_Declaration)
return Program.Element_Vectors.Element_Vector_Access;
overriding function End_Name
(Self : Base_Generic_Package_Declaration)
return Program.Elements.Expressions.Expression_Access;
overriding function Is_Generic_Package_Declaration_Element
(Self : Base_Generic_Package_Declaration)
return Boolean;
overriding function Is_Declaration_Element
(Self : Base_Generic_Package_Declaration)
return Boolean;
type Generic_Package_Declaration is
new Base_Generic_Package_Declaration
and Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration_Text
with record
Generic_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Package_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Private_Token : Program.Lexical_Elements.Lexical_Element_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Generic_Package_Declaration_Text
(Self : aliased in out Generic_Package_Declaration)
return Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration_Text_Access;
overriding function Generic_Token
(Self : Generic_Package_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Package_Token
(Self : Generic_Package_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token
(Self : Generic_Package_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Is_Token
(Self : Generic_Package_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Private_Token
(Self : Generic_Package_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function End_Token
(Self : Generic_Package_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Generic_Package_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Generic_Package_Declaration is
new Base_Generic_Package_Declaration
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Generic_Package_Declaration_Text
(Self : aliased in out Implicit_Generic_Package_Declaration)
return Program.Elements.Generic_Package_Declarations
.Generic_Package_Declaration_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Generic_Package_Declaration)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Generic_Package_Declaration)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Generic_Package_Declaration)
return Boolean;
end Program.Nodes.Generic_Package_Declarations;
|
------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- Command Line Interface --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This package contains routines and utilities for driving the CLI.
--
-- Note that these primatives also react to non-terminal executions, and omit
-- fancier UI features in those circumstances
with Ada.Text_IO;
with CLI;
with Progress;
package UI_Primitives is
-- Configuration
Progress_Poll_Rate: constant Duration := 0.05;
Auto_Queries: Boolean := False;
-- If True on entry to User_Query, the Default Response is immediately
-- submitted
-- Standard Error Routines
package STDERR is
package TIO renames Ada.Text_IO;
procedure Put (File: in TIO.File_Type := TIO.Standard_Error;
Item: in String)
renames TIO.Put;
procedure Put_Line (File : in TIO.File_Type := TIO.Standard_Error;
Message: in String)
renames TIO.Put_Line;
procedure New_Line (File : in TIO.File_Type := TIO.Standard_Error;
Spacing: in TIO.Positive_Count := 1)
renames TIO.New_Line;
end STDERR;
-- Static content
procedure Print_Banner;
procedure Print_Help;
-- Line tags
type Tag_Type is (EXEC, OK, FAIL, WARN, QUERY, INFO);
procedure Put_Tag (Tag: Tag_Type);
procedure Put_Exec_Tag (Tag: Tag_Type := EXEC ) renames Put_Tag;
procedure Put_OK_Tag (Tag: Tag_Type := OK ) renames Put_Tag;
procedure Put_Fail_Tag (Tag: Tag_Type := FAIL ) renames Put_Tag;
procedure Put_Warn_Tag (Tag: Tag_Type := WARN ) renames Put_Tag;
procedure Put_Query_Tag (Tag: Tag_Type := QUERY) renames Put_Tag;
procedure Put_Info_Tag (Tag: Tag_Type := INFO ) renames Put_Tag;
procedure Put_Empty_Tag;
-- Writes a series of spaces the same length as a tag
procedure Put_Divider;
-- Outputs a full width string of '-' characters
procedure Query_Driver (Prompt : in String;
Default : in String;
Response: out String;
Last : out Natural)
with Pre => Default'Length = Response'Length;
-- For use with the User_Queries package
procedure Dump_Reports;
-- Debug
procedure Dump_Repositories;
procedure Dump_Subsystems;
procedure Dump_Library_Units;
-- procedure Dump_Dependency_Map;
-- Normal Operations
procedure Prep_Tracker (Process_Title: in String;
Spinner_Only : in Boolean := False);
-- Clears the current line and outputs Process_Title and a dummy progress
-- bar in the style of Wait_Tracker. This is used before a sequential action
-- that dispatches work orders is executed, particularily when that action
-- may take a noticable amount of time.
--
-- Prep_Tracker has no effect if output is not to a terminal
procedure Wait_Tracker (Process_Title : in String;
Tracker : in out Progress.Progress_Tracker;
Failures : out Boolean;
Timedout : out Boolean;
Spinner_Only : in Boolean := False;
Process_Timeout: in Duration := 60.0);
-- Clears the current line and outputs Process_Title, a progress bar, as
-- well as a a numeric completed/total value.
--
-- User Queries are handled until the tracker completes.
--
-- If Spinner_Only is true, the progress bar and numeric counters are not
-- displayed.
--
-- This information is updated at Progress_Pool_Rate, until the progress
-- tracker completes, or if Progress_Total_Timeout elapses without any
-- changes to the tracker values
procedure Wait_Tracker_Or_Abort
(Process_Title : in String;
Tracker : in out Progress.Progress_Tracker;
Spinner_Only : in Boolean := False;
Process_Timeout: in Duration := 20.0);
-- Invokes Wait_Tracker, and reports Timeout or Failed, before raising
-- the Scheduling.Process_Failed exception
procedure Put_Info (Message: String);
-- If the output is a Terminal, this acts as a Put,
-- If the output is not a Terminal, this acts as a Put_Line.
--
-- The purpose of this operation is to make interactive runs a bit less
-- chatty, while scripted or CI/CD retain full output
end UI_Primitives;
|
pragma Check_Policy (Trace => Ignore);
with System.Address_To_Constant_Access_Conversions;
with System.Storage_Elements;
with System.Synchronous_Control;
with System.Unwind.Occurrences;
with System.Unwind.Standard;
package body System.Unwind.Raising is
pragma Suppress (All_Checks);
-- package separated for depending on libgcc
package Separated is
-- equivalent to Propagate_GCC_Exception (a-exexpr-gcc.adb)
procedure Propagate_Machine_Occurrence (
Machine_Occurrence :
not null Representation.Machine_Occurrence_Access)
with Convention => C;
pragma No_Return (Propagate_Machine_Occurrence);
end Separated;
package body Separated is separate;
function strlen (s : not null access Character)
return Storage_Elements.Storage_Count
with Import,
Convention => Intrinsic, External_Name => "__builtin_strlen";
-- equivalent to Complete_And_Propagate_Occurrence (a-exexpr-gcc.adb)
procedure Propagate_Machine_Occurrence (
Machine_Occurrence :
not null Representation.Machine_Occurrence_Access);
pragma No_Return (Propagate_Machine_Occurrence);
-- not calling Abort_Defer
-- equivalent to Raise_Exception_No_Defer (a-except-2005.adb)
procedure Raise_Exception_No_Defer (
E : not null Exception_Data_Access;
File : String := "";
Line : Integer := 0;
Column : Integer := 0;
Message : String := "");
pragma No_Return (Raise_Exception_No_Defer);
procedure Reraise_No_Defer (X : Exception_Occurrence);
pragma No_Return (Reraise_No_Defer);
-- for rcheck
procedure Raise_From_rcheck (
File : not null access Character;
Line : Integer;
E : not null Exception_Data_Access;
Message : String);
pragma No_Return (Raise_From_rcheck);
Explicit_Raise : constant String := "explicit raise";
Divide_By_Zero : constant String := "divide by zero";
Overflow_Check_Failed : constant String := "overflow check failed";
From_Finalize : constant String := "finalize/adjust raised exception";
-- implementation
-- at first of exclusion
function AAA return Address is
begin
<<Code>>
return Code'Address;
end AAA;
-- start private part in exclusion
procedure Propagate_Machine_Occurrence (
Machine_Occurrence :
not null Representation.Machine_Occurrence_Access) is
begin
declare
X : Exception_Occurrence
renames Machine_Occurrence.Occurrence;
begin
Occurrences.Backtrace (X);
Debug_Raise_Exception (X.Id, X.Msg (1 .. X.Msg_Length)); -- for GDB
end;
Separated.Propagate_Machine_Occurrence (Machine_Occurrence);
end Propagate_Machine_Occurrence;
procedure Raise_Exception_No_Defer (
E : not null Exception_Data_Access;
File : String := "";
Line : Integer := 0;
Column : Integer := 0;
Message : String := "")
is
Machine_Occurrence : Representation.Machine_Occurrence_Access;
begin
Machine_Occurrence := Occurrences.New_Machine_Occurrence (
Stack_Guard => Null_Address);
Occurrences.Set_Exception_Message (E, File, Line, Column,
Message => Message,
X => Machine_Occurrence.Occurrence);
Propagate_Machine_Occurrence (Machine_Occurrence);
end Raise_Exception_No_Defer;
procedure Raise_Exception (
E : not null Exception_Data_Access;
File : String := "";
Line : Integer := 0;
Column : Integer := 0;
Message : String := "") is
begin
if not ZCX_By_Default then
Synchronous_Control.Lock_Abort;
end if;
Raise_Exception_No_Defer (E, File, Line, Column, Message);
end Raise_Exception;
procedure Raise_From_Signal_Handler (
E : not null Exception_Data_Access;
Message : String;
Stack_Guard : Address)
is
Machine_Occurrence : Representation.Machine_Occurrence_Access;
begin
if not ZCX_By_Default then
Synchronous_Control.Lock_Abort;
end if;
Machine_Occurrence := Occurrences.New_Machine_Occurrence (
Stack_Guard => Stack_Guard);
Occurrences.Set_Exception_Message (E,
Message => Message,
X => Machine_Occurrence.Occurrence);
Propagate_Machine_Occurrence (Machine_Occurrence);
end Raise_From_Signal_Handler;
procedure Raise_E (
E : Exception_Data_Access;
Message : String)
is
Actual_E : Exception_Data_Access := E;
begin
if Actual_E = null then
Actual_E := Unwind.Standard.Constraint_Error'Access;
end if;
Raise_Exception (Actual_E, Message => Message);
end Raise_E;
procedure Raise_Exception_From_Here (
E : not null Exception_Data_Access;
File : String := Ada.Debug.File;
Line : Integer := Ada.Debug.Line) is
begin
Raise_Exception (E, File, Line, Message => Explicit_Raise);
end Raise_Exception_From_Here;
procedure Raise_Exception_From_Here_With (
E : not null Exception_Data_Access;
File : String := Ada.Debug.File;
Line : Integer := Ada.Debug.Line;
Message : String) is
begin
Raise_Exception (E, File, Line, Message => Message);
end Raise_Exception_From_Here_With;
procedure Reraise_No_Defer (X : Exception_Occurrence) is
Machine_Occurrence : Representation.Machine_Occurrence_Access;
begin
pragma Check (Trace, Ada.Debug.Put ("reraising..."));
Machine_Occurrence := Occurrences.New_Machine_Occurrence (
Stack_Guard => Null_Address);
Machine_Occurrence.Occurrence := X;
Propagate_Machine_Occurrence (Machine_Occurrence);
end Reraise_No_Defer;
procedure Reraise (X : Exception_Occurrence) is
begin
if not ZCX_By_Default then
Synchronous_Control.Lock_Abort;
end if;
Reraise_No_Defer (X);
end Reraise;
procedure Reraise_From_All_Others (X : Exception_Occurrence)
renames Reraise_No_Defer;
procedure Reraise_From_Controlled_Operation (X : Exception_Occurrence) is
Prefix : constant String := "adjust/finalize raised ";
begin
if X.Id = Unwind.Standard.Program_Error'Access
and then X.Msg_Length >= Prefix'Length
and then X.Msg (1 .. Prefix'Length) = Prefix
then
Reraise_No_Defer (X);
else
declare
Full_Name : String (1 .. X.Id.Name_Length - 1);
for Full_Name'Address use X.Id.Full_Name;
New_Message : String (1 .. Default_Exception_Msg_Max_Length);
Last : Natural := New_Message'First - 1;
begin
New_Message (Last + 1 .. Last + Prefix'Length) := Prefix;
Last := Prefix'Length;
New_Message (Last + 1 .. Last + Full_Name'Length) := Full_Name;
Last := Last + (X.Id.Name_Length - 1);
if X.Msg_Length > 0 then
New_Message (Last + 1 .. Last + 2) := ": ";
Last := Last + 2;
declare
Copy_Length : constant Natural :=
Integer'Min (X.Msg_Length, New_Message'Length - Last);
begin
New_Message (Last + 1 .. Last + Copy_Length) :=
X.Msg (1 .. Copy_Length);
Last := Last + Copy_Length;
end;
end if;
Raise_Exception_No_Defer (
Unwind.Standard.Program_Error'Access,
Message => New_Message (New_Message'First .. Last));
end;
end if;
end Reraise_From_Controlled_Operation;
procedure Reraise_Machine_Occurrence (
Machine_Occurrence : not null Representation.Machine_Occurrence_Access)
renames Separated.Propagate_Machine_Occurrence;
procedure Raise_Program_Error is
Message : constant String := "not supported";
begin
Raise_Exception (
Unwind.Standard.Program_Error'Access,
Message => Message);
end Raise_Program_Error;
procedure Raise_From_rcheck (
File : not null access Character;
Line : Integer;
E : not null Exception_Data_Access;
Message : String)
is
type Character_CA is access constant Character;
package Conv is
new Address_To_Constant_Access_Conversions (Character, Character_CA);
File_All : String (1 .. Natural (strlen (File)));
for File_All'Address use Conv.To_Address (File);
begin
Raise_Exception (E, File_All, Line, Message => Message);
end Raise_From_rcheck;
procedure rcheck_00 (File : not null access Character; Line : Integer) is
Message : constant String := "access check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_00;
procedure rcheck_02 (File : not null access Character; Line : Integer) is
Message : constant String := "discriminant check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_02;
procedure rcheck_03 (File : not null access Character; Line : Integer) is
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Divide_By_Zero);
end rcheck_03;
procedure Zero_Division (
File : String := Ada.Debug.File;
Line : Integer := Ada.Debug.Line) is
begin
Raise_Exception (
Unwind.Standard.Constraint_Error'Access,
File,
Line,
Message => Divide_By_Zero);
end Zero_Division;
procedure rcheck_04 (File : not null access Character; Line : Integer) is
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Explicit_Raise);
end rcheck_04;
procedure rcheck_05 (File : not null access Character; Line : Integer) is
Message : constant String := "index check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_05;
procedure rcheck_06 (File : not null access Character; Line : Integer) is
Message : constant String := "invalid data";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_06;
procedure rcheck_07 (File : not null access Character; Line : Integer) is
Message : constant String := "length check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_07;
procedure rcheck_09 (File : not null access Character; Line : Integer) is
Message : constant String := "null-exclusion check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_09;
procedure rcheck_10 (File : not null access Character; Line : Integer) is
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Overflow_Check_Failed);
end rcheck_10;
procedure Overflow (
File : String := Ada.Debug.File;
Line : Integer := Ada.Debug.Line) is
begin
Raise_Exception (
Unwind.Standard.Constraint_Error'Access,
File,
Line,
Message => Overflow_Check_Failed);
end Overflow;
procedure rcheck_12 (File : not null access Character; Line : Integer) is
Message : constant String := "range check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_12;
procedure rcheck_13 (File : not null access Character; Line : Integer) is
Message : constant String := "tag check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Constraint_Error'Access,
Message);
end rcheck_13;
procedure rcheck_14 (File : not null access Character; Line : Integer) is
Message : constant String := "access before elaboration";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message => Message);
end rcheck_14;
procedure rcheck_15 (File : not null access Character; Line : Integer) is
Message : constant String := "accessibility check failed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message);
end rcheck_15;
procedure rcheck_18 (File : not null access Character; Line : Integer) is
Message : constant String := "all guards closed";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message);
end rcheck_18;
procedure rcheck_22 (File : not null access Character; Line : Integer) is
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Explicit_Raise);
end rcheck_22;
procedure rcheck_23 (File : not null access Character; Line : Integer) is
type Character_CA is access constant Character;
package Conv is
new Address_To_Constant_Access_Conversions (Character, Character_CA);
File_All : String (1 .. Natural (strlen (File)));
for File_All'Address use Conv.To_Address (File);
begin
Raise_Exception_No_Defer (
Unwind.Standard.Program_Error'Access,
File_All,
Line,
Message => From_Finalize);
end rcheck_23;
procedure Finalize_Raised_Exception is
begin
Raise_Exception_No_Defer (
Unwind.Standard.Program_Error'Access,
Message => From_Finalize);
end Finalize_Raised_Exception;
procedure rcheck_24 (File : not null access Character; Line : Integer) is
Message : constant String := "implicit return with No_Return";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message);
end rcheck_24;
procedure rcheck_25 (File : not null access Character; Line : Integer) is
Message : constant String := "misaligned address value";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message);
end rcheck_25;
procedure rcheck_26 (File : not null access Character; Line : Integer) is
Message : constant String := "missing return";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message);
end rcheck_26;
procedure rcheck_27 (File : not null access Character; Line : Integer) is
Message : constant String := "overlaid controlled object";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message);
end rcheck_27;
procedure rcheck_30 (File : not null access Character; Line : Integer) is
Message : constant String := "unchecked union restriction";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Program_Error'Access,
Message);
end rcheck_30;
procedure rcheck_32 (File : not null access Character; Line : Integer) is
Message : constant String := "empty storage pool";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Storage_Error'Access,
Message);
end rcheck_32;
procedure rcheck_33 (File : not null access Character; Line : Integer) is
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Storage_Error'Access,
Explicit_Raise);
end rcheck_33;
procedure rcheck_35 (File : not null access Character; Line : Integer) is
Message : constant String := "object too large";
begin
Raise_From_rcheck (
File,
Line,
Unwind.Standard.Storage_Error'Access,
Message);
end rcheck_35;
procedure Save_Exception (
X : out Exception_Occurrence;
E : not null Exception_Data_Access;
File : String := "";
Line : Integer := 0;
Column : Integer := 0;
Message : String := "") is
begin
Occurrences.Set_Exception_Message (E, File, Line, Column, Message, X);
Occurrences.Backtrace (X);
end Save_Exception;
procedure Save_E (
X : out Exception_Occurrence;
E : not null Exception_Data_Access;
Message : String) is
begin
Save_Exception (X, E, Message => Message);
end Save_E;
procedure Save_Exception_From_Here (
X : out Exception_Occurrence;
E : not null Exception_Data_Access;
File : String := Ada.Debug.File;
Line : Integer := Ada.Debug.Line) is
begin
Save_Exception (X, E, File, Line, Message => Explicit_Raise);
end Save_Exception_From_Here;
procedure Save_Exception_From_Here_With (
X : out Exception_Occurrence;
E : not null Exception_Data_Access;
File : String := Ada.Debug.File;
Line : Integer := Ada.Debug.Line;
Message : String) is
begin
Save_Exception (X, E, File, Line, Message => Message);
end Save_Exception_From_Here_With;
-- at last of exclusion
function ZZZ return Address is
begin
<<Code>>
return Code'Address;
end ZZZ;
procedure Debug_Raise_Exception (
E : not null Exception_Data_Access;
Message : String)
is
pragma Inspection_Point (E);
pragma Inspection_Point (Message);
begin
null;
end Debug_Raise_Exception;
end System.Unwind.Raising;
|
-- { dg-do compile }
package body Discr35 is
procedure Proc1 is
R : Rec2 := Null_Rec2;
begin
null;
end;
procedure Proc2 is
R : Rec2;
begin
R := Null_Rec2;
end;
end Discr35;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . I N D E F I N I T E _ H O L D E R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2013-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/>. --
------------------------------------------------------------------------------
-- Note: special attention must be paid to the case of simultaneous access
-- to internal shared objects and elements by different tasks. The Reference
-- counter of internal shared object is the only component protected using
-- atomic operations; other components and elements can be modified only when
-- reference counter is equal to one (so there are no other references to this
-- internal shared object and element).
with Ada.Unchecked_Deallocation;
with System.Put_Images;
package body Ada.Containers.Indefinite_Holders is
procedure Free is
new Ada.Unchecked_Deallocation (Element_Type, Element_Access);
procedure Detach (Container : Holder);
-- Detach data from shared copy if necessary. This is necessary to prepare
-- container to be modified.
---------
-- "=" --
---------
function "=" (Left, Right : Holder) return Boolean is
begin
if Left.Reference = Right.Reference then
-- Covers both null and not null but the same shared object cases
return True;
elsif Left.Reference /= null and Right.Reference /= null then
return Left.Reference.Element.all = Right.Reference.Element.all;
else
return False;
end if;
end "=";
------------
-- Adjust --
------------
overriding procedure Adjust (Container : in out Holder) is
begin
if Container.Reference /= null then
if Container.Busy = 0 then
-- Container is not locked, reuse existing internal shared object
Reference (Container.Reference);
else
-- Otherwise, create copy of both internal shared object and
-- element.
Container.Reference :=
new Shared_Holder'
(Counter => <>,
Element =>
new Element_Type'(Container.Reference.Element.all));
end if;
end if;
Container.Busy := 0;
end Adjust;
overriding procedure Adjust (Control : in out Reference_Control_Type) is
begin
if Control.Container /= null then
Reference (Control.Container.Reference);
Control.Container.Busy := Control.Container.Busy + 1;
end if;
end Adjust;
------------
-- Assign --
------------
procedure Assign (Target : in out Holder; Source : Holder) is
begin
if Target.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Target.Reference /= Source.Reference then
if Target.Reference /= null then
Unreference (Target.Reference);
end if;
Target.Reference := Source.Reference;
if Source.Reference /= null then
Reference (Target.Reference);
end if;
end if;
end Assign;
-----------
-- Clear --
-----------
procedure Clear (Container : in out Holder) is
begin
if Container.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Container.Reference /= null then
Unreference (Container.Reference);
Container.Reference := null;
end if;
end Clear;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Holder) return Constant_Reference_Type is
begin
if Container.Reference = null then
raise Constraint_Error with "container is empty";
end if;
Detach (Container);
declare
Ref : constant Constant_Reference_Type :=
(Element => Container.Reference.Element.all'Access,
Control => (Controlled with Container'Unrestricted_Access));
begin
Reference (Ref.Control.Container.Reference);
Ref.Control.Container.Busy := Ref.Control.Container.Busy + 1;
return Ref;
end;
end Constant_Reference;
----------
-- Copy --
----------
function Copy (Source : Holder) return Holder is
begin
if Source.Reference = null then
return (Controlled with null, 0);
elsif Source.Busy = 0 then
-- Container is not locked, reuse internal shared object
Reference (Source.Reference);
return (Controlled with Source.Reference, 0);
else
-- Otherwise, create copy of both internal shared object and element
return
(Controlled with
new Shared_Holder'
(Counter => <>,
Element => new Element_Type'(Source.Reference.Element.all)),
0);
end if;
end Copy;
------------
-- Detach --
------------
procedure Detach (Container : Holder) is
begin
if Container.Busy = 0
and then not System.Atomic_Counters.Is_One
(Container.Reference.Counter)
then
-- Container is not locked and internal shared object is used by
-- other container, create copy of both internal shared object and
-- element.
declare
Old : constant Shared_Holder_Access := Container.Reference;
begin
Container'Unrestricted_Access.Reference :=
new Shared_Holder'
(Counter => <>,
Element =>
new Element_Type'(Container.Reference.Element.all));
Unreference (Old);
end;
end if;
end Detach;
-------------
-- Element --
-------------
function Element (Container : Holder) return Element_Type is
begin
if Container.Reference = null then
raise Constraint_Error with "container is empty";
else
return Container.Reference.Element.all;
end if;
end Element;
--------------
-- Finalize --
--------------
overriding procedure Finalize (Container : in out Holder) is
begin
if Container.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Container.Reference /= null then
Unreference (Container.Reference);
Container.Reference := null;
end if;
end Finalize;
overriding procedure Finalize (Control : in out Reference_Control_Type) is
begin
if Control.Container /= null then
Unreference (Control.Container.Reference);
Control.Container.Busy := Control.Container.Busy - 1;
Control.Container := null;
end if;
end Finalize;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Holder) return Boolean is
begin
return Container.Reference = null;
end Is_Empty;
----------
-- Move --
----------
procedure Move (Target : in out Holder; Source : in out Holder) is
begin
if Target.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Source.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Target.Reference /= Source.Reference then
if Target.Reference /= null then
Unreference (Target.Reference);
end if;
Target.Reference := Source.Reference;
Source.Reference := null;
end if;
end Move;
-------------------
-- Query_Element --
-------------------
procedure Query_Element
(Container : Holder;
Process : not null access procedure (Element : Element_Type))
is
B : Natural renames Container'Unrestricted_Access.Busy;
begin
if Container.Reference = null then
raise Constraint_Error with "container is empty";
end if;
Detach (Container);
B := B + 1;
begin
Process (Container.Reference.Element.all);
exception
when others =>
B := B - 1;
raise;
end;
B := B - 1;
end Query_Element;
---------------
-- Put_Image --
---------------
procedure Put_Image
(S : in out Ada.Strings.Text_Output.Sink'Class; V : Holder)
is
use System.Put_Images;
begin
Array_Before (S);
if not Is_Empty (V) then
Element_Type'Put_Image (S, Element (V));
end if;
Array_After (S);
end Put_Image;
----------
-- Read --
----------
procedure Read
(Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Container : out Holder)
is
begin
Clear (Container);
if not Boolean'Input (Stream) then
Container.Reference :=
new Shared_Holder'
(Counter => <>,
Element => new Element_Type'(Element_Type'Input (Stream)));
end if;
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
---------------
-- Reference --
---------------
procedure Reference (Item : not null Shared_Holder_Access) is
begin
System.Atomic_Counters.Increment (Item.Counter);
end Reference;
function Reference
(Container : aliased in out Holder) return Reference_Type
is
begin
if Container.Reference = null then
raise Constraint_Error with "container is empty";
end if;
Detach (Container);
declare
Ref : constant Reference_Type :=
(Element => Container.Reference.Element.all'Access,
Control => (Controlled with Container'Unrestricted_Access));
begin
Reference (Ref.Control.Container.Reference);
Ref.Control.Container.Busy := Ref.Control.Container.Busy + 1;
return Ref;
end;
end Reference;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out Holder;
New_Item : Element_Type)
is
-- Element allocator may need an accessibility check in case actual type
-- is class-wide or has access discriminants (RM 4.8(10.1) and
-- AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
if Container.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Container.Reference = null then
-- Holder is empty, allocate new Shared_Holder.
Container.Reference :=
new Shared_Holder'
(Counter => <>,
Element => new Element_Type'(New_Item));
elsif System.Atomic_Counters.Is_One (Container.Reference.Counter) then
-- Shared_Holder can be reused.
Free (Container.Reference.Element);
Container.Reference.Element := new Element_Type'(New_Item);
else
Unreference (Container.Reference);
Container.Reference :=
new Shared_Holder'
(Counter => <>,
Element => new Element_Type'(New_Item));
end if;
end Replace_Element;
----------
-- Swap --
----------
procedure Swap (Left, Right : in out Holder) is
begin
if Left.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Right.Busy /= 0 then
raise Program_Error with "attempt to tamper with elements";
end if;
if Left.Reference /= Right.Reference then
declare
Tmp : constant Shared_Holder_Access := Left.Reference;
begin
Left.Reference := Right.Reference;
Right.Reference := Tmp;
end;
end if;
end Swap;
---------------
-- To_Holder --
---------------
function To_Holder (New_Item : Element_Type) return Holder is
-- The element allocator may need an accessibility check in the case the
-- actual type is class-wide or has access discriminants (RM 4.8(10.1)
-- and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
return
(Controlled with
new Shared_Holder'
(Counter => <>,
Element => new Element_Type'(New_Item)), 0);
end To_Holder;
-----------------
-- Unreference --
-----------------
procedure Unreference (Item : not null Shared_Holder_Access) is
procedure Free is
new Ada.Unchecked_Deallocation (Shared_Holder, Shared_Holder_Access);
Aux : Shared_Holder_Access := Item;
begin
if System.Atomic_Counters.Decrement (Aux.Counter) then
Free (Aux.Element);
Free (Aux);
end if;
end Unreference;
--------------------
-- Update_Element --
--------------------
procedure Update_Element
(Container : in out Holder;
Process : not null access procedure (Element : in out Element_Type))
is
B : Natural renames Container.Busy;
begin
if Container.Reference = null then
raise Constraint_Error with "container is empty";
end if;
Detach (Container);
B := B + 1;
begin
Process (Container.Reference.Element.all);
exception
when others =>
B := B - 1;
raise;
end;
B := B - 1;
end Update_Element;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Container : Holder)
is
begin
Boolean'Output (Stream, Container.Reference = null);
if Container.Reference /= null then
Element_Type'Output (Stream, Container.Reference.Element.all);
end if;
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
end Ada.Containers.Indefinite_Holders;
|
-- part of FreeTypeAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
package FT.Errors is
pragma Preelaborate;
type Error_Code is
(Ok, Cannot_Open_Resource, Unknown_File_Format, Invalid_File_Format,
Invalid_Version, Lower_Module_Version, Invalid_Argument,
Unimplemented_Feature, Invalid_Table, Invalid_Offset, Array_Too_Large,
Missing_Module, Missing_Property, Invalid_Glyph_Index,
Invalid_Character_Code, Invalid_Glyph_Format, Cannot_Render_Glyph,
Invalid_Outline, Invalid_Composite, Too_Many_Hints, Invalid_Pixel_Size,
Invalid_Handle, Invalid_Library_Handle, Invalid_Driver_Handle,
Invalid_Face_Handle, Invalid_Size_Handle, Invalid_Slot_Handle,
Invalid_CharMap_Handle, Invalid_Cache_Handle, Invalid_Stream_Handle,
Too_Many_Drivers, Too_Many_Extensions, Out_Of_Memory, Unlisted_Object,
Cannot_Open_Stream, Invalid_Stream_Seek, Invalid_Stream_Skip,
Invalid_Stream_Read, Invalid_Stream_Operation, Invalid_Frame_Operation,
Nested_Frame_Access, Invalid_Frame_Read, Raster_Uninitialized,
Raster_Corrupted, Raster_Overflow, Raster_Negative_Height,
Too_Many_Caches, Invalid_Opcode, Too_Few_Arguments, Stack_Overflow,
Code_Overflow, Bad_Argument, Divide_By_Zero, Invalid_Reference,
Debug_OpCode, ENDF_In_Exec_Stream, Nested_DEFS, Invalid_CodeRange,
Execution_Too_Long, Too_Many_Function_Defs, Too_Many_Instruction_Defs,
Table_Missing, Horiz_Header_Missing, Locations_Missing,
Name_Table_Missing, CMap_Table_Missing, Hmtx_Table_Missing,
Post_Table_Missing, Invalid_Horiz_Metrics, Invalid_CharMap_Format,
Invalid_PPem, Invalid_Vert_Metrics, Could_Not_Find_Context,
Invalid_Post_Table_Format, Invalid_Post_Table, DEF_In_Glyf_Bytecode,
Missing_Bitmap, Syntax_Error, Stack_Underflow, Ignore,
No_Unicode_Glyph_Name, Glyph_Too_Big, Missing_Startfont_Field,
Missing_Font_Field, Missing_Size_Field, Missing_Fontboundingbox_Field,
Missing_Chars_Field, Missing_Startchar_Field, Missing_Encoding_Field,
Missing_Bbx_Field, Bbx_Too_Big, Corrupted_Font_Header,
Corrupted_Font_Glyphs);
for Error_Code use
(Ok => 16#00#,
Cannot_Open_Resource => 16#01#,
Unknown_File_Format => 16#02#,
Invalid_File_Format => 16#03#,
Invalid_Version => 16#04#,
Lower_Module_Version => 16#05#,
Invalid_Argument => 16#06#,
Unimplemented_Feature => 16#07#,
Invalid_Table => 16#08#,
Invalid_Offset => 16#09#,
Array_Too_Large => 16#0A#,
Missing_Module => 16#0B#,
Missing_Property => 16#0C#,
Invalid_Glyph_Index => 16#10#,
Invalid_Character_Code => 16#11#,
Invalid_Glyph_Format => 16#12#,
Cannot_Render_Glyph => 16#13#,
Invalid_Outline => 16#14#,
Invalid_Composite => 16#15#,
Too_Many_Hints => 16#16#,
Invalid_Pixel_Size => 16#17#,
Invalid_Handle => 16#20#,
Invalid_Library_Handle => 16#21#,
Invalid_Driver_Handle => 16#22#,
Invalid_Face_Handle => 16#23#,
Invalid_Size_Handle => 16#24#,
Invalid_Slot_Handle => 16#25#,
Invalid_CharMap_Handle => 16#26#,
Invalid_Cache_Handle => 16#27#,
Invalid_Stream_Handle => 16#28#,
Too_Many_Drivers => 16#30#,
Too_Many_Extensions => 16#31#,
Out_Of_Memory => 16#40#,
Unlisted_Object => 16#41#,
Cannot_Open_Stream => 16#51#,
Invalid_Stream_Seek => 16#52#,
Invalid_Stream_Skip => 16#53#,
Invalid_Stream_Read => 16#54#,
Invalid_Stream_Operation => 16#55#,
Invalid_Frame_Operation => 16#56#,
Nested_Frame_Access => 16#57#,
Invalid_Frame_Read => 16#58#,
Raster_Uninitialized => 16#60#,
Raster_Corrupted => 16#61#,
Raster_Overflow => 16#62#,
Raster_Negative_Height => 16#63#,
Too_Many_Caches => 16#70#,
Invalid_Opcode => 16#80#,
Too_Few_Arguments => 16#81#,
Stack_Overflow => 16#82#,
Code_Overflow => 16#83#,
Bad_Argument => 16#84#,
Divide_By_Zero => 16#85#,
Invalid_Reference => 16#86#,
Debug_OpCode => 16#87#,
ENDF_In_Exec_Stream => 16#88#,
Nested_DEFS => 16#89#,
Invalid_CodeRange => 16#8A#,
Execution_Too_Long => 16#8B#,
Too_Many_Function_Defs => 16#8C#,
Too_Many_Instruction_Defs => 16#8D#,
Table_Missing => 16#8E#,
Horiz_Header_Missing => 16#8F#,
Locations_Missing => 16#90#,
Name_Table_Missing => 16#91#,
CMap_Table_Missing => 16#92#,
Hmtx_Table_Missing => 16#93#,
Post_Table_Missing => 16#94#,
Invalid_Horiz_Metrics => 16#95#,
Invalid_CharMap_Format => 16#96#,
Invalid_PPem => 16#97#,
Invalid_Vert_Metrics => 16#98#,
Could_Not_Find_Context => 16#99#,
Invalid_Post_Table_Format => 16#9A#,
Invalid_Post_Table => 16#9B#,
DEF_In_Glyf_Bytecode => 16#9C#,
Missing_Bitmap => 16#9D#,
Syntax_Error => 16#A0#,
Stack_Underflow => 16#A1#,
Ignore => 16#A2#,
No_Unicode_Glyph_Name => 16#A3#,
Glyph_Too_Big => 16#A4#,
Missing_Startfont_Field => 16#B0#,
Missing_Font_Field => 16#B1#,
Missing_Size_Field => 16#B2#,
Missing_Fontboundingbox_Field => 16#B3#,
Missing_Chars_Field => 16#B4#,
Missing_Startchar_Field => 16#B5#,
Missing_Encoding_Field => 16#B6#,
Missing_Bbx_Field => 16#B7#,
Bbx_Too_Big => 16#B8#,
Corrupted_Font_Header => 16#B9#,
Corrupted_Font_Glyphs => 16#BA#);
for Error_Code'Size use Interfaces.C.int'Size;
subtype Generic_Errors is Error_Code range Ok .. Missing_Property;
subtype Glyph_Character_Errors is Error_Code range
Invalid_Glyph_Index .. Invalid_Pixel_Size;
subtype Handle_Errors is Error_Code range
Invalid_Handle .. Invalid_Stream_Handle;
subtype Driver_Errors is Error_Code range
Too_Many_Drivers .. Too_Many_Extensions;
subtype Memory_Errors is Error_Code range Out_Of_Memory .. Unlisted_Object;
subtype Stream_Errors is Error_Code range
Cannot_Open_Stream .. Invalid_Frame_Read;
subtype Raster_Errors is Error_Code range
Raster_Uninitialized .. Raster_Negative_Height;
subtype Cache_Errors is Error_Code range Too_Many_Caches .. Too_Many_Caches;
subtype TrueType_And_SFNT_Errors is Error_Code range
Invalid_Opcode .. Missing_Bitmap;
subtype CFF_CID_And_Type_1_Errors is Error_Code range
Syntax_Error .. Glyph_Too_Big;
subtype BDF_Errors is Error_Code range
Missing_Startfont_Field .. Corrupted_Font_Glyphs;
function Description (Code : Error_Code) return String;
end FT.Errors;
|
generic
package any_Math.any_Geometry.any_d2
--
-- Provides a namespace and core types for 2D geometry.
--
is
pragma Pure;
---------
-- Sites
--
-- Cartesian
--
subtype Site is Vector_2; -- 2D cartesian coordinates.
type Sites is array (Positive range <>) of Site;
function Distance (From, To : Site) return Real;
-- Polar
--
type polar_Site is -- 2D polar coordinates.
record
Angle : Radians;
Extent : Real;
end record;
function to_Polar (Self : in Site) return polar_Site;
function to_Site (Self : in polar_Site) return Site;
function Angle (Self : in Site) return Radians;
function Extent (Self : in Site) return Real;
---------
-- Lines
--
type Line is private;
function to_Line (Anchor : in Site;
Angle : in Radians) return Line;
function to_Line (Site_1,
Site_2 : in Site) return Line;
function X_of (Self : in Line; Y : in Real) return Real;
function Y_of (Self : in Line; X : in Real) return Real;
function Gradient (Self : in Line) return Real;
----------
-- Bounds
--
type bounding_Box is
record
Lower,
Upper : Site;
end record;
null_Bounds : constant bounding_Box;
function to_bounding_Box (Self : Sites) return bounding_Box;
function "or" (Left : in bounding_Box; Right : in Site) return bounding_Box;
--
-- Returns the bounds expanded to include the vector.
function "or" (Left : in bounding_Box; Right : in bounding_Box) return bounding_Box;
--
-- Returns the bounds expanded to include both Left and Right.
function "+" (Left : in bounding_Box; Right : in Vector_2) return bounding_Box;
--
-- Returns the bounds translated by the vector.
function Extent (Self : in bounding_Box; Dimension : in Index) return Real;
function Image (Self : in bounding_Box) return String;
----------
-- Circles
--
type Circle is
record
Radius : Real;
end record;
function Area (Self : Circle) return Real;
function Perimeter (Self : Circle) return Real;
-----------
-- Polygons
--
type Polygon (Vertex_Count : Positive) is
record
Vertices : Sites (1 .. Vertex_Count);
end record;
function Area (Self : in Polygon) return Real; -- Polygon must be convex.
function Perimeter (Self : in Polygon) return Real;
function Angle (Self : in Polygon; at_Vertex : in Positive) return Radians;
function is_Triangle (Self : in Polygon) return Boolean;
function is_Convex (Self : in Polygon) return Boolean;
function is_Clockwise (Self : in Polygon) return Boolean;
function Centroid (Self : in Polygon) return Site;
procedure center (Self : in out Polygon);
function prior_Vertex (Self : in Polygon; to_Vertex : in Positive) return Site;
function next_Vertex (Self : in Polygon; to_Vertex : in Positive) return Site;
function Image (Self : in Polygon) return String;
------------
-- Triangles
--
type Triangle is
record
Vertices : Sites (1 .. 3);
end record;
function Area (Self : in Triangle) return Real;
function Perimeter (Self : in Triangle) return Real;
function Angle (Self : in Triangle; at_Vertex : in Positive) return Radians;
function prior_Vertex (Self : in Triangle; to_Vertex : in Positive) return Site;
function next_Vertex (Self : in Triangle; to_Vertex : in Positive) return Site;
Degenerate,
Colinear : exception;
private
type Line_Format is (anchored_Gradient, two_Points);
type Line (Kind : Line_Format := Line_Format'First) is
record
case Kind is
when anchored_Gradient =>
Anchor : Site;
Gradient : Real;
when two_Points =>
Sites : any_d2.Sites (1 .. 2);
end case;
end record;
null_Bounds : constant bounding_Box := (lower => (Real'Last, Real'Last),
upper => (Real'First, Real'First));
end any_Math.any_Geometry.any_d2;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.OCL.Tuple_Literal_Exps.Hash is
new AMF.Elements.Generic_Hash (OCL_Tuple_Literal_Exp, OCL_Tuple_Literal_Exp_Access);
|
with
lace.Subject,
lace.Observer,
lace.make_Subject,
lace.make_Observer.deferred,
lace.Any;
private
with
ada.Strings.unbounded;
package lace.Subject_and_deferred_Observer
--
-- Provides a concrete type for a combined event subject and a deferred observer.
--
is
type Item is limited new lace.Any.limited_item
and lace.Subject .item
and lace.Observer .item with private;
type View is access all Item'Class;
package Forge
is
function to_Subject_and_Observer (Name : in String) return Item;
function new_Subject_and_Observer (Name : in String) return View;
end Forge;
procedure destroy (Self : in out Item);
procedure free (Self : in out View);
overriding
function Name (Self : in Item) return String;
private
use ada.Strings.unbounded;
package Subject is new make_Subject (Any.limited_item);
package Observer is new make_Observer (Subject .item);
package Deferred is new Observer.deferred (Observer .item);
type Item is limited new Deferred.item with
record
Name : unbounded_String;
end record;
end lace.Subject_and_deferred_Observer;
|
-- Abstract :
--
-- See spec.
--
-- Copyright (C) 2018 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
package body SAL.Gen_Unbounded_Definite_Vectors.Gen_Comparable is
function Compare (Left, Right : in Vector) return Compare_Result
is
use all type Ada.Containers.Count_Type;
begin
if Left.Length = 0 then
if Right.Length = 0 then
return Equal;
else
-- null is less than non-null
return Less;
end if;
elsif Right.Length = 0 then
return Greater;
else
declare
I : Base_Peek_Type := To_Peek_Type (Left.First);
J : Base_Peek_Type := To_Peek_Type (Right.First);
Left_Last : constant Base_Peek_Type := To_Peek_Type (Left.Last);
Right_Last : constant Base_Peek_Type := To_Peek_Type (Right.Last);
begin
loop
exit when I > Left_Last or J > Right_Last;
case Element_Compare (Left.Elements (I), Right.Elements (J)) is
when Less =>
return Less;
when Equal =>
I := I + 1;
J := J + 1;
when Greater =>
return Greater;
end case;
end loop;
if I > Left_Last then
if J > Right_Last then
return Equal;
else
-- right is longer
return Less;
end if;
else
-- left is longer
return Greater;
end if;
end;
end if;
end Compare;
end SAL.Gen_Unbounded_Definite_Vectors.Gen_Comparable;
|
-- CA1013A6M.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT A GENERIC PACKAGE OR SUBPROGRAM INSTANTIATION
-- CAN BE SUBMITTED FOR SEPARATE COMPILATION.
-- SEPARATE FILES ARE:
-- CA1013A0 A LIBRARY GENERIC PACKAGE.
-- CA1013A1 A LIBRARY GENERIC PROCEDURE.
-- CA1013A2 A LIBRARY GENERIC FUNCTION.
-- CA1013A3 A LIBRARY GENERIC PACKAGE INSTANTIATION.
-- CA1013A4 A LIBRARY GENERIC PROCEDURE INSTANTIATION.
-- CA1013A5 A LIBRARY GENERIC FUNCTION INSTANTIATION.
-- CA1013A6M THE MAIN PROCEDURE.
-- WKB 7/20/81
-- SPS 11/5/82
WITH REPORT;
WITH CA1013A3, CA1013A4, CA1013A5;
USE REPORT;
PROCEDURE CA1013A6M IS
J : INTEGER := 1;
BEGIN
TEST ("CA1013A", "GENERIC INSTANTIATIONS SUBMITTED " &
"FOR SEPARATE COMPILATION");
IF CA1013A3.I /= 1 THEN
FAILED ("PACKAGE NOT ACCESSED");
END IF;
CA1013A4 (J);
IF J /= 2 THEN
FAILED ("PROCEDURE NOT INVOKED");
END IF;
IF CA1013A5 /= 2 THEN
FAILED ("FUNCTION NOT INVOKED");
END IF;
RESULT;
END CA1013A6M;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_configure_window_request_t is
-- Item
--
type Item is record
major_opcode : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
length : aliased Interfaces.Unsigned_16;
window : aliased xcb.xcb_window_t;
value_mask : aliased Interfaces.Unsigned_16;
pad1 : aliased swig.int8_t_Array (0 .. 1);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_configure_window_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_configure_window_request_t.Item,
Element_Array => xcb.xcb_configure_window_request_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_configure_window_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_configure_window_request_t.Pointer,
Element_Array => xcb.xcb_configure_window_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_configure_window_request_t;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Orthogonal Persistence Manager --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2009, 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.Internals.Persistence_Manager;
package body Matreshka.Transactions is
procedure Commit renames Matreshka.Internals.Persistence_Manager.Commit;
procedure Start renames Matreshka.Internals.Persistence_Manager.Start;
procedure Rollback renames Matreshka.Internals.Persistence_Manager.Rollback;
end Matreshka.Transactions;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . S T R E A M S . S T O R A G E . B O U N D E D --
-- --
-- B o d y --
-- --
-- Copyright (C) 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/>. --
-- --
------------------------------------------------------------------------------
package body Ada.Streams.Storage.Bounded is
----------
-- Read --
----------
overriding procedure Read
(Stream : in out Stream_Type; Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
EA : Stream_Element_Array renames
Stream.Elements (1 .. Element_Count (Stream));
begin
if Item'Length = 0 then
Last := Item'First - 1;
-- If the entire content of the stream fits in Item, then copy it and
-- clear the stream. This is likely the usual case.
elsif Element_Count (Stream) <= Item'Length then
Last := Item'First + Element_Count (Stream) - 1;
Item (Item'First .. Last) := EA;
Clear (Stream);
-- Otherwise, copy as much into Item as will fit. Then slide the
-- remaining part of the stream down, and compute the new Count.
-- We expect this to be the unusual case, so the cost of copying
-- the remaining part probably doesn't matter.
else
Last := Item'Last;
declare
New_Count : constant Stream_Element_Count :=
Element_Count (Stream) - Item'Length;
begin
Item := EA (1 .. Item'Length);
EA (1 .. New_Count) :=
EA (Element_Count (Stream) - New_Count + 1 ..
Element_Count (Stream));
Stream.Count := New_Count;
end;
end if;
end Read;
-----------
-- Write --
-----------
overriding procedure Write
(Stream : in out Stream_Type; Item : Stream_Element_Array)
is
begin
if Element_Count (Stream) + Item'Length > Stream.Max_Elements then
-- That is a precondition in the RM
raise Constraint_Error;
end if;
declare
New_Count : constant Stream_Element_Count :=
Element_Count (Stream) + Item'Length;
begin
Stream.Elements (Element_Count (Stream) + 1 .. New_Count) := Item;
Stream.Count := New_Count;
end;
end Write;
-------------------
-- Element_Count --
-------------------
overriding function Element_Count
(Stream : Stream_Type) return Stream_Element_Count
is
begin
return Stream.Count;
end Element_Count;
-----------
-- Clear --
-----------
overriding procedure Clear (Stream : in out Stream_Type)
is
begin
Stream.Count := 0;
end Clear;
end Ada.Streams.Storage.Bounded;
|
with Numerics, Ada.Text_IO, Chebyshev, Sb_Package;
use Numerics, Ada.Text_IO, Chebyshev, Sb_Package;
procedure Steel_Balls is
use Int_IO, Real_IO, AD_Package, Integrator;
-----------------------------------------------
Control : Control_Type := New_Control_Type;
-- Initial Conditions ----
Guess, Var, State : Variable;
X : Vector renames Var.X;
T : Real renames Var.T;
-------------------------------
Y : Real_Vector (1 .. NK);
A : Array_Of_Vectors;
Fcsv : File_Type;
Fxyz : File_Type;
Dt : Real;
Cname : String := "sb.csv";
Xname : String := "sb.xyz";
Total_Energy, T_Final : Real;
Line : String (1 .. 50);
Last : Natural;
begin
Control.Max_Dt := 1.0e2;
Control.Tol := 1.0e-10;
------------------------------------------------------------
-- Read initial conditions
T := 0.0;
X (1) := 0.0;
Get_Line (Line, Last); -- Not used
Get_Line (Line, Last); -- s
X (2) := Real'Value (Line (1 .. Last));
Put (X (2)); New_Line;
Get_Line (Line, Last); -- Not used
Get_Line (Line, Last); -- ω_s
X (4) := Real'Value (Line (1 .. Last));
Put (X (4)); New_Line;
Get_Line (Line, Last); -- Not used
Get_Line (Line, Last); -- total energy
Total_Energy := Real'Value (Line (1 .. Last));
Put ("Total_Energy = "); Put (Total_Energy); New_Line;
Get_Line (Line, Last); -- Not used
Get_Line (Line, Last); -- alpha
α := Real'Value (Line (1 .. Last));
Put ("alpha = "); Put (α); New_Line;
Get_Line (Line, Last); -- Not used
Get_Line (Line, Last); -- dt
Dt := Real'Value (Line (1 .. Last));
Put (Dt); New_Line;
Get_Line (Line, Last); -- Not used
Get_Line (Line, Last); -- T_final
T_Final := Real'Value (Line (1 .. Last));
Put ("T_Final = "); Put (T_Final); New_Line;
------------------------------------------------------------
X := Get_IC (X, Total_Energy);
-- X (3) := -X (3);
for Item of X loop Put (Item); New_Line; end loop;
Total_Energy := Val (Hamiltonian (0.0, X));
Put ("Total Energy = "); Put (Total_Energy); New_Line;
------------------------------------------------------------
State := Var;
------------------------------------------------------------
Print_CSV (Fcsv, State, CName, Lagrangian'Access, Create);
Print_XYZ (Fxyz, State, XName, Create);
while T < T_Final loop
Y := Update (Lagrangian'Access, Var, Control, Sparse);
A := Chebyshev_Transform (Y);
Put (Var.T); Put (" ");
Put (Val (Hamiltonian (0.0, Var.X)));
New_Line;
---------------------------------------------------------
while State.T + Dt <= T + Control.Dt loop
State.T := State.T + Dt;
State.X := Interpolate (A, State.T, Var.T, Var.T + Control.Dt);
Print_CSV (Fcsv, State, CName, Lagrangian'Access);
Print_XYZ (Fxyz, State, XName);
end loop;
---------------------------------------------------------
Update (Var => Var, Y => Y, Dt => Control.Dt); -- Update variable Var
end loop;
Close (Fcsv);
Close (Fxyz);
end Steel_Balls;
|
------------------------------------------------------------------------------
-- EMAIL: <darkestkhan@gmail.com> --
-- License: ISC License (see COPYING file) --
-- --
-- Copyright © 2011 - 2015 darkestkhan --
------------------------------------------------------------------------------
-- Permission to use, copy, modify, and/or distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- The software is provided "as is" and the author disclaims all warranties --
-- with regard to this software including all implied warranties of --
-- merchantability and fitness. In no event shall the author be liable for --
-- any special, direct, indirect, or consequential damages or any damages --
-- whatsoever resulting from loss of use, data or profits, whether in an --
-- action of contract, negligence or other tortious action, arising out of --
-- or in connection with the use or performance of this software. --
------------------------------------------------------------------------------
-- TODO:
-- - finish adding escape codes [cursor controls]
with Ada.Text_IO;
with Ada.Characters.Latin_1;
package body VT100 is
-------------------
-- R E N A M E S --
-------------------
package ASCII renames Ada.Characters.Latin_1;
-------------------
-- N A T _ I M G --
-------------------
function Nat_Img
(N: in Natural) return String
is
str: constant String := Natural'Image (N);
begin
return str (2 .. str'Last);
end Nat_Img;
---------------
-- R E S E T --
---------------
procedure Reset
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "c");
end Reset;
-------------------------------
-- L I N E _ W R A P P I N G --
-------------------------------
procedure Line_Wrapping
(State : in Boolean)
is
begin
case State is
when False =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[7l");
when True =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[7h");
end case;
end Line_Wrapping;
-------------------------------------
-- U S E _ D E F A U L T _ F O N T --
-------------------------------------
procedure Use_Default_Font
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "(");
end Use_Default_Font;
-----------------------------------------
-- U S E _ A L T E R N A T E _ F O N T --
-----------------------------------------
procedure Use_Alternate_Font
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & ")");
end Use_Alternate_Font;
-----------------------------
-- C L E A R _ S C R E E N --
-----------------------------
procedure Clear_Screen
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[2J");
end Clear_Screen;
-------------------------
-- E R A S E _ L I N E --
-------------------------
procedure Erase_Line
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[2K");
end Erase_Line;
---------------
-- E R A S E --
---------------
procedure Erase
(Where : in Direction)
is
begin
case Where is
when Up =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[1J");
when Down =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[J");
when Forward =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[K");
when Backward =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[1K");
end case;
end Erase;
---------------------------
-- M O V E _ C U R S O R --
---------------------------
procedure Move_Cursor
(Line : in Natural;
Column : in Natural)
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[" & Nat_Img (Line) & ";" & Nat_Img (Column) & "H");
end Move_Cursor;
---------------------------
-- M O V E _ C U R S O R --
---------------------------
procedure Move_Cursor
(Where : in Direction;
By : in Natural)
is
begin
if By > 0 then
case Where is
when Up =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[" & Nat_Img (By) & "A");
when Down =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[" & Nat_Img (By) & "B");
when Forward =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[" & Nat_Img (By) & "C");
when Backward =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[" & Nat_Img (By) & "D");
end case;
end if;
end Move_Cursor;
---------------------------------------------
-- S A V E _ C U R S O R _ P O S I T I O N --
---------------------------------------------
procedure Save_Cursor_Position
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[s");
end Save_Cursor_Position;
---------------------------------------------------
-- R E S T O R E _ C U R S O R _ P O S I T I O N --
---------------------------------------------------
procedure Restore_Cursor_Position
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[u");
end Restore_Cursor_Position;
-------------------
-- S E T _ T A B --
-------------------
procedure Set_Tab
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "H");
end Set_Tab;
-----------------------
-- C L E A R _ T A B --
-----------------------
procedure Clear_Tab
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[g");
end Clear_Tab;
---------------------------------
-- C L E A R _ A L L _ T A B S --
---------------------------------
procedure Clear_All_Tabs
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[3g");
end Clear_All_Tabs;
-------------------------------
-- S C R O L L _ S C R E E N --
-------------------------------
procedure Scroll_Screen
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[r");
end Scroll_Screen;
-------------------------------
-- S C R O L L _ S C R E E N --
-------------------------------
procedure Scroll_Screen
(From : in Natural;
To : in Natural)
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[" & Nat_Img (N => From) & ";" &
Nat_Img (N => To) & "r");
end Scroll_Screen;
---------------------------
-- S C R O L L _ D O W N --
---------------------------
procedure Scroll_Down
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "D");
end Scroll_Down;
---------------------------
-- S C R O L L _ D O W N --
---------------------------
procedure Scroll_Down
(Lines : in Natural)
is
begin
if Lines > 0 then
for I in 1 .. Lines loop
Scroll_Down;
end loop;
end if;
end Scroll_Down;
-----------------------
-- S C R O L L _ U P --
-----------------------
procedure Scroll_Up
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "H");
end Scroll_Up;
-----------------------
-- S C R O L L _ U P --
-----------------------
procedure Scroll_Up
(Lines : in Natural)
is
begin
if Lines > 0 then
for I in 1 .. Lines loop
Scroll_Up;
end loop;
end if;
end Scroll_Up;
-------------------------------
-- S E T _ A T T R I B U T E --
-------------------------------
procedure Set_Attribute
(This: in Attribute)
is
C: Character;
begin
case This is
when Reset => C := '0';
when Bold => C := '1';
when Dim => C := '2';
when Underline => C := '3';
when Blink => C := '4';
when Revers => C := '5';
when Hidden => C := '6';
end case;
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & '[' & C & 'm');
end Set_Attribute;
---------------------------------------------
-- S E T _ B A C K G R O U N D _ C O L O R --
---------------------------------------------
procedure Set_Background_Color
(This: in Color)
is
C: Character;
begin
case This is
when Black => C := '0';
when Red => C := '1';
when Green => C := '2';
when Yellow => C := '3';
when Blue => C := '4';
when Magenta => C := '5';
when Cyan => C := '6';
when White => C := '7';
when Default => C := '9';
end case;
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[4" & C & 'm');
end Set_Background_Color;
---------------------------------------------
-- S E T _ F O R E G R O U N D _ C O L O R --
---------------------------------------------
procedure Set_Foreground_Color
(This: in Color)
is
C: Character;
begin
case This is
when Black => C := '0';
when Red => C := '1';
when Green => C := '2';
when Yellow => C := '3';
when Blue => C := '4';
when Magenta => C := '5';
when Cyan => C := '6';
when White => C := '7';
when Default => C := '9';
end case;
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[3" & C & 'm');
end Set_Foreground_Color;
-----------------------------
-- P R I N T _ S C R E E N --
-----------------------------
procedure Print_Screen
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[i");
end Print_Screen;
-------------------------
-- P R I N T _ L I N E --
-------------------------
procedure Print_Line
is
begin
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[1i");
end Print_Line;
-----------------------
-- P R I N T _ L O G --
-----------------------
procedure Print_Log
(State : in Boolean)
is
begin
case State is
when False =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[4i");
when True =>
Ada.Text_IO.Put
(File => Ada.Text_IO.Standard_Output,
Item => ASCII.ESC & "[5i");
end case;
end Print_Log;
end VT100;
|
with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Ada.Text_IO; use Ada.Text_IO;
with Strings_Edit; use Strings_Edit;
procedure Column_Aligner is
Text : constant String :=
"Given$a$text$file$of$many$lines,$where$fields$within$a$line$" & NUL &
"are$delineated$by$a$single$'dollar'$character,$write$a$program" & NUL &
"that$aligns$each$column$of$fields$by$ensuring$that$words$in$each$" & NUL &
"column$are$separated$by$at$least$one$space." & NUL &
"Further,$allow$for$each$word$in$a$column$to$be$either$left$" & NUL &
"justified,$right$justified,$or$center$justified$within$its$column." & NUL;
File : File_Type;
Width : array (1..1_000) of Natural := (others => 0);
Line : String (1..200);
Column : Positive := 1;
Start : Positive := 1;
Pointer : Positive;
begin
Create (File, Out_File, "columned.txt");
-- Determining the widths of columns
for I in Text'Range loop
case Text (I) is
when '$' | NUL =>
Width (Column) := Natural'Max (Width (Column), I - Start + 1);
Start := I + 1;
if Text (I) = NUL then
Column := 1;
else
Column := Column + 1;
end if;
when others =>
null;
end case;
end loop;
-- Formatting
for Align in Alignment loop
Column := 1;
Start := 1;
Pointer := 1;
for I in Text'Range loop
case Text (I) is
when '$' | NUL =>
Put -- Formatted output of a word
( Destination => Line,
Pointer => Pointer,
Value => Text (Start..I - 1),
Field => Width (Column),
Justify => Align
);
Start := I + 1;
if Text (I) = NUL then
Put_Line (File, Line (1..Pointer - 1));
Pointer := 1;
Column := 1;
else
Column := Column + 1;
end if;
when others =>
null;
end case;
end loop;
end loop;
Close (File);
end Column_Aligner;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017, Universidad Politécnica de Madrid --
-- --
-- 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. --
-- --
-------------------------------------------------------------------------------
-- Implementation of the user interface using GTK
with Gdk.Threads;
with Gtk.Main;
with Gtk.Window; use Gtk.Window;
with Gtk.Grid; use Gtk.Grid;
with Gtk.Enums; use Gtk.Enums;
with Gtk.Button; use Gtk.Button;
with Gtk.Label; use Gtk.Label;
with Gtk.Text_View; use Gtk.Text_View;
with Gtk.Text_Buffer; use Gtk.Text_Buffer;
with Gtk.Text_Iter; use Gtk.Text_Iter;
with Gtk.Scrolled_Window; use Gtk.Scrolled_Window;
with Gtk.Widget; use Gtk.Widget;
with Pango.Font; use Pango.Font;
with TTC_Data.Strings;
package body User_Interface is
----------------------
-- Graphic objects --
----------------------
Window : Gtk_Window;
Grid : Gtk_Grid;
Label : Gtk_Label;
Button : Gtk_Button;
Scrolled : Gtk_Scrolled_Window;
Text_Buffer : Gtk_Text_Buffer;
Text : Gtk_Text_View;
Iterator : Gtk_Text_Iter;
---------------
-- Callbacks --
---------------
-- quit GUI
procedure main_quit (Self : access Gtk_Widget_Record'Class) is
begin
Gtk.Main.Main_Quit;
end main_quit;
-- send a TC message
procedure button_clicked(Self : access Gtk_Button_Record'Class) is
begin
null;
-- TC_Sender.Send;
end button_clicked;
----------
-- Init --
----------
procedure Init is
begin
-- use thread-aware gdk
Gdk.Threads.G_Init;
Gdk.Threads.Init;
Gtk.Main.Init;
-- create window
Gtk_New(Window);
Window.Set_Title("Toy Satellite Ground Station");
Window.Set_Border_Width (10);
Window.Set_Resizable (False);
Window.On_Destroy (main_quit'Access);
-- grid for placing widgets
Gtk_New (Grid);
Window.Add(Grid);
-- TM area
Gtk_New(Label, "Telemetry");
Grid.Attach(Label, 0, 0, 3, 1);
Gtk_New(Text_Buffer);
Gtk_New(Text, Text_Buffer);
Text.Set_Editable(False);
Text.Modify_Font(From_String("Monospace 10"));
-- Text.Modify_Font(From_String("Menlo 12"));
Gtk_New(Scrolled);
Scrolled.Set_Policy(Policy_Automatic, Policy_Automatic);
Scrolled.Set_Size_Request(60,400);
Scrolled.Add(Text);
Grid.Attach(Scrolled, 0,1,3,12);
-- TC area
Gtk_New(Label, "Telecommands");
Grid.Attach(Label, 3, 0, 1, 1);
Gtk_New(Button, "Request HK");
Button.On_Clicked(button_clicked'Access);
Grid.Attach(Button, 3,1,1,1);
-- show window
Grid.Set_Column_Homogeneous(True);
Grid.Set_Column_Spacing(10);
Grid.Set_Row_Spacing(10);
Window.Show_All;
-- GTK main loop
Gdk.Threads.Enter;
Gtk.Main.Main;
Gdk.Threads.Leave;
end Init;
---------
-- Put --
---------
procedure Put (S : String) is
begin
Gdk.Threads.Enter;
Text_Buffer.Insert_At_Cursor(" " & S & ASCII.LF);
Text.Scroll_Mark_Onscreen(Text_Buffer.Get_Insert);
Text.Show;
Gdk.Threads.Leave;
end Put;
---------
-- Put --
---------
procedure Put (M : TM_Message) is
begin
Put (TTC_Data.Strings.Image (M));
end Put;
end User_Interface;
|
-- PQ (10/12) ; PM (10/14)
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Exceptions;
-- Version radicale : exclusion mutuelle de tous
-- fournit une ossature pour l'approche "automate"
-- fournit un exemple de tâche proposant des entrées différentes de Demander_Lecture, ...
package body LR.Synchro.Exclusion2 is
function Nom_Strategie return String is
begin
return "Simple et Stupide, par exclusion mutuelle";
end Nom_Strategie;
task LectRedTask is
entry Demander;
entry Terminer;
end LectRedTask;
task body LectRedTask is
begin
loop
accept Demander;
accept Terminer;
-- Comme promis : simple et stupide
end loop;
exception
when Error: others =>
Put_Line("**** LectRedTask: exception: " & Ada.Exceptions.Exception_Information(Error));
end LectRedTask;
procedure Demander_Lecture is
begin
LectRedTask.Demander;
end Demander_Lecture;
procedure Demander_Ecriture is
begin
LectRedTask.Demander;
end Demander_Ecriture;
procedure Terminer_Lecture is
begin
LectRedTask.Terminer;
end Terminer_Lecture;
procedure Terminer_Ecriture is
begin
LectRedTask.Terminer;
end Terminer_Ecriture;
end LR.Synchro.Exclusion2;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . R E A L _ T I M E --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2016, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is the Ravenscar version of this package for generic bare board
-- targets. Note that the operations here assume that Time is a 64-bit
-- unsigned integer and Time_Span is a 64-bit signed integer.
with System.Tasking;
with System.Task_Primitives.Operations;
with Ada.Unchecked_Conversion;
package body Ada.Real_Time with
SPARK_Mode => Off
is
pragma Suppress (Overflow_Check);
-- This package has careful manual overflow checks, and unsuppresses them
-- where appropriate. This default enables compilation with checks enabled
-- on Ravenscar SFP, where 64-bit multiplication with overflow checking is
-- not available.
package OSI renames System.OS_Interface;
subtype LLI is Long_Long_Integer;
------------------------------------------------------------
-- Handling of Conversions Between Duration and Time_Span --
------------------------------------------------------------
-- For the To_Duration and To_Time_Span conversion functions, we use the
-- intermediate Integer representation of Duration (64-bit) to allow for
-- simple Integer operations instead of Float. We take advantage of the
-- fact that Duration is represented as an Integer with units of Small.
-- Within these conversions we perform the range checks required by
-- AI-00432 manually.
-- Note that in the past, within To_Duration and To_Time_Span, we were
-- first computing the conversion factor between Duration and Time_Span
-- (10 ** 9 / Clock_Frecuency) and then we multiplied or divided by it. The
-- advantage of this approach was that the operations were simple, and we
-- limited a lot the number of occurrences of overflows, but the accuracy
-- loss could be significant depending on the clock frequency. For example,
-- with a clock frequency of 600 MHz the factor was 1.66, which was rounded
-- to 1 (Integer), and hence with a 67% difference.
-- We tried also to have a better tradeoff (Constraint_Error being raised
-- when transforming very big values, but limiting a lot the loss of
-- accuracy) using Clock_Frequency in MHz instead of Hz. Therefore, we
-- multiplied first by 10 ** 3 (or Clock_Frequency / 10 ** 6 which is
-- typically smaller than 1000), and hence overflow could occur only with
-- really big values). The problem of this approach was that some processor
-- frequencies may not be expressed in multiples of MHz (for example,
-- 33.3333 MHz). The approach finally followed is to do the operations
-- "by hand" on the upper and the lower part of the 64-bit value. This is
-- slightly heavier, but we can preserve the best accuracy and the lowest
-- occurrence of overflows.
pragma Compile_Time_Error
(Duration'Size /= 64,
"this version of Ada.Real_Time requires 64-bit Duration");
-----------------------
-- Local definitions --
-----------------------
type Uint_64 is mod 2 ** 64;
-- Type used to represent intermediate results of arithmetic operations
Max_Pos_Time_Span : constant := Uint_64 (Time_Span_Last);
Max_Neg_Time_Span : constant := Uint_64 (2 ** 63);
-- Absolute value of Time_Span_Last and Time_Span_First. Used in overflow
-- checks. Note that we avoid using abs on Time_Span_First everywhere.
-----------------------
-- Local subprograms --
-----------------------
function Mul_Div (V : LLI; M : Natural; D : Positive) return LLI;
-- Compute V * M / D where division rounds to the nearest integer, away
-- from zero if exactly halfway between. If the result would overflow then
-- Constraint_Error is raised.
function Rounded_Div (L, R : LLI) return LLI;
pragma Inline (Rounded_Div);
-- Return L / R rounded to the nearest integer, away from zero if exactly
-- halfway between; required to implement ARM D.8 (26). Assumes R > 0.
function To_Duration is
new Ada.Unchecked_Conversion (LLI, Duration);
function To_Integer is
new Ada.Unchecked_Conversion (Duration, LLI);
function To_Integer is
new Ada.Unchecked_Conversion (Time_Span, LLI);
---------------------
-- Local constants --
---------------------
Duration_Units : constant Positive := Positive (1.0 / Duration'Small);
-- Number of units of Duration in one second. The result is correct (not
-- rounded) as Duration'Small is 10.0**(-9).
---------
-- "*" --
---------
function "*" (Left : Time_Span; Right : Integer) return Time_Span is
Is_Negative : constant Boolean :=
(if Left > 0 then
Right < 0
elsif Left < 0
then Right > 0
else
False);
-- Sign of the result
Max_Value : constant Uint_64 :=
(if Is_Negative then
Max_Neg_Time_Span
else
Max_Pos_Time_Span);
-- Maximum absolute value that can be returned by the multiplication
-- taking into account the sign of the operators.
Abs_Left : constant Uint_64 :=
(if Left = Time_Span_First then
Max_Neg_Time_Span
else
Uint_64 (abs (Left)));
-- Remove sign of left operator
Abs_Right : constant Uint_64 := Uint_64 (abs (LLI (Right)));
-- Remove sign of right operator
begin
-- Overflow check is performed by hand assuming that Time_Span is a
-- 64-bit signed integer. Otherwise these checks would need an
-- intermediate type with more than 64-bit. The sign of the operators
-- is removed to simplify the intermediate computation of the overflow
-- check.
if Abs_Right /= 0 and then Max_Value / Abs_Right < Abs_Left then
raise Constraint_Error;
else
return Left * Time_Span (Right);
end if;
end "*";
function "*" (Left : Integer; Right : Time_Span) return Time_Span is
begin
return Right * Left;
end "*";
---------
-- "+" --
---------
function "+" (Left : Time; Right : Time_Span) return Time is
begin
-- Overflow checks are performed by hand assuming that Time and
-- Time_Span are 64-bit unsigned and signed integers respectively.
-- Otherwise these checks would need an intermediate type with more
-- than 64 bits.
if Right >= 0
and then Uint_64 (Time_Last) - Uint_64 (Left) >= Uint_64 (Right)
then
return Time (Uint_64 (Left) + Uint_64 (Right));
-- The case of Right = Time_Span'First needs to be treated differently
-- because the absolute value of -2 ** 63 is not within the range of
-- Time_Span.
elsif Right = Time_Span'First and then Left >= Max_Neg_Time_Span then
return Time (Uint_64 (Left) - Max_Neg_Time_Span);
elsif Right < 0 and then Right > Time_Span'First
and then Left >= Time (abs (Right))
then
return Time (Uint_64 (Left) - Uint_64 (abs (Right)));
else
raise Constraint_Error;
end if;
end "+";
function "+" (Left, Right : Time_Span) return Time_Span is
pragma Unsuppress (Overflow_Check);
begin
return Time_Span (LLI (Left) + LLI (Right));
end "+";
---------
-- "-" --
---------
function "-" (Left : Time; Right : Time_Span) return Time is
begin
-- Overflow checks must be performed by hand assuming that Time and
-- Time_Span are 64-bit unsigned and signed integers respectively.
-- Otherwise these checks would need an intermediate type with more
-- than 64-bit.
if Right >= 0 and then Left >= Time (Right) then
return Time (Uint_64 (Left) - Uint_64 (Right));
-- The case of Right = Time_Span'First needs to be treated differently
-- because the absolute value of -2 ** 63 is not within the range of
-- Time_Span.
elsif Right = Time_Span'First
and then Uint_64 (Time_Last) - Uint_64 (Left) >= Max_Neg_Time_Span
then
return Left + Time (Max_Neg_Time_Span);
elsif Right < 0 and then Right > Time_Span'First
and then Uint_64 (Time_Last) - Uint_64 (Left) >= Uint_64 (abs (Right))
then
return Left + Time (abs (Right));
else
raise Constraint_Error;
end if;
end "-";
function "-" (Left, Right : Time) return Time_Span is
begin
-- Overflow checks must be performed by hand assuming that Time and
-- Time_Span are 64-bit unsigned and signed integers respectively.
-- Otherwise these checks would need an intermediate type with more
-- than 64-bit.
if Left >= Right
and then Uint_64 (Left) - Uint_64 (Right) <= Max_Pos_Time_Span
then
return Time_Span (Uint_64 (Left) - Uint_64 (Right));
elsif Left < Right
and then Uint_64 (Right) - Uint_64 (Left) <= Max_Neg_Time_Span
then
return -1 - Time_Span (Uint_64 (Right) - Uint_64 (Left) - 1);
else
raise Constraint_Error;
end if;
end "-";
function "-" (Left, Right : Time_Span) return Time_Span is
pragma Unsuppress (Overflow_Check);
begin
return Time_Span (LLI (Left) - LLI (Right));
end "-";
function "-" (Right : Time_Span) return Time_Span is
pragma Unsuppress (Overflow_Check);
begin
return Time_Span (-LLI (Right));
end "-";
---------
-- "/" --
---------
function "/" (Left, Right : Time_Span) return Integer is
pragma Unsuppress (Overflow_Check);
pragma Unsuppress (Division_Check);
begin
return Integer (LLI (Left) / LLI (Right));
end "/";
function "/" (Left : Time_Span; Right : Integer) return Time_Span is
pragma Unsuppress (Overflow_Check);
pragma Unsuppress (Division_Check);
begin
return Left / Time_Span (Right);
end "/";
-----------
-- Clock --
-----------
function Clock return Time is
begin
return Time (System.Task_Primitives.Operations.Monotonic_Clock);
end Clock;
------------------
-- Microseconds --
------------------
function Microseconds (US : Integer) return Time_Span is
begin
-- Overflow can't happen (Ticks_Per_Second is Natural)
return
Time_Span (Rounded_Div (LLI (US) * LLI (OSI.Ticks_Per_Second), 1E6));
end Microseconds;
------------------
-- Milliseconds --
------------------
function Milliseconds (MS : Integer) return Time_Span is
begin
-- Overflow can't happen (Ticks_Per_Second is Natural)
return
Time_Span (Rounded_Div (LLI (MS) * LLI (OSI.Ticks_Per_Second), 1E3));
end Milliseconds;
-------------
-- Minutes --
-------------
function Minutes (M : Integer) return Time_Span is
Min_M : constant LLI := LLI'First / LLI (OSI.Ticks_Per_Second);
Max_M : constant LLI := LLI'Last / LLI (OSI.Ticks_Per_Second);
-- Bounds for Sec_M. Note that we can't use unsuppress overflow checks,
-- as this would require the use of arit64.
Sec_M : constant LLI := LLI (M) * 60;
-- M converted to seconds
begin
if Sec_M < Min_M or else Sec_M > Max_M then
raise Constraint_Error;
else
return Time_Span (Sec_M * LLI (OSI.Ticks_Per_Second));
end if;
end Minutes;
-------------
-- Mul_Div --
-------------
function Mul_Div (V : LLI; M : Natural; D : Positive) return LLI is
-- We first multiply V * M and then divide the result by D, while
-- avoiding overflow in intermediate calculations and detecting it in
-- the final result. To get the rounding to the nearest integer, away
-- from zero if exactly halfway between two values, we add +/- D/2
-- (depending on the sign on V) directly at the end of multiplication.
--
-- ----------------------------------------
-- Multiplication (and rounding adjustment)
-- ----------------------------------------
--
-- Since V is a signed 64-bit integer and M is signed (but non-negative)
-- 32-bit integer, their product may not fit in 64-bits. To avoid
-- overflow we split V and into high and low parts
--
-- V_Hi = V / 2 ** 32
-- V_Lo = V rem 2 ** 32
--
-- where each part is either zero or has the sign of the dividend; thus
--
-- V = V_Hi * 2 ** 32 + V_Lo
--
-- In either case V_Hi and V_Lo are in range of 32-bit signed integer,
-- yet stored in 64-bit signed variables. When multiplied by M, which is
-- in range of 0 .. 2 ** 31 - 1, the results will still fit in 64-bit
-- integer, even if we extend it by D/2 as required to implement
-- rounding. We will get the value of V * M ± D/2 as low and high part:
--
-- (V * M ± D/2)_Lo = (V_Lo * M ± D/2) with carry zeroed
-- (V * M ± D/2)_Hi = (V_Hi * M) with carry from (V_Lo * M ± D/2)
--
-- (carry flows only from low to high part), or mathematically speaking:
--
-- (V * M ± D/2)_Lo = (V * M ± D/2) rem 2 ** 32
-- (V * M ± D/2)_Hi = (V * M ± D/2) / 2 ** 32
--
-- and thus
--
-- V * M ± D/2 = (V * M ± D/2)_Hi * 2 ** 32 + (V * M ± D/2)_Lo
--
-- with signs just like described for V_Hi and V_Lo.
--
-- --------
-- Division
-- --------
--
-- The final result (V * M ± D/2) / D is computed as a high and low
-- parts:
--
-- ((V * M ± D/2) / D)_Hi = (V * M ± D/2)_Hi / D
-- ((V * M ± D/2) / D)_Lo =
-- ((V * M ± D/2)_Lo + remainder from high part division) / D
--
-- (remainder flows only from high to low part, opposite to carry),
-- or mathematically speaking:
--
-- ((V * M ± D/2) / D)_Hi = ((V * M ± D/2) / D) / 2 ** 32
-- ((V * M ± D/2) / D)_Lo = ((V * M ± D/2) / D) rem 2 ** 32
--
-- and thus
--
-- (V * M ± D/2) / D = ((V * M ± D/2) / D)_Hi * 2 ** 32
-- + ((V * M ± D/2) / D)_Lo
--
-- with signs just like described for V_Hi and V_Lo.
--
-- References: this calculation is partly inspired by Knuth's algorithm
-- in TAoCP Vol.2, section 4.3.1, excercise 16. However, here it is
-- adapted it for signed arithmetic; has no loop (since the input number
-- has fixed width); and discard the remainder of the result.
V_Hi : constant LLI := V / 2 ** 32;
V_Lo : constant LLI := V rem 2 ** 32;
-- High and low parts of V
V_M_Hi : LLI;
V_M_Lo : LLI;
-- High and low parts of V * M (+-) D / 2
Result_Hi : LLI;
-- High part of the result
Result_Lo : LLI;
-- Low part of the result
Remainder : LLI;
-- Remainder of the first division
begin
-- Multiply V * M and add/subtract D/2
V_M_Lo := V_Lo * LLI (M) + (if V >= 0 then 1 else -1) * LLI (D / 2);
V_M_Hi := V_Hi * LLI (M) + V_M_Lo / 2 ** 32;
V_M_Lo := V_M_Lo rem 2 ** 32;
-- First quotient
Result_Hi := V_M_Hi / LLI (D);
-- The final result would overflow
if Result_Hi not in -(2 ** 31) .. 2 ** 31 - 1 then
raise Constraint_Error;
end if;
Remainder := V_M_Hi rem LLI (D);
Result_Hi := Result_Hi * 2 ** 32;
-- Second quotient
Result_Lo := (V_M_Lo + Remainder * 2 ** 32) / LLI (D);
-- Combine low and high parts of the result
return Result_Hi + Result_Lo;
end Mul_Div;
-----------------
-- Nanoseconds --
-----------------
function Nanoseconds (NS : Integer) return Time_Span is
begin
-- Overflow can't happen (Ticks_Per_Second is Natural)
return
Time_Span (Rounded_Div (LLI (NS) * LLI (OSI.Ticks_Per_Second), 1E9));
end Nanoseconds;
-----------------
-- Rounded_Div --
-----------------
function Rounded_Div (L, R : LLI) return LLI is
Left : LLI;
begin
if L >= 0 then
Left := L + R / 2;
else
Left := L - R / 2;
end if;
return Left / R;
end Rounded_Div;
-------------
-- Seconds --
-------------
function Seconds (S : Integer) return Time_Span is
begin
-- Overflow can't happen (Ticks_Per_Second is Natural)
return Time_Span (LLI (S) * LLI (OSI.Ticks_Per_Second));
end Seconds;
-----------
-- Split --
-----------
procedure Split (T : Time; SC : out Seconds_Count; TS : out Time_Span) is
Res : constant Time := Time (OSI.Ticks_Per_Second);
begin
SC := Seconds_Count (T / Res);
TS := T - Time (SC) * Res;
end Split;
-------------
-- Time_Of --
-------------
function Time_Of (SC : Seconds_Count; TS : Time_Span) return Time is
Res : constant Time := Time (OSI.Ticks_Per_Second);
begin
-- We want to return SC * Resolution + TS. To avoid spurious overflows
-- in the intermediate result (SC * Resolution) we take advantage of the
-- different signs in SC and TS (when that is the case).
-- If signs of SC and TS are different then we avoid converting SC to
-- Time (as we do in the else part). The reason for that is that SC
-- converted to Time may overflow the range of Time, while the addition
-- of SC plus TS does not overflow (because of their different signs).
-- The approach is to first extract the number of seconds from TS, then
-- add the result to SC, and finally include the remainder from TS.
-- Note that SC is always nonnegative
if TS < 0 then
declare
Seconds_From_Ts : constant Seconds_Count :=
Seconds_Count (abs (TS / Time_Span (Res))) +
(if TS rem Time_Span (Res) = 0 then 0 else 1);
-- Absolute value of the number of seconds in TS. Round towards
-- infinity so that Remainder_Ts is always positive.
Remainder_Ts : constant Time :=
TS + Time_Span (Seconds_From_Ts - 1) * Time_Span (Res) + Res;
-- Remainder from TS that needs to be added to the result once
-- we removed the number of seconds. Note that we do not add
-- Time_Span (Seconds_From_Ts) * Time_Span (Res) directly with
-- a single operation because for values of TS close to
-- Time_Span_First this multiplication would overflow.
begin
-- Both operands in the inner subtraction are positive. Hence,
-- there will be no positive overflow in SC - Seconds_From_Ts. If
-- there is a negative overflow then the result of adding SC and
-- TS would overflow anyway.
if SC < Seconds_From_Ts
or else Time_Last / Res < Time (SC - Seconds_From_Ts)
then
raise Constraint_Error;
else
return Time (SC - Seconds_From_Ts) * Res + Remainder_Ts;
end if;
end;
-- SC and TS are nonnegative. Check whether Time (SC) * Res overflows
elsif Time_Last / Res < Time (SC) then
raise Constraint_Error;
-- Both operands have the same sign, so we can convert SC into Time
-- right away; if this conversion overflows then the result of adding SC
-- and TS would overflow anyway (so we would just be detecting the
-- overflow a bit earlier).
else
return Time (SC) * Res + TS;
end if;
end Time_Of;
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : Time_Span) return Duration is
begin
return
To_Duration
(Mul_Div (To_Integer (TS), Duration_Units, OSI.Ticks_Per_Second));
end To_Duration;
------------------
-- To_Time_Span --
------------------
function To_Time_Span (D : Duration) return Time_Span is
begin
return
Time_Span
(Mul_Div (To_Integer (D), OSI.Ticks_Per_Second, Duration_Units));
end To_Time_Span;
begin
-- Ensure that the tasking run time is initialized when using clock and/or
-- delay operations. The initialization routine has the required machinery
-- to prevent multiple calls to Initialize.
System.Tasking.Initialize;
end Ada.Real_Time;
|
--------------------------------------------------------
-- E n c o d i n g s --
-- --
-- Tools for convertion strings between Unicode and --
-- national/vendor character sets. --
-- - - - - - - - - - --
-- Read copyright and license at the end of this file --
--------------------------------------------------------
with Encodings.Maps;
package Encodings.Read is
type Mapping
(Start : Character;
Ranges_Count : Maps.Range_Count;
Char_Count : Maps.Backward_Index)
is
record
Forward : Maps.Forward_Map (Start .. Character'Last);
Ranges : Maps.Wide_Ranges (1 .. Ranges_Count);
Backward : Maps.Backward_Map (1 .. Char_Count);
end record;
function Table (File_Name : String) return Mapping;
end Encodings.Read;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
with System;
package Init1 is
type R1 is record
I : Integer;
end record;
for R1'Bit_Order use System.Low_Order_First;
for R1'Scalar_Storage_Order use System.Low_Order_First;
for R1 use record
I at 0 range 0 .. 31;
end record;
type R2 is record
I : Integer;
end record;
for R2'Bit_Order use System.High_Order_First;
for R2'Scalar_Storage_Order use System.High_Order_First;
for R2 use record
I at 0 range 0 .. 31;
end record;
My_R1 : constant R1 := (I => 16#12345678#);
My_R2 : constant R2 := (I => 16#12345678#);
end Init1;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ W I D E _ T E X T _ I O . G E N E R I C _ A U X --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains a set of auxiliary routines used by Wide_Wide_Text_IO
-- generic children, including for reading and writing numeric strings.
-- Note: although this is the Wide version of the package, the interface here
-- is still in terms of Character and String rather than Wide_Wide_Character
-- and Wide_Wide_String, since all numeric strings are composed entirely of
-- characters in the range of type Standard.Character, and the basic
-- conversion routines work with Character rather than Wide_Wide_Character.
package Ada.Wide_Wide_Text_IO.Generic_Aux is
-- Note: for all the Load routines, File indicates the file to be read,
-- Buf is the string into which data is stored, Ptr is the index of the
-- last character stored so far, and is updated if additional characters
-- are stored. Data_Error is raised if the input overflows Buf. The only
-- Load routines that do a file status check are Load_Skip and Load_Width
-- so one of these two routines must be called first.
procedure Check_End_Of_Field
(Buf : String;
Stop : Integer;
Ptr : Integer;
Width : Field);
-- This routine is used after doing a get operations on a numeric value.
-- Buf is the string being scanned, and Stop is the last character of
-- the field being scanned. Ptr is as set by the call to the scan routine
-- that scanned out the numeric value, i.e. it points one past the last
-- character scanned, and Width is the width parameter from the Get call.
--
-- There are two cases, if Width is non-zero, then a check is made that
-- the remainder of the field is all blanks. If Width is zero, then it
-- means that the scan routine scanned out only part of the field. We
-- have already scanned out the field that the ACVC tests seem to expect
-- us to read (even if it does not follow the syntax of the type being
-- scanned, e.g. allowing negative exponents in integers, and underscores
-- at the end of the string), so we just raise Data_Error.
procedure Check_On_One_Line (File : File_Type; Length : Integer);
-- Check to see if item of length Integer characters can fit on
-- current line. Call New_Line if not, first checking that the
-- line length can accommodate Length characters, raise Layout_Error
-- if item is too large for a single line.
function Is_Blank (C : Character) return Boolean;
-- Determines if C is a blank (space or tab)
procedure Load_Width
(File : File_Type;
Width : Field;
Buf : out String;
Ptr : in out Integer);
-- Loads exactly Width characters, unless a line mark is encountered first
procedure Load_Skip (File : File_Type);
-- Skips leading blanks and line and page marks, if the end of file is
-- read without finding a non-blank character, then End_Error is raised.
-- Note: a blank is defined as a space or horizontal tab (RM A.10.6(5)).
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character;
Loaded : out Boolean);
-- If next character is Char, loads it, otherwise no characters are loaded
-- Loaded is set to indicate whether or not the character was found.
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char : Character);
-- Same as above, but no indication if character is loaded
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character;
Loaded : out Boolean);
-- If next character is Char1 or Char2, loads it, otherwise no characters
-- are loaded. Loaded is set to indicate whether or not one of the two
-- characters was found.
procedure Load
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Char1 : Character;
Char2 : Character);
-- Same as above, but no indication if character is loaded
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean);
-- Loads a sequence of zero or more decimal digits. Loaded is set if
-- at least one digit is loaded.
procedure Load_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer);
-- Same as above, but no indication if character is loaded
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer;
Loaded : out Boolean);
-- Like Load_Digits, but also allows extended digits a-f and A-F
procedure Load_Extended_Digits
(File : File_Type;
Buf : out String;
Ptr : in out Integer);
-- Same as above, but no indication if character is loaded
procedure Put_Item (File : File_Type; Str : String);
-- This routine is like Wide_Wide_Text_IO.Put, except that it checks for
-- overflow of bounded lines, as described in (RM A.10.6(8)). It is used
-- for all output of numeric values and of enumeration values. Note that
-- the buffer is of type String. Put_Item deals with converting this to
-- Wide_Wide_Characters as required.
procedure Store_Char
(File : File_Type;
ch : Integer;
Buf : out String;
Ptr : in out Integer);
-- Store a single character in buffer, checking for overflow and
-- adjusting the column number in the file to reflect the fact
-- that a character has been acquired from the input stream.
-- The pos value of the character to store is in ch on entry.
procedure String_Skip (Str : String; Ptr : out Integer);
-- Used in the Get from string procedures to skip leading blanks in the
-- string. Ptr is set to the index of the first non-blank. If the string
-- is all blanks, then the excption End_Error is raised, Note that blank
-- is defined as a space or horizontal tab (RM A.10.6(5)).
procedure Ungetc (ch : Integer; File : File_Type);
-- Pushes back character into stream, using ungetc. The caller has
-- checked that the file is in read status. Device_Error is raised
-- if the character cannot be pushed back. An attempt to push back
-- an end of file (EOF) is ignored.
private
pragma Inline (Is_Blank);
end Ada.Wide_Wide_Text_IO.Generic_Aux;
|
------------------------------------------------------------------------------
-- --
-- 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.Generic_Collections;
package AMF.OCL.Unlimited_Natural_Exps.Collections is
pragma Preelaborate;
package OCL_Unlimited_Natural_Exp_Collections is
new AMF.Generic_Collections
(OCL_Unlimited_Natural_Exp,
OCL_Unlimited_Natural_Exp_Access);
type Set_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Set with null record;
type Ordered_Set_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Ordered_Set with null record;
type Bag_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Bag with null record;
type Sequence_Of_OCL_Unlimited_Natural_Exp is
new OCL_Unlimited_Natural_Exp_Collections.Sequence with null record;
end AMF.OCL.Unlimited_Natural_Exps.Collections;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2018, 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. --
-- --
------------------------------------------------------------------------------
with STM32_SVD.CAN; use STM32_SVD.CAN;
with STM32.Device;
package body STM32.CAN is
use Ada.Real_Time;
---------------
-- Reset_CAN --
---------------
procedure Reset_CAN
(This : in out CAN_Controller)
is
begin
This.MCR.RESET := True;
end Reset_CAN;
-------------------
-- Set_Init_Mode --
-------------------
procedure Set_Init_Mode
(This : in out CAN_Controller;
Enabled : in Boolean)
is
Deadline : constant Time := Clock + Default_Timeout;
Success : Boolean;
begin
This.MCR.INRQ := Enabled;
while Clock < Deadline loop
if Enabled then
Success := Is_Init_Mode (This);
else
Success := not Is_Init_Mode (This);
end if;
exit when Success;
end loop;
end Set_Init_Mode;
---------------------
-- Enter_Init_Mode --
---------------------
procedure Enter_Init_Mode
(This : in out CAN_Controller)
is
begin
Set_Init_Mode (This, True);
end Enter_Init_Mode;
------------------
-- Is_Init_Mode --
------------------
function Is_Init_Mode (This : CAN_Controller) return Boolean is
(This.MSR.INAK);
--------------------
-- Exit_Init_Mode --
--------------------
procedure Exit_Init_Mode
(This : in out CAN_Controller)
is
begin
Set_Init_Mode (This, False);
end Exit_Init_Mode;
--------------------
-- Set_Sleep_Mode --
--------------------
procedure Set_Sleep_Mode
(This : in out CAN_Controller;
Enabled : in Boolean)
is
Deadline : constant Time := Clock + Default_Timeout;
Success : Boolean;
begin
This.MCR.SLEEP := Enabled;
while Clock < Deadline loop
if Enabled then
Success := Is_Sleep_Mode (This);
else
Success := not Is_Sleep_Mode (This);
end if;
exit when Success;
end loop;
end Set_Sleep_Mode;
-----------
-- Sleep --
-----------
procedure Sleep
(This : in out CAN_Controller)
is
begin
Exit_Init_Mode (This);
Set_Sleep_Mode (This, True);
end Sleep;
-------------------
-- Is_Sleep_Mode --
-------------------
function Is_Sleep_Mode (This : CAN_Controller) return Boolean is
(This.MSR.SLAK);
------------
-- Wakeup --
------------
procedure Wakeup
(This : in out CAN_Controller)
is
begin
Set_Sleep_Mode (This, False);
end Wakeup;
--------------------------
-- Calculate_Bit_Timing --
--------------------------
procedure Calculate_Bit_Timing
(Speed : in Bit_Rate_Range;
Sample_Point : in Sample_Point_Range;
Tolerance : in Clock_Tolerance;
Bit_Timing : in out Bit_Timing_Config)
is
-- The CAN clock frequency comes from APB1 peripheral clock (PCLK1).
Clock_In : constant Float := Float (STM32.Device.System_Clock_Frequencies.PCLK1);
-- Time Quanta in one Bit Time
Time_Quanta : Float;
-- Found Bit Time Quanta value.
BTQ : Boolean := False;
begin
-- Assure the clock frequency is high enough.
pragma Assert
(Integer (Clock_In / (Speed * 1_000.0 *
Float (Time_Quanta_Prescaler'First))) < Bit_Time_Quanta'First,
"CAN clock frequency too low for this bit rate.");
-- Assure the clock frequency is low enough.
pragma Assert
(Integer (Clock_In / (Speed * 1_000.0 *
Float (Time_Quanta_Prescaler'Last))) > Bit_Time_Quanta'Last,
"CAN clock frequency too high for this bit rate.");
for I in Time_Quanta_Prescaler'First .. Time_Quanta_Prescaler'Last loop
-- Choose the minimum divisor for the maximum number of Time Quanta.
Time_Quanta := Clock_In / (Speed * 1000.0 * Float (I));
-- Test if Time_Quanta < Bit_Time_Quanta'First
if Integer (Time_Quanta) < Bit_Time_Quanta'First then
exit;
-- Test if Time Quanta <= Bit_Time_Quanta'Last and if
-- Sample Point <= Segment_Sync_Quanta + Segment_1_Quanta'Last
elsif Integer (Time_Quanta) <= Bit_Time_Quanta'Last and
Integer (Time_Quanta * Sample_Point / 100.0) <=
(Segment_Sync_Quanta + Segment_1_Quanta'Last)
then
-- Calculate time segments
Bit_Timing.Time_Segment_1 :=
Integer (Time_Quanta * Sample_Point / 100.0) - Segment_Sync_Quanta;
-- Casting a float to integer rounds it to the near integer.
Bit_Timing.Time_Segment_2 :=
Integer (Time_Quanta) - Segment_Sync_Quanta - Bit_Timing.Time_Segment_1;
if Bit_Timing.Time_Segment_2 < 4 then
Bit_Timing.Resynch_Jump_Width := Bit_Timing.Time_Segment_2;
else
Bit_Timing.Resynch_Jump_Width := 4;
end if;
-- We want a division that gives tolerance inside tolerance range.
if Tolerance >= abs (Clock_In - Float ((Segment_Sync_Quanta +
Bit_Timing.Time_Segment_1 + Bit_Timing.Time_Segment_2) * I) *
Speed * 1000.0) * 100.0 / Clock_In and
Tolerance <= Float (Bit_Timing.Time_Segment_2) /
Float (2 * (13 * Integer (Time_Quanta))) and
Tolerance <= Float (Bit_Timing.Resynch_Jump_Width) /
Float (20 * Integer (Time_Quanta))
then
Bit_Timing.Quanta_Prescaler := I;
BTQ := True;
exit;
end if;
end if;
end loop;
pragma Assert
(not BTQ, "Can't find a division factor for this bit rate within tolerance.");
end Calculate_Bit_Timing;
--------------------------
-- Configure_Bit_Timing --
--------------------------
procedure Configure_Bit_Timing
(This : in out CAN_Controller;
Timing_Config : in Bit_Timing_Config)
is
begin
This.BTR :=
(BRP => UInt10 (Timing_Config.Quanta_Prescaler - 1),
Reserved_10_15 => 0,
TS1 => UInt4 (Timing_Config.Time_Segment_1 - 1),
TS2 => UInt3 (Timing_Config.Time_Segment_2 - 1),
Reserved_23_23 => 0,
SJW => UInt2 (Timing_Config.Resynch_Jump_Width - 1),
Reserved_26_29 => 0,
LBKM => This.BTR.LBKM,
SILM => This.BTR.SILM);
end Configure_Bit_Timing;
------------------------
-- Set_Operating_Mode --
------------------------
procedure Set_Operating_Mode
(This : in out CAN_Controller;
Mode : in Operating_Mode)
is
begin
case Mode is
when Normal =>
This.BTR.LBKM := False;
This.BTR.SILM := False;
when Loopback =>
This.BTR.LBKM := True;
This.BTR.SILM := False;
when Silent =>
This.BTR.LBKM := False;
This.BTR.SILM := True;
when Silent_Loopback =>
This.BTR.LBKM := True;
This.BTR.SILM := True;
end case;
end Set_Operating_Mode;
---------------
-- Configure --
---------------
procedure Configure
(This : in out CAN_Controller;
Mode : in Operating_Mode;
Time_Triggered : in Boolean;
Auto_Bus_Off : in Boolean;
Auto_Wakeup : in Boolean;
Auto_Retransmission : in Boolean;
Rx_FIFO_Locked : in Boolean;
Tx_FIFO_Prio : in Boolean;
Timing_Config : in Bit_Timing_Config)
is
begin
Wakeup (This);
Enter_Init_Mode (This);
This.MCR.TTCM := Time_Triggered;
This.MCR.ABOM := Auto_Bus_Off;
This.MCR.AWUM := Auto_Wakeup;
This.MCR.NART := not Auto_Retransmission;
This.MCR.RFLM := Rx_FIFO_Locked;
This.MCR.TXFP := Tx_FIFO_Prio;
Configure_Bit_Timing (This, Timing_Config);
Set_Operating_Mode (This, Mode);
Exit_Init_Mode (This);
end Configure;
-- The following registers are referred from CAN1 only:
-- FMR, FM1R, FS1R, FFA1R, FA1R
-- FxR1 (x=0..27)
-- FxR2 (x=0..27)
-- (I.e. filter registers)
CAN1 : CAN_Peripheral renames CAN_Periph;
---------------
-- Write_FxR --
---------------
procedure Write_FxR
(X : in Filter_Bank_Nr;
FxR1 : in UInt32;
FxR2 : in UInt32)
is
begin
case X is
when 0 => CAN1.F0R1.Val := FxR1; CAN1.F0R2.Val := FxR2;
when 1 => CAN1.F1R1.Val := FxR1; CAN1.F1R2.Val := FxR2;
when 2 => CAN1.F2R1.Val := FxR1; CAN1.F2R2.Val := FxR2;
when 3 => CAN1.F3R1.Val := FxR1; CAN1.F3R2.Val := FxR2;
when 4 => CAN1.F4R1.Val := FxR1; CAN1.F4R2.Val := FxR2;
when 5 => CAN1.F5R1.Val := FxR1; CAN1.F5R2.Val := FxR2;
when 6 => CAN1.F6R1.Val := FxR1; CAN1.F6R2.Val := FxR2;
when 7 => CAN1.F7R1.Val := FxR1; CAN1.F7R2.Val := FxR2;
when 8 => CAN1.F8R1.Val := FxR1; CAN1.F8R2.Val := FxR2;
when 9 => CAN1.F9R1.Val := FxR1; CAN1.F9R2.Val := FxR2;
when 10 => CAN1.F10R1.Val := FxR1; CAN1.F10R2.Val := FxR2;
when 11 => CAN1.F11R1.Val := FxR1; CAN1.F11R2.Val := FxR2;
when 12 => CAN1.F12R1.Val := FxR1; CAN1.F12R2.Val := FxR2;
when 13 => CAN1.F13R1.Val := FxR1; CAN1.F13R2.Val := FxR2;
end case;
end Write_FxR;
----------------------------
-- Enter_Filter_Init_Mode --
----------------------------
procedure Enter_Filter_Init_Mode
is
begin
CAN1.FMR.FINIT := True;
end Enter_Filter_Init_Mode;
-------------------------
-- Is_Filter_Init_Mode --
-------------------------
function Is_Filter_Init_Mode return Boolean is
(CAN1.FMR.FINIT);
---------------------------
-- Exit_Filter_Init_Mode --
---------------------------
procedure Exit_Filter_Init_Mode
is
begin
CAN1.FMR.FINIT := False;
end Exit_Filter_Init_Mode;
---------------------------
-- Set_Filter_Activation --
---------------------------
procedure Set_Filter_Activation
(Bank_Nr : in Filter_Bank_Nr;
Enabled : in Boolean)
is
begin
CAN1.FA1R.FACT.Arr (Bank_Nr) := Enabled;
end Set_Filter_Activation;
----------------------
-- Set_Filter_Scale --
----------------------
procedure Set_Filter_Scale
(Bank_Nr : in Filter_Bank_Nr;
Mode : in Mode_Scale)
is
begin
case Mode is
when List16 | Mask16 =>
CAN1.FS1R.FSC.Arr (Bank_Nr) := False;
when List32 | Mask32 =>
CAN1.FS1R.FSC.Arr (Bank_Nr) := True;
end case;
end Set_Filter_Scale;
---------------------
-- Set_Filter_Mode --
---------------------
procedure Set_Filter_Mode
(Bank_Nr : in Filter_Bank_Nr;
Mode : in Mode_Scale)
is
begin
case Mode is
when List16 | List32 =>
CAN1.FM1R.FBM.Arr (Bank_Nr) := True;
when Mask16 | Mask32 =>
CAN1.FM1R.FBM.Arr (Bank_Nr) := False;
end case;
end Set_Filter_Mode;
-------------------------
-- Set_Fifo_Assignment --
-------------------------
procedure Set_Fifo_Assignment
(Bank_Nr : in Filter_Bank_Nr;
Fifo : in Fifo_Nr)
is
begin
case Fifo is
when FIFO_0 =>
CAN1.FFA1R.FFA.Arr (Bank_Nr) := False;
when FIFO_1 =>
CAN1.FFA1R.FFA.Arr (Bank_Nr) := True;
end case;
end Set_Fifo_Assignment;
----------------------
-- Configure_Filter --
----------------------
procedure Configure_Filter
(This : in out CAN_Controller;
Bank_Config : in CAN_Filter_Bank)
is
pragma Unreferenced (This);
Nr : constant Filter_Bank_Nr := Bank_Config.Bank_Nr;
Reg_Repr : Filter_Reg_Union;
begin
Enter_Filter_Init_Mode;
Set_Filter_Activation (Nr, False);
case Bank_Config.Filters.Mode is
when List32 =>
Reg_Repr := (False, (List32, Bank_Config.Filters.List32));
when Mask32 =>
Reg_Repr := (False, (Mask32, Bank_Config.Filters.Mask32));
when List16 =>
Reg_Repr := (False, (List16, Bank_Config.Filters.List16));
when Mask16 =>
Reg_Repr := (False, (Mask16, Bank_Config.Filters.Mask16));
end case;
Set_Filter_Scale (Nr, Bank_Config.Filters.Mode);
Write_FxR (Nr, Reg_Repr.FxR1, Reg_Repr.FxR2);
Set_Filter_Mode (Nr, Bank_Config.Filters.Mode);
Set_Fifo_Assignment (Nr, Bank_Config.Fifo_Assignment);
Set_Filter_Activation (Nr, True);
Exit_Filter_Init_Mode;
end Configure_Filter;
--------------------------
-- Set_Slave_Start_Bank --
--------------------------
procedure Set_Slave_Start_Bank
(Bank_Nr : in Filter_Bank_Nr)
is
begin
CAN1.FMR.CAN2SB := UInt6 (Bank_Nr);
end Set_Slave_Start_Bank;
--------------------------
-- Get_Slave_Start_Bank --
--------------------------
function Get_Slave_Start_Bank return Filter_Bank_Nr is
(Filter_Bank_Nr (CAN1.FMR.CAN2SB));
------------------
-- Release_Fifo --
------------------
procedure Release_Fifo
(This : in out CAN_Controller;
Fifo : in Fifo_Nr)
is
begin
case Fifo is
when FIFO_0 =>
This.RF0R.RFOM0 := True;
when FIFO_1 =>
This.RF1R.RFOM1 := True;
end case;
end Release_Fifo;
---------------------
-- Read_Rx_Message --
---------------------
function Read_Rx_Message
(This : CAN_Controller;
Fifo : Fifo_Nr)
return CAN_Message
is
begin
case Fifo is
when FIFO_0 =>
return CAN_Message'
(Std_ID => This.RI0R.STID,
Ext_ID => This.RI0R.EXID,
Ide => This.RI0R.IDE,
Rtr => This.RI0R.RTR,
Dlc => This.RDT0R.DLC,
Data => Message_Data (This.RDL0R.Arr) &
Message_Data (This.RDH0R.Arr));
when FIFO_1 =>
return CAN_Message'
(Std_ID => This.RI1R.STID,
Ext_ID => This.RI1R.EXID,
Ide => This.RI1R.IDE,
Rtr => This.RI1R.RTR,
Dlc => This.RDT1R.DLC,
Data => Message_Data (This.RDL1R.Arr) &
Message_Data (This.RDH1R.Arr));
end case;
end Read_Rx_Message;
---------------------
-- Nof_Msg_In_Fifo --
---------------------
function Nof_Msg_In_Fifo
(This : CAN_Controller;
Fifo : Fifo_Nr)
return UInt2
is
begin
case Fifo is
when FIFO_0 =>
return This.RF0R.FMP0;
when FIFO_1 =>
return This.RF1R.FMP1;
end case;
end Nof_Msg_In_Fifo;
---------------------
-- Receive_Message --
---------------------
procedure Receive_Message
(This : in out CAN_Controller;
Fifo : in Fifo_Nr;
Message : out CAN_Message;
Success : out Boolean;
Timeout : in Time_Span := Default_Timeout)
is
Deadline : constant Time := Clock + Timeout;
begin
loop
Success := Clock < Deadline;
exit when not Success or Nof_Msg_In_Fifo (This, Fifo) > 0;
end loop;
if Success then
Message := Read_Rx_Message (This, Fifo);
Release_Fifo (This, Fifo);
end if;
end Receive_Message;
--------------
-- Is_Empty --
--------------
function Is_Empty
(This : CAN_Controller;
Mailbox : Mailbox_Type)
return Boolean
is
begin
return This.TSR.TME.Arr (Mailbox_Type'Pos (Mailbox));
end Is_Empty;
-----------------------
-- Get_Empty_Mailbox --
-----------------------
procedure Get_Empty_Mailbox
(This : in out CAN_Controller;
Mailbox : out Mailbox_Type;
Empty_Found : out Boolean)
is
begin
for Mbx in Mailbox_Type'Range loop
Empty_Found := Is_Empty (This, Mbx);
Mailbox := Mbx;
exit when Empty_Found;
end loop;
end Get_Empty_Mailbox;
--------------------------
-- Transmission_Request --
--------------------------
procedure Transmission_Request
(This : in out CAN_Controller;
Mailbox : in Mailbox_Type)
is
begin
case Mailbox is
when Mailbox_0 =>
This.TI0R.TXRQ := True;
when Mailbox_1 =>
This.TI1R.TXRQ := True;
when Mailbox_2 =>
This.TI2R.TXRQ := True;
end case;
end Transmission_Request;
-----------------------
-- Request_Completed --
-----------------------
function Request_Completed
(This : CAN_Controller;
Mailbox : Mailbox_Type)
return Boolean
is
begin
case Mailbox is
when Mailbox_0 =>
return This.TSR.RQCP0;
when Mailbox_1 =>
return This.TSR.RQCP1;
when Mailbox_2 =>
return This.TSR.RQCP2;
end case;
end Request_Completed;
---------------------
-- Transmission_OK --
---------------------
function Transmission_OK
(This : CAN_Controller;
Mailbox : Mailbox_Type)
return Boolean
is
begin
case Mailbox is
when Mailbox_0 =>
return This.TSR.TXOK0;
when Mailbox_1 =>
return This.TSR.TXOK1;
when Mailbox_2 =>
return This.TSR.TXOK2;
end case;
end Transmission_OK;
----------------------------
-- Transmission_Completed --
----------------------------
function Transmission_Completed
(This : CAN_Controller;
Mailbox : Mailbox_Type)
return Boolean
is
begin
return Is_Empty (This, Mailbox) and then
Request_Completed (This, Mailbox);
end Transmission_Completed;
-----------------------------
-- Transmission_Successful --
-----------------------------
function Transmission_Successful
(This : CAN_Controller;
Mailbox : Mailbox_Type)
return Boolean
is
begin
return Transmission_Completed (This, Mailbox) and then
Transmission_OK (This, Mailbox);
end Transmission_Successful;
----------------------
-- Write_Tx_Message --
----------------------
procedure Write_Tx_Message
(This : in out CAN_Controller;
Message : in CAN_Message;
Mailbox : in Mailbox_Type)
is
begin
case Mailbox is
when Mailbox_0 =>
This.TI0R := (TXRQ => False,
RTR => Message.Rtr,
IDE => Message.Ide,
EXID => Message.Ext_ID,
STID => Message.Std_ID);
This.TDT0R.DLC := Message.Dlc;
This.TDL0R.Arr := TDL0R_DATA_Field_Array (Message.Data (0 .. 3));
This.TDH0R.Arr := TDH0R_DATA_Field_Array (Message.Data (4 .. 7));
when Mailbox_1 =>
This.TI1R := (TXRQ => False,
RTR => Message.Rtr,
IDE => Message.Ide,
EXID => Message.Ext_ID,
STID => Message.Std_ID);
This.TDT1R.DLC := Message.Dlc;
This.TDL1R.Arr := TDL1R_DATA_Field_Array (Message.Data (0 .. 3));
This.TDH1R.Arr := TDH1R_DATA_Field_Array (Message.Data (4 .. 7));
when Mailbox_2 =>
This.TI2R := (TXRQ => False,
RTR => Message.Rtr,
IDE => Message.Ide,
EXID => Message.Ext_ID,
STID => Message.Std_ID);
This.TDT2R.DLC := Message.Dlc;
This.TDL2R.Arr := TDL2R_DATA_Field_Array (Message.Data (0 .. 3));
This.TDH2R.Arr := TDH2R_DATA_Field_Array (Message.Data (4 .. 7));
end case;
end Write_Tx_Message;
----------------------
-- Transmit_Message --
----------------------
procedure Transmit_Message
(This : in out CAN_Controller;
Message : in CAN_Message;
Success : out Boolean;
Timeout : in Time_Span := Default_Timeout)
is
Mailbox : Mailbox_Type;
Deadline : constant Time := Clock + Timeout;
begin
Get_Empty_Mailbox (This, Mailbox, Success);
if Success then
Write_Tx_Message (This, Message, Mailbox);
Transmission_Request (This, Mailbox);
while not Transmission_Successful (This, Mailbox) and Success loop
Success := Clock < Deadline;
end loop;
end if;
end Transmit_Message;
----------------
-- Is_Overrun --
----------------
function Is_Overrun
(This : CAN_Controller;
Fifo : Fifo_Nr)
return Boolean
is
begin
case Fifo is
when FIFO_0 =>
return This.RF0R.FOVR0;
when FIFO_1 =>
return This.RF1R.FOVR1;
end case;
end Is_Overrun;
-------------
-- Is_Full --
-------------
function Is_Full
(This : CAN_Controller;
Fifo : Fifo_Nr)
return Boolean
is
begin
case Fifo is
when FIFO_0 =>
return This.RF0R.FULL0;
when FIFO_1 =>
return This.RF1R.FULL1;
end case;
end Is_Full;
-----------------------
-- Interrupt_Enabled --
-----------------------
function Interrupt_Enabled
(This : CAN_Controller;
Source : CAN_Interrupt)
return Boolean
is
begin
case Source is
when Transmit_Mailbox_Empty =>
return This.IER.TMEIE;
when FIFO_0_Message_Pending =>
return This.IER.FMPIE0;
when FIFO_1_Message_Pending =>
return This.IER.FMPIE1;
when FIFO_0_Full =>
return This.IER.FFIE0;
when FIFO_1_Full =>
return This.IER.FFIE1;
when FIFO_0_Overrun =>
return This.IER.FOVIE0;
when FIFO_1_Overrun =>
return This.IER.FOVIE1;
when Error =>
return This.IER.ERRIE;
when Last_Error_Code =>
return This.IER.LECIE;
when Bus_Off =>
return This.IER.BOFIE;
when Error_Passive =>
return This.IER.EPVIE;
when Error_Warning =>
return This.IER.EWGIE;
when Sleep_Acknowledge =>
return This.IER.SLKIE;
when Wakeup =>
return This.IER.WKUIE;
end case;
end Interrupt_Enabled;
-----------------------
-- Enable_Interrupts --
-----------------------
procedure Enable_Interrupts
(This : in out CAN_Controller;
Source : CAN_Interrupt)
is
begin
case Source is
when Transmit_Mailbox_Empty =>
This.IER.TMEIE := True;
when FIFO_0_Message_Pending =>
This.IER.FMPIE0 := True;
when FIFO_1_Message_Pending =>
This.IER.FMPIE1 := True;
when FIFO_0_Full =>
This.IER.FFIE0 := True;
when FIFO_1_Full =>
This.IER.FFIE1 := True;
when FIFO_0_Overrun =>
This.IER.FOVIE0 := True;
when FIFO_1_Overrun =>
This.IER.FOVIE1 := True;
when Error =>
This.IER.ERRIE := True;
when Last_Error_Code =>
This.IER.LECIE := True;
when Bus_Off =>
This.IER.BOFIE := True;
when Error_Passive =>
This.IER.EPVIE := True;
when Error_Warning =>
This.IER.EWGIE := True;
when Sleep_Acknowledge =>
This.IER.SLKIE := True;
when Wakeup =>
This.IER.WKUIE := True;
end case;
end Enable_Interrupts;
------------------------
-- Disable_Interrupts --
------------------------
procedure Disable_Interrupts
(This : in out CAN_Controller;
Source : CAN_Interrupt)
is
begin
case Source is
when Transmit_Mailbox_Empty =>
This.IER.TMEIE := False;
when FIFO_0_Message_Pending =>
This.IER.FMPIE0 := False;
when FIFO_1_Message_Pending =>
This.IER.FMPIE1 := False;
when FIFO_0_Full =>
This.IER.FFIE0 := False;
when FIFO_1_Full =>
This.IER.FFIE1 := False;
when FIFO_0_Overrun =>
This.IER.FOVIE0 := False;
when FIFO_1_Overrun =>
This.IER.FOVIE1 := False;
when Error =>
This.IER.ERRIE := False;
when Last_Error_Code =>
This.IER.LECIE := False;
when Bus_Off =>
This.IER.BOFIE := False;
when Error_Passive =>
This.IER.EPVIE := False;
when Error_Warning =>
This.IER.EWGIE := False;
when Sleep_Acknowledge =>
This.IER.SLKIE := False;
when Wakeup =>
This.IER.WKUIE := False;
end case;
end Disable_Interrupts;
end STM32.CAN;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.